12 Commits (ef524d17751cbb0b373f47f1c45f7fc07c4786f0)

Author	SHA1	Message	Date
Teodor Sigaev	8c73dfcc8b	Optimize benchmark query and update benchmark's results.	20 years ago
Teodor Sigaev	5e95311442	Add intset() to README	21 years ago
Bruce Momjian	1868b0be44	Small fix in documentation and some examples of usage. Please, apply to ... 7.3 and current CVS Oleg Bartunov	23 years ago
Bruce Momjian	e654065f11	This is small README fix for contrib/intarray. Thank you. ... Teodor Sigaev	23 years ago
Bruce Momjian	181ca96e7a	August 6, 2002 ... 1. Reworked patch from Andrey Oktyabrski (ano@spider.ru) with functions: icount, sort, sort_asc, uniq, idx, subarray operations: #, +, -, |, & FUNCTIONS: int icount(int[]) - the number of elements in intarray int[] sort(int[], 'asc' | 'desc') - sort intarray int[] sort(int[]) - sort in ascending order int[] sort_asc(int[]),sort_desc(int[]) - shortcuts for sort int[] uniq(int[]) - returns unique elements int idx(int[], int item) - returns index of first intarray matching element to item, or '0' if matching failed. int[] subarray(int[],int START [, int LEN]) - returns part of intarray starting from element number START (from 1) and length LEN. OPERATIONS: int[] && int[] - overlap - returns TRUE if arrays has at least one common elements. int[] @ int[] - contains - returns TRUE if left array contains right array int[] ~ int[] - contained - returns TRUE if left array is contained in right array # int[] - return the number of elements in array int[] + int - push element to array ( add to end of array) int[] + int[] - merge of arrays (right array added to the end of left one) int[] - int - remove entries matched by right argument from array int[] - int[] - remove left array from right int[] | int - returns intarray - union of arguments int[] | int[] - returns intarray as a union of two arrays int[] & int[] - returns intersection of arrays Oleg Bartunov	23 years ago
Bruce Momjian	7ff432c9ad	1. Implemented binary search in array ... Oleg Bartunov	24 years ago
Tom Lane	14b0da2ac3	Changes: ... 1. gist__int_ops is now without lossy 2. added sort entry in picksplit Oleg Bartunov	24 years ago
Bruce Momjian	484a0fa454	please apply attached patch to current CVS. ... Changes: 1. Added support for boolean queries (indexable operator @@, looks like a @@ '1|(2&3)' 2. Some code cleanup and optimization Regards, Oleg	24 years ago
Tom Lane	f933766ba7	Restructure pg_opclass, pg_amop, and pg_amproc per previous discussions in ... pgsql-hackers. pg_opclass now has a row for each opclass supported by each index AM, not a row for each opclass name. This allows pg_opclass to show directly whether an AM supports an opclass, and furthermore makes it possible to store additional information about an opclass that might be AM-dependent. pg_opclass and pg_amop now store "lossy" and "haskeytype" information that we previously expected the user to remember to provide in CREATE INDEX commands. Lossiness is no longer an index-level property, but is associated with the use of a particular operator in a particular index opclass. Along the way, IndexSupportInitialize now uses the syscaches to retrieve pg_amop and pg_amproc entries. I find this reduces backend launch time by about ten percent, at the cost of a couple more special cases in catcache.c's IndexScanOK. Initial work by Oleg Bartunov and Teodor Sigaev, further hacking by Tom Lane. initdb forced.	24 years ago
Tom Lane	2ef6e7ee18	Repair intarray's problems with TOASTed input, avoid scribbling on ... source data, improve split algorithm for intbig_ops. Oleg Bartunov with some kibitzing from Tom Lane.	25 years ago
Bruce Momjian	4bcb80a3e3	Update contrib intarray to Jan 25 version.	25 years ago
Marc G. Fournier	1db943b3ca	commit Oleg and Teodor's RD-tree implementation ... this provides the ...	25 years ago