BlasPermutation< _UnsignedInt > Class Template Reference

Lapack-style permutation. More...

#include <permutation-matrix.h>

Public Member Functions
BlasPermutation< _UnsignedInt > &	operator= (const BlasPermutation< _UnsignedInt > &P)
	copy operator (with copy)
_UnsignedInt	getSize () const
	Returns the size of the permuation.
_UnsignedInt	getOrder () const
	Returns the order of the permuation.
std::vector< _UnsignedInt >	getStorage () const
	returns a copy of the raw storage.
MatrixPermutation< _UnsignedInt > &	Convert (MatrixPermutation< _UnsignedInt > &P)
	Converts a BlasPermutation to a MatrixPermutation.
void	Transpose ()
	‍/ template<class Matrix> Matrix & applyRows(Matrix &M); /! *‍/ template<class Matrix> Matrix & applyCols(Matrix &M);
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 such that . Converting it to a classic representation of a permutation corresponds to taking an identity permutation and then successively permuting . Example : if P=[1,4,4] and V=[1,2,3,4,5], then P.V=[1,4,2,3,5].

Examples

examples/omp_block_rank.C.

Member Function Documentation

getSize()

template<class _Uint >

_Uint getSize

(

)

const

Returns the size of the permuation.

If given, we return n as we see P in . We default to the order of the permutation (minimal such n)

Warning

potentially catastrophic

Convert()

template<class _UnsignedInt >

MatrixPermutation< _Uint > & Convert

(

MatrixPermutation< _UnsignedInt > &

P

)

Converts a BlasPermutation to a MatrixPermutation.

Parameters

[out]

P

MatrixPermutation to be created. Need not be initialized.

Transpose()

template<class _Uint >

void Transpose

(

)

‍/ template<class Matrix> Matrix & applyRows(Matrix &M); /! *‍/ template<class Matrix> Matrix & applyCols(Matrix &M);

/*! ‍/ template<class Matrix> Matrix & applyTransposeRows(Matrix &M); /! *‍/ template<class Matrix> Matrix & applyTransposeCols(Matrix &M);

_UnsignedInt & operator[] (const _UnsignedInt &i) ; _UnsignedInt operator[] (const _UnsignedInt i) const ;

/*! col i and col j are swapped ‍/ void TransposeCols(_UnsignedInt i, _UnsignedInt j);

/*! row i and row j are swapped ‍/ void TransposeRows(_UnsignedInt i, _UnsignedInt j);

    const _UnsignedInt* getPointer() const
    {
        linbox_check(P_.size());
        return &P_[0];
    }

    _UnsignedInt* getPointer()
    {
        linbox_check(P_.size());
        return &P_[0];
    }

    /*  invert 

---

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

• permutation-matrix.h
• permutation-matrix.inl