@nativefragments/signals 0.1.0

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2026 Native Fragments contributors
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/README.md

@@ -0,0 +1,67 @@
+# Native Fragments Signals
+
+Optional signal-based reactive state helpers for Native Fragments apps.
+
+Core stays dependency-free. Add this package when a component or island needs
+client-side state that updates DOM bindings without a build step.
+
+```sh
+npm i @nativefragments/signals
+```
+
+For no-build browser usage, copy the public helpers into your app:
+
+```sh
+cp node_modules/@nativefragments/signals/public/nativefragments/*.js public/nativefragments/
+```
+
+Then import the browser module:
+
+```js
+import {
+  bindText,
+  computed,
+  effect,
+  state
+} from "/nativefragments/signals.js";
+
+const count = state(0);
+const doubled = computed(() => count.get() * 2);
+
+bindText(document.querySelector("[data-count]"), () => doubled.get());
+document.querySelector("button").addEventListener("click", () => {
+  count.set(count.get() + 1);
+});
+
+effect(() => {
+  console.log("count changed", count.get());
+});
+```
+
+Bundled or server-side code can import from the package:
+
+```js
+import { state, computed } from "@nativefragments/signals";
+```
+
+## API
+
+- `state(initial, options)`: create a writable `Signal.State`.
+- `computed(callback, options)`: create a `Signal.Computed`.
+- `effect(callback)`: run a microtask-batched reactive side effect.
+- `read(value)`: read a raw value, signal, or function.
+- `bindText(node, value)`: bind text content.
+- `bindHTML(element, value)`: bind trusted HTML.
+- `bindAttr(element, name, value)`: bind an attribute.
+- `bindProperty(element, property, value)`: bind an object property.
+- `bindClass(element, name, value)`: toggle a class.
+- `bindStyle(element, name, value)`: bind a style property.
+- `model(element, signal, eventName)`: two-way bind a form value.
+
+## Agent Skill
+
+Agents can read the shipped conventions from:
+
+```sh
+node_modules/@nativefragments/signals/skills/nativefragments-signals/SKILL.md
+```

package/THIRD_PARTY_NOTICES.md

@@ -0,0 +1,13 @@
+# Third Party Notices
+
+This package includes a browser-copyable build of `signal-polyfill` for
+zero-build apps.
+
+## signal-polyfill
+
+- Package: `signal-polyfill`
+- Version: `0.2.2`
+- License: Apache-2.0
+- Repository: https://github.com/proposal-signals/signal-polyfill
+
+The full license text is available in the `signal-polyfill` npm package.

package/package.json

@@ -0,0 +1,49 @@
+{
+  "name": "@nativefragments/signals",
+  "version": "0.1.0",
+  "description": "Signal-based reactive state helpers for Native Fragments apps.",
+  "type": "module",
+  "main": "./src/index.js",
+  "exports": {
+    ".": "./src/index.js",
+    "./client/signals.js": "./public/nativefragments/signals.js",
+    "./client/signal-polyfill.js": "./public/nativefragments/signal-polyfill.js",
+    "./skills/nativefragments-signals": "./skills/nativefragments-signals/SKILL.md"
+  },
+  "files": [
+    "src",
+    "public/nativefragments",
+    "skills",
+    "scripts",
+    "third-party",
+    "README.md",
+    "LICENSE",
+    "THIRD_PARTY_NOTICES.md"
+  ],
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/somedudeokay/nativefragments-signals.git"
+  },
+  "bugs": {
+    "url": "https://github.com/somedudeokay/nativefragments-signals/issues"
+  },
+  "homepage": "https://nativefragments.org/docs/signals",
+  "publishConfig": {
+    "access": "public"
+  },
+  "scripts": {
+    "check": "find src public/nativefragments scripts -name '*.js' -print0 | xargs -0 -n1 node --check",
+    "smoke": "node scripts/smoke.mjs"
+  },
+  "keywords": [
+    "signals",
+    "nativefragments",
+    "web-components",
+    "zero-build",
+    "ai-friendly-apps"
+  ],
+  "dependencies": {
+    "signal-polyfill": "^0.2.2"
+  },
+  "license": "MIT"
+}

package/public/nativefragments/signal-polyfill.js

