Struct store_interval_tree::EntryMut

pub struct EntryMut<'a, T: Ord, V> { /* private fields */ }

A find_mut query on the interval tree does not directly return references to the nodes in the tree, but wraps the fields interval and data in an EntryMut. Only the data part can be mutably accessed using the data method

Implementations

impl<'a, T: Ord + 'a, V: 'a> EntryMut<'a, T, V>

pub fn value(&'a mut self) -> &'a mut V

Get a mutable reference to the data for this entry

pub fn interval(&self) -> &'a Interval<T>

Get a reference to the interval for this entry

Trait Implementations

impl<'a, T: Debug + Ord, V: Debug> Debug for EntryMut<'a, T, V>

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

Formats the value using the given formatter.

impl<'a, T: PartialEq + Ord, V: PartialEq> PartialEq<EntryMut<'a, T, V>> for EntryMut<'a, T, V>

fn eq(&self, other: &EntryMut<'a, T, V>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<'a, T: Eq + Ord, V: Eq> Eq for EntryMut<'a, T, V>

impl<'a, T: Ord, V> StructuralEq for EntryMut<'a, T, V>

impl<'a, T: Ord, V> StructuralPartialEq for EntryMut<'a, T, V>