pub struct GraphIdx(/* private fields */);Implementations§
Trait Implementations§
impl Copy for GraphIdx
impl Eq for GraphIdx
Source§impl Ord for GraphIdx
impl Ord for GraphIdx
1.21.0 (const: unstable) · Source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere
Self: Sized,
Compares and returns the maximum of two values. Read more
Source§impl PartialOrd for GraphIdx
impl PartialOrd for GraphIdx
impl StructuralPartialEq for GraphIdx
Auto Trait Implementations§
impl Freeze for GraphIdx
impl RefUnwindSafe for GraphIdx
impl Send for GraphIdx
impl Sync for GraphIdx
impl Unpin for GraphIdx
impl UnsafeUnpin for GraphIdx
impl UnwindSafe for GraphIdx
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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<Q, K> Comparable<K> for Q
impl<Q, K> Comparable<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreimpl<N> NodeTrait for N
Source§impl<K, V> TiSliceIndex<K, V> for K
impl<K, V> TiSliceIndex<K, V> for K
Source§fn get(
self,
slice: &TiSlice<K, V>,
) -> Option<&<K as TiSliceIndex<K, V>>::Output>
fn get( self, slice: &TiSlice<K, V>, ) -> Option<&<K as TiSliceIndex<K, V>>::Output>
Returns a shared reference to the output at this location, if in
bounds.
Source§fn get_mut(
self,
slice: &mut TiSlice<K, V>,
) -> Option<&mut <K as TiSliceIndex<K, V>>::Output>
fn get_mut( self, slice: &mut TiSlice<K, V>, ) -> Option<&mut <K as TiSliceIndex<K, V>>::Output>
Returns a mutable reference to the output at this location, if in
bounds.
Source§unsafe fn get_unchecked(
self,
slice: &TiSlice<K, V>,
) -> &<K as TiSliceIndex<K, V>>::Output
unsafe fn get_unchecked( self, slice: &TiSlice<K, V>, ) -> &<K as TiSliceIndex<K, V>>::Output
Returns a shared reference to the output at this location, without
performing any bounds checking. Read more
Source§unsafe fn get_unchecked_mut(
self,
slice: &mut TiSlice<K, V>,
) -> &mut <K as TiSliceIndex<K, V>>::Output
unsafe fn get_unchecked_mut( self, slice: &mut TiSlice<K, V>, ) -> &mut <K as TiSliceIndex<K, V>>::Output
Returns a mutable reference to the output at this location, without
performing any bounds checking. Read more