From abf70378fe3aba34cc98bfe88b9713465c9d0314 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?J=C3=BCrg=20Lehni?= Date: Wed, 9 Sep 2015 08:15:43 +0200 Subject: [PATCH] Some more code fixes. One was breaking unit tests. --- src/path/Curve.js | 2 +- src/path/PathItem.js | 4 ++-- 2 files changed, 3 insertions(+), 3 deletions(-) diff --git a/src/path/Curve.js b/src/path/Curve.js index a51ee2dd..32b6eb25 100644 --- a/src/path/Curve.js +++ b/src/path/Curve.js @@ -1328,7 +1328,7 @@ new function() { // Scope for intersection using bezier fat-line clipping if (t2 == null) t2 = Curve.getParameterOf(v2, p2.x, p2.y); loc = new CurveLocation( - c1, t1, p1 || Curve.getPoint(v1, t1), + c1, t1, p1 || Curve.getPoint(v1, t1), c2, t2, p2 || Curve.getPoint(v2, t2)); if (param.adjust) param.adjust(loc); diff --git a/src/path/PathItem.js b/src/path/PathItem.js index bd8c9772..a4346539 100644 --- a/src/path/PathItem.js +++ b/src/path/PathItem.js @@ -104,8 +104,8 @@ var PathItem = Item.extend(/** @lends PathItem# */{ // Self intersecting is found by dividing the curve in two // and and then applying the normal curve intersection code. var parts = Curve.subdivide(values1); - Curve._getIntersections( - parts[0], parts[1], curve1, curve1, locations, { + Curve._getIntersections(parts[0], parts[1], curve1, curve1, + locations, { // Only possible if there is only one curve: startConnected: length1 === 1, // After splitting, the end is always connected: