Struct bio::data_structures::interval_tree::Entry[−][src]

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

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>`[src]

`pub fn data(&self) -> &'a D`[src]

Get a reference to the data for this entry

`pub fn interval(&self) -> &'a Interval<N>`[src]

Get a reference to the interval for this entry

Trait Implementations

`impl<'a, N: Clone + Ord, D: Clone> Clone for Entry<'a, N, D>`[src]

`fn clone(&self) -> Entry<'a, N, D>`[src]

`pub fn clone_from(&mut self, source: &Self)`1.0.0 [src]

`impl<'a, N: Debug + Ord + Clone, D: Debug> Debug for Entry<'a, N, D>`[src]

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

`impl<'a, N: Eq + Ord + Clone, D: Eq> Eq for Entry<'a, N, D>`[src]

`impl<'a, N: PartialEq + Ord + Clone, D: PartialEq> PartialEq<Entry<'a, N, D>> for Entry<'a, N, D>`[src]

`fn eq(&self, other: &Entry<'a, N, D>) -> bool`[src]

`fn ne(&self, other: &Entry<'a, N, D>) -> bool`[src]

`impl<'a, N: Ord + Clone, D> StructuralEq for Entry<'a, N, D>`[src]

`impl<'a, N: Ord + Clone, D> StructuralPartialEq for Entry<'a, N, D>`[src]

Auto Trait Implementations

`impl<'a, N, D> RefUnwindSafe for Entry<'a, N, D> where D: RefUnwindSafe, N: RefUnwindSafe,`

`impl<'a, N, D> Send for Entry<'a, N, D> where D: Sync, N: Sync,`

`impl<'a, N, D> Sync for Entry<'a, N, D> where D: Sync, N: Sync,`

`impl<'a, N, D> Unpin for Entry<'a, N, D>`

`impl<'a, N, D> UnwindSafe for Entry<'a, N, D> where D: RefUnwindSafe, N: RefUnwindSafe,`

Blanket Implementations

`impl<T> Any for T where T: 'static + ?Sized,` [src]

`pub fn type_id(&self) -> TypeId`[src]

`impl<T> Borrow<T> for T where T: ?Sized,` [src]

`pub fn borrow(&self) -> &T`[src]

`impl<T> BorrowMut<T> for T where T: ?Sized,` [src]

`pub fn borrow_mut(&mut self) -> &mut T`[src]

`impl<Q, K> Equivalent<K> for Q where K: Borrow<Q> + ?Sized, Q: Eq + ?Sized,` [src]

`pub fn equivalent(&self, key: &K) -> bool`[src]

`impl<T> From<T> for T`[src]

`pub fn from(t: T) -> T`[src]

`impl<T, U> Into for T where U: From<T>,` [src]

`pub fn into(self) -> U`[src]

`impl<T> Same<T> for T`

`type Output = T`

Should always be Self

`impl<SS, SP> SupersetOf<SS> for SP where SS: SubsetOf<SP>,`

`pub fn to_subset(&self) -> Option<SS>`

`pub fn is_in_subset(&self) -> bool`

`pub unsafe fn to_subset_unchecked(&self) -> SS`

`pub fn from_subset(element: &SS) -> SP`

`impl<T> ToOwned for T where T: Clone,` [src]

`type Owned = T`

The resulting type after obtaining ownership.

`pub fn to_owned(&self) -> T`[src]

`pub fn clone_into(&self, target: &mut T)`[src]

`impl<T, U> TryFrom for T where U: Into<T>,` [src]

`type Error = Infallible`

The type returned in the event of a conversion error.

`pub fn try_from(value: U) -> Result<T, <T as TryFrom>::Error>`[src]

`impl<T, U> TryInto for T where U: TryFrom<T>,` [src]

`type Error = >::Error`

The type returned in the event of a conversion error.

`pub fn try_into(self) -> Result<U, >::Error>`[src]

`impl<V, T> VZip<V> for T where V: MultiLane<T>,`

`pub fn vzip(self) -> V`

Struct bio::data_structures::interval_tree::Entry⎘[−][src]

Implementations

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

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

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

Trait Implementations

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

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

pub fn clone_from(&mut self, source: &Self)1.0.0[src]

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

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

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

impl<'a, N: PartialEq + Ord + Clone, D: PartialEq> PartialEq<Entry<'a, N, D>> for Entry<'a, N, D>[src]

fn eq(&self, other: &Entry<'a, N, D>) -> bool[src]

fn ne(&self, other: &Entry<'a, N, D>) -> bool[src]

impl<'a, N: Ord + Clone, D> StructuralEq for Entry<'a, N, D>[src]

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

Auto Trait Implementations

impl<'a, N, D> RefUnwindSafe for Entry<'a, N, D> where D: RefUnwindSafe, N: RefUnwindSafe,

impl<'a, N, D> Send for Entry<'a, N, D> where D: Sync, N: Sync,

impl<'a, N, D> Sync for Entry<'a, N, D> where D: Sync, N: Sync,

impl<'a, N, D> Unpin for Entry<'a, N, D>

impl<'a, N, D> UnwindSafe for Entry<'a, N, D> where D: RefUnwindSafe, N: RefUnwindSafe,

Blanket Implementations

impl<T> Any for T where T: 'static + ?Sized, [src]

pub fn type_id(&self) -> TypeId[src]

impl<T> Borrow<T> for T where T: ?Sized, [src]

pub fn borrow(&self) -> &T[src]

impl<T> BorrowMut<T> for T where T: ?Sized, [src]

pub fn borrow_mut(&mut self) -> &mut T[src]

impl<Q, K> Equivalent<K> for Q where K: Borrow<Q> + ?Sized, Q: Eq + ?Sized, [src]

pub fn equivalent(&self, key: &K) -> bool[src]

impl<T> From<T> for T[src]

pub fn from(t: T) -> T[src]

impl<T, U> Into<U> for T where U: From<T>, [src]

pub fn into(self) -> U[src]

impl<T> Same<T> for T

type Output = T

impl<SS, SP> SupersetOf<SS> for SP where SS: SubsetOf<SP>,

pub fn to_subset(&self) -> Option<SS>

pub fn is_in_subset(&self) -> bool

pub unsafe fn to_subset_unchecked(&self) -> SS

pub fn from_subset(element: &SS) -> SP

impl<T> ToOwned for T where T: Clone, [src]

type Owned = T

pub fn to_owned(&self) -> T[src]

pub fn clone_into(&self, target: &mut T)[src]

impl<T, U> TryFrom<U> for T where U: Into<T>, [src]

type Error = Infallible

pub fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>[src]

impl<T, U> TryInto<U> for T where U: TryFrom<T>, [src]

type Error = <U as TryFrom<T>>::Error

pub fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>[src]

impl<V, T> VZip<V> for T where V: MultiLane<T>,

pub fn vzip(self) -> V