/external/chromium_org/sync/notifier/ |
H A D | unacked_invalidation_set_unittest.cc | 127 SingleObjectInvalidationSet set2 = GetStoredInvalidations(); local 128 ASSERT_EQ(kMax, set2.GetSize()); 129 EXPECT_TRUE(set2.StartsWithUnknownVersion()); 130 EXPECT_TRUE(set2.begin()->is_unknown_version()); 131 EXPECT_EQ(kMax, static_cast<size_t>(set2.rbegin()->version()));
|
/external/lldb/test/unittest2/test/ |
H A D | test_case.py | 744 set2 = set() 745 self.assertSetEqual(set1, set2) 747 self.assertRaises(self.failureException, self.assertSetEqual, None, set2) 748 self.assertRaises(self.failureException, self.assertSetEqual, [], set2) 753 set2 = set() 754 self.assertRaises(self.failureException, self.assertSetEqual, set1, set2) 757 set2 = set(['a']) 758 self.assertSetEqual(set1, set2) 761 set2 = set(['a', 'b']) 762 self.assertRaises(self.failureException, self.assertSetEqual, set1, set2) [all...] |
/external/chromium_org/content/browser/indexed_db/ |
H A D | indexed_db_transaction_coordinator.cc | 131 const std::set<T>& set2) { 133 typename std::set<T>::const_iterator it2 = set2.begin(); 134 while (it1 != set1.end() && it2 != set2.end()) { 130 DoSetsIntersect(const std::set<T>& set1, const std::set<T>& set2) argument
|
/external/valgrind/main/coregrind/ |
H A D | pub_core_libcsignal.h | 52 const vki_sigset_t* set2 );
|
H A D | m_libcsignal.c | 90 Bool VG_(iseqsigset)( const vki_sigset_t* set1, const vki_sigset_t* set2 ) 93 vg_assert(set1 != NULL && set2 != NULL); 95 if (set1->sig[i] != set2->sig[i]) return False;
|
/external/chromium_org/third_party/icu/source/common/ |
H A D | uset.cpp | 184 uset_containsAll(const USet* set1, const USet* set2) { argument 185 return ((const UnicodeSet*) set1)->UnicodeSet::containsAll(* (const UnicodeSet*) set2); 196 uset_containsNone(const USet* set1, const USet* set2) { argument 197 return ((const UnicodeSet*) set1)->UnicodeSet::containsNone(* (const UnicodeSet*) set2); 201 uset_containsSome(const USet* set1, const USet* set2) { argument 202 return ((const UnicodeSet*) set1)->UnicodeSet::containsSome(* (const UnicodeSet*) set2); 226 uset_equals(const USet* set1, const USet* set2) { argument 227 return *(const UnicodeSet*)set1 == *(const UnicodeSet*)set2;
|
/external/icu/icu4c/source/common/ |
H A D | uset.cpp | 179 uset_containsAll(const USet* set1, const USet* set2) { argument 180 return ((const UnicodeSet*) set1)->UnicodeSet::containsAll(* (const UnicodeSet*) set2); 191 uset_containsNone(const USet* set1, const USet* set2) { argument 192 return ((const UnicodeSet*) set1)->UnicodeSet::containsNone(* (const UnicodeSet*) set2); 196 uset_containsSome(const USet* set1, const USet* set2) { argument 197 return ((const UnicodeSet*) set1)->UnicodeSet::containsSome(* (const UnicodeSet*) set2); 221 uset_equals(const USet* set1, const USet* set2) { argument 222 return *(const UnicodeSet*)set1 == *(const UnicodeSet*)set2;
|
/external/chromium_org/extensions/common/permissions/ |
H A D | manifest_permission_set_unittest.cc | 174 ManifestPermissionSet set2; local 175 set2.insert(new MockManifestPermission("p3")); 177 EXPECT_FALSE(set1.Contains(set2)); 178 EXPECT_FALSE(set2.Contains(set1));
|
/external/chromium_org/third_party/icu/source/common/unicode/ |
H A D | uset.h | 862 * of set2. It answers the question, 'Is set1 a superset of set2?' 864 * @param set2 set to be checked for containment 869 uset_containsAll(const USet* set1, const USet* set2); 886 * of set2. It answers the question, 'Is set1 a disjoint set of set2?' 888 * @param set2 set to be checked for containment 893 uset_containsNone(const USet* set1, const USet* set2); 897 * of set2. It answers the question, 'Does set1 and set2 hav [all...] |
/external/icu/icu4c/source/common/unicode/ |
H A D | uset.h | 866 * of set2. It answers the question, 'Is set1 a superset of set2?' 868 * @param set2 set to be checked for containment 873 uset_containsAll(const USet* set1, const USet* set2); 890 * of set2. It answers the question, 'Is set1 a disjoint set of set2?' 892 * @param set2 set to be checked for containment 897 uset_containsNone(const USet* set1, const USet* set2); 901 * of set2. It answers the question, 'Does set1 and set2 hav [all...] |
/external/valgrind/main/cachegrind/ |
H A D | cg_sim.c | 148 UInt set2 = block2 & c->sets_min_1; local 153 cachesim_setref_is_miss(c, set2, tag2); 156 return cachesim_setref_is_miss(c, set2, tag2);
|
/external/chromium_org/third_party/icu/source/test/intltest/ |
H A D | ucdtest.cpp | 349 UnicodeSet set1, set2; local 355 set2.add(start); 359 if (set1!=set2) { 364 //compareUSets(set1, set2,
|
H A D | usettest.cpp | 319 // set1 and set2 used to be built with the obsolete constructor taking 328 UnicodeSet *set2=new UnicodeSet(UNICODE_STRING_SIMPLE("\\p{Decimal Number}"), status); //Number, Decimal digit local 338 if (*set2 != *set2a) { 346 if(*set1 != *set1copy || *set1 == *set2 || 355 UnicodeSet set2equal=*set2; 356 if(set1equal != *set1 || set1equal != *set1copy || set2equal != *set2 || 363 UnicodeSet *set2clone=(UnicodeSet*)set2->clone(); 365 *set2clone != *set2 || *set2clone == *set1copy || *set2clone != set2equal || 372 set2->hashCode() != set2equal.hashCode() || set2 439 UnicodeSet set2; local [all...] |
/external/chromium_org/third_party/webrtc/modules/desktop_capture/ |
H A D | desktop_region.h | 147 const RowSpanSet& set2,
|
H A D | desktop_region.cc | 227 const RowSpanSet& set2, 231 RowSpanSet::const_iterator it2 = set2.begin(); 232 RowSpanSet::const_iterator end2 = set2.end(); 226 IntersectRows(const RowSpanSet& set1, const RowSpanSet& set2, RowSpanSet* output) argument
|
/external/guava/guava-testlib/src/com/google/common/collect/testing/features/ |
H A D | FeatureUtil.java | 298 Set<? extends T> set1, Set<? extends T> set2) { 299 return intersection(new Set[] {set1, set2}); 297 intersection( Set<? extends T> set1, Set<? extends T> set2) argument
|
/external/icu/icu4c/source/test/intltest/ |
H A D | usettest.cpp | 319 // set1 and set2 used to be built with the obsolete constructor taking 328 UnicodeSet *set2=new UnicodeSet(UNICODE_STRING_SIMPLE("\\p{Decimal Number}"), status); //Number, Decimal digit local 338 if (*set2 != *set2a) { 346 if(*set1 != *set1copy || *set1 == *set2 || 355 UnicodeSet set2equal=*set2; 356 if(set1equal != *set1 || set1equal != *set1copy || set2equal != *set2 || 363 UnicodeSet *set2clone=(UnicodeSet*)set2->clone(); 365 *set2clone != *set2 || *set2clone == *set1copy || *set2clone != set2equal || 372 set2->hashCode() != set2equal.hashCode() || set2 439 UnicodeSet set2; local [all...] |
H A D | ucdtest.cpp | 355 UnicodeSet set1, set2; local 361 set2.add(start); 365 if (set1!=set2) { 370 //compareUSets(set1, set2,
|
/external/valgrind/main/callgrind/ |
H A D | sim.c | 299 UInt set2 = block2 & c->sets_min_1; local 304 CacheResult res2 = cachesim_setref(c, set2, tag2); 396 UInt set2 = ((a+size-1) >> c->line_size_bits) & (c->sets_min_1); local 400 if (set1 == set2) 405 else if (((set1 + 1) & (c->sets_min_1)) == set2) { 410 CacheResult res2 = cachesim_setref_wb(c, ref, set2, tag2); 416 VG_(printf)("addr: %lx size: %u sets: %d %d", a, size, set1, set2); 690 UInt set2 = ((a+size-1) >> L.line_size_bits) & (L.sets_min_1); \ 698 L.name, a, size, set1, set2); \ 701 if (set1 == set2) { \ [all...] |
/external/guava/guava-tests/test/com/google/common/collect/ |
H A D | SetsTest.java | 125 Set<String> set2 = (size > 0) 129 return Sets.union(set1, set2); 140 Set<String> set2 = Sets.newHashSet(elements); 141 set2.add(samples().e4); 142 return Sets.intersection(set1, set2); 153 Set<String> set2 = Sets.newHashSet(samples().e3); 154 return Sets.difference(set1, set2);
|
/external/stlport/test/unit/ |
H A D | set_test.cpp | 21 CPPUNIT_TEST(set2); 38 void set2(); 68 void SetTest::set2() function in class:SetTest
|
/external/chromium_org/third_party/WebKit/Source/platform/heap/ |
H A D | HeapTest.cpp | 1984 HeapHashSet<Member<IntWrapper> > set2; member in class:WebCore::Container 1996 visitor->trace(set2); 2230 Persistent<MemberSet> set2 = new MemberSet(); local 2287 set2->add(one); 2288 set2->add(two); 2289 set2->add(three); 2290 set2->add(four); 2330 EXPECT_EQ(4u, set2->size()); 2375 // Swap set and set2 in a roundabout way. 2377 MemberSet& cset2 = container->set2; 2598 Persistent<Set> set2 = new Set(); local 4062 Set set2; local [all...] |
/external/chromium_org/v8/test/mjsunit/harmony/ |
H A D | proxies-with.js | 331 set: function(r, k, v) { return this.set2(r, k, v) }, 332 set2: function(r, k, v) { key = k; val = v; return true },
|
/external/clang/test/Misc/ |
H A D | diag-template-diffing.cpp | 71 void set2(I2<int, int>) {}; function 73 set2(I2<double, int, int>()); 75 // CHECK-ELIDE-NOTREE: no matching function for call to 'set2' 77 // CHECK-NOELIDE-NOTREE: no matching function for call to 'set2' 79 // CHECK-ELIDE-TREE: no matching function for call to 'set2' 85 // CHECK-NOELIDE-TREE: no matching function for call to 'set2'
|
/external/chromium_org/chrome/browser/sync/glue/ |
H A D | sync_backend_host_impl_unittest.cc | 669 syncer::ModelTypeSet set2 = syncer::ModelTypeSet(syncer::SESSIONS); local 670 IssueRefreshRequest(set2); 672 EXPECT_TRUE(set2.Equals(fake_manager_->GetLastRefreshRequestTypes()));
|