All Downloads are FREE. Search and download functionalities are using the official Maven repository.

edu.umd.cs.piccolox.activities.PPathActivity Maven / Gradle / Ivy

There is a newer version: 3.0.1
Show newest version
/*
 * Copyright (c) 2008-2011, Piccolo2D project, http://piccolo2d.org
 * Copyright (c) 1998-2008, University of Maryland
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without modification, are permitted provided
 * that the following conditions are met:
 *
 * Redistributions of source code must retain the above copyright notice, this list of conditions
 * and the following disclaimer.
 *
 * Redistributions in binary form must reproduce the above copyright notice, this list of conditions
 * and the following disclaimer in the documentation and/or other materials provided with the
 * distribution.
 *
 * None of the name of the University of Maryland, the name of the Piccolo2D project, or the names of its
 * contributors may be used to endorse or promote products derived from this software without specific
 * prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED
 * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
 * PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
 * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
 * TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
 * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */
package edu.umd.cs.piccolox.activities;

import edu.umd.cs.piccolo.activities.PInterpolatingActivity;

/**
 * PPathActivity is the abstract base class for all path activity
 * interpolators. Path activities interpolate between multiple states over the
 * duration of the activity.
 * 

* Knots are used to determine when in time the activity should move from state * to state. Knot values should be increasing in value from 0 to 1 inclusive. * This class is based on the Java 3D PathInterpolator object, see that class * documentation for more information on the basic concepts used in this classes * design. *

*

* See PPositionPathActivity for a concrete path activity that will animate * through a list of points. *

* * @version 1.0 * @author Jesse Grosjean */ public abstract class PPathActivity extends PInterpolatingActivity { /** * The "knots" that define this path's activity timing through its activity * and should be an monotonously increasing array starting where each value * is >=0 and ending at 1f. */ protected float[] knots; /** * Constructs a PPathActivity that will last the specified duration, will * animate every stepRate and will progress according to the knots provided. * * @param duration duration in milliseconds that this activity should last * @param stepRate interval in milliseconds between animation steps * @param knots array defining the speed of the animation alongs it's * animation */ public PPathActivity(final long duration, final long stepRate, final float[] knots) { this(duration, stepRate, 0, PInterpolatingActivity.SOURCE_TO_DESTINATION, knots); } /** * Constructs a PPathActivity that will repeat the specified number of * times, last the specified duration, will animate every stepRate and will * progress according to the knots provided. * * @param duration duration in milliseconds that this activity should last * @param stepRate interval in milliseconds between animation steps * @param knots array defining the speed of the animation alongs it's * animation * @param loopCount # of times activity should repeat * @param mode controls easing of the activity */ public PPathActivity(final long duration, final long stepRate, final int loopCount, final int mode, final float[] knots) { super(duration, stepRate, loopCount, mode); setKnots(knots); } /** * Returns the number of knots that define the timing of this activity. * * @return # of knots */ public int getKnotsLength() { return knots.length; } /** * Changes the knots that define the timing of this activity. * * @param newKnots the new knots to assign to this activity */ public void setKnots(final float[] newKnots) { if (newKnots == null) { this.knots = null; } else { this.knots = (float[]) newKnots.clone(); } } /** * Return the knots that define the timing of this activity. * * @return new knots */ public float[] getKnots() { if (knots == null) { return null; } return (float[]) knots.clone(); } /** * Changes the knot at the given index. * * @param index index of knot to change * @param knot new value to assign to the knot */ public void setKnot(final int index, final float knot) { knots[index] = knot; } /** * Returns the value of the knot at the given index. * * @param index index of desired knot * @return value of knot at given index */ public float getKnot(final int index) { return knots[index]; } /** * Sets the target's value taking knot timing into account. * * @param zeroToOne how much of this activity has elapsed 0=none, * 1=completed */ public void setRelativeTargetValue(final float zeroToOne) { int currentKnotIndex = 0; while (zeroToOne > knots[currentKnotIndex]) { currentKnotIndex++; } int startKnot = currentKnotIndex - 1; int endKnot = currentKnotIndex; if (startKnot < 0) { startKnot = 0; } if (endKnot > getKnotsLength() - 1) { endKnot = getKnotsLength() - 1; } final float currentRange = knots[endKnot] - knots[startKnot]; final float currentPointOnRange = zeroToOne - knots[startKnot]; float normalizedPointOnRange = currentPointOnRange; if (currentRange != 0) { normalizedPointOnRange = currentPointOnRange / currentRange; } setRelativeTargetValue(normalizedPointOnRange, startKnot, endKnot); } /** * An abstract method that allows subclasses to define what target value * matches the given progress and knots. * * @param zeroToOne how far between the knots the activity is * @param startKnot knot that defines the start of this particular interpolation * @param endKnot knot that defines the end of this particular interpolation */ public abstract void setRelativeTargetValue(float zeroToOne, int startKnot, int endKnot); }




© 2015 - 2024 Weber Informatics LLC | Privacy Policy