*nix Documentation Project
·  Home
 +   man pages
·  Linux HOWTOs
·  FreeBSD Tips
·  *niX Forums

  man pages->IRIX man pages -> complib/slamrg (3)              
Title
Content
Arch
Section
 

Contents


SLAMRG(3F)							    SLAMRG(3F)


NAME    [Toc]    [Back]

     SLAMRG - will create a permutation	list which will	merge the elements of
     A (which is composed of two independently sorted sets) into a single set
     which is sorted in	ascending order

SYNOPSIS    [Toc]    [Back]

     SUBROUTINE	SLAMRG(	N1, N2,	A, STRD1, STRD2, INDEX )

	 INTEGER	N1, N2,	STRD1, STRD2

	 INTEGER	INDEX( * )

	 REAL		A( * )

PURPOSE    [Toc]    [Back]

     SLAMRG will create	a permutation list which will merge the	elements of A
     (which is composed	of two independently sorted sets) into a single	set
     which is sorted in	ascending order.

ARGUMENTS    [Toc]    [Back]

     N1	    (input) INTEGER
	    N2	   (input) INTEGER These arguements contain the	respective
	    lengths of the two sorted lists to be merged.

     A	    (input) REAL array,	dimension (N1+N2)
	    The	first N1 elements of A contain a list of numbers which are
	    sorted in either ascending or descending order.  Likewise for the
	    final N2 elements.

     STRD1  (input) INTEGER
	    STRD2  (input) INTEGER These are the strides to be taken through
	    the	array A.  Allowable strides are	1 and -1.  They	indicate
	    whether a subset of	A is sorted in ascending (STRDx	= 1) or
	    descending (STRDx =	-1) order.

     INDEX  (output) INTEGER array, dimension (N1+N2)
	    On exit this array will contain a permutation such that if B( I )
	    = A( INDEX(	I ) ) for I=1,N1+N2, then B will be sorted in
	    ascending order.
SLAMRG(3F)							    SLAMRG(3F)


NAME    [Toc]    [Back]

     SLAMRG - will create a permutation	list which will	merge the elements of
     A (which is composed of two independently sorted sets) into a single set
     which is sorted in	ascending order

SYNOPSIS    [Toc]    [Back]

     SUBROUTINE	SLAMRG(	N1, N2,	A, STRD1, STRD2, INDEX )

	 INTEGER	N1, N2,	STRD1, STRD2

	 INTEGER	INDEX( * )

	 REAL		A( * )

PURPOSE    [Toc]    [Back]

     SLAMRG will create	a permutation list which will merge the	elements of A
     (which is composed	of two independently sorted sets) into a single	set
     which is sorted in	ascending order.

ARGUMENTS    [Toc]    [Back]

     N1	    (input) INTEGER
	    N2	   (input) INTEGER These arguements contain the	respective
	    lengths of the two sorted lists to be merged.

     A	    (input) REAL array,	dimension (N1+N2)
	    The	first N1 elements of A contain a list of numbers which are
	    sorted in either ascending or descending order.  Likewise for the
	    final N2 elements.

     STRD1  (input) INTEGER
	    STRD2  (input) INTEGER These are the strides to be taken through
	    the	array A.  Allowable strides are	1 and -1.  They	indicate
	    whether a subset of	A is sorted in ascending (STRDx	= 1) or
	    descending (STRDx =	-1) order.

     INDEX  (output) INTEGER array, dimension (N1+N2)
	    On exit this array will contain a permutation such that if B( I )
	    = A( INDEX(	I ) ) for I=1,N1+N2, then B will be sorted in
	    ascending order.


									PPPPaaaaggggeeee 1111
[ Back ]
 Similar pages
Name OS Title
lsort IRIX Sort the elements of a list
join IRIX Create a string by joining together list elements
sort IRIX sort and/or merge files
sort HP-UX sort or merge files
sort OpenBSD sort or merge text files
lreplace IRIX Replace elements in a list with new elements
XmListReplaceItemsPos IRIX A List function that replaces the specified elements in the list
XmListReplaceItemsPos Tru64 A List function that replaces the specified elements in the list
XmListReplaceItems Tru64 A List function that replaces the specified elements in the list
XmListReplaceItemsPos HP-UX A List function that replaces the specified elements in the list
Copyright © 2004-2005 DeniX Solutions SRL
newsletter delivery service