• Home
• net.sourceforge.plantuml
• plantuml
• 1.2024.6
• source code
• DirectedGraphConnections$4.class

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

com.google.common.graph.DirectedGraphConnections$4.class Maven / Gradle / Ivy

????4T	1	2	3
456578
9
:
;<
=>
?
@AB
val$resultWithDoubleSelfLoop
Ljava/util/Iterator;
val$alreadySeenSelfLoop
+Ljava/util/concurrent/atomic/AtomicBoolean;
this$0
2Lcom/google/common/graph/DirectedGraphConnections;

t(Lcom/google/common/graph/DirectedGraphConnections;Ljava/util/Iterator;Ljava/util/concurrent/atomic/AtomicBoolean;)V
Code
LineNumberTable
LocalVariableTable
this
InnerClasses
4Lcom/google/common/graph/DirectedGraphConnections$4;
LocalVariableTypeTable
MethodParameters
computeNext
(()Lcom/google/common/graph/EndpointPair;
edge
&Lcom/google/common/graph/EndpointPair;
+Lcom/google/common/graph/EndpointPair;

StackMapTable
	Signature
-()Lcom/google/common/graph/EndpointPair;
RuntimeVisibleAnnotations
Ljavax/annotation/CheckForNull;
()Ljava/lang/Object;
YLcom/google/common/collect/AbstractIterator;>;

SourceFile
DirectedGraphConnections.java
EnclosingMethodCDEFGHIJ*
$com/google/common/graph/EndpointPairK*L*MNOPQRS* !
2com/google/common/graph/DirectedGraphConnections$4
*com/google/common/collect/AbstractIterator
0com/google/common/graph/DirectedGraphConnections
incidentEdgeIterator
((Ljava/lang/Object;)Ljava/util/Iterator;
()V
java/util/Iterator
hasNext
()Z
next
nodeU
nodeV
java/lang/Object
equals
(Ljava/lang/Object;)Z
)java/util/concurrent/atomic/AtomicBoolean
	getAndSet
(Z)Z
	endOfData Z*+?
*,?*-?*??

?


? !?A*??
?0*??
?L+?+?	?
?*???+?+????*???"
?
?
?'
?2
?4
?6
?9
?"#
A"$
A%
?3?
&'(
)D *A

*?
?

?

(
)&+,-./0