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.
More...
|
pure subroutine | dlamrg (n1, n2, a, dtrd1, dtrd2, index) |
|
| la_dlamrg |
|
| la_qlamrg |
|
pure subroutine | slamrg (n1, n2, a, strd1, strd2, index) |
|
| la_slamrg |
|
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.
◆ dlamrg()
pure subroutine la_lapack::lamrg::dlamrg |
( |
integer(ilp), intent(in) |
n1, |
|
|
integer(ilp), intent(in) |
n2, |
|
|
real(dp), dimension(*), intent(in) |
a, |
|
|
integer(ilp), intent(in) |
dtrd1, |
|
|
integer(ilp), intent(in) |
dtrd2, |
|
|
integer(ilp), dimension(*), intent(out) |
index |
|
) |
| |
◆ la_dlamrg()
la_lapack::lamrg::la_dlamrg |
◆ la_qlamrg()
la_lapack::lamrg::la_qlamrg |
◆ la_slamrg()
la_lapack::lamrg::la_slamrg |
◆ slamrg()
pure subroutine la_lapack::lamrg::slamrg |
( |
integer(ilp), intent(in) |
n1, |
|
|
integer(ilp), intent(in) |
n2, |
|
|
real(sp), dimension(*), intent(in) |
a, |
|
|
integer(ilp), intent(in) |
strd1, |
|
|
integer(ilp), intent(in) |
strd2, |
|
|
integer(ilp), dimension(*), intent(out) |
index |
|
) |
| |
The documentation for this interface was generated from the following file: