- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 464 for notes (0.13 sec)
-
guava-tests/test/com/google/common/graph/AbstractStandardDirectedGraphTest.java
@Override @Test public void nodes_checkReturnedSetMutability() { assume().that(graphIsMutable()).isTrue(); Set<Integer> nodes = graph.nodes(); UnsupportedOperationException e = assertThrows(UnsupportedOperationException.class, () -> nodes.add(N2)); addNode(N1); assertThat(graph.nodes()).containsExactlyElementsIn(nodes); } @Override @Test
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/collect/Ordering.java
* encounter a call to {@code reverse}, continue working backwards until a result is determined, and * then reverse that result. * * <h3>Additional notes</h3> * * <p>Except as noted, the orderings returned by the factory methods of this class are serializable * if and only if the provided instances that back them are. For example, if {@code ordering} and
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 24 19:38:27 GMT 2024 - 39.4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ValueGraphBuilder.java
* with user-defined properties. * * <p>A {@code ValueGraph} built by this class has the following default properties: * * <ul> * <li>does not allow self-loops * <li>orders {@link ValueGraph#nodes()} in the order in which the elements were added (insertion * order) * </ul> * * <p>{@code ValueGraph}s built by this class also guarantee that each collection-returning accessor
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Jun 03 01:21:31 GMT 2022 - 8K bytes - Viewed (0) -
api/maven-api-core/src/main/java/org/apache/maven/api/Session.java
* Shortcut for {@code getService(DependencyResolver.class).flatten(...)}. * * @param node node for which to get a flattened list * @param scope build path scope (main compile, test compile, etc.) of desired nodes * @return flattened list of node with the given build path scope * @throws org.apache.maven.api.services.DependencyResolverException if the dependency flattening failed *
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Thu May 02 15:10:38 GMT 2024 - 30.2K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/NetworkMutationTest.java
assertThat(network.nodes()).isEmpty(); assertThat(network.edges()).isEmpty(); AbstractNetworkTest.validateNetwork(network); while (network.nodes().size() < NUM_NODES) { network.addNode(gen.nextInt(NODE_POOL_SIZE)); } ArrayList<Integer> nodeList = new ArrayList<>(network.nodes()); for (int i = 0; i < NUM_EDGES; ++i) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 10 19:42:18 GMT 2024 - 4.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractGraphTest.java
assertThat(graph.nodes()).contains(N1); } @Test public void addNode_existingNode() { assume().that(graphIsMutable()).isTrue(); addNode(N1); ImmutableSet<Integer> nodes = ImmutableSet.copyOf(graph.nodes()); assertThat(graphAsMutableGraph.addNode(N1)).isFalse(); assertThat(graph.nodes()).containsExactlyElementsIn(nodes); } @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/ElementOrderTest.java
assertThat(graph.nodes()).containsExactly(3, 1, 4).inOrder(); } // The default ordering is INSERTION unless otherwise specified. @Test public void nodeOrder_default() { MutableGraph<Integer> graph = GraphBuilder.directed().build(); addNodes(graph); assertThat(graph.nodeOrder()).isEqualTo(insertion()); assertThat(graph.nodes()).containsExactly(3, 1, 4).inOrder(); }
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 8.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractStandardDirectedNetworkTest.java
} } @Override @Test public void nodes_checkReturnedSetMutability() { assume().that(graphIsMutable()).isTrue(); Set<Integer> nodes = network.nodes(); UnsupportedOperationException e = assertThrows(UnsupportedOperationException.class, () -> nodes.add(N2)); addNode(N1); assertThat(network.nodes()).containsExactlyElementsIn(nodes); } @Override @Test
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 21.2K bytes - Viewed (0) -
maven-compat/src/main/java/org/apache/maven/repository/MetadataGraphNode.java
/** * MetadataGraph node - as it's a directed graph - holds adjacency lists for incident and exident nodes * * */ @Deprecated public class MetadataGraphNode { /** node payload */ MavenArtifactMetadata metadata; /** nodes, incident to this (depend on me) */ List<MetadataGraphNode> inNodes; /** nodes, exident to this (I depend on) */ List<MetadataGraphNode> exNodes;
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Wed Sep 06 11:28:54 GMT 2023 - 2.4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Multiset.java
* * <p><b>Note:</b> this method does not return the number of <i>distinct elements</i> in the * multiset, which is given by {@code entrySet().size()}. */ @Override int size(); /** * Returns the number of occurrences of an element in this multiset (the <i>count</i> of the * element). Note that for an {@link Object#equals}-based multiset, this gives the same result as
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Sat Jun 17 14:40:53 GMT 2023 - 19.7K bytes - Viewed (0)