|
SPH
|
Permutation, i.e. (discrete) invertible function int->int. More...
#include <Order.h>
Public Member Functions | |
| Order ()=default | |
| Order (Order &&other) | |
| Order (const Size n) | |
| Construct identity of given size. More... | |
| Order & | operator= (Order &&other) |
| template<typename TBinaryPredicate > | |
| void | shuffle (TBinaryPredicate &&predicate) |
| Shuffles the order using a binary predicate. More... | |
| Order | getInverted () const |
| Returns the inverted order. More... | |
| Order | clone () const |
| Clones the order. More... | |
| Order | compose (const Order &other) const |
| Composes two orders. More... | |
| template<typename T > | |
| Array< T > | apply (const Array< T > &input) |
| Shuffles given array using this order. More... | |
| INLINE Size | operator[] (const Size idx) const |
| INLINE Size | size () const |
| INLINE bool | operator== (const Order &other) const |
Public Member Functions inherited from Noncopyable | |
| Noncopyable ()=default | |
| Noncopyable (const Noncopyable &)=delete | |
| Noncopyable (Noncopyable &&)=default | |
| Noncopyable & | operator= (const Noncopyable &)=delete |
| Noncopyable & | operator= (Noncopyable &&)=default |
Permutation, i.e. (discrete) invertible function int->int.
Simple wrapper of Array<size_t> with convenient interface that guarantees the object will be always valid permutation. Only way to modify the object is via shuffle function.
|
default |
|
inlineexplicit |
|
inline |
|
inline |