- Sort Score
- Num 10 results
- Language All
Results 31 - 40 of 54 for addCode (0.04 seconds)
-
android/guava/src/com/google/common/graph/MutableNetwork.java
* <p><b>Nodes must be unique</b>, just as {@code Map} keys must be. They must also be non-null. * * @return {@code true} if the network was modified as a result of this call */ @CanIgnoreReturnValue boolean addNode(N node); /** * Adds {@code edge} connecting {@code nodeU} to {@code nodeV}. * * <p>If the graph is directed, {@code edge} will be directed in this graph; otherwise, it will be * undirected. *
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Sat Dec 21 03:10:51 GMT 2024 - 4.4K bytes - Click Count (0) -
android/guava-tests/test/com/google/common/graph/StandardImmutableDirectedNetworkTest.java
.nodeOrder(nodeOrder) .edgeOrder(edgeOrder) .immutable(); return networkBuilder.build(); } @Override void addNode(Integer n) { networkBuilder.addNode(n); network = networkBuilder.build(); } @Override void addEdge(Integer n1, Integer n2, String e) { networkBuilder.addEdge(n1, n2, e); network = networkBuilder.build(); }
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Thu Dec 19 18:03:30 GMT 2024 - 2.9K bytes - Click Count (0) -
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, @Nullable Node<K, V> nextSibling) { Node<K, V> node = new Node<>(key, value); if (head == null) { // empty list head = tail = node;Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Mon Sep 22 18:35:44 GMT 2025 - 27K bytes - Click Count (0) -
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) { // Parallel edges are allowed, so this should always succeed.Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Thu Dec 19 18:03:30 GMT 2024 - 4.6K bytes - Click Count (0) -
src/test/java/org/codelibs/fess/suggest/request/suggest/SuggestRequestBuilderTest.java
assertNotNull(response); } @Test public void test_addRole() throws Exception { indexItems(); SuggestResponse response = suggester.suggest().setQuery("test").addRole(SuggestConstants.DEFAULT_ROLE).execute().getResponse(); assertNotNull(response); assertEquals(1, response.getNum()); } @Test public void test_addField() throws Exception {Created: Sat Dec 20 13:04:59 GMT 2025 - Last Modified: Mon Nov 24 03:40:05 GMT 2025 - 6.1K bytes - Click Count (0) -
android/guava-tests/test/com/google/common/graph/NetworkEquivalenceTest.java
} 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() {Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Thu Dec 19 18:03:30 GMT 2024 - 5.9K bytes - Click Count (0) -
guava-tests/test/com/google/common/graph/NetworkEquivalenceTest.java
} 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() {Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Thu Dec 19 18:03:30 GMT 2024 - 5.9K bytes - Click Count (0) -
guava-tests/test/com/google/common/graph/GraphsTest.java
directedGraph.putEdge(N2, N3); directedGraph.addNode(N4); // the above graph is its own transitive closure MutableGraph<Integer> expectedClosure = GraphBuilder.directed().allowsSelfLoops(true).build(); expectedClosure.putEdge(N1, N2); expectedClosure.putEdge(N1, N3); expectedClosure.putEdge(N2, N3); expectedClosure.addNode(N4); assertThat(
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Tue Sep 30 17:09:51 GMT 2025 - 30.1K bytes - Click Count (0) -
src/main/java/org/codelibs/fess/suggest/request/suggest/SuggestRequest.java
* SuggestRequest suggestRequest = new SuggestRequest(); * suggestRequest.setIndex("my_index"); * suggestRequest.setQuery("example query"); * suggestRequest.setSize(5); * suggestRequest.addTag("tag1"); * suggestRequest.addRole("role1"); * suggestRequest.addField("field1"); * suggestRequest.addKind("kind1"); * suggestRequest.addLang("en"); * suggestRequest.setSuggestDetail(true); * suggestRequest.setReadingConverter(new MyReadingConverter());
Created: Sat Dec 20 13:04:59 GMT 2025 - Last Modified: Thu Aug 07 02:41:28 GMT 2025 - 17.8K bytes - Click Count (0) -
src/test/java/org/codelibs/fess/suggest/request/popularwords/PopularWordsRequestTest.java
} @Test public void test_addRole() throws Exception { indexQueryItems(); PopularWordsResponse response = suggester.popularWords().setSize(10).addRole(SuggestConstants.DEFAULT_ROLE).execute().getResponse(); assertNotNull(response); assertTrue(response.getTotal() > 0); } @Test public void test_addField() throws Exception {Created: Sat Dec 20 13:04:59 GMT 2025 - Last Modified: Mon Nov 24 03:40:05 GMT 2025 - 6.9K bytes - Click Count (0)