Searched refs:set2 (Results 1 - 25 of 68) sorted by relevance

123

/external/chromium_org/third_party/skia/tests/
H A DGrOrderedSetTest.cpp126 Set2 set2; local
128 set2.insert("ape");
129 set2.insert(char1);
130 set2.insert(char2);
131 set2.insert(char3);
132 set2.insert("ant");
133 set2.insert("cat");
135 REPORTER_ASSERT(reporter, set2.count() == 4);
136 REPORTER_ASSERT(reporter, set2.find("dog") == set2
[all...]
H A DBitSetTest.cpp56 SkBitSet set2(1);
61 REPORTER_ASSERT(reporter, set2 == set3);
62 REPORTER_ASSERT(reporter, set2 != set4);
63 REPORTER_ASSERT(reporter, set2 != set5);
65 set2.setBit(0, true);
66 REPORTER_ASSERT(reporter, set2 != set5);
68 REPORTER_ASSERT(reporter, set2 != set5);
69 REPORTER_ASSERT(reporter, set2 != set3);
71 REPORTER_ASSERT(reporter, set2 == set3);
73 set3 = set2;
[all...]
H A DTSetTest.cpp81 SkTSet<int> set2; local
82 set2 = set0;
84 REPORTER_ASSERT(reporter, set0.count() == set2.count());
85 REPORTER_ASSERT(reporter, !set2.contains(-1000));
88 REPORTER_ASSERT(reporter, set2.contains(f(i)));
89 REPORTER_ASSERT(reporter, set2[i] == f(i));
95 set2.validate();
/external/skia/tests/
H A DGrOrderedSetTest.cpp126 Set2 set2; local
128 set2.insert("ape");
129 set2.insert(char1);
130 set2.insert(char2);
131 set2.insert(char3);
132 set2.insert("ant");
133 set2.insert("cat");
135 REPORTER_ASSERT(reporter, set2.count() == 4);
136 REPORTER_ASSERT(reporter, set2.find("dog") == set2
[all...]
H A DBitSetTest.cpp56 SkBitSet set2(1);
61 REPORTER_ASSERT(reporter, set2 == set3);
62 REPORTER_ASSERT(reporter, set2 != set4);
63 REPORTER_ASSERT(reporter, set2 != set5);
65 set2.setBit(0, true);
66 REPORTER_ASSERT(reporter, set2 != set5);
68 REPORTER_ASSERT(reporter, set2 != set5);
69 REPORTER_ASSERT(reporter, set2 != set3);
71 REPORTER_ASSERT(reporter, set2 == set3);
73 set3 = set2;
[all...]
H A DTSetTest.cpp81 SkTSet<int> set2; local
82 set2 = set0;
84 REPORTER_ASSERT(reporter, set0.count() == set2.count());
85 REPORTER_ASSERT(reporter, !set2.contains(-1000));
88 REPORTER_ASSERT(reporter, set2.contains(f(i)));
89 REPORTER_ASSERT(reporter, set2[i] == f(i));
95 set2.validate();
/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_unittest.cc98 URLPatternSet set2; local
99 AddPattern(&set2, "http://www.reddit.com/f*");
100 AddPattern(&set2, "http://www.yahoo.com/z*");
106 EXPECT_FALSE(set1.OverlapsWith(set2));
107 EXPECT_FALSE(set2.OverlapsWith(set1));
116 URLPatternSet set2; local
122 URLPatternSet::CreateDifference(set1, set2, &result);
126 AddPattern(&set2, "http://www.reddit.com/f*");
127 AddPattern(&set2, "http://www.yahoo.com/z*");
128 AddPattern(&set2, "htt
162 URLPatternSet set2; local
194 URLPatternSet set2; local
209 URLPatternSet set2; local
240 URLPatternSet set2; local
253 URLPatternSet set2; local
[all...]
H A Durl_pattern_set.h29 // Clears |out| and populates the set with |set1| - |set2|.
31 const URLPatternSet& set2,
35 // and |set2|.
37 const URLPatternSet& set2,
40 // Clears |out| and populates the set with the union of |set1| and |set2|.
42 const URLPatternSet& set2,
/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/third_party/WebKit/Source/core/css/invalidation/
H A DDescendantInvalidationSetTest.cpp38 RefPtrWillBeRawPtr<DescendantInvalidationSet> set2 = DescendantInvalidationSet::create(); local
41 set2->setWholeSubtreeInvalid();
43 set1->combine(*set2);
53 RefPtrWillBeRawPtr<DescendantInvalidationSet> set2 = DescendantInvalidationSet::create(); local
56 set2->addAttribute("a");
58 set1->combine(*set2);
/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/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/extensions/common/permissions/
H A Dpermission_set.h45 // Creates a new permission set equal to |set1| - |set2|, passing ownership of
48 const PermissionSet* set1, const PermissionSet* set2);
51 // |set2|, passing ownership of the new set to the caller.
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 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();
H A Dpermission_set.cc54 const PermissionSet* set2) {
57 const PermissionSet* set2_safe = (set2 == NULL) ? empty.get() : set2;
84 const PermissionSet* set2) {
87 const PermissionSet* set2_safe = (set2 == NULL) ? empty.get() : set2;
114 const PermissionSet* set2) {
117 const PermissionSet* set2_safe = (set2 == NULL) ? empty.get() : set2;
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
/external/chromium_org/third_party/skia/third_party/lua/src/
H A Dltablib.c164 static void set2 (lua_State *L, int i, int j) { function
191 set2(L, l, u); /* swap a[l] - a[u] */
199 set2(L, i, l);
204 set2(L, i, u);
212 set2(L, i, u-1);
230 set2(L, i, j);
234 set2(L, u-1, i); /* swap pivot (a[u-1]) with a[i] */
/external/chromium_org/components/invalidation/
H A Dobject_id_invalidation_map_unittest.cc22 set2.insert(kIdTwo);
36 ObjectIdSet set2; member in class:syncer::__anon6547::ObjectIdInvalidationMapTest
73 EXPECT_TRUE(one_invalidation.GetSubsetWithObjectIds(set2).Empty());
H A Dunacked_invalidation_set_unittest.cc130 SingleObjectInvalidationSet set2 = GetStoredInvalidations(); local
131 ASSERT_EQ(kMax, set2.GetSize());
132 EXPECT_TRUE(set2.StartsWithUnknownVersion());
133 EXPECT_TRUE(set2.begin()->is_unknown_version());
134 EXPECT_EQ(kMax, static_cast<size_t>(set2.rbegin()->version()));
/external/smali/util/src/main/java/org/jf/util/
H A DCollectionUtils.java193 @Nonnull Collection<? extends T> set2) {
194 int res = Ints.compare(set1.size(), set2.size());
198 SortedSet<? extends T> sortedSet2 = toNaturalSortedSet(set2);
200 Iterator<? extends T> elements2 = set2.iterator();
215 SortedSet<? extends T> set2 = toSortedSet(elementComparator, list2);
217 Iterator<? extends T> elements2 = set2.iterator();
192 compareAsSet(@onnull Collection<? extends T> set1, @Nonnull Collection<? extends T> set2) argument
/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/icu/icu4c/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/guava/guava/src/com/google/common/collect/
H A DSets.java571 * {@code set1}, then over each element of {@code set2}, in order, that is not
574 * <p>Results are undefined if {@code set1} and {@code set2} are sets based on
583 final Set<? extends E> set1, final Set<? extends E> set2) {
585 checkNotNull(set2, "set2");
587 final Set<? extends E> set2minus1 = difference(set2, set1);
594 return set1.isEmpty() && set2.isEmpty();
601 return set1.contains(object) || set2.contains(object);
605 set.addAll(set2);
610 .addAll(set1).addAll(set2)
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 DSets.java559 * {@code set1}, then over each element of {@code set2}, in order, that is not
562 * <p>Results are undefined if {@code set1} and {@code set2} are sets based on
571 final Set<? extends E> set1, final Set<? extends E> set2) {
573 checkNotNull(set2, "set2");
575 final Set<? extends E> set2minus1 = difference(set2, set1);
582 return set1.isEmpty() && set2.isEmpty();
589 return set1.contains(object) || set2.contains(object);
593 set.addAll(set2);
598 .addAll(set1).addAll(set2)
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/chromium_org/chrome/common/extensions/permissions/
H A Dpermission_set_unittest.cc253 scoped_refptr<PermissionSet> set2; local
281 set2 = new PermissionSet(apis2, manifest_permissions,
283 union_set = PermissionSet::CreateUnion(set1.get(), set2.get());
284 EXPECT_TRUE(set1->Contains(*set2.get()));
286 EXPECT_FALSE(set2->Contains(*set1.get()));
287 EXPECT_FALSE(set2->Contains(*union_set.get()));
289 EXPECT_TRUE(union_set->Contains(*set2.get()));
337 set2 = new PermissionSet(apis2, manifest_permissions,
339 union_set = PermissionSet::CreateUnion(set1.get(), set2.get());
341 EXPECT_FALSE(set1->Contains(*set2
375 scoped_refptr<PermissionSet> set2; local
487 scoped_refptr<PermissionSet> set2; local
1669 scoped_refptr<PermissionSet> set2; local
[all...]

Completed in 664 milliseconds

123