50:I[707087,["/_next/static/immutable/chunks/3arlv5bvukoo2.js","/_next/static/immutable/chunks/39v64hmfyo-sr.js","/_next/static/immutable/chunks/2nvof3-29tvc3.js","/_next/static/immutable/chunks/3tjobt77z_9dj.js","/_next/static/immutable/chunks/04j_o97cgxn2x.js","/_next/static/immutable/chunks/3upr08c9vtj8w.js","/_next/static/immutable/chunks/1ww0328si-u8x.js","/_next/static/immutable/chunks/11mfl5ymqld9-.js","/_next/static/immutable/chunks/2xxcqy6ppds3l.js","/_next/static/immutable/chunks/3j06ow7w40nxu.js","/_next/static/immutable/chunks/31nn7jwsjvqii.js","/_next/static/immutable/chunks/43_s7jweyypoh.js","/_next/static/immutable/chunks/0p6vao205o1jc.js","/_next/static/immutable/chunks/1_kyvgkyokw92.js","/_next/static/immutable/chunks/1lo-zn37dolb5.js","/_next/static/immutable/chunks/1v8k6yxw1rg0u.js"],"RegistryDependencies"] 51:I[544296,["/_next/static/immutable/chunks/3arlv5bvukoo2.js","/_next/static/immutable/chunks/39v64hmfyo-sr.js","/_next/static/immutable/chunks/2nvof3-29tvc3.js","/_next/static/immutable/chunks/3tjobt77z_9dj.js","/_next/static/immutable/chunks/04j_o97cgxn2x.js","/_next/static/immutable/chunks/3upr08c9vtj8w.js","/_next/static/immutable/chunks/1ww0328si-u8x.js","/_next/static/immutable/chunks/11mfl5ymqld9-.js","/_next/static/immutable/chunks/2xxcqy6ppds3l.js","/_next/static/immutable/chunks/3j06ow7w40nxu.js","/_next/static/immutable/chunks/31nn7jwsjvqii.js","/_next/static/immutable/chunks/43_s7jweyypoh.js","/_next/static/immutable/chunks/0p6vao205o1jc.js","/_next/static/immutable/chunks/1_kyvgkyokw92.js","/_next/static/immutable/chunks/1lo-zn37dolb5.js","/_next/static/immutable/chunks/1v8k6yxw1rg0u.js"],"ItemStyles"] 52:I[34002,["/_next/static/immutable/chunks/3arlv5bvukoo2.js","/_next/static/immutable/chunks/39v64hmfyo-sr.js","/_next/static/immutable/chunks/2nvof3-29tvc3.js","/_next/static/immutable/chunks/3tjobt77z_9dj.js","/_next/static/immutable/chunks/04j_o97cgxn2x.js","/_next/static/immutable/chunks/3upr08c9vtj8w.js","/_next/static/immutable/chunks/1ww0328si-u8x.js","/_next/static/immutable/chunks/11mfl5ymqld9-.js","/_next/static/immutable/chunks/2xxcqy6ppds3l.js","/_next/static/immutable/chunks/3j06ow7w40nxu.js","/_next/static/immutable/chunks/31nn7jwsjvqii.js","/_next/static/immutable/chunks/43_s7jweyypoh.js","/_next/static/immutable/chunks/0p6vao205o1jc.js","/_next/static/immutable/chunks/1_kyvgkyokw92.js","/_next/static/immutable/chunks/1lo-zn37dolb5.js","/_next/static/immutable/chunks/1v8k6yxw1rg0u.js"],"CodeEditor"] 53:I[314491,["/_next/static/immutable/chunks/3arlv5bvukoo2.js","/_next/static/immutable/chunks/39v64hmfyo-sr.js","/_next/static/immutable/chunks/2nvof3-29tvc3.js","/_next/static/immutable/chunks/3tjobt77z_9dj.js","/_next/static/immutable/chunks/04j_o97cgxn2x.js","/_next/static/immutable/chunks/3upr08c9vtj8w.js","/_next/static/immutable/chunks/1ww0328si-u8x.js","/_next/static/immutable/chunks/11mfl5ymqld9-.js","/_next/static/immutable/chunks/2xxcqy6ppds3l.js","/_next/static/immutable/chunks/3j06ow7w40nxu.js","/_next/static/immutable/chunks/31nn7jwsjvqii.js","/_next/static/immutable/chunks/43_s7jweyypoh.js","/_next/static/immutable/chunks/0p6vao205o1jc.js","/_next/static/immutable/chunks/1_kyvgkyokw92.js","/_next/static/immutable/chunks/1lo-zn37dolb5.js","/_next/static/immutable/chunks/1v8k6yxw1rg0u.js"],"FilesView"] 54:T829b,// Hairline UI · json-inspector · MIT License // Copyright (c) 2026 Hairline UI · https://hairlineui.com/license#components "use client"; import * as React from "react"; import { buildTree, diffTree, flatten, formatPath, parseError, searchTree, type JsonKey, type JsonNode } from "./json-tree"; import { NumberRoll } from "./number-roll"; import { StatusButton, type ActionStatus } from "./status-button"; import { TextMorph } from "./text-morph"; /* ───────────────────────────────────────────────────────── * JSON INSPECTOR: a payload you can read, search and quote * * fold objects and arrays open and close by height, the * chevron turns; closed ones show what's inside * ({ id, amount, … } or 12 items) * search every key and value that matches; the branches * above them unfold, the count rolls, Enter steps * from match to match and scrolls to it * path the row you're on is written out below, morphing * letter by letter as you move (data.lines[0].id), * ready to copy along with its value * read the row you're on shows its whole string, and * timestamps say when they are * diff give it the value before: added, removed and * changed keys are marked, old values sit struck * through beside the new, and what didn't change * folds into "12 unchanged" * broken text that isn't JSON points at the line and column * * It's a tree for the keyboard: arrows move and open, Home and * End jump, / searches, ⌘C copies the value you're on. * ───────────────────────────────────────────────────────── */ export interface JsonInspectorProps extends Omit, "title"> { /** A value to show. */ data?: unknown; /** Or JSON text; if it doesn't parse, the error is shown where it is. */ text?: string; /** The value before: shows how it became `data`. */ compare?: unknown; /** In a diff, match array items by this key ("id") instead of by position. */ arrayKey?: string; /** Levels open at first. */ expandDepth?: number; /** Shown at the top left, e.g. the event name. */ title?: React.ReactNode; /** Height of the scrolling body in px. */ maxHeight?: number; /** How paths are written when copied. */ pathStyle?: "js" | "jq"; /** Accessible name of the tree. */ label?: string; /** Start with this search, e.g. from a "find in payload" link. */ defaultQuery?: string; } const EASE = "cubic-bezier(0.16,1,0.3,1)"; const CHUNK = 100; const INDENT = 14; const FOCUS = "focus-visible:outline-none focus-visible:ring-2 focus-visible:ring-ring/40"; // GitHub's palette for light and dark, as in Code block. const TONE = { string: "text-[#0a3069] dark:text-[#a5d6ff]", number: "text-[#0550ae] dark:text-[#79c0ff]", boolean: "text-[#cf222e] dark:text-[#ff7b72]", null: "italic text-muted-foreground", }; const reducedQuery = "(prefers-reduced-motion: reduce)"; const subscribeReduced = (onChange: () => void) => { const query = window.matchMedia(reducedQuery); query.addEventListener("change", onChange); return () => query.removeEventListener("change", onChange); }; const useReducedMotion = () => React.useSyncExternalStore(subscribeReduced, () => window.matchMedia(reducedQuery).matches, () => false); const isContainer = (n: JsonNode) => n.children !== undefined; const removedIndex = (k: JsonKey) => (typeof k === "string" && /^\d+ $removed$$/.test(k) ? parseInt(k) : k); function valueAt(value: unknown, path: JsonKey[]) { let v = value; for (const k of path) { if (v === null || typeof v !== "object") return undefined; v = (v as Record)[removedIndex(k)]; } return v; } const TIME_KEY = /(^|_)(at|created|updated|date|time|timestamp|period_start|period_end|expires|due)($|_)/i; /** When a value is a moment: an ISO string, or Unix seconds under a key that sounds like a time. */ function when(node: JsonNode): string | null { const v = node.value; let date: Date | null = null; if (typeof v === "string" && /^\d{4}-\d{2}-\d{2}T\d{2}:\d{2}/.test(v)) date = new Date(v); else if (typeof v === "number" && typeof node.key === "string" && TIME_KEY.test(node.key) && v > 9e8 && v < 4e9) date = new Date(v * 1000); else if (typeof v === "number" && typeof node.key === "string" && TIME_KEY.test(node.key) && v > 9e11 && v < 4e12) date = new Date(v); if (!date || isNaN(date.getTime())) return null; return new Intl.DateTimeFormat(undefined, { day: "numeric", month: "short", year: "numeric", hour: "2-digit", minute: "2-digit" }).format(date); } function Marked({ text, query, current }: { text: string; query: string; current: boolean }) { const q = query.trim().toLowerCase(); if (!q) return <>{text}; const lower = text.toLowerCase(); const parts: React.ReactNode[] = []; let at = 0; for (let i = lower.indexOf(q); i !== -1; i = lower.indexOf(q, i + q.length)) { if (i > at) parts.push(text.slice(at, i)); parts.push( {text.slice(i, i + q.length)} , ); at = i + q.length; } if (at < text.length) parts.push(text.slice(at)); return <>{parts}; } function Value({ node, query, current, before }: { node: JsonNode; query: string; current: boolean; before?: boolean }) { const v = before ? node.before : node.value; const kind = before ? (node.beforeKind ?? node.kind) : node.kind; if (kind === "object" || kind === "array") return {String(v)}; if (kind === "string" && !before) return “”; if (kind === "string") return “{String(v)}”; const tone = kind === "null" ? TONE.null : kind === "boolean" ? TONE.boolean : TONE.number; return {before ? String(v) : }; } function preview(node: JsonNode) { if (node.kind === "array") return `${node.size} ${node.size === 1 ? "item" : "items"}`; const keys = (node.children ?? []).slice(0, 3).map((c) => String(c.key)); return `{ ${keys.join(", ")}${(node.size ?? 0) > 3 ? ", …" : ""} }`; } function Chevron({ open, reduced }: { open: boolean; reduced: boolean }) { return ( ); } /** A block that opens and closes by height; its children stay mounted once shown, so closing animates too. */ function Fold({ open, reduced, children, id }: { open: boolean; reduced: boolean; children: React.ReactNode; id?: string }) { return (

{children}

); } export function JsonInspector({ data, text, compare, arrayKey, expandDepth = 2, title, maxHeight = 360, pathStyle = "js", label = "JSON", defaultQuery = "", className = "", ...props }: JsonInspectorProps) { const uid = React.useId(); const reduced = useReducedMotion(); const diff = compare !== undefined; // The value: given, or parsed from text. const parsed = React.useMemo(() => { if (text === undefined) return { ok: true as const, value: data }; try { return { ok: true as const, value: JSON.parse(text) as unknown }; } catch (err) { return { ok: false as const, error: parseError(text, err) }; } }, [text, data]); const value = parsed.ok ? parsed.value : undefined; const root = React.useMemo(() => (diff ? diffTree(compare, value, { arrayKey }) : buildTree(value)), [diff, compare, value, arrayKey]); const { all, parent } = React.useMemo(() => flatten(root), [root]); const byId = React.useMemo(() => new Map(all.map((n) => [n.id, n])), [all]); const initialOpen = React.useCallback(() => { const open = new Set(); for (const n of all) if (isContainer(n) && (diff ? n.change === "changed" && n.children?.length : n.depth < expandDepth)) open.add(n.id); open.add(root.id); return open; }, [all, diff, expandDepth, root.id]); const [expanded, setExpanded] = React.useState(initialOpen); const [seenRoot, setSeenRoot] = React.useState(root); const [focusId, setFocusId] = React.useState(root.id); const [query, setQuery] = React.useState(defaultQuery); const [typed, setTyped] = React.useState(defaultQuery); const [matchIndex, setMatchIndex] = React.useState(0); const [onlyChanges, setOnlyChanges] = React.useState(true); const [showSame, setShowSame] = React.useState>(() => new Set()); const [chunks, setChunks] = React.useState>(() => new Map()); const [copied, setCopied] = React.useState<{ path: ActionStatus; value: ActionStatus }>({ path: "idle", value: "idle" }); const [announce, setAnnounce] = React.useState(""); const [keyed, setKeyed] = React.useState(false); const mountedRef = React.useRef>(new Set()); const scrollerRef = React.useRef(null); const searchRef = React.useRef(null); const rowRefs = React.useRef(new Map()); // New data: start again from its own first view. if (root !== seenRoot) { setSeenRoot(root); setExpanded(initialOpen()); setFocusId(root.id); setShowSame(new Set()); setChunks(new Map()); } // Typing settles before it searches. React.useEffect(() => { const t = window.setTimeout(() => setQuery(typed), 120); return () => window.clearTimeout(t); }, [typed]); const matches = React.useMemo(() => searchTree(all, query), [all, query]); const current = matches.length ? matches[Math.min(matchIndex, matches.length - 1)] : null; // The branches above every match open while you search. const forced = React.useMemo(() => { const out = new Set(); for (const id of matches) for (let p = parent.get(id); p; p = parent.get(p)) out.add(p); return out; }, [matches, parent]); const isOpen = (id: string) => expanded.has(id) || forced.has(id); // A match that sits past a "show more" or among hidden unchanged keys is shown too. const matchSet = React.useMemo(() => new Set(matches), [matches]); const hiddenSame = (n: JsonNode, p: JsonNode) => diff && onlyChanges && n.change === "same" && !showSame.has(p.id) && !forced.has(n.id) && !matchSet.has(n.id); const shownChildren = (n: JsonNode) => { const kids = (n.children ?? []).filter((c) => !hiddenSame(c, n)); const limit = chunks.get(n.id) ?? CHUNK; const needed = kids.findIndex((c, i) => i >= limit && (c.id === current || forced.has(c.id))); return kids.slice(0, Math.max(limit, needed + 1)); }; /** Where a row's key starts, so brackets and "show more" line up with it. */ const keyStart = (depth: number) => 6 + depth * INDENT + (diff ? 12 : 0) + 18; // Rows in the order the keyboard walks them. const order = React.useMemo(() => { const out: string[] = []; const walk = (n: JsonNode) => { out.push(n.id); if (isContainer(n) && isOpen(n.id)) shownChildren(n).forEach(walk); }; walk(root); return out; // eslint-disable-next-line react-hooks/exhaustive-deps }, [root, expanded, forced, onlyChanges, showSame, chunks, current]); const toggle = (id: string, open?: boolean) => { setExpanded((s) => { const next = new Set(s); if (open ?? !next.has(id)) next.add(id); else next.delete(id); return next; }); }; const move = (id: string, scroll = true) => { setFocusId(id); const row = rowRefs.current.get(id); row?.focus({ preventScroll: !scroll }); }; // Stepping through matches puts you on each one and brings it into view. React.useEffect(() => { if (!current) return; setFocusId(current); const frame = requestAnimationFrame(() => { const row = rowRefs.current.get(current); const scroller = scrollerRef.current; if (!row || !scroller) return; const top = row.getBoundingClientRect().top - scroller.getBoundingClientRect().top + scroller.scrollTop; if (top < scroller.scrollTop + 8 || top + row.offsetHeight > scroller.scrollTop + scroller.clientHeight - 8) scroller.scrollTo({ top: Math.max(0, top - scroller.clientHeight / 3), behavior: reduced ? "auto" : "smooth" }); }); return () => cancelAnimationFrame(frame); }, [current, reduced]); React.useEffect(() => { if (!query) return; const t = window.setTimeout(() => setAnnounce(matches.length ? `${matches.length} ${matches.length === 1 ? "match" : "matches"}` : "No matches"), 300); return () => window.clearTimeout(t); }, [matches.length, query]); const step = (dir: 1 | -1) => { if (!matches.length) return; setMatchIndex((i) => (Math.min(i, matches.length - 1) + dir + matches.length) % matches.length); }; const focused = byId.get(focusId) ?? root; const focusPath = formatPath(focused.path, pathStyle); const focusValue = () => { const from = focused.change === "removed" ? compare : value; const v = focused.path.length ? valueAt(from, focused.path) : from; return typeof v === "string" ? v : JSON.stringify(v, null, 2); }; const copy = async (what: "path" | "value") => { try { await navigator.clipboard.writeText(what === "path" ? focusPath : (focusValue() ?? "")); setCopied((c) => ({ ...c, [what]: "success" })); setAnnounce(what === "path" ? `Copied ${focusPath}` : "Copied the value"); } catch { setCopied((c) => ({ ...c, [what]: "error" })); } }; const onTreeKey = (e: React.KeyboardEvent) => { setKeyed(true); const at = order.indexOf(focusId); const n = focused; if (e.key === "ArrowDown" && at < order.length - 1) move(order[at + 1]); else if (e.key === "ArrowUp" && at > 0) move(order[at - 1]); else if (e.key === "Home") move(order[0]); else if (e.key === "End") move(order[order.length - 1]); else if (e.key === "ArrowRight" && isContainer(n)) { if (!isOpen(n.id)) toggle(n.id, true); else if (order[at + 1] && parent.get(order[at + 1]) === n.id) move(order[at + 1]); } else if (e.key === "ArrowLeft") { if (isContainer(n) && isOpen(n.id) && !forced.has(n.id)) toggle(n.id, false); else if (parent.get(n.id)) move(parent.get(n.id)!); } else if ((e.key === "Enter" || e.key === " ") && isContainer(n)) toggle(n.id); else if (e.key === "/" ) { searchRef.current?.focus(); searchRef.current?.select(); } else if ((e.metaKey || e.ctrlKey) && e.key.toLowerCase() === "c" && !window.getSelection()?.toString()) { void copy("value"); } else return; e.preventDefault(); }; const allOpen = all.every((n) => !isContainer(n) || expanded.has(n.id)); const counts = root.counts ?? { added: 0, removed: 0, changed: 0 }; /* ── Rows ── */ const renderNode = (n: JsonNode, p: JsonNode | null, index: number, siblings: number): React.ReactNode => { const container = isContainer(n); const open = container && isOpen(n.id); if (open) mountedRef.current.add(n.id); const isFocus = n.id === focusId; const isMatch = n.id === current; const keyText = n.key === null ? null : String(removedIndex(n.key)); const kids = container && (open || mountedRef.current.has(n.id)) ? shownChildren(n) : []; const sameHidden = container && diff && onlyChanges && !showSame.has(n.id) ? (n.children ?? []).filter((c) => hiddenSame(c, n)).length : 0; const total = container ? (n.children ?? []).length - sameHidden : 0; const limit = chunks.get(n.id) ?? CHUNK; const moment = isFocus && !container ? when(n) : null; const removed = n.change === "removed"; const sign = !diff ? null : n.change === "added" ? "+" : removed ? "−" : n.change === "changed" && !container ? "~" : ""; const tint = n.change === "added" ? "bg-emerald-500/[0.07]" : removed ? "bg-red-500/[0.07]" : ""; return (

{ if (el) rowRefs.current.set(n.id, el); else rowRefs.current.delete(n.id); }} role="treeitem" data-id={n.id} aria-level={n.depth + 1} aria-setsize={siblings} aria-posinset={index + 1} aria-expanded={container ? open : undefined} aria-selected={isFocus} aria-owns={container && open ? `${uid}-g${n.id}` : undefined} aria-label={`${keyText ?? label}${container ? `, ${n.kind === "array" ? `${n.size} items` : `${n.size} keys`}` : `: ${String(n.value)}`}${removed ? ", removed" : n.change === "added" ? ", added" : !container && n.change === "changed" ? `, was ${String(n.before)}` : ""}`} tabIndex={isFocus ? 0 : -1} onClick={() => { setKeyed(false); setFocusId(n.id); if (container) toggle(n.id); }} onFocus={() => setFocusId(n.id)} className={`relative flex min-h-[24px] cursor-pointer items-start rounded-[7px] pr-2 font-mono text-[12px] leading-[24px] outline-none transition-colors duration-150 ${tint} ${ isFocus ? (keyed ? "bg-accent shadow-[inset_0_0_0_1px_color-mix(in_oklab,var(--ring)_45%,transparent)]" : "bg-accent") : "hover:bg-accent/60" }`} style={{ paddingLeft: 6 + n.depth * INDENT }} > {/* Hairline guides for each level above this row. */} {Array.from({ length: n.depth }, (_, d) => ( ))} {diff && ( )} {keyText !== null && ( {typeof n.key === "string" && !/^\d+ $removed$$/.test(n.key) ? : keyText} : )} {container ? ( {open ? (n.kind === "array" ? "[" : "{") : preview(n)} {diff && !open && n.change === "changed" && ( {n.counts && [n.counts.added ? `+${n.counts.added}` : "", n.counts.removed ? `−${n.counts.removed}` : "", n.counts.changed ? `~${n.counts.changed}` : ""].filter(Boolean).join(" ")} )} ) : ( {n.change === "changed" && ( <> → )} )} {moment && {moment}}

