libref.spec

AHeap

object AHeap

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

Value Members

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

    Definition Classes
    AnyRef

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

    Definition Classes
    Any

  3. final def ##(): Int

    Definition Classes
    AnyRef → Any

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

    Definition Classes
    AnyRef

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

    Definition Classes
    Any

  6. def acc_drop_rotate[T](array: MapArray[T], c: (T, T) ⇒ Int, r: BigInt): Boolean

    This lemma may need a 80 seconds timeout to verify.

  7. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  8. def child_is_descendant(i: BigInt): Boolean

  9. def clone(): AnyRef

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

  10. def deleteMin[T](array: MapArray[T], c: (T, T) ⇒ Int): MapArray[T]

  11. def deleteMin_op[T](array: MapArray[T], c: (T, T) ⇒ Int): MapArray[T]

  12. def deleteMin_perm[T](array: MapArray[T], c: (T, T) ⇒ Int): Boolean

  13. def deleteMin_root[T](array: MapArray[T], c: (T, T) ⇒ Int): Boolean

    Annotations
    @ignore()

  14. def deleteMin_toList_perm[T](array: MapArray[T], c: (T, T) ⇒ Int): Boolean

  15. def descendant_is_larger(r: BigInt, i: BigInt): Boolean

  16. def drop_rotate_well_ordered[T](array: MapArray[T], c: (T, T) ⇒ Int, r: BigInt): Boolean

  17. def dual[T](c: (T, T) ⇒ Int, x: T, y: T): Boolean

    Annotations
    @library()

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

    Definition Classes
    AnyRef

  19. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  20. def finalize(): Unit

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

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

    Definition Classes
    AnyRef → Any

  22. def hasDescendant(r: BigInt, i: BigInt): Boolean

  23. def has_descendant_tran(i: BigInt, j: BigInt, k: BigInt): Boolean

  24. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  25. def insert[T](array: MapArray[T], c: (T, T) ⇒ Int, e: T): MapArray[T]

  26. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  27. def is_descendant_of_zero(i: BigInt): Boolean

  28. def left(i: BigInt): BigInt

  29. def left_or_right_child(i: BigInt): Boolean

  30. def left_or_right_descendant(r: BigInt, i: BigInt): Boolean

  31. def merge[T](a1: MapArray[T], a2: MapArray[T], c: (T, T) ⇒ Int): MapArray[T]

  32. def merge_op[T](a1: MapArray[T], a2: MapArray[T], c: (T, T) ⇒ Int): MapArray[T]

  33. def merge_perm[T](a1: MapArray[T], a2: MapArray[T], c: (T, T) ⇒ Int): Boolean

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

    Definition Classes
    AnyRef

  35. def not_has_descendant(r: BigInt, i: BigInt, j: BigInt): Boolean

  36. def not_has_descendant(r: BigInt, i: BigInt): Boolean

  37. final def notify(): Unit

    Definition Classes
    AnyRef

  38. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  39. def parent(i: BigInt): BigInt

  40. def partially_ordered[T](array: MapArray[T], c: (T, T) ⇒ Int, i: BigInt): Boolean

  41. def partially_ordered[T](array: MapArray[T], c: (T, T) ⇒ Int, r: BigInt, i: BigInt): Boolean

  42. def partially_ordered_at[T](array: MapArray[T], c: (T, T) ⇒ Int, r: BigInt, i: BigInt, j: BigInt): Boolean

  43. def partially_ordered_is_well_ordered[T](array: MapArray[T], c: (T, T) ⇒ Int, r: BigInt, i: BigInt): Boolean

  44. def partially_ordered_swap[T](array: MapArray[T], c: (T, T) ⇒ Int, r: BigInt, i: BigInt, j: BigInt): Boolean

    This lemma may need a 10 seconds timeout to verify.

  45. def percolatingDown[T](array: MapArray[T], c: (T, T) ⇒ Int, r: BigInt): MapArray[T]

  46. def percolatingDown_compare[T](array: MapArray[T], c: (T, T) ⇒ Int, r: BigInt): Boolean

  47. def percolatingDown_else[T](array: MapArray[T], c: (T, T) ⇒ Int, r: BigInt): Boolean

  48. def percolatingDown_ind[T](array: MapArray[T], c: (T, T) ⇒ Int, r: BigInt): Boolean

  49. def percolatingDown_op[T](array: MapArray[T], c: (T, T) ⇒ Int, r: BigInt): MapArray[T]

  50. def percolatingDown_perm[T](array: MapArray[T], c: (T, T) ⇒ Int, r: BigInt): Boolean

  51. def percolatingDown_root[T](array: MapArray[T], c: (T, T) ⇒ Int, r: BigInt): Boolean

  52. def percolatingDown_sibling[T](array: MapArray[T], c: (T, T) ⇒ Int, r: BigInt, i: BigInt): Boolean

  53. def percolatingDown_valid[T](array: MapArray[T], c: (T, T) ⇒ Int, r: BigInt): Boolean

  54. def percolatingDown_value_unchanged[T](array: MapArray[T], c: (T, T) ⇒ Int, r: BigInt, i: BigInt): Boolean

    This lemma may need a 8 seconds timeout to verify.

  55. def percolatingUp[T](array: MapArray[T], c: (T, T) ⇒ Int, r: BigInt, i: BigInt): MapArray[T]

  56. def percolatingUp_ind[T](array: MapArray[T], c: (T, T) ⇒ Int, r: BigInt, i: BigInt): Boolean

  57. def percolatingUp_ind1[T](array: MapArray[T], c: (T, T) ⇒ Int, r: BigInt, i: BigInt): Boolean

  58. def percolatingUp_ind2[T](array: MapArray[T], c: (T, T) ⇒ Int, r: BigInt, i: BigInt): Boolean

  59. def percolatingUp_ind3[T](array: MapArray[T], c: (T, T) ⇒ Int, r: BigInt, i: BigInt): Boolean

  60. def percolatingUp_op[T](array: MapArray[T], c: (T, T) ⇒ Int, r: BigInt, i: BigInt): MapArray[T]

  61. def percolatingUp_perm[T](array: MapArray[T], c: (T, T) ⇒ Int, r: BigInt, i: BigInt): Boolean

  62. def percolatingUp_root[T](array: MapArray[T], c: (T, T) ⇒ Int, r: BigInt, i: BigInt): Boolean

  63. def percolatingUp_valid[T](array: MapArray[T], c: (T, T) ⇒ Int, r: BigInt, i: BigInt): Boolean

  64. def reflexivity[T](c: (T, T) ⇒ Int, x: T): Boolean

    Annotations
    @library()

  65. def right(i: BigInt): BigInt

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

    Definition Classes
    AnyRef

  67. def toString(): String

    Definition Classes
    AnyRef → Any

  68. def transitive[T](c: (T, T) ⇒ Int, x: T, y: T, z: T): Boolean

    Annotations
    @library()

  69. def valid[T](array: MapArray[T], c: (T, T) ⇒ Int): Boolean

  70. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  73. def well_ordered[T](array: MapArray[T], c: (T, T) ⇒ Int): Boolean

  74. def well_ordered[T](array: MapArray[T], c: (T, T) ⇒ Int, r: BigInt): Boolean

  75. def well_ordered_append[T](array: MapArray[T], c: (T, T) ⇒ Int, r: BigInt, e: T): Boolean

  76. def well_ordered_at[T](array: MapArray[T], c: (T, T) ⇒ Int, i: BigInt): Boolean

  77. def well_ordered_at[T](array: MapArray[T], c: (T, T) ⇒ Int, r: BigInt, i: BigInt): Boolean

  78. def well_ordered_is_partially_ordered[T](array: MapArray[T], c: (T, T) ⇒ Int, r: BigInt, i: BigInt): Boolean

  79. def well_ordered_swap[T](array: MapArray[T], c: (T, T) ⇒ Int, r: BigInt, i: BigInt, j: BigInt): Boolean

    This lemma may need a 6 seconds timeout to verify.

  80. def well_ordered_swap_root[T](array: MapArray[T], c: (T, T) ⇒ Int, r: BigInt, i: BigInt): Boolean

  81. def well_ordered_take[T](array: MapArray[T], c: (T, T) ⇒ Int, r: BigInt, n: BigInt): Boolean

  82. def well_ordered_updated[T](array: MapArray[T], c: (T, T) ⇒ Int, r: BigInt, i: BigInt, e: T): Boolean

Inherited from AnyRef

Inherited from Any

Ungrouped