| /external/skia/tests/ |
| 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.isBitSet(12345) == false)
[all...] |
| /ndk/tests/device/test-gnustl-copy_vector_into_a_set/jni/ |
| copy_vector_into_a_set.cpp | 46 SetOfForms set1(vector1.begin(), vector1.end());
48 SetOfForms set1; local
49 std::copy(vector1.begin(), vector1.end(), std::inserter(set1, set1.begin()));
55 cout<<"******************************************** set size "<< set1.size() << std::endl;
56 for(SetOfForms::iterator iter = set1.begin(); iter != set1.end(); ++iter) {
|
| /ndk/tests/device/test-stlport-copy_vector_into_a_set/jni/ |
| copy_vector_into_a_set.cpp | 46 SetOfForms set1(vector1.begin(), vector1.end());
48 SetOfForms set1; local
49 std::copy(vector1.begin(), vector1.end(), std::inserter(set1, set1.begin()));
55 cout<<"******************************************** set size "<< set1.size() << std::endl;
56 for(SetOfForms::iterator iter = set1.begin(); iter != set1.end(); ++iter) {
|
| /external/stlport/test/eh/ |
| test.cpp | 18 std::set<int> set1, set2; local
24 set1.insert(aVector.begin(), aVector.end());
30 printElements(set1, "set1 : ");
|
| /packages/apps/Gallery2/tests/src/com/android/gallery3d/data/ |
| MediaSetTest.java | 47 MockSet set1 = new MockSet(Path.fromString("/mock/1"), dataManager, 8, 8000); local
48 set1.addMediaSet(set10);
49 set1.addMediaSet(set11);
50 set1.addMediaSet(set12);
|
| /packages/apps/Gallery2/src/com/android/gallery3d/util/ |
| MediaSetUtils.java | 59 public int compare(MediaSet set1, MediaSet set2) {
60 int result = set1.getName().compareToIgnoreCase(set2.getName());
62 return set1.getPath().toString().compareTo(set2.getPath().toString());
|
| /external/valgrind/main/cachegrind/ |
| cg_sim.c | 101 UInt set1 = ( a >> L.line_size_bits) & (L.sets_min_1); \
110 if (set1 == set2) { \
112 set = &(L.tags[set1 * L.assoc]); \
141 /* Nb: this is a fast way of doing ((set1+1) % L.sets) */ \
142 } else if (((set1 + 1) & (L.sets_min_1)) == set2) { \
143 set = &(L.tags[set1 * 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
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.isEmpty() && set2.isEmpty()
[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
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.isEmpty() && set2.isEmpty()
[all...] |
| /external/chromium/chrome/browser/sync/sessions/ |
| session_state.cc | 238 vector<syncable::Id>* set1 = id_to_conflict_set_[id1]; local
241 if (0 == set1 && 0 == set2) {
251 } else if (0 == set1) {
257 rv = set1;
259 } else if (set1 == set2) {
264 rv = set1;
|
| /external/clang/test/Misc/ |
| diag-template-diffing.cpp | 41 void set1(I1<1,2,3,4,2,3,4,3>) {}; function
43 set1(I1<1,2,3,4,2,2,4,3,7>());
45 // CHECK-ELIDE-NOTREE: no matching function for call to 'set1'
47 // CHECK-NOELIDE-NOTREE: no matching function for call to 'set1'
49 // CHECK-ELIDE-TREE: no matching function for call to 'set1'
56 // CHECK-NOELIDE-TREE: no matching function for call to 'set1'
|
| /external/webkit/Source/WebKit/gtk/tests/ |
| testatk.c | 981 AtkAttributeSet* set1 = atk_text_get_run_attributes(childText, 0, &startOffset, &endOffset); local
1362 AtkAttributeSet* set1 = atk_object_get_attributes(table1); local
[all...] |
| /external/valgrind/main/coregrind/ |
| pub_core_libcsignal.h | 51 extern Bool VG_(iseqsigset) ( const vki_sigset_t* set1,
|
| /external/webkit/Source/JavaScriptCore/icu/unicode/ |
| uset.h | 585 * Returns true if set1 contains all the characters and strings
586 * of set2. It answers the question, 'Is set1 a subset of set2?'
587 * @param set1 set to be checked for containment
593 uset_containsAll(const USet* set1, const USet* set2);
596 * Returns true if set1 contains none of the characters and strings
597 * of set2. It answers the question, 'Is set1 a disjoint set of set2?'
598 * @param set1 set to be checked for containment
604 uset_containsNone(const USet* set1, const USet* set2);
607 * Returns true if set1 contains some of the characters and strings
608 * of set2. It answers the question, 'Does set1 and set2 have an intersection?
[all...] |
| /external/webkit/Source/WebCore/icu/unicode/ |
| uset.h | 585 * Returns true if set1 contains all the characters and strings
586 * of set2. It answers the question, 'Is set1 a subset of set2?'
587 * @param set1 set to be checked for containment
593 uset_containsAll(const USet* set1, const USet* set2);
596 * Returns true if set1 contains none of the characters and strings
597 * of set2. It answers the question, 'Is set1 a disjoint set of set2?'
598 * @param set1 set to be checked for containment
604 uset_containsNone(const USet* set1, const USet* set2);
607 * Returns true if set1 contains some of the characters and strings
608 * of set2. It answers the question, 'Does set1 and set2 have an intersection?
[all...] |
| /external/icu4c/common/ |
| uset.cpp | 184 uset_containsAll(const USet* set1, const USet* set2) {
185 return ((const UnicodeSet*) set1)->UnicodeSet::containsAll(* (const UnicodeSet*) set2);
196 uset_containsNone(const USet* set1, const USet* set2) {
197 return ((const UnicodeSet*) set1)->UnicodeSet::containsNone(* (const UnicodeSet*) set2);
201 uset_containsSome(const USet* set1, const USet* set2) {
202 return ((const UnicodeSet*) set1)->UnicodeSet::containsSome(* (const UnicodeSet*) set2);
226 uset_equals(const USet* set1, const USet* set2) {
227 return *(const UnicodeSet*)set1 == *(const UnicodeSet*)set2;
|
| /packages/apps/Browser/src/com/android/browser/ |
| PhoneUi.java | 306 AnimatorSet set1 = new AnimatorSet(); local
326 set1.addListener(new AnimatorListenerAdapter() {
334 set1.playSequentially(inanim, blend1);
335 set1.start();
401 AnimatorSet set1 = new AnimatorSet(); local
404 set1.playTogether(fade1, fade2);
405 set1.setDuration(100);
422 combo.playSequentially(set1, set2, otheralpha);
|
| NavTabScroller.java | 314 AnimatorSet set1 = new AnimatorSet(); local
315 set1.playTogether(trans, alpha);
316 set1.setDuration(duration);
336 mAnimator.playSequentially(set1, set2);
339 mAnimator.playSequentially(set1, scroll1);
344 mAnimator.playSequentially(set1, trans2);
|
| /dalvik/vm/ |
| Ddm.cpp | 380 set1(buf+0, kHeaderLen);
381 set1(buf+1, kBytesPerEntry);
401 set1(buf+4, thread->status);
405 set1(buf+17, isDaemon);
|
| AllocTracker.cpp | 381 set1(&ptr[0], kMessageHeaderLen);
382 set1(&ptr[1], kEntryHeaderLen);
383 set1(&ptr[2], kStackFrameLen);
408 set1(&ptr[8], depth);
|
| /external/icu4c/common/unicode/ |
| uset.h | 861 * Returns true if set1 contains all the characters and strings
862 * of set2. It answers the question, 'Is set1 a superset of set2?'
863 * @param set1 set to be checked for containment
869 uset_containsAll(const USet* set1, const USet* set2);
885 * Returns true if set1 contains none of the characters and strings
886 * of set2. It answers the question, 'Is set1 a disjoint set of set2?'
887 * @param set1 set to be checked for containment
893 uset_containsNone(const USet* set1, const USet* set2);
896 * Returns true if set1 contains some of the characters and strings
897 * of set2. It answers the question, 'Does set1 and set2 have an intersection?
[all...] |
| /external/valgrind/main/callgrind/ |
| sim.c | 279 UInt set1 = ( a >> c->line_size_bits) & (c->sets_min_1); local
284 if (set1 == set2)
285 return cachesim_setref(c, set1, tag);
288 /* Nb: this is a fast way of doing ((set1+1) % c->sets) */
289 else if (((set1 + 1) & (c->sets_min_1)) == set2) {
293 CacheResult res1 = cachesim_setref(c, set1, tag);
298 VG_(printf)("addr: %lx size: %u sets: %d %d", a, size, set1, set2);
383 UInt set1 = ( a >> c->line_size_bits) & (c->sets_min_1); local
388 if (set1 == set2)
389 return cachesim_setref_wb(c, ref, set1, tag)
[all...] |
| /external/icu4c/test/intltest/ |
| ucdtest.cpp | 352 UnicodeSet set1, set2; local
353 if (nfcImpl->getCanonStartSet(0x49, set1)) {
362 if (set1!=set2) {
367 //compareUSets(set1, set2,
|
| /external/chromium/testing/gtest/test/ |
| gtest-printers_test.cc | 823 hash_set<string> set1; local
824 set1.insert("hello");
825 EXPECT_EQ("{ \"hello\" }", Print(set1));
831 hash_multiset<int> set1(a, a + kSize);
834 const string result = Print(set1);
886 set<unsigned int> set1(a, a + 3);
887 EXPECT_EQ("{ 0, 3, 5 }", Print(set1));
892 multiset<int> set1(a, a + 5);
893 EXPECT_EQ("{ 1, 1, 1, 2, 5 }", Print(set1));
[all...] |
| /external/gtest/test/ |
| gtest-printers_test.cc | 823 hash_set<string> set1; local
824 set1.insert("hello");
825 EXPECT_EQ("{ \"hello\" }", Print(set1));
831 hash_multiset<int> set1(a, a + kSize);
834 const string result = Print(set1);
892 set<unsigned int> set1(a, a + 3);
893 EXPECT_EQ("{ 0, 3, 5 }", Print(set1));
898 multiset<int> set1(a, a + 5);
899 EXPECT_EQ("{ 1, 1, 1, 2, 5 }", Print(set1));
[all...] |
