Module std::collections::linked_list
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
A cursor over a LinkedList.
A cursor over a LinkedList with editing operations.
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.
© 2010 The Rust Project Developers
Licensed under the Apache License, Version 2.0 or the MIT license, at your option.
https://doc.rust-lang.org/std/collections/linked_list/index.html