// Copyright 2014 The Chromium Authors // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. #ifndef CC_RASTER_TASK_GRAPH_WORK_QUEUE_H_ #define CC_RASTER_TASK_GRAPH_WORK_QUEUE_H_ #include <stdint.h> #include <map> #include <utility> #include <vector> #include "base/containers/contains.h" #include "base/memory/raw_ptr.h" #include "base/ranges/algorithm.h" #include "cc/cc_export.h" #include "cc/raster/task_graph_runner.h" namespace cc { // Implements a queue of incoming TaskGraph work. Designed for use by // implementations of TaskGraphRunner. Not thread safe, so the caller is // responsible for all necessary locking. // // Tasks in the queue are divided into categories. Tasks from a single graph may // be put into different categories, each of which is prioritized independently // from the others. It is up to the implementation of TaskGraphRunner to // define the meaning of the categories and handle them appropriately. class CC_EXPORT TaskGraphWorkQueue { … }; } // namespace cc #endif // CC_RASTER_TASK_GRAPH_WORK_QUEUE_H_