FewestNodesHeapOrdering

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. def AlwaysBottom: Int

   

   A key that will among items on the bottom of the heap.

   A key that will among items on the bottom of the heap. Used primarily to add items that will eventually flow higher.

   Definition Classes

   FewestNodesHeapOrdering → HeapOrdering

5. def AlwaysTop: Int

   

   Minimum value for the DoubleHeap

   Minimum value for the DoubleHeap

   Definition Classes

   FewestNodesHeapOrdering → HeapOrdering

6. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

7. def checkKey(key: Int): Unit

   
   Definition Classes

   FewestNodesHeapOrdering → HeapOrdering

   Exceptions thrown

   IllegalArgumentException if the key is unusable

8. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

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

   

   Definition Classes

   AnyRef

10. def equals(arg0: Any): Boolean

    

    Definition Classes

    AnyRef → Any

11. def equiv(x: Int, y: Int): Boolean

    

    Definition Classes

    PartialOrdering → Equiv

12. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

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

    

    Definition Classes

    AnyRef → Any

14. def gt(x: Int, y: Int): Boolean

    

    Definition Classes

    PartialOrdering

15. def gteq(x: Int, y: Int): Boolean

    

    Definition Classes

    PartialOrdering

16. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

17. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

18. def keyDomainDescription: String

    

19. def lt(x: Int, y: Int): Boolean

    

    Definition Classes

    PartialOrdering

20. def lteq(x: Int, y: Int): Boolean

    

    Definition Classes

    FewestNodesHeapOrdering → PartialOrdering

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

    

    Definition Classes

    AnyRef

22. final def notify(): Unit

    

    Definition Classes

    AnyRef

23. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

24. def reverse: PartialOrdering[Int]

    

    Definition Classes

    PartialOrdering

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

    

    Definition Classes

    AnyRef

26. def toString(): String

    

    Definition Classes

    AnyRef → Any

27. def tryCompare(x: Int, y: Int): Option[Int]

    
    returns

    Some negative integer, zero, or a positive integer as the first argument is less than, equal to, or greater than the second, or None if they can't be compared

    Definition Classes

    FewestNodesHeapOrdering → PartialOrdering

28. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )