/macosx-10.10/xnu-2782.1.97/tools/tests/libMicro/ |
H A D | sigprocmask.c | 63 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 D | select.c | 177 fd_set set1; local 179 fd_set *my_iset = &set1; 188 (void) memcpy(&set1, &iset, sizeof (fd_set));
|
/macosx-10.10/ruby-106/ruby/lib/rexml/ |
H A D | xpath_parser.rb | 686 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.10/ruby-106/ruby/test/ |
H A D | test_set.rb | 57 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.10/xnu-2782.1.97/iokit/Tests/ |
H A D | TestCollections.cpp | 282 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.10/Security-57031.1.35/Security/sec/SOSCircle/SecureObjectSync/ |
H A D | SOSPeerInfoCollections.h | 34 bool SOSPeerInfoSetContainsIdenticalPeers(CFSetRef set1, CFSetRef set2);
|
H A D | SOSPeerInfoCollections.c | 57 bool SOSPeerInfoSetContainsIdenticalPeers(CFSetRef set1, CFSetRef set2){ argument 61 if(!CFEqualSafe(set1, set2)) 64 CFSetForEach(set1, ^(const void *value) {
|
/macosx-10.10/ICU-531.30/icuSources/common/ |
H A D | uset.cpp | 179 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.10/ICU-531.30/icuSources/common/unicode/ |
H A D | uset.h | 865 * 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.10/JavaScriptCore-7600.1.17/icu/unicode/ |
H A D | 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 an [all...] |
/macosx-10.10/WTF-7600.1.24/icu/unicode/ |
H A D | 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 an [all...] |
/macosx-10.10/WebCore-7600.1.25/icu/unicode/ |
H A D | 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 an [all...] |
/macosx-10.10/ruby-106/ruby/test/ruby/ |
H A D | test_hash.rb | 118 set1 = @cls[] 119 set2 = @cls[set1 => true] 121 set1[set1] = true
|
/macosx-10.10/ICU-531.30/icuSources/test/intltest/ |
H A D | trnserr.cpp | 181 UnicodeSet *set1 = new UnicodeSet(badPattern, status); local 185 delete set1;
|
H A D | ucdtest.cpp | 355 UnicodeSet set1, set2; local 356 if (nfcImpl->getCanonStartSet(0x49, set1)) { 365 if (set1!=set2) { 370 //compareUSets(set1, set2,
|
H A D | 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 || set1equa [all...] |
/macosx-10.10/zsh-61/zsh/Src/Zle/ |
H A D | computil.c | 129 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.10/libxml2-26/libxml2/ |
H A D | xpath.c | 3923 * @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.10/pyobjc-45/2.6/pyobjc/pyobjc-core/libxml2-src/ |
H A D | xpath.c | 3827 * @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.10/ICU-531.30/icuSources/test/cintltst/ |
H A D | cucdtst.c | 3056 USet *set1, *set2, *set3, *set4; local 3104 set1=uset_openPattern(hyphenPattern, 10, &errorCode); 3107 /* remove the Katakana middle dot(s) from set1 */ 3108 uset_remove(set1, 0x30fb); 3109 uset_remove(set1, 0xff65); /* halfwidth variant */ 3110 showAMinusB(set1, set2, "[:Hyphen:]", "[:Dash:]", FALSE); 3119 showAIntersectB(set3, set1, "[:Cf:]", "[:Hyphen:]", FALSE); 3126 uset_close(set1); 3138 set1=uset_openPattern(lowerPattern, 13, &errorCode); 3141 length=uset_getItem(set1, [all...] |
/macosx-10.10/Libc-1044.1.2/regex/TRE/lib/ |
H A D | tre-compile.c | 2120 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.10/tcsh-65/tcsh/ |
H A D | sh.decls.h | 376 extern void set1 (const Char *, Char **,
|
H A D | sh.set.c | 306 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 D | tw.comp.c | 85 set1(strip(p), saveblk(v), &completions, VAR_READWRITE);
|
/macosx-10.10/gnutar-453/gnutar/lib/ |
H A D | regex_internal.c | 1356 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
|