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

/*
 * Boolean Geometric Path Operations
 *
 * This is mostly written for clarity and compatibility, not optimised for
 * performance, and has to be tested heavily for stability.
 *
 * Supported
 *  - Path and CompoundPath items
 *  - Boolean Union
 *  - Boolean Intersection
 *  - Boolean Subtraction
 *  - Resolving a self-intersecting Path
 *
 * Not supported yet
 *  - Boolean operations on self-intersecting Paths
 *  - Paths are clones of each other that ovelap exactly on top of each other!
 *
 * @author Harikrishnan Gopalakrishnan
 * http://hkrish.com/playground/paperjs/booleanStudy.html
 */

PathItem.inject(new function() {
	/**
	 * To deal with a HTML5 canvas requirement where CompoundPaths' child
	 * contours has to be of different winding direction for correctly filling
	 * holes. But if some individual countours are disjoint, i.e. islands, we
	 * have to reorient them so that:
	 * - the holes have opposit winding direction (already handled by paper.js)
	 * - islands have to have the same winding direction as the first child
	 *
	 * NOTE: Does NOT handle self-intersecting CompoundPaths.
	 */
	function reorientPath(path) {
		if (path instanceof CompoundPath) {
			var children = path.removeChildren(),
				length = children.length,
				bounds = new Array(length),
				counters = new Array(length),
				clockwise;
			children.sort(function(a, b) {
				return b.getBounds().getArea() - a.getBounds().getArea();
			});
			path.addChildren(children);
			clockwise = children[0].isClockwise();
			for (var i = 0; i < length; i++) {
				bounds[i] = children[i].getBounds();
				counters[i] = 0;
			}
			for (var i = 0; i < length; i++) {
				for (var j = 1; j < length; j++) {
					if (i !== j && bounds[i].intersects(bounds[j]))
						counters[j]++;
				}
				// Omit the first child
				if (i > 0 && counters[i] % 2 === 0)
					children[i].setClockwise(clockwise);
			}
		}
		return path;
	}

	function computeBoolean(path1, path2, operator, reverse, subtract, res) {
		function calculateWinding (curve, t, monoCurves, subtract) {
			var wind,
				v = curve.getValues(),
				midPoint = Curve.evaluate(v, t, 0),
				length = Curve.getLength(v),
				vDiff = Math.abs(v[1] - v[7]),
				tolerance = /*#=*/ Numerical.TOLERANCE,
				linear = Curve.isLinear(v) || Curve.isFlatEnough(v, tolerance);
				horizontal = (linear && vDiff < tolerance) ||
						(length < 1 && vDiff < 0.01),
				parent = segment._path;
			if (parent._parent instanceof CompoundPath)
				parent = parent._parent;
			// Find the winding contribution of this curve to
			// the resulting path
			wind = PathItem._getWindingNumber(midPoint, monoCurves, horizontal);
			// While subtracting, we need to omit this curve if this 
			// curve is contributing to the second operand exclusively.
			if (subtract && (parent._id === path2._id &&
						!path1._getWinding(midPoint) ||
					(parent._id === path1._id &&
						path2._getWinding(midPoint)))) {
				wind = 0;
			}
			return wind;
		}
		// We do not modify the operands themselves
		// The result might not belong to the same type
		// i.e. subtraction(A:Path, B:Path):CompoundPath etc.
		// Also apply matrices to both paths in case they were transformed.
		path1 = reorientPath(path1.clone(false).applyMatrix());
		path2 = reorientPath(path2.clone(false).applyMatrix());
		// Do operator specific calculations before we begin
		// Make both paths at clockwise orientation, except when @subtract = true
		// We need both paths at opposit orientation for subtraction
		if (!path1.isClockwise())
			path1.reverse();
		if (!(reverse ^ path2.isClockwise()))
			path2.reverse();
		var intersections, i, j, l, segment, wind, 
			startSeg, crv, v, length,
			// Minimum length of the path and minimum number of curves to
			// confirm, to determine the winding contribution with a
			// good enough confidence.
			minCurveLenY = 15,
			minCurveNum = 2,
			curveChain = [],
			windings = [],
			windCommon, windConfident, lenCurves, numCurves, slowPath, 
			paths = [],
			segments = [],
			// Aggregate of all curves in both operands, monotonic in y
			monoCurves = [],
			result = new CompoundPath(),
			abs = Math.abs;
		// Split curves at intersections on both paths.
		intersections = path1.getIntersections(path2);
		PathItem._splitPath(intersections);
		// Collect all sub paths and segments
		paths.push.apply(paths, path1._children || [path1]);
		paths.push.apply(paths, path2._children || [path2]);
		for (i = 0, l = paths.length; i < l; i++){
			segments.push.apply(segments, paths[i].getSegments());
			monoCurves.push.apply(monoCurves, paths[i]._getMonotoneCurves());
		}

			//DEBUG:---------NOTE: delete ret arg. from unite etc. below------------------
			if(res){
				var cPath = new CompoundPath();
				cPath.addChildren(paths, true);
				return cPath;
			}
			//DEBUG:----------------------------------------------

		// Propagate the winding contribution. Winding contribution of curves
		// does not change between two intersections.
		// First, sort all segments with an intersection to the begining.
		segments.sort(function(a, b) {
			var ixa = a._intersection,
				ixb = b._intersection;
			if ((!ixa && !ixb) || (ixa && ixb))
				return 0;
			return ixa ? -1 : 1;
		});
		for (i = 0, l = segments.length; i < l; i++) {
			segment = segments[i];
			if(segment._winding != null)
				continue;
			// Here we try to determine the most probable winding number
			// contribution for this curve-chain. Once we have enough
			// confidence in the winding contribution, we can propagate it
			// until the intersection or end of a curve chain.
			curveChain.length = 0;
			windings.length = 0;
			lenCurves = numCurves = 0;
			windConfident = windCommon = null;
			slowPath = false;
			startSeg = segment;
									// var check = startSeg.point.equals([262.80000000000007, 259.97641876494305])
									// check && console.log("check")
			do {
				curveChain.push(segment);
				if (windConfident === null || slowPath) {
					crv = segment.getCurve();
					// Determine the winding contribution of this curve
					wind = calculateWinding(crv, 0.5, monoCurves, subtract);
					// Record the length covered by this winding number,
					// we need this if we were to revert to a slow path later
					length = crv.getLength();
					windings[wind] = windings[wind]
							? windings[wind] + length : length;
					// Check if we can declare a probable winding direction for
					// this curve chain or not
					if (!slowPath) {
						if (windCommon === null) {
							windCommon = wind;
						} else if (windCommon !== wind) {
							slowPath = true;
						}
						++numCurves;
						lenCurves += length;
						if (lenCurves > minCurveLenY && numCurves > minCurveNum)
							windConfident = windCommon;
					}
				}
				// Continue with next curve
				segment = segment.getNext();
			} while(segment && !segment._intersection && segment !== startSeg);
			// If didn't manage to find a consistent winding value,
			// we revert to a slower path.
			if (!windConfident) {
				if (curveChain.length && curveChain.length < 3) {
					// If don't have enough curves beween intersections, we
					// cannot use any method of ranking to determine a reliable
					// winding number. Split the midpoint into three points
					// along the curve and select the median winding.
					// TODO: Find the lasrgest of the curves
					crv = curveChain[0].getCurve();
					windings.length = 0;
					windings.push(1/3, 1/2, 2/3);
					for (j = windings.length - 1; j >= 0; j--)
						windings[j] = calculateWinding(crv, windings[j],
								monoCurves, subtract);
					windings.sort();
					windConfident = windings[1];
				} else {
					// select the winding number from the accumulated values,
					// that covers most of the curve chain by arc length
					length = 0;
					for (j = windings.length - 1; j >= 0; j--) {
						wind = windings[j];
						if (wind != null && wind > length) {
							length = wind;
							windConfident = j;
						}
					}
				}
			}
				// DEBUG: ------------------------------------------------
				// console.log(windConfident, curveChain.length, startSeg.point.x, startSeg.point.y)
				// DEBUG: ------------------------------------------------
				
			// Assign the winding to the entire curve chain
			for (j = curveChain.length - 1; j >= 0; j--)
				curveChain[j]._winding = windConfident;
		}
		// Trace closed contours and insert them into the result;
		paths = PathItem._tracePaths(segments, operator);
		for (i = 0, l = paths.length; i < l; i++)
			result.addChild(paths[i], true);
		// Delete the proxies
		path1.remove();
		path2.remove();
		// And then, we are done.
		return result.reduce();
	}

	// Boolean operators return true if a curve with the given winding 
	// contribution contributes to the final result or not. They are called
	// for each curve in the graph after curves in the operands are
	// split at intersections.
	return /** @lends Path# */{
		/**
		 * Merges the geometry of the specified path from this path's
		 * geometry and returns the result as a new path item.
		 * 
		 * @param {PathItem} path the path to unite with
		 * @return {PathItem} the resulting path item
		 */
		unite: function(path) {
			return computeBoolean(this, path,
					function(isPath1, isInPath1, isInPath2) {
						return isInPath1 || isInPath2;
					});
		},

		/**
		 * Intersects the geometry of the specified path with this path's
		 * geometry and returns the result as a new path item.
		 * 
		 * @param {PathItem} path the path to intersect with
		 * @return {PathItem} the resulting path item
		 */
		intersect: function(path) {
			return computeBoolean(this, path,
					function(isPath1, isInPath1, isInPath2) {
						return !(isInPath1 || isInPath2);
					});
		},

		/**
		 * Subtracts the geometry of the specified path from this path's
		 * geometry and returns the result as a new path item.
		 * 
		 * @param {PathItem} path the path to subtract
		 * @return {PathItem} the resulting path item
		 */
		subtract: function(path) {
			return computeBoolean(this, path,
					function(isPath1, isInPath1, isInPath2) {
						return isPath1 && isInPath2 || !isPath1 && !isInPath1;
					}, true);
		},

		// Compound boolean operators combine the basic boolean operations such
		// as union, intersection, subtract etc. 
		// TODO: cache the split objects and find a way to properly clone them!
		/**
		 * Excludes the intersection of the geometry of the specified path with
		 * this path's geometry and returns the result as a new group item.
		 * 
		 * @param {PathItem} path the path to exclude the intersection of
		 * @return {Group} the resulting group item
		 */
		exclude: function(path) {
			return new Group([this.subtract(path), path.subtract(this)]);
		},

		/**
		 * Splits the geometry of this path along the geometry of the specified
		 * path returns the result as a new group item.
		 * 
		 * @param {PathItem} path the path to divide by
		 * @return {Group} the resulting group item
		 */
		divide: function(path) {
			return new Group([this.subtract(path), this.intersect(path)]);
		}
	};
});