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
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
|
/* Frobby: Software for monomial ideal computations.
Copyright (C) 2007 Bjarke Hammersholt Roune (www.broune.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, see http://www.gnu.org/licenses/.
*/
#include "stdinc.h"
#include "VarNames.h"
#include "error.h"
#include "FrobbyStringStream.h"
#include <limits>
VarNames::VarNames() {
}
VarNames::VarNames(size_t varCount) {
for (size_t i = 0; i < varCount; ++i) {
FrobbyStringStream out;
out << 'x' << (i + 1);
addVar(out);
}
}
VarNames::VarNames(const VarNames& names) {
*this = names;
}
VarNames::~VarNames() {
clear();
}
bool VarNames::addVar(const string& name) {
ASSERT(name != "");
pair<VarNameMap::iterator, bool> p =_nameToIndex.insert
(make_pair(name, _indexToName.size()));
if (!p.second) {
ASSERT(contains(name));
return false;
}
try {
_indexToName.push_back(&(p.first->first)); // TODO: fix to vector of iters
} catch (...) {
_nameToIndex.erase(p.first);
throw;
}
if (getVarCount() == invalidIndex)
reportError("Too many variable names");
ASSERT(contains(name));
return true;
}
void VarNames::addVarSyntaxCheckUnique(const Scanner& in,
const string& name) {
if (!addVar(name))
reportSyntaxError(in, "The variable " + name + " is declared twice.");
ASSERT(contains(name));
}
bool VarNames::operator<(const VarNames& names) const {
return lexicographical_compare(_indexToName.begin(),
_indexToName.end(),
names._indexToName.begin(),
names._indexToName.end(),
compareNames);
}
size_t VarNames::getIndex(const string& name) const {
VarNameMap::const_iterator it = _nameToIndex.find(name);
if (it == _nameToIndex.end())
return invalidIndex;
else
return it->second;
}
bool VarNames::contains(const string& name) const {
return getIndex(name) != invalidIndex;
}
bool VarNames::namesAreDefault() const {
VarNames names(getVarCount());
return *this == names;
}
const string& VarNames::getName(size_t index) const {
ASSERT(index < _indexToName.size());
return *(_indexToName[index]);
}
void VarNames::clear() {
_nameToIndex.clear();
_indexToName.clear();
}
bool VarNames::empty() const {
return _indexToName.empty();
}
VarNames& VarNames::operator=(const VarNames& names) {
if (this != &names) {
clear();
_indexToName.reserve(names.getVarCount());
for (size_t var = 0; var < names.getVarCount(); ++var)
addVar(names.getName(var));
}
return *this;
}
bool VarNames::operator==(const VarNames& names) const {
if (getVarCount() != names.getVarCount())
return false;
for (size_t var = 0; var < getVarCount(); ++var)
if (getName(var) != names.getName(var))
return false;
return true;
}
bool VarNames::operator!=(const VarNames& names) const {
return !operator==(names);
}
void VarNames::swapVariables(size_t a, size_t b) {
ASSERT(a < getVarCount());
ASSERT(b < getVarCount());
ASSERT(_nameToIndex[*_indexToName[a]] == a);
ASSERT(_nameToIndex[*_indexToName[b]] == b);
if (a == b)
return;
std::swap(_indexToName[a], _indexToName[b]);
_nameToIndex[*_indexToName[a]] = a;
_nameToIndex[*_indexToName[b]] = b;
ASSERT(_nameToIndex[*_indexToName[a]] == a);
ASSERT(_nameToIndex[*_indexToName[b]] == b);
}
void VarNames::projectVar(size_t index) {
ASSERT(index < getVarCount());
VarNames names;
for (size_t var = 0; var < getVarCount(); ++var)
if (var != index)
names.addVar(getName(var));
*this = names;
}
void VarNames::toString(string& str) const {
str.clear();
for (size_t i = 0; i < getVarCount(); ++i) {
if (i != 0)
str += ", ";
str += getName(i);
}
}
void VarNames::print(FILE* file) const {
fputs("VarNames(", file);
for (size_t i = 0; i < getVarCount(); ++i) {
if (i != 0)
fputs(", ", file);
fprintf(file, "%lu<->\"%s\"", (unsigned long)i, getName(i).c_str());
}
fputs(")\n", file);
}
void VarNames::swap(VarNames& names) {
_indexToName.swap(names._indexToName);
_nameToIndex.swap(names._nameToIndex);
}
bool VarNames::compareNames(const string* a, const string* b) {
return *a < *b;
}
|
