Sorts rows in the sparse pattern. More...

Collaboration diagram for mat_sort:

Detailed Description

Sorts rows in the sparse pattern.

Sorts the sparse matrix such that the row index is always increasing for each column. This will generally allow faster access patterns.

Note An integer error is return which should be zero if no errors occurs.

If the err value is non-zero the following table may be used:

Member Function/Subroutine Documentation

subroutine sort_	(	class(ism_csc), intent(inout)	this,
		integer(ii_), intent(out)	err,
		integer(ii_), dimension(:), intent(out), optional, target	pvt
	)

private

Parameters

[in]	this	sparse pattern to sort (in-place)
[out]	err	associated error message of the sparsity pattern
[out]	pvt	optional= if requested the pivoting array for the sorted sparsity pattern

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