invariants.core.algo.heap

BinomialHeap

class BinomialHeap [T] extends AnyRef

This is a binary heap that is efficient; all operations are in O(log(n)) smallest first

T

the type of elements included in the heap

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Hide All
  2. Show all
  1. BinomialHeap
  2. AnyRef
  3. Any
Visibility
  1. Public
  2. All

Instance Constructors

  1. new BinomialHeap (GetKey: (T) ⇒ Int, maxsize: Int)(implicit X: Manifest[T])

    GetKey

    a function that returns an integer for each element inserted i nthe heap this value is used to sort the heap content

    maxsize

    the maximum number of elements that can be inserted in this heap

    X

    the manifest of T, to create arrays of T's

Value Members

  1. def != (arg0: AnyRef): Boolean

    Attributes
    final
    Definition Classes
    AnyRef

  2. def != (arg0: Any): Boolean

    Attributes
    final
    Definition Classes
    Any

  3. def ## (): Int

    Attributes
    final
    Definition Classes
    AnyRef → Any

  4. def == (arg0: AnyRef): Boolean

    Attributes
    final
    Definition Classes
    AnyRef

  5. def == (arg0: Any): Boolean

    Attributes
    final
    Definition Classes
    Any

  6. var HeapArray : Array[T]

  7. implicit val X : Manifest[T]

    the manifest of T, to create arrays of T's

    the manifest of T, to create arrays of T's

    Attributes
    implicit

  8. def asInstanceOf [T0] : T0

    Attributes
    final
    Definition Classes
    Any

  9. def clone (): AnyRef

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

  10. def eq (arg0: AnyRef): Boolean

    Attributes
    final
    Definition Classes
    AnyRef

  11. def equals (arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  12. def finalize (): Unit

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

  13. def getClass (): java.lang.Class[_]

    Attributes
    final
    Definition Classes
    AnyRef → Any

  14. def getFirst : T

    O(1)

  15. def getFirsts : List[T]

    O(firsts)

  16. def hashCode (): Int

    Definition Classes
    AnyRef → Any

  17. def insert (elem: T): Unit

    log(n)

  18. def isInstanceOf [T0] : Boolean

    Attributes
    final
    Definition Classes
    Any

  19. val maxsize : Int

    the maximum number of elements that can be inserted in this heap

  20. def ne (arg0: AnyRef): Boolean

    Attributes
    final
    Definition Classes
    AnyRef

  21. def notify (): Unit

    Attributes
    final
    Definition Classes
    AnyRef

  22. def notifyAll (): Unit

    Attributes
    final
    Definition Classes
    AnyRef

  23. def removeFirst (): T

    O(log(n))

  24. var size : Int

  25. def synchronized [T0] (arg0: ⇒ T0): T0

    Attributes
    final
    Definition Classes
    AnyRef

  26. def toString (): String

    Definition Classes
    BinomialHeap → AnyRef → Any

  27. def wait (): Unit

    Attributes
    final
    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Attributes
    final
    Definition Classes
    AnyRef
    Annotations
    @throws()

  29. def wait (arg0: Long): Unit

    Attributes
    final
    Definition Classes
    AnyRef
    Annotations
    @throws()

Inherited from AnyRef

Inherited from Any