Searched refs:set1 (Results 1 - 25 of 27) sorted by relevance

12

/macosx-10.9.5/xnu-2422.115.4/tools/tests/libMicro/
H A Dsigprocmask.c63 sigset_t set0, set1; local
69 (void) sigprocmask(SIG_SETMASK, &set0, &set1);
70 (void) sigprocmask(SIG_SETMASK, &set1, &set0);
71 (void) sigprocmask(SIG_SETMASK, &set0, &set1);
72 (void) sigprocmask(SIG_SETMASK, &set1, &set0);
73 (void) sigprocmask(SIG_SETMASK, &set0, &set1);
74 (void) sigprocmask(SIG_SETMASK, &set1, &set0);
75 (void) sigprocmask(SIG_SETMASK, &set0, &set1);
76 (void) sigprocmask(SIG_SETMASK, &set1, &set0);
77 (void) sigprocmask(SIG_SETMASK, &set0, &set1);
[all...]
H A Dselect.c177 fd_set set1; local
179 fd_set *my_iset = &set1;
188 (void) memcpy(&set1, &iset, sizeof (fd_set));
/macosx-10.9.5/ruby-104/ruby/lib/rexml/
H A Dxpath_parser.rb686 def equality_relational_compare( set1, op, set2 )
687 #puts "EQ_REL_COMP(#{set1.inspect} #{op.inspect} #{set2.inspect})"
688 if set1.kind_of? Array and set2.kind_of? Array
689 #puts "#{set1.size} & #{set2.size}"
690 if set1.size == 1 and set2.size == 1
691 set1 = set1[0]
693 elsif set1.size == 0 or set2.size == 0
694 nd = set1.size==0 ? set2 : set1
[all...]
/macosx-10.9.5/ruby-104/ruby/test/
H A Dtest_set.rb57 set1 = Set.new
58 set2 = set1.clone
59 set1 << 'abc'
64 set1 = Set[1,2]
65 set2 = set1.dup
67 assert_not_same(set1, set2)
69 assert_equal(set1, set2)
71 set1.add(3)
73 assert_not_equal(set1, set2)
112 set1
[all...]
/macosx-10.9.5/xnu-2422.115.4/iokit/Tests/
H A DTestCollections.cpp282 OSSet *set1, *set2; local
286 set1 = OSSet::withCapacity(1);
287 TEST_ASSERT('S', "0a", set1);
288 if (set1)
289 set1->release();
299 set1 = OSSet::withCapacity(1);
300 TEST_ASSERT('S', "1a", set1);
301 if (set1) {
302 TEST_ASSERT('S', "1b", !set1->getCount());
303 TEST_ASSERT('S', "1c", 1 == set1
[all...]
/macosx-10.9.5/ICU-511.35/icuSources/common/
H A Duset.cpp179 uset_containsAll(const USet* set1, const USet* set2) { argument
180 return ((const UnicodeSet*) set1)->UnicodeSet::containsAll(* (const UnicodeSet*) set2);
191 uset_containsNone(const USet* set1, const USet* set2) { argument
192 return ((const UnicodeSet*) set1)->UnicodeSet::containsNone(* (const UnicodeSet*) set2);
196 uset_containsSome(const USet* set1, const USet* set2) { argument
197 return ((const UnicodeSet*) set1)->UnicodeSet::containsSome(* (const UnicodeSet*) set2);
221 uset_equals(const USet* set1, const USet* set2) { argument
222 return *(const UnicodeSet*)set1 == *(const UnicodeSet*)set2;
/macosx-10.9.5/ICU-511.35/icuSources/common/unicode/
H A Duset.h865 * Returns true if set1 contains all the characters and strings
866 * of set2. It answers the question, 'Is set1 a superset of set2?'
867 * @param set1 set to be checked for containment
873 uset_containsAll(const USet* set1, const USet* set2);
889 * Returns true if set1 contains none of the characters and strings
890 * of set2. It answers the question, 'Is set1 a disjoint set of set2?'
891 * @param set1 set to be checked for containment
897 uset_containsNone(const USet* set1, const USet* set2);
900 * Returns true if set1 contains some of the characters and strings
901 * of set2. It answers the question, 'Does set1 an
[all...]
/macosx-10.9.5/JavaScriptCore-7537.78.1/icu/unicode/
H A Duset.h861 * 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 an
[all...]
/macosx-10.9.5/WebCore-7537.78.1/icu/unicode/
H A Duset.h861 * 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 an
[all...]
/macosx-10.9.5/WebKit-7537.78.2/gtk/tests/
H A Dtestatk.c1140 static gboolean atkAttributeSetAreEqual(AtkAttributeSet* set1, AtkAttributeSet* set2) argument
1142 if (!set1)
1145 set1 = g_slist_sort(set1, (GCompareFunc)compAtkAttribute);
1148 while (set1) {
1149 if (!set2 || compAtkAttribute(set1->data, set2->data))
1152 set1 = set1->next;
1176 AtkAttributeSet* set1 = atk_text_get_run_attributes(childText, 0, &startOffset, &endOffset); local
1179 g_assert(atkAttributeSetAreEqual(set1,
1569 AtkAttributeSet* set1 = atk_object_get_attributes(table1); local
[all...]
/macosx-10.9.5/ruby-104/ruby/test/ruby/
H A Dtest_hash.rb118 set1 = @cls[]
119 set2 = @cls[set1 => true]
121 set1[set1] = true
/macosx-10.9.5/ICU-511.35/icuSources/test/intltest/
H A Dtrnserr.cpp181 UnicodeSet *set1 = new UnicodeSet(badPattern, status); local
185 delete set1;
H A Ducdtest.cpp354 UnicodeSet set1, set2; local
355 if (nfcImpl->getCanonStartSet(0x49, set1)) {
364 if (set1!=set2) {
369 //compareUSets(set1, set2,
H A Dusettest.cpp319 // 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 || set1equa
[all...]
/macosx-10.9.5/zsh-60/zsh/Src/Zle/
H A Dcomputil.c129 Cdset set1, set2; local
136 for (set1 = cd_state.sets; set1; set1 = set1->next)
137 for (str1 = set1->strs; str1; str1 = str1->next) {
142 for (set1 = cd_state.sets; set1; set1 = set1
[all...]
/macosx-10.9.5/libxml2-26/libxml2/
H A Dxpath.c3923 * @set1: the first NodeSet or NULL
3927 * Merges two nodesets, all nodes from @set2 are added to @set1
3928 * if @set1 is NULL, a new set is created and copied from @set2.
3931 * Returns @set1 once extended or NULL in case of error.
3934 xmlXPathNodeSetMergeAndClear(xmlNodeSetPtr set1, xmlNodeSetPtr set2, argument
3937 if ((set1 == NULL) && (hasNullEntries == 0)) {
3940 * just assigned to set1, since set2 is cleared anyway.
3942 set1 = xmlXPathNodeSetCreateSize(set2->nodeNr);
3943 if (set1 == NULL)
3946 memcpy(set1
4047 xmlXPathNodeSetMergeAndClearNoDupls(xmlNodeSetPtr set1, xmlNodeSetPtr set2, int hasNullEntries) argument
[all...]
/macosx-10.9.5/pyobjc-42/pyobjc/pyobjc-core/libxml2-src/
H A Dxpath.c3827 * @set1: the first NodeSet or NULL
3831 * Merges two nodesets, all nodes from @set2 are added to @set1
3832 * if @set1 is NULL, a new set is created and copied from @set2.
3835 * Returns @set1 once extended or NULL in case of error.
3838 xmlXPathNodeSetMergeAndClear(xmlNodeSetPtr set1, xmlNodeSetPtr set2, argument
3841 if ((set1 == NULL) && (hasNullEntries == 0)) {
3844 * just assigned to set1, since set2 is cleared anyway.
3846 set1 = xmlXPathNodeSetCreateSize(set2->nodeNr);
3847 if (set1 == NULL)
3850 memcpy(set1
3947 xmlXPathNodeSetMergeAndClearNoDupls(xmlNodeSetPtr set1, xmlNodeSetPtr set2, int hasNullEntries) argument
[all...]
/macosx-10.9.5/ICU-511.35/icuSources/test/cintltst/
H A Dcucdtst.c3023 USet *set1, *set2, *set3, *set4; local
3071 set1=uset_openPattern(hyphenPattern, 10, &errorCode);
3074 /* remove the Katakana middle dot(s) from set1 */
3075 uset_remove(set1, 0x30fb);
3076 uset_remove(set1, 0xff65); /* halfwidth variant */
3077 showAMinusB(set1, set2, "[:Hyphen:]", "[:Dash:]", FALSE);
3086 showAIntersectB(set3, set1, "[:Cf:]", "[:Hyphen:]", FALSE);
3093 uset_close(set1);
3105 set1=uset_openPattern(lowerPattern, 13, &errorCode);
3108 length=uset_getItem(set1,
[all...]
/macosx-10.9.5/Libc-997.90.3/regex/TRE/lib/
H A Dtre-compile.c2120 tre_set_union(tre_mem_t mem, tre_pos_and_tags_t *set1, tre_pos_and_tags_t *set2, argument
2129 for (s1 = 0; set1[s1].position >= 0; s1++);
2135 for (s1 = 0; set1[s1].position >= 0; s1++)
2137 new_set[s1].position = set1[s1].position;
2138 new_set[s1].code_min = set1[s1].code_min;
2139 new_set[s1].code_max = set1[s1].code_max;
2140 new_set[s1].assertions = set1[s1].assertions | assertions;
2141 new_set[s1].bracket_match_list = set1[s1].bracket_match_list;
2142 new_set[s1].backref = set1[s1].backref;
2143 if (set1[s
[all...]
/macosx-10.9.5/tcsh-65/tcsh/
H A Dsh.decls.h376 extern void set1 (const Char *, Char **,
H A Dsh.set.c306 set1(vp, vecp, &shvhed, flags);
627 set1(var, vec, &shvhed, flags);
631 set1(const Char *var, Char **vec, struct varent *head, int flags) function
H A Dtw.comp.c85 set1(strip(p), saveblk(v), &completions, VAR_READWRITE);
/macosx-10.9.5/gnutar-452/gnutar/lib/
H A Dregex_internal.c1356 re_node_set_compare (const re_node_set *set1, const re_node_set *set2)
1359 if (set1 == NULL || set2 == NULL || set1->nelem != set2->nelem)
1361 for (i = set1->nelem ; REG_VALID_INDEX (--i) ; )
1362 if (set1->elems[i] != set2->elems[i])
1354 re_node_set_compare(const re_node_set *set1, const re_node_set *set2) argument
/macosx-10.9.5/groff-38/groff/src/devices/grodvi/
H A Ddvi.cpp143 set1 = 128, enumerator in enum:dvi_printer::__anon8969
396 out_unsigned(set1, code);
/macosx-10.9.5/BerkeleyDB-21/db/test/
H A Dreputils.tcl159 set set1 {on-disk on-disk}
167 foreach set { set1 set2 set3 set4 } {
175 set logsets [list $set1 $set2 $set3 $set4]

Completed in 610 milliseconds

12