@driftengine/tools 4.0.0

package/LICENSE

@@ -0,0 +1,202 @@
+
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright 2026 Drift Technologies
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/NOTICE

@@ -0,0 +1,29 @@
+DriftEngine
+Copyright 2026 Drift Technologies
+
+This product includes software developed at Drift Technologies
+(https://github.com/drftrun/driftengine).
+
+Licensed under the Apache License, Version 2.0. Section 4(d) of that licence
+requires this NOTICE to be reproduced in any derivative work you distribute,
+in the source, the documentation, or a display generated by the work.
+
+Models run by DriftCapture
+--------------------------
+DriftCapture runs the models below. Their weights are not in this repository
+and are not distributed with it: tools/capture-weights/ fetches each at the
+revision its manifest pins, verifies it, and converts it, and a game that
+ships one ships it under that model's own licence. Each model's definition in
+this engine is written from its project's published code.
+
+- Depth Anything 3 Small and Depth Anything 3 Base. Apache License 2.0.
+  Copyright (c) 2025 ByteDance Ltd. and/or its affiliates.
+- Depth Anything V2 Small. Apache License 2.0. The University of Hong Kong
+  and TikTok; converted to the Transformers layout by The HuggingFace Team.
+- MobileSAM. Apache License 2.0. Its image encoder is TinyViT, Copyright (c)
+  2022 Microsoft; its prompt encoder and mask decoder are Segment Anything's,
+  Copyright (c) Meta Platforms, Inc. and affiliates.
+- SAM 2.1 tiny. Apache License 2.0. Copyright (c) Meta Platforms, Inc. and
+  affiliates.
+- OWLv2 base patch16. Apache License 2.0. Copyright 2023 Google AI and The
+  HuggingFace Team.

package/README.md

@@ -0,0 +1,54 @@
+# `@driftengine/tools`
+
+The editor's panels, as something a shipped game can carry: an inspector, a console, a profiler and
+a network panel, with the command stack that makes their edits undoable.
+
+**3,395 bytes gzipped**, measured by `scripts/size-gate.test.mjs` against
+`scripts/fixtures/size/tools-only.ts`. Optional — nothing in `@driftengine/core` imports it, so a
+game that never asks for these pays nothing.
+
+## Why four panels and not seven
+
+The editor has seven. Three of them stayed behind, and the line between them is what a panel needs
+rather than what it shows.
+
+A **scene tree** and an **asset browser** need a project: a hierarchy somebody is authoring and a
+directory of source files. A shipped game has neither — its scene is whatever was baked and its
+assets are inside a `.drft` container. A **graph editor** is the same, one level further out.
+
+An **inspector**, a **console**, a **profiler** and a **network panel** need only the running world.
+That is exactly the situation a tester is in on somebody else's machine, or a developer is in on a
+console devkit where no debugger will attach, or anyone is in when the bug happens in a build. This
+package is the four that work there.
+
+## The panels mutate through commands, so an in-game edit is undoable
+
+`Panel.route` returns a `Command` or nothing. It is a signature rather than a convention: a panel is
+handed the world `Readonly` and given no other way to change it, so "everything goes through the
+undo stack" has no worst offender. A game carrying these panels carries that rule, and gets undo for
+nothing extra.
+
+```ts
+import { createUndoStack, inspectorPanel, createInspectorView } from '@driftengine/tools';
+
+const undo = createUndoStack(200);
+const view = createInspectorView({});
+const command = inspectorPanel.route(world, view, event);
+if (command !== null) undo.push(command);
+```
+
+## Building it in or leaving it out
+
+Import it and it is in the bundle; do not and it is not. There is no flag, because a flag would be a
+second mechanism doing what a module graph already does — and the size gate is what says so: the
+floors for every other package are unchanged by this one existing.
+
+A game that wants the tools in a development build and not in a shipping one imports them behind the
+bundler's own dead-code elimination, the same way it would any other optional dependency.
+
+## What is not here
+
+The timeline scrubber. It belongs to the editor's play-in-editor session, which needs snapshots of
+the authored world to put back — a shipped game has no authored world to return to. The pieces
+underneath it (`@driftengine/network`'s `Snapshotter`, `RewindLoop` and input log) are available to
+a game directly.

package/dist/command.d.ts

@@ -0,0 +1,44 @@
+/**
+ * Every change to the world, as an object that can be undone.
+ *
+ * **Built before any panel exists, and that order is the point.** An undo stack added after the
+ * panels is an undo stack with holes in it, and the holes are found by users rather than by tests:
+ * one panel mutated directly, once, and now a particular sequence of actions cannot be taken back.
+ * Built first, every panel is written against it.
+ *
+ * **A panel is never handed the world.** `Panel.route` returns a `Command` or nothing, so a panel
+ * physically cannot change anything — the rule is enforced by the signature rather than by review.
+ *
+ * **Merging is what makes a drag usable.** A gizmo emits a command per frame; sixty of them in the
+ * undo stack means sixty presses of undo to take back one movement. `merge` lets a command absorb
+ * the next of its kind, so a drag is one entry.
+ */
+export interface Command {
+    /** Shown in the undo menu and in the palette. */
+    readonly label: string;
+    apply(): void;
+    revert(): void;
+    /**
+     * Absorb a following command of the same kind. Return true if it was absorbed.
+     *
+     * **Called after the stack has already applied `next`, and an implementation must not apply it
+     * again.** Apply happens exactly once, by the stack, for every command — the alternative splits
+     * that responsibility between the stack and each mergeable command, and the first implementation
+     * of this got it wrong in exactly that way: the change ran twice and a drag moved twice as far
+     * as the pointer.
+     *
+     * What absorbing means is that the *earlier* command's `revert` now takes back both.
+     */
+    merge?(next: Command): boolean;
+}
+export interface UndoStack {
+    push(command: Command): void;
+    undo(): boolean;
+    redo(): boolean;
+    canUndo(): boolean;
+    canRedo(): boolean;
+    undoLabel(): string | null;
+    redoLabel(): string | null;
+    clear(): void;
+}
+export declare function createUndoStack(limit: number): UndoStack;

package/dist/command.js

@@ -0,0 +1,53 @@
+export function createUndoStack(limit) {
+    /* Entries below `at` are done; entries from `at` up are the redo branch. */
+    let entries = [];
+    let at = 0;
+    return {
+        push(command) {
+            command.apply();
+            const previous = at > 0 ? entries[at - 1] : undefined;
+            if (previous?.merge !== undefined && previous.merge(command)) {
+                /*
+                 * Absorbed. `command` has already been applied above and must not be applied again; what
+                 * changed is that `previous.revert` now takes back both. The redo branch still dies.
+                 */
+                entries.length = at;
+                return;
+            }
+            /* A new command after an undo discards the redo branch, which is what every editor does. */
+            entries.length = at;
+            entries.push(command);
+            at += 1;
+            if (entries.length > limit) {
+                /*
+                 * The oldest is forgotten, never reverted. Reverting it on the way out would undo a change
+                 * the user made and kept, which is the ring-buffer bug this comment exists to prevent.
+                 */
+                entries = entries.slice(entries.length - limit);
+                at = entries.length;
+            }
+        },
+        undo() {
+            if (at === 0)
+                return false;
+            at -= 1;
+            entries[at].revert();
+            return true;
+        },
+        redo() {
+            if (at >= entries.length)
+                return false;
+            entries[at].apply();
+            at += 1;
+            return true;
+        },
+        canUndo: () => at > 0,
+        canRedo: () => at < entries.length,
+        undoLabel: () => (at > 0 ? entries[at - 1].label : null),
+        redoLabel: () => (at < entries.length ? entries[at].label : null),
+        clear() {
+            entries = [];
+            at = 0;
+        },
+    };
+}

package/dist/console.d.ts

@@ -0,0 +1,75 @@
+import type { UiNode } from '@driftengine/ui2d';
+import type { Command } from './command.ts';
+import { type Panel } from './panel.ts';
+export type Severity = 'debug' | 'info' | 'warn' | 'error';
+export interface LogEntry {
+    severity: Severity;
+    text: string;
+    /** How many identical entries this one stands for. One for a single occurrence. */
+    count: number;
+    /** Where it came from, or empty. */
+    file: string;
+    line: number;
+}
+/** A fixed window of entries. Pooled, because a log is appended to forever. */
+export interface LogRing {
+    readonly pool: LogEntry[];
+    readonly capacity: number;
+    head: number;
+    filled: number;
+}
+export declare function createLogRing(capacity: number): LogRing;
+/**
+ * Append, collapsing an exact repeat of the newest entry into its count.
+ *
+ * **Against the newest only**, and not against everything in the window. Collapsing against any
+ * earlier entry would reorder the log — the repeat would appear where the first one was, out of
+ * sequence with whatever happened in between, and the sequence is what a log is for.
+ */
+export declare function appendLog(log: LogRing, severity: Severity, text: string, file?: string, line?: number): void;
+/** The window, oldest first. */
+export declare function logEntries(log: LogRing): LogEntry[];
+export interface LogFilter {
+    minSeverity: Severity;
+    /** Matched case-insensitively against the entry's text. Empty matches everything. */
+    text: string;
+}
+export declare function createLogFilter(): LogFilter;
+export declare function filteredEntries(log: LogRing, filter: LogFilter): LogEntry[];
+/** How much of one entry a row shows. Past this the rest is still on the entry. */
+export declare const DISPLAY_LIMIT = 200;
+export declare function displayText(entry: LogEntry): string;
+/** Where a caller is looking. The console asks to move it; the caller owns it. */
+export interface SourceCursor {
+    file: string;
+    line: number;
+}
+/**
+ * Ask to look at a place in a file.
+ *
+ * **A command, so going back is the same gesture as any other undo.** Whether a caller puts it on
+ * the undo stack or merely applies it is the caller's decision — the console knows how to describe
+ * the jump and not what navigation should cost.
+ */
+export declare function jumpToSourceCommand(cursor: SourceCursor, file: string, line: number): Command | null;
+export interface ConsoleWorld {
+    readonly log: LogRing;
+}
+export interface ConsoleView {
+    readonly root: UiNode;
+    readonly filter: LogFilter;
+    /** Where the caller is looking. Read by `route` to refuse a jump that goes nowhere. */
+    readonly cursor: SourceCursor;
+    rowHeight: number;
+    viewHeight: number;
+    scrollY: number;
+    /** Whether the view follows the newest entry. True while it is at the bottom. */
+    pinned: boolean;
+    /** What the last build showed, so a click finds the entry rather than the row. */
+    shown: LogEntry[];
+}
+export declare function createConsoleView(options: {
+    rowHeight?: number;
+    viewHeight?: number;
+}): ConsoleView;
+export declare const consolePanel: Panel<ConsoleWorld, ConsoleView>;

package/dist/console.js

@@ -0,0 +1,175 @@
+/**
+ * The log, filtered, with a way back to the line that produced it.
+ *
+ * **Scrolling up to read something must not be yanked away by the next log line.** That is the
+ * whole point of this panel: a console that always jumps to the bottom is unreadable during the
+ * thing being debugged, because that is exactly when lines arrive fastest. So the view follows the
+ * newest entry *only while it was already at the bottom*, and leaving the bottom stops it.
+ *
+ * **A repeat collapses into a count.** A warning inside a frame loop arrives sixty times a second,
+ * and without this the whole ring becomes one message and everything before it is gone — which is
+ * precisely what somebody is looking for when a warning starts repeating.
+ *
+ * **A long entry is truncated for display and kept whole underneath.** A single line of a hundred
+ * kilobytes — a serialised object, a shader source — would otherwise be the panel.
+ */
+import { addUiChild, createUiNode } from '@driftengine/ui2d';
+import { createPanelRoot, emptyPanel } from './panel.js';
+/** Ascending, so a minimum keeps everything at least as severe. */
+const RANK = { debug: 0, info: 1, warn: 2, error: 3 };
+export function createLogRing(capacity) {
+    const size = Math.max(1, capacity);
+    return {
+        pool: Array.from({ length: size }, () => ({
+            severity: 'info',
+            text: '',
+            count: 0,
+            file: '',
+            line: 0,
+        })),
+        capacity: size,
+        head: 0,
+        filled: 0,
+    };
+}
+/** The newest entry, or null. What a repeat is compared against. */
+function newest(log) {
+    if (log.filled === 0)
+        return null;
+    return log.pool[(log.head + log.capacity - 1) % log.capacity];
+}
+/**
+ * Append, collapsing an exact repeat of the newest entry into its count.
+ *
+ * **Against the newest only**, and not against everything in the window. Collapsing against any
+ * earlier entry would reorder the log — the repeat would appear where the first one was, out of
+ * sequence with whatever happened in between, and the sequence is what a log is for.
+ */
+export function appendLog(log, severity, text, file = '', line = 0) {
+    const last = newest(log);
+    if (last !== null &&
+        last.severity === severity &&
+        last.text === text &&
+        last.file === file &&
+        last.line === line) {
+        last.count += 1;
+        return;
+    }
+    const entry = log.pool[log.head];
+    entry.severity = severity;
+    entry.text = text;
+    entry.count = 1;
+    entry.file = file;
+    entry.line = line;
+    log.head = (log.head + 1) % log.capacity;
+    if (log.filled < log.capacity)
+        log.filled += 1;
+}
+/** The window, oldest first. */
+export function logEntries(log) {
+    const first = log.filled < log.capacity ? 0 : log.head;
+    const out = [];
+    for (let at = 0; at < log.filled; at += 1) {
+        out.push(log.pool[(first + at) % log.capacity]);
+    }
+    return out;
+}
+export function createLogFilter() {
+    return { minSeverity: 'debug', text: '' };
+}
+export function filteredEntries(log, filter) {
+    const floor = RANK[filter.minSeverity];
+    const needle = filter.text.toLowerCase();
+    return logEntries(log).filter((entry) => RANK[entry.severity] >= floor && (needle === '' || entry.text.toLowerCase().includes(needle)));
+}
+/** How much of one entry a row shows. Past this the rest is still on the entry. */
+export const DISPLAY_LIMIT = 200;
+export function displayText(entry) {
+    const body = entry.text.length > DISPLAY_LIMIT ? `${entry.text.slice(0, DISPLAY_LIMIT)}…` : entry.text;
+    return entry.count > 1 ? `${body}  (${entry.count})` : body;
+}
+/**
+ * Ask to look at a place in a file.
+ *
+ * **A command, so going back is the same gesture as any other undo.** Whether a caller puts it on
+ * the undo stack or merely applies it is the caller's decision — the console knows how to describe
+ * the jump and not what navigation should cost.
+ */
+export function jumpToSourceCommand(cursor, file, line) {
+    if (file === '')
+        return null;
+    if (cursor.file === file && cursor.line === line)
+        return null;
+    const was = { file: cursor.file, line: cursor.line };
+    return {
+        label: `Go to ${file}:${line}`,
+        apply: () => {
+            cursor.file = file;
+            cursor.line = line;
+        },
+        revert: () => {
+            cursor.file = was.file;
+            cursor.line = was.line;
+        },
+    };
+}
+export function createConsoleView(options) {
+    return {
+        root: createPanelRoot(consolePanel),
+        filter: createLogFilter(),
+        cursor: { file: '', line: 0 },
+        rowHeight: options.rowHeight ?? 16,
+        viewHeight: options.viewHeight ?? 200,
+        scrollY: 0,
+        pinned: true,
+        shown: [],
+    };
+}
+/** The furthest down the view can go. Zero where the content is shorter than the view. */
+function maxScroll(view, rows) {
+    return Math.max(0, rows * view.rowHeight - view.viewHeight);
+}
+export const consolePanel = {
+    id: 'console',
+    title: 'Console',
+    build(world, view, root) {
+        view.shown = filteredEntries(world.log, view.filter);
+        if (view.shown.length === 0) {
+            emptyPanel(root, 'Nothing logged');
+            view.scrollY = 0;
+            return;
+        }
+        root.children.length = 0;
+        for (let at = 0; at < view.shown.length; at += 1) {
+            const entry = view.shown[at];
+            addUiChild(root, createUiNode({
+                width: 'grow',
+                height: view.rowHeight,
+                text: displayText(entry),
+                interactive: true,
+                name: `log:${at}`,
+            }));
+        }
+        /* The follow happens here and not on append, because only a build knows how tall the list is. */
+        if (view.pinned)
+            view.scrollY = maxScroll(view, view.shown.length);
+    },
+    route(_world, view, event) {
+        if (event.kind === 'wheel') {
+            /* `+= dy`, which is `scrollBy`'s convention in `@driftengine/ui2d`: positive goes down the
+               content. Inverting it here would make this the one scrollable thing in the editor that
+               went the other way. */
+            const limit = maxScroll(view, view.shown.length);
+            view.scrollY = Math.min(limit, Math.max(0, view.scrollY + event.dy));
+            view.pinned = view.scrollY >= limit;
+            return null;
+        }
+        if (event.kind !== 'pointer' || event.phase !== 'up' || event.button !== 0)
+            return null;
+        const at = Math.floor((event.y + view.scrollY) / view.rowHeight);
+        const entry = view.shown[at];
+        if (entry === undefined)
+            return null;
+        return jumpToSourceCommand(view.cursor, entry.file, entry.line);
+    },
+};

package/dist/divergence.d.ts

@@ -0,0 +1,23 @@
+/**
+ * Which of two sets of component hashes disagree.
+ *
+ * **Here rather than beside the divergence search, because a shipped game gets this half.** The
+ * search walks a timeline, which only the editor has; comparing what two peers hashed is what an
+ * in-game network panel does the moment a rollback session desynchronises, and that is a panel a
+ * game carries. `editor/src/pie/divergence.ts` holds the search and imports these.
+ */
+/**
+ * Which components two sides hash differently, into `out`. Returns how many.
+ *
+ * A component only one side has is a divergence too, and the loudest kind: it means one peer
+ * created or destroyed something the other did not.
+ */
+export declare function divergentComponents(ours: ReadonlyMap<string, string>, theirs: ReadonlyMap<string, string>, out: string[]): number;
+/**
+ * Whether the difference is in something nobody hashed.
+ *
+ * The honest answer when the whole-world fingerprints disagree and every recorded component
+ * agrees: the state that differs was not in the breakdown. Reporting agreement there would be a
+ * panel saying everything is fine on a frame that is provably not.
+ */
+export declare function divergenceIsUnaccounted(differing: number, worldsDiffer: boolean): boolean;