Distorted Android

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

// Copyright 2016 Leszek Koltunski                                                               //

//                                                                                               //

// This file is part of Distorted.                                                               //

//                                                                                               //

// Distorted 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 2 of the License, or                             //

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

//                                                                                               //

// Distorted 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 Distorted.  If not, see <http://www.gnu.org/licenses/>.                            //

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

package org.distorted.library.type;

import java.util.Vector;

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

/** 

* A 5-dimensional implementation of the Dynamic class to interpolate between a list

* of Static5Ds.

*/

public class Dynamic5D extends Dynamic implements Data5D

  {

  private Vector<Static5D> vv;

  private Static5D prev, curr, next;

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

// no array bounds checking!

  private void computeVelocity(int c)

    {

    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);

    tmp1 = vc.elementAt(c);

    float px = curr.x - prev.x;

    float py = curr.y - prev.y;

    float pz = curr.z - prev.z;

    float pw = curr.w - prev.w;

    float pv = curr.v - prev.v;

    float nx = next.x - curr.x;

    float ny = next.y - curr.y;

    float nz = next.z - curr.z;

    float nw = next.w - curr.w;

    float nv = next.v - curr.v;

    float d = nx*nx+ny*ny+nz*nz+nw*nw+nv*nv;

    if( d>0 )

      {

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

      if( q>1 )

        {

        tmp1.tangent[0] = nx+px/q;

        tmp1.tangent[1] = ny+py/q;

        tmp1.tangent[2] = nz+pz/q;

        tmp1.tangent[3] = nw+pw/q;

        tmp1.tangent[4] = nv+pv/q;

        }

      else

        {

        tmp1.tangent[0] = px+nx*q;

        tmp1.tangent[1] = py+ny*q;

        tmp1.tangent[2] = pz+nz*q;

        tmp1.tangent[3] = pw+nw*q;

        tmp1.tangent[4] = pv+nv*q;

        }

      }

    else

      {

      tmp1.tangent[0] = 0.0f;

      tmp1.tangent[1] = 0.0f;

      tmp1.tangent[2] = 0.0f;

      tmp1.tangent[3] = 0.0f;

      tmp1.tangent[4] = 0.0f;

      }

    }

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

  private void recomputeCache()

    {  

    if( numPoints==1 )

      {

      tmp1= vc.elementAt(0);

      curr= vv.elementAt(0);

      tmp1.a[0] = tmp1.a[1] = tmp1.a[2] = tmp1.a[3] = tmp1.a[4] = 0.0f;

      tmp1.b[0] = tmp1.b[1] = tmp1.b[2] = tmp1.b[3] = tmp1.b[4] = 0.0f;

      tmp1.c[0] = curr.x;

      tmp1.c[1] = curr.y;

      tmp1.c[2] = curr.z;

      tmp1.c[3] = curr.w;

      tmp1.c[4] = curr.v;

      tmp1.d[0] = tmp1.d[1] = tmp1.d[2] = tmp1.d[3] = tmp1.d[4] = 0.0f;

      }

    else if( numPoints==2 )

      {

      tmp1= vc.elementAt(0);

      tmp2= vc.elementAt(1);

      curr= vv.elementAt(0);

      next= vv.elementAt(1);

      tmp1.a[0] = tmp1.a[1] = tmp1.a[2] = tmp1.a[3] = tmp1.a[4] = 0.0f;

      tmp1.b[0] = tmp1.b[1] = tmp1.b[2] = tmp1.b[3] = tmp1.b[4] = 0.0f;

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

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

      tmp1.c[2] = next.z - curr.z;

      tmp1.c[3] = next.w - curr.w;

      tmp1.c[4] = next.v - curr.v;

      tmp1.d[0] = curr.x;

      tmp1.d[1] = curr.y;

      tmp1.d[2] = curr.z;

      tmp1.d[3] = curr.w;

      tmp1.d[4] = curr.v;

      tmp2.a[0] = tmp2.a[1] = tmp2.a[2] = tmp2.a[3] = tmp2.a[4] = 0.0f;

      tmp2.b[0] = tmp2.b[1] = tmp2.b[2] = tmp2.b[3] = tmp2.b[4] = 0.0f;

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

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

      tmp2.c[2] = curr.z - next.z;

      tmp2.c[3] = curr.w - next.w;

      tmp2.c[4] = curr.v - next.v;

      tmp2.d[0] = next.x;

      tmp2.d[1] = next.y;

      tmp2.d[2] = next.z;

      tmp2.d[3] = next.w;

      tmp2.d[4] = next.v;

      }

    else

      {

      int i, n;  

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

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

        {

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

        tmp1= vc.elementAt(i);

        tmp2= vc.elementAt(n);

        curr= vv.elementAt(i);

        next= vv.elementAt(n);

        tmp1.cached[0] = curr.x;

        tmp1.cached[1] = curr.y;

        tmp1.cached[2] = curr.z;

        tmp1.cached[3] = curr.w;

        tmp1.cached[4] = curr.v;

        tmp1.a[0] = mConvexity*( 2*curr.x +   tmp1.tangent[0] - 2*next.x + tmp2.tangent[0]);

        tmp1.b[0] = mConvexity*(-3*curr.x - 2*tmp1.tangent[0] + 3*next.x - tmp2.tangent[0]);

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

        tmp1.d[0] = curr.x;

        tmp1.a[1] = mConvexity*( 2*curr.y +   tmp1.tangent[1] - 2*next.y + tmp2.tangent[1]);

        tmp1.b[1] = mConvexity*(-3*curr.y - 2*tmp1.tangent[1] + 3*next.y - tmp2.tangent[1]);

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

        tmp1.d[1] = curr.y;

        tmp1.a[2] = mConvexity*( 2*curr.z +   tmp1.tangent[2] - 2*next.z + tmp2.tangent[2]);

        tmp1.b[2] = mConvexity*(-3*curr.z - 2*tmp1.tangent[2] + 3*next.z - tmp2.tangent[2]);

        tmp1.c[2] = mConvexity*(tmp1.tangent[2]) + (1.0f-mConvexity)*(next.z-curr.z);

        tmp1.d[2] = curr.z;

        tmp1.a[3] = mConvexity*( 2*curr.w +   tmp1.tangent[3] - 2*next.w + tmp2.tangent[3]);

        tmp1.b[3] = mConvexity*(-3*curr.w - 2*tmp1.tangent[3] + 3*next.w - tmp2.tangent[3]);

        tmp1.c[3] = mConvexity*(tmp1.tangent[3]) + (1.0f-mConvexity)*(next.w-curr.w);

        tmp1.d[3] = curr.w;

        tmp1.a[4] = mConvexity*( 2*curr.v +   tmp1.tangent[4] - 2*next.v + tmp2.tangent[4]);

        tmp1.b[4] = mConvexity*(-3*curr.v - 2*tmp1.tangent[4] + 3*next.v - tmp2.tangent[4]);

        tmp1.c[4] = mConvexity*(tmp1.tangent[4]) + (1.0f-mConvexity)*(next.v-curr.v);

        tmp1.d[4] = curr.v;

        }

      }

    cacheDirty = false;

    }

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

