| /external/openfst/src/include/fst/extensions/far/ |
| stlist.h | 162 heap_.push(make_pair(key, i));
169 if (heap_.empty()) return;
170 size_t current = heap_.top().second;
174 << heap_.top().first << ", file: " << sources_[current];
212 return error_ || heap_.empty();
217 size_t current = heap_.top().second;
219 heap_.pop();
228 heap_.push(make_pair(key, current));
230 if(!heap_.empty()) {
231 current = heap_.top().second
259 greater<pair<string, size_t> > > heap_; \/\/ (Key, stream id) heap member in class:fst::STListReader
[all...] |
| sttable.h | 202 bool Done() const { return error_ || heap_.empty(); }
214 push_heap(heap_.begin(), heap_.end(), *compare_);
216 heap_.pop_back();
218 if (!heap_.empty())
279 heap_.clear();
287 heap_.push_back(i);
289 make_heap(heap_.begin(), heap_.end(), *compare_);
297 pop_heap(heap_.begin(), heap_.end(), *compare_)
317 vector<int64> heap_; \/\/ Heap containing ID of streams with unread keys member in class:fst::STTableReader
[all...] |
| /external/v8/src/ |
| incremental-marking.h | 255 Heap* heap_; member in class:v8::internal::IncrementalMarking
|
| store-buffer.h | 126 Heap* heap_; member in class:v8::internal::StoreBuffer
213 : heap_(heap),
229 Heap* heap_; member in class:v8::internal::StoreBufferRebuildScope
|
| incremental-marking.cc | 41 : 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_->mark_compact_collector()->RecordRelocSlot(rinfo, Code::cast(target))
247 Heap* heap_; member in class:v8::internal::IncrementalMarkingMarkingVisitor
287 Heap* heap_; member in class:v8::internal::IncrementalMarkingRootMarkingVisitor
[all...] |
| mark-compact.h | 52 : 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
|
| profile-generator.h | 1000 Heap* heap_; member in class:v8::internal::V8HeapExplorer
[all...] |
| runtime.cc | 2512 Heap* heap_; member in class:v8::internal::ReplacementStringBuilder
[all...] |
| isolate.h | 549 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
[all...] |
| heap.h | 297 heap_(heap) { }
376 Heap* heap_; member in class:v8::internal::PromotionQueue
423 Heap* heap_; member in class:v8::internal::ExternalStringTable
[all...] |
| mark-compact.cc | 71 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_->new_space())
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...] |
| spaces.h | 562 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
[all...] |
| heap.cc | 178 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
5851 Heap* heap_; member in class:v8::internal::HeapDebugUtils
[all...] |
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| queue.h | 198 : 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/ |
| queue.h | 218 : QueueBase<S>(SHORTEST_FIRST_QUEUE), heap_(comp) {}
220 StateId Head() const { return heap_.Top(); }
226 key_[s] = heap_.Insert(s);
228 heap_.Insert(s);
234 key_[heap_.Pop()] = kNoKey;
236 heap_.Pop();
245 heap_.Update(key_[s], s);
249 bool Empty() const { return heap_.Empty(); }
252 heap_.Clear();
257 Heap<S, C, false> heap_; member in class:fst::ShortestFirstQueue
[all...] |
