• Home
• net.sourceforge.plantuml
• plantuml
• 1.2024.6
• 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?
!f
"g
hij	!kl
mnop
hqrost
m
Uu
!v
!wx
y
!z{
y
!|}
y
U~
UV?V?????
InsertionOrder
InnerClasses?
	Traversal
successorFunction
,Lcom/google/common/graph/SuccessorsFunction;
	Signature
1Lcom/google/common/graph/SuccessorsFunction;

/(Lcom/google/common/graph/SuccessorsFunction;)V
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
breadthFirst
((Ljava/lang/Object;)Ljava/lang/Iterable;
	startNode
Ljava/lang/Object;
TN;
(TN;)Ljava/lang/Iterable;
*(Ljava/lang/Iterable;)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;
depthFirstPreOrder
depthFirstPostOrder
newTraversal
/()Lcom/google/common/graph/Traverser$Traversal;
4()Lcom/google/common/graph/Traverser$Traversal;
validate
>(Ljava/lang/Iterable;)Lcom/google/common/collect/ImmutableSet;
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;,-,????
*com/google/common/graph/SuccessorsFunction()
#com/google/common/graph/Traverser$1,?
!com/google/common/graph/BaseGraph??
%Undirected graphs can never be trees.??
com/google/common/graph/Network
'Undirected networks can never be trees.
#com/google/common/graph/Traverser$2??>DQR
#com/google/common/graph/Traverser$3,?LD
#com/google/common/graph/Traverser$4MD
#com/google/common/graph/Traverser$5?R????????
!com/google/common/graph/Traverser
java/lang/Object
0com/google/common/graph/Traverser$InsertionOrder
+com/google/common/graph/Traverser$Traversal
&com/google/common/collect/ImmutableSet
java/util/Iterator
()V
$com/google/common/base/Preconditions
checkNotNull
&(Ljava/lang/Object;)Ljava/lang/Object;
[(Lcom/google/common/graph/SuccessorsFunction;Lcom/google/common/graph/SuccessorsFunction;)V

isDirected
()Z

checkArgument
(ZLjava/lang/Object;)V
of
<(Ljava/lang/Object;)Lcom/google/common/collect/ImmutableSet;
N(Lcom/google/common/graph/Traverser;Lcom/google/common/collect/ImmutableSet;)V
copyOf
iterator
2()Lcom/google/common/collect/UnmodifiableIterator;
hasNext
next
()Ljava/lang/Object;

successors!!"
()
*+,-.h*?*+????/GHI012()
314(+
5
(*6	78.F

?Y**??/
d0

9)3

9+5
9*:	;8.?
4*??*??	

?*??*??

??Y**??/????*?0
4<)3
4<+=5
<*:>?.Y	*+???/
?0	12	@A
3	14	@B
5
@*C>D.x*+?M?Y*,??/
??0 12EF

GH3 14EI

GJ5
E*KL?.Y	*+???/

0	12	@A
3	14	@B
5
@*CLD.x*+?M?Y*,??/

)
*0 12EF

GH3 14EI

GJ5
E*KM?.Y	*+???/

R0	12	@A
3	14	@B
5
@*CMD.x*+?M?Y*,??/

`
a0 12EF

GH3 14EI

GJ5
E*KNO
*PQR.?,+?M,?N-?
?-?
:*?? W???,?/
m
n
o'
p*
q0*SA,12,EF
'TH3*SB,14,EI
'TJ=?
UV?5
E*W,X
.V*+?
?/
D0 12Y)
Z[3
14*\]^_`
asbcd
e%:#!$D
&!'