Struct RemovedEntry 

pub struct RemovedEntry<K, T> {
    pub key: K,
    pub value: T,
    pub prev: Option<Ptr>,
    pub next: Option<Ptr>,
}

Represents an entry that was removed from the linked hash map.

Contains the key-value pair along with the pointers to the previous and next entries in the linked list, allowing for potential reinsertion at the same position.

Examples

use tether_map::LinkedHashMap;

let mut map = LinkedHashMap::new();
map.insert("key", 42);
let ptr = map.get_ptr(&"key").unwrap();

let removed = map.remove_ptr(ptr).unwrap();
assert_eq!(removed.key, "key");
assert_eq!(removed.value, 42);

Fields

key: K

The key of the removed entry

value: T

The value of the removed entry

prev: Option<Ptr>

Pointer to the previous entry in the linked list

next: Option<Ptr>

Pointer to the next entry in the linked list

Trait Implementations

impl<K: Clone, T: Clone> Clone for RemovedEntry<K, T>

fn clone(&self) -> RemovedEntry<K, T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K: Debug, T: Debug> Debug for RemovedEntry<K, T>

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

Formats the value using the given formatter.

impl<K: PartialEq, T: PartialEq> PartialEq for RemovedEntry<K, T>

fn eq(&self, other: &RemovedEntry<K, T>) -> 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: Copy, T: Copy> Copy for RemovedEntry<K, T>

impl<K: Eq, T: Eq> Eq for RemovedEntry<K, T>

impl<K, T> StructuralPartialEq for RemovedEntry<K, T>