- 22 10月, 2004 1 次提交
-
-
由 Tom Lane 提交于
getting rid of numerous ad-hoc versions that have popped up in various places. Shortens code and avoids conflict with Windows min() and max() macros.
-
- 29 8月, 2004 1 次提交
-
-
由 Bruce Momjian 提交于
-
- 30 3月, 2004 1 次提交
-
-
由 Teodor Sigaev 提交于
boxes. Change interface to user-defined GiST support methods union and picksplit. Now instead of bytea struct it used special GistEntryVector structure.
-
- 25 7月, 2003 1 次提交
-
-
由 Tom Lane 提交于
-
- 12 6月, 2003 1 次提交
-
-
由 Bruce Momjian 提交于
1 intarray: bugfix for int[]-int[] operation 2 intarray: split _int.c to several files (_int.c now is unused) 3 ntarray (gist__intbig_ops opclass): use special type for index storage 4 ltree (gist__ltree_ops opclass), intarray (gist__intbig_ops): optimize GiST's penalty and picksplit interface functions, now use Hemming distance. Teodor Sigaev
-
- 19 2月, 2003 1 次提交
-
-
由 Bruce Momjian 提交于
ltree_73.patch.gz - for 7.3 : Fix ~ operation bug: eg '1.1.1' ~ '*.1' ltree_74.patch.gz - for current CVS Fix ~ operation bug: eg '1.1.1' ~ '*.1' Add ? operation Optimize index storage Last change needs drop/create all ltree indexes, so only for 7.4 Teodor Sigaev
-
- 05 9月, 2002 1 次提交
-
-
由 Bruce Momjian 提交于
-
- 27 8月, 2002 1 次提交
-
-
由 Tom Lane 提交于
array header, and to compute sizing and alignment of array elements the same way normal tuple access operations do --- viz, using the tupmacs.h macros att_addlength and att_align. This makes the world safe for arrays of cstrings or intervals, and should make it much easier to write array-type-polymorphic functions; as examples see the cleanups of array_out and contrib/array_iterator. By Joe Conway and Tom Lane.
-
- 11 8月, 2002 1 次提交
-
-
由 Bruce Momjian 提交于
contrib/tsearch and contrib/ltree :) Teodor Sigaev
-
- 31 7月, 2002 1 次提交
-
-
由 Bruce Momjian 提交于
-