gleamy_structures/priority_queue

Types

pub type Queue(a) =
  heap.Heap(a)

</>

pub fn count(queue: Heap(a)) -> Int

</>

pub fn from_list(
  list: List(a),
  compare: fn(a, a) -> Order,
) -> Heap(a)

</>

pub fn is_empty(queue: Heap(a)) -> Bool

</>

pub fn new(compare: fn(a, a) -> Order) -> Heap(a)

</>

pub fn peek(from queue: Heap(a)) -> Result(a, Nil)

</>

pub fn pop(from queue: Heap(a)) -> Result(#(a, Heap(a)), Nil)

</>

pub fn push(onto queue: Heap(a), this item: a) -> Heap(a)

</>

pub fn reorder(
  queue: Heap(a),
  compare: fn(a, a) -> Order,
) -> Heap(a)

</>

pub fn to_list(queue: Heap(a)) -> List(a)