ntk 8.14.5 → 8.14.7

package/lib/renderingcontext_2d.js

@@ -1899,11 +1899,12 @@ class RenderingContext2d {
    * well as the AddTraps: two requests become one, and the one that is left
    * touches only the bounding box.
    */
-  _uploadCoverage(job, b, out, edges) {
+  _uploadCoverage(job, b, out, edges, route) {
     const rasterizer = this.window.app.rasterizer;
     if (!rasterizer) return false;
-    if (routeRaster(b.w, b.h, edges, this.window.app.rasterPolicy) !== "local")
-      return false;
+    const where =
+      route ?? routeRaster(b.w, b.h, edges, this.window.app.rasterPolicy);
+    if (where !== "local") return false;
 
     // Rasterized over the whole box, as always, so a drawing that clips
     // split across passes — a pan's strips, a full repaint — gets the same
@@ -1978,6 +1979,84 @@ class RenderingContext2d {
     return out;
   }
 
+  /**
+   * A drawing's own extent: its box with the same pixel of slack as
+   * `_clampBBox`, and *not* clamped to the surface — what its masks are
+   * clustered and routed by (`_fillPolys`, the stroke's mask path).
+   *
+   * Which rasterizer draws a mask — ours or the server's — has to be a
+   * property of the drawing, never of where it lands. The two antialias
+   * differently, so a route taken from the part the surface shows changed
+   * as the drawing moved: a stroke whose cap had just left the surface had
+   * three triangles fewer to count, went to the other rasterizer, and came
+   * out up to ten levels different along its whole length — a pan's copy
+   * of it one way, the strip beside it the other. Clamping and culling
+   * decide how much work a mask is, never how it is drawn.
+   */
+  _rawBox(minX, minY, maxX, maxY) {
+    const x = Math.floor(minX) - 1;
+    const y = Math.floor(minY) - 1;
+    return { x, y, w: Math.ceil(maxX) + 1 - x, h: Math.ceil(maxY) + 1 - y };
+  }
+
+  /** `_rawBox` of one flat `[x0, y0, …]` point list; null for none. */
+  _pointsExtent(pts) {
+    let minX = Infinity;
+    let minY = Infinity;
+    let maxX = -Infinity;
+    let maxY = -Infinity;
+    for (let i = 0; i < pts.length; i += 2) {
+      if (pts[i] < minX) minX = pts[i];
+      if (pts[i] > maxX) maxX = pts[i];
+      if (pts[i + 1] < minY) minY = pts[i + 1];
+      if (pts[i + 1] > maxY) maxY = pts[i + 1];
+    }
+    if (!(maxX >= minX && maxY >= minY)) return null;
+    return this._rawBox(minX, minY, maxX, maxY);
+  }
+
+  /** `_rawBox` over every subpath of a flattened path; null for none. */
+  _polysExtent(polys) {
+    let out = null;
+    for (const poly of polys) {
+      const b = this._pointsExtent(poly.pts);
+      if (!b) continue;
+      out = out ? unionBox(out, b) : b;
+    }
+    return out;
+  }
+
+  /**
+   * Where a drawing whose own box is `box` is rasterized (`routeRaster`),
+   * sized by as much of it as the surface could ever show — each side no
+   * longer than the surface's, and its edges in the same proportion —
+   * rather than by the part it shows now: a route that depends only on the
+   * drawing's size and complexity is the same wherever the drawing lands
+   * (`_rawBox`). Counting every edge of a stroke that runs far past the
+   * surface sent it through the mask more often than the part it shows
+   * earned: a fifth more bytes a frame for a hundred such strokes.
+   */
+  _routeFor(box, edges) {
+    const w = Math.min(box.w, this.width);
+    const h = Math.min(box.h, this.height);
+    return routeRaster(
+      w,
+      h,
+      (edges * w * h) / (box.w * box.h),
+      this.window.app.rasterPolicy,
+    );
+  }
+
+  /** the part of a box on the surface; null where there is none */
+  _onSurface(b) {
+    const x = Math.max(0, b.x);
+    const y = Math.max(0, b.y);
+    const w = Math.min(this.width, b.x + b.w) - x;
+    const h = Math.min(this.height, b.y + b.h) - y;
+    if (w <= 0 || h <= 0) return null;
+    return { x, y, w, h };
+  }
+
   // a pixel of slack for the antialiased edge, clamped to the surface
   _clampBBox(minX, minY, maxX, maxY) {
     const x = Math.max(0, Math.floor(minX) - 1);
@@ -2030,7 +2109,7 @@ class RenderingContext2d {
    *
    * @returns {boolean} whether anything was composited
    */
-  _paintThroughMask(b, job, { edges, src, op, alpha, server }) {
+  _paintThroughMask(b, job, { edges, route, src, op, alpha, server }) {
     const R = this.Render;
     // Everything is bounded to the part of the box the clip lets through:
     // the clip's rectangle, or the extents of a stack with a path in it —
@@ -2049,7 +2128,9 @@ class RenderingContext2d {
       if (!out) return false;
     }
     if (this._hasPolyClip) this._requireClipMask();
-    if (!this._uploadCoverage({ ...job, dx: -b.x, dy: -b.y }, b, out, edges)) {
+    if (
+      !this._uploadCoverage({ ...job, dx: -b.x, dy: -b.y }, b, out, edges, route)
+    ) {
       R.FillRectangles(
         R.PictOp.Src,
         this.fillMask.id,
@@ -2118,12 +2199,13 @@ class RenderingContext2d {
     if (!prepareStyle(src, this._m)) return;
 
     // one box per subpath, so a path holding disjoint ones can be masked as
-    // the pieces it is rather than as the box around all of them
+    // the pieces it is rather than as the box around all of them — each the
+    // subpath's own box, on the surface or not (`_rawBox`)
     const shapes = [];
     const pieces = [];
     for (const p of polys) {
       if (p.pts.length < 6) continue;
-      const b = this._pointsBBox(p.pts);
+      const b = this._pointsExtent(p.pts);
       if (!b) continue;
       shapes.push(p.pts);
       pieces.push(b);
@@ -2133,18 +2215,30 @@ class RenderingContext2d {
     this._ensureFillMask();
     let painted = false;
     for (const cluster of this._maskClusters(pieces, op)) {
+      // Routed by every subpath of the cluster, and rasterized from the
+      // ones the surface shows, over the part of them it shows: a subpath
+      // wholly off it adds nothing to the winding of a pixel outside its
+      // own box.
       const flat = [];
+      let box = null;
       let edges = 0;
+      let drawn = 0;
       for (const i of cluster.items) {
-        flat.push(shapes[i]);
         edges += shapes[i].length / 2;
+        const shown = this._onSurface(pieces[i]);
+        if (!shown) continue;
+        flat.push(shapes[i]);
+        drawn += shapes[i].length / 2;
+        box = box ? unionBox(box, shown) : shown;
       }
+      if (!box) continue;
       painted =
         this._paintThroughMask(
-          cluster,
+          box,
           { polys: flat, rule },
           {
-            edges,
+            edges: drawn,
+            route: this._routeFor(cluster, edges),
             src,
             op,
             alpha,
@@ -2497,28 +2591,12 @@ class RenderingContext2d {
     // cuts above are meant to keep the extruder off that path; this keeps
     // a future miss from being catastrophic. A sum is finite iff every
     // term is.
-    //
-    // A triangle wholly off the surface is left out as well: it adds
-    // nothing on either route — the rasterizer would walk its rows only for
-    // its edges to cancel on the border column, and the server would be
-    // sent it only to clip it away — and a zoomed graph has hundreds of
-    // edges past the window every frame.
-    const right = this.width + 1;
-    const bottom = this.height + 1;
     let w = 0;
     for (let i = 0; i < tris.length; i += 6) {
-      const ax = tris[i];
-      const ay = tris[i + 1];
-      const bx = tris[i + 2];
-      const by = tris[i + 3];
-      const cx = tris[i + 4];
-      const cy = tris[i + 5];
-      if (!Number.isFinite(ax + ay + bx + by + cx + cy)) continue;
       if (
-        (ax < -1 && bx < -1 && cx < -1) ||
-        (ay < -1 && by < -1 && cy < -1) ||
-        (ax > right && bx > right && cx > right) ||
-        (ay > bottom && by > bottom && cy > bottom)
+        !Number.isFinite(
+          tris[i] + tris[i + 1] + tris[i + 2] + tris[i + 3] + tris[i + 4] + tris[i + 5],
+        )
       ) {
         continue;
       }
@@ -2527,19 +2605,6 @@ class RenderingContext2d {
     }
     if (w < tris.length) tris.length = w;
     if (!tris.length) return;
-    // Triangles are 16.16 fixed point, and the source origin a direct stroke
-    // hands the server is 16 bits: a stroke that reaches that far is cut to
-    // the surface first (lib/cliprect.js), a pixel to spare on every side, so
-    // what the surface shows is drawn exactly as before. One that does not
-    // goes as it came, for the server to clip.
-    const edgeX = this.width + 1;
-    const edgeY = this.height + 1;
-    if (!withinRect(tris, -WIRE_REACH, -WIRE_REACH, WIRE_REACH, WIRE_REACH)) {
-      const cut = clipTrianglesToRect(tris, -1, -1, edgeX, edgeY);
-      tris.length = 0;
-      for (let i = 0; i < cut.length; i++) tris.push(cut[i]);
-      if (!tris.length) return;
-    }
 
     const op = this._op();
     // round-cap/join disks overlap the stroke body; overlapping coverage
@@ -2555,6 +2620,14 @@ class RenderingContext2d {
       op === this.Render.PictOp.Over;
     const chunk = 4000 * 6;
     if (direct) {
+      this._cullTris(tris);
+      if (!tris.length) return;
+      const cut = this._wireCut(tris);
+      if (cut !== tris) {
+        tris.length = 0;
+        for (let i = 0; i < cut.length; i++) tris.push(cut[i]);
+        if (!tris.length) return;
+      }
       for (let i = 0; i < tris.length; i += chunk) {
         const batch = tris.slice(i, i + chunk);
         // RENDER aligns the source with the *first triangle's first vertex*,
@@ -2588,24 +2661,31 @@ class RenderingContext2d {
     // and took 1.9 s on XQuartz where the bounded version takes 37 ms
     // (react-x11#148). Stale mask content outside the boxes is never
     // composited, so clearing only them is safe.
+    //
+    // The islands are the whole stroke's, on the surface or not, and so are
+    // the clusters and the route each is drawn by (`_rawBox`); only the
+    // triangles the surface shows are rasterized.
     this._ensureFillMask();
     const pieces = this._trisPieces(tris);
     if (!pieces.length) return;
-    // the soup itself when it is one piece holding every triangle — the
-    // common case (one polyline is one piece), and worth not copying
-    const whole =
-      pieces.length === 1 &&
-      pieces[0].start === 0 &&
-      pieces[0].end === tris.length;
     let painted = false;
     for (const cluster of this._maskClusters(pieces, op)) {
-      const batch = whole ? tris : this._trisOf(tris, pieces, cluster.items);
+      let edges = 0;
+      for (const i of cluster.items) {
+        edges += (pieces[i].end - pieces[i].start) / 2;
+      }
+      const batch = this._trisBatch(tris, pieces, cluster);
+      if (!batch.length) continue;
+      // the mask over what is drawn, as tight as it always was
+      const box = this._pointsBBox(batch);
+      if (!box) continue;
       painted =
         this._paintThroughMask(
-          cluster,
+          box,
           { triangles: batch },
           {
             edges: batch.length / 2,
+            route: this._routeFor(cluster, edges),
             src,
             op,
             alpha: this.globalAlpha,
@@ -2642,17 +2722,17 @@ class RenderingContext2d {
    * linear pre-pass whose only job is to hand the clustering a handful of
    * boxes instead of thousands of triangles.
    *
-   * A piece that misses the surface entirely is dropped, leaving a hole in
-   * the spans — which is why the caller gathers a batch from the spans it
-   * has rather than assuming they tile `tris`.
+   * Each piece is its own box (`_rawBox`), on the surface or not: the
+   * clusters and the routes are the stroke's, and the surface only bounds
+   * the work (`_trisBatch`).
    */
   _trisPieces(tris) {
     const pieces = [];
     let open = null;
     const close = () => {
       if (!open) return;
-      const b = this._clampBBox(open.minX, open.minY, open.maxX, open.maxY);
-      if (b) pieces.push({ ...b, start: open.start, end: open.end });
+      const b = this._rawBox(open.minX, open.minY, open.maxX, open.maxY);
+      pieces.push({ ...b, start: open.start, end: open.end });
       open = null;
     };
     for (let i = 0; i < tris.length; i += 6) {
@@ -2681,17 +2761,81 @@ class RenderingContext2d {
     return pieces;
   }
 
-  /** the triangles of the given pieces, gathered into one soup */
-  _trisOf(tris, pieces, items) {
-    let n = 0;
-    for (const i of items) n += pieces[i].end - pieces[i].start;
-    const out = new Array(n);
-    let w = 0;
+  /**
+   * One cluster's triangles, gathered from its pieces: less those wholly
+   * off the surface, which add nothing on either route — the rasterizer
+   * would walk their rows only for their edges to cancel on the border
+   * column, and the server would be sent them only to clip them away — and
+   * cut to the wire's reach (`_wireCut`). The soup itself when the cluster
+   * is all of it and all of it is on the surface: the common case, one
+   * polyline in view, and worth not copying.
+   */
+  _trisBatch(tris, pieces, cluster) {
+    const { items } = cluster;
+    const inside =
+      cluster.x >= -1 &&
+      cluster.y >= -1 &&
+      cluster.x + cluster.w <= this.width + 1 &&
+      cluster.y + cluster.h <= this.height + 1;
+    if (
+      inside &&
+      items.length === 1 &&
+      pieces[items[0]].start === 0 &&
+      pieces[items[0]].end === tris.length
+    ) {
+      return this._wireCut(tris);
+    }
+    const out = [];
     for (const i of items) {
-      const piece = pieces[i];
-      for (let k = piece.start; k < piece.end; ++k) out[w++] = tris[k];
+      for (let k = pieces[i].start; k < pieces[i].end; ++k) out.push(tris[k]);
     }
-    return out;
+    if (!inside) this._cullTris(out);
+    return this._wireCut(out);
+  }
+
+  /**
+   * Leave out, in place, every triangle wholly off the surface: nothing of
+   * it can land on it, and a zoomed graph has hundreds of edges past the
+   * window every frame.
+   */
+  _cullTris(tris) {
+    const right = this.width + 1;
+    const bottom = this.height + 1;
+    let w = 0;
+    for (let i = 0; i < tris.length; i += 6) {
+      const ax = tris[i];
+      const ay = tris[i + 1];
+      const bx = tris[i + 2];
+      const by = tris[i + 3];
+      const cx = tris[i + 4];
+      const cy = tris[i + 5];
+      if (
+        (ax < -1 && bx < -1 && cx < -1) ||
+        (ay < -1 && by < -1 && cy < -1) ||
+        (ax > right && bx > right && cx > right) ||
+        (ay > bottom && by > bottom && cy > bottom)
+      ) {
+        continue;
+      }
+      if (w < i) for (let k = 0; k < 6; k++) tris[w + k] = tris[i + k];
+      w += 6;
+    }
+    if (w < tris.length) tris.length = w;
+    return tris;
+  }
+
+  /**
+   * Triangles are 16.16 fixed point, and the source origin a direct stroke
+   * hands the server is 16 bits: a stroke that reaches that far is cut to
+   * the surface first (lib/cliprect.js), a pixel to spare on every side, so
+   * what the surface shows is drawn exactly as before. One that does not
+   * goes as it came, for the server to clip — the same array.
+   */
+  _wireCut(tris) {
+    if (withinRect(tris, -WIRE_REACH, -WIRE_REACH, WIRE_REACH, WIRE_REACH)) {
+      return tris;
+    }
+    return clipTrianglesToRect(tris, -1, -1, this.width + 1, this.height + 1);
   }
 
   /**
@@ -4129,11 +4273,10 @@ class RenderingContext2d {
     if (!rasterizer) return false;
     const { shapes, edges } = fillableShapes(entry.polys);
     if (!shapes.length) return false;
-    if (
-      routeRaster(bb.w, bb.h, edges, this.window.app.rasterPolicy) !== "local"
-    ) {
+    // routed by the clip's own extent, as a fill is (`_rawBox`), and
+    // rasterized over the part of it on the surface
+    if (this._routeFor(this._polysExtent(entry.polys) ?? bb, edges) !== "local")
       return false;
-    }
 
     const coverage = rasterizer.rasterize({
       polys: shapes,

package/lib/text/font.js

@@ -3,6 +3,7 @@ import * as fontkit from 'fontkit';
 import { flatten, rasterizePath } from '../rasterize.js';
 import { NO_ANCHOR, tolerateAnchors, watchAnchors } from './anchors.js';
 import { marksCover, standInMarks } from './marks.js';
+import { pairGlyphs, pairsCover } from './pairs.js';
 
 // Axis coordinates are rounded to this many decimals before anything is
 // instantiated or cached. Every distinct coordinate is a font in its own
@@ -154,6 +155,8 @@ export default class Font {
     // whether the face's mark attachment is watched for a NULL anchor
     // (./anchors.js): set at its first shaping, false once one has been met
     this._anchors = false;
+    // the glyphs its pairs can move (./pairs.js), read when first asked
+    this._pairs = undefined;
   }
 
   static loadSync(path, postscriptName) {
@@ -356,6 +359,17 @@ export default class Font {
     return this._drawable;
   }
 
+  /**
+   * Whether two glyphs side by side can be set otherwise than apart: the
+   * left one moved against what follows it, or the right one against what
+   * comes before it (./pairs.js). True where the tables cannot tell.
+   */
+  mayKern(left, right) {
+    if (this._pairs === undefined) this._pairs = pairGlyphs(this.fk);
+    const pairs = this._pairs;
+    return pairs === null || pairsCover(pairs.left, left) || pairsCover(pairs.right, right);
+  }
+
   hasGlyph(codepoint) {
     return this.drawable && this.fk.hasGlyphForCodePoint(codepoint);
   }

package/lib/text/fontmanager.js

@@ -235,6 +235,8 @@ export default class FontManager {
     this._shapeCount = 0;
     // whether two letters shape otherwise together than apart (`_meets`)
     this._meetings = new Map();
+    // how much two letters kern across a break opportunity (`_kernAcross`)
+    this._kerns = new Map();
     // a paragraph's layout up to the line fill, for its next width
     // (text/paragraphs.js, TextLayout)
     this._paragraphs = new ParagraphCache();
@@ -580,6 +582,28 @@ export default class FontManager {
     return meets;
   }
 
+  /**
+   * How much wider the two letters of `pair`, cut at `cut`, are set
+   * together than apart in this style: their kerning, negative for a pair
+   * set closer. 0 where they do not kern, and where shaping them together
+   * changes a glyph — a ligature, a contextual form — which no offset
+   * between the two stands for. Kept, as `_meets` keeps its answers.
+   */
+  _kernAcross(pair, cut, style, levelsKey = '0') {
+    const key = `${shapeGroupOf(style, levelsKey)}|${cut}|${pair}`;
+    let kern = this._kerns.get(key);
+    if (kern !== undefined) return kern;
+    const whole = this._shapeCached(pair, style, levelsKey);
+    const left = this._shapeCached(pair.slice(0, cut), style, sliceKey(levelsKey, 0, cut));
+    const right = this._shapeCached(pair.slice(cut), style, sliceKey(levelsKey, cut, pair.length));
+    const ids = (...shaped) => shaped.flatMap((s) => s.runs.flatMap((r) => r.glyphs.map((g) => g.id))).join(',');
+    kern = whole.width - left.width - right.width;
+    if (Math.abs(kern) <= 1e-6 || ids(whole) !== ids(left, right)) kern = 0;
+    if (this._kerns.size >= SHAPE_GENERATION) this._kerns.clear();
+    this._kerns.set(key, kern);
+    return kern;
+  }
+
   _shapeCached(text, style, levelsKey = '0') {
     // A hit in this generation is the whole cost of a word a paragraph has
     // shaped before — a relayout at a new width asks for every word again,

package/lib/text/layout.js

@@ -21,10 +21,16 @@ const UNSPACED =
 /** How wide a line's tokens are, the white space it ends on left out. */
 function tokensWidth(toks) {
   let width = 0;
-  for (const token of toks) width += token.width;
+  for (let i = 0; i < toks.length; i++) width += toks[i].width + (i ? kernBefore(toks[i]) : 0);
   return toks.length ? width - toks[toks.length - 1].wsWidth : 0;
 }
 
+/** The kerning between a token and the one before it on its line
+ *  (`TextLayout._kernBefore`); none for a token a line starts with. */
+function kernBefore(token) {
+  return token.kernBefore ?? 0;
+}
+
 function isWsGlyph(g) {
   return g.codePoints.length > 0 && g.codePoints.every((cp) => WS.has(cp));
 }
@@ -121,7 +127,7 @@ export class TextLayout {
         curWidth = 0;
       };
       for (let token of tokens) {
-        while (wraps && curWidth + token.width - token.wsWidth > maxWidth) {
+        while (wraps && curWidth + (cur.length ? kernBefore(token) : 0) + token.width - token.wsWidth > maxWidth) {
           if (cur.length > 0) {
             flush();
           } else if (whole && !UNSPACED.test(text.slice(token.start, token.end))) {
@@ -135,8 +141,8 @@ export class TextLayout {
             token = rest;
           }
         }
+        curWidth += token.width + (cur.length ? kernBefore(token) : 0);
         cur.push(token);
-        curWidth += token.width;
         if (token.required) flush();
       }
       if (cur.length) lineTokens.push(cur);
@@ -185,16 +191,24 @@ export class TextLayout {
       // .start/.end are absolute code-unit ranges into the full text, kept
       // for caret positioning (caretPosition / indexAt)
       let entries = [];
-      for (const token of toks) {
+      for (let t = 0; t < toks.length; t++) {
+        const token = toks[t];
+        // the kerning with the token before it goes before its first run
+        let kern = t ? kernBefore(token) : 0;
         for (const frag of token.fragments) {
           for (const run of frag.shaped.runs) {
-            entries.push({
+            const entry = {
               run,
               span: frag.span,
               level: run.level,
               start: frag.start + run.start,
               end: frag.start + run.end
-            });
+            };
+            if (kern) {
+              entry.kern = kern;
+              kern = 0;
+            }
+            entries.push(entry);
           }
         }
       }
@@ -234,6 +248,7 @@ export class TextLayout {
       const runs = [];
       let x = 0;
       for (const e of entries) {
+        if (e.kern) x += e.kern;
         const positioned = { x, width: e.run.width, run: e.run, span: e.span, start: e.start, end: e.end };
         if (e.ellipsis) positioned.ellipsis = true;
         runs.push(positioned);
@@ -396,10 +411,48 @@ export class TextLayout {
         tokens.push(this._makeToken(text, prev, text.length, levels, spanAt, false));
       }
     }
+    for (let i = 1; i < tokens.length; i++) {
+      const kern = this._kernBefore(text, tokens[i - 1], tokens[i], levels);
+      if (kern) tokens[i].kernBefore = kern;
+    }
 
     return { spans, text, baseLevel, tokens };
   }
 
+  /**
+   * The kerning between the last letter of one token and the first of the
+   * next, where the two are on one line. Each token is shaped apart, so a
+   * pair either side of a break opportunity was never kerned — Trebuchet MS
+   * sets a space closer to an A, a T or a Y — and a line of it came out
+   * wider than a browser's, which shapes a line whole: shaping breaks only
+   * at an inline box's margin, border or padding (CSS Text 3, 7.3). Only
+   * between letters shaped alike at one left-to-right level; a line that
+   * breaks there never meets it.
+   */
+  _kernBefore(text, prev, next, levels) {
+    if (prev.required) return 0;
+    const a = prev.fragments[prev.fragments.length - 1];
+    const b = next.fragments[0];
+    if (!a || !b || a.shaping !== b.shaping || a.span.shapeApart || b.span.shapeApart) return 0;
+    const at = a.start + a.text.length;
+    if (at !== b.start) return 0;
+    // two glyphs the face's tables cannot move against each other are set
+    // together as apart, and asked about no further: most faces kern no
+    // space, and a paragraph meets one at every word
+    const l = a.shaped.runs[a.shaped.runs.length - 1];
+    const r = b.shaped.runs[0];
+    if (!l || !r || l.font !== r.font) return 0;
+    const lg = l.glyphs[l.glyphs.length - 1];
+    const rg = r.glyphs[0];
+    if (!lg || !rg || (l.font.mayKern && !l.font.mayKern(lg.id, rg.id))) return 0;
+    const low = text.charCodeAt(at - 1);
+    const before = low >= 0xdc00 && low < 0xe000 && at >= 2 ? 2 : 1;
+    const after = text.codePointAt(at) > 0xffff ? 2 : 1;
+    const key = normalizedLevels(levels, at - before, at + after);
+    if (key.includes(',') || Number(key) & 1) return 0;
+    return this.fonts._kernAcross(text.slice(at - before, at + after), before, a.shaping, key);
+  }
+
   /**
    * Whether the letters that meet at an edge between two spans of a group
    * shape otherwise together than apart: their glyphs or their advances
@@ -537,9 +590,10 @@ export class TextLayout {
     for (const token of toks) {
       // trailing whitespace does not count against the budget, exactly as it
       // does not count during the greedy fill
-      if (used + token.width - token.wsWidth <= budget) {
+      const kern = kept.length ? kernBefore(token) : 0;
+      if (used + kern + token.width - token.wsWidth <= budget) {
         kept.push(token);
-        used += token.width;
+        used += kern + token.width;
         continue;
       }
       const [head] = this._forceBreak(token, budget - used);

package/lib/text/marks.js

@@ -102,7 +102,7 @@ export function marksCover(bits, id) {
  * base)` reads the 16-bit offset stored at `pos` and answers where it
  * points, `base` being what the format measures it from.
  */
-function table(fk, tag) {
+export function table(fk, tag) {
   const entry = fk.directory?.tables?.[tag];
   if (!entry) return null;
   const stream = fk._getTableStream(tag);
@@ -163,7 +163,7 @@ function coverLookup(t, lookupList, index, bits) {
  * Where the coverage a subtable is entered from starts, or -1 for a
  * subtable this does not know.
  */
-function firstCoverage(t, type, sub) {
+export function firstCoverage(t, type, sub) {
   const format = t.u16(sub);
   switch (type) {
     case 1: // single adjustment
@@ -191,7 +191,7 @@ function firstCoverage(t, type, sub) {
   }
 }
 
-function addCoverage(t, coverage, bits) {
+export function addCoverage(t, coverage, bits) {
   const format = t.u16(coverage);
   const count = t.u16(coverage + 2);
   if (format === 1) {

package/lib/text/pairs.js

@@ -0,0 +1,88 @@
+// The glyphs a face can set closer or further from the glyph beside them,
+// read from its tables' bytes the way ./marks.js reads its marks: a pair of
+// letters that neither can be is set together as it is set apart, and the
+// layout need not shape the two to find that out (`TextLayout._kernBefore`).
+//
+// A pair's left glyph can be moved by a pair adjustment it enters, by a
+// cursive attachment, by a context it is the first input of, or by the
+// pairs of a legacy `kern` table; its right glyph only by a context it is
+// the first input of, with the left glyph behind it. Every GPOS lookup is
+// read, whatever feature names it — a superset of what fontkit applies,
+// which only widens what counts.
+//
+// Null — ask the shaper — for a face shaped through AAT's morx, a `kern`
+// table in a format this does not read, or tables it cannot read to the end.
+
+import { addCoverage, firstCoverage, table } from './marks.js';
+
+/**
+ * @param {object} fk a fontkit font
+ * @returns {{ left: Uint8Array, right: Uint8Array }|null} a bit per glyph id,
+ *   set for every glyph that can be moved against the glyph after it
+ *   (`left`) or before it (`right`); null where this cannot tell
+ */
+export function pairGlyphs(fk) {
+  try {
+    if (fk.directory?.tables?.morx) return null;
+    const left = new Uint8Array(8192);
+    const right = new Uint8Array(8192);
+    const gpos = table(fk, 'GPOS');
+    if (gpos) {
+      const lookupList = gpos.offset(8, 0);
+      for (let index = 0, n = gpos.u16(lookupList); index < n; index++) {
+        if (!coverPairs(gpos, lookupList, index, left, right)) return null;
+      }
+    }
+    const kern = table(fk, 'kern');
+    if (kern && !kernLefts(kern, left)) return null;
+    return { left, right };
+  } catch {
+    return null;
+  }
+}
+
+/** Whether `bits` (from `pairGlyphs`) has glyph `id`. */
+export function pairsCover(bits, id) {
+  return (bits[id >> 3] & (1 << (id & 7))) !== 0;
+}
+
+/** Adds what a lookup can move against a neighbour; false for one it cannot read. */
+function coverPairs(t, lookupList, index, left, right) {
+  const lookup = t.offset(lookupList + 2 + index * 2, lookupList);
+  const type = t.u16(lookup);
+  for (let i = 0, n = t.u16(lookup + 4); i < n; i++) {
+    let sub = t.offset(lookup + 6 + i * 2, lookup);
+    let subType = type;
+    if (subType === 9) {
+      if (t.u16(sub) !== 1) return false;
+      subType = t.u16(sub + 2);
+      sub += t.u32(sub + 4);
+    }
+    // a single adjustment moves a glyph whatever is beside it, and a mark
+    // attaches with no advance of its own
+    if (subType !== 2 && subType !== 3 && subType !== 7 && subType !== 8) continue;
+    const coverage = firstCoverage(t, subType, sub);
+    if (coverage < 0) return false;
+    addCoverage(t, coverage, left);
+    if (subType === 7 || subType === 8) addCoverage(t, coverage, right);
+  }
+  return true;
+}
+
+/** Adds the left glyphs of a Microsoft `kern` table's pairs; false for a
+ *  table or subtable format this does not read. */
+function kernLefts(t, left) {
+  if (t.u16(0) !== 0) return false;
+  let at = 4;
+  for (let i = 0, n = t.u16(2); i < n; i++) {
+    const length = t.u16(at + 2);
+    const format = t.u16(at + 4) >> 8;
+    if (format !== 0) return false;
+    for (let j = 0, pairs = t.u16(at + 6); j < pairs; j++) {
+      const id = t.u16(at + 14 + j * 6);
+      left[id >> 3] |= 1 << (id & 7);
+    }
+    at += length;
+  }
+  return true;
+}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "ntk",
-  "version": "8.14.5",
+  "version": "8.14.7",
   "description": "Desktop UI toolkit for X11 with canvas-like 2d and OpenGL rendering",
   "author": "Andrey Sidorov <sidorares@yandex.ru>",
   "license": "MIT",