Tom Lane 40b0c10b76 Replace insertion sort in contrib/intarray with qsort(). ... 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.		2015-03-15 23:22:03 -04:00
..
bench
data
expected	Fix longstanding error in contrib/intarray's int[] & int[] operator.	2012-02-16 20:00:23 -05:00
sql	Fix longstanding error in contrib/intarray's int[] & int[] operator.	2012-02-16 20:00:23 -05:00
_int_bool.c	Add missing #include.	2014-03-14 11:46:59 -04:00
_int_gin.c
_int_gist.c	Remove tabs after spaces in C comments	2014-05-06 11:26:25 -04:00
_int_op.c
_int_tool.c	Replace insertion sort in contrib/intarray with qsort().	2015-03-15 23:22:03 -04:00
_int.h	Predict integer overflow to avoid buffer overruns.	2014-02-17 09:33:38 -05:00
_int.sql.in
_intbig_gist.c
.gitignore	Some more gitignore cleanups: cover contrib and PL regression test outputs.	2010-09-22 17:22:53 -04:00
Makefile
uninstall__int.sql