@weasel-js/core 1.15.0 → 1.15.1

package/dist/core/pages/pages.js.map

@@ -1 +1 @@
-{"version":3,"file":"pages.js","names":[],"sources":["../../../src/core/pages/pages.ts"],"sourcesContent":["import type { Bounds } from '@weasel-js/routing';\n\n/** One page of a document: a sheet of a fixed size, in world units. */\nexport interface Page {\n  readonly id: string;\n  readonly name?: string;\n  readonly width: number;\n  readonly height: number;\n}\n\n/** A page and where it sits in world space. */\nexport interface PlacedPage extends Page {\n  readonly x: number;\n  readonly y: number;\n  /** Its place in the document's page order. */\n  readonly index: number;\n}\n\n/** Options for {@link layoutPages}. */\nexport interface PageLayoutOptions {\n  /** Which way the pages run. Default `'row'`. */\n  direction?: 'row' | 'column';\n  /** World units between neighbors. Default 40. */\n  gap?: number;\n  /** Where a page sits across the run, against the largest page. Default `'start'`. */\n  align?: 'start' | 'center' | 'end';\n  /** Where the first page's run starts. Default the world origin. */\n  origin?: { readonly x: number; readonly y: number };\n}\n\nconst ALIGN = { start: 0, center: 0.5, end: 1 } as const;\n\n/**\n * Place a document's pages in one world space, in order, so a single scene,\n * view, and history serve all of them. With the defaults the first page's\n * top-left corner is the world origin, where a one-page document's page is.\n * Throws on two pages with one id.\n */\nexport function layoutPages(pages: readonly Page[], options: PageLayoutOptions = {}): PlacedPage[] {\n  const { direction = 'row', gap = 40, align = 'start', origin = { x: 0, y: 0 } } = options;\n  const row = direction === 'row';\n  const across = Math.max(0, ...pages.map((p) => (row ? p.height : p.width)));\n  const seen = new Set<string>();\n  let along = 0;\n  return pages.map((page, index) => {\n    if (seen.has(page.id)) throw new Error(`layoutPages: two pages have the id \"${page.id}\"`);\n    seen.add(page.id);\n    const offset = (across - (row ? page.height : page.width)) * ALIGN[align];\n    const placed = {\n      ...page,\n      x: origin.x + (row ? along : offset),\n      y: origin.y + (row ? offset : along),\n      index,\n    };\n    along += (row ? page.width : page.height) + gap;\n    return placed;\n  });\n}\n\n/** The name page `index` of the page order shows: its own, else \"Page\" and its place. */\nexport function pageName(page: { readonly name?: string | undefined }, index: number): string {\n  return page.name ?? `Page ${index + 1}`;\n}\n\n/** The page under a world point, or `null` between and outside them. A point on an edge is on the page. */\nexport function pageAt(\n  pages: readonly PlacedPage[],\n  point: { readonly x: number; readonly y: number },\n): PlacedPage | null {\n  return pageOfBounds(pages, { x: point.x, y: point.y, width: 0, height: 0 });\n}\n\nfunction overlap(page: PlacedPage, b: Bounds): number | null {\n  const w = Math.min(page.x + page.width, b.x + b.width) - Math.max(page.x, b.x);\n  const h = Math.min(page.y + page.height, b.y + b.height) - Math.max(page.y, b.y);\n  return w < 0 || h < 0 ? null : w * h;\n}\n\n/**\n * The page a world-space box belongs to: the one it overlaps most, the earlier\n * of two it overlaps equally, and `null` when it touches none. This is the\n * rule that says which page an object is on.\n */\nexport function pageOfBounds(pages: readonly PlacedPage[], bounds: Bounds): PlacedPage | null {\n  let best: PlacedPage | null = null;\n  let most = -1;\n  for (const page of pages) {\n    const area = overlap(page, bounds);\n    if (area !== null && area > most) {\n      best = page;\n      most = area;\n    }\n  }\n  return best;\n}\n\nfunction gap(page: PlacedPage, b: Bounds): number {\n  const dx = Math.max(page.x - (b.x + b.width), b.x - (page.x + page.width), 0);\n  const dy = Math.max(page.y - (b.y + b.height), b.y - (page.y + page.height), 0);\n  return Math.hypot(dx, dy);\n}\n\n/**\n * The page a world-space box is held by: the one it is on (`pageOfBounds`),\n * else the one nearest it by the box-to-box gap, the earlier of two equally\n * near. `null` only with no pages. Used where every object must land on some\n * page, such as an export; `pageOfBounds` stays the rule for what is on one.\n */\nexport function pageHolding(pages: readonly PlacedPage[], bounds: Bounds): PlacedPage | null {\n  const on = pageOfBounds(pages, bounds);\n  if (on !== null) return on;\n  let best: PlacedPage | null = null;\n  let least = Infinity;\n  for (const page of pages) {\n    const d = gap(page, bounds);\n    if (d < least) {\n      best = page;\n      least = d;\n    }\n  }\n  return best;\n}\n\n/**\n * The page `step` places along the page order from the one with id `current`:\n * the next slide is `1`, the one before is `-1`. `null` past either end, unless\n * `wrap`. With no current page in the list, a step forward starts at the first\n * page and a step back at the last.\n */\nexport function adjacentPage(\n  pages: readonly PlacedPage[],\n  current: string | null,\n  step: number,\n  options: { wrap?: boolean } = {},\n): PlacedPage | null {\n  const n = pages.length;\n  if (n === 0) return null;\n  const at = pages.findIndex((p) => p.id === current);\n  if (at < 0) return pages[step < 0 ? n - 1 : 0] ?? null;\n  const to = at + step;\n  return pages[options.wrap ? ((to % n) + n) % n : to] ?? null;\n}\n\n/** The box around every page, or `null` for a document with none. */\nexport function pagesBounds(pages: readonly PlacedPage[]): Bounds | null {\n  if (pages.length === 0) return null;\n  const x = Math.min(...pages.map((p) => p.x));\n  const y = Math.min(...pages.map((p) => p.y));\n  return {\n    x,\n    y,\n    width: Math.max(...pages.map((p) => p.x + p.width)) - x,\n    height: Math.max(...pages.map((p) => p.y + p.height)) - y,\n  };\n}\n"],"mappings":";AA8BA,IAAM,QAAQ;CAAE,OAAO;CAAG,QAAQ;CAAK,KAAK;AAAE;;;;;;;AAQ9C,SAAgB,YAAY,OAAwB,UAA6B,CAAC,GAAiB;CACjG,MAAM,EAAE,YAAY,OAAO,MAAM,IAAI,QAAQ,SAAS,SAAS;EAAE,GAAG;EAAG,GAAG;CAAE,MAAM;CAClF,MAAM,MAAM,cAAc;CAC1B,MAAM,SAAS,KAAK,IAAI,GAAG,GAAG,MAAM,KAAK,MAAO,MAAM,EAAE,SAAS,EAAE,KAAM,CAAC;CAC1E,MAAM,uBAAO,IAAI,IAAY;CAC7B,IAAI,QAAQ;CACZ,OAAO,MAAM,KAAK,MAAM,UAAU;EAChC,IAAI,KAAK,IAAI,KAAK,EAAE,GAAG,MAAM,IAAI,MAAM,uCAAuC,KAAK,GAAG,EAAE;EACxF,KAAK,IAAI,KAAK,EAAE;EAChB,MAAM,UAAU,UAAU,MAAM,KAAK,SAAS,KAAK,UAAU,MAAM;EACnE,MAAM,SAAS;GACb,GAAG;GACH,GAAG,OAAO,KAAK,MAAM,QAAQ;GAC7B,GAAG,OAAO,KAAK,MAAM,SAAS;GAC9B;EACF;EACA,UAAU,MAAM,KAAK,QAAQ,KAAK,UAAU;EAC5C,OAAO;CACT,CAAC;AACH;;AAGA,SAAgB,SAAS,MAA8C,OAAuB;CAC5F,OAAO,KAAK,QAAQ,QAAQ,QAAQ;AACtC;;AAGA,SAAgB,OACd,OACA,OACmB;CACnB,OAAO,aAAa,OAAO;EAAE,GAAG,MAAM;EAAG,GAAG,MAAM;EAAG,OAAO;EAAG,QAAQ;CAAE,CAAC;AAC5E;AAEA,SAAS,QAAQ,MAAkB,GAA0B;CAC3D,MAAM,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK,OAAO,EAAE,IAAI,EAAE,KAAK,IAAI,KAAK,IAAI,KAAK,GAAG,EAAE,CAAC;CAC7E,MAAM,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK,QAAQ,EAAE,IAAI,EAAE,MAAM,IAAI,KAAK,IAAI,KAAK,GAAG,EAAE,CAAC;CAC/E,OAAO,IAAI,KAAK,IAAI,IAAI,OAAO,IAAI;AACrC;;;;;;AAOA,SAAgB,aAAa,OAA8B,QAAmC;CAC5F,IAAI,OAA0B;CAC9B,IAAI,OAAO;CACX,KAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,OAAO,QAAQ,MAAM,MAAM;EACjC,IAAI,SAAS,QAAQ,OAAO,MAAM;GAChC,OAAO;GACP,OAAO;EACT;CACF;CACA,OAAO;AACT;AAEA,SAAS,IAAI,MAAkB,GAAmB;CAChD,MAAM,KAAK,KAAK,IAAI,KAAK,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,KAAK,IAAI,KAAK,QAAQ,CAAC;CAC5E,MAAM,KAAK,KAAK,IAAI,KAAK,KAAK,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,KAAK,IAAI,KAAK,SAAS,CAAC;CAC9E,OAAO,KAAK,MAAM,IAAI,EAAE;AAC1B;;;;;;;AAQA,SAAgB,YAAY,OAA8B,QAAmC;CAC3F,MAAM,KAAK,aAAa,OAAO,MAAM;CACrC,IAAI,OAAO,MAAM,OAAO;CACxB,IAAI,OAA0B;CAC9B,IAAI,QAAQ;CACZ,KAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,IAAI,IAAI,MAAM,MAAM;EAC1B,IAAI,IAAI,OAAO;GACb,OAAO;GACP,QAAQ;EACV;CACF;CACA,OAAO;AACT;;;;;;;AAQA,SAAgB,aACd,OACA,SACA,MACA,UAA8B,CAAC,GACZ;CACnB,MAAM,IAAI,MAAM;CAChB,IAAI,MAAM,GAAG,OAAO;CACpB,MAAM,KAAK,MAAM,WAAW,MAAM,EAAE,OAAO,OAAO;CAClD,IAAI,KAAK,GAAG,OAAO,MAAM,OAAO,IAAI,IAAI,IAAI,MAAM;CAClD,MAAM,KAAK,KAAK;CAChB,OAAO,MAAM,QAAQ,QAAS,KAAK,IAAK,KAAK,IAAI,OAAO;AAC1D;;AAGA,SAAgB,YAAY,OAA6C;CACvE,IAAI,MAAM,WAAW,GAAG,OAAO;CAC/B,MAAM,IAAI,KAAK,IAAI,GAAG,MAAM,KAAK,MAAM,EAAE,CAAC,CAAC;CAC3C,MAAM,IAAI,KAAK,IAAI,GAAG,MAAM,KAAK,MAAM,EAAE,CAAC,CAAC;CAC3C,OAAO;EACL;EACA;EACA,OAAO,KAAK,IAAI,GAAG,MAAM,KAAK,MAAM,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI;EACtD,QAAQ,KAAK,IAAI,GAAG,MAAM,KAAK,MAAM,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI;CAC1D;AACF"}
+{"version":3,"file":"pages.js","names":[],"sources":["../../../src/core/pages/pages.ts"],"sourcesContent":["import type { Bounds } from '@weasel-js/routing';\n\n/** One page of a document: a sheet of a fixed size, in world units. */\nexport interface Page {\n  readonly id: string;\n  readonly name?: string;\n  readonly width: number;\n  readonly height: number;\n  /** What other packages keep on the page, each under its owner's key (`'diagram:graph'`). Every page edit\n   *  carries it, and the page's placement copies it. */\n  readonly meta?: Readonly<Record<string, unknown>>;\n}\n\n/** A page and where it sits in world space. */\nexport interface PlacedPage extends Page {\n  readonly x: number;\n  readonly y: number;\n  /** Its place in the document's page order. */\n  readonly index: number;\n}\n\n/** Options for {@link layoutPages}. */\nexport interface PageLayoutOptions {\n  /** Which way the pages run. Default `'row'`. */\n  direction?: 'row' | 'column';\n  /** World units between neighbors. Default 40. */\n  gap?: number;\n  /** Where a page sits across the run, against the largest page. Default `'start'`. */\n  align?: 'start' | 'center' | 'end';\n  /** Where the first page's run starts. Default the world origin. */\n  origin?: { readonly x: number; readonly y: number };\n}\n\nconst ALIGN = { start: 0, center: 0.5, end: 1 } as const;\n\n/**\n * Place a document's pages in one world space, in order, so a single scene,\n * view, and history serve all of them. With the defaults the first page's\n * top-left corner is the world origin, where a one-page document's page is.\n * Throws on two pages with one id.\n */\nexport function layoutPages(pages: readonly Page[], options: PageLayoutOptions = {}): PlacedPage[] {\n  const { direction = 'row', gap = 40, align = 'start', origin = { x: 0, y: 0 } } = options;\n  const row = direction === 'row';\n  const across = Math.max(0, ...pages.map((p) => (row ? p.height : p.width)));\n  const seen = new Set<string>();\n  let along = 0;\n  return pages.map((page, index) => {\n    if (seen.has(page.id)) throw new Error(`layoutPages: two pages have the id \"${page.id}\"`);\n    seen.add(page.id);\n    const offset = (across - (row ? page.height : page.width)) * ALIGN[align];\n    const placed = {\n      ...page,\n      x: origin.x + (row ? along : offset),\n      y: origin.y + (row ? offset : along),\n      index,\n    };\n    along += (row ? page.width : page.height) + gap;\n    return placed;\n  });\n}\n\n/** The name page `index` of the page order shows: its own, else \"Page\" and its place. */\nexport function pageName(page: { readonly name?: string | undefined }, index: number): string {\n  return page.name ?? `Page ${index + 1}`;\n}\n\n/** The page under a world point, or `null` between and outside them. A point on an edge is on the page. */\nexport function pageAt(\n  pages: readonly PlacedPage[],\n  point: { readonly x: number; readonly y: number },\n): PlacedPage | null {\n  return pageOfBounds(pages, { x: point.x, y: point.y, width: 0, height: 0 });\n}\n\nfunction overlap(page: PlacedPage, b: Bounds): number | null {\n  const w = Math.min(page.x + page.width, b.x + b.width) - Math.max(page.x, b.x);\n  const h = Math.min(page.y + page.height, b.y + b.height) - Math.max(page.y, b.y);\n  return w < 0 || h < 0 ? null : w * h;\n}\n\n/**\n * The page a world-space box belongs to: the one it overlaps most, the earlier\n * of two it overlaps equally, and `null` when it touches none. This is the\n * rule that says which page an object is on.\n */\nexport function pageOfBounds(pages: readonly PlacedPage[], bounds: Bounds): PlacedPage | null {\n  let best: PlacedPage | null = null;\n  let most = -1;\n  for (const page of pages) {\n    const area = overlap(page, bounds);\n    if (area !== null && area > most) {\n      best = page;\n      most = area;\n    }\n  }\n  return best;\n}\n\nfunction gap(page: PlacedPage, b: Bounds): number {\n  const dx = Math.max(page.x - (b.x + b.width), b.x - (page.x + page.width), 0);\n  const dy = Math.max(page.y - (b.y + b.height), b.y - (page.y + page.height), 0);\n  return Math.hypot(dx, dy);\n}\n\n/**\n * The page a world-space box is held by: the one it is on (`pageOfBounds`),\n * else the one nearest it by the box-to-box gap, the earlier of two equally\n * near. `null` only with no pages. Used where every object must land on some\n * page, such as an export; `pageOfBounds` stays the rule for what is on one.\n */\nexport function pageHolding(pages: readonly PlacedPage[], bounds: Bounds): PlacedPage | null {\n  const on = pageOfBounds(pages, bounds);\n  if (on !== null) return on;\n  let best: PlacedPage | null = null;\n  let least = Infinity;\n  for (const page of pages) {\n    const d = gap(page, bounds);\n    if (d < least) {\n      best = page;\n      least = d;\n    }\n  }\n  return best;\n}\n\n/**\n * The page `step` places along the page order from the one with id `current`:\n * the next slide is `1`, the one before is `-1`. `null` past either end, unless\n * `wrap`. With no current page in the list, a step forward starts at the first\n * page and a step back at the last.\n */\nexport function adjacentPage(\n  pages: readonly PlacedPage[],\n  current: string | null,\n  step: number,\n  options: { wrap?: boolean } = {},\n): PlacedPage | null {\n  const n = pages.length;\n  if (n === 0) return null;\n  const at = pages.findIndex((p) => p.id === current);\n  if (at < 0) return pages[step < 0 ? n - 1 : 0] ?? null;\n  const to = at + step;\n  return pages[options.wrap ? ((to % n) + n) % n : to] ?? null;\n}\n\n/** The box around every page, or `null` for a document with none. */\nexport function pagesBounds(pages: readonly PlacedPage[]): Bounds | null {\n  if (pages.length === 0) return null;\n  const x = Math.min(...pages.map((p) => p.x));\n  const y = Math.min(...pages.map((p) => p.y));\n  return {\n    x,\n    y,\n    width: Math.max(...pages.map((p) => p.x + p.width)) - x,\n    height: Math.max(...pages.map((p) => p.y + p.height)) - y,\n  };\n}\n"],"mappings":";AAiCA,IAAM,QAAQ;CAAE,OAAO;CAAG,QAAQ;CAAK,KAAK;AAAE;;;;;;;AAQ9C,SAAgB,YAAY,OAAwB,UAA6B,CAAC,GAAiB;CACjG,MAAM,EAAE,YAAY,OAAO,MAAM,IAAI,QAAQ,SAAS,SAAS;EAAE,GAAG;EAAG,GAAG;CAAE,MAAM;CAClF,MAAM,MAAM,cAAc;CAC1B,MAAM,SAAS,KAAK,IAAI,GAAG,GAAG,MAAM,KAAK,MAAO,MAAM,EAAE,SAAS,EAAE,KAAM,CAAC;CAC1E,MAAM,uBAAO,IAAI,IAAY;CAC7B,IAAI,QAAQ;CACZ,OAAO,MAAM,KAAK,MAAM,UAAU;EAChC,IAAI,KAAK,IAAI,KAAK,EAAE,GAAG,MAAM,IAAI,MAAM,uCAAuC,KAAK,GAAG,EAAE;EACxF,KAAK,IAAI,KAAK,EAAE;EAChB,MAAM,UAAU,UAAU,MAAM,KAAK,SAAS,KAAK,UAAU,MAAM;EACnE,MAAM,SAAS;GACb,GAAG;GACH,GAAG,OAAO,KAAK,MAAM,QAAQ;GAC7B,GAAG,OAAO,KAAK,MAAM,SAAS;GAC9B;EACF;EACA,UAAU,MAAM,KAAK,QAAQ,KAAK,UAAU;EAC5C,OAAO;CACT,CAAC;AACH;;AAGA,SAAgB,SAAS,MAA8C,OAAuB;CAC5F,OAAO,KAAK,QAAQ,QAAQ,QAAQ;AACtC;;AAGA,SAAgB,OACd,OACA,OACmB;CACnB,OAAO,aAAa,OAAO;EAAE,GAAG,MAAM;EAAG,GAAG,MAAM;EAAG,OAAO;EAAG,QAAQ;CAAE,CAAC;AAC5E;AAEA,SAAS,QAAQ,MAAkB,GAA0B;CAC3D,MAAM,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK,OAAO,EAAE,IAAI,EAAE,KAAK,IAAI,KAAK,IAAI,KAAK,GAAG,EAAE,CAAC;CAC7E,MAAM,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK,QAAQ,EAAE,IAAI,EAAE,MAAM,IAAI,KAAK,IAAI,KAAK,GAAG,EAAE,CAAC;CAC/E,OAAO,IAAI,KAAK,IAAI,IAAI,OAAO,IAAI;AACrC;;;;;;AAOA,SAAgB,aAAa,OAA8B,QAAmC;CAC5F,IAAI,OAA0B;CAC9B,IAAI,OAAO;CACX,KAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,OAAO,QAAQ,MAAM,MAAM;EACjC,IAAI,SAAS,QAAQ,OAAO,MAAM;GAChC,OAAO;GACP,OAAO;EACT;CACF;CACA,OAAO;AACT;AAEA,SAAS,IAAI,MAAkB,GAAmB;CAChD,MAAM,KAAK,KAAK,IAAI,KAAK,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,KAAK,IAAI,KAAK,QAAQ,CAAC;CAC5E,MAAM,KAAK,KAAK,IAAI,KAAK,KAAK,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,KAAK,IAAI,KAAK,SAAS,CAAC;CAC9E,OAAO,KAAK,MAAM,IAAI,EAAE;AAC1B;;;;;;;AAQA,SAAgB,YAAY,OAA8B,QAAmC;CAC3F,MAAM,KAAK,aAAa,OAAO,MAAM;CACrC,IAAI,OAAO,MAAM,OAAO;CACxB,IAAI,OAA0B;CAC9B,IAAI,QAAQ;CACZ,KAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,IAAI,IAAI,MAAM,MAAM;EAC1B,IAAI,IAAI,OAAO;GACb,OAAO;GACP,QAAQ;EACV;CACF;CACA,OAAO;AACT;;;;;;;AAQA,SAAgB,aACd,OACA,SACA,MACA,UAA8B,CAAC,GACZ;CACnB,MAAM,IAAI,MAAM;CAChB,IAAI,MAAM,GAAG,OAAO;CACpB,MAAM,KAAK,MAAM,WAAW,MAAM,EAAE,OAAO,OAAO;CAClD,IAAI,KAAK,GAAG,OAAO,MAAM,OAAO,IAAI,IAAI,IAAI,MAAM;CAClD,MAAM,KAAK,KAAK;CAChB,OAAO,MAAM,QAAQ,QAAS,KAAK,IAAK,KAAK,IAAI,OAAO;AAC1D;;AAGA,SAAgB,YAAY,OAA6C;CACvE,IAAI,MAAM,WAAW,GAAG,OAAO;CAC/B,MAAM,IAAI,KAAK,IAAI,GAAG,MAAM,KAAK,MAAM,EAAE,CAAC,CAAC;CAC3C,MAAM,IAAI,KAAK,IAAI,GAAG,MAAM,KAAK,MAAM,EAAE,CAAC,CAAC;CAC3C,OAAO;EACL;EACA;EACA,OAAO,KAAK,IAAI,GAAG,MAAM,KAAK,MAAM,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI;EACtD,QAAQ,KAAK,IAAI,GAAG,MAAM,KAAK,MAAM,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI;CAC1D;AACF"}

