@bradensbay/globals-core 0.2.0

package/dist/src/verify.js

@@ -0,0 +1,179 @@
+import { Header, VerifyMode } from "./layout.js";
+import { HASH_SEED, mixWord } from "./checksum.js";
+import { Tag } from "./tags.js";
+import { WORD } from "./layout.js";
+import { hamtEntries } from "./hamt.js";
+import { vectorSlots } from "./vector.js";
+import { ArenaCorruptError } from "./errors.js";
+/**
+ * Verified reads.
+ *
+ * The trust model says a shared buffer is writable by everything that maps it, and that no
+ * amount of engineering removes that. What a checksum does buy is detection: a window that
+ * corrupts the arena through a bug, or a hostile window that does not also forge the
+ * checksum, is caught before a reader decodes what it wrote.
+ *
+ * What it does not buy, stated here as plainly as in the documentation, is protection from a
+ * window that computes a valid checksum for corrupt data. That window has exactly the
+ * information the owner has. This is a corruption detector, not a message authentication
+ * code, and calling it one would be a lie a security reviewer would catch.
+ *
+ * Cost is per version, not per read. The owner computes it once on commit and a reader
+ * verifies once when it acquires a new version, so a render loop that reads the same version
+ * a hundred times pays once.
+ */
+/** Words covered by the header checksum. The root, the version, and the geometry. */
+const COVERED = [
+    Header.Magic,
+    Header.LayoutVersion,
+    Header.RootTag,
+    Header.RootPayload,
+    Header.VersionId,
+    Header.MaxReaders,
+    Header.ReaderTableOffset,
+    Header.RetainedRingOffset,
+    Header.RetainedCapacity,
+    Header.ArenaOffset,
+    Header.OwnerGeneration,
+];
+// Deliberately not covered: the reclaim floor, the bump pointer, and the statistics. All
+// three move independently of the root, the floor within the very commit that publishes the
+// checksum, so covering them would make every version fail verification.
+export function verifyMode(arena) {
+    const flags = arena.loadHeader(Header.Flags) & 0b11;
+    return flags;
+}
+/**
+ * The header checksum, over the root and the geometry.
+ *
+ * Deliberately not over the bump pointer or the statistics, which move independently of the
+ * root and would make every reader recompute for no reason.
+ */
+export function headerChecksum(arena, root, versionId) {
+    const words = arena.words;
+    let hash = HASH_SEED;
+    for (const field of COVERED) {
+        if (field === Header.RootTag) {
+            hash = mixWord(hash, root.tag);
+            continue;
+        }
+        if (field === Header.RootPayload) {
+            hash = mixWord(hash, root.payload);
+            continue;
+        }
+        if (field === Header.VersionId) {
+            hash = mixWord(hash, versionId);
+            continue;
+        }
+        hash = mixWord(hash, words[field]);
+    }
+    return hash === 0 ? 1 : hash;
+}
+/**
+ * A checksum over everything reachable from a root.
+ *
+ * Linear in the size of the structure, so it is a diagnostic mode rather than a production
+ * one. It catches corruption of a leaf value deep in the tree, which the header checksum
+ * cannot see at all.
+ *
+ * The walk is bounded by the same block header validation every decode uses, so a corrupted
+ * arena makes this throw rather than loop.
+ */
+export function deepChecksum(arena, root, budget = 2_000_000) {
+    let hash = HASH_SEED;
+    let visited = 0;
+    const walk = (slot) => {
+        visited += 1;
+        if (visited > budget) {
+            throw new ArenaCorruptError(`the reachable set exceeded ${budget} nodes, which means a cycle or a corrupt offset`);
+        }
+        hash = mixWord(hash, slot.tag);
+        switch (slot.tag) {
+            case Tag.Undefined:
+            case Tag.Null:
+            case Tag.False:
+            case Tag.True:
+                return;
+            case Tag.Int32:
+                hash = mixWord(hash, slot.payload);
+                return;
+            case Tag.Double:
+            case Tag.Date: {
+                arena.checkBlock(slot.payload, "verify double");
+                const base = slot.payload / WORD;
+                hash = mixWord(hash, arena.words[base]);
+                hash = mixWord(hash, arena.words[base + 1]);
+                return;
+            }
+            case Tag.String:
+            case Tag.RegExp:
+            case Tag.BigInt:
+            case Tag.TypedArray: {
+                const size = arena.checkBlock(slot.payload, "verify record");
+                const base = slot.payload / WORD;
+                for (let i = 0; i < size / WORD; i += 1) {
+                    hash = mixWord(hash, arena.words[base + i]);
+                }
+                return;
+            }
+            case Tag.Object:
+            case Tag.Map:
+            case Tag.Set: {
+                for (const entry of hamtEntries(arena, slot.payload)) {
+                    walk(entry.key);
+                    walk(entry.value);
+                }
+                return;
+            }
+            case Tag.Array: {
+                for (const element of vectorSlots(arena, slot.payload))
+                    walk(element);
+                return;
+            }
+            case Tag.External:
+                hash = mixWord(hash, slot.payload);
+                return;
+            default:
+                throw new ArenaCorruptError(`verify found an unknown tag ${slot.tag}`, {
+                    actual: slot.tag,
+                });
+        }
+    };
+    walk(root);
+    return hash === 0 ? 1 : hash;
+}
+/** Owner side. Compute and publish the checksum for a version. */
+export function publishChecksum(arena, root, versionId, mode) {
+    if (mode === VerifyMode.Off) {
+        arena.storeHeader(Header.RootChecksum, 0);
+        return;
+    }
+    const header = headerChecksum(arena, root, versionId);
+    const value = mode === VerifyMode.Full ? mixWord(header, deepChecksum(arena, root)) : header;
+    arena.storeHeader(Header.RootChecksum, value === 0 ? 1 : value);
+}
+/**
+ * Reader side. Throw when the published checksum does not match the root it belongs to.
+ *
+ * The published checksum is a parameter rather than something this function loads, and that
+ * is not tidiness. It has to be read inside the seqlock window alongside the root and the
+ * version, or the writer can commit between the seqlock check and the checksum load, and the
+ * reader compares a checksum from one version against a root from another. That produced a
+ * steady trickle of false corruption reports under load, roughly fifty in eight hundred
+ * thousand reads, which is exactly the shape of bug that looks like flakiness.
+ *
+ * Called once per version rather than once per read.
+ */
+export function verifyRoot(arena, root, versionId, published) {
+    const mode = verifyMode(arena);
+    if (mode === VerifyMode.Off)
+        return;
+    const header = headerChecksum(arena, root, versionId);
+    const expected = mode === VerifyMode.Full ? mixWord(header, deepChecksum(arena, root)) : header;
+    const normalised = expected === 0 ? 1 : expected;
+    if (published !== normalised) {
+        throw new ArenaCorruptError(`version ${versionId} does not match its published checksum. Something wrote to the ` +
+            "arena that is not the owner. Treat this as a security event as well as a bug.", { expected: normalised, actual: published });
+    }
+}
+//# sourceMappingURL=verify.js.map

package/dist/src/verify.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"verify.js","sourceRoot":"","sources":["../../src/verify.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,MAAM,EAAE,UAAU,EAAwB,MAAM,aAAa,CAAC;AACvE,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,MAAM,eAAe,CAAC;AACnD,OAAO,EAAE,GAAG,EAAE,MAAM,WAAW,CAAC;AAChC,OAAO,EAAE,IAAI,EAAE,MAAM,aAAa,CAAC;AACnC,OAAO,EAAE,WAAW,EAAE,MAAM,WAAW,CAAC;AACxC,OAAO,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAE1C,OAAO,EAAE,iBAAiB,EAAE,MAAM,aAAa,CAAC;AAEhD;;;;;;;;;;;;;;;;GAgBG;AAEH,qFAAqF;AACrF,MAAM,OAAO,GAAG;IACd,MAAM,CAAC,KAAK;IACZ,MAAM,CAAC,aAAa;IACpB,MAAM,CAAC,OAAO;IACd,MAAM,CAAC,WAAW;IAClB,MAAM,CAAC,SAAS;IAChB,MAAM,CAAC,UAAU;IACjB,MAAM,CAAC,iBAAiB;IACxB,MAAM,CAAC,kBAAkB;IACzB,MAAM,CAAC,gBAAgB;IACvB,MAAM,CAAC,WAAW;IAClB,MAAM,CAAC,eAAe;CACd,CAAC;AAEX,yFAAyF;AACzF,4FAA4F;AAC5F,yEAAyE;AAEzE,MAAM,UAAU,UAAU,CAAC,KAAkB;IAC3C,MAAM,KAAK,GAAG,KAAK,CAAC,UAAU,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC;IACpD,OAAO,KAAwB,CAAC;AAClC,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,cAAc,CAAC,KAAkB,EAAE,IAAU,EAAE,SAAiB;IAC9E,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;IAC1B,IAAI,IAAI,GAAG,SAAS,CAAC;IACrB,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,IAAI,KAAK,KAAK,MAAM,CAAC,OAAO,EAAE,CAAC;YAC7B,IAAI,GAAG,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;YAC/B,SAAS;QACX,CAAC;QACD,IAAI,KAAK,KAAK,MAAM,CAAC,WAAW,EAAE,CAAC;YACjC,IAAI,GAAG,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;YACnC,SAAS;QACX,CAAC;QACD,IAAI,KAAK,KAAK,MAAM,CAAC,SAAS,EAAE,CAAC;YAC/B,IAAI,GAAG,OAAO,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;YAChC,SAAS;QACX,CAAC;QACD,IAAI,GAAG,OAAO,CAAC,IAAI,EAAE,KAAK,CAAC,KAAK,CAAW,CAAC,CAAC;IAC/C,CAAC;IACD,OAAO,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;AAC/B,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,YAAY,CAAC,KAAkB,EAAE,IAAU,EAAE,MAAM,GAAG,SAAS;IAC7E,IAAI,IAAI,GAAG,SAAS,CAAC;IACrB,IAAI,OAAO,GAAG,CAAC,CAAC;IAEhB,MAAM,IAAI,GAAG,CAAC,IAAU,EAAQ,EAAE;QAChC,OAAO,IAAI,CAAC,CAAC;QACb,IAAI,OAAO,GAAG,MAAM,EAAE,CAAC;YACrB,MAAM,IAAI,iBAAiB,CACzB,8BAA8B,MAAM,iDAAiD,CACtF,CAAC;QACJ,CAAC;QACD,IAAI,GAAG,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;QAE/B,QAAQ,IAAI,CAAC,GAAG,EAAE,CAAC;YACjB,KAAK,GAAG,CAAC,SAAS,CAAC;YACnB,KAAK,GAAG,CAAC,IAAI,CAAC;YACd,KAAK,GAAG,CAAC,KAAK,CAAC;YACf,KAAK,GAAG,CAAC,IAAI;gBACX,OAAO;YACT,KAAK,GAAG,CAAC,KAAK;gBACZ,IAAI,GAAG,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;gBACnC,OAAO;YACT,KAAK,GAAG,CAAC,MAAM,CAAC;YAChB,KAAK,GAAG,CAAC,IAAI,EAAE,CAAC;gBACd,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,OAAO,EAAE,eAAe,CAAC,CAAC;gBAChD,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC;gBACjC,IAAI,GAAG,OAAO,CAAC,IAAI,EAAE,KAAK,CAAC,KAAK,CAAC,IAAI,CAAW,CAAC,CAAC;gBAClD,IAAI,GAAG,OAAO,CAAC,IAAI,EAAE,KAAK,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,CAAW,CAAC,CAAC;gBACtD,OAAO;YACT,CAAC;YACD,KAAK,GAAG,CAAC,MAAM,CAAC;YAChB,KAAK,GAAG,CAAC,MAAM,CAAC;YAChB,KAAK,GAAG,CAAC,MAAM,CAAC;YAChB,KAAK,GAAG,CAAC,UAAU,EAAE,CAAC;gBACpB,MAAM,IAAI,GAAG,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,OAAO,EAAE,eAAe,CAAC,CAAC;gBAC7D,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC;gBACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,GAAG,IAAI,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;oBACxC,IAAI,GAAG,OAAO,CAAC,IAAI,EAAE,KAAK,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,CAAW,CAAC,CAAC;gBACxD,CAAC;gBACD,OAAO;YACT,CAAC;YACD,KAAK,GAAG,CAAC,MAAM,CAAC;YAChB,KAAK,GAAG,CAAC,GAAG,CAAC;YACb,KAAK,GAAG,CAAC,GAAG,EAAE,CAAC;gBACb,KAAK,MAAM,KAAK,IAAI,WAAW,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC;oBACrD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;oBAChB,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;gBACpB,CAAC;gBACD,OAAO;YACT,CAAC;YACD,KAAK,GAAG,CAAC,KAAK,EAAE,CAAC;gBACf,KAAK,MAAM,OAAO,IAAI,WAAW,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,CAAC;oBAAE,IAAI,CAAC,OAAO,CAAC,CAAC;gBACtE,OAAO;YACT,CAAC;YACD,KAAK,GAAG,CAAC,QAAQ;gBACf,IAAI,GAAG,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;gBACnC,OAAO;YACT;gBACE,MAAM,IAAI,iBAAiB,CAAC,+BAA+B,IAAI,CAAC,GAAG,EAAE,EAAE;oBACrE,MAAM,EAAE,IAAI,CAAC,GAAG;iBACjB,CAAC,CAAC;QACP,CAAC;IACH,CAAC,CAAC;IAEF,IAAI,CAAC,IAAI,CAAC,CAAC;IACX,OAAO,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;AAC/B,CAAC;AAED,kEAAkE;AAClE,MAAM,UAAU,eAAe,CAC7B,KAAkB,EAClB,IAAU,EACV,SAAiB,EACjB,IAAqB;IAErB,IAAI,IAAI,KAAK,UAAU,CAAC,GAAG,EAAE,CAAC;QAC5B,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC,CAAC,CAAC;QAC1C,OAAO;IACT,CAAC;IACD,MAAM,MAAM,GAAG,cAAc,CAAC,KAAK,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC;IACtD,MAAM,KAAK,GAAG,IAAI,KAAK,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,YAAY,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IAC7F,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,YAAY,EAAE,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;AAClE,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,UAAU,CACxB,KAAkB,EAClB,IAAU,EACV,SAAiB,EACjB,SAAiB;IAEjB,MAAM,IAAI,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;IAC/B,IAAI,IAAI,KAAK,UAAU,CAAC,GAAG;QAAE,OAAO;IAEpC,MAAM,MAAM,GAAG,cAAc,CAAC,KAAK,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC;IACtD,MAAM,QAAQ,GAAG,IAAI,KAAK,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,YAAY,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IAChG,MAAM,UAAU,GAAG,QAAQ,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;IAEjD,IAAI,SAAS,KAAK,UAAU,EAAE,CAAC;QAC7B,MAAM,IAAI,iBAAiB,CACzB,WAAW,SAAS,iEAAiE;YACnF,+EAA+E,EACjF,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,EAAE,SAAS,EAAE,CAC5C,CAAC;IACJ,CAAC;AACH,CAAC"}

package/dist/src/view.d.ts

@@ -0,0 +1,66 @@
+import type { SharedArena } from "./arena.js";
+import { type Slot } from "./values.js";
+/**
+ * Lazy views over arena data.
+ *
+ * `getSnapshot()` hands back one of these rather than a materialised object. Reading one
+ * property decodes one property. A table that renders twenty visible rows out of five
+ * thousand pays for twenty.
+ *
+ * Two things make the laziness safe rather than a trap:
+ *
+ *   Every property access revalidates the version. A view whose version was reclaimed raises
+ *   StaleSnapshotError on the next access rather than returning stale bytes.
+ *
+ *   Decoded nodes are memoised per version. The cache is owned by the view context and is
+ *   discarded wholesale when the root moves, so a stale entry is not reachable.
+ */
+export interface ViewContext {
+    readonly arena: SharedArena;
+    /** Throws when the version this view belongs to is no longer retained. */
+    readonly validate: () => void;
+    /** Decoded containers, keyed by arena offset, valid for one version only. */
+    readonly cache: Map<number, unknown>;
+}
+declare const VIEW_SLOT: unique symbol;
+/** True when the value is a lazy view rather than a plain decoded value. */
+export declare function isView(value: unknown): boolean;
+/** The slot a view is bound to, for callers that need the underlying reference. */
+export declare function viewSlot(value: unknown): Slot | undefined;
+/**
+ * Decode a slot into a value, lazily for containers and eagerly for everything else.
+ *
+ * Scalars are cheaper to decode than to wrap, and a `Date` or a typed array has no useful
+ * lazy form, so only objects, arrays, maps, and sets become views.
+ */
+export declare function viewValue(context: ViewContext, slot: Slot): unknown;
+/**
+ * Read one path without building views for the nodes along it.
+ *
+ * The fastest way to answer a question like "what is the count", and the shape the framework
+ * bindings use for a selector.
+ */
+export declare function readPath(arena: SharedArena, root: Slot, path: readonly (string | number)[]): unknown;
+export { VIEW_SLOT };
+/**
+ * Compare two values by the arena node behind them.
+ *
+ * The default equality for a selector is `Object.is`, and for a selector that returns a
+ * container that means a notification on every commit: each commit produces a new snapshot
+ * with a fresh decode cache, so the view object is a new proxy even when the underlying
+ * subtree did not move. Comparing the slots instead answers the question the selector
+ * actually cares about, which is whether the subtree changed.
+ *
+ * Why comparing offsets is sound here, since it looks like it should not be. A commit
+ * encodes the new value before it frees anything the old version held, so a newly written
+ * node can never land on the block the current version is using. The value a selector last
+ * saw is the current version's node, so a later node reusing that block always compares
+ * unequal to it. The comparison dereferences nothing, so a wild offset cannot make it
+ * misbehave either.
+ *
+ * It is still a comparison of representation rather than of value. Two structurally equal
+ * subtrees written separately are different nodes and compare unequal, which is the
+ * conservative direction: an extra render, never a missed one.
+ */
+export declare function sameNode(a: unknown, b: unknown): boolean;
+//# sourceMappingURL=view.d.ts.map

