- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 65 for addCode (0.44 sec)
-
guava-tests/test/com/google/common/graph/PackageSanityTests.java
NetworkBuilder.directed().<String, String>immutable().addNode("A").build(); private static final ImmutableNetwork<String, String> IMMUTABLE_NETWORK_B = NetworkBuilder.directed().<String, String>immutable().addNode("B").build(); public PackageSanityTests() { MutableNetwork<String, String> mutableNetworkA = NetworkBuilder.directed().build(); mutableNetworkA.addNode("a");
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Nov 09 19:24:25 GMT 2023 - 3.2K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/ImmutableNetworkTest.java
mutableNetwork.addNode("A"); ImmutableNetwork<String, Integer> immutableNetwork = ImmutableNetwork.copyOf(mutableNetwork); assertThat(immutableNetwork.asGraph()).isInstanceOf(ImmutableGraph.class); assertThat(immutableNetwork).isNotInstanceOf(MutableNetwork.class); assertThat(immutableNetwork).isEqualTo(mutableNetwork); mutableNetwork.addNode("B");
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Sun May 05 18:02:35 GMT 2019 - 5.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/ImmutableValueGraphTest.java
assertThat(emptyGraph.nodeOrder()).isEqualTo(ElementOrder.<String>natural()); } @Test public void immutableValueGraphBuilder_addNode() { ImmutableValueGraph<String, Integer> graph = ValueGraphBuilder.directed().<String, Integer>immutable().addNode("A").build(); assertThat(graph.nodes()).containsExactly("A"); assertThat(graph.edges()).isEmpty(); } @Test
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Jan 09 20:24:43 GMT 2020 - 6.4K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/StandardMutableUndirectedGraphTest.java
return GraphBuilder.undirected() .allowsSelfLoops(allowsSelfLoops) .incidentEdgeOrder(incidentEdgeOrder) .build(); } @Override final void addNode(Integer n) { graphAsMutableGraph.addNode(n); } @Override final void putEdge(Integer n1, Integer n2) { graphAsMutableGraph.putEdge(n1, n2); }
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Tue Mar 10 17:54:18 GMT 2020 - 2K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/GraphPropertiesTest.java
assertThat(hasCycle(undirectedGraph)).isFalse(); } @Test public void hasCycle_isolatedNodes() { for (MutableGraph<Integer> graph : graphsToTest) { graph.addNode(1); graph.addNode(2); } assertThat(hasCycle(directedGraph)).isFalse(); assertThat(hasCycle(undirectedGraph)).isFalse(); } @Test public void hasCycle_oneEdge() {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 07 15:09:01 GMT 2016 - 5.7K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/GraphMutationTest.java
assertThat(graph.nodes()).isEmpty(); assertThat(graph.edges()).isEmpty(); AbstractGraphTest.validateGraph(graph); while (graph.nodes().size() < NUM_NODES) { graph.addNode(gen.nextInt(NODE_POOL_SIZE)); } ArrayList<Integer> nodeList = new ArrayList<>(graph.nodes()); while (graph.edges().size() < NUM_EDGES) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri Aug 18 16:17:46 GMT 2017 - 4.2K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/NetworkEquivalenceTest.java
default: throw new IllegalStateException("Unexpected edge type: " + edgeType); } } @Test public void equivalent_nodeSetsDiffer() { network.addNode(N1); MutableNetwork<Integer, String> g2 = createNetwork(edgeType); g2.addNode(N2); assertThat(network).isNotEqualTo(g2); } // Node sets are the same, but edge sets differ. @Test public void equivalent_edgeSetsDiffer() {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Jun 22 19:09:27 GMT 2017 - 5.9K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/ElementOrderTest.java
graph.addNode(node4); graph.addNode(node2); graph.addNode(node6); graph.addNode(node8); assertThat(graph.nodeOrder().comparator()).isEqualTo(Ordering.natural()); assertThat(graph.nodes()).containsExactly(node2, node4, node6, node8).inOrder(); } private static void addNodes(MutableGraph<Integer> graph) { graph.addNode(3); graph.addNode(1);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 8.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/StandardMutableValueGraph.java
} @Override public ElementOrder<N> incidentEdgeOrder() { return incidentEdgeOrder; } @Override @CanIgnoreReturnValue public boolean addNode(N node) { checkNotNull(node, "node"); if (containsNode(node)) { return false; } addNodeInternal(node); return true; } /**
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) -
android/guava/src/com/google/common/collect/LinkedListMultimap.java
* element, or at the end of the list if {@code nextSibling} is null. Note: if {@code nextSibling} * is specified, it MUST be for a node for the same {@code key}! */ @CanIgnoreReturnValue private Node<K, V> addNode( @ParametricNullness K key, @ParametricNullness V value, @CheckForNull Node<K, V> nextSibling) { Node<K, V> node = new Node<>(key, value); if (head == null) { // empty list
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri Oct 13 14:11:58 GMT 2023 - 27.2K bytes - Viewed (0)