Spaces:
Running
Running
File size: 9,545 Bytes
3c778ff | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 | // Originated from pdfkit Copyright (c) 2014 Devon Govett
// https://github.com/foliojs/pdfkit/blob/1e62e6ffe24b378eb890df507a47610f4c4a7b24/lib/path.js
// MIT LICENSE
// Updated for pdf-lib & TypeScript by Jeremy Messenger
import {
appendBezierCurve,
appendQuadraticCurve,
closePath,
lineTo,
moveTo,
} from 'src/api/operators';
import { PDFOperator } from 'src/core';
let cx: number = 0;
let cy: number = 0;
let px: number | null = 0;
let py: number | null = 0;
let sx: number = 0;
let sy: number = 0;
const parameters = new Map<string, number>([
['A', 7],
['a', 7],
['C', 6],
['c', 6],
['H', 1],
['h', 1],
['L', 2],
['l', 2],
['M', 2],
['m', 2],
['Q', 4],
['q', 4],
['S', 4],
['s', 4],
['T', 2],
['t', 2],
['V', 1],
['v', 1],
['Z', 0],
['z', 0],
]);
interface Cmd {
cmd?: string;
args: number[];
}
const parse = (path: string) => {
let cmd;
const ret: Cmd[] = [];
let args: number[] = [];
let curArg = '';
let foundDecimal = false;
let params = 0;
for (const c of path) {
if (parameters.has(c)) {
params = parameters.get(c)!;
if (cmd) {
// save existing command
if (curArg.length > 0) {
args[args.length] = +curArg;
}
ret[ret.length] = { cmd, args };
args = [];
curArg = '';
foundDecimal = false;
}
cmd = c;
} else if (
[' ', ','].includes(c) ||
(c === '-' && curArg.length > 0 && curArg[curArg.length - 1] !== 'e') ||
(c === '.' && foundDecimal)
) {
if (curArg.length === 0) {
continue;
}
if (args.length === params) {
// handle reused commands
ret[ret.length] = { cmd, args };
args = [+curArg];
// handle assumed commands
if (cmd === 'M') {
cmd = 'L';
}
if (cmd === 'm') {
cmd = 'l';
}
} else {
args[args.length] = +curArg;
}
foundDecimal = c === '.';
// fix for negative numbers or repeated decimals with no delimeter between commands
curArg = ['-', '.'].includes(c) ? c : '';
} else {
curArg += c;
if (c === '.') {
foundDecimal = true;
}
}
}
// add the last command
if (curArg.length > 0) {
if (args.length === params) {
// handle reused commands
ret[ret.length] = { cmd, args };
args = [+curArg];
// handle assumed commands
if (cmd === 'M') {
cmd = 'L';
}
if (cmd === 'm') {
cmd = 'l';
}
} else {
args[args.length] = +curArg;
}
}
ret[ret.length] = { cmd, args };
return ret;
};
const apply = (commands: Cmd[]) => {
// current point, control point, and subpath starting point
cx = cy = px = py = sx = sy = 0;
// run the commands
let cmds: PDFOperator[] = [];
for (let i = 0; i < commands.length; i++) {
const c = commands[i];
if (c.cmd && typeof runners[c.cmd] === 'function') {
const cmd = runners[c.cmd](c.args);
if (Array.isArray(cmd)) {
cmds = cmds.concat(cmd);
} else {
cmds.push(cmd);
}
}
}
return cmds;
};
interface CmdToOperatorsMap {
[cmd: string]: (a: number[]) => PDFOperator | PDFOperator[];
}
const runners: CmdToOperatorsMap = {
M(a) {
cx = a[0];
cy = a[1];
px = py = null;
sx = cx;
sy = cy;
return moveTo(cx, cy);
},
m(a) {
cx += a[0];
cy += a[1];
px = py = null;
sx = cx;
sy = cy;
return moveTo(cx, cy);
},
C(a) {
cx = a[4];
cy = a[5];
px = a[2];
py = a[3];
return appendBezierCurve(a[0], a[1], a[2], a[3], a[4], a[5]);
},
c(a) {
const cmd = appendBezierCurve(
a[0] + cx,
a[1] + cy,
a[2] + cx,
a[3] + cy,
a[4] + cx,
a[5] + cy,
);
px = cx + a[2];
py = cy + a[3];
cx += a[4];
cy += a[5];
return cmd;
},
S(a) {
if (px === null || py === null) {
px = cx;
py = cy;
}
const cmd = appendBezierCurve(
cx - (px - cx),
cy - (py - cy),
a[0],
a[1],
a[2],
a[3],
);
px = a[0];
py = a[1];
cx = a[2];
cy = a[3];
return cmd;
},
s(a) {
if (px === null || py === null) {
px = cx;
py = cy;
}
const cmd = appendBezierCurve(
cx - (px - cx),
cy - (py - cy),
cx + a[0],
cy + a[1],
cx + a[2],
cy + a[3],
);
px = cx + a[0];
py = cy + a[1];
cx += a[2];
cy += a[3];
return cmd;
},
Q(a) {
px = a[0];
py = a[1];
cx = a[2];
cy = a[3];
return appendQuadraticCurve(a[0], a[1], cx, cy);
},
q(a) {
const cmd = appendQuadraticCurve(
a[0] + cx,
a[1] + cy,
a[2] + cx,
a[3] + cy,
);
px = cx + a[0];
py = cy + a[1];
cx += a[2];
cy += a[3];
return cmd;
},
T(a) {
if (px === null || py === null) {
px = cx;
py = cy;
} else {
px = cx - (px - cx);
py = cy - (py - cy);
}
const cmd = appendQuadraticCurve(px, py, a[0], a[1]);
px = cx - (px - cx);
py = cy - (py - cy);
cx = a[0];
cy = a[1];
return cmd;
},
t(a) {
if (px === null || py === null) {
px = cx;
py = cy;
} else {
px = cx - (px - cx);
py = cy - (py - cy);
}
const cmd = appendQuadraticCurve(px, py, cx + a[0], cy + a[1]);
cx += a[0];
cy += a[1];
return cmd;
},
A(a) {
const cmds = solveArc(cx, cy, a);
cx = a[5];
cy = a[6];
return cmds;
},
a(a) {
a[5] += cx;
a[6] += cy;
const cmds = solveArc(cx, cy, a);
cx = a[5];
cy = a[6];
return cmds;
},
L(a) {
cx = a[0];
cy = a[1];
px = py = null;
return lineTo(cx, cy);
},
l(a) {
cx += a[0];
cy += a[1];
px = py = null;
return lineTo(cx, cy);
},
H(a) {
cx = a[0];
px = py = null;
return lineTo(cx, cy);
},
h(a) {
cx += a[0];
px = py = null;
return lineTo(cx, cy);
},
V(a) {
cy = a[0];
px = py = null;
return lineTo(cx, cy);
},
v(a) {
cy += a[0];
px = py = null;
return lineTo(cx, cy);
},
Z() {
const cmd = closePath();
cx = sx;
cy = sy;
return cmd;
},
z() {
const cmd = closePath();
cx = sx;
cy = sy;
return cmd;
},
};
const solveArc = (x: number, y: number, coords: number[]) => {
const [rx, ry, rot, large, sweep, ex, ey] = coords;
const segs = arcToSegments(ex, ey, rx, ry, large, sweep, rot, x, y);
const cmds: PDFOperator[] = [];
for (const seg of segs) {
const bez = segmentToBezier(...seg);
cmds.push(appendBezierCurve(...bez));
}
return cmds;
};
type Segment = [number, number, number, number, number, number, number, number];
type Bezier = [number, number, number, number, number, number];
// from Inkscape svgtopdf, thanks!
const arcToSegments = (
x: number,
y: number,
rx: number,
ry: number,
large: number,
sweep: number,
rotateX: number,
ox: number,
oy: number,
) => {
const th = rotateX * (Math.PI / 180);
const sinTh = Math.sin(th);
const cosTh = Math.cos(th);
rx = Math.abs(rx);
ry = Math.abs(ry);
px = cosTh * (ox - x) * 0.5 + sinTh * (oy - y) * 0.5;
py = cosTh * (oy - y) * 0.5 - sinTh * (ox - x) * 0.5;
let pl = (px * px) / (rx * rx) + (py * py) / (ry * ry);
if (pl > 1) {
pl = Math.sqrt(pl);
rx *= pl;
ry *= pl;
}
const a00 = cosTh / rx;
const a01 = sinTh / rx;
const a10 = -sinTh / ry;
const a11 = cosTh / ry;
const x0 = a00 * ox + a01 * oy;
const y0 = a10 * ox + a11 * oy;
const x1 = a00 * x + a01 * y;
const y1 = a10 * x + a11 * y;
const d = (x1 - x0) * (x1 - x0) + (y1 - y0) * (y1 - y0);
let sfactorSq = 1 / d - 0.25;
if (sfactorSq < 0) {
sfactorSq = 0;
}
let sfactor = Math.sqrt(sfactorSq);
if (sweep === large) {
sfactor = -sfactor;
}
const xc = 0.5 * (x0 + x1) - sfactor * (y1 - y0);
const yc = 0.5 * (y0 + y1) + sfactor * (x1 - x0);
const th0 = Math.atan2(y0 - yc, x0 - xc);
const th1 = Math.atan2(y1 - yc, x1 - xc);
let thArc = th1 - th0;
if (thArc < 0 && sweep === 1) {
thArc += 2 * Math.PI;
} else if (thArc > 0 && sweep === 0) {
thArc -= 2 * Math.PI;
}
const segments = Math.ceil(Math.abs(thArc / (Math.PI * 0.5 + 0.001)));
const result: Segment[] = [];
for (let i = 0; i < segments; i++) {
const th2 = th0 + (i * thArc) / segments;
const th3 = th0 + ((i + 1) * thArc) / segments;
result[i] = [xc, yc, th2, th3, rx, ry, sinTh, cosTh];
}
return result;
};
const segmentToBezier = (
cx1: number,
cy1: number,
th0: number,
th1: number,
rx: number,
ry: number,
sinTh: number,
cosTh: number,
) => {
const a00 = cosTh * rx;
const a01 = -sinTh * ry;
const a10 = sinTh * rx;
const a11 = cosTh * ry;
const thHalf = 0.5 * (th1 - th0);
const t =
((8 / 3) * Math.sin(thHalf * 0.5) * Math.sin(thHalf * 0.5)) /
Math.sin(thHalf);
const x1 = cx1 + Math.cos(th0) - t * Math.sin(th0);
const y1 = cy1 + Math.sin(th0) + t * Math.cos(th0);
const x3 = cx1 + Math.cos(th1);
const y3 = cy1 + Math.sin(th1);
const x2 = x3 + t * Math.sin(th1);
const y2 = y3 - t * Math.cos(th1);
const result: Bezier = [
a00 * x1 + a01 * y1,
a10 * x1 + a11 * y1,
a00 * x2 + a01 * y2,
a10 * x2 + a11 * y2,
a00 * x3 + a01 * y3,
a10 * x3 + a11 * y3,
];
return result;
};
export const svgPathToOperators = (path: string) => apply(parse(path));
|