fetchOrderedRemove

If there is an Entry with a matching key, it is deleted from the hash map, and then returned from this function. The entry is removed from the underlying array by shifting all elements forward thereby maintaining the current ordering.

Function parameters

Parameters

self:*Self
key:K

Type definitions in this namespace

Types

StringContext

An `ArrayHashMap` with default hash and equal functions.

Functions

AutoArrayHashMap: An `ArrayHashMap` with default hash and equal functions.
AutoArrayHashMapUnmanaged: An `ArrayHashMapUnmanaged` with default hash and equal functions.
StringArrayHashMap: An `ArrayHashMap` with strings as keys.
StringArrayHashMapUnmanaged: An `ArrayHashMapUnmanaged` with strings as keys.
eqlString
hashString
ArrayHashMap: Deprecated in favor of `ArrayHashMapWithAllocator` (no code changes needed)
ArrayHashMapWithAllocator: A hash table of keys and values, each stored sequentially.
ArrayHashMapUnmanaged: A hash table of keys and values, each stored sequentially.
getHashPtrAddrFn
getTrivialEqlFn
AutoContext
getAutoHashFn
getAutoEqlFn
autoEqlIsCheap
getAutoHashStratFn

Source

Implementation

pub fn fetchOrderedRemove(self: *Self, key: K) ?KV {
    return self.unmanaged.fetchOrderedRemoveContext(key, self.ctx);
}