-#include "pbd/xml++.h"
+/*
+ Copyright (C) 2011-2013 Paul Davis
+ Author: Carl Hetherington <cth@carlh.net>
+
+ This program is free software; you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation; either version 2 of the License, or
+ (at your option) any later version.
+
+ This program is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with this program; if not, write to the Free Software
+ Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
+*/
+
+#include <algorithm>
+
#include "canvas/poly_line.h"
+#include "canvas/canvas.h"
+#include "canvas/utils.h"
using namespace ArdourCanvas;
}
}
-
-XMLNode *
-PolyLine::get_state () const
+bool
+PolyLine::covers (Duple const & point) const
{
- XMLNode* node = new XMLNode ("PolyLine");
- add_poly_item_state (node);
- add_outline_state (node);
- return node;
-}
+ Duple p = canvas_to_item (point);
-void
-PolyLine::set_state (XMLNode const * node)
-{
- set_poly_item_state (node);
- set_outline_state (node);
+ const Points::size_type npoints = _points.size();
+
+ if (npoints < 2) {
+ return false;
+ }
+
+ Points::size_type i;
+ Points::size_type j;
+
+ /* repeat for each line segment */
+
+ const Rect visible (_canvas->visible_area());
+ static const double threshold = 2.0;
+
+ for (i = 1, j = 0; i < npoints; ++i, ++j) {
+
+ Duple at;
+ double t;
+ Duple a (_points[j]);
+ Duple b (_points[i]);
+
+ /*
+ Clamp the line endpoints to the visible area of the canvas. If we do
+ not do this, we may have a line segment extending to COORD_MAX and our
+ math goes wrong.
+ */
+
+ a.x = std::min (a.x, visible.x1);
+ a.y = std::min (a.y, visible.y1);
+ b.x = std::min (b.x, visible.x1);
+ b.y = std::min (b.y, visible.y1);
+
+ double d = distance_to_segment_squared (p, a, b, t, at);
+
+ if (t < 0.0 || t > 1.0) {
+ return false;
+ }
+
+ if (d < threshold) {
+ return true;
+ }
+
+ }
+
+ return false;
}