Crate linked_list

Source
Expand description

An alternative implementation of std::collections::LinkedList, featuring experimental Cursor-based APIs.

Structsยง

  • A Cursor is like an iterator, except that it can freely seek back-and-forth, and can safely mutate the list during iteration. This is because the lifetime of its yielded references are tied to its own lifetime, instead of just the underlying list. This means cursors cannot yield multiple elements at once.
  • An iterator over mutable references to the items of a LinkedList.
  • An iterator over references to the items of a LinkedList.
  • An iterator over mutable references to the items of a LinkedList.
  • An experimental rewrite of LinkedList to provide a more cursor-oriented API.