@shadow-js/core 1.0.0 → 1.0.2

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 (240) hide show
  1. package/CHANGELOG.md +19 -0
  2. package/dist/dev/action.d.ts +0 -2
  3. package/dist/dev/action.js +1 -2
  4. package/dist/dev/cache.d.ts +2 -3
  5. package/dist/dev/cache.js +6 -5
  6. package/dist/dev/cache.js.map +1 -1
  7. package/dist/dev/context.d.ts +0 -2
  8. package/dist/dev/context.js +1 -2
  9. package/dist/dev/effect.d.ts +0 -2
  10. package/dist/dev/effect.js +18 -35
  11. package/dist/dev/effect.js.map +1 -1
  12. package/dist/dev/env.d.ts +0 -2
  13. package/dist/dev/env.js +1 -2
  14. package/dist/dev/events.d.ts +0 -2
  15. package/dist/dev/events.js +1 -2
  16. package/dist/dev/extend/index.d.ts +7 -8
  17. package/dist/dev/extend/index.js +8 -9
  18. package/dist/dev/extend/index.js.map +1 -1
  19. package/dist/dev/external-store.d.ts +0 -2
  20. package/dist/dev/external-store.js +9 -5
  21. package/dist/dev/external-store.js.map +1 -1
  22. package/dist/dev/internal/concurrency.d.ts +0 -2
  23. package/dist/dev/internal/concurrency.js +43 -22
  24. package/dist/dev/internal/concurrency.js.map +1 -1
  25. package/dist/dev/internal/devtools.d.ts +0 -2
  26. package/dist/dev/internal/devtools.js +1 -2
  27. package/dist/dev/internal/diagnostics.d.ts +0 -2
  28. package/dist/dev/internal/diagnostics.js +1 -4
  29. package/dist/dev/internal/diagnostics.js.map +1 -1
  30. package/dist/dev/internal/dispose.d.ts +0 -2
  31. package/dist/dev/internal/dispose.js +1 -2
  32. package/dist/dev/internal/flags.js +2 -5
  33. package/dist/dev/internal/flags.js.map +1 -1
  34. package/dist/dev/internal/graph.d.ts +0 -3
  35. package/dist/dev/internal/graph.js +21 -39
  36. package/dist/dev/internal/graph.js.map +1 -1
  37. package/dist/dev/internal/hydration-flag.d.ts +0 -2
  38. package/dist/dev/internal/hydration-flag.js +1 -2
  39. package/dist/dev/internal/messages.d.ts +0 -2
  40. package/dist/dev/internal/messages.js +1 -2
  41. package/dist/dev/internal/owner.d.ts +7 -7
  42. package/dist/dev/internal/owner.js +13 -24
  43. package/dist/dev/internal/owner.js.map +1 -1
  44. package/dist/dev/internal/queue.js +1 -2
  45. package/dist/dev/internal/scheduler.d.ts +0 -2
  46. package/dist/dev/internal/scheduler.js +34 -73
  47. package/dist/dev/internal/scheduler.js.map +1 -1
  48. package/dist/dev/internal/state.d.ts +0 -2
  49. package/dist/dev/internal/state.js +1 -2
  50. package/dist/dev/internal/suspension.d.ts +0 -2
  51. package/dist/dev/internal/suspension.js +1 -2
  52. package/dist/dev/internal/types.d.ts +0 -2
  53. package/dist/dev/list.d.ts +0 -2
  54. package/dist/dev/list.js +1 -10
  55. package/dist/dev/list.js.map +1 -1
  56. package/dist/dev/memo.d.ts +2 -3
  57. package/dist/dev/memo.js +5 -6
  58. package/dist/dev/memo.js.map +1 -1
  59. package/dist/dev/optimistic.d.ts +0 -2
  60. package/dist/dev/optimistic.js +1 -2
  61. package/dist/dev/ownership.d.ts +4 -4
  62. package/dist/dev/ownership.js +60 -5
  63. package/dist/dev/ownership.js.map +1 -1
  64. package/dist/dev/props.d.ts +0 -2
  65. package/dist/dev/props.js +19 -13
  66. package/dist/dev/props.js.map +1 -1
  67. package/dist/dev/reaction.d.ts +1 -3
  68. package/dist/dev/reaction.js +6 -3
  69. package/dist/dev/reaction.js.map +1 -1
  70. package/dist/dev/reducer.d.ts +0 -2
  71. package/dist/dev/reducer.js +2 -3
  72. package/dist/dev/reducer.js.map +1 -1
  73. package/dist/dev/refs.d.ts +0 -2
  74. package/dist/dev/refs.js +1 -2
  75. package/dist/dev/resource.d.ts +0 -2
  76. package/dist/dev/resource.js +22 -14
  77. package/dist/dev/resource.js.map +1 -1
  78. package/dist/dev/selector.d.ts +0 -2
  79. package/dist/dev/selector.js +2 -7
  80. package/dist/dev/selector.js.map +1 -1
  81. package/dist/dev/signal.d.ts +3 -4
  82. package/dist/dev/signal.js +1 -2
  83. package/dist/dev/signal.js.map +1 -1
  84. package/dist/dev/store/nodes.js +7 -2
  85. package/dist/dev/store/nodes.js.map +1 -1
  86. package/dist/dev/store/proxies.js +1 -2
  87. package/dist/dev/store/read.d.ts +0 -2
  88. package/dist/dev/store/read.js +1 -2
  89. package/dist/dev/store/reconcile.d.ts +0 -2
  90. package/dist/dev/store/reconcile.js +1 -2
  91. package/dist/dev/store/types.d.ts +0 -2
  92. package/dist/dev/store/use-store.d.ts +5 -2
  93. package/dist/dev/store/use-store.js +1 -2
  94. package/dist/dev/store/use-store.js.map +1 -1
  95. package/dist/dev/suspense.d.ts +0 -2
  96. package/dist/dev/suspense.js +1 -2
  97. package/dist/dev/transitions.d.ts +0 -2
  98. package/dist/dev/transitions.js +2 -3
  99. package/dist/dev/transitions.js.map +1 -1
  100. package/dist/prod/cache.js +1 -1
  101. package/dist/prod/cache.js.map +1 -1
  102. package/dist/prod/effect.js +1 -1
  103. package/dist/prod/effect.js.map +1 -1
  104. package/dist/prod/extend/index.js +1 -1
  105. package/dist/prod/extend/index.js.map +1 -1
  106. package/dist/prod/external-store.js +1 -1
  107. package/dist/prod/external-store.js.map +1 -1
  108. package/dist/prod/internal/concurrency.js +1 -1
  109. package/dist/prod/internal/concurrency.js.map +1 -1
  110. package/dist/prod/internal/diagnostics.js +1 -1
  111. package/dist/prod/internal/diagnostics.js.map +1 -1
  112. package/dist/prod/internal/flags.js +1 -1
  113. package/dist/prod/internal/flags.js.map +1 -1
  114. package/dist/prod/internal/graph.js +1 -1
  115. package/dist/prod/internal/graph.js.map +1 -1
  116. package/dist/prod/internal/owner.js +1 -1
  117. package/dist/prod/internal/owner.js.map +1 -1
  118. package/dist/prod/internal/scheduler.js +1 -1
  119. package/dist/prod/internal/scheduler.js.map +1 -1
  120. package/dist/prod/list.js +1 -1
  121. package/dist/prod/list.js.map +1 -1
  122. package/dist/prod/memo.js +1 -1
  123. package/dist/prod/memo.js.map +1 -1
  124. package/dist/prod/ownership.js +1 -1
  125. package/dist/prod/ownership.js.map +1 -1
  126. package/dist/prod/props.js.map +1 -1
  127. package/dist/prod/reaction.js +1 -1
  128. package/dist/prod/reaction.js.map +1 -1
  129. package/dist/prod/reducer.js +1 -1
  130. package/dist/prod/reducer.js.map +1 -1
  131. package/dist/prod/resource.js +1 -1
  132. package/dist/prod/resource.js.map +1 -1
  133. package/dist/prod/selector.js +1 -1
  134. package/dist/prod/selector.js.map +1 -1
  135. package/dist/prod/signal.js.map +1 -1
  136. package/dist/prod/store/nodes.js +1 -1
  137. package/dist/prod/store/nodes.js.map +1 -1
  138. package/dist/prod/store/use-store.js.map +1 -1
  139. package/dist/prod/transitions.js +1 -1
  140. package/dist/prod/transitions.js.map +1 -1
  141. package/dist/server/cache.js +1 -1
  142. package/dist/server/cache.js.map +1 -1
  143. package/dist/server/effect.js.map +1 -1
  144. package/dist/server/extend/index.js +1 -1
  145. package/dist/server/extend/index.js.map +1 -1
  146. package/dist/server/external-store.js.map +1 -1
  147. package/dist/server/internal/concurrency.js +1 -1
  148. package/dist/server/internal/concurrency.js.map +1 -1
  149. package/dist/server/internal/diagnostics.js +1 -1
  150. package/dist/server/internal/diagnostics.js.map +1 -1
  151. package/dist/server/internal/flags.js +1 -1
  152. package/dist/server/internal/flags.js.map +1 -1
  153. package/dist/server/internal/graph.js +1 -1
  154. package/dist/server/internal/graph.js.map +1 -1
  155. package/dist/server/internal/owner.js +1 -1
  156. package/dist/server/internal/owner.js.map +1 -1
  157. package/dist/server/internal/scheduler.js +1 -1
  158. package/dist/server/internal/scheduler.js.map +1 -1
  159. package/dist/server/list.js +1 -1
  160. package/dist/server/list.js.map +1 -1
  161. package/dist/server/memo.js +1 -1
  162. package/dist/server/memo.js.map +1 -1
  163. package/dist/server/ownership.js +1 -1
  164. package/dist/server/ownership.js.map +1 -1
  165. package/dist/server/props.js.map +1 -1
  166. package/dist/server/reaction.js +1 -1
  167. package/dist/server/reaction.js.map +1 -1
  168. package/dist/server/reducer.js +1 -1
  169. package/dist/server/reducer.js.map +1 -1
  170. package/dist/server/resource.js +1 -1
  171. package/dist/server/resource.js.map +1 -1
  172. package/dist/server/selector.js +1 -1
  173. package/dist/server/selector.js.map +1 -1
  174. package/dist/server/signal.js.map +1 -1
  175. package/dist/server/store/nodes.js +1 -1
  176. package/dist/server/store/nodes.js.map +1 -1
  177. package/dist/server/store/use-store.js.map +1 -1
  178. package/dist/server/transitions.js.map +1 -1
  179. package/dist/server-dev/action.js +1 -2
  180. package/dist/server-dev/cache.js +6 -5
  181. package/dist/server-dev/cache.js.map +1 -1
  182. package/dist/server-dev/context.js +1 -2
  183. package/dist/server-dev/effect.js +1 -2
  184. package/dist/server-dev/effect.js.map +1 -1
  185. package/dist/server-dev/env.js +1 -2
  186. package/dist/server-dev/events.js +1 -2
  187. package/dist/server-dev/extend/index.js +8 -9
  188. package/dist/server-dev/extend/index.js.map +1 -1
  189. package/dist/server-dev/external-store.js +1 -2
  190. package/dist/server-dev/external-store.js.map +1 -1
  191. package/dist/server-dev/internal/concurrency.js +43 -22
  192. package/dist/server-dev/internal/concurrency.js.map +1 -1
  193. package/dist/server-dev/internal/devtools.js +1 -2
  194. package/dist/server-dev/internal/diagnostics.js +1 -4
  195. package/dist/server-dev/internal/diagnostics.js.map +1 -1
  196. package/dist/server-dev/internal/dispose.js +1 -2
  197. package/dist/server-dev/internal/flags.js +2 -5
  198. package/dist/server-dev/internal/flags.js.map +1 -1
  199. package/dist/server-dev/internal/graph.js +21 -39
  200. package/dist/server-dev/internal/graph.js.map +1 -1
  201. package/dist/server-dev/internal/hydration-flag.js +1 -2
  202. package/dist/server-dev/internal/messages.js +1 -2
  203. package/dist/server-dev/internal/owner.js +13 -24
  204. package/dist/server-dev/internal/owner.js.map +1 -1
  205. package/dist/server-dev/internal/queue.js +1 -2
  206. package/dist/server-dev/internal/scheduler.js +34 -73
  207. package/dist/server-dev/internal/scheduler.js.map +1 -1
  208. package/dist/server-dev/internal/state.js +1 -2
  209. package/dist/server-dev/internal/suspension.js +1 -2
  210. package/dist/server-dev/list.js +1 -10
  211. package/dist/server-dev/list.js.map +1 -1
  212. package/dist/server-dev/memo.js +5 -6
  213. package/dist/server-dev/memo.js.map +1 -1
  214. package/dist/server-dev/optimistic.js +1 -2
  215. package/dist/server-dev/ownership.js +60 -5
  216. package/dist/server-dev/ownership.js.map +1 -1
  217. package/dist/server-dev/props.js +19 -13
  218. package/dist/server-dev/props.js.map +1 -1
  219. package/dist/server-dev/reaction.js +6 -3
  220. package/dist/server-dev/reaction.js.map +1 -1
  221. package/dist/server-dev/reducer.js +2 -3
  222. package/dist/server-dev/reducer.js.map +1 -1
  223. package/dist/server-dev/refs.js +1 -2
  224. package/dist/server-dev/resource.js +22 -14
  225. package/dist/server-dev/resource.js.map +1 -1
  226. package/dist/server-dev/selector.js +2 -7
  227. package/dist/server-dev/selector.js.map +1 -1
  228. package/dist/server-dev/signal.js +1 -2
  229. package/dist/server-dev/signal.js.map +1 -1
  230. package/dist/server-dev/store/nodes.js +7 -2
  231. package/dist/server-dev/store/nodes.js.map +1 -1
  232. package/dist/server-dev/store/proxies.js +1 -2
  233. package/dist/server-dev/store/read.js +1 -2
  234. package/dist/server-dev/store/reconcile.js +1 -2
  235. package/dist/server-dev/store/use-store.js +1 -2
  236. package/dist/server-dev/store/use-store.js.map +1 -1
  237. package/dist/server-dev/suspense.js +1 -2
  238. package/dist/server-dev/transitions.js +1 -2
  239. package/dist/server-dev/transitions.js.map +1 -1
  240. package/package.json +2 -1
