Package com.cburch.logisim.analyze.model

Examples of com.cburch.logisim.analyze.model.Expression

40
41
42
43
44
45
46
47
48
49
50
        return GateFunctions.computeOddParity(inputs, numInputs).not();
    }

    @Override
    protected Expression computeExpression(Expression[] inputs, int numInputs) {
        Expression ret = inputs[0];
        for (int i = 1; i < numInputs; i++) {
            ret = Expressions.xor(ret, inputs[i]);
        }
        return Expressions.not(ret);
    }
View Full Code Here
50
51
52
53
54
55
56
57
58
59
60
                field.setText(getCurrentString());
                field.grabFocus();
            } else if ((src == field || src == enter) && enter.isEnabled()) {
                try {
                    String exprString = field.getText();
                    Expression expr = Parser.parse(field.getText(), model);
                    setError(null);
                    model.getOutputExpressions().setExpression(getCurrentVariable(), expr, exprString);
                    insertUpdate(null);
                } catch (ParserException ex) {
                    setError(ex.getMessageGetter());
View Full Code Here
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
                    int negated = attrs.negated;

                    Expression[] inputs = new Expression[inputCount];
                    int numInputs = 0;
                    for (int i = 1; i <= inputCount; i++) {
                        Expression e = expressionMap.get(instance.getPortLocation(i));
                        if (e != null) {
                            int negatedBit = (negated >> (i - 1)) & 1;
                            if (negatedBit == 1) {
                                e = Expressions.not(e);
                            }
                            inputs[numInputs] = e;
                            ++numInputs;
                        }
                    }
                    if (numInputs > 0) {
                        Expression out = AbstractGate.this.computeExpression(inputs, numInputs);
                        expressionMap.put(instance.getPortLocation(0), out);
                    }
                }
            };
        }
View Full Code Here
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
        for (Map.Entry<Instance, String> entry : pinNames.entrySet()) {
            Instance pin = entry.getKey();
            String label = entry.getValue();
            if (Pin.FACTORY.isInputPin(pin)) {
                expressionMap.currentCause = Instance.getComponentFor(pin);
                Expression e = Expressions.variable(label);
                expressionMap.put(pin.getLocation(), e);
                inputNames.add(label);
            } else {
                outputPins.add(pin);
                outputNames.add(label);
            }
        }

        propagateComponents(expressionMap, circuit.getNonWires());

        for (int iterations = 0; !expressionMap.dirtyPoints.isEmpty(); iterations++) {
            if (iterations > MAX_ITERATIONS) {
                throw new AnalyzeException.Circular();
            }

            propagateWires(expressionMap, new HashSet<Location>(expressionMap.dirtyPoints));

            HashSet<Component> dirtyComponents = getDirtyComponents(circuit, expressionMap.dirtyPoints);
            expressionMap.dirtyPoints.clear();
            propagateComponents(expressionMap, dirtyComponents);

            Expression expr = checkForCircularExpressions(expressionMap);
            if (expr != null) {
                throw new AnalyzeException.Circular();
            }

        }
View Full Code Here
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
    // propagates expressions down wires
    private static void propagateWires(ExpressionMap expressionMap,
            HashSet<Location> pointsToProcess) throws AnalyzeException {
        expressionMap.currentCause = null;
        for (Location p : pointsToProcess) {
            Expression e = expressionMap.get(p);
            expressionMap.currentCause = expressionMap.causes.get(p);
            WireBundle bundle = expressionMap.circuit.wires.getWireBundle(p);
            if (e != null && bundle != null && bundle.points != null) {
                for (Location p2 : bundle.points) {
                    if (p2.equals(p)) {
                        continue;
                    }

                    Expression old = expressionMap.get(p2);
                    if (old != null) {
                        Component eCause = expressionMap.currentCause;
                        Component oldCause = expressionMap.causes.get(p2);
                        if (eCause != oldCause && !old.equals(e)) {
                            throw new AnalyzeException.Conflict();
                        }
                    }
                    expressionMap.put(p2, e);
                }
View Full Code Here
329
330
331
332
333
334
335
336
337
338
339
340
    /** Checks whether any of the recently placed expressions in the
     * expression map are self-referential; if so, return it. */
    private static Expression checkForCircularExpressions(ExpressionMap expressionMap)
            throws AnalyzeException {
        for (Location point : expressionMap.dirtyPoints) {
            Expression expr = expressionMap.get(point);
            if (expr.isCircular()) {
                return expr;
            }

        }
        return null;
View Full Code Here
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
            this.circuit = circuit;
        }

        @Override
        public Expression put(Location point, Expression expression) {
            Expression ret = super.put(point, expression);
            if (currentCause != null) {
                causes.put(point, currentCause);
            }

            if (ret == null ? expression != null : !ret.equals(expression)) {
                dirtyPoints.add(point);
            }
            return ret;
        }
View Full Code Here
147
148
149
150
151
152
153
154
155
156
157
    protected Object getInstanceFeature(final Instance instance, Object key) {
        if (key == ExpressionComputer.class) {
            return new ExpressionComputer() {
                @Override
                public void computeExpression(Map<Location,Expression> expressionMap) {
                    Expression e = expressionMap.get(instance.getPortLocation(1));
                    if (e != null) {
                        expressionMap.put(instance.getPortLocation(0), Expressions.not(e));
                    }
                }
            };
View Full Code Here
105
106
107
108
109
110
111
112
113
114
115
    public Object getInstanceFeature(final Instance instance, Object key) {
        if (key == ExpressionComputer.class) {
            return new ExpressionComputer() {
                @Override
                public void computeExpression(Map<Location,Expression> expressionMap) {
                    Expression e = expressionMap.get(instance.getPortLocation(1));
                    if (e != null) {
                        expressionMap.put(instance.getPortLocation(0), e);
                    }
                }
            };
View Full Code Here
89
90
91
92
93
94
95
96
97
98
99
    protected static Expression xorExpression(Expression[] inputs, int numInputs) {
        if (numInputs > 2) {
            throw new UnsupportedOperationException("XorGate");
        }
        Expression ret = inputs[0];
        for (int i = 1; i < numInputs; i++) {
            ret = Expressions.xor(ret, inputs[i]);
        }
        return ret;
    }
View Full Code Here
TOP

Related Classes of com.cburch.logisim.analyze.model.Expression

  • com.cburch.logisim.analyze.gui.BuildCircuitButton$DialogPanel
  • com.cburch.logisim.analyze.gui.ExpressionTab$MyListener
  • com.cburch.logisim.circuit.Analyze
  • com.cburch.logisim.circuit.Analyze$ExpressionMap
  • com.cburch.logisim.std.gates.AbstractGate
  • com.cburch.logisim.std.gates.AndGate
  • com.cburch.logisim.std.gates.Buffer
  • com.cburch.logisim.std.gates.CircuitBuilder
  • com.cburch.logisim.std.gates.EvenParityGate
  • com.cburch.logisim.std.gates.NandGate
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.