Home
last modified time | relevance | path

Searched refs:set2 (Results 26 - 50 of 73) sorted by relevance

123

/third_party/icu/icu4c/source/common/
H A Duset.cpp221 uset_containsAll(const USet* set1, const USet* set2) { in uset_containsAll() argument
222 return ((const UnicodeSet*) set1)->UnicodeSet::containsAll(* (const UnicodeSet*) set2); in uset_containsAll()
233 uset_containsNone(const USet* set1, const USet* set2) { in uset_containsNone() argument
234 return ((const UnicodeSet*) set1)->UnicodeSet::containsNone(* (const UnicodeSet*) set2); in uset_containsNone()
238 uset_containsSome(const USet* set1, const USet* set2) { in uset_containsSome() argument
239 return ((const UnicodeSet*) set1)->UnicodeSet::containsSome(* (const UnicodeSet*) set2); in uset_containsSome()
263 uset_equals(const USet* set1, const USet* set2) { in uset_equals() argument
264 return *(const UnicodeSet*)set1 == *(const UnicodeSet*)set2; in uset_equals()
/third_party/node/deps/icu-small/source/common/
H A Duset.cpp221 uset_containsAll(const USet* set1, const USet* set2) { in uset_containsAll() argument
222 return ((const UnicodeSet*) set1)->UnicodeSet::containsAll(* (const UnicodeSet*) set2); in uset_containsAll()
233 uset_containsNone(const USet* set1, const USet* set2) { in uset_containsNone() argument
234 return ((const UnicodeSet*) set1)->UnicodeSet::containsNone(* (const UnicodeSet*) set2); in uset_containsNone()
238 uset_containsSome(const USet* set1, const USet* set2) { in uset_containsSome() argument
239 return ((const UnicodeSet*) set1)->UnicodeSet::containsSome(* (const UnicodeSet*) set2); in uset_containsSome()
263 uset_equals(const USet* set1, const USet* set2) { in uset_equals() argument
264 return *(const UnicodeSet*)set1 == *(const UnicodeSet*)set2; in uset_equals()
/third_party/pcre2/pcre2/src/
H A Dpcre2_auto_possess.c549 const uint8_t *set1, *set2, *set_end; in compare_opcodes() local
759 set2 = (uint8_t *) in compare_opcodes()
774 set2 = (uint8_t *)(xclass_flags + 1); in compare_opcodes()
782 set2 = (uint8_t *)(cb->cbits + cbit_digit); in compare_opcodes()
789 set2 = (uint8_t *)(cb->cbits + cbit_space); in compare_opcodes()
796 set2 = (uint8_t *)(cb->cbits + cbit_word); in compare_opcodes()
811 if ((*set1++ & ~(*set2++)) != 0) return FALSE; in compare_opcodes()
819 if ((*set1++ & *set2++) != 0) return FALSE; in compare_opcodes()
/third_party/skia/third_party/externals/icu/source/common/
H A Duset.cpp216 uset_containsAll(const USet* set1, const USet* set2) { in uset_containsAll() argument
217 return ((const UnicodeSet*) set1)->UnicodeSet::containsAll(* (const UnicodeSet*) set2); in uset_containsAll()
228 uset_containsNone(const USet* set1, const USet* set2) { in uset_containsNone() argument
229 return ((const UnicodeSet*) set1)->UnicodeSet::containsNone(* (const UnicodeSet*) set2); in uset_containsNone()
233 uset_containsSome(const USet* set1, const USet* set2) { in uset_containsSome() argument
234 return ((const UnicodeSet*) set1)->UnicodeSet::containsSome(* (const UnicodeSet*) set2); in uset_containsSome()
258 uset_equals(const USet* set1, const USet* set2) { in uset_equals() argument
259 return *(const UnicodeSet*)set1 == *(const UnicodeSet*)set2; in uset_equals()
/third_party/icu/icu4c/source/test/intltest/
H A Dusettest.cpp327 // set1 and set2 used to be built with the obsolete constructor taking in TestCloneEqualHash()
336 UnicodeSet *set2=new UnicodeSet(u"\\p{Decimal Number}", status); //Number, Decimal digit in TestCloneEqualHash() local
346 if (*set2 != *set2a) { in TestCloneEqualHash()
354 if(*set1 != *set1copy || *set1 == *set2 || in TestCloneEqualHash()
363 UnicodeSet set2equal=*set2; in TestCloneEqualHash()
364 if(set1equal != *set1 || set1equal != *set1copy || set2equal != *set2 || in TestCloneEqualHash()
371 UnicodeSet *set2clone=set2->clone(); in TestCloneEqualHash()
373 *set2clone != *set2 || *set2clone == *set1copy || *set2clone != set2equal || in TestCloneEqualHash()
380 set2->hashCode() != set2equal.hashCode() || set2 in TestCloneEqualHash()
447 UnicodeSet set2; TestAddRemove() local
[all...]
/third_party/python/Lib/unittest/test/
H A Dtest_case.py1038 set2 = set()
1039 self.assertSetEqual(set1, set2)
1041 self.assertRaises(self.failureException, self.assertSetEqual, None, set2)
1042 self.assertRaises(self.failureException, self.assertSetEqual, [], set2)
1047 set2 = set()
1048 self.assertRaises(self.failureException, self.assertSetEqual, set1, set2)
1051 set2 = set(['a'])
1052 self.assertSetEqual(set1, set2)
1055 set2 = set(['a', 'b'])
1056 self.assertRaises(self.failureException, self.assertSetEqual, set1, set2)
[all...]
/third_party/icu/icu4c/source/common/unicode/
H A Duset.h1000 * of set2. It answers the question, 'Is set1 a superset of set2?'
1002 * @param set2 set to be checked for containment
1007 uset_containsAll(const USet* set1, const USet* set2);
1024 * of set2. It answers the question, 'Is set1 a disjoint set of set2?'
1026 * @param set2 set to be checked for containment
1031 uset_containsNone(const USet* set1, const USet* set2);
1035 * of set2. It answers the question, 'Does set1 and set2 hav
[all...]
/third_party/node/deps/icu-small/source/common/unicode/
H A Duset.h1032 * of set2. It answers the question, 'Is set1 a superset of set2?'
1034 * @param set2 set to be checked for containment
1039 uset_containsAll(const USet* set1, const USet* set2);
1056 * of set2. It answers the question, 'Is set1 a disjoint set of set2?'
1058 * @param set2 set to be checked for containment
1063 uset_containsNone(const USet* set1, const USet* set2);
1067 * of set2. It answers the question, 'Does set1 and set2 hav
[all...]
/third_party/skia/third_party/externals/icu/source/common/unicode/
H A Duset.h962 * of set2. It answers the question, 'Is set1 a superset of set2?'
964 * @param set2 set to be checked for containment
969 uset_containsAll(const USet* set1, const USet* set2);
986 * of set2. It answers the question, 'Is set1 a disjoint set of set2?'
988 * @param set2 set to be checked for containment
993 uset_containsNone(const USet* set1, const USet* set2);
997 * of set2. It answers the question, 'Does set1 and set2 hav
[all...]
/test/xts/acts/commonlibrary/thirdparty/musl/entry/src/main/cpp/
H A Dsignalndk.cpp345 sigset_t set = {PARAM_0}, set2 = {PARAM_0}; in Sigprocmask() local
347 sigprocmask(SIG_UNBLOCK, &set, &set2); in Sigprocmask()
349 sigprocmask(sigInfo->param, &set, &set2); in Sigprocmask()
595 sigset_t set2 = {PARAM_0}; in Sigtimedwait() local
598 sigemptyset(&set2); in Sigtimedwait()
599 sigaddset(&set2, SIGCHLD); in Sigtimedwait()
600 sigtimedwait(&set2, &siginfo, &timeout); in Sigtimedwait()
/third_party/musl/porting/liteos_a/user/include/
H A Dsched.h115 #define CPU_EQUAL_S(size,set1,set2) (!memcmp(set1,set2,size))
/third_party/musl/porting/liteos_m_iccarm/kernel/include/
H A Dsched.h107 #define CPU_EQUAL_S(size,set1,set2) (!memcmp(set1,set2,size))
/third_party/musl/porting/liteos_m/kernel/include/
H A Dsched.h107 #define CPU_EQUAL_S(size,set1,set2) (!memcmp(set1,set2,size))
/third_party/musl/porting/liteos_a/kernel/include/
H A Dsched.h108 #define CPU_EQUAL_S(size,set1,set2) (!memcmp(set1,set2,size))
/third_party/musl/porting/uniproton/kernel/include/
H A Dsched.h107 #define CPU_EQUAL_S(size,set1,set2) (!memcmp(set1,set2,size))
/third_party/skia/tests/
H A DTextBlobTest.cpp33 RunDef set2[] = { in TestBuilder() local
36 RunBuilderTest(reporter, builder, set2, SK_ARRAY_COUNT(set2), set2, SK_ARRAY_COUNT(set2)); in TestBuilder()
/third_party/musl/porting/linux/user/include/
H A Dsched.h122 #define CPU_EQUAL_S(size,set1,set2) (!memcmp(set1,set2,size))
/third_party/musl/porting/liteos_m/user/include/
H A Dsched.h119 #define CPU_EQUAL_S(size,set1,set2) (!memcmp(set1,set2,size))
/third_party/mesa3d/src/gallium/drivers/lima/ir/pp/
H A Dliveness.c44 BITSET_WORD *set1, BITSET_WORD *set2, in ppir_liveness_set_equal()
48 if (set1[i] != set2[i]) in ppir_liveness_set_equal()
43 ppir_liveness_set_equal(ppir_compiler *comp, BITSET_WORD *set1, BITSET_WORD *set2, uint8_t *mask1, uint8_t *mask2) ppir_liveness_set_equal() argument
/third_party/musl/include/
H A Dsched.h133 #define CPU_EQUAL_S(size,set1,set2) (!memcmp(set1,set2,size))
/third_party/musl/porting/liteos_m/kernel/src/regex/
H A Dregcomp.c2059 tre_set_union(tre_mem_t mem, tre_pos_and_tags_t *set1, tre_pos_and_tags_t *set2, in tre_set_union() argument
2069 for (s2 = 0; set2[s2].position >= 0; s2++); in tre_set_union()
2101 for (s2 = 0; set2[s2].position >= 0; s2++) in tre_set_union()
2103 new_set[s1 + s2].position = set2[s2].position; in tre_set_union()
2104 new_set[s1 + s2].code_min = set2[s2].code_min; in tre_set_union()
2105 new_set[s1 + s2].code_max = set2[s2].code_max; in tre_set_union()
2107 new_set[s1 + s2].assertions = set2[s2].assertions; in tre_set_union()
2108 new_set[s1 + s2].class = set2[s2].class; in tre_set_union()
2109 new_set[s1 + s2].neg_classes = set2[s2].neg_classes; in tre_set_union()
2110 new_set[s1 + s2].backref = set2[s in tre_set_union()
[all...]
/third_party/musl/porting/liteos_m_iccarm/kernel/src/regex/
H A Dregcomp.c2060 tre_set_union(tre_mem_t mem, tre_pos_and_tags_t *set1, tre_pos_and_tags_t *set2, in tre_set_union() argument
2070 for (s2 = 0; set2[s2].position >= 0; s2++); in tre_set_union()
2102 for (s2 = 0; set2[s2].position >= 0; s2++) in tre_set_union()
2104 new_set[s1 + s2].position = set2[s2].position; in tre_set_union()
2105 new_set[s1 + s2].code_min = set2[s2].code_min; in tre_set_union()
2106 new_set[s1 + s2].code_max = set2[s2].code_max; in tre_set_union()
2108 new_set[s1 + s2].assertions = set2[s2].assertions; in tre_set_union()
2109 new_set[s1 + s2].class = set2[s2].class; in tre_set_union()
2110 new_set[s1 + s2].neg_classes = set2[s2].neg_classes; in tre_set_union()
2111 new_set[s1 + s2].backref = set2[s in tre_set_union()
[all...]
/third_party/musl/porting/uniproton/kernel/src/regex/
H A Dregcomp.c2059 tre_set_union(tre_mem_t mem, tre_pos_and_tags_t *set1, tre_pos_and_tags_t *set2, in tre_set_union() argument
2069 for (s2 = 0; set2[s2].position >= 0; s2++); in tre_set_union()
2101 for (s2 = 0; set2[s2].position >= 0; s2++) in tre_set_union()
2103 new_set[s1 + s2].position = set2[s2].position; in tre_set_union()
2104 new_set[s1 + s2].code_min = set2[s2].code_min; in tre_set_union()
2105 new_set[s1 + s2].code_max = set2[s2].code_max; in tre_set_union()
2107 new_set[s1 + s2].assertions = set2[s2].assertions; in tre_set_union()
2108 new_set[s1 + s2].class = set2[s2].class; in tre_set_union()
2109 new_set[s1 + s2].neg_classes = set2[s2].neg_classes; in tre_set_union()
2110 new_set[s1 + s2].backref = set2[s in tre_set_union()
[all...]
/third_party/musl/src/regex/
H A Dregcomp.c2059 tre_set_union(tre_mem_t mem, tre_pos_and_tags_t *set1, tre_pos_and_tags_t *set2, in tre_set_union() argument
2069 for (s2 = 0; set2[s2].position >= 0; s2++); in tre_set_union()
2101 for (s2 = 0; set2[s2].position >= 0; s2++) in tre_set_union()
2103 new_set[s1 + s2].position = set2[s2].position; in tre_set_union()
2104 new_set[s1 + s2].code_min = set2[s2].code_min; in tre_set_union()
2105 new_set[s1 + s2].code_max = set2[s2].code_max; in tre_set_union()
2107 new_set[s1 + s2].assertions = set2[s2].assertions; in tre_set_union()
2108 new_set[s1 + s2].class = set2[s2].class; in tre_set_union()
2109 new_set[s1 + s2].neg_classes = set2[s2].neg_classes; in tre_set_union()
2110 new_set[s1 + s2].backref = set2[s in tre_set_union()
[all...]
/third_party/rust/crates/regex/tests/
H A Dset.rs2 matset!(set2, &["a", "a"], "ba", 0, 1);

Completed in 29 milliseconds

123