Permutation Class Template Reference
[linbox/blackbox]

size is n. More...

#include <permutation.h>

Inheritance diagram for Permutation:

List of all members.

Public Member Functions
	Permutation (Storage &indices, const Field &F=Field())
	Permutation (int n, const Field &F=Field())
template<class OutVector , class InVector >
OutVector &	apply (OutVector &y, const InVector &x) const
	y Px#.
template<class OutVector , class InVector >
OutVector &	applyTranspose (OutVector &y, const InVector &x) const
	y^T x^T P#.
void	permute (size_t row1, size_t row2)

---

Detailed Description

template<class _Field, class Storage = std::vector< long >>
class LinBox::Permutation< _Field, Storage >

size is n.

Parameters:

Storage

LinBox} dense or sparse vector of field elements

---

Constructor & Destructor Documentation

Permutation	(	Storage &	indices,
		const Field &	F = Field()
	)			[inline]

Constructor from a vector of indices This constructor creates a permutation matrix based on a vector of indices

Parameters:

indices

Vector of indices representing the permutation

Permutation	(	int	n,
		const Field &	F = Field()
	)			[inline]

Constructor from a dimension This constructor creates an n x n permutation matrix, initialized to be the identity

Parameters:

n

The dimension of hte matrix to create

---

Member Function Documentation

void permute	(	size_t	row1,
		size_t	row2
	)			[inline]

Add a transposition to the matrix

---

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

• /build/buildd/linbox-1.1.6~rc0/linbox/blackbox/permutation.h