cc: Implement tile iteration order based on pyramid sequence. [old]

cc/base/reverse_spiral_iterator.cc

 // Copyright 2016 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.
 
 #include "cc/base/reverse_spiral_iterator.h"
 
 #include <algorithm>
 
 namespace cc {
 
@@ skipping 59 matching lines @@
       around_index_rect_.num_indices_x() + 2 * max_distance;
 
   // Start with one to the right of the padded around rect.
   index_x_ = around_index_rect_.right() + max_distance + 1;
   index_y_ = around_index_rect_.bottom() + max_distance;
 
   // The current index is outside a valid tile, so advance immediately.
   ++(*this);
 }
 
+ReverseSpiralIterator::ReverseSpiralIterator(
+    const ReverseSpiralIterator& other) = default;
+
+ReverseSpiralIterator::ReverseSpiralIterator(ReverseSpiralIterator&& other) =
+    default;
+
+ReverseSpiralIterator::~ReverseSpiralIterator() = default;
+
+ReverseSpiralIterator& ReverseSpiralIterator::operator=(
+    const ReverseSpiralIterator& other) = default;
+
+ReverseSpiralIterator& ReverseSpiralIterator::operator=(
+    ReverseSpiralIterator&& other) = default;
+
 ReverseSpiralIterator::operator bool() const {
   return index_x_ != -1 && index_y_ != -1;
 }
 
 ReverseSpiralIterator& ReverseSpiralIterator::operator++() {
   while (!around_index_rect_.Contains(index_x_, index_y_)) {
     if (needs_direction_switch())
       switch_direction();
 
     index_x_ += delta_x_;
@@ skipping 102 matching lines @@
 
     // We should always end up in an around rect at some point.
     // Since the direction is now vertical, we have to ensure that we will
     // advance.
     DCHECK_GE(horizontal_step_count_, 1);
     DCHECK_GE(vertical_step_count_, 1);
   }
 }
 
 }  // namespace cc