HomeSort by relevance Sort by last modified time
    Searched defs:Heap (Results 1 - 21 of 21) sorted by null

  /external/openfst/src/include/fst/
heap.h 19 // Implementation of a heap as in STL, but allows tracking positions
20 // in heap using a key. The key can be used to do an in-place update of
21 // values in the heap.
34 // \class Heap
35 // \brief A templated heap implementation that support in-place update
38 // The templated heap implementation is a little different from the
39 // STL priority_queue and the *_heap operations in STL. This heap
40 // supports indexing of values in the heap via an associated key.
43 // to the calling functions on heap insert. This key can be used
44 // to later update the specific value in the heap
    [all...]
  /external/srec/tools/thirdparty/OpenFst/fst/lib/
heap.h 0 // heap.h
17 // Implementation of a heap as in STL, but allows tracking positions
18 // in heap using a key. The key can be used to do an in place update of
19 // values in the heap.
30 // \class Heap
31 // \brief A templated heap implementation that support in place update
34 // The templated heap implementation is a little different from the
35 // STL priority_queue and the *_heap operations in STL. The heap
36 // supports indexing of values in the heap via an associated key.
39 // to the calling functions on heap insert. This key can be use
    [all...]
  /external/webkit/Source/JavaScriptCore/heap/
Heap.cpp 22 #include "Heap.h"
43 Heap::Heap(JSGlobalData* globalData)
58 Heap::~Heap()
64 void Heap::destroy()
91 void Heap::reportExtraMemoryCostSlowCase(size_t cost)
109 void* Heap::allocateSlowCase(size_t bytes)
132 void Heap::protect(JSValue k)
143 bool Heap::unprotect(JSValue k
    [all...]
Heap.h 54 class Heap {
55 WTF_MAKE_NONCOPYABLE(Heap);
57 static Heap* heap(JSValue); // 0 for immediate values
58 static Heap* heap(JSCell*);
64 Heap(JSGlobalData*);
65 ~Heap();
66 void destroy(); // JSGlobalData must call destroy() before ~Heap().
145 inline bool Heap::isMarked(const JSCell* cell
    [all...]
  /dalvik/hit/src/com/android/hit/
Heap.java 22 public class Heap {
44 // The super-state that this heap is part of
47 public Heap(String name) {
  /external/valgrind/main/exp-sgcheck/
pc_common.c 139 } Heap;
184 xe.XE.Heap.addr = a;
185 xe.XE.Heap.sszB = is_write ? -size : size;
186 xe.XE.Heap.vseg = vseg;
352 Addr a = xe->XE.Heap.addr;
353 Seg* vseg = xe->XE.Heap.vseg;
363 readwrite(xe->XE.Heap.sszB),
364 Word__abs(xe->XE.Heap.sszB) );
373 readwrite(xe->XE.Heap.sszB),
374 Word__abs(xe->XE.Heap.sszB) )
    [all...]
  /external/opencv/cv/src/
cvinpaint.cpp 207 //HEAP::iterator Heap_Iterator;
208 //HEAP Heap;
237 icvCalcFMM(const CvMat *f, CvMat *t, CvPriorityQueueFloat *Heap, bool negate) {
241 while (Heap->Pop(&ii,&jj)) {
261 Heap->Push(i,j,dist);
280 icvTeleaInpaintFMM(const CvMat *f, CvMat *t, CvMat *out, int range, CvPriorityQueueFloat *Heap ) {
286 while (Heap->Pop(&ii,&jj)) {
392 Heap->Push(i,j,dist);
399 while (Heap->Pop(&ii,&jj))
    [all...]
  /dalvik/vm/alloc/
HeapSource.cpp 25 #include "alloc/Heap.h"
38 /* How long to wait after a GC before performing a heap trim
60 struct Heap {
65 /* The largest size that this heap is allowed to grow to.
85 * The lowest address of this heap, inclusive.
90 * The highest address of this heap, exclusive.
95 * If the heap has an mspace, the current high water mark in
102 /* Target ideal heap utilization ratio; range 1..HEAP_UTILIZATION_MAX
106 /* The starting heap size.
110 /* The largest that the heap source as a whole is allowed to grow
250 const Heap *const heap = &hs->heaps[i]; local
324 Heap* heap = NULL; local
385 Heap heap; local
731 Heap *const heap = &hs->heaps[i]; local
756 Heap *const heap = &hs->heaps[i]; local
876 Heap* heap = hs2heap(hs); local
941 Heap* heap = hs2heap(hs); local
998 Heap* heap = ptr2heap(gHs, *ptrs); local
1057 Heap *heap = ptr2heap(hs, obj); local
1079 Heap* heap = ptr2heap(gHs, ptr); local
1303 Heap* heap = hs2heap(hs); local
1367 Heap *heap = &hs->heaps[i]; local
    [all...]
  /external/guava/guava/src/com/google/common/collect/
MinMaxPriorityQueue.java 62 * <a href="http://portal.acm.org/citation.cfm?id=6621">min-max heap</a>
64 * it stores elements in a single array, as compact as the traditional heap data
219 private final Heap minHeap;
220 private final Heap maxHeap;
228 this.minHeap = new Heap(ordering);
229 this.maxHeap = new Heap(ordering.reverse());
277 // Adds the element to the end of the heap and bubbles it up to the correct
371 * <p>Occasionally, in order to maintain the heap invariant, it must swap a
374 * first one is the element that was previously at the end of the heap and is
410 Heap heap = heapForIndex(index) local
538 Heap heap; local
    [all...]
  /external/v8/src/
heap.h 48 // Defines all the roots in Heap.
255 typedef String* (*ExternalStringTableUpdaterCallback)(Heap* heap,
280 // The all static Heap captures the interface to the global object heap.
281 // All JavaScript contexts by this process share the same object heap.
292 explicit PromotionQueue(Heap* heap)
297 heap_(heap) { }
376 Heap* heap_
    [all...]
heap.cc 38 #include "heap-profiler.h"
66 Heap::Heap()
140 previous_survival_rate_trend_(Heap::STABLE),
141 survival_rate_trend_(Heap::STABLE),
183 intptr_t Heap::Capacity() {
195 intptr_t Heap::CommittedMemory() {
207 intptr_t Heap::CommittedMemoryExecutable() {
214 intptr_t Heap::Available() {
226 bool Heap::HasBeenSetUp()
1625 Heap* heap = map->GetHeap(); local
1753 Heap* heap = map->GetHeap(); local
6315 Heap* heap = Isolate::Current()->heap(); local
    [all...]
  /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/
org.sat4j.core_2.2.0.v20100429.jar 
  /prebuilts/sdk/tools/lib/
guava-10.0.1.jar 
lint.jar 
lint_api.jar 
lint_checks.jar 
  /prebuilts/devtools/tools/lib/
guava-13.0.1.jar 
  /prebuilts/misc/common/tradefed/
tradefed-prebuilt.jar 
  /prebuilts/tools/common/gradle-plugins/repository/com/google/guava/guava/14.0/
guava-14.0.jar 
  /prebuilts/tools/common/guava-tools/
guava-13.0.1.jar 
  /prebuilts/tools/common/m2/repository/com/google/guava/guava/13.0.1/
guava-13.0.1.jar 

Completed in 2457 milliseconds