Uses of Class
eu.bandm.tools.util.uni.Permutation

Packages that use Permutation
Package
Description
Data structures with uniqueness constraints on their elements.
  • Uses of Permutation in eu.bandm.tools.util.uni

    Methods in eu.bandm.tools.util.uni that return Permutation
    Modifier and Type
    Method
    Description
    Permutation.andThen(Permutation other)
    Returns a permutation that applies the mapping of this permutation before that of a given other permutation.
    Permutation.compose(Permutation other)
    Returns a permutation that applies the mapping of this permutation after that of a given other permutation.
    Permutation.cycle(int... members)
    Returns a permutation that rotates the given positions cyclically.
    Permutation.identity()
    Returns the identity permutation.
    Permutation.inverse()
    Returns a permutation that inverts the mapping of this permutation.
    Permutation.mirror(int from, int to)
    Returns a permutation that mirrors the positions in a given interval.
    Permutation.of(Permutation.CanonicalForm canonicalForm)
    Creates a permutation from its canonical form.
    Permutation.power(long exponent)
    Returns a repeated composition of this permutation with itself.
    Permutation.rotate(int from, int to)
    Returns a permutation that rotates the positions in a given interval one step up.
    Permutation.shiftUp(int offset)
    Returns a copy of this permutation where all entries are shifted upwards by a given offset.
    Permutation.sorting(int[] seq)
    Returns the permutation that sorts the given sequence in ascending numerical ordering.
    static <E extends Comparable<? super E>>
    Permutation
    Permutation.sorting(E[] seq)
    Returns the permutation that sorts the given sequence in natural ordering.
    static <E> Permutation
    Permutation.sorting(E[] seq, Comparator<? super E> comp)
    Returns the permutation that sorts the given sequence in the given ordering.
    static <E extends Comparable<? super E>>
    Permutation
    Permutation.sorting(List<? extends E> seq)
    Returns the permutation that sorts the given sequence in natural ordering.
    static <E> Permutation
    Permutation.sorting(List<? extends E> seq, Comparator<? super E> comp)
    Returns the permutation that sorts the given sequence in the given ordering.
    Permutation.swap(int a, int b)
    Returns a permutation that swaps two positions.
    Permutation.unsorting(int... seq)
    Returns the permutation that reproduces the given sequence from its sorted elements.
    Methods in eu.bandm.tools.util.uni that return types with arguments of type Permutation
    Modifier and Type
    Method
    Description
    Permutation.shift(int offset)
    Returns a copy of this permutation where all entries are shifted by a given offset.
    Permutation.shiftDown(int offset)
    Returns a copy of this permutation where all entries are shifted downwards by a given offset.
    Permutation.sqrt()
    Finds some permutation that composed with itself is equivalent to this permutation.
    Methods in eu.bandm.tools.util.uni with parameters of type Permutation
    Modifier and Type
    Method
    Description
    Permutation.andThen(Permutation other)
    Returns a permutation that applies the mapping of this permutation before that of a given other permutation.
    Permutation.compose(Permutation other)
    Returns a permutation that applies the mapping of this permutation after that of a given other permutation.