Distorted Android

///////////////////////////////////////////////////////////////////////////////////////////////////

// Copyright 2016 Leszek Koltunski                                                               //

//                                                                                               //

// the Free Software Foundation, either version 2 of the License, or                             //

// (at your option) any later version.                                                           //

//                                                                                               //

// 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                             //

import java.util.Vector;

///////////////////////////////////////////////////////////////////////////////////////////////////

/** 

  private Static2D prev, curr, next;

///////////////////////////////////////////////////////////////////////////////////////////////////

// no array bounds checking!

    int p = c>0 ? c-1: numPoints-1;

    int n = c<numPoints-1 ? c+1: 0;

    prev = vv.elementAt(p);

    curr = vv.elementAt(c);

    next = vv.elementAt(n);

    float px = curr.x - prev.x;

    float py = curr.y - prev.y;

    float nx = next.x - curr.x;

    float ny = next.y - curr.y;

    float d = nx*nx+ny*ny;

    if( d>0 )

      {

      float q = (float)Math.sqrt((px*px+py*py)/d);

      if( q>1 )

        {

        tmpCache1.velocity[1] = ny+py/q;

      else

        {

        tmpCache1.velocity[1] = py+ny*q;

      }

    else

      {

      tmpCache1.velocity[1] = 0.0f;

    }

///////////////////////////////////////////////////////////////////////////////////////////////////

  private void recomputeCache()

    {  

    if( numPoints==1 )

      {

      tmpCache1.b[0] = tmpCache1.b[1] = 0.0f;

      tmpCache1.c[0] = curr.x;

      tmpCache1.c[1] = curr.y;

      tmpCache1.d[0] = tmpCache1.d[1] = 0.0f;

    else if( numPoints==2 )

      {

      tmpCache2 = vc.elementAt(1);

      next= vv.elementAt(1);

      tmpCache1.b[0] = tmpCache1.b[1] = 0.0f;

      tmpCache1.c[0] = next.x - curr.x;

      tmpCache1.c[1] = next.y - curr.y;

      tmpCache1.d[0] = curr.x;

      tmpCache1.d[1] = curr.y;

      tmpCache2.b[0] = tmpCache2.b[1] = 0.0f;

      tmpCache2.c[0] = curr.x - next.x;

      tmpCache2.c[1] = curr.y - next.y;

      tmpCache2.d[0] = next.x;

      tmpCache2.d[1] = next.y;

    else

      {

      int i, n;  

      for(i=0; i<numPoints; i++)

        {

        n = i<numPoints-1 ? i+1:0;  

        tmpCache2 = vc.elementAt(n);

        next= vv.elementAt(n);

        tmpCache1.cached[1] = curr.y;

        tmpCache1.a[0] = mConvexity*( 2*curr.x +   tmpCache1.velocity[0] - 2*next.x + tmpCache2.velocity[0]);

        tmpCache1.b[0] = mConvexity*(-3*curr.x - 2* tmpCache1.velocity[0] + 3*next.x - tmpCache2.velocity[0]);

        tmpCache1.c[0] = mConvexity*(tmpCache1.velocity[0]) + (1.0f-mConvexity)*(next.x-curr.x);

        tmpCache1.d[0] = curr.x;

        tmpCache1.a[1] = mConvexity*( 2*curr.y +   tmpCache1.velocity[1] - 2*next.y + tmpCache2.velocity[1]);

        tmpCache1.b[1] = mConvexity*(-3*curr.y - 2* tmpCache1.velocity[1] + 3*next.y - tmpCache2.velocity[1]);

        tmpCache1.c[1] = mConvexity*(tmpCache1.velocity[1]) + (1.0f-mConvexity)*(next.y-curr.y);

        tmpCache1.d[1] = curr.y;

        if( mSpeedMode==SPEED_MODE_SEGMENT_CONSTANT ) smoothOutSegment(tmpCache1);

      }

    cacheDirty = false;

    }

///////////////////////////////////////////////////////////////////////////////////////////////////

// PUBLIC API 

///////////////////////////////////////////////////////////////////////////////////////////////////

/**

 * Default constructor.

 */

    vv = new Vector<>();

///////////////////////////////////////////////////////////////////////////////////////////////////

/**

 *

 * What constitutes 'one revolution' depends on the MODE:

 * {@link Dynamic#MODE_LOOP}, {@link Dynamic#MODE_PATH} or {@link Dynamic#MODE_JUMP}.

 * @param count    number of revolutions we will do. Count<=0 means 'infinite'.

  public Dynamic2D(int duration, float count)

    {

    }

/**

 * @param location the index of the Point we are interested in.

    return (location>=0 && location<numPoints) ? vv.elementAt(location) : null;  

    }

///////////////////////////////////////////////////////////////////////////////////////////////////

/**

 * Resets the location'th Point.

 * 

 * @param location the index of the Point we are setting.

 * @param x New value of its first float.

 */

  public synchronized void setPoint(int location, float x, float y)

    {

    if( location>=0 && location<numPoints )

      {

      curr = vv.elementAt(location);

      if( curr!=null )

        {

        curr.set(x,y);

        cacheDirty=true;

        }

      }

    }

///////////////////////////////////////////////////////////////////////////////////////////////////

