All Classes

Class	Description
AcyclicEdgeDistance	Acyclic edge distance treats the permutations as if they represent sets of edges, and counts the number of edges that differ.
BlockInterchangeDistance	Block Interchange Distance is the minimum number of block interchanges necessary to transform one permutation into the other.
CycleDistance	Cycle distance is the count of the number of non-singleton permutation cycles between a pair of permutations.
CycleEditDistance	Cycle edit distance is the minimum number of non-singleton permutation cycles necessary to transform permutation p1 into p2.
CyclicEdgeDistance	Cyclic edge distance treats the permutations as if they represent sets of edges, and counts the number of edges that differ.
CyclicIndependentDistance	This class implements the concept of a cyclic independent distance measure.
CyclicIndependentDistanceDouble	This class implements the concept of a cyclic independent distance measure.
CyclicReversalIndependentDistance	This class implements the combination of cyclic independence and reversal independence.
CyclicReversalIndependentDistanceDouble	This class implements the combination of cyclic independence and reversal independence.
CyclicRTypeDistance	Cyclic RType distance treats the permutations as if they represent sets of directed edges, and counts the number of edges that differ.
DeviationDistance	Deviation distance is the sum of the positional deviation of the permutation elements.
DeviationDistanceNormalized	Normalized Deviation distance is the sum of the positional deviation of the permutation elements divided by N-1 (where N is the length of the permutation).
DeviationDistanceNormalized2005	The original version of Normalized Deviation distance (Ronald, 1998) is the sum of the positional deviation of the permutation elements divided by N-1 (where N is the length of the permutation).
EditDistance	This is an implementation of Wagner and Fischer's dynamic programming algorithm for computing string edit distance, but adapted to permutations rather than general strings.
EditDistance	EditDistance is an implementation of Wagner and Fischer's dynamic programming algorithm for computing string edit distance.
ExactMatchDistance	Exact Match distance is an extension of Hamming distance but to non-binary strings, in this case, permutations.
ExactMatchDistance	ExactMatch distance (or Hamming Distance) of a pair of non-binary strings (or more generally sequences) is the number of sequence (or string) positions where the two sequences differ.
InterchangeDistance	Interchange distance is the minimum number of swaps necessary to transform one permutation into the other.
KCycleDistance	K-Cycle distance is the count of the number of non-singleton permutation cycles of length at most K.
KendallTauDistance	Kendall Tau distance is sometimes also known as bubble sort distance, as it is the number of adjacent swaps necessary to transform one permutation into the other.
KendallTauSequenceDistance	Kendall Tau Sequence Distance is the minimum number of adjacent swaps necessary to transform one sequence into the other.
LeeDistance	Lee Distance is closely related to deviation distance.
LongestCommonSubsequenceDistance	LongestCommonSubsequenceDistance is a form of EditDistance, where the edit operations are limited to deletions and insertions (i.e., no replacements or changes), and where the cost of an edit operation is simply 1.
NormalizedPermutationDistanceMeasurer	Implement this interface to define a distance metric for permutations that supports normalizing the distance to the interval [0,1], but where the base distance is an integer value.
NormalizedPermutationDistanceMeasurerDouble	Implement this interface to define a distance metric for permutations that supports normalizing the distance to the interval [0,1].
Permutation	Representation of a permutation of the integers from 0 to N-1, inclusive.
Permutation.Mechanic	Deprecated. This class will be removed in the next major release, 4.0.0, and you should instead use the functionality provided by the Permutation.apply(PermutationUnaryOperator) and Permutation.apply(PermutationBinaryOperator,Permutation) methods, and the related PermutationUnaryOperator and PermutationBinaryOperator interfaces.
PermutationBinaryOperator	A functional interface for defining custom binary operators on Permutations.
PermutationDistanceMeasurer	Implement this interface, PermutationDistanceMeasurer, to define a distance metric for permutations.
PermutationDistanceMeasurerDouble	Implement this interface, PermutationDistanceMeasurerDouble, to define a distance metric for permutations, where the distance is a floating-point value.
PermutationIterator	Iterator over all permutations of a specified length, n, of the integers in the interval [0,n).
PermutationUnaryOperator	A functional interface for defining custom unary operators on Permutations.
ReinsertionDistance	Reinsertion distance is the count of the number of removal/reinsertion operations needed to transform one permutation into the other.
ReversalDistance	Reversal Distance is the minimum number of subpermutation reversals necessary to transform one permutation into the other.
ReversalIndependentDistance	This class implements the concept of a reversal independent distance measure.
ReversalIndependentDistanceDouble	This class implements the concept of a reversal independent distance measure.
RTypeDistance	RType distance treats the permutations as if they represent sets of directed edges, and counts the number of edges that differ.
ScrambleDistance	Scramble Distance is the minimum number of random shufflings needed to transform one permutation into the other.
SequenceDistanceMeasurer	Implement this interface, SequenceDistanceMeasurer, to define a distance metric for sequences.
SequenceDistanceMeasurerDouble	Implement this interface, SequenceDistanceMeasurerDouble, to define a distance metric for sequences.
SequenceSampler	ArraySampler is a class of utility methods related to efficiently generating random samples of array elements, without replacement.
SquaredDeviationDistance	Squared Deviation distance is the sum of the squares of the positional deviations of the permutation elements.
WeightedKendallTauDistance	This class implements the weighted Kendall tau distance.