| /external/stlport/test/eh/ |
| test.cpp | 18 std::set<int> set1, set2; local
26 set2.insert(1);
27 set2.insert(1);
31 printElements(set2, "set2 : ");
|
| /external/skia/tests/ |
| BitSetTest.cpp | 56 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...] |
| /packages/apps/Gallery2/src/com/android/gallery3d/data/ |
| ComboSource.java | 35 // The only path we accept is "/combo/{set1, set2, ...} and /combo/item/{set1, set2, ...}"
|
| /external/llvm/unittests/ADT/ |
| SparseMultiSetTest.cpp | 196 USet Set2;
197 Set2.setUniverse(11);
198 Set2.insert(3);
199 EXPECT_TRUE(!Set2.contains(0));
202 EXPECT_EQ(Set2.getHead(3), Set2.getTail(3));
203 EXPECT_EQ(Set2.getHead(0), Set2.getTail(0));
204 B = Set2.find(3);
205 EXPECT_EQ(Set2.find(3), --(++B))
[all...] |
| /external/valgrind/main/none/tests/ppc32/ |
| power5+_round.c | 89 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);
|
| /packages/apps/Gallery2/src/com/android/gallery3d/util/ |
| MediaSetUtils.java | 60 public int compare(MediaSet set1, MediaSet set2) {
61 int result = set1.getName().compareToIgnoreCase(set2.getName());
63 return set1.getPath().toString().compareTo(set2.getPath().toString());
|
| /external/llvm/test/Transforms/GlobalOpt/ |
| integer-bool.ll | 15 define void @set2() {
|
| /external/chromium/chrome/browser/sync/sessions/ |
| session_state.cc | 239 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/icu4c/test/cintltst/ |
| usettest.c | 83 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/webkit/Source/JavaScriptCore/icu/unicode/ |
| uset.h | 586 * of set2. It answers the question, 'Is set1 a subset of set2?'
588 * @param set2 set to be checked for containment
593 uset_containsAll(const USet* set1, const USet* set2);
597 * of set2. It answers the question, 'Is set1 a disjoint set of set2?'
599 * @param set2 set to be checked for containment
604 uset_containsNone(const USet* set1, const USet* set2);
608 * of set2. It answers the question, 'Does set1 and set2 have an intersection?
[all...] |
| /external/webkit/Source/WebCore/icu/unicode/ |
| uset.h | 586 * of set2. It answers the question, 'Is set1 a subset of set2?'
588 * @param set2 set to be checked for containment
593 uset_containsAll(const USet* set1, const USet* set2);
597 * of set2. It answers the question, 'Is set1 a disjoint set of set2?'
599 * @param set2 set to be checked for containment
604 uset_containsNone(const USet* set1, const USet* set2);
608 * of set2. It answers the question, 'Does set1 and set2 have an intersection?
[all...] |
| /external/valgrind/main/cachegrind/ |
| cg_sim.c | 102 UInt set2 = ((a+size-1) >> L.line_size_bits) & (L.sets_min_1); \
110 if (set1 == set2) { \
142 } else if (((set1 + 1) & (L.sets_min_1)) == set2) { \
162 set = &(L.tags[set2 * L.assoc]); \
185 VG_(printf)("addr: %lx size: %u sets: %d %d", a, size, set1, set2);\
|
| /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
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).build()
[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
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).build()
[all...] |
| /external/webkit/Source/WebKit/gtk/tests/ |
| testatk.c | 986 AtkAttributeSet* set2 = atk_text_get_run_attributes(childText, 15, &startOffset, &endOffset); local
1371 AtkAttributeSet* set2 = atk_object_get_attributes(table2); local
[all...] |
| /external/icu4c/common/unicode/ |
| 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 have an intersection?
[all...] |
| /external/icu4c/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;
|
| /external/valgrind/main/callgrind/ |
| sim.c | 280 UInt set2 = ((a+size-1) >> c->line_size_bits) & (c->sets_min_1); local
284 if (set1 == set2)
289 else if (((set1 + 1) & (c->sets_min_1)) == set2) {
294 CacheResult res2 = cachesim_setref(c, set2, tag2);
298 VG_(printf)("addr: %lx size: %u sets: %d %d", a, size, set1, set2);
384 UInt set2 = ((a+size-1) >> c->line_size_bits) & (c->sets_min_1); local
388 if (set1 == set2)
393 else if (((set1 + 1) & (c->sets_min_1)) == set2) {
398 CacheResult res2 = cachesim_setref_wb(c, ref, set2, tag2);
404 VG_(printf)("addr: %lx size: %u sets: %d %d", a, size, set1, set2);
[all...] |
| /external/icu4c/test/intltest/ |
| 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->hashCode() != set2clone->hashCode() |
439 UnicodeSet set2; local
[all...] |
| ucdtest.cpp | 352 UnicodeSet set1, set2; local
358 set2.add(start);
362 if (set1!=set2) {
367 //compareUSets(set1, set2,
|
| /external/llvm/include/llvm/ADT/ |
| SetOperations.h | 55 if (!S2.count(*SI)) // if the element is not in set2
|
| /packages/apps/Browser/src/com/android/browser/ |
| NavTabScroller.java | 333 AnimatorSet set2 = new AnimatorSet(); local
334 set2.playTogether(scroll1, trans2);
335 set2.setDuration(duration2);
336 mAnimator.playSequentially(set1, set2);
|
| PhoneUi.java | 406 AnimatorSet set2 = new AnimatorSet(); local
419 set2.playTogether(l, t, r, b, scale);
420 set2.setDuration(200);
422 combo.playSequentially(set1, set2, otheralpha);
|
| /external/jmonkeyengine/engine/src/terrain/com/jme3/terrain/geomipmap/picking/ |
| BresenhamTerrainPicker.java | 209 gridTriA.set2(t[0].get2());
213 gridTriB.set2(t[1].get2());
|
| /libcore/luni/src/test/java/tests/api/java/util/ |
| SimpleTimeZoneTest.java | 466 assertTrue("StartRule improperly set2", st.inDaylightTime(
507 assertTrue("StartRule improperly set2", st
555 assertTrue("StartRule improperly set2", st
664 assertTrue("StartRule improperly set2", st
713 assertTrue("StartRule improperly set2", st
767 assertTrue("set year improperly set2", !(st
[all...] |