{container && ( {kids.map((c, i) => renderNode(c, n, i, kids.length))} {kids.length < total && ( )} {sameHidden > 0 && ( )} )} ); }; /* ── Parse error ── */ if (!parsed.ok) { const { message, line, column } = parsed.error; const lines = (text ?? "").split("\n"); const from = Math.max(1, line - 2); const to = Math.min(lines.length, line + 2); return (

Not valid JSON: {message}. Line {line}, column {column}.

          {lines.slice(from - 1, to).map((l, i) => {
            const n = from + i;
            const bad = n === line;
            return (
              
                
                  {n}
                  {l || " "}
                
                {bad && (
                  
                    
                    {" ".repeat(Math.max(0, column - 1))}^
                  
                )}
              
            );
          })}

); } /* ── The inspector ── */ return (

{/* The title keeps room to be read; the search wraps onto its own line before it truncates. */} {title &&

{title}

} {diff && (

{counts.changed > 0 && {counts.changed} changed} {counts.added > 0 && {counts.added} added} {counts.removed > 0 && {counts.removed} removed} {!counts.changed && !counts.added && !counts.removed && No changes}

)}

{ setTyped(e.target.value); setMatchIndex(0); }} onKeyDown={(e) => { if (e.key === "Enter") { e.preventDefault(); step(e.shiftKey ? -1 : 1); } else if (e.key === "ArrowDown") { e.preventDefault(); step(1); } else if (e.key === "ArrowUp") { e.preventDefault(); step(-1); } else if (e.key === "Escape" && typed) { e.preventDefault(); e.stopPropagation(); setTyped(""); } }} placeholder="Search keys and values" aria-label={`Search ${label}`} aria-controls={`${uid}-tree`} className="h-full min-w-0 flex-1 bg-transparent text-[12.5px] outline-none placeholder:text-muted-foreground [@media(pointer:coarse)]:text-[16px]" /> {/* The count and the arrows open in once there's something to step through. */} {matches.length ? ( <> / ) : ( "0" )} {diff ? ( ) : ( )}

