final class com.google.common.graph.Traverser$TreeTraverser$DepthFirstPreOrderIterator 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$DepthFirstPreOrderIterator
  super_class: com.google.common.collect.UnmodifiableIterator
{
  private final java.util.Deque<java.util.Iterator<? extends N>> stack;
    descriptor: Ljava/util/Deque;
    flags: (0x0012) ACC_PRIVATE, ACC_FINAL
    Signature: Ljava/util/Deque<Ljava/util/Iterator<+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=3, args_size=3
        start local 0 // com.google.common.graph.Traverser$TreeTraverser$DepthFirstPreOrderIterator this
        start local 2 // java.lang.Iterable roots
         0: .line 593
            aload 0 /* this */
            aload 1
            putfield com.google.common.graph.Traverser$TreeTraverser$DepthFirstPreOrderIterator.this$1:Lcom/google/common/graph/Traverser$TreeTraverser;
            aload 0 /* this */
            invokespecial com.google.common.collect.UnmodifiableIterator.<init>:()V
         1: .line 591
            aload 0 /* this */
            new java.util.ArrayDeque
            dup
            invokespecial java.util.ArrayDeque.<init>:()V
            putfield com.google.common.graph.Traverser$TreeTraverser$DepthFirstPreOrderIterator.stack:Ljava/util/Deque;
         2: .line 594
            aload 0 /* this */
            getfield com.google.common.graph.Traverser$TreeTraverser$DepthFirstPreOrderIterator.stack:Ljava/util/Deque;
            aload 2 /* roots */
            invokeinterface java.lang.Iterable.iterator:()Ljava/util/Iterator;
            invokeinterface java.util.Deque.addLast:(Ljava/lang/Object;)V
         3: .line 595
            return
        end local 2 // java.lang.Iterable roots
        end local 0 // com.google.common.graph.Traverser$TreeTraverser$DepthFirstPreOrderIterator this
      LocalVariableTable:
        Start  End  Slot   Name  Signature
            0    4     0   this  Lcom/google/common/graph/Traverser$TreeTraverser$DepthFirstPreOrderIterator;
            0    4     2  roots  Ljava/lang/Iterable<+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$DepthFirstPreOrderIterator this
         0: .line 599
            aload 0 /* this */
            getfield com.google.common.graph.Traverser$TreeTraverser$DepthFirstPreOrderIterator.stack:Ljava/util/Deque;
            invokeinterface java.util.Deque.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$DepthFirstPreOrderIterator this
      LocalVariableTable:
        Start  End  Slot  Name  Signature
            0    3     0  this  Lcom/google/common/graph/Traverser$TreeTraverser$DepthFirstPreOrderIterator;

  public N next();
    descriptor: ()Ljava/lang/Object;
    flags: (0x0001) ACC_PUBLIC
    Code:
      stack=2, locals=4, args_size=1
        start local 0 // com.google.common.graph.Traverser$TreeTraverser$DepthFirstPreOrderIterator this
         0: .line 604
            aload 0 /* this */
            getfield com.google.common.graph.Traverser$TreeTraverser$DepthFirstPreOrderIterator.stack:Ljava/util/Deque;
            invokeinterface java.util.Deque.getLast:()Ljava/lang/Object;
            checkcast java.util.Iterator
            astore 1 /* iterator */
        start local 1 // java.util.Iterator iterator
         1: .line 605
            aload 1 /* iterator */
            invokeinterface java.util.Iterator.next:()Ljava/lang/Object;
            invokestatic com.google.common.base.Preconditions.checkNotNull:(Ljava/lang/Object;)Ljava/lang/Object;
            astore 2 /* result */
        start local 2 // java.lang.Object result
         2: .line 606
            aload 1 /* iterator */
            invokeinterface java.util.Iterator.hasNext:()Z
            ifne 4
         3: .line 607
            aload 0 /* this */
            getfield com.google.common.graph.Traverser$TreeTraverser$DepthFirstPreOrderIterator.stack:Ljava/util/Deque;
            invokeinterface java.util.Deque.removeLast:()Ljava/lang/Object;
            pop
         4: .line 609
      StackMap locals: java.util.Iterator java.lang.Object
      StackMap stack:
            aload 0 /* this */
            getfield com.google.common.graph.Traverser$TreeTraverser$DepthFirstPreOrderIterator.this$1:Lcom/google/common/graph/Traverser$TreeTraverser;
            getfield com.google.common.graph.Traverser$TreeTraverser.tree:Lcom/google/common/graph/SuccessorsFunction;
            aload 2 /* result */
            invokeinterface com.google.common.graph.SuccessorsFunction.successors:(Ljava/lang/Object;)Ljava/lang/Iterable;
            invokeinterface java.lang.Iterable.iterator:()Ljava/util/Iterator;
            astore 3 /* childIterator */
        start local 3 // java.util.Iterator childIterator
         5: .line 610
            aload 3 /* childIterator */
            invokeinterface java.util.Iterator.hasNext:()Z
            ifeq 7
         6: .line 611
            aload 0 /* this */
            getfield com.google.common.graph.Traverser$TreeTraverser$DepthFirstPreOrderIterator.stack:Ljava/util/Deque;
            aload 3 /* childIterator */
            invokeinterface java.util.Deque.addLast:(Ljava/lang/Object;)V
         7: .line 613
      StackMap locals: java.util.Iterator
      StackMap stack:
            aload 2 /* result */
            areturn
        end local 3 // java.util.Iterator childIterator
        end local 2 // java.lang.Object result
        end local 1 // java.util.Iterator iterator
        end local 0 // com.google.common.graph.Traverser$TreeTraverser$DepthFirstPreOrderIterator this
      LocalVariableTable:
        Start  End  Slot           Name  Signature
            0    8     0           this  Lcom/google/common/graph/Traverser$TreeTraverser$DepthFirstPreOrderIterator;
            1    8     1       iterator  Ljava/util/Iterator<+TN;>;
            2    8     2         result  TN;
            5    8     3  childIterator  Ljava/util/Iterator<+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 DepthFirstPreOrderIterator = com.google.common.graph.Traverser$TreeTraverser$DepthFirstPreOrderIterator of com.google.common.graph.Traverser$TreeTraverser