@@ -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":[],"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 /**\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 = 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;;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,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,5 +1,5 @@
1
1
  import { RAW, deleteRaw, isReservedKey, isWrappable, nodeOf, readRaw, trackKeys, trackProperty, unwrapValue, writeRaw } from "./nodes.js";
2
- //#region src/store/proxies.ts
2
+ // src/store/proxies.ts
3
3
  /**
4
4
  * One `setStore` call. Drafts made for it are cached here, so a draft object keeps its identity
5
5
  * inside the update, and they stop accepting writes when the call returns.
@@ -154,7 +154,6 @@ function draftOf(raw, tx) {
154
154
  tx.drafts.set(raw, proxy);
155
155
  return proxy;
156
156
  }
157
- //#endregion
158
157
  export { Transaction, draftOf, readProxyOf };
159
158
 
160
159
  //# sourceMappingURL=proxies.js.map
@@ -1,5 +1,5 @@
1
1
  import { isReservedKey, isWrappable, readRaw, unwrapValue } from "./nodes.js";
2
- //#region src/store/read.ts
2
+ // src/store/read.ts
3
3
  /**
4
4
  * Returns the raw data behind a store. Reads and writes on the result bypass tracking and
5
5
  * notification, so writing to it is a bug; use it for identity checks and passing data on.
@@ -66,7 +66,6 @@ function snapshot(store) {
66
66
  }
67
67
  return out;
68
68
  }
69
- //#endregion
70
69
  export { snapshot, unwrap };
71
70
 
72
71
  //# sourceMappingURL=read.js.map
@@ -1,5 +1,5 @@
1
1
  import { deleteRaw, isReservedKey, isWrappable, unwrapValue, writeRaw } from "./nodes.js";
2
- //#region src/store/reconcile.ts
2
+ // src/store/reconcile.ts
3
3
  /** Each reconciler function maps to its spec. Keys are the reconciler functions themselves. */
