npm - @uistate/examples - Versions diffs - 1.0.0 - Mend

@uistate/examples 1.0.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (137) hide show

package/eventState/011-async-patterns/index.html ADDED Viewed

@@ -0,0 +1,132 @@
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <meta name="viewport" content="width=device-width, initial-scale=1.0">
+  <title>011 Async Patterns - EventState</title>
+  <script type="importmap">
+    { "imports": { "@uistate/core": "../../index.js" } }
+  </script>
+</head>
+<body>
+  <h1>Async Patterns</h1>
+  <h2>Debounced Search</h2>
+  <input type="text" id="searchInput" placeholder="Type to search...">
+  <p id="searchStatus"></p>
+  <p><strong>Search result:</strong> <span id="searchResult">(type something)</span></p>
+  <hr>
+  <h2>Simulated API Call</h2>
+  <button id="fetchBtn">Fetch Data</button>
+  <p id="loadingStatus"></p>
+  <p><strong>Data:</strong> <span id="apiData">(not loaded)</span></p>
+  <script type="module">
+    import { createEventState } from '@uistate/core';
+    // Create store
+    const store = createEventState({
+      searchQuery: '',
+      searchResult: '',
+      isSearching: false,
+      apiData: null,
+      isLoading: false
+    });
+    // ===== DEBOUNCED SEARCH =====
+    let searchTimeout = null;
+    // Simulate search function
+    const performSearch = (query) => {
+      return new Promise((resolve) => {
+        setTimeout(() => {
+          resolve(`Results for "${query}": Found ${query.length} items`);
+        }, 500);
+      });
+    };
+    // Subscribe to search query changes
+    store.subscribe('searchQuery', async (value) => {
+      // Clear previous timeout
+      clearTimeout(searchTimeout);
+      if (!value) {
+        store.set('searchResult', '');
+        store.set('isSearching', false);
+        return;
+      }
+      // Show searching indicator
+      store.set('isSearching', true);
+      // Debounce: wait 300ms before searching
+      searchTimeout = setTimeout(async () => {
+        const result = await performSearch(value);
+        store.set('searchResult', result);
+        store.set('isSearching', false);
+      }, 300);
+    });
+    // Update UI for search status
+    store.subscribe('isSearching', (value) => {
+      document.getElementById('searchStatus').textContent =
+        value ? 'Searching...' : '';
+    });
+    store.subscribe('searchResult', (value) => {
+      document.getElementById('searchResult').textContent =
+        value || '(type something)';
+    });
+    // Wire up search input
+    document.getElementById('searchInput').oninput = (e) => {
+      store.set('searchQuery', e.target.value);
+    };
+    // ===== SIMULATED API CALL =====
+    // Simulate API fetch
+    const fetchData = () => {
+      return new Promise((resolve) => {
+        setTimeout(() => {
+          resolve({
+            id: Math.floor(Math.random() * 1000),
+            timestamp: new Date().toLocaleTimeString()
+          });
+        }, 1000);
+      });
+    };
+    // Subscribe to loading state
+    store.subscribe('isLoading', (value) => {
+      document.getElementById('loadingStatus').textContent =
+        value ? '⏳ Loading...' : '';
+      document.getElementById('fetchBtn').disabled = value;
+    });
+    // Subscribe to API data
+    store.subscribe('apiData', (value) => {
+      if (value) {
+        document.getElementById('apiData').textContent =
+          `ID: ${value.id}, Time: ${value.timestamp}`;
+      }
+    });
+    // Fetch button
+    document.getElementById('fetchBtn').onclick = async () => {
+      store.set('isLoading', true);
+      try {
+        const data = await fetchData();
+        store.set('apiData', data);
+      } catch (error) {
+        console.error('Fetch failed:', error);
+      } finally {
+        store.set('isLoading', false);
+      }
+    };
+  </script>
+</body>
+</html>

package/eventState/028-counter-improved-eventTest/LICENSE ADDED Viewed

@@ -0,0 +1,55 @@
+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.
+"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

package/eventState/028-counter-improved-eventTest/README.md ADDED Viewed

