pub struct ProofIdx(/* private fields */);Implementations§
Trait Implementations§
Source§impl IndexesInstGraph for ProofIdx
impl IndexesInstGraph for ProofIdx
fn index(&self, graph: &RawInstGraph) -> RawNodeIndex
Source§impl Ord for ProofIdx
impl Ord for ProofIdx
Source§impl PartialOrd for ProofIdx
impl PartialOrd for ProofIdx
impl Copy for ProofIdx
impl Eq for ProofIdx
impl StructuralPartialEq for ProofIdx
Auto Trait Implementations§
impl Freeze for ProofIdx
impl RefUnwindSafe for ProofIdx
impl Send for ProofIdx
impl Sync for ProofIdx
impl Unpin for ProofIdx
impl UnwindSafe for ProofIdx
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 moreSource§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