From a798b553a2ec0cc43f6de33cfd15d3d97c6c4207 Mon Sep 17 00:00:00 2001
From: hkrish <hari.exeption@gmail.com>
Date: Fri, 14 Feb 2014 22:52:32 +0100
Subject: [PATCH] Remove old tracePaths method

---
 src/path/PathItem.js | 78 --------------------------------------------
 1 file changed, 78 deletions(-)

diff --git a/src/path/PathItem.js b/src/path/PathItem.js
index 18f2a5a4..5bb82aa0 100644
--- a/src/path/PathItem.js
+++ b/src/path/PathItem.js
@@ -632,84 +632,6 @@ var PathItem = Item.extend(/** @lends PathItem# */{
 		return paths;
 	},
 
-	_tracePathsOld: function(segments, operator) {
-		var seg, nextSeg, startSeg, startSegIx, i, len, ixOther, prev,
-			ixOtherSeg, c1, c2, c3,
-			wind, w1, w3, s1, s3, path, nextHandleIn,
-			paths = [];
-		for (i = 0, len = segments.length; i < len; i++) {
-			startSeg = seg = segments[i];
-			if (seg._visited || !operator(seg._winding))
-				continue;
-			// Initialise a new path chain with the seed segment.
-			path = new paper.Path();
-			wind = seg._winding;
-			ixOther = seg._intersection;
-			startSegIx = ixOther ? ixOther._segment : null;
-			// Set the correct handles for this segment
-			prev = seg.getPrevious();
-			if (ixOther && prev && prev._visited)
-				seg._handleIn = new paper.Point(0, 0);
-			do {
-				nextHandleIn = nextHandleIn || seg._handleIn;
-				path.add(new paper.Segment(seg._point, nextHandleIn,
-						seg._handleOut));
-				nextHandleIn = null;
-				seg._visited = true;
-				seg = (seg._nextPathSegment ? seg._nextPathSegment :
-						seg).getNext();
-				// This segments's _intersection property holds a reference to
-				// the intersection on the other curve.
-				ixOther = seg ? seg._intersection : null;
-				if (ixOther && (ixOtherSeg = ixOther._segment) &&
-						ixOtherSeg !== startSeg) {
-					c1 = seg.getCurve();
-					c2 = c1.getPrevious();
-					c3 = ixOtherSeg.getCurve();
-					// c2 is the entry point in the direction we are 
-					// traversing the graph; sort c1 and c3 curves based on c2.
-					w1 = c1._segment1._winding;
-					w3 = c3._segment1._winding;
-					nextSeg = null;
-					s1 = c1.getSegment1();
-					s3 = c3.getSegment1();
-					if (wind === w1 && !s1._visited) {
-						nextSeg = s1;
-					} else if (wind === w3 && !s3._visited) {
-						nextSeg = s3;
-					}
-					if (nextSeg)
-						nextHandleIn = seg._handleIn;
-					seg = nextSeg || seg;
-					seg._winding = wind;
-				}
-			} while(seg && seg !== startSeg && seg !== startSegIx &&
-					!seg._visited && operator(seg._winding));
-			// Finish with closing the paths if necessary, correctly
-			// linking up curves etc.
-			if (seg && (seg == startSeg || seg == startSegIx)){
-				if (path.segments.length === 1) {
-					// This is still a valid path, in case of self-Intersections
-					path.add(new paper.Segment(seg._point, seg._handleIn, null));
-				} else {
-					path.firstSegment.setHandleIn((seg == startSegIx)?
-							startSegIx._handleIn : startSeg._handleIn);
-				}
-			}
-			path.setClosed(true);
-			// Add the path to the result
-			// Try to avoid stray segments and incomplete paths.
-			if (path.segments.length > 2 || (path.segments.length === 2 &&
-					(!path.getCurves()[0].isLinear() ||
-					!path.getCurves()[1].isLinear()))) {
-				paths.push(path);
-			} else {
-				path.remove();
-			}
-		}
-		return paths;
-	},
-
 	_conditionIntersections: function(locations, expand) {
 		function compare(loc1, loc2) {
 			var path1 = loc1.getPath(),