From 181ca96e7a730ba35e973d3361422e6d8a460f88 Mon Sep 17 00:00:00 2001 From: Bruce Momjian Date: Sat, 10 Aug 2002 20:38:29 +0000 Subject: 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 --- contrib/intarray/README.intarray | 34 +++++++++++++++++++++++++++++++++- 1 file changed, 33 insertions(+), 1 deletion(-) (limited to 'contrib/intarray/README.intarray') diff --git a/contrib/intarray/README.intarray b/contrib/intarray/README.intarray index f0138a14842..bac191e65d3 100644 --- a/contrib/intarray/README.intarray +++ b/contrib/intarray/README.intarray @@ -8,10 +8,42 @@ signature with length of 4096 bits to represent sets). All work was done by Teodor Sigaev (teodor@stack.net) and Oleg Bartunov (oleg@sai.msu.su). See http://www.sai.msu.su/~megera/postgres/gist -for additional information. +for additional information. Andrey Oktyabrski has done a great work on +adding new functions and 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 CHANGES: +August 6, 2002 + 1. Reworked patch from Andrey Oktyabrski (ano@spider.ru) with + functions: icount, sort, sort_asc, uniq, idx, subarray + operations: #, +, -, |, & October 1, 2001 1. Change search method in array to binary September 28, 2001 -- cgit v1.2.3