import Attributes from "./attributes"; import Point from "./point"; import Bezier from "bezier-js"; import { round } from "./round"; function Path() { this.render = true; this.topLeft = false; this.bottomRight = false; this.attributes = new Attributes(); this.ops = []; } /** Adds a move operation to Point to */ Path.prototype.move = function(to) { this.ops.push({ type: "move", to }); return this; }; /** Adds a line operation to Point to */ Path.prototype.line = function(to) { this.ops.push({ type: "line", to }); return this; }; /** Adds a line operation to Point to */ Path.prototype.curve = function(cp1, cp2, to) { this.ops.push({ type: "curve", cp1, cp2, to }); return this; }; /** Adds a close operation */ Path.prototype.close = function() { this.ops.push({ type: "close" }); return this; }; /** Adds an attribute. This is here to make this call chainable in assignment */ Path.prototype.attr = function(name, value, overwrite = false) { if (overwrite) this.attributes.set(name, value); else this.attributes.add(name, value); return this; }; /** Returns SVG pathstring for this path */ Path.prototype.asPathstring = function() { let d = ""; for (let op of this.ops) { switch (op.type) { case "move": d += `M ${op.to.x},${op.to.y}`; break; case "line": d += ` L ${op.to.x},${op.to.y}`; break; case "curve": d += ` C ${op.cp1.x},${op.cp1.y} ${op.cp2.x},${op.cp2.y} ${op.to.x},${ op.to.y }`; break; case "close": d += " z"; break; default: throw `${op.type} is not a valid path command`; break; } } return d; }; /** Returns offset of this path as a new path */ Path.prototype.offset = function(distance) { return pathOffset(this, distance); }; /** Returns the length of this path */ Path.prototype.length = function() { let current, start; let length = 0; for (let i in this.ops) { let op = this.ops[i]; if (op.type === "move") { start = op.to; } else if (op.type === "line") { length += op.from.dist(op.to); } else if (op.type === "curve") { length += new Bezier( { x: current.x, y: current.y }, { x: op.cp1.x, y: op.cp1.y }, { x: op.cp2.x, y: op.cp2.y }, { x: op.to.x, y: op.to.y } ).length(); } else if (op.type === "close") { length += current.dist(start); } if (op.to) current = op.to; } return round(length); }; /** Returns the startpoint of the path */ Path.prototype.start = function() { return this.ops[0].to; }; /** Returns the endpoint of the path */ Path.prototype.end = function() { let op = this.ops[this.ops.length - 1]; if (op.type === "close") return this.start(); else return op.to; }; /** Finds the bounding box of a path */ Path.prototype.boundary = function() { if (this.topLeft) return this; // Cached let current; let topLeft = new Point(Infinity, Infinity); let bottomRight = new Point(-Infinity, -Infinity); for (let i in this.ops) { let op = this.ops[i]; if (op.type === "move" || op.type === "line") { if (op.to.x < topLeft.x) topLeft.x = op.to.x; if (op.to.y < topLeft.y) topLeft.y = op.to.y; if (op.to.x > bottomRight.x) bottomRight.x = op.to.x; if (op.to.y > bottomRight.y) bottomRight.y = op.to.y; } else if (op.type === "curve") { let bb = new Bezier( { x: current.x, y: current.y }, { x: op.cp1.x, y: op.cp1.y }, { x: op.cp2.x, y: op.cp2.y }, { x: op.to.x, y: op.to.y } ).bbox(); if (bb.x.min < topLeft.x) topLeft.x = bb.x.min; if (bb.y.min < topLeft.y) topLeft.y = bb.y.min; if (bb.x.max > bottomRight.x) bottomRight.x = bb.x.max; if (bb.y.max > bottomRight.y) bottomRight.y = bb.y.max; } if (op.to) current = op.to; } this.topLeft = topLeft; this.bottomRight = bottomRight; return this; }; /** Returns a deep copy of this */ Path.prototype.clone = function() { let clone = new Path(); clone.render = this.render; if (this.topLeft) clone.topLeft = this.topLeft.clone(); else clone.topLeft = false; if (this.bottomRight) clone.bottomRight = this.bottomRight.clone(); else clone.bottomRight = false; clone.attributes = this.attributes.clone(); clone.ops = []; for (let i in this.ops) { let op = this.ops[i]; clone.ops[i] = { type: op.type }; if (op.type === "move" || op.type === "line") { clone.ops[i].to = op.to.clone(); } else if (op.type === "curve") { clone.ops[i].to = op.to.clone(); clone.ops[i].cp1 = op.cp1.clone(); clone.ops[i].cp2 = op.cp2.clone(); } } return clone; }; /** Joins this with that path, closes them if wanted */ Path.prototype.join = function(that, closed = false) { return joinPaths([this, that], closed); }; /** Offsets a path by distance */ function pathOffset(path, distance) { let offset = []; let current; let start = false; let closed = false; for (let i in path.ops) { let op = path.ops[i]; if (op.type === "line") { let segment = offsetLine(current, op.to, distance); if (segment) offset.push(segment); } else if (op.type === "curve") { // We need to avoid a control point sitting on top of start or end // because that will break the offset in bezier-js let cp1, cp2; if (current.sitsOn(op.cp1)) { cp1 = new Path() .move(current) .curve(op.cp1, op.cp2, op.to) .shiftAlong(1); } else cp1 = op.cp1; if (op.cp2.sitsOn(op.to)) { cp2 = new Path() .move(op.to) .curve(op.cp2, op.cp1, current) .shiftAlong(1); } else cp2 = op.cp2; let b = new Bezier( { x: current.x, y: current.y }, { x: cp1.x, y: cp1.y }, { x: cp2.x, y: cp2.y }, { x: op.to.x, y: op.to.y } ); for (let bezier of b.offset(distance)) offset.push(asPath(bezier)); } else if (op.type === "close") closed = true; if (op.to) current = op.to; if (!start) start = current; } return joinPaths(offset, closed); } /** Offsets a line by distance */ function offsetLine(from, to, distance) { // Cannot offset line that starts and ends in the same point if (from.x === to.x && from.y === to.y) return false; let angle = from.angle(to) - 90; return new Path() .move(from.shift(angle, distance)) .line(to.shift(angle, distance)); } /** Converts a bezier-js instance to a path */ function asPath(bezier) { return new Path() .move(new Point(bezier.points[0].x, bezier.points[0].y)) .curve( new Point(bezier.points[1].x, bezier.points[1].y), new Point(bezier.points[2].x, bezier.points[2].y), new Point(bezier.points[3].x, bezier.points[3].y) ); } /** Joins path segments together into one path */ function joinPaths(paths, closed = false) { let joint = new Path().move(paths[0].ops[0].to); for (let p of paths) { for (let op of p.ops) { if (op.type === "curve") { joint.curve(op.cp1, op.cp2, op.to); } else if (op.type !== "close") { joint.line(op.to); } else { throw "Close op not handled"; } } } if (closed) joint.close(); return joint; } /** Returns a point that lies at distance along this */ Path.prototype.shiftAlong = function(distance) { let len = 0; let current; for (let i in this.ops) { let op = this.ops[i]; if (op.type === "line") { let thisLen = op.to.dist(current); if (len + thisLen > distance) return current.shiftTowards(op.to, distance - len); else len += thisLen; } else if (op.type === "curve") { let bezier = new Bezier( { x: current.x, y: current.y }, { x: op.cp1.x, y: op.cp1.y }, { x: op.cp2.x, y: op.cp2.y }, { x: op.to.x, y: op.to.y } ); let thisLen = bezier.length(); if (len + thisLen > distance) return shiftAlongBezier(distance - len, bezier); else len += thisLen; } current = op.to; } throw "Ran out of curve to shift along"; }; /** Returns a point that lies at fraction along this */ Path.prototype.shiftFractionAlong = function(fraction) { return this.shiftAlong(this.length() * fraction); }; /** Returns a point that lies at distance along bezier */ function shiftAlongBezier(distance, bezier) { let steps = 100; let maxLength = bezier.length(); if (distance > maxLength) throw "Cannot shift further than the bezier length"; let previous, next, t, thisLen; let len = 0; for (let i = 0; i <= steps; i++) { t = i / steps; next = bezier.get(t); next = new Point(next.x, next.y); if (i > 0) { thisLen = next.dist(previous); if (len + thisLen > distance) return next; else len += thisLen; } previous = next; } } /** Returns a point at the top edge of a bounding box of this */ Path.prototype.bbox = function() { let bbs = []; let current; for (let i in this.ops) { let op = this.ops[i]; if (op.type === "line") { bbs.push(lineBoundingBox({ from: current, to: op.to })); } else if (op.type === "curve") { bbs.push( curveBoundingBox( new Bezier( { x: current.x, y: current.y }, { x: op.cp1.x, y: op.cp1.y }, { x: op.cp2.x, y: op.cp2.y }, { x: op.to.x, y: op.to.y } ) ) ); } if (op.to) current = op.to; } return bbbbox(bbs); }; function lineBoundingBox(line) { let from = line.from; let to = line.to; if (from.x === to.x) { if (from.y < to.y) return { topLeft: from, bottomRight: to }; else return { topLeft: to, bottomRight: from }; } else if (from.y === to.y) { if (from.x < to.x) return { topLeft: from, bottomRight: to }; else return { topLeft: to, bottomRight: from }; } else if (from.x < to.x) { if (from.y < to.y) return { topLeft: from, bottomRight: to }; else return { topLeft: new Point(from.x, to.y), bottomRight: new Point(to.x, from.y) }; } else if (from.x > to.x) { if (from.y < to.y) return { topLeft: to, bottomRight: from }; else return { topLeft: new Point(to.x, from.y), bottomRight: new Point(from.x, to.y) }; } else { throw "Unhandled scenario in Part.lineBoundingBox()"; } } function curveBoundingBox(curve) { let bb = curve.bbox(); return { topLeft: new Point(bb.x.min, bb.y.min), bottomRight: new Point(bb.x.max, bb.y.max) }; } function bbbbox(boxes) { let minX = Infinity; let maxX = -Infinity; let minY = Infinity; let maxY = -Infinity; for (let box of boxes) { if (box.topLeft.x < minX) minX = box.topLeft.x; if (box.topLeft.y < minY) minY = box.topLeft.y; if (box.bottomRight.x > maxX) maxX = box.bottomRight.x; if (box.bottomRight.y > maxY) maxY = box.bottomRight.y; } return { topLeft: new Point(minX, minY), bottomRight: new Point(maxX, maxY) }; } /** Returns a reversed version of this */ Path.prototype.reverse = function() { let sections = []; let current; let closed = false; for (let i in this.ops) { let op = this.ops[i]; if (op.type === "line") { if (!op.to.sitsOn(current)) sections.push(new Path().move(op.to).line(current)); } else if (op.type === "curve") { sections.push(new Path().move(op.to).curve(op.cp2, op.cp1, current)); } else if (op.type === "close") { closed = true; } if (op.to) current = op.to; } let rev = new Path().move(current); for (let section of sections.reverse()) rev.ops.push(section.ops[1]); if (closed) rev.close(); return rev; }; ///** Returns all points where this intersects with that */ //Path.prototype.intersectsWith(that) { // let sections = []; // let current; // let closed = false; // for (let i in this.ops) { // let op = this.ops[i]; // if (op.type === "line") { // if (!op.to.sitsOn(current)) // sections.push(new Path().move(op.to).line(current)); // } else if (op.type === "curve") { // sections.push(new Path().move(op.to).curve(op.cp2, op.cp1, current)); // } else if (op.type === "close") { // closed = true; // } // if (op.to) current = op.to; // } // if (closed) rev.close(); // //} // ///** Returns an array of paths that make up this path // * It's basically the opposite of Path.join() // */ //Path.prototype.divide() { // // //} export default Path;