mirror of
https://git.postgresql.org/git/postgresql.git
synced 2024-08-27 01:47:19 +02:00
It's all very well to claim that a simplistic sort is fast in easy cases, but O(N^2) in the worst case is not good ... especially if the worst case is as easy to hit as "descending order input". Replace that bit with our standard qsort. Per bug #12866 from Maksym Boguk. Back-patch to all active branches. |
||
---|---|---|
.. | ||
bench | ||
data | ||
expected | ||
sql | ||
_int_bool.c | ||
_int_gin.c | ||
_int_gist.c | ||
_int_op.c | ||
_int_tool.c | ||
_int.h | ||
_intbig_gist.c | ||
.gitignore | ||
intarray--1.0.sql | ||
intarray--unpackaged--1.0.sql | ||
intarray.control | ||
Makefile |