Struct bio::data_structures::interval_tree::Entry

pub struct Entry<'a, N: Ord + Clone, D> { /* private fields */ }

A find 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 Entry.

Implementations

impl<'a, N: Ord + Clone + 'a, D: 'a> Entry<'a, N, D>

pub fn data(&self) -> &'a D

Get a reference to the data for this entry

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

Get a reference to the interval for this entry

Trait Implementations

impl<'a, N: Clone + Ord + Clone, D: Clone> Clone for Entry<'a, N, D>

fn clone(&self) -> Entry<'a, N, D>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<'a, N: Debug + Ord + Clone, D: Debug> Debug for Entry<'a, N, D>

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

Formats the value using the given formatter.

impl<'a, N: Hash + Ord + Clone, D: Hash> Hash for Entry<'a, N, D>

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<'a, N: PartialEq + Ord + Clone, D: PartialEq> PartialEq for Entry<'a, N, D>

fn eq(&self, other: &Entry<'a, N, D>) -> 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, N, D> Serialize for Entry<'a, N, D>

where N: Serialize + Ord + Clone, D: Serialize,

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<'a, N: Copy + Ord + Clone, D: Copy> Copy for Entry<'a, N, D>

impl<'a, N: Eq + Ord + Clone, D: Eq> Eq for Entry<'a, N, D>

impl<'a, N: Ord + Clone, D> StructuralPartialEq for Entry<'a, N, D>