/**

 * Only a reference to the Point gets added to the List; this means that one can add a Point 

 * <p>

 * A Point can be added multiple times.

 *   

 * @param v The Point to add.

 */  

    if( v!=null )

      {

      vv.add(v);

      switch(numPoints)

        {

        case 0:

        case 1: break;

                vc.add(new VectorCache());

                vc.add(new VectorCache());

      numPoints++;

      cacheDirty = true;

      }

    }

///////////////////////////////////////////////////////////////////////////////////////////////////

/**

 * @param location Index in our List to add the new Point at.

 * @param v The Point to add.

 */  

    if( v!=null )

      {

      vv.add(location, v);

      switch(numPoints)

        {

        case 0:

        case 1: break;

                vc.add(new VectorCache());

                vc.add(new VectorCache());

      numPoints++;

      cacheDirty = true;

      }

    }

///////////////////////////////////////////////////////////////////////////////////////////////////

/**

 * Removes all occurrences of Point v from the List of Points to interpolate through.  

 * 

 * @param v The Point to remove.

 * @return <code>true</code> if we have removed at least one Point.

 */

    int n = vv.indexOf(v);

    boolean found = false;

    while( n>=0 ) 

      {

      vv.remove(n);

      if( vn!=null ) vn.remove(0);

      switch(numPoints)

        {

        case 0:

        case 1: 

        case 2: break;

        case 3: vc.removeAllElements();

                break;

        default:vc.remove(n);

        }

      numPoints--;

      found = true;

      n = vv.indexOf(v);

      }

    if( found ) 

      {

      cacheDirty=true;

      }

    return found;

    }

///////////////////////////////////////////////////////////////////////////////////////////////////

/**

 * Removes a location'th Point from the List of Points we interpolate through.

 * 

 * @param location index of the Point we want to remove. 

 * @return <code>true</code> if location is valid, i.e. if 0<=location&lt;getNumPoints().

 */

  public synchronized boolean remove(int location)

    {

    if( location>=0 && location<numPoints ) 

      {

      vv.removeElementAt(location);

      if( vn!=null ) vn.remove(0);

      switch(numPoints)

        {

        case 0:

        case 1: 

        case 2: break;

        case 3: vc.removeAllElements();

                break;

        default:vc.removeElementAt(location);

        }

      numPoints--;

      cacheDirty = true; 

      return true;

      }

   return false;

   }

///////////////////////////////////////////////////////////////////////////////////////////////////

/**

 * Removes all Points.

 */

  public synchronized void removeAll()

    {

    numPoints = 0;

    vv.removeAllElements();

    vc.removeAllElements();

    cacheDirty = false;

    if( vn!=null ) vn.removeAllElements();

    }

/**

 * Sets the 'smoothness' of interpolation.

 * <p>

 * When Noise=0 (the default), we interpolate between our Points through the most smooth path possible.

 * Increasing noise makes the Dynamic increasingly deviate from this path, pseudo-randomly speeding

 * up and slowing down, etc.

 *

 * @param noise The noise level. Permitted range: 0 <= noise <= 1.

 */

  public synchronized void setNoise(Static2D noise)

    {

    if( vn==null )

      {

      vn = new Vector<>();

      if( mDimension>=2 )

        {

        mFactor = new float[mDimension-1];

        }

      mNoise = new float[mDimension];

      }

    if( noise.x<0.0f ) noise.x = 0.0f;

    if( noise.x>1.0f ) noise.x = 1.0f;

    if( noise.y<0.0f ) noise.y = 0.0f;

    if( noise.y>1.0f ) noise.y = 1.0f;

    mNoise[0] = noise.x;

    mNoise[1] = noise.y;

    }

    switch(numPoints)

      {

      case 0: buffer[offset  ] = 0.0f;

              buffer[offset+1] = 0.0f;

              break;

      case 1: curr = vv.elementAt(0);

              buffer[offset  ] = curr.x;

              buffer[offset+1] = curr.y;

              break;

      case 2: curr = vv.elementAt(0);

              next = vv.elementAt(1);

                {

                  if(mMode!=MODE_JUMP || mSegment==1) vn.elementAt(0).computeNoise();

                baseV[1][1] = next.y-curr.y;

                buffer[offset+1] = baseV[1][1]*time + curr.y -baseV[1][0]*mFactor[0];

              else

                {

                buffer[offset  ] = (next.x-curr.x)*time + curr.x;

                buffer[offset+1] = (next.y-curr.y)*time + curr.y;

                }

              break;

                if( cacheDirty ) recomputeCache();  // recompute cache if we have added or remove vectors since last computation

                time = mTmpTime-mTmpVec;

                tmpCache1 = vc.elementAt(mTmpVec);

                  {

                  baseV[1][1] = (3*tmpCache1.a[1]*time + 2*tmpCache1.b[1])*time + tmpCache1.c[1];

                  buffer[offset+1]= ((tmpCache1.a[1]*time+ tmpCache1.b[1])*time+ tmpCache1.c[1])*time+ tmpCache1.d[1] -baseV[1][0]*mFactor[0];

                else

                  {

                  buffer[offset+1]= ((tmpCache1.a[1]*time+ tmpCache1.b[1])*time+ tmpCache1.c[1])*time+ tmpCache1.d[1];

                break;

                }

      }

    }  

  }

///////////////////////////////////////////////////////////////////////////////////////////////////

//