OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:Sets
(Results
1 - 17
of
17
) sorted by null
/external/guava/guava-tests/test/com/google/common/collect/
SortedIterablesTest.java
55
assertTrue(SortedIterables.hasSameComparator(Ordering.natural(),
Sets
.newTreeSet()));
62
Sets
.newTreeSet(Ordering.natural().reverse())));
MapMakerTest.java
119
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());
TreeMultimapExplicitTest.java
189
assertEquals(
Sets
.newHashSet(null, "tree"), keySet.headSet("yahoo"));
190
assertEquals(
Sets
.newHashSet("google"), keySet.tailSet("yahoo"));
191
assertEquals(
Sets
.newHashSet("tree"), keySet.subSet("ask", "yahoo"));
ImmutableBiMapTest.java
174
assertEquals(
Sets
.newHashSet(map.entrySet()), map.entrySet());
175
assertEquals(
Sets
.newHashSet(map.keySet()), map.keySet());
504
assertEquals(
Sets
.newHashSet("one", "two", "three", "four"), keys);
512
assertEquals(
Sets
.newHashSet(1, 2, 3, 4), values);
ImmutableMapTest.java
171
assertEquals(
Sets
.newHashSet(map.keySet()), map.keySet());
TreeMultimapNaturalTest.java
20
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
.newHashSet(3), fooSet)
[
all
...]
ImmutableSortedMapTest.java
184
assertEquals(
Sets
.newHashSet(map.entrySet()), map.entrySet());
185
assertEquals(
Sets
.newHashSet(map.keySet()), map.keySet());
/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
...]
/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);}
/external/llvm/utils/TableGen/
TableGen.cpp
98
clEnumValN(PrintSets, "print-
sets
",
99
"Print expanded
sets
for testing DAG exprs"),
168
SetTheory
Sets
;
169
Sets
.addFieldExpander("Set", "Elements");
173
const std::vector<Record*> *Elts =
Sets
.expand(Recs[i]);
CodeGenRegisters.h
331
SetTheory
Sets
;
355
// unique set for each register class. Simliar
sets
are coalesced with
378
// Iteratively prune unit
sets
.
393
SetTheory &getSets() { return
Sets
; }
488
// Compute full overlap
sets
for every register. These
sets
include the
/external/guava/guava/src/com/google/common/collect/
Sets.java
64
public final class
Sets
{
65
private
Sets
() {}
358
return
Sets
.newSetFromMap(Maps.<E, Boolean>newIdentityHashMap());
442
* Set<Object> identityHashSet =
Sets
.newSetFromMap(
527
* An unmodifiable view of a set which may be backed by other
sets
; this view
528
* will change as the backing
sets
do. Contains methods to copy the data into
555
* all the
sets
involved are based on the same notion of equivalence.
568
* Returns an unmodifiable <b>view</b> of the union of two
sets
. The returned
574
* <p>Results are undefined if {@code set1} and {@code set2} are
sets
based on
579
* smaller of the two
sets
. If you have reason to believe one of your set
[
all
...]
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
ImmutableSortedSet.java
250
this(
Sets
.newTreeSet(comparator));
Sets.java
61
public final class
Sets
{
62
private
Sets
() {}
355
return
Sets
.newSetFromMap(Maps.<E, Boolean>newIdentityHashMap());
439
* Set<Object> identityHashSet =
Sets
.newSetFromMap(
515
* An unmodifiable view of a set which may be backed by other
sets
; this view
516
* will change as the backing
sets
do. Contains methods to copy the data into
543
* all the
sets
involved are based on the same notion of equivalence.
556
* Returns an unmodifiable <b>view</b> of the union of two
sets
. The returned
562
* <p>Results are undefined if {@code set1} and {@code set2} are
sets
based on
567
* smaller of the two
sets
. If you have reason to believe one of your set
[
all
...]
/packages/apps/Contacts/tests/src/com/android/contacts/editor/
ContactEditorUtilsTest.java
23
import com.google.android.collect.
Sets
;
96
MoreAsserts.assertEquals(
Sets
.newHashSet(TYPE1.accountType),
Sets
.newHashSet(types));
102
MoreAsserts.assertEquals(
Sets
.newHashSet(TYPE1.accountType, TYPE2EX.accountType),
103
Sets
.newHashSet(types));
110
Sets
.newHashSet(TYPE1.accountType, TYPE2.accountType, TYPE2EX.accountType),
111
Sets
.newHashSet(types));
132
Sets
.newHashSet(mAccountTypes.mAccounts),
140
Sets
.newHashSet(mAccountTypes.mAccounts),
148
Sets
.newHashSet(mAccountTypes.mAccounts)
[
all
...]
/prebuilts/tools/common/guava-tools/
guava-10.0.1.jar
/prebuilt/common/tradefed/
tradefed-prebuilt.jar
Completed in 206 milliseconds