#include <bayeux/mygsl/permutation.h>
◆ permutation() [1/3]
mygsl::permutation::permutation |
( |
| ) |
|
◆ permutation() [2/3]
mygsl::permutation::permutation |
( |
size_t |
sz_ | ) |
|
◆ permutation() [3/3]
mygsl::permutation::permutation |
( |
const permutation & |
p_ | ) |
|
◆ ~permutation()
virtual mygsl::permutation::~permutation |
( |
| ) |
|
|
virtual |
◆ canonical_cycles()
size_t mygsl::permutation::canonical_cycles |
( |
| ) |
const |
◆ canonical_to_linear()
bool mygsl::permutation::canonical_to_linear |
( |
permutation & |
p_ | ) |
|
◆ data()
const size_t* mygsl::permutation::data |
( |
| ) |
const |
◆ get()
size_t mygsl::permutation::get |
( |
size_t |
i_ | ) |
const |
◆ init()
void mygsl::permutation::init |
( |
size_t |
sz_ | ) |
|
◆ inverse()
◆ inversions()
size_t mygsl::permutation::inversions |
( |
| ) |
const |
◆ is_initialized()
bool mygsl::permutation::is_initialized |
( |
| ) |
const |
◆ is_valid()
bool mygsl::permutation::is_valid |
( |
| ) |
const |
◆ linear_cycles()
size_t mygsl::permutation::linear_cycles |
( |
| ) |
const |
◆ linear_to_canonical()
bool mygsl::permutation::linear_to_canonical |
( |
permutation & |
p_ | ) |
|
◆ next()
bool mygsl::permutation::next |
( |
| ) |
|
◆ operator++()
◆ operator--()
◆ operator=()
◆ previous()
bool mygsl::permutation::previous |
( |
| ) |
|
◆ print()
void mygsl::permutation::print |
( |
std::ostream & |
out_, |
|
|
bool |
eol_ = false |
|
) |
| const |
◆ reset()
void mygsl::permutation::reset |
( |
| ) |
|
◆ reverse()
void mygsl::permutation::reverse |
( |
| ) |
|
◆ size()
size_t mygsl::permutation::size |
( |
| ) |
const |
◆ swap()
void mygsl::permutation::swap |
( |
size_t |
i_, |
|
|
size_t |
j_ |
|
) |
| |
◆ operator<<
std::ostream& operator<< |
( |
std::ostream & |
out_, |
|
|
const permutation & |
p_ |
|
) |
| |
|
friend |
◆ operator>>
std::istream& operator>> |
( |
std::istream & |
in_, |
|
|
permutation & |
p_ |
|
) |
| |
|
friend |
The documentation for this class was generated from the following file: