HomeSort by relevance Sort by last modified time
    Searched refs:Sets (Results 1 - 25 of 185) sorted by null

1 2 3 4 5 6 7 8

  /external/guava/guava-tests/test/com/google/common/collect/
SetOperationsTest.java 36 * 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.union
    [all...]
SetsTest.java 20 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.union"
    [all...]
AbstractSetMultimapTest.java 65 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.newHashSet
    [all...]
TransformedSetTest.java 36 * 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);
ForwardingObjectTest.java 41 final Set<String> delegate = Sets.newHashSet("foo");
SortedIterablesTest.java 55 assertTrue(SortedIterables.hasSameComparator(Ordering.natural(), Sets.newTreeSet()));
62 Sets.newTreeSet(Ordering.natural().reverse())));
ImmutableSortedSetTest.java 485 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.newTreeSet(asList("a", "b", "d")).equals(set))
    [all...]
  /external/llvm/lib/Support/
DeltaAlgorithm.cpp 45 const changesetlist_ty &Sets) {
47 UpdatedSearchState(Changes, Sets);
50 if (Sets.size() <= 1)
55 if (Search(Changes, Sets, Res))
58 // Otherwise, partition the sets if possible; if not we are done.
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()
    [all...]
  /external/llvm/include/llvm/ADT/
DeltaAlgorithm.h 18 /// for minimizing arbitrary sets using a predicate function.
59 /// smaller sets, by attempting to remove individual subsets.
61 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) {}
DAGDeltaAlgorithm.h 68 const changesetlist_ty &Sets,
  /external/guava/guava-tests/test/com/google/common/cache/
CacheBuilderFactory.java 24 import com.google.common.collect.Sets;
33 * Helper class for creating {@link CacheBuilder} instances with all combinations of several sets of
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)
    [all...]
  /packages/providers/ContactsProvider/src/com/android/providers/contacts/
TransactionContext.java 20 import com.google.android.collect.Sets;
63 if (mUpdatedRawContacts == null) mUpdatedRawContacts = Sets.newHashSet();
70 mDirtyRawContacts = Sets.newHashSet();
80 mChangedRawContacts = Sets.newHashSet();
91 if (mStaleSearchIndexRawContacts == null) mStaleSearchIndexRawContacts = Sets.newHashSet();
96 if (mStaleSearchIndexContacts == null) mStaleSearchIndexContacts = Sets.newHashSet();
106 if (mUpdatedRawContacts == null) mUpdatedRawContacts = Sets.newHashSet();
111 if (mDirtyRawContacts == null) mDirtyRawContacts = Sets.newHashSet();
116 if (mChangedRawContacts == null) mChangedRawContacts = Sets.newHashSet();
121 if (mStaleSearchIndexRawContacts == null) mStaleSearchIndexRawContacts = Sets.newHashSet()
    [all...]
  /external/guava/guava/src/com/google/common/collect/
ForwardingSet.java 72 return Sets.equalsImpl(this, object);
83 return Sets.hashCodeImpl(this);
WellBehavedMap.java 61 return entrySet = Sets.transform(
66 extends Sets.InvertibleFunction<K, Map.Entry<K, V>> {
  /frameworks/base/core/tests/coretests/src/android/widget/listview/
ListInterleaveFocusables.java 21 import com.google.android.collect.Sets;
32 private Set<Integer> mFocusablePositions = Sets.newHashSet(1, 3, 6);
  /frameworks/base/test-runner/src/android/test/
DatabaseTestUtils.java 19 import com.google.android.collect.Sets;
44 Set<String> schemaSet = Sets.newHashSet();
ClassPathPackageInfo.java 19 import com.google.android.collect.Sets;
46 Set<ClassPathPackageInfo> info = Sets.newHashSet();
54 Set<Class<?>> set = Sets.newHashSet();
  /packages/apps/Contacts/tests/src/com/android/contacts/editor/
ContactEditorUtilsTest.java 26 import com.google.common.collect.Sets;
94 MoreAsserts.assertEquals(Sets.newHashSet(TYPE1.accountType), Sets.newHashSet(types));
100 MoreAsserts.assertEquals(Sets.newHashSet(TYPE1.accountType, TYPE2EX.accountType),
101 Sets.newHashSet(types));
108 Sets.newHashSet(TYPE1.accountType, TYPE2.accountType, TYPE2EX.accountType),
109 Sets.newHashSet(types));
130 Sets.newHashSet(mAccountTypes.mAccounts),
138 Sets.newHashSet(mAccountTypes.mAccounts),
146 Sets.newHashSet(mAccountTypes.mAccounts)
    [all...]
  /external/mockito/src/org/mockito/internal/util/collections/
Sets.java 14 public abstract class Sets {
  /external/guava/guava-tests/test/com/google/common/hash/
HashFunctionsTest.java 5 import com.google.common.collect.Sets;
43 Set<HashCode> hashcodes = Sets.newHashSetWithExpectedSize(objects);
  /external/guava/guava-tests/test/com/google/common/io/
CheckCloseSupplier.java 19 import com.google.common.collect.Sets;
38 private final Set<Callback> open = Sets.newHashSet();
  /development/tools/idegen/src/com/android/idegen/
AggregatedModule.java 23 import com.google.common.collect.Sets;
43 private HashSet<String> directDependencies = Sets.newHashSet();
115 Set<File> result = Sets.newHashSet();
  /external/llvm/utils/TableGen/
TableGen.cpp 81 clEnumValN(PrintSets, "print-sets",
82 "Print expanded sets for testing DAG exprs"),
151 SetTheory Sets;
152 Sets.addFieldExpander("Set", "Elements");
156 const std::vector<Record*> *Elts = Sets.expand(Recs[i]);
  /external/guava/guava-gwt/src/com/google/common/collect/
ImmutableEnumSet_CustomFieldSerializer.java 46 return (ImmutableEnumSet<?>) Sets.immutableEnumSet(deserialized);
  /frameworks/base/core/java/com/google/android/collect/
Sets.java 27 * other static methods for working with Sets.
30 public class Sets {
53 * <p>{@code Set<Base> set = Sets.newHashSet(sub1, sub2);}
58 * <p>{@code Set<Base> set = Sets.<Base>newHashSet(sub1, sub2);}

Completed in 854 milliseconds

1 2 3 4 5 6 7 8