| /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/guava/src/com/google/common/collect/ |
| Sets.java | 537 * {@code set1}, then over each element of {@code set2}, in order, that is not
540 * <p>Results are undefined if {@code set1} and {@code set2} are sets based on
549 final Set<? extends E> set1, final Set<? extends E> set2) {
551 checkNotNull(set2, "set2");
556 final Set<? extends E> set2minus1 = difference(set2, set1);
563 return set1.isEmpty() && set2.isEmpty();
570 return set1.contains(object) || set2.contains(object);
574 set.addAll(set2);
579 .addAll(set1).addAll(set2).build()
[all...] |
| /external/chromium/third_party/icu/source/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...] |
| cucdtst.c | 2852 USet *set1, *set2, *set3, *set4; local
[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...] |
| cucdtst.c | 2898 USet *set1, *set2, *set3, *set4; local
[all...] |
| /external/chromium/third_party/icu/public/common/unicode/ |
| uset.h | 842 * of set2. It answers the question, 'Is set1 a superset of set2?'
844 * @param set2 set to be checked for containment
849 uset_containsAll(const USet* set1, const USet* set2);
866 * of set2. It answers the question, 'Is set1 a disjoint set of set2?'
868 * @param set2 set to be checked for containment
873 uset_containsNone(const USet* set1, const USet* set2);
877 * of set2. It answers the question, 'Does set1 and set2 have an intersection?
[all...] |
| /external/webkit/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/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/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 | 862 * of set2. It answers the question, 'Is set1 a superset of set2?'
864 * @param set2 set to be checked for containment
869 uset_containsAll(const USet* set1, const USet* set2);
886 * of set2. It answers the question, 'Is set1 a disjoint set of set2?'
888 * @param set2 set to be checked for containment
893 uset_containsNone(const USet* set1, const USet* set2);
897 * of set2. It answers the question, 'Does set1 and set2 have an intersection?
[all...] |
| /external/chromium/third_party/icu/source/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...] |
| /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...] |
| /external/stlport/test/unit/ |
| set_test.cpp | 21 CPPUNIT_TEST(set2);
38 void set2();
68 void SetTest::set2() function in class:SetTest
|
| /ndk/tests/device/test-gnustl-full/unit/ |
| set_test.cpp | 21 CPPUNIT_TEST(set2);
38 void set2();
68 void SetTest::set2() function in class:SetTest
|
| /ndk/tests/device/test-stlport/unit/ |
| set_test.cpp | 21 CPPUNIT_TEST(set2);
38 void set2();
68 void SetTest::set2() function in class:SetTest
|
| /libcore/luni/src/main/native/ |
| NativeConverter.cpp | 620 UnicodeSet set2; local
621 ucnv_getUnicodeSet(converter2.get(), set2.toUSet(), UCNV_ROUNDTRIP_SET, &errorCode);
623 return U_SUCCESS(errorCode) && set1.containsAll(set2);
|
| /external/libxml2/ |
| xpath.c | [all...] |
| /frameworks/base/services/java/com/android/server/ |
| PackageManagerService.java | 1895 HashSet<Signature> set2 = new HashSet<Signature>(); local
[all...] |
