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
|
/* QMC: simplification tool (by using the Quine - McClusky process)
Copyright (C) 2000 Thomas Pollak
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 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., 675 Mass Ave, Cambridge, MA 02139, USA.
Auf Deutsch:
QMC: Vereinfachungsprogramm fuer logische Terme nach Quine - McClusky
Copyright (C) 2000 Thomas Pollak
Dieses Programm ist freie Software. Sie koennen es unter
den Bedingungen der GNU General Public License, wie von der
Free Software Foundation herausgegeben, weitergeben und/oder
modifizieren, entweder unter Version 2 der Lizenz oder
jeder spaeteren Version.
Die Veroeffentlichung dieses Programms erfolgt in der
Hoffnung, dass es Ihnen von Nutzen sein wird, aber OHNE JEDE
GEWAEHRLEISTUNG - sogar ohne die implizite Gewaehrleistung
der MARKTREIFE oder der EIGNUNG FUER EINEN BESTIMMTEN ZWECK.
Details finden Sie in der GNU General Public License.
Sie sollten eine Kopie der GNU General Public License zusammen
mit diesem Programm erhalten haben. Falls nicht, schreiben Sie
an die Free Software Foundation, Inc., 675 Mass Ave, Cambridge,
MA 02139, USA.
*/
/*
file: createmin.cc
begin: 03/2000
email: thomas@pollaknet.at
web: http://qmc.pollaknet.at
*/
//Headers
#include <cqmc>
//Debug - Switch
//#define DEBUG
//#define DEBUG2
#ifdef DEBUG
#include <iostream>
#endif
using namespace std;
/*
create simple expresion (the result)
*/
void create_result(BOOL *BO_var,
BOOL *lh,
unsigned char num_vars,
unsigned short high,
char *buffer,
bool optimize,
unsigned short int options)
{
//local variables
bool expr;
unsigned char j, check=0;
unsigned short i, tindex=0;
#ifdef DEBUG
cerr << "\ncreatemin.cc [create_result]: high=" << high << "; check...";
for(i=0;i<high*num_vars;i++)
{
if((i+num_vars)%num_vars==0 )
{
cerr << "\n " << i/num_vars << '.';
}
cerr << '[' << lh[i].getid() << lh[i].value() << "] ";
}
cerr << "\ncreatemin.cc [create_result]: finished!" << endl;
#endif
//rotate
for(i=0;i<high;i++)
{
#ifdef DEBUG
cerr << "\n\ncreatemin.cc [create_result]: new expression" << endl;
#endif
expr=0;
for(j=0;j<num_vars;j++)
{
#ifdef DEBUG2
cerr << "\ncreatemin.cc [create_result]: ID=" << lh[i*num_vars+j].getid() << "; val=" << lh[i*num_vars+j].value() << "; i " << i << ", of " << high << "; index (j) " << (unsigned short)j << ", of " << (unsigned short)num_vars;
#endif
//check id
if(lh[i*num_vars+j].getid()!='-')
{
if(expr==0)
{
expr=1;
}
else
{
if(optimize)
{
buffer[tindex]='+';
tindex++;
}
else if( !(options & AVOID_ASTERICKS) )
{
buffer[tindex]='*';
tindex++;
}
}
//invert if LOW
if(lh[i*num_vars+j].value()==0)
{
if(!optimize)
{
buffer[tindex]='/';
tindex++;
}
#ifdef DEBUG2
cerr << "\ncreatemin.cc [create_result]: invertierd! ";
#endif
}
else if(optimize)
{
buffer[tindex]='/';
tindex++;
}
#ifdef DEBUG2
cerr << " - [" << lh[i*num_vars+j].getid() << lh[i*num_vars+j].value() << "] OK!";
#endif
//transfer content
buffer[tindex]=BO_var[j].getid();
tindex++;
check++;
#ifdef DEBUG2
cerr << " - original: [" << BO_var[j].getid() << ']';
#endif
#ifdef DEBUG
buffer[tindex]=0;
cerr << "\ncreatemin.cc [create_result]: buffer=" << buffer << ";";
#endif
}
}
//use or if buffer exsists
if(check!=0)
{
if(optimize)
{
if( !(options & AVOID_ASTERICKS) ) buffer[tindex]='*';
}
else
{
buffer[tindex]='+';
}
tindex++;
check=0;
}
}
#ifdef DEBUG
cerr << "\n\ncreatemin.cc [create_result]: string created.";
#endif
if(high==0)
{
buffer[0]='0';
buffer[1]='\0';
}
else if(tindex==0)
{
buffer[0]='1';
buffer[1]='\0';
}
else
{
//bufferinate string
buffer[tindex-1]='\0';
}
#ifdef DEBUG
cerr << "\ncreatemin.cc [create_result]: string terminated.";
#endif
}
|
