pub struct Contacts(pub Vec<FragmentSpan>);Expand description
Contains a group of fragments that are touching each other The purpose of Contacts is to group fragments together
Tuple Fields§
§0: Vec<FragmentSpan>Implementations§
Trait Implementations§
source§impl AsMut<Vec<FragmentSpan, Global>> for Contacts
impl AsMut<Vec<FragmentSpan, Global>> for Contacts
source§fn as_mut(&mut self) -> &mut Vec<FragmentSpan>
fn as_mut(&mut self) -> &mut Vec<FragmentSpan>
Converts this type into a mutable reference of the (usually inferred) input type.
source§impl AsRef<Vec<FragmentSpan, Global>> for Contacts
impl AsRef<Vec<FragmentSpan, Global>> for Contacts
source§fn as_ref(&self) -> &Vec<FragmentSpan>
fn as_ref(&self) -> &Vec<FragmentSpan>
Converts this type into a shared reference of the (usually inferred) input type.
source§impl Merge for Contacts
impl Merge for Contacts
source§fn merge(&self, other: &Self) -> Option<Self>
fn merge(&self, other: &Self) -> Option<Self>
An implementation for each implementing objects
which creates a new instance merging
self and the other item.source§fn merge_recursive(items: impl IntoIterator<Item = Self>) -> Vec<Self>where
Self: Sized,
fn merge_recursive(items: impl IntoIterator<Item = Self>) -> Vec<Self>where Self: Sized,
Merge all items until the size don’t change
source§fn second_pass_merge(items: impl IntoIterator<Item = Self>) -> Vec<Self>where
Self: Sized,
fn second_pass_merge(items: impl IntoIterator<Item = Self>) -> Vec<Self>where Self: Sized,
Iterate through each items in the group and merge that items
that can be merged
source§impl PartialEq<Contacts> for Contacts
impl PartialEq<Contacts> for Contacts
impl Eq for Contacts
impl StructuralEq for Contacts
impl StructuralPartialEq for Contacts
Auto Trait Implementations§
impl RefUnwindSafe for Contacts
impl Send for Contacts
impl Sync for Contacts
impl Unpin for Contacts
impl UnwindSafe for Contacts
Blanket Implementations§
§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere T: Any,
§fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>
fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>
Convert
Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>. Box<dyn Any> can
then be further downcast into Box<ConcreteType> where ConcreteType implements Trait.§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
Convert
Rc<Trait> (where Trait: Downcast) to Rc<Any>. Rc<Any> can then be
further downcast into Rc<ConcreteType> where ConcreteType implements Trait.§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
Convert
&Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &Any’s vtable from &Trait’s.§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
Convert
&mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &mut Any’s vtable from &mut Trait’s.source§impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,
source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere SS: SubsetOf<SP>,
§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 more§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).§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.