Struct discrete::Permutation

pub struct Permutation<T = Data>(_);

Dimension is natural number, position is a list of numbers.

Trait Implementations

impl<T> Construct for Permutation<T>

fn new() -> Permutation<T>

Constructs a new Self.

impl Count<usize> for Permutation<Data>

fn count(&self, dim: &usize) -> usize

Counts the size of space given the dimensions.

impl<T, U> Count<U> for Permutation<Of<T>> where
    T: Construct + Count<U>, 

fn count(&self, dim: &U) -> usize

Counts the size of space given the dimensions.

impl ToIndex<usize, Vec<usize>> for Permutation<Data>

fn to_index(&self, dim: &usize, pos: &Vec<usize>) -> usize

Converts position to index.

impl<T, U, V> ToIndex<U, Vec<V>> for Permutation<Of<T>> where
    T: Construct + ToIndex<U, V> + Count<U>,
    V: Clone, 

fn to_index(&self, dim: &U, pos: &Vec<V>) -> usize

Converts position to index.

impl ToPos<usize, Vec<usize>> for Permutation<Data>

fn to_pos(&self, dim: &usize, index: usize, pos: &mut Vec<usize>)

Converts index to position.

impl<T, U, V> ToPos<U, Vec<V>> for Permutation<Of<T>> where
    T: Construct + Count<U> + ToPos<U, V>,
    V: Default, 

fn to_pos(&self, dim: &U, index: usize, pos: &mut Vec<V>)

Converts index to position.

impl Zero<usize, Vec<usize>> for Permutation<Data>

fn zero(&self, dim: &usize) -> Vec<usize>

Creates a default element.

impl<T, U, V> Zero<U, Vec<V>> for Permutation<Of<T>> where
    T: Construct + Count<U> + Zero<U, V>,
    V: Default + Clone, 

fn zero(&self, dim: &U) -> Vec<V>

Creates a default element.