Module linked_list

Source
Expand description

An intrusive double linked list of data.

The data structure supports tracking pinned nodes. Most of the data structure’s APIs are unsafe as they require the caller to ensure the specified node is actually contained by the list.

StructsΒ§

DrainFilter πŸ”’
GuardedLinkedList πŸ”’
An intrusive linked list, but instead of keeping pointers to the head and tail nodes, it uses a special guard node linked with those nodes. It means that the list is circular and every pointer of a node from the list is not None, including pointers from the guard node.
LinkedList πŸ”’
An intrusive linked list.
Pointers πŸ”’
Previous / next pointers.
PointersInner πŸ”’
We do not want the compiler to put the noalias attribute on mutable references to this type, so the type has been made !Unpin with a PhantomPinned field.

TraitsΒ§

Link πŸ”’
Defines how a type is tracked within a linked list.