Struct sets::IndexedSet [−][src]
Expand description
Struct holding a borrowed unordered set and its sort index. Thus it is an index ordered set (ascending or descending).
Fields
ascending: bool
v: Vec<T>
i: Vec<usize>
Implementations
Initiliser, indexsorts an unordered slice
Initiliser, indexsorts an unordered Set
From Oredered is not often needed, as the index will be trivial
Converts ranks to sort index
Trait Implementations
Display implemented for struct IndexedSet.
Deletes repetitions.
Finds minimum, minimum’s first index, maximum, maximum’s first index
True if m is a member of the set
Search a Set for m. Returns index of the first m.
Union of two indexed sets of the same type -
Intersection of two sets of the same type.
Via OrderedSet for convenience, for now.
Probably should use intersect_indexed as in union
above.
Complement of s in self (i.e. self-s)
Auto Trait Implementations
impl<T> RefUnwindSafe for IndexedSet<T> where
T: RefUnwindSafe,
impl<T> Send for IndexedSet<T> where
T: Send,
impl<T> Sync for IndexedSet<T> where
T: Sync,
impl<T> Unpin for IndexedSet<T> where
T: Unpin,
impl<T> UnwindSafe for IndexedSet<T> where
T: UnwindSafe,