@shadow-js/core 1.0.1 → 1.0.3

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 (191) hide show
  1. package/CHANGELOG.md +23 -0
  2. package/dist/dev/action.js +11 -7
  3. package/dist/dev/action.js.map +1 -1
  4. package/dist/dev/cache.d.ts +2 -1
  5. package/dist/dev/cache.js +5 -3
  6. package/dist/dev/cache.js.map +1 -1
  7. package/dist/dev/effect.js +17 -33
  8. package/dist/dev/effect.js.map +1 -1
  9. package/dist/dev/extend/index.d.ts +7 -6
  10. package/dist/dev/extend/index.js +7 -7
  11. package/dist/dev/extend/index.js.map +1 -1
  12. package/dist/dev/external-store.js +8 -3
  13. package/dist/dev/external-store.js.map +1 -1
  14. package/dist/dev/internal/concurrency.js +56 -30
  15. package/dist/dev/internal/concurrency.js.map +1 -1
  16. package/dist/dev/internal/diagnostics.js +0 -2
  17. package/dist/dev/internal/diagnostics.js.map +1 -1
  18. package/dist/dev/internal/dispose.js +1 -1
  19. package/dist/dev/internal/dispose.js.map +1 -1
  20. package/dist/dev/internal/flags.js +1 -3
  21. package/dist/dev/internal/flags.js.map +1 -1
  22. package/dist/dev/internal/graph.d.ts +1 -2
  23. package/dist/dev/internal/graph.js +47 -69
  24. package/dist/dev/internal/graph.js.map +1 -1
  25. package/dist/dev/internal/owner.d.ts +9 -6
  26. package/dist/dev/internal/owner.js +22 -30
  27. package/dist/dev/internal/owner.js.map +1 -1
  28. package/dist/dev/internal/scheduler.js +44 -73
  29. package/dist/dev/internal/scheduler.js.map +1 -1
  30. package/dist/dev/list.js +4 -12
  31. package/dist/dev/list.js.map +1 -1
  32. package/dist/dev/memo.d.ts +2 -1
  33. package/dist/dev/memo.js +4 -4
  34. package/dist/dev/memo.js.map +1 -1
  35. package/dist/dev/ownership.d.ts +4 -2
  36. package/dist/dev/ownership.js +59 -3
  37. package/dist/dev/ownership.js.map +1 -1
  38. package/dist/dev/props.js +18 -11
  39. package/dist/dev/props.js.map +1 -1
  40. package/dist/dev/reaction.d.ts +1 -1
  41. package/dist/dev/reaction.js +5 -1
  42. package/dist/dev/reaction.js.map +1 -1
  43. package/dist/dev/reducer.js +1 -1
  44. package/dist/dev/reducer.js.map +1 -1
  45. package/dist/dev/resource.js +24 -15
  46. package/dist/dev/resource.js.map +1 -1
  47. package/dist/dev/selector.js +1 -5
  48. package/dist/dev/selector.js.map +1 -1
  49. package/dist/dev/signal.d.ts +3 -2
  50. package/dist/dev/signal.js +3 -3
  51. package/dist/dev/signal.js.map +1 -1
  52. package/dist/dev/store/nodes.js +10 -4
  53. package/dist/dev/store/nodes.js.map +1 -1
  54. package/dist/dev/store/use-store.d.ts +5 -0
  55. package/dist/dev/store/use-store.js.map +1 -1
  56. package/dist/dev/transitions.js +1 -1
  57. package/dist/dev/transitions.js.map +1 -1
  58. package/dist/prod/action.js +1 -1
  59. package/dist/prod/action.js.map +1 -1
  60. package/dist/prod/cache.js +1 -1
  61. package/dist/prod/cache.js.map +1 -1
  62. package/dist/prod/effect.js +1 -1
  63. package/dist/prod/effect.js.map +1 -1
  64. package/dist/prod/extend/index.js +1 -1
  65. package/dist/prod/extend/index.js.map +1 -1
  66. package/dist/prod/external-store.js +1 -1
  67. package/dist/prod/external-store.js.map +1 -1
  68. package/dist/prod/internal/concurrency.js +1 -1
  69. package/dist/prod/internal/concurrency.js.map +1 -1
  70. package/dist/prod/internal/diagnostics.js +1 -1
  71. package/dist/prod/internal/diagnostics.js.map +1 -1
  72. package/dist/prod/internal/dispose.js +1 -1
  73. package/dist/prod/internal/dispose.js.map +1 -1
  74. package/dist/prod/internal/flags.js +1 -1
  75. package/dist/prod/internal/flags.js.map +1 -1
  76. package/dist/prod/internal/graph.js +1 -1
  77. package/dist/prod/internal/graph.js.map +1 -1
  78. package/dist/prod/internal/owner.js +1 -1
  79. package/dist/prod/internal/owner.js.map +1 -1
  80. package/dist/prod/internal/scheduler.js +1 -1
  81. package/dist/prod/internal/scheduler.js.map +1 -1
  82. package/dist/prod/list.js +1 -1
  83. package/dist/prod/list.js.map +1 -1
  84. package/dist/prod/memo.js +1 -1
  85. package/dist/prod/memo.js.map +1 -1
  86. package/dist/prod/ownership.js +1 -1
  87. package/dist/prod/ownership.js.map +1 -1
  88. package/dist/prod/props.js.map +1 -1
  89. package/dist/prod/reaction.js +1 -1
  90. package/dist/prod/reaction.js.map +1 -1
  91. package/dist/prod/reducer.js +1 -1
  92. package/dist/prod/reducer.js.map +1 -1
  93. package/dist/prod/resource.js +1 -1
  94. package/dist/prod/resource.js.map +1 -1
  95. package/dist/prod/selector.js +1 -1
  96. package/dist/prod/selector.js.map +1 -1
  97. package/dist/prod/signal.js +1 -1
  98. package/dist/prod/signal.js.map +1 -1
  99. package/dist/prod/store/nodes.js +1 -1
  100. package/dist/prod/store/nodes.js.map +1 -1
  101. package/dist/prod/store/use-store.js.map +1 -1
  102. package/dist/prod/transitions.js +1 -1
  103. package/dist/prod/transitions.js.map +1 -1
  104. package/dist/server/action.js +1 -1
  105. package/dist/server/action.js.map +1 -1
  106. package/dist/server/cache.js +1 -1
  107. package/dist/server/cache.js.map +1 -1
  108. package/dist/server/effect.js.map +1 -1
  109. package/dist/server/extend/index.js +1 -1
  110. package/dist/server/extend/index.js.map +1 -1
  111. package/dist/server/external-store.js.map +1 -1
  112. package/dist/server/internal/concurrency.js +1 -1
  113. package/dist/server/internal/concurrency.js.map +1 -1
  114. package/dist/server/internal/diagnostics.js +1 -1
  115. package/dist/server/internal/diagnostics.js.map +1 -1
  116. package/dist/server/internal/dispose.js +1 -1
  117. package/dist/server/internal/dispose.js.map +1 -1
  118. package/dist/server/internal/flags.js +1 -1
  119. package/dist/server/internal/flags.js.map +1 -1
  120. package/dist/server/internal/graph.js +1 -1
  121. package/dist/server/internal/graph.js.map +1 -1
  122. package/dist/server/internal/owner.js +1 -1
  123. package/dist/server/internal/owner.js.map +1 -1
  124. package/dist/server/internal/scheduler.js +1 -1
  125. package/dist/server/internal/scheduler.js.map +1 -1
  126. package/dist/server/list.js +1 -1
  127. package/dist/server/list.js.map +1 -1
  128. package/dist/server/memo.js +1 -1
  129. package/dist/server/memo.js.map +1 -1
  130. package/dist/server/ownership.js +1 -1
  131. package/dist/server/ownership.js.map +1 -1
  132. package/dist/server/props.js.map +1 -1
  133. package/dist/server/reaction.js +1 -1
  134. package/dist/server/reaction.js.map +1 -1
  135. package/dist/server/reducer.js +1 -1
  136. package/dist/server/reducer.js.map +1 -1
  137. package/dist/server/resource.js +1 -1
  138. package/dist/server/resource.js.map +1 -1
  139. package/dist/server/selector.js +1 -1
  140. package/dist/server/selector.js.map +1 -1
  141. package/dist/server/signal.js +1 -1
  142. package/dist/server/signal.js.map +1 -1
  143. package/dist/server/store/nodes.js +1 -1
  144. package/dist/server/store/nodes.js.map +1 -1
  145. package/dist/server/store/use-store.js.map +1 -1
  146. package/dist/server/transitions.js.map +1 -1
  147. package/dist/server-dev/action.js +11 -7
  148. package/dist/server-dev/action.js.map +1 -1
  149. package/dist/server-dev/cache.js +5 -3
  150. package/dist/server-dev/cache.js.map +1 -1
  151. package/dist/server-dev/effect.js.map +1 -1
  152. package/dist/server-dev/extend/index.js +7 -7
  153. package/dist/server-dev/extend/index.js.map +1 -1
  154. package/dist/server-dev/external-store.js.map +1 -1
  155. package/dist/server-dev/internal/concurrency.js +56 -30
  156. package/dist/server-dev/internal/concurrency.js.map +1 -1
  157. package/dist/server-dev/internal/diagnostics.js +0 -2
  158. package/dist/server-dev/internal/diagnostics.js.map +1 -1
  159. package/dist/server-dev/internal/dispose.js +1 -1
  160. package/dist/server-dev/internal/dispose.js.map +1 -1
  161. package/dist/server-dev/internal/flags.js +1 -3
  162. package/dist/server-dev/internal/flags.js.map +1 -1
  163. package/dist/server-dev/internal/graph.js +47 -69
  164. package/dist/server-dev/internal/graph.js.map +1 -1
  165. package/dist/server-dev/internal/owner.js +22 -30
  166. package/dist/server-dev/internal/owner.js.map +1 -1
  167. package/dist/server-dev/internal/scheduler.js +44 -73
  168. package/dist/server-dev/internal/scheduler.js.map +1 -1
  169. package/dist/server-dev/list.js +4 -12
  170. package/dist/server-dev/list.js.map +1 -1
  171. package/dist/server-dev/memo.js +4 -4
  172. package/dist/server-dev/memo.js.map +1 -1
  173. package/dist/server-dev/ownership.js +59 -3
  174. package/dist/server-dev/ownership.js.map +1 -1
  175. package/dist/server-dev/props.js +18 -11
  176. package/dist/server-dev/props.js.map +1 -1
  177. package/dist/server-dev/reaction.js +5 -1
  178. package/dist/server-dev/reaction.js.map +1 -1
  179. package/dist/server-dev/reducer.js +1 -1
  180. package/dist/server-dev/reducer.js.map +1 -1
  181. package/dist/server-dev/resource.js +24 -15
  182. package/dist/server-dev/resource.js.map +1 -1
  183. package/dist/server-dev/selector.js +1 -5
  184. package/dist/server-dev/selector.js.map +1 -1
  185. package/dist/server-dev/signal.js +3 -3
  186. package/dist/server-dev/signal.js.map +1 -1
  187. package/dist/server-dev/store/nodes.js +10 -4
  188. package/dist/server-dev/store/nodes.js.map +1 -1
  189. package/dist/server-dev/store/use-store.js.map +1 -1
  190. package/dist/server-dev/transitions.js.map +1 -1
  191. package/package.json +2 -1
@@ -1,5 +1,5 @@
1
- import { track } from "../internal/graph.js";
2
- import { createSignalNode, isTracking, notify as notify$1 } from "../extend/index.js";
1
+ import { Signal, track } from "../internal/graph.js";
2
+ import { isTracking, notify as notify$1 } from "../extend/index.js";
3
3
  // src/store/nodes.ts
4
4
  /** Keys that could reach `Object.prototype` if written; they are never stored as own properties. */
