abstract class com.google.common.graph.Traverser$Traversal<N>
minor version: 0
major version: 59
flags: flags: (0x0420) ACC_SUPER, ACC_ABSTRACT
this_class: com.google.common.graph.Traverser$Traversal
super_class: java.lang.Object
{
final com.google.common.graph.SuccessorsFunction<N> successorFunction;
descriptor: Lcom/google/common/graph/SuccessorsFunction;
flags: (0x0010) ACC_FINAL
Signature: Lcom/google/common/graph/SuccessorsFunction<TN;>;
void <init>(com.google.common.graph.SuccessorsFunction<N>);
descriptor: (Lcom/google/common/graph/SuccessorsFunction;)V
flags: (0x0000)
Code:
stack=2, locals=2, args_size=2
start local 0 start local 1 0: aload 0
invokespecial java.lang.Object.<init>:()V
1: aload 0
aload 1
putfield com.google.common.graph.Traverser$Traversal.successorFunction:Lcom/google/common/graph/SuccessorsFunction;
2: return
end local 1 end local 0 LocalVariableTable:
Start End Slot Name Signature
0 3 0 this Lcom/google/common/graph/Traverser$Traversal<TN;>;
0 3 1 successorFunction Lcom/google/common/graph/SuccessorsFunction<TN;>;
Signature: (Lcom/google/common/graph/SuccessorsFunction<TN;>;)V
MethodParameters:
Name Flags
successorFunction
static <N> com.google.common.graph.Traverser$Traversal<N> inGraph(com.google.common.graph.SuccessorsFunction<N>);
descriptor: (Lcom/google/common/graph/SuccessorsFunction;)Lcom/google/common/graph/Traverser$Traversal;
flags: (0x0008) ACC_STATIC
Code:
stack=4, locals=2, args_size=1
start local 0 0: new java.util.HashSet
dup
invokespecial java.util.HashSet.<init>:()V
astore 1
start local 1 1: new com.google.common.graph.Traverser$Traversal$1
dup
aload 0
aload 1
invokespecial com.google.common.graph.Traverser$Traversal$1.<init>:(Lcom/google/common/graph/SuccessorsFunction;Ljava/util/Set;)V
areturn
end local 1 end local 0 LocalVariableTable:
Start End Slot Name Signature
0 2 0 graph Lcom/google/common/graph/SuccessorsFunction<TN;>;
1 2 1 visited Ljava/util/Set<TN;>;
Signature: <N:Ljava/lang/Object;>(Lcom/google/common/graph/SuccessorsFunction<TN;>;)Lcom/google/common/graph/Traverser$Traversal<TN;>;
MethodParameters:
Name Flags
graph
static <N> com.google.common.graph.Traverser$Traversal<N> inTree(com.google.common.graph.SuccessorsFunction<N>);
descriptor: (Lcom/google/common/graph/SuccessorsFunction;)Lcom/google/common/graph/Traverser$Traversal;
flags: (0x0008) ACC_STATIC
Code:
stack=3, locals=1, args_size=1
start local 0 0: new com.google.common.graph.Traverser$Traversal$2
dup
aload 0
invokespecial com.google.common.graph.Traverser$Traversal$2.<init>:(Lcom/google/common/graph/SuccessorsFunction;)V
areturn
end local 0 LocalVariableTable:
Start End Slot Name Signature
0 1 0 tree Lcom/google/common/graph/SuccessorsFunction<TN;>;
Signature: <N:Ljava/lang/Object;>(Lcom/google/common/graph/SuccessorsFunction<TN;>;)Lcom/google/common/graph/Traverser$Traversal<TN;>;
MethodParameters:
Name Flags
tree
final java.util.Iterator<N> breadthFirst(java.util.Iterator<? extends N>);
descriptor: (Ljava/util/Iterator;)Ljava/util/Iterator;
flags: (0x0010) ACC_FINAL
Code:
stack=3, locals=2, args_size=2
start local 0 start local 1 0: aload 0
aload 1
getstatic com.google.common.graph.Traverser$InsertionOrder.BACK:Lcom/google/common/graph/Traverser$InsertionOrder;
invokevirtual com.google.common.graph.Traverser$Traversal.topDown:(Ljava/util/Iterator;Lcom/google/common/graph/Traverser$InsertionOrder;)Ljava/util/Iterator;
areturn
end local 1 end local 0 LocalVariableTable:
Start End Slot Name Signature
0 1 0 this Lcom/google/common/graph/Traverser$Traversal<TN;>;
0 1 1 startNodes Ljava/util/Iterator<+TN;>;
Signature: (Ljava/util/Iterator<+TN;>;)Ljava/util/Iterator<TN;>;
MethodParameters:
Name Flags
startNodes
final java.util.Iterator<N> preOrder(java.util.Iterator<? extends N>);
descriptor: (Ljava/util/Iterator;)Ljava/util/Iterator;
flags: (0x0010) ACC_FINAL
Code:
stack=3, locals=2, args_size=2
start local 0 start local 1 0: aload 0
aload 1
getstatic com.google.common.graph.Traverser$InsertionOrder.FRONT:Lcom/google/common/graph/Traverser$InsertionOrder;
invokevirtual com.google.common.graph.Traverser$Traversal.topDown:(Ljava/util/Iterator;Lcom/google/common/graph/Traverser$InsertionOrder;)Ljava/util/Iterator;
areturn
end local 1 end local 0 LocalVariableTable:
Start End Slot Name Signature
0 1 0 this Lcom/google/common/graph/Traverser$Traversal<TN;>;
0 1 1 startNodes Ljava/util/Iterator<+TN;>;
Signature: (Ljava/util/Iterator<+TN;>;)Ljava/util/Iterator<TN;>;
MethodParameters:
Name Flags
startNodes
private java.util.Iterator<N> topDown(java.util.Iterator<? extends N>, com.google.common.graph.Traverser$InsertionOrder);
descriptor: (Ljava/util/Iterator;Lcom/google/common/graph/Traverser$InsertionOrder;)Ljava/util/Iterator;
flags: (0x0002) ACC_PRIVATE
Code:
stack=5, locals=4, args_size=3
start local 0 start local 1 start local 2 0: new java.util.ArrayDeque
dup
invokespecial java.util.ArrayDeque.<init>:()V
astore 3
start local 3 1: aload 3
aload 1
invokeinterface java.util.Deque.add:(Ljava/lang/Object;)Z
pop
2: new com.google.common.graph.Traverser$Traversal$3
dup
aload 0
aload 3
aload 2
invokespecial com.google.common.graph.Traverser$Traversal$3.<init>:(Lcom/google/common/graph/Traverser$Traversal;Ljava/util/Deque;Lcom/google/common/graph/Traverser$InsertionOrder;)V
areturn
end local 3 end local 2 end local 1 end local 0 LocalVariableTable:
Start End Slot Name Signature
0 3 0 this Lcom/google/common/graph/Traverser$Traversal<TN;>;
0 3 1 startNodes Ljava/util/Iterator<+TN;>;
0 3 2 order Lcom/google/common/graph/Traverser$InsertionOrder;
1 3 3 horizon Ljava/util/Deque<Ljava/util/Iterator<+TN;>;>;
Signature: (Ljava/util/Iterator<+TN;>;Lcom/google/common/graph/Traverser$InsertionOrder;)Ljava/util/Iterator<TN;>;
MethodParameters:
Name Flags
startNodes
order final
final java.util.Iterator<N> postOrder(java.util.Iterator<? extends N>);
descriptor: (Ljava/util/Iterator;)Ljava/util/Iterator;
flags: (0x0010) ACC_FINAL
Code:
stack=5, locals=4, args_size=2
start local 0 start local 1 0: new java.util.ArrayDeque
dup
invokespecial java.util.ArrayDeque.<init>:()V
astore 2
start local 2 1: new java.util.ArrayDeque
dup
invokespecial java.util.ArrayDeque.<init>:()V
astore 3
start local 3 2: aload 3
aload 1
invokeinterface java.util.Deque.add:(Ljava/lang/Object;)Z
pop
3: new com.google.common.graph.Traverser$Traversal$4
dup
aload 0
aload 3
aload 2
invokespecial com.google.common.graph.Traverser$Traversal$4.<init>:(Lcom/google/common/graph/Traverser$Traversal;Ljava/util/Deque;Ljava/util/Deque;)V
areturn
end local 3 end local 2 end local 1 end local 0 LocalVariableTable:
Start End Slot Name Signature
0 4 0 this Lcom/google/common/graph/Traverser$Traversal<TN;>;
0 4 1 startNodes Ljava/util/Iterator<+TN;>;
1 4 2 ancestorStack Ljava/util/Deque<TN;>;
2 4 3 horizon Ljava/util/Deque<Ljava/util/Iterator<+TN;>;>;
Signature: (Ljava/util/Iterator<+TN;>;)Ljava/util/Iterator<TN;>;
MethodParameters:
Name Flags
startNodes
abstract N visitNext(java.util.Deque<java.util.Iterator<? extends N>>);
descriptor: (Ljava/util/Deque;)Ljava/lang/Object;
flags: (0x0400) ACC_ABSTRACT
Signature: (Ljava/util/Deque<Ljava/util/Iterator<+TN;>;>;)TN;
RuntimeVisibleTypeAnnotations:
METHOD_RETURN
org.checkerframework.checker.nullness.qual.Nullable()
MethodParameters:
Name Flags
horizon
}
Signature: <N:Ljava/lang/Object;>Ljava/lang/Object;
SourceFile: "Traverser.java"
NestHost: com.google.common.graph.Traverser
InnerClasses:
private abstract InsertionOrder = com.google.common.graph.Traverser$InsertionOrder of com.google.common.graph.Traverser
private abstract Traversal = com.google.common.graph.Traverser$Traversal of com.google.common.graph.Traverser
com.google.common.graph.Traverser$Traversal$1
com.google.common.graph.Traverser$Traversal$2
com.google.common.graph.Traverser$Traversal$3
com.google.common.graph.Traverser$Traversal$4