| /external/skia/tests/ |
| BitSetTest.cpp | 17 SkBitSet set1(65536);
18 REPORTER_ASSERT(reporter, set0 == set1);
37 set1.setBit(12345, true);
38 set1.orBits(set0);
40 REPORTER_ASSERT(reporter, set1.isBitSet(12345) == true);
41 REPORTER_ASSERT(reporter, set1.isBitSet(22) == false);
42 REPORTER_ASSERT(reporter, set1.isBitSet(24) == true);
44 REPORTER_ASSERT(reporter, set1 != set0);
46 set1.clearAll();
48 REPORTER_ASSERT(reporter, set1.isBitSet(12345) == false)
[all...] |
| TSetTest.cpp | 69 SkTSet<int> set1 = set0; local
71 REPORTER_ASSERT(reporter, set0.count() == set1.count());
72 REPORTER_ASSERT(reporter, !set1.contains(-1000));
75 REPORTER_ASSERT(reporter, set1.contains(f(i)));
76 REPORTER_ASSERT(reporter, set1[i] == f(i));
93 set1.validate();
|
| /ndk/tests/device/test-gnustl-copy_vector_into_a_set/jni/ |
| copy_vector_into_a_set.cpp | 46 SetOfForms set1(vector1.begin(), vector1.end());
48 SetOfForms set1; local
49 std::copy(vector1.begin(), vector1.end(), std::inserter(set1, set1.begin()));
55 cout<<"******************************************** set size "<< set1.size() << std::endl;
56 for(SetOfForms::iterator iter = set1.begin(); iter != set1.end(); ++iter) {
|
| /ndk/tests/device/test-stlport-copy_vector_into_a_set/jni/ |
| copy_vector_into_a_set.cpp | 46 SetOfForms set1(vector1.begin(), vector1.end());
48 SetOfForms set1; local
49 std::copy(vector1.begin(), vector1.end(), std::inserter(set1, set1.begin()));
55 cout<<"******************************************** set size "<< set1.size() << std::endl;
56 for(SetOfForms::iterator iter = set1.begin(); iter != set1.end(); ++iter) {
|
| /external/chromium_org/extensions/common/ |
| url_pattern_set_unittest.cc | 64 URLPatternSet set1; local
65 AddPattern(&set1, "http://www.google.com/f*");
66 AddPattern(&set1, "http://www.yahoo.com/b*");
76 EXPECT_FALSE(set1.OverlapsWith(set2));
77 EXPECT_FALSE(set2.OverlapsWith(set1));
79 EXPECT_TRUE(set1.OverlapsWith(set3));
80 EXPECT_TRUE(set3.OverlapsWith(set1));
85 URLPatternSet set1; local
87 AddPattern(&set1, "http://www.google.com/f*");
88 AddPattern(&set1, "http://www.yahoo.com/b*")
118 URLPatternSet set1; local
150 URLPatternSet set1; local
178 URLPatternSet set1; local
209 URLPatternSet set1; local
222 URLPatternSet set1; local
[all...] |
| url_pattern_set.h | 28 // Clears |out| and populates the set with |set1| - |set2|.
29 static void CreateDifference(const URLPatternSet& set1,
33 // Clears |out| and populates the set with the intersection of |set1|
35 static void CreateIntersection(const URLPatternSet& set1,
39 // Clears |out| and populates the set with the union of |set1| and |set2|.
40 static void CreateUnion(const URLPatternSet& set1,
|
| url_pattern_set.cc | 27 void URLPatternSet::CreateDifference(const URLPatternSet& set1,
31 std::set_difference(set1.patterns_.begin(), set1.patterns_.end(),
38 void URLPatternSet::CreateIntersection(const URLPatternSet& set1,
42 std::set_intersection(set1.patterns_.begin(), set1.patterns_.end(),
49 void URLPatternSet::CreateUnion(const URLPatternSet& set1,
53 std::set_union(set1.patterns_.begin(), set1.patterns_.end(),
|
| /external/stlport/test/eh/ |
| test.cpp | 18 std::set<int> set1, set2; local
24 set1.insert(aVector.begin(), aVector.end());
30 printElements(set1, "set1 : ");
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| test_compare.py | 32 set1 = [2, 2.0, 2L, 2+0j, Coerce(2), Cmp(2.0)] variable in class:ComparisonTest
34 candidates = set1 + set2
39 if ((a in self.set1) and (b in self.set1)) or a is b:
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| test_compare.py | 32 set1 = [2, 2.0, 2L, 2+0j, Coerce(2), Cmp(2.0)] variable in class:ComparisonTest
34 candidates = set1 + set2
39 if ((a in self.set1) and (b in self.set1)) or a is b:
|
| /external/chromium_org/sync/internal_api/public/base/ |
| enum_set.h | 22 EnumSet<E, Min, Max> Union(EnumSet<E, Min, Max> set1,
26 EnumSet<E, Min, Max> Intersection(EnumSet<E, Min, Max> set1,
30 EnumSet<E, Min, Max> Difference(EnumSet<E, Min, Max> set1,
226 EnumSet set1, EnumSet set2);
228 EnumSet set1, EnumSet set2);
230 EnumSet set1, EnumSet set2);
266 EnumSet<E, Min, Max> Union(EnumSet<E, Min, Max> set1,
268 return EnumSet<E, Min, Max>(set1.enums_ | set2.enums_);
272 EnumSet<E, Min, Max> Intersection(EnumSet<E, Min, Max> set1,
274 return EnumSet<E, Min, Max>(set1.enums_ & set2.enums_)
[all...] |
| /packages/apps/Gallery2/src/com/android/gallery3d/util/ |
| MediaSetUtils.java | 60 public int compare(MediaSet set1, MediaSet set2) {
61 int result = set1.getName().compareToIgnoreCase(set2.getName());
63 return set1.getPath().toString().compareTo(set2.getPath().toString());
|
| /external/valgrind/main/cachegrind/ |
| cg_sim.c | 101 UInt set1 = ( a >> L.line_size_bits) & (L.sets_min_1); \
110 if (set1 == set2) { \
112 set = &(L.tags[set1 * L.assoc]); \
141 /* Nb: this is a fast way of doing ((set1+1) % L.sets) */ \
142 } else if (((set1 + 1) & (L.sets_min_1)) == set2) { \
143 set = &(L.tags[set1 * L.assoc]); \
185 VG_(printf)("addr: %lx size: %u sets: %d %d", a, size, set1, set2);\
|
| /external/eigen/bench/ |
| sparse_randomsetter.cpp | 51 SetterType* set1 = new SetterType(sm1); local
54 (*set1)(internal::random<int>(0,rows-1),internal::random<int>(0,cols-1)) += 1;
57 << " nnz=" << set1->nonZeros() << std::flush;
61 t.reset(); t.start(); delete set1; t.stop();
94 // RandomSetter<EigenSparseMatrix,GnuHashMapTraits,Bits> set1(sm1);
97 // set1(internal::random<int>(0,rows-1),internal::random<int>(0,cols-1)) += 1;
100 // << " nnz=" << set1.nonZeros() << "\n";getchar();
103 // RandomSetter<EigenSparseMatrix,GoogleDenseHashMapTraits,Bits> set1(sm1);
106 // set1(internal::random<int>(0,rows-1),internal::random<int>(0,cols-1)) += 1;
109 // << " nnz=" << set1.nonZeros() << "\n";getchar()
[all...] |
| /frameworks/base/tests/ActivityTests/src/com/google/android/test/activity/ |
| ArrayMapTests.java | 496 ArraySet<Integer> set1 = new ArraySet<Integer>();
499 if (!compare(set1, set2) || !compare(set1, set3) || !compare(set3, set2)) {
500 Log.e("test", "ArraySet equals failure for empty sets " + set1 + ", " +
506 set1.add(i);
510 if (!compare(set1, set2) || !compare(set1, set3) || !compare(set3, set2)) {
511 Log.e("test", "ArraySet equals failure for populated sets " + set1 + ", " +
516 set1.remove(0);
517 if (compare(set1, set2) || compare(set1, set3) || compare(set3, set1))
[all...] |
| /external/chromium_org/chrome/common/extensions/permissions/ |
| api_permission_set.cc | 195 const APIPermissionSet& set1,
201 APIPermissionSet::const_iterator it1 = set1.begin();
203 const APIPermissionSet::const_iterator end1 = set1.end();
228 const APIPermissionSet& set1,
234 APIPermissionSet::const_iterator it1 = set1.begin();
236 const APIPermissionSet::const_iterator end1 = set1.end();
255 const APIPermissionSet& set1,
261 APIPermissionSet::const_iterator it1 = set1.begin();
263 const APIPermissionSet::const_iterator end1 = set1.end();
|
| api_permission_set.h | 136 const APIPermissionSet& set1,
141 const APIPermissionSet& set1,
146 const APIPermissionSet& set1,
|
| permission_set.h | 43 // Creates a new permission set equal to |set1| - |set2|, passing ownership of
46 const PermissionSet* set1, const PermissionSet* set2);
48 // Creates a new permission set equal to the intersection of |set1| and
51 const PermissionSet* set1, const PermissionSet* set2);
53 // Creates a new permission set equal to the union of |set1| and |set2|.
56 const PermissionSet* set1, const PermissionSet* set2);
|
| permission_set_unittest.cc | 240 scoped_refptr<PermissionSet> set1; local
270 set1 = new PermissionSet(apis1, explicit_hosts1, scriptable_hosts1);
272 union_set = PermissionSet::CreateUnion(set1.get(), set2.get());
273 EXPECT_TRUE(set1->Contains(*set2.get()));
274 EXPECT_TRUE(set1->Contains(*union_set.get()));
275 EXPECT_FALSE(set2->Contains(*set1.get()));
277 EXPECT_TRUE(union_set->Contains(*set1.get()));
333 union_set = PermissionSet::CreateUnion(set1.get(), set2.get());
335 EXPECT_FALSE(set1->Contains(*set2.get()));
336 EXPECT_FALSE(set1->Contains(*union_set.get()))
367 scoped_refptr<PermissionSet> set1; local
482 scoped_refptr<PermissionSet> set1; local
1174 scoped_refptr<PermissionSet> set1; local
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| Sets.java | 571 * {@code set1}, then over each element of {@code set2}, in order, that is not
572 * contained in {@code set1}.
574 * <p>Results are undefined if {@code set1} and {@code set2} are sets based on
578 * <p><b>Note:</b> The returned view performs better when {@code set1} is the
583 final Set<? extends E> set1, final Set<? extends E> set2) {
584 checkNotNull(set1, "set1");
587 final Set<? extends E> set2minus1 = difference(set2, set1);
591 return set1.size() + set2minus1.size();
594 return set1.isEmpty() && set2.isEmpty()
[all...] |
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| Sets.java | 559 * {@code set1}, then over each element of {@code set2}, in order, that is not
560 * contained in {@code set1}.
562 * <p>Results are undefined if {@code set1} and {@code set2} are sets based on
566 * <p><b>Note:</b> The returned view performs better when {@code set1} is the
571 final Set<? extends E> set1, final Set<? extends E> set2) {
572 checkNotNull(set1, "set1");
575 final Set<? extends E> set2minus1 = difference(set2, set1);
579 return set1.size() + set2minus1.size();
582 return set1.isEmpty() && set2.isEmpty()
[all...] |
| /external/chromium/chrome/browser/sync/sessions/ |
| session_state.cc | 238 vector<syncable::Id>* set1 = id_to_conflict_set_[id1]; local
241 if (0 == set1 && 0 == set2) {
251 } else if (0 == set1) {
257 rv = set1;
259 } else if (set1 == set2) {
264 rv = set1;
|
| /external/valgrind/main/coregrind/ |
| pub_core_libcsignal.h | 51 extern Bool VG_(iseqsigset) ( const vki_sigset_t* set1,
|
| /ndk/sources/host-tools/gdb-pretty-printers/stlport/gppfs-0.2/test/ |
| test.cpp | 64 std::set<int> set1; local
65 set1.insert( 100);
66 set1.insert( 200);
67 set1.insert( 300);
|
| /prebuilts/python/darwin-x86/2.7.5/share/pretty-printers/stlport/test/ |
| test.cpp | 64 std::set<int> set1; local
65 set1.insert( 100);
66 set1.insert( 200);
67 set1.insert( 300);
|
