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>
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<'de, T> Deserialize<'de> for Unsorted<T>where
T: Deserialize<'de>,
impl<'de, T> Deserialize<'de> for Unsorted<T>where
T: Deserialize<'de>,
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
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
source§impl<T: PartialOrd> FromIterator<T> for Unsorted<T>
impl<T: PartialOrd> FromIterator<T> for Unsorted<T>
source§impl<T: PartialEq> PartialEq for Unsorted<T>
impl<T: PartialEq> PartialEq for Unsorted<T>
impl<T: Eq> Eq for Unsorted<T>
impl<T> StructuralPartialEq for Unsorted<T>
Auto Trait Implementations§
impl<T> Freeze for Unsorted<T>
impl<T> RefUnwindSafe for Unsorted<T>where
T: RefUnwindSafe,
impl<T> Send for Unsorted<T>
impl<T> Sync for Unsorted<T>
impl<T> Unpin for Unsorted<T>where
T: Unpin,
impl<T> UnwindSafe for Unsorted<T>where
T: UnwindSafe,
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
source§impl<T> IntoEither for T
impl<T> IntoEither for T
source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moresource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read more