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
|