Struct RectEntry 

pub struct RectEntry<K: Hash + Eq + Clone, V: Clone, D> {
    pub width: u32,
    pub height: u32,
    pub key: K,
    pub value: V,
    pub entry_data: D,
}

The entry of a rect to be cached.

Fields

width: u32

The width of the rect to be cached.

height: u32

The height of the rect to be cached.

key: K

The key that will be mapped to the cached rect.

value: V

A value which will be associated with the cached rect.

entry_data: D

A value it will be associated with this rect entry. This is not stored in the cache, but it is used to do operations with this entry right after adding it.

Trait Implementations

impl<K: Clone + Hash + Eq + Clone, V: Clone + Clone, D: Clone> Clone for RectEntry<K, V, D>

fn clone(&self) -> RectEntry<K, V, D>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<K: Hash + Hash + Eq + Clone, V: Hash + Clone, D: Hash> Hash for RectEntry<K, V, D>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<K: PartialEq + Hash + Eq + Clone, V: PartialEq + Clone, D: PartialEq> PartialEq for RectEntry<K, V, D>

fn eq(&self, other: &RectEntry<K, V, D>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<K: Eq + Hash + Eq + Clone, V: Eq + Clone, D: Eq> Eq for RectEntry<K, V, D>

impl<K: Hash + Eq + Clone, V: Clone, D> StructuralPartialEq for RectEntry<K, V, D>