- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 109 for Endpoints (0.43 sec)
-
android/guava/src/com/google/common/graph/ImmutableGraph.java
/** * Adds an edge connecting {@code endpoints} (in the order, if any, specified by {@code * endpoints}) if one is not already present. * * <p>If this graph is directed, {@code endpoints} must be ordered and the added edge will be * directed; if it is undirected, the added edge will be undirected. * * <p>If this graph is directed, {@code endpoints} must be ordered. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Feb 01 16:30:37 GMT 2022 - 7.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ImmutableNetwork.java
* must also be non-null. * * <p>If either or both endpoints are not already present in this network, this method will * silently {@link #addNode(Object) add} each missing endpoint to the network. * * <p>If {@code edge} already connects an endpoint pair equal to {@code endpoints}, then this * method will have no effect. * * @return this {@code Builder} object
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Feb 01 16:30:37 GMT 2022 - 9.6K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ValueGraph.java
* Returns the value of the edge that connects {@code endpoints} (in the order, if any, specified * by {@code endpoints}), if one is present; otherwise, returns {@code defaultValue}. * * <p>If this graph is directed, the endpoints must be ordered. * * @throws IllegalArgumentException if either endpoint is not an element of this graph * @throws IllegalArgumentException if the endpoints are unordered and the graph is directed
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 15K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/MutableGraph.java
/** * Adds an edge connecting {@code endpoints} (in the order, if any, specified by {@code * endpoints}) if one is not already present. * * <p>If this graph is directed, {@code endpoints} must be ordered and the added edge will be * directed; if it is undirected, the added edge will be undirected. * * <p>If this graph is directed, {@code endpoints} must be ordered. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 3.9K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ForwardingValueGraph.java
public boolean hasEdgeConnecting(EndpointPair<N> endpoints) { return delegate().hasEdgeConnecting(endpoints); } @Override @CheckForNull public V edgeValueOrDefault(N nodeU, N nodeV, @CheckForNull V defaultValue) { return delegate().edgeValueOrDefault(nodeU, nodeV, defaultValue); } @Override @CheckForNull public V edgeValueOrDefault(EndpointPair<N> endpoints, @CheckForNull V defaultValue) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 2.9K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/AbstractStandardDirectedGraphTest.java
assume().that(graphIsMutable()).isTrue(); EndpointPair<Integer> endpoints = EndpointPair.unordered(N1, N2); IllegalArgumentException e = assertThrows(IllegalArgumentException.class, () -> graphAsMutableGraph.putEdge(endpoints)); assertThat(e).hasMessageThat().contains(ENDPOINTS_MISMATCH); } /**
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 14.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/AbstractBaseGraph.java
checkNotNull(endpoints); checkArgument(isOrderingCompatible(endpoints), ENDPOINTS_MISMATCH); } /** * Returns {@code true} iff {@code endpoints}' ordering is compatible with the directionality of * this graph. */ protected final boolean isOrderingCompatible(EndpointPair<?> endpoints) { return endpoints.isOrdered() == this.isDirected(); }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 7.2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/StandardMutableValueGraph.java
} return previousValue; } @Override @CanIgnoreReturnValue @CheckForNull public V putEdgeValue(EndpointPair<N> endpoints, V value) { validateEndpoints(endpoints); return putEdgeValue(endpoints.nodeU(), endpoints.nodeV(), value); } @Override @CanIgnoreReturnValue public boolean removeNode(N node) { checkNotNull(node, "node");
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Sat Oct 21 01:50:30 GMT 2023 - 6.4K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/ValueGraphTest.java
assertThat(e).hasMessageThat().contains(ENDPOINTS_MISMATCH); e = assertThrows( IllegalArgumentException.class, () -> graph.edgeValue(EndpointPair.unordered(2, 1))); assertThat(e).hasMessageThat().contains(ENDPOINTS_MISMATCH); } @Test public void edgeValue_undirected_correct() {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Tue Feb 06 18:35:19 GMT 2024 - 20K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/StandardValueGraph.java
} @Override public boolean hasEdgeConnecting(EndpointPair<N> endpoints) { checkNotNull(endpoints); return isOrderingCompatible(endpoints) && hasEdgeConnectingInternal(endpoints.nodeU(), endpoints.nodeV()); } @Override @CheckForNull public V edgeValueOrDefault(N nodeU, N nodeV, @CheckForNull V defaultValue) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 6.1K bytes - Viewed (0)