- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 42 for NEndpoints (0.2 sec)
-
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/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) -
android/guava-tests/test/com/google/common/graph/AbstractStandardUndirectedNetworkTest.java
assume().that(graphIsMutable()).isTrue(); EndpointPair<Integer> endpoints = EndpointPair.ordered(N1, N2); IllegalArgumentException e = assertThrows( IllegalArgumentException.class, () -> networkAsMutableNetwork.addEdge(endpoints, E12)); assertThat(e).hasMessageThat().contains(ENDPOINTS_MISMATCH); } @Test public void addEdge_selfLoop_notAllowed() {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 18.9K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Network.java
* order, if any, specified by {@code endpoints}). * * <p>The resulting set of edges will be parallel (i.e. have equal {@link * #incidentNodes(Object)}). If this network does not {@link #allowsParallelEdges() allow parallel * edges}, the resulting set will contain at most one edge (equivalent to {@code * edgeConnecting(endpoints).asSet()}). *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 21.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ImmutableValueGraph.java
} /** * Adds an edge connecting {@code endpoints} if one is not already present, and sets a value for * that edge to {@code value} (overwriting the existing value, if any). * * <p>If the graph is directed, the resultant edge will be directed; otherwise, it 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.7K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/BaseGraph.java
/** * Returns true if there is an edge that directly connects {@code endpoints} (in the order, if * any, specified by {@code endpoints}). This is equivalent to {@code * edges().contains(endpoints)}. * * <p>Unlike the other {@code EndpointPair}-accepting methods, this method does not throw if the * endpoints are unordered; it simply returns false. This is for consistency with the behavior of
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 8.8K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graph.java
/** * Returns true if there is an edge that directly connects {@code endpoints} (in the order, if * any, specified by {@code endpoints}). This is equivalent to {@code * edges().contains(endpoints)}. * * <p>Unlike the other {@code EndpointPair}-accepting methods, this method does not throw if the * endpoints are unordered and the graph is directed; it simply returns {@code false}. This is for
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 13.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ContiguousSet.java
return create(Range.closed(lower, upper), DiscreteDomain.longs()); } /** * Returns a contiguous set containing all {@code int} values from {@code lower} (inclusive) to * {@code upper} (exclusive). If the endpoints are equal, an empty set is returned. (These are the * same values contained in {@code Range.closedOpen(lower, upper)}.) * * @throws IllegalArgumentException if {@code lower} is greater than {@code upper}
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Nov 30 21:54:06 GMT 2023 - 9.9K bytes - Viewed (0) -
guava/src/com/google/common/collect/GeneralRange.java
return new GeneralRange<>(comparator, false, null, OPEN, true, endpoint, boundType); } /** * Returns everything between the endpoints relative to the specified comparator, with the * specified endpoint behavior. */ static <T extends @Nullable Object> GeneralRange<T> range( Comparator<? super T> comparator, @ParametricNullness T lower,
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 10.8K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/AbstractNetwork.java
} @Override public boolean hasEdgeConnecting(EndpointPair<N> endpoints) { checkNotNull(endpoints); if (!isOrderingCompatible(endpoints)) { return false; } return hasEdgeConnecting(endpoints.nodeU(), endpoints.nodeV()); } /** * Throws an IllegalArgumentException if the ordering of {@code endpoints} is not compatible with * the directionality of this graph. */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Mar 13 18:17:09 GMT 2024 - 10.1K bytes - Viewed (0)