Structs
To check if the list contains a node, iterate over all the nodes in the list until we find the target one. O(1) space but O(n) time.
Doubly linked, heterogeneous, list of Arc
-like nodes that functions as a least recently used cache.
Traits
WeakList
storage, needs to be able to tell whether a node belongs to this list.
Functions
Try to downcast the result of WeakList::pop_lru
back into an ArcRef<T>
. Returns the passed
Arc
back in case of error.
Type Definitions
Default WeakList
storage: a hashset of pointer values.
O(n) space but O(1) time.