Struct in_place::dummy_collections::b_tree_map::DummyBTreeMap

source · [−]

pub struct DummyBTreeMap<K, V> { /* private fields */ }

Expand description

stand in for std::collections::BTreeMap

Trait Implementations

source

impl<K, V, Q> GetEntryByKey<K, V, Q> for DummyBTreeMap<K, V> where
K: Borrow<Q> + Clone + Ord,
Q: Ord,

source

fn get_entry<'c>(
&'c mut self,
key: &Q
) -> Entry<Self::Occupied<'c>, Self::Vacant<'c>>

source

fn vacate<'c>(&'c mut self, key: &Q) -> (Self::Vacant<'c>, Option<V>)

source

fn remove_entry<'c>(
&'c mut self,
key: &Q
) -> (Entry<Self::Occupied<'c>, Self::Vacant<'c>>, Option<V>)

source

impl<K, V> GetEntryFromKey<K, V> for DummyBTreeMap<K, V> where
K: Ord,

type Occupied<'c>
where
Self: 'c = DummyBTreeMapOccupiedEntry<'c, K, V>

type Vacant<'c>
where
Self: 'c = DummyBTreeMapVacantEntry<'c, K, V>

source

fn get_entry_with_key<'c>(
&'c mut self,
key: K
) -> EntryWithSearchKey<Self::Occupied<'c>, Self::Vacant<'c>, K>

source

fn get_entry_from_key<'c>(
&'c mut self,
key: K
) -> Entry<Self::Occupied<'c>, Self::Vacant<'c>>

source

fn insert_into_entry<'c>(
 &'c mut self,
 key: K,
 value: V
) -> (Entry<Self::Occupied<'c>, Self::Vacant<'c>>, Option<V>)

source

fn occupy<'c>(&'c mut self, key: K, value: V) -> (Self::Occupied<'c>, Option<V>)

source

impl<K, V> GetFirstEntry<V> for DummyBTreeMap<K, V> where
K: Ord,

type Occupied<'c>
where
Self: 'c = DummyBTreeMapOccupiedEntry<'c, K, V>

source

fn get_first_occupied<'c>(&'c mut self) -> Option<Self::Occupied<'c>>

source

impl<K, V> GetLastEntry<V> for DummyBTreeMap<K, V> where
K: Ord,

type Occupied<'c>
where
Self: 'c = DummyBTreeMapOccupiedEntry<'c, K, V>

source

fn get_last_occupied<'c>(&'c mut self) -> Option<Self::Occupied<'c>>

Auto Trait Implementations

impl<K, V> RefUnwindSafe for DummyBTreeMap<K, V> where
K: RefUnwindSafe,
V: RefUnwindSafe,

impl<K, V> Send for DummyBTreeMap<K, V> where
K: Send,
V: Send,

impl<K, V> Sync for DummyBTreeMap<K, V> where
K: Sync,
V: Sync,

impl<K, V> Unpin for DummyBTreeMap<K, V> where
K: Unpin,
V: Unpin,

impl<K, V> UnwindSafe for DummyBTreeMap<K, V> where
K: UnwindSafe,
V: UnwindSafe,

Blanket Implementations

source

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

source

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

source

impl<T> Borrow<T> for T where
T: ?Sized,

const: unstable · source

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

source

impl<T> BorrowMut<T> for T where
T: ?Sized,

const: unstable · source

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

source

impl<T> From<T> for T

const: unstable · source

fn from(t: T) -> T

Returns the argument unchanged.

source

impl<T, U> Into for T where
U: From<T>,

const: unstable · source

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source

impl<T, U> TryFrom for T where
U: Into<T>,

type Error = Infallible

The type returned in the event of a conversion error.

const: unstable · source

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

Performs the conversion.

source

impl<T, U> TryInto for T where
U: TryFrom<T>,

type Error = >::Error

The type returned in the event of a conversion error.

const: unstable · source

fn try_into(self) -> Result<U, >::Error>

Performs the conversion.

Struct in_place::dummy_collections::b_tree_map::DummyBTreeMap

Trait Implementations

impl<K, V, Q> GetEntryByKey<K, V, Q> for DummyBTreeMap<K, V> where K: Borrow<Q> + Clone + Ord, Q: Ord,

fn get_entry<'c>( &'c mut self, key: &Q) -> Entry<Self::Occupied<'c>, Self::Vacant<'c>>

fn vacate<'c>(&'c mut self, key: &Q) -> (Self::Vacant<'c>, Option<V>)

fn remove_entry<'c>( &'c mut self, key: &Q) -> (Entry<Self::Occupied<'c>, Self::Vacant<'c>>, Option<V>)

impl<K, V> GetEntryFromKey<K, V> for DummyBTreeMap<K, V> where K: Ord,

type Occupied<'c> where Self: 'c = DummyBTreeMapOccupiedEntry<'c, K, V>

type Vacant<'c> where Self: 'c = DummyBTreeMapVacantEntry<'c, K, V>

