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 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)->visible()) {
66 if ((*i)->covers (point)) {
67 vitems.push_back (*i);
74 OptimizingLookupTable::OptimizingLookupTable (Group const & group, int items_per_cell)
76 , _items_per_cell (items_per_cell)
79 list<Item*> const & items = _group.items ();
82 int const cells = items.size() / _items_per_cell;
83 /* hence number down each side of the table's square */
84 _dimension = max (1, int (rint (sqrt ((double)cells))));
86 _cells = new Cell*[_dimension];
87 for (int i = 0; i < _dimension; ++i) {
88 _cells[i] = new Cell[_dimension];
91 /* our group's bounding box in its coordinates */
92 boost::optional<Rect> bbox = _group.bounding_box ();
97 _cell_size.x = bbox.get().width() / _dimension;
98 _cell_size.y = bbox.get().height() / _dimension;
99 _offset.x = bbox.get().x0;
100 _offset.y = bbox.get().y0;
102 // cout << "BUILD bbox=" << bbox.get() << ", cellsize=" << _cell_size << ", offset=" << _offset << ", dimension=" << _dimension << "\n";
104 for (list<Item*>::const_iterator i = items.begin(); i != items.end(); ++i) {
106 /* item bbox in its own coordinates */
107 boost::optional<Rect> item_bbox = (*i)->bounding_box ();
112 /* and in the group's coordinates */
113 Rect const item_bbox_in_group = (*i)->item_to_parent (item_bbox.get ());
116 area_to_indices (item_bbox_in_group, x0, y0, x1, y1);
123 //assert (x0 <= _dimension);
124 //assert (y0 <= _dimension);
125 //assert (x1 <= _dimension);
126 //assert (y1 <= _dimension);
128 if (x0 > _dimension) {
129 cout << "WARNING: item outside bbox by " << (item_bbox_in_group.x0 - bbox.get().x0) << "\n";
132 if (x1 > _dimension) {
133 cout << "WARNING: item outside bbox by " << (item_bbox_in_group.x1 - bbox.get().x1) << "\n";
136 if (y0 > _dimension) {
137 cout << "WARNING: item outside bbox by " << (item_bbox_in_group.y0 - bbox.get().y0) << "\n";
140 if (y1 > _dimension) {
141 cout << "WARNING: item outside bbox by " << (item_bbox_in_group.y1 - bbox.get().y1) << "\n";
145 for (int x = x0; x < x1; ++x) {
146 for (int y = y0; y < y1; ++y) {
147 _cells[x][y].push_back (*i);
154 OptimizingLookupTable::area_to_indices (Rect const & area, int& x0, int& y0, int& x1, int& y1) const
156 if (_cell_size.x == 0 || _cell_size.y == 0) {
157 x0 = y0 = x1 = y1 = 0;
161 Rect const offset_area = area.translate (-_offset);
163 x0 = floor (offset_area.x0 / _cell_size.x);
164 y0 = floor (offset_area.y0 / _cell_size.y);
165 x1 = ceil (offset_area.x1 / _cell_size.x);
166 y1 = ceil (offset_area.y1 / _cell_size.y);
169 OptimizingLookupTable::~OptimizingLookupTable ()
171 for (int i = 0; i < _dimension; ++i) {
179 OptimizingLookupTable::point_to_indices (Duple point, int& x, int& y) const
181 if (_cell_size.x == 0 || _cell_size.y == 0) {
186 Duple const offset_point = point - _offset;
188 x = floor (offset_point.x / _cell_size.x);
189 y = floor (offset_point.y / _cell_size.y);
193 OptimizingLookupTable::items_at_point (Duple point) const
197 point_to_indices (point, x, y);
199 if (x >= _dimension) {
200 cout << "WARNING: x=" << x << ", dim=" << _dimension << ", px=" << point.x << " cellsize=" << _cell_size << "\n";
203 if (y >= _dimension) {
204 cout << "WARNING: y=" << y << ", dim=" << _dimension << ", py=" << point.y << " cellsize=" << _cell_size << "\n";
208 x = min (_dimension - 1, x);
209 y = min (_dimension - 1, y);
214 Cell const & cell = _cells[x][y];
216 for (Cell::const_iterator i = cell.begin(); i != cell.end(); ++i) {
217 boost::optional<Rect> const item_bbox = (*i)->bounding_box ();
219 Rect parent_bbox = (*i)->item_to_parent (item_bbox.get ());
220 if (parent_bbox.contains (point)) {
221 items.push_back (*i);
229 /** @param area Area in our owning group's coordinates */
231 OptimizingLookupTable::get (Rect const & area)
235 area_to_indices (area, x0, y0, x1, y1);
238 x0 = min (_dimension - 1, x0);
239 y0 = min (_dimension - 1, y0);
240 x1 = min (_dimension, x1);
241 y1 = min (_dimension, y1);
243 for (int x = x0; x < x1; ++x) {
244 for (int y = y0; y < y1; ++y) {
245 for (Cell::const_iterator i = _cells[x][y].begin(); i != _cells[x][y].end(); ++i) {
246 if (find (items.begin(), items.end(), *i) == items.end ()) {
247 items.push_back (*i);
253 vector<Item*> vitems;
254 copy (items.begin (), items.end (), back_inserter (vitems));