package/dist/src/view.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"view.d.ts","sourceRoot":"","sources":["../../src/view.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAI9C,OAAO,EAAe,KAAK,IAAI,EAAE,MAAM,aAAa,CAAC;AAKrD;;;;;;;;;;;;;;GAcG;AAEH,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,KAAK,EAAE,WAAW,CAAC;IAC5B,0EAA0E;IAC1E,QAAQ,CAAC,QAAQ,EAAE,MAAM,IAAI,CAAC;IAC9B,6EAA6E;IAC7E,QAAQ,CAAC,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CACtC;AAED,QAAA,MAAM,SAAS,eAA6B,CAAC;AAE7C,4EAA4E;AAC5E,wBAAgB,MAAM,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO,CAI9C;AAED,mFAAmF;AACnF,wBAAgB,QAAQ,CAAC,KAAK,EAAE,OAAO,GAAG,IAAI,GAAG,SAAS,CAGzD;AAED;;;;;GAKG;AACH,wBAAgB,SAAS,CAAC,OAAO,EAAE,WAAW,EAAE,IAAI,EAAE,IAAI,GAAG,OAAO,CAanE;AA8LD;;;;;GAKG;AACH,wBAAgB,QAAQ,CACtB,KAAK,EAAE,WAAW,EAClB,IAAI,EAAE,IAAI,EACV,IAAI,EAAE,SAAS,CAAC,MAAM,GAAG,MAAM,CAAC,EAAE,GACjC,OAAO,CAeT;AAUD,OAAO,EAAE,SAAS,EAAE,CAAC;AAErB;;;;;;;;;;;;;;;;;;;GAmBG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,GAAG,OAAO,CAMxD"}

package/dist/src/view.js

