- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 27 for union (0.19 sec)
-
android/guava-tests/test/com/google/common/collect/SetOperationsTest.java
enemies = Sets.newHashSet("Dick", "Harry", "Tom"); } public void testUnion() { Set<String> all = Sets.union(friends, enemies); assertEquals(5, all.size()); ImmutableSet<String> immut = Sets.union(friends, enemies).immutableCopy(); HashSet<String> mut = Sets.union(friends, enemies).copyInto(new HashSet<String>()); enemies.add("Buck"); assertEquals(6, all.size());
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Feb 19 20:34:55 GMT 2024 - 14.7K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/MultisetsTest.java
assertThat(Multisets.union(ms1, ms2)).containsExactly("a", "a", "b", "b", "c"); } public void testUnionEqualMultisets() { Multiset<String> ms1 = HashMultiset.create(Arrays.asList("a", "b", "a")); Multiset<String> ms2 = HashMultiset.create(Arrays.asList("a", "b", "a")); assertEquals(ms1, Multisets.union(ms1, ms2)); } public void testUnionEmptyNonempty() {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Feb 19 20:34:55 GMT 2024 - 11.3K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/AbstractDirectedNetworkConnections.java
this.selfLoopCount = checkNonNegative(selfLoopCount); checkState(selfLoopCount <= inEdgeMap.size() && selfLoopCount <= outEdgeMap.size()); } @Override public Set<N> adjacentNodes() { return Sets.union(predecessors(), successors()); } @Override public Set<E> incidentEdges() { return new AbstractSet<E>() { @Override public UnmodifiableIterator<E> iterator() {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 4.5K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/MultisetsCollectionTest.java
.createTestSuite()); suite.addTest( MultisetTestSuiteBuilder.using(unionGenerator()) .withFeatures(CollectionSize.ANY, CollectionFeature.ALLOWS_NULL_VALUES) .named("Multisets.union") .createTestSuite()); suite.addTest( MultisetTestSuiteBuilder.using(intersectionGenerator()) .withFeatures( CollectionSize.ANY,
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 9.3K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/MultisetsCollectionTest.java
.createTestSuite()); suite.addTest( MultisetTestSuiteBuilder.using(unionGenerator()) .withFeatures(CollectionSize.ANY, CollectionFeature.ALLOWS_NULL_VALUES) .named("Multisets.union") .createTestSuite()); suite.addTest( MultisetTestSuiteBuilder.using(intersectionGenerator()) .withFeatures( CollectionSize.ANY,
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 9.3K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/BaseGraph.java
// // Element-level accessors // /** * Returns a live view of the nodes which have an incident edge in common with {@code node} in * this graph. * * <p>This is equal to the union of {@link #predecessors(Object)} and {@link #successors(Object)}. * * <p>If {@code node} is removed from the graph after this method is called, the {@code Set}
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 8.8K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graph.java
// // Element-level accessors // /** * Returns a live view of the nodes which have an incident edge in common with {@code node} in * this graph. * * <p>This is equal to the union of {@link #predecessors(Object)} and {@link #successors(Object)}. * * <p>If {@code node} is removed from the graph after this method is called, the {@code Set}
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 13.6K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Network.java
// // Element-level accessors // /** * Returns a live view of the nodes which have an incident edge in common with {@code node} in * this network. * * <p>This is equal to the union of {@link #predecessors(Object)} and {@link #successors(Object)}. * * <p>If {@code node} is removed from the network after this method is called, the {@code Set}
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 21.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TreeRangeSet.java
TreeRangeSet<C> result = create(); result.addAll(rangeSet); return result; } /** * Returns a {@code TreeRangeSet} representing the union of the specified ranges. * * <p>This is the smallest {@code RangeSet} which encloses each of the specified ranges. An * element will be contained in this {@code RangeSet} if and only if it is contained in at least
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jun 26 21:02:13 GMT 2023 - 32.5K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/AbstractNetwork.java
} @Override public Set<E> adjacentEdges(E edge) { EndpointPair<N> endpointPair = incidentNodes(edge); // Verifies that edge is in this network. Set<E> endpointPairIncidentEdges = Sets.union(incidentEdges(endpointPair.nodeU()), incidentEdges(endpointPair.nodeV())); return edgeInvalidatableSet( Sets.difference(endpointPairIncidentEdges, ImmutableSet.of(edge)), edge); } @Override
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Mar 13 18:17:09 GMT 2024 - 10.1K bytes - Viewed (0)