Struct Indices

#[repr(transparent)]
pub struct Indices<T: ?Sized>(pub T);

Indices of usize to identify a node in a TreeKey

Tuple Fields

0: T

Implementations

impl<T> Indices<T>

pub fn into_inner(self) -> T

Extract just the indices

Trait Implementations

impl<T: Clone + ?Sized> Clone for Indices<T>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug + ?Sized> Debug for Indices<T>

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

Formats the value using the given formatter.

impl<const D: usize, T: Copy + Default> Default for Indices<[T; D]>

fn default() -> Self

Returns the “default value” for a type.

impl<T: ?Sized> Deref for Indices<T>

type Target = T

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

impl<T: ?Sized> DerefMut for Indices<T>

fn deref_mut(&mut self) -> &mut Self::Target

Mutably dereferences the value.

impl<'de, T> Deserialize<'de> for Indices<T>

where T: Deserialize<'de> + ?Sized,

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<const D: usize, T> From<Indices<[T; D]>> for [T; D]

fn from(value: Indices<[T; D]>) -> Self

Converts to this type from the input type.

impl<T> From<T> for Indices<T>

fn from(value: T) -> Self

Converts to this type from the input type.

impl<T: IntoKeys> IntoKeys for Indices<T>

type IntoKeys = <T as IntoKeys>::IntoKeys

The specific Keys implementor.

fn into_keys(self) -> Self::IntoKeys

Convert self into a Keys implementor.

impl<T: Ord + ?Sized> Ord for Indices<T>

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

This method returns an Ordering between self and other.

impl<T: PartialEq + ?Sized> PartialEq for Indices<T>

fn eq(&self, other: &Indices<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 + ?Sized> PartialOrd for Indices<T>

fn partial_cmp(&self, other: &Indices<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> Serialize for Indices<T>

where T: Serialize + ?Sized,

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<T: AsMut<[usize]> + ?Sized> Transcode for Indices<T>

fn transcode<M, K>(&mut self, keys: K) -> Result<Node, Traversal>

where M: TreeKey + ?Sized, K: IntoKeys,

Perform a node lookup of a K: IntoKeys on a M: TreeKey<Y> and transcode it.

impl<T: Copy + ?Sized> Copy for Indices<T>

impl<T: Eq + ?Sized> Eq for Indices<T>

impl<T: ?Sized> StructuralPartialEq for Indices<T>