@@ -0,0 +1,278 @@
+import { Tag } from "./tags.js";
+import { ArenaCorruptError } from "./errors.js";
+import { decodeString } from "./strings.js";
+import { decodeValue } from "./values.js";
+import { hamtEntries, hamtGet, hamtGetString, keyHash } from "./hamt.js";
+import { vectorGet, vectorLength, vectorSlots } from "./vector.js";
+import { hashString } from "./checksum.js";
+const VIEW_SLOT = Symbol("globals.viewSlot");
+/** True when the value is a lazy view rather than a plain decoded value. */
+export function isView(value) {
+    return (value !== null && typeof value === "object" && value[VIEW_SLOT] !== undefined);
+}
+/** The slot a view is bound to, for callers that need the underlying reference. */
+export function viewSlot(value) {
+    if (value === null || typeof value !== "object")
+        return undefined;
+    return value[VIEW_SLOT];
+}
+/**
+ * Decode a slot into a value, lazily for containers and eagerly for everything else.
+ *
+ * Scalars are cheaper to decode than to wrap, and a `Date` or a typed array has no useful
+ * lazy form, so only objects, arrays, maps, and sets become views.
+ */
+export function viewValue(context, slot) {
+    switch (slot.tag) {
+        case Tag.Object:
+            return objectView(context, slot);
+        case Tag.Array:
+            return arrayView(context, slot);
+        case Tag.Map:
+            return mapView(context, slot);
+        case Tag.Set:
+            return setView(context, slot);
+        default:
+            return decodeValue(context.arena, slot);
+    }
+}
+function cached(context, offset, build) {
+    const existing = context.cache.get(offset);
+    if (existing !== undefined)
+        return existing;
+    const created = build();
+    context.cache.set(offset, created);
+    return created;
+}
+function objectView(context, slot) {
+    return cached(context, slot.payload, () => {
+        const node = slot.payload;
+        let keys;
+        const listKeys = () => {
+            if (keys === undefined) {
+                keys = hamtEntries(context.arena, node).map((entry) => {
+                    if (entry.key.tag !== Tag.String) {
+                        throw new ArenaCorruptError("object key is not a string", { actual: entry.key.tag });
+                    }
+                    return decodeString(context.arena, entry.key.payload);
+                });
+            }
+            return keys;
+        };
+        // Interning is a write, so a reader cannot compare keys by offset the way the writer
+        // does. It walks the trie by hash instead and compares characters only against the one
+        // record it lands on, which keeps the lookup logarithmic.
+        const lookup = (property) => hamtGetString(context.arena, node, property, hashString(property));
+        return new Proxy({}, {
+            get(_target, property) {
+                if (property === VIEW_SLOT)
+                    return slot;
+                if (property === "toJSON") {
+                    return () => decodeValue(context.arena, slot);
+                }
+                if (typeof property === "symbol")
+                    return undefined;
+                context.validate();
+                const found = lookup(property);
+                return found === undefined ? undefined : viewValue(context, found);
+            },
+            has(_target, property) {
+                if (typeof property === "symbol")
+                    return false;
+                context.validate();
+                return lookup(property) !== undefined;
+            },
+            ownKeys() {
+                context.validate();
+                return listKeys();
+            },
+            getOwnPropertyDescriptor(_target, property) {
+                if (typeof property === "symbol")
+                    return undefined;
+                context.validate();
+                const found = lookup(property);
+                if (found === undefined)
+                    return undefined;
+                return {
+                    configurable: true,
+                    enumerable: true,
+                    writable: false,
+                    value: viewValue(context, found),
+                };
+            },
+            set() {
+                throw new TypeError("a snapshot is read only. Send a write through the owner instead, and remember it " +
+                    "is asynchronous.");
+            },
+            deleteProperty() {
+                throw new TypeError("a snapshot is read only");
+            },
+        });
+    });
+}
+function arrayView(context, slot) {
+    return cached(context, slot.payload, () => {
+        const vector = slot.payload;
+        return new Proxy([], {
+            get(_target, property) {
+                if (property === VIEW_SLOT)
+                    return slot;
+                if (property === "length") {
+                    context.validate();
+                    return vectorLength(context.arena, vector);
+                }
+                if (property === "toJSON") {
+                    return () => decodeValue(context.arena, slot);
+                }
+                if (typeof property === "symbol") {
+                    if (property !== Symbol.iterator)
+                        return undefined;
+                    return function* iterate() {
+                        context.validate();
+                        const length = vectorLength(context.arena, vector);
+                        for (let i = 0; i < length; i += 1) {
+                            const element = vectorGet(context.arena, vector, i);
+                            yield element === undefined ? undefined : viewValue(context, element);
+                        }
+                    };
+                }
+                if (/^\d+$/.test(property)) {
+                    context.validate();
+                    const element = vectorGet(context.arena, vector, Number(property));
+                    return element === undefined ? undefined : viewValue(context, element);
+                }
+                // Array.prototype methods operate on the materialised array. Reimplementing them
+                // lazily would mean reimplementing the array protocol, and the differences would be
+                // found by users rather than by tests.
+                context.validate();
+                const materialised = vectorSlots(context.arena, vector).map((element) => viewValue(context, element));
+                const value = materialised[property];
+                return typeof value === "function" ? value.bind(materialised) : value;
+            },
+            has(_target, property) {
+                if (property === "length")
+                    return true;
+                if (typeof property === "symbol")
+                    return false;
+                if (!/^\d+$/.test(property))
+                    return false;
+                context.validate();
+                return Number(property) < vectorLength(context.arena, vector);
+            },
+            ownKeys() {
+                context.validate();
+                const length = vectorLength(context.arena, vector);
+                return [...Array.from({ length }, (_unused, index) => String(index)), "length"];
+            },
+            getOwnPropertyDescriptor(_target, property) {
+                context.validate();
+                if (property === "length") {
+                    return {
+                        configurable: false,
+                        enumerable: false,
+                        writable: false,
+                        value: vectorLength(context.arena, vector),
+                    };
+                }
+                if (typeof property === "symbol" || !/^\d+$/.test(property))
+                    return undefined;
+                const element = vectorGet(context.arena, vector, Number(property));
+                if (element === undefined)
+                    return undefined;
+                return {
+                    configurable: true,
+                    enumerable: true,
+                    writable: false,
+                    value: viewValue(context, element),
+                };
+            },
+            set() {
+                throw new TypeError("a snapshot is read only");
+            },
+        });
+    });
+}
+/**
+ * Maps and sets are materialised rather than proxied.
+ *
+ * A lazy Map would have to be a real Map to satisfy `instanceof` and the iteration protocol,
+ * and a subclass that decodes on `get` cannot intercept `size` or the iterators without
+ * surprising anyone who passes it to a library. Materialising is the honest option, and it
+ * is memoised per version so it happens once.
+ */
+function mapView(context, slot) {
+    return cached(context, slot.payload, () => {
+        context.validate();
+        return new Map(hamtEntries(context.arena, slot.payload).map((entry) => [
+            decodeValue(context.arena, entry.key),
+            viewValue(context, entry.value),
+        ]));
+    });
+}
+function setView(context, slot) {
+    return cached(context, slot.payload, () => {
+        context.validate();
+        return new Set(hamtEntries(context.arena, slot.payload).map((entry) => decodeValue(context.arena, entry.key)));
+    });
+}
+/**
+ * Read one path without building views for the nodes along it.
+ *
+ * The fastest way to answer a question like "what is the count", and the shape the framework
+ * bindings use for a selector.
+ */
+export function readPath(arena, root, path) {
+    let slot = root;
+    for (const step of path) {
+        if (slot === undefined)
+            return undefined;
+        if (slot.tag === Tag.Array) {
+            slot = vectorGet(arena, slot.payload, Number(step));
+            continue;
+        }
+        if (slot.tag === Tag.Object || slot.tag === Tag.Map) {
+            slot = lookupSlot(arena, slot.payload, step);
+            continue;
+        }
+        return undefined;
+    }
+    return slot === undefined ? undefined : decodeValue(arena, slot);
+}
+function lookupSlot(arena, node, key) {
+    if (typeof key === "number") {
+        const slot = { tag: Tag.Int32, payload: key };
+        return hamtGet(arena, node, slot, keyHash(arena, slot));
+    }
+    return hamtGetString(arena, node, key, hashString(key));
+}
+export { VIEW_SLOT };
+/**
+ * Compare two values by the arena node behind them.
+ *
+ * The default equality for a selector is `Object.is`, and for a selector that returns a
+ * container that means a notification on every commit: each commit produces a new snapshot
+ * with a fresh decode cache, so the view object is a new proxy even when the underlying
+ * subtree did not move. Comparing the slots instead answers the question the selector
+ * actually cares about, which is whether the subtree changed.
+ *
+ * Why comparing offsets is sound here, since it looks like it should not be. A commit
+ * encodes the new value before it frees anything the old version held, so a newly written
+ * node can never land on the block the current version is using. The value a selector last
+ * saw is the current version's node, so a later node reusing that block always compares
+ * unequal to it. The comparison dereferences nothing, so a wild offset cannot make it
+ * misbehave either.
+ *
+ * It is still a comparison of representation rather than of value. Two structurally equal
+ * subtrees written separately are different nodes and compare unequal, which is the
+ * conservative direction: an extra render, never a missed one.
+ */
+export function sameNode(a, b) {
+    if (Object.is(a, b))
+        return true;
+    const left = viewSlot(a);
+    const right = viewSlot(b);
+    if (left === undefined || right === undefined)
+        return false;
+    return left.tag === right.tag && left.payload === right.payload;
+}
+//# sourceMappingURL=view.js.map

