net.sourceforge.plantuml.ugraphic.CompressionTransform Maven / Gradle / Ivy

Show more of this group Show more artifacts with this name
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

There is a newer version: 8059

Show newest version

/* ========================================================================
 * 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: 7696 $
 *
 */
package net.sourceforge.plantuml.ugraphic;

import java.util.List;

public class CompressionTransform {

	private final List all;

	public CompressionTransform(SlotSet slotSet) {
		this.all = slotSet.getSlots();
	}

	public double transform(double v) {
		return v - getCompressDelta(v);
	}

	private double getCompressDelta(double v) {
		double result = 0;
		for (Slot s : all) {
			if (s.getStart() > v) {
				continue;
			}
			if (v > s.getEnd()) {
				result += s.size();
			} else {
				result += v - s.getStart();
			}
		}
		return result;
	}

}