[#2] Pass gfx structs by const ref (gfx::Rect, gfx::RectF)

cc/base/region.cc

 // Copyright (c) 2012 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/region.h"
 #include "base/values.h"
 
 namespace cc {
 
 Region::Region() {
 }
 
 Region::Region(const Region& region)
     : skregion_(region.skregion_) {
 }
 
-Region::Region(gfx::Rect rect)
+Region::Region(const gfx::Rect& rect)
     : skregion_(gfx::RectToSkIRect(rect)) {
 }
 
 Region::~Region() {
 }
 
-const Region& Region::operator=(gfx::Rect rect) {
+const Region& Region::operator=(const gfx::Rect& rect) {
   skregion_ = SkRegion(gfx::RectToSkIRect(rect));
   return *this;
 }
 
 const Region& Region::operator=(const Region& region) {
   skregion_ = region.skregion_;
   return *this;
 }
 
 void Region::Swap(Region* region) {
   region->skregion_.swap(skregion_);
 }
 
 void Region::Clear() {
   skregion_.setEmpty();
 }
 
 bool Region::IsEmpty() const {
   return skregion_.isEmpty();
 }
 
 int Region::GetRegionComplexity() const {
   return skregion_.computeRegionComplexity();
 }
 
 bool Region::Contains(gfx::Point point) const {
   return skregion_.contains(point.x(), point.y());
 }
 
-bool Region::Contains(gfx::Rect rect) const {
+bool Region::Contains(const gfx::Rect& rect) const {
   if (rect.IsEmpty())
     return true;
   return skregion_.contains(gfx::RectToSkIRect(rect));
 }
 
 bool Region::Contains(const Region& region) const {
   if (region.IsEmpty())
     return true;
   return skregion_.contains(region.skregion_);
 }
 
-bool Region::Intersects(gfx::Rect rect) const {
+bool Region::Intersects(const gfx::Rect& rect) const {
   return skregion_.intersects(gfx::RectToSkIRect(rect));
 }
 
 bool Region::Intersects(const Region& region) const {
   return skregion_.intersects(region.skregion_);
 }
 
-void Region::Subtract(gfx::Rect rect) {
+void Region::Subtract(const gfx::Rect& rect) {
   skregion_.op(gfx::RectToSkIRect(rect), SkRegion::kDifference_Op);
 }
 
 void Region::Subtract(const Region& region) {
   skregion_.op(region.skregion_, SkRegion::kDifference_Op);
 }
 
-void Region::Union(gfx::Rect rect) {
+void Region::Union(const gfx::Rect& rect) {
   skregion_.op(gfx::RectToSkIRect(rect), SkRegion::kUnion_Op);
 }
 
 void Region::Union(const Region& region) {
   skregion_.op(region.skregion_, SkRegion::kUnion_Op);
 }
 
-void Region::Intersect(gfx::Rect rect) {
+void Region::Intersect(const gfx::Rect& rect) {
   skregion_.op(gfx::RectToSkIRect(rect), SkRegion::kIntersect_Op);
 }
 
 void Region::Intersect(const Region& region) {
   skregion_.op(region.skregion_, SkRegion::kIntersect_Op);
 }
 
 std::string Region::ToString() const {
   if (IsEmpty())
     return gfx::Rect().ToString();
@@ skipping 23 matching lines @@
 }
 
 Region::Iterator::Iterator(const Region& region)
     : it_(region.skregion_) {
 }
 
 Region::Iterator::~Iterator() {
 }
 
 }  // namespace cc