/external/chromium_org/third_party/WebKit/Source/core/css/invalidation/ |
H A D | 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 [all...] |
/external/chromium_org/third_party/skia/tests/ |
H A D | 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 [all...] |
H A D | 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();
|
/external/skia/tests/ |
H A D | 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 [all...] |
H A D | 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();
|
/external/chromium_org/extensions/common/ |
H A D | 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, "htt 148 URLPatternSet set1; local 180 URLPatternSet set1; local 208 URLPatternSet set1; local 239 URLPatternSet set1; local 252 URLPatternSet set1; local [all...] |
H A D | 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,
|
H A D | url_pattern_set.cc | 28 void URLPatternSet::CreateDifference(const URLPatternSet& set1, argument 32 set1.patterns_, set2.patterns_); 36 void URLPatternSet::CreateIntersection(const URLPatternSet& set1, argument 40 set1.patterns_, set2.patterns_); 44 void URLPatternSet::CreateUnion(const URLPatternSet& set1, argument 48 set1.patterns_, set2.patterns_);
|
/external/chromium_org/v8/test/cctest/ |
H A D | 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, set 267 CHECK_SETS( UniqueSet<T>* set1, UniqueSet<T>* set2, bool expected) argument 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...] |
/external/stlport/test/eh/ |
H A D | test.cpp | 18 std::set<int> set1, set2; local 24 set1.insert(aVector.begin(), aVector.end()); 30 printElements(set1, "set1 : ");
|
/external/chromium_org/sync/internal_api/public/base/ |
H A D | 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, argument 268 return EnumSet<E, Min, Max>(set1.enums_ | set2.enums_); 272 EnumSet<E, Min, Max> Intersection(EnumSet<E, Min, Max> set1, argument 274 return EnumSet<E, Min, Max>(set1 278 Difference(EnumSet<E, Min, Max> set1, EnumSet<E, Min, Max> set2) argument [all...] |
/external/chromium_org/components/invalidation/ |
H A D | object_id_invalidation_map_unittest.cc | 21 set1.insert(kIdOne); 35 ObjectIdSet set1; member in class:syncer::__anon6547::ObjectIdInvalidationMapTest 62 EXPECT_EQ(set1, one_invalidation.GetObjectIds()); 67 EXPECT_TRUE(empty.GetSubsetWithObjectIds(set1).Empty()); 69 EXPECT_TRUE(one_invalidation.GetSubsetWithObjectIds(set1) ==
|
/external/chromium_org/extensions/common/permissions/ |
H A D | 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);
|
H A D | base_set_operators.h | 145 static void Difference(const T& set1, const T& set2, T* set3) { argument 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) { argument 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) { argument 203 const_iterator it1 = set1.begin(); 205 const const_iterator end1 = set1.end();
|
H A D | 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; 52 CreateDifference( const PermissionSet* set1, const PermissionSet* set2) argument 82 CreateIntersection( const PermissionSet* set1, const PermissionSet* set2) argument 112 CreateUnion( const PermissionSet* set1, const PermissionSet* set2) argument
|
H A D | 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/eigen/bench/ |
H A D | 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 [all...] |
/external/smali/util/src/main/java/org/jf/util/ |
H A D | CollectionUtils.java | 192 public static <T extends Comparable<T>> int compareAsSet(@Nonnull Collection<? extends T> set1, argument 194 int res = Ints.compare(set1.size(), set2.size()); 197 SortedSet<? extends T> sortedSet1 = toNaturalSortedSet(set1); 201 for (T element1: set1) { 214 SortedSet<? extends T> set1 = toSortedSet(elementComparator, list1); 218 for (T element1: set1) {
|
/external/guava/guava/src/com/google/common/collect/ |
H A D | 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 582 union( final Set<? extends E> set1, final Set<? extends E> set2) argument 641 intersection( final Set<E> set1, final Set<?> set2) argument 678 difference( final Set<E> set1, final Set<?> set2) argument 712 symmetricDifference( Set<? extends E> set1, Set<? extends E> set2) argument [all...] |
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
H A D | 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 570 union( final Set<? extends E> set1, final Set<? extends E> set2) argument 629 intersection( final Set<E> set1, final Set<?> set2) argument 666 difference( final Set<E> set1, final Set<?> set2) argument 700 symmetricDifference( Set<? extends E> set1, Set<? extends E> set2) argument [all...] |
/external/lldb/test/unittest2/test/ |
H A D | 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, set [all...] |
/external/chromium_org/content/browser/indexed_db/ |
H A D | indexed_db_transaction_coordinator.cc | 131 static bool DoSetsIntersect(const std::set<T>& set1, argument 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/ |
H A D | 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 374 scoped_refptr<PermissionSet> set1; local 486 scoped_refptr<PermissionSet> set1; local 1668 scoped_refptr<PermissionSet> set1; local [all...] |
/external/valgrind/main/coregrind/ |
H A D | pub_core_libcsignal.h | 51 extern Bool VG_(iseqsigset) ( const vki_sigset_t* set1,
|
/external/chromium_org/third_party/WebKit/Source/wtf/ |
H A D | ListHashSetTest.cpp | 664 Set set1; local 667 set1.add(i + 1); 671 typename Set::iterator it1 = set1.begin(); 678 EXPECT_EQ(it1, set1.end()); 682 set1.swap(set2); // Swap with non-empty sets. 686 it2 = set1.begin(); 692 EXPECT_EQ(it2, set1.end()); 697 set1.remove(num - removedIndex); 700 it2 = set1.begin(); 708 EXPECT_EQ(it2, set1 [all...] |