scalax
.
collection
.
GraphDegree
DegreeOrdering
final
class
DegreeOrdering
extends
Ordering
[(
GraphDegree
.this)#
NodeT
]
Decreasing ordering of nodes with respect to their degree.
Linear Supertypes
Ordering
[(
GraphDegree
.this)#
NodeT
],
PartialOrdering
[(
GraphDegree
.this)#
NodeT
],
Equiv
[(
GraphDegree
.this)#
NodeT
],
Serializable
,
Serializable
,
Comparator
[(
GraphDegree
.this)#
NodeT
],
AnyRef
,
Any
Type Hierarchy
Learn more about scaladoc diagrams
(GraphDegree.this)#DegreeOrdering
Ordering[(GraphDegree.this)#NodeT]
Ordering
Alphabetic
By inheritance
Inherited
DegreeOrdering
Ordering
PartialOrdering
Equiv
Serializable
Serializable
Comparator
AnyRef
Any
Hide All
Show all
Learn more about member selection
Visibility
Public
All
Instance Constructors
new
DegreeOrdering
(
f: (
GraphDegree
.this)#
DegreeFunction
)
Type Members
class
Ops
extends
AnyRef
Definition Classes
Ordering
Value Members
final
def
!=
(
arg0:
AnyRef
)
:
Boolean
Definition Classes
AnyRef
final
def
!=
(
arg0:
Any
)
:
Boolean
Definition Classes
Any
final
def
##
()
:
Int
Definition Classes
AnyRef → Any
final
def
==
(
arg0:
AnyRef
)
:
Boolean
Definition Classes
AnyRef
final
def
==
(
arg0:
Any
)
:
Boolean
Definition Classes
Any
final
def
asInstanceOf
[
T0
]
:
T0
Definition Classes
Any
def
clone
()
:
AnyRef
Attributes
protected[
java.lang
]
Definition Classes
AnyRef
Annotations
@throws
(
...
)
def
compare
(
n1: (
GraphDegree
.this)#
NodeT
,
n2: (
GraphDegree
.this)#
NodeT
)
:
Int
Definition Classes
DegreeOrdering
→ Ordering → Comparator
final
def
eq
(
arg0:
AnyRef
)
:
Boolean
Definition Classes
AnyRef
def
equals
(
arg0:
Any
)
:
Boolean
Definition Classes
AnyRef → Any
def
equiv
(
x: (
GraphDegree
.this)#
NodeT
,
y: (
GraphDegree
.this)#
NodeT
)
:
Boolean
Definition Classes
Ordering → PartialOrdering → Equiv
val
f
: (
GraphDegree
.this)#
DegreeFunction
def
finalize
()
:
Unit
Attributes
protected[
java.lang
]
Definition Classes
AnyRef
Annotations
@throws
(
classOf[java.lang.Throwable]
)
final
def
getClass
()
:
Class
[_]
Definition Classes
AnyRef → Any
def
gt
(
x: (
GraphDegree
.this)#
NodeT
,
y: (
GraphDegree
.this)#
NodeT
)
:
Boolean
Definition Classes
Ordering → PartialOrdering
def
gteq
(
x: (
GraphDegree
.this)#
NodeT
,
y: (
GraphDegree
.this)#
NodeT
)
:
Boolean
Definition Classes
Ordering → PartialOrdering
def
hashCode
()
:
Int
Definition Classes
AnyRef → Any
final
def
isInstanceOf
[
T0
]
:
Boolean
Definition Classes
Any
def
lt
(
x: (
GraphDegree
.this)#
NodeT
,
y: (
GraphDegree
.this)#
NodeT
)
:
Boolean
Definition Classes
Ordering → PartialOrdering
def
lteq
(
x: (
GraphDegree
.this)#
NodeT
,
y: (
GraphDegree
.this)#
NodeT
)
:
Boolean
Definition Classes
Ordering → PartialOrdering
def
max
(
x: (
GraphDegree
.this)#
NodeT
,
y: (
GraphDegree
.this)#
NodeT
)
: (
GraphDegree
.this)#
NodeT
Definition Classes
Ordering
def
min
(
x: (
GraphDegree
.this)#
NodeT
,
y: (
GraphDegree
.this)#
NodeT
)
: (
GraphDegree
.this)#
NodeT
Definition Classes
Ordering
implicit
def
mkOrderingOps
(
lhs: (
GraphDegree
.this)#
NodeT
)
:
Ops
Definition Classes
Ordering
final
def
ne
(
arg0:
AnyRef
)
:
Boolean
Definition Classes
AnyRef
final
def
notify
()
:
Unit
Definition Classes
AnyRef
final
def
notifyAll
()
:
Unit
Definition Classes
AnyRef
def
on
[
U
]
(
f: (
U
) ⇒ (
GraphDegree
.this)#
NodeT
)
:
Ordering
[
U
]
Definition Classes
Ordering
def
reverse
:
Ordering
[(
GraphDegree
.this)#
NodeT
]
Definition Classes
Ordering → PartialOrdering
final
def
synchronized
[
T0
]
(
arg0: ⇒
T0
)
:
T0
Definition Classes
AnyRef
def
toString
()
:
String
Definition Classes
AnyRef → Any
def
tryCompare
(
x: (
GraphDegree
.this)#
NodeT
,
y: (
GraphDegree
.this)#
NodeT
)
:
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
@throws
(
...
)
Inherited from
Ordering
[(
GraphDegree
.this)#
NodeT
]
Inherited from
PartialOrdering
[(
GraphDegree
.this)#
NodeT
]
Inherited from
Equiv
[(
GraphDegree
.this)#
NodeT
]
Inherited from
Serializable
Inherited from
Serializable
Inherited from
Comparator
[(
GraphDegree
.this)#
NodeT
]
Inherited from
AnyRef
Inherited from
Any
Ungrouped
Decreasing ordering of nodes with respect to their degree.