net.sourceforge.plantuml.geom.kinetic.QuadrantMapper Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of plantuml Show documentation
Show all versions of plantuml Show documentation
PlantUML is a component that allows to quickly write :
* sequence diagram,
* use case diagram,
* class diagram,
* activity diagram,
* component diagram,
* state diagram
* object diagram
/* ========================================================================
* PlantUML : a free UML diagram generator
* ========================================================================
*
* (C) Copyright 2009-2013, Arnaud Roques
*
* Project Info: http://plantuml.sourceforge.net
*
* This file is part of PlantUML.
*
* PlantUML 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.
*
* PlantUML 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 library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
* USA.
*
* [Java is a trademark or registered trademark of Sun Microsystems, Inc.
* in the United States and other countries.]
*
* Original Author: Arnaud Roques
*
* Revision $Revision: 9786 $
*
*/
package net.sourceforge.plantuml.geom.kinetic;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Set;
public class QuadrantMapper {
private final Map quadrants = new HashMap();
private final Map> setOfPoints = new HashMap>();
public void addPoint(Point2DCharge pt) {
if (quadrants.containsKey(pt)) {
throw new IllegalArgumentException();
}
final Quadrant q = new Quadrant(pt);
quadrants.put(pt, q);
getSetOfPoints(q).add(pt);
assert getSetOfPoints(q).contains(pt);
assert getSetOfPoints(new Quadrant(pt)).contains(pt);
}
public Set getAllPoints(Quadrant qt) {
return Collections.unmodifiableSet(getSetOfPoints(qt));
}
public Set getAllPoints() {
assert quadrants.keySet().equals(mergeOfSetOfPoints());
return Collections.unmodifiableSet(quadrants.keySet());
}
private Set mergeOfSetOfPoints() {
final Set result = new HashSet();
for (Set set : setOfPoints.values()) {
assert Collections.disjoint(set, result);
result.addAll(set);
}
return result;
}
public void updatePoint(Point2DCharge pt) {
final Quadrant newQ = new Quadrant(pt);
final Quadrant old = quadrants.get(pt);
assert getSetOfPoints(old).contains(pt);
if (old.equals(newQ) == false) {
assert getSetOfPoints(newQ).contains(pt) == false;
assert getSetOfPoints(old).contains(pt);
final boolean remove = getSetOfPoints(old).remove(pt);
assert remove;
final boolean add = getSetOfPoints(newQ).add(pt);
assert add;
assert getSetOfPoints(newQ).contains(pt);
assert getSetOfPoints(old).contains(pt) == false;
quadrants.put(pt, newQ);
}
assert getSetOfPoints(new Quadrant(pt)).contains(pt);
}
private HashSet getSetOfPoints(Quadrant q) {
HashSet result = setOfPoints.get(q);
if (result == null) {
result = new HashSet();
setOfPoints.put(q, result);
}
return result;
}
}