scratchfoundation/paper.js
1
0
Fork 0
mirror of https://github.com/scratchfoundation/paper.js.git synced 2025-01-23 07:49:48 -05:00
Code Issues Projects Releases Packages Wiki Activity Actions

Include copyright notice and clean up.

Browse source
This commit is contained in:
Jürg Lehni 2011-06-04 16:12:55 +01:00
parent 72ac909713
commit e097ff1303
2 changed files with 22 additions and 6 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

24
src/path/CurveFlattener.js
View file

@ -1,3 +1,19 @@
/*
* Paper.js
*
* This file is part of Paper.js, a JavaScript Vector Graphics Library,
* based on Scriptographer.org and designed to be largely API compatible.
* http://paperjs.org/
* http://scriptographer.org/
*
* Distributed under the MIT license. See LICENSE file for details.
*
* Copyright (c) 2011, Juerg Lehni & Jonathan Puckey
* http://lehni.org/ & http://jonathanpuckey.com/
*
* All rights reserved.
*/
var CurveFlattener = Base.extend({ var CurveFlattener = Base.extend({
initialize: function(curve) { initialize: function(curve) {
this.parts = []; this.parts = [];
@ -6,10 +22,10 @@ var CurveFlattener = Base.extend({
// optimise for iterator-like usage of the flattener. // optimise for iterator-like usage of the flattener.
this.index = 0; this.index = 0;
this.curve = curve.getCurveValues(); this.curve = curve.getCurveValues();
this._computeSegments(this.curve, 0, 1); this._computeParts(this.curve, 0, 1);
}, },
_computeSegments: function(values, minT, maxT) { _computeParts: function(values, minT, maxT) {
// Check if the t-span is big enough for subdivision. // Check if the t-span is big enough for subdivision.
// We're not subdividing more than 32 times... // We're not subdividing more than 32 times...
if ((maxT - minT) > 1 / 32 if ((maxT - minT) > 1 / 32
@ -17,8 +33,8 @@ var CurveFlattener = Base.extend({
var curves = Curve.subdivide.apply(Curve, values); var curves = Curve.subdivide.apply(Curve, values);
var halfT = (minT + maxT) / 2; var halfT = (minT + maxT) / 2;
// Recursively subdive and compute parts again. // Recursively subdive and compute parts again.
this._computeSegments(curves[0], minT, halfT); this._computeParts(curves[0], minT, halfT);
this._computeSegments(curves[1], halfT, maxT); this._computeParts(curves[1], halfT, maxT);
} else { } else {
// Calculate distance between p1 and p2 // Calculate distance between p1 and p2
var x = values[6] - values[0], var x = values[6] - values[0],

4
src/path/Path.js
View file

@ -834,8 +834,8 @@ var Path = this.Path = PathItem.extend({
// We cannot use the path created by drawSegments above // We cannot use the path created by drawSegments above
// Use CurveFlatteners to draw dashed paths: // Use CurveFlatteners to draw dashed paths:
ctx.beginPath(); ctx.beginPath();
var curves = this.getCurves(); drawDashes(ctx, this.getCurves(), dashArray,
drawDashes(ctx, curves, dashArray, this.getDashOffset()); this.getDashOffset());
} }
ctx.stroke(); ctx.stroke();
} }