@@ -0,0 +1,583 @@
+var __defProp = Object.defineProperty;
+var __defNormalProp = (obj, key, value) => key in obj ? __defProp(obj, key, { enumerable: true, configurable: true, writable: true, value }) : obj[key] = value;
+var __publicField = (obj, key, value) => {
+  __defNormalProp(obj, typeof key !== "symbol" ? key + "" : key, value);
+  return value;
+};
+var __accessCheck = (obj, member, msg) => {
+  if (!member.has(obj))
+    throw TypeError("Cannot " + msg);
+};
+var __privateIn = (member, obj) => {
+  if (Object(obj) !== obj)
+    throw TypeError('Cannot use the "in" operator on this value');
+  return member.has(obj);
+};
+var __privateAdd = (obj, member, value) => {
+  if (member.has(obj))
+    throw TypeError("Cannot add the same private member more than once");
+  member instanceof WeakSet ? member.add(obj) : member.set(obj, value);
+};
+var __privateMethod = (obj, member, method) => {
+  __accessCheck(obj, member, "access private method");
+  return method;
+};
+/**
+ * @license
+ * Copyright Google LLC All Rights Reserved.
+ *
+ * Use of this source code is governed by an MIT-style license that can be
+ * found in the LICENSE file at https://angular.io/license
+ */
+function defaultEquals(a, b) {
+  return Object.is(a, b);
+}
+/**
+ * @license
+ * Copyright Google LLC All Rights Reserved.
+ *
+ * Use of this source code is governed by an MIT-style license that can be
+ * found in the LICENSE file at https://angular.io/license
+ */
+let activeConsumer = null;
+let inNotificationPhase = false;
+let epoch = 1;
+const SIGNAL = /* @__PURE__ */ Symbol("SIGNAL");
+function setActiveConsumer(consumer) {
+  const prev = activeConsumer;
+  activeConsumer = consumer;
+  return prev;
+}
+function getActiveConsumer() {
+  return activeConsumer;
+}
+function isInNotificationPhase() {
+  return inNotificationPhase;
+}
+const REACTIVE_NODE = {
+  version: 0,
+  lastCleanEpoch: 0,
+  dirty: false,
+  producerNode: void 0,
+  producerLastReadVersion: void 0,
+  producerIndexOfThis: void 0,
+  nextProducerIndex: 0,
+  liveConsumerNode: void 0,
+  liveConsumerIndexOfThis: void 0,
+  consumerAllowSignalWrites: false,
+  consumerIsAlwaysLive: false,
+  producerMustRecompute: () => false,
+  producerRecomputeValue: () => {
+  },
+  consumerMarkedDirty: () => {
+  },
+  consumerOnSignalRead: () => {
+  }
+};
+function producerAccessed(node) {
+  if (inNotificationPhase) {
+    throw new Error(
+      typeof ngDevMode !== "undefined" && ngDevMode ? `Assertion error: signal read during notification phase` : ""
+    );
+  }
+  if (activeConsumer === null) {
+    return;
+  }
+  activeConsumer.consumerOnSignalRead(node);
+  const idx = activeConsumer.nextProducerIndex++;
+  assertConsumerNode(activeConsumer);
+  if (idx < activeConsumer.producerNode.length && activeConsumer.producerNode[idx] !== node) {
+    if (consumerIsLive(activeConsumer)) {
+      const staleProducer = activeConsumer.producerNode[idx];
+      producerRemoveLiveConsumerAtIndex(staleProducer, activeConsumer.producerIndexOfThis[idx]);
+    }
+  }
+  if (activeConsumer.producerNode[idx] !== node) {
+    activeConsumer.producerNode[idx] = node;
+    activeConsumer.producerIndexOfThis[idx] = consumerIsLive(activeConsumer) ? producerAddLiveConsumer(node, activeConsumer, idx) : 0;
+  }
+  activeConsumer.producerLastReadVersion[idx] = node.version;
+}
+function producerIncrementEpoch() {
+  epoch++;
+}
+function producerUpdateValueVersion(node) {
+  if (!node.dirty && node.lastCleanEpoch === epoch) {
+    return;
+  }
+  if (!node.producerMustRecompute(node) && !consumerPollProducersForChange(node)) {
+    node.dirty = false;
+    node.lastCleanEpoch = epoch;
+    return;
+  }
+  node.producerRecomputeValue(node);
+  node.dirty = false;
+  node.lastCleanEpoch = epoch;
+}
+function producerNotifyConsumers(node) {
+  if (node.liveConsumerNode === void 0) {
+    return;
+  }
+  const prev = inNotificationPhase;
+  inNotificationPhase = true;
+  try {
+    for (const consumer of node.liveConsumerNode) {
+      if (!consumer.dirty) {
+        consumerMarkDirty(consumer);
+      }
+    }
+  } finally {
+    inNotificationPhase = prev;
+  }
+}
+function producerUpdatesAllowed() {
+  return (activeConsumer == null ? void 0 : activeConsumer.consumerAllowSignalWrites) !== false;
+}
+function consumerMarkDirty(node) {
+  var _a;
+  node.dirty = true;
+  producerNotifyConsumers(node);
+  (_a = node.consumerMarkedDirty) == null ? void 0 : _a.call(node.wrapper ?? node);
+}
+function consumerBeforeComputation(node) {
+  node && (node.nextProducerIndex = 0);
+  return setActiveConsumer(node);
+}
+function consumerAfterComputation(node, prevConsumer) {
+  setActiveConsumer(prevConsumer);
+  if (!node || node.producerNode === void 0 || node.producerIndexOfThis === void 0 || node.producerLastReadVersion === void 0) {
+    return;
+  }
+  if (consumerIsLive(node)) {
+    for (let i = node.nextProducerIndex; i < node.producerNode.length; i++) {
+      producerRemoveLiveConsumerAtIndex(node.producerNode[i], node.producerIndexOfThis[i]);
+    }
+  }
+  while (node.producerNode.length > node.nextProducerIndex) {
+    node.producerNode.pop();
+    node.producerLastReadVersion.pop();
+    node.producerIndexOfThis.pop();
+  }
+}
+function consumerPollProducersForChange(node) {
+  assertConsumerNode(node);
+  for (let i = 0; i < node.producerNode.length; i++) {
+    const producer = node.producerNode[i];
+    const seenVersion = node.producerLastReadVersion[i];
+    if (seenVersion !== producer.version) {
+      return true;
+    }
+    producerUpdateValueVersion(producer);
+    if (seenVersion !== producer.version) {
+      return true;
+    }
+  }
+  return false;
+}
+function producerAddLiveConsumer(node, consumer, indexOfThis) {
+  var _a;
+  assertProducerNode(node);
+  assertConsumerNode(node);
+  if (node.liveConsumerNode.length === 0) {
+    (_a = node.watched) == null ? void 0 : _a.call(node.wrapper);
+    for (let i = 0; i < node.producerNode.length; i++) {
+      node.producerIndexOfThis[i] = producerAddLiveConsumer(node.producerNode[i], node, i);
+    }
+  }
+  node.liveConsumerIndexOfThis.push(indexOfThis);
+  return node.liveConsumerNode.push(consumer) - 1;
+}
+function producerRemoveLiveConsumerAtIndex(node, idx) {
+  var _a;
+  assertProducerNode(node);
+  assertConsumerNode(node);
+  if (typeof ngDevMode !== "undefined" && ngDevMode && idx >= node.liveConsumerNode.length) {
+    throw new Error(
+      `Assertion error: active consumer index ${idx} is out of bounds of ${node.liveConsumerNode.length} consumers)`
+    );
+  }
+  if (node.liveConsumerNode.length === 1) {
+    (_a = node.unwatched) == null ? void 0 : _a.call(node.wrapper);
+    for (let i = 0; i < node.producerNode.length; i++) {
+      producerRemoveLiveConsumerAtIndex(node.producerNode[i], node.producerIndexOfThis[i]);
+    }
+  }
+  const lastIdx = node.liveConsumerNode.length - 1;
+  node.liveConsumerNode[idx] = node.liveConsumerNode[lastIdx];
+  node.liveConsumerIndexOfThis[idx] = node.liveConsumerIndexOfThis[lastIdx];
+  node.liveConsumerNode.length--;
+  node.liveConsumerIndexOfThis.length--;
+  if (idx < node.liveConsumerNode.length) {
+    const idxProducer = node.liveConsumerIndexOfThis[idx];
+    const consumer = node.liveConsumerNode[idx];
+    assertConsumerNode(consumer);
+    consumer.producerIndexOfThis[idxProducer] = idx;
+  }
+}
+function consumerIsLive(node) {
+  var _a;
+  return node.consumerIsAlwaysLive || (((_a = node == null ? void 0 : node.liveConsumerNode) == null ? void 0 : _a.length) ?? 0) > 0;
+}
+function assertConsumerNode(node) {
+  node.producerNode ?? (node.producerNode = []);
+  node.producerIndexOfThis ?? (node.producerIndexOfThis = []);
+  node.producerLastReadVersion ?? (node.producerLastReadVersion = []);
+}
+function assertProducerNode(node) {
+  node.liveConsumerNode ?? (node.liveConsumerNode = []);
+  node.liveConsumerIndexOfThis ?? (node.liveConsumerIndexOfThis = []);
+}
+/**
+ * @license
+ * Copyright Google LLC All Rights Reserved.
+ *
+ * Use of this source code is governed by an MIT-style license that can be
+ * found in the LICENSE file at https://angular.io/license
+ */
+function computedGet(node) {
+  producerUpdateValueVersion(node);
+  producerAccessed(node);
+  if (node.value === ERRORED) {
+    throw node.error;
+  }
+  return node.value;
+}
+function createComputed(computation) {
+  const node = Object.create(COMPUTED_NODE);
+  node.computation = computation;
+  const computed = () => computedGet(node);
+  computed[SIGNAL] = node;
+  return computed;
+}
+const UNSET = /* @__PURE__ */ Symbol("UNSET");
+const COMPUTING = /* @__PURE__ */ Symbol("COMPUTING");
+const ERRORED = /* @__PURE__ */ Symbol("ERRORED");
+const COMPUTED_NODE = /* @__PURE__ */ (() => {
+  return {
+    ...REACTIVE_NODE,
+    value: UNSET,
+    dirty: true,
+    error: null,
+    equal: defaultEquals,
+    producerMustRecompute(node) {
+      return node.value === UNSET || node.value === COMPUTING;
+    },
+    producerRecomputeValue(node) {
+      if (node.value === COMPUTING) {
+        throw new Error("Detected cycle in computations.");
+      }
+      const oldValue = node.value;
+      node.value = COMPUTING;
+      const prevConsumer = consumerBeforeComputation(node);
+      let newValue;
+      let wasEqual = false;
+      try {
+        newValue = node.computation.call(node.wrapper);
+        const oldOk = oldValue !== UNSET && oldValue !== ERRORED;
+        wasEqual = oldOk && node.equal.call(node.wrapper, oldValue, newValue);
+      } catch (err) {
+        newValue = ERRORED;
+        node.error = err;
+      } finally {
+        consumerAfterComputation(node, prevConsumer);
+      }
+      if (wasEqual) {
+        node.value = oldValue;
+        return;
+      }
+      node.value = newValue;
+      node.version++;
+    }
+  };
+})();
+/**
+ * @license
+ * Copyright Google LLC All Rights Reserved.
+ *
+ * Use of this source code is governed by an MIT-style license that can be
+ * found in the LICENSE file at https://angular.io/license
+ */
+function defaultThrowError() {
+  throw new Error();
+}
+let throwInvalidWriteToSignalErrorFn = defaultThrowError;
+function throwInvalidWriteToSignalError() {
+  throwInvalidWriteToSignalErrorFn();
+}
+/**
+ * @license
+ * Copyright Google LLC All Rights Reserved.
+ *
+ * Use of this source code is governed by an MIT-style license that can be
+ * found in the LICENSE file at https://angular.io/license
+ */
+function createSignal(initialValue) {
+  const node = Object.create(SIGNAL_NODE);
+  node.value = initialValue;
+  const getter = () => {
+    producerAccessed(node);
+    return node.value;
+  };
+  getter[SIGNAL] = node;
+  return getter;
+}
+function signalGetFn() {
+  producerAccessed(this);
+  return this.value;
+}
+function signalSetFn(node, newValue) {
+  if (!producerUpdatesAllowed()) {
+    throwInvalidWriteToSignalError();
+  }
+  if (!node.equal.call(node.wrapper, node.value, newValue)) {
+    node.value = newValue;
+    signalValueChanged(node);
+  }
+}
+const SIGNAL_NODE = /* @__PURE__ */ (() => {
+  return {
+    ...REACTIVE_NODE,
+    equal: defaultEquals,
+    value: void 0
+  };
+})();
+function signalValueChanged(node) {
+  node.version++;
+  producerIncrementEpoch();
+  producerNotifyConsumers(node);
+}
+/**
+ * @license
+ * Copyright 2024 Bloomberg Finance L.P.
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+const NODE = Symbol("node");
+var Signal;
+((Signal2) => {
+  var _a, _brand, brand_fn, _b, _brand2, brand_fn2;
+  class State {
+    constructor(initialValue, options = {}) {
+      __privateAdd(this, _brand);
+      __publicField(this, _a);
+      const ref = createSignal(initialValue);
+      const node = ref[SIGNAL];
+      this[NODE] = node;
+      node.wrapper = this;
+      if (options) {
+        const equals = options.equals;
+        if (equals) {
+          node.equal = equals;
+        }
+        node.watched = options[Signal2.subtle.watched];
+        node.unwatched = options[Signal2.subtle.unwatched];
+      }
+    }
+    get() {
+      if (!(0, Signal2.isState)(this))
+        throw new TypeError("Wrong receiver type for Signal.State.prototype.get");
+      return signalGetFn.call(this[NODE]);
+    }
+    set(newValue) {
+      if (!(0, Signal2.isState)(this))
+        throw new TypeError("Wrong receiver type for Signal.State.prototype.set");
+      if (isInNotificationPhase()) {
+        throw new Error("Writes to signals not permitted during Watcher callback");
+      }
+      const ref = this[NODE];
+      signalSetFn(ref, newValue);
+    }
+  }
+  _a = NODE;
+  _brand = new WeakSet();
+  brand_fn = function() {
+  };
+  Signal2.isState = (s) => typeof s === "object" && __privateIn(_brand, s);
+  Signal2.State = State;
+  class Computed {
+    // Create a Signal which evaluates to the value returned by the callback.
+    // Callback is called with this signal as the parameter.
+    constructor(computation, options) {
+      __privateAdd(this, _brand2);
+      __publicField(this, _b);
+      const ref = createComputed(computation);
+      const node = ref[SIGNAL];
+      node.consumerAllowSignalWrites = true;
+      this[NODE] = node;
+      node.wrapper = this;
+      if (options) {
+        const equals = options.equals;
+        if (equals) {
+          node.equal = equals;
+        }
+        node.watched = options[Signal2.subtle.watched];
+        node.unwatched = options[Signal2.subtle.unwatched];
+      }
+    }
+    get() {
+      if (!(0, Signal2.isComputed)(this))
+        throw new TypeError("Wrong receiver type for Signal.Computed.prototype.get");
+      return computedGet(this[NODE]);
+    }
+  }
+  _b = NODE;
+  _brand2 = new WeakSet();
+  brand_fn2 = function() {
+  };
+  Signal2.isComputed = (c) => typeof c === "object" && __privateIn(_brand2, c);
+  Signal2.Computed = Computed;
+  ((subtle2) => {
+    var _a2, _brand3, brand_fn3, _assertSignals, assertSignals_fn;
+    function untrack(cb) {
+      let output;
+      let prevActiveConsumer = null;
+      try {
+        prevActiveConsumer = setActiveConsumer(null);
+        output = cb();
+      } finally {
+        setActiveConsumer(prevActiveConsumer);
+      }
+      return output;
+    }
+    subtle2.untrack = untrack;
+    function introspectSources(sink) {
+      var _a3;
+      if (!(0, Signal2.isComputed)(sink) && !(0, Signal2.isWatcher)(sink)) {
+        throw new TypeError("Called introspectSources without a Computed or Watcher argument");
+      }
+      return ((_a3 = sink[NODE].producerNode) == null ? void 0 : _a3.map((n) => n.wrapper)) ?? [];
+    }
+    subtle2.introspectSources = introspectSources;
+    function introspectSinks(signal) {
+      var _a3;
+      if (!(0, Signal2.isComputed)(signal) && !(0, Signal2.isState)(signal)) {
+        throw new TypeError("Called introspectSinks without a Signal argument");
+      }
+      return ((_a3 = signal[NODE].liveConsumerNode) == null ? void 0 : _a3.map((n) => n.wrapper)) ?? [];
+    }
+    subtle2.introspectSinks = introspectSinks;
+    function hasSinks(signal) {
+      if (!(0, Signal2.isComputed)(signal) && !(0, Signal2.isState)(signal)) {
+        throw new TypeError("Called hasSinks without a Signal argument");
+      }
+      const liveConsumerNode = signal[NODE].liveConsumerNode;
+      if (!liveConsumerNode)
+        return false;
+      return liveConsumerNode.length > 0;
+    }
+    subtle2.hasSinks = hasSinks;
+    function hasSources(signal) {
+      if (!(0, Signal2.isComputed)(signal) && !(0, Signal2.isWatcher)(signal)) {
+        throw new TypeError("Called hasSources without a Computed or Watcher argument");
+      }
+      const producerNode = signal[NODE].producerNode;
+      if (!producerNode)
+        return false;
+      return producerNode.length > 0;
+    }
+    subtle2.hasSources = hasSources;
+    class Watcher {
+      // When a (recursive) source of Watcher is written to, call this callback,
+      // if it hasn't already been called since the last `watch` call.
+      // No signals may be read or written during the notify.
+      constructor(notify) {
+        __privateAdd(this, _brand3);
+        __privateAdd(this, _assertSignals);
+        __publicField(this, _a2);
+        let node = Object.create(REACTIVE_NODE);
+        node.wrapper = this;
+        node.consumerMarkedDirty = notify;
+        node.consumerIsAlwaysLive = true;
+        node.consumerAllowSignalWrites = false;
+        node.producerNode = [];
+        this[NODE] = node;
+      }
+      // Add these signals to the Watcher's set, and set the watcher to run its
+      // notify callback next time any signal in the set (or one of its dependencies) changes.
+      // Can be called with no arguments just to reset the "notified" state, so that
+      // the notify callback will be invoked again.
+      watch(...signals) {
+        if (!(0, Signal2.isWatcher)(this)) {
+          throw new TypeError("Called unwatch without Watcher receiver");
+        }
+        __privateMethod(this, _assertSignals, assertSignals_fn).call(this, signals);
+        const node = this[NODE];
+        node.dirty = false;
+        const prev = setActiveConsumer(node);
+        for (const signal of signals) {
+          producerAccessed(signal[NODE]);
+        }
+        setActiveConsumer(prev);
+      }
+      // Remove these signals from the watched set (e.g., for an effect which is disposed)
+      unwatch(...signals) {
+        if (!(0, Signal2.isWatcher)(this)) {
+          throw new TypeError("Called unwatch without Watcher receiver");
+        }
+        __privateMethod(this, _assertSignals, assertSignals_fn).call(this, signals);
+        const node = this[NODE];
+        assertConsumerNode(node);
+        for (let i = node.producerNode.length - 1; i >= 0; i--) {
+          if (signals.includes(node.producerNode[i].wrapper)) {
+            producerRemoveLiveConsumerAtIndex(node.producerNode[i], node.producerIndexOfThis[i]);
+            const lastIdx = node.producerNode.length - 1;
+            node.producerNode[i] = node.producerNode[lastIdx];
+            node.producerIndexOfThis[i] = node.producerIndexOfThis[lastIdx];
+            node.producerNode.length--;
+            node.producerIndexOfThis.length--;
+            node.nextProducerIndex--;
+            if (i < node.producerNode.length) {
+              const idxConsumer = node.producerIndexOfThis[i];
+              const producer = node.producerNode[i];
+              assertProducerNode(producer);
+              producer.liveConsumerIndexOfThis[idxConsumer] = i;
+            }
+          }
+        }
+      }
+      // Returns the set of computeds in the Watcher's set which are still yet
+      // to be re-evaluated
+      getPending() {
+        if (!(0, Signal2.isWatcher)(this)) {
+          throw new TypeError("Called getPending without Watcher receiver");
+        }
+        const node = this[NODE];
+        return node.producerNode.filter((n) => n.dirty).map((n) => n.wrapper);
+      }
+    }
+    _a2 = NODE;
+    _brand3 = new WeakSet();
+    brand_fn3 = function() {
+    };
+    _assertSignals = new WeakSet();
+    assertSignals_fn = function(signals) {
+      for (const signal of signals) {
+        if (!(0, Signal2.isComputed)(signal) && !(0, Signal2.isState)(signal)) {
+          throw new TypeError("Called watch/unwatch without a Computed or State argument");
+        }
+      }
+    };
+    Signal2.isWatcher = (w) => __privateIn(_brand3, w);
+    subtle2.Watcher = Watcher;
+    function currentComputed() {
+      var _a3;
+      return (_a3 = getActiveConsumer()) == null ? void 0 : _a3.wrapper;
+    }
+    subtle2.currentComputed = currentComputed;
+    subtle2.watched = Symbol("watched");
+    subtle2.unwatched = Symbol("unwatched");
+  })(Signal2.subtle || (Signal2.subtle = {}));
+})(Signal || (Signal = {}));
+export {
+  Signal
+};

package/public/nativefragments/signals.js

@@ -0,0 +1,119 @@
+import { Signal } from "./signal-polyfill.js";
+
+let needsEnqueue = true;
+
+const effectWatcher = new Signal.subtle.Watcher(() => {
+  if (!needsEnqueue) return;
+  needsEnqueue = false;
+  queueMicrotask(processPending);
+});
+
+const report = (error) => {
+  if (typeof globalThis.reportError === "function") {
+    globalThis.reportError(error);
+  } else {
+    setTimeout(() => {
+      throw error;
+    });
+  }
+};
+
+function processPending() {
+  needsEnqueue = true;
+  const errors = [];
+
+  for (const signal of effectWatcher.getPending()) {
+    try {
+      signal.get();
+    } catch (error) {
+      errors.push(error);
+    }
+  }
+
+  effectWatcher.watch();
+  for (const error of errors) report(error);
+}
+
+export const state = (initial, options) => new Signal.State(initial, options);
+
+export const computed = (callback, options) => new Signal.Computed(callback, options);
+
+export const isSignal = (value) =>
+  Signal.isState(value) || Signal.isComputed(value);
+
+export const read = (value) => {
+  if (isSignal(value)) return value.get();
+  if (typeof value === "function") return value();
+  return value;
+};
+
+export const effect = (callback) => {
+  let cleanup;
+
+  const computation = new Signal.Computed(() => {
+    if (typeof cleanup === "function") cleanup();
+    cleanup = callback();
+  });
+
+  effectWatcher.watch(computation);
+  computation.get();
+
+  return () => {
+    effectWatcher.unwatch(computation);
+    if (typeof cleanup === "function") cleanup();
+    cleanup = undefined;
+  };
+};
+
+export const bindText = (node, value) =>
+  effect(() => {
+    node.textContent = read(value) ?? "";
+  });
+
+export const bindHTML = (element, value) =>
+  effect(() => {
+    element.innerHTML = read(value) ?? "";
+  });
+
+export const bindAttr = (element, name, value) =>
+  effect(() => {
+    const next = read(value);
+    if (next === false || next === null || next === undefined) {
+      element.removeAttribute(name);
+    } else {
+      element.setAttribute(name, next === true ? "" : String(next));
+    }
+  });
+
+export const bindProperty = (element, property, value) =>
+  effect(() => {
+    element[property] = read(value);
+  });
+
+export const bindClass = (element, name, value) =>
+  effect(() => {
+    element.classList.toggle(name, Boolean(read(value)));
+  });
+
+export const bindStyle = (element, name, value) =>
+  effect(() => {
+    const next = read(value);
+    if (next === false || next === null || next === undefined) {
+      element.style.removeProperty(name);
+    } else {
+      element.style.setProperty(name, String(next));
+    }
+  });
+
+export const model = (element, signal, eventName = "input") => {
+  const stopBinding = bindProperty(element, "value", signal);
+  const update = () => signal.set(element.value);
+  element.addEventListener(eventName, update);
+
+  return () => {
+    stopBinding();
+    element.removeEventListener(eventName, update);
+  };
+};
+
+export { Signal };

package/scripts/smoke.mjs

@@ -0,0 +1,54 @@
+import {
+  bindAttr,
+  bindClass,
+  computed,
+  effect,
+  state,
+} from "../src/index.js";
+
+const count = state(1);
+const doubled = computed(() => count.get() * 2);
+let latest = 0;
+
+const stop = effect(() => {
+  latest = doubled.get();
+});
+
+if (latest !== 2) throw new Error("initial effect failed");
+count.set(3);
+await new Promise((resolve) => setTimeout(resolve, 0));
+if (latest !== 6) throw new Error("reactive effect failed");
+stop();
+
+const attributes = new Map();
+const element = {
+  classList: {
+    values: new Set(),
+    toggle(name, enabled) {
+      if (enabled) this.values.add(name);
+      else this.values.delete(name);
+    },
+  },
+  removeAttribute(name) {
+    attributes.delete(name);
+  },
+  setAttribute(name, value) {
+    attributes.set(name, value);
+  },
+};
+
+const enabled = state(false);
+const stopClass = bindClass(element, "enabled", enabled);
+enabled.set(true);
+await new Promise((resolve) => setTimeout(resolve, 0));
+if (!element.classList.values.has("enabled")) throw new Error("class binding failed");
+stopClass();
+
+const label = state("Save");
+const stopAttr = bindAttr(element, "aria-label", label);
+label.set("Saved");
+await new Promise((resolve) => setTimeout(resolve, 0));
+if (attributes.get("aria-label") !== "Saved") throw new Error("attr binding failed");
+stopAttr();
+
+console.log("signals smoke ok");

package/skills/nativefragments-signals/SKILL.md

@@ -0,0 +1,67 @@
+---
+name: nativefragments-signals
+description: Add reactive state to Native Fragments apps with signal-polyfill and no build step.
+---
+
+# Native Fragments Signals Skill
+
+Use this skill when a Native Fragments app needs client-side reactive state.
+
+## Rules
+
+- Keep `@nativefragments/core` dependency-free. Use this package only where
+  client-side reactivity is needed.
+- Prefer `state()` for writable values and `computed()` for derived values.
+- Use DOM binding helpers instead of rerendering whole component trees.
+- Keep effects small. They run immediately and rerun in a microtask when a
+  signal read by the effect changes.
+- For first-paint UI, keep server-rendered HTML canonical and use signals only
+  to hydrate interactive islands.
+
+## Browser Setup
+
+Copy the browser files into the app's public helpers:
+
+```sh
+cp node_modules/@nativefragments/signals/public/nativefragments/*.js public/nativefragments/
+```
+
+Import from the public path:
+
+```js
+import { bindText, computed, state } from "/nativefragments/signals.js";
+```
+
+## Component Pattern
+
+```js
+import { bindText, computed, state } from "/nativefragments/signals.js";
+import { shadow, sheet } from "/nativefragments/component.js";
+
+const styles = sheet(`
+  :host { display: inline-grid; gap: 0.5rem; }
+`);
+
+class CounterButton extends HTMLElement {
+  connectedCallback() {
+    const count = state(0);
+    const label = computed(() => `Count ${count.get()}`);
+    const root = shadow(this, {
+      styles: [styles],
+      html: `<button type="button"><span data-label></span></button>`
+    });
+
+    bindText(root.querySelector("[data-label]"), label);
+    root.querySelector("button").addEventListener("click", () => {
+      count.set(count.get() + 1);
+    });
+  }
+}
+
+customElements.define("counter-button", CounterButton);
+```
+
+## Cleanup
+
+Bindings return cleanup functions. Call them in `disconnectedCallback()` when a
+component can be removed and reinserted.

package/src/index.js

@@ -0,0 +1,217 @@
+import { Signal } from "signal-polyfill";
+
+let needsEnqueue = true;
+
+const effectWatcher = new Signal.subtle.Watcher(() => {
+  if (!needsEnqueue) return;
+  needsEnqueue = false;
+  queueMicrotask(processPending);
+});
+
+const report = (error) => {
+  if (typeof globalThis.reportError === "function") {
+    globalThis.reportError(error);
+  } else {
+    setTimeout(() => {
+      throw error;
+    });
+  }
+};
+
+function processPending() {
+  needsEnqueue = true;
+  const errors = [];
+
+  for (const signal of effectWatcher.getPending()) {
+    try {
+      signal.get();
+    } catch (error) {
+      errors.push(error);
+    }
+  }
+
+  effectWatcher.watch();
+  for (const error of errors) report(error);
+}
+
+/**
+ * Create a writable signal.
+ *
+ * @template T
+ * @param {T} initial Initial value.
+ * @param {object} [options] Signal options passed to `Signal.State`.
+ * @returns {Signal.State<T>} Writable signal.
+ */
+export const state = (initial, options) => new Signal.State(initial, options);
+
+/**
+ * Create a computed signal.
+ *
+ * @template T
+ * @param {() => T} callback Computation callback.
+ * @param {object} [options] Signal options passed to `Signal.Computed`.
+ * @returns {Signal.Computed<T>} Computed signal.
+ */
+export const computed = (callback, options) => new Signal.Computed(callback, options);
+
+/**
+ * Check whether a value is a signal state or computed.
+ *
+ * @param {unknown} value Value to check.
+ * @returns {boolean} Whether the value is a signal.
+ */
+export const isSignal = (value) =>
+  Signal.isState(value) || Signal.isComputed(value);
+
+/**
+ * Read a raw value, signal, or value function.
+ *
+ * @template T
+ * @param {T | { get(): T } | (() => T)} value Value source.
+ * @returns {T} Current value.
+ */
+export const read = (value) => {
+  if (isSignal(value)) return value.get();
+  if (typeof value === "function") return value();
+  return value;
+};
+
+/**
+ * Run a reactive side effect.
+ *
+ * The callback runs immediately. Any signals read during the callback are
+ * tracked, and the callback reruns in a microtask when they change.
+ *
+ * @param {() => void | (() => void)} callback Effect callback.
+ * @returns {() => void} Cleanup function.
+ */
+export const effect = (callback) => {
+  let cleanup;
+
+  const computation = new Signal.Computed(() => {
+    if (typeof cleanup === "function") cleanup();
+    cleanup = callback();
+  });
+
+  effectWatcher.watch(computation);
+  computation.get();
+
+  return () => {
+    effectWatcher.unwatch(computation);
+    if (typeof cleanup === "function") cleanup();
+    cleanup = undefined;
+  };
+};
+
+/**
+ * Bind text content to a reactive value.
+ *
+ * @param {Node} node Target node.
+ * @param {unknown | (() => unknown)} value Reactive value.
+ * @returns {() => void} Cleanup function.
+ */
+export const bindText = (node, value) =>
+  effect(() => {
+    node.textContent = read(value) ?? "";
+  });
+
+/**
+ * Bind inner HTML to a reactive value.
+ *
+ * Use only with trusted HTML.
+ *
+ * @param {Element} element Target element.
+ * @param {unknown | (() => unknown)} value Reactive HTML.
+ * @returns {() => void} Cleanup function.
+ */
+export const bindHTML = (element, value) =>
+  effect(() => {
+    element.innerHTML = read(value) ?? "";
+  });
+
+/**
+ * Bind an attribute to a reactive value.
+ *
+ * `false`, `null`, and `undefined` remove the attribute. `true` writes a
+ * boolean attribute.
+ *
+ * @param {Element} element Target element.
+ * @param {string} name Attribute name.
+ * @param {unknown | (() => unknown)} value Reactive value.
+ * @returns {() => void} Cleanup function.
+ */
+export const bindAttr = (element, name, value) =>
+  effect(() => {
+    const next = read(value);
+    if (next === false || next === null || next === undefined) {
+      element.removeAttribute(name);
+    } else {
+      element.setAttribute(name, next === true ? "" : String(next));
+    }
+  });
+
+/**
+ * Bind an element property to a reactive value.
+ *
+ * @param {object} element Target object or element.
+ * @param {string} property Property name.
+ * @param {unknown | (() => unknown)} value Reactive value.
+ * @returns {() => void} Cleanup function.
+ */
+export const bindProperty = (element, property, value) =>
+  effect(() => {
+    element[property] = read(value);
+  });
+
+/**
+ * Toggle a class from a reactive value.
+ *
+ * @param {Element} element Target element.
+ * @param {string} name Class name.
+ * @param {unknown | (() => unknown)} value Reactive value.
+ * @returns {() => void} Cleanup function.
+ */
+export const bindClass = (element, name, value) =>
+  effect(() => {
+    element.classList.toggle(name, Boolean(read(value)));
+  });
+
+/**
+ * Bind a CSS custom property or style property to a reactive value.
+ *
+ * @param {HTMLElement} element Target element.
+ * @param {string} name Style property name.
+ * @param {unknown | (() => unknown)} value Reactive value.
+ * @returns {() => void} Cleanup function.
+ */
+export const bindStyle = (element, name, value) =>
+  effect(() => {
+    const next = read(value);
+    if (next === false || next === null || next === undefined) {
+      element.style.removeProperty(name);
+    } else {
+      element.style.setProperty(name, String(next));
+    }
+  });
+
+/**
+ * Bind an input-like element's value to a writable signal.
+ *
+ * @param {HTMLInputElement | HTMLTextAreaElement | HTMLSelectElement} element
+ * Form control.
+ * @param {{ get(): string, set(value: string): void }} signal Writable signal.
+ * @param {string} [eventName="input"] Event name used to update the signal.
+ * @returns {() => void} Cleanup function.
+ */
+export const model = (element, signal, eventName = "input") => {
+  const stopBinding = bindProperty(element, "value", signal);
+  const update = () => signal.set(element.value);
+  element.addEventListener(eventName, update);
+
+  return () => {
+    stopBinding();
+    element.removeEventListener(eventName, update);
+  };
+};
+
+export { Signal };

package/third-party/signal-polyfill/LICENSE

@@ -0,0 +1,201 @@
+                                 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
+      (an example is provided in the Appendix below).
+
+      "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
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.