# [−][src]Function crossbeam_deque::fifo

    pub fn fifo<T>() -> (Worker<T>, Stealer<T>)

Creates a work-stealing deque with the first-in first-out strategy.

Elements are pushed into the back, popped from the front, and stolen from the front. In other words, the worker side behaves as a FIFO queue.

# Examples

    use crossbeam_deque::{self as deque, Pop, Steal};

    let (w, s) = deque::fifo::<i32>();
    w.push(1);
    w.push(2);
    w.push(3);

    assert_eq!(s.steal(), Steal::Data(1));
    assert_eq!(w.pop(), Pop::Data(2));
    assert_eq!(w.pop(), Pop::Data(3));

# 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`)

Search multiple things at once by splitting your query with comma (e.g., `str,u8` or `String,struct:Vec,test`)