/external/stlport/test/eh/ |
test.cpp | 18 std::set<int> set1, set2; local 24 set1.insert(aVector.begin(), aVector.end()); 30 printElements(set1, "set1 : ");
|
/external/guava/src/com/google/common/collect/ |
Sets.java | 537 * {@code set1}, then over each element of {@code set2}, in order, that is not 538 * contained in {@code set1}. 540 * <p>Results are undefined if {@code set1} and {@code set2} are sets based on 544 * <p><b>Note:</b> The returned view performs better when {@code set1} is the 549 final Set<? extends E> set1, final Set<? extends E> set2) { 550 checkNotNull(set1, "set1"); 556 final Set<? extends E> set2minus1 = difference(set2, set1); 560 return set1.size() + set2minus1.size(); 563 return set1.isEmpty() && set2.isEmpty() [all...] |
/external/chromium/third_party/icu/public/common/unicode/ |
uset.h | 841 * Returns true if set1 contains all the characters and strings 842 * of set2. It answers the question, 'Is set1 a superset of set2?' 843 * @param set1 set to be checked for containment 849 uset_containsAll(const USet* set1, const USet* set2); 865 * Returns true if set1 contains none of the characters and strings 866 * of set2. It answers the question, 'Is set1 a disjoint set of set2?' 867 * @param set1 set to be checked for containment 873 uset_containsNone(const USet* set1, const USet* set2); 876 * Returns true if set1 contains some of the characters and strings 877 * of set2. It answers the question, 'Does set1 and set2 have an intersection? [all...] |
/external/webkit/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/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/chromium/third_party/icu/source/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;
|
/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;
|
/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...] |
/dalvik/vm/ |
AllocTracker.c | 380 set1(&ptr[0], kMessageHeaderLen); 381 set1(&ptr[1], kEntryHeaderLen); 382 set1(&ptr[2], kStackFrameLen); 407 set1(&ptr[8], depth);
|
Ddm.c | 500 set1(buf+0, kHeaderLen); 501 set1(buf+1, kBytesPerEntry); 522 set1(buf+4, thread->status); 526 set1(buf+17, isDaemon);
|
Bits.h | 272 INLINE void set1(u1* buf, u1 val) function
|
Debugger.c | [all...] |
/external/chromium/third_party/icu/source/test/intltest/ |
trnserr.cpp | 181 UnicodeSet *set1 = new UnicodeSet(badPattern, status); local 185 delete set1;
|
usettest.cpp | 319 // set1 and set2 used to be built with the obsolete constructor taking 322 UnicodeSet *set1=new UnicodeSet(UNICODE_STRING_SIMPLE("\\p{Lowercase Letter}"), status); // :Ll: Letter, lowercase local 335 if (*set1 != *set1a) { 345 UnicodeSet *set1copy=new UnicodeSet(*set1); 346 if(*set1 != *set1copy || *set1 == *set2 || 347 getPairs(*set1) != getPairs(*set1copy) || 348 set1->hashCode() != set1copy->hashCode()){ 354 UnicodeSet set1equal=*set1; 356 if(set1equal != *set1 || set1equal != *set1copy || set2equal != *set2 || [all...] |
/external/icu4c/test/intltest/ |
trnserr.cpp | 181 UnicodeSet *set1 = new UnicodeSet(badPattern, status); local 185 delete set1;
|
usettest.cpp | 319 // set1 and set2 used to be built with the obsolete constructor taking 322 UnicodeSet *set1=new UnicodeSet(UNICODE_STRING_SIMPLE("\\p{Lowercase Letter}"), status); // :Ll: Letter, lowercase local 335 if (*set1 != *set1a) { 345 UnicodeSet *set1copy=new UnicodeSet(*set1); 346 if(*set1 != *set1copy || *set1 == *set2 || 347 getPairs(*set1) != getPairs(*set1copy) || 348 set1->hashCode() != set1copy->hashCode()){ 354 UnicodeSet set1equal=*set1; 356 if(set1equal != *set1 || set1equal != *set1copy || set2equal != *set2 || [all...] |
/dalvik/vm/jdwp/ |
JdwpEvent.c | 726 set1(buf+8, 0); /* flags */ 727 set1(buf+9, kJdwpEventCommandSet); 728 set1(buf+10, kJdwpCompositeCommand); [all...] |
/external/chromium/third_party/icu/source/test/cintltst/ |
cucdtst.c | 2852 USet *set1, *set2, *set3, *set4; local [all...] |
/external/icu4c/test/cintltst/ |
cucdtst.c | 2898 USet *set1, *set2, *set3, *set4; local [all...] |
/external/libxml2/ |
xpath.c | [all...] |
/external/stlport/test/unit/ |
set_test.cpp | 20 CPPUNIT_TEST(set1); 37 void set1(); 56 void SetTest::set1() function in class:SetTest
|
/ndk/sources/android/stlport/test/unit/ |
set_test.cpp | 20 CPPUNIT_TEST(set1); 37 void set1(); 56 void SetTest::set1() function in class:SetTest
|
/bootable/recovery/minzip/ |
Bits.h | 271 INLINE void set1(unsigned char* buf, unsigned char val) function
|
/libcore/luni/src/test/java/tests/api/java/util/ |
EnumMapTest.java | 387 Set set1 = enumSizeMap.entrySet(); local 388 assertSame("Should be same", set1, set); 667 Set set1 = enumSizeMap.keySet(); local 668 assertSame("Should be same", set1, set); [all...] |
/libcore/luni/src/main/native/ |
NativeConverter.cpp | 616 UnicodeSet set1; local 617 ucnv_getUnicodeSet(converter1.get(), set1.toUSet(), UCNV_ROUNDTRIP_SET, &errorCode); 623 return U_SUCCESS(errorCode) && set1.containsAll(set2);
|