Searched refs:Sets (Results 1 - 25 of 107) sorted by relevance

12345

/external/guava/guava-tests/test/com/google/common/collect/
H A DSetOperationsTest.java36 * Unit tests for {@link Sets#union}, {@link Sets#intersection} and
37 * {@link Sets#difference}.
48 return Sets.union(
49 Sets.<String>newHashSet(), Sets.<String>newHashSet());
60 return Sets.union(
61 Sets.<String>newHashSet(elements), Sets.newHashSet(elements));
70 return Sets
[all...]
H A DSetsTest.java20 import static com.google.common.collect.Sets.newEnumSet;
21 import static com.google.common.collect.Sets.newHashSet;
22 import static com.google.common.collect.Sets.powerSet;
80 * Unit test for {@code Sets}.
121 ? Sets.newHashSet(
123 : Sets.newHashSet(elements);
126 ? Sets.newHashSet(
128 : Sets.<String>newHashSet();
129 return Sets.union(set1, set2);
132 .named("Sets
[all...]
H A DAbstractSetMultimapTest.java65 equalMap.put("foo", Sets.newHashSet(1, nullValue()));
66 equalMap.put(nullKey(), Sets.newHashSet(3));
72 equalMap.put("foo", Sets.newHashSet(3, nullValue()));
73 equalMap.put(nullKey(), Sets.newHashSet(1));
113 assertEquals(Sets.newHashSet(1, 3), array[0]);
118 asList(Sets.newHashSet(1, 3), Sets.newHashSet(3))));
120 asList(Sets.newHashSet(1, 3), Sets.newHashSet(1))));
161 Set<Map.Entry<String, Integer>> same = Sets
[all...]
H A DTransformedSetTest.java36 * Tests for {@link Sets#transform(Set, Sets.InvertibleFunction)}.
43 private static final Sets.InvertibleFunction<Integer, Integer> integerBijection =
44 new Sets.InvertibleFunction<Integer, Integer>() {
70 Set<Integer> original = Sets.newHashSet(0, 1, 2, 3);
71 Set<Integer> transformed = Sets.transform(original, integerBijection);
109 Set<Integer> invertedIntegers = Sets.newHashSet(Iterables.transform(integers,
111 return Sets.transform(invertedIntegers, integerBijection);
H A DForwardingObjectTest.java41 final Set<String> delegate = Sets.newHashSet("foo");
H A DSortedIterablesTest.java55 assertTrue(SortedIterables.hasSameComparator(Ordering.natural(), Sets.newTreeSet()));
62 Sets.newTreeSet(Ordering.natural().reverse())));
H A DImmutableSortedSetTest.java485 copyOf(Sets.newTreeSet(asList("e", "a", "f", "b", "d", "c")));
490 SortedSet<String> set = copyOf(Sets.<String>newTreeSet());
539 SortedSet<String> input = Sets.newTreeSet(STRING_LENGTH);
546 SortedSet<String> input = Sets.newTreeSet(
554 Sets.newTreeSet(asList("in", "the", "quick", "jumped", "over", "a"));
560 SortedSet<String> input = Sets.newTreeSet(STRING_LENGTH);
569 assertEquals(set, Sets.newTreeSet(asList("a", "b", "c")));
570 assertEquals(Sets.newTreeSet(asList("a", "b", "c")), set);
571 assertFalse(set.equals(Sets.newTreeSet(asList("a", "b", "d"))));
572 assertFalse(Sets
[all...]
H A DTreeMultimapNaturalTest.java20 import static com.google.common.collect.Sets.newHashSet;
156 assertEquals(Sets.newHashSet(1, 3), fooSet);
158 assertEquals(Sets.newHashSet(), missingSet);
161 assertEquals(Sets.newHashSet(0, 1, 3), fooSet);
164 assertEquals(Sets.newHashSet(2), multimap.get("missing"));
170 assertEquals(Sets.newHashSet(3, 7), fooSet);
172 assertEquals(Sets.newHashSet(), missingSet);
175 assertEquals(Sets.newHashSet(3, 6, 7), fooSet);
178 assertEquals(Sets.newHashSet(9), multimap.get("missing"));
184 assertEquals(Sets
[all...]
H A DMapMakerTest.java119 Set<String> expectedKeys = Sets.newHashSetWithExpectedSize(nTasks + nSeededEntries);
169 assertEquals(expectedKeys, Sets.union(map.keySet(), removalNotifications.keySet()));
170 assertTrue(Sets.intersection(map.keySet(), removalNotifications.keySet()).isEmpty());
H A DAbstractImmutableSetTest.java74 assertEquals(Sets.newHashSet("a", "b"), set);
79 assertEquals(Sets.newHashSet("a", "b", "c"), set);
84 assertEquals(Sets.newHashSet("a", "b", "c", "d"), set);
89 assertEquals(Sets.newHashSet("a", "b", "c", "d", "e"), set);
94 assertEquals(Sets.newHashSet("a", "b", "c", "d", "e", "f"), set);
99 assertEquals(Sets.newHashSet("a", "b", "c", "d", "e", "f", "g"), set);
104 assertEquals(Sets.newHashSet("a", "b", "c", "d", "e", "f", "g", "h"), set);
453 Sets.newHashSet(expected), copyOf(misleading));
H A DLinkedHashMultimapTest.java20 import static com.google.common.collect.Sets.newHashSet;
21 import static com.google.common.collect.Sets.newLinkedHashSet;
229 Set<Entry<String, Integer>> set = Sets.newLinkedHashSet(asList(
324 (Collection<Integer>) Sets.newHashSet(2, 3, 6)),
326 (Collection<Integer>) Sets.newHashSet(4, 5, 10, 11)),
328 (Collection<Integer>) Sets.newHashSet(7, 8)),
330 (Collection<Integer>) Sets.newHashSet(9)),
332 (Collection<Integer>) Sets.newHashSet(12, 13, 14))
/external/llvm/lib/Support/
H A DDeltaAlgorithm.cpp45 const changesetlist_ty &Sets) {
47 UpdatedSearchState(Changes, Sets);
50 if (Sets.size() <= 1)
55 if (Search(Changes, Sets, Res))
60 for (changesetlist_ty::const_iterator it = Sets.begin(),
61 ie = Sets.end(); it != ie; ++it)
63 if (SplitSets.size() == Sets.size())
70 const changesetlist_ty &Sets,
73 for (changesetlist_ty::const_iterator it = Sets.begin(),
74 ie = Sets
44 Delta(const changeset_ty &Changes, const changesetlist_ty &Sets) argument
69 Search(const changeset_ty &Changes, const changesetlist_ty &Sets, changeset_ty &Res) argument
77 changesetlist_ty Sets; local
[all...]
/external/guava/guava-tests/test/com/google/common/cache/
H A DCacheBuilderFactory.java24 import com.google.common.collect.Sets;
41 private Set<Integer> concurrencyLevels = Sets.newHashSet((Integer) null);
42 private Set<Integer> initialCapacities = Sets.newHashSet((Integer) null);
43 private Set<Integer> maximumSizes = Sets.newHashSet((Integer) null);
44 private Set<DurationSpec> expireAfterWrites = Sets.newHashSet((DurationSpec) null);
45 private Set<DurationSpec> expireAfterAccesses = Sets.newHashSet((DurationSpec) null);
46 private Set<DurationSpec> refreshes = Sets.newHashSet((DurationSpec) null);
47 private Set<Strength> keyStrengths = Sets.newHashSet((Strength) null);
48 private Set<Strength> valueStrengths = Sets.newHashSet((Strength) null);
51 this.concurrencyLevels = Sets
[all...]
/external/llvm/include/llvm/ADT/
H A DDeltaAlgorithm.h61 const changesetlist_ty &Sets);
63 /// Search - Search for a subset (or subsets) in \p Sets which can be
69 bool Search(const changeset_ty &Changes, const changesetlist_ty &Sets,
75 const changesetlist_ty &Sets) {}
74 UpdatedSearchState(const changeset_ty &Changes, const changesetlist_ty &Sets) argument
H A DDAGDeltaAlgorithm.h68 const changesetlist_ty &Sets,
67 UpdatedSearchState(const changeset_ty &Changes, const changesetlist_ty &Sets, const changeset_ty &Required) argument
/external/guava/guava/src/com/google/common/collect/
H A DForwardingSet.java72 return Sets.equalsImpl(this, object);
83 return Sets.hashCodeImpl(this);
H A DWellBehavedMap.java61 return entrySet = Sets.transform(
66 extends Sets.InvertibleFunction<K, Map.Entry<K, V>> {
/external/mockito/src/org/mockito/internal/util/collections/
H A DSets.java14 public abstract class Sets { class
/external/guava/guava-tests/test/com/google/common/hash/
H A DHashFunctionsTest.java5 import com.google.common.collect.Sets;
43 Set<HashCode> hashcodes = Sets.newHashSetWithExpectedSize(objects);
/external/guava/guava-tests/test/com/google/common/io/
H A DCheckCloseSupplier.java19 import com.google.common.collect.Sets;
38 private final Set<Callback> open = Sets.newHashSet();
/external/guava/guava-gwt/src/com/google/common/collect/
H A DImmutableEnumSet_CustomFieldSerializer.java46 return (ImmutableEnumSet<?>) Sets.immutableEnumSet(deserialized);
/external/llvm/utils/TableGen/
H A DTableGen.cpp154 SetTheory Sets; local
155 Sets.addFieldExpander("Set", "Elements");
159 const std::vector<Record*> *Elts = Sets.expand(Recs[i]);
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
H A DHashMultimap.java109 return Sets.<V>newHashSetWithExpectedSize(expectedValuesPerKey);
/external/droiddriver/src/com/google/android/droiddriver/runner/
H A DTestRunner.java32 import com.google.common.collect.Sets;
47 private final Set<Activity> activities = Sets.newIdentityHashSet();
/external/guava/guava/src/com/google/common/util/concurrent/
H A DSimpleTimeLimiter.java24 import com.google.common.collect.Sets;
169 Set<Method> set = Sets.newHashSet();

Completed in 750 milliseconds

12345