@@ -0,0 +1,131 @@
+# 028 Counter with eventTest
+A simple counter app demonstrating event-sequence testing and type generation with the EventState primitive.
+## What This Example Shows
+This example demonstrates **TDD with event-sequence testing** for a simple counter app:
+✅ **EventState primitive** - `runtime/core/eventState.js` (~80 lines)
+✅ **Event-sequence testing** - `eventTest.js` for testing state changes
+✅ **Type generation** - Auto-generate `.d.ts` from test assertions
+✅ **Direct state manipulation** - Simple `store.get()` and `store.set()`
+## Structure
+```
+app/
+└── store.js           → Store with counter state
+runtime/core/
+├── eventState.js      → The 80-line reactive primitive
+└── helpers.js         → Utility functions
+tests/
+├── eventTest.js       → Event-sequence testing framework
+├── counter.test.js    → Tests for counter operations
+├── generateTypes.js   → Type generator
+└── run.js             → Test runner
+index.html             → Simple counter UI
+store.d.ts             → Auto-generated types
+```
+## Counter Operations
+The app has three simple operations:
+```javascript
+// Increment
+const current = store.get('count');
+store.set('count', current + 1);
+// Decrement
+const current = store.get('count');
+store.set('count', current - 1);
+// Double
+const current = store.get('count');
+store.set('count', current * 2);
+```
+## Event-Sequence Testing
+Tests verify state changes as event sequences:
+```javascript
+import { createEventTest } from './eventTest.js';
+const tests = {
+  'increment increases count by 1': () => {
+    const t = createEventTest({ count: 0 });
+    // Perform operation
+    const current = t.store.get('count');
+    t.store.set('count', current + 1);
+    // Assert type
+    t.assertType('count', 'number');
+    // Assert value
+    const count = t.store.get('count');
+    if (count !== 1) {
+      throw new Error(`Expected count to be 1, got ${count}`);
+    }
+  }
+};
+```
+## Type Generation
+Run tests to generate TypeScript definitions:
+```bash
+# Run tests
+node tests/counter.test.js
+# Generate types from test assertions
+node tests/generateTypes.js
+```
+This creates `store.d.ts`:
+```typescript
+export interface StoreState {
+  count: number;
+}
+```
+## Run It
+```bash
+# Open in browser
+open index.html
+# Run tests
+node tests/counter.test.js
+# Generate types
+node tests/generateTypes.js
+# Run all tests
+node tests/run.js
+```
+## What Makes This Different
+**Traditional testing:**
+- Mock DOM interactions
+- Test implementation details
+- Separate type definitions
+**Event-sequence testing:**
+- Test state changes directly
+- Verify behavior, not implementation
+- Types generated from tests
+## Learn More
+- See `tests/counter.test.js` for test examples
+- See `tests/eventTest.js` for the testing framework
+- See `runtime/core/eventState.js` for the core primitive

package/eventState/028-counter-improved-eventTest/app/store.js ADDED Viewed

@@ -0,0 +1,9 @@
+// store.js — singleton eventState store for counter app
+import { createEventState } from '../runtime/core/eventStateNew.js';
+const initial = {
+  count: 0
+};
+const store = createEventState(initial);
+export default store;

package/eventState/028-counter-improved-eventTest/index.html ADDED Viewed

@@ -0,0 +1,49 @@
+<!doctype html>
+<html lang="en">
+<head>
+  <meta charset="utf-8" />
+  <meta name="viewport" content="width=device-width, initial-scale=1" />
+  <title>028 Counter with eventTest</title>
+  <link rel="stylesheet" href="style.css">
+</head>
+<body>
+  <main style="max-width: 600px; margin: 2rem auto; padding: 0 1rem; text-align: center;">
+    <h1>Counter: <span id="count">0</span></h1>
+    <div style="display: flex; gap: 1rem; justify-content: center; margin-top: 2rem;">
+      <button id="increment" class="btn">+</button>
+      <button id="decrement" class="btn">-</button>
+      <button id="double" class="btn">x2</button>
+    </div>
+  </main>
+  <script type="module">
+    import store from './app/store.js';
+    // Subscribe to count changes
+    store.subscribe('count', (value) => {
+      document.getElementById('count').textContent = value;
+    });
+    // Set initial value
+    document.getElementById('count').textContent = store.get('count');
+    // Increment
+    document.getElementById('increment').onclick = () => {
+      const current = store.get('count');
+      store.set('count', current + 1);
+    };
+    // Decrement
+    document.getElementById('decrement').onclick = () => {
+      const current = store.get('count');
+      store.set('count', current - 1);
+    };
+    // Double
+    document.getElementById('double').onclick = () => {
+      const current = store.get('count');
+      store.set('count', current * 2);
+    };
+  </script>
+</body>
+</html>

