OLD | NEW |
(Empty) | |
| 1 // Copyright 2017 The Chromium Authors. All rights reserved. |
| 2 // Use of this source code is governed by a BSD-style license that can be |
| 3 // found in the LICENSE file. |
| 4 |
| 5 #ifndef CONTENT_RENDERER_INPUT_MAIN_THREAD_EVENT_QUEUE_TASK_LIST_H_ |
| 6 #define CONTENT_RENDERER_INPUT_MAIN_THREAD_EVENT_QUEUE_TASK_LIST_H_ |
| 7 |
| 8 #include <deque> |
| 9 #include <memory> |
| 10 |
| 11 #include "content/renderer/input/main_thread_event_queue_task.h" |
| 12 |
| 13 namespace content { |
| 14 |
| 15 // The list of tasks that the main thread event queue will execute. |
| 16 // This class supports coalescing upon queueing a task. |
| 17 class MainThreadEventQueueTaskList { |
| 18 public: |
| 19 MainThreadEventQueueTaskList(); |
| 20 ~MainThreadEventQueueTaskList(); |
| 21 |
| 22 // Adds an event to the queue. The event may be coalesced with previously |
| 23 // queued events. |
| 24 void Queue(std::unique_ptr<MainThreadEventQueueTask> event); |
| 25 std::unique_ptr<MainThreadEventQueueTask> Pop(); |
| 26 |
| 27 const std::unique_ptr<MainThreadEventQueueTask>& front() const { |
| 28 return queue_.front(); |
| 29 } |
| 30 const std::unique_ptr<MainThreadEventQueueTask>& at(size_t pos) const { |
| 31 return queue_.at(pos); |
| 32 } |
| 33 |
| 34 void emplace_front(std::unique_ptr<MainThreadEventQueueTask> event) { |
| 35 queue_.emplace_front(std::move(event)); |
| 36 } |
| 37 void swap(std::deque<std::unique_ptr<MainThreadEventQueueTask>>* queue) { |
| 38 queue_.swap(*queue); |
| 39 } |
| 40 |
| 41 bool empty() const { return queue_.empty(); } |
| 42 |
| 43 size_t size() const { return queue_.size(); } |
| 44 |
| 45 private: |
| 46 typedef std::deque<std::unique_ptr<MainThreadEventQueueTask>> EventQueue; |
| 47 EventQueue queue_; |
| 48 |
| 49 DISALLOW_COPY_AND_ASSIGN(MainThreadEventQueueTaskList); |
| 50 }; |
| 51 |
| 52 } // namespace content |
| 53 |
| 54 #endif // CONTENT_RENDERER_INPUT_MAIN_THREAD_EVENT_QUEUE_TASK_LIST_H_ |
OLD | NEW |