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
62
63
64
65
66
67
68
69
70
71
72
73
|
/***************************************************************************
* Copyright (C) 2006 by BUI Quang Minh, Steffen Klaere, Arndt von Haeseler *
* minh.bui@univie.ac.at *
* *
* 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 "hashsplitset.h"
#include "splitgraph.h"
Split *SplitIntMap::findSplit(Split *sp) {
iterator ass_it = find(sp);
if (ass_it != end()) {
return ass_it->first;
}
return NULL;
}
Split *SplitIntMap::findSplit(Split *sp, int &value) {
iterator ass_it = find(sp);
if (ass_it != end()) {
value = ass_it->second;
return ass_it->first;
}
value = 0;
return NULL;
}
int SplitIntMap::getValue(Split *sp) {
int value;
Split* findsp = findSplit(sp, value);
ASSERT(findsp);
return value;
}
void SplitIntMap::setValue(Split *sp, int value) {
ASSERT(findSplit(sp));
(*this)[sp] = value;
}
void SplitIntMap::eraseSplit(Split *sp) {
ASSERT(findSplit(sp));
erase(sp);
}
void SplitIntMap::insertSplit(Split *sp, int value) {
ASSERT(!findSplit(sp));
if (verbose_mode >= VB_MAX) sp->report(cout);
(*this)[sp] = value;
}
void SplitIntMap::buildMap(SplitGraph &sg, bool use_index) {
clear();
for (int i = 0; i < sg.size(); i++) {
if (use_index)
insertSplit(sg[i], i);
else
insertSplit(sg[i], sg[i]->getWeight());
}
}
|
