2 ///////////////////////////////////////////////////////////////////////////
3 // This program is free software: you can redistribute it and/or modify //
4 // it under the terms of the version 3 of the GNU General Public License //
5 // as published by the Free Software Foundation. //
7 // This program is distributed in the hope that it will be useful, but //
8 // WITHOUT ANY WARRANTY; without even the implied warranty of //
9 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU //
10 // General Public License for more details. //
12 // You should have received a copy of the GNU General Public License //
13 // along with this program. If not, see <http://www.gnu.org/licenses/>. //
15 // Written by Francois Fleuret, (C) IDIAP //
16 // Contact <francois.fleuret@idiap.ch> for comments & bug reports //
17 ///////////////////////////////////////////////////////////////////////////
19 #include "pose_cell_set.h"
22 PoseCellSet::PoseCellSet() {
24 _max_nb = max_nb_cells;
25 _cells = new PoseCell[_max_nb];
28 PoseCellSet::~PoseCellSet() {
32 void PoseCellSet::erase_content() {
36 PoseCell *PoseCellSet::get_containing_cell(Pose *p) {
37 for(int c = 0; c < _nb_added; c++) {
38 if(_cells[c].contains(p)) return _cells + c;
43 void PoseCellSet::add_cell(PoseCell *cell) {
44 if(_nb_added < _max_nb) {
45 _cells[_nb_added] = *cell;
48 cerr << "Too many pose cells!" << endl;