chore: merge blocksuite source code (#9213)

2026-08-21 12:02:15 +08:00 · 2024-12-20 15:38:06 +08:00
parent 2c9ef916f4
commit 30200ff86d
2031 changed files with 238888 additions and 229 deletions
@@ -0,0 +1,77 @@
+import { absolutize } from '../path-data-parser/absolutize.js';
+import { normalize } from '../path-data-parser/normalize.js';
+import { parsePath } from '../path-data-parser/parser.js';
+import { pointsOnBezierCurves, simplify } from '../points-on-curve/index.js';
+import type { Point } from '../rough/geometry.js';
+
+export function pointsOnPath(
+  path: string,
+  tolerance?: number,
+  distance?: number
+): Point[][] {
+  const segments = parsePath(path);
+  const normalized = normalize(absolutize(segments));
+
+  const sets: Point[][] = [];
+  let currentPoints: Point[] = [];
+  let start: Point = [0, 0];
+  let pendingCurve: Point[] = [];
+
+  const appendPendingCurve = () => {
+    if (pendingCurve.length >= 4) {
+      currentPoints.push(...pointsOnBezierCurves(pendingCurve, tolerance));
+    }
+    pendingCurve = [];
+  };
+
+  const appendPendingPoints = () => {
+    appendPendingCurve();
+    if (currentPoints.length) {
+      sets.push(currentPoints);
+      currentPoints = [];
+    }
+  };
+
+  for (const { key, data } of normalized) {
+    switch (key) {
+      case 'M':
+        appendPendingPoints();
+        start = [data[0], data[1]];
+        currentPoints.push(start);
+        break;
+      case 'L':
+        appendPendingCurve();
+        currentPoints.push([data[0], data[1]]);
+        break;
+      case 'C':
+        if (!pendingCurve.length) {
+          const lastPoint = currentPoints.length
+            ? currentPoints[currentPoints.length - 1]
+            : start;
+          pendingCurve.push([lastPoint[0], lastPoint[1]]);
+        }
+        pendingCurve.push([data[0], data[1]]);
+        pendingCurve.push([data[2], data[3]]);
+        pendingCurve.push([data[4], data[5]]);
+        break;
+      case 'Z':
+        appendPendingCurve();
+        currentPoints.push([start[0], start[1]]);
+        break;
+    }
+  }
+  appendPendingPoints();
+
+  if (!distance) {
+    return sets;
+  }
+
+  const out: Point[][] = [];
+  for (const set of sets) {
+    const simplifiedSet = simplify(set, distance);
+    if (simplifiedSet.length) {
+      out.push(simplifiedSet);
+    }
+  }
+  return out;
+}