| /third_party/node/test/parallel/ |
| H A D | test-priority-queue.js | 7 const PriorityQueue = require('internal/priority_queue');
11 const queue = new PriorityQueue();
35 const queue = new PriorityQueue();
48 const queue = new PriorityQueue((a, b) => b - a);
64 const queue = new PriorityQueue((a, b) => {
79 const queue = new PriorityQueue((a, b) => {
117 const queue = new PriorityQueue((a, b) => {
|
| /third_party/libphonenumber/metadata/src/main/java/com/google/i18n/phonenumbers/metadata/regex/ |
| H A D | NfaFlattener.java | 30 import java.util.PriorityQueue;
114 PriorityQueue<PathFollower> followerQueue = new PriorityQueue<>(queueOrder); in visitSubgraph()
146 private static List<Edge> collectJoiningEdges(PriorityQueue<PathFollower> queue, Node target) { in collectJoiningEdges()
159 private static boolean nextFollowerJoinsTarget(PriorityQueue<PathFollower> queue, Node target) { in nextFollowerJoinsTarget()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/ |
| H A D | PriorityQueue.h | 1 //===- llvm/ADT/PriorityQueue.h - Priority queues ---------------*- C++ -*-===//
9 // This file defines the PriorityQueue class.
21 /// PriorityQueue - This class behaves like std::priority_queue and
27 class PriorityQueue : public std::priority_queue<T, Sequence, Compare> { class
29 explicit PriorityQueue(const Compare &compare = Compare(), in PriorityQueue() function in llvm::PriorityQueue
35 PriorityQueue(Iterator begin, Iterator end, in PriorityQueue() function in llvm::PriorityQueue
|
| /third_party/node/benchmark/util/ |
| H A D | priority-queue.js | 10 const PriorityQueue = require('internal/priority_queue');
11 const queue = new PriorityQueue();
|
| /third_party/node/lib/internal/test_runner/mock/ |
| H A D | mock_timers.js | 33 const PriorityQueue = require('internal/priority_queue');
82 #executionQueue = new PriorityQueue(compareTimersLists, setPosition);
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/WebAssembly/ |
| H A D | WebAssemblyCFGSort.cpp | 24 #include "llvm/ADT/PriorityQueue.h"
266 PriorityQueue<MachineBasicBlock *, std::vector<MachineBasicBlock *>, in sortBlocks()
269 PriorityQueue<MachineBasicBlock *, std::vector<MachineBasicBlock *>, in sortBlocks()
|
| /third_party/python/Lib/asyncio/ |
| H A D | queues.py | 1 __all__ = ('Queue', 'PriorityQueue', 'LifoQueue', 'QueueFull', 'QueueEmpty')
218 class PriorityQueue(Queue): class
|
| /third_party/node/lib/internal/ |
| H A D | timers.js | 69 // The PriorityQueue — an efficient binary heap implementation that does all
121 const PriorityQueue = require('internal/priority_queue');
150 const timerListQueue = new PriorityQueue(compareTimersLists, setPosition);
593 // the PriorityQueue.
|
| /third_party/python/Lib/ |
| H A D | queue.py | 13 __all__ = ['Empty', 'Full', 'Queue', 'PriorityQueue', 'LifoQueue', 'SimpleQueue']
223 class PriorityQueue(Queue): class
|
| /third_party/python/Lib/test/test_asyncio/ |
| H A D | test_queues.py | 449 q = asyncio.PriorityQueue()
522 q_class = asyncio.PriorityQueue
|
| /third_party/python/Lib/test/ |
| H A D | test_queue.py | 108 PriorityQueue = [111, 222, 333])
278 self.type2test = self.queue.PriorityQueue
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/ |
| H A D | MachineScheduler.cpp | 18 #include "llvm/ADT/PriorityQueue.h"
3605 PriorityQueue<SUnit*, std::vector<SUnit*>, SUnitOrder<false>>
3609 PriorityQueue<SUnit*, std::vector<SUnit*>, SUnitOrder<true>>
|
| H A D | MachinePipeliner.cpp | 36 #include "llvm/ADT/PriorityQueue.h"
1028 PriorityQueue<MachineInstr *, std::vector<MachineInstr *>, FuncUnitSorter> in calculateResMII()
|