HomeSort by relevance Sort by last modified time
    Searched refs:CircularQueue (Results 1 - 3 of 3) sorted by null

  /external/perfetto/include/perfetto/base/
circular_queue.h 29 // CircularQueue is a push-back-only / pop-front-only queue with the following
49 class CircularQueue {
59 Iterator(CircularQueue* queue, uint64_t pos, uint32_t generation)
162 CircularQueue* queue_;
170 CircularQueue(size_t initial_capacity = 1024) { Grow(initial_capacity); }
172 CircularQueue(CircularQueue&& other) noexcept {
176 new (&other) CircularQueue(); // Reset the old queue so it's still usable.
179 CircularQueue& operator=(CircularQueue&& other)
    [all...]
  /external/perfetto/src/base/
circular_queue_unittest.cc 28 CircularQueue<int> queue(/*initial_capacity=*/1);
92 CircularQueue<uint64_t> queue;
105 CircularQueue<int> queue;
110 CircularQueue<int> moved(std::move(queue));
126 CircularQueue<int> moved;
140 CircularQueue<size_t> queue(capacity);
222 CircularQueue<Checker> queue(/*initial_capacity=*/2);
241 CircularQueue<Checker> queue(/*initial_capacity=*/1);
261 CircularQueue<Checker> q1(1);
262 CircularQueue<Checker> q2(64)
    [all...]
  /external/perfetto/src/trace_processor/
trace_sorter.h 261 base::CircularQueue<TimestampedTracePiece> events_;

Completed in 546 milliseconds