final class com.google.common.graph.Traverser$TreeTraverser$BreadthFirstIterator extends com.google.common.collect.UnmodifiableIterator<N>
minor version: 0
major version: 59
flags: flags: (0x0030) ACC_FINAL, ACC_SUPER
this_class: com.google.common.graph.Traverser$TreeTraverser$BreadthFirstIterator
super_class: com.google.common.collect.UnmodifiableIterator
{
private final java.util.Queue<N> queue;
descriptor: Ljava/util/Queue;
flags: (0x0012) ACC_PRIVATE, ACC_FINAL
Signature: Ljava/util/Queue<TN;>;
final com.google.common.graph.Traverser$TreeTraverser this$1;
descriptor: Lcom/google/common/graph/Traverser$TreeTraverser;
flags: (0x1010) ACC_FINAL, ACC_SYNTHETIC
void <init>(java.lang.Iterable<? extends N>);
descriptor: (Lcom/google/common/graph/Traverser$TreeTraverser;Ljava/lang/Iterable;)V
flags: (0x0000)
Code:
stack=3, locals=5, args_size=3
start local 0 // com.google.common.graph.Traverser$TreeTraverser$BreadthFirstIterator this
start local 2 // java.lang.Iterable roots
0: .line 571
aload 0 /* this */
aload 1
putfield com.google.common.graph.Traverser$TreeTraverser$BreadthFirstIterator.this$1:Lcom/google/common/graph/Traverser$TreeTraverser;
aload 0 /* this */
invokespecial com.google.common.collect.UnmodifiableIterator.<init>:()V
1: .line 569
aload 0 /* this */
new java.util.ArrayDeque
dup
invokespecial java.util.ArrayDeque.<init>:()V
putfield com.google.common.graph.Traverser$TreeTraverser$BreadthFirstIterator.queue:Ljava/util/Queue;
2: .line 572
aload 2 /* roots */
invokeinterface java.lang.Iterable.iterator:()Ljava/util/Iterator;
astore 4
goto 5
StackMap locals: com.google.common.graph.Traverser$TreeTraverser$BreadthFirstIterator com.google.common.graph.Traverser$TreeTraverser java.lang.Iterable top java.util.Iterator
StackMap stack:
3: aload 4
invokeinterface java.util.Iterator.next:()Ljava/lang/Object;
checkcast java.lang.Object
astore 3 /* root */
start local 3 // java.lang.Object root
4: .line 573
aload 0 /* this */
getfield com.google.common.graph.Traverser$TreeTraverser$BreadthFirstIterator.queue:Ljava/util/Queue;
aload 3 /* root */
invokeinterface java.util.Queue.add:(Ljava/lang/Object;)Z
pop
end local 3 // java.lang.Object root
5: .line 572
StackMap locals:
StackMap stack:
aload 4
invokeinterface java.util.Iterator.hasNext:()Z
ifne 3
6: .line 575
return
end local 2 // java.lang.Iterable roots
end local 0 // com.google.common.graph.Traverser$TreeTraverser$BreadthFirstIterator this
LocalVariableTable:
Start End Slot Name Signature
0 7 0 this Lcom/google/common/graph/Traverser$TreeTraverser$BreadthFirstIterator;
0 7 2 roots Ljava/lang/Iterable<+TN;>;
4 5 3 root TN;
Signature: (Ljava/lang/Iterable<+TN;>;)V
MethodParameters:
Name Flags
this$0 final
roots
public boolean hasNext();
descriptor: ()Z
flags: (0x0001) ACC_PUBLIC
Code:
stack=1, locals=1, args_size=1
start local 0 // com.google.common.graph.Traverser$TreeTraverser$BreadthFirstIterator this
0: .line 579
aload 0 /* this */
getfield com.google.common.graph.Traverser$TreeTraverser$BreadthFirstIterator.queue:Ljava/util/Queue;
invokeinterface java.util.Queue.isEmpty:()Z
ifeq 1
iconst_0
goto 2
StackMap locals:
StackMap stack:
1: iconst_1
StackMap locals:
StackMap stack: int
2: ireturn
end local 0 // com.google.common.graph.Traverser$TreeTraverser$BreadthFirstIterator this
LocalVariableTable:
Start End Slot Name Signature
0 3 0 this Lcom/google/common/graph/Traverser$TreeTraverser$BreadthFirstIterator;
public N next();
descriptor: ()Ljava/lang/Object;
flags: (0x0001) ACC_PUBLIC
Code:
stack=3, locals=2, args_size=1
start local 0 // com.google.common.graph.Traverser$TreeTraverser$BreadthFirstIterator this
0: .line 584
aload 0 /* this */
getfield com.google.common.graph.Traverser$TreeTraverser$BreadthFirstIterator.queue:Ljava/util/Queue;
invokeinterface java.util.Queue.remove:()Ljava/lang/Object;
astore 1 /* current */
start local 1 // java.lang.Object current
1: .line 585
aload 0 /* this */
getfield com.google.common.graph.Traverser$TreeTraverser$BreadthFirstIterator.queue:Ljava/util/Queue;
aload 0 /* this */
getfield com.google.common.graph.Traverser$TreeTraverser$BreadthFirstIterator.this$1:Lcom/google/common/graph/Traverser$TreeTraverser;
getfield com.google.common.graph.Traverser$TreeTraverser.tree:Lcom/google/common/graph/SuccessorsFunction;
aload 1 /* current */
invokeinterface com.google.common.graph.SuccessorsFunction.successors:(Ljava/lang/Object;)Ljava/lang/Iterable;
invokestatic com.google.common.collect.Iterables.addAll:(Ljava/util/Collection;Ljava/lang/Iterable;)Z
pop
2: .line 586
aload 1 /* current */
areturn
end local 1 // java.lang.Object current
end local 0 // com.google.common.graph.Traverser$TreeTraverser$BreadthFirstIterator this
LocalVariableTable:
Start End Slot Name Signature
0 3 0 this Lcom/google/common/graph/Traverser$TreeTraverser$BreadthFirstIterator;
1 3 1 current TN;
Signature: ()TN;
}
Signature: Lcom/google/common/collect/UnmodifiableIterator<TN;>;
SourceFile: "Traverser.java"
NestHost: com.google.common.graph.Traverser
InnerClasses:
private final TreeTraverser = com.google.common.graph.Traverser$TreeTraverser of com.google.common.graph.Traverser
private final BreadthFirstIterator = com.google.common.graph.Traverser$TreeTraverser$BreadthFirstIterator of com.google.common.graph.Traverser$TreeTraverser