net.walend

heap

package heap

Visibility
  1. Public
  2. All

Type Members

  1. class FibonacciHeap[K, V] extends Heap[K, V]

    A generic Fibonacci heap

    A generic Fibonacci heap

    Since

    v0.0.0

  2. trait Heap[K, V] extends AnyRef

    A structure that makes an extreme key of some key,value pair available

    A structure that makes an extreme key of some key,value pair available

    Since

    v0.0.0

  3. trait HeapOrdering[K] extends PartialOrdering[K]

    The heap moves the greatest value to the top, according to some HeapOrdering.

    The heap moves the greatest value to the top, according to some HeapOrdering.

    K

    the key type in this heap map.

Value Members

  1. object FibonacciHeap

  2. object Heap

  3. object MinDoubleHeapOrdering extends HeapOrdering[Double]

    A heap ordering that puts the least Double on top.

    A heap ordering that puts the least Double on top.

    If you imitate this code, observe that lteq and tryCompare find the inverse of what you'd have for MaxDoubleHeapOrdering.

Ungrouped