pub struct Parents<S>where
S: Deref<Target = [Parent]>,{ /* private fields */ }
Expand description
Store an etree as the parent information of each node. This reflects the fact that etrees can in fact have multiple roots.
Implementations§
source§impl<S: Deref<Target = [Parent]>> Parents<S>
impl<S: Deref<Target = [Parent]>> Parents<S>
source§impl<S: DerefMut<Target = [Parent]>> Parents<S>
impl<S: DerefMut<Target = [Parent]>> Parents<S>
Trait Implementations§
Auto Trait Implementations§
impl<S> RefUnwindSafe for Parents<S>where S: RefUnwindSafe,
impl<S> Send for Parents<S>where S: Send,
impl<S> Sync for Parents<S>where S: Sync,
impl<S> Unpin for Parents<S>where S: Unpin,
impl<S> UnwindSafe for Parents<S>where S: 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
§impl<T> Pointable for T
impl<T> Pointable for T
source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere SS: SubsetOf<SP>,
source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self
from the equivalent element of its
superset. Read moresource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self
is actually part of its subset T
(and can be converted to it).source§unsafe fn to_subset_unchecked(&self) -> SS
unsafe fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset
but without any property checks. Always succeeds.source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.