Struct Short

pub struct Short<K> { /* private fields */ }

Track leaf node encounter

This records whether a leaf node has been reached during Keys and Transcode.

Implementations

impl<K> Short<K>

pub fn new(inner: K) -> Self

Create a new Short

pub fn leaf(&self) -> bool

Whether a leaf node as been encountered

pub fn inner(&self) -> &K

Borrow the inner Keys

pub fn into_inner(self) -> (K, bool)

Split into inner Keys and leaf node flag

Trait Implementations

impl<K: Clone> Clone for Short<K>

fn clone(&self) -> Short<K>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K: Debug> Debug for Short<K>

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

Formats the value using the given formatter.

impl<K: Default> Default for Short<K>

fn default() -> Short<K>

Returns the “default value” for a type.

impl<K: Hash> Hash for Short<K>

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<K: Keys> IntoKeys for &mut Short<K>

type IntoKeys = &mut Short<K>

The specific Keys implementor.

fn into_keys(self) -> Self::IntoKeys

Convert self into a Keys implementor.

impl<K: Keys> Keys for Short<K>

fn next(&mut self, internal: &Internal) -> Result<usize, KeyError>

Look up the next key in a Internal and convert to usize index.

fn finalize(&mut self) -> Result<(), KeyError>

Finalize the keys, ensure there are no more.

fn chain<U: IntoKeys>(self, other: U) -> Chain<Self, U::IntoKeys>

where Self: Sized,

Chain another Keys to this one.

fn track(self) -> Track<Self>

where Self: Sized,

Track depth

fn short(self) -> Short<Self>

where Self: Sized,

Track whether a leaf node is reached

impl<K: PartialEq> PartialEq for Short<K>

fn eq(&self, other: &Short<K>) -> 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<K: PartialOrd> PartialOrd for Short<K>

fn partial_cmp(&self, other: &Short<K>) -> 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<K> Serialize for Short<K>

where K: Serialize,

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<T: Transcode> Transcode for Short<T>

type Error = <T as Transcode>::Error

The possible error when transcoding.

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

Perform a node lookup of a K: IntoKeys on a Schema and transcode it.

impl<K> StructuralPartialEq for Short<K>