Searched defs:heap_ (Results 1 - 15 of 15) sorted by relevance

/external/openfst/src/include/fst/extensions/far/
H A Dstlist.h161 heap_.push(make_pair(key, i));
168 if (heap_.empty()) return;
169 size_t current = heap_.top().second;
173 << heap_.top().first << ", file: " << sources_[current];
211 return error_ || heap_.empty();
216 size_t current = heap_.top().second;
218 heap_.pop();
227 heap_.push(make_pair(key, current));
229 if(!heap_.empty()) {
230 current = heap_
258 greater<pair<string, size_t> > > heap_; // (Key, stream id) heap member in class:fst::STListReader
[all...]
H A Dsttable.h201 bool Done() const { return error_ || heap_.empty(); }
213 push_heap(heap_.begin(), heap_.end(), *compare_);
215 heap_.pop_back();
217 if (!heap_.empty())
278 heap_.clear();
286 heap_.push_back(i);
288 make_heap(heap_.begin(), heap_.end(), *compare_);
296 pop_heap(heap_
316 vector<int64> heap_; // Heap containing ID of streams with unread keys member in class:fst::STTableReader
[all...]
/external/v8/src/
H A Dstore-buffer.h126 Heap* heap_; member in class:v8::internal::StoreBuffer
213 : heap_(heap),
229 Heap* heap_; member in class:v8::internal::StoreBufferRebuildScope
H A Dincremental-marking.h255 Heap* heap_; member in class:v8::internal::IncrementalMarking
H A Dincremental-marking.cc41 : heap_(heap),
71 heap_->mark_compact_collector()->RecordSlot(
118 Code* host = heap_->isolate()->inner_pointer_to_code_cache()->
131 heap_->mark_compact_collector()->
155 heap_->mark_compact_collector()->RecordRelocSlot(rinfo,
166 : heap_(heap),
174 heap_->mark_compact_collector()->RecordRelocSlot(rinfo, target);
183 && (target->ic_age() != heap_->global_ic_age())) {
187 heap_->mark_compact_collector()->RecordRelocSlot(rinfo, Code::cast(target));
197 heap_
247 Heap* heap_; member in class:v8::internal::IncrementalMarkingMarkingVisitor
287 Heap* heap_; member in class:v8::internal::IncrementalMarkingRootMarkingVisitor
[all...]
H A Dmark-compact.h52 : heap_(heap) {
164 Heap* heap_; member in class:v8::internal::Marking
468 inline Heap* heap() const { return heap_; }
753 Heap* heap_; member in class:v8::internal::MarkCompactCollector
H A Druntime.cc2403 : heap_(heap),
2456 return heap_->isolate()->factory()->empty_string();
2497 return heap_->isolate()->factory()->NewRawAsciiString(length);
2502 return heap_->isolate()->factory()->NewRawTwoByteString(length);
2512 Heap* heap_; member in class:v8::internal::ReplacementStringBuilder
H A Disolate.h549 thread_local_top_.pending_exception_ = heap_.the_hole_value();
559 thread_local_top_.pending_message_obj_ = heap_.the_hole_value();
586 return thread_local_top_.scheduled_exception_ != heap_.the_hole_value();
589 thread_local_top_.scheduled_exception_ = heap_.the_hole_value();
806 Heap* heap() { return &heap_; }
1164 Heap heap_; member in class:v8::internal::Isolate
H A Dprofile-generator.h1000 Heap* heap_; member in class:v8::internal::V8HeapExplorer
H A Dheap.h297 heap_(heap) { }
376 Heap* heap_; member in class:v8::internal::PromotionQueue
423 Heap* heap_; member in class:v8::internal::ExternalStringTable
2500 Heap* heap_;
H A Dmark-compact.cc71 heap_(NULL),
283 ASSERT(heap_->incremental_marking()->IsStopped());
291 VerifyMarking(heap_);
299 heap_->isolate()->inner_pointer_to_code_cache()->Flush();
329 VerifyMarkbitsAreClean(heap_->old_pointer_space());
330 VerifyMarkbitsAreClean(heap_->old_data_space());
331 VerifyMarkbitsAreClean(heap_->code_space());
332 VerifyMarkbitsAreClean(heap_->cell_space());
333 VerifyMarkbitsAreClean(heap_->map_space());
334 VerifyMarkbitsAreClean(heap_
1583 Heap* heap_; member in class:v8::internal::MarkingVisitor
1781 Heap* heap_; member in class:v8::internal::SymbolTableCleaner
2758 Heap* heap_; member in class:v8::internal::PointersUpdatingVisitor
[all...]
H A Dheap.cc178 mark_compact_collector_.heap_ = this;
179 external_string_table_.heap_ = this;
963 explicit ScavengeVisitor(Heap* heap) : heap_(heap) {}
975 if (!heap_->InNewSpace(object)) return;
980 Heap* heap_; member in class:v8::internal::ScavengeVisitor
1103 limit_ = reinterpret_cast<intptr_t*>(heap_->new_space()->ToSpaceStart());
1105 reinterpret_cast<intptr_t*>(heap_->new_space()->ToSpaceEnd());
5705 heap_(heap) {
5851 Heap* heap_; member in class:v8::internal::HeapDebugUtils
6631 heap_(hea
[all...]
H A Dspaces.h562 inline Heap* heap() { return heap_; }
620 Heap* heap_; member in class:v8::internal::MemoryChunk
760 : heap_(heap), id_(id), executable_(executable) {}
764 Heap* heap() const { return heap_; }
800 Heap* heap_; member in class:v8::internal::Space
1406 Heap* heap_; member in class:v8::internal::BASE_EMBEDDED
/external/srec/tools/thirdparty/OpenFst/fst/lib/
H A Dqueue.h198 : QueueBase<S>(SHORTEST_FIRST_QUEUE), heap_(comp) {}
200 StateId Head() const { return heap_.Top(); }
205 key_[s] = heap_.Insert(s);
209 key_[heap_.Pop()] = kNoKey;
216 heap_.Update(key_[s], s);
220 bool Empty() const { return heap_.Empty(); }
223 heap_.Clear();
228 Heap<S, C> heap_; member in class:fst::ShortestFirstQueue
/external/openfst/src/include/fst/
H A Dqueue.h217 : QueueBase<S>(SHORTEST_FIRST_QUEUE), heap_(comp) {}
219 StateId Head() const { return heap_.Top(); }
225 key_[s] = heap_.Insert(s);
227 heap_.Insert(s);
233 key_[heap_.Pop()] = kNoKey;
235 heap_.Pop();
244 heap_.Update(key_[s], s);
248 bool Empty() const { return heap_.Empty(); }
251 heap_.Clear();
256 Heap<S, C, false> heap_; member in class:fst::ShortestFirstQueue
[all...]

Completed in 863 milliseconds