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
|
/***************************************************************************
* 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. *
***************************************************************************/
#ifndef SPLITSET_H
#define SPLITSET_H
#include <vector>
#include "split.h"
/**
Vector of Splits
@author BUI Quang Minh, Steffen Klaere, Arndt von Haeseler
*/
class SplitSet : public vector<Split*>
{
public:
SplitSet();
/**
release the memory of all element splits, then resize to 0
*/
void removeAll();
/**
get the weight of the first split in the vector
*/
double getWeight();
/**
check the compatibility of sp against all splits in this set
@param sp the target split
@return TRUE if sp is compatible with all splits here, otherwise FALSE
*/
bool compatible(Split *sp);
virtual ~SplitSet();
};
#endif
|
