aboutsummaryrefslogtreecommitdiff
path: root/src/backend/commands/cluster.c
diff options
context:
space:
mode:
authorBruce Momjian <bruce@momjian.us>2002-08-10 20:38:29 +0000
committerBruce Momjian <bruce@momjian.us>2002-08-10 20:38:29 +0000
commit181ca96e7a730ba35e973d3361422e6d8a460f88 (patch)
treed1c23e9f2b371b3a942baddb73e71378e6b9a160 /src/backend/commands/cluster.c
parentc5354dff2052e6922ae7add998753d9bafcd19b0 (diff)
downloadpostgresql-181ca96e7a730ba35e973d3361422e6d8a460f88.tar.gz
postgresql-181ca96e7a730ba35e973d3361422e6d8a460f88.zip
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
Diffstat (limited to 'src/backend/commands/cluster.c')
0 files changed, 0 insertions, 0 deletions