Struct Indices 

pub struct Indices<T: ?Sized> { /* private fields */ }

Sequence of child indices identifying a node in a TreeSchema.

Implementations

impl<T> Indices<T>

pub fn new(data: T, len: usize) -> Self

Create a new Indices

pub fn into_inner(self) -> (T, usize)

Split indices into data and length

impl<T: ?Sized> Indices<T>

pub fn len(&self) -> usize

The number of selector segments in this index path.

pub fn is_empty(&self) -> bool

See Self::len()

Trait Implementations

impl<U, T: AsMut<[U]> + ?Sized> AsMut<[U]> for Indices<T>

fn as_mut(&mut self) -> &mut [U]

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

impl<U, T: AsRef<[U]> + ?Sized> AsRef<[U]> for Indices<T>

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

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

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

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

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

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

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

Formats the value using the given formatter.

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

fn default() -> Indices<T>

Returns the “default value” for a type.

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<T: Eq + ?Sized> Eq for Indices<T>

impl<T> Format for Indices<T>

where T: Format + ?Sized,

fn format(&self, f: Formatter<'_>)

Writes the defmt representation of self to fmt.

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

fn from(value: T) -> Self

Converts to this type from the input type.

impl<'a, U, T: ?Sized> IntoIterator for &'a Indices<T>

where &'a T: IntoIterator<Item = U>,

type Item = U

The type of the elements being iterated over.

type IntoIter = Take<<&'a T as IntoIterator>::IntoIter>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

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

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

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

type Error = <[usize] as Transcode>::Error

The possible error when transcoding.

fn transcode_from( &mut self, schema: &Schema, keys: impl Keys, ) -> Result<(), DescendError<Self::Error>>

Perform a node lookup from a boundary key input and transcode it.

fn transcode( schema: &Schema, keys: impl IntoKeys, ) -> Result<Self, DescendError<Self::Error>>

where Self: Sized + Default,

Transcode a boundary key input into a fresh default-constructed output.