2 Copyright (C) 2011-2013 Paul Davis
3 Author: Carl Hetherington <cth@carlh.net>
5 This program is free software; you can redistribute it and/or modify
6 it under the terms of the GNU General Public License as published by
7 the Free Software Foundation; either version 2 of the License, or
8 (at your option) any later version.
10 This program is distributed in the hope that it will be useful,
11 but WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 GNU General Public License for more details.
15 You should have received a copy of the GNU General Public License
16 along with this program; if not, write to the Free Software
17 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
20 #include "canvas/lookup_table.h"
21 #include "canvas/group.h"
24 using namespace ArdourCanvas;
26 LookupTable::LookupTable (Group const & group)
32 LookupTable::~LookupTable ()
37 DumbLookupTable::DumbLookupTable (Group const & group)
44 DumbLookupTable::get (Rect const &)
46 list<Item *> const & items = _group.items ();
47 vector<Item *> vitems;
48 copy (items.begin(), items.end(), back_inserter (vitems));
53 DumbLookupTable::items_at_point (Duple const & point) const
55 /* Point is in canvas coordinate system */
57 list<Item *> const & items (_group.items ());
58 vector<Item *> vitems;
60 for (list<Item *>::const_iterator i = items.begin(); i != items.end(); ++i) {
62 if ((*i)->covers (point)) {
63 // std::cerr << "\t\t" << (*i)->whatami() << '/' << (*i)->name << " covers " << point << std::endl;
64 vitems.push_back (*i);
72 DumbLookupTable::has_item_at_point (Duple const & point) const
74 /* Point is in canvas coordinate system */
76 list<Item *> const & items (_group.items ());
77 vector<Item *> vitems;
79 for (list<Item *>::const_iterator i = items.begin(); i != items.end(); ++i) {
81 if (!(*i)->visible()) {
85 if ((*i)->covers (point)) {
86 // std::cerr << "\t\t" << (*i)->whatami() << '/' << (*i)->name << " covers " << point << std::endl;
95 OptimizingLookupTable::OptimizingLookupTable (Group const & group, int items_per_cell)
97 , _items_per_cell (items_per_cell)
100 list<Item*> const & items = _group.items ();
102 /* number of cells */
103 int const cells = items.size() / _items_per_cell;
104 /* hence number down each side of the table's square */
105 _dimension = max (1, int (rint (sqrt ((double)cells))));
107 _cells = new Cell*[_dimension];
108 for (int i = 0; i < _dimension; ++i) {
109 _cells[i] = new Cell[_dimension];
112 /* our group's bounding box in its coordinates */
113 boost::optional<Rect> bbox = _group.bounding_box ();
118 _cell_size.x = bbox.get().width() / _dimension;
119 _cell_size.y = bbox.get().height() / _dimension;
120 _offset.x = bbox.get().x0;
121 _offset.y = bbox.get().y0;
123 // cout << "BUILD bbox=" << bbox.get() << ", cellsize=" << _cell_size << ", offset=" << _offset << ", dimension=" << _dimension << "\n";
125 for (list<Item*>::const_iterator i = items.begin(); i != items.end(); ++i) {
127 /* item bbox in its own coordinates */
128 boost::optional<Rect> item_bbox = (*i)->bounding_box ();
133 /* and in the group's coordinates */
134 Rect const item_bbox_in_group = (*i)->item_to_parent (item_bbox.get ());
137 area_to_indices (item_bbox_in_group, x0, y0, x1, y1);
144 //assert (x0 <= _dimension);
145 //assert (y0 <= _dimension);
146 //assert (x1 <= _dimension);
147 //assert (y1 <= _dimension);
149 if (x0 > _dimension) {
150 cout << "WARNING: item outside bbox by " << (item_bbox_in_group.x0 - bbox.get().x0) << "\n";
153 if (x1 > _dimension) {
154 cout << "WARNING: item outside bbox by " << (item_bbox_in_group.x1 - bbox.get().x1) << "\n";
157 if (y0 > _dimension) {
158 cout << "WARNING: item outside bbox by " << (item_bbox_in_group.y0 - bbox.get().y0) << "\n";
161 if (y1 > _dimension) {
162 cout << "WARNING: item outside bbox by " << (item_bbox_in_group.y1 - bbox.get().y1) << "\n";
166 for (int x = x0; x < x1; ++x) {
167 for (int y = y0; y < y1; ++y) {
168 _cells[x][y].push_back (*i);
175 OptimizingLookupTable::area_to_indices (Rect const & area, int& x0, int& y0, int& x1, int& y1) const
177 if (_cell_size.x == 0 || _cell_size.y == 0) {
178 x0 = y0 = x1 = y1 = 0;
182 Rect const offset_area = area.translate (-_offset);
184 x0 = floor (offset_area.x0 / _cell_size.x);
185 y0 = floor (offset_area.y0 / _cell_size.y);
186 x1 = ceil (offset_area.x1 / _cell_size.x);
187 y1 = ceil (offset_area.y1 / _cell_size.y);
190 OptimizingLookupTable::~OptimizingLookupTable ()
192 for (int i = 0; i < _dimension; ++i) {
200 OptimizingLookupTable::point_to_indices (Duple point, int& x, int& y) const
202 if (_cell_size.x == 0 || _cell_size.y == 0) {
207 Duple const offset_point = point - _offset;
209 x = floor (offset_point.x / _cell_size.x);
210 y = floor (offset_point.y / _cell_size.y);
214 OptimizingLookupTable::items_at_point (Duple const & point) const
218 point_to_indices (point, x, y);
220 if (x >= _dimension) {
221 cout << "WARNING: x=" << x << ", dim=" << _dimension << ", px=" << point.x << " cellsize=" << _cell_size << "\n";
224 if (y >= _dimension) {
225 cout << "WARNING: y=" << y << ", dim=" << _dimension << ", py=" << point.y << " cellsize=" << _cell_size << "\n";
229 x = min (_dimension - 1, x);
230 y = min (_dimension - 1, y);
235 Cell const & cell = _cells[x][y];
237 for (Cell::const_iterator i = cell.begin(); i != cell.end(); ++i) {
238 boost::optional<Rect> const item_bbox = (*i)->bounding_box ();
240 Rect parent_bbox = (*i)->item_to_parent (item_bbox.get ());
241 if (parent_bbox.contains (point)) {
242 items.push_back (*i);
251 OptimizingLookupTable::has_item_at_point (Duple const & point) const
255 point_to_indices (point, x, y);
257 if (x >= _dimension) {
258 cout << "WARNING: x=" << x << ", dim=" << _dimension << ", px=" << point.x << " cellsize=" << _cell_size << "\n";
261 if (y >= _dimension) {
262 cout << "WARNING: y=" << y << ", dim=" << _dimension << ", py=" << point.y << " cellsize=" << _cell_size << "\n";
266 x = min (_dimension - 1, x);
267 y = min (_dimension - 1, y);
272 Cell const & cell = _cells[x][y];
274 for (Cell::const_iterator i = cell.begin(); i != cell.end(); ++i) {
275 boost::optional<Rect> const item_bbox = (*i)->bounding_box ();
277 Rect parent_bbox = (*i)->item_to_parent (item_bbox.get ());
278 if (parent_bbox.contains (point)) {
287 /** @param area Area in our owning group's coordinates */
289 OptimizingLookupTable::get (Rect const & area)
293 area_to_indices (area, x0, y0, x1, y1);
296 x0 = min (_dimension - 1, x0);
297 y0 = min (_dimension - 1, y0);
298 x1 = min (_dimension, x1);
299 y1 = min (_dimension, y1);
301 for (int x = x0; x < x1; ++x) {
302 for (int y = y0; y < y1; ++y) {
303 for (Cell::const_iterator i = _cells[x][y].begin(); i != _cells[x][y].end(); ++i) {
304 if (find (items.begin(), items.end(), *i) == items.end ()) {
305 items.push_back (*i);
311 vector<Item*> vitems;
312 copy (items.begin (), items.end (), back_inserter (vitems));