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
|
/***************************************************************************
* Copyright (C) 2005 by Fredy Yanardi *
* *
* 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. *
***************************************************************************/
#include "libraryitem.h"
#include "logic.h"
#include "magnitudecomparator.h"
#include "variant.h"
#include <cmath>
#include <klocale.h>
Item* MagnitudeComparator::construct( ItemDocument *itemDocument, bool newItem, const char *id )
{
return new MagnitudeComparator( (ICNDocument*)itemDocument, newItem, id );
}
LibraryItem* MagnitudeComparator::libraryItem()
{
return new LibraryItem(
TQString("ec/magnitudecomparator"),
i18n("Magnitude Comparator"),
i18n("Integrated Circuits"),
"ic1.png",
LibraryItem::lit_component,
MagnitudeComparator::construct
);
}
MagnitudeComparator::MagnitudeComparator( ICNDocument *icnDocument, bool newItem, const char *id )
: Component( icnDocument, newItem, id ? id : "magnitudecomparator" )
{
m_name = i18n("Magnitude Comparator");
// m_desc = i18n("Compares to two binary number and generates input to indicate which binary number has greater magnitude. It has 3 cascading inputs: I0 for I<SUB>A > B</SUB>, I1 for I<SUB>A < B</SUB>, and I2 for I<SUB>A = B</SUB> and 3 outputs: O0 for O<SUB>A > B</SUB>, O1 for O<SUB>A < B</SUB>, and O2 for O<SUB>A = B</SUB>");
m_desc = i18n("Compares two binary numbers and generates output to indicate which binary number has the greater magnitude. It has 3 cascading inputs:"
"<ul><li>I: A > B</li>"
"<li>I: A < B</li>"
"<li>I: A = B</li></ul>"
"and 3 outputs:"
"<ul><li>O: A > B</li>"
"<li>O: A < B</li>"
"<li>O: A = B</li></ul>");
createProperty( "numInput", Variant::Type::Int );
property("numInput")->setCaption( i18n("Number Inputs") );
property("numInput")->setMinValue(1);
property("numInput")->setMaxValue(8);
property("numInput")->setValue(4);
m_oldABLogicCount = 0;
cascadingInputs = 3;
outputs = 3;
firstTime = true;
}
MagnitudeComparator::~MagnitudeComparator()
{
}
void MagnitudeComparator::dataChanged()
{
initPins();
}
void MagnitudeComparator::inStateChanged()
{
int i;
for ( i = 0; i < 3; i++ )
m_output[i]->setHigh(false);
// for ( i = dataInt("numInput")-1; i >= 0; i-- ) {
for ( i = m_oldABLogicCount-1; i >= 0; i-- ) {
if (m_aLogic[i]->isHigh() && !m_bLogic[i]->isHigh())
{
m_output[0]->setHigh(true);
return;
}
else if ( !m_aLogic[i]->isHigh() && m_bLogic[i]->isHigh() ) {
m_output[1]->setHigh(true);
return;
}
}
if ( m_cLogic[2]->isHigh() )
m_output[2]->setHigh(true);
else if ( m_cLogic[0]->isHigh() )
if ( !m_cLogic[1]->isHigh() )
m_output[0]->setHigh(true);
else
;
else if ( m_cLogic[1]->isHigh() )
m_output[1]->setHigh(true);
else {
m_output[0]->setHigh(true);
m_output[1]->setHigh(true);
}
}
void MagnitudeComparator::initPins()
{
const double numInputs = dataInt("numInput");
int newABLogicCount = (int)numInputs;
if ( newABLogicCount == m_oldABLogicCount )
return;
TQStringList leftPins;
int space = 3 - newABLogicCount;
for ( int i = 0; i < space; i++ )
leftPins << "";
for ( int i = 0; i < newABLogicCount; i++ )
leftPins << TQString("A%1").tqarg( TQString::number(i) );
for ( int i = 0; i < newABLogicCount; i++ )
leftPins << TQString("B%1").tqarg( TQString::number(i) );
for ( int i = 0; i < space; i++ )
leftPins << "";
TQStringList rightPins;
space = -space;
for ( int i = 0; i < space; i++ )
rightPins << "";
TQString inNames[] = { "I: A>B", "I: A<B", "I: A=B" };
rightPins << inNames[2] << inNames[1] << inNames[0];
TQString outNames[] = { "O: A>B", "O: A<B", "O: A=B" };
rightPins << outNames[2] << outNames[1] << outNames[0];
for ( int i = 0; i < space; i++ )
rightPins << "";
TQStringList pins = leftPins + rightPins;
initDIPSymbol( pins, 88 );
initDIP(pins);
ECNode *node;
if (firstTime) {
m_cLogic.resize(3);
for ( int i = 0; i < cascadingInputs; i++ )
{
node = ecNodeWithID( inNames[i] );
m_cLogic.insert( i, createLogicIn(node) );
m_cLogic[i]->setCallback( this, (CallbackPtr)(&MagnitudeComparator::inStateChanged));
}
m_output.resize(3);
for ( int i = 0; i < outputs; i++ )
{
node = ecNodeWithID( outNames[i] );
m_output.insert( i, createLogicOut(node,false) );
}
firstTime = false;
}
if ( newABLogicCount > m_oldABLogicCount )
{
m_aLogic.resize(newABLogicCount);
for ( int i=m_oldABLogicCount; i<newABLogicCount; ++i )
{
node = ecNodeWithID("A"+TQString::number(i));
m_aLogic.insert( i, createLogicIn(node) );
m_aLogic[i]->setCallback( this, (CallbackPtr)(&MagnitudeComparator::inStateChanged) );
}
m_bLogic.resize(newABLogicCount);
for ( int i=m_oldABLogicCount; i<newABLogicCount; ++i )
{
node = ecNodeWithID("B"+TQString::number(i));
m_bLogic.insert( i, createLogicIn(node) );
m_bLogic[i]->setCallback( this, (CallbackPtr)(&MagnitudeComparator::inStateChanged) );
}
}
else
{
for ( int i=newABLogicCount; i<m_oldABLogicCount; ++i )
{
TQString id = "A"+TQString::number(i);
removeDisplayText(id);
removeElement( m_aLogic[i], false );
removeNode(id);
}
m_aLogic.resize(newABLogicCount);
for ( int i=newABLogicCount; i<m_oldABLogicCount; ++i )
{
TQString id = "B"+TQString::number(i);
removeDisplayText(id);
removeElement( m_bLogic[i], false );
removeNode(id);
}
m_bLogic.resize(newABLogicCount);
}
m_oldABLogicCount = newABLogicCount;
inStateChanged();
}
|
