apply patch for contrib/intarray (CVS)

Please, apply patch for contrib/intarray (current CVS)

Changes:

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[]) -
returnsunique 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 -
returnsTRUE if left array contains right array int[] ~ int[]   - contained - returns TRUE if left array is contained in
rightarray # int[]         - return the number of elements in array int[] + int     - push element to array ( add to
endof array) int[] + int[]   - merge of arrays (right array added to the end of left one) int[] - int     - remove
entriesmatched 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
intersectionof arrays
 



Regards,    Oleg
_____________________________________________________________
Oleg Bartunov, sci.researcher, hostmaster of AstroNet,
Sternberg Astronomical Institute, Moscow University (Russia)
Internet: oleg@sai.msu.su, http://www.sai.msu.su/~megera/
phone: +007(095)939-16-83, +007(095)939-23-83