fn get_entry_with_key<'c>( &'c mut self, key: K) -> EntryWithSearchKey<Self::Occupied<'c>, Self::Vacant<'c>, K>

fn get_entry_from_key<'c>( &'c mut self, key: K) -> Entry<Self::Occupied<'c>, Self::Vacant<'c>>

fn insert_into_entry<'c>( &'c mut self, key: K, value: V) -> (Entry<Self::Occupied<'c>, Self::Vacant<'c>>, Option<V>)

fn occupy<'c>(&'c mut self, key: K, value: V) -> (Self::Occupied<'c>, Option<V>)

impl<K, V> GetFirstEntry<V> for DummyBTreeMap<K, V> where K: Ord,

type Occupied<'c> where Self: 'c = DummyBTreeMapOccupiedEntry<'c, K, V>

fn get_first_occupied<'c>(&'c mut self) -> Option<Self::Occupied<'c>>

impl<K, V> GetLastEntry<V> for DummyBTreeMap<K, V> where K: Ord,

type Occupied<'c> where Self: 'c = DummyBTreeMapOccupiedEntry<'c, K, V>

fn get_last_occupied<'c>(&'c mut self) -> Option<Self::Occupied<'c>>

Auto Trait Implementations

impl<K, V> RefUnwindSafe for DummyBTreeMap<K, V> where K: RefUnwindSafe, V: RefUnwindSafe,

impl<K, V> Send for DummyBTreeMap<K, V> where K: Send, V: Send,

impl<K, V> Sync for DummyBTreeMap<K, V> where K: Sync, V: Sync,

impl<K, V> Unpin for DummyBTreeMap<K, V> where K: Unpin, V: Unpin,

impl<K, V> UnwindSafe for DummyBTreeMap<K, V> where K: UnwindSafe, V: UnwindSafe,

Blanket Implementations

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

fn type_id(&self) -> TypeId

impl<T> Borrow<T> for T where T: ?Sized,

fn borrow(&self) -> &T

impl<T> BorrowMut<T> for T where T: ?Sized,

fn borrow_mut(&mut self) -> &mut T

impl<T> From<T> for T

fn from(t: T) -> T

impl<T, U> Into<U> for T where U: From<T>,

fn into(self) -> U

impl<T, U> TryFrom<U> for T where U: Into<T>,

type Error = Infallible

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

impl<T, U> TryInto<U> for T where U: TryFrom<T>,

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

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

impl<K, V, Q> GetEntryByKey<K, V, Q> for DummyBTreeMap<K, V> where
K: Borrow<Q> + Clone + Ord,
Q: Ord,

fn get_entry<'c>(
&'c mut self,
key: &Q
) -> Entry<Self::Occupied<'c>, Self::Vacant<'c>>

fn remove_entry<'c>(
&'c mut self,
key: &Q
) -> (Entry<Self::Occupied<'c>, Self::Vacant<'c>>, Option<V>)

impl<K, V> GetEntryFromKey<K, V> for DummyBTreeMap<K, V> where
K: Ord,

type Occupied<'c>
where
Self: 'c = DummyBTreeMapOccupiedEntry<'c, K, V>

type Vacant<'c>
where
Self: 'c = DummyBTreeMapVacantEntry<'c, K, V>

fn get_entry_with_key<'c>(
&'c mut self,
key: K
) -> EntryWithSearchKey<Self::Occupied<'c>, Self::Vacant<'c>, K>

fn get_entry_from_key<'c>(
&'c mut self,
key: K
) -> Entry<Self::Occupied<'c>, Self::Vacant<'c>>

fn insert_into_entry<'c>(
&'c mut self,
key: K,
value: V
) -> (Entry<Self::Occupied<'c>, Self::Vacant<'c>>, Option<V>)

impl<K, V> GetFirstEntry<V> for DummyBTreeMap<K, V> where
K: Ord,

type Occupied<'c>
where
Self: 'c = DummyBTreeMapOccupiedEntry<'c, K, V>

impl<K, V> GetLastEntry<V> for DummyBTreeMap<K, V> where
K: Ord,

type Occupied<'c>
where
Self: 'c = DummyBTreeMapOccupiedEntry<'c, K, V>

impl<K, V> RefUnwindSafe for DummyBTreeMap<K, V> where
K: RefUnwindSafe,
V: RefUnwindSafe,

impl<K, V> Send for DummyBTreeMap<K, V> where
K: Send,
V: Send,

impl<K, V> Sync for DummyBTreeMap<K, V> where
K: Sync,
V: Sync,

impl<K, V> Unpin for DummyBTreeMap<K, V> where
K: Unpin,
V: Unpin,

impl<K, V> UnwindSafe for DummyBTreeMap<K, V> where
K: UnwindSafe,
V: UnwindSafe,

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

impl<T> Borrow<T> for T where
T: ?Sized,

impl<T> BorrowMut<T> for T where
T: ?Sized,

impl<T, U> Into<U> for T where
U: From<T>,

impl<T, U> TryFrom<U> for T where
U: Into<T>,

impl<T, U> TryInto<U> for T where
U: TryFrom<T>,