| /aosp_15_r20/external/guava/android/guava/src/com/google/common/graph/ |
| H A D | EndpointPair.java | 44 private final N nodeU; field in EndpointPair
47 private EndpointPair(N nodeU, N nodeV) { in EndpointPair()
58 public static <N> EndpointPair<N> unordered(N nodeU, N nodeV) { in unordered()
64 static <N> EndpointPair<N> of(Graph<?> graph, N nodeU, N nodeV) { in of()
69 static <N> EndpointPair<N> of(Network<?, ?> network, N nodeU, N nodeV) { in of()
91 public final N nodeU() { in nodeU() method in EndpointPair
196 private Unordered(N nodeU, N nodeV) { in Unordered()
|
| H A D | StandardValueGraph.java | 133 public boolean hasEdgeConnecting(N nodeU, N nodeV) { in hasEdgeConnecting()
146 public V edgeValueOrDefault(N nodeU, N nodeV, @CheckForNull V defaultValue) { in edgeValueOrDefault()
175 private final boolean hasEdgeConnectingInternal(N nodeU, N nodeV) { in hasEdgeConnectingInternal()
181 private final V edgeValueOrDefaultInternal(N nodeU, N nodeV, @CheckForNull V defaultValue) { in edgeValueOrDefaultInternal()
|
| H A D | ForwardingNetwork.java | 125 public Set<E> edgesConnecting(N nodeU, N nodeV) { in edgesConnecting()
136 public E edgeConnectingOrNull(N nodeU, N nodeV) { in edgeConnectingOrNull()
147 public boolean hasEdgeConnecting(N nodeU, N nodeV) { in hasEdgeConnecting()
|
| H A D | Network.java | 385 Set<E> edgesConnecting(N nodeU, N nodeV); in edgesConnecting()
430 E edgeConnectingOrNull(N nodeU, N nodeV); in edgeConnectingOrNull()
456 boolean hasEdgeConnecting(N nodeU, N nodeV); in hasEdgeConnecting()
|
| H A D | MutableGraph.java | 59 boolean putEdge(N nodeU, N nodeV); in putEdge()
96 boolean removeEdge(N nodeU, N nodeV); in removeEdge()
|
| H A D | MutableValueGraph.java | 65 V putEdgeValue(N nodeU, N nodeV, V value); in putEdgeValue()
108 V removeEdge(N nodeU, N nodeV); in removeEdge()
|
| H A D | StandardMutableGraph.java | 51 public boolean putEdge(N nodeU, N nodeV) { in putEdge()
67 public boolean removeEdge(N nodeU, N nodeV) { in removeEdge()
|
| H A D | StandardMutableValueGraph.java | 89 public V putEdgeValue(N nodeU, N nodeV, V value) { in putEdgeValue()
166 public V removeEdge(N nodeU, N nodeV) { in removeEdge()
|
| H A D | ForwardingValueGraph.java | 99 public boolean hasEdgeConnecting(N nodeU, N nodeV) { in hasEdgeConnecting()
110 public V edgeValueOrDefault(N nodeU, N nodeV, @CheckForNull V defaultValue) { in edgeValueOrDefault()
|
| H A D | StandardMutableNetwork.java | 79 public boolean addEdge(N nodeU, N nodeV, E edge) { in addEdge()
152 N nodeU = edgeToReferenceNode.get(edge); in removeEdge() local
|
| H A D | ValueGraph.java | 301 boolean hasEdgeConnecting(N nodeU, N nodeV); in hasEdgeConnecting()
330 V edgeValueOrDefault(N nodeU, N nodeV, @CheckForNull V defaultValue); in edgeValueOrDefault()
|
| H A D | StandardNetwork.java | 138 N nodeU = checkedReferenceNode(edge); in incidentNodes() local
150 public Set<E> edgesConnecting(N nodeU, N nodeV) { in edgesConnecting()
|
| H A D | MutableNetwork.java | 68 boolean addEdge(N nodeU, N nodeV, E edge); in addEdge()
|
| /aosp_15_r20/external/guava/guava/src/com/google/common/graph/ |
| H A D | EndpointPair.java | 44 private final N nodeU; field in EndpointPair
47 private EndpointPair(N nodeU, N nodeV) { in EndpointPair()
58 public static <N> EndpointPair<N> unordered(N nodeU, N nodeV) { in unordered()
64 static <N> EndpointPair<N> of(Graph<?> graph, N nodeU, N nodeV) { in of()
69 static <N> EndpointPair<N> of(Network<?, ?> network, N nodeU, N nodeV) { in of()
91 public final N nodeU() { in nodeU() method in EndpointPair
196 private Unordered(N nodeU, N nodeV) { in Unordered()
|
| H A D | ForwardingNetwork.java | 126 public Set<E> edgesConnecting(N nodeU, N nodeV) { in edgesConnecting()
136 public Optional<E> edgeConnecting(N nodeU, N nodeV) { in edgeConnecting()
147 public E edgeConnectingOrNull(N nodeU, N nodeV) { in edgeConnectingOrNull()
158 public boolean hasEdgeConnecting(N nodeU, N nodeV) { in hasEdgeConnecting()
|
| H A D | Network.java | 386 Set<E> edgesConnecting(N nodeU, N nodeV); in edgesConnecting()
430 Optional<E> edgeConnecting(N nodeU, N nodeV); in edgeConnecting()
460 E edgeConnectingOrNull(N nodeU, N nodeV); in edgeConnectingOrNull()
486 boolean hasEdgeConnecting(N nodeU, N nodeV); in hasEdgeConnecting()
|
| H A D | StandardValueGraph.java | 133 public boolean hasEdgeConnecting(N nodeU, N nodeV) { in hasEdgeConnecting()
146 public V edgeValueOrDefault(N nodeU, N nodeV, @CheckForNull V defaultValue) { in edgeValueOrDefault()
175 private final boolean hasEdgeConnectingInternal(N nodeU, N nodeV) { in hasEdgeConnectingInternal()
181 private final V edgeValueOrDefaultInternal(N nodeU, N nodeV, @CheckForNull V defaultValue) { in edgeValueOrDefaultInternal()
|
| H A D | ForwardingValueGraph.java | 100 public boolean hasEdgeConnecting(N nodeU, N nodeV) { in hasEdgeConnecting()
110 public Optional<V> edgeValue(N nodeU, N nodeV) { in edgeValue()
121 public V edgeValueOrDefault(N nodeU, N nodeV, @CheckForNull V defaultValue) { in edgeValueOrDefault()
|
| H A D | ValueGraph.java | 302 boolean hasEdgeConnecting(N nodeU, N nodeV); in hasEdgeConnecting()
329 Optional<V> edgeValue(N nodeU, N nodeV); in edgeValue()
354 V edgeValueOrDefault(N nodeU, N nodeV, @CheckForNull V defaultValue); in edgeValueOrDefault()
|
| H A D | MutableGraph.java | 59 boolean putEdge(N nodeU, N nodeV); in putEdge()
96 boolean removeEdge(N nodeU, N nodeV); in removeEdge()
|
| H A D | MutableValueGraph.java | 65 V putEdgeValue(N nodeU, N nodeV, V value); in putEdgeValue()
108 V removeEdge(N nodeU, N nodeV); in removeEdge()
|
| H A D | StandardMutableGraph.java | 51 public boolean putEdge(N nodeU, N nodeV) { in putEdge()
67 public boolean removeEdge(N nodeU, N nodeV) { in removeEdge()
|
| H A D | StandardMutableValueGraph.java | 89 public V putEdgeValue(N nodeU, N nodeV, V value) { in putEdgeValue()
166 public V removeEdge(N nodeU, N nodeV) { in removeEdge()
|
| H A D | StandardMutableNetwork.java | 79 public boolean addEdge(N nodeU, N nodeV, E edge) { in addEdge()
152 N nodeU = edgeToReferenceNode.get(edge); in removeEdge() local
|
| H A D | StandardNetwork.java | 138 N nodeU = checkedReferenceNode(edge); in incidentNodes() local
150 public Set<E> edgesConnecting(N nodeU, N nodeV) { in edgesConnecting()
|