// PUBLIC API

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

/**

 * Default constructor.

 */

  public Dynamic5D()

    {

    super(0,0.5f,5);

    vv = new Vector<>();

    }

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

/**

 * Constructor setting the speed of interpolation and the number of revolutions.

 *

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

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

 *

 * @param duration number of milliseconds it takes to do one revolution.

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

 */

  public Dynamic5D(int duration, float count)

    {

    super(duration,count,5);

    vv = new Vector<>();

    }

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

/**

 * Returns the location'th Static5D.

 *   

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

 * @return The Static5D, if 0<=location&lt;getNumPoints(), or null otherwise.

 */  

  public synchronized Static5D getPoint(int location)

    {

    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, float z, float w, float v)

    {

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

      {

      curr = vv.elementAt(location);

      if( curr!=null )

        {

        curr.set(x,y,z,w,v);

        cacheDirty=true;

        }

      }

    }

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

/**

 * Adds a new Static5D to the end of our list of Points to interpolate through.

 * <p>   

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

 * here, and later on {@link Static5D#set(float,float,float,float,float)} it to some new value and

 * the change will be seamlessly reflected in the interpolated path.  

 * <p>

 * A Point can be added multiple times.

 *   

 * @param v The Point to add.

 */    

  public synchronized void add(Static5D v)

    {

    if( v!=null )

      {

      vv.add(v);

      if( vn!=null ) vn.add(new VectorNoise());

      switch(numPoints)

        {

        case 0: break;

        case 1: computeOrthonormalBase2(vv.elementAt(0),v);

                break;

        case 2: vc.add(new VectorCache());

                vc.add(new VectorCache());

                vc.add(new VectorCache());

                break;

        default:vc.add(new VectorCache());

        }

      numPoints++;

      cacheDirty = true;

      }

    }

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

