#include <setutils.h>
Public Types | |
| typedef std::vector< unsigned long > | Base |
Public Member Functions | |
| Permutation () | |
| Permutation (unsigned long n) | |
| Permutation (unsigned long n, int unsused) | |
| Permutation (const Permutation &pi, int unused) | |
| template<typename I> | |
| Permutation (I b, I e) | |
| template<typename T> | |
| std::vector< T > | pull_back (const std::vector< T > &v) const |
| template<typename U> | |
| std::vector< U > | renumber (const std::vector< U > &v) const |
| template<typename U> | |
| std::vector< U > | renumber (const std::vector< U > &v, U except) const |
| template<typename T> | |
| void | permute (std::vector< T > &v) const |
|
|
Definition at line 31 of file setutils.h. |
|
|
Definition at line 32 of file setutils.h. |
|
|
Definition at line 33 of file setutils.h. |
|
||||||||||||
|
Definition at line 26 of file setutils.cpp. |
|
||||||||||||
|
Definition at line 32 of file setutils.cpp. |
|
||||||||||||||||
|
Definition at line 36 of file setutils.h. |
|
||||||||||
|
Applies our permutation |pi| to the vector |v|. In other words, we send each entry v[i] to the new position v[pi[i]]; this means that afterwards for all |i|: |new_v[pi[i]]==old_v[i]|, or equivalently $new_v[i]=old_v[pi^{-1}[i]]$. Note that this is {not} the same notion of permutation of entries used in the methods above, nor in the |permute| methods of matrices and bitsets; with respect to those we use the inverse permutation We are able to perform this permutation essentially in-place, using an auxiliary vector<bool>. Definition at line 79 of file setutils_def.h. |
|
||||||||||
|
Definition at line 28 of file setutils_def.h. Referenced by atlas::kgb::KGBHelp::export_tables(). |
|
||||||||||||||||
|
Definition at line 57 of file setutils_def.h. |
|
||||||||||
|
Definition at line 43 of file setutils_def.h. Referenced by atlas::kgb::KGBHelp::export_tables(). |
1.3.9.1