Results for “Std.Deque.Deque”

Use module:Std.List, kind:fn, or is:exact. Put a Pudu type after ::.

• Std.Deque.Deque

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

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

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

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

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

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

  Whether an element is present.

  fn · Std.Deque
• Std.Deque.dropBack&Std.Deque.Deque[T] -> Std.Deque.Deque[T]

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

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

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

  fn · Std.Deque
• Std.Deque.emptyStd.Deque.Deque[T]

  A queue with nothing in it.

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

  The elements that satisfy a test, order kept.

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

  The elements combined from the front.

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

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

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

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

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

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

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

  Whether the queue holds nothing.

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

  How many elements the queue holds.

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

  Every element transformed, order kept.

  fn · Std.Deque
• Std.Deque.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 · Std.Deque
• Std.Deque.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 · Std.Deque
• Std.Deque.pushBack&Std.Deque.Deque[T] -> T -> Std.Deque.Deque[T]

  The queue with an element added at the back.

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

  The queue with an element added at the front.

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

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

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

  Every element in order, front first.

  fn · Std.Deque