Chromium Code Reviews| Index: ash/common/system/chromeos/palette/tools/laser_pointer_points.cc |
| diff --git a/ash/common/system/chromeos/palette/tools/laser_pointer_points.cc b/ash/common/system/chromeos/palette/tools/laser_pointer_points.cc |
| new file mode 100644 |
| index 0000000000000000000000000000000000000000..45de0873b37928cde9f10c949ff01b8acc237f3d |
| --- /dev/null |
| +++ b/ash/common/system/chromeos/palette/tools/laser_pointer_points.cc |
| @@ -0,0 +1,81 @@ |
| +// 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 "ash/common/system/chromeos/palette/tools/laser_pointer_points.h" |
| + |
| +#include <algorithm> |
| +#include <limits> |
| + |
| +namespace ash { |
| + |
| +LaserPointerPoints::LaserPointerPoints(base::TimeDelta life_duration) |
| + : life_duration_(life_duration) {} |
| + |
| +LaserPointerPoints::~LaserPointerPoints() {} |
| + |
| +void LaserPointerPoints::AddPoint(const gfx::Point& point) { |
| + LaserPoint new_point; |
| + new_point.location = point; |
| + new_point.creation_time = base::Time::Now(); |
| + points_.push_back(new_point); |
| + ClearOldPoints(); |
| +} |
| + |
| +void LaserPointerPoints::Clear() { |
| + points_.clear(); |
| +} |
| + |
| +gfx::Rect LaserPointerPoints::GetBoundingBox() { |
| + gfx::Point min_point(std::numeric_limits<int>::max(), |
| + std::numeric_limits<int>::max()); |
| + gfx::Point max_point(std::numeric_limits<int>::min(), |
| + std::numeric_limits<int>::min()); |
| + for (const LaserPoint& point : points_) { |
| + min_point = gfx::Point(std::min(point.location.x(), min_point.x()), |
| + std::min(point.location.y(), min_point.y())); |
| + max_point = gfx::Point(std::max(point.location.x(), max_point.x()), |
| + std::max(point.location.y(), max_point.y())); |
| + } |
| + return gfx::BoundingRect(min_point, max_point); |
| +} |
| + |
| +LaserPointerPoints::LaserPoint LaserPointerPoints::GetOldest() const { |
| + DCHECK(!IsEmpty()); |
| + return points_.front(); |
| +} |
| + |
| +LaserPointerPoints::LaserPoint LaserPointerPoints::GetNewest() const { |
| + DCHECK(!IsEmpty()); |
| + return points_.back(); |
| +} |
| + |
| +bool LaserPointerPoints::IsEmpty() const { |
| + return points_.empty(); |
| +} |
| + |
| +int LaserPointerPoints::GetNumberOfPoints() const { |
| + return points_.size(); |
| +} |
| + |
| +std::deque<LaserPointerPoints::LaserPoint>::const_iterator |
| +LaserPointerPoints::PointsStart() const { |
| + return points_.cbegin(); |
| +} |
| + |
| +std::deque<LaserPointerPoints::LaserPoint>::const_iterator |
| +LaserPointerPoints::PointsEnd() const { |
| + return points_.cend(); |
| +} |
| + |
| +void LaserPointerPoints::ClearOldPoints() { |
| + DCHECK(!IsEmpty()); |
| + LaserPoint newest = points_.back(); |
| + base::TimeDelta life_duration = life_duration_; |
| + auto first_alive_point = std::find_if( |
| + points_.begin(), points_.end(), [&newest, &life_duration](LaserPoint& p) { |
|
jdufault
2016/08/22 18:37:36
Can you capture [this] and use points_.back() and
sammiequon
2016/08/23 00:20:33
Done.
|
| + return newest.creation_time - p.creation_time < life_duration; |
| + }); |
| + points_.erase(points_.begin(), first_alive_point); |
| +} |
| +} // namespace ash |