public final class org.eclipse.aether.util.graph.visitor.TreeDependencyVisitor extends java.lang.Object implements org.eclipse.aether.graph.DependencyVisitor
{
private final java.util.Map visitedNodes;
private final org.eclipse.aether.graph.DependencyVisitor visitor;
private final org.eclipse.aether.util.graph.visitor.Stack visits;
public void <init>(org.eclipse.aether.graph.DependencyVisitor)
{
java.util.IdentityHashMap v;
org.eclipse.aether.util.graph.visitor.TreeDependencyVisitor v;
org.eclipse.aether.graph.DependencyVisitor v;
java.lang.Object v;
org.eclipse.aether.util.graph.visitor.Stack v;
v := @this: org.eclipse.aether.util.graph.visitor.TreeDependencyVisitor;
v := @parameter: org.eclipse.aether.graph.DependencyVisitor;
specialinvoke v.<java.lang.Object: void <init>()>();
v = staticinvoke <java.util.Objects: java.lang.Object requireNonNull(java.lang.Object,java.lang.String)>(v, "dependency visitor delegate cannot be null");
v.<org.eclipse.aether.util.graph.visitor.TreeDependencyVisitor: org.eclipse.aether.graph.DependencyVisitor visitor> = v;
v = new java.util.IdentityHashMap;
specialinvoke v.<java.util.IdentityHashMap: void <init>(int)>(512);
v.<org.eclipse.aether.util.graph.visitor.TreeDependencyVisitor: java.util.Map visitedNodes> = v;
v = new org.eclipse.aether.util.graph.visitor.Stack;
specialinvoke v.<org.eclipse.aether.util.graph.visitor.Stack: void <init>()>();
v.<org.eclipse.aether.util.graph.visitor.TreeDependencyVisitor: org.eclipse.aether.util.graph.visitor.Stack visits> = v;
return;
}
public boolean visitEnter(org.eclipse.aether.graph.DependencyNode)
{
org.eclipse.aether.graph.DependencyNode v;
org.eclipse.aether.util.graph.visitor.Stack v;
org.eclipse.aether.util.graph.visitor.TreeDependencyVisitor v;
java.util.Map v;
java.lang.Boolean v, v;
org.eclipse.aether.graph.DependencyVisitor v;
java.lang.Object v;
boolean v, v;
v := @this: org.eclipse.aether.util.graph.visitor.TreeDependencyVisitor;
v := @parameter: org.eclipse.aether.graph.DependencyNode;
v = v.<org.eclipse.aether.util.graph.visitor.TreeDependencyVisitor: java.util.Map visitedNodes>;
v = <java.lang.Boolean: java.lang.Boolean TRUE>;
v = interfaceinvoke v.<java.util.Map: java.lang.Object put(java.lang.Object,java.lang.Object)>(v, v);
if v == null goto label;
v = 1;
goto label;
label:
v = 0;
label:
v = v.<org.eclipse.aether.util.graph.visitor.TreeDependencyVisitor: org.eclipse.aether.util.graph.visitor.Stack visits>;
v = staticinvoke <java.lang.Boolean: java.lang.Boolean valueOf(boolean)>(v);
virtualinvoke v.<org.eclipse.aether.util.graph.visitor.Stack: void push(java.lang.Object)>(v);
if v == 0 goto label;
return 0;
label:
v = v.<org.eclipse.aether.util.graph.visitor.TreeDependencyVisitor: org.eclipse.aether.graph.DependencyVisitor visitor>;
v = interfaceinvoke v.<org.eclipse.aether.graph.DependencyVisitor: boolean visitEnter(org.eclipse.aether.graph.DependencyNode)>(v);
return v;
}
public boolean visitLeave(org.eclipse.aether.graph.DependencyNode)
{
org.eclipse.aether.util.graph.visitor.TreeDependencyVisitor v;
org.eclipse.aether.graph.DependencyNode v;
org.eclipse.aether.graph.DependencyVisitor v;
java.lang.Object v;
boolean v, v;
org.eclipse.aether.util.graph.visitor.Stack v;
v := @this: org.eclipse.aether.util.graph.visitor.TreeDependencyVisitor;
v := @parameter: org.eclipse.aether.graph.DependencyNode;
v = v.<org.eclipse.aether.util.graph.visitor.TreeDependencyVisitor: org.eclipse.aether.util.graph.visitor.Stack visits>;
v = virtualinvoke v.<org.eclipse.aether.util.graph.visitor.Stack: java.lang.Object pop()>();
v = virtualinvoke v.<java.lang.Boolean: boolean booleanValue()>();
if v == 0 goto label;
return 1;
label:
v = v.<org.eclipse.aether.util.graph.visitor.TreeDependencyVisitor: org.eclipse.aether.graph.DependencyVisitor visitor>;
v = interfaceinvoke v.<org.eclipse.aether.graph.DependencyVisitor: boolean visitLeave(org.eclipse.aether.graph.DependencyNode)>(v);
return v;
}
}