# Module alloc::linked_list 1.0.0 [−] [src]

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.

## Structs

IntoIter | An owning iterator over the elements of a `LinkedList`.
Iter | An iterator over the elements of a `LinkedList`.
IterMut | A mutable iterator over the elements of a `LinkedList`.
LinkedList | A doubly-linked list with owned nodes.
BackPlace | [ Experimental ] A place for insertion at the back of a `LinkedList`.
DrainFilter | [ Experimental ] An iterator produced by calling `drain_filter` on LinkedList.
FrontPlace | [ Experimental ] A place for insertion at the front of a `LinkedList`.

# Help

## Keyboard Shortcuts

`?`
  Show this help dialog
`S`
  Focus the search field
`↑`
  Move up in search results
`↓`
  Move down in search results
`↹`
  Switch tab
`⏎`
  Go to active search result
`+`
  Expand all sections
`-`
  Collapse all sections

## Search Tricks

Prefix searches with a type followed by a colon (e.g. `fn:`) to restrict the search to a given type.

Accepted types are: `fn`, `mod`, `struct`, `enum`, `trait`, `type`, `macro`, and `const`.

Search functions by type signature (e.g. `vec -> usize` or `* -> vec`)