/external/chromium_org/third_party/WebKit/Source/core/css/invalidation/ |
DescendantInvalidationSetTest.cpp | 37 RefPtrWillBeRawPtr<DescendantInvalidationSet> set1 = DescendantInvalidationSet::create(); local 40 set1->addId("a"); 43 set1->combine(*set2); 45 ASSERT_TRUE(set1->wholeSubtreeInvalid()); 46 ASSERT_TRUE(set1->isEmpty()); 52 RefPtrWillBeRawPtr<DescendantInvalidationSet> set1 = DescendantInvalidationSet::create(); local 55 set1->setWholeSubtreeInvalid(); 58 set1->combine(*set2); 60 ASSERT_TRUE(set1->wholeSubtreeInvalid()); 61 ASSERT_TRUE(set1->isEmpty()) [all...] |
/external/chromium_org/third_party/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 | 70 SkTSet<int> set1 = set0; local 72 REPORTER_ASSERT(reporter, set0.count() == set1.count()); 73 REPORTER_ASSERT(reporter, !set1.contains(-1000)); 76 REPORTER_ASSERT(reporter, set1.contains(f(i))); 77 REPORTER_ASSERT(reporter, set1[i] == f(i)); 94 set1.validate();
|
TextBlobTest.cpp | 25 RunDef set1[] = { local 28 RunBuilderTest(reporter, builder, set1, SK_ARRAY_COUNT(set1), set1, SK_ARRAY_COUNT(set1));
|
/bionic/libc/include/ |
sched.h | 86 #define CPU_EQUAL(set1, set2) CPU_EQUAL_S(sizeof(cpu_set_t), set1, set2) 88 #define CPU_AND(dst, set1, set2) __CPU_OP(dst, set1, set2, &) 89 #define CPU_OR(dst, set1, set2) __CPU_OP(dst, set1, set2, |) 90 #define CPU_XOR(dst, set1, set2) __CPU_OP(dst, set1, set2, ^) 92 #define __CPU_OP(dst, set1, set2, op) __CPU_OP_S(sizeof(cpu_set_t), dst, set1, set2, op [all...] |
/development/ndk/platforms/android-L/include/ |
sched.h | 86 #define CPU_EQUAL(set1, set2) CPU_EQUAL_S(sizeof(cpu_set_t), set1, set2) 88 #define CPU_AND(dst, set1, set2) __CPU_OP(dst, set1, set2, &) 89 #define CPU_OR(dst, set1, set2) __CPU_OP(dst, set1, set2, |) 90 #define CPU_XOR(dst, set1, set2) __CPU_OP(dst, set1, set2, ^) 92 #define __CPU_OP(dst, set1, set2, op) __CPU_OP_S(sizeof(cpu_set_t), dst, set1, set2, op [all...] |
/external/chromium_org/extensions/common/ |
url_pattern_set_unittest.cc | 94 URLPatternSet set1; local 95 AddPattern(&set1, "http://www.google.com/f*"); 96 AddPattern(&set1, "http://www.yahoo.com/b*"); 106 EXPECT_FALSE(set1.OverlapsWith(set2)); 107 EXPECT_FALSE(set2.OverlapsWith(set1)); 109 EXPECT_TRUE(set1.OverlapsWith(set3)); 110 EXPECT_TRUE(set3.OverlapsWith(set1)); 115 URLPatternSet set1; local 117 AddPattern(&set1, "http://www.google.com/f*"); 118 AddPattern(&set1, "http://www.yahoo.com/b*") 148 URLPatternSet set1; local 180 URLPatternSet set1; local 208 URLPatternSet set1; local 239 URLPatternSet set1; local 252 URLPatternSet set1; local [all...] |
url_pattern_set.h | 29 // Clears |out| and populates the set with |set1| - |set2|. 30 static void CreateDifference(const URLPatternSet& set1, 34 // Clears |out| and populates the set with the intersection of |set1| 36 static void CreateIntersection(const URLPatternSet& set1, 40 // Clears |out| and populates the set with the union of |set1| and |set2|. 41 static void CreateUnion(const URLPatternSet& set1,
|
url_pattern_set.cc | 28 void URLPatternSet::CreateDifference(const URLPatternSet& set1, 32 set1.patterns_, set2.patterns_); 36 void URLPatternSet::CreateIntersection(const URLPatternSet& set1, 40 set1.patterns_, set2.patterns_); 44 void URLPatternSet::CreateUnion(const URLPatternSet& set1, 48 set1.patterns_, set2.patterns_);
|
/external/chromium_org/v8/test/cctest/ |
test-unique.cc | 268 UniqueSet<T>* set1, UniqueSet<T>* set2, bool expected) { 269 CHECK(set1->Equals(set1)); 271 CHECK(expected == set1->Equals(set2)); 272 CHECK(expected == set2->Equals(set1)); 283 UniqueSet<String>* set1 = new(&zone) UniqueSet<String>(); local 286 CHECK_SETS(set1, set2, true); 288 set1->Add(A, &zone); 290 CHECK_SETS(set1, set2, false); 294 CHECK_SETS(set1, set2, true) 321 UniqueSet<String>* set1 = new(&zone) UniqueSet<String>(); local 356 UniqueSet<String>* set1 = new(&zone) UniqueSet<String>(); local 406 UniqueSet<String>* set1 = MakeSet(&zone, i, elements); local 422 UniqueSet<String>* set1 = new(&zone) UniqueSet<String>(); local 470 UniqueSet<String>* set1 = MakeSet(&zone, i, elements); local 490 UniqueSet<String>* set1 = new(&zone) UniqueSet<String>(); local 538 UniqueSet<String>* set1 = MakeSet(&zone, i, elements); local [all...] |
/bionic/tests/ |
sched_test.cpp | 119 cpu_set_t set1; local 122 CPU_ZERO(&set1); 124 CPU_SET(1, &set1); 125 ASSERT_FALSE(CPU_EQUAL(&set1, &set2)); 127 ASSERT_TRUE(CPU_EQUAL(&set1, &set2)); 131 cpu_set_t set1; local 135 CPU_ZERO(&set1); 138 CPU_SET(0, &set1); 142 CPU_AND(&set3, &set1, &set2); 147 CPU_XOR(&set3, &set1, &set2) 213 cpu_set_t* set1 = CPU_ALLOC(set_size1); local 250 cpu_set_t* set1 = CPU_ALLOC(set_size1); local [all...] |
/external/chromium_org/extensions/common/permissions/ |
permission_set.h | 45 // Creates a new permission set equal to |set1| - |set2|, passing ownership of 48 const PermissionSet* set1, const PermissionSet* set2); 50 // Creates a new permission set equal to the intersection of |set1| and 53 const PermissionSet* set1, const PermissionSet* set2); 55 // Creates a new permission set equal to the union of |set1| and |set2|. 58 const PermissionSet* set1, const PermissionSet* set2);
|
base_set_operators.h | 145 static void Difference(const T& set1, const T& set2, T* set3) { 149 const_iterator it1 = set1.begin(); 151 const const_iterator end1 = set1.end(); 175 static void Intersection(const T& set1, const T& set2, T* set3) { 179 const_iterator it1 = set1.begin(); 181 const const_iterator end1 = set1.end(); 199 static void Union(const T& set1, const T& set2, T* set3) { 203 const_iterator it1 = set1.begin(); 205 const const_iterator end1 = set1.end();
|
permission_set.cc | 53 const PermissionSet* set1, 56 const PermissionSet* set1_safe = (set1 == NULL) ? empty.get() : set1; 83 const PermissionSet* set1, 86 const PermissionSet* set1_safe = (set1 == NULL) ? empty.get() : set1; 113 const PermissionSet* set1, 116 const PermissionSet* set1_safe = (set1 == NULL) ? empty.get() : set1;
|
manifest_permission_set_unittest.cc | 134 ManifestPermissionSet set1; local 135 set1.insert(new MockManifestPermission("p1")); 136 set1.insert(new MockManifestPermission("p2")); 140 EXPECT_FALSE(set1.Contains(set2)); 141 EXPECT_FALSE(set2.Contains(set1));
|
/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...] |
/external/chromium_org/components/invalidation/ |
object_id_invalidation_map_unittest.cc | 21 set1.insert(kIdOne); 35 ObjectIdSet set1; member in class:syncer::__anon11172::ObjectIdInvalidationMapTest 62 EXPECT_EQ(set1, one_invalidation.GetObjectIds()); 67 EXPECT_TRUE(empty.GetSubsetWithObjectIds(set1).Empty()); 69 EXPECT_TRUE(one_invalidation.GetSubsetWithObjectIds(set1) ==
|
/cts/tests/tests/animation/src/android/animation/cts/ |
AnimatorSetTest.java | 178 final AnimatorSet set1 = new AnimatorSet(); local 180 set1.addListener(setListener); 197 set1.playTogether(animator1, animator2); 200 set1.setTarget(target); 204 set1.start(); 207 assertTrue(set1.isStarted()); 210 AnimatorSet set2 = set1.clone(); 213 assertUnique(set1); 232 for (Animator.AnimatorListener listener : set1.getListeners()) {
|
/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...] |
/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_org/content/browser/indexed_db/ |
indexed_db_transaction_coordinator.cc | 131 static bool DoSetsIntersect(const std::set<T>& set1, 133 typename std::set<T>::const_iterator it1 = set1.begin(); 135 while (it1 != set1.end() && it2 != set2.end()) {
|
/external/chromium_org/chrome/common/extensions/permissions/ |
permission_set_unittest.cc | 252 scoped_refptr<PermissionSet> set1; local 279 set1 = new PermissionSet(apis1, manifest_permissions, 283 union_set = PermissionSet::CreateUnion(set1.get(), set2.get()); 284 EXPECT_TRUE(set1->Contains(*set2.get())); 285 EXPECT_TRUE(set1->Contains(*union_set.get())); 286 EXPECT_FALSE(set2->Contains(*set1.get())); 288 EXPECT_TRUE(union_set->Contains(*set1.get())); 339 union_set = PermissionSet::CreateUnion(set1.get(), set2.get()); 341 EXPECT_FALSE(set1->Contains(*set2.get())); 342 EXPECT_FALSE(set1->Contains(*union_set.get())) 374 scoped_refptr<PermissionSet> set1; local 486 scoped_refptr<PermissionSet> set1; local 1668 scoped_refptr<PermissionSet> set1; local [all...] |
/external/lldb/test/unittest2/test/ |
test_case.py | 743 set1 = set() 745 self.assertSetEqual(set1, set2) 749 self.assertRaises(self.failureException, self.assertSetEqual, set1, None) 750 self.assertRaises(self.failureException, self.assertSetEqual, set1, []) 752 set1 = set(['a']) 754 self.assertRaises(self.failureException, self.assertSetEqual, set1, set2) 756 set1 = set(['a']) 758 self.assertSetEqual(set1, set2) 760 set1 = set(['a']) 762 self.assertRaises(self.failureException, self.assertSetEqual, set1, set2 [all...] |
/external/chromium_org/third_party/icu/source/common/ |
uset.cpp | 179 uset_containsAll(const USet* set1, const USet* set2) { 180 return ((const UnicodeSet*) set1)->UnicodeSet::containsAll(* (const UnicodeSet*) set2); 191 uset_containsNone(const USet* set1, const USet* set2) { 192 return ((const UnicodeSet*) set1)->UnicodeSet::containsNone(* (const UnicodeSet*) set2); 196 uset_containsSome(const USet* set1, const USet* set2) { 197 return ((const UnicodeSet*) set1)->UnicodeSet::containsSome(* (const UnicodeSet*) set2); 221 uset_equals(const USet* set1, const USet* set2) { 222 return *(const UnicodeSet*)set1 == *(const UnicodeSet*)set2;
|