{renderNode(root, null, 0, 1)}


          
            {focusPath}

void copy("path")} onReset={() => setCopied((c) => ({ ...c, path: "idle" }))} resetAfter={1400} /> void copy("value")} onReset={() => setCopied((c) => ({ ...c, value: "idle" }))} resetAfter={1400} />

{announce}

); } 55:T2a51,// Hairline UI · json-inspector · MIT License // Copyright (c) 2026 Hairline UI · https://hairlineui.com/license#components /* ───────────────────────────────────────────────────────── * JSON TREE: the model under the JSON inspector * * build any value into nodes with stable ids (their paths) * diff two values into one tree: each node same, added, * removed or changed, with counts on the way up; * arrays of records can be matched by a key ("id") * paths data.items[2].id, or .data.items[2].id for jq * search keys and values that contain the query * errors where JSON.parse gave up, as a line and column * ───────────────────────────────────────────────────────── */ export type JsonKind = "object" | "array" | "string" | "number" | "boolean" | "null"; export type JsonChange = "same" | "added" | "removed" | "changed"; export type JsonKey = string | number; export interface JsonNode { /** The path as a string, stable across renders. */ id: string; key: JsonKey | null; path: JsonKey[]; depth: number; kind: JsonKind; /** Primitives only. */ value?: string | number | boolean | null; children?: JsonNode[]; /** Keys or items in a container. */ size?: number; /** Diff only. */ change?: JsonChange; /** The old value of a changed primitive (or a summary of an old container). */ before?: string | number | boolean | null; beforeKind?: JsonKind; /** Changes at or below this node. */ counts?: { added: number; removed: number; changed: number }; } const kindOf = (v: unknown): JsonKind => v === null || v === undefined ? "null" : Array.isArray(v) ? "array" : typeof v === "object" ? "object" : typeof v === "number" || typeof v === "bigint" ? "number" : typeof v === "boolean" ? "boolean" : "string"; const prim = (v: unknown): string | number | boolean | null => { if (v === null || v === undefined) return null; if (typeof v === "number" || typeof v === "boolean" || typeof v === "string") return v; if (typeof v === "bigint") return Number(v); return String(v); }; export const idOf = (path: JsonKey[]) => (path.length ? path.map((k) => (typeof k === "number" ? `[${k}]` : `.${k.replace(/[.[\]\\]/g, "\\$&")}`)).join("") : "$"); const entries = (v: unknown): [JsonKey, unknown][] => (Array.isArray(v) ? v.map((x, i) => [i, x] as [JsonKey, unknown]) : Object.entries(v as Record)); /** Any value as a tree. Circular references become the string "[circular]". */ export function buildTree(value: unknown, path: JsonKey[] = [], seen = new WeakSet