- Companion
- object
Value members
Abstract methods
Dequeues the least element from the PQueue, possibly semantically blocking until an element becomes available.
Dequeues the least element from the PQueue, possibly semantically blocking until an element becomes available.
O(log(n))
Note: If there are multiple elements with least priority, the order in which they are
dequeued is undefined. If you want to break ties with FIFO order you will need an
additional Ref[F, Long] to track insertion, and embed that information into your instance
for Order[A].
Attempts to dequeue the least element from the PQueue, if one is available without semantically blocking.
Attempts to dequeue the least element from the PQueue, if one is available without semantically blocking.
O(log(n))
- Returns
an effect that describes whether the dequeueing of an element from the PQueue succeeded without blocking, with
Nonedenoting that no element was available Note: If there are multiple elements with least priority, the order in which they are dequeued is undefined. If you want to break ties with FIFO order you will need an additionalRef[F, Long]to track insertion, and embed that information into your instance forOrder[A].