5
5
  const RESERVED_KEYS = /* @__PURE__ */ new Set([
@@ -106,6 +106,8 @@ function nodeOf(raw) {
106
106
  }
107
107
  return node;
108
108
  }
109
+ /** The map size at which the first sweep of unobserved key signals runs. */
110
+ const SWEEP_AT = 256;
109
111
  function signalFor(node, key) {
110
112
  let signals = node.signals;
111
113
  if (signals === null) {
@@ -114,7 +116,11 @@ function signalFor(node, key) {
114
116
  }
115
117
  let signal = signals.get(key);
116
118
  if (signal === void 0) {
117
- signal = createSignalNode(0, false);
119
+ const size = signals.size;
120
+ if (size >= SWEEP_AT && (size & size - 1) === 0) {
121
+ for (const [other, node] of signals) if ((node.observers?.length ?? 0) === 0) signals.delete(other);
122
+ }
123
+ signal = new Signal(0, false);
118
124
  signals.set(key, signal);
119
125
  }
120
126
  return signal;
@@ -127,7 +133,7 @@ function trackProperty(node, key) {
127
133
  /** Subscribes the running computation (if any) to the key set of the object. */
128
134
  function trackKeys(node) {
129
135
  if (!isTracking()) return;
130
- if (node.keys === null) node.keys = createSignalNode(0, false);
136
+ if (node.keys === null) node.keys = new Signal(0, false);
131
137
  track(node.keys);
132
138
  }
133
139
  /**
@@ -1 +1 @@
1
- {"version":3,"file":"nodes.js","names":[],"sources":["../../../src/store/nodes.ts"],"sourcesContent":["import {\n createSignalNode,\n isTracking,\n notify as notifySource,\n type SignalNode,\n track,\n} from \"../extend\";\n\n/** Keys that could reach `Object.prototype` if written; they are never stored as own properties. */\nconst RESERVED_KEYS: ReadonlySet<string> = new Set([\"__proto__\", \"constructor\", \"prototype\"]);\n\n/**\n * Tracking state of one plain object or array. Signals are created lazily, on the first read made\n * inside a tracked computation, so untracked data costs one small record per object.\n */\nexport interface NodeState {\n /** One signal per property read in a tracked context, keyed by property name. */\n signals: Map<string, SignalNode<number>> | null;\n /** Notified when a property is added or removed, or an array changes length. */\n keys: SignalNode<number> | null;\n /** The read-only proxy for this object, created on first read. */\n proxy: object | null;\n}\n\n/** Raw object -> its tracking state. Keys are the raw data, so nothing is stamped on user objects. */\nexport const NODES: WeakMap<object, NodeState> = new WeakMap();\n\n/** Any store proxy (read-only or draft) -> the raw object it wraps. */\nexport const RAW: WeakMap<object, object> = new WeakMap();\n\n/** True for the keys that must never be written as own properties. */\nexport function isReservedKey(key: string): boolean {\n return RESERVED_KEYS.has(key);\n}\n\n/** True for the values the store wraps: plain objects (null or Object.prototype) and arrays. */\nexport function isWrappable(value: unknown): value is object {\n if (typeof value !== \"object\" || value === null) return false;\n if (Array.isArray(value)) return true;\n if (value === Object.prototype) return false;\n const prototype: unknown = Object.getPrototypeOf(value);\n return prototype === Object.prototype || prototype === null;\n}\n\n/** Replaces a store proxy by the raw object it wraps; any other value is returned as is. */\nexport function unwrapValue(value: unknown): unknown {\n if (typeof value !== \"object\" || value === null) return value;\n return RAW.get(value) ?? value;\n}\n\n/** True when a store proxy (draft or read-only view) sits anywhere inside the plain data `root`. */\nfunction containsProxy(root: object): boolean {\n const seen = new Set<object>([root]);\n const stack: object[] = [root];\n while (stack.length > 0) {\n const container = stack.pop() as object;\n for (const key of Object.keys(container)) {\n const member: unknown = Reflect.get(container, key);\n if (typeof member !== \"object\" || member === null) continue;\n if (RAW.has(member)) return true;\n if (isWrappable(member) && !seen.has(member)) {\n seen.add(member);\n stack.push(member);\n }\n }\n }\n return false;\n}\n\n/**\n * Like {@link unwrapValue}, and also for proxies hidden inside plain data: `draft.todos =\n * draft.todos.filter(...)` assigns an array whose members are drafts, and a draft stored in the\n * data would throw on its next use. Data without proxies is returned as is; otherwise a copy with\n * every proxy replaced by its raw object. Iterative, so nesting depth is not limited by the stack.\n */\nexport function unwrapDeep(value: unknown): unknown {\n const first = unwrapValue(value);\n if (first !== value || !isWrappable(first) || !containsProxy(first)) return first;\n const copies = new Map<object, object>();\n const copyOf = (source: object): object => {\n const existing = copies.get(source);\n if (existing !== undefined) return existing;\n const made: object = Array.isArray(source) ? [] : Object.create(Object.getPrototypeOf(source));\n copies.set(source, made);\n return made;\n };\n const rootCopy = copyOf(first);\n const queue: object[] = [first];\n for (let head = 0; head < queue.length; head += 1) {\n const source = queue[head] as object;\n const target = copies.get(source) as object;\n for (const key of Object.keys(source)) {\n let member: unknown = Reflect.get(source, key);\n if (typeof member === \"object\" && member !== null) {\n const raw = RAW.get(member);\n if (raw !== undefined) member = raw;\n else if (isWrappable(member)) {\n const known = copies.has(member);\n member = copyOf(member);\n if (!known) queue.push(Reflect.get(source, key) as object);\n }\n }\n Object.defineProperty(target, key, {\n value: member,\n enumerable: true,\n writable: true,\n configurable: true,\n });\n }\n }\n return rootCopy;\n}\n\n/** Reads an own or inherited property without tracking and without invoking proxies. */\nexport function readRaw(target: object, key: string): unknown {\n return Reflect.get(target, key);\n}\n\n/** Returns the tracking state of `raw`, creating an empty one on first use. */\nexport function nodeOf(raw: object): NodeState {\n let node = NODES.get(raw);\n if (node === undefined) {\n node = { signals: null, keys: null, proxy: null };\n NODES.set(raw, node);\n }\n return node;\n}\n\nfunction signalFor(node: NodeState, key: string): SignalNode<number> {\n let signals = node.signals;\n if (signals === null) {\n signals = new Map();\n node.signals = signals;\n }\n let signal = signals.get(key);\n if (signal === undefined) {\n signal = createSignalNode(0, false);\n signals.set(key, signal);\n }\n return signal;\n}\n\n/** Subscribes the running computation (if any) to one property of the object. */\nexport function trackProperty(node: NodeState, key: string): void {\n if (!isTracking()) return;\n track(signalFor(node, key));\n}\n\n/** Subscribes the running computation (if any) to the key set of the object. */\nexport function trackKeys(node: NodeState): void {\n if (!isTracking()) return;\n if (node.keys === null) node.keys = createSignalNode(0, false);\n track(node.keys);\n}\n\n/**\n * Notifies the observers of one signal. The same engine steps as a signal write: mark the\n * observers dirty, then request a flush (which the surrounding batch defers).\n */\nfunction notify(signal: SignalNode<number> | null | undefined): void {\n if (signal === undefined || signal === null) return;\n notifySource(signal);\n}\n\nfunction isIndexKey(key: string): boolean {\n const index = Number(key);\n return Number.isInteger(index) && index >= 0 && String(index) === key;\n}\n\n/** Notifies the index signals of an array at or beyond `from` (used when the array shrinks). */\nfunction notifyIndicesFrom(node: NodeState, from: number): void {\n const signals = node.signals;\n if (signals === null) return;\n for (const [key, signal] of signals) {\n if (isIndexKey(key) && Number(key) >= from) notify(signal);\n }\n}\n\n/**\n * Writes one property of a raw object and notifies exactly what changed: the property's signal,\n * the key set when a property appears, and the length when an array's length moves. An equal\n * value (Object.is) writes nothing. Returns whether anything changed.\n */\nexport function writeRaw(target: object, key: string, value: unknown): boolean {\n if (isReservedKey(key)) {\n throw new TypeError(\n __DEV__\n ? `ShadowStore: \"${key}\" cannot be written; it is a reserved key`\n : \"SHADOW_STORE_RESERVED_KEY\",\n );\n }\n value = unwrapDeep(value);\n const array = Array.isArray(target);\n const had = Object.hasOwn(target, key);\n if (had && Object.is(readRaw(target, key), value)) return false;\n const before = array ? (target as unknown[]).length : 0;\n if (!Reflect.set(target, key, value)) {\n throw new TypeError(\n __DEV__\n ? `ShadowStore: property \"${key}\" is read-only and cannot be written`\n : \"SHADOW_STORE_PROP_READ_ONLY\",\n );\n }\n const node = NODES.get(target);\n if (node === undefined) return true;\n notify(node.signals?.get(key));\n if (!had) notify(node.keys);\n if (array) {\n const after = (target as unknown[]).length;\n if (after !== before) {\n notify(node.signals?.get(\"length\"));\n notify(node.keys);\n if (after < before) notifyIndicesFrom(node, after);\n }\n }\n return true;\n}\n\n/** Deletes one own property of a raw object and notifies its signal and the key set. */\nexport function deleteRaw(target: object, key: string): boolean {\n if (isReservedKey(key)) {\n throw new TypeError(\n __DEV__\n ? `ShadowStore: \"${key}\" cannot be deleted; it is a reserved key`\n : \"SHADOW_STORE_RESERVED_DELETE\",\n );\n }\n if (!Object.hasOwn(target, key)) return true;\n if (!Reflect.deleteProperty(target, key)) {\n throw new TypeError(\n __DEV__ ? `ShadowStore: property \"${key}\" cannot be deleted` : \"SHADOW_STORE_DELETE\",\n );\n }\n const node = NODES.get(target);\n if (node === undefined) return true;\n notify(node.signals?.get(key));\n notify(node.keys);\n return true;\n}\n"],"mappings":";;;;AASA,MAAM,gCAAqC,IAAI,IAAI;CAAC;CAAa;CAAe;AAAW,CAAC;;AAgB5F,MAAa,wBAAoC,IAAI,QAAQ;;AAG7D,MAAa,sBAA+B,IAAI,QAAQ;;AAGxD,SAAgB,cAAc,KAAsB;CAClD,OAAO,cAAc,IAAI,GAAG;AAC9B;;AAGA,SAAgB,YAAY,OAAiC;CAC3D,IAAI,OAAO,UAAU,YAAY,UAAU,MAAM,OAAO;CACxD,IAAI,MAAM,QAAQ,KAAK,GAAG,OAAO;CACjC,IAAI,UAAU,OAAO,WAAW,OAAO;CACvC,MAAM,YAAqB,OAAO,eAAe,KAAK;CACtD,OAAO,cAAc,OAAO,aAAa,cAAc;AACzD;;AAGA,SAAgB,YAAY,OAAyB;CACnD,IAAI,OAAO,UAAU,YAAY,UAAU,MAAM,OAAO;CACxD,OAAO,IAAI,IAAI,KAAK,KAAK;AAC3B;;AAGA,SAAS,cAAc,MAAuB;CAC5C,MAAM,uBAAO,IAAI,IAAY,CAAC,IAAI,CAAC;CACnC,MAAM,QAAkB,CAAC,IAAI;CAC7B,OAAO,MAAM,SAAS,GAAG;EACvB,MAAM,YAAY,MAAM,IAAI;EAC5B,KAAK,MAAM,OAAO,OAAO,KAAK,SAAS,GAAG;GACxC,MAAM,SAAkB,QAAQ,IAAI,WAAW,GAAG;GAClD,IAAI,OAAO,WAAW,YAAY,WAAW,MAAM;GACnD,IAAI,IAAI,IAAI,MAAM,GAAG,OAAO;GAC5B,IAAI,YAAY,MAAM,KAAK,CAAC,KAAK,IAAI,MAAM,GAAG;IAC5C,KAAK,IAAI,MAAM;IACf,MAAM,KAAK,MAAM;GACnB;EACF;CACF;CACA,OAAO;AACT;;;;;;;AAQA,SAAgB,WAAW,OAAyB;CAClD,MAAM,QAAQ,YAAY,KAAK;CAC/B,IAAI,UAAU,SAAS,CAAC,YAAY,KAAK,KAAK,CAAC,cAAc,KAAK,GAAG,OAAO;CAC5E,MAAM,yBAAS,IAAI,IAAoB;CACvC,MAAM,UAAU,WAA2B;EACzC,MAAM,WAAW,OAAO,IAAI,MAAM;EAClC,IAAI,aAAa,KAAA,GAAW,OAAO;EACnC,MAAM,OAAe,MAAM,QAAQ,MAAM,IAAI,CAAC,IAAI,OAAO,OAAO,OAAO,eAAe,MAAM,CAAC;EAC7F,OAAO,IAAI,QAAQ,IAAI;EACvB,OAAO;CACT;CACA,MAAM,WAAW,OAAO,KAAK;CAC7B,MAAM,QAAkB,CAAC,KAAK;CAC9B,KAAK,IAAI,OAAO,GAAG,OAAO,MAAM,QAAQ,QAAQ,GAAG;EACjD,MAAM,SAAS,MAAM;EACrB,MAAM,SAAS,OAAO,IAAI,MAAM;EAChC,KAAK,MAAM,OAAO,OAAO,KAAK,MAAM,GAAG;GACrC,IAAI,SAAkB,QAAQ,IAAI,QAAQ,GAAG;GAC7C,IAAI,OAAO,WAAW,YAAY,WAAW,MAAM;IACjD,MAAM,MAAM,IAAI,IAAI,MAAM;IAC1B,IAAI,QAAQ,KAAA,GAAW,SAAS;SAC3B,IAAI,YAAY,MAAM,GAAG;KAC5B,MAAM,QAAQ,OAAO,IAAI,MAAM;KAC/B,SAAS,OAAO,MAAM;KACtB,IAAI,CAAC,OAAO,MAAM,KAAK,QAAQ,IAAI,QAAQ,GAAG,CAAW;IAC3D;GACF;GACA,OAAO,eAAe,QAAQ,KAAK;IACjC,OAAO;IACP,YAAY;IACZ,UAAU;IACV,cAAc;GAChB,CAAC;EACH;CACF;CACA,OAAO;AACT;;AAGA,SAAgB,QAAQ,QAAgB,KAAsB;CAC5D,OAAO,QAAQ,IAAI,QAAQ,GAAG;AAChC;;AAGA,SAAgB,OAAO,KAAwB;CAC7C,IAAI,OAAO,MAAM,IAAI,GAAG;CACxB,IAAI,SAAS,KAAA,GAAW;EACtB,OAAO;GAAE,SAAS;GAAM,MAAM;GAAM,OAAO;EAAK;EAChD,MAAM,IAAI,KAAK,IAAI;CACrB;CACA,OAAO;AACT;AAEA,SAAS,UAAU,MAAiB,KAAiC;CACnE,IAAI,UAAU,KAAK;CACnB,IAAI,YAAY,MAAM;EACpB,0BAAU,IAAI,IAAI;EAClB,KAAK,UAAU;CACjB;CACA,IAAI,SAAS,QAAQ,IAAI,GAAG;CAC5B,IAAI,WAAW,KAAA,GAAW;EACxB,SAAS,iBAAiB,GAAG,KAAK;EAClC,QAAQ,IAAI,KAAK,MAAM;CACzB;CACA,OAAO;AACT;;AAGA,SAAgB,cAAc,MAAiB,KAAmB;CAChE,IAAI,CAAC,WAAW,GAAG;CACnB,MAAM,UAAU,MAAM,GAAG,CAAC;AAC5B;;AAGA,SAAgB,UAAU,MAAuB;CAC/C,IAAI,CAAC,WAAW,GAAG;CACnB,IAAI,KAAK,SAAS,MAAM,KAAK,OAAO,iBAAiB,GAAG,KAAK;CAC7D,MAAM,KAAK,IAAI;AACjB;;;;;AAMA,SAAS,OAAO,QAAqD;CACnE,IAAI,WAAW,KAAA,KAAa,WAAW,MAAM;CAC7C,SAAa,MAAM;AACrB;AAEA,SAAS,WAAW,KAAsB;CACxC,MAAM,QAAQ,OAAO,GAAG;CACxB,OAAO,OAAO,UAAU,KAAK,KAAK,SAAS,KAAK,OAAO,KAAK,MAAM;AACpE;;AAGA,SAAS,kBAAkB,MAAiB,MAAoB;CAC9D,MAAM,UAAU,KAAK;CACrB,IAAI,YAAY,MAAM;CACtB,KAAK,MAAM,CAAC,KAAK,WAAW,SAC1B,IAAI,WAAW,GAAG,KAAK,OAAO,GAAG,KAAK,MAAM,OAAO,MAAM;AAE7D;;;;;;AAOA,SAAgB,SAAS,QAAgB,KAAa,OAAyB;CAC7E,IAAI,cAAc,GAAG,GACnB,MAAM,IAAI,UAEJ,iBAAiB,IAAI,0CAE3B;CAEF,QAAQ,WAAW,KAAK;CACxB,MAAM,QAAQ,MAAM,QAAQ,MAAM;CAClC,MAAM,MAAM,OAAO,OAAO,QAAQ,GAAG;CACrC,IAAI,OAAO,OAAO,GAAG,QAAQ,QAAQ,GAAG,GAAG,KAAK,GAAG,OAAO;CAC1D,MAAM,SAAS,QAAS,OAAqB,SAAS;CACtD,IAAI,CAAC,QAAQ,IAAI,QAAQ,KAAK,KAAK,GACjC,MAAM,IAAI,UAEJ,0BAA0B,IAAI,qCAEpC;CAEF,MAAM,OAAO,MAAM,IAAI,MAAM;CAC7B,IAAI,SAAS,KAAA,GAAW,OAAO;CAC/B,OAAO,KAAK,SAAS,IAAI,GAAG,CAAC;CAC7B,IAAI,CAAC,KAAK,OAAO,KAAK,IAAI;CAC1B,IAAI,OAAO;EACT,MAAM,QAAS,OAAqB;EACpC,IAAI,UAAU,QAAQ;GACpB,OAAO,KAAK,SAAS,IAAI,QAAQ,CAAC;GAClC,OAAO,KAAK,IAAI;GAChB,IAAI,QAAQ,QAAQ,kBAAkB,MAAM,KAAK;EACnD;CACF;CACA,OAAO;AACT;;AAGA,SAAgB,UAAU,QAAgB,KAAsB;CAC9D,IAAI,cAAc,GAAG,GACnB,MAAM,IAAI,UAEJ,iBAAiB,IAAI,0CAE3B;CAEF,IAAI,CAAC,OAAO,OAAO,QAAQ,GAAG,GAAG,OAAO;CACxC,IAAI,CAAC,QAAQ,eAAe,QAAQ,GAAG,GACrC,MAAM,IAAI,UACE,0BAA0B,IAAI,oBAC1C;CAEF,MAAM,OAAO,MAAM,IAAI,MAAM;CAC7B,IAAI,SAAS,KAAA,GAAW,OAAO;CAC/B,OAAO,KAAK,SAAS,IAAI,GAAG,CAAC;CAC7B,OAAO,KAAK,IAAI;CAChB,OAAO;AACT"}
1
+ {"version":3,"file":"nodes.js","names":["SignalNode"],"sources":["../../../src/store/nodes.ts"],"sourcesContent":["import { isTracking, notify as notifySource, SignalNode, track } from \"../extend\";\n\n/** Keys that could reach `Object.prototype` if written; they are never stored as own properties. */\nconst RESERVED_KEYS: ReadonlySet<string> = new Set([\"__proto__\", \"constructor\", \"prototype\"]);\n\n/**\n * Tracking state of one plain object or array. Signals are created lazily, on the first read made\n * inside a tracked computation, so untracked data costs one small record per object.\n */\nexport interface NodeState {\n /**\n * One signal per property read in a tracked context, keyed by property name. A signal is only a\n * notifier (it holds no value), so one that nothing observes any more is dropped by a sweep (see\n * `signalFor`) and a later read simply makes a new one.\n */\n signals: Map<string, SignalNode<number>> | null;\n /** Notified when a property is added or removed, or an array changes length. */\n keys: SignalNode<number> | null;\n /** The read-only proxy for this object, created on first read. */\n proxy: object | null;\n}\n\n/** Raw object -> its tracking state. Keys are the raw data, so nothing is stamped on user objects. */\nexport const NODES: WeakMap<object, NodeState> = new WeakMap();\n\n/** Any store proxy (read-only or draft) -> the raw object it wraps. */\nexport const RAW: WeakMap<object, object> = new WeakMap();\n\n/** True for the keys that must never be written as own properties. */\nexport function isReservedKey(key: string): boolean {\n return RESERVED_KEYS.has(key);\n}\n\n/** True for the values the store wraps: plain objects (null or Object.prototype) and arrays. */\nexport function isWrappable(value: unknown): value is object {\n if (typeof value !== \"object\" || value === null) return false;\n if (Array.isArray(value)) return true;\n if (value === Object.prototype) return false;\n const prototype: unknown = Object.getPrototypeOf(value);\n return prototype === Object.prototype || prototype === null;\n}\n\n/** Replaces a store proxy by the raw object it wraps; any other value is returned as is. */\nexport function unwrapValue(value: unknown): unknown {\n if (typeof value !== \"object\" || value === null) return value;\n return RAW.get(value) ?? value;\n}\n\n/** True when a store proxy (draft or read-only view) sits anywhere inside the plain data `root`. */\nfunction containsProxy(root: object): boolean {\n const seen = new Set<object>([root]);\n const stack: object[] = [root];\n while (stack.length > 0) {\n const container = stack.pop() as object;\n for (const key of Object.keys(container)) {\n const member: unknown = Reflect.get(container, key);\n if (typeof member !== \"object\" || member === null) continue;\n if (RAW.has(member)) return true;\n if (isWrappable(member) && !seen.has(member)) {\n seen.add(member);\n stack.push(member);\n }\n }\n }\n return false;\n}\n\n/**\n * Like {@link unwrapValue}, and also for proxies hidden inside plain data: `draft.todos =\n * draft.todos.filter(...)` assigns an array whose members are drafts, and a draft stored in the\n * data would throw on its next use. Data without proxies is returned as is; otherwise a copy with\n * every proxy replaced by its raw object. Iterative, so nesting depth is not limited by the stack.\n */\nexport function unwrapDeep(value: unknown): unknown {\n const first = unwrapValue(value);\n if (first !== value || !isWrappable(first) || !containsProxy(first)) return first;\n const copies = new Map<object, object>();\n const copyOf = (source: object): object => {\n const existing = copies.get(source);\n if (existing !== undefined) return existing;\n const made: object = Array.isArray(source) ? [] : Object.create(Object.getPrototypeOf(source));\n copies.set(source, made);\n return made;\n };\n const rootCopy = copyOf(first);\n const queue: object[] = [first];\n for (let head = 0; head < queue.length; head += 1) {\n const source = queue[head] as object;\n const target = copies.get(source) as object;\n for (const key of Object.keys(source)) {\n let member: unknown = Reflect.get(source, key);\n if (typeof member === \"object\" && member !== null) {\n const raw = RAW.get(member);\n if (raw !== undefined) member = raw;\n else if (isWrappable(member)) {\n const known = copies.has(member);\n member = copyOf(member);\n if (!known) queue.push(Reflect.get(source, key) as object);\n }\n }\n Object.defineProperty(target, key, {\n value: member,\n enumerable: true,\n writable: true,\n configurable: true,\n });\n }\n }\n return rootCopy;\n}\n\n/** Reads an own or inherited property without tracking and without invoking proxies. */\nexport function readRaw(target: object, key: string): unknown {\n return Reflect.get(target, key);\n}\n\n/** Returns the tracking state of `raw`, creating an empty one on first use. */\nexport function nodeOf(raw: object): NodeState {\n let node = NODES.get(raw);\n if (node === undefined) {\n node = { signals: null, keys: null, proxy: null };\n NODES.set(raw, node);\n }\n return node;\n}\n\n/** The map size at which the first sweep of unobserved key signals runs. */\nconst SWEEP_AT = 256;\n\nfunction signalFor(node: NodeState, key: string): SignalNode<number> {\n let signals = node.signals;\n if (signals === null) {\n signals = new Map();\n node.signals = signals;\n }\n let signal = signals.get(key);\n if (signal === undefined) {\n // Reading many transient keys (`store.byId[id]` with churning ids) would keep one signal per key\n // for the life of the store. The sweep runs when the map reaches a power of two from SWEEP_AT on,\n // so its cost is amortized O(1) per new key, and the map stays within about twice the number of\n // keys that are observed at that moment (plus SWEEP_AT).\n const size = signals.size;\n if (size >= SWEEP_AT && (size & (size - 1)) === 0) {\n // Safe at any time: a signal carries no value, and the next read of its key makes a fresh one.\n for (const [other, node] of signals) {\n if ((node.observers?.length ?? 0) === 0) signals.delete(other);\n }\n }\n signal = new SignalNode(0, false);\n signals.set(key, signal);\n }\n return signal;\n}\n\n/** Subscribes the running computation (if any) to one property of the object. */\nexport function trackProperty(node: NodeState, key: string): void {\n if (!isTracking()) return;\n track(signalFor(node, key));\n}\n\n/** Subscribes the running computation (if any) to the key set of the object. */\nexport function trackKeys(node: NodeState): void {\n if (!isTracking()) return;\n if (node.keys === null) node.keys = new SignalNode(0, false);\n track(node.keys);\n}\n\n/**\n * Notifies the observers of one signal. The same engine steps as a signal write: mark the\n * observers dirty, then request a flush (which the surrounding batch defers).\n */\nfunction notify(signal: SignalNode<number> | null | undefined): void {\n if (signal === undefined || signal === null) return;\n notifySource(signal);\n}\n\nfunction isIndexKey(key: string): boolean {\n const index = Number(key);\n return Number.isInteger(index) && index >= 0 && String(index) === key;\n}\n\n/** Notifies the index signals of an array at or beyond `from` (used when the array shrinks). */\nfunction notifyIndicesFrom(node: NodeState, from: number): void {\n const signals = node.signals;\n if (signals === null) return;\n for (const [key, signal] of signals) {\n if (isIndexKey(key) && Number(key) >= from) notify(signal);\n }\n}\n\n/**\n * Writes one property of a raw object and notifies exactly what changed: the property's signal,\n * the key set when a property appears, and the length when an array's length moves. An equal\n * value (Object.is) writes nothing. Returns whether anything changed.\n */\nexport function writeRaw(target: object, key: string, value: unknown): boolean {\n if (isReservedKey(key)) {\n throw new TypeError(\n __DEV__\n ? `ShadowStore: \"${key}\" cannot be written; it is a reserved key`\n : \"SHADOW_STORE_RESERVED_KEY\",\n );\n }\n value = unwrapDeep(value);\n const array = Array.isArray(target);\n const had = Object.hasOwn(target, key);\n if (had && Object.is(readRaw(target, key), value)) return false;\n const before = array ? (target as unknown[]).length : 0;\n if (!Reflect.set(target, key, value)) {\n throw new TypeError(\n __DEV__\n ? `ShadowStore: property \"${key}\" is read-only and cannot be written`\n : \"SHADOW_STORE_PROP_READ_ONLY\",\n );\n }\n const node = NODES.get(target);\n if (node === undefined) return true;\n notify(node.signals?.get(key));\n if (!had) notify(node.keys);\n if (array) {\n const after = (target as unknown[]).length;\n if (after !== before) {\n notify(node.signals?.get(\"length\"));\n notify(node.keys);\n if (after < before) notifyIndicesFrom(node, after);\n }\n }\n return true;\n}\n\n/** Deletes one own property of a raw object and notifies its signal and the key set. */\nexport function deleteRaw(target: object, key: string): boolean {\n if (isReservedKey(key)) {\n throw new TypeError(\n __DEV__\n ? `ShadowStore: \"${key}\" cannot be deleted; it is a reserved key`\n : \"SHADOW_STORE_RESERVED_DELETE\",\n );\n }\n if (!Object.hasOwn(target, key)) return true;\n if (!Reflect.deleteProperty(target, key)) {\n throw new TypeError(\n __DEV__ ? `ShadowStore: property \"${key}\" cannot be deleted` : \"SHADOW_STORE_DELETE\",\n );\n }\n const node = NODES.get(target);\n if (node === undefined) return true;\n notify(node.signals?.get(key));\n notify(node.keys);\n return true;\n}\n"],"mappings":";;;;AAGA,MAAM,gCAAqC,IAAI,IAAI;CAAC;CAAa;CAAe;AAAW,CAAC;;AAoB5F,MAAa,wBAAoC,IAAI,QAAQ;;AAG7D,MAAa,sBAA+B,IAAI,QAAQ;;AAGxD,SAAgB,cAAc,KAAsB;CAClD,OAAO,cAAc,IAAI,GAAG;AAC9B;;AAGA,SAAgB,YAAY,OAAiC;CAC3D,IAAI,OAAO,UAAU,YAAY,UAAU,MAAM,OAAO;CACxD,IAAI,MAAM,QAAQ,KAAK,GAAG,OAAO;CACjC,IAAI,UAAU,OAAO,WAAW,OAAO;CACvC,MAAM,YAAqB,OAAO,eAAe,KAAK;CACtD,OAAO,cAAc,OAAO,aAAa,cAAc;AACzD;;AAGA,SAAgB,YAAY,OAAyB;CACnD,IAAI,OAAO,UAAU,YAAY,UAAU,MAAM,OAAO;CACxD,OAAO,IAAI,IAAI,KAAK,KAAK;AAC3B;;AAGA,SAAS,cAAc,MAAuB;CAC5C,MAAM,uBAAO,IAAI,IAAY,CAAC,IAAI,CAAC;CACnC,MAAM,QAAkB,CAAC,IAAI;CAC7B,OAAO,MAAM,SAAS,GAAG;EACvB,MAAM,YAAY,MAAM,IAAI;EAC5B,KAAK,MAAM,OAAO,OAAO,KAAK,SAAS,GAAG;GACxC,MAAM,SAAkB,QAAQ,IAAI,WAAW,GAAG;GAClD,IAAI,OAAO,WAAW,YAAY,WAAW,MAAM;GACnD,IAAI,IAAI,IAAI,MAAM,GAAG,OAAO;GAC5B,IAAI,YAAY,MAAM,KAAK,CAAC,KAAK,IAAI,MAAM,GAAG;IAC5C,KAAK,IAAI,MAAM;IACf,MAAM,KAAK,MAAM;GACnB;EACF;CACF;CACA,OAAO;AACT;;;;;;;AAQA,SAAgB,WAAW,OAAyB;CAClD,MAAM,QAAQ,YAAY,KAAK;CAC/B,IAAI,UAAU,SAAS,CAAC,YAAY,KAAK,KAAK,CAAC,cAAc,KAAK,GAAG,OAAO;CAC5E,MAAM,yBAAS,IAAI,IAAoB;CACvC,MAAM,UAAU,WAA2B;EACzC,MAAM,WAAW,OAAO,IAAI,MAAM;EAClC,IAAI,aAAa,KAAA,GAAW,OAAO;EACnC,MAAM,OAAe,MAAM,QAAQ,MAAM,IAAI,CAAC,IAAI,OAAO,OAAO,OAAO,eAAe,MAAM,CAAC;EAC7F,OAAO,IAAI,QAAQ,IAAI;EACvB,OAAO;CACT;CACA,MAAM,WAAW,OAAO,KAAK;CAC7B,MAAM,QAAkB,CAAC,KAAK;CAC9B,KAAK,IAAI,OAAO,GAAG,OAAO,MAAM,QAAQ,QAAQ,GAAG;EACjD,MAAM,SAAS,MAAM;EACrB,MAAM,SAAS,OAAO,IAAI,MAAM;EAChC,KAAK,MAAM,OAAO,OAAO,KAAK,MAAM,GAAG;GACrC,IAAI,SAAkB,QAAQ,IAAI,QAAQ,GAAG;GAC7C,IAAI,OAAO,WAAW,YAAY,WAAW,MAAM;IACjD,MAAM,MAAM,IAAI,IAAI,MAAM;IAC1B,IAAI,QAAQ,KAAA,GAAW,SAAS;SAC3B,IAAI,YAAY,MAAM,GAAG;KAC5B,MAAM,QAAQ,OAAO,IAAI,MAAM;KAC/B,SAAS,OAAO,MAAM;KACtB,IAAI,CAAC,OAAO,MAAM,KAAK,QAAQ,IAAI,QAAQ,GAAG,CAAW;IAC3D;GACF;GACA,OAAO,eAAe,QAAQ,KAAK;IACjC,OAAO;IACP,YAAY;IACZ,UAAU;IACV,cAAc;GAChB,CAAC;EACH;CACF;CACA,OAAO;AACT;;AAGA,SAAgB,QAAQ,QAAgB,KAAsB;CAC5D,OAAO,QAAQ,IAAI,QAAQ,GAAG;AAChC;;AAGA,SAAgB,OAAO,KAAwB;CAC7C,IAAI,OAAO,MAAM,IAAI,GAAG;CACxB,IAAI,SAAS,KAAA,GAAW;EACtB,OAAO;GAAE,SAAS;GAAM,MAAM;GAAM,OAAO;EAAK;EAChD,MAAM,IAAI,KAAK,IAAI;CACrB;CACA,OAAO;AACT;;AAGA,MAAM,WAAW;AAEjB,SAAS,UAAU,MAAiB,KAAiC;CACnE,IAAI,UAAU,KAAK;CACnB,IAAI,YAAY,MAAM;EACpB,0BAAU,IAAI,IAAI;EAClB,KAAK,UAAU;CACjB;CACA,IAAI,SAAS,QAAQ,IAAI,GAAG;CAC5B,IAAI,WAAW,KAAA,GAAW;EAKxB,MAAM,OAAO,QAAQ;EACrB,IAAI,QAAQ,aAAa,OAAQ,OAAO,OAAQ,GAEzC;QAAA,MAAM,CAAC,OAAO,SAAS,SAC1B,KAAK,KAAK,WAAW,UAAU,OAAO,GAAG,QAAQ,OAAO,KAAK;EAAA;EAGjE,SAAS,IAAIA,OAAW,GAAG,KAAK;EAChC,QAAQ,IAAI,KAAK,MAAM;CACzB;CACA,OAAO;AACT;;AAGA,SAAgB,cAAc,MAAiB,KAAmB;CAChE,IAAI,CAAC,WAAW,GAAG;CACnB,MAAM,UAAU,MAAM,GAAG,CAAC;AAC5B;;AAGA,SAAgB,UAAU,MAAuB;CAC/C,IAAI,CAAC,WAAW,GAAG;CACnB,IAAI,KAAK,SAAS,MAAM,KAAK,OAAO,IAAIA,OAAW,GAAG,KAAK;CAC3D,MAAM,KAAK,IAAI;AACjB;;;;;AAMA,SAAS,OAAO,QAAqD;CACnE,IAAI,WAAW,KAAA,KAAa,WAAW,MAAM;CAC7C,SAAa,MAAM;AACrB;AAEA,SAAS,WAAW,KAAsB;CACxC,MAAM,QAAQ,OAAO,GAAG;CACxB,OAAO,OAAO,UAAU,KAAK,KAAK,SAAS,KAAK,OAAO,KAAK,MAAM;AACpE;;AAGA,SAAS,kBAAkB,MAAiB,MAAoB;CAC9D,MAAM,UAAU,KAAK;CACrB,IAAI,YAAY,MAAM;CACtB,KAAK,MAAM,CAAC,KAAK,WAAW,SAC1B,IAAI,WAAW,GAAG,KAAK,OAAO,GAAG,KAAK,MAAM,OAAO,MAAM;AAE7D;;;;;;AAOA,SAAgB,SAAS,QAAgB,KAAa,OAAyB;CAC7E,IAAI,cAAc,GAAG,GACnB,MAAM,IAAI,UAEJ,iBAAiB,IAAI,0CAE3B;CAEF,QAAQ,WAAW,KAAK;CACxB,MAAM,QAAQ,MAAM,QAAQ,MAAM;CAClC,MAAM,MAAM,OAAO,OAAO,QAAQ,GAAG;CACrC,IAAI,OAAO,OAAO,GAAG,QAAQ,QAAQ,GAAG,GAAG,KAAK,GAAG,OAAO;CAC1D,MAAM,SAAS,QAAS,OAAqB,SAAS;CACtD,IAAI,CAAC,QAAQ,IAAI,QAAQ,KAAK,KAAK,GACjC,MAAM,IAAI,UAEJ,0BAA0B,IAAI,qCAEpC;CAEF,MAAM,OAAO,MAAM,IAAI,MAAM;CAC7B,IAAI,SAAS,KAAA,GAAW,OAAO;CAC/B,OAAO,KAAK,SAAS,IAAI,GAAG,CAAC;CAC7B,IAAI,CAAC,KAAK,OAAO,KAAK,IAAI;CAC1B,IAAI,OAAO;EACT,MAAM,QAAS,OAAqB;EACpC,IAAI,UAAU,QAAQ;GACpB,OAAO,KAAK,SAAS,IAAI,QAAQ,CAAC;GAClC,OAAO,KAAK,IAAI;GAChB,IAAI,QAAQ,QAAQ,kBAAkB,MAAM,KAAK;EACnD;CACF;CACA,OAAO;AACT;;AAGA,SAAgB,UAAU,QAAgB,KAAsB;CAC9D,IAAI,cAAc,GAAG,GACnB,MAAM,IAAI,UAEJ,iBAAiB,IAAI,0CAE3B;CAEF,IAAI,CAAC,OAAO,OAAO,QAAQ,GAAG,GAAG,OAAO;CACxC,IAAI,CAAC,QAAQ,eAAe,QAAQ,GAAG,GACrC,MAAM,IAAI,UACE,0BAA0B,IAAI,oBAC1C;CAEF,MAAM,OAAO,MAAM,IAAI,MAAM;CAC7B,IAAI,SAAS,KAAA,GAAW,OAAO;CAC/B,OAAO,KAAK,SAAS,IAAI,GAAG,CAAC;CAC7B,OAAO,KAAK,IAAI;CAChB,OAAO;AACT"}
@@ -27,6 +27,11 @@ export interface StoreOptions {
27
27
  * be `null` or another type (`Todo[] | null`) is a single value too: it is replaced as a whole, and
28
28
  * plain data assigned to it is read through the same fine-grained proxies a store uses.
29
29
  *
30
+ * A property read in a tracked context gets a small notifier. Reading many transient keys
31
+ * (`store.byId[id]` with churning ids) does not grow it for the life of the store: once an object
32
+ * has collected a few hundred notifiers, the ones nothing observes any more are dropped, and a key
33
+ * read again gets a fresh one that reflects the current value.
34
+ *
30
35
  * @param initial Initial value or plain data. Plain objects and arrays are wrapped in place, not
31
36
  * copied.
32
37
  * @param options `name` labels the store in messages. Undefined uses the default (unnamed).
@@ -1 +1 @@
1
- {"version":3,"file":"use-store.js","names":[],"sources":["../../../src/store/use-store.ts"],"sourcesContent":["import {\n currentOwner,\n DEVTOOLS_EVENT,\n devtoolsReport,\n group,\n isComputingMemo,\n ShadowError,\n} from \"../extend\";\nimport { untrack } from \"../ownership\";\nimport { useSignal } from \"../signal\";\nimport { isReservedKey, isWrappable, unwrapValue } from \"./nodes\";\nimport { draftOf, readProxyOf, Transaction } from \"./proxies\";\nimport { snapshot } from \"./read\";\nimport { applyReconcile, reconcile, specOf } from \"./reconcile\";\nimport type { MixedInitial, NotMixed, SetStore, Store, StoreResult } from \"./types\";\n\n/**\n * Options of {@link useStore}.\n * @since 1.0.0\n */\nexport interface StoreOptions {\n /**\n * Label shown in error messages and by devtools.\n * @default undefined (the store is unnamed)\n */\n name?: string;\n}\n\nfunction isPlainObject(value: unknown): value is Record<string, unknown> {\n if (typeof value !== \"object\" || value === null || Array.isArray(value)) return false;\n const prototype = Object.getPrototypeOf(value);\n return prototype === Object.prototype || prototype === null;\n}\n\nfunction rangeKeys(range: { from?: number; to?: number; by?: number }, length: number): number[] {\n const from = range.from ?? 0;\n const to = range.to ?? length - 1;\n const by = range.by ?? 1;\n if (!Number.isFinite(by) || by === 0)\n throw new TypeError(\n __DEV__ ? \"ShadowStore: a range needs a non-zero `by`\" : \"SHADOW_STORE_RANGE\",\n );\n const keys: number[] = [];\n for (let i = from; by > 0 ? i <= to : i >= to; i += by) {\n keys.push(i);\n if (keys.length > length + 1) break;\n }\n return keys;\n}\n\n/** The keys one path step addresses on `target` (a draft). */\nfunction stepKeys(target: object, step: unknown, label: string): Array<string | number> {\n const keys: Array<string | number> = [];\n if (Array.isArray(target)) {\n if (typeof step === \"number\") keys.push(step);\n else if (typeof step === \"function\") {\n const filter = step as (item: unknown, index: number) => boolean;\n for (let i = 0; i < target.length; i += 1) if (filter(target[i], i)) keys.push(i);\n } else if (Array.isArray(step)) keys.push(...(step as number[]));\n else if (typeof step === \"object\" && step !== null)\n keys.push(...rangeKeys(step, target.length));\n else\n throw new TypeError(\n __DEV__ ? `ShadowStore${label}: bad path step for an array` : \"SHADOW_STORE_PATH_ARRAY\",\n );\n } else if (typeof step === \"string\" || typeof step === \"number\") {\n keys.push(step);\n } else if (Array.isArray(step)) {\n keys.push(...(step as Array<string | number>));\n } else {\n throw new TypeError(\n __DEV__ ? `ShadowStore${label}: bad path step for an object` : \"SHADOW_STORE_PATH_OBJECT\",\n );\n }\n for (const key of keys) {\n if (typeof key === \"string\" && isReservedKey(key)) {\n throw new TypeError(\n __DEV__\n ? `ShadowStore${label}: the key \"${key}\" cannot be used in a path`\n : \"SHADOW_STORE_PATH_KEY\",\n );\n }\n }\n return keys;\n}\n\n/** Writes `value` (or the updater's result) at the end of a path, merging plain objects. */\nfunction applyPath(root: object, path: unknown[], label: string): void {\n const value = path[path.length - 1];\n const steps = path.slice(0, -1);\n const walk = (target: object, depth: number): void => {\n for (const key of stepKeys(target, steps[depth], label)) {\n const holder = target as Record<string | number, unknown>;\n if (depth === steps.length - 1) {\n const previous = holder[key];\n const spec = typeof value === \"function\" ? specOf(value) : undefined;\n if (spec !== undefined) {\n // reconcile(...) at a path diffs only that sub-tree.\n if (isWrappable(previous)) applyReconcile(unwrapValue(previous) as object, spec, label);\n else holder[key] = spec.next;\n continue;\n }\n const next =\n typeof value === \"function\" ? (value as (p: unknown) => unknown)(previous) : value;\n if (isPlainObject(next) && isWrappable(previous) && !Array.isArray(previous)) {\n mergeInto(previous as Record<string, unknown>, next, label);\n } else {\n holder[key] = next;\n }\n } else {\n const child = holder[key];\n if (!isWrappable(child)) {\n throw new TypeError(\n __DEV__\n ? `ShadowStore${label}: the path goes through a value that is not an object`\n : \"SHADOW_STORE_PATH_VALUE\",\n );\n }\n walk(child, depth + 1);\n }\n }\n };\n walk(root, 0);\n}\n\nfunction mergeInto(\n target: Record<string, unknown>,\n source: Record<string, unknown>,\n label: string,\n): void {\n for (const key of Object.keys(source)) {\n if (isReservedKey(key)) {\n throw new TypeError(\n __DEV__\n ? `ShadowStore${label}: the key \"${key}\" cannot be assigned`\n : \"SHADOW_STORE_ASSIGN_KEY\",\n );\n }\n target[key] = source[key];\n }\n}\n\n/**\n * Devtools handles of the stores, by store root. Dev builds only: the WeakMap is unused (and dropped)\n * in production, where `__DEV__` is false.\n */\nconst storeHandles = /* @__PURE__ */ new WeakMap<object, Array<{ readonly name: string }>>();\n\nfunction createDeepStore<T extends object>(initial: T, label: string): [Store<T>, SetStore<T>] {\n const root = unwrapValue(initial) as object;\n const store = readProxyOf(root) as Store<T>;\n\n // One untyped entry point for every form of update. It is assignable to SetStore<T> because its\n // parameters accept anything: the typed overloads are the public contract, and the devtools\n // path setter below calls this function directly with a path it built at run time.\n const apply = (...args: unknown[]): void => {\n if (__DEV__ && isComputingMemo()) throw new ShadowError(\"WRITE_IN_MEMO\");\n if (args.length === 0)\n throw new TypeError(\n __DEV__ ? `ShadowStore${label}: setStore() needs an argument` : \"SHADOW_STORE_NO_ARGUMENT\",\n );\n const first = args[0];\n group(() =>\n untrack(() => {\n if (args.length > 1) {\n const tx = new Transaction(label);\n try {\n applyPath(draftOf(root, tx), args, label);\n } finally {\n tx.open = false;\n }\n return;\n }\n if (typeof first === \"function\") {\n const spec = specOf(first);\n if (spec !== undefined) {\n applyReconcile(root, spec, label);\n return;\n }\n const tx = new Transaction(label);\n let result: unknown;\n try {\n result = (first as (draft: unknown) => unknown)(draftOf(root, tx));\n } finally {\n tx.open = false;\n }\n if (result !== undefined) replaceWith(root, result, label);\n return;\n }\n replaceWith(root, first, label);\n }),\n );\n };\n const setStore: SetStore<T> = apply;\n if (__DEV__) {\n const handle = {\n name: label === \"\" ? \"store\" : label.replace(/^ \\((.*)\\)$/, \"$1\"),\n snapshot: () => snapshot(store),\n set: (path: readonly (string | number)[], value: unknown) => {\n apply(...path, value);\n },\n };\n // Devtools hold the handle weakly, so the handle must stay reachable exactly as long as the store.\n // The store's proxy and its setter both reach `root`, and a WeakMap value lives as long as its key.\n // A root shared by two stores keeps both handles.\n const anchored = storeHandles.get(root);\n if (anchored === undefined) storeHandles.set(root, [handle]);\n else anchored.push(handle);\n devtoolsReport(DEVTOOLS_EVENT.STORE_CREATED, handle, currentOwner());\n }\n return [store, setStore];\n}\n\n/** `setStore(value)`: an array replaces (diffed in place), a plain object merges its keys. */\nfunction replaceWith(root: object, value: unknown, label: string): void {\n if (Array.isArray(root)) {\n if (!Array.isArray(value)) {\n throw new TypeError(\n __DEV__\n ? `ShadowStore${label}: an array store is updated with an array or a function`\n : \"SHADOW_STORE_ARRAY_UPDATE\",\n );\n }\n const spec = specOf(reconcile(value));\n if (spec !== undefined) applyReconcile(root, spec, label);\n return;\n }\n if (!isPlainObject(value)) {\n throw new TypeError(\n __DEV__\n ? `ShadowStore${label}: setStore() expects an object, a function or a reconcile() result`\n : \"SHADOW_STORE_UPDATE_ARGUMENT\",\n );\n }\n const tx = new Transaction(label);\n try {\n mergeInto(draftOf(root, tx) as Record<string, unknown>, value, label);\n } finally {\n tx.open = false;\n }\n}\n\n/**\n * The state hook. Pass a single value for a reactive cell, or plain data for a deep store:\n *\n * ```ts\n * const [count, setCount] = useStore(0); // count() / setCount(n => n + 1)\n * const [todos, setTodos] = useStore({ items: [] as Todo[] });\n * todos.items[0]?.done; // tracks exactly this property\n * setTodos((draft) => { draft.items.push(todo); }); // notifies only what changed\n * setTodos(\"items\", (t) => t.id === 3, \"done\", true); // path form\n * ```\n *\n * Reads inside effects, memos and JSX subscribe to the exact value or property read; writes notify\n * exactly the readers of what changed, in one batch. A store wraps plain objects and arrays in\n * place; class instances, `Date`, `Map`, `Set` and functions are single values. A value that may\n * be `null` or another type (`Todo[] | null`) is a single value too: it is replaced as a whole, and\n * plain data assigned to it is read through the same fine-grained proxies a store uses.\n *\n * @param initial Initial value or plain data. Plain objects and arrays are wrapped in place, not\n * copied.\n * @param options `name` labels the store in messages. Undefined uses the default (unnamed).\n * @returns `[read, write]` for a single value, `[store, setStore]` for plain data.\n * @throws ShadowError `WRITE_IN_MEMO` from the setter, in development builds only, when it is called\n * while a {@link useMemo} computation runs. `setStore` throws TypeError (production messages\n * `SHADOW_STORE_*`) for an update it cannot apply: no argument, a bad path step, a path through a\n * value that is not an object, a reserved key such as `__proto__`, or a non-array value for an\n * array store. Writing to the store view itself throws TypeError (`SHADOW_STORE_READ_ONLY`).\n * @example\n * import { useStore } from \"@shadow-js/core\";\n *\n * interface Todo { id: number; title: string; done: boolean }\n *\n * const [count, setCount] = useStore(0);\n * const [todos, setTodos] = useStore({ items: [] as Todo[] });\n * setCount((n) => n + 1);\n * setTodos((draft) => {\n * draft.items.push({ id: 1, title: \"Write docs\", done: false });\n * });\n * setTodos(\"items\", (todo) => todo.id === 1, \"done\", true);\n * console.log(count(), todos.items[0]?.done); // 1 true\n * @see useSignal\n * @see reconcile\n * @since 1.0.0\n */\nexport function useStore<T extends NotMixed<T>>(initial: T, options?: StoreOptions): StoreResult<T>;\nexport function useStore<T>(initial: MixedInitial<T>, options?: StoreOptions): StoreResult<T>;\nexport function useStore(initial: unknown, options?: StoreOptions): unknown {\n const label = options?.name === undefined ? \"\" : ` (${options.name})`;\n const root = unwrapValue(initial);\n if (isWrappable(root)) return createDeepStore(root, label);\n // A single value, which may be plain data later (`Todo[] | null`): objects and arrays that are\n // assigned are wrapped in read proxies, so `todos()?.[0]?.done` tracks exactly what it reads.\n const [read, write] = useSignal<unknown>(\n wrapCell(initial),\n options?.name === undefined ? undefined : { name: options.name },\n );\n const set = (next: unknown): unknown =>\n write(\n typeof next === \"function\"\n ? (previous: unknown) => wrapCell((next as (previous: unknown) => unknown)(previous))\n : wrapCell(next),\n );\n return [read, set];\n}\n\n/** The value a single-value cell holds: plain data becomes its (stable) read proxy. */\nfunction wrapCell(value: unknown): unknown {\n const raw = unwrapValue(value);\n return isWrappable(raw) ? readProxyOf(raw) : value;\n}\n"],"mappings":";;;;;;;;;;;AA4BA,SAAS,cAAc,OAAkD;CACvE,IAAI,OAAO,UAAU,YAAY,UAAU,QAAQ,MAAM,QAAQ,KAAK,GAAG,OAAO;CAChF,MAAM,YAAY,OAAO,eAAe,KAAK;CAC7C,OAAO,cAAc,OAAO,aAAa,cAAc;AACzD;AAEA,SAAS,UAAU,OAAoD,QAA0B;CAC/F,MAAM,OAAO,MAAM,QAAQ;CAC3B,MAAM,KAAK,MAAM,MAAM,SAAS;CAChC,MAAM,KAAK,MAAM,MAAM;CACvB,IAAI,CAAC,OAAO,SAAS,EAAE,KAAK,OAAO,GACjC,MAAM,IAAI,UACE,4CACZ;CACF,MAAM,OAAiB,CAAC;CACxB,KAAK,IAAI,IAAI,MAAM,KAAK,IAAI,KAAK,KAAK,KAAK,IAAI,KAAK,IAAI;EACtD,KAAK,KAAK,CAAC;EACX,IAAI,KAAK,SAAS,SAAS,GAAG;CAChC;CACA,OAAO;AACT;;AAGA,SAAS,SAAS,QAAgB,MAAe,OAAuC;CACtF,MAAM,OAA+B,CAAC;CACtC,IAAI,MAAM,QAAQ,MAAM,GAAG;EACzB,IAAI,OAAO,SAAS,UAAU,KAAK,KAAK,IAAI;OACvC,IAAI,OAAO,SAAS,YAAY;GACnC,MAAM,SAAS;GACf,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK,GAAG,IAAI,OAAO,OAAO,IAAI,CAAC,GAAG,KAAK,KAAK,CAAC;EAClF,OAAO,IAAI,MAAM,QAAQ,IAAI,GAAG,KAAK,KAAK,GAAI,IAAiB;OAC1D,IAAI,OAAO,SAAS,YAAY,SAAS,MAC5C,KAAK,KAAK,GAAG,UAAU,MAAM,OAAO,MAAM,CAAC;OAE3C,MAAM,IAAI,UACE,cAAc,MAAM,6BAChC;CACJ,OAAO,IAAI,OAAO,SAAS,YAAY,OAAO,SAAS,UACrD,KAAK,KAAK,IAAI;MACT,IAAI,MAAM,QAAQ,IAAI,GAC3B,KAAK,KAAK,GAAI,IAA+B;MAE7C,MAAM,IAAI,UACE,cAAc,MAAM,8BAChC;CAEF,KAAK,MAAM,OAAO,MAChB,IAAI,OAAO,QAAQ,YAAY,cAAc,GAAG,GAC9C,MAAM,IAAI,UAEJ,cAAc,MAAM,aAAa,IAAI,2BAE3C;CAGJ,OAAO;AACT;;AAGA,SAAS,UAAU,MAAc,MAAiB,OAAqB;CACrE,MAAM,QAAQ,KAAK,KAAK,SAAS;CACjC,MAAM,QAAQ,KAAK,MAAM,GAAG,EAAE;CAC9B,MAAM,QAAQ,QAAgB,UAAwB;EACpD,KAAK,MAAM,OAAO,SAAS,QAAQ,MAAM,QAAQ,KAAK,GAAG;GACvD,MAAM,SAAS;GACf,IAAI,UAAU,MAAM,SAAS,GAAG;IAC9B,MAAM,WAAW,OAAO;IACxB,MAAM,OAAO,OAAO,UAAU,aAAa,OAAO,KAAK,IAAI,KAAA;IAC3D,IAAI,SAAS,KAAA,GAAW;KAEtB,IAAI,YAAY,QAAQ,GAAG,eAAe,YAAY,QAAQ,GAAa,MAAM,KAAK;UACjF,OAAO,OAAO,KAAK;KACxB;IACF;IACA,MAAM,OACJ,OAAO,UAAU,aAAc,MAAkC,QAAQ,IAAI;IAC/E,IAAI,cAAc,IAAI,KAAK,YAAY,QAAQ,KAAK,CAAC,MAAM,QAAQ,QAAQ,GACzE,UAAU,UAAqC,MAAM,KAAK;SAE1D,OAAO,OAAO;GAElB,OAAO;IACL,MAAM,QAAQ,OAAO;IACrB,IAAI,CAAC,YAAY,KAAK,GACpB,MAAM,IAAI,UAEJ,cAAc,MAAM,sDAE1B;IAEF,KAAK,OAAO,QAAQ,CAAC;GACvB;EACF;CACF;CACA,KAAK,MAAM,CAAC;AACd;AAEA,SAAS,UACP,QACA,QACA,OACM;CACN,KAAK,MAAM,OAAO,OAAO,KAAK,MAAM,GAAG;EACrC,IAAI,cAAc,GAAG,GACnB,MAAM,IAAI,UAEJ,cAAc,MAAM,aAAa,IAAI,qBAE3C;EAEF,OAAO,OAAO,OAAO;CACvB;AACF;;;;;AAMA,MAAM,+BAA+B,IAAI,QAAkD;AAE3F,SAAS,gBAAkC,SAAY,OAAwC;CAC7F,MAAM,OAAO,YAAY,OAAO;CAChC,MAAM,QAAQ,YAAY,IAAI;CAK9B,MAAM,SAAS,GAAG,SAA0B;EAC1C,IAAe,gBAAgB,GAAG,MAAM,IAAI,YAAY,eAAe;EACvE,IAAI,KAAK,WAAW,GAClB,MAAM,IAAI,UACE,cAAc,MAAM,+BAChC;EACF,MAAM,QAAQ,KAAK;EACnB,YACE,cAAc;GACZ,IAAI,KAAK,SAAS,GAAG;IACnB,MAAM,KAAK,IAAI,YAAY,KAAK;IAChC,IAAI;KACF,UAAU,QAAQ,MAAM,EAAE,GAAG,MAAM,KAAK;IAC1C,UAAU;KACR,GAAG,OAAO;IACZ;IACA;GACF;GACA,IAAI,OAAO,UAAU,YAAY;IAC/B,MAAM,OAAO,OAAO,KAAK;IACzB,IAAI,SAAS,KAAA,GAAW;KACtB,eAAe,MAAM,MAAM,KAAK;KAChC;IACF;IACA,MAAM,KAAK,IAAI,YAAY,KAAK;IAChC,IAAI;IACJ,IAAI;KACF,SAAU,MAAsC,QAAQ,MAAM,EAAE,CAAC;IACnE,UAAU;KACR,GAAG,OAAO;IACZ;IACA,IAAI,WAAW,KAAA,GAAW,YAAY,MAAM,QAAQ,KAAK;IACzD;GACF;GACA,YAAY,MAAM,OAAO,KAAK;EAChC,CAAC,CACH;CACF;CACA,MAAM,WAAwB;CACjB;EACX,MAAM,SAAS;GACb,MAAM,UAAU,KAAK,UAAU,MAAM,QAAQ,eAAe,IAAI;GAChE,gBAAgB,SAAS,KAAK;GAC9B,MAAM,MAAoC,UAAmB;IAC3D,MAAM,GAAG,MAAM,KAAK;GACtB;EACF;EAIA,MAAM,WAAW,aAAa,IAAI,IAAI;EACtC,IAAI,aAAa,KAAA,GAAW,aAAa,IAAI,MAAM,CAAC,MAAM,CAAC;OACtD,SAAS,KAAK,MAAM;EACzB,OAAe,eAAe,eAAe,QAAQ,aAAa,CAAC;CACrE;CACA,OAAO,CAAC,OAAO,QAAQ;AACzB;;AAGA,SAAS,YAAY,MAAc,OAAgB,OAAqB;CACtE,IAAI,MAAM,QAAQ,IAAI,GAAG;EACvB,IAAI,CAAC,MAAM,QAAQ,KAAK,GACtB,MAAM,IAAI,UAEJ,cAAc,MAAM,wDAE1B;EAEF,MAAM,OAAO,OAAO,UAAU,KAAK,CAAC;EACpC,IAAI,SAAS,KAAA,GAAW,eAAe,MAAM,MAAM,KAAK;EACxD;CACF;CACA,IAAI,CAAC,cAAc,KAAK,GACtB,MAAM,IAAI,UAEJ,cAAc,MAAM,mEAE1B;CAEF,MAAM,KAAK,IAAI,YAAY,KAAK;CAChC,IAAI;EACF,UAAU,QAAQ,MAAM,EAAE,GAA8B,OAAO,KAAK;CACtE,UAAU;EACR,GAAG,OAAO;CACZ;AACF;AA+CA,SAAgB,SAAS,SAAkB,SAAiC;CAC1E,MAAM,QAAQ,SAAS,SAAS,KAAA,IAAY,KAAK,KAAK,QAAQ,KAAK;CACnE,MAAM,OAAO,YAAY,OAAO;CAChC,IAAI,YAAY,IAAI,GAAG,OAAO,gBAAgB,MAAM,KAAK;CAGzD,MAAM,CAAC,MAAM,SAAS,UACpB,SAAS,OAAO,GAChB,SAAS,SAAS,KAAA,IAAY,KAAA,IAAY,EAAE,MAAM,QAAQ,KAAK,CACjE;CACA,MAAM,OAAO,SACX,MACE,OAAO,SAAS,cACX,aAAsB,SAAU,KAAwC,QAAQ,CAAC,IAClF,SAAS,IAAI,CACnB;CACF,OAAO,CAAC,MAAM,GAAG;AACnB;;AAGA,SAAS,SAAS,OAAyB;CACzC,MAAM,MAAM,YAAY,KAAK;CAC7B,OAAO,YAAY,GAAG,IAAI,YAAY,GAAG,IAAI;AAC/C"}
1
+ {"version":3,"file":"use-store.js","names":[],"sources":["../../../src/store/use-store.ts"],"sourcesContent":["import {\n currentOwner,\n DEVTOOLS_EVENT,\n devtoolsReport,\n group,\n isComputingMemo,\n ShadowError,\n} from \"../extend\";\nimport { untrack } from \"../ownership\";\nimport { useSignal } from \"../signal\";\nimport { isReservedKey, isWrappable, unwrapValue } from \"./nodes\";\nimport { draftOf, readProxyOf, Transaction } from \"./proxies\";\nimport { snapshot } from \"./read\";\nimport { applyReconcile, reconcile, specOf } from \"./reconcile\";\nimport type { MixedInitial, NotMixed, SetStore, Store, StoreResult } from \"./types\";\n\n/**\n * Options of {@link useStore}.\n * @since 1.0.0\n */\nexport interface StoreOptions {\n /**\n * Label shown in error messages and by devtools.\n * @default undefined (the store is unnamed)\n */\n name?: string;\n}\n\nfunction isPlainObject(value: unknown): value is Record<string, unknown> {\n if (typeof value !== \"object\" || value === null || Array.isArray(value)) return false;\n const prototype = Object.getPrototypeOf(value);\n return prototype === Object.prototype || prototype === null;\n}\n\nfunction rangeKeys(range: { from?: number; to?: number; by?: number }, length: number): number[] {\n const from = range.from ?? 0;\n const to = range.to ?? length - 1;\n const by = range.by ?? 1;\n if (!Number.isFinite(by) || by === 0)\n throw new TypeError(\n __DEV__ ? \"ShadowStore: a range needs a non-zero `by`\" : \"SHADOW_STORE_RANGE\",\n );\n const keys: number[] = [];\n for (let i = from; by > 0 ? i <= to : i >= to; i += by) {\n keys.push(i);\n if (keys.length > length + 1) break;\n }\n return keys;\n}\n\n/** The keys one path step addresses on `target` (a draft). */\nfunction stepKeys(target: object, step: unknown, label: string): Array<string | number> {\n const keys: Array<string | number> = [];\n if (Array.isArray(target)) {\n if (typeof step === \"number\") keys.push(step);\n else if (typeof step === \"function\") {\n const filter = step as (item: unknown, index: number) => boolean;\n for (let i = 0; i < target.length; i += 1) if (filter(target[i], i)) keys.push(i);\n } else if (Array.isArray(step)) keys.push(...(step as number[]));\n else if (typeof step === \"object\" && step !== null)\n keys.push(...rangeKeys(step, target.length));\n else\n throw new TypeError(\n __DEV__ ? `ShadowStore${label}: bad path step for an array` : \"SHADOW_STORE_PATH_ARRAY\",\n );\n } else if (typeof step === \"string\" || typeof step === \"number\") {\n keys.push(step);\n } else if (Array.isArray(step)) {\n keys.push(...(step as Array<string | number>));\n } else {\n throw new TypeError(\n __DEV__ ? `ShadowStore${label}: bad path step for an object` : \"SHADOW_STORE_PATH_OBJECT\",\n );\n }\n for (const key of keys) {\n if (typeof key === \"string\" && isReservedKey(key)) {\n throw new TypeError(\n __DEV__\n ? `ShadowStore${label}: the key \"${key}\" cannot be used in a path`\n : \"SHADOW_STORE_PATH_KEY\",\n );\n }\n }\n return keys;\n}\n\n/** Writes `value` (or the updater's result) at the end of a path, merging plain objects. */\nfunction applyPath(root: object, path: unknown[], label: string): void {\n const value = path[path.length - 1];\n const steps = path.slice(0, -1);\n const walk = (target: object, depth: number): void => {\n for (const key of stepKeys(target, steps[depth], label)) {\n const holder = target as Record<string | number, unknown>;\n if (depth === steps.length - 1) {\n const previous = holder[key];\n const spec = typeof value === \"function\" ? specOf(value) : undefined;\n if (spec !== undefined) {\n // reconcile(...) at a path diffs only that sub-tree.\n if (isWrappable(previous)) applyReconcile(unwrapValue(previous) as object, spec, label);\n else holder[key] = spec.next;\n continue;\n }\n const next =\n typeof value === \"function\" ? (value as (p: unknown) => unknown)(previous) : value;\n if (isPlainObject(next) && isWrappable(previous) && !Array.isArray(previous)) {\n mergeInto(previous as Record<string, unknown>, next, label);\n } else {\n holder[key] = next;\n }\n } else {\n const child = holder[key];\n if (!isWrappable(child)) {\n throw new TypeError(\n __DEV__\n ? `ShadowStore${label}: the path goes through a value that is not an object`\n : \"SHADOW_STORE_PATH_VALUE\",\n );\n }\n walk(child, depth + 1);\n }\n }\n };\n walk(root, 0);\n}\n\nfunction mergeInto(\n target: Record<string, unknown>,\n source: Record<string, unknown>,\n label: string,\n): void {\n for (const key of Object.keys(source)) {\n if (isReservedKey(key)) {\n throw new TypeError(\n __DEV__\n ? `ShadowStore${label}: the key \"${key}\" cannot be assigned`\n : \"SHADOW_STORE_ASSIGN_KEY\",\n );\n }\n target[key] = source[key];\n }\n}\n\n/**\n * Devtools handles of the stores, by store root. Dev builds only: the WeakMap is unused (and dropped)\n * in production, where `__DEV__` is false.\n */\nconst storeHandles = /* @__PURE__ */ new WeakMap<object, Array<{ readonly name: string }>>();\n\nfunction createDeepStore<T extends object>(initial: T, label: string): [Store<T>, SetStore<T>] {\n const root = unwrapValue(initial) as object;\n const store = readProxyOf(root) as Store<T>;\n\n // One untyped entry point for every form of update. It is assignable to SetStore<T> because its\n // parameters accept anything: the typed overloads are the public contract, and the devtools\n // path setter below calls this function directly with a path it built at run time.\n const apply = (...args: unknown[]): void => {\n if (__DEV__ && isComputingMemo()) throw new ShadowError(\"WRITE_IN_MEMO\");\n if (args.length === 0)\n throw new TypeError(\n __DEV__ ? `ShadowStore${label}: setStore() needs an argument` : \"SHADOW_STORE_NO_ARGUMENT\",\n );\n const first = args[0];\n group(() =>\n untrack(() => {\n if (args.length > 1) {\n const tx = new Transaction(label);\n try {\n applyPath(draftOf(root, tx), args, label);\n } finally {\n tx.open = false;\n }\n return;\n }\n if (typeof first === \"function\") {\n const spec = specOf(first);\n if (spec !== undefined) {\n applyReconcile(root, spec, label);\n return;\n }\n const tx = new Transaction(label);\n let result: unknown;\n try {\n result = (first as (draft: unknown) => unknown)(draftOf(root, tx));\n } finally {\n tx.open = false;\n }\n if (result !== undefined) replaceWith(root, result, label);\n return;\n }\n replaceWith(root, first, label);\n }),\n );\n };\n const setStore: SetStore<T> = apply;\n if (__DEV__) {\n const handle = {\n name: label === \"\" ? \"store\" : label.replace(/^ \\((.*)\\)$/, \"$1\"),\n snapshot: () => snapshot(store),\n set: (path: readonly (string | number)[], value: unknown) => {\n apply(...path, value);\n },\n };\n // Devtools hold the handle weakly, so the handle must stay reachable exactly as long as the store.\n // The store's proxy and its setter both reach `root`, and a WeakMap value lives as long as its key.\n // A root shared by two stores keeps both handles.\n const anchored = storeHandles.get(root);\n if (anchored === undefined) storeHandles.set(root, [handle]);\n else anchored.push(handle);\n devtoolsReport(DEVTOOLS_EVENT.STORE_CREATED, handle, currentOwner());\n }\n return [store, setStore];\n}\n\n/** `setStore(value)`: an array replaces (diffed in place), a plain object merges its keys. */\nfunction replaceWith(root: object, value: unknown, label: string): void {\n if (Array.isArray(root)) {\n if (!Array.isArray(value)) {\n throw new TypeError(\n __DEV__\n ? `ShadowStore${label}: an array store is updated with an array or a function`\n : \"SHADOW_STORE_ARRAY_UPDATE\",\n );\n }\n const spec = specOf(reconcile(value));\n if (spec !== undefined) applyReconcile(root, spec, label);\n return;\n }\n if (!isPlainObject(value)) {\n throw new TypeError(\n __DEV__\n ? `ShadowStore${label}: setStore() expects an object, a function or a reconcile() result`\n : \"SHADOW_STORE_UPDATE_ARGUMENT\",\n );\n }\n const tx = new Transaction(label);\n try {\n mergeInto(draftOf(root, tx) as Record<string, unknown>, value, label);\n } finally {\n tx.open = false;\n }\n}\n\n/**\n * The state hook. Pass a single value for a reactive cell, or plain data for a deep store:\n *\n * ```ts\n * const [count, setCount] = useStore(0); // count() / setCount(n => n + 1)\n * const [todos, setTodos] = useStore({ items: [] as Todo[] });\n * todos.items[0]?.done; // tracks exactly this property\n * setTodos((draft) => { draft.items.push(todo); }); // notifies only what changed\n * setTodos(\"items\", (t) => t.id === 3, \"done\", true); // path form\n * ```\n *\n * Reads inside effects, memos and JSX subscribe to the exact value or property read; writes notify\n * exactly the readers of what changed, in one batch. A store wraps plain objects and arrays in\n * place; class instances, `Date`, `Map`, `Set` and functions are single values. A value that may\n * be `null` or another type (`Todo[] | null`) is a single value too: it is replaced as a whole, and\n * plain data assigned to it is read through the same fine-grained proxies a store uses.\n *\n * A property read in a tracked context gets a small notifier. Reading many transient keys\n * (`store.byId[id]` with churning ids) does not grow it for the life of the store: once an object\n * has collected a few hundred notifiers, the ones nothing observes any more are dropped, and a key\n * read again gets a fresh one that reflects the current value.\n *\n * @param initial Initial value or plain data. Plain objects and arrays are wrapped in place, not\n * copied.\n * @param options `name` labels the store in messages. Undefined uses the default (unnamed).\n * @returns `[read, write]` for a single value, `[store, setStore]` for plain data.\n * @throws ShadowError `WRITE_IN_MEMO` from the setter, in development builds only, when it is called\n * while a {@link useMemo} computation runs. `setStore` throws TypeError (production messages\n * `SHADOW_STORE_*`) for an update it cannot apply: no argument, a bad path step, a path through a\n * value that is not an object, a reserved key such as `__proto__`, or a non-array value for an\n * array store. Writing to the store view itself throws TypeError (`SHADOW_STORE_READ_ONLY`).\n * @example\n * import { useStore } from \"@shadow-js/core\";\n *\n * interface Todo { id: number; title: string; done: boolean }\n *\n * const [count, setCount] = useStore(0);\n * const [todos, setTodos] = useStore({ items: [] as Todo[] });\n * setCount((n) => n + 1);\n * setTodos((draft) => {\n * draft.items.push({ id: 1, title: \"Write docs\", done: false });\n * });\n * setTodos(\"items\", (todo) => todo.id === 1, \"done\", true);\n * console.log(count(), todos.items[0]?.done); // 1 true\n * @see useSignal\n * @see reconcile\n * @since 1.0.0\n */\nexport function useStore<T extends NotMixed<T>>(initial: T, options?: StoreOptions): StoreResult<T>;\nexport function useStore<T>(initial: MixedInitial<T>, options?: StoreOptions): StoreResult<T>;\nexport function useStore(initial: unknown, options?: StoreOptions): unknown {\n const label = options?.name === undefined ? \"\" : ` (${options.name})`;\n const root = unwrapValue(initial);\n if (isWrappable(root)) return createDeepStore(root, label);\n // A single value, which may be plain data later (`Todo[] | null`): objects and arrays that are\n // assigned are wrapped in read proxies, so `todos()?.[0]?.done` tracks exactly what it reads.\n const [read, write] = useSignal<unknown>(\n wrapCell(initial),\n options?.name === undefined ? undefined : { name: options.name },\n );\n const set = (next: unknown): unknown =>\n write(\n typeof next === \"function\"\n ? (previous: unknown) => wrapCell((next as (previous: unknown) => unknown)(previous))\n : wrapCell(next),\n );\n return [read, set];\n}\n\n/** The value a single-value cell holds: plain data becomes its (stable) read proxy. */\nfunction wrapCell(value: unknown): unknown {\n const raw = unwrapValue(value);\n return isWrappable(raw) ? readProxyOf(raw) : value;\n}\n"],"mappings":";;;;;;;;;;;AA4BA,SAAS,cAAc,OAAkD;CACvE,IAAI,OAAO,UAAU,YAAY,UAAU,QAAQ,MAAM,QAAQ,KAAK,GAAG,OAAO;CAChF,MAAM,YAAY,OAAO,eAAe,KAAK;CAC7C,OAAO,cAAc,OAAO,aAAa,cAAc;AACzD;AAEA,SAAS,UAAU,OAAoD,QAA0B;CAC/F,MAAM,OAAO,MAAM,QAAQ;CAC3B,MAAM,KAAK,MAAM,MAAM,SAAS;CAChC,MAAM,KAAK,MAAM,MAAM;CACvB,IAAI,CAAC,OAAO,SAAS,EAAE,KAAK,OAAO,GACjC,MAAM,IAAI,UACE,4CACZ;CACF,MAAM,OAAiB,CAAC;CACxB,KAAK,IAAI,IAAI,MAAM,KAAK,IAAI,KAAK,KAAK,KAAK,IAAI,KAAK,IAAI;EACtD,KAAK,KAAK,CAAC;EACX,IAAI,KAAK,SAAS,SAAS,GAAG;CAChC;CACA,OAAO;AACT;;AAGA,SAAS,SAAS,QAAgB,MAAe,OAAuC;CACtF,MAAM,OAA+B,CAAC;CACtC,IAAI,MAAM,QAAQ,MAAM,GAAG;EACzB,IAAI,OAAO,SAAS,UAAU,KAAK,KAAK,IAAI;OACvC,IAAI,OAAO,SAAS,YAAY;GACnC,MAAM,SAAS;GACf,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK,GAAG,IAAI,OAAO,OAAO,IAAI,CAAC,GAAG,KAAK,KAAK,CAAC;EAClF,OAAO,IAAI,MAAM,QAAQ,IAAI,GAAG,KAAK,KAAK,GAAI,IAAiB;OAC1D,IAAI,OAAO,SAAS,YAAY,SAAS,MAC5C,KAAK,KAAK,GAAG,UAAU,MAAM,OAAO,MAAM,CAAC;OAE3C,MAAM,IAAI,UACE,cAAc,MAAM,6BAChC;CACJ,OAAO,IAAI,OAAO,SAAS,YAAY,OAAO,SAAS,UACrD,KAAK,KAAK,IAAI;MACT,IAAI,MAAM,QAAQ,IAAI,GAC3B,KAAK,KAAK,GAAI,IAA+B;MAE7C,MAAM,IAAI,UACE,cAAc,MAAM,8BAChC;CAEF,KAAK,MAAM,OAAO,MAChB,IAAI,OAAO,QAAQ,YAAY,cAAc,GAAG,GAC9C,MAAM,IAAI,UAEJ,cAAc,MAAM,aAAa,IAAI,2BAE3C;CAGJ,OAAO;AACT;;AAGA,SAAS,UAAU,MAAc,MAAiB,OAAqB;CACrE,MAAM,QAAQ,KAAK,KAAK,SAAS;CACjC,MAAM,QAAQ,KAAK,MAAM,GAAG,EAAE;CAC9B,MAAM,QAAQ,QAAgB,UAAwB;EACpD,KAAK,MAAM,OAAO,SAAS,QAAQ,MAAM,QAAQ,KAAK,GAAG;GACvD,MAAM,SAAS;GACf,IAAI,UAAU,MAAM,SAAS,GAAG;IAC9B,MAAM,WAAW,OAAO;IACxB,MAAM,OAAO,OAAO,UAAU,aAAa,OAAO,KAAK,IAAI,KAAA;IAC3D,IAAI,SAAS,KAAA,GAAW;KAEtB,IAAI,YAAY,QAAQ,GAAG,eAAe,YAAY,QAAQ,GAAa,MAAM,KAAK;UACjF,OAAO,OAAO,KAAK;KACxB;IACF;IACA,MAAM,OACJ,OAAO,UAAU,aAAc,MAAkC,QAAQ,IAAI;IAC/E,IAAI,cAAc,IAAI,KAAK,YAAY,QAAQ,KAAK,CAAC,MAAM,QAAQ,QAAQ,GACzE,UAAU,UAAqC,MAAM,KAAK;SAE1D,OAAO,OAAO;GAElB,OAAO;IACL,MAAM,QAAQ,OAAO;IACrB,IAAI,CAAC,YAAY,KAAK,GACpB,MAAM,IAAI,UAEJ,cAAc,MAAM,sDAE1B;IAEF,KAAK,OAAO,QAAQ,CAAC;GACvB;EACF;CACF;CACA,KAAK,MAAM,CAAC;AACd;AAEA,SAAS,UACP,QACA,QACA,OACM;CACN,KAAK,MAAM,OAAO,OAAO,KAAK,MAAM,GAAG;EACrC,IAAI,cAAc,GAAG,GACnB,MAAM,IAAI,UAEJ,cAAc,MAAM,aAAa,IAAI,qBAE3C;EAEF,OAAO,OAAO,OAAO;CACvB;AACF;;;;;AAMA,MAAM,+BAA+B,IAAI,QAAkD;AAE3F,SAAS,gBAAkC,SAAY,OAAwC;CAC7F,MAAM,OAAO,YAAY,OAAO;CAChC,MAAM,QAAQ,YAAY,IAAI;CAK9B,MAAM,SAAS,GAAG,SAA0B;EAC1C,IAAe,gBAAgB,GAAG,MAAM,IAAI,YAAY,eAAe;EACvE,IAAI,KAAK,WAAW,GAClB,MAAM,IAAI,UACE,cAAc,MAAM,+BAChC;EACF,MAAM,QAAQ,KAAK;EACnB,YACE,cAAc;GACZ,IAAI,KAAK,SAAS,GAAG;IACnB,MAAM,KAAK,IAAI,YAAY,KAAK;IAChC,IAAI;KACF,UAAU,QAAQ,MAAM,EAAE,GAAG,MAAM,KAAK;IAC1C,UAAU;KACR,GAAG,OAAO;IACZ;IACA;GACF;GACA,IAAI,OAAO,UAAU,YAAY;IAC/B,MAAM,OAAO,OAAO,KAAK;IACzB,IAAI,SAAS,KAAA,GAAW;KACtB,eAAe,MAAM,MAAM,KAAK;KAChC;IACF;IACA,MAAM,KAAK,IAAI,YAAY,KAAK;IAChC,IAAI;IACJ,IAAI;KACF,SAAU,MAAsC,QAAQ,MAAM,EAAE,CAAC;IACnE,UAAU;KACR,GAAG,OAAO;IACZ;IACA,IAAI,WAAW,KAAA,GAAW,YAAY,MAAM,QAAQ,KAAK;IACzD;GACF;GACA,YAAY,MAAM,OAAO,KAAK;EAChC,CAAC,CACH;CACF;CACA,MAAM,WAAwB;CACjB;EACX,MAAM,SAAS;GACb,MAAM,UAAU,KAAK,UAAU,MAAM,QAAQ,eAAe,IAAI;GAChE,gBAAgB,SAAS,KAAK;GAC9B,MAAM,MAAoC,UAAmB;IAC3D,MAAM,GAAG,MAAM,KAAK;GACtB;EACF;EAIA,MAAM,WAAW,aAAa,IAAI,IAAI;EACtC,IAAI,aAAa,KAAA,GAAW,aAAa,IAAI,MAAM,CAAC,MAAM,CAAC;OACtD,SAAS,KAAK,MAAM;EACzB,OAAe,eAAe,eAAe,QAAQ,aAAa,CAAC;CACrE;CACA,OAAO,CAAC,OAAO,QAAQ;AACzB;;AAGA,SAAS,YAAY,MAAc,OAAgB,OAAqB;CACtE,IAAI,MAAM,QAAQ,IAAI,GAAG;EACvB,IAAI,CAAC,MAAM,QAAQ,KAAK,GACtB,MAAM,IAAI,UAEJ,cAAc,MAAM,wDAE1B;EAEF,MAAM,OAAO,OAAO,UAAU,KAAK,CAAC;EACpC,IAAI,SAAS,KAAA,GAAW,eAAe,MAAM,MAAM,KAAK;EACxD;CACF;CACA,IAAI,CAAC,cAAc,KAAK,GACtB,MAAM,IAAI,UAEJ,cAAc,MAAM,mEAE1B;CAEF,MAAM,KAAK,IAAI,YAAY,KAAK;CAChC,IAAI;EACF,UAAU,QAAQ,MAAM,EAAE,GAA8B,OAAO,KAAK;CACtE,UAAU;EACR,GAAG,OAAO;CACZ;AACF;AAoDA,SAAgB,SAAS,SAAkB,SAAiC;CAC1E,MAAM,QAAQ,SAAS,SAAS,KAAA,IAAY,KAAK,KAAK,QAAQ,KAAK;CACnE,MAAM,OAAO,YAAY,OAAO;CAChC,IAAI,YAAY,IAAI,GAAG,OAAO,gBAAgB,MAAM,KAAK;CAGzD,MAAM,CAAC,MAAM,SAAS,UACpB,SAAS,OAAO,GAChB,SAAS,SAAS,KAAA,IAAY,KAAA,IAAY,EAAE,MAAM,QAAQ,KAAK,CACjE;CACA,MAAM,OAAO,SACX,MACE,OAAO,SAAS,cACX,aAAsB,SAAU,KAAwC,QAAQ,CAAC,IAClF,SAAS,IAAI,CACnB;CACF,OAAO,CAAC,MAAM,GAAG;AACnB;;AAGA,SAAS,SAAS,OAAyB;CACzC,MAAM,MAAM,YAAY,KAAK;CAC7B,OAAO,YAAY,GAAG,IAAI,YAAY,GAAG,IAAI;AAC/C"}
@@ -82,7 +82,7 @@ function useDeferredValue(source, options) {
82
82
  registerTransitionLane();
83
83
  const [value, setValue] = useSignal(untrack(source), {
84
84
  equals: options?.equals ?? Object.is,
85
- ...options?.name === void 0 ? {} : { name: options.name }
85
+ name: options?.name
86
86
  });
87
87
  createComputation({
88
88
  kind: "effect",
@@ -1 +1 @@
1
- {"version":3,"file":"transitions.js","names":[],"sources":["../../src/transitions.ts"],"sourcesContent":["import {\n type Accessor,\n createComputation,\n type Equals,\n inTransition,\n registerTransitionLane,\n startTransition,\n} from \"./extend\";\nimport { untrack } from \"./ownership\";\nimport { useSignal } from \"./signal\";\n\n/**\n * Options of {@link useDeferredValue}.\n * @since 1.0.0\n */\nexport interface DeferredValueOptions<T> {\n /**\n * Decides whether the deferred value changed: readers are notified only when it returns `false`.\n * @default Object.is\n */\n equals?: Equals<T>;\n /**\n * Label shown by devtools and diagnostics.\n * @default \"useDeferredValue\" for the watcher; the value itself is unnamed\n */\n name?: string;\n}\n\n/**\n * Runs `fn` as a transition and reports whether it is pending. Returns `[isPending, start]`:\n * `isPending` is true from `start(fn)` until the transition has been applied (including any Suspense\n * boundary it waits on); `start(fn)` is {@link startTransition} that also updates `isPending`.\n *\n * Use it for updates that may be slow to show (navigating to a page that loads data): the previous\n * screen stays until the new one is ready, and the input stays responsive meanwhile.\n *\n * @returns `[isPending, start]`. `isPending` is an accessor; `start` returns a promise that\n * resolves when the transition has been applied. On the server `start` runs `fn` at once.\n * @throws Nothing itself. `start` rethrows synchronously what `fn` throws, after clearing\n * `isPending` when no other transition of this hook is running.\n * @example\n * import { useSignal, useTransition } from \"@shadow-js/core\";\n *\n * function Tabs() {\n * const [page, setPage] = useSignal(\"home\");\n * const [pending, start] = useTransition();\n * return (\n * <button disabled={pending()} onClick={() => start(() => setPage(\"reports\"))}>\n * {page() === \"reports\" ? \"Reports\" : \"Open reports\"}\n * </button>\n * );\n * }\n * @see startTransition\n * @see useDeferredValue\n * @since 1.0.0\n */\nexport function useTransition(): [Accessor<boolean>, (fn: () => void) => Promise<void>] {\n const [pending, setPending] = useSignal(false);\n let running = 0;\n const start = (fn: () => void): Promise<void> => {\n running += 1;\n // Urgent: the pending state must show before the transition's own work.\n untrack(() => setPending(true));\n let applied: Promise<void>;\n try {\n applied = startTransition(fn);\n } catch (error) {\n running -= 1;\n if (running === 0) untrack(() => setPending(false));\n throw error;\n }\n return applied.then(() => {\n running -= 1;\n if (running === 0) untrack(() => setPending(false));\n });\n };\n return [pending, start];\n}\n\n/**\n * Returns a value that follows `source` in the transition lane: it keeps the previous value while\n * urgent updates run, and takes the new value when the lane applies it. Reads of the source are\n * unaffected. On the server it returns the source itself (there is no lane).\n *\n * @param source The value to follow. Tracked by a watcher that runs in the transition lane.\n * @param options Equality and a devtools name. Undefined uses the defaults.\n * @returns An accessor of the deferred value. It starts as the source's current value.\n * @example\n * import { useDeferredValue, useMemo, useSignal } from \"@shadow-js/core\";\n *\n * const names = [\"Ada\", \"Grace\", \"Linus\"];\n * function Search() {\n * const [query, setQuery] = useSignal(\"\");\n * const deferredQuery = useDeferredValue(query);\n * const results = useMemo(() => names.filter((name) => name.includes(deferredQuery())));\n * return (\n * <label>\n * <input value={query()} onInput={(e) => setQuery(e.currentTarget.value)} />\n * {results().join(\", \")}\n * </label>\n * );\n * }\n * @see useTransition\n * @since 1.0.0\n */\nexport function useDeferredValue<T>(\n source: Accessor<T>,\n options?: DeferredValueOptions<T>,\n): Accessor<T> {\n if (__SERVER__) return source;\n registerTransitionLane();\n const [value, setValue] = useSignal<T>(untrack(source), {\n equals: options?.equals ?? Object.is,\n ...(options?.name === undefined ? {} : { name: options.name }),\n });\n // The watcher runs in the lane. Its first run (queued at creation) finds the value equal, so it\n // writes nothing; a later run writes the source's value, and an equal value notifies nobody.\n createComputation({\n kind: \"effect\",\n fn: () => source(),\n apply: (next: T) => {\n setValue(() => next);\n },\n lane: true,\n name: options?.name ?? \"useDeferredValue\",\n });\n return value;\n}\n\nexport { inTransition };\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAwDA,SAAgB,gBAAwE;CACtF,MAAM,CAAC,SAAS,cAAc,UAAU,KAAK;CAC7C,IAAI,UAAU;CACd,MAAM,SAAS,OAAkC;EAC/C,WAAW;EAEX,cAAc,WAAW,IAAI,CAAC;EAC9B,IAAI;EACJ,IAAI;GACF,UAAU,gBAAgB,EAAE;EAC9B,SAAS,OAAO;GACd,WAAW;GACX,IAAI,YAAY,GAAG,cAAc,WAAW,KAAK,CAAC;GAClD,MAAM;EACR;EACA,OAAO,QAAQ,WAAW;GACxB,WAAW;GACX,IAAI,YAAY,GAAG,cAAc,WAAW,KAAK,CAAC;EACpD,CAAC;CACH;CACA,OAAO,CAAC,SAAS,KAAK;AACxB;;;;;;;;;;;;;;;;;;;;;;;;;;;AA4BA,SAAgB,iBACd,QACA,SACa;CAEb,uBAAuB;CACvB,MAAM,CAAC,OAAO,YAAY,UAAa,QAAQ,MAAM,GAAG;EACtD,QAAQ,SAAS,UAAU,OAAO;EAClC,GAAI,SAAS,SAAS,KAAA,IAAY,CAAC,IAAI,EAAE,MAAM,QAAQ,KAAK;CAC9D,CAAC;CAGD,kBAAkB;EAChB,MAAM;EACN,UAAU,OAAO;EACjB,QAAQ,SAAY;GAClB,eAAe,IAAI;EACrB;EACA,MAAM;EACN,MAAM,SAAS,QAAQ;CACzB,CAAC;CACD,OAAO;AACT"}
1
+ {"version":3,"file":"transitions.js","names":[],"sources":["../../src/transitions.ts"],"sourcesContent":["import {\n type Accessor,\n createComputation,\n type Equals,\n inTransition,\n registerTransitionLane,\n startTransition,\n} from \"./extend\";\nimport { untrack } from \"./ownership\";\nimport { useSignal } from \"./signal\";\n\n/**\n * Options of {@link useDeferredValue}.\n * @since 1.0.0\n */\nexport interface DeferredValueOptions<T> {\n /**\n * Decides whether the deferred value changed: readers are notified only when it returns `false`.\n * @default Object.is\n */\n equals?: Equals<T>;\n /**\n * Label shown by devtools and diagnostics.\n * @default \"useDeferredValue\" for the watcher; the value itself is unnamed\n */\n name?: string;\n}\n\n/**\n * Runs `fn` as a transition and reports whether it is pending. Returns `[isPending, start]`:\n * `isPending` is true from `start(fn)` until the transition has been applied (including any Suspense\n * boundary it waits on); `start(fn)` is {@link startTransition} that also updates `isPending`.\n *\n * Use it for updates that may be slow to show (navigating to a page that loads data): the previous\n * screen stays until the new one is ready, and the input stays responsive meanwhile.\n *\n * @returns `[isPending, start]`. `isPending` is an accessor; `start` returns a promise that\n * resolves when the transition has been applied. On the server `start` runs `fn` at once.\n * @throws Nothing itself. `start` rethrows synchronously what `fn` throws, after clearing\n * `isPending` when no other transition of this hook is running.\n * @example\n * import { useSignal, useTransition } from \"@shadow-js/core\";\n *\n * function Tabs() {\n * const [page, setPage] = useSignal(\"home\");\n * const [pending, start] = useTransition();\n * return (\n * <button disabled={pending()} onClick={() => start(() => setPage(\"reports\"))}>\n * {page() === \"reports\" ? \"Reports\" : \"Open reports\"}\n * </button>\n * );\n * }\n * @see startTransition\n * @see useDeferredValue\n * @since 1.0.0\n */\nexport function useTransition(): [Accessor<boolean>, (fn: () => void) => Promise<void>] {\n const [pending, setPending] = useSignal(false);\n let running = 0;\n const start = (fn: () => void): Promise<void> => {\n running += 1;\n // Urgent: the pending state must show before the transition's own work.\n untrack(() => setPending(true));\n let applied: Promise<void>;\n try {\n applied = startTransition(fn);\n } catch (error) {\n running -= 1;\n if (running === 0) untrack(() => setPending(false));\n throw error;\n }\n return applied.then(() => {\n running -= 1;\n if (running === 0) untrack(() => setPending(false));\n });\n };\n return [pending, start];\n}\n\n/**\n * Returns a value that follows `source` in the transition lane: it keeps the previous value while\n * urgent updates run, and takes the new value when the lane applies it. Reads of the source are\n * unaffected. On the server it returns the source itself (there is no lane).\n *\n * @param source The value to follow. Tracked by a watcher that runs in the transition lane.\n * @param options Equality and a devtools name. Undefined uses the defaults.\n * @returns An accessor of the deferred value. It starts as the source's current value.\n * @example\n * import { useDeferredValue, useMemo, useSignal } from \"@shadow-js/core\";\n *\n * const names = [\"Ada\", \"Grace\", \"Linus\"];\n * function Search() {\n * const [query, setQuery] = useSignal(\"\");\n * const deferredQuery = useDeferredValue(query);\n * const results = useMemo(() => names.filter((name) => name.includes(deferredQuery())));\n * return (\n * <label>\n * <input value={query()} onInput={(e) => setQuery(e.currentTarget.value)} />\n * {results().join(\", \")}\n * </label>\n * );\n * }\n * @see useTransition\n * @since 1.0.0\n */\nexport function useDeferredValue<T>(\n source: Accessor<T>,\n options?: DeferredValueOptions<T>,\n): Accessor<T> {\n if (__SERVER__) return source;\n registerTransitionLane();\n const [value, setValue] = useSignal<T>(untrack(source), {\n equals: options?.equals ?? Object.is,\n name: options?.name,\n });\n // The watcher runs in the lane. Its first run (queued at creation) finds the value equal, so it\n // writes nothing; a later run writes the source's value, and an equal value notifies nobody.\n createComputation({\n kind: \"effect\",\n fn: () => source(),\n apply: (next: T) => {\n setValue(() => next);\n },\n lane: true,\n name: options?.name ?? \"useDeferredValue\",\n });\n return value;\n}\n\nexport { inTransition };\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAwDA,SAAgB,gBAAwE;CACtF,MAAM,CAAC,SAAS,cAAc,UAAU,KAAK;CAC7C,IAAI,UAAU;CACd,MAAM,SAAS,OAAkC;EAC/C,WAAW;EAEX,cAAc,WAAW,IAAI,CAAC;EAC9B,IAAI;EACJ,IAAI;GACF,UAAU,gBAAgB,EAAE;EAC9B,SAAS,OAAO;GACd,WAAW;GACX,IAAI,YAAY,GAAG,cAAc,WAAW,KAAK,CAAC;GAClD,MAAM;EACR;EACA,OAAO,QAAQ,WAAW;GACxB,WAAW;GACX,IAAI,YAAY,GAAG,cAAc,WAAW,KAAK,CAAC;EACpD,CAAC;CACH;CACA,OAAO,CAAC,SAAS,KAAK;AACxB;;;;;;;;;;;;;;;;;;;;;;;;;;;AA4BA,SAAgB,iBACd,QACA,SACa;CAEb,uBAAuB;CACvB,MAAM,CAAC,OAAO,YAAY,UAAa,QAAQ,MAAM,GAAG;EACtD,QAAQ,SAAS,UAAU,OAAO;EAClC,MAAM,SAAS;CACjB,CAAC;CAGD,kBAAkB;EAChB,MAAM;EACN,UAAU,OAAO;EACjB,QAAQ,SAAY;GAClB,eAAe,IAAI;EACrB;EACA,MAAM;EACN,MAAM,SAAS,QAAQ;CACzB,CAAC;CACD,OAAO;AACT"}
@@ -1,2 +1,2 @@
1
- import{handleError as e}from"./internal/owner.js";import{batch as t}from"./internal/scheduler.js";import{untrack as n}from"./ownership.js";import{useSignal as r}from"./signal.js";import{currentOwner as i}from"./extend/index.js";function a(e){return e!==null&&(typeof e==`object`||typeof e==`function`)&&typeof e.then==`function`}function o(o,s){let c=i(),[l,u]=r(s),[d,f]=r(!1),p=0;return[l,(...r)=>{p+=1;let i=p,s=n(l),d=e=>{i===p&&t(()=>{u(()=>e),f(!1)})},m=t=>{if(i===p){if(f(!1),c===null)throw t;e(t,c)}},h;try{h=n(()=>o(s,...r))}catch(e){return c===null?(i===p&&f(!1),Promise.reject(e)):(m(e),Promise.resolve())}return a(h)?(f(!0),Promise.resolve(h).then(d,m)):(d(h),Promise.resolve())},d]}export{o as useAction};
1
+ import{handleError as e}from"./internal/owner.js";import{batch as t}from"./internal/scheduler.js";import{untrack as n}from"./ownership.js";import{useSignal as r}from"./signal.js";import{currentOwner as i}from"./extend/index.js";function a(e){return e!==null&&(typeof e==`object`||typeof e==`function`)&&typeof e.then==`function`}function o(o,s){let c=i(),[l,u]=r(s),[d,f]=r(!1),p=0;return[l,(...r)=>{p+=1;let i=p,s=n(l),d=e=>{i===p&&t(()=>{u(()=>e),f(!1)})},m=t=>{if(i===p&&f(!1),c===null)throw t;try{e(t,c)}catch(e){typeof reportError==`function`?reportError(e):queueMicrotask(()=>Promise.reject(e))}},h;try{h=n(()=>o(s,...r))}catch(e){try{m(e)}catch(e){return Promise.reject(e)}return Promise.resolve()}return a(h)?(f(!0),Promise.resolve(h).then(d,m)):(d(h),Promise.resolve())},d]}export{o as useAction};
2
2
  //# sourceMappingURL=action.js.map
@@ -1 +1 @@
1
- {"version":3,"file":"action.js","names":["isPromiseLike","value","useAction","owner","currentOwner","state","setState","useSignal","initialState","pending","setPending","latest","args","id","previous","untrack","commit","batch","fail","error","handleError","result","action"],"sources":["../../src/action.ts"],"sourcesContent":["import { type Accessor, batch, currentOwner, handleError } from \"./extend\";\nimport { untrack } from \"./ownership\";\nimport { useSignal } from \"./signal\";\n\nfunction isPromiseLike<T>(value: unknown): value is PromiseLike<T> {\n return (\n value !== null &&\n (typeof value === \"object\" || typeof value === \"function\") &&\n typeof (value as { then?: unknown }).then === \"function\"\n );\n}\n\n/**\n * A state machine for a form-style action: `dispatch(...args)` runs `action(previous, ...args)`,\n * tracks whether it is pending, and commits its result. The ShadowJS form of React's\n * `useActionState` (state, dispatch, pending). `previous` is the last committed state.\n *\n * Only the latest dispatch commits: when two actions overlap, a slower result that settles after a\n * newer dispatch is discarded, so the screen never goes back to an older answer. A failure does not\n * change the state; it clears `pending` and is sent to the owner's error handler (`onError`), so an\n * error boundary can show it. Without an owner the returned promise rejects instead.\n *\n * @param action `(previous, ...args) => next`, synchronous or async. It runs untracked.\n * @param initialState The state before the first dispatch.\n * @returns `[state, dispatch, pending]`. A synchronous result commits at once; `pending` is true\n * only while a returned promise is unsettled. `dispatch` returns a promise that settles when this\n * call has finished, whether it committed or not.\n * @throws Nothing synchronously. Without an owner, the promise returned by `dispatch` rejects with\n * the action's error. With an owner, the error goes to its error handler, or is reported as an\n * uncaught error (`reportError`) when no handler is registered above it.\n * @example\n * import { useAction } from \"@shadow-js/core\";\n *\n * const [message, send, sending] = useAction(async (_prev: string, text: string) => {\n * await fetch(\"/api/messages\", { method: \"POST\", body: text });\n * return `sent: ${text}`;\n * }, \"\");\n * void send(\"hello\");\n * console.log(sending(), message());\n * @see useOptimistic\n * @see useTransition\n * @since 1.0.0\n */\nexport function useAction<S, A extends unknown[]>(\n action: (previous: S, ...args: A) => S | PromiseLike<S>,\n initialState: S,\n): [state: Accessor<S>, dispatch: (...args: A) => Promise<void>, pending: Accessor<boolean>] {\n const owner = currentOwner();\n const [state, setState] = useSignal<S>(initialState);\n const [pending, setPending] = useSignal(false);\n let latest = 0;\n\n const dispatch = (...args: A): Promise<void> => {\n latest += 1;\n const id = latest;\n const previous = untrack(state);\n const commit = (value: S): void => {\n if (id !== latest) return;\n batch(() => {\n setState(() => value);\n setPending(false);\n });\n };\n const fail = (error: unknown): void => {\n if (id !== latest) return;\n setPending(false);\n if (owner === null) throw error;\n handleError(error, owner);\n };\n let result: S | PromiseLike<S>;\n try {\n result = untrack(() => action(previous, ...args));\n } catch (error) {\n if (owner === null) {\n // `fail` would rethrow synchronously; without an owner the promise carries the error.\n if (id === latest) setPending(false);\n return Promise.reject(error);\n }\n fail(error);\n return Promise.resolve();\n }\n if (!isPromiseLike<S>(result)) {\n commit(result);\n return Promise.resolve();\n }\n setPending(true);\n return Promise.resolve(result).then(commit, fail);\n };\n return [state, dispatch, pending];\n}\n"],"mappings":"A,oOAIA,SAASA,EAAiB,EAAyC,CACjE,OACEC,IAAU,OACT,OAAOA,GAAU,UAAY,OAAOA,GAAU,aAC/C,OAAQA,EAA6B,MAAS,UAElD,CAiCA,SAAgBC,EACd,EACA,EAC2F,CAC3F,IAAMC,EAAQC,EAAa,EACrB,CAACC,EAAOC,GAAYC,EAAaC,CAAY,EAC7C,CAACC,EAASC,GAAcH,EAAU,EAAK,EACzCI,EAAS,EAsCb,MAAO,CAACN,GApCU,GAAGO,IAA2B,CAC9C,GAAU,EACV,IAAMC,EAAKF,EACLG,EAAWC,EAAQV,CAAK,EACxBW,EAAU,GAAmB,CAC7BH,IAAOF,GACXM,MAAY,CACVX,MAAeL,CAAK,EACpBS,EAAW,EAAK,CAClB,CAAC,CACH,EACMQ,EAAQ,GAAyB,CACrC,GAAIL,IAAOF,EACX,CACA,GADAD,EAAW,EAAK,EACZP,IAAU,KAAM,MAAMgB,EAC1BC,EAAYD,EAAOhB,CAAK,CAFR,CAGlB,EACIkB,EACJ,GAAI,CACF,EAASN,MAAcO,EAAOR,EAAU,GAAGF,CAAI,CAAC,CAClD,OAASO,EAAO,CAOd,OANIhB,IAAU,MAERU,IAAOF,GAAQD,EAAW,EAAK,EAC5B,QAAQ,OAAOS,CAAK,IAE7BD,EAAKC,CAAK,EACH,QAAQ,QAAQ,EACzB,CAMA,OALKnB,EAAiBqB,CAAM,GAI5BX,EAAW,EAAI,EACR,QAAQ,QAAQW,CAAM,CAAC,CAAC,KAAKL,EAAQE,CAAI,IAJ9CF,EAAOK,CAAM,EACN,QAAQ,QAAQ,EAI3B,EACyBZ,CAAO,CAClC,C"}
1
+ {"version":3,"file":"action.js","names":["isPromiseLike","value","useAction","owner","currentOwner","state","setState","useSignal","initialState","pending","setPending","latest","args","id","previous","untrack","commit","batch","fail","error","handleError","uncaught","result","action","thrown"],"sources":["../../src/action.ts"],"sourcesContent":["import { type Accessor, batch, currentOwner, handleError } from \"./extend\";\nimport { untrack } from \"./ownership\";\nimport { useSignal } from \"./signal\";\n\nfunction isPromiseLike<T>(value: unknown): value is PromiseLike<T> {\n return (\n value !== null &&\n (typeof value === \"object\" || typeof value === \"function\") &&\n typeof (value as { then?: unknown }).then === \"function\"\n );\n}\n\n/**\n * A state machine for a form-style action: `dispatch(...args)` runs `action(previous, ...args)`,\n * tracks whether it is pending, and commits its result. The ShadowJS form of React's\n * `useActionState` (state, dispatch, pending). `previous` is the last committed state.\n *\n * Only the latest dispatch commits: when two actions overlap, a slower result that settles after a\n * newer dispatch is discarded, so the screen never goes back to an older answer. A failure does not\n * change the state; it clears `pending` and is sent to the owner's error handler (`onError`), so an\n * error boundary can show it. Without an owner the returned promise rejects instead.\n *\n * @param action `(previous, ...args) => next`, synchronous or async. It runs untracked.\n * @param initialState The state before the first dispatch.\n * @returns `[state, dispatch, pending]`. A synchronous result commits at once; `pending` is true\n * only while a returned promise is unsettled. `dispatch` returns a promise that settles when this\n * call has finished, whether it committed or not.\n * @throws Nothing synchronously. Without an owner, the promise returned by `dispatch` rejects with\n * the action's error. With an owner, the error goes to its error handler, or is reported as an\n * uncaught error (`reportError`) when no handler is registered above it.\n * @example\n * import { useAction } from \"@shadow-js/core\";\n *\n * const [message, send, sending] = useAction(async (_prev: string, text: string) => {\n * await fetch(\"/api/messages\", { method: \"POST\", body: text });\n * return `sent: ${text}`;\n * }, \"\");\n * void send(\"hello\");\n * console.log(sending(), message());\n * @see useOptimistic\n * @see useTransition\n * @since 1.0.0\n */\nexport function useAction<S, A extends unknown[]>(\n action: (previous: S, ...args: A) => S | PromiseLike<S>,\n initialState: S,\n): [state: Accessor<S>, dispatch: (...args: A) => Promise<void>, pending: Accessor<boolean>] {\n const owner = currentOwner();\n const [state, setState] = useSignal<S>(initialState);\n const [pending, setPending] = useSignal(false);\n let latest = 0;\n\n const dispatch = (...args: A): Promise<void> => {\n latest += 1;\n const id = latest;\n const previous = untrack(state);\n const commit = (value: S): void => {\n if (id !== latest) return;\n batch(() => {\n setState(() => value);\n setPending(false);\n });\n };\n const fail = (error: unknown): void => {\n // A stale dispatch changes no state, but its error is still the owner's to hear.\n if (id === latest) setPending(false);\n if (owner === null) throw error;\n try {\n handleError(error, owner);\n } catch (uncaught) {\n // No handler took it: report it, as documented, instead of throwing out of dispatch.\n if (typeof reportError === \"function\") reportError(uncaught);\n else queueMicrotask(() => Promise.reject(uncaught));\n }\n };\n let result: S | PromiseLike<S>;\n try {\n result = untrack(() => action(previous, ...args));\n } catch (error) {\n try {\n fail(error);\n } catch (thrown) {\n // Without an owner the returned promise carries the error.\n return Promise.reject(thrown);\n }\n return Promise.resolve();\n }\n if (!isPromiseLike<S>(result)) {\n commit(result);\n return Promise.resolve();\n }\n setPending(true);\n return Promise.resolve(result).then(commit, fail);\n };\n return [state, dispatch, pending];\n}\n"],"mappings":"A,oOAIA,SAASA,EAAiB,EAAyC,CACjE,OACEC,IAAU,OACT,OAAOA,GAAU,UAAY,OAAOA,GAAU,aAC/C,OAAQA,EAA6B,MAAS,UAElD,CAiCA,SAAgBC,EACd,EACA,EAC2F,CAC3F,IAAMC,EAAQC,EAAa,EACrB,CAACC,EAAOC,GAAYC,EAAaC,CAAY,EAC7C,CAACC,EAASC,GAAcH,EAAU,EAAK,EACzCI,EAAS,EA4Cb,MAAO,CAACN,GA1CU,GAAGO,IAA2B,CAC9C,GAAU,EACV,IAAMC,EAAKF,EACLG,EAAWC,EAAQV,CAAK,EACxBW,EAAU,GAAmB,CAC7BH,IAAOF,GACXM,MAAY,CACVX,MAAeL,CAAK,EACpBS,EAAW,EAAK,CAClB,CAAC,CACH,EACMQ,EAAQ,GAAyB,CAGrC,GADIL,IAAOF,GAAQD,EAAW,EAAK,EAC/BP,IAAU,KAAM,MAAMgB,EAC1B,GAAI,CACFC,EAAYD,EAAOhB,CAAK,CAC1B,OAASkB,EAAU,CAEb,OAAO,aAAgB,WAAY,YAAYA,CAAQ,EACtD,mBAAqB,QAAQ,OAAOA,CAAQ,CAAC,CACpD,CACF,EACIC,EACJ,GAAI,CACF,EAASP,MAAcQ,EAAOT,EAAU,GAAGF,CAAI,CAAC,CAClD,OAASO,EAAO,CACd,GAAI,CACFD,EAAKC,CAAK,CACZ,OAASK,EAAQ,CAEf,OAAO,QAAQ,OAAOA,CAAM,CAC9B,CACA,OAAO,QAAQ,QAAQ,CACzB,CAMA,OALKxB,EAAiBsB,CAAM,GAI5BZ,EAAW,EAAI,EACR,QAAQ,QAAQY,CAAM,CAAC,CAAC,KAAKN,EAAQE,CAAI,IAJ9CF,EAAOM,CAAM,EACN,QAAQ,QAAQ,EAI3B,EACyBb,CAAO,CAClC,C"}
@@ -1,2 +1,2 @@
1
- import{currentOwner as e}from"./extend/index.js";function t(e,t){if(e.length!==t.length)return!1;for(let n=0;n<e.length;n+=1)if(!Object.is(e[n],t[n]))return!1;return!0}function n(e){let t=e;for(;t!==null&&t.parent!==null;)t=t.parent;return t}function r(r,i){let a=i?.limit??100;if(!Number.isInteger(a)||a<1)throw RangeError(`SHADOW_CACHE_LIMIT`);let o=/* @__PURE__ */ new WeakMap;return(...i)=>{let s=n(e());if(s===null)return r(...i);let c=o.get(s);c===void 0&&(c=[],o.set(s,c));for(let e of c)if(t(e.args,i))return e.value;let l=r(...i);return c.push({args:i,value:l}),c.length>a&&c.shift(),l}}export{r as cache};
1
+ import{untrack as e}from"./ownership.js";import{currentOwner as t}from"./extend/index.js";function n(e,t){if(e.length!==t.length)return!1;for(let n=0;n<e.length;n+=1)if(!Object.is(e[n],t[n]))return!1;return!0}function r(e){let t=e;for(;t!==null&&t.parent!==null;)t=t.parent;return t}function i(i,a){let o=a?.limit??100;if(!Number.isInteger(o)||o<1)throw RangeError(`SHADOW_CACHE_LIMIT`);let s=/* @__PURE__ */ new WeakMap;return(...a)=>{let c=r(t());if(c===null)return e(()=>i(...a));let l=s.get(c);l===void 0&&(l=[],s.set(c,l));for(let e of l)if(n(e.args,a))return e.value;let u=e(()=>i(...a));return l.push({args:a,value:u}),l.length>o&&l.shift(),u}}export{i as cache};
2
2
  //# sourceMappingURL=cache.js.map
@@ -1 +1 @@
1
- {"version":3,"file":"cache.js","names":["sameArgs","a","b","i","rootOf","root","owner","cache","limit","options","scopes","args","currentOwner","fn","entries","entry","value"],"sources":["../../src/cache.ts"],"sourcesContent":["import { currentOwner, type Owner } from \"./extend\";\n\n/** Options of {@link cache}. @since 1.0.0 */\nexport interface CacheOptions {\n /**\n * Most results kept per scope (one root); the oldest is dropped first. A positive integer.\n * @default 100\n */\n limit?: number;\n}\n\ninterface Entry {\n readonly args: readonly unknown[];\n readonly value: unknown;\n}\n\nfunction sameArgs(a: readonly unknown[], b: readonly unknown[]): boolean {\n if (a.length !== b.length) return false;\n for (let i = 0; i < a.length; i += 1) {\n if (!Object.is(a[i], b[i])) return false;\n }\n return true;\n}\n\n/** The outermost owner: the root of the render (a request on the server, the app on the client). */\nfunction rootOf(owner: Owner | null): Owner | null {\n let root = owner;\n while (root !== null && root.parent !== null) root = root.parent;\n return root;\n}\n\n/**\n * Memoizes `fn` per request: within one root (a server render, or the app on the client) the same\n * arguments return the same result without calling `fn` again. Arguments compare with `Object.is`,\n * position by position. Results are kept in a list bounded by `limit`; the oldest is dropped first.\n * A call that throws is not kept. Outside any owner nothing is scoped, so `fn` runs every time.\n *\n * Use it to share one data fetch between components rendered in the same request.\n *\n * @param fn The function to memoize. Its result is kept as is, so a promise is shared, not awaited.\n * @param options Per-scope limit. Undefined uses the default.\n * @returns A function with the same signature.\n * @throws RangeError when `limit` is not a positive integer (message code `SHADOW_CACHE_LIMIT` in\n * production builds). The returned function rethrows what `fn` throws.\n * @example\n * import { cache } from \"@shadow-js/core\";\n *\n * const loadUser = cache((id: string) =>\n * fetch(`/api/users/${id}`).then((response) => response.json()),\n * );\n * // Two components calling loadUser(\"u1\") in the same render fetch once.\n * @see useResource\n * @since 1.0.0\n */\nexport function cache<A extends unknown[], R>(\n fn: (...args: A) => R,\n options?: CacheOptions,\n): (...args: A) => R {\n const limit = options?.limit ?? 100;\n if (!Number.isInteger(limit) || limit < 1) {\n throw new RangeError(\n __DEV__ ? \"cache: limit must be a positive integer\" : \"SHADOW_CACHE_LIMIT\",\n );\n }\n const scopes = new WeakMap<Owner, Entry[]>();\n return (...args: A): R => {\n const root = rootOf(currentOwner());\n if (root === null) return fn(...args);\n let entries = scopes.get(root);\n if (entries === undefined) {\n entries = [];\n scopes.set(root, entries);\n }\n for (const entry of entries) {\n if (sameArgs(entry.args, args)) return entry.value as R;\n }\n const value = fn(...args);\n entries.push({ args, value });\n if (entries.length > limit) entries.shift();\n return value;\n };\n}\n"],"mappings":"A,iDAgBA,SAASA,EAAS,EAAuB,EAAgC,CACvE,GAAIC,EAAE,SAAWC,EAAE,OAAQ,MAAO,GAClC,IAAK,IAAIC,EAAI,EAAGA,EAAIF,EAAE,OAAQ,GAAK,EACjC,GAAI,CAAC,OAAO,GAAGA,EAAEE,GAAID,EAAEC,EAAE,EAAG,MAAO,GAErC,MAAO,EACT,CAGA,SAASC,EAAO,EAAmC,CACjD,IAAIC,EAAOC,EACX,KAAOD,IAAS,MAAQA,EAAK,SAAW,MAAM,EAAOA,EAAK,OAC1D,OAAOA,CACT,CAyBA,SAAgBE,EACd,EACA,EACmB,CACnB,IAAMC,EAAQC,GAAS,OAAS,IAChC,GAAI,CAAC,OAAO,UAAUD,CAAK,GAAKA,EAAQ,EACtC,MAAU,WAC8C,oBACxD,EAEF,IAAME,kBAAS,IAAI,QACnB,OAAQ,GAAGC,IAAe,CACxB,IAAMN,EAAOD,EAAOQ,EAAa,CAAC,EAClC,GAAIP,IAAS,KAAM,OAAOQ,EAAG,GAAGF,CAAI,EACpC,IAAIG,EAAUJ,EAAO,IAAIL,CAAI,EACzBS,IAAY,IAAA,KACd,EAAU,CAAC,EACXJ,EAAO,IAAIL,EAAMS,CAAO,GAE1B,IAAK,IAAMC,KAASD,EAClB,GAAId,EAASe,EAAM,KAAMJ,CAAI,EAAG,OAAOI,EAAM,MAE/C,IAAMC,EAAQH,EAAG,GAAGF,CAAI,EAGxB,OAFAG,EAAQ,KAAK,CAAE,OAAM,OAAM,CAAC,EACxBA,EAAQ,OAASN,GAAOM,EAAQ,MAAM,EACnCE,CACT,CACF,C"}
1
+ {"version":3,"file":"cache.js","names":["sameArgs","a","b","i","rootOf","root","owner","cache","limit","options","scopes","args","currentOwner","untrack","fn","entries","entry","value"],"sources":["../../src/cache.ts"],"sourcesContent":["import { currentOwner, type Owner } from \"./extend\";\nimport { untrack } from \"./ownership\";\n\n/** Options of {@link cache}. @since 1.0.0 */\nexport interface CacheOptions {\n /**\n * Most results kept per scope (one root); the oldest is dropped first. A positive integer.\n * @default 100\n */\n limit?: number;\n}\n\ninterface Entry {\n readonly args: readonly unknown[];\n readonly value: unknown;\n}\n\nfunction sameArgs(a: readonly unknown[], b: readonly unknown[]): boolean {\n if (a.length !== b.length) return false;\n for (let i = 0; i < a.length; i += 1) {\n if (!Object.is(a[i], b[i])) return false;\n }\n return true;\n}\n\n/** The outermost owner: the root of the render (a request on the server, the app on the client). */\nfunction rootOf(owner: Owner | null): Owner | null {\n let root = owner;\n while (root !== null && root.parent !== null) root = root.parent;\n return root;\n}\n\n/**\n * Memoizes `fn` per request: within one root (a server render, or the app on the client) the same\n * arguments return the same result without calling `fn` again. Arguments compare with `Object.is`,\n * position by position. Results are kept in a list bounded by `limit`; the oldest is dropped first.\n * A call that throws is not kept. `fn` runs untracked, so the first caller does not alone subscribe to what\n * it reads. Outside any owner nothing is scoped, so `fn` runs every time.\n *\n * Use it to share one data fetch between components rendered in the same request.\n *\n * @param fn The function to memoize. Its result is kept as is, so a promise is shared, not awaited.\n * @param options Per-scope limit. Undefined uses the default.\n * @returns A function with the same signature.\n * @throws RangeError when `limit` is not a positive integer (message code `SHADOW_CACHE_LIMIT` in\n * production builds). The returned function rethrows what `fn` throws.\n * @example\n * import { cache } from \"@shadow-js/core\";\n *\n * const loadUser = cache((id: string) =>\n * fetch(`/api/users/${id}`).then((response) => response.json()),\n * );\n * // Two components calling loadUser(\"u1\") in the same render fetch once.\n * @see useResource\n * @since 1.0.0\n */\nexport function cache<A extends unknown[], R>(\n fn: (...args: A) => R,\n options?: CacheOptions,\n): (...args: A) => R {\n const limit = options?.limit ?? 100;\n if (!Number.isInteger(limit) || limit < 1) {\n throw new RangeError(\n __DEV__ ? \"cache: limit must be a positive integer\" : \"SHADOW_CACHE_LIMIT\",\n );\n }\n const scopes = new WeakMap<Owner, Entry[]>();\n return (...args: A): R => {\n const root = rootOf(currentOwner());\n if (root === null) return untrack(() => fn(...args));\n let entries = scopes.get(root);\n if (entries === undefined) {\n entries = [];\n scopes.set(root, entries);\n }\n for (const entry of entries) {\n if (sameArgs(entry.args, args)) return entry.value as R;\n }\n const value = untrack(() => fn(...args));\n entries.push({ args, value });\n if (entries.length > limit) entries.shift();\n return value;\n };\n}\n"],"mappings":"A,0FAiBA,SAASA,EAAS,EAAuB,EAAgC,CACvE,GAAIC,EAAE,SAAWC,EAAE,OAAQ,MAAO,GAClC,IAAK,IAAIC,EAAI,EAAGA,EAAIF,EAAE,OAAQ,GAAK,EACjC,GAAI,CAAC,OAAO,GAAGA,EAAEE,GAAID,EAAEC,EAAE,EAAG,MAAO,GAErC,MAAO,EACT,CAGA,SAASC,EAAO,EAAmC,CACjD,IAAIC,EAAOC,EACX,KAAOD,IAAS,MAAQA,EAAK,SAAW,MAAM,EAAOA,EAAK,OAC1D,OAAOA,CACT,CA0BA,SAAgBE,EACd,EACA,EACmB,CACnB,IAAMC,EAAQC,GAAS,OAAS,IAChC,GAAI,CAAC,OAAO,UAAUD,CAAK,GAAKA,EAAQ,EACtC,MAAU,WAC8C,oBACxD,EAEF,IAAME,kBAAS,IAAI,QACnB,OAAQ,GAAGC,IAAe,CACxB,IAAMN,EAAOD,EAAOQ,EAAa,CAAC,EAClC,GAAIP,IAAS,KAAM,OAAOQ,MAAcC,EAAG,GAAGH,CAAI,CAAC,EACnD,IAAII,EAAUL,EAAO,IAAIL,CAAI,EACzBU,IAAY,IAAA,KACd,EAAU,CAAC,EACXL,EAAO,IAAIL,EAAMU,CAAO,GAE1B,IAAK,IAAMC,KAASD,EAClB,GAAIf,EAASgB,EAAM,KAAML,CAAI,EAAG,OAAOK,EAAM,MAE/C,IAAMC,EAAQJ,MAAcC,EAAG,GAAGH,CAAI,CAAC,EAGvC,OAFAI,EAAQ,KAAK,CAAE,OAAM,OAAM,CAAC,EACxBA,EAAQ,OAASP,GAAOO,EAAQ,MAAM,EACnCE,CACT,CACF,C"}
@@ -1,2 +1,2 @@
1
- import"./internal/diagnostics.js";import{untrack as e}from"./ownership.js";import{createComputation as t,currentOwner as n}from"./extend/index.js";const r=Symbol(`held`);function i(){for(let e=n();e!==null;e=e.parent)if(e.gate!==null)return e.gate;return null}function a(e,a,o,s,c){n();let l=e,u=a,d=s,f=o?null:i();if(f!==null){let e=!1,t=()=>e?!1:f()?!0:(e=!0,!1);if(u===null){let e=l;l=n=>t()?void 0:e(n)}else{let e=l,n=u,i=d;d=!1,l=n=>t()?r:e(n),u=(e,t)=>{if(e!==r){if(i)i=!1;else return n(e,t===r?void 0:t)}}}}t({kind:`effect`,fn:l,render:o,defer:d,...u===null?{}:{apply:u},...c===void 0?{}:{name:c}})}function o(e,t,n){typeof t==`function`?a(e,t,!1,n?.defer===!0,n?.name):a(e,null,!1,!1,t?.name)}function s(e,t){a(e,t??null,!0,!1,void 0)}function c(t){a(()=>e(t),null,!1,!1,`onMount`)}export{c as onMount,o as useEffect,s as useRenderEffect};
1
+ import"./internal/diagnostics.js";import{untrack as e}from"./ownership.js";import{createComputation as t,currentOwner as n}from"./extend/index.js";function r(e,r,i,a,o){let s=e,c=r,l=a,u=i?null:n()?.gate??null;if(u!==null){let e=!1,t=!1,n=s,r=c,i=l;l=!1,s=r=>(t=!e&&u(),e||=!t,t?void 0:n(r)),r!==null&&(c=(e,n)=>{if(!t){if(!i)return r(e,n);i=!1}})}t({kind:`effect`,fn:s,render:i,defer:l,apply:c??void 0,name:o})}function i(e,t,n){typeof t==`function`?r(e,t,!1,n?.defer===!0,n?.name):r(e,null,!1,!1,t?.name)}function a(e,t){r(e,t??null,!0,!1,void 0)}function o(t){r(()=>e(t),null,!1,!1,`onMount`)}export{o as onMount,i as useEffect,a as useRenderEffect};
2
2
  //# sourceMappingURL=effect.js.map
@@ -1 +1 @@
1
- {"version":3,"file":"effect.js","names":["HELD","nearestGate","owner","currentOwner","createEffect","fn","fnIn","apply","applyIn","defer","deferIn","gate","render","opened","held","inner","previous","innerFn","innerApply","skipFirst","value","createComputation","name","useEffect","second","first","third","useRenderEffect","compute","onMount","untrack"],"sources":["../../src/effect.ts"],"sourcesContent":["import { type Cleanup, createComputation, currentOwner, warn } from \"./extend\";\nimport { untrack } from \"./ownership\";\n\n/**\n * Options of {@link useEffect} in its tracking form `useEffect(fn, options)`.\n * @since 1.0.0\n */\nexport interface EffectOptions {\n /**\n * Label shown by devtools and diagnostics.\n * @default undefined (the effect is unnamed)\n */\n name?: string;\n}\n\n/**\n * Options of {@link useEffect} in its explicit-dependency form `useEffect(deps, fn, options)`.\n * @since 1.0.0\n */\nexport interface DeferredEffectOptions extends EffectOptions {\n /**\n * Skip the first call of `fn`: `deps` is still read (and tracked) on the first run, but `fn` only\n * runs for later changes of it.\n * @default false\n */\n defer?: boolean;\n}\n\n/** What a held effect computes while its gate is closed: nothing for `apply` to act on. */\nconst HELD: unique symbol = Symbol(\"held\");\n\n/** The nearest gate above the current owner (see `Owner.gate`), or null. */\nfunction nearestGate(): (() => boolean) | null {\n for (let owner = currentOwner(); owner !== null; owner = owner.parent) {\n if (owner.gate !== null) return owner.gate;\n }\n return null;\n}\n\nfunction createEffect(\n fnIn: (previous: never) => unknown,\n applyIn: ((value: never, previous: never) => unknown) | null,\n render: boolean,\n deferIn: boolean,\n name: string | undefined,\n): void {\n // Effects never run on the server (G-24): no node, no ownership slot, no cost.\n if (__SERVER__) return;\n if (currentOwner() === null) warn(\"NO_OWNER_EFFECT\");\n let fn = fnIn;\n let apply = applyIn;\n let defer = deferIn;\n const gate = render ? null : nearestGate();\n if (gate !== null) {\n // Held until the gate first opens (a Suspense boundary resolving). The gate is only read until\n // then, so later changes of it never re-run the effect.\n let opened = false;\n const held = (): boolean => {\n if (opened) return false;\n if (gate()) return true;\n opened = true;\n return false;\n };\n if (apply === null) {\n const inner = fn;\n fn = (previous) => (held() ? undefined : inner(previous));\n } else {\n const innerFn = fn;\n const innerApply = apply;\n // `defer` skips the first real run, not the held one, so it is handled here.\n let skipFirst = defer;\n defer = false;\n fn = (previous) => (held() ? HELD : innerFn(previous));\n apply = (value, previous) => {\n if ((value as unknown) === HELD) return undefined;\n if (skipFirst) {\n skipFirst = false;\n return undefined;\n }\n return innerApply(value, ((previous as unknown) === HELD ? undefined : previous) as never);\n };\n }\n }\n createComputation({\n kind: \"effect\",\n fn,\n render,\n defer,\n ...(apply === null ? {} : { apply }),\n ...(name === undefined ? {} : { name }),\n });\n}\n\n/**\n * Runs a side effect after rendering and again whenever a tracked signal changes. The first run\n * is deferred to the next flush. Effects never run on the server. Inside a `<Suspense>` boundary\n * that is still showing its fallback, the first run waits until the boundary first shows its content.\n *\n * Two forms: `useEffect(fn)` tracks everything `fn` reads; `useEffect(deps, fn)` tracks only\n * `deps` and runs `fn` untracked. Return a function to clean up before the next run or disposal.\n * An error thrown by the effect goes to the owner's error handler (`onError`, an error boundary).\n * In development, an effect created outside any owner warns `NO_OWNER_EFFECT`: it still runs, but\n * nothing can dispose it.\n *\n * @param fn The effect. Every signal it reads is tracked. It may return a cleanup function.\n * @param options A devtools name. Undefined uses the default.\n * @example\n * import { useEffect, useSignal } from \"@shadow-js/core\";\n *\n * function PageTitle(props: { unread: number }) {\n * const [title] = useSignal(\"Inbox\");\n * useEffect(() => {\n * document.title = `${title()} (${props.unread})`; // re-runs when either changes\n * });\n * return null;\n * }\n * @see useRenderEffect\n * @see onMount\n * @since 1.0.0\n */\nexport function useEffect(fn: () => void | Cleanup, options?: EffectOptions): void;\n/**\n * Explicit-dependency form of {@link useEffect}: tracks only what `deps` reads, and calls `fn`\n * untracked with the new and the previous value of `deps`. Use it when the effect body reads\n * signals that must not re-run it.\n *\n * @param deps Tracked; its result is passed to `fn`.\n * @param fn Untracked; receives the value of `deps` and its previous value (`undefined` when there\n * is none yet). It may return a cleanup function, which runs before the next call or on disposal.\n * @param options `defer` skips the first call; a devtools name. Undefined uses the defaults.\n * @example\n * import { useEffect } from \"@shadow-js/core\";\n *\n * function Profile(props: { userId: string }) {\n * useEffect(\n * () => props.userId,\n * (next, previous) => console.log(`switched from ${previous} to ${next}`),\n * { defer: true }, // not called for the first id\n * );\n * return null;\n * }\n * @see useEffect\n * @since 1.0.0\n */\nexport function useEffect<T>(\n deps: () => T,\n fn: (value: T, previous: T | undefined) => void | Cleanup,\n options?: DeferredEffectOptions,\n): void;\nexport function useEffect(\n first: () => unknown,\n second?: unknown,\n third?: DeferredEffectOptions,\n): void {\n if (typeof second === \"function\") {\n createEffect(\n first,\n second as (value: never, previous: never) => unknown,\n false,\n third?.defer === true,\n third?.name,\n );\n } else {\n if (Array.isArray(second)) warn(\"EFFECT_DEPS_IGNORED\");\n createEffect(first, null, false, false, (second as EffectOptions | undefined)?.name);\n }\n}\n\n/**\n * Like {@link useEffect} but belongs to the render phase: it runs synchronously when created and\n * before user effects on every flush. Used for DOM bindings; application code rarely needs it.\n * It is not held by a pending `<Suspense>` boundary, and it never runs on the server. In\n * development, one created outside any owner warns `NO_OWNER_EFFECT`.\n *\n * @param compute Tracked; its result is passed to `apply`. Without `apply`, it is the effect itself\n * and may return a cleanup function.\n * @param apply Untracked; receives the value and the previous value (`undefined` on the first\n * run), and may return a cleanup function. Undefined: only `compute` runs.\n * @example\n * import { createRoot, useRenderEffect, useSignal } from \"@shadow-js/core\";\n *\n * const button = document.createElement(\"button\");\n * createRoot(() => {\n * const [label] = useSignal(\"Save\");\n * useRenderEffect(label, (text) => {\n * button.textContent = text; // runs now, and again when label changes\n * });\n * });\n * @see useEffect\n * @since 1.0.0\n */\nexport function useRenderEffect<T>(\n compute: () => T,\n apply?: (value: T, previous: T | undefined) => void | Cleanup,\n): void {\n createEffect(\n compute,\n (apply ?? null) as ((value: never, previous: never) => unknown) | null,\n true,\n false,\n undefined,\n );\n}\n\n/**\n * Runs `fn` once after the owner has been created and flushed, untracked, so signal changes never\n * run it again. Its return value, if a function, is the cleanup, which runs when the owner is\n * disposed. Never runs on the server. Like {@link useEffect}, it waits for a pending `<Suspense>`\n * boundary to show its content, and warns `NO_OWNER_EFFECT` in development outside any owner.\n *\n * @param fn Runs once, untracked. It may return a cleanup function.\n * @example\n * import { onMount } from \"@shadow-js/core\";\n *\n * function SearchBox() {\n * let input: HTMLInputElement | undefined;\n * onMount(() => input?.focus());\n * return <input ref={(el: HTMLInputElement) => (input = el)} />;\n * }\n * @see useEffect\n * @since 1.0.0\n */\nexport function onMount(fn: () => void | Cleanup): void {\n createEffect(() => untrack(fn), null, false, false, \"onMount\");\n}\n"],"mappings":"A,mJA6BA,MAAMA,EAAsB,OAAO,MAAM,EAGzC,SAASC,GAAsC,CAC7C,IAAK,IAAIC,EAAQC,EAAa,EAAGD,IAAU,KAAM,EAAQA,EAAM,OAC7D,GAAIA,EAAM,OAAS,KAAM,OAAOA,EAAM,KAExC,OAAO,IACT,CAEA,SAASE,EACP,EACA,EACA,EACA,EACA,EACM,CAGFD,EAAa,EACjB,IAAIE,EAAKC,EACLC,EAAQC,EACRC,EAAQC,EACNC,EAAOC,EAAS,KAAOX,EAAY,EACzC,GAAIU,IAAS,KAAM,CAGjB,IAAIE,EAAS,GACPC,MACAD,EAAe,GACfF,EAAK,EAAU,IACnB,EAAS,GACF,IAET,GAAIJ,IAAU,KAAM,CAClB,IAAMQ,EAAQV,EACd,EAAM,GAAcS,EAAK,EAAI,IAAA,GAAYC,EAAMC,CAAQ,CACzD,KAAO,CACL,IAAMC,EAAUZ,EACVa,EAAaX,EAEfY,EAAYV,EAChB,EAAQ,GACR,EAAM,GAAcK,EAAK,EAAId,EAAOiB,EAAQD,CAAQ,EACpD,GAAS,EAAO,IAAa,CAC3B,GAAKI,IAAsBpB,EAC3B,IAAImB,EACF,EAAY,QAGd,OAAOD,EAAWE,EAASJ,IAAyBhB,EAAO,IAAA,GAAYgB,CAAkB,CADzF,CAEF,CACF,CACF,CACAK,EAAkB,CAChB,KAAM,SACN,KACA,SACA,QACA,GAAId,IAAU,KAAO,CAAC,EAAI,CAAE,OAAM,EAClC,GAAIe,IAAS,IAAA,GAAY,CAAC,EAAI,CAAE,MAAK,CACvC,CAAC,CACH,CA0DA,SAAgBC,EACd,EACA,EACA,EACM,CACF,OAAOC,GAAW,WACpBpB,EACEqB,EACAD,EACA,GACAE,GAAO,QAAU,GACjBA,GAAO,IACT,EAGAtB,EAAaqB,EAAO,KAAM,GAAO,GAAQD,GAAsC,IAAI,CAEvF,CAyBA,SAAgBG,EACd,EACA,EACM,CACNvB,EACEwB,EACCrB,GAAS,KACV,GACA,GACA,IAAA,EACF,CACF,CAoBA,SAAgBsB,EAAQ,EAAgC,CACtDzB,MAAmB0B,EAAQzB,CAAE,EAAG,KAAM,GAAO,GAAO,SAAS,CAC/D,C"}
1
+ {"version":3,"file":"effect.js","names":["createEffect","fn","fnIn","apply","applyIn","defer","deferIn","gate","render","currentOwner","opened","closed","innerFn","innerApply","skipFirst","previous","value","createComputation","useEffect","second","first","third","useRenderEffect","compute","onMount","untrack"],"sources":["../../src/effect.ts"],"sourcesContent":["import { type Cleanup, createComputation, currentOwner, warn } from \"./extend\";\nimport { untrack } from \"./ownership\";\n\n/**\n * Options of {@link useEffect} in its tracking form `useEffect(fn, options)`.\n * @since 1.0.0\n */\nexport interface EffectOptions {\n /**\n * Label shown by devtools and diagnostics.\n * @default undefined (the effect is unnamed)\n */\n name?: string;\n}\n\n/**\n * Options of {@link useEffect} in its explicit-dependency form `useEffect(deps, fn, options)`.\n * @since 1.0.0\n */\nexport interface DeferredEffectOptions extends EffectOptions {\n /**\n * Skip the first call of `fn`: `deps` is still read (and tracked) on the first run, but `fn` only\n * runs for later changes of it.\n * @default false\n */\n defer?: boolean;\n}\n\nfunction createEffect(\n fnIn: (previous: never) => unknown,\n applyIn: ((value: never, previous: never) => unknown) | null,\n render: boolean,\n deferIn: boolean,\n name: string | undefined,\n): void {\n // Effects never run on the server (G-24): no node, no ownership slot, no cost.\n if (__SERVER__) return;\n if (__DEV__ && currentOwner() === null) warn(\"NO_OWNER_EFFECT\");\n let fn = fnIn;\n let apply = applyIn;\n let defer = deferIn;\n const gate = render ? null : (currentOwner()?.gate ?? null);\n if (gate !== null) {\n // Held until the gate first opens (a Suspense boundary resolving). The gate is only read until\n // then, so later changes of it never re-run the effect. `closed` is what the latest run of `fn`\n // found: `apply` runs right after it, and does nothing for a run that was held.\n let opened = false;\n let closed = false;\n const innerFn = fn;\n const innerApply = apply;\n // `defer` skips the first real run, not the held one, so it is handled here.\n let skipFirst = defer;\n defer = false;\n fn = (previous) => {\n closed = !opened && gate();\n opened ||= !closed;\n return closed ? undefined : innerFn(previous);\n };\n if (innerApply !== null) {\n apply = (value, previous) => {\n if (closed) return undefined;\n if (!skipFirst) return innerApply(value, previous);\n skipFirst = false;\n return undefined;\n };\n }\n }\n createComputation({\n kind: \"effect\",\n fn,\n render,\n defer,\n apply: apply ?? undefined,\n name,\n });\n}\n\n/**\n * Runs a side effect after rendering and again whenever a tracked signal changes. The first run\n * is deferred to the next flush. Effects never run on the server. Inside a `<Suspense>` boundary\n * that is still showing its fallback, the first run waits until the boundary first shows its content.\n *\n * Two forms: `useEffect(fn)` tracks everything `fn` reads; `useEffect(deps, fn)` tracks only\n * `deps` and runs `fn` untracked. Return a function to clean up before the next run or disposal.\n * An error thrown by the effect goes to the owner's error handler (`onError`, an error boundary).\n * In development, an effect created outside any owner warns `NO_OWNER_EFFECT`: it still runs, but\n * nothing can dispose it.\n *\n * @param fn The effect. Every signal it reads is tracked. It may return a cleanup function.\n * @param options A devtools name. Undefined uses the default.\n * @example\n * import { useEffect, useSignal } from \"@shadow-js/core\";\n *\n * function PageTitle(props: { unread: number }) {\n * const [title] = useSignal(\"Inbox\");\n * useEffect(() => {\n * document.title = `${title()} (${props.unread})`; // re-runs when either changes\n * });\n * return null;\n * }\n * @see useRenderEffect\n * @see onMount\n * @since 1.0.0\n */\nexport function useEffect(fn: () => void | Cleanup, options?: EffectOptions): void;\n/**\n * Explicit-dependency form of {@link useEffect}: tracks only what `deps` reads, and calls `fn`\n * untracked with the new and the previous value of `deps`. Use it when the effect body reads\n * signals that must not re-run it.\n *\n * @param deps Tracked; its result is passed to `fn`.\n * @param fn Untracked; receives the value of `deps` and its previous value (`undefined` when there\n * is none yet). It may return a cleanup function, which runs before the next call or on disposal.\n * @param options `defer` skips the first call; a devtools name. Undefined uses the defaults.\n * @example\n * import { useEffect } from \"@shadow-js/core\";\n *\n * function Profile(props: { userId: string }) {\n * useEffect(\n * () => props.userId,\n * (next, previous) => console.log(`switched from ${previous} to ${next}`),\n * { defer: true }, // not called for the first id\n * );\n * return null;\n * }\n * @see useEffect\n * @since 1.0.0\n */\nexport function useEffect<T>(\n deps: () => T,\n fn: (value: T, previous: T | undefined) => void | Cleanup,\n options?: DeferredEffectOptions,\n): void;\nexport function useEffect(\n first: () => unknown,\n second?: unknown,\n third?: DeferredEffectOptions,\n): void {\n if (typeof second === \"function\") {\n createEffect(\n first,\n second as (value: never, previous: never) => unknown,\n false,\n third?.defer === true,\n third?.name,\n );\n } else {\n if (Array.isArray(second)) warn(\"EFFECT_DEPS_IGNORED\");\n createEffect(first, null, false, false, (second as EffectOptions | undefined)?.name);\n }\n}\n\n/**\n * Like {@link useEffect} but belongs to the render phase: it runs synchronously when created and\n * before user effects on every flush. Used for DOM bindings; application code rarely needs it.\n * It is not held by a pending `<Suspense>` boundary, and it never runs on the server. In\n * development, one created outside any owner warns `NO_OWNER_EFFECT`.\n *\n * @param compute Tracked; its result is passed to `apply`. Without `apply`, it is the effect itself\n * and may return a cleanup function.\n * @param apply Untracked; receives the value and the previous value (`undefined` on the first\n * run), and may return a cleanup function. Undefined: only `compute` runs.\n * @example\n * import { createRoot, useRenderEffect, useSignal } from \"@shadow-js/core\";\n *\n * const button = document.createElement(\"button\");\n * createRoot(() => {\n * const [label] = useSignal(\"Save\");\n * useRenderEffect(label, (text) => {\n * button.textContent = text; // runs now, and again when label changes\n * });\n * });\n * @see useEffect\n * @since 1.0.0\n */\nexport function useRenderEffect<T>(\n compute: () => T,\n apply?: (value: T, previous: T | undefined) => void | Cleanup,\n): void {\n createEffect(\n compute,\n (apply ?? null) as ((value: never, previous: never) => unknown) | null,\n true,\n false,\n undefined,\n );\n}\n\n/**\n * Runs `fn` once after the owner has been created and flushed, untracked, so signal changes never\n * run it again. Its return value, if a function, is the cleanup, which runs when the owner is\n * disposed. Never runs on the server. Like {@link useEffect}, it waits for a pending `<Suspense>`\n * boundary to show its content, and warns `NO_OWNER_EFFECT` in development outside any owner.\n *\n * @param fn Runs once, untracked. It may return a cleanup function.\n * @example\n * import { onMount } from \"@shadow-js/core\";\n *\n * function SearchBox() {\n * let input: HTMLInputElement | undefined;\n * onMount(() => input?.focus());\n * return <input ref={(el: HTMLInputElement) => (input = el)} />;\n * }\n * @see useEffect\n * @since 1.0.0\n */\nexport function onMount(fn: () => void | Cleanup): void {\n createEffect(() => untrack(fn), null, false, false, \"onMount\");\n}\n"],"mappings":"A,mJA4BA,SAASA,EACP,EACA,EACA,EACA,EACA,EACM,CAIN,IAAIC,EAAKC,EACLC,EAAQC,EACRC,EAAQC,EACNC,EAAOC,EAAS,KAAQC,EAAa,CAAC,EAAE,MAAQ,KACtD,GAAIF,IAAS,KAAM,CAIjB,IAAIG,EAAS,GACTC,EAAS,GACPC,EAAUX,EACVY,EAAaV,EAEfW,EAAYT,EAChB,EAAQ,GACR,EAAM,IACJ,EAAS,CAACK,GAAUH,EAAK,EACzB,IAAW,CAACI,EACLA,EAAS,IAAA,GAAYC,EAAQG,CAAQ,GAE1CF,IAAe,OACjB,GAAS,EAAO,IAAa,CAC3B,GAAI,GACJ,IAAI,CAACC,EAAW,OAAOD,EAAWG,EAAOD,CAAQ,EACjD,EAAY,EADqC,CAGnD,EAEJ,CACAE,EAAkB,CAChB,KAAM,SACN,KACA,SACA,QACA,MAAOd,GAAS,IAAA,GAChB,MACF,CAAC,CACH,CA0DA,SAAgBe,EACd,EACA,EACA,EACM,CACF,OAAOC,GAAW,WACpBnB,EACEoB,EACAD,EACA,GACAE,GAAO,QAAU,GACjBA,GAAO,IACT,EAGArB,EAAaoB,EAAO,KAAM,GAAO,GAAQD,GAAsC,IAAI,CAEvF,CAyBA,SAAgBG,EACd,EACA,EACM,CACNtB,EACEuB,EACCpB,GAAS,KACV,GACA,GACA,IAAA,EACF,CACF,CAoBA,SAAgBqB,EAAQ,EAAgC,CACtDxB,MAAmByB,EAAQxB,CAAE,EAAG,KAAM,GAAO,GAAO,SAAS,CAC/D,C"}
@@ -1,2 +1,2 @@
1
- import{DEVTOOLS_EVENT as e,report as t}from"../internal/devtools.js";import{MESSAGES as n,formatMessage as r}from"../internal/messages.js";import{ShadowError as i,resetWarningDedupe as a,setWarningListener as o,warn as s}from"../internal/diagnostics.js";import{rt as c}from"../internal/state.js";import{Owner as l,addCleanup as u,handleError as d}from"../internal/owner.js";import{enqueue as f}from"../internal/queue.js";import{Computation as p,Signal as m,hasObservers as h,markObservers as g,observersOf as _,readMemo as v,readSignal as y,recompute as b,sourcesOf as x,track as S,updateIfNecessary as C}from"../internal/graph.js";import{batch as w,flush as T,flushSync as E,group as D,schedule as O}from"../internal/scheduler.js";import{runWithContext as k}from"../context.js";import{disposeTree as A}from"../internal/dispose.js";import{SUSPENSION as j,isSuspension as M}from"../internal/suspension.js";import{beginHold as ee,createTransitionHold as N,endHold as P,holdReader as F,inTransition as I,pauseOwner as L,registerTransitionLane as R,resumeOwner as z,startTransition as B,transitionHooks as V,wakeSuspended as H}from"../internal/concurrency.js";import{isHydrating as U,withHydration as W}from"../internal/hydration-flag.js";function G(){return c.owner}function K(){return c.listener}function q(){return c.listener!==null}function J(){return c.disposing===0&&c.running!==null&&c.running.kind===1&&!(c.running.flags&256)}function Y(e,t){let n=c.owner,r=c.listener;try{let n=e.owner;n!==void 0&&(c.owner=n);let r=e.listener;return r!==void 0&&(c.listener=r),t()}finally{c.owner=n,c.listener=r}}function X(e,t,n){return new m(e,t,n)}function Z(e,t,n){let r=e.equals;return r!==!1&&r(e.value,t)?!1:(e.value=t,Q(e),!0)}function Q(e){h(e)&&(g(e),O())}function $(e){let t=e.owner===void 0?c.owner:e.owner;if(e.kind===`memo`){let n=new p(t,1,32|(e.allowWrites===!0?256:0),e.fn,e.equals??Object.is,e.name);return e.lazy!==!0&&C(n),n}let n=(e.render===!0?16:0)|(e.defer===!0?64:0)|(e.lane===!0?512:0),r=new p(t,2,n,e.fn,!1,e.name);return r.apply=e.apply??null,e.render===!0?b(r):(f(r),O()),r}function te(e){return v(e)}function ne(e){C(e)}function re(e){return new l(e===void 0?c.owner:e)}export{p as ComputationNode,e as DEVTOOLS_EVENT,n as MESSAGES,l as Owner,j as SUSPENSION,i as ShadowError,m as SignalNode,u as addCleanup,w as batch,ee as beginHold,$ as createComputation,re as createOwner,X as createSignalNode,N as createTransitionHold,K as currentListener,G as currentOwner,t as devtoolsReport,A as disposeOwner,P as endHold,T as flush,E as flushSync,r as formatMessage,D as group,d as handleError,F as holdReader,I as inTransition,J as isComputingMemo,U as isHydrating,M as isSuspension,q as isTracking,g as markObservers,Q as notify,_ as observersOf,L as pauseOwner,te as readComputation,y as readSignal,ne as refresh,R as registerTransitionLane,a as resetWarningDedupe,z as resumeOwner,Y as runInScope,k as runWithContext,O as schedule,o as setWarningListener,x as sourcesOf,B as startTransition,S as track,V as transitionHooks,H as wakeSuspended,s as warn,W as withHydration,Z as writeSignal};
1
+ import{DEVTOOLS_EVENT as e,report as t}from"../internal/devtools.js";import{MESSAGES as n,formatMessage as r}from"../internal/messages.js";import{ShadowError as i,resetWarningDedupe as a,setWarningListener as o,warn as s}from"../internal/diagnostics.js";import{rt as c}from"../internal/state.js";import{Owner as l,addCleanup as u,handleError as d}from"../internal/owner.js";import{enqueue as f}from"../internal/queue.js";import{Computation as p,Signal as m,hasObservers as h,isEqual as g,markObservers as _,observersOf as v,readMemo as y,readSignal as b,recompute as x,sourcesOf as S,track as C,updateIfNecessary as w}from"../internal/graph.js";import{batch as T,flush as E,flushSync as D,group as O,schedule as k}from"../internal/scheduler.js";import{runWithContext as A}from"../context.js";import{disposeTree as j}from"../internal/dispose.js";import{SUSPENSION as M,isSuspension as ee}from"../internal/suspension.js";import{beginHold as N,createTransitionHold as P,endHold as F,holdReader as I,inTransition as L,pauseOwner as R,registerTransitionLane as z,resumeOwner as B,startTransition as V,transitionHooks as H,wakeSuspended as U}from"../internal/concurrency.js";import{isHydrating as W,withHydration as G}from"../internal/hydration-flag.js";function K(){return c.owner}function q(){return c.listener}function J(){return c.listener!==null}function Y(){return c.disposing===0&&c.running!==null&&c.running.kind===1&&!(c.running.flags&256)}function X(e,t){let n=c.owner,r=c.listener;try{let n=e.owner;n!==void 0&&(c.owner=n);let r=e.listener;return r!==void 0&&(c.listener=r),t()}finally{c.owner=n,c.listener=r}}function Z(e,t,n){return new m(e,t,n)}function Q(e,t,n){let r=e.equals;return r!==!1&&g(r,e.value,t)?!1:(e.value=t,$(e),!0)}function $(e){h(e)&&(_(e),k())}function te(e){let t=e.owner===void 0?c.owner:e.owner,n=e.kind===`memo`,r=new p(t,n?1:2,n?32|(e.allowWrites===!0?256:0):(e.render===!0?16:0)|(e.defer===!0?64:0)|(e.lane===!0?512:0),e.fn,n?e.equals??Object.is:!1,e.name);return n?(e.lazy!==!0&&w(r),r):(r.apply=e.apply??null,e.render===!0?x(r):(f(r),k()),r)}function ne(e){return y(e)}function re(e){w(e)}function ie(e){return new l(e===void 0?c.owner:e)}export{p as ComputationNode,e as DEVTOOLS_EVENT,n as MESSAGES,l as Owner,M as SUSPENSION,i as ShadowError,m as SignalNode,u as addCleanup,T as batch,N as beginHold,te as createComputation,ie as createOwner,Z as createSignalNode,P as createTransitionHold,q as currentListener,K as currentOwner,t as devtoolsReport,j as disposeOwner,F as endHold,E as flush,D as flushSync,r as formatMessage,O as group,d as handleError,I as holdReader,L as inTransition,Y as isComputingMemo,W as isHydrating,ee as isSuspension,J as isTracking,_ as markObservers,$ as notify,v as observersOf,R as pauseOwner,ne as readComputation,b as readSignal,re as refresh,z as registerTransitionLane,a as resetWarningDedupe,B as resumeOwner,X as runInScope,A as runWithContext,k as schedule,o as setWarningListener,S as sourcesOf,V as startTransition,C as track,H as transitionHooks,U as wakeSuspended,s as warn,G as withHydration,Q as writeSignal};
2
2
  //# sourceMappingURL=index.js.map
@@ -1 +1 @@
1
- {"version":3,"file":"index.js","names":["OwnerClass","currentOwner","rt","currentListener","isTracking","isComputingMemo","runInScope","owner","listener","nextOwner","scope","nextListener","fn","createSignalNode","Signal","value","equals","name","writeSignal","signal","next","notify","hasObservers","source","markObservers","schedule","createComputation","options","node","Computation","updateIfNecessary","flags","recompute","enqueue","readComputation","readMemo","refresh","createOwner","Owner","parent","DEVTOOLS_EVENT","MESSAGES","SUSPENSION","ShadowError","addCleanup","batch","beginHold","createTransitionHold","report","disposeTree","endHold","flush","flushSync","formatMessage","group","handleError","holdReader","inTransition","isHydrating","isSuspension","observersOf","pauseOwner","readSignal","registerTransitionLane","resetWarningDedupe","resumeOwner","runWithContext","setWarningListener","sourcesOf","startTransition","track","transitionHooks","wakeSuspended","warn","withHydration"],"sources":["../../../src/extend.ts"],"sourcesContent":["/**\n * The extension API: everything the built-in hooks (`useSignal`, `useMemo`, `useEffect`,\n * `useStore`, `useResource`, `mapArray`, `useSelector`, contexts, ...) are built from. They import\n * ONLY this module, never the engine internals, so a third-party package can create hooks with the\n * same behavior, performance and diagnostics. A test (`public-api.test.ts`) enforces that.\n *\n * Import from `@shadow-js/core/extend`. These functions are stable but low level: prefer the hooks\n * unless you are building a new primitive.\n *\n * @packageDocumentation\n */\n\nimport { DEVTOOLS_EVENT, report } from \"./internal/devtools\";\nimport { ShadowError } from \"./internal/diagnostics\";\nimport {\n FLAG_ALLOW_WRITES,\n FLAG_DEFER,\n FLAG_LANE,\n FLAG_RENDER,\n FLAG_UNINIT,\n KIND_EFFECT,\n KIND_MEMO,\n} from \"./internal/flags\";\nimport {\n Computation,\n hasObservers,\n markObservers,\n observersOf,\n readMemo,\n readSignal,\n recompute,\n Signal,\n type Source,\n sourcesOf,\n track,\n updateIfNecessary,\n} from \"./internal/graph\";\nimport { type Owner, Owner as OwnerClass } from \"./internal/owner\";\nimport { enqueue } from \"./internal/queue\";\nimport { schedule } from \"./internal/scheduler\";\nimport { rt } from \"./internal/state\";\nimport type { Equals } from \"./internal/types\";\n\nexport { runWithContext } from \"./context\";\nexport {\n beginHold,\n createTransitionHold,\n endHold,\n holdReader,\n inTransition,\n pauseOwner,\n registerTransitionLane,\n resumeOwner,\n startTransition,\n transitionHooks,\n wakeSuspended,\n} from \"./internal/concurrency\";\nexport { DEVTOOLS_EVENT, report as devtoolsReport } from \"./internal/devtools\";\nexport type { WarningListener } from \"./internal/diagnostics\";\nexport { resetWarningDedupe, ShadowError, setWarningListener, warn } from \"./internal/diagnostics\";\nexport { disposeTree as disposeOwner } from \"./internal/dispose\";\nexport { isHydrating, withHydration } from \"./internal/hydration-flag\";\nexport type { MessageCode } from \"./internal/messages\";\nexport { formatMessage, MESSAGES } from \"./internal/messages\";\nexport type { ContextMap } from \"./internal/owner\";\nexport { addCleanup, handleError, Owner } from \"./internal/owner\";\nexport { batch, flush, flushSync, group } from \"./internal/scheduler\";\nexport type {\n BoundaryHold,\n SlotBranch,\n SlotChoice,\n SlotOwned,\n SlotState,\n SlotSwap,\n TransitionHold,\n} from \"./internal/state\";\nexport { isSuspension, SUSPENSION } from \"./internal/suspension\";\nexport type {\n Accessor,\n AnyFunction,\n Cleanup,\n Equals,\n ErrorHandler,\n Setter,\n} from \"./internal/types\";\nexport type { Source as SourceNode };\nexport { Computation as ComputationNode, Signal as SignalNode };\n\n// ---------- registers ----------\n\n/**\n * Returns the owner that adopts nodes created right now. The extension-API form of `getOwner`: use\n * it in a primitive that attaches a node or a cleanup to its caller's owner.\n *\n * @returns The current owner, or `null` outside any owner.\n * @example\n * import { addCleanup, currentOwner } from \"@shadow-js/core/extend\";\n *\n * function useInterval(fn: () => void, ms: number): void {\n * const timer = setInterval(fn, ms);\n * const owner = currentOwner();\n * if (owner !== null) addCleanup(owner, () => clearInterval(timer));\n * }\n * @see createOwner\n * @since 1.0.0\n */\nexport function currentOwner(): Owner | null {\n return rt.owner;\n}\n\n/**\n * Returns the computation that records reads right now. Use it in a primitive whose read behaves\n * differently for a tracked reader, for example one that holds a boundary only for a listening\n * memo or effect.\n *\n * @returns The listening memo or effect, or `null` when reads are untracked.\n * @example\n * import { currentListener } from \"@shadow-js/core/extend\";\n *\n * function readWithStats<T>(read: () => T, stats: { tracked: number }): T {\n * if (currentListener() !== null) stats.tracked += 1;\n * return read();\n * }\n * @see isTracking\n * @since 1.0.0\n */\nexport function currentListener(): Computation | null {\n return rt.listener;\n}\n\n/**\n * Says whether reads are being recorded as dependencies right now. Use it to skip subscription\n * work, or to warn, when a primitive is read outside an effect or a memo.\n *\n * @returns `true` while an effect or a memo runs tracked, `false` otherwise (module scope,\n * `untrack`, event handlers).\n * @example\n * import { untrack, useMemo } from \"@shadow-js/core\";\n * import { isTracking } from \"@shadow-js/core/extend\";\n *\n * const inMemo = useMemo(() => isTracking());\n * console.log(inMemo(), untrack(() => isTracking())); // true false\n * @see currentListener\n * @since 1.0.0\n */\nexport function isTracking(): boolean {\n return rt.listener !== null;\n}\n\n/**\n * Says whether a memo (not an effect) is computing right now: writing signals is a mistake there.\n * Cleanups that run while a memo tears down rows or children may write, so a disposal in progress\n * is not a violation, and neither is a memo created with `allowWrites`. Use it to guard a custom\n * write path the way {@link writeSignal} does.\n *\n * @returns `true` while a memo without `allowWrites` computes and no disposal is running.\n * @example\n * import { isComputingMemo, ShadowError } from \"@shadow-js/core/extend\";\n *\n * function appendLog(log: string[], entry: string): void {\n * if (isComputingMemo()) throw new ShadowError(\"WRITE_IN_MEMO\");\n * log.push(entry);\n * }\n * @since 1.0.0\n */\nexport function isComputingMemo(): boolean {\n return (\n rt.disposing === 0 &&\n rt.running !== null &&\n rt.running.kind === KIND_MEMO &&\n (rt.running.flags & FLAG_ALLOW_WRITES) === 0\n );\n}\n\n/**\n * Runs `fn` with the given owner and listener in effect, and restores both afterward, even when\n * `fn` throws. The low-level form of `runWithOwner` and `untrack`; unlike `runWithOwner` it does\n * not check whether the owner is disposed.\n *\n * @param scope `owner` and `listener` to install. For each, `undefined` (or absent) keeps the\n * current one and `null` clears it.\n * Getters are evaluated once; a failed getter restores the original scope.\n * @param fn The function to run.\n * @returns Whatever `fn` returns. An error thrown by `fn` propagates after the registers are\n * restored.\n * @example\n * import { onCleanup } from \"@shadow-js/core\";\n * import { createOwner, disposeOwner, runInScope } from \"@shadow-js/core/extend\";\n *\n * const owner = createOwner(null);\n * runInScope({ owner, listener: null }, () => {\n * onCleanup(() => console.log(\"released\"));\n * });\n * disposeOwner(owner); // logs \"released\"\n * @see createOwner\n * @since 1.0.0\n */\nexport function runInScope<T>(\n scope: { owner?: Owner | null; listener?: Computation | null },\n fn: () => T,\n): T {\n const owner = rt.owner;\n const listener = rt.listener;\n try {\n const nextOwner = scope.owner;\n if (nextOwner !== undefined) rt.owner = nextOwner;\n const nextListener = scope.listener;\n if (nextListener !== undefined) rt.listener = nextListener;\n return fn();\n } finally {\n rt.owner = owner;\n rt.listener = listener;\n }\n}\n\n// ---------- reactive cells ----------\n\n/**\n * Creates the storage of a signal: its value, its equality and the observers that read it. Read it\n * with `readSignal` and write it with {@link writeSignal}; `useSignal` is built this way.\n *\n * @param value Initial value.\n * @param equals Decides whether a write is a change: readers are notified only when it returns\n * `false`. `false` notifies on every write.\n * @param name Label shown by devtools. Undefined leaves the signal unnamed.\n * @returns The signal node. It has no owner: it lives as long as something references it.\n * @example\n * import { createSignalNode, readSignal, writeSignal } from \"@shadow-js/core/extend\";\n *\n * const temperature = createSignalNode<number>(20, Object.is, \"temperature\");\n * const read = () => readSignal(temperature);\n * writeSignal(temperature, 21);\n * console.log(read()); // 21\n * @see writeSignal\n * @since 1.0.0\n */\nexport function createSignalNode<T>(value: T, equals: Equals<T>, name?: string): Signal<T> {\n return new Signal<T>(value, equals, name);\n}\n\n/**\n * Options of {@link writeSignal}.\n * @since 1.0.0\n */\nexport interface WriteOptions {\n /**\n * Permit the write while a memo computes, for bookkeeping signals owned by a primitive (a\n * Suspense counter, a resource's state). Turns the development `WRITE_IN_MEMO` check off for\n * this write.\n * @default false\n */\n allowInMemo?: boolean;\n}\n\n/**\n * Stores a new value in a signal node and notifies its readers when the value differs by the\n * signal's equality. Effects that read it run on the next flush; memos recompute on their next\n * read.\n *\n * @param signal The node, from {@link createSignalNode}.\n * @param next The new value. A function is stored as is: there is no updater form.\n * @param options `allowInMemo` permits the write while a memo computes. Undefined uses the default.\n * @returns `true` when the value changed and was stored, `false` when the equality kept the old\n * value (nobody is notified then).\n * @throws ShadowError `WRITE_IN_MEMO`, in development builds only, when a memo is computing and\n * `allowInMemo` is not set.\n * @example\n * import { createSignalNode, writeSignal } from \"@shadow-js/core/extend\";\n *\n * const status = createSignalNode<string>(\"idle\", Object.is);\n * console.log(writeSignal(status, \"loading\")); // true\n * console.log(writeSignal(status, \"loading\")); // false: an equal value notifies nobody\n * @see notify\n * @since 1.0.0\n */\nexport function writeSignal<T>(signal: Signal<T>, next: T, options?: WriteOptions): boolean {\n if (__DEV__ && options?.allowInMemo !== true && isComputingMemo()) {\n throw new ShadowError(\"WRITE_IN_MEMO\");\n }\n const equals = signal.equals;\n if (equals !== false && equals(signal.value, next)) return false;\n signal.value = next;\n if (__DEV__) {\n report(DEVTOOLS_EVENT.SIGNAL_WRITTEN, signal, next, rt.running, observersOf(signal));\n }\n notify(signal);\n return true;\n}\n\n/**\n * Marks the observers of `source` stale and schedules a flush. Call it after changing a source's\n * value in place (for example after mutating an array a signal node holds), where\n * {@link writeSignal} cannot see the change.\n *\n * @param source A signal or memo node. A source nobody observes is left alone.\n * @example\n * import { createSignalNode, notify } from \"@shadow-js/core/extend\";\n *\n * const list = createSignalNode<string[]>([], false);\n * list.value.push(\"milk\"); // an in-place change: no equality can see it\n * notify(list); // the readers of `list` run again\n * @see writeSignal\n * @since 1.0.0\n */\nexport function notify(source: Source): void {\n if (!hasObservers(source)) return;\n markObservers(source);\n schedule();\n}\n\nexport { markObservers, observersOf, readSignal, schedule, sourcesOf, track };\n\n// ---------- computations (memos and effects) ----------\n\n/**\n * Options of {@link createComputation}.\n * @since 1.0.0\n */\nexport interface ComputationOptions {\n /**\n * `\"memo\"` creates a cached value that readers pull with {@link readComputation}; `\"effect\"`\n * creates a side effect that the scheduler runs.\n */\n kind: \"memo\" | \"effect\";\n /**\n * The computation. It is tracked: every source it reads becomes a dependency. It receives the\n * previous value (a memo's last value, or an effect's last computed value when `apply` is set;\n * `undefined` otherwise). A memo stores its result; an effect without `apply` may return a\n * cleanup function.\n */\n fn: (previous: never) => unknown;\n /**\n * Memos: decides whether a recomputation changed the value; readers are notified only when it\n * returns `false`, and `false` always propagates. Ignored for effects.\n * @default Object.is\n */\n equals?: Equals<unknown>;\n /**\n * Label shown by devtools and diagnostics.\n * @default undefined (the node is unnamed)\n */\n name?: string;\n /**\n * Effects: run in the render phase, synchronously at creation and before user effects in each\n * flush. Ignored for memos.\n * @default false\n */\n render?: boolean;\n /**\n * Effects with `apply`: skip the first call of `apply`; `fn` still runs and tracks.\n * @default false\n */\n defer?: boolean;\n /**\n * Memos: do not compute until the first read.\n * @default false (the memo computes once at creation)\n */\n lazy?: boolean;\n /**\n * Memos that run component setup (such as a hot-reload wrapper): writing signals inside is\n * legitimate there, so the dev-mode write guard stays off.\n * @default false\n */\n allowWrites?: boolean;\n /**\n * Effects: second stage, run untracked with the value `fn` computed and the previous one. It may\n * return a cleanup function.\n * @default undefined (`fn` is the whole effect)\n */\n apply?: (value: never, previous: never) => unknown;\n /**\n * Owner to attach to. `null` creates a node that no owner disposes.\n * @default the current owner\n */\n owner?: Owner | null;\n /**\n * Effects: always run in the transition lane (the watcher behind `useDeferredValue`).\n * @default false\n */\n lane?: boolean;\n}\n\n/**\n * Creates a memo or effect node: the building block of `useMemo`, `useEffect` and the render\n * effects of a renderer. Memos compute immediately unless `lazy`; render effects run immediately;\n * user effects are queued for the next flush. The node is owned and disposed with its owner.\n * Errors of a memo are stored and rethrown to its readers; errors of an effect go to the owner's\n * error handler.\n *\n * @param options What to create, how it runs and where it is owned.\n * @returns The node. Read a memo with {@link readComputation}; an effect needs no handle.\n * @throws The error of a render effect's first run when no error handler takes it and no flush is\n * running.\n * @example\n * import { createComputation, createSignalNode, readComputation, readSignal, writeSignal } from \"@shadow-js/core/extend\";\n *\n * const price = createSignalNode<number>(10, Object.is);\n * const withTax = createComputation({ kind: \"memo\", fn: () => readSignal(price) * 1.2 });\n * createComputation({\n * kind: \"effect\",\n * fn: () => console.log(readComputation<number>(withTax)),\n * });\n * writeSignal(price, 20); // the effect logs 24 on the next flush\n * @see readComputation\n * @since 1.0.0\n */\nexport function createComputation(options: ComputationOptions): Computation {\n const owner = options.owner === undefined ? rt.owner : options.owner;\n if (options.kind === \"memo\") {\n const node = new Computation(\n owner,\n KIND_MEMO,\n FLAG_UNINIT | (options.allowWrites === true ? FLAG_ALLOW_WRITES : 0),\n options.fn,\n options.equals ?? Object.is,\n options.name,\n );\n if (options.lazy !== true) updateIfNecessary(node);\n return node;\n }\n const flags =\n (options.render === true ? FLAG_RENDER : 0) |\n (options.defer === true ? FLAG_DEFER : 0) |\n (options.lane === true ? FLAG_LANE : 0);\n const node = new Computation(owner, KIND_EFFECT, flags, options.fn, false, options.name);\n node.apply = options.apply ?? null;\n if (options.render === true) {\n // A suspended render effect keeps its DOM and waits on its own: its creator completes normally\n // (the branch that holds it decides whether to commit; see createBranches).\n recompute(node);\n } else {\n enqueue(node);\n schedule();\n }\n return node;\n}\n\n/**\n * Reads a memo node: brings it up to date if a source changed, subscribes the running computation\n * to it, and rethrows the error its last run stored. The accessor `useMemo` returns is this call.\n *\n * @param node A memo node from {@link createComputation}.\n * @returns The memo's current value.\n * @throws The error the memo's last computation threw, when no error handler took it. ShadowError\n * `CYCLE_DETECTED` when the memo is read while it computes.\n * @example\n * import { createComputation, createSignalNode, readComputation, readSignal } from \"@shadow-js/core/extend\";\n *\n * const first = createSignalNode<string>(\"Ada\", Object.is);\n * const greeting = createComputation({ kind: \"memo\", fn: () => `Hello, ${readSignal(first)}` });\n * console.log(readComputation<string>(greeting)); // \"Hello, Ada\"\n * @see createComputation\n * @since 1.0.0\n */\nexport function readComputation<T>(node: Computation): T {\n return readMemo<T>(node);\n}\n\n/**\n * Brings a memo or effect node up to date if one of its sources changed, without tracking it. Use\n * it to settle a node before reading its fields directly.\n *\n * @param node A node from {@link createComputation}. A node that is up to date is left as is.\n * @throws ShadowError `CYCLE_DETECTED` when a dependency is still computing (a cycle). An effect\n * that re-runs routes its errors to its owner's error handler.\n * @example\n * import { createComputation, createSignalNode, readSignal, refresh, writeSignal } from \"@shadow-js/core/extend\";\n *\n * const count = createSignalNode<number>(1, Object.is);\n * const doubled = createComputation({ kind: \"memo\", fn: () => readSignal(count) * 2 });\n * writeSignal(count, 2);\n * refresh(doubled);\n * console.log(doubled.value); // 4\n * @see readComputation\n * @since 1.0.0\n */\nexport function refresh(node: Computation): void {\n updateIfNecessary(node);\n}\n\n/**\n * Creates a plain owner: a scope that adopts the nodes and cleanups created under it and disposes\n * them together. The building block of `createRoot` and of control-flow branches.\n *\n * @param parent The owner to attach to and inherit context from. Undefined (or omitted) uses the\n * current owner; `null` creates a root with no context that only an explicit dispose ends.\n * @returns The new owner. Dispose it with `disposeOwner`.\n * @example\n * import { useEffect } from \"@shadow-js/core\";\n * import { createOwner, disposeOwner, runInScope } from \"@shadow-js/core/extend\";\n *\n * const branch = createOwner();\n * runInScope({ owner: branch, listener: null }, () => {\n * useEffect(() => console.log(\"branch effect\"));\n * });\n * disposeOwner(branch); // the effect and its cleanups are gone\n * @see runInScope\n * @since 1.0.0\n */\nexport function createOwner(parent?: Owner | null): Owner {\n return new OwnerClass(parent === undefined ? rt.owner : parent);\n}\n"],"mappings":"A,mtCA0GA,SAAgBC,GAA6B,CAC3C,OAAOC,EAAG,KACZ,CAkBA,SAAgBC,GAAsC,CACpD,OAAOD,EAAG,QACZ,CAiBA,SAAgBE,GAAsB,CACpC,OAAOF,EAAG,WAAa,IACzB,CAkBA,SAAgBG,GAA2B,CACzC,OACEH,EAAG,YAAc,GACjBA,EAAG,UAAY,MACfA,EAAG,QAAQ,OAAA,GAAA,EACVA,EAAG,QAAQ,MAAA,IAEhB,CAyBA,SAAgBI,EACd,EACA,EACG,CACH,IAAMC,EAAQL,EAAG,MACXM,EAAWN,EAAG,SACpB,GAAI,CACF,IAAMO,EAAYC,EAAM,MACpBD,IAAc,IAAA,KAAW,EAAG,MAAQA,GACxC,IAAME,EAAeD,EAAM,SAE3B,OADIC,IAAiB,IAAA,KAAW,EAAG,SAAWA,GACvCC,EAAG,CACZ,QAAU,CACR,EAAG,MAAQL,EACX,EAAG,SAAWC,CAChB,CACF,CAuBA,SAAgBK,EAAoB,EAAU,EAAmB,EAA0B,CACzF,OAAO,IAAIC,EAAUC,EAAOC,EAAQC,CAAI,CAC1C,CAqCA,SAAgBC,EAAe,EAAmB,EAAS,EAAiC,CAI1F,IAAMF,EAASG,EAAO,OAOtB,OANIH,IAAW,IAASA,EAAOG,EAAO,MAAOC,CAAI,EAAU,IAC3D,EAAO,MAAQA,EAIfC,EAAOF,CAAM,EACN,GACT,CAiBA,SAAgBE,EAAO,EAAsB,CACtCC,EAAaC,CAAM,IACxBC,EAAcD,CAAM,EACpBE,EAAS,EACX,CAkGA,SAAgBC,EAAkB,EAA0C,CAC1E,IAAMnB,EAAQoB,EAAQ,QAAU,IAAA,GAAYzB,EAAG,MAAQyB,EAAQ,MAC/D,GAAIA,EAAQ,OAAS,OAAQ,CAC3B,IAAMC,EAAO,IAAIC,EACftB,EAAA,EAAA,IAEeoB,EAAQ,cAAgB,GAAA,IAA2B,GAClEA,EAAQ,GACRA,EAAQ,QAAU,OAAO,GACzBA,EAAQ,IACV,EAEA,OADIA,EAAQ,OAAS,IAAMG,EAAkBF,CAAI,EAC1CA,CACT,CACA,IAAMG,GACHJ,EAAQ,SAAW,GAAA,GAAqB,IACxCA,EAAQ,QAAU,GAAA,GAAoB,IACtCA,EAAQ,OAAS,GAAA,IAAmB,GACjCC,EAAO,IAAIC,EAAYtB,EAAA,EAAoBwB,EAAOJ,EAAQ,GAAI,GAAOA,EAAQ,IAAI,EAUvF,MATA,GAAK,MAAQA,EAAQ,OAAS,KAC1BA,EAAQ,SAAW,GAGrBK,EAAUJ,CAAI,GAEdK,EAAQL,CAAI,EACZH,EAAS,GAEJG,CACT,CAmBA,SAAgBM,GAAmB,EAAsB,CACvD,OAAOC,EAAYP,CAAI,CACzB,CAoBA,SAAgBQ,GAAQ,EAAyB,CAC/CN,EAAkBF,CAAI,CACxB,CAqBA,SAAgBS,GAAY,EAA8B,CACxD,OAAO,IAAIrC,EAAWuC,IAAW,IAAA,GAAYrC,EAAG,MAAQqC,CAAM,CAChE,C"}
1
+ {"version":3,"file":"index.js","names":["OwnerClass","currentOwner","rt","currentListener","isTracking","isComputingMemo","runInScope","owner","listener","nextOwner","scope","nextListener","fn","createSignalNode","Signal","value","equals","name","writeSignal","signal","isEqual","next","notify","hasObservers","source","markObservers","schedule","createComputation","options","memo","node","Computation","updateIfNecessary","recompute","enqueue","readComputation","readMemo","refresh","createOwner","Owner","parent","DEVTOOLS_EVENT","MESSAGES","SUSPENSION","ShadowError","addCleanup","batch","beginHold","createTransitionHold","report","disposeTree","endHold","flush","flushSync","formatMessage","group","handleError","holdReader","inTransition","isHydrating","isSuspension","observersOf","pauseOwner","readSignal","registerTransitionLane","resetWarningDedupe","resumeOwner","runWithContext","setWarningListener","sourcesOf","startTransition","track","transitionHooks","wakeSuspended","warn","withHydration"],"sources":["../../../src/extend.ts"],"sourcesContent":["/**\n * The extension API: everything the built-in hooks (`useSignal`, `useMemo`, `useEffect`,\n * `useStore`, `useResource`, `mapArray`, `useSelector`, contexts, ...) are built from. They import\n * ONLY this module, never the engine internals, so a third-party package can create hooks with the\n * same behavior, performance and diagnostics. A test (`public-api.test.ts`) enforces that.\n *\n * Import from `@shadow-js/core/extend`. These functions are stable but low level: prefer the hooks\n * unless you are building a new primitive.\n *\n * @packageDocumentation\n */\n\nimport { DEVTOOLS_EVENT, report } from \"./internal/devtools\";\nimport { ShadowError } from \"./internal/diagnostics\";\nimport {\n FLAG_ALLOW_WRITES,\n FLAG_DEFER,\n FLAG_LANE,\n FLAG_RENDER,\n FLAG_UNINIT,\n KIND_EFFECT,\n KIND_MEMO,\n} from \"./internal/flags\";\nimport {\n Computation,\n hasObservers,\n isEqual,\n markObservers,\n observersOf,\n readMemo,\n readSignal,\n recompute,\n Signal,\n type Source,\n sourcesOf,\n track,\n updateIfNecessary,\n} from \"./internal/graph\";\nimport { type Owner, Owner as OwnerClass } from \"./internal/owner\";\nimport { enqueue } from \"./internal/queue\";\nimport { schedule } from \"./internal/scheduler\";\nimport { rt } from \"./internal/state\";\nimport type { Equals } from \"./internal/types\";\n\nexport { runWithContext } from \"./context\";\nexport {\n beginHold,\n createTransitionHold,\n endHold,\n holdReader,\n inTransition,\n pauseOwner,\n registerTransitionLane,\n resumeOwner,\n startTransition,\n transitionHooks,\n wakeSuspended,\n} from \"./internal/concurrency\";\nexport { DEVTOOLS_EVENT, report as devtoolsReport } from \"./internal/devtools\";\nexport type { WarningListener } from \"./internal/diagnostics\";\nexport { resetWarningDedupe, ShadowError, setWarningListener, warn } from \"./internal/diagnostics\";\nexport { disposeTree as disposeOwner } from \"./internal/dispose\";\nexport { isHydrating, withHydration } from \"./internal/hydration-flag\";\nexport type { MessageCode } from \"./internal/messages\";\nexport { formatMessage, MESSAGES } from \"./internal/messages\";\nexport type { ContextMap } from \"./internal/owner\";\nexport { addCleanup, handleError, Owner } from \"./internal/owner\";\nexport { batch, flush, flushSync, group } from \"./internal/scheduler\";\nexport type {\n BoundaryHold,\n SlotBranch,\n SlotChoice,\n SlotOwned,\n SlotState,\n SlotSwap,\n TransitionHold,\n} from \"./internal/state\";\nexport { isSuspension, SUSPENSION } from \"./internal/suspension\";\nexport type {\n Accessor,\n AnyFunction,\n Cleanup,\n Equals,\n ErrorHandler,\n Setter,\n} from \"./internal/types\";\nexport type { Source as SourceNode };\nexport { Computation as ComputationNode, Signal as SignalNode };\n\n// ---------- registers ----------\n\n/**\n * Returns the owner that adopts nodes created right now. The extension-API form of `getOwner`: use\n * it in a primitive that attaches a node or a cleanup to its caller's owner.\n *\n * @returns The current owner, or `null` outside any owner.\n * @example\n * import { addCleanup, currentOwner } from \"@shadow-js/core/extend\";\n *\n * function useInterval(fn: () => void, ms: number): void {\n * const timer = setInterval(fn, ms);\n * const owner = currentOwner();\n * if (owner !== null) addCleanup(owner, () => clearInterval(timer));\n * }\n * @see createOwner\n * @since 1.0.0\n */\nexport function currentOwner(): Owner | null {\n return rt.owner;\n}\n\n/**\n * Returns the computation that records reads right now. Use it in a primitive whose read behaves\n * differently for a tracked reader, for example one that holds a boundary only for a listening\n * memo or effect.\n *\n * @returns The listening memo or effect, or `null` when reads are untracked.\n * @example\n * import { currentListener } from \"@shadow-js/core/extend\";\n *\n * function readWithStats<T>(read: () => T, stats: { tracked: number }): T {\n * if (currentListener() !== null) stats.tracked += 1;\n * return read();\n * }\n * @see isTracking\n * @since 1.0.0\n */\nexport function currentListener(): Computation | null {\n return rt.listener;\n}\n\n/**\n * Says whether reads are being recorded as dependencies right now. Use it to skip subscription\n * work, or to warn, when a primitive is read outside an effect or a memo.\n *\n * @returns `true` while an effect or a memo runs tracked, `false` otherwise (module scope,\n * `untrack`, event handlers).\n * @example\n * import { untrack, useMemo } from \"@shadow-js/core\";\n * import { isTracking } from \"@shadow-js/core/extend\";\n *\n * const inMemo = useMemo(() => isTracking());\n * console.log(inMemo(), untrack(() => isTracking())); // true false\n * @see currentListener\n * @since 1.0.0\n */\nexport function isTracking(): boolean {\n return rt.listener !== null;\n}\n\n/**\n * Says whether a memo (not an effect) is computing right now: writing signals is a mistake there.\n * Cleanups that run while a memo tears down rows or children may write, so a disposal in progress\n * is not a violation, and neither is a memo created with `allowWrites`. Use it to guard a custom\n * write path the way {@link writeSignal} does.\n *\n * @returns `true` while a memo without `allowWrites` computes and no disposal is running.\n * @example\n * import { isComputingMemo, ShadowError } from \"@shadow-js/core/extend\";\n *\n * function appendLog(log: string[], entry: string): void {\n * if (isComputingMemo()) throw new ShadowError(\"WRITE_IN_MEMO\");\n * log.push(entry);\n * }\n * @since 1.0.0\n */\nexport function isComputingMemo(): boolean {\n return (\n rt.disposing === 0 &&\n rt.running !== null &&\n rt.running.kind === KIND_MEMO &&\n (rt.running.flags & FLAG_ALLOW_WRITES) === 0\n );\n}\n\n/**\n * Runs `fn` with the given owner and listener in effect, and restores both afterward, even when\n * `fn` throws. The low-level form of `runWithOwner` and `untrack`; unlike `runWithOwner` it does\n * not check whether the owner is disposed.\n *\n * @param scope `owner` and `listener` to install. For each, `undefined` (or absent) keeps the\n * current one and `null` clears it.\n * Getters are evaluated once; a failed getter restores the original scope.\n * @param fn The function to run.\n * @returns Whatever `fn` returns. An error thrown by `fn` propagates after the registers are\n * restored.\n * @example\n * import { onCleanup } from \"@shadow-js/core\";\n * import { createOwner, disposeOwner, runInScope } from \"@shadow-js/core/extend\";\n *\n * const owner = createOwner(null);\n * runInScope({ owner, listener: null }, () => {\n * onCleanup(() => console.log(\"released\"));\n * });\n * disposeOwner(owner); // logs \"released\"\n * @see createOwner\n * @since 1.0.0\n */\nexport function runInScope<T>(\n scope: { owner?: Owner | null; listener?: Computation | null },\n fn: () => T,\n): T {\n const owner = rt.owner;\n const listener = rt.listener;\n try {\n const nextOwner = scope.owner;\n if (nextOwner !== undefined) rt.owner = nextOwner;\n const nextListener = scope.listener;\n if (nextListener !== undefined) rt.listener = nextListener;\n return fn();\n } finally {\n rt.owner = owner;\n rt.listener = listener;\n }\n}\n\n// ---------- reactive cells ----------\n\n/**\n * Creates the storage of a signal: its value, its equality and the observers that read it. Read it\n * with `readSignal` and write it with {@link writeSignal}; `useSignal` is built this way.\n *\n * @param value Initial value.\n * @param equals Decides whether a write is a change: readers are notified only when it returns\n * `false`. `false` notifies on every write. It runs untracked (from `writeSignal`, and from a memo's\n * own `equals`), so what it reads is not a dependency of the writer or the reader.\n * @param name Label shown by devtools. Undefined leaves the signal unnamed.\n * @returns The signal node. It has no owner: it lives as long as something references it.\n * @example\n * import { createSignalNode, readSignal, writeSignal } from \"@shadow-js/core/extend\";\n *\n * const temperature = createSignalNode<number>(20, Object.is, \"temperature\");\n * const read = () => readSignal(temperature);\n * writeSignal(temperature, 21);\n * console.log(read()); // 21\n * @see writeSignal\n * @since 1.0.0\n */\nexport function createSignalNode<T>(value: T, equals: Equals<T>, name?: string): Signal<T> {\n return new Signal<T>(value, equals, name);\n}\n\n/**\n * Options of {@link writeSignal}.\n * @since 1.0.0\n */\nexport interface WriteOptions {\n /**\n * Permit the write while a memo computes, for bookkeeping signals owned by a primitive (a\n * Suspense counter, a resource's state). Turns the development `WRITE_IN_MEMO` check off for\n * this write.\n * @default false\n */\n allowInMemo?: boolean;\n}\n\n/**\n * Stores a new value in a signal node and notifies its readers when the value differs by the\n * signal's equality. Effects that read it run on the next flush; memos recompute on their next\n * read.\n *\n * @param signal The node, from {@link createSignalNode}.\n * @param next The new value. A function is stored as is: there is no updater form.\n * @param options `allowInMemo` permits the write while a memo computes. Undefined uses the default.\n * @returns `true` when the value changed and was stored, `false` when the equality kept the old\n * value (nobody is notified then).\n * @throws ShadowError `WRITE_IN_MEMO`, in development builds only, when a memo is computing and\n * `allowInMemo` is not set.\n * @example\n * import { createSignalNode, writeSignal } from \"@shadow-js/core/extend\";\n *\n * const status = createSignalNode<string>(\"idle\", Object.is);\n * console.log(writeSignal(status, \"loading\")); // true\n * console.log(writeSignal(status, \"loading\")); // false: an equal value notifies nobody\n * @see notify\n * @since 1.0.0\n */\nexport function writeSignal<T>(signal: Signal<T>, next: T, options?: WriteOptions): boolean {\n if (__DEV__ && options?.allowInMemo !== true && isComputingMemo()) {\n throw new ShadowError(\"WRITE_IN_MEMO\");\n }\n const equals = signal.equals;\n if (equals !== false && isEqual(equals, signal.value, next)) return false;\n signal.value = next;\n if (__DEV__) {\n report(DEVTOOLS_EVENT.SIGNAL_WRITTEN, signal, next, rt.running, observersOf(signal));\n }\n notify(signal);\n return true;\n}\n\n/**\n * Marks the observers of `source` stale and schedules a flush. Call it after changing a source's\n * value in place (for example after mutating an array a signal node holds), where\n * {@link writeSignal} cannot see the change.\n *\n * @param source A signal or memo node. A source nobody observes is left alone.\n * @example\n * import { createSignalNode, notify } from \"@shadow-js/core/extend\";\n *\n * const list = createSignalNode<string[]>([], false);\n * list.value.push(\"milk\"); // an in-place change: no equality can see it\n * notify(list); // the readers of `list` run again\n * @see writeSignal\n * @since 1.0.0\n */\nexport function notify(source: Source): void {\n if (!hasObservers(source)) return;\n markObservers(source);\n schedule();\n}\n\nexport { markObservers, observersOf, readSignal, schedule, sourcesOf, track };\n\n// ---------- computations (memos and effects) ----------\n\n/**\n * Options of {@link createComputation}.\n * @since 1.0.0\n */\nexport interface ComputationOptions {\n /**\n * `\"memo\"` creates a cached value that readers pull with {@link readComputation}; `\"effect\"`\n * creates a side effect that the scheduler runs.\n */\n kind: \"memo\" | \"effect\";\n /**\n * The computation. It is tracked: every source it reads becomes a dependency. It receives the\n * previous value (a memo's last value, or an effect's last computed value when `apply` is set;\n * `undefined` otherwise). A memo stores its result; an effect without `apply` may return a\n * cleanup function.\n */\n fn: (previous: never) => unknown;\n /**\n * Memos: decides whether a recomputation changed the value; readers are notified only when it\n * returns `false`, and `false` always propagates. Ignored for effects.\n * @default Object.is\n */\n equals?: Equals<unknown> | undefined;\n /**\n * Label shown by devtools and diagnostics.\n * @default undefined (the node is unnamed)\n */\n name?: string | undefined;\n /**\n * Effects: run in the render phase, synchronously at creation and before user effects in each\n * flush. Ignored for memos.\n * @default false\n */\n render?: boolean;\n /**\n * Effects with `apply`: skip the first call of `apply`; `fn` still runs and tracks.\n * @default false\n */\n defer?: boolean;\n /**\n * Memos: do not compute until the first read.\n * @default false (the memo computes once at creation)\n */\n lazy?: boolean | undefined;\n /**\n * Memos that run component setup (such as a hot-reload wrapper): writing signals inside is\n * legitimate there, so the dev-mode write guard stays off.\n * @default false\n */\n allowWrites?: boolean | undefined;\n /**\n * Effects: second stage, run untracked with the value `fn` computed and the previous one. It may\n * return a cleanup function.\n * @default undefined (`fn` is the whole effect)\n */\n apply?: ((value: never, previous: never) => unknown) | undefined;\n /**\n * Owner to attach to. `null` creates a node that no owner disposes.\n * @default the current owner\n */\n owner?: Owner | null;\n /**\n * Effects: always run in the transition lane (the watcher behind `useDeferredValue`).\n * @default false\n */\n lane?: boolean;\n}\n\n/**\n * Creates a memo or effect node: the building block of `useMemo`, `useEffect` and the render\n * effects of a renderer. Memos compute immediately unless `lazy`; render effects run immediately;\n * user effects are queued for the next flush. The node is owned and disposed with its owner.\n * Errors of a memo are stored and rethrown to its readers; errors of an effect go to the owner's\n * error handler.\n *\n * @param options What to create, how it runs and where it is owned.\n * @returns The node. Read a memo with {@link readComputation}; an effect needs no handle.\n * @throws The error of a render effect's first run when no error handler takes it and no flush is\n * running.\n * @example\n * import { createComputation, createSignalNode, readComputation, readSignal, writeSignal } from \"@shadow-js/core/extend\";\n *\n * const price = createSignalNode<number>(10, Object.is);\n * const withTax = createComputation({ kind: \"memo\", fn: () => readSignal(price) * 1.2 });\n * createComputation({\n * kind: \"effect\",\n * fn: () => console.log(readComputation<number>(withTax)),\n * });\n * writeSignal(price, 20); // the effect logs 24 on the next flush\n * @see readComputation\n * @since 1.0.0\n */\nexport function createComputation(options: ComputationOptions): Computation {\n const owner = options.owner === undefined ? rt.owner : options.owner;\n const memo = options.kind === \"memo\";\n const node = new Computation(\n owner,\n memo ? KIND_MEMO : KIND_EFFECT,\n memo\n ? FLAG_UNINIT | (options.allowWrites === true ? FLAG_ALLOW_WRITES : 0)\n : (options.render === true ? FLAG_RENDER : 0) |\n (options.defer === true ? FLAG_DEFER : 0) |\n (options.lane === true ? FLAG_LANE : 0),\n options.fn,\n memo ? (options.equals ?? Object.is) : false,\n options.name,\n );\n if (memo) {\n if (options.lazy !== true) updateIfNecessary(node);\n return node;\n }\n node.apply = options.apply ?? null;\n if (options.render === true) {\n // A suspended render effect keeps its DOM and waits on its own: its creator completes normally\n // (the branch that holds it decides whether to commit; see createBranches).\n recompute(node);\n } else {\n enqueue(node);\n schedule();\n }\n return node;\n}\n\n/**\n * Reads a memo node: brings it up to date if a source changed, subscribes the running computation\n * to it, and rethrows the error its last run stored. The accessor `useMemo` returns is this call.\n *\n * @param node A memo node from {@link createComputation}.\n * @returns The memo's current value.\n * @throws The error the memo's last computation threw, when no error handler took it. ShadowError\n * `CYCLE_DETECTED` when the memo is read while it computes.\n * @example\n * import { createComputation, createSignalNode, readComputation, readSignal } from \"@shadow-js/core/extend\";\n *\n * const first = createSignalNode<string>(\"Ada\", Object.is);\n * const greeting = createComputation({ kind: \"memo\", fn: () => `Hello, ${readSignal(first)}` });\n * console.log(readComputation<string>(greeting)); // \"Hello, Ada\"\n * @see createComputation\n * @since 1.0.0\n */\nexport function readComputation<T>(node: Computation): T {\n return readMemo<T>(node);\n}\n\n/**\n * Brings a memo or effect node up to date if one of its sources changed, without tracking it. Use\n * it to settle a node before reading its fields directly.\n *\n * @param node A node from {@link createComputation}. A node that is up to date is left as is.\n * @throws ShadowError `CYCLE_DETECTED` when a dependency is still computing (a cycle). An effect\n * that re-runs routes its errors to its owner's error handler.\n * @example\n * import { createComputation, createSignalNode, readSignal, refresh, writeSignal } from \"@shadow-js/core/extend\";\n *\n * const count = createSignalNode<number>(1, Object.is);\n * const doubled = createComputation({ kind: \"memo\", fn: () => readSignal(count) * 2 });\n * writeSignal(count, 2);\n * refresh(doubled);\n * console.log(doubled.value); // 4\n * @see readComputation\n * @since 1.0.0\n */\nexport function refresh(node: Computation): void {\n updateIfNecessary(node);\n}\n\n/**\n * Creates a plain owner: a scope that adopts the nodes and cleanups created under it and disposes\n * them together. The building block of `createRoot` and of control-flow branches.\n *\n * @param parent The owner to attach to and inherit context from. Undefined (or omitted) uses the\n * current owner; `null` creates a root with no context that only an explicit dispose ends.\n * @returns The new owner. Dispose it with `disposeOwner`.\n * @example\n * import { useEffect } from \"@shadow-js/core\";\n * import { createOwner, disposeOwner, runInScope } from \"@shadow-js/core/extend\";\n *\n * const branch = createOwner();\n * runInScope({ owner: branch, listener: null }, () => {\n * useEffect(() => console.log(\"branch effect\"));\n * });\n * disposeOwner(branch); // the effect and its cleanups are gone\n * @see runInScope\n * @since 1.0.0\n */\nexport function createOwner(parent?: Owner | null): Owner {\n return new OwnerClass(parent === undefined ? rt.owner : parent);\n}\n"],"mappings":"A,guCA2GA,SAAgBC,GAA6B,CAC3C,OAAOC,EAAG,KACZ,CAkBA,SAAgBC,GAAsC,CACpD,OAAOD,EAAG,QACZ,CAiBA,SAAgBE,GAAsB,CACpC,OAAOF,EAAG,WAAa,IACzB,CAkBA,SAAgBG,GAA2B,CACzC,OACEH,EAAG,YAAc,GACjBA,EAAG,UAAY,MACfA,EAAG,QAAQ,OAAA,GAAA,EACVA,EAAG,QAAQ,MAAA,IAEhB,CAyBA,SAAgBI,EACd,EACA,EACG,CACH,IAAMC,EAAQL,EAAG,MACXM,EAAWN,EAAG,SACpB,GAAI,CACF,IAAMO,EAAYC,EAAM,MACpBD,IAAc,IAAA,KAAW,EAAG,MAAQA,GACxC,IAAME,EAAeD,EAAM,SAE3B,OADIC,IAAiB,IAAA,KAAW,EAAG,SAAWA,GACvCC,EAAG,CACZ,QAAU,CACR,EAAG,MAAQL,EACX,EAAG,SAAWC,CAChB,CACF,CAwBA,SAAgBK,EAAoB,EAAU,EAAmB,EAA0B,CACzF,OAAO,IAAIC,EAAUC,EAAOC,EAAQC,CAAI,CAC1C,CAqCA,SAAgBC,EAAe,EAAmB,EAAS,EAAiC,CAI1F,IAAMF,EAASG,EAAO,OAOtB,OANIH,IAAW,IAASI,EAAQJ,EAAQG,EAAO,MAAOE,CAAI,EAAU,IACpE,EAAO,MAAQA,EAIfC,EAAOH,CAAM,EACN,GACT,CAiBA,SAAgBG,EAAO,EAAsB,CACtCC,EAAaC,CAAM,IACxBC,EAAcD,CAAM,EACpBE,EAAS,EACX,CAkGA,SAAgBC,GAAkB,EAA0C,CAC1E,IAAMpB,EAAQqB,EAAQ,QAAU,IAAA,GAAY1B,EAAG,MAAQ0B,EAAQ,MACzDC,EAAOD,EAAQ,OAAS,OACxBE,EAAO,IAAIC,EACfxB,EACAsB,EAAA,EAAA,EACAA,EAAA,IACmBD,EAAQ,cAAgB,GAAA,IAA2B,IACjEA,EAAQ,SAAW,GAAA,GAAqB,IACtCA,EAAQ,QAAU,GAAA,GAAoB,IACtCA,EAAQ,OAAS,GAAA,IAAmB,GAC3CA,EAAQ,GACRC,EAAQD,EAAQ,QAAU,OAAO,GAAM,GACvCA,EAAQ,IACV,EAcA,OAbIC,GACED,EAAQ,OAAS,IAAMI,EAAkBF,CAAI,EAC1CA,IAET,EAAK,MAAQF,EAAQ,OAAS,KAC1BA,EAAQ,SAAW,GAGrBK,EAAUH,CAAI,GAEdI,EAAQJ,CAAI,EACZJ,EAAS,GAEJI,EACT,CAmBA,SAAgBK,GAAmB,EAAsB,CACvD,OAAOC,EAAYN,CAAI,CACzB,CAoBA,SAAgBO,GAAQ,EAAyB,CAC/CL,EAAkBF,CAAI,CACxB,CAqBA,SAAgBQ,GAAY,EAA8B,CACxD,OAAO,IAAItC,EAAWwC,IAAW,IAAA,GAAYtC,EAAG,MAAQsC,CAAM,CAChE,C"}
@@ -1,2 +1,2 @@
1
- import{untrack as e}from"./ownership.js";import{useEffect as t}from"./effect.js";import{useSignal as n}from"./signal.js";import{isHydrating as r}from"./internal/hydration-flag.js";function i(i,a,o){let s=r()&&o?.getServerSnapshot!==void 0?o.getServerSnapshot:a,[c,l]=n(e(s),{equals:o?.equals??Object.is,...o?.name===void 0?{}:{name:o.name}}),u=()=>{let t=e(a);l(()=>t)};return t(()=>{let e=i(u);return u(),e}),c}export{i as useExternalStore};
1
+ import{untrack as e}from"./ownership.js";import{useEffect as t}from"./effect.js";import{useSignal as n}from"./signal.js";import{isHydrating as r}from"./internal/hydration-flag.js";function i(i,a,o){let s=r()&&o?.getServerSnapshot!==void 0?o.getServerSnapshot:a,[c,l]=n(e(s),{equals:o?.equals??Object.is,name:o?.name}),u=()=>{let t=e(a);l(()=>t)};return t(()=>{let t=e(()=>i(u));try{u()}catch(e){throw t(),e}return t}),c}export{i as useExternalStore};
2
2
  //# sourceMappingURL=external-store.js.map
@@ -1 +1 @@
1
- {"version":3,"file":"external-store.js","names":["useExternalStore","first","isHydrating","options","getSnapshot","value","setValue","useSignal","untrack","sync","next","useEffect","unsubscribe","subscribe"],"sources":["../../src/external-store.ts"],"sourcesContent":["import { useEffect } from \"./effect\";\nimport type { Accessor, Equals } from \"./extend\";\nimport { isHydrating } from \"./extend\";\nimport { untrack } from \"./ownership\";\nimport { useSignal } from \"./signal\";\n\n/** Options of {@link useExternalStore}. @since 1.0.0 */\nexport interface ExternalStoreOptions<T> {\n /**\n * The snapshot the server renders (there is no subscription there). Without it the server reads\n * `getSnapshot` once. Keep it equal to what the browser reads on its first render: a difference is\n * corrected only after subscribing, and no hydration test covers that case yet. While hydrating,\n * the browser's first render also uses it.\n * @default undefined (the server, and hydration, read `getSnapshot`)\n */\n getServerSnapshot?: () => T;\n /**\n * Decides whether a new snapshot is a change: the accessor updates only when it returns `false`.\n * @default Object.is\n */\n equals?: Equals<T>;\n /**\n * Label shown by devtools and diagnostics.\n * @default undefined (the store is unnamed)\n */\n name?: string;\n}\n\n/**\n * Reads a value that lives outside ShadowJS (a store, a browser API, an observable) as a reactive\n * accessor. The one bridge for every external source, and the ShadowJS form of React's\n * `useSyncExternalStore` and Solid's `from`.\n *\n * `subscribe(notify)` is called in an effect after the owner is created and returns the\n * unsubscribe function, which runs when the owner is disposed. `getSnapshot()` is read untracked\n * at creation, on every notification, and once after subscribing (so a change made between the\n * first read and the subscription is not lost). The accessor updates only when the snapshot differs\n * by `equals`. On the server nothing is subscribed: the accessor returns `getServerSnapshot()`.\n *\n * @param subscribe Registers `notify`; returns the unsubscribe function.\n * @param getSnapshot Returns the current value. Reads inside it are not tracked.\n * @param options Server snapshot, equality and a devtools name. Undefined uses the defaults.\n * @returns An accessor of the current snapshot.\n * @example\n * import { useExternalStore } from \"@shadow-js/core\";\n *\n * function subscribe(notify: () => void): () => void {\n * window.addEventListener(\"online\", notify);\n * window.addEventListener(\"offline\", notify);\n * return () => {\n * window.removeEventListener(\"online\", notify);\n * window.removeEventListener(\"offline\", notify);\n * };\n * }\n *\n * function OnlineBadge() {\n * const online = useExternalStore(subscribe, () => navigator.onLine, { getServerSnapshot: () => true });\n * return <span>{online() ? \"online\" : \"offline\"}</span>;\n * }\n * @see useSignal\n * @since 1.0.0\n */\nexport function useExternalStore<T>(\n subscribe: (notify: () => void) => () => void,\n getSnapshot: () => T,\n options?: ExternalStoreOptions<T>,\n): Accessor<T> {\n if (__SERVER__) {\n const snapshot = untrack(options?.getServerSnapshot ?? getSnapshot);\n return () => snapshot;\n }\n // While hydrating, the first render must equal the server markup: the server snapshot, when given.\n // The browser's snapshot is applied by the subscription below.\n const first =\n isHydrating() && options?.getServerSnapshot !== undefined\n ? options.getServerSnapshot\n : getSnapshot;\n const [value, setValue] = useSignal<T>(untrack(first), {\n equals: options?.equals ?? Object.is,\n ...(options?.name === undefined ? {} : { name: options.name }),\n });\n const sync = (): void => {\n const next = untrack(getSnapshot);\n setValue(() => next);\n };\n useEffect(() => {\n const unsubscribe = subscribe(sync);\n // Catch up with changes made between the first read and the subscription.\n sync();\n return unsubscribe;\n });\n return value;\n}\n"],"mappings":"A,oLA8DA,SAAgBA,EACd,EACA,EACA,EACa,CAOb,IAAMC,EACJC,EAAY,GAAKC,GAAS,oBAAsB,IAAA,GAC5CA,EAAQ,kBACRC,EACA,CAACC,EAAOC,GAAYC,EAAaC,EAAQP,CAAK,EAAG,CACrD,OAAQE,GAAS,QAAU,OAAO,GAClC,GAAIA,GAAS,OAAS,IAAA,GAAY,CAAC,EAAI,CAAE,KAAMA,EAAQ,IAAK,CAC9D,CAAC,EACKM,MAAmB,CACvB,IAAMC,EAAOF,EAAQJ,CAAW,EAChCE,MAAeI,CAAI,CACrB,EAOA,OANAC,MAAgB,CACd,IAAMC,EAAcC,EAAUJ,CAAI,EAGlC,OADAA,EAAK,EACEG,CACT,CAAC,EACMP,CACT,C"}
1
+ {"version":3,"file":"external-store.js","names":["useExternalStore","first","isHydrating","options","getSnapshot","value","setValue","useSignal","untrack","sync","next","useEffect","unsubscribe","subscribe","error"],"sources":["../../src/external-store.ts"],"sourcesContent":["import { useEffect } from \"./effect\";\nimport type { Accessor, Equals } from \"./extend\";\nimport { isHydrating } from \"./extend\";\nimport { untrack } from \"./ownership\";\nimport { useSignal } from \"./signal\";\n\n/** Options of {@link useExternalStore}. @since 1.0.0 */\nexport interface ExternalStoreOptions<T> {\n /**\n * The snapshot the server renders (there is no subscription there). Without it the server reads\n * `getSnapshot` once. Keep it equal to what the browser reads on its first render: a difference is\n * corrected only after subscribing, and no hydration test covers that case yet. While hydrating,\n * the browser's first render also uses it.\n * @default undefined (the server, and hydration, read `getSnapshot`)\n */\n getServerSnapshot?: () => T;\n /**\n * Decides whether a new snapshot is a change: the accessor updates only when it returns `false`.\n * @default Object.is\n */\n equals?: Equals<T>;\n /**\n * Label shown by devtools and diagnostics.\n * @default undefined (the store is unnamed)\n */\n name?: string;\n}\n\n/**\n * Reads a value that lives outside ShadowJS (a store, a browser API, an observable) as a reactive\n * accessor. The one bridge for every external source, and the ShadowJS form of React's\n * `useSyncExternalStore` and Solid's `from`.\n *\n * `subscribe(notify)` is called in an effect after the owner is created and returns the\n * unsubscribe function, which runs when the owner is disposed. `getSnapshot()` is read untracked\n * at creation, on every notification, and once after subscribing (so a change made between the\n * first read and the subscription is not lost). The accessor updates only when the snapshot differs\n * by `equals`. On the server nothing is subscribed: the accessor returns `getServerSnapshot()`.\n *\n * @param subscribe Registers `notify`; returns the unsubscribe function.\n * @param getSnapshot Returns the current value. Reads inside it are not tracked.\n * @param options Server snapshot, equality and a devtools name. Undefined uses the defaults.\n * @returns An accessor of the current snapshot.\n * @example\n * import { useExternalStore } from \"@shadow-js/core\";\n *\n * function subscribe(notify: () => void): () => void {\n * window.addEventListener(\"online\", notify);\n * window.addEventListener(\"offline\", notify);\n * return () => {\n * window.removeEventListener(\"online\", notify);\n * window.removeEventListener(\"offline\", notify);\n * };\n * }\n *\n * function OnlineBadge() {\n * const online = useExternalStore(subscribe, () => navigator.onLine, { getServerSnapshot: () => true });\n * return <span>{online() ? \"online\" : \"offline\"}</span>;\n * }\n * @see useSignal\n * @since 1.0.0\n */\nexport function useExternalStore<T>(\n subscribe: (notify: () => void) => () => void,\n getSnapshot: () => T,\n options?: ExternalStoreOptions<T>,\n): Accessor<T> {\n if (__SERVER__) {\n const snapshot = untrack(options?.getServerSnapshot ?? getSnapshot);\n return () => snapshot;\n }\n // While hydrating, the first render must equal the server markup: the server snapshot, when given.\n // The browser's snapshot is applied by the subscription below.\n const first =\n isHydrating() && options?.getServerSnapshot !== undefined\n ? options.getServerSnapshot\n : getSnapshot;\n const [value, setValue] = useSignal<T>(untrack(first), {\n equals: options?.equals ?? Object.is,\n name: options?.name,\n });\n const sync = (): void => {\n const next = untrack(getSnapshot);\n setValue(() => next);\n };\n useEffect(() => {\n // `subscribe` is a user callback: what it reads must not re-run (and re-subscribe) this effect.\n const unsubscribe = untrack(() => subscribe(sync));\n try {\n // Catch up with changes made between the first read and the subscription.\n sync();\n } catch (error) {\n // The effect fails, so no cleanup is registered: release the subscription here.\n unsubscribe();\n throw error;\n }\n return unsubscribe;\n });\n return value;\n}\n"],"mappings":"A,oLA8DA,SAAgBA,EACd,EACA,EACA,EACa,CAOb,IAAMC,EACJC,EAAY,GAAKC,GAAS,oBAAsB,IAAA,GAC5CA,EAAQ,kBACRC,EACA,CAACC,EAAOC,GAAYC,EAAaC,EAAQP,CAAK,EAAG,CACrD,OAAQE,GAAS,QAAU,OAAO,GAClC,KAAMA,GAAS,IACjB,CAAC,EACKM,MAAmB,CACvB,IAAMC,EAAOF,EAAQJ,CAAW,EAChCE,MAAeI,CAAI,CACrB,EAcA,OAbAC,MAAgB,CAEd,IAAMC,EAAcJ,MAAcK,EAAUJ,CAAI,CAAC,EACjD,GAAI,CAEFA,EAAK,CACP,OAASK,EAAO,CAGd,MADAF,EAAY,EACNE,CACR,CACA,OAAOF,CACT,CAAC,EACMP,CACT,C"}