-
Notifications
You must be signed in to change notification settings - Fork 1
/
implicant.cpp
274 lines (236 loc) · 7.25 KB
/
implicant.cpp
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
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
/**
* - * - * - * - * - * - * - * - * - * - * - * - * - * - * - * - * - * -
*
* Name : OpenQM
* Author : Andrea Bontempi
* Description : Logic Network Synthesizer
*
* - * - * - * - * - * - * - * - * - * - * - * - * - * - * - * - * - * -
*
* This file is part of OpenQM.
*
* OpenQM 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 3 of the License, or
* (at your option) any later version.
*
* OpenQM 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 project. If not, see <http://www.gnu.org/licenses/>.
*
* - * - * - * - * - * - * - * - * - * - * - * - * - * - * - * - * - * -
*/
#include <stdexcept>
#include <algorithm>
#include <cstdlib>
#include <sstream>
#include <cmath>
#include "implicant.h"
/**
* @brief Real Constructor
*
* @param other Implicant formatted as string
* @param covr Coverage of implicant (optional)
* @return void
*/
void Implicant::init(const std::string& other, const std::set<int>& covr) {
if(other.find_first_not_of("01-") != std::string::npos) {
throw std::logic_error("'"+other+"' isn't an implicant!");
}
this->implicant_str = other;
this->coverage = covr;
if(covr.size() == 0) {
this->generateCoverage();
}
}
/**
* @brief Generate coverage for new implicant.
*
* @return void
*/
void Implicant::generateCoverage() {
if(this->implicant_str.find_first_of("-") != std::string::npos) {
// Implicant is a reduction of other implicants
for(Implicant other : this->getExplodedList()) {
auto other_cov = other.getCoverage();
std::set_union(this->coverage.begin(), this->coverage.end(), other_cov.begin(), other_cov.end(), std::inserter(this->coverage, this->coverage.begin()));
}
return;
}
int index = 0;
int result = 0;
for(auto i = --this->implicant_str.end(); i >= this->implicant_str.begin(); i--) {
if(*i == '1') {
result += std::pow(2,index);
}
index++;
}
this->coverage = {result};
}
/**
* @brief Generate list of all base implicants (recursive)
* The algorithm use recursion for generate the tree of all possibile implicants.
* @param pos Cursor that indicate the current bit (internal use, don't touch)
* @param step Buffer that save the implicant generated in a branch
* @return std::vector< Implicant, std::allocator< void > >
*/
std::vector<Implicant> Implicant::getExplodedList(int pos, std::string step) {
if(pos > this->implicant_str.size()-1) {
std::vector<Implicant> ret = {step};
return ret;
}
if(this->implicant_str[pos] == '-') {
std::vector<Implicant> a = this->getExplodedList(pos+1, step+'0');
std::vector<Implicant> b = this->getExplodedList(pos+1, step+'1');
std::vector<Implicant> ret;
std::set_union(a.begin(), a.end(), b.begin(), b.end(), std::inserter(ret, ret.begin()));
return ret;
} else {
return this->getExplodedList(pos+1, step+this->implicant_str[pos]);
}
}
/**
* @brief Constructor from std::string
*
* @param other String
* @param covr Coverage
*/
Implicant::Implicant(const std::string& other, const std::set<int>& covr) {
if(other != "") init(other, covr);
}
/**
* @brief Constructor from const char*
*
* @param other_str const char*
* @param covr Coverage
*/
Implicant::Implicant(const char* other_str, const std::set<int>& covr) {
std::string other = other_str;
if(other != "") init(other, covr);
}
/**
* @brief Assignment operator
*
* @param other Implicant&
* @return Implicant&
*/
Implicant& Implicant::operator=(const Implicant& other) {
this->implicant_str = other.implicant_str;
this->coverage = other.coverage;
return *this;
}
/**
* @brief Assignment operator
*
* @param other std::string
* @return Implicant&
*/
Implicant& Implicant::operator=(const std::string& other) {
this->implicant_str = other;
this->coverage = {};
return *this;
}
/**
* @brief Operator that execute the reduction.
*
* @param other Implicant&
* @return Implicant
*/
Implicant Implicant::operator+(const Implicant& other) {
Implicant result("", {});
if(this->implicant_str.size() != other.implicant_str.size()) {
throw std::logic_error("Can't reduce '"+other.implicant_str+"' and '"+this->implicant_str+"', they have different size!");
}
if(abs(this->getOneCount() - other.getOneCount()) > 1) {
return result;
}
std::string new_implicant;
bool found_different = false;
for (int i = 0; i < this->implicant_str.size(); ++i) {
if(this->implicant_str[i] == other.implicant_str[i]) {
new_implicant += this->implicant_str[i];
} else {
if(!found_different && !(this->implicant_str[i] == '-' || other.implicant_str[i] == '-')) {
found_different = true;
new_implicant += '-';
} else {
return result;
}
}
}
result.implicant_str = new_implicant;
std::set_union(this->coverage.begin(), this->coverage.end(), other.coverage.begin(), other.coverage.end(), std::inserter(result.coverage, result.coverage.begin()));
return result;
}
/**
* @brief Equality operator
*
* @param other Implicant&
* @return bool
*/
bool Implicant::operator==(const Implicant& other) const {
return this->implicant_str == other.implicant_str && this->coverage == other.coverage;
}
/**
* @brief Inequality operator
*
* @param other Implicant&
* @return bool
*/
bool Implicant::operator!=(const Implicant& other) const {
return this->implicant_str != other.implicant_str || this->coverage != other.coverage;
}
bool Implicant::operator<(const Implicant& other) const {
return this->implicant_str < other.implicant_str;
}
/**
* @brief Return the numbers of '1' in the implicant
*
* @return int
*/
int Implicant::getOneCount() const {
return std::count(this->implicant_str.begin(), this->implicant_str.end(), '1');
}
/**
* @brief Return the implicant as a string
*
* @return std::string
*/
std::string Implicant::getStr() const {
return this->implicant_str;
}
/**
* @brief Return the coverage as a string
*
* @return std::string
*/
std::string Implicant::getStrCoverage() const {
std::stringstream result;
for(auto i = this->coverage.begin(); i != this->coverage.end(); ++i) {
result << *i;
if(i != --this->coverage.end()) result << ", ";
}
return result.str();
}
/**
* @brief Return the coverage as a set of int
*
* @return std::set< int, std::less, std::allocator< void > >
*/
std::set<int> Implicant::getCoverage() const {
return this->coverage;
}
/**
* @brief Flow operator for print implicant as a string
*
* @param os ostream
* @param other Implicant&
* @return std::ostream&
*/
std::ostream &operator<<(std::ostream &os, const Implicant& other) {
return os << other.getStr();
}