Struct EntryHandle 

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

A handle to an entry in a LinkedHashMap.

This handle wraps a NodeHandle from the underlying linked list and provides methods to manipulate the position of entries within the map’s iteration order. Handles can be copied and passed around by value regardless of the lifetime of the map.

Once an entry is removed from the map, its handle becomes invalid. Using an invalid handle is safe - methods will return false or None to indicate the handle is no longer valid.

Examples

use deepmesa_collections::LinkedHashMap;
use deepmesa_collections::lhmap::Order;

let mut lhm = LinkedHashMap::<u16, &str>::new(10, Order::InsertionOrder, None);
lhm.put(1, "a");
lhm.put(2, "b");

if let Some(handle) = lhm.entry_handle(&1) {
    // Move entry with key 1 to the end of iteration order
    lhm.make_tail(handle);
}

Trait Implementations

impl<K: Clone, V: Clone> Clone for EntryHandle<K, V>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K: Debug, V: Debug> Debug for EntryHandle<K, V>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<K, V> Default for EntryHandle<K, V>

fn default() -> Self

Creates a default (invalid) entry handle.

impl<K, V> PartialEq for EntryHandle<K, V>

where K: PartialEq, V: PartialEq,

fn eq(&self, other: &Self) -> 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, V> Eq for EntryHandle<K, V>

where K: Eq, V: Eq,

impl<K, V> Send for EntryHandle<K, V>

where K: Hash + Eq,

impl<K, V> Sync for EntryHandle<K, V>

where K: Hash + Eq,