- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 82 for accessors (0.2 sec)
-
android/guava/src/com/google/common/graph/ForwardingGraph.java
return delegate().adjacentNodes(node); } @Override public Set<N> predecessors(N node) { return delegate().predecessors(node); } @Override public Set<N> successors(N node) { return delegate().successors(node); } @Override public Set<EndpointPair<N>> incidentEdges(N node) { return delegate().incidentEdges(node); } @Override public int degree(N node) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 2.5K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/GraphConnections.java
* @param <N> Node parameter type * @param <V> Value parameter type */ @ElementTypesAreNonnullByDefault interface GraphConnections<N, V> { Set<N> adjacentNodes(); Set<N> predecessors(); Set<N> successors(); /** * Returns an iterator over the incident edges. * * @param thisNode The node that this all of the connections in this class are connected to. */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 2.4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ForwardingNetwork.java
return delegate().adjacentNodes(node); } @Override public Set<N> predecessors(N node) { return delegate().predecessors(node); } @Override public Set<N> successors(N node) { return delegate().successors(node); } @Override public Set<E> incidentEdges(N node) { return delegate().incidentEdges(node); } @Override public Set<E> inEdges(N node) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 3.5K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ValueGraphBuilder.java
* order) * </ul> * * <p>{@code ValueGraph}s built by this class also guarantee that each collection-returning accessor * returns a <b>(live) unmodifiable view</b>; see <a * href="https://github.com/google/guava/wiki/GraphsExplained#accessor-behavior">the external * documentation</a> for details. * * <p>Examples of use: * * <pre>{@code * // Building a mutable value graph
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Jun 03 01:21:31 GMT 2022 - 8K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/DefaultNetworkImplementationsTest.java
} @Override public Set<N> predecessors(N node) { return network.predecessors(node); } @Override public Set<N> successors(N node) { return network.successors(node); } @Override public Set<E> incidentEdges(N node) { return network.incidentEdges(node); } @Override public Set<E> inEdges(N node) {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 7.4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/DirectedNetworkConnections.java
} @Override public Set<N> predecessors() { return Collections.unmodifiableSet(((BiMap<E, N>) inEdgeMap).values()); } @Override public Set<N> successors() { return Collections.unmodifiableSet(((BiMap<E, N>) outEdgeMap).values()); } @Override public Set<E> edgesConnecting(N node) { return new EdgesConnecting<>(((BiMap<E, N>) outEdgeMap).inverse(), node);
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Oct 01 17:18:04 GMT 2021 - 2.2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/StandardMutableNetwork.java
return false; } NetworkConnections<N, E> connectionsU = nodeConnections.get(nodeU); if (!allowsParallelEdges()) { checkArgument( !(connectionsU != null && connectionsU.successors().contains(nodeV)), PARALLEL_EDGES_NOT_ALLOWED, nodeU, nodeV); } boolean isSelfLoop = nodeU.equals(nodeV); if (!allowsSelfLoops()) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 5.7K bytes - Viewed (0) -
guava/src/com/google/common/cache/Striped64.java
* contention levels will recur, so the cells will eventually be * needed again; and for short-lived ones, it does not matter. */ /** * Padded variant of AtomicLong supporting only raw accesses plus CAS. The value field is placed * between pads, hoping that the JVM doesn't reorder them. * * <p>JVM intrinsics note: It would be possible to use a release-only form of CAS here, if it were * provided. */
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 11.5K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/AbstractStandardDirectedGraphTest.java
} @Override @Test public void successors_checkReturnedSetMutability() { assume().that(graphIsMutable()).isTrue(); addNode(N1); Set<Integer> successors = graph.successors(N1); UnsupportedOperationException e = assertThrows(UnsupportedOperationException.class, () -> successors.add(N2)); putEdge(N1, N2); assertThat(successors).containsExactlyElementsIn(graph.successors(N1)); }
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-tests/test/com/google/common/graph/AbstractGraphTest.java
} @Test public void successors_noSuccessors() { addNode(N1); assertThat(graph.successors(N1)).isEmpty(); } @Test public void successors_nodeNotInGraph() { assertNodeNotInGraphErrorMessage( assertThrows(IllegalArgumentException.class, () -> graph.successors(NODE_NOT_IN_GRAPH))); } @Test
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 16.6K bytes - Viewed (0)