pub struct Unsorted<T> { /* private fields */ }
Expand description
A commutative data structure for lazily sorted sequences of data.
The sort does not occur until statistics need to be computed.
Note that this works on types that do not define a total ordering like
f32
and f64
. When an ordering is not defined, an arbitrary order
is returned.
Implementations§
source§impl<T: PartialOrd> Unsorted<T>
impl<T: PartialOrd> Unsorted<T>
source§impl<T: PartialOrd + Eq + Clone> Unsorted<T>
impl<T: PartialOrd + Eq + Clone> Unsorted<T>
pub fn cardinality(&mut self) -> usize
source§impl<T: PartialOrd + Clone> Unsorted<T>
impl<T: PartialOrd + Clone> Unsorted<T>
source§impl<T: PartialOrd + ToPrimitive> Unsorted<T>
impl<T: PartialOrd + ToPrimitive> Unsorted<T>
Trait Implementations§
source§impl<T: PartialOrd> Commute for Unsorted<T>
impl<T: PartialOrd> Commute for Unsorted<T>
source§impl<T: PartialOrd> Default for Unsorted<T>
impl<T: PartialOrd> Default for Unsorted<T>
source§impl<T: PartialOrd> Extend<T> for Unsorted<T>
impl<T: PartialOrd> Extend<T> for Unsorted<T>
source§fn extend<I: IntoIterator<Item = T>>(&mut self, it: I)
fn extend<I: IntoIterator<Item = T>>(&mut self, it: I)
Extends a collection with the contents of an iterator. Read more
source§fn extend_one(&mut self, item: A)
fn extend_one(&mut self, item: A)
🔬This is a nightly-only experimental API. (
extend_one
)Extends a collection with exactly one element.
source§fn extend_reserve(&mut self, additional: usize)
fn extend_reserve(&mut self, additional: usize)
🔬This is a nightly-only experimental API. (
extend_one
)Reserves capacity in a collection for the given number of additional elements. Read more