/macosx-10.10/BootCache-109/ |
H A D | convert_playlist_to_logical_playlist.sh | 22 sorted=$(mktemp /tmp/sorted.XXXXXX) 34 grep ROOT_OF_VOLUME $files | cut -d '"' -f 2 | sed 's/ROOT_OF_VOLUME//' | sort -u > $sorted 42 ) <$sorted >$out 47 rm $sorted
|
/macosx-10.10/ruby-106/ruby/lib/rubygems/ |
H A D | available_set.rb | 6 @sorted = nil 13 @sorted = nil 34 @sorted = nil 49 @sorted = nil 53 def sorted method in class:Gem 54 @sorted ||= @set.sort do |a,b| 72 @set = [sorted.first] 73 @sorted = nil 86 @sorted = nil
|
/macosx-10.10/smb-759.0/lib/librpc/ |
H A D | werror.inc | 9 * NOTE this list is required to be sorted numerically by the
|
/macosx-10.10/cups-408/cups/cgi-bin/ |
H A D | testhi.c | 54 list_nodes("sorted", hi->sorted); 66 list_nodes(argv[1], search->sorted);
|
H A D | help.c | 206 "DEBUG: si=%p, si->sorted=%p, cupsArrayCount(si->sorted)=%d\n", si, 207 si->sorted, cupsArrayCount(si->sorted)); 209 for (i = 0, n = (help_node_t *)cupsArrayFirst(si->sorted); 211 i ++, n = (help_node_t *)cupsArrayNext(si->sorted)) 251 for (i = 0, section = NULL, n = (help_node_t *)cupsArrayFirst(hi->sorted); 253 n = (help_node_t *)cupsArrayNext(hi->sorted)) 301 cupsArraySave(hi->sorted); 303 for (nn = (help_node_t *)cupsArrayFirst(hi->sorted); [all...] |
H A D | help-index.h | 60 cups_array_t *nodes; /* Nodes sorted by filename */ 61 cups_array_t *sorted; /* Nodes sorted by score + text */ member in struct:help_index_s
|
/macosx-10.10/ruby-106/ruby/lib/test/unit/ |
H A D | testcase.rb | 21 :sorted
|
/macosx-10.10/OpenSSH-189/osslshim/ossl-asn1/ |
H A D | cs-stack.c | 95 sk->sorted=0; 114 ret->sorted=sk->sorted; 143 ret->sorted=0; 185 st->sorted=0; 330 if (st && !st->sorted) 341 st->sorted=1; 349 return st->sorted;
|
H A D | cs-stack.h | 70 int sorted; member in struct:stack_st
|
/macosx-10.10/OpenSSL098-52/src/crypto/stack/ |
H A D | stack.c | 86 sk->sorted=0; 105 ret->sorted=sk->sorted; 134 ret->sorted=0; 176 st->sorted=0; 321 if (st && !st->sorted) 332 st->sorted=1; 340 return st->sorted;
|
H A D | stack.h | 70 int sorted; member in struct:stack_st
|
/macosx-10.10/smb-759.0/lib/smbclient/ |
H A D | ntstatus.inc | 9 * NOTE this list is required to be sorted numerically by the
|
/macosx-10.10/bind9-45.101/bind9/lib/dns/ |
H A D | rdataset.c | 328 struct towire_sort *sorted = NULL, sorted_fixed[MAX_SHUFFLE]; local 375 sorted = isc_mem_get(cctx->mctx, count * sizeof(*sorted)); 376 if (shuffled == NULL || sorted == NULL) 380 sorted = sorted_fixed; 408 sorted[i].key = (*order)(&shuffled[i], 410 sorted[i].rdata = &shuffled[i]; 426 sorted[i].key = (*order)(&shuffled[i], 429 sorted[i].key = 0; /* Unused */ 430 sorted[ [all...] |
/macosx-10.10/Security-57031.1.35/Security/libsecurity_apple_csp/open_ssl/stack/ |
H A D | stack.c | 103 sk->sorted=0; 122 ret->sorted=sk->sorted; 144 ret->sorted=0; 186 st->sorted=0; 321 if (!st->sorted) 327 st->sorted=1;
|
/macosx-10.10/BerkeleyDB-21/db/build_vxworks/test_micro/ |
H A D | b_curwalk.c | 20 int prev, ret, skipdupwalk, sorted, walkcount; local 27 dupcount = prev = skipdupwalk = sorted = 0; 52 sorted = 1; 106 * For some reason, testing sorted duplicates doesn't work either. 124 dbp->set_flags(dbp, sorted ? DB_DUPSORT : DB_DUP) == 0);
|
/macosx-10.10/BerkeleyDB-21/db/test_micro/source/ |
H A D | b_curwalk.c | 20 int prev, ret, skipdupwalk, sorted, walkcount; local 27 dupcount = prev = skipdupwalk = sorted = 0; 51 sorted = 1; 105 * For some reason, testing sorted duplicates doesn't work either. 123 dbp->set_flags(dbp, sorted ? DB_DUPSORT : DB_DUP) == 0);
|
/macosx-10.10/ruby-106/ruby/test/rubygems/ |
H A D | test_gem_available_set.rb | 82 g = set.sorted 102 g = set.sorted.map { |t| t.spec }
|
/macosx-10.10/configd-699.1.5/scutil.tproj/ |
H A D | net_set.c | 77 CFMutableArrayRef sorted; local 85 sorted = CFArrayCreateMutableCopy(NULL, 0, sets); 86 CFArraySortValues(sorted, 87 CFRangeMake(0, CFArrayGetCount(sorted)), 92 sets = CFArrayCreateCopy(NULL, sorted); 93 CFRelease(sorted); 587 CFMutableArrayRef sorted; local 589 sorted = CFArrayCreateMutableCopy(NULL, 0, services); 590 CFArraySortValues(sorted, 591 CFRangeMake(0, CFArrayGetCount(sorted)), [all...] |
/macosx-10.10/BerkeleyDB-21/db/test/scr024/src/com/sleepycat/collections/test/serial/ |
H A D | TupleSerialFactoryTest.java | 55 for (int sorted = 0; sorted < 2; sorted += 1) { 57 sorted != 0)); 86 name += isSorted ? "-sorted" : "-unsorted";
|
/macosx-10.10/ICU-531.30/icuSources/test/depstest/ |
H A D | depstest.py | 158 sorted(files_missing_from_deps)) 162 sorted(files_missing_from_build)) 173 sorted(virtual_classes_with_weak_destructors)) 183 print "Info: ignored symbols:\n%s" % sorted(_ignored_symbols)
|
/macosx-10.10/OpenSSL098-52/src/include/openssl/ |
H A D | stack.h | 70 int sorted; member in struct:stack_st
|
/macosx-10.10/Security-57031.1.35/Security/libsecurity_apple_csp/open_ssl/openssl/ |
H A D | stack.h | 88 int sorted; member in struct:stack_st
|
/macosx-10.10/BerkeleyDB-21/db/db/ |
H A D | db_upg_opd.c | 43 __db_31_offdup(dbp, real_name, fhp, sorted, pgnop) 47 int sorted; 68 * sorted, they are converted to a Btree leaf page, otherwise to a 84 TYPE(page) = sorted ? P_LDUP : P_LRECNO; 126 level, sorted ? P_IBTREE : P_IRECNO); 135 * If the duplicates are sorted, put the first item on 137 * the duplicates are not sorted, create an internal 142 if (sorted) {
|
/macosx-10.10/ICU-531.30/icuSources/i18n/ |
H A D | identifier_info.cpp | 288 UVector sorted(status); 298 sorted.addElement(ss, status); 300 sorted.sort(uhash_compareScriptSet, status); 302 for (int32_t i=0; i<sorted.size(); i++) { 306 ScriptSet *ss = static_cast<ScriptSet *>(sorted.elementAt(i));
|
/macosx-10.10/text_cmds-88/col/ |
H A D | col.c | 406 static CHAR *sorted; local 415 if ((sorted = realloc(sorted, 440 sorted[count[c->c_column]++] = *c; 441 c = sorted;
|