package/eventState/028-counter-improved-eventTest/runtime/core/behaviors.runtime.js ADDED Viewed

@@ -0,0 +1,282 @@
+// behaviors.runtime.js — minimal parser + dispatcher for data-on/data-bind
+// Install with: installBehaviors(store, { registry, root, writablePrefixes })
+export function installBehaviors(store, { registry = {}, root = document, writablePrefixes = ['ui.'], writableWhitelist = [], debug = false, onStep = null } = {}){
+  const subsByPath = new Map();
+  const repeaters = [];
+  const trackOff = (el, off) => { const arr = subsByPath.get(el) || []; arr.push(off); subsByPath.set(el, arr); };
+  const unbindNode = (node) => {
+    // Unsubscribe any subs registered for this node and its descendants
+    const cleanup = (n) => {
+      const offs = subsByPath.get(n);
+      if (offs) { offs.forEach(off => { try { off(); } catch{} }); subsByPath.delete(n); }
+      n.childNodes && n.childNodes.forEach && n.childNodes.forEach(cleanup);
+    };
+    try { cleanup(node); } catch {}
+  };
+  const bindEl = (el) => {
+    // data-bind: "text: ui.counter; value: ui.name"
+    const bindAttr = el.getAttribute?.('data-bind');
+    if (bindAttr){
+      for (const part of bindAttr.split(';')){
+        const seg = part.trim(); if (!seg) continue;
+        const [propRaw, pathRaw] = seg.split(':');
+        const prop = (propRaw||'').trim();
+        const path = (pathRaw||'').trim();
+        const render = () => {
+          const v = store.get(path);
+          if (prop === 'text') el.textContent = v ?? '';
+          else if (prop === 'value') el.value = v ?? '';
+          else el.setAttribute(prop, v ?? '');
+        };
+        render();
+        const off = store.subscribe(path, render);
+        trackOff(el, off);
+      }
+    }
+    // data-on: "click: inc(ui.counter,1) | set(ui.last,'clicked'); input: setFrom(ui.name,target.value)"
+    const onAttr = el.getAttribute?.('data-on');
+    if (onAttr){
+      for (const rule of onAttr.split(';')){
+        const seg = rule.trim(); if (!seg) continue;
+        // Split only at the first ':' to avoid breaking on URLs like https://
+        const colonAt = seg.indexOf(':');
+        if (colonAt === -1) continue;
+        const evt = seg.slice(0, colonAt).trim();
+        const pipeRaw = seg.slice(colonAt + 1);
+        const steps = String(pipeRaw||'').split('|').map(s=>s.trim()).filter(Boolean);
+        el.addEventListener(evt, (event) => {
+          for (const step of steps){
+            const m = step.match(/^(\w+)\((.*)\)$/);
+            const name = m ? m[1] : step;
+            const argsStr = m ? m[2] : '';
+            const args = parseArgs(argsStr);
+            const fn = registry[name]; if (!fn) { if (console && console.warn) console.warn('[behaviors] missing action', name); continue; }
+            const ctx = {
+              store,
+              el,
+              event,
+              get: (p) => store.get(p),
+              set: (p, v) => {
+                // writable guards: prefixes AND optional whitelist patterns
+                const path = String(p);
+                const okPrefix = writablePrefixes.some(pref => path === pref.slice(0, -1) || path.startsWith(pref));
+                const okWhitelist = !writableWhitelist.length || writableWhitelist.some(pat => matchPattern(pat, path));
+                if (!(okPrefix && okWhitelist)) {
+                  if (debug) console.warn('[behaviors] blocked write', { path, reason: 'guard' });
+                  try { onStep && onStep({ el, event, name, args, phase: 'blocked', blocked: true, write: path, reason: 'guard' }); } catch{}
+                  return;
+                }
+                store.set(p, v);
+                // annotate successful write
+                try { onStep && onStep({ el, event, name, args, phase: 'applied', blocked: false, write: path }); } catch{}
+              },
+            };
+            try {
+              try { onStep && onStep({ el, event, name, args, phase: 'started', blocked: false }); } catch{}
+              fn(ctx, ...args);
+            } catch (e) { console.warn('[behaviors] action error', name, e); }
+          }
+        });
+      }
+    }
+    // data-repeat: very small, read-only repeater with simple scope for item.*
+    // Example:
+    // <li data-repeat="item in ui.items" data-key="item.id"><span class="txt" data-bind="text: item.name"></span></li>
+    // <li data-repeat-empty>Empty</li>
+    const repExpr = el.getAttribute?.('data-repeat');
+    if (repExpr) {
+      const parsed = parseRepeat(repExpr);
+      if (!parsed) return;
+      const { itemName, idxName, listPath, keyExpr } = parsed;
+      // Detach template and install renderer anchored by a comment
+      const parent = el.parentNode;
+      if (!parent) return;
+      const anchor = document.createComment('repeat-anchor');
+      parent.insertBefore(anchor, el);
+      parent.removeChild(el);
+      const emptyEl = parent.querySelector?.('[data-repeat-empty]') || null;
+      // State for keyed reconciliation
+      const nodesByKey = new Map();
+      const renderList = () => {
+        const list = store.get(listPath) || [];
+        // Toggle empty placeholder
+        if (emptyEl) {
+          try {
+            const isEmpty = !Array.isArray(list) || list.length === 0;
+            if (isEmpty) { emptyEl.removeAttribute('hidden'); emptyEl.style && (emptyEl.style.display = ''); }
+            else { emptyEl.setAttribute('hidden', ''); emptyEl.style && (emptyEl.style.display = 'none'); }
+          } catch {}
+        }
+        if (!Array.isArray(list)) return;
+        // Build a fragment in order with keyed clones
+        const frag = document.createDocumentFragment();
+        const nextNodesByKey = new Map();
+        for (let idx = 0; idx < list.length; idx++) {
+          const item = list[idx];
+          const key = resolveKey(item, idx, keyExpr);
+          let node = nodesByKey.get(key);
+          if (!node) {
+            node = el.cloneNode(true);
+            // Simple scoped binding for common cases used in tests:
+            // - text: item.name
+            // - attributes with {{item.id}}
+            // Apply text bindings manually
+            node.querySelectorAll?.('[data-bind]').forEach((n) => {
+              const bindAttr = n.getAttribute('data-bind') || '';
+              bindAttr.split(';').map(s => s.trim()).filter(Boolean).forEach((seg) => {
+                const [propRaw, pathRaw] = seg.split(':');
+                const prop = (propRaw||'').trim();
+                const pth = (pathRaw||'').trim();
+                let val;
+                if (pth === idxName && idxName) {
+                  val = idx;
+                } else if (pth.startsWith(itemName + '.')) {
+                  val = getByPath(item, pth.slice(itemName.length + 1));
+                }
+                if (pth === itemName) val = item; // not deeply rendered, but allow truthy check
+                if (val !== undefined) {
+                  if (prop === 'text') n.textContent = val ?? '';
+                  else if (prop === 'value') n.value = val ?? '';
+                  else n.setAttribute(prop, val ?? '');
+                }
+              });
+              // Prevent behaviors runtime from also binding this node to store paths like "item.*"
+              n.removeAttribute('data-bind');
+            });
+            // Interpolate {{item.*}} in attributes used by tests (e.g., data-id)
+            node.querySelectorAll('*').forEach((n) => {
+              for (const attr of Array.from(n.attributes || [])){
+                const m = /\{\{\s*(?:item\.(.+?)|(idx))\s*\}\}/g;
+                if (m.test(attr.value)){
+                  const replaced = attr.value.replace(/\{\{\s*(?:item\.(.+?)|(idx))\s*\}\}/g, (_, pItem, pIdx) => {
+                    if (pIdx && idxName) return String(idx);
+                    const v = getByPath(item, pItem);
+                    return v == null ? '' : String(v);
+                  });
+                  n.setAttribute(attr.name, replaced);
+                }
+              }
+            });
+          }
+          nextNodesByKey.set(key, node);
+          frag.appendChild(node);
+        }
+        // Replace current range (between anchor and next non-render node) with frag
+        // Simple strategy: remove all nodes after anchor until a repeat-empty (which we keep)
+        let cursor = anchor.nextSibling;
+        while (cursor && cursor !== emptyEl) {
+          const next = cursor.nextSibling;
+          parent.removeChild(cursor);
+          cursor = next;
+        }
+        parent.insertBefore(frag, emptyEl || null);
+        nodesByKey.clear();
+        nextNodesByKey.forEach((v,k)=>nodesByKey.set(k,v));
+      };
+      renderList();
+      const off = store.subscribe(listPath, renderList);
+      repeaters.push({ off });
+      trackOff(el, off);
+    }
+  };
+  // initial scan
+  const all = root.querySelectorAll?.('[data-bind], [data-on], [data-repeat]') || [];
+  all.forEach(bindEl);
+  // observe new nodes
+  const mo = new MutationObserver((mutList) => {
+    for (const m of mutList){
+      m.addedNodes && m.addedNodes.forEach(node => {
+        if (node.nodeType !== 1) return;
+        if (node.matches?.('[data-bind], [data-on], [data-repeat]')) bindEl(node);
+        node.querySelectorAll?.('[data-bind], [data-on], [data-repeat]').forEach(bindEl);
+      });
+      // cleanup removed
+      m.removedNodes && m.removedNodes.forEach(node => {
+        if (node.nodeType !== 1) return;
+        unbindNode(node);
+      });
+    }
+  });
+  if (root && root instanceof Document) mo.observe(document.body, { childList: true, subtree: true });
+  return () => {
+    mo.disconnect();
+    subsByPath.forEach(offs => offs.forEach(off => { try { off(); } catch{} }));
+    subsByPath.clear();
+  };
+}
+function parseArgs(s){
+  if (!s.trim()) return [];
+  // split by commas not inside quotes
+  const parts = s.split(',').map(p=>p.trim());
+  return parts.map(coerceArg);
+}
+function coerceArg(x){
+  if (x === '') return '';
+  if ((x.startsWith('"') && x.endsWith('"')) || (x.startsWith("'") && x.endsWith("'"))) return x.slice(1,-1);
+  if (x === 'true') return true;
+  if (x === 'false') return false;
+  if (x === 'null') return null;
+  if (!Number.isNaN(Number(x))) return Number(x);
+  return x; // pass path strings etc.
+}
+function matchPattern(pattern, path){
+  // Very small wildcard: '*' matches a single segment, '**' matches the rest
+  if (pattern === path) return true;
+  const pSegs = String(pattern).split('.');
+  const sSegs = String(path).split('.');
+  let i = 0, j = 0;
+  while (i < pSegs.length && j < sSegs.length){
+    const part = pSegs[i];
+    if (part === '**'){ return true; }
+    if (part === '*' || part === sSegs[j]){ i++; j++; continue; }
+    return false;
+  }
+  // Allow trailing '**'
+  while (i < pSegs.length && pSegs[i] === '**') i++;
+  return i === pSegs.length && j === sSegs.length;
+}
+// Dev-only explicit export to support unit tests in 010-005
+export { matchPattern };
+function parseRepeat(expr){
+  // "item in ui.items" or "(item, idx) in ui.items"
+  const m = String(expr).match(/^\s*\(?\s*([a-zA-Z_$][\w$]*)\s*(?:,\s*([a-zA-Z_$][\w$]*))?\s*\)?\s+in\s+([\w$.]+)\s*$/);
+  if (!m) return null;
+  const itemName = m[1];
+  const idxName = m[2] || null;
+  const listPath = m[3];
+  // Optional data-key attribute is read from element attribute when rendering
+  return { itemName, idxName, listPath, keyExpr: `${itemName}.id` };
+}
+function resolveKey(item, idx, keyExpr){
+  // For now only support item.id; fallback to index
+  const v = (item && (item.id != null)) ? item.id : idx;
+  return String(v);
+}
+function getByPath(obj, path){
+  const segs = String(path).split('.');
+  let cur = obj;
+  for (const s of segs){ if (cur == null) return undefined; cur = cur[s]; }
+  return cur;
+}