4
4
  const SPECS = /* @__PURE__ */ new WeakMap();
5
5
  /**
@@ -180,7 +180,6 @@ function mergeArray(target, source, spec, enqueue) {
180
180
  function produce(update) {
181
181
  return update;
182
182
  }
183
- //#endregion
184
183
  export { applyReconcile, produce, reconcile, specOf };
185
184
 
186
185
  //# sourceMappingURL=reconcile.js.map
@@ -8,7 +8,7 @@ import { isReservedKey, isWrappable, unwrapValue } from "./nodes.js";
8
8
  import { snapshot } from "./read.js";
9
9
  import { applyReconcile, reconcile, specOf } from "./reconcile.js";
10
10
  import { Transaction, draftOf, readProxyOf } from "./proxies.js";
11
- //#region src/store/use-store.ts
11
+ // src/store/use-store.ts
12
12
  function isPlainObject(value) {
13
13
  if (typeof value !== "object" || value === null || Array.isArray(value)) return false;
14
14
  const prototype = Object.getPrototypeOf(value);
@@ -162,7 +162,6 @@ function wrapCell(value) {
162
162
  const raw = unwrapValue(value);
163
163
  return isWrappable(raw) ? readProxyOf(raw) : value;
164
164
  }
165
- //#endregion
166
165
  export { useStore };
167
166
 
168
167
  //# sourceMappingURL=use-store.js.map
@@ -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"}
@@ -1,5 +1,5 @@
1
1
  import { createContext } from "./context.js";
2
- //#region src/suspense.ts
2
+ // src/suspense.ts
3
3
  /**
4
4
  * The context through which an asynchronous source finds the nearest `<Suspense>` boundary. Each
5
5
  * boundary provides its {@link SuspenseTracker}; the value is `null` outside any boundary. Read it
@@ -39,7 +39,6 @@ const SuspenseContext = /* @__PURE__ */ createContext(null, { name: "Suspense" }
39
39
  * @since 1.0.0
40
40
  */
41
41
  const ResourceCacheContext = /* @__PURE__ */ createContext(null, { name: "ResourceCache" });
42
- //#endregion
43
42
  export { ResourceCacheContext, SuspenseContext };
44
43
 
45
44
  //# sourceMappingURL=suspense.js.map
@@ -1,7 +1,7 @@
1
1
  import { untrack } from "./ownership.js";
2
2
  import { useSignal } from "./signal.js";
3
3
  import { startTransition } from "./internal/concurrency.js";
4
- //#region src/transitions.ts
4
+ // src/transitions.ts
5
5
  /**
6
6
  * Runs `fn` as a transition and reports whether it is pending. Returns `[isPending, start]`:
7
7
  * `isPending` is true from `start(fn)` until the transition has been applied (including any Suspense
@@ -80,7 +80,6 @@ function useTransition() {
80
80
  function useDeferredValue(source, options) {
81
81
  return source;
82
82
  }
83
- //#endregion
84
83
  export { useDeferredValue, useTransition };
85
84
 
86
85
  //# sourceMappingURL=transitions.js.map
@@ -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;CACG,OAAO;AAkBzB"}
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;CACG,OAAO;AAkBzB"}
package/package.json CHANGED
@@ -1,6 +1,6 @@
1
1
  {
2
2
  "name": "@shadow-js/core",
3
- "version": "1.0.0",
3
+ "version": "1.0.2",
4
4
  "description": "Signals, stores, memos and effects that update exactly what changed",
5
5
  "license": "MIT",
6
6
  "type": "module",
@@ -118,6 +118,7 @@
118
118
  "@shadow-js/compiler": "*",
119
119
  "@shadow-js/web": "*",
120
120
  "@types/node": "^24.0.0",
121
+ "esbuild": "0.27.0",
121
122
  "fast-check": "^4.10.2",
122
123
  "happy-dom": "^21.0.3",
123
124
  "tsdown": "0.23.0",