• Home
• net.sourceforge.plantuml
• plantuml-epl
• 1.2024.7
• source code
• Traverser.class

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

com.google.common.graph.Traverser.class Maven / Gradle / Ivy

????4?

!com/google/common/graph/Traverser

/(Lcom/google/common/graph/SuccessorsFunction;)V
	

java/lang/Object
()V


$com/google/common/base/Preconditions
checkNotNull
&(Ljava/lang/Object;)Ljava/lang/Object;
*com/google/common/graph/SuccessorsFunction	
successorFunction
,Lcom/google/common/graph/SuccessorsFunction;
#com/google/common/graph/Traverser$1

[(Lcom/google/common/graph/SuccessorsFunction;Lcom/google/common/graph/SuccessorsFunction;)V
!com/google/common/graph/BaseGraph !"

isDirected
()Z$
%Undirected graphs can never be trees.

&'(

checkArgument
(ZLjava/lang/Object;)V*
com/google/common/graph/Network) -
'Undirected networks can never be trees./
#com/google/common/graph/Traverser$2
.
23456
&com/google/common/collect/ImmutableSet
of
<(Ljava/lang/Object;)Lcom/google/common/collect/ImmutableSet;
89:
breadthFirst
*(Ljava/lang/Iterable;)Ljava/lang/Iterable;
<=>
validate
>(Ljava/lang/Iterable;)Lcom/google/common/collect/ImmutableSet;@
#com/google/common/graph/Traverser$3
?BC
N(Lcom/google/common/graph/Traverser;Lcom/google/common/collect/ImmutableSet;)V
EF:
depthFirstPreOrderH
#com/google/common/graph/Traverser$4
GB
KL:
depthFirstPostOrderN
#com/google/common/graph/Traverser$5
MB
2QR>
copyOf
2TUV
iterator
2()Lcom/google/common/collect/UnmodifiableIterator;XYZ["
java/util/Iterator
hasNextX]^_
next
()Ljava/lang/Object;abc

successors
((Ljava/lang/Object;)Ljava/lang/Iterable;
	Signature
1Lcom/google/common/graph/SuccessorsFunction;
Code
LineNumberTable
LocalVariableTable
this
#Lcom/google/common/graph/Traverser;
LocalVariableTypeTable
(Lcom/google/common/graph/Traverser;
MethodParameters
4(Lcom/google/common/graph/SuccessorsFunction;)V
forGraph
Q(Lcom/google/common/graph/SuccessorsFunction;)Lcom/google/common/graph/Traverser;
graph
q(Lcom/google/common/graph/SuccessorsFunction;)Lcom/google/common/graph/Traverser;
forTree
tree

StackMapTable
	startNode
Ljava/lang/Object;
TN;
(TN;)Ljava/lang/Iterable;

startNodes
Ljava/lang/Iterable;
	validated
(Lcom/google/common/collect/ImmutableSet;
Ljava/lang/Iterable<+TN;>;
-Lcom/google/common/collect/ImmutableSet;
5(Ljava/lang/Iterable<+TN;>;)Ljava/lang/Iterable;
newTraversal
/()Lcom/google/common/graph/Traverser$Traversal;
4()Lcom/google/common/graph/Traverser$Traversal;
node
copy
I(Ljava/lang/Iterable<+TN;>;)Lcom/google/common/collect/ImmutableSet;
T(Lcom/google/common/graph/SuccessorsFunction;Lcom/google/common/graph/Traverser$1;)V
x0
x1
%Lcom/google/common/graph/Traverser$1;
(Ljava/lang/Object;

SourceFile
Traverser.java
RuntimeVisibleAnnotations
-Lcom/google/errorprone/annotations/DoNotMock;
value
fCall forGraph or forTree, passing a lambda or a Graph with the desired edges (built with GraphBuilder)
9Lcom/google/common/graph/ElementTypesAreNonnullByDefault;
RuntimeInvisibleAnnotations
$Lcom/google/common/annotations/Beta;
InnerClasses?
0com/google/common/graph/Traverser$InsertionOrder
InsertionOrder?
+com/google/common/graph/Traverser$Traversal
	Traversal!

defh*?*+????gGHIhij
kile
m
dn	opfF

?Y**??g
dh

qk

qem
qdr	spf?
4*??*??
#?%*?)?*?)?+
,?%?.Y**?0?g????*?h
4tk
4teum
tdr9cfY	*+?1?7?g
?h	ij	vw
k	il	vx
m
vdy9:fx*+?;M??Y*,?A?g
??h ijz{

|}k ilz~

|m
zd?FcfY	*+?1?D?g

h	ij	vw
k	il	vx
m
vdyF:fx*+?;M?GY*,?I?g

)
*h ijz{

|}k ilz~

|m
zd?LcfY	*+?1?J?g

Rh	ij	vw
k	il	vx
m
vdyL:fx*+?;M?MY*,?O?g

`
ah ijz{

|}k ilz~

|m
zd???
d?=>f?,+?PM,?SN-?W
?-?\
:*??`W???,?g
m
n
o'
p*
qh*?w,ij,z{
'?}k*?x,il,z~
'?u?
2X?m
zd??
fV*+?
?g
Dh ij?
??k
ild?????
?s???
??:.?GM??D
??