Token List

A data structure similar to std::collections::LinkedList, but it allows retrieval and removal of interior nodes by means of a Token.

Code of Conduct

The maintainers of this project follow the Code of Conduct established by the Rust Programming Language team. If moderation is required, please contact the maintainers.

Maintainers

• John VanEnk <@sw17ch>

lib.rs:

A double-ended queue (deque) that allows internal nodes to be removed in addition to the front and the back of the list.

Internally, the deque uses a Vec, and tracks next, previous, front, and back elements by index.

As items are removed from the deque, their memory in the Vec is put on an internal free list. This free list is used when items are inserted into the list before the internal Vec is expanded.