mirror of
https://github.com/zebrajr/postgres.git
synced 2025-12-06 12:20:15 +01:00
53d3daa491
There is at least one report in the field of storing millions of integers in arrays, so it seems like a good time to specialize intarray's qsort function. In doing so, streamline the comparators: Previously there were three, two for each direction for sorting and one passed to qunique_arg. To preserve the early exit in the case of descending input, pass the direction as an argument to the comparator. This requires giving up duplicate detection, which previously allowed skipping the qunique_arg() call. Testing showed no regressions this way. In passing, get rid of nearby checks that the input has at least two elements, since preserving them would make some macros less readable. These are not necessary for correctness, and seem like premature optimizations. Author: Andrey M. Borodin <x4mmm@yandex-team.ru> Discussion: https://postgr.es/m/098A3E67-E4A6-4086-9C66-B1EAEB1DFE1C@yandex-team.ru |
||
|---|---|---|
| .. | ||
| bench | ||
| data | ||
| expected | ||
| sql | ||
| _int_bool.c | ||
| _int_gin.c | ||
| _int_gist.c | ||
| _int_op.c | ||
| _int_selfuncs.c | ||
| _int_tool.c | ||
| _int.h | ||
| _intbig_gist.c | ||
| .gitignore | ||
| intarray--1.1--1.2.sql | ||
| intarray--1.2--1.3.sql | ||
| intarray--1.2.sql | ||
| intarray--1.3--1.4.sql | ||
| intarray--1.4--1.5.sql | ||
| intarray--1.0--1.1.sql | ||
| intarray.control | ||
| Makefile | ||
| meson.build | ||