Searched refs:heap (Results 1 - 25 of 323) sorted by relevance

1234567891011>>

/macosx-10.9.5/bind9-45.100/bind9/lib/isc/
H A Dheap.c32 #include <isc/heap.h>
41 * element of the heap array is not used; i.e. heap subscripts are 1-based,
55 * When the heap is in a consistent state, the following invariant
60 ! heap->compare(heap->array[(i)], \
61 heap->array[heap_parent(i)]))
63 /*% ISC heap structure. */
80 isc_heap_t *heap; local
85 heap
108 isc_heap_t *heap; local
124 resize(isc_heap_t *heap) argument
146 float_up(isc_heap_t *heap, unsigned int i, void *elt) argument
164 sink_down(isc_heap_t *heap, unsigned int i, void *elt) argument
189 isc_heap_insert(isc_heap_t *heap, void *elt) argument
206 isc_heap_delete(isc_heap_t *heap, unsigned int index) argument
231 isc_heap_increased(isc_heap_t *heap, unsigned int index) argument
239 isc_heap_decreased(isc_heap_t *heap, unsigned int index) argument
247 isc_heap_element(isc_heap_t *heap, unsigned int index) argument
257 isc_heap_foreach(isc_heap_t *heap, isc_heapaction_t action, void *uap) argument
[all...]
/macosx-10.9.5/ntp-88/lib/isc/
H A Dheap.c18 /* $Id: heap.c,v 1.37 2007/10/19 17:15:53 explorer Exp $ */
32 #include <isc/heap.h>
41 * element of the heap array is not used; i.e. heap subscripts are 1-based,
55 * When the heap is in a consistent state, the following invariant
60 ! heap->compare(heap->array[(i)], \
61 heap->array[heap_parent(i)]))
63 /*% ISC heap structure. */
80 isc_heap_t *heap; local
107 isc_heap_t *heap; local
123 resize(isc_heap_t *heap) argument
145 float_up(isc_heap_t *heap, unsigned int i, void *elt) argument
163 sink_down(isc_heap_t *heap, unsigned int i, void *elt) argument
188 isc_heap_insert(isc_heap_t *heap, void *elt) argument
203 isc_heap_delete(isc_heap_t *heap, unsigned int index) argument
228 isc_heap_increased(isc_heap_t *heap, unsigned int index) argument
236 isc_heap_decreased(isc_heap_t *heap, unsigned int index) argument
244 isc_heap_element(isc_heap_t *heap, unsigned int index) argument
254 isc_heap_foreach(isc_heap_t *heap, isc_heapaction_t action, void *uap) argument
[all...]
/macosx-10.9.5/pyobjc-42/2.5/pyobjc/pyobjc-framework-Cocoa/PyObjCTest/
H A Dtest_cfbinaryheap.py10 heap = CFBinaryHeapCreate(
12 self.assert_(isinstance(heap, CFBinaryHeapRef))
14 CFBinaryHeapAddValue(heap, "hello")
15 CFBinaryHeapAddValue(heap, "world")
16 CFBinaryHeapAddValue(heap, "aapjes")
18 self.failUnless(CFBinaryHeapContainsValue(heap, "hello"))
19 self.failIf(CFBinaryHeapContainsValue(heap, "niemand"))
25 heap = CFBinaryHeapCreate(
27 self.assert_(isinstance(heap, CFBinaryHeapRef))
29 CFBinaryHeapAddValue(heap, "hell
[all...]
/macosx-10.9.5/pyobjc-42/pyobjc/pyobjc-framework-Cocoa/PyObjCTest/
H A Dtest_cfbinaryheap.py10 heap = CFBinaryHeapCreate(
12 self.assert_(isinstance(heap, CFBinaryHeapRef))
14 CFBinaryHeapAddValue(heap, "hello")
15 CFBinaryHeapAddValue(heap, "world")
16 CFBinaryHeapAddValue(heap, "aapjes")
18 self.assertTrue(CFBinaryHeapContainsValue(heap, "hello"))
19 self.assertFalse(CFBinaryHeapContainsValue(heap, "niemand"))
25 heap = CFBinaryHeapCreate(
27 self.assert_(isinstance(heap, CFBinaryHeapRef))
29 CFBinaryHeapAddValue(heap, "hell
[all...]
/macosx-10.9.5/CF-855.17/
H A DCFBinaryHeap.c57 CF_INLINE CFIndex __CFBinaryHeapCount(CFBinaryHeapRef heap) { argument
58 return heap->_count;
61 CF_INLINE void __CFBinaryHeapSetCount(CFBinaryHeapRef heap, CFIndex v) { argument
65 CF_INLINE CFIndex __CFBinaryHeapCapacity(CFBinaryHeapRef heap) { argument
66 return heap->_capacity;
69 CF_INLINE void __CFBinaryHeapSetCapacity(CFBinaryHeapRef heap, CFIndex v) { argument
73 CF_INLINE CFIndex __CFBinaryHeapNumBucketsUsed(CFBinaryHeapRef heap) { argument
74 return heap->_count;
77 CF_INLINE void __CFBinaryHeapSetNumBucketsUsed(CFBinaryHeapRef heap, CFIndex v) { argument
78 heap
81 __CFBinaryHeapNumBuckets(CFBinaryHeapRef heap) argument
85 __CFBinaryHeapSetNumBuckets(CFBinaryHeapRef heap, CFIndex v) argument
147 CFBinaryHeapRef heap = (CFBinaryHeapRef)cf; local
152 CFBinaryHeapRef heap = (CFBinaryHeapRef)cf; local
182 CFBinaryHeapRef heap = (CFBinaryHeapRef)cf; local
272 CFBinaryHeapCreateCopy(CFAllocatorRef allocator, CFIndex capacity, CFBinaryHeapRef heap) argument
277 CFBinaryHeapGetCount(CFBinaryHeapRef heap) argument
282 CFBinaryHeapGetCountOfValue(CFBinaryHeapRef heap, const void *value) argument
298 CFBinaryHeapContainsValue(CFBinaryHeapRef heap, const void *value) argument
314 CFBinaryHeapGetMinimum(CFBinaryHeapRef heap) argument
320 CFBinaryHeapGetMinimumIfPresent(CFBinaryHeapRef heap, const void **value) argument
327 CFBinaryHeapGetValues(CFBinaryHeapRef heap, const void **values) argument
345 CFBinaryHeapApplyFunction(CFBinaryHeapRef heap, CFBinaryHeapApplierFunction applier, void *context) argument
361 __CFBinaryHeapGrow(CFBinaryHeapRef heap, CFIndex numNewValues) argument
373 CFBinaryHeapAddValue(CFBinaryHeapRef heap, const void *value) argument
404 CFBinaryHeapRemoveMinimumValue(CFBinaryHeapRef heap) argument
438 CFBinaryHeapRemoveAllValues(CFBinaryHeapRef heap) argument
[all...]
H A DCFBinaryHeap.h56 @field retain The callback used to add a retain for the binary heap
57 on values as they are put into the binary heap.
59 binary heap, which is usually the value parameter passed to
61 value should be added to the binary heap. The binary heap's
64 for the binary heap from values as they are removed from
65 the binary heap. The binary heap's allocator is passed as the
68 string representation of each value in the binary heap. This
70 @field compare The callback used to compare values in the binary heap fo
[all...]
/macosx-10.9.5/JavaScriptCore-7537.78.1/runtime/
H A DGCActivityCallbackBlackBerry.cpp28 DefaultGCActivityCallback::DefaultGCActivityCallback(Heap* heap) argument
29 : GCActivityCallback(heap->vm())
36 m_vm->heap.collect(Heap::DoNotSweep);
45 m_timer.start(m_vm->heap.lastGCLength() * 20);
H A DGCActivityCallback.cpp56 DefaultGCActivityCallback::DefaultGCActivityCallback(Heap* heap) argument
57 : GCActivityCallback(heap->vm(), CFRunLoopGetCurrent())
62 DefaultGCActivityCallback::DefaultGCActivityCallback(Heap* heap, CFRunLoopRef runLoop) argument
63 : GCActivityCallback(heap->vm(), runLoop)
68 DefaultGCActivityCallback::DefaultGCActivityCallback(Heap* heap) argument
69 : GCActivityCallback(heap->vm())
74 DefaultGCActivityCallback::DefaultGCActivityCallback(Heap* heap) argument
75 : GCActivityCallback(heap->vm(), WTF::isMainThread())
83 Heap* heap = &m_vm->heap; local
162 Heap* heap = static_cast<Heap*>(&m_vm->heap); local
[all...]
/macosx-10.9.5/WebCore-7537.78.1/bindings/js/
H A DScriptGCEvent.cpp36 #include <heap/Heap.h>
47 info.totalJSHeapSize = vm->heap.capacity();
48 info.usedJSHeapSize = vm->heap.size();
H A DScriptWrappableInlines.h36 #include <heap/Weak.h>
37 #include <heap/WeakInlines.h>
/macosx-10.9.5/cxxfilt-11/cxxfilt/libiberty/
H A Dfibheap.c1 /* A Fibonacci heap datatype.
56 /* Create a new fibonacci heap. */
63 /* Create a new fibonacci heap node. */
77 fibheap_compare (fibheap_t heap ATTRIBUTE_UNUSED, fibnode_t a, fibnode_t b)
87 fibheap_comp_data (fibheap_t heap, fibheapkey_t key, void *data, fibnode_t b)
94 return fibheap_compare (heap, &a, b);
99 fibheap_insert (fibheap_t heap, fibheapkey_t key, void *data)
111 fibheap_ins_root (heap, node);
115 if (heap->min == NULL || node->key < heap
86 fibheap_comp_data(fibheap_t heap, fibheapkey_t key, void *data, fibnode_t b) argument
98 fibheap_insert(fibheap_t heap, fibheapkey_t key, void *data) argument
124 fibheap_min(fibheap_t heap) argument
134 fibheap_min_key(fibheap_t heap) argument
178 fibheap_extract_min(fibheap_t heap) argument
198 fibheap_replace_key_data(fibheap_t heap, fibnode_t node, fibheapkey_t key, void *data) argument
237 fibheap_replace_data(fibheap_t heap, fibnode_t node, void *data) argument
244 fibheap_replace_key(fibheap_t heap, fibnode_t node, fibheapkey_t key) argument
253 fibheap_delete_node(fibheap_t heap, fibnode_t node) argument
266 fibheap_delete(fibheap_t heap) argument
276 fibheap_empty(fibheap_t heap) argument
283 fibheap_extr_min_node(fibheap_t heap) argument
319 fibheap_ins_root(fibheap_t heap, fibnode_t node) argument
338 fibheap_rem_root(fibheap_t heap, fibnode_t node) argument
348 fibheap_consolidate(fibheap_t heap) argument
409 fibheap_cut(fibheap_t heap, fibnode_t node, fibnode_t parent) argument
419 fibheap_cascading_cut(fibheap_t heap, fibnode_t y) argument
[all...]
/macosx-10.9.5/CPANInternal-140/Heap-0.80/t/
H A Delem.t18 heap
22 my $heap = Heap::Elem->new();
24 like (ref($heap), qr/Heap::Elem/, 'new returned an object');
H A Dnum.t17 heap
21 my $heap = Heap::Elem::Num->new();
23 like (ref($heap), qr/Heap::Elem::Num/, 'new returned an object');
H A Dnumrev.t17 heap
21 my $heap = Heap::Elem::NumRev->new();
23 like (ref($heap), qr/Heap::Elem::NumRev/, 'new returned an object');
H A Dref.t17 heap
21 my $heap = Heap::Elem::Ref->new();
23 like (ref($heap), qr/Heap::Elem::Ref/, 'new returned an object');
H A Drefrev.t17 heap
21 my $heap = Heap::Elem::RefRev->new();
23 like (ref($heap), qr/Heap::Elem::RefRev/, 'new returned an object');
H A Dstr.t17 heap
21 my $heap = Heap::Elem::Str->new();
23 like (ref($heap), qr/Heap::Elem::Str/, 'new returned an object');
H A Dstrrev.t17 heap
21 my $heap = Heap::Elem::StrRev->new();
23 like (ref($heap), qr/Heap::Elem::StrRev/, 'new returned an object');
H A Dtest_leaks2.t34 my $heap = Heap::Fibonacci->new;
39 $heap->add($heapElem);
49 my $elem = $heap->extract_top;
52 undef $heap;
/macosx-10.9.5/bind9-45.100/bind9/lib/isc/include/isc/
H A Dheap.h18 /* $Id: heap.h,v 1.26 2009/01/17 23:47:43 tbox Exp $ */
23 /*! \file isc/heap.h */
37 * The index function allows the client of the heap to receive a callback
40 * from the heap require the index be provided.
45 * The heapaction function is used when iterating over the heap.
47 * NOTE: The heap structure CANNOT BE MODIFIED during the call to
59 * \brief Create a new heap. The heap is implemented using a space-efficient
60 * storage method. When the heap elements are deleted space is not freed
71 * heap
[all...]
/macosx-10.9.5/ntp-88/lib/isc/include/isc/
H A Dheap.h18 /* $Id: heap.h,v 1.24.332.2 2009/01/18 23:47:41 tbox Exp $ */
23 /*! \file isc/heap.h */
37 * The index function allows the client of the heap to receive a callback
40 * from the heap require the index be provided.
45 * The heapaction function is used when iterating over the heap.
47 * NOTE: The heap structure CANNOT BE MODIFIED during the call to
59 * \brief Create a new heap. The heap is implemented using a space-efficient
60 * storage method. When the heap elements are deleted space is not freed
71 * heap
[all...]
/macosx-10.9.5/WebCore-7537.78.1/inspector/front-end/
H A DheapProfiler.css32 .heap-snapshot-sidebar-tree-item .icon {
36 .heap-snapshot-sidebar-tree-item.wait .icon {
40 .heap-snapshot-sidebar-tree-item.wait.selected .icon {
44 body.inactive .heap-snapshot-sidebar-tree-item.wait .icon {
48 body.inactive .heap-snapshot-sidebar-tree-item.wait.selected .icon {
52 .heap-snapshot-sidebar-tree-item.small .icon {
56 .heap-snapshot-view {
66 .heap-snapshot-view.visible {
70 .heap-snapshot-view .view {
74 .heap
[all...]
/macosx-10.9.5/CPANInternal-140/Heap/t/
H A Dtest_leaks2.t32 my $heap = Heap::Fibonacci->new;
37 $heap->add($heapElem);
47 my $elem = $heap->extract_top;
50 undef $heap;
/macosx-10.9.5/JavaScriptCore-7537.78.1/heap/
H A DIncrementalSweeper.cpp48 IncrementalSweeper::IncrementalSweeper(Heap* heap, CFRunLoopRef runLoop) argument
49 : HeapTimer(heap->vm(), runLoop)
51 , m_blocksToSweep(heap->m_blockSnapshot)
55 PassOwnPtr<IncrementalSweeper> IncrementalSweeper::create(Heap* heap) argument
57 return adoptPtr(new IncrementalSweeper(heap, CFRunLoopGetCurrent()));
72 IncrementalSweeper::IncrementalSweeper(Heap* heap) argument
73 : HeapTimer(heap->vm())
75 , m_blocksToSweep(heap->m_blockSnapshot)
79 PassOwnPtr<IncrementalSweeper> IncrementalSweeper::create(Heap* heap) argument
81 return adoptPtr(new IncrementalSweeper(heap));
[all...]
/macosx-10.9.5/emacs-92/emacs/src/
H A Dralloc.c138 Each heap contains malloc data, running from `start' to `bloc_start',
141 Relocatable objects may relocate within the same heap
142 or may move into another heap; the heaps themselves may grow
145 We try to make just one heap and make it larger as necessary.
147 space to add onto the heap. When that happens, we start a new heap. */ struct
149 typedef struct heap
151 struct heap *next;
152 struct heap *prev;
153 /* Start of memory range of this heap
194 struct heap *heap; /* Heap this bloc is in. */ member in struct:bp
217 heap_ptr heap; local
251 heap_ptr heap; local
425 register heap_ptr heap; local
639 heap_ptr heap; local
736 heap_ptr heap = bloc->heap; local
[all...]

Completed in 286 milliseconds

1234567891011>>