1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
|
---
:name: dlamrg
:md5sum: 482180fad6debeccfe564bd4a552d6d5
:category: :subroutine
:arguments:
- n1:
:type: integer
:intent: input
- n2:
:type: integer
:intent: input
- a:
:type: doublereal
:intent: input
:dims:
- n1+n2
- dtrd1:
:type: integer
:intent: input
- dtrd2:
:type: integer
:intent: input
- index:
:type: integer
:intent: output
:dims:
- n1+n2
:substitutions: {}
:fortran_help: " SUBROUTINE DLAMRG( N1, N2, A, DTRD1, DTRD2, INDEX )\n\n\
* Purpose\n\
* =======\n\
*\n\
* DLAMRG will create a permutation list which will merge the elements\n\
* of A (which is composed of two independently sorted sets) into a\n\
* single set which is sorted in ascending order.\n\
*\n\n\
* Arguments\n\
* =========\n\
*\n\
* N1 (input) INTEGER\n\
* N2 (input) INTEGER\n\
* These arguments contain the respective lengths of the two\n\
* sorted lists to be merged.\n\
*\n\
* A (input) DOUBLE PRECISION array, dimension (N1+N2)\n\
* The first N1 elements of A contain a list of numbers which\n\
* are sorted in either ascending or descending order. Likewise\n\
* for the final N2 elements.\n\
*\n\
* DTRD1 (input) INTEGER\n\
* DTRD2 (input) INTEGER\n\
* These are the strides to be taken through the array A.\n\
* Allowable strides are 1 and -1. They indicate whether a\n\
* subset of A is sorted in ascending (DTRDx = 1) or descending\n\
* (DTRDx = -1) order.\n\
*\n\
* INDEX (output) INTEGER array, dimension (N1+N2)\n\
* On exit this array will contain a permutation such that\n\
* if B( I ) = A( INDEX( I ) ) for I=1,N1+N2, then B will be\n\
* sorted in ascending order.\n\
*\n\n\
* =====================================================================\n\
*\n\
* .. Local Scalars ..\n INTEGER I, IND1, IND2, N1SV, N2SV\n\
* ..\n"
|
