Module agnes::permute

Structures, traits, and implementations for handling data permutations.

Permutation objects represent the index order for a data collection if a non-original order exists. This can be used to represent a possible sorting (where all indices are included) or filtering (where a strict subset of the indices are included) of the data set.

This module also contains traits and methods for sorting data sets.

Structs

Permutation

A structure containing information about the permutation status of a field. I represents the underlying permutation implementation type (such as Vec<usize> or &usize).

Traits

FilterPerm	Trait providing method to provide an index permutation of values that match a predicate.
SortOrder	Trait providing function to compute and return the sorted permutation order. This sort is stable (preserves original order of equal elements).
SortOrderComparator	Trait providing function to compute and return the sorted permutation order using a comparator. This sort is stable (preserves original order of equal elements).
SortOrderUnstable	Trait providing function to compute and return the sorted permutation order. This sort is unstable (does not preserve original order of equal elements, but may be faster than the stable version).
SortOrderUnstableComparator	Trait providing function to compute and return the sorted permutation order. This sort is unstable (does not preserve original order of equal elements, but may be faster than the stable version).
UpdatePermutation	Trait for updating the permutation of all data storage in a type.

Functions

sort_f32	Helper sorting method for floating-point (f32) values
sort_f32_values	Helper sorting method for floating-point (Value<&f32>) values.
sort_f64	Helper sorting method for floating-point (f64) values
sort_f64_values	Helper sorting method for floating-point (Value<&f64>) values.