@christianirack/brainllm-runtime 0.8.11 → 0.9.0

package/brain-links.js

@@ -14,8 +14,10 @@ export default function links(lang, b, p, re, s) {
     const t = tables[document.documentElement.getAttribute('lang')]
     if (!t || !h || h[0] !== '/' || h[1] === '/') return h
     const a = t.b && (h + '/').startsWith(t.b + '/') ? h.slice(t.b.length) || '/' : h
-    const m = /^[^?#]*/.exec(a)[0]
-    const n = t.s[m] || (t.re.test(m) && (m === '/' ? t.p : t.p + m))
+    const m = /^[^?#]*/.exec(a)[0], key = m.replace(/\/+$/, '') || '/'
+    if (key === t.p || key.startsWith(t.p + '/')) return h
+    let n = t.s[key] || (t.re.test(key) && (key === '/' ? t.p : t.p + key))
+    if (n && key !== '/' && m.endsWith('/') && !n.endsWith('/')) n += '/'
     return n ? t.b + n + a.slice(m.length) : h
   }
   G.__brainHref = to

package/brain-list.js

@@ -0,0 +1,9 @@
+// Pure bounded integer iteration, outside the runtime core.
+export function range(from, to) {
+  if (!Number.isSafeInteger(from) || !Number.isSafeInteger(to)) throw new RangeError('range requires two safe integer endpoints')
+  const length = Math.max(0, to - from)
+  if (length > 10000) throw new RangeError('range cannot emit more than 10000 integers')
+  const values = new Array(length)
+  for (let i = 0; i < length; i++) values[i] = from + i
+  return values
+}

package/brain-prefetch-shared.js

@@ -29,7 +29,7 @@ export async function prefetchPage(url, signal) {
     let hit
     while ((hit = pattern.exec(text)) && assets.length < 16) {
       const asset = new URL(hit[1] || hit[2] || hit[3], base)
-      if (asset.origin === base.origin && asset.pathname.includes('/_b/')) assets.push(asset.href)
+      if (asset.origin === base.origin && (asset.pathname.includes('/_b/') || /\/[a-z0-9]{8}\.(?:js|mjs|jsbrain|css|cssbrain)$/.test(asset.pathname))) assets.push(asset.href)
     }
     return { ok: true, status: r.status, url: r.url, headers: r.headers, text, bytes, assets }
   } catch { return null }

package/brain-router.js

@@ -96,6 +96,10 @@ export function router(o = {}) {
   const region = o.region || 'main'
   const parse = o.parse || (h => new DOMParser().parseFromString(h, 'text/html'))
   const fullLoad = new Set((o.fullLoad || []).map(p => new URL(p, location.href).pathname.replace(/\/+$/, '') || '/'))
+  // COOP belongs to the document, not the swapped view. Only real head markers opt into provider popups.
+  const popup = d => [...((d.head || d.querySelector('head'))?.querySelectorAll('meta') || [])].some(m =>
+    /^(brain-google-signin|brain-apple-signin)$/i.test(m.getAttribute('name') || '') && m.getAttribute('content') === '1')
+  const popupDocument = popup(document)
   let seq = 0, through = null, stale = false
   const ahead = predict(o, (u, p = true) => same(u, p))
   // Build signature (§35.7): the page's <meta name="brain-build">. A navigation response from another build, or the
@@ -205,6 +209,7 @@ export function router(o = {}) {
       if (!r.ok || !/html/.test(hd('content-type') || 'html')) throw Error(r.status)
       const doc = parse(await r.text())
       if (my !== seq) return // a newer navigation won
+      if (popup(doc) !== popupDocument) return hard(url) // entering or leaving a popup page needs fresh HTTP headers
       // another language (§37): a full load brings its own dictionaries, `lang` and `dir`; locales never mix in memory
       const lang = d => d?.documentElement?.getAttribute('lang')
       if (lang(doc) && lang(document) && lang(doc) !== lang(document)) return hard(url)
@@ -308,7 +313,7 @@ export function router(o = {}) {
     const h = e => {
       if (through && e.destination.url === through) return void (through = null)
       if (e.navigationType === 'reload') return // a reload is always a real full load (e.g. after a deploy deleted a chunk)
-      if (!e.canIntercept || e.hashChange || e.downloadRequest || e.formData || !same(e.destination.url)) return
+      if (!e.canIntercept || e.hashChange || e.downloadRequest || e.formData || externalLink(e.sourceElement) || !same(e.destination.url)) return
       if (e.cancelable && !leave()) return e.preventDefault()
       const to = e.destination.url, from = nav.currentEntry?.url
       if (G.__brainURLOnly?.(from || location.href, to)) return e.intercept({ focusReset: 'manual', handler: () => G.__brainURLRestore?.() })
@@ -362,7 +367,7 @@ export function router(o = {}) {
     if (e.defaultPrevented || e.button || e.metaKey || e.ctrlKey || e.shiftKey || e.altKey) return
     let a = e.target
     while (a && a.tagName !== 'A') a = a.parentNode
-    if (!a || !a.getAttribute('href') || a.getAttribute('target') || a.hasAttribute('download') || !same(a.href || a.getAttribute('href'))) return
+    if (!a || !a.getAttribute('href') || a.getAttribute('target') || a.hasAttribute('download') || externalLink(a) || !same(a.href || a.getAttribute('href'))) return
     const u = new URL(a.href || a.getAttribute('href'), location.href)
     if (u.pathname === location.pathname && u.hash) return // in-page anchor: native
     e.preventDefault()
@@ -416,7 +421,7 @@ export function predict(o = {}, same = () => false) {
     return !NOPE.test(u.pathname) && !FILE.test(u.pathname) && !SECRET.test(u.search)
   }
   const ok = a => {
-    if (!a?.getAttribute?.('href') || a.getAttribute('target') || a.hasAttribute('download')) return null
+    if (!a?.getAttribute?.('href') || a.getAttribute('target') || a.hasAttribute('download') || externalLink(a)) return null
     for (let n = a; n?.getAttribute; n = n.parentNode) if (n.getAttribute('data-prefetch') === 'false') return null
     const k = key(a.href || a.getAttribute('href'))
     return safe(k) ? k : null
@@ -426,7 +431,7 @@ export function predict(o = {}, same = () => false) {
     let n = 0
     for (const href of list) {
       const u = key(href)
-      if (!u || pre.has(u) || pre.size > 47 || !same(u) || !new URL(u).pathname.includes('/_b/') || ++n > 8) continue
+      if (!u || pre.has(u) || pre.size > 47 || !same(u) || !(new URL(u).pathname.includes('/_b/') || /\/[a-z0-9]{8}\.(?:js|mjs|jsbrain|css|cssbrain)$/.test(new URL(u).pathname)) || ++n > 8) continue
       const l = document.createElement('link')
       l.setAttribute('rel', /\.(js|jsbrain)(\?|$)/.test(u) ? 'modulepreload' : 'prefetch')
       l.setAttribute('href', u)
@@ -619,3 +624,5 @@ function hold(el) {
     },
   })
 }
+// An absolute navigation can intentionally belong to another site on the same origin.
+const externalLink = a => (a?.getAttribute?.('rel') || '').split(/\s+/).some(token => token.toLowerCase() === 'external') && /^https?:\/\//i.test((a?.getAttribute?.('href') || '').trim())

package/brain-text.js

@@ -0,0 +1,56 @@
+// Pure bounded Unicode matching; no locale, network, DOM or persistent state.
+const letters = value => {
+  if (typeof value !== 'string' || value.length > 8192) throw new RangeError('text helpers require strings of at most 4096 Unicode characters')
+  const result = Array.from(value)
+  if (result.length > 4096) throw new RangeError('text helpers require strings of at most 4096 Unicode characters')
+  return result
+}
+const fold = value => {
+  letters(value)
+  const result = value.normalize('NFD').replace(/[\u0300-\u036f]/g, '').toLowerCase()
+  letters(result)
+  return result
+}
+// Optimal string alignment: adjacent transpositions count as one edit; the band and row minimum bound work.
+const distance = (left, right, max = 2) => {
+  if (!Number.isInteger(max) || max < 0 || max > 64) throw new RangeError('text.distance max must be an integer from 0 to 64')
+  const a = letters(left), b = letters(right), n = a.length, m = b.length, cap = max + 1
+  if (Math.abs(n - m) > max) return cap
+  if (!n) return Math.min(m, cap)
+  if (!m) return Math.min(n, cap)
+  let before = new Uint16Array(m + 1).fill(cap)
+  let previous = new Uint16Array(m + 1).fill(cap)
+  let current = new Uint16Array(m + 1).fill(cap)
+  for (let j = 0; j <= Math.min(m, max); j++) previous[j] = j
+  for (let i = 1; i <= n; i++) {
+    const low = Math.max(1, i - max), high = Math.min(m, i + max)
+    current[0] = Math.min(i, cap)
+    if (low > 1) current[low - 1] = cap
+    if (high < m) current[high + 1] = cap
+    let minimum = current[0]
+    for (let j = low; j <= high; j++) {
+      let value = Math.min(previous[j] + 1, current[j - 1] + 1, previous[j - 1] + (a[i - 1] === b[j - 1] ? 0 : 1), cap)
+      if (i > 1 && j > 1 && a[i - 1] === b[j - 2] && a[i - 2] === b[j - 1]) value = Math.min(value, before[j - 2] + 1)
+      current[j] = value
+      minimum = Math.min(minimum, value)
+    }
+    if (minimum > max) return cap
+    const spare = before; before = previous; previous = current; current = spare
+  }
+  return Math.min(previous[m], cap)
+}
+const fuzzy = (word, list) => {
+  const needle = fold(word), size = letters(needle).length
+  if (!Array.isArray(list) || list.length > 10000) throw new RangeError('text.fuzzy requires at most 10000 candidate strings')
+  const count = list.length, max = size < 4 ? 0 : size < 8 ? 1 : 2
+  const found = []
+  let units = 0
+  for (let i = 0; i < count; i++) {
+    const candidate = list[i]
+    if (typeof candidate !== 'string' || candidate.length > 1048576 - units) throw new RangeError('text.fuzzy candidate text exceeds 1048576 UTF-16 code units or contains a non-string')
+    units += candidate.length
+    if (distance(needle, fold(candidate), max) <= max) found.push(candidate)
+  }
+  return found
+}
+export const text = Object.freeze({ fold, distance, fuzzy })

package/brain-url.js

@@ -45,10 +45,35 @@ export function urlState(initial, options) {
 }
 
 // A native UI primitive stays stateless in author source; its DOM adapter owns navigation state and cleanup.
-export function urlDialog(element, key) {
-  if (!element || !key || G.__brainSSR || G.__brainRoute || !G.location) return
+export function urlDialog(element, key, options) {
+  if (!element || G.__brainSSR || G.__brainRoute || !G.location) return
   return I.root(dispose => {
     let alive = true
+    if (options?.dismissible === true) {
+      let startedOutside = false
+      const outside = event => {
+        if (event.target !== element || !element.open) return false
+        const bounds = element.getBoundingClientRect()
+        return event.clientX < bounds.left || event.clientX > bounds.right || event.clientY < bounds.top || event.clientY > bounds.bottom
+      }
+      const down = event => { startedOutside = !event.defaultPrevented && event.button === 0 && event.isPrimary !== false && outside(event) }
+      const cancel = () => { startedOutside = false }
+      const click = event => {
+        const dismiss = alive && !event.defaultPrevented && startedOutside && event.button === 0 && outside(event)
+        startedOutside = false
+        if (dismiss) { event.preventDefault(); event.stopPropagation(); element.close() }
+      }
+      element.addEventListener('pointerdown', down)
+      element.addEventListener('pointercancel', cancel)
+      element.addEventListener('click', click)
+      fx(() => () => {
+        alive = false
+        element.removeEventListener('pointerdown', down)
+        element.removeEventListener('pointercancel', cancel)
+        element.removeEventListener('click', click)
+      })
+    }
+    if (!key) return dispose
     const opened = urlState(!!element.open, {key})
     const read = () => { if (alive) opened.v = !!element.open }
     const apply = value => {
@@ -59,7 +84,15 @@ export function urlDialog(element, key) {
     fx(() => {
       const value = opened.v
       if (element.isConnected) apply(value)
-      else queueMicrotask(() => apply(value))
+      else {
+        const wasOpen = !!element.open
+        queueMicrotask(() => {
+          // An exposed open() may run immediately after mount, before this initial deferred sync.
+          // Preserve that newer DOM action instead of applying the old initial state over it.
+          if (alive && !!element.open !== wasOpen) read()
+          else apply(value)
+        })
+      }
     })
     const observer = G.MutationObserver ? new G.MutationObserver(read) : null
     observer?.observe(element, {attributes:true,attributeFilter:['open']})

package/brain.js

@@ -350,20 +350,26 @@ export function _ev(e) {
         // a data property, not a getter: V8 keeps accessors in the event's shared hidden class, so a getter closure
         // would keep the first event (and its component) alive for the life of the page
         Object.defineProperty(e, 'currentTarget', { configurable: true, value: n })
-        try {
-          // n moves on with the loop: keep the element for a later rejection
-          const r = h.call(n, e), el = n
-          if (r && r.then) r.then(null, x => oops(x, el, 'on:' + e.type)) // async handler: a rejected await too
-        } catch (x) {
-          oops(x, n, 'on:' + e.type)
-        }
+        eventCall(n, h, e)
         if (e.cancelBubble) break
       }
     }
   })
 }
+function eventCall(el, h, e) {
+  try {
+    const r = h.call(el, e)
+    if (r && r.then) r.then(null, x => oops(x, el, 'on:' + e.type))
+  } catch (x) { oops(x, el, 'on:' + e.type) }
+}
 export function on(el, t, h) {
-  if (/^(focus|blur|mouseenter|mouseleave|load|error|scroll)$/.test(t)) return el.addEventListener(t, e => batch(() => h(e)))
+  if (/^(focus|blur|mouseenter|mouseleave|pointerenter|pointerleave|load|error|scroll|scrollend|resize|close|cancel|toggle|beforetoggle|invalid|abort|canplay|canplaythrough|durationchange|emptied|ended|loadeddata|loadedmetadata|loadstart|pause|play|playing|progress|ratechange|seeked|seeking|stalled|suspend|timeupdate|volumechange|waiting|encrypted|waitingforkey)$/.test(t)) {
+    const listener = e => batch(() => eventCall(el, h, e))
+    return fx(() => {
+      el.addEventListener(t, listener)
+      return () => el.removeEventListener(t, listener)
+    })
+  }
   el['$' + t] = h
   document.addEventListener(t, _ev) // once per type: the DOM ignores the same listener added again
 }

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@christianirack/brainllm-runtime",
-  "version": "0.8.11",
+  "version": "0.9.0",
   "description": "The BRAINLLM runtime for the Rust-built web compiler for LLMs: dependency-free ES modules (signals, DOM, router, data, forms, channels). The brain binary embeds this same version.",
   "type": "module",
   "exports": {