/macosx-10.10.1/emacs-93/emacs/lib-src/ |
H A D | grep-changelog | 24 # Extract entries from ChangeLogs matching specified criteria. 36 @entries); 74 Print entries in ChangeLogs matching various criteria. 77 --author=AUTHOR Match entries whose author line matches 79 --text=TEXT Match entries whose text matches regular 81 --exclude=TEXT Exclude entries matching TEXT 82 --from-date=YYYY-MM-DD Match entries not older than given date 83 --to-date=YYYY-MM-DD Match entries not younger than given date 84 --rcs-log Format output suitable for RCS log entries 86 --reverse Show entries i [all...] |
/macosx-10.10.1/ICU-531.30/icuSources/common/unicode/ |
H A D | ualoc.h | 77 * skips 27, keeping the top 47 languages for inclusion in the entries array 80 * @param entries 91 * The number of elements in the provided entries array. Must be 0 if 92 * entries is NULL (preflight option). 98 * The number of elements in entries filled out with data, or if 99 * entries is NULL and entriesCapacity is 0 (preflight option ), the total 106 UALanguageEntry *entries, int32_t entriesCapacity,
|
/macosx-10.10.1/JavaScriptCore-7600.1.17/yarr/ |
H A D | YarrCanonicalizeUCS2.h | 62 // This searches in log2 time over ~364 entries, so should typically result in 8 compares. 66 size_t entries = UCS2_CANONICALIZATION_RANGES; local 69 size_t candidate = entries >> 1; 72 entries = candidate; 77 entries -= (candidate + 1);
|
/macosx-10.10.1/adv_cmds-158/finger/ |
H A D | extern.h | 41 extern int entries; /* Number of people. */
|
/macosx-10.10.1/ruby-106/ruby/lib/rdoc/parser/ |
H A D | changelog.rb | 7 # viewed as HTML a ChangeLog page will have an entry for each day's entries in 42 # Creates an RDoc::Markup::Document given the +groups+ of ChangeLog entries. 52 groups.sort_by do |day,| day end.reverse_each do |day, entries| 56 doc.concat create_entries entries 63 # Returns a list of ChangeLog entries an RDoc::Markup nodes for the given 64 # +entries+. 66 def create_entries entries 69 entries.each do |entry, items| 101 # Groups +entries+ by date. 103 def group_entries entries [all...] |
/macosx-10.10.1/ICU-531.30/icuSources/layout/ |
H A D | LookupTables.h | 60 const LookupSingle *lookupSingle(const LETableReference &base, const LookupSingle *entries, LEGlyphID glyph, LEErrorCode &success) const; 83 LookupSingle entries[ANY_NUMBER]; member in struct:SingleTableLookupTable 85 LE_VAR_ARRAY(SingleTableLookupTable, entries)
|
/macosx-10.10.1/Security-57031.1.35/Security/libsecurity_codesigning/antlr2/antlr/ |
H A D | CircularQueue.hpp | 59 // it would be nice if we would not get called with nb > entries 60 // (or to be precise when entries() == 0) 68 if( nb > entries() ) 69 nb = entries(); 83 inline size_t entries() const function in class:antlr::CircularQueue
|
/macosx-10.10.1/ruby-106/ruby/test/rubygems/ |
H A D | test_gem_package_tar_reader.rb | 12 entries = 0 18 entries += 1 22 assert_equal 2, entries
|
/macosx-10.10.1/tcl-105/tcl_ext/tkimg/tkimg/ico/ |
H A D | ico.c | 89 ICOENTRY *entries; member in struct:__anon12984 225 sprintf(str, " Number of colors: %d\n", th->entries[i].nColors); OUT; 228 sprintf(str, " Size in bytes: %d\n", th->entries[i].sizeInBytes); OUT; 229 sprintf(str, " File offset: %d\n", th->entries[i].fileOffset); OUT; 261 if (!(th->entries = (ICOENTRY *)ckalloc (sizeof (ICOENTRY) * nIcons))) { 266 if (!readUByte (handle, &th->entries[i].width) || 267 !readUByte (handle, &th->entries[i].height) || 269 !readUByte (handle, &th->entries[i].reserved) || 270 !readUShort (handle, &th->entries[i].nPlanes) || 271 !readUShort (handle, &th->entries[ [all...] |
/macosx-10.10.1/tcl-105/tcl_ext/tclx/tclx/generic/ |
H A D | tclXkeylist.c | 31 * Adding a hash table over the entries allows for much faster Find 57 int numEntries; /* Number of actual entries in the array. */ 58 keylEntry_t *entries; /* Array of keyed list entries. */ member in struct:__anon12755 60 Tcl_HashTable *hashTbl; /* hash table mirror of the entries */ 74 * that consistency checks allow for portions where not all entries are 78 if (Tcl_IsShared(keylIntPtr->entries [idx].valuePtr)) { \ 79 keylIntPtr->entries [idx].valuePtr = \ 80 Tcl_DuplicateObj (keylIntPtr->entries [idx].valuePtr); \ 81 Tcl_IncrRefCount(keylIntPtr->entries [id [all...] |
/macosx-10.10.1/text_cmds-88/column/ |
H A D | column.c | 71 static int entries; /* number of records */ variable 137 if (!entries) 163 if (!--entries) 187 numrows = entries / numcols; 188 if (entries % numcols) 196 if ((base += numrows) >= entries) 214 for (cnt = entries, lp = list; cnt--; ++lp) 235 if ((t = tbl = calloc(entries, sizeof(TBL))) == NULL) 241 for (cnt = 0, lp = list; cnt < entries; ++cnt, ++lp, ++t) { 266 for (cnt = 0, t = tbl; cnt < entries; [all...] |
/macosx-10.10.1/ruby-106/ruby/test/ruby/ |
H A D | test_dir_m17n.rb | 20 ents = Dir.entries(".", opts) 28 ents = Dir.entries(".", opts) 33 exit Dir.entries(".", {:encoding => Encoding.find("filesystem")}).include?(expected_filename) 49 ents = Dir.entries(".", opts) 61 ents = Dir.entries(".", opts) 68 ents = Dir.entries(".", opts) 80 ents = Dir.entries(".", opts) 121 ents = Dir.entries(".", opts) 127 ents = Dir.entries(".", opts) 150 ents = Dir.entries(" [all...] |
/macosx-10.10.1/xnu-2782.1.97/libkern/kxld/ |
H A D | kxld_array.c | 79 STAILQ_FOREACH(srcpool, &array->pools, entries) { 88 STAILQ_FOREACH_SAFE(srcpool, &array->pools, entries, tmp) { 89 STAILQ_REMOVE(&array->pools, srcpool, kxld_array_pool, entries); 90 STAILQ_INSERT_TAIL(&srcpools, srcpool, entries); 116 STAILQ_FOREACH_SAFE(srcpool, &srcpools, entries, tmp) { 120 STAILQ_REMOVE(&srcpools, srcpool, kxld_array_pool, entries); 159 STAILQ_INSERT_HEAD(&array->pools, pool, entries); 238 STAILQ_FOREACH(srcpool, &srcarray->pools, entries) { 257 STAILQ_FOREACH(pool, &array->pools, entries) { 273 STAILQ_FOREACH(pool, &array->pools, entries) { [all...] |
/macosx-10.10.1/xnu-2782.1.97/tools/tests/memorystatus/ |
H A D | memorystatus.c | 377 memorystatus_priority_entry_t *entries = NULL; local 381 entries = get_priority_list(&size); 382 if (!entries) { 388 if (entries[i].pid == pid) { 391 *priority = entries[i].priority; 392 *user_data = entries[i].user_data; 394 *limit_mb = entries[i].limit; 397 res = get_ledger_info(entries[i].pid, NULL, &limit); 411 if (entries) 412 free(entries); 450 memorystatus_priority_entry_t *entries = NULL; local [all...] |
/macosx-10.10.1/cxxfilt-11/cxxfilt/libiberty/ |
H A D | hashtab.c | 284 hash table entries are HTAB_EMPTY_ENTRY). The function returns the 300 result->entries = (PTR *) (*alloc_f) (size, sizeof (PTR)); 301 if (result->entries == NULL) 335 result->entries = (PTR *) (*alloc_f) (alloc_arg, size, sizeof (PTR)); 336 if (result->entries == NULL) 390 PTR *entries = htab->entries; local 395 if (entries[i] != HTAB_EMPTY_ENTRY && entries[i] != HTAB_DELETED_ENTRY) 396 (*htab->del_f) (entries[ 416 PTR *entries = htab->entries; local [all...] |
/macosx-10.10.1/IOFireWireFamily-456/IOFireWireFamily.kmodproj/ |
H A D | IOConfigEntry.cpp | 146 const OSArray *entries = dir->getEntries(); local 148 size = 1 + entries->getCount(); 149 for(i=0; i<entries->getCount(); i++) { 150 IOConfigEntry *entry = OSDynamicCast(IOConfigEntry, entries->getObject(i));
|
/macosx-10.10.1/bind9-45.101/bind9/contrib/idn/idnkit-1.0-src/lib/ |
H A D | ucsmap.c | 82 * Since the entries pointed by ucsmap_hash_t.entry are sorted, 103 ucsmap_entry_t *entries; /* array of entries */ member in struct:idn_ucsmap 105 size_t nentries; /* # of entries in use */ 135 ctx->entries = NULL; 152 if (ctx->entries != NULL) 153 free(ctx->entries); 196 newbuf = realloc(ctx->entries, sizeof(*e) * ctx->entry_size); 199 ctx->entries = newbuf; 201 e = &ctx->entries[ct [all...] |
/macosx-10.10.1/libxml2-26/libxml2/doc/ |
H A D | queries.py | 91 entries=[] 98 entries.append((row[0], int(row[1]))) 100 entries.append((None, int(row[1]))) 102 for row in entries:
|
/macosx-10.10.1/xar-254/xar/lib/ |
H A D | appledouble.h | 17 * | ASH.entries # of | 37 uint16_t entries; /* Number of entries in the file */ member in struct:AppleSingleHeader 57 * Macintosh Icon entries are rare, since those are typically in the resource 88 * Newly created files have all 0's in both entries. 96 * Allocate resource for entries in 4K blocks.
|
/macosx-10.10.1/xnu-2782.1.97/bsd/kern/ |
H A D | proc_uuid_policy.c | 83 LIST_ENTRY(proc_uuid_policy_entry) entries; 148 LIST_INSERT_HEAD(UUIDHASH(uuid), entry, entries); local 180 LIST_REMOVE(foundentry, entries); 240 LIST_FOREACH_SAFE(searchentry, UUIDHASH(uuid), entries, tmpentry) { 313 LIST_FOREACH_SAFE(searchentry, headp, entries, tmpentry) { 316 LIST_REMOVE(searchentry, entries); 318 LIST_INSERT_HEAD(&deletehead, searchentry, entries); 331 LIST_FOREACH_SAFE(searchentry, &deletehead, entries, tmpentry) { 332 LIST_REMOVE(searchentry, entries);
|
/macosx-10.10.1/xnu-2782.1.97/bsd/sys/ |
H A D | dtrace_ptss.h | 52 * Each page in user space is represented by a dt_ptss_page. Page entries 66 * As each page is allocated, its entries are chained and added to the 87 struct dtrace_ptss_page_entry entries[PAGE_MAX_SIZE / DTRACE_PTSS_SCRATCH_SPACE_PER_THREAD]; member in struct:dtrace_ptss_page
|
/macosx-10.10.1/ncurses-44/ncurses/progs/ |
H A D | infocmp.c | 36 * infocmp.c -- decompile an entry, or compare two entries 59 * terminfo entries, completely determine the actions of the program. 63 static ENTRY *entries; /* terminfo entries */ variable 64 static int termcount; /* count of terminal entries */ 96 _nc_free_termtype(&entries[termcount].tterm); 98 free(entries); 149 * This assumes that multiple use entries are supposed 153 * in the sequence of use entries'. 159 for (ep = &entries[ [all...] |
/macosx-10.10.1/WebKit-7600.1.25/mac/History/ |
H A D | WebHistory.mm | 75 - (void)_sendNotification:(NSString *)name entries:(NSArray *)entries; 94 - (BOOL)removeItems:(NSArray *)entries; 217 // The entries for each day are stored in a sorted array with the most recent entry first 218 // Check for the common cases of the entry being newer than all existing entries or the first entry of the day 223 // .. or older than all existing entries 255 // remove this date entirely if there are no other entries on it 291 // other entries already exist for this date 294 // no other entries exist for this date 295 NSMutableArray *entries [all...] |
/macosx-10.10.1/emacs-93/emacs/lisp/net/ |
H A D | tramp-smb.el | 296 (entries (tramp-smb-get-file-entries user host share file))) 298 (setq entries (mapcar 'car entries)) 301 (setq entries 304 entries)))) 307 (setq entries 310 entries))) 312 (unless nosort (setq entries (sort entries 'strin [all...] |
/macosx-10.10.1/xnu-2782.1.97/bsd/dev/dtrace/ |
H A D | dtrace_ptss.c | 70 // CAS the entries onto the free list. 72 page->entries[DTRACE_PTSS_ENTRIES_PER_PAGE-1].next = p->p_dtrace_ptss_free_list; 73 } while (!OSCompareAndSwapPtr((void *)page->entries[DTRACE_PTSS_ENTRIES_PER_PAGE-1].next, 74 (void *)&page->entries[0], 147 * It returns a dtrace_ptss_page that has its entries chained, with the last 148 * entries next field set to NULL. It does not add the page or the entries to 177 // Chain the page entries. 180 ptss_page->entries[i].addr = addr + (i * DTRACE_PTSS_SCRATCH_SPACE_PER_THREAD); 181 ptss_page->entries[ [all...] |