Chromium Code Reviews| OLD | NEW |
|---|---|
| 1 // Copyright (c) 2012 The Chromium Authors. All rights reserved. | 1 // Copyright (c) 2012 The Chromium Authors. All rights reserved. |
| 2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
| 3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
| 4 | 4 |
| 5 #include "ui/gfx/range/range.h" | 5 #include "ui/gfx/range/range.h" |
| 6 | 6 |
| 7 #include <algorithm> | 7 #include <algorithm> |
| 8 #include <limits> | 8 #include <limits> |
| 9 | 9 |
| 10 #include "base/format_macros.h" | 10 #include "base/format_macros.h" |
|
Robert Sesek
2016/02/08 17:41:07
Unused now that PRIuS is gone.
jam
2016/02/08 17:56:29
Done.
| |
| 11 #include "base/logging.h" | 11 #include "base/logging.h" |
| 12 #include "base/strings/stringprintf.h" | 12 #include "base/strings/stringprintf.h" |
| 13 | 13 |
| 14 namespace gfx { | 14 namespace gfx { |
| 15 | 15 |
| 16 Range::Range() | 16 Range::Range() |
| 17 : start_(0), | 17 : start_(0), |
| 18 end_(0) { | 18 end_(0) { |
| 19 } | 19 } |
| 20 | 20 |
| 21 Range::Range(size_t start, size_t end) | 21 Range::Range(uint32_t start, uint32_t end) |
| 22 : start_(start), | 22 : start_(start), |
| 23 end_(end) { | 23 end_(end) { |
| 24 } | 24 } |
| 25 | 25 |
| 26 Range::Range(size_t position) | 26 Range::Range(uint32_t position) |
| 27 : start_(position), | 27 : start_(position), |
| 28 end_(position) { | 28 end_(position) { |
| 29 } | 29 } |
| 30 | 30 |
| 31 // static | 31 // static |
| 32 const Range Range::InvalidRange() { | 32 const Range Range::InvalidRange() { |
| 33 return Range(std::numeric_limits<size_t>::max()); | 33 return Range(std::numeric_limits<uint32_t>::max()); |
| 34 } | 34 } |
| 35 | 35 |
| 36 bool Range::IsValid() const { | 36 bool Range::IsValid() const { |
| 37 return *this != InvalidRange(); | 37 return *this != InvalidRange(); |
| 38 } | 38 } |
| 39 | 39 |
| 40 size_t Range::GetMin() const { | 40 uint32_t Range::GetMin() const { |
| 41 return std::min(start(), end()); | 41 return std::min(start(), end()); |
| 42 } | 42 } |
| 43 | 43 |
| 44 size_t Range::GetMax() const { | 44 uint32_t Range::GetMax() const { |
| 45 return std::max(start(), end()); | 45 return std::max(start(), end()); |
| 46 } | 46 } |
| 47 | 47 |
| 48 bool Range::operator==(const Range& other) const { | 48 bool Range::operator==(const Range& other) const { |
| 49 return start() == other.start() && end() == other.end(); | 49 return start() == other.start() && end() == other.end(); |
| 50 } | 50 } |
| 51 | 51 |
| 52 bool Range::operator!=(const Range& other) const { | 52 bool Range::operator!=(const Range& other) const { |
| 53 return !(*this == other); | 53 return !(*this == other); |
| 54 } | 54 } |
| 55 | 55 |
| 56 bool Range::EqualsIgnoringDirection(const Range& other) const { | 56 bool Range::EqualsIgnoringDirection(const Range& other) const { |
| 57 return GetMin() == other.GetMin() && GetMax() == other.GetMax(); | 57 return GetMin() == other.GetMin() && GetMax() == other.GetMax(); |
| 58 } | 58 } |
| 59 | 59 |
| 60 bool Range::Intersects(const Range& range) const { | 60 bool Range::Intersects(const Range& range) const { |
| 61 return IsValid() && range.IsValid() && | 61 return IsValid() && range.IsValid() && |
| 62 !(range.GetMax() < GetMin() || range.GetMin() >= GetMax()); | 62 !(range.GetMax() < GetMin() || range.GetMin() >= GetMax()); |
| 63 } | 63 } |
| 64 | 64 |
| 65 bool Range::Contains(const Range& range) const { | 65 bool Range::Contains(const Range& range) const { |
| 66 return IsValid() && range.IsValid() && | 66 return IsValid() && range.IsValid() && |
| 67 GetMin() <= range.GetMin() && range.GetMax() <= GetMax(); | 67 GetMin() <= range.GetMin() && range.GetMax() <= GetMax(); |
| 68 } | 68 } |
| 69 | 69 |
| 70 Range Range::Intersect(const Range& range) const { | 70 Range Range::Intersect(const Range& range) const { |
| 71 size_t min = std::max(GetMin(), range.GetMin()); | 71 uint32_t min = std::max(GetMin(), range.GetMin()); |
| 72 size_t max = std::min(GetMax(), range.GetMax()); | 72 uint32_t max = std::min(GetMax(), range.GetMax()); |
| 73 | 73 |
| 74 if (min >= max) // No intersection. | 74 if (min >= max) // No intersection. |
| 75 return InvalidRange(); | 75 return InvalidRange(); |
| 76 | 76 |
| 77 return Range(min, max); | 77 return Range(min, max); |
| 78 } | 78 } |
| 79 | 79 |
| 80 std::string Range::ToString() const { | 80 std::string Range::ToString() const { |
| 81 return base::StringPrintf("{%" PRIuS ",%" PRIuS "}", start(), end()); | 81 return base::StringPrintf("{%d,%d}", start(), end()); |
| 82 } | 82 } |
| 83 | 83 |
| 84 std::ostream& operator<<(std::ostream& os, const Range& range) { | 84 std::ostream& operator<<(std::ostream& os, const Range& range) { |
| 85 return os << range.ToString(); | 85 return os << range.ToString(); |
| 86 } | 86 } |
| 87 | 87 |
| 88 } // namespace gfx | 88 } // namespace gfx |
| OLD | NEW |