30:T18c8,visualizeModules = ({ useSpectral = true } = {}) => { const modules = [...currentModules.values()].filter(m => m && m.name); const n = modules.length; if (n === 0) return htl.svg``; const indexOf = new Map(modules.map((m, i) => [ m.name, i ])); const undirectedEdges = []; const seen = new Set(); for (let i = 0; i < n; i++) { const from = modules[i]; for (const toName of from.dependsOn || []) { const j = indexOf.get(toName); if (j == null || j === i) continue; const a = Math.min(i, j), b = Math.max(i, j); const k = `${ a },${ b }`; if (seen.has(k)) continue; seen.add(k); undirectedEdges.push([ a, b ]); } } const buildCSRLocal = (n, edges) => { const adj = Array.from({ length: n }, () => []); for (const [a0, b0] of edges) { const a = a0 | 0, b = b0 | 0; if (a === b) continue; if (a < 0 || b < 0 || a >= n || b >= n) continue; adj[a].push(b); adj[b].push(a); } const deg = new Float64Array(n); let nnz = 0; for (let i = 0; i < n; i++) { const row = adj[i]; row.sort((x, y) => x - y); let w = 0; for (let j = 0; j < row.length; j++) if (w === 0 || row[j] !== row[w - 1]) row[w++] = row[j]; row.length = w; deg[i] = w; nnz += w; } const rowPtr = new Int32Array(n + 1); const colIdx = new Int32Array(nnz); const val = new Float64Array(nnz); let p = 0; for (let i = 0; i < n; i++) { rowPtr[i] = p; const row = adj[i]; for (let j = 0; j < row.length; j++) { colIdx[p] = row[j]; val[p] = 1; p++; } } rowPtr[n] = p; return { n, rowPtr, colIdx, val, deg }; }; const crossingsCountLocal = (n, edges, order) => { const pos = new Int32Array(n); for (let i = 0; i < n; i++) pos[order[i]] = i; const intervals = []; for (const [a0, b0] of edges) { const a = a0 | 0, b = b0 | 0; if (a === b) continue; const i = pos[a], j = pos[b]; const s = Math.min(i, j), t = Math.max(i, j); if (s === t) continue; intervals.push([ s, t ]); } intervals.sort((p, q) => p[0] - q[0] || p[1] - q[1]); const bit = new Int32Array(n + 1); const add = i => { for (let x = i + 1; x <= n; x += x & -x) bit[x]++; }; const sum = i => { let s = 0; for (let x = i + 1; x > 0; x -= x & -x) s += bit[x]; return s; }; const range = (l, r) => r < l ? 0 : sum(r) - (l > 0 ? sum(l - 1) : 0); let crossings = 0; let k = 0; while (k < intervals.length) { const s = intervals[k][0]; let k2 = k; while (k2 < intervals.length && intervals[k2][0] === s) k2++; for (let t = k; t < k2; t++) crossings += range(s + 1, intervals[t][1] - 1); for (let t = k; t < k2; t++) add(intervals[t][1]); k = k2; } return crossings; }; let orderIdx; if (n <= 2 || undirectedEdges.length === 0 || !useSpectral) { orderIdx = Int32Array.from(d3.range(n)); } else { const csr = buildCSRLocal(n, undirectedEdges); const spectral = spectralCircleOrder(csr, { alpha: 0.92, maxIters: 80, tol: 0.0001, seed: 1, passesOrtho: 1 }); const sifted = improveOrderSifting(n, undirectedEdges, spectral.order, { passes: 1, vertexSequence: 'order' }); const baseline = bestOfRandomOrders(n, undirectedEdges, { R: Math.min(n, 12), seed: 1, postSiftPasses: 0 }); const cSift = crossingsCountLocal(n, undirectedEdges, sifted.order); orderIdx = baseline?.order && baseline.crossings < cSift ? baseline.order : sifted.order; } const R = 100; const nodes = new Map(); for (let p = 0; p < n; p++) { const vid = orderIdx[p] | 0; const a = p * 2 * Math.PI / n; const [x, y] = d3.pointRadial(a, R); const deg = p * 360 / n; nodes.set(modules[vid].name, [ x, y, deg, modules[vid] ]); } const edges = modules.flatMap(from => (from.dependsOn || []).filter(to => nodes.has(to)).map(to => [ [ from.name, nodes.get(from.name) ], [ to, nodes.get(to) ] ])); const plot = Plot.plot({ inset: 180, aspectRatio: 1, axis: null, marks: [ () => htl.svg` `, Plot.arrow(edges, { x1: ([[, [x1]]]) => x1, y1: ([[, [, y1]]]) => y1, x2: ([, [, [x2]]]) => x2, y2: ([, [, [, y2]]]) => y2, bend: true, stroke: 'url(#gradient)', strokeOpacity: 0.5, strokeLinejoin: 'miter', headLength: 3, inset: 5 }), Plot.text([...nodes.entries()].filter(([, c]) => c[2] > 180), { textAnchor: 'end', x: ([, c]) => c[0], y: ([, c]) => c[1], rotate: ([, c]) => -c[2] - (c[2] > 180 ? 90 : -90), text: ([k]) => k }), Plot.text([...nodes.entries()].filter(([, c]) => c[2] <= 180), { fontSize: 12, textAnchor: 'start', x: ([, c]) => c[0], y: ([, c]) => c[1], rotate: ([, c]) => -c[2] - (c[2] > 180 ? 90 : -90), text: ([k]) => k }), Plot.tip(nodes.entries(), Plot.pointer({ x: ([, c]) => c[0], y: ([, c]) => c[1], title: tipTitle, maxRadius: Infinity })) ] }); const xmlns = 'http://www.w3.org/2000/svg'; const xlink = 'http://www.w3.org/1999/xlink'; for (const text of plot.querySelectorAll('text')) { const moduleName = text.textContent; let url; try { url = linkTo(moduleName); } catch { continue; } const a = document.createElementNS(xmlns, 'a'); a.setAttributeNS(null, 'href', url); a.setAttributeNS(xlink, 'href', url); text.parentNode.insertBefore(a, text); if (isOnObservableCom()) { a.setAttribute('target', '_blank'); } a.appendChild(text); } return plot; }31:T70a,module_definition_variables = { console.log("module_definition_variables"); notebookImports; queue; const pageLoaded = () => typeof document === "undefined" || document.readyState === "complete"; let last_module_count = -1; let module_definition_variables = []; let failures = []; let timeout_ms = 1000; let grace = true; while (true) { last_module_count = module_definition_variables.length; failures = []; module_definition_variables = ( await Promise.all( [...queue.runtime._variables] .filter((v) => v._name && v._name.startsWith("module ")) .filter((v) => !v._name.startsWith("module { try { v._value = await Promise.race([ v._definition(), new Promise((_, reject) => setTimeout(() => reject(new Error("timeout")), timeout_ms) ) ]); return [v]; } catch (err) { failures.push([v, err]); return []; } }) ) ).flat(); if (module_definition_variables.length > last_module_count) continue; if (failures.length) { // Mid-load a failure usually means the module's block has not streamed in yet — // retry rather than dropping it from the map. if (!pageLoaded()) { await new Promise((r) => setTimeout(r, 250)); continue; } // One post-load grace round with a longer budget for slow network imports. if (grace) { grace = false; timeout_ms = 5000; continue; } } break; } failures.forEach(([v, err]) => console.error("error loading module", v._name, err) ); return module_definition_variables; }32:T671,pageImportMatch = { return async (notebookImportVariables, modules) => { console.log('pageImportMatch'); const backupHas = Map.prototype.has; // Save the original `has` method on Map.prototype let currentImport = undefined; const matches = new Map(); // Override `Map.prototype.has` to intercept calls to `has` on any Map instance Map.prototype.has = function (...args) { const module = modules.find(m => m._scope == this); if (currentImport && module) { matches.set(module, { name: currentImport.notebookImports[0].name, type: 'notebook import', module: module, dependsOn: [], dependedBy: [], dom: currentImport.notebookImports[0].dom, specifiers: currentImport.notebookImports.map(pi => ({ local: pi.local, imported: pi.imported, variable: pi.variable })) }); } return backupHas.call(this, ...args); // Call the original `has` method }; // Iterate through the notebook imports and define them while capturing `has` calls await notebookImportVariables.reduce((chain, pageImportVariable) => { // Call the definition chain return chain.then(async () => { currentImport = pageImportVariable; try { await pageImportVariable.variable._definition(); } catch (err) { console.warn(err); } currentImport = undefined; }); }, Promise.resolve()); // Restore the original `has` method after the operations are done Map.prototype.has = backupHas; return matches; }; }33:Tbdd,moduleTitle = { return async function moduleTitle(module) { const runtime = module._runtime; const vars = [...runtime._variables].filter(v => v && v._module === module && v._definition); const candidates = vars.filter(v => { const n = v._name; if (v._type != 1) return false; if (n == null) return true; if (typeof n !== 'string') return true; if (n.startsWith('dynamic observe ')) return false; if (n.startsWith('module ')) return false; return true; }); if (candidates.length === 0) return null; const first = candidates.find(v => typeof v._id === 'number' && Number.isFinite(v._id)) ? candidates.reduce((a, b) => (a._id ?? Infinity) <= (b._id ?? Infinity) ? a : b) : candidates[0]; const extract = v => { // instanceof cannot be used hear for cross realm if (v == null) return null; if (typeof v === 'string') return v.trim() || null; if (v.tagName) { if (v.tagName == 'H1') return v.textContent; const h1 = v.querySelector?.('h1'); if (h1) return (h1.textContent ?? '').trim() || null; return null; } if (v.textContent) return (v.textContent ?? '').trim() || null; const maybeNode = v?.nodeType ? v : null; if (maybeNode?.tagName) return extract(maybeNode); return null; }; // Read the title WITHOUT re-executing the cell. invokeVariable calls the cell's _definition // directly, bypassing the runtime — for element cells (`htl.html`…${sharedNode}…``) that builds // a *duplicate*, unmanaged DOM subtree and moves shared singleton nodes (e.g. golden-layout's // base_css