object NodeOrder2 extends Ordering[Elem]
The NodeOrder
object defines the order of node indices based on
their 'key' value. Using +key to get "largest first" in priority queue.
This is for maximum spanning trees ('min' = false)
- Alphabetic
- By Inheritance
- NodeOrder2
- Ordering
- PartialOrdering
- Equiv
- Serializable
- Serializable
- Comparator
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Type Members
-
class
Ops extends AnyRef
- Definition Classes
- Ordering
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
def
compare(e1: Elem, e2: Elem): Int
- Definition Classes
- NodeOrder2 → Ordering → Comparator
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
equiv(x: Elem, y: Elem): Boolean
- Definition Classes
- Ordering → PartialOrdering → Equiv
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
gt(x: Elem, y: Elem): Boolean
- Definition Classes
- Ordering → PartialOrdering
-
def
gteq(x: Elem, y: Elem): Boolean
- Definition Classes
- Ordering → PartialOrdering
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
lt(x: Elem, y: Elem): Boolean
- Definition Classes
- Ordering → PartialOrdering
-
def
lteq(x: Elem, y: Elem): Boolean
- Definition Classes
- Ordering → PartialOrdering
-
def
max(x: Elem, y: Elem): Elem
- Definition Classes
- Ordering
-
def
min(x: Elem, y: Elem): Elem
- Definition Classes
- Ordering
-
implicit
def
mkOrderingOps(lhs: Elem): Ops
- Definition Classes
- Ordering
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
def
on[U](f: (U) ⇒ Elem): Ordering[U]
- Definition Classes
- Ordering
-
def
reverse: Ordering[Elem]
- Definition Classes
- Ordering → PartialOrdering
-
def
reversed(): Comparator[Elem]
- Definition Classes
- Comparator
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
thenComparing[U <: Comparable[_ >: U]](arg0: Function[_ >: Elem, _ <: U]): Comparator[Elem]
- Definition Classes
- Comparator
-
def
thenComparing[U](arg0: Function[_ >: Elem, _ <: U], arg1: Comparator[_ >: U]): Comparator[Elem]
- Definition Classes
- Comparator
-
def
thenComparing(arg0: Comparator[_ >: Elem]): Comparator[Elem]
- Definition Classes
- Comparator
-
def
thenComparingDouble(arg0: ToDoubleFunction[_ >: Elem]): Comparator[Elem]
- Definition Classes
- Comparator
-
def
thenComparingInt(arg0: ToIntFunction[_ >: Elem]): Comparator[Elem]
- Definition Classes
- Comparator
-
def
thenComparingLong(arg0: ToLongFunction[_ >: Elem]): Comparator[Elem]
- Definition Classes
- Comparator
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
def
tryCompare(x: Elem, y: Elem): Some[Int]
- Definition Classes
- Ordering → PartialOrdering
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )