Searched defs:set2 (Results 1 - 25 of 38) sorted by relevance

12

/external/stlport/test/eh/
H A Dtest.cpp18 std::set<int> set1, set2; local
26 set2.insert(1);
27 set2.insert(1);
31 printElements(set2, "set2 : ");
/external/chromium_org/extensions/common/permissions/
H A Dmanifest_permission_set_unittest.cc174 ManifestPermissionSet set2; local
175 set2.insert(new MockManifestPermission("p3"));
177 EXPECT_FALSE(set1.Contains(set2));
178 EXPECT_FALSE(set2.Contains(set1));
H A Dpermission_set.cc55 const PermissionSet* set2) {
58 const PermissionSet* set2_safe = (set2 == NULL) ? empty.get() : set2;
85 const PermissionSet* set2) {
88 const PermissionSet* set2_safe = (set2 == NULL) ? empty.get() : set2;
115 const PermissionSet* set2) {
118 const PermissionSet* set2_safe = (set2 == NULL) ? empty.get() : set2;
53 CreateDifference( const PermissionSet* set1, const PermissionSet* set2) argument
83 CreateIntersection( const PermissionSet* set1, const PermissionSet* set2) argument
113 CreateUnion( const PermissionSet* set1, const PermissionSet* set2) argument
H A Dbase_set_operators.h145 static void Difference(const T& set1, const T& set2, T* set3) { argument
150 const_iterator it2 = set2.begin();
152 const const_iterator end2 = set2.end();
175 static void Intersection(const T& set1, const T& set2, T* set3) { argument
180 const_iterator it2 = set2.begin();
182 const const_iterator end2 = set2.end();
199 static void Union(const T& set1, const T& set2, T* set3) { argument
204 const_iterator it2 = set2.begin();
206 const const_iterator end2 = set2.end();
/external/chromium_org/sync/notifier/
H A Dobject_id_invalidation_map_unittest.cc22 set2.insert(kIdTwo);
36 ObjectIdSet set2; member in class:syncer::__anon10763::ObjectIdInvalidationMapTest
73 EXPECT_TRUE(one_invalidation.GetSubsetWithObjectIds(set2).Empty());
H A Dunacked_invalidation_set_unittest.cc127 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/skia/tests/
H A DTSetTest.cpp82 SkTSet<int> set2; local
83 set2 = set0;
85 REPORTER_ASSERT(reporter, set0.count() == set2.count());
86 REPORTER_ASSERT(reporter, !set2.contains(-1000));
89 REPORTER_ASSERT(reporter, set2.contains(f(i)));
90 REPORTER_ASSERT(reporter, set2[i] == f(i));
96 set2.validate();
H A DPathOpsAngleTest.cpp77 static const SortSet set2[] = { variable
234 { TEST_ENTRY(set2), {0, 0}},
/external/chromium_org/sync/internal_api/public/base/
H A Denum_set.h23 EnumSet<E, Min, Max> set2);
27 EnumSet<E, Min, Max> set2);
31 EnumSet<E, Min, Max> set2);
226 EnumSet set1, EnumSet set2);
228 EnumSet set1, EnumSet set2);
230 EnumSet set1, EnumSet set2);
267 EnumSet<E, Min, Max> set2) {
268 return EnumSet<E, Min, Max>(set1.enums_ | set2.enums_);
273 EnumSet<E, Min, Max> set2) {
274 return EnumSet<E, Min, Max>(set1.enums_ & set2
266 Union(EnumSet<E, Min, Max> set1, EnumSet<E, Min, Max> set2) argument
272 Intersection(EnumSet<E, Min, Max> set1, EnumSet<E, Min, Max> set2) argument
278 Difference(EnumSet<E, Min, Max> set1, EnumSet<E, Min, Max> set2) argument
[all...]
/external/chromium_org/content/browser/indexed_db/
H A Dindexed_db_transaction_coordinator.cc126 const std::set<T>& set2) {
128 typename std::set<T>::const_iterator it2 = set2.begin();
129 while (it1 != set1.end() && it2 != set2.end()) {
125 DoSetsIntersect(const std::set<T>& set1, const std::set<T>& set2) argument
/external/chromium_org/v8/test/cctest/
H A Dtest-unique.cc268 UniqueSet<T>* set1, UniqueSet<T>* set2, bool expected) {
270 CHECK(set2->Equals(set2));
271 CHECK(expected == set1->Equals(set2));
272 CHECK(expected == set2->Equals(set1));
284 UniqueSet<String>* set2 = new(&zone) UniqueSet<String>(); local
286 CHECK_SETS(set1, set2, true);
290 CHECK_SETS(set1, set2, false);
292 set2->Add(A, &zone);
294 CHECK_SETS(set1, set2, tru
267 CHECK_SETS( UniqueSet<T>* set1, UniqueSet<T>* set2, bool expected) argument
322 UniqueSet<String>* set2 = new(&zone) UniqueSet<String>(); local
357 UniqueSet<String>* set2 = new(&zone) UniqueSet<String>(); local
407 UniqueSet<String>* set2 = MakeSet(&zone, j, elements); local
423 UniqueSet<String>* set2 = new(&zone) UniqueSet<String>(); local
471 UniqueSet<String>* set2 = MakeSet(&zone, j, elements); local
491 UniqueSet<String>* set2 = new(&zone) UniqueSet<String>(); local
539 UniqueSet<String>* set2 = MakeSet(&zone, j, elements); local
[all...]
/external/chromium_org/extensions/common/
H A Durl_pattern_set.cc29 const URLPatternSet& set2,
33 set1.patterns_, set2.patterns_);
38 const URLPatternSet& set2,
42 set2.patterns_.begin(), set2.patterns_.end(),
49 const URLPatternSet& set2,
53 set2.patterns_.begin(), set2.patterns_.end(),
28 CreateDifference(const URLPatternSet& set1, const URLPatternSet& set2, URLPatternSet* out) argument
37 CreateIntersection(const URLPatternSet& set1, const URLPatternSet& set2, URLPatternSet* out) argument
48 CreateUnion(const URLPatternSet& set1, const URLPatternSet& set2, URLPatternSet* out) argument
H A Durl_pattern_set_unittest.cc68 URLPatternSet set2; local
69 AddPattern(&set2, "http://www.reddit.com/f*");
70 AddPattern(&set2, "http://www.yahoo.com/z*");
76 EXPECT_FALSE(set1.OverlapsWith(set2));
77 EXPECT_FALSE(set2.OverlapsWith(set1));
86 URLPatternSet set2; local
92 URLPatternSet::CreateDifference(set1, set2, &result);
96 AddPattern(&set2, "http://www.reddit.com/f*");
97 AddPattern(&set2, "http://www.yahoo.com/z*");
98 AddPattern(&set2, "htt
132 URLPatternSet set2; local
164 URLPatternSet set2; local
179 URLPatternSet set2; local
210 URLPatternSet set2; local
223 URLPatternSet set2; local
[all...]
/external/guava/guava-testlib/src/com/google/common/collect/testing/features/
H A DFeatureUtil.java298 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/valgrind/main/none/tests/ppc32/
H A Dpower5+_round.c89 double set2[] = { 0.9, 0.1, -0.1, -0.9, 1e-40, -1e-40 }; local
111 DO_TEST(frin, set2, frin2, frin2rf);
113 DO_TEST(friz, set2, friz2, friz2rf);
115 DO_TEST(frip, set2, frip2, frip2rf);
117 DO_TEST(frim, set2, frim2, frim2rf);
125 double set2[] = local
137 DO_TEST(frsp, set2, frsp2, fprf2);
/external/chromium_org/chrome/browser/sync/glue/
H A Dsync_backend_host_impl_unittest.cc644 syncer::ModelTypeSet set2 = syncer::ModelTypeSet(syncer::SESSIONS); local
645 IssueRefreshRequest(set2);
647 EXPECT_TRUE(set2.Equals(fake_manager_->GetLastRefreshRequestTypes()));
/external/chromium_org/third_party/icu/source/test/intltest/
H A Ducdtest.cpp349 UnicodeSet set1, set2; local
355 set2.add(start);
359 if (set1!=set2) {
364 //compareUSets(set1, set2,
/external/jmonkeyengine/engine/src/core/com/jme3/math/
H A DTriangle.java154 public void set2(Vector3f v) { method in class:Triangle
/external/stlport/test/unit/
H A Dset_test.cpp21 CPPUNIT_TEST(set2);
38 void set2();
68 void SetTest::set2() function in class:SetTest
/external/chromium/chrome/browser/sync/sessions/
H A Dsession_state.cc239 vector<syncable::Id>* set2 = id_to_conflict_set_[id2]; local
241 if (0 == set1 && 0 == set2) {
253 rv = set2;
255 } else if (0 == set2) {
259 } else if (set1 == set2) {
267 for (i = set2->begin() ; i != set2->end() ; ++i) {
271 rv->insert(rv->end(), set2->begin(), set2->end());
272 conflict_sets_.erase(set2);
[all...]
/external/chromium_org/chrome/common/extensions/permissions/
H A Dpermission_set_unittest.cc246 scoped_refptr<PermissionSet> set2; local
277 set2 = new PermissionSet(apis2, manifest_permissions,
279 union_set = PermissionSet::CreateUnion(set1.get(), set2.get());
280 EXPECT_TRUE(set1->Contains(*set2.get()));
282 EXPECT_FALSE(set2->Contains(*set1.get()));
283 EXPECT_FALSE(set2->Contains(*union_set.get()));
285 EXPECT_TRUE(union_set->Contains(*set2.get()));
339 set2 = new PermissionSet(apis2, manifest_permissions,
341 union_set = PermissionSet::CreateUnion(set1.get(), set2.get());
343 EXPECT_FALSE(set1->Contains(*set2
377 scoped_refptr<PermissionSet> set2; local
496 scoped_refptr<PermissionSet> set2; local
1306 scoped_refptr<PermissionSet> set2; local
[all...]
/external/chromium_org/third_party/icu/source/test/cintltst/
H A Dusettest.c83 USet* set2; local
179 set2 = uset_open(1, 1);
180 uset_clear(set2);
183 uset_applyPropertyAlias(set2, PAT_lb, PAT_lb_LEN, VAL_SP, VAL_SP_LEN, &ec);
184 expect(set2, " ", "abcdefghi{bc}", NULL);
187 uset_set(set2, 0x0061, 0x0063);
192 if (uset_containsSome(set, set2)) {
193 log_err("set should not contain some of set2 yet\n");
195 uset_complementAll(set, set2);
196 if (!uset_containsSome(set, set2)) {
[all...]
/external/icu4c/test/cintltst/
H A Dusettest.c83 USet* set2; local
179 set2 = uset_open(1, 1);
180 uset_clear(set2);
183 uset_applyPropertyAlias(set2, PAT_lb, PAT_lb_LEN, VAL_SP, VAL_SP_LEN, &ec);
184 expect(set2, " ", "abcdefghi{bc}", NULL);
187 uset_set(set2, 0x0061, 0x0063);
192 if (uset_containsSome(set, set2)) {
193 log_err("set should not contain some of set2 yet\n");
195 uset_complementAll(set, set2);
196 if (!uset_containsSome(set, set2)) {
[all...]
/external/icu4c/test/intltest/
H A Ducdtest.cpp354 UnicodeSet set1, set2; local
360 set2.add(start);
364 if (set1!=set2) {
369 //compareUSets(set1, set2,
/external/chromium_org/third_party/icu/source/common/
H A Duset.cpp184 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;

Completed in 779 milliseconds

12