mo_orderpack::uniinv Interface Reference

Merge-sort ranking, with removal of duplicate entries (reversed). More...

Public Member Functions
subroutine	d_uniinv (xdont, igoest)
subroutine	r_uniinv (xdont, igoest)
subroutine	i_uniinv (xdont, igoest)

Detailed Description

Merge-sort ranking, with removal of duplicate entries (reversed).

Inverse ranking of an array, with removal of duplicate entries. The routine is similar to pure merge-sort ranking, but on the last pass, it sets indices in IGOEST to the rank of the original value in an ordered set with duplicates removed. For performance reasons, the first 2 passes are taken out of the standard loop, and use dedicated coding.

Parameters

[in]	integer(i4)/real(sp,dp), dimension(:) :: XVALT	Array to be ranked.
[out]	integer(i4), dimension(:) :: IGOEST	Index of rank.

Definition at line 611 of file mo_orderpack.f90.

Member Function/Subroutine Documentation

d_uniinv()

subroutine mo_orderpack::uniinv::d_uniinv	(	real(kind = dp), dimension (:), intent(in)	xdont,
		integer(kind = i4), dimension (:), intent(out)	igoest
	)

Definition at line 10949 of file mo_orderpack.f90.

i_uniinv()

subroutine mo_orderpack::uniinv::i_uniinv	(	integer(kind = i4), dimension (:), intent(in)	xdont,
		integer(kind = i4), dimension (:), intent(out)	igoest
	)

Definition at line 11443 of file mo_orderpack.f90.

r_uniinv()

subroutine mo_orderpack::uniinv::r_uniinv	(	real(kind = sp), dimension (:), intent(in)	xdont,
		integer(kind = i4), dimension (:), intent(out)	igoest
	)

Definition at line 11196 of file mo_orderpack.f90.

---

The documentation for this interface was generated from the following file:

• src/mo_orderpack.f90