Lapack-style permutation. More...

#include <matrix-permutation.h>

Public Member Functions
_UnsignedInt	getSize () const
MatrixPermutation< _UnsignedInt > &	Convert (MatrixPermutation< _UnsignedInt > &P)
	Converts a `BlasPermutation` to a `MatrixPermutation`.
_UnsignedInt	operator[] (const _UnsignedInt i) const
	$M \gets P M$
const _UnsignedInt *	getPointer () const
	col `i` and col `j` are swapped
void	Compress ()
	compresses BlasPermutation to a smaller `r_`.
std::ostream &	write (std::ostream &o, bool Lapack=true) const
	writes on output stream `o`
Friends
template<class _Uint >
std::ostream &	operator<< (std::ostream &o, BlasPerm &P)
	writes `P` on output stream `o`

Detailed Description

template<class _UnsignedInt>
class LinBox::BlasPermutation< _UnsignedInt >

Lapack-style permutation.

A Lapack permutation is represented with a vector $[p_1,p_2,\cdots, p_r]$ such that $p_i > i$ . Converting it to a classic representation of a permutation corresponds to taking an identity permutation and then successively permuting $(i,p_i)$ . Example : if P=[1,4,4] and V=[1,2,3,4,5], then P.V=[1,4,2,3,5].