Home
last modified time | relevance | path

Searched refs:set1 (Results 26 - 50 of 74) sorted by relevance

123

/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
745 set1 = (uint8_t *)(base_end - base_list[2]); in compare_opcodes()
750 set1 = (uint8_t *)(code - list[2]); in compare_opcodes()
806 set_end = set1 + 32; in compare_opcodes()
811 if ((*set1++ & ~(*set2++)) != 0) return FALSE; in compare_opcodes()
813 while (set1 < set_end); in compare_opcodes()
819 if ((*set1++ & *set2++) != 0) return FALSE; in compare_opcodes()
821 while (set1 < set_end); 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/python/Lib/unittest/test/
H A Dtest_case.py1037 set1 = set()
1039 self.assertSetEqual(set1, set2)
1043 self.assertRaises(self.failureException, self.assertSetEqual, set1, None)
1044 self.assertRaises(self.failureException, self.assertSetEqual, set1, [])
1046 set1 = set(['a'])
1048 self.assertRaises(self.failureException, self.assertSetEqual, set1, set2)
1050 set1 = set(['a'])
1052 self.assertSetEqual(set1, set2)
1054 set1 = set(['a'])
1056 self.assertRaises(self.failureException, self.assertSetEqual, set1, set
[all...]
/third_party/icu/icu4c/source/common/unicode/
H A Duset.h999 * Returns true if set1 contains all the characters and strings
1000 * of set2. It answers the question, 'Is set1 a superset of set2?'
1001 * @param set1 set to be checked for containment
1007 uset_containsAll(const USet* set1, const USet* set2);
1023 * Returns true if set1 contains none of the characters and strings
1024 * of set2. It answers the question, 'Is set1 a disjoint set of set2?'
1025 * @param set1 set to be checked for containment
1031 uset_containsNone(const USet* set1, const USet* set2);
1034 * Returns true if set1 contains some of the characters and strings
1035 * of set2. It answers the question, 'Does set1 an
[all...]
/third_party/node/deps/icu-small/source/common/unicode/
H A Duset.h1031 * Returns true if set1 contains all the characters and strings
1032 * of set2. It answers the question, 'Is set1 a superset of set2?'
1033 * @param set1 set to be checked for containment
1039 uset_containsAll(const USet* set1, const USet* set2);
1055 * Returns true if set1 contains none of the characters and strings
1056 * of set2. It answers the question, 'Is set1 a disjoint set of set2?'
1057 * @param set1 set to be checked for containment
1063 uset_containsNone(const USet* set1, const USet* set2);
1066 * Returns true if set1 contains some of the characters and strings
1067 * of set2. It answers the question, 'Does set1 an
[all...]
/third_party/skia/third_party/externals/icu/source/common/unicode/
H A Duset.h961 * Returns true if set1 contains all the characters and strings
962 * of set2. It answers the question, 'Is set1 a superset of set2?'
963 * @param set1 set to be checked for containment
969 uset_containsAll(const USet* set1, const USet* set2);
985 * Returns true if set1 contains none of the characters and strings
986 * of set2. It answers the question, 'Is set1 a disjoint set of set2?'
987 * @param set1 set to be checked for containment
993 uset_containsNone(const USet* set1, const USet* set2);
996 * Returns true if set1 contains some of the characters and strings
997 * of set2. It answers the question, 'Does set1 an
[all...]
/third_party/skia/third_party/externals/abseil-cpp/absl/container/internal/
H A Draw_hash_set_test.cc728 DecomposeSet set1; in TestDecompose()
733 set1.insert(elem); in TestDecompose()
735 set1.insert(1); in TestDecompose()
737 set1.emplace("3"); in TestDecompose()
742 set1.insert(1); in TestDecompose()
747 set1.insert(one); in TestDecompose()
752 set1.insert(set1.begin(), 1); in TestDecompose()
757 set1.insert(set1 in TestDecompose()
[all...]
/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.cpp28 RunDef set1[] = { in TestBuilder() local
31 RunBuilderTest(reporter, builder, set1, SK_ARRAY_COUNT(set1), set1, SK_ARRAY_COUNT(set1)); in TestBuilder()
/third_party/skia/third_party/externals/abseil-cpp/absl/container/
H A Dbtree_test.cc2408 set1(cmp, allocator1), set2(cmp, allocator2); in TEST()
2410 for (int i = 0; i < 100; ++i) set1.insert(MovableOnlyInstance(i)); in TEST()
2413 set2 = std::move(set1); in TEST()
2420 set1(cmp, allocator1), set2(cmp, allocator1); in TEST()
2422 for (int i = 0; i < 100; ++i) set1.insert(MovableOnlyInstance(i)); in TEST()
2425 set2 = std::move(set1); in TEST()
2432 set1(cmp, allocator1), set2(cmp, allocator2); in TEST()
2434 for (int i = 0; i < 100; ++i) set1.insert(MovableOnlyInstance(i)); in TEST()
2437 set2 = std::move(set1); in TEST()
2857 Set set1(alloc in TEST()
[all...]
/third_party/icu/icu4c/source/test/intltest/
H A Dtrnserr.cpp183 UnicodeSet *set1 = new UnicodeSet(badPattern, status); in TestUnicodeSetErrors() local
187 delete set1; in TestUnicodeSetErrors()
/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
2068 for (s1 = 0; set1[s1].position >= 0; s1++); in tre_set_union()
2074 for (s1 = 0; set1[s1].position >= 0; s1++) in tre_set_union()
2076 new_set[s1].position = set1[s1].position; in tre_set_union()
2077 new_set[s1].code_min = set1[s1].code_min; in tre_set_union()
2078 new_set[s1].code_max = set1[s1].code_max; in tre_set_union()
2079 new_set[s1].assertions = set1[s1].assertions | assertions; in tre_set_union()
2080 new_set[s1].class = set1[s1].class; in tre_set_union()
2081 new_set[s1].neg_classes = set1[s1].neg_classes; in tre_set_union()
2082 new_set[s1].backref = set1[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
2069 for (s1 = 0; set1[s1].position >= 0; s1++); in tre_set_union()
2075 for (s1 = 0; set1[s1].position >= 0; s1++) in tre_set_union()
2077 new_set[s1].position = set1[s1].position; in tre_set_union()
2078 new_set[s1].code_min = set1[s1].code_min; in tre_set_union()
2079 new_set[s1].code_max = set1[s1].code_max; in tre_set_union()
2080 new_set[s1].assertions = set1[s1].assertions | assertions; in tre_set_union()
2081 new_set[s1].class = set1[s1].class; in tre_set_union()
2082 new_set[s1].neg_classes = set1[s1].neg_classes; in tre_set_union()
2083 new_set[s1].backref = set1[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
2068 for (s1 = 0; set1[s1].position >= 0; s1++); in tre_set_union()
2074 for (s1 = 0; set1[s1].position >= 0; s1++) in tre_set_union()
2076 new_set[s1].position = set1[s1].position; in tre_set_union()
2077 new_set[s1].code_min = set1[s1].code_min; in tre_set_union()
2078 new_set[s1].code_max = set1[s1].code_max; in tre_set_union()
2079 new_set[s1].assertions = set1[s1].assertions | assertions; in tre_set_union()
2080 new_set[s1].class = set1[s1].class; in tre_set_union()
2081 new_set[s1].neg_classes = set1[s1].neg_classes; in tre_set_union()
2082 new_set[s1].backref = set1[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
2068 for (s1 = 0; set1[s1].position >= 0; s1++); in tre_set_union()
2074 for (s1 = 0; set1[s1].position >= 0; s1++) in tre_set_union()
2076 new_set[s1].position = set1[s1].position; in tre_set_union()
2077 new_set[s1].code_min = set1[s1].code_min; in tre_set_union()
2078 new_set[s1].code_max = set1[s1].code_max; in tre_set_union()
2079 new_set[s1].assertions = set1[s1].assertions | assertions; in tre_set_union()
2080 new_set[s1].class = set1[s1].class; in tre_set_union()
2081 new_set[s1].neg_classes = set1[s1].neg_classes; in tre_set_union()
2082 new_set[s1].backref = set1[s in tre_set_union()
[all...]
/third_party/python/Lib/test/
H A Dtest_compare.py25 set1 = [2, 2.0, 2, 2+0j, Cmp(2.0)] variable in ComparisonSimpleTest
27 candidates = set1 + set2
32 if ((a in self.set1) and (b in self.set1)) or a is b:

Completed in 31 milliseconds

123