Struct Ordered 

pub struct Ordered<T>(/* private fields */);

An ordered, deduplicated slice of items.

After construction, the contained Vec<T> is sealed and cannot be modified. To unseal the inner Vec<T>, use the Into<Vec<T>> impl.

Implementations

impl<T> Ordered<T>

pub fn len(&self) -> usize

Returns the size of the ordered collection.

pub fn is_empty(&self) -> bool

Returns true if the collection is empty.

pub fn get(&self, index: usize) -> Option<&T>

Returns an item by index, if it exists.

pub fn position(&self, item: &T) -> Option<usize>

where T: Ord,

Returns the position of a given item in the collection, if it exists.

pub fn iter(&self) -> Iter<'_, T>

Returns an iterator over the items in the collection.

Trait Implementations

impl<T> AsRef<[T]> for Ordered<T>

fn as_ref(&self) -> &[T]

Converts this type into a shared reference of the (usually inferred) input type.

impl<K, V> AsRef<Ordered<K>> for OrderedAssociated<K, V>

fn as_ref(&self) -> &Ordered<K>

Converts this type into a shared reference of the (usually inferred) input type.

impl<T: Clone> Clone for Ordered<T>

fn clone(&self) -> Ordered<T>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<T: Debug> Debug for Ordered<T>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<T: Display> Display for Ordered<T>

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.

impl<T: EncodeSize> EncodeSize for Ordered<T>

fn encode_size(&self) -> usize

Returns the encoded size of this value (in bytes).

impl<T: Ord + Clone> From<&[T]> for Ordered<T>

fn from(items: &[T]) -> Self

Converts to this type from the input type.

impl<T: Ord + Clone, const N: usize> From<&[T; N]> for Ordered<T>

fn from(items: &[T; N]) -> Self

Converts to this type from the input type.

impl<T: Ord, const N: usize> From<[T; N]> for Ordered<T>

fn from(items: [T; N]) -> Self

Converts to this type from the input type.

impl<T: Ord> From<Ordered<T>> for Vec<T>

fn from(set: Ordered<T>) -> Self

Converts to this type from the input type.

impl<T: Ord> From<Vec<T>> for Ordered<T>

fn from(items: Vec<T>) -> Self

Converts to this type from the input type.

impl<T: Ord> FromIterator<T> for Ordered<T>

fn from_iter<I: IntoIterator<Item = T>>(iter: I) -> Self

Creates a value from an iterator.

impl<T: Hash> Hash for Ordered<T>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<T> Index<Range<usize>> for Ordered<T>

type Output = [T]

The returned type after indexing.

fn index(&self, index: Range<usize>) -> &Self::Output

Performs the indexing (container[index]) operation.

impl<T> Index<usize> for Ordered<T>

type Output = T

The returned type after indexing.

fn index(&self, index: usize) -> &Self::Output

Performs the indexing (container[index]) operation.

impl<'a, T> IntoIterator for &'a Ordered<T>

type Item = &'a T

The type of the elements being iterated over.

type IntoIter = Iter<'a, T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T> IntoIterator for Ordered<T>

type Item = T

The type of the elements being iterated over.

type IntoIter = IntoIter<T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T: Ord> Ord for Ordered<T>

fn cmp(&self, other: &Ordered<T>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<T: PartialEq> PartialEq for Ordered<T>

fn eq(&self, other: &Ordered<T>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<T: PartialOrd> PartialOrd for Ordered<T>

fn partial_cmp(&self, other: &Ordered<T>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<T: Read> Read for Ordered<T>

type Cfg = (RangeCfg<usize>, <T as Read>::Cfg)

The Cfg type parameter allows passing configuration during the read process. This is crucial for safely decoding untrusted data, for example, by providing size limits for collections or strings.

fn read_cfg(buf: &mut impl Buf, cfg: &Self::Cfg) -> Result<Self, Error>

Reads a value from the buffer using the provided configuration cfg.

impl<T: Write> Write for Ordered<T>

fn write(&self, buf: &mut impl BufMut)

Writes the binary representation of self to the provided buffer buf.

impl<T: Eq> Eq for Ordered<T>

impl<T> StructuralPartialEq for Ordered<T>