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[]) - 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




	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
Tue, 6 Aug 2002 21:14:37 +0300 (GMT)
Oleg Bartunov <oleg@sai.msu.su>
apply patch for contrib/intarray  (CVS)

Your patch has been added to the PostgreSQL unapplied patches list at:

	http://candle.pha.pa.us/cgi-bin/pgpatches

I will try to apply it within the next 48 hours.

---------------------------------------------------------------------------


Oleg Bartunov wrote:
> 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[]) - 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
> 
> 
> 
> 
> 	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

Content-Description: 

[ Attachment, skipping... ]

> 
> ---------------------------(end of broadcast)---------------------------
> TIP 4: Don't 'kill -9' the postmaster

-- 
  Bruce Momjian                        |  http://candle.pha.pa.us
  pgman@candle.pha.pa.us               |  (610) 853-3000
  +  If your life is a hard drive,     |  830 Blythe Avenue
  +  Christ can be your backup.        |  Drexel Hill, Pennsylvania 19026

Tue, 6 Aug 2002 21:29:18 -0400 (EDT)
Bruce Momjian <pgman@candle.pha.pa.us>
Re: apply patch for contrib/intarray  (CVS)

Patch applied.  Thanks.

---------------------------------------------------------------------------



Oleg Bartunov wrote:
> 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[]) - 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
> 
> 
> 
> 
> 	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

Content-Description: 

[ Attachment, skipping... ]

> 
> ---------------------------(end of broadcast)---------------------------
> TIP 4: Don't 'kill -9' the postmaster

-- 
  Bruce Momjian                        |  http://candle.pha.pa.us
  pgman@candle.pha.pa.us               |  (610) 359-1001
  +  If your life is a hard drive,     |  13 Roberts Road
  +  Christ can be your backup.        |  Newtown Square, Pennsylvania 19073

Sat, 10 Aug 2002 16:38:41 -0400 (EDT)
Bruce Momjian <pgman@candle.pha.pa.us>
Re: apply patch for contrib/intarray  (CVS)