Module scale_info::prelude::collections::linked_list

1.0.0 · source ·
Expand description

A doubly-linked list with owned nodes.

The LinkedList allows pushing and popping elements at either end in constant time.

NOTE: It is almost always better to use Vec or VecDeque because array-based containers are generally faster, more memory efficient, and make better use of CPU cache.

Structs

CursorExperimental
A cursor over a LinkedList.
CursorMutExperimental
A cursor over a LinkedList with editing operations.
DrainFilterExperimental
An iterator produced by calling drain_filter on LinkedList.
An owning iterator over the elements of a LinkedList.
An iterator over the elements of a LinkedList.
A mutable iterator over the elements of a LinkedList.
A doubly-linked list with owned nodes.