za
.
co
.
absa
.
commons
.
graph
.
GraphImplicits
DAGNodeTraversableOps
Related Doc:
package GraphImplicits
implicit final
class
DAGNodeTraversableOps
[
Node
,
M
[
X
]
<:
Seq
[
X
]
]
extends
AnyVal
Linear Supertypes
AnyVal
,
Any
Ordering
Alphabetic
By Inheritance
Inherited
DAGNodeTraversableOps
AnyVal
Any
Hide All
Show All
Visibility
Public
All
Instance Constructors
new
DAGNodeTraversableOps
(
xs:
M
[
Node
]
)
Value Members
final
def
!=
(
arg0:
Any
)
:
Boolean
Definition Classes
Any
final
def
##
()
:
Int
Definition Classes
Any
final
def
==
(
arg0:
Any
)
:
Boolean
Definition Classes
Any
final
def
asInstanceOf
[
T0
]
:
T0
Definition Classes
Any
def
getClass
()
:
Class
[_ <:
AnyVal
]
Definition Classes
AnyVal → Any
final
def
isInstanceOf
[
T0
]
:
Boolean
Definition Classes
Any
def
sortedTopologically
[
Id
]
(
reverse:
Boolean
=
false
)
(
implicit
nim:
DAGNodeIdMapping
[
Node
,
Id
]
,
cbf:
CanBuildFrom
[
M
[
Node
],
Node
,
M
[
Node
]]
)
:
M
[
Node
]
def
sortedTopologicallyBy
[
Id
]
(
selfIdFn: (
Node
) ⇒
Id
,
refIdsFn: (
Node
) ⇒
Traversable
[
Id
]
,
reverse:
Boolean
=
false
)
(
implicit
cbf:
CanBuildFrom
[
M
[
Node
],
Node
,
M
[
Node
]]
)
:
M
[
Node
]
def
toString
()
:
String
Definition Classes
Any
val
xs
:
M
[
Node
]
Inherited from
AnyVal
Inherited from
Any
Ungrouped