code: function ( t ) {
  
  		var d = t * this.getLength();
  		var curveLengths = this.getCurveLengths();
  		var i = 0;
  
  		// To think about boundaries points.
  
  		while ( i < curveLengths.length ) {
  
  			if ( curveLengths[ i ] >= d ) {
  
  				var diff = curveLengths[ i ] - d;
  				var curve = this.curves[ i ];
  
  				var u = 1 - diff / curve.getLength();
  
  				return curve.getPointAt( u );
  
  			}
  
  			i ++;
  
  		}
  
  		return null;
  
  		// loop where sum != 0, sum > d , sum+1 <d
  
  	}
docs: 1. Length of each sub path have to be known 2. Locate and identify type of curve 3. Get t for the curve 4. Return curve.getPointAt(t')