• Home
• net.sourceforge.plantuml
• plantuml-epl
• 1.2024.7
• source code
• Traverser$Traversal.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$Traversal.class Maven / Gradle / Ivy

????4j

java/lang/Object

()V		

+com/google/common/graph/Traverser$Traversal
successorFunction
,Lcom/google/common/graph/SuccessorsFunction;
java/util/HashSet


-com/google/common/graph/Traverser$Traversal$1

>(Lcom/google/common/graph/SuccessorsFunction;Ljava/util/Set;)V
-com/google/common/graph/Traverser$Traversal$2

/(Lcom/google/common/graph/SuccessorsFunction;)V	
0com/google/common/graph/Traverser$InsertionOrder
BACK
2Lcom/google/common/graph/Traverser$InsertionOrder;
!"#
topDown
\(Ljava/util/Iterator;Lcom/google/common/graph/Traverser$InsertionOrder;)Ljava/util/Iterator;	%&
FRONT(
java/util/ArrayDeque
'+,-./
java/util/Deque
add
(Ljava/lang/Object;)Z1
-com/google/common/graph/Traverser$Traversal$3
034
s(Lcom/google/common/graph/Traverser$Traversal;Ljava/util/Deque;Lcom/google/common/graph/Traverser$InsertionOrder;)V6
-com/google/common/graph/Traverser$Traversal$4
589
R(Lcom/google/common/graph/Traverser$Traversal;Ljava/util/Deque;Ljava/util/Deque;)V
	Signature
1Lcom/google/common/graph/SuccessorsFunction;
Code
LineNumberTable
LocalVariableTable
this
-Lcom/google/common/graph/Traverser$Traversal;
LocalVariableTypeTable
2Lcom/google/common/graph/Traverser$Traversal;
MethodParameters
4(Lcom/google/common/graph/SuccessorsFunction;)V
inGraph
[(Lcom/google/common/graph/SuccessorsFunction;)Lcom/google/common/graph/Traverser$Traversal;
graph
visited
Ljava/util/Set;
Ljava/util/Set;
{(Lcom/google/common/graph/SuccessorsFunction;)Lcom/google/common/graph/Traverser$Traversal;
inTree
tree
breadthFirst
*(Ljava/util/Iterator;)Ljava/util/Iterator;

startNodes
Ljava/util/Iterator;
Ljava/util/Iterator<+TN;>;
5(Ljava/util/Iterator<+TN;>;)Ljava/util/Iterator;
preOrder
order
horizon
Ljava/util/Deque;
-Ljava/util/Deque;>;
g(Ljava/util/Iterator<+TN;>;Lcom/google/common/graph/Traverser$InsertionOrder;)Ljava/util/Iterator;
	postOrder

ancestorStack
Ljava/util/Deque;
	visitNext
%(Ljava/util/Deque;)Ljava/lang/Object;
2(Ljava/util/Deque;>;)TN;
RuntimeVisibleAnnotations
Ljavax/annotation/CheckForNull;
(Ljava/lang/Object;

SourceFile
Traverser.java
InnerClassesg
!com/google/common/graph/Traverser
	Traversal
InsertionOrder 

:;<b
*?
*+??=
|
}	
~>
?@

A
?B
;
C
:DEF<f?
Y?L?Y*+??=

?
?>G
HI
AG;
HJ
C
G:KLF<E
	?Y*??=

?>
	MA
	M;C
M:KNO<Y	*+?? ?=

?>	?@	PQ
A	?B	PR
C
P:STO<Y	*+?$? ?=

?>	?@	PQ
A	?B	PR
C
P:S"#<??'Y?)N-+?*W?0Y*-,?2?=
?
?
?>*?@PQ
UVWA ?BPR
VXC	PU:YZO<?#?'Y?)M?'Y?)N-+?*W?5Y*-,?7?=
?
?
?
?>*#?@#PQ
VWA*#?B#PR
[\VXC
P:S]^C
V:_`
a:bcde2fh
fiD
05