1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
|
/***************************************************************************
* Copyright (C) 2009-2015 by *
* BUI Quang Minh <minh.bui@univie.ac.at> *
* Lam-Tung Nguyen <nltung@gmail.com> *
* *
* *
* 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., *
* 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. *
***************************************************************************/
#include "splitset.h"
SplitSet::SplitSet()
: vector<Split*>()
{
}
double SplitSet::getWeight() {
if (empty())
return 0;
//assert(!empty());
return (*begin())->getWeight();
}
/**
release the memory of all element splits, then resize to 0
*/
void SplitSet::removeAll() {
for (reverse_iterator it = rbegin(); it != rend(); it++)
if (*it) delete *it;
clear();
}
bool SplitSet::compatible(Split *sp) {
for (iterator it = begin(); it != end(); it++)
if (!(*it)->compatible(*sp))
return false;
return true;
}
SplitSet::~SplitSet()
{
removeAll();
//cout << "deleted" << endl;
}
|
