·  Home
+   man pages
 -> Linux -> FreeBSD -> OpenBSD -> NetBSD -> Tru64 Unix -> HP-UX 11i -> IRIX
·  Linux HOWTOs
·  FreeBSD Tips
·  *niX Forums

man pages->IRIX man pages -> complib/dlamrg (3)
 Title
 Content
 Arch
 Section All Sections 1 - General Commands 2 - System Calls 3 - Subroutines 4 - Special Files 5 - File Formats 6 - Games 7 - Macros and Conventions 8 - Maintenance Commands 9 - Kernel Interface n - New Commands

### Contents

```
DLAMRG(3F)							    DLAMRG(3F)

```

### NAME[Toc][Back]

```     DLAMRG - 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	DLAMRG(	N1, N2,	A, DTRD1, DTRD2, INDEX )

INTEGER	DTRD1, DTRD2, N1, N2

INTEGER	INDEX( * )

DOUBLE		PRECISION A( * )
```

### PURPOSE[Toc][Back]

```     DLAMRG 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) DOUBLE PRECISION 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.

DTRD1  (input) INTEGER
DTRD2  (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 (DTRDx	= 1) or
descending (DTRDx =	-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.
DLAMRG(3F)							    DLAMRG(3F)

```

### NAME[Toc][Back]

```     DLAMRG - 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	DLAMRG(	N1, N2,	A, DTRD1, DTRD2, INDEX )

INTEGER	DTRD1, DTRD2, N1, N2

INTEGER	INDEX( * )

DOUBLE		PRECISION A( * )
```

### PURPOSE[Toc][Back]

```     DLAMRG 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) DOUBLE PRECISION 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.

DTRD1  (input) INTEGER
DTRD2  (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 (DTRDx	= 1) or
descending (DTRDx =	-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.

PPPPaaaaggggeeee 1111```
[ 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