public interface lamrg
LAMRG 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.
Subroutines
Arguments
| Type |
Intent | Optional | Attributes |
|
Name |
|
|
integer(kind=ilp),
|
intent(in) |
|
|
:: |
n1 |
|
|
integer(kind=ilp),
|
intent(in) |
|
|
:: |
n2 |
|
|
real(kind=dp),
|
intent(in) |
|
|
:: |
a(*) |
|
|
integer(kind=ilp),
|
intent(in) |
|
|
:: |
dtrd1 |
|
|
integer(kind=ilp),
|
intent(in) |
|
|
:: |
dtrd2 |
|
|
integer(kind=ilp),
|
intent(out) |
|
|
:: |
index(*) |
|
Arguments
| Type |
Intent | Optional | Attributes |
|
Name |
|
|
integer(kind=ilp),
|
intent(in) |
|
|
:: |
n1 |
|
|
integer(kind=ilp),
|
intent(in) |
|
|
:: |
n2 |
|
|
real(kind=sp),
|
intent(in) |
|
|
:: |
a(*) |
|
|
integer(kind=ilp),
|
intent(in) |
|
|
:: |
strd1 |
|
|
integer(kind=ilp),
|
intent(in) |
|
|
:: |
strd2 |
|
|
integer(kind=ilp),
|
intent(out) |
|
|
:: |
index(*) |
|
Module Procedures