Lines Matching refs:queue
20 #include <queue>
208 // They are sorted lexicographically. Thus, the priority-queue must be a min-queue.
475 // Populate the queue of dex file and class pairs with the loaded and unloaded dex files.
476 std::priority_queue<DexFileAndClassPair> queue;
479 queue.emplace(dex_files_loaded[i], &loaded_types[i], /*from_loaded_oat*/true);
484 queue.emplace(dex_files_unloaded[i], &unloaded_types[i], /*from_loaded_oat*/false);
488 // Now drain the queue.
491 while (!queue.empty()) {
493 DexFileAndClassPair compare_pop(queue.top());
494 queue.pop();
497 while (!queue.empty()) {
498 DexFileAndClassPair top(queue.top());
512 queue.pop();
513 AddNext(top, queue);
519 AddNext(compare_pop, queue);