| Index: cc/resources/raster_tile_priority_queue_all.h
|
| diff --git a/cc/resources/raster_tile_priority_queue.h b/cc/resources/raster_tile_priority_queue_all.h
|
| similarity index 65%
|
| copy from cc/resources/raster_tile_priority_queue.h
|
| copy to cc/resources/raster_tile_priority_queue_all.h
|
| index 65c924798a8338de2e6002254a2c481f8fc742ca..73c946560990d1061807088a44ecb044b0ca47d7 100644
|
| --- a/cc/resources/raster_tile_priority_queue.h
|
| +++ b/cc/resources/raster_tile_priority_queue_all.h
|
| @@ -1,9 +1,9 @@
|
| -// Copyright 2014 The Chromium Authors. All rights reserved.
|
| +// Copyright 2015 The Chromium Authors. All rights reserved.
|
| // Use of this source code is governed by a BSD-style license that can be
|
| // found in the LICENSE file.
|
|
|
| -#ifndef CC_RESOURCES_RASTER_TILE_PRIORITY_QUEUE_H_
|
| -#define CC_RESOURCES_RASTER_TILE_PRIORITY_QUEUE_H_
|
| +#ifndef CC_RESOURCES_RASTER_TILE_PRIORITY_QUEUE_ALL_H_
|
| +#define CC_RESOURCES_RASTER_TILE_PRIORITY_QUEUE_ALL_H_
|
|
|
| #include <set>
|
| #include <utility>
|
| @@ -11,25 +11,19 @@
|
|
|
| #include "cc/base/cc_export.h"
|
| #include "cc/layers/picture_layer_impl.h"
|
| +#include "cc/resources/raster_tile_priority_queue.h"
|
| #include "cc/resources/tile_priority.h"
|
| #include "cc/resources/tiling_set_raster_queue.h"
|
|
|
| namespace cc {
|
|
|
| -// TODO(vmpstr): Consider virtualizing this and adding ::Create with the
|
| -// parameters of ::Build that would create a simpler queue for required only
|
| -// tiles (ie, there's no need for the heap if all we're interested in are the
|
| -// required tiles.
|
| -class CC_EXPORT RasterTilePriorityQueue {
|
| +class CC_EXPORT RasterTilePriorityQueueAll : public RasterTilePriorityQueue {
|
| public:
|
| - enum class Type { ALL, REQUIRED_FOR_ACTIVATION, REQUIRED_FOR_DRAW };
|
| -
|
| class PairedTilingSetQueue {
|
| public:
|
| PairedTilingSetQueue();
|
| PairedTilingSetQueue(const PictureLayerImpl::Pair& layer_pair,
|
| - TreePriority tree_priority,
|
| - Type type);
|
| + TreePriority tree_priority);
|
| ~PairedTilingSetQueue();
|
|
|
| bool IsEmpty() const;
|
| @@ -57,28 +51,28 @@ class CC_EXPORT RasterTilePriorityQueue {
|
| std::set<const Tile*> returned_tiles_for_debug_;
|
| };
|
|
|
| - RasterTilePriorityQueue();
|
| - ~RasterTilePriorityQueue();
|
| -
|
| - void Build(const std::vector<PictureLayerImpl::Pair>& paired_layers,
|
| - TreePriority tree_priority,
|
| - Type type);
|
| - void Reset();
|
| + RasterTilePriorityQueueAll();
|
| + ~RasterTilePriorityQueueAll() override;
|
|
|
| - bool IsEmpty() const;
|
| - Tile* Top();
|
| - void Pop();
|
| + bool IsEmpty() const override;
|
| + Tile* Top() override;
|
| + void Pop() override;
|
|
|
| private:
|
| + friend class RasterTilePriorityQueue;
|
| +
|
| + void Build(const std::vector<PictureLayerImpl::Pair>& paired_layers,
|
| + TreePriority tree_priority);
|
| +
|
| // TODO(vmpstr): This is potentially unnecessary if it becomes the case that
|
| // PairedTilingSetQueue is fast enough to copy. In that case, we can use
|
| // objects directly (ie std::vector<PairedTilingSetQueue>.
|
| ScopedPtrVector<PairedTilingSetQueue> paired_queues_;
|
| TreePriority tree_priority_;
|
|
|
| - DISALLOW_COPY_AND_ASSIGN(RasterTilePriorityQueue);
|
| + DISALLOW_COPY_AND_ASSIGN(RasterTilePriorityQueueAll);
|
| };
|
|
|
| } // namespace cc
|
|
|
| -#endif // CC_RESOURCES_RASTER_TILE_PRIORITY_QUEUE_H_
|
| +#endif // CC_RESOURCES_RASTER_TILE_PRIORITY_QUEUE_ALL_H_
|
|
|