com.google.common.graph.AbstractNetwork.class Maven / Gradle / Ivy
???? 4? ?
" ? ?
?
R ?
R ? | ?
R ?
? ?
R ?
R ?
R ?
R ?
? ?
? ?
? ?
? ?
? ?
R ?
R ?
? ?
? ?
R ?
R ? ?
?
R ?
? ?
R ? | ? ? ? ? ? ?
? ?
?
? ?
R ? | ?
R ?
R ?
R ? ?
? ?
? ? ? . ? . ? | ?
R ? ?
5 ?
5
5
R
R
5
5
.
! %
&'(
)*+,
R - InnerClasses ()V 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; degree (Ljava/lang/Object;)I node Ljava/lang/Object; TN;
StackMapTable MethodParameters (TN;)I inDegree outDegree
adjacentEdges #(Ljava/lang/Object;)Ljava/util/Set; edge endpointPair &Lcom/google/common/graph/EndpointPair; endpointPairIncidentEdges Ljava/util/Set; TE; +Lcom/google/common/graph/EndpointPair; Ljava/util/Set; (TE;)Ljava/util/Set; edgesConnecting 5(Ljava/lang/Object;Ljava/lang/Object;)Ljava/util/Set; nodeU nodeV 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; connectedPredicate H(Ljava/lang/Object;Ljava/lang/Object;)Lcom/google/common/base/Predicate; nodePresent nodeToCheck /(TN;TN;)Lcom/google/common/base/Predicate; edgeConnecting :(Ljava/lang/Object;Ljava/lang/Object;)Ljava/util/Optional; !(TN;TN;)Ljava/util/Optional; <(Lcom/google/common/graph/EndpointPair;)Ljava/util/Optional; F(Lcom/google/common/graph/EndpointPair;)Ljava/util/Optional; edgeConnectingOrNull 8(Ljava/lang/Object;Ljava/lang/Object;)Ljava/lang/Object; (TN;TN;)TE; RuntimeVisibleAnnotations Ljavax/annotation/CheckForNull; :(Lcom/google/common/graph/EndpointPair;)Ljava/lang/Object; 0(Lcom/google/common/graph/EndpointPair;)TE; hasEdgeConnecting '(Ljava/lang/Object;Ljava/lang/Object;)Z (TN;TN;)Z )(Lcom/google/common/graph/EndpointPair;)Z .(Lcom/google/common/graph/EndpointPair;)Z validateEndpoints )(Lcom/google/common/graph/EndpointPair;)V )Lcom/google/common/graph/EndpointPair<*>; ,(Lcom/google/common/graph/EndpointPair<*>;)V isOrderingCompatible ,(Lcom/google/common/graph/EndpointPair<*>;)Z equals (Ljava/lang/Object;)Z obj other !Lcom/google/common/graph/Network; %Lcom/google/common/graph/Network<**>; "RuntimeVisibleParameterAnnotations hashCode ()I toString ()Ljava/lang/String; edgeInvalidatableSet 2(Ljava/util/Set;Ljava/lang/Object;)Ljava/util/Set; set Ljava/util/Set; C(Ljava/util/Set;TE;)Ljava/util/Set; nodeInvalidatableSet C(Ljava/util/Set;TN;)Ljava/util/Set; nodePairInvalidatableSet D(Ljava/util/Set;Ljava/lang/Object;Ljava/lang/Object;)Ljava/util/Set; F(Ljava/util/Set;TN;TN;)Ljava/util/Set; edgeIncidentNodesMap 2(Lcom/google/common/graph/Network;)Ljava/util/Map; 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; &com/google/common/graph/GraphConstants T U )com/google/common/graph/AbstractNetwork$1 T/ 01 2 l 3 ? 4 l5 67 8 l v w a b 9:; x< y<= >AB CD EA ? ? ? ? FGH IJ ? ? ? ? )com/google/common/graph/AbstractNetwork$2 TK ? ?L MN ? ? OPQ R< "java/lang/IllegalArgumentException uCannot call edgeConnecting() when parallel edges exist between %s and %s. Consider calling edgesConnecting() instead. java/lang/ObjectS TU TVW XY Z[ \ ? ] l ? ? ? ? PMismatch: endpoints' ordering is not compatible with directionality of the graph ^_ `1 com/google/common/graph/Network ? ? ? ?a ? ? java/lang/StringBuilder isDirected: bc bd , allowsParallelEdges: e1 , allowsSelfLoops: f1 , nodes: bg , edges: ? ? BootstrapMethodsh<ij klm ? kno Cpqrs ktu kv w[x yYY z: {|} ~ RNode %s or node %s that were used to generate this set are no longer in the graph.? ?? 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. 'com/google/common/graph/AbstractNetwork
java/util/Set ,(Lcom/google/common/graph/AbstractNetwork;)V
isDirected ()Z inEdges size outEdges com/google/common/math/IntMath saturatedAdd (II)I
incidentEdges
incidentNodes :(Ljava/lang/Object;)Lcom/google/common/graph/EndpointPair; $com/google/common/graph/EndpointPair ()Ljava/lang/Object; com/google/common/collect/Sets union? SetView H(Ljava/util/Set;Ljava/util/Set;)Lcom/google/common/collect/Sets$SetView; &com/google/common/collect/ImmutableSet of <(Ljava/lang/Object;)Lcom/google/common/collect/ImmutableSet;
difference filter B(Ljava/util/Set;Lcom/google/common/base/Predicate;)Ljava/util/Set; java/util/Collections unmodifiableSet (Ljava/util/Set;)Ljava/util/Set; P(Lcom/google/common/graph/AbstractNetwork;Ljava/lang/Object;Ljava/lang/Object;)V java/util/Optional
ofNullable ((Ljava/lang/Object;)Ljava/util/Optional; iterator ()Ljava/util/Iterator; java/util/Iterator next 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
successors
checkArgument (ZLjava/lang/Object;)V isOrdered
java/util/Map append -(Ljava/lang/String;)Ljava/lang/StringBuilder; (Z)Ljava/lang/StringBuilder; allowsParallelEdges allowsSelfLoops -(Ljava/lang/Object;)Ljava/lang/StringBuilder;
??
R? ()Ljava/lang/Boolean; get ^(Lcom/google/common/graph/AbstractNetwork;Ljava/lang/Object;)Lcom/google/common/base/Supplier;
R? 5(Ljava/lang/Object;)Lcom/google/common/base/Supplier; (com/google/common/graph/InvalidatableSet }(Ljava/util/Set;Lcom/google/common/base/Supplier;Lcom/google/common/base/Supplier;)Lcom/google/common/graph/InvalidatableSet;
R?
R?
R? p(Lcom/google/common/graph/AbstractNetwork;Ljava/lang/Object;Ljava/lang/Object;)Lcom/google/common/base/Supplier;
R? 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; java/lang/Boolean valueOf (Z)Ljava/lang/Boolean; &com/google/common/collect/Sets$SetView? ?? ? ? ? ? ? ? ? ? ? ? ? ? "java/lang/invoke/LambdaMetafactory metafactory? Lookup ?(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;? %java/lang/invoke/MethodHandles$Lookup java/lang/invoke/MethodHandles! R " . T U V A *? ? W 8 X Y Z [ Y \ ] ^ V E ? Y*? ? W ; X Y Z [ Y \ _ ` a b V ? 8*? ? *+? ? *+? ? ? ?*+?
? *++? ? ? ? W ? ? ? X 8 Y Z 8 c d [ 8 Y \ 8 c e f g c _ h i b V u *? ? *+? ? ? *+? ? W ? X Y Z c d [ Y \ c e f D g c _ h j b V u *? ? *+? ? ? *+? ? W ? X Y Z c d [ Y \ c e f D g c _ h k l V ? (*+?
M*,? ?
*,? ?
? N*-+? ? +? ? W ? ? ? ? ? $ ? X * ( Y Z ( m d " n o p q [ * ( Y \ ( m r " n s p t g m _ u v w V # B*+? N*,? :*-? ? ? -*+,? ? ? ? *,+? ? ? +,? ? W ? ?
? ? ? . ? > ? X 4 B Y Z B x d B y d < z q
5 { q [ 4 B Y \ B x e B y e < z t
5 { t f 7 ? . R " " | | R?
R " " | | R | g x y _ } v ~ V f *+? *+? +? ? ? W
? ? X Y Z o [ Y \ s g _ ? ? ? V o ? Y*+,? ? W ? X Y Z ? d ? d [ Y \ ? e ? e g ? ? _ ? ? ? V n
*+,? ? ? W ? X
Y Z
x d
y d [
Y \
x e
y e g x y _ ? ? ? V f *+? *+? +? ? ? W
? ? X Y Z o [ Y \ s g _ ? ? ? V ? O*+,? N-? ? ) ?-? ? ?? Y!? "Y+SY,S? #? $? W ? ? ( ? * ? 6 ? X * O Y Z O x d O y d H v q [ * O Y \ O x e O y e H v t f
? ( | g x y _ ? ? ? ? ? V f *+? *+? +? ? ? W
? ? X Y Z o [ Y \ s g _ ? ? ? ? ? V ? ++? %W,? %W*? &+? ' ? *+? (,? ' ? ? ? W ? ?
? X + Y Z + x d + y d [ + Y \ + x e + y e f )@ g x y _ ? ? ? V ? +? %W*+? )? ?*+? +? ? *? W ? ?
? ? X Y Z o [ Y \ s f g _ ? ? ? V h +? %W*+? )+? ,? W ? ? ? X Y Z o [ Y \ ? g _ ? ? ? V l +? -*? ? ? ? W ? X Y Z o [ Y \ ? f @ g _ ? ? ? V ? J+*? ?+? .? ?+? .M*? ,? / ? )*? &,? 0 ? 1 ? *? 2,? 2? 3 ? ? ? W &
#
5 I X J Y Z J ? d 5 ? ? [ J Y \ 5 ? ? f ? 7 .@ g ? ? ? ? ? V F
*? 2? 4 ? W X
Y Z [
Y \ ? ? V ? G? 5Y? 67? 8*? ? 9:? 8*? ;? 9? 8*? &? ?@? 8*? 2? ?? A? W
% 1 =" F X G Y Z [ G Y \ ? ? V v +*,? B ,? C ? D? W , X Y Z ? q m d [ Y \ ? ? m r g ? m _ ? ? ? V v +*,? E ,? F ? D? W 7 X Y Z ? q c d [ Y \ ? ? c e g ? c _ ? ? ? V ? +*,-? G ,-? H ? D? W B X * Y Z ? q x d y d [ * Y \ ? ? x e y e g
? x y _ ?
? ? V Q *? I *Y? JW? K ? L? W I X ? ? [ ? ? g ? _ ?
? ? V F M? "Y*SY+S? #? W E X x d y d ? ? V ~ #*? &+? ' ? *? &,? ' ? ? ? N? W D X # Y Z # x d # y d [ # Y \ f @
? ? V 8 O? "Y*S? #? W 8 X c d ? ? V T *? &+? ' ? N? W 8 X Y Z c d [ Y \
? ? V 8 P? "Y*S? #? W - X m d ? ? V T *? Q+? ' ? N? W - X Y Z m d [ Y \ _ ? ? ? ? ? ? ? S " ? ?@ ??? H "#$ © 2015 - 2025 Weber Informatics LLC | Privacy Policy