/*
* funCKit - functional Circuit Kit
* Copyright (C) 2013 Lukas Elsner <open@mindrunner.de>
* Copyright (C) 2013 Peter Dahlberg <catdog2@tuxzone.org>
* Copyright (C) 2013 Julian Stier <mail@julian-stier.de>
* Copyright (C) 2013 Sebastian Vetter <mail@b4sti.eu>
* Copyright (C) 2013 Thomas Poxrucker <poxrucker_t@web.de>
* Copyright (C) 2013 Alexander Treml <alex.treml@directbox.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 3 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/>.
*/
package de.sep2011.funckit.validator;
import de.sep2011.funckit.model.graphmodel.Brick;
import de.sep2011.funckit.model.graphmodel.Circuit;
import de.sep2011.funckit.model.graphmodel.Component;
import de.sep2011.funckit.model.graphmodel.ComponentType;
import de.sep2011.funckit.model.graphmodel.Element;
import de.sep2011.funckit.util.internationalization.Language;
import java.awt.Point;
import java.util.HashMap;
import java.util.LinkedHashSet;
import java.util.Map;
import java.util.Set;
/**
* This check verifies that no two {@link Brick}s in the given {@link Circuit}
* are at the same position. If some of them are the check fails and the
* {@link Result} contains those {@link Brick}s.
*/
public class SamePositionCheck implements Check {
private final Set<Element> flawElements = new LinkedHashSet<Element>();
private final Map<ComponentType, Boolean> typeCheckResult = new HashMap<ComponentType, Boolean>();
/**
* {@inheritDoc} In this case this performs a search for {@link Brick}s with
* the same position and stores them in the {@link Result}. If no such
* {@link Brick}s are found this test passes.
*/
@Override
public Result perform(Circuit c) {
flawElements.clear();
typeCheckResult.clear();
checkCircuit(c);
// construct Result object
String message = "check." + this.getClass().getSimpleName();
if (flawElements.isEmpty()) {
message += ".passedMessage";
} else {
message += ".failedMessage";
}
return new Result(flawElements.isEmpty(), Language.tr(message),
flawElements, this);
}
private boolean checkCircuit(Circuit circuit) {
Map<Point, Element> positionMap = new HashMap<Point, Element>();
boolean hasFlaw = false;
// look for bricks with the same position
for (Element e : circuit.getElements()) {
if (e instanceof Brick) {
Brick b = (Brick) e;
Point position = b.getBoundingRect().getLocation();
// brick has a position which was found earlier? => flaw
if (positionMap.containsKey(position)) {
flawElements.add(b);
flawElements.add(positionMap.get(position));
hasFlaw = true;
} else { // new unique position => add to map
positionMap.put(position, b);
}
}
// check component's type additionally
if (e instanceof Component) {
Component comp = (Component) e;
ComponentType type = comp.getType();
if (!typeCheckResult.containsKey(type)) {
typeCheckResult.put(type, checkCircuit(type.getCircuit()));
}
boolean typeHasFlaw = typeCheckResult.get(type);
if (typeHasFlaw) {
hasFlaw = true;
flawElements.add(comp);
}
}
}
return hasFlaw;
}
@Override
public String getName() {
return Language.tr("Check." + this.getClass().getSimpleName());
}
}