package/dist/core/pages/pagesLayer.js

@@ -1,4 +1,4 @@
-//#region src/core/pages/pagesLayer.ts
+// src/core/pages/pagesLayer.ts
 /**
 * The sheets themselves: a world-space layer that paints each placed page as a
 * filled rect, to sit under the scene. Build it again when the pages or the
@@ -28,6 +28,5 @@ function pagesLayer(pages, options) {
 	};
 }
 
-//#endregion
 export { pagesLayer };
 //# sourceMappingURL=pagesLayer.js.map

package/dist/core/paint/meshKind.js

@@ -1,6 +1,6 @@
 import { meshDrawKind, meshFromStops, meshGradientXml, meshStops, seedMeshPatch } from "@weasel-js/renderer/mesh";
 
-//#region src/core/paint/meshKind.ts
+// src/core/paint/meshKind.ts
 var asMesh = (fill) => fill;
 var asFill = (mesh) => mesh;
 /** The `mesh-gradient` kind's registry entry. `./registerMesh` registers it;
@@ -16,6 +16,5 @@ var meshGradientKind = {
 	toSvg: (id, fill) => meshGradientXml(id, asMesh(fill))
 };
 
-//#endregion
 export { meshGradientKind };
 //# sourceMappingURL=meshKind.js.map

package/dist/core/paint/meshKindLazy.js

@@ -1,4 +1,4 @@
-//#region ../paint/src/hex.ts
+// ../paint/src/hex.ts
 const HEX = /^#(?:[0-9a-f]{3,4}|[0-9a-f]{6}|[0-9a-f]{8})$/i;
 /**
 * The kit's one hex color reader: `#rgb`, `#rgba`, `#rrggbb`, or `#rrggbbaa`,
@@ -17,8 +17,7 @@ function parseHexBytes(input) {
 		long.length === 8 ? byte(6) : 255
 	];
 }
-//#endregion
-//#region ../paint/src/colorSpaces.ts
+// ../paint/src/colorSpaces.ts
 const SRGB_TO_LINEAR = (() => {
 	const lut = /* @__PURE__ */ new Float64Array(256);
 	for (let i = 0; i < 256; i++) {
@@ -232,8 +231,7 @@ function hueToChannel(p, q, t) {
 	if (t < 2 / 3) return p + (q - p) * (2 / 3 - t) * 6;
 	return p;
 }
-//#endregion
-//#region ../paint/src/color.ts
+// ../paint/src/color.ts
 /**
 * Parse a CSS color string into [r, g, b, a] with 0..1 components.
 *
@@ -647,8 +645,7 @@ const NAMED_COLORS = (() => {
 	}
 	return out;
 })();
-//#endregion
-//#region ../geom/src/affine.ts
+// ../geom/src/affine.ts
 /**
 * 2D affine transforms in canvas/DOMMatrix order: [a, b, c, d, e, f].
 *   x' = a·x + c·y + e
@@ -679,8 +676,7 @@ function invert$1(m) {
 		-(m[4] * b + m[5] * d)
 	];
 }
-//#endregion
-//#region ../geom/src/glMat3.ts
+// ../geom/src/glMat3.ts
 /**
 * 2D affine matrix utilities. Column-major 9 elements, matching
 * `WebGL2RenderingContext.uniformMatrix3fv` element order so an upload needs
@@ -798,8 +794,7 @@ const mat3 = {
 	meanScaleOf,
 	minScaleOf
 };
-//#endregion
-//#region ../renderer/src/meshPaint/surface.ts
+// ../renderer/src/meshPaint/surface.ts
 /** Corner `i` of the boundary walk. */
 function patchCorner(patch, i) {
 	return patch.points[(i & 3) * 3];
@@ -1151,8 +1146,7 @@ var MeshBakeCache = class {
 		this.free(entry.value);
 	}
 };
-//#endregion
-//#region ../renderer/src/meshPaint/meshShader.ts
+// ../renderer/src/meshPaint/meshShader.ts
 /**
 * GLSL ES 3.0 sources for the mesh-gradient paint.
 *
@@ -1202,8 +1196,7 @@ void main() {
   outColor = vec4(texel.rgb * a, a);
 }
 `;
-//#endregion
-//#region ../renderer/src/meshPaint/meshPaint.ts
+// ../renderer/src/meshPaint/meshPaint.ts
 /** The kind's id, as `Paint['fill']` carries it. */
 const MESH_GRADIENT_KIND = "mesh-gradient";
 function asMesh$1(fill) {
@@ -1509,8 +1502,7 @@ function meshGradientXml(id, mesh) {
 function trim(n) {
 	return Number.isInteger(n) ? String(n) : String(Number(n.toFixed(4)));
 }
-//#endregion
-//#region src/core/paint/meshKind.ts
+// src/core/paint/meshKind.ts
 const asMesh = (fill) => fill;
 const asFill = (mesh) => mesh;
 /** The `mesh-gradient` kind's registry entry. `./registerMesh` registers it;
@@ -1525,7 +1517,6 @@ const meshGradientKind = {
 	fromStops: (stops) => asFill(meshFromStops(stops)),
 	toSvg: (id, fill) => meshGradientXml(id, asMesh(fill))
 };
-//#endregion
 export { meshGradientKind };
 
 //# sourceMappingURL=meshKindLazy.js.map