A doubly-linked list with owned nodes.
The LinkedList
allows pushing and popping elements at either end in constant time.
Almost always it is better to use Vec
or VecDeque
instead of LinkedList
. In general, array-based containers are faster, more memory efficient and make better use of CPU cache.
IntoIter | An iterator over the elements of a |
Iter | An iterator over references to the elements of a |
IterMut | An iterator over mutable references to the elements of a |
LinkedList | A doubly-linked list with owned nodes. |
BackPlace | [ Experimental ] A place for insertion at the back of a |
FrontPlace | [ Experimental ] A place for insertion at the front of a |
© 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