/**

 * Adds a new Static5D to the location'th place in our List of Points to interpolate through.

 *   

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

 * @param v The Static5D to add.

 */  

  public synchronized void add(int location, Static5D v)

    {

    if( v!=null )

      {

      vv.add(location, v);

      if( vn!=null ) vn.add(new VectorNoise());

      switch(numPoints)

        {

        case 0: break;

        case 1: computeOrthonormalBase2(vv.elementAt(0),v);

                break;

        case 2: vc.add(new VectorCache());

                vc.add(new VectorCache());

                vc.add(new VectorCache());

                break;

        default:vc.add(location,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.

 */

  public synchronized boolean remove(Static5D v)

    {

    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();

                computeOrthonormalBase2(vv.elementAt(0),vv.elementAt(1));

                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();

                computeOrthonormalBase2(vv.elementAt(0),vv.elementAt(1));

                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(Static5D noise)

    {

    if( vn==null )

      {

      vn = new Vector<>();

      for(int i=0; i<numPoints; i++) vn.add(new VectorNoise());

      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;

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

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

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

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

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

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

    mNoise[0] = noise.x;

    mNoise[1] = noise.y;

    mNoise[2] = noise.z;

    mNoise[3] = noise.w;

    mNoise[4] = noise.v;

    }

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

  synchronized void interpolate(float[] buffer, int offset, float time)

    {  

    switch(numPoints)

      {

      case 0: buffer[offset  ] = 0.0f;

              buffer[offset+1] = 0.0f;

              buffer[offset+2] = 0.0f;

              buffer[offset+3] = 0.0f;

              buffer[offset+4] = 0.0f;

              break;

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

              buffer[offset  ] = curr.x;

              buffer[offset+1] = curr.y;

              buffer[offset+2] = curr.z;

              buffer[offset+3] = curr.w;

              buffer[offset+4] = curr.v;

              break;

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

              next = vv.elementAt(1);

              int segment2= (int)(2*time);

              if( mMode==MODE_LOOP || mMode==MODE_PATH ) time = (time>0.5f ? 2-2*time : 2*time);

              if( vn!=null )

                {

                if( segment2 != mSegment )

                  {

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

                  mSegment = segment2;

                  }

                time = noise(time,0);

                buffer[offset  ] = (next.x-curr.x)*time + curr.x + (baseV[1][0]*mFactor[0] + baseV[2][0]*mFactor[1] + baseV[3][0]*mFactor[2] + baseV[4][0]*mFactor[3]);

                buffer[offset+1] = (next.y-curr.y)*time + curr.y + (baseV[1][1]*mFactor[0] + baseV[2][1]*mFactor[1] + baseV[3][1]*mFactor[2] + baseV[4][1]*mFactor[3]);

                buffer[offset+2] = (next.z-curr.z)*time + curr.z + (baseV[1][2]*mFactor[0] + baseV[2][2]*mFactor[1] + baseV[3][2]*mFactor[2] + baseV[4][2]*mFactor[3]);

                buffer[offset+3] = (next.w-curr.w)*time + curr.w + (baseV[1][3]*mFactor[0] + baseV[2][3]*mFactor[1] + baseV[3][3]*mFactor[2] + baseV[4][3]*mFactor[3]);

                buffer[offset+4] = (next.v-curr.v)*time + curr.v + (baseV[1][4]*mFactor[0] + baseV[2][4]*mFactor[1] + baseV[3][4]*mFactor[2] + baseV[4][4]*mFactor[3]);

                }

              else

                {

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

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

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

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

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

                }

              break;

      default:float t = time;

              int vecCurr, segment;

              switch(mMode)

                {

                case MODE_LOOP: time = time*numPoints;

                                segment = (int)time;

                                vecCurr = segment;

                                break;

                case MODE_PATH: segment = (int)(2*t*(numPoints-1));

                                if( t<=0.5f )  // this has to be <= (otherwise when effect ends at t=0.5, then time=1.0

                                  {            // and end position is slightly not equal to the end point => might not get autodeleted!

                                  time = 2*t*(numPoints-1);

                                  vecCurr = segment;

                                  }

                                else

                                  {

                                  time = 2*(1-t)*(numPoints-1);

                                  vecCurr = 2*numPoints-3-segment;

                                  }

                                break;

                case MODE_JUMP: time = time*(numPoints-1);

                                segment = (int)time;

                                vecCurr = segment;

                                break;

                default       : vecCurr = 0;

                                segment = 0;

                }

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

                {

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

                else if( mSegment!= segment )       // ...or if we have just passed a vector and the vector we are currently flying to has changed

                  {

                  int vecNext= getNext(vecCurr,t);

                  next = vv.elementAt(vecNext);

                  tmp2 = vc.elementAt(vecNext);

                  if( tmp2.cached[0]!=next.x || tmp2.cached[1]!=next.y || tmp2.cached[2]!=next.z || tmp2.cached[3]!=next.w || tmp2.cached[4]!=next.v ) recomputeCache();

                  }

                if( mSegment!= segment && vn!=null ) vn.elementAt(vecCurr).computeNoise();

                mSegment = segment;

                time = time-vecCurr;

                tmp1 = vc.elementAt(vecCurr);

                if( vn!=null )

                  {

                  time = noise(time,vecCurr);

                  computeOrthonormalBaseMore(time,tmp1);

                  buffer[offset  ]= ((tmp1.a[0]*time+tmp1.b[0])*time+tmp1.c[0])*time+tmp1.d[0] + (baseV[1][0]*mFactor[0] + baseV[2][0]*mFactor[1] + baseV[3][0]*mFactor[2] + baseV[4][0]*mFactor[3]);

                  buffer[offset+1]= ((tmp1.a[1]*time+tmp1.b[1])*time+tmp1.c[1])*time+tmp1.d[1] + (baseV[1][1]*mFactor[0] + baseV[2][1]*mFactor[1] + baseV[3][1]*mFactor[2] + baseV[4][1]*mFactor[3]);

                  buffer[offset+2]= ((tmp1.a[2]*time+tmp1.b[2])*time+tmp1.c[2])*time+tmp1.d[2] + (baseV[1][2]*mFactor[0] + baseV[2][2]*mFactor[1] + baseV[3][2]*mFactor[2] + baseV[4][2]*mFactor[3]);

                  buffer[offset+3]= ((tmp1.a[3]*time+tmp1.b[3])*time+tmp1.c[3])*time+tmp1.d[3] + (baseV[1][3]*mFactor[0] + baseV[2][3]*mFactor[1] + baseV[3][3]*mFactor[2] + baseV[4][3]*mFactor[3]);

                  buffer[offset+4]= ((tmp1.a[4]*time+tmp1.b[4])*time+tmp1.c[4])*time+tmp1.d[4] + (baseV[1][4]*mFactor[0] + baseV[2][4]*mFactor[1] + baseV[3][4]*mFactor[2] + baseV[4][4]*mFactor[3]);

                  }

                else

                  {

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

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

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

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

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

                  }

                break;

                }

      }

    }  

  }

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

//