Std.Deque

21 public declarations

• back&Std.Deque.Deque[T] -> Option[T]

  The element at the back, or `None` for an empty queue.

  fn
• concat&Std.Deque.Deque[T] -> &Std.Deque.Deque[T] -> Std.Deque.Deque[T]

  Two queues joined, the left one's elements first.

  fn
• contains&Std.Deque.Deque[T] -> T -> Bool where T: Eq

  Whether an element is present.

  fn
• Deque

  A queue that can be added to and taken from at either end.

  type
• dropBack&Std.Deque.Deque[T] -> Std.Deque.Deque[T]

  The queue without its back element, unchanged when there is none.

  fn
• dropFront&Std.Deque.Deque[T] -> Std.Deque.Deque[T]

  The queue without its front element, unchanged when there is none.

  fn
• emptyStd.Deque.Deque[T]

  A queue with nothing in it.

  fn
• filter&Std.Deque.Deque[T] -> fn(T) -> Bool -> Std.Deque.Deque[T]

  The elements that satisfy a test, order kept.

  fn
• fold&Std.Deque.Deque[T] -> A -> fn(A, T) -> A -> A

  The elements combined from the front.

  fn
• fromArray&Array[T] -> Std.Deque.Deque[T]

  A queue holding the elements of an array, first at the front.

  fn
• front&Std.Deque.Deque[T] -> Option[T]

  The element at the front, or `None` for an empty queue.

  fn
• get&Std.Deque.Deque[T] -> Int -> Option[T]

  The element at a position counted from the front, or `None`.

  fn
• isEmpty&Std.Deque.Deque[T] -> Bool

  Whether the queue holds nothing.

  fn
• length&Std.Deque.Deque[T] -> Int

  How many elements the queue holds.

  fn
• map&Std.Deque.Deque[A] -> fn(A) -> B -> Std.Deque.Deque[B]

  Every element transformed, order kept.

  fn
• popBack&Std.Deque.Deque[T] -> Option[(T, Std.Deque.Deque[T])]

  The back element and the queue without it, or `None` when there is none.

  fn
• popFront&Std.Deque.Deque[T] -> Option[(T, Std.Deque.Deque[T])]

  The front element and the queue without it, or `None` when there is none.

  fn
• pushBack&Std.Deque.Deque[T] -> T -> Std.Deque.Deque[T]

  The queue with an element added at the back.

  fn
• pushFront&Std.Deque.Deque[T] -> T -> Std.Deque.Deque[T]

  The queue with an element added at the front.

  fn
• reversed&Std.Deque.Deque[T] -> Std.Deque.Deque[T]

  The queue with its ends exchanged, so what was first is last.

  fn
• toArray&Std.Deque.Deque[T] -> Array[T]

  Every element in order, front first.

  fn