package/dist/src/view.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"view.js","sourceRoot":"","sources":["../../src/view.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,GAAG,EAAE,MAAM,WAAW,CAAC;AAChC,OAAO,EAAE,iBAAiB,EAAE,MAAM,aAAa,CAAC;AAChD,OAAO,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AAC5C,OAAO,EAAE,WAAW,EAAa,MAAM,aAAa,CAAC;AACrD,OAAO,EAAE,WAAW,EAAE,OAAO,EAAE,aAAa,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AACzE,OAAO,EAAE,SAAS,EAAE,YAAY,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AACnE,OAAO,EAAE,UAAU,EAAE,MAAM,eAAe,CAAC;AA0B3C,MAAM,SAAS,GAAG,MAAM,CAAC,kBAAkB,CAAC,CAAC;AAE7C,4EAA4E;AAC5E,MAAM,UAAU,MAAM,CAAC,KAAc;IACnC,OAAO,CACL,KAAK,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAK,KAAiC,CAAC,SAAS,CAAC,KAAK,SAAS,CAC3G,CAAC;AACJ,CAAC;AAED,mFAAmF;AACnF,MAAM,UAAU,QAAQ,CAAC,KAAc;IACrC,IAAI,KAAK,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,SAAS,CAAC;IAClE,OAAQ,KAA0C,CAAC,SAAS,CAAC,CAAC;AAChE,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,SAAS,CAAC,OAAoB,EAAE,IAAU;IACxD,QAAQ,IAAI,CAAC,GAAG,EAAE,CAAC;QACjB,KAAK,GAAG,CAAC,MAAM;YACb,OAAO,UAAU,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;QACnC,KAAK,GAAG,CAAC,KAAK;YACZ,OAAO,SAAS,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;QAClC,KAAK,GAAG,CAAC,GAAG;YACV,OAAO,OAAO,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;QAChC,KAAK,GAAG,CAAC,GAAG;YACV,OAAO,OAAO,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;QAChC;YACE,OAAO,WAAW,CAAC,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAC5C,CAAC;AACH,CAAC;AAED,SAAS,MAAM,CAAI,OAAoB,EAAE,MAAc,EAAE,KAAc;IACrE,MAAM,QAAQ,GAAG,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAC3C,IAAI,QAAQ,KAAK,SAAS;QAAE,OAAO,QAAa,CAAC;IACjD,MAAM,OAAO,GAAG,KAAK,EAAE,CAAC;IACxB,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACnC,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,SAAS,UAAU,CAAC,OAAoB,EAAE,IAAU;IAClD,OAAO,MAAM,CAAC,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,GAAG,EAAE;QACxC,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC;QAC1B,IAAI,IAA0B,CAAC;QAE/B,MAAM,QAAQ,GAAG,GAAa,EAAE;YAC9B,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;gBACvB,IAAI,GAAG,WAAW,CAAC,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;oBACpD,IAAI,KAAK,CAAC,GAAG,CAAC,GAAG,KAAK,GAAG,CAAC,MAAM,EAAE,CAAC;wBACjC,MAAM,IAAI,iBAAiB,CAAC,4BAA4B,EAAE,EAAE,MAAM,EAAE,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC;oBACvF,CAAC;oBACD,OAAO,YAAY,CAAC,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;gBACxD,CAAC,CAAC,CAAC;YACL,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC,CAAC;QAEF,qFAAqF;QACrF,uFAAuF;QACvF,0DAA0D;QAC1D,MAAM,MAAM,GAAG,CAAC,QAAgB,EAAoB,EAAE,CACpD,aAAa,CAAC,OAAO,CAAC,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC;QAErE,OAAO,IAAI,KAAK,CAAC,EAA6B,EAAE;YAC9C,GAAG,CAAC,OAAO,EAAE,QAAQ;gBACnB,IAAI,QAAQ,KAAK,SAAS;oBAAE,OAAO,IAAI,CAAC;gBACxC,IAAI,QAAQ,KAAK,QAAQ,EAAE,CAAC;oBAC1B,OAAO,GAAG,EAAE,CAAC,WAAW,CAAC,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;gBAChD,CAAC;gBACD,IAAI,OAAO,QAAQ,KAAK,QAAQ;oBAAE,OAAO,SAAS,CAAC;gBACnD,OAAO,CAAC,QAAQ,EAAE,CAAC;gBACnB,MAAM,KAAK,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC;gBAC/B,OAAO,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;YACrE,CAAC;YACD,GAAG,CAAC,OAAO,EAAE,QAAQ;gBACnB,IAAI,OAAO,QAAQ,KAAK,QAAQ;oBAAE,OAAO,KAAK,CAAC;gBAC/C,OAAO,CAAC,QAAQ,EAAE,CAAC;gBACnB,OAAO,MAAM,CAAC,QAAQ,CAAC,KAAK,SAAS,CAAC;YACxC,CAAC;YACD,OAAO;gBACL,OAAO,CAAC,QAAQ,EAAE,CAAC;gBACnB,OAAO,QAAQ,EAAE,CAAC;YACpB,CAAC;YACD,wBAAwB,CAAC,OAAO,EAAE,QAAQ;gBACxC,IAAI,OAAO,QAAQ,KAAK,QAAQ;oBAAE,OAAO,SAAS,CAAC;gBACnD,OAAO,CAAC,QAAQ,EAAE,CAAC;gBACnB,MAAM,KAAK,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC;gBAC/B,IAAI,KAAK,KAAK,SAAS;oBAAE,OAAO,SAAS,CAAC;gBAC1C,OAAO;oBACL,YAAY,EAAE,IAAI;oBAClB,UAAU,EAAE,IAAI;oBAChB,QAAQ,EAAE,KAAK;oBACf,KAAK,EAAE,SAAS,CAAC,OAAO,EAAE,KAAK,CAAC;iBACjC,CAAC;YACJ,CAAC;YACD,GAAG;gBACD,MAAM,IAAI,SAAS,CACjB,mFAAmF;oBACjF,kBAAkB,CACrB,CAAC;YACJ,CAAC;YACD,cAAc;gBACZ,MAAM,IAAI,SAAS,CAAC,yBAAyB,CAAC,CAAC;YACjD,CAAC;SACF,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC;AAED,SAAS,SAAS,CAAC,OAAoB,EAAE,IAAU;IACjD,OAAO,MAAM,CAAC,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,GAAG,EAAE;QACxC,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC;QAE5B,OAAO,IAAI,KAAK,CAAC,EAAe,EAAE;YAChC,GAAG,CAAC,OAAO,EAAE,QAAQ;gBACnB,IAAI,QAAQ,KAAK,SAAS;oBAAE,OAAO,IAAI,CAAC;gBACxC,IAAI,QAAQ,KAAK,QAAQ,EAAE,CAAC;oBAC1B,OAAO,CAAC,QAAQ,EAAE,CAAC;oBACnB,OAAO,YAAY,CAAC,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;gBAC7C,CAAC;gBACD,IAAI,QAAQ,KAAK,QAAQ,EAAE,CAAC;oBAC1B,OAAO,GAAG,EAAE,CAAC,WAAW,CAAC,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;gBAChD,CAAC;gBACD,IAAI,OAAO,QAAQ,KAAK,QAAQ,EAAE,CAAC;oBACjC,IAAI,QAAQ,KAAK,MAAM,CAAC,QAAQ;wBAAE,OAAO,SAAS,CAAC;oBACnD,OAAO,QAAQ,CAAC,CAAC,OAAO;wBACtB,OAAO,CAAC,QAAQ,EAAE,CAAC;wBACnB,MAAM,MAAM,GAAG,YAAY,CAAC,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;wBACnD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;4BACnC,MAAM,OAAO,GAAG,SAAS,CAAC,OAAO,CAAC,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;4BACpD,MAAM,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;wBACxE,CAAC;oBACH,CAAC,CAAC;gBACJ,CAAC;gBAED,IAAI,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;oBAC3B,OAAO,CAAC,QAAQ,EAAE,CAAC;oBACnB,MAAM,OAAO,GAAG,SAAS,CAAC,OAAO,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;oBACnE,OAAO,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;gBACzE,CAAC;gBAED,iFAAiF;gBACjF,oFAAoF;gBACpF,uCAAuC;gBACvC,OAAO,CAAC,QAAQ,EAAE,CAAC;gBACnB,MAAM,YAAY,GAAG,WAAW,CAAC,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CACtE,SAAS,CAAC,OAAO,EAAE,OAAO,CAAC,CAC5B,CAAC;gBACF,MAAM,KAAK,GAAI,YAAmD,CAAC,QAAQ,CAAC,CAAC;gBAC7E,OAAO,OAAO,KAAK,KAAK,UAAU,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;YACxE,CAAC;YACD,GAAG,CAAC,OAAO,EAAE,QAAQ;gBACnB,IAAI,QAAQ,KAAK,QAAQ;oBAAE,OAAO,IAAI,CAAC;gBACvC,IAAI,OAAO,QAAQ,KAAK,QAAQ;oBAAE,OAAO,KAAK,CAAC;gBAC/C,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC;oBAAE,OAAO,KAAK,CAAC;gBAC1C,OAAO,CAAC,QAAQ,EAAE,CAAC;gBACnB,OAAO,MAAM,CAAC,QAAQ,CAAC,GAAG,YAAY,CAAC,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;YAChE,CAAC;YACD,OAAO;gBACL,OAAO,CAAC,QAAQ,EAAE,CAAC;gBACnB,MAAM,MAAM,GAAG,YAAY,CAAC,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;gBACnD,OAAO,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,OAAO,EAAE,KAAK,EAAE,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;YAClF,CAAC;YACD,wBAAwB,CAAC,OAAO,EAAE,QAAQ;gBACxC,OAAO,CAAC,QAAQ,EAAE,CAAC;gBACnB,IAAI,QAAQ,KAAK,QAAQ,EAAE,CAAC;oBAC1B,OAAO;wBACL,YAAY,EAAE,KAAK;wBACnB,UAAU,EAAE,KAAK;wBACjB,QAAQ,EAAE,KAAK;wBACf,KAAK,EAAE,YAAY,CAAC,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC;qBAC3C,CAAC;gBACJ,CAAC;gBACD,IAAI,OAAO,QAAQ,KAAK,QAAQ,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC;oBAAE,OAAO,SAAS,CAAC;gBAC9E,MAAM,OAAO,GAAG,SAAS,CAAC,OAAO,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;gBACnE,IAAI,OAAO,KAAK,SAAS;oBAAE,OAAO,SAAS,CAAC;gBAC5C,OAAO;oBACL,YAAY,EAAE,IAAI;oBAClB,UAAU,EAAE,IAAI;oBAChB,QAAQ,EAAE,KAAK;oBACf,KAAK,EAAE,SAAS,CAAC,OAAO,EAAE,OAAO,CAAC;iBACnC,CAAC;YACJ,CAAC;YACD,GAAG;gBACD,MAAM,IAAI,SAAS,CAAC,yBAAyB,CAAC,CAAC;YACjD,CAAC;SACF,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,OAAO,CAAC,OAAoB,EAAE,IAAU;IAC/C,OAAO,MAAM,CAAC,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,GAAG,EAAE;QACxC,OAAO,CAAC,QAAQ,EAAE,CAAC;QACnB,OAAO,IAAI,GAAG,CACZ,WAAW,CAAC,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC;YACtD,WAAW,CAAC,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC;YACrC,SAAS,CAAC,OAAO,EAAE,KAAK,CAAC,KAAK,CAAC;SAChC,CAAC,CACH,CAAC;IACJ,CAAC,CAAC,CAAC;AACL,CAAC;AAED,SAAS,OAAO,CAAC,OAAoB,EAAE,IAAU;IAC/C,OAAO,MAAM,CAAC,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,GAAG,EAAE;QACxC,OAAO,CAAC,QAAQ,EAAE,CAAC;QACnB,OAAO,IAAI,GAAG,CACZ,WAAW,CAAC,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CACrD,WAAW,CAAC,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CACtC,CACF,CAAC;IACJ,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,QAAQ,CACtB,KAAkB,EAClB,IAAU,EACV,IAAkC;IAElC,IAAI,IAAI,GAAqB,IAAI,CAAC;IAClC,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;QACxB,IAAI,IAAI,KAAK,SAAS;YAAE,OAAO,SAAS,CAAC;QACzC,IAAI,IAAI,CAAC,GAAG,KAAK,GAAG,CAAC,KAAK,EAAE,CAAC;YAC3B,IAAI,GAAG,SAAS,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;YACpD,SAAS;QACX,CAAC;QACD,IAAI,IAAI,CAAC,GAAG,KAAK,GAAG,CAAC,MAAM,IAAI,IAAI,CAAC,GAAG,KAAK,GAAG,CAAC,GAAG,EAAE,CAAC;YACpD,IAAI,GAAG,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;YAC7C,SAAS;QACX,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,OAAO,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,WAAW,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;AACnE,CAAC;AAED,SAAS,UAAU,CAAC,KAAkB,EAAE,IAAY,EAAE,GAAoB;IACxE,IAAI,OAAO,GAAG,KAAK,QAAQ,EAAE,CAAC;QAC5B,MAAM,IAAI,GAAS,EAAE,GAAG,EAAE,GAAG,CAAC,KAAK,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC;QACpD,OAAO,OAAO,CAAC,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC;IAC1D,CAAC;IACD,OAAO,aAAa,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,EAAE,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;AAC1D,CAAC;AAED,OAAO,EAAE,SAAS,EAAE,CAAC;AAErB;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAM,UAAU,QAAQ,CAAC,CAAU,EAAE,CAAU;IAC7C,IAAI,MAAM,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;QAAE,OAAO,IAAI,CAAC;IACjC,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;IACzB,MAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;IAC1B,IAAI,IAAI,KAAK,SAAS,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,KAAK,CAAC;IAC5D,OAAO,IAAI,CAAC,GAAG,KAAK,KAAK,CAAC,GAAG,IAAI,IAAI,CAAC,OAAO,KAAK,KAAK,CAAC,OAAO,CAAC;AAClE,CAAC"}

package/package.json

@@ -0,0 +1,28 @@
+{
+  "name": "@bradensbay/globals-core",
+  "version": "0.2.0",
+  "description": "Runtime agnostic shared memory arena: tagged value encoding, persistent data structures, epoch based reclamation.",
+  "type": "module",
+  "main": "./dist/src/index.js",
+  "types": "./dist/src/index.d.ts",
+  "exports": {
+    ".": {
+      "types": "./dist/src/index.d.ts",
+      "import": "./dist/src/index.js"
+    }
+  },
+  "files": [
+    "dist/src",
+    "README.md"
+  ],
+  "engines": {
+    "node": ">=20.11.0"
+  },
+  "sideEffects": false,
+  "license": "MIT",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/christianGRogers/globals.git",
+    "directory": "packages/core"
+  }
+}