/*
 * Paper.js - The Swiss Army Knife of Vector Graphics Scripting.
 * http://paperjs.org/
 *
 * Copyright (c) 2011 - 2014, Juerg Lehni & Jonathan Puckey
 * http://scratchdisk.com/ & http://jonathanpuckey.com/
 *
 * Distributed under the MIT license. See LICENSE file for details.
 *
 * All rights reserved.
 */

/**
 * @name PathIterator
 * @class
 * @private
 */
var PathIterator = Base.extend({
    _class: 'PathIterator',

    /**
     * Creates a path iterator for the given path.
     *
     * @param {Path} path the path to iterate over
     * @param {Number} [maxRecursion=32] the maximum amount of recursion in
     * curve subdivision when mapping offsets to curve parameters
     * @param {Number} [tolerance=0.25] the error tolerance at which the
     * recursion is interrupted before the maximum number of iterations is
     * reached
     * @param {Matrix} [matrix] the matrix by which to transform the path's
     * coordinates without modifying the actual path.
     * @return {PathIterator} the newly created path iterator
     */
    initialize: function(path, maxRecursion, tolerance, matrix) {
        // Instead of relying on path.curves, we only use segments here and
        // get the curve values from them.
        var curves = [], // The curve values as returned by getValues()
            parts = [], // The calculated, subdivided parts of the path
            length = 0, // The total length of the path
            // By default, we're not subdividing more than 32 times.
            minDifference = 1 / (maxRecursion || 32),
            segments = path._segments,
            segment1 = segments[0],
            segment2;

        // Iterate through all curves and compute the parts for each of them,
        // by recursively calling computeParts().
        function addCurve(segment1, segment2) {
            var curve = Curve.getValues(segment1, segment2, matrix);
            curves.push(curve);
            computeParts(curve, segment1._index, 0, 1);
        }

        function computeParts(curve, index, minT, maxT) {
            // Check if the t-span is big enough for subdivision.
            if ((maxT - minT) > minDifference
                    // After quite a bit of testing, a default tolerance of 0.25
                    // appears to offer a good trade-off between speed and
                    // precision for display purposes.
                    && !Curve.isFlatEnough(curve, tolerance || 0.25)) {
                var split = Curve.subdivide(curve),
                    halfT = (minT + maxT) / 2;
                // Recursively subdivide and compute parts again.
                computeParts(split[0], index, minT, halfT);
                computeParts(split[1], index, halfT, maxT);
            } else {
                // Calculate distance between p1 and p2
                var x = curve[6] - curve[0],
                    y = curve[7] - curve[1],
                    dist = Math.sqrt(x * x + y * y);
                if (dist > /*#=*/Numerical.TOLERANCE) {
                    length += dist;
                    parts.push({
                        offset: length,
                        value: maxT,
                        index: index
                    });
                }
            }
        }

        for (var i = 1, l = segments.length; i < l; i++) {
            segment2 = segments[i];
            addCurve(segment1, segment2);
            segment1 = segment2;
        }
        if (path._closed)
            addCurve(segment2, segments[0]);

        this.curves = curves;
        this.parts = parts;
        this.length = length;
        // Keep a current index from the part where we last where in
        // getParameterAt(), to optimise for iterator-like usage of iterator.
        this.index = 0;
    },

    getParameterAt: function(offset) {
        // Make sure we're not beyond the requested offset already. Search the
        // start position backwards from where to then process the loop below.
        var i, j = this.index;
        for (;;) {
            i = j;
            if (j == 0 || this.parts[--j].offset < offset)
                break;
        }
        // Find the part that succeeds the given offset, then interpolate
        // with the previous part
        for (var l = this.parts.length; i < l; i++) {
            var part = this.parts[i];
            if (part.offset >= offset) {
                // Found the right part, remember current position
                this.index = i;
                // Now get the previous part so we can linearly interpolate
                // the curve parameter
                var prev = this.parts[i - 1];
                // Make sure we only use the previous parameter value if its
                // for the same curve, by checking index. Use 0 otherwise.
                var prevVal = prev && prev.index == part.index ? prev.value : 0,
                    prevLen = prev ? prev.offset : 0;
                return {
                    // Interpolate
                    value: prevVal + (part.value - prevVal)
                        * (offset - prevLen) / (part.offset - prevLen),
                    index: part.index
                };
            }
        }
        // Return last one
        var part = this.parts[this.parts.length - 1];
        return {
            value: 1,
            index: part.index
        };
    },

    drawPart: function(ctx, from, to) {
        from = this.getParameterAt(from);
        to = this.getParameterAt(to);
        for (var i = from.index; i <= to.index; i++) {
            var curve = Curve.getPart(this.curves[i],
                    i == from.index ? from.value : 0,
                    i == to.index ? to.value : 1);
            if (i == from.index)
                ctx.moveTo(curve[0], curve[1]);
            ctx.bezierCurveTo.apply(ctx, curve.slice(2));
        }
    }
}, Base.each(Curve.evaluateMethods,
    function(name) {
        this[name + 'At'] = function(offset, weighted) {
            var param = this.getParameterAt(offset);
            return Curve[name](this.curves[param.index], param.value, weighted);
        };
    }, {})
);