Std.Heap

18 public declarations

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

  Whether an element is present.

  fn
• dropMin&Std.Heap.Heap[T] -> Std.Heap.Heap[T] where T: Ord

  The heap without its smallest element, unchanged when it is empty.

  fn
• emptyStd.Heap.Heap[T]

  A heap with nothing in it.

  fn
• filter&Std.Heap.Heap[T] -> fn(T) -> Bool -> Std.Heap.Heap[T] where T: Ord

  A heap of every element that satisfies a test.

  fn
• fromArray&Array[T] -> Std.Heap.Heap[T] where T: Ord

  A heap holding every element of an array.

  fn
• Heap

  A collection that always knows its smallest element.

  type
• isEmpty&Std.Heap.Heap[T] -> Bool

  Whether the heap holds nothing.

  fn
• map&Std.Heap.Heap[A] -> fn(A) -> B -> Std.Heap.Heap[B] where B: Ord

  A heap of every element transformed.

  fn
• merge&Std.Heap.Heap[T] -> &Std.Heap.Heap[T] -> Std.Heap.Heap[T] where T: Ord

  Two heaps joined into one.

  fn
• oneT -> Std.Heap.Heap[T]

  A heap of one element.

  fn
• peek&Std.Heap.Heap[T] -> Option[T]

  The smallest element, or `None` for an empty heap.

  fn
• pop&Std.Heap.Heap[T] -> Option[(T, Std.Heap.Heap[T])] where T: Ord

  The smallest element and the heap without it, or `None` when empty.

  fn
• push&Std.Heap.Heap[T] -> T -> Std.Heap.Heap[T] where T: Ord

  The heap with an element added.

  fn
• size&Std.Heap.Heap[T] -> Int

  How many elements the heap holds.

  fn
• smallest&Std.Heap.Heap[T] -> Int -> Array[T] where T: Ord

  The smallest few elements, in order.

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

  Every element, in no particular order beyond the smallest being reachable.

  fn
• toSortedArray&Std.Heap.Heap[T] -> Array[T] where T: Ord

  Every element, smallest first.

  fn
• union&Std.Heap.Heap[T] -> &Std.Heap.Heap[T] -> Std.Heap.Heap[T] where T: Ord

  Two heaps' elements in one heap.

  fn