- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 56 for predecessors (0.28 sec)
-
android/guava-tests/test/com/google/common/graph/AbstractGraphTest.java
} @Test public void predecessors_noPredecessors() { addNode(N1); assertThat(graph.predecessors(N1)).isEmpty(); } @Test public void predecessors_nodeNotInGraph() { assertNodeNotInGraphErrorMessage( assertThrows(IllegalArgumentException.class, () -> graph.predecessors(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) -
guava-tests/test/com/google/common/graph/AbstractGraphTest.java
} @Test public void predecessors_noPredecessors() { addNode(N1); assertThat(graph.predecessors(N1)).isEmpty(); } @Test public void predecessors_nodeNotInGraph() { assertNodeNotInGraphErrorMessage( assertThrows(IllegalArgumentException.class, () -> graph.predecessors(NODE_NOT_IN_GRAPH))); } @Test
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 16.6K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractStandardDirectedGraphTest.java
} @Override @Test public void predecessors_checkReturnedSetMutability() { assume().that(graphIsMutable()).isTrue(); addNode(N2); Set<Integer> predecessors = graph.predecessors(N2); UnsupportedOperationException e = assertThrows(UnsupportedOperationException.class, () -> predecessors.add(N1)); putEdge(N1, N2); assertThat(graph.predecessors(N2)).containsExactlyElementsIn(predecessors); }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 14.1K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/AbstractStandardUndirectedGraphTest.java
} @Override @Test public void predecessors_checkReturnedSetMutability() { assume().that(graphIsMutable()).isTrue(); addNode(N2); Set<Integer> predecessors = graph.predecessors(N2); UnsupportedOperationException e = assertThrows(UnsupportedOperationException.class, () -> predecessors.add(N1)); putEdge(N1, N2); assertThat(graph.predecessors(N2)).containsExactlyElementsIn(predecessors); }
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 12.9K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/AbstractNetworkTest.java
} @Test public void predecessors_noPredecessors() { addNode(N1); assertThat(network.predecessors(N1)).isEmpty(); } @Test public void predecessors_nodeNotInGraph() { assertNodeNotInGraphErrorMessage( assertThrows( IllegalArgumentException.class, () -> network.predecessors(NODE_NOT_IN_GRAPH))); } @Test
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 33K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractNetworkTest.java
} @Test public void predecessors_noPredecessors() { addNode(N1); assertThat(network.predecessors(N1)).isEmpty(); } @Test public void predecessors_nodeNotInGraph() { assertNodeNotInGraphErrorMessage( assertThrows( IllegalArgumentException.class, () -> network.predecessors(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 - 32.7K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/AbstractStandardDirectedGraphTest.java
} @Override @Test public void predecessors_checkReturnedSetMutability() { assume().that(graphIsMutable()).isTrue(); addNode(N2); Set<Integer> predecessors = graph.predecessors(N2); UnsupportedOperationException e = assertThrows(UnsupportedOperationException.class, () -> predecessors.add(N1)); putEdge(N1, N2); assertThat(graph.predecessors(N2)).containsExactlyElementsIn(predecessors); }
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/GraphConnections.java
/** Remove {@code node} from the set of predecessors. */ void removePredecessor(N node); /** * Remove {@code node} from the set of successors. Returns the value previously associated with * the edge connecting the two nodes. */ @CanIgnoreReturnValue @CheckForNull V removeSuccessor(N node); /** * Add {@code node} as a predecessor to the origin node. In the case of an undirected graph, it
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/DirectedMultiNetworkConnections.java
@Override public Set<N> predecessors() { return Collections.unmodifiableSet(predecessorsMultiset().elementSet()); } private Multiset<N> predecessorsMultiset() { Multiset<N> predecessors = getReference(predecessorsReference); if (predecessors == null) { predecessors = HashMultiset.create(inEdgeMap.values());
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Oct 06 00:47:57 GMT 2021 - 4.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashSet.java
} private static final int ENDPOINT = -2; // TODO(user): predecessors and successors should be collocated (reducing cache misses). // Might also explore collocating all of [hash, next, predecessor, successor] fields of an // entry in a *single* long[], though that reduces the maximum size of the set by a factor of 2 /** * Pointer to the predecessor of an entry in insertion order. ENDPOINT indicates a node is the
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 9.5K bytes - Viewed (0)