Struct ccache::hashmap::user::Entry[][src]

pub struct Entry<K, V, Cid, Umeta> where
    Umeta: Meta<V>,
    Cid: Copy
{ /* fields omitted */ }

current implementation of our hashmap entries

Has two std::ptr::NonNull pointer that the caches can use to reorder the elements

Trait Implementations

impl<K, V, Cid, Umeta: Meta<V>> Default for Entry<K, V, Cid, Umeta> where
    K: Hash,
    V: Val,
    Cid: Cid
[src]

impl<K, V, Cid, Umeta: Meta<V>> EntryT<K, V, Cid, Umeta> for Entry<K, V, Cid, Umeta> where
    K: Hash,
    V: Val,
    Cid: Cid
[src]

Auto Trait Implementations

impl<K, V, Cid, Umeta> RefUnwindSafe for Entry<K, V, Cid, Umeta> where
    Cid: RefUnwindSafe,
    K: RefUnwindSafe,
    Umeta: RefUnwindSafe,
    V: RefUnwindSafe

impl<K, V, Cid, Umeta> !Send for Entry<K, V, Cid, Umeta>

impl<K, V, Cid, Umeta> !Sync for Entry<K, V, Cid, Umeta>

impl<K, V, Cid, Umeta> Unpin for Entry<K, V, Cid, Umeta> where
    Cid: Unpin,
    K: Unpin,
    Umeta: Unpin,
    V: Unpin

impl<K, V, Cid, Umeta> UnwindSafe for Entry<K, V, Cid, Umeta> where
    Cid: RefUnwindSafe + UnwindSafe,
    K: RefUnwindSafe + UnwindSafe,
    Umeta: RefUnwindSafe + UnwindSafe,
    V: RefUnwindSafe + UnwindSafe

Blanket Implementations

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

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

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

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

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

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

type Error = Infallible

The type returned in the event of a conversion error.

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

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

The type returned in the event of a conversion error.

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