pub struct Tree<Q, T>{ /* private fields */ }
Expand description
A looping-enabled nested tree data structure for use in Parade. Keys must be globally unique, and there is no automatic balancing. There is no root node, and nodes can contain themselves or their ancestors. This probably makes “tree” an inaccurate term.
Implementations§
Source§impl<Q, T> Tree<Q, T>
impl<Q, T> Tree<Q, T>
Sourcepub fn get_from_parent(
&self,
key: &Q,
parent: &Q,
) -> Result<Option<&Node<T, Q>>, Error<Q>>
pub fn get_from_parent( &self, key: &Q, parent: &Q, ) -> Result<Option<&Node<T, Q>>, Error<Q>>
Trait Implementations§
Source§impl<'de, Q, T> Deserialize<'de> for Tree<Q, T>
impl<'de, Q, T> Deserialize<'de> for Tree<Q, T>
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
Auto Trait Implementations§
impl<Q, T> Freeze for Tree<Q, T>
impl<Q, T> RefUnwindSafe for Tree<Q, T>where
Q: RefUnwindSafe,
T: RefUnwindSafe,
impl<Q, T> Send for Tree<Q, T>
impl<Q, T> Sync for Tree<Q, T>
impl<Q, T> Unpin for Tree<Q, T>
impl<Q, T> UnwindSafe for Tree<Q, T>where
Q: UnwindSafe,
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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
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