Searched refs:heaps (Results 1 - 7 of 7) sorted by relevance
/macosx-10.9.5/zsh-60/zsh/Src/ |
H A D | mem.c | 41 one should call pushheap() before one starts using heaps and 42 popheap() after that (when the memory allocated on the heaps since 44 pushheap() saves the states of all currently allocated heaps and 47 allocated some memory on the heaps and then come to a place where 51 about the heap states (i.e. the heaps are like after the call to 58 If possible, the heaps are allocated using mmap() so that the 59 (*real*) heap isn't filled up with empty zsh heaps. If mmap() 117 /* list of zsh heaps */ 119 static Heap heaps; variable 146 * Stack of heaps save [all...] |
/macosx-10.9.5/CPANInternal-140/Graph-0.94/lib/Heap071/ |
H A D | Elem.pm | 92 is contained in, if you have multiple heaps. Keeping that 94 heaps into a single one take longer - it would have to traverse 96 Binomial and Fibonacci heaps that would turn an O(1) operation
|
/macosx-10.9.5/CPANInternal-140/Heap/Elem/ |
H A D | Elem.pm | 92 is contained in, if you have multiple heaps. Keeping that 94 heaps into a single one take longer - it would have to traverse 96 Binomial and Fibonacci heaps that would turn an O(1) operation
|
/macosx-10.9.5/CPANInternal-140/Heap-0.80/lib/Heap/ |
H A D | Elem.pm | 92 is contained in, if you have multiple heaps. Keeping that 94 heaps into a single one take longer - it would have to traverse 96 Binomial and Fibonacci heaps that would turn an O(1) operation
|
/macosx-10.9.5/ruby-104/ruby/ |
H A D | gc.c | 274 #define heaps objspace->heap.ptr macro 418 heaps = 0; 502 slot->next = heaps; 503 if (heaps) heaps->prev = slot; 504 heaps = slot; 532 heaps->header = (struct heaps_header *)membase; 533 objspace->heap.sorted[hi] = heaps->header; 536 objspace->heap.sorted[hi]->base = heaps; 539 heaps [all...] |
/macosx-10.9.5/bind9-45.100/bind9/lib/dns/ |
H A D | rbtdb.c | 327 * Number of buckets for cache DB entries (locks, LRU lists, TTL heaps). 448 isc_heap_t **heaps; member in struct:dns_rbtdb 746 if (rbtdb->heaps == NULL || rbtdb->heaps[idx] == NULL) 748 heap = rbtdb->heaps[idx]; 962 if (rbtdb->heaps != NULL) { 964 isc_heap_destroy(&rbtdb->heaps[i]); 965 isc_mem_put(rbtdb->hmctx, rbtdb->heaps, 1285 isc_heap_delete(rbtdb->heaps[idx], rdataset->heap_index); 5858 result = isc_heap_insert(rbtdb->heaps[id [all...] |
/macosx-10.9.5/xnu-2422.115.4/bsd/netinet/ |
H A D | ip_dummynet.c | 76 * 000106: large rewrite, use heaps to handle very many pipes. 135 * Three heaps contain queues and pipes that the scheduler handles: 1015 struct dn_heap *heaps[3]; local 1022 heaps[0] = &ready_heap ; /* fixed-rate queues */ 1023 heaps[1] = &wfq_ready_heap ; /* wfq queues */ 1024 heaps[2] = &extract_heap ; /* delay line */ 1036 h = heaps[i]; 1069 /* check the heaps to see if there's still stuff in there, and 1074 h = heaps[i]; 1871 * Delete all pipes and heaps returnin [all...] |
Completed in 155 milliseconds