• Home
• net.sourceforge.plantuml
• plantuml
• 1.2024.7
• source code
• AbstractNetwork.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.AbstractNetwork.class Maven / Gradle / Ivy

????4
?
&com/google/common/graph/GraphConstants

java/lang/Object

()V

)com/google/common/graph/AbstractNetwork$1
	

,(Lcom/google/common/graph/AbstractNetwork;)V

'com/google/common/graph/AbstractNetwork

isDirected
()Z

inEdges
#(Ljava/lang/Object;)Ljava/util/Set;

java/util/Set
size
()I
 
outEdges
"#$%&
com/google/common/math/IntMath
saturatedAdd
(II)I
()

incidentEdges
+,-
edgesConnecting
5(Ljava/lang/Object;Ljava/lang/Object;)Ljava/util/Set;
/01
degree
(Ljava/lang/Object;)I
345

incidentNodes
:(Ljava/lang/Object;)Lcom/google/common/graph/EndpointPair;
789:;
$com/google/common/graph/EndpointPair
nodeU
()Ljava/lang/Object;
7=>;
nodeV
@ABCD
com/google/common/collect/Sets
union
H(Ljava/util/Set;Ljava/util/Set;)Lcom/google/common/collect/Sets$SetView;
FGHIJ
&com/google/common/collect/ImmutableSet
of
<(Ljava/lang/Object;)Lcom/google/common/collect/ImmutableSet;
@LMD

difference
OPQ
edgeInvalidatableSet
2(Ljava/util/Set;Ljava/lang/Object;)Ljava/util/Set;
STU
connectedPredicate
H(Ljava/lang/Object;Ljava/lang/Object;)Lcom/google/common/base/Predicate;
@WXY
filter
B(Ljava/util/Set;Lcom/google/common/base/Predicate;)Ljava/util/Set;
[\]^_
java/util/Collections
unmodifiableSet
 (Ljava/util/Set;)Ljava/util/Set;
abc
nodePairInvalidatableSet
D(Ljava/util/Set;Ljava/lang/Object;Ljava/lang/Object;)Ljava/util/Set;
efg
validateEndpoints
)(Lcom/google/common/graph/EndpointPair;)Vi
)com/google/common/graph/AbstractNetwork$2
hkl
P(Lcom/google/common/graph/AbstractNetwork;Ljava/lang/Object;Ljava/lang/Object;)V
nop
edgeConnectingOrNull
8(Ljava/lang/Object;Ljava/lang/Object;)Ljava/lang/Object;
rstuv
java/util/Optional

ofNullable
((Ljava/lang/Object;)Ljava/util/Optional;
xyz
edgeConnecting
:(Ljava/lang/Object;Ljava/lang/Object;)Ljava/util/Optional;|}~
iterator
()Ljava/util/Iterator;????;
java/util/Iterator
next?
"java/lang/IllegalArgumentException?
uCannot call edgeConnecting() when parallel edges exist between %s and %s. Consider calling edgesConnecting() instead.
?????
java/lang/String
format
9(Ljava/lang/String;[Ljava/lang/Object;)Ljava/lang/String;
???
(Ljava/lang/String;)V
?????
$com/google/common/base/Preconditions
checkNotNull
&(Ljava/lang/Object;)Ljava/lang/Object;
???
nodes
()Ljava/util/Set;???
contains
(Ljava/lang/Object;)Z
??

successors
???
isOrderingCompatible
)(Lcom/google/common/graph/EndpointPair;)Z
???
hasEdgeConnecting
'(Ljava/lang/Object;Ljava/lang/Object;)Z?
PMismatch: endpoints' ordering is not compatible with directionality of the graph
????

checkArgument
(ZLjava/lang/Object;)V
7??
	isOrdered?
com/google/common/graph/Network??????
equals
???
edgeIncidentNodesMap
2(Lcom/google/common/graph/Network;)Ljava/util/Map;???

java/util/Map???
hashCode?
java/lang/StringBuilder
??
isDirected: 
????
append
-(Ljava/lang/String;)Ljava/lang/StringBuilder;
????
(Z)Ljava/lang/StringBuilder;?
, allowsParallelEdges: 
??
allowsParallelEdges?
, allowsSelfLoops: 
??
allowsSelfLoops?
	, nodes: 
????
-(Ljava/lang/Object;)Ljava/lang/StringBuilder;?
	, edges: 
????
toString
()Ljava/lang/String;???
get
^(Lcom/google/common/graph/AbstractNetwork;Ljava/lang/Object;)Lcom/google/common/base/Supplier;
???
5(Ljava/lang/Object;)Lcom/google/common/base/Supplier;
???I?
(com/google/common/graph/InvalidatableSet
}(Ljava/util/Set;Lcom/google/common/base/Supplier;Lcom/google/common/base/Supplier;)Lcom/google/common/graph/InvalidatableSet;?????
p(Lcom/google/common/graph/AbstractNetwork;Ljava/lang/Object;Ljava/lang/Object;)Lcom/google/common/base/Supplier;???
G(Ljava/lang/Object;Ljava/lang/Object;)Lcom/google/common/base/Supplier;????
edges
???
?
java/util/Objects
requireNonNull



apply
D(Lcom/google/common/graph/Network;)Lcom/google/common/base/Function;




	


com/google/common/collect/Maps
asMap
A(Ljava/util/Set;Lcom/google/common/base/Function;)Ljava/util/Map;

RNode %s or node %s that were used to generate this set are no longer in the graph.






java/lang/Boolean
valueOf
(Z)Ljava/lang/Boolean;

ENode %s that was used to generate this set is no longer in the graph.

EEdge %s that was used to generate this set is no longer in the graph.
?
Code
LineNumberTable
LocalVariableTable
this
)Lcom/google/common/graph/AbstractNetwork;
LocalVariableTypeTable
1Lcom/google/common/graph/AbstractNetwork;
asGraph
!()Lcom/google/common/graph/Graph;
	Signature
&()Lcom/google/common/graph/Graph;
node
Ljava/lang/Object;
TN;

StackMapTable
MethodParameters
(TN;)I
inDegree
	outDegree

adjacentEdges
edge
endpointPair
&Lcom/google/common/graph/EndpointPair;
endpointPairIncidentEdges
Ljava/util/Set;
TE;
+Lcom/google/common/graph/EndpointPair;
Ljava/util/Set;
(TE;)Ljava/util/Set;
	outEdgesU
inEdgesV
(TN;TN;)Ljava/util/Set;
7(Lcom/google/common/graph/EndpointPair;)Ljava/util/Set;
	endpoints
A(Lcom/google/common/graph/EndpointPair;)Ljava/util/Set;
nodePresent
nodeToCheck
/(TN;TN;)Lcom/google/common/base/Predicate;
!(TN;TN;)Ljava/util/Optional;
<(Lcom/google/common/graph/EndpointPair;)Ljava/util/Optional;
F(Lcom/google/common/graph/EndpointPair;)Ljava/util/Optional;
(TN;TN;)TE;
RuntimeVisibleAnnotations
Ljavax/annotation/CheckForNull;
:(Lcom/google/common/graph/EndpointPair;)Ljava/lang/Object;
0(Lcom/google/common/graph/EndpointPair;)TE;
	(TN;TN;)Z
.(Lcom/google/common/graph/EndpointPair;)Z
)Lcom/google/common/graph/EndpointPair<*>;
,(Lcom/google/common/graph/EndpointPair<*>;)V
,(Lcom/google/common/graph/EndpointPair<*>;)Z
obj
other
!Lcom/google/common/graph/Network;
%Lcom/google/common/graph/Network<**>;
"RuntimeVisibleParameterAnnotations
set
Ljava/util/Set;
C(Ljava/util/Set;TE;)Ljava/util/Set;
nodeInvalidatableSet
C(Ljava/util/Set;TN;)Ljava/util/Set;
F(Ljava/util/Set;TN;TN;)Ljava/util/Set;
network
)Lcom/google/common/graph/Network;
?(Lcom/google/common/graph/Network;)Ljava/util/Map;>;
!lambda$nodePairInvalidatableSet$5
8(Ljava/lang/Object;Ljava/lang/Object;)Ljava/lang/String;
!lambda$nodePairInvalidatableSet$4
9(Ljava/lang/Object;Ljava/lang/Object;)Ljava/lang/Boolean;
lambda$nodeInvalidatableSet$3
&(Ljava/lang/Object;)Ljava/lang/String;
lambda$nodeInvalidatableSet$2
'(Ljava/lang/Object;)Ljava/lang/Boolean;
lambda$edgeInvalidatableSet$1
lambda$edgeInvalidatableSet$0
eLjava/lang/Object;Lcom/google/common/graph/Network;

SourceFile
AbstractNetwork.java
9Lcom/google/common/graph/ElementTypesAreNonnullByDefault;
RuntimeInvisibleAnnotations
$Lcom/google/common/annotations/Beta;
BootstrapMethods;
l

m
b
`
o
()Ljava/lang/Boolean;
q

r
a
^?
u

v
_
`
x

y
]
^
{

|
[
\
~


Y
Z?	
??35
?

?
?
?
?
?
"java/lang/invoke/LambdaMetafactory
metafactory
?(Ljava/lang/invoke/MethodHandles$Lookup;Ljava/lang/String;Ljava/lang/invoke/MethodType;Ljava/lang/invoke/MethodType;Ljava/lang/invoke/MethodHandle;Ljava/lang/invoke/MethodType;)Ljava/lang/invoke/CallSite;
InnerClasses
?
&com/google/common/collect/Sets$SetView
SetView
?
%java/lang/invoke/MethodHandles$Lookup
?
java/lang/invoke/MethodHandles
Lookup!
?


A

*??

8










 
E
	?	Y*??

;

	



	


!
"
01
?8*??*+??
*+??
?!?*+?'?
*++?*?
?!?
???
8

8
#
$

8

8
#
%

&

'

#
!
(

)1
u*??*+??
?*+?.?

?



#
$




#
%

&D

'

#
!
(

*1
u*??*+??
?*+?.?

?



#
$




#
%

&D

'

#
!
(

+
?(*+?2M*,?6?'*,??
4B

B:
$
B>
$<
5
0
5
6
0
4B

B:
%
B>
%<
5
3
5
6
3
&7?.
?

'	:>
!
7
,
8
f*+?d*+?6+?
$
 



:
%

>
%
'	:>
!
>
y
?
f*+?d*+?6+?
$H,
0
*O

O:
%
O>
%H,
3
&
?(

'	:>
!
A
B

C
o
D
f*+?d*+?6+?
$
 +

+:
%
+>
%
&)@

'	:>
!
F
??
?+??W*+????*+?6+?
$
*


P
Q
:
%>
%
'

P:>
!
U
??
Q
*??
*Y??W?

?
?


I


V
M


V
W
'

V
!
X

Y
Z

G
?Y*SY+S???


E
:
$>
$

[
\

~#*??+???*??,?????

?


D
 #

#:
$
#>
$

#


&@


]
^

9

?Y*S???


8


#
$
_
`

T*??+???

?


8



#
$






a
^

9

?Y*S???


-


,
$
b
`

T*?
+???

?


-



,
$





!
c
d
e
B

f
g

h
iH
?
j
k
n
?
j
p
s
?
j
t
n
?
j
w
s
?
j
z
n
?
j
}
s
?
?
?
?
?"	
?@
?	h
?
?
?