com.google.guava/guava/25.1-jre : com/google/common/graph/Traverser$GraphTraverser$DepthFirstIterator.class

Traverser$GraphTraverser$DepthFirstIterator
https://github.com/google/guava/guava: Guava is a suite of core and expanded libraries that include utility classes, google's collections, io classes, and much much more.
The Apache Software License, Version 2.0
Kevin Bourrillion (Google)
final class com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator extends com.google.common.collect.AbstractIterator<N>
  minor version: 0
  major version: 59
  flags: flags: (0x0030) ACC_FINAL, ACC_SUPER
  this_class: com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator
  super_class: com.google.common.collect.AbstractIterator
{
  private final java.util.Deque<com.google.common.graph.Traverser$GraphTraverser<N>.DepthFirstIterator.NodeAndSuccessors> stack;
    descriptor: Ljava/util/Deque;
    flags: (0x0012) ACC_PRIVATE, ACC_FINAL
    Signature: Ljava/util/Deque<Lcom/google/common/graph/Traverser$GraphTraverser<TN;>.DepthFirstIterator.NodeAndSuccessors;>;

  private final java.util.Set<N> visited;
    descriptor: Ljava/util/Set;
    flags: (0x0012) ACC_PRIVATE, ACC_FINAL
    Signature: Ljava/util/Set<TN;>;

  private final com.google.common.graph.Traverser$Order order;
    descriptor: Lcom/google/common/graph/Traverser$Order;
    flags: (0x0012) ACC_PRIVATE, ACC_FINAL
    Signature: Lcom/google/common/graph/Traverser$Order;

  final com.google.common.graph.Traverser$GraphTraverser this$1;
    descriptor: Lcom/google/common/graph/Traverser$GraphTraverser;
    flags: (0x1010) ACC_FINAL, ACC_SYNTHETIC

  void <init>(java.lang.Iterable<? extends N>, com.google.common.graph.Traverser$Order);
    descriptor: (Lcom/google/common/graph/Traverser$GraphTraverser;Ljava/lang/Iterable;Lcom/google/common/graph/Traverser$Order;)V
    flags: (0x0000) 
    Code:
      stack=6, locals=4, args_size=4
        start local 0 // com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator this
        start local 2 // java.lang.Iterable roots
        start local 3 // com.google.common.graph.Traverser$Order order
         0: .line 437
            aload 0 /* this */
            aload 1
            putfield com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator.this$1:Lcom/google/common/graph/Traverser$GraphTraverser;
            aload 0 /* this */
            invokespecial com.google.common.collect.AbstractIterator.<init>:()V
         1: .line 433
            aload 0 /* this */
            new java.util.ArrayDeque
            dup
            invokespecial java.util.ArrayDeque.<init>:()V
            putfield com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator.stack:Ljava/util/Deque;
         2: .line 434
            aload 0 /* this */
            new java.util.HashSet
            dup
            invokespecial java.util.HashSet.<init>:()V
            putfield com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator.visited:Ljava/util/Set;
         3: .line 438
            aload 0 /* this */
            getfield com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator.stack:Ljava/util/Deque;
            new com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator$NodeAndSuccessors
            dup
            aload 0 /* this */
            aconst_null
            aload 2 /* roots */
            invokespecial com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator$NodeAndSuccessors.<init>:(Lcom/google/common/graph/Traverser$GraphTraverser$DepthFirstIterator;Ljava/lang/Object;Ljava/lang/Iterable;)V
            invokeinterface java.util.Deque.push:(Ljava/lang/Object;)V
         4: .line 439
            aload 0 /* this */
            aload 3 /* order */
            putfield com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator.order:Lcom/google/common/graph/Traverser$Order;
         5: .line 440
            return
        end local 3 // com.google.common.graph.Traverser$Order order
        end local 2 // java.lang.Iterable roots
        end local 0 // com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator this
      LocalVariableTable:
        Start  End  Slot   Name  Signature
            0    6     0   this  Lcom/google/common/graph/Traverser$GraphTraverser$DepthFirstIterator;
            0    6     2  roots  Ljava/lang/Iterable<+TN;>;
            0    6     3  order  Lcom/google/common/graph/Traverser$Order;
    Signature: (Ljava/lang/Iterable<+TN;>;Lcom/google/common/graph/Traverser$Order;)V
    MethodParameters:
        Name  Flags
      this$0  final
      roots   
      order   

  protected N computeNext();
    descriptor: ()Ljava/lang/Object;
    flags: (0x0004) ACC_PROTECTED
    Code:
      stack=3, locals=6, args_size=1
        start local 0 // com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator this
         0: .line 445
      StackMap locals:
      StackMap stack:
            aload 0 /* this */
            getfield com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator.stack:Ljava/util/Deque;
            invokeinterface java.util.Deque.isEmpty:()Z
            ifeq 2
         1: .line 446
            aload 0 /* this */
            invokevirtual com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator.endOfData:()Ljava/lang/Object;
            areturn
         2: .line 448
      StackMap locals:
      StackMap stack:
            aload 0 /* this */
            getfield com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator.stack:Ljava/util/Deque;
            invokeinterface java.util.Deque.getFirst:()Ljava/lang/Object;
            checkcast com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator$NodeAndSuccessors
            astore 1 /* nodeAndSuccessors */
        start local 1 // com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator$NodeAndSuccessors nodeAndSuccessors
         3: .line 449
            aload 0 /* this */
            getfield com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator.visited:Ljava/util/Set;
            aload 1 /* nodeAndSuccessors */
            getfield com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator$NodeAndSuccessors.node:Ljava/lang/Object;
            invokeinterface java.util.Set.add:(Ljava/lang/Object;)Z
            istore 2 /* firstVisit */
        start local 2 // boolean firstVisit
         4: .line 450
            aload 1 /* nodeAndSuccessors */
            getfield com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator$NodeAndSuccessors.successorIterator:Ljava/util/Iterator;
            invokeinterface java.util.Iterator.hasNext:()Z
            ifeq 5
            iconst_0
            goto 6
      StackMap locals: com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator$NodeAndSuccessors int
      StackMap stack:
         5: iconst_1
      StackMap locals:
      StackMap stack: int
         6: istore 3 /* lastVisit */
        start local 3 // boolean lastVisit
         7: .line 452
            iload 2 /* firstVisit */
            ifeq 8
            aload 0 /* this */
            getfield com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator.order:Lcom/google/common/graph/Traverser$Order;
            getstatic com.google.common.graph.Traverser$Order.PREORDER:Lcom/google/common/graph/Traverser$Order;
            if_acmpeq 10
      StackMap locals: int
      StackMap stack:
         8: iload 3 /* lastVisit */
            ifeq 9
            aload 0 /* this */
            getfield com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator.order:Lcom/google/common/graph/Traverser$Order;
            getstatic com.google.common.graph.Traverser$Order.POSTORDER:Lcom/google/common/graph/Traverser$Order;
            if_acmpeq 10
         9: .line 451
      StackMap locals:
      StackMap stack:
            iconst_0
            goto 11
      StackMap locals:
      StackMap stack:
        10: iconst_1
      StackMap locals:
      StackMap stack: int
        11: istore 4 /* produceNode */
        start local 4 // boolean produceNode
        12: .line 453
            iload 3 /* lastVisit */
            ifeq 15
        13: .line 454
            aload 0 /* this */
            getfield com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator.stack:Ljava/util/Deque;
            invokeinterface java.util.Deque.pop:()Ljava/lang/Object;
            pop
        14: .line 455
            goto 18
        15: .line 457
      StackMap locals: int
      StackMap stack:
            aload 1 /* nodeAndSuccessors */
            getfield com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator$NodeAndSuccessors.successorIterator:Ljava/util/Iterator;
            invokeinterface java.util.Iterator.next:()Ljava/lang/Object;
            astore 5 /* successor */
        start local 5 // java.lang.Object successor
        16: .line 458
            aload 0 /* this */
            getfield com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator.visited:Ljava/util/Set;
            aload 5 /* successor */
            invokeinterface java.util.Set.contains:(Ljava/lang/Object;)Z
            ifne 18
        17: .line 459
            aload 0 /* this */
            getfield com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator.stack:Ljava/util/Deque;
            aload 0 /* this */
            aload 5 /* successor */
            invokevirtual com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator.withSuccessors:(Ljava/lang/Object;)Lcom/google/common/graph/Traverser$GraphTraverser$DepthFirstIterator$NodeAndSuccessors;
            invokeinterface java.util.Deque.push:(Ljava/lang/Object;)V
        end local 5 // java.lang.Object successor
        18: .line 462
      StackMap locals:
      StackMap stack:
            iload 4 /* produceNode */
            ifeq 0
            aload 1 /* nodeAndSuccessors */
            getfield com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator$NodeAndSuccessors.node:Ljava/lang/Object;
            ifnull 0
        19: .line 463
            aload 1 /* nodeAndSuccessors */
            getfield com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator$NodeAndSuccessors.node:Ljava/lang/Object;
            areturn
        end local 4 // boolean produceNode
        end local 3 // boolean lastVisit
        end local 2 // boolean firstVisit
        end local 1 // com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator$NodeAndSuccessors nodeAndSuccessors
        end local 0 // com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator this
      LocalVariableTable:
        Start  End  Slot               Name  Signature
            0   20     0               this  Lcom/google/common/graph/Traverser$GraphTraverser$DepthFirstIterator;
            3   20     1  nodeAndSuccessors  Lcom/google/common/graph/Traverser$GraphTraverser<TN;>.DepthFirstIterator.NodeAndSuccessors;
            4   20     2         firstVisit  Z
            7   20     3          lastVisit  Z
           12   20     4        produceNode  Z
           16   18     5          successor  TN;
    Signature: ()TN;

  com.google.common.graph.Traverser$GraphTraverser<N>.DepthFirstIterator.NodeAndSuccessors withSuccessors(N);
    descriptor: (Ljava/lang/Object;)Lcom/google/common/graph/Traverser$GraphTraverser$DepthFirstIterator$NodeAndSuccessors;
    flags: (0x0000) 
    Code:
      stack=6, locals=2, args_size=2
        start local 0 // com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator this
        start local 1 // java.lang.Object node
         0: .line 469
            new com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator$NodeAndSuccessors
            dup
            aload 0 /* this */
            aload 1 /* node */
            aload 0 /* this */
            getfield com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator.this$1:Lcom/google/common/graph/Traverser$GraphTraverser;
            getfield com.google.common.graph.Traverser$GraphTraverser.graph:Lcom/google/common/graph/SuccessorsFunction;
            aload 1 /* node */
            invokeinterface com.google.common.graph.SuccessorsFunction.successors:(Ljava/lang/Object;)Ljava/lang/Iterable;
            invokespecial com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator$NodeAndSuccessors.<init>:(Lcom/google/common/graph/Traverser$GraphTraverser$DepthFirstIterator;Ljava/lang/Object;Ljava/lang/Iterable;)V
            areturn
        end local 1 // java.lang.Object node
        end local 0 // com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator this
      LocalVariableTable:
        Start  End  Slot  Name  Signature
            0    1     0  this  Lcom/google/common/graph/Traverser$GraphTraverser$DepthFirstIterator;
            0    1     1  node  TN;
    Signature: (TN;)Lcom/google/common/graph/Traverser$GraphTraverser<TN;>.DepthFirstIterator.NodeAndSuccessors;
    MethodParameters:
      Name  Flags
      node  
}
Signature: Lcom/google/common/collect/AbstractIterator<TN;>;
SourceFile: "Traverser.java"
NestHost: com.google.common.graph.Traverser
InnerClasses:
  private final GraphTraverser = com.google.common.graph.Traverser$GraphTraverser of com.google.common.graph.Traverser
  private final DepthFirstIterator = com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator of com.google.common.graph.Traverser$GraphTraverser
  private final NodeAndSuccessors = com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator$NodeAndSuccessors of com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator
  private final Order = com.google.common.graph.Traverser$Order of com.google.common.graph.Traverser
/

com.google.guava/ guava/ 25.1-jre/ com/google/common/graph/Traverser$GraphTraverser$DepthFirstIterator.class
