soal.util

HeapMappedIntPriorityQueue

Related Doc: package util

class HeapMappedIntPriorityQueue extends MappedIntPriorityQueue

Standard binary heap, based on Chapter 6 of CLRS Algorithms 2nd Ed.

Linear Supertypes
MappedIntPriorityQueue, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. HeapMappedIntPriorityQueue
  2. MappedIntPriorityQueue
  3. AnyRef
  4. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new HeapMappedIntPriorityQueue()

Value Members

  1. final def !=(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Definition Classes
    AnyRef → Any

  3. final def ==(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  4. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  5. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  6. def contains(a: Int): Boolean

    Definition Classes
    HeapMappedIntPriorityQueue → MappedIntPriorityQueue

  7. def currentPriorities(): Map[Int, Float]

  8. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  9. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  10. def extractMax(): Int

    Definition Classes
    HeapMappedIntPriorityQueue → MappedIntPriorityQueue

  11. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  12. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any

  13. def getPriority(a: Int): Float

    Definition Classes
    HeapMappedIntPriorityQueue → MappedIntPriorityQueue

  14. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  15. def increasePriority(a: Int, newPriority: Float): Unit

    Sets the priority of a to newPriority, which must be greater than a's current priority if a is in this queue.

    Sets the priority of a to newPriority, which must be greater than a's current priority if a is in this queue. Inserts a if it is not already present.

    Definition Classes
    HeapMappedIntPriorityQueue → MappedIntPriorityQueue

  16. def insert(a: Int, priority: Float): Unit

    Definition Classes
    HeapMappedIntPriorityQueue → MappedIntPriorityQueue

  17. def isEmpty: Boolean

    Definition Classes
    HeapMappedIntPriorityQueue → MappedIntPriorityQueue

  18. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  19. def maxPriority: Float

    Definition Classes
    HeapMappedIntPriorityQueue → MappedIntPriorityQueue

  20. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  21. final def notify(): Unit

    Definition Classes
    AnyRef

  22. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  23. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef

  24. def toString(): String

    Definition Classes
    AnyRef → Any

  25. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  26. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  27. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from MappedIntPriorityQueue

Inherited from AnyRef

Inherited from Any

Ungrouped