X-Git-Url: https://main.carlh.net/gitweb/?a=blobdiff_plain;f=libs%2Fcanvas%2Fpolygon.cc;h=3c6d5d51a2d155b83e2931e57ad7dbfdcbc60ecb;hb=af30a6f001f0758155b3ece040fc2baa643a29de;hp=1103cedbeea045861cb16ef3e5fa03c09efffd65;hpb=7a30e63eaad66ded1c47f5cdb2e0f28c3b0a1d4a;p=ardour.git diff --git a/libs/canvas/polygon.cc b/libs/canvas/polygon.cc index 1103cedbee..3c6d5d51a2 100644 --- a/libs/canvas/polygon.cc +++ b/libs/canvas/polygon.cc @@ -1,48 +1,69 @@ /* - Copyright (C) 2011-2013 Paul Davis - Author: Carl Hetherington - - 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. -*/ + * Copyright (C) 2012 Carl Hetherington + * Copyright (C) 2013-2015 Paul Davis + * + * 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., + * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. + */ #include "canvas/polygon.h" using namespace ArdourCanvas; -Polygon::Polygon (Group* parent) - : Item (parent) - , PolyItem (parent) - , Fill (parent) +Polygon::Polygon (Canvas* c) + : PolyItem (c) + , multiple (0) + , constant (0) + , cached_size (0) +{ +} + +Polygon::Polygon (Item* parent) + : PolyItem (parent) + , multiple (0) + , constant (0) + , cached_size (0) { +} +Polygon::~Polygon () +{ + delete [] multiple; + delete [] constant; } void Polygon::render (Rect const & area, Cairo::RefPtr context) const { - if (_outline) { - setup_outline_context (context); + if (_outline || _fill) { render_path (area, context); - + if (!_points.empty ()) { /* close path */ Duple p = item_to_window (Duple (_points.front().x, _points.front().y)); - context->move_to (p.x, p.y); + context->line_to (p.x, p.y); } - context->stroke_preserve (); + } + + if (_outline) { + setup_outline_context (context); + if (_fill) { + context->stroke_preserve (); + } else { + context->stroke (); + } } if (_fill) { @@ -51,3 +72,72 @@ Polygon::render (Rect const & area, Cairo::RefPtr context) const } } +void +Polygon::cache_shape_computation () const +{ + Points::size_type npoints = _points.size(); + + if (npoints == 0) { + return; + } + + Points::size_type i; + Points::size_type j = npoints -1; + + if (cached_size < npoints) { + cached_size = npoints; + delete [] multiple; + multiple = new float[cached_size]; + delete [] constant; + constant = new float[cached_size]; + } + + for (i = 0; i < npoints; i++) { + if (_points[j].y == _points[i].y) { + constant[i] = _points[i].x; + multiple[i] = 0; + } else { + constant[i] = _points[i].x-(_points[i].y*_points[j].x)/(_points[j].y-_points[i].y)+(_points[i].y*_points[i].x)/(_points[j].y-_points[i].y); + multiple[i] = (_points[j].x-_points[i].x)/(_points[j].y-_points[i].y); + } + + j = i; + } +} + +bool +Polygon::covers (Duple const & point) const +{ + Duple p = window_to_item (point); + + Points::size_type npoints = _points.size(); + + if (npoints == 0) { + return false; + } + + Points::size_type i; + Points::size_type j = npoints -1; + bool oddNodes = false; + + if (_bounding_box_dirty) { + compute_bounding_box (); + } + + for (i = 0; i < npoints; i++) { + if (((_points[i].y < p.y && _points[j].y >= p.y) || (_points[j].y < p.y && _points[i].y >= p.y))) { + oddNodes ^= (p.y * multiple[i] + constant[i] < p.x); + } + j = i; + } + + return oddNodes; +} + +void +Polygon::compute_bounding_box () const +{ + PolyItem::compute_bounding_box (); + cache_shape_computation (); +} +