@shadow-js/core 0.1.0 → 1.0.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (387) hide show
  1. package/CHANGELOG.md +11 -0
  2. package/LICENSE +2 -2
  3. package/README.md +134 -331
  4. package/dist/dev/action.d.ts +36 -0
  5. package/dist/dev/action.js +90 -0
  6. package/dist/dev/action.js.map +1 -0
  7. package/dist/dev/cache.d.ts +35 -0
  8. package/dist/dev/cache.js +62 -0
  9. package/dist/dev/cache.js.map +1 -0
  10. package/dist/dev/context.d.ts +106 -0
  11. package/dist/dev/context.js +111 -0
  12. package/dist/dev/context.js.map +1 -0
  13. package/dist/dev/effect.d.ts +122 -0
  14. package/dist/dev/effect.js +111 -0
  15. package/dist/dev/effect.js.map +1 -0
  16. package/dist/dev/env.d.ts +29 -0
  17. package/dist/dev/env.js +31 -0
  18. package/dist/dev/env.js.map +1 -0
  19. package/dist/dev/events.d.ts +28 -0
  20. package/dist/dev/events.js +33 -0
  21. package/dist/dev/events.js.map +1 -0
  22. package/dist/dev/extend/index.d.ts +331 -0
  23. package/dist/dev/extend/index.js +317 -0
  24. package/dist/dev/extend/index.js.map +1 -0
  25. package/dist/dev/external-store.d.ts +60 -0
  26. package/dist/dev/external-store.js +60 -0
  27. package/dist/dev/external-store.js.map +1 -0
  28. package/dist/dev/index.d.ts +29 -0
  29. package/dist/dev/index.js +26 -0
  30. package/dist/dev/internal/concurrency.d.ts +213 -0
  31. package/dist/dev/internal/concurrency.js +632 -0
  32. package/dist/dev/internal/concurrency.js.map +1 -0
  33. package/dist/dev/internal/devtools.d.ts +71 -0
  34. package/dist/dev/internal/devtools.js +77 -0
  35. package/dist/dev/internal/devtools.js.map +1 -0
  36. package/dist/dev/internal/diagnostics.d.ts +90 -0
  37. package/dist/dev/internal/diagnostics.js +102 -0
  38. package/dist/dev/internal/diagnostics.js.map +1 -0
  39. package/dist/dev/internal/dispose.d.ts +28 -0
  40. package/dist/dev/internal/dispose.js +49 -0
  41. package/dist/dev/internal/dispose.js.map +1 -0
  42. package/dist/dev/internal/flags.js +11 -0
  43. package/dist/dev/internal/flags.js.map +1 -0
  44. package/dist/dev/internal/graph.d.ts +233 -0
  45. package/dist/dev/internal/graph.js +578 -0
  46. package/dist/dev/internal/graph.js.map +1 -0
  47. package/dist/dev/internal/hydration-flag.d.ts +33 -0
  48. package/dist/dev/internal/hydration-flag.js +46 -0
  49. package/dist/dev/internal/hydration-flag.js.map +1 -0
  50. package/dist/dev/internal/messages.d.ts +56 -0
  51. package/dist/dev/internal/messages.js +54 -0
  52. package/dist/dev/internal/messages.js.map +1 -0
  53. package/dist/dev/internal/owner.d.ts +142 -0
  54. package/dist/dev/internal/owner.js +290 -0
  55. package/dist/dev/internal/owner.js.map +1 -0
  56. package/dist/dev/internal/queue.js +46 -0
  57. package/dist/dev/internal/queue.js.map +1 -0
  58. package/dist/dev/internal/scheduler.d.ts +113 -0
  59. package/dist/dev/internal/scheduler.js +287 -0
  60. package/dist/dev/internal/scheduler.js.map +1 -0
  61. package/dist/dev/internal/state.d.ts +141 -0
  62. package/dist/dev/internal/state.js +28 -0
  63. package/dist/dev/internal/state.js.map +1 -0
  64. package/dist/dev/internal/suspension.d.ts +43 -0
  65. package/dist/dev/internal/suspension.js +45 -0
  66. package/dist/dev/internal/suspension.js.map +1 -0
  67. package/dist/dev/internal/types.d.ts +46 -0
  68. package/dist/dev/list.d.ts +93 -0
  69. package/dist/dev/list.js +282 -0
  70. package/dist/dev/list.js.map +1 -0
  71. package/dist/dev/memo.d.ts +60 -0
  72. package/dist/dev/memo.js +41 -0
  73. package/dist/dev/memo.js.map +1 -0
  74. package/dist/dev/optimistic.d.ts +26 -0
  75. package/dist/dev/optimistic.js +45 -0
  76. package/dist/dev/optimistic.js.map +1 -0
  77. package/dist/dev/ownership.d.ts +204 -0
  78. package/dist/dev/ownership.js +261 -0
  79. package/dist/dev/ownership.js.map +1 -0
  80. package/dist/dev/props.d.ts +134 -0
  81. package/dist/dev/props.js +282 -0
  82. package/dist/dev/props.js.map +1 -0
  83. package/dist/dev/reaction.d.ts +29 -0
  84. package/dist/dev/reaction.js +61 -0
  85. package/dist/dev/reaction.js.map +1 -0
  86. package/dist/dev/reducer.d.ts +41 -0
  87. package/dist/dev/reducer.js +39 -0
  88. package/dist/dev/reducer.js.map +1 -0
  89. package/dist/dev/refs.d.ts +52 -0
  90. package/dist/dev/refs.js +58 -0
  91. package/dist/dev/refs.js.map +1 -0
  92. package/dist/dev/resource.d.ts +135 -0
  93. package/dist/dev/resource.js +177 -0
  94. package/dist/dev/resource.js.map +1 -0
  95. package/dist/dev/selector.d.ts +34 -0
  96. package/dist/dev/selector.js +118 -0
  97. package/dist/dev/selector.js.map +1 -0
  98. package/dist/dev/signal.d.ts +42 -0
  99. package/dist/dev/signal.js +39 -0
  100. package/dist/dev/signal.js.map +1 -0
  101. package/dist/dev/store/index.d.ts +5 -0
  102. package/dist/dev/store/index.js +4 -0
  103. package/dist/dev/store/nodes.js +192 -0
  104. package/dist/dev/store/nodes.js.map +1 -0
  105. package/dist/dev/store/proxies.js +160 -0
  106. package/dist/dev/store/proxies.js.map +1 -0
  107. package/dist/dev/store/read.d.ts +39 -0
  108. package/dist/dev/store/read.js +72 -0
  109. package/dist/dev/store/read.js.map +1 -0
  110. package/dist/dev/store/reconcile.d.ts +73 -0
  111. package/dist/dev/store/reconcile.js +186 -0
  112. package/dist/dev/store/reconcile.js.map +1 -0
  113. package/dist/dev/store/types.d.ts +106 -0
  114. package/dist/dev/store/use-store.d.ts +60 -0
  115. package/dist/dev/store/use-store.js +168 -0
  116. package/dist/dev/store/use-store.js.map +1 -0
  117. package/dist/dev/suspense.d.ts +101 -0
  118. package/dist/dev/suspense.js +45 -0
  119. package/dist/dev/suspense.js.map +1 -0
  120. package/dist/dev/transitions.d.ts +77 -0
  121. package/dist/dev/transitions.js +101 -0
  122. package/dist/dev/transitions.js.map +1 -0
  123. package/dist/prod/action.js +2 -0
  124. package/dist/prod/action.js.map +1 -0
  125. package/dist/prod/cache.js +2 -0
  126. package/dist/prod/cache.js.map +1 -0
  127. package/dist/prod/context.js +2 -0
  128. package/dist/prod/context.js.map +1 -0
  129. package/dist/prod/effect.js +2 -0
  130. package/dist/prod/effect.js.map +1 -0
  131. package/dist/prod/env.js +2 -0
  132. package/dist/prod/env.js.map +1 -0
  133. package/dist/prod/events.js +2 -0
  134. package/dist/prod/events.js.map +1 -0
  135. package/dist/prod/extend/index.js +2 -0
  136. package/dist/prod/extend/index.js.map +1 -0
  137. package/dist/prod/external-store.js +2 -0
  138. package/dist/prod/external-store.js.map +1 -0
  139. package/dist/prod/index.js +1 -0
  140. package/dist/prod/internal/concurrency.js +2 -0
  141. package/dist/prod/internal/concurrency.js.map +1 -0
  142. package/dist/prod/internal/devtools.js +2 -0
  143. package/dist/prod/internal/devtools.js.map +1 -0
  144. package/dist/prod/internal/diagnostics.js +2 -0
  145. package/dist/prod/internal/diagnostics.js.map +1 -0
  146. package/dist/prod/internal/dispose.js +2 -0
  147. package/dist/prod/internal/dispose.js.map +1 -0
  148. package/dist/prod/internal/flags.js +2 -0
  149. package/dist/prod/internal/flags.js.map +1 -0
  150. package/dist/prod/internal/graph.js +2 -0
  151. package/dist/prod/internal/graph.js.map +1 -0
  152. package/dist/prod/internal/hydration-flag.js +2 -0
  153. package/dist/prod/internal/hydration-flag.js.map +1 -0
  154. package/dist/prod/internal/messages.js +2 -0
  155. package/dist/prod/internal/messages.js.map +1 -0
  156. package/dist/prod/internal/owner.js +2 -0
  157. package/dist/prod/internal/owner.js.map +1 -0
  158. package/dist/prod/internal/queue.js +2 -0
  159. package/dist/prod/internal/queue.js.map +1 -0
  160. package/dist/prod/internal/scheduler.js +2 -0
  161. package/dist/prod/internal/scheduler.js.map +1 -0
  162. package/dist/prod/internal/state.js +2 -0
  163. package/dist/prod/internal/state.js.map +1 -0
  164. package/dist/prod/internal/suspension.js +2 -0
  165. package/dist/prod/internal/suspension.js.map +1 -0
  166. package/dist/prod/list.js +2 -0
  167. package/dist/prod/list.js.map +1 -0
  168. package/dist/prod/memo.js +2 -0
  169. package/dist/prod/memo.js.map +1 -0
  170. package/dist/prod/optimistic.js +2 -0
  171. package/dist/prod/optimistic.js.map +1 -0
  172. package/dist/prod/ownership.js +2 -0
  173. package/dist/prod/ownership.js.map +1 -0
  174. package/dist/prod/props.js +2 -0
  175. package/dist/prod/props.js.map +1 -0
  176. package/dist/prod/reaction.js +2 -0
  177. package/dist/prod/reaction.js.map +1 -0
  178. package/dist/prod/reducer.js +2 -0
  179. package/dist/prod/reducer.js.map +1 -0
  180. package/dist/prod/refs.js +2 -0
  181. package/dist/prod/refs.js.map +1 -0
  182. package/dist/prod/resource.js +2 -0
  183. package/dist/prod/resource.js.map +1 -0
  184. package/dist/prod/selector.js +2 -0
  185. package/dist/prod/selector.js.map +1 -0
  186. package/dist/prod/signal.js +2 -0
  187. package/dist/prod/signal.js.map +1 -0
  188. package/dist/prod/store/index.js +1 -0
  189. package/dist/prod/store/nodes.js +2 -0
  190. package/dist/prod/store/nodes.js.map +1 -0
  191. package/dist/prod/store/proxies.js +2 -0
  192. package/dist/prod/store/proxies.js.map +1 -0
  193. package/dist/prod/store/read.js +2 -0
  194. package/dist/prod/store/read.js.map +1 -0
  195. package/dist/prod/store/reconcile.js +2 -0
  196. package/dist/prod/store/reconcile.js.map +1 -0
  197. package/dist/prod/store/use-store.js +2 -0
  198. package/dist/prod/store/use-store.js.map +1 -0
  199. package/dist/prod/suspense.js +2 -0
  200. package/dist/prod/suspense.js.map +1 -0
  201. package/dist/prod/transitions.js +2 -0
  202. package/dist/prod/transitions.js.map +1 -0
  203. package/dist/server/action.js +2 -0
  204. package/dist/server/action.js.map +1 -0
  205. package/dist/server/cache.js +2 -0
  206. package/dist/server/cache.js.map +1 -0
  207. package/dist/server/context.js +2 -0
  208. package/dist/server/context.js.map +1 -0
  209. package/dist/server/effect.js +2 -0
  210. package/dist/server/effect.js.map +1 -0
  211. package/dist/server/env.js +2 -0
  212. package/dist/server/env.js.map +1 -0
  213. package/dist/server/events.js +2 -0
  214. package/dist/server/events.js.map +1 -0
  215. package/dist/server/extend/index.js +2 -0
  216. package/dist/server/extend/index.js.map +1 -0
  217. package/dist/server/external-store.js +2 -0
  218. package/dist/server/external-store.js.map +1 -0
  219. package/dist/server/index.js +1 -0
  220. package/dist/server/internal/concurrency.js +2 -0
  221. package/dist/server/internal/concurrency.js.map +1 -0
  222. package/dist/server/internal/devtools.js +2 -0
  223. package/dist/server/internal/devtools.js.map +1 -0
  224. package/dist/server/internal/diagnostics.js +2 -0
  225. package/dist/server/internal/diagnostics.js.map +1 -0
  226. package/dist/server/internal/dispose.js +2 -0
  227. package/dist/server/internal/dispose.js.map +1 -0
  228. package/dist/server/internal/flags.js +2 -0
  229. package/dist/server/internal/flags.js.map +1 -0
  230. package/dist/server/internal/graph.js +2 -0
  231. package/dist/server/internal/graph.js.map +1 -0
  232. package/dist/server/internal/hydration-flag.js +2 -0
  233. package/dist/server/internal/hydration-flag.js.map +1 -0
  234. package/dist/server/internal/messages.js +2 -0
  235. package/dist/server/internal/messages.js.map +1 -0
  236. package/dist/server/internal/owner.js +2 -0
  237. package/dist/server/internal/owner.js.map +1 -0
  238. package/dist/server/internal/queue.js +2 -0
  239. package/dist/server/internal/queue.js.map +1 -0
  240. package/dist/server/internal/scheduler.js +2 -0
  241. package/dist/server/internal/scheduler.js.map +1 -0
  242. package/dist/server/internal/state.js +2 -0
  243. package/dist/server/internal/state.js.map +1 -0
  244. package/dist/server/internal/suspension.js +2 -0
  245. package/dist/server/internal/suspension.js.map +1 -0
  246. package/dist/server/list.js +2 -0
  247. package/dist/server/list.js.map +1 -0
  248. package/dist/server/memo.js +2 -0
  249. package/dist/server/memo.js.map +1 -0
  250. package/dist/server/optimistic.js +2 -0
  251. package/dist/server/optimistic.js.map +1 -0
  252. package/dist/server/ownership.js +2 -0
  253. package/dist/server/ownership.js.map +1 -0
  254. package/dist/server/props.js +2 -0
  255. package/dist/server/props.js.map +1 -0
  256. package/dist/server/reaction.js +2 -0
  257. package/dist/server/reaction.js.map +1 -0
  258. package/dist/server/reducer.js +2 -0
  259. package/dist/server/reducer.js.map +1 -0
  260. package/dist/server/refs.js +2 -0
  261. package/dist/server/refs.js.map +1 -0
  262. package/dist/server/resource.js +2 -0
  263. package/dist/server/resource.js.map +1 -0
  264. package/dist/server/selector.js +2 -0
  265. package/dist/server/selector.js.map +1 -0
  266. package/dist/server/signal.js +2 -0
  267. package/dist/server/signal.js.map +1 -0
  268. package/dist/server/store/index.js +1 -0
  269. package/dist/server/store/nodes.js +2 -0
  270. package/dist/server/store/nodes.js.map +1 -0
  271. package/dist/server/store/proxies.js +2 -0
  272. package/dist/server/store/proxies.js.map +1 -0
  273. package/dist/server/store/read.js +2 -0
  274. package/dist/server/store/read.js.map +1 -0
  275. package/dist/server/store/reconcile.js +2 -0
  276. package/dist/server/store/reconcile.js.map +1 -0
  277. package/dist/server/store/use-store.js +2 -0
  278. package/dist/server/store/use-store.js.map +1 -0
  279. package/dist/server/suspense.js +2 -0
  280. package/dist/server/suspense.js.map +1 -0
  281. package/dist/server/transitions.js +2 -0
  282. package/dist/server/transitions.js.map +1 -0
  283. package/dist/server-dev/action.js +90 -0
  284. package/dist/server-dev/action.js.map +1 -0
  285. package/dist/server-dev/cache.js +62 -0
  286. package/dist/server-dev/cache.js.map +1 -0
  287. package/dist/server-dev/context.js +108 -0
  288. package/dist/server-dev/context.js.map +1 -0
  289. package/dist/server-dev/effect.js +56 -0
  290. package/dist/server-dev/effect.js.map +1 -0
  291. package/dist/server-dev/env.js +31 -0
  292. package/dist/server-dev/env.js.map +1 -0
  293. package/dist/server-dev/events.js +33 -0
  294. package/dist/server-dev/events.js.map +1 -0
  295. package/dist/server-dev/extend/index.js +317 -0
  296. package/dist/server-dev/extend/index.js.map +1 -0
  297. package/dist/server-dev/external-store.js +46 -0
  298. package/dist/server-dev/external-store.js.map +1 -0
  299. package/dist/server-dev/index.js +26 -0
  300. package/dist/server-dev/internal/concurrency.js +633 -0
  301. package/dist/server-dev/internal/concurrency.js.map +1 -0
  302. package/dist/server-dev/internal/devtools.js +77 -0
  303. package/dist/server-dev/internal/devtools.js.map +1 -0
  304. package/dist/server-dev/internal/diagnostics.js +102 -0
  305. package/dist/server-dev/internal/diagnostics.js.map +1 -0
  306. package/dist/server-dev/internal/dispose.js +49 -0
  307. package/dist/server-dev/internal/dispose.js.map +1 -0
  308. package/dist/server-dev/internal/flags.js +11 -0
  309. package/dist/server-dev/internal/flags.js.map +1 -0
  310. package/dist/server-dev/internal/graph.js +578 -0
  311. package/dist/server-dev/internal/graph.js.map +1 -0
  312. package/dist/server-dev/internal/hydration-flag.js +46 -0
  313. package/dist/server-dev/internal/hydration-flag.js.map +1 -0
  314. package/dist/server-dev/internal/messages.js +54 -0
  315. package/dist/server-dev/internal/messages.js.map +1 -0
  316. package/dist/server-dev/internal/owner.js +290 -0
  317. package/dist/server-dev/internal/owner.js.map +1 -0
  318. package/dist/server-dev/internal/queue.js +46 -0
  319. package/dist/server-dev/internal/queue.js.map +1 -0
  320. package/dist/server-dev/internal/scheduler.js +287 -0
  321. package/dist/server-dev/internal/scheduler.js.map +1 -0
  322. package/dist/server-dev/internal/state.js +28 -0
  323. package/dist/server-dev/internal/state.js.map +1 -0
  324. package/dist/server-dev/internal/suspension.js +45 -0
  325. package/dist/server-dev/internal/suspension.js.map +1 -0
  326. package/dist/server-dev/list.js +282 -0
  327. package/dist/server-dev/list.js.map +1 -0
  328. package/dist/server-dev/memo.js +41 -0
  329. package/dist/server-dev/memo.js.map +1 -0
  330. package/dist/server-dev/optimistic.js +45 -0
  331. package/dist/server-dev/optimistic.js.map +1 -0
  332. package/dist/server-dev/ownership.js +261 -0
  333. package/dist/server-dev/ownership.js.map +1 -0
  334. package/dist/server-dev/props.js +282 -0
  335. package/dist/server-dev/props.js.map +1 -0
  336. package/dist/server-dev/reaction.js +61 -0
  337. package/dist/server-dev/reaction.js.map +1 -0
  338. package/dist/server-dev/reducer.js +39 -0
  339. package/dist/server-dev/reducer.js.map +1 -0
  340. package/dist/server-dev/refs.js +58 -0
  341. package/dist/server-dev/refs.js.map +1 -0
  342. package/dist/server-dev/resource.js +176 -0
  343. package/dist/server-dev/resource.js.map +1 -0
  344. package/dist/server-dev/selector.js +82 -0
  345. package/dist/server-dev/selector.js.map +1 -0
  346. package/dist/server-dev/signal.js +39 -0
  347. package/dist/server-dev/signal.js.map +1 -0
  348. package/dist/server-dev/store/index.js +4 -0
  349. package/dist/server-dev/store/nodes.js +192 -0
  350. package/dist/server-dev/store/nodes.js.map +1 -0
  351. package/dist/server-dev/store/proxies.js +160 -0
  352. package/dist/server-dev/store/proxies.js.map +1 -0
  353. package/dist/server-dev/store/read.js +72 -0
  354. package/dist/server-dev/store/read.js.map +1 -0
  355. package/dist/server-dev/store/reconcile.js +186 -0
  356. package/dist/server-dev/store/reconcile.js.map +1 -0
  357. package/dist/server-dev/store/use-store.js +168 -0
  358. package/dist/server-dev/store/use-store.js.map +1 -0
  359. package/dist/server-dev/suspense.js +45 -0
  360. package/dist/server-dev/suspense.js.map +1 -0
  361. package/dist/server-dev/transitions.js +86 -0
  362. package/dist/server-dev/transitions.js.map +1 -0
  363. package/package.json +111 -50
  364. package/dist/chunk-6Y3CCWOY.js +0 -887
  365. package/dist/chunk-6Y3CCWOY.js.map +0 -1
  366. package/dist/chunk-B5FTYDUG.js +0 -3
  367. package/dist/chunk-B5FTYDUG.js.map +0 -1
  368. package/dist/index.cjs +0 -2000
  369. package/dist/index.cjs.map +0 -1
  370. package/dist/index.d.cts +0 -609
  371. package/dist/index.d.ts +0 -609
  372. package/dist/index.js +0 -1094
  373. package/dist/index.js.map +0 -1
  374. package/dist/jsx-Bugil6CJ.d.cts +0 -151
  375. package/dist/jsx-Bugil6CJ.d.ts +0 -151
  376. package/dist/jsx-dev-runtime.cjs +0 -742
  377. package/dist/jsx-dev-runtime.cjs.map +0 -1
  378. package/dist/jsx-dev-runtime.d.cts +0 -2
  379. package/dist/jsx-dev-runtime.d.ts +0 -2
  380. package/dist/jsx-dev-runtime.js +0 -4
  381. package/dist/jsx-dev-runtime.js.map +0 -1
  382. package/dist/jsx-runtime.cjs +0 -742
  383. package/dist/jsx-runtime.cjs.map +0 -1
  384. package/dist/jsx-runtime.d.cts +0 -36
  385. package/dist/jsx-runtime.d.ts +0 -36
  386. package/dist/jsx-runtime.js +0 -4
  387. package/dist/jsx-runtime.js.map +0 -1
@@ -0,0 +1,578 @@
1
+ import { DEVTOOLS_EVENT, report } from "./devtools.js";
2
+ import { ShadowError } from "./diagnostics.js";
3
+ import { nextSequence, rt } from "./state.js";
4
+ import { Owner, addCleanup, disposeChildren, handleError, hasErrorHandler } from "./owner.js";
5
+ import { enqueue } from "./queue.js";
6
+ //#region src/internal/graph.ts
7
+ const NO_SOURCES = Object.freeze([]);
8
+ /** Memo nesting depth after which pulls switch from recursion to the iterative walk. */
9
+ const DEEP_LIMIT = 128;
10
+ /**
11
+ * The storage of a signal: its value, its equality and the computations that read it. Exported from
12
+ * `@shadow-js/core/extend` as `SignalNode`; create one with `createSignalNode`, read it with
13
+ * {@link readSignal} and write it with `writeSignal`, which notifies its readers. Build a custom
14
+ * primitive on it the way `useSignal` does.
15
+ *
16
+ * @example
17
+ * import { createSignalNode, readSignal, SignalNode, writeSignal } from "@shadow-js/core/extend";
18
+ *
19
+ * const count = createSignalNode<number>(0, Object.is, "count");
20
+ * writeSignal(count, 1);
21
+ * console.log(readSignal(count), count instanceof SignalNode); // 1 true
22
+ * @see createSignalNode
23
+ * @since 1.0.0
24
+ */
25
+ var Signal = class {
26
+ /** Always 0, the kind of a signal. */
27
+ kind = 0;
28
+ /**
29
+ * The current value. Assigning it directly notifies no one: use `writeSignal`, or call `notify`
30
+ * after the assignment.
31
+ */
32
+ value;
33
+ /** Decides whether a write is a change; `false` treats every write as one. */
34
+ equals;
35
+ /** The computations that read this signal in their last run, as pairs (see {@link Source.observers}). */
36
+ observers = null;
37
+ /** Stamp of the last computation run that tracked this signal (dedupes repeated reads). */
38
+ stamp = 0;
39
+ /**
40
+ * Label shown by devtools and diagnostics.
41
+ * @default undefined (the signal is unnamed)
42
+ */
43
+ name;
44
+ /**
45
+ * Creates a signal. Prefer `createSignalNode`, which takes the same arguments.
46
+ * @param value Initial value.
47
+ * @param equals Equality that decides whether a write is a change.
48
+ * @param name Devtools label, or undefined for an unnamed signal.
49
+ */
50
+ constructor(value, equals, name) {
51
+ this.value = value;
52
+ this.equals = equals;
53
+ this.name = name;
54
+ report(DEVTOOLS_EVENT.SIGNAL_CREATED, this, rt.owner, name, value);
55
+ }
56
+ };
57
+ /**
58
+ * A memo or an effect: an owner that reads sources and (for memos) is itself a source. Exported from
59
+ * `@shadow-js/core/extend` as `ComputationNode`; create one with `createComputation` and read a memo
60
+ * with `readComputation`. It owns what its function creates: each run first disposes the children
61
+ * and runs the cleanups of the previous run.
62
+ *
63
+ * @example
64
+ * import { createComputation, createSignalNode, readComputation, readSignal } from "@shadow-js/core/extend";
65
+ *
66
+ * const price = createSignalNode(10, Object.is);
67
+ * const total = createComputation({ kind: "memo", fn: () => readSignal(price) * 2 });
68
+ * console.log(readComputation<number>(total)); // 20
69
+ * @see createComputation
70
+ * @since 1.0.0
71
+ */
72
+ var Computation = class extends Owner {
73
+ /** 1 for a memo, 2 for an effect. */
74
+ kind;
75
+ /** How stale the node is: 0 (clean), 1 (a transitive source changed), 2 (a direct source changed). */
76
+ state;
77
+ /** Engine bit flags (queued, running, disposed, render phase, ...). Read-only outside the engine. */
78
+ flags;
79
+ /** A memo's last value; an effect's last computed value when it has an `apply` stage. */
80
+ value;
81
+ /** The error a memo's last run threw, rethrown to its readers; undefined when it succeeded. */
82
+ error = void 0;
83
+ /** A memo's equality: readers are notified only when it says the new value differs. */
84
+ equals;
85
+ /** The function each run calls with the previous value; null once disposed. */
86
+ fn;
87
+ /**
88
+ * An effect's second stage, run untracked with the computed value and the previous one; null for
89
+ * none and once disposed.
90
+ */
91
+ apply = null;
92
+ /**
93
+ * The sources the last run read, in reading order, as pairs: a source, then the index of this computation in that
94
+ * source's `observers`. Read it with `sourcesOf`, which returns the sources alone.
95
+ */
96
+ sources = NO_SOURCES;
97
+ /** The computations that read this memo in their last run, as pairs (see {@link Source.observers}). */
98
+ observers = null;
99
+ /** Stamp of the current run while it tracks, and of the last run that tracked this memo. */
100
+ stamp = 0;
101
+ /** During a run: how many leading entries of `sources` were confirmed again (they keep their edges). */
102
+ trackIndex = 0;
103
+ /** Creation order; breaks ties between effects at equal depth (G-16). */
104
+ seq;
105
+ /**
106
+ * Label shown by devtools and diagnostics.
107
+ * @default undefined (the computation is unnamed)
108
+ */
109
+ name;
110
+ /**
111
+ * Creates a computation that has not run yet. Prefer `createComputation`, which also runs or
112
+ * queues it.
113
+ * @param parent The owner to attach to, or null.
114
+ * @param kind 1 for a memo, 2 for an effect.
115
+ * @param flags Initial engine bit flags.
116
+ * @param fn The function each run calls.
117
+ * @param equals A memo's equality; `false` for an effect.
118
+ * @param name Devtools label, or undefined.
119
+ */
120
+ constructor(parent, kind, flags, fn, equals, name) {
121
+ super(parent);
122
+ this.kind = kind;
123
+ this.flags = flags;
124
+ this.state = 2;
125
+ this.fn = fn;
126
+ this.equals = equals;
127
+ this.name = name;
128
+ this.value = void 0;
129
+ this.seq = nextSequence();
130
+ report(DEVTOOLS_EVENT.COMPUTATION_CREATED, this, parent, kind === 1 ? "memo" : "effect", name, (flags & 16) !== 0);
131
+ }
132
+ reportDisposed() {
133
+ report(DEVTOOLS_EVENT.COMPUTATION_DISPOSED, this);
134
+ }
135
+ release() {
136
+ this.flags |= 4;
137
+ unlinkSources(this);
138
+ this.fn = null;
139
+ this.apply = null;
140
+ }
141
+ };
142
+ /**
143
+ * Removes the pair at `at` from `source.observers` in O(1): the last pair moves into its place, and its observer is told
144
+ * where it went.
145
+ */
146
+ function removeObserver(source, at) {
147
+ const observers = source.observers;
148
+ if (observers === null) return;
149
+ const last = observers.length - 2;
150
+ if (at !== last) {
151
+ const moved = observers[last];
152
+ const movedAt = observers[last + 1];
153
+ observers[at] = moved;
154
+ observers[at + 1] = movedAt;
155
+ moved.sources[movedAt + 1] = at;
156
+ }
157
+ observers.length = last;
158
+ }
159
+ /** Drops every edge from `node` to its sources. */
160
+ function unlinkSources(node) {
161
+ unlinkFrom(node, 0);
162
+ }
163
+ /** Drops the edges from `node` to the sources at index `from` of `node.sources` and later, and truncates the list. */
164
+ function unlinkFrom(node, from) {
165
+ const sources = node.sources;
166
+ if (sources.length <= from) return;
167
+ for (let i = sources.length - 2; i >= from; i -= 2) removeObserver(sources[i], sources[i + 1]);
168
+ sources.length = from;
169
+ }
170
+ /**
171
+ * The array with the pair `first`, `second` appended: a new array of exactly the right size while short (`new Array(n)`
172
+ * allocates the backing store at that size, where `push` on a short array reserves room for sixteen), the same array
173
+ * grown by `push` from sixteen entries on.
174
+ */
175
+ function withEdge(array, first, second) {
176
+ const length = array.length;
177
+ if (length >= 16) {
178
+ array.push(first, second);
179
+ return array;
180
+ }
181
+ const next = new Array(length + 2);
182
+ for (let i = 0; i < length; i += 1) next[i] = array[i];
183
+ next[length] = first;
184
+ next[length + 1] = second;
185
+ return next;
186
+ }
187
+ /**
188
+ * Records that the running computation read `source`, so a later {@link markObservers} on it marks
189
+ * that computation stale. Call it in the reader of a custom source; {@link readSignal} does it for
190
+ * signals. Does nothing when untracked, and a source read again in the same run is recorded once.
191
+ *
192
+ * @param source The source that was read.
193
+ * @example
194
+ * import { markObservers, schedule, type SourceNode, track } from "@shadow-js/core/extend";
195
+ *
196
+ * const clock: SourceNode = { kind: 0, value: Date.now(), observers: null, stamp: 0 };
197
+ * export function now(): number {
198
+ * track(clock);
199
+ * return clock.value as number;
200
+ * }
201
+ * setInterval(() => {
202
+ * clock.value = Date.now();
203
+ * markObservers(clock);
204
+ * schedule();
205
+ * }, 1000);
206
+ * @see readSignal
207
+ * @since 1.0.0
208
+ */
209
+ function track(source) {
210
+ const listener = rt.listener;
211
+ if (listener === null) return;
212
+ if (source.stamp === listener.stamp) return;
213
+ source.stamp = listener.stamp;
214
+ const position = listener.trackIndex;
215
+ if (position < listener.sources.length) {
216
+ if (listener.sources[position] === source) {
217
+ listener.trackIndex = position + 2;
218
+ return;
219
+ }
220
+ unlinkFrom(listener, position);
221
+ }
222
+ const observers = source.observers;
223
+ const sources = listener.sources;
224
+ const at = observers === null ? 0 : observers.length;
225
+ const index = sources.length;
226
+ source.observers = observers === null ? [listener, index] : withEdge(observers, listener, index);
227
+ listener.sources = withEdge(sources, source, at);
228
+ listener.trackIndex = index + 2;
229
+ }
230
+ /**
231
+ * The sources the last run of a computation read, in reading order. Use it to inspect the graph (a debugger, a test);
232
+ * it is a snapshot, so changing the returned array changes no edge.
233
+ *
234
+ * @param node The memo or effect.
235
+ * @returns The signals and memos it reads now.
236
+ * @example
237
+ * import { createComputation, createSignalNode, flushSync, readSignal, sourcesOf } from "@shadow-js/core/extend";
238
+ *
239
+ * const count = createSignalNode<number>(1, Object.is, "count");
240
+ * const effect = createComputation({ kind: "effect", fn: () => void readSignal(count) });
241
+ * flushSync();
242
+ * console.log(sourcesOf(effect).length); // 1
243
+ * @see observersOf
244
+ * @since 1.0.0
245
+ */
246
+ function sourcesOf(node) {
247
+ return everyOther(node.sources);
248
+ }
249
+ /**
250
+ * The computations that read a signal or memo in their last run, in the order their edges were made. It is a snapshot,
251
+ * so changing the returned array changes no edge. The node's own `observers` array stores pairs (the observer and an
252
+ * index for the engine), so read it through this function.
253
+ *
254
+ * @param source A signal, a memo or a custom source.
255
+ * @returns The memos and effects that read it now.
256
+ * @example
257
+ * import { createComputation, createSignalNode, flushSync, observersOf, readSignal } from "@shadow-js/core/extend";
258
+ *
259
+ * const count = createSignalNode<number>(1, Object.is, "count");
260
+ * createComputation({ kind: "effect", fn: () => void readSignal(count) });
261
+ * flushSync();
262
+ * console.log(observersOf(count).length); // 1
263
+ * @see sourcesOf
264
+ * @since 1.0.0
265
+ */
266
+ function observersOf(source) {
267
+ return source.observers === null ? [] : everyOther(source.observers);
268
+ }
269
+ /** True when at least one computation read `source` in its last run. */
270
+ function hasObservers(source) {
271
+ return source.observers !== null && source.observers.length > 0;
272
+ }
273
+ /** The first element of every pair of an edge array. */
274
+ function everyOther(edges) {
275
+ const out = [];
276
+ for (let i = 0; i < edges.length; i += 2) out.push(edges[i]);
277
+ return out;
278
+ }
279
+ const markStack = [];
280
+ function stale(observer, next) {
281
+ const previous = observer.state;
282
+ if (observer.kind === 2) {
283
+ if (previous < next) observer.state = next;
284
+ if (previous === 0) enqueue(observer);
285
+ else if (!rt.inTransition) rt.hooks?.promote(observer);
286
+ return;
287
+ }
288
+ if (previous >= next) return;
289
+ observer.state = next;
290
+ if (previous !== 0) return;
291
+ if (observer.observers !== null && observer.observers.length > 0) markStack.push(observer);
292
+ }
293
+ /**
294
+ * A suspension (a transition read pending data inside a held boundary) keeps the node's value until the
295
+ * boundary releases it. True when `error` was one, and the node was recorded for that wake-up.
296
+ */
297
+ function trySuspend(node, error) {
298
+ return rt.hooks?.suspend(node, error) === true;
299
+ }
300
+ /**
301
+ * A memo or effect frozen by a pause keeps its last value and does not refresh until it resumes.
302
+ * A memo that never computed is not frozen (it has no value to keep).
303
+ */
304
+ function isFrozen(node) {
305
+ return node.pauses > 0 && (node.flags & 32) === 0;
306
+ }
307
+ /**
308
+ * Marks the direct observers of a changed source DIRTY and everything downstream CHECK, and queues
309
+ * the effects it reaches. It does not request a flush: call `schedule` afterward, or use `notify`,
310
+ * which does both. Iterative: the graph can be 100,000 nodes deep (G-10).
311
+ *
312
+ * @param source The source whose value changed.
313
+ * @example
314
+ * import { markObservers, schedule, type SignalNode } from "@shadow-js/core/extend";
315
+ *
316
+ * export function push(list: SignalNode<string[]>, item: string): void {
317
+ * list.value.push(item); // same array: writeSignal would see no change
318
+ * markObservers(list);
319
+ * schedule();
320
+ * }
321
+ * @see track
322
+ * @since 1.0.0
323
+ */
324
+ function markObservers(source) {
325
+ staleObservers(source.observers, 2);
326
+ while (markStack.length > 0) {
327
+ const node = markStack.pop();
328
+ if (node !== void 0) staleObservers(node.observers, 1);
329
+ }
330
+ }
331
+ /** Marks every observer in a list of edge pairs stale at the given level. */
332
+ function staleObservers(observers, next) {
333
+ if (observers === null) return;
334
+ for (let i = 0; i < observers.length; i += 2) stale(observers[i], next);
335
+ }
336
+ const frameNodes = [];
337
+ const frameIndex = [];
338
+ let frameTop = 0;
339
+ /**
340
+ * Brings `root` up to date: verifies stale sources oldest-first and recomputes only nodes whose
341
+ * sources really changed (equality cut-off, G-2). Iterative so deep chains cannot overflow (G-10).
342
+ * With `eagerSources`, DIRTY nodes also refresh their previous sources first, which keeps the
343
+ * native stack flat for chains where every node reads both a fresh signal and its predecessor.
344
+ */
345
+ function updateIfNecessary(root, eagerSources = false) {
346
+ if (root.state === 0) return;
347
+ const base = frameTop;
348
+ frameNodes[frameTop] = root;
349
+ frameIndex[frameTop] = 0;
350
+ frameTop += 1;
351
+ root.flags |= 128;
352
+ try {
353
+ while (frameTop > base) {
354
+ const at = frameTop - 1;
355
+ const node = frameNodes[at];
356
+ if (node === void 0) break;
357
+ if (node.state === 1 || node.state === 2 && eagerSources) {
358
+ const sources = node.sources;
359
+ let cursor = frameIndex[at] ?? 0;
360
+ let descended = false;
361
+ while (cursor < sources.length) {
362
+ const source = sources[cursor];
363
+ cursor += 2;
364
+ if (source.kind === 0) continue;
365
+ const dependency = source;
366
+ if (dependency.state === 0 || (dependency.flags & 4) !== 0) continue;
367
+ if (isFrozen(dependency)) continue;
368
+ if ((dependency.flags & 1) !== 0) throw new ShadowError("CYCLE_DETECTED");
369
+ refreshAncestors(dependency);
370
+ if (dependency.state === 0 || (dependency.flags & 4) !== 0) continue;
371
+ if (isFrozen(dependency)) continue;
372
+ frameIndex[at] = cursor;
373
+ frameNodes[frameTop] = dependency;
374
+ frameIndex[frameTop] = 0;
375
+ frameTop += 1;
376
+ dependency.flags |= 128;
377
+ descended = true;
378
+ break;
379
+ }
380
+ if (descended) continue;
381
+ }
382
+ if (node.state === 2) recompute(node);
383
+ else node.state = 0;
384
+ node.flags &= -129;
385
+ frameTop -= 1;
386
+ }
387
+ } finally {
388
+ for (let i = base; i < frameTop; i += 1) {
389
+ const pending = frameNodes[i];
390
+ if (pending !== void 0) pending.flags &= -129;
391
+ }
392
+ frameNodes.length = base;
393
+ frameIndex.length = base;
394
+ frameTop = base;
395
+ }
396
+ }
397
+ /**
398
+ * Brings stale owners of `node` up to date, topmost first. An owner that is about to re-run will
399
+ * dispose `node`; computing `node` first would run it with state that is already out of date
400
+ * (a zombie, G-17). Iterative: the owner chain depth is user controlled.
401
+ */
402
+ function refreshAncestors(node) {
403
+ const stale = [];
404
+ for (let owner = node.parent; owner !== null; owner = owner.parent) {
405
+ if (!(owner instanceof Computation)) continue;
406
+ if (owner.state !== 0 && (owner.flags & 133) === 0 && !isFrozen(owner)) stale.push(owner);
407
+ }
408
+ for (let i = stale.length - 1; i >= 0; i -= 1) {
409
+ const ancestor = stale[i];
410
+ if (ancestor !== void 0 && (ancestor.flags & 4) === 0) updateIfNecessary(ancestor);
411
+ }
412
+ }
413
+ /**
414
+ * Reads a signal's value, subscribing the running computation to it when one is listening. The
415
+ * reader of a custom primitive built on `createSignalNode`.
416
+ *
417
+ * @param signal The signal to read.
418
+ * @returns The current value.
419
+ * @example
420
+ * import { createSignalNode, readSignal } from "@shadow-js/core/extend";
421
+ *
422
+ * const name = createSignalNode("Ada", Object.is);
423
+ * export const getName = (): string => readSignal(name);
424
+ * @see track
425
+ * @since 1.0.0
426
+ */
427
+ function readSignal(signal) {
428
+ if (rt.listener !== null) track(signal);
429
+ return signal.value;
430
+ }
431
+ /** Reads a memo: refreshes it if stale, tracks it, rethrows its stored error. */
432
+ function readMemo(memo) {
433
+ if ((memo.flags & 1) !== 0) throw new ShadowError("CYCLE_DETECTED");
434
+ if (memo.state !== 0 && (memo.flags & 4) === 0 && !isFrozen(memo)) {
435
+ refreshAncestors(memo);
436
+ if ((memo.flags & 4) === 0) updateIfNecessary(memo, rt.recomputeDepth >= DEEP_LIMIT);
437
+ }
438
+ if (rt.listener !== null) track(memo);
439
+ if ((memo.flags & 8) !== 0) throw memo.error;
440
+ return memo.value;
441
+ }
442
+ /** Re-runs a memo or effect: disposes the previous run, re-tracks sources, stores the result. */
443
+ function recompute(node) {
444
+ const fn = node.fn;
445
+ if (fn === null) return;
446
+ disposeChildren(node);
447
+ node.runCleanups();
448
+ node.trackIndex = 0;
449
+ node.errorHandlers = null;
450
+ node.idCount = 0;
451
+ node.childCount = 0;
452
+ const previousOwner = rt.owner;
453
+ const previousListener = rt.listener;
454
+ const previousRunning = rt.running;
455
+ rt.owner = node;
456
+ rt.listener = node;
457
+ rt.running = node;
458
+ rt.recomputeDepth += 1;
459
+ node.state = 0;
460
+ node.flags |= 1;
461
+ node.stamp = nextSequence();
462
+ let result;
463
+ let failed = false;
464
+ let failure;
465
+ const startedAt = performance.now();
466
+ try {
467
+ result = fn(node.value);
468
+ } catch (error) {
469
+ failed = true;
470
+ failure = error;
471
+ } finally {
472
+ rt.owner = previousOwner;
473
+ rt.listener = previousListener;
474
+ rt.running = previousRunning;
475
+ rt.recomputeDepth -= 1;
476
+ node.flags &= -2;
477
+ if (node.trackIndex < node.sources.length) unlinkFrom(node, node.trackIndex);
478
+ }
479
+ const changed = node.kind === 1 ? settleMemo(node, result, failed, failure) : true;
480
+ if (node.kind !== 1) settleEffect(node, result, failed, failure);
481
+ report(DEVTOOLS_EVENT.COMPUTATION_RUN, node, startedAt, performance.now() - startedAt, changed, sourcesOf(node));
482
+ }
483
+ /** Stores a memo's result; says whether its value changed (observers were told). */
484
+ function settleMemo(node, result, failed, failure) {
485
+ if (failed && trySuspend(node, failure)) return false;
486
+ const first = (node.flags & 32) !== 0;
487
+ node.flags &= -33;
488
+ const hadError = (node.flags & 8) !== 0;
489
+ let changed;
490
+ if (failed && routeToHandler(node, failure)) return false;
491
+ if (failed) {
492
+ node.flags |= 8;
493
+ node.error = failure;
494
+ changed = true;
495
+ } else {
496
+ node.flags &= -9;
497
+ node.error = void 0;
498
+ const equals = node.equals;
499
+ try {
500
+ changed = first || hadError || equals === false || !equals(node.value, result);
501
+ if (changed) node.value = result;
502
+ } catch (comparatorError) {
503
+ node.flags |= 8;
504
+ node.error = comparatorError;
505
+ changed = true;
506
+ }
507
+ }
508
+ if (!changed || first) return changed;
509
+ const observers = node.observers;
510
+ if (observers === null) return changed;
511
+ for (let i = 0; i < observers.length; i += 2) {
512
+ const observer = observers[i];
513
+ if (observer.state === 1) observer.state = 2;
514
+ }
515
+ return changed;
516
+ }
517
+ /**
518
+ * A memo that fails inside a boundary (an ancestor registered catchError()/onError()) reports to it
519
+ * when it fails, and keeps its previous value. Readers then see that value instead of the error:
520
+ * the reader may live outside the boundary (the DOM region that displays the memo's result), where a
521
+ * rethrown error would escape the very boundary meant to catch it. Without a handler the error is
522
+ * stored and rethrown to readers, so it is never silent.
523
+ *
524
+ * The first computation counts too: its value is `undefined`, and it is typically read by a
525
+ * consumer outside the boundary (a DOM region), not by the code that created it.
526
+ */
527
+ function routeToHandler(node, failure) {
528
+ if (!hasErrorHandler(node)) return false;
529
+ node.flags &= -9;
530
+ node.error = void 0;
531
+ try {
532
+ handleError(failure, node);
533
+ } catch (unhandled) {
534
+ node.flags |= 8;
535
+ node.error = unhandled;
536
+ }
537
+ return true;
538
+ }
539
+ function settleEffect(node, result, failed, failure) {
540
+ if (failed) {
541
+ if (!trySuspend(node, failure)) handleError(failure, node);
542
+ return;
543
+ }
544
+ const apply = node.apply;
545
+ let cleanup;
546
+ if (apply === null) cleanup = result;
547
+ else {
548
+ const deferred = (node.flags & 64) !== 0;
549
+ node.flags &= -65;
550
+ const previousValue = node.value;
551
+ node.value = result;
552
+ if (deferred) return;
553
+ const previousOwner = rt.owner;
554
+ const previousListener = rt.listener;
555
+ const previousRunning = rt.running;
556
+ rt.owner = node;
557
+ rt.listener = null;
558
+ rt.running = node;
559
+ try {
560
+ cleanup = apply(result, previousValue);
561
+ } catch (error) {
562
+ if (!trySuspend(node, error)) handleError(error, node);
563
+ return;
564
+ } finally {
565
+ rt.owner = previousOwner;
566
+ rt.listener = previousListener;
567
+ rt.running = previousRunning;
568
+ }
569
+ }
570
+ if (typeof cleanup === "function") {
571
+ addCleanup(node, cleanup);
572
+ if ((node.flags & 4) !== 0) node.runCleanups();
573
+ }
574
+ }
575
+ //#endregion
576
+ export { Computation, Signal, hasObservers, isFrozen, markObservers, observersOf, readMemo, readSignal, recompute, sourcesOf, track, unlinkSources, updateIfNecessary };
577
+
578
+ //# sourceMappingURL=graph.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"graph.js","names":[],"sources":["../../../src/internal/graph.ts"],"sourcesContent":["import { DEVTOOLS_EVENT, report } from \"./devtools\";\nimport { ShadowError } from \"./diagnostics\";\nimport {\n CHECK,\n CLEAN,\n DIRTY,\n FLAG_DEFER,\n FLAG_DISPOSED,\n FLAG_HAS_ERROR,\n FLAG_REFRESHING,\n FLAG_RENDER,\n FLAG_RUNNING,\n FLAG_UNINIT,\n KIND_EFFECT,\n KIND_MEMO,\n KIND_SIGNAL,\n} from \"./flags\";\nimport { addCleanup, disposeChildren, handleError, hasErrorHandler, Owner } from \"./owner\";\nimport { enqueue } from \"./queue\";\nimport { nextSequence, rt } from \"./state\";\nimport type { Cleanup, Equals } from \"./types\";\n\n// Shared and frozen until a computation reads its first source: most effects and memos in a large\n// tree own few edges, and an empty array per node dominates creation cost.\nconst NO_SOURCES: Edges<Source> = Object.freeze([]) as unknown as Edges<Source>;\n\n/** Memo nesting depth after which pulls switch from recursion to the iterative walk. */\nconst DEEP_LIMIT = 128;\n\n/**\n * Anything that can be read reactively and notify observers: a signal, a memo, or a custom source\n * of a primitive. Exported from `@shadow-js/core/extend` as `SourceNode`. Read one with\n * {@link track}; after changing it, call {@link markObservers} and `schedule` (or `notify`).\n * @since 1.0.0\n */\nexport interface Source {\n /**\n * The node kind: 0 for a signal and for any custom source, which have no sources of their own; a\n * computation has its own kind. A refresh walks only the sources whose kind is not 0.\n */\n readonly kind: number;\n /** The current value. */\n value: unknown;\n /**\n * The computations that read this source in their last run, as pairs: an observer, then the index of this source in\n * that observer's `sources`. Null or empty when none. Read it with `observersOf`, which returns the observers alone.\n */\n observers: Edges<Computation> | null;\n /** Stamp of the last computation run that tracked this source (dedupes repeated reads). */\n stamp: number;\n}\n\n/**\n * The edges of one node, stored as pairs in one array: the node on the other side of the edge, then the index of this\n * node's entry in that node's own edge array. One array per side costs half the memory of two parallel ones, and\n * removing an edge stays O(1): the last pair moves into the vacated place and tells its owner where it went.\n */\nexport type Edges<T> = Array<T | number>;\n\n/**\n * The storage of a signal: its value, its equality and the computations that read it. Exported from\n * `@shadow-js/core/extend` as `SignalNode`; create one with `createSignalNode`, read it with\n * {@link readSignal} and write it with `writeSignal`, which notifies its readers. Build a custom\n * primitive on it the way `useSignal` does.\n *\n * @example\n * import { createSignalNode, readSignal, SignalNode, writeSignal } from \"@shadow-js/core/extend\";\n *\n * const count = createSignalNode<number>(0, Object.is, \"count\");\n * writeSignal(count, 1);\n * console.log(readSignal(count), count instanceof SignalNode); // 1 true\n * @see createSignalNode\n * @since 1.0.0\n */\nexport class Signal<T = unknown> implements Source {\n /** Always 0, the kind of a signal. */\n readonly kind: number = KIND_SIGNAL;\n /**\n * The current value. Assigning it directly notifies no one: use `writeSignal`, or call `notify`\n * after the assignment.\n */\n value: T;\n /** Decides whether a write is a change; `false` treats every write as one. */\n equals: Equals<T>;\n /** The computations that read this signal in their last run, as pairs (see {@link Source.observers}). */\n observers: Edges<Computation> | null = null;\n /** Stamp of the last computation run that tracked this signal (dedupes repeated reads). */\n stamp = 0;\n /**\n * Label shown by devtools and diagnostics.\n * @default undefined (the signal is unnamed)\n */\n name: string | undefined;\n\n /**\n * Creates a signal. Prefer `createSignalNode`, which takes the same arguments.\n * @param value Initial value.\n * @param equals Equality that decides whether a write is a change.\n * @param name Devtools label, or undefined for an unnamed signal.\n */\n constructor(value: T, equals: Equals<T>, name: string | undefined) {\n this.value = value;\n this.equals = equals;\n this.name = name;\n if (__DEV__) report(DEVTOOLS_EVENT.SIGNAL_CREATED, this, rt.owner, name, value);\n }\n}\n\n/**\n * A memo or an effect: an owner that reads sources and (for memos) is itself a source. Exported from\n * `@shadow-js/core/extend` as `ComputationNode`; create one with `createComputation` and read a memo\n * with `readComputation`. It owns what its function creates: each run first disposes the children\n * and runs the cleanups of the previous run.\n *\n * @example\n * import { createComputation, createSignalNode, readComputation, readSignal } from \"@shadow-js/core/extend\";\n *\n * const price = createSignalNode(10, Object.is);\n * const total = createComputation({ kind: \"memo\", fn: () => readSignal(price) * 2 });\n * console.log(readComputation<number>(total)); // 20\n * @see createComputation\n * @since 1.0.0\n */\nexport class Computation extends Owner implements Source {\n /** 1 for a memo, 2 for an effect. */\n kind: number;\n /** How stale the node is: 0 (clean), 1 (a transitive source changed), 2 (a direct source changed). */\n state: number;\n /** Engine bit flags (queued, running, disposed, render phase, ...). Read-only outside the engine. */\n flags: number;\n /** A memo's last value; an effect's last computed value when it has an `apply` stage. */\n value: unknown;\n /** The error a memo's last run threw, rethrown to its readers; undefined when it succeeded. */\n error: unknown = undefined;\n /** A memo's equality: readers are notified only when it says the new value differs. */\n equals: Equals<unknown>;\n /** The function each run calls with the previous value; null once disposed. */\n fn: ((previous: never) => unknown) | null;\n /**\n * An effect's second stage, run untracked with the computed value and the previous one; null for\n * none and once disposed.\n */\n apply: ((value: never, previous: never) => unknown) | null = null;\n /**\n * The sources the last run read, in reading order, as pairs: a source, then the index of this computation in that\n * source's `observers`. Read it with `sourcesOf`, which returns the sources alone.\n */\n sources: Edges<Source> = NO_SOURCES;\n /** The computations that read this memo in their last run, as pairs (see {@link Source.observers}). */\n observers: Edges<Computation> | null = null;\n /** Stamp of the current run while it tracks, and of the last run that tracked this memo. */\n stamp = 0;\n /** During a run: how many leading entries of `sources` were confirmed again (they keep their edges). */\n trackIndex = 0;\n /** Creation order; breaks ties between effects at equal depth (G-16). */\n seq: number;\n /**\n * Label shown by devtools and diagnostics.\n * @default undefined (the computation is unnamed)\n */\n name: string | undefined;\n\n /**\n * Creates a computation that has not run yet. Prefer `createComputation`, which also runs or\n * queues it.\n * @param parent The owner to attach to, or null.\n * @param kind 1 for a memo, 2 for an effect.\n * @param flags Initial engine bit flags.\n * @param fn The function each run calls.\n * @param equals A memo's equality; `false` for an effect.\n * @param name Devtools label, or undefined.\n */\n constructor(\n parent: Owner | null,\n kind: number,\n flags: number,\n fn: (previous: never) => unknown,\n equals: Equals<unknown>,\n name: string | undefined,\n ) {\n super(parent);\n this.kind = kind;\n this.flags = flags;\n this.state = DIRTY;\n this.fn = fn;\n this.equals = equals;\n this.name = name;\n this.value = undefined;\n this.seq = nextSequence();\n if (__DEV__) {\n report(\n DEVTOOLS_EVENT.COMPUTATION_CREATED,\n this,\n parent,\n kind === KIND_MEMO ? \"memo\" : \"effect\",\n name,\n (flags & FLAG_RENDER) !== 0,\n );\n }\n }\n\n protected override reportDisposed(): void {\n if (__DEV__) report(DEVTOOLS_EVENT.COMPUTATION_DISPOSED, this);\n }\n\n protected override release(): void {\n this.flags |= FLAG_DISPOSED;\n unlinkSources(this);\n this.fn = null;\n this.apply = null;\n }\n}\n\n/**\n * Removes the pair at `at` from `source.observers` in O(1): the last pair moves into its place, and its observer is told\n * where it went.\n */\nfunction removeObserver(source: Source, at: number): void {\n const observers = source.observers;\n if (observers === null) return;\n const last = observers.length - 2;\n if (at !== last) {\n const moved = observers[last] as Computation;\n const movedAt = observers[last + 1] as number;\n observers[at] = moved;\n observers[at + 1] = movedAt;\n moved.sources[movedAt + 1] = at;\n }\n observers.length = last;\n}\n\n/** Drops every edge from `node` to its sources. */\nexport function unlinkSources(node: Computation): void {\n unlinkFrom(node, 0);\n}\n\n/** Drops the edges from `node` to the sources at index `from` of `node.sources` and later, and truncates the list. */\nfunction unlinkFrom(node: Computation, from: number): void {\n const sources = node.sources;\n if (sources.length <= from) return;\n for (let i = sources.length - 2; i >= from; i -= 2) {\n // The index in the source is read each time: removing an edge may move this node's pair in another source.\n removeObserver(sources[i] as Source, sources[i + 1] as number);\n }\n sources.length = from;\n}\n\n/**\n * The array with the pair `first`, `second` appended: a new array of exactly the right size while short (`new Array(n)`\n * allocates the backing store at that size, where `push` on a short array reserves room for sixteen), the same array\n * grown by `push` from sixteen entries on.\n */\nfunction withEdge<T>(array: Array<T | number>, first: T, second: number): Array<T | number> {\n const length = array.length;\n if (length >= 16) {\n array.push(first, second);\n return array;\n }\n const next = new Array<T | number>(length + 2);\n for (let i = 0; i < length; i += 1) next[i] = array[i] as T | number;\n next[length] = first;\n next[length + 1] = second;\n return next;\n}\n\n/**\n * Records that the running computation read `source`, so a later {@link markObservers} on it marks\n * that computation stale. Call it in the reader of a custom source; {@link readSignal} does it for\n * signals. Does nothing when untracked, and a source read again in the same run is recorded once.\n *\n * @param source The source that was read.\n * @example\n * import { markObservers, schedule, type SourceNode, track } from \"@shadow-js/core/extend\";\n *\n * const clock: SourceNode = { kind: 0, value: Date.now(), observers: null, stamp: 0 };\n * export function now(): number {\n * track(clock);\n * return clock.value as number;\n * }\n * setInterval(() => {\n * clock.value = Date.now();\n * markObservers(clock);\n * schedule();\n * }, 1000);\n * @see readSignal\n * @since 1.0.0\n */\nexport function track(source: Source): void {\n const listener = rt.listener;\n if (listener === null) return;\n if (source.stamp === listener.stamp) return;\n source.stamp = listener.stamp;\n // Same dependency at the same position as last run: keep the edge, touch nothing.\n const position = listener.trackIndex;\n if (position < listener.sources.length) {\n if (listener.sources[position] === source) {\n listener.trackIndex = position + 2;\n return;\n }\n unlinkFrom(listener, position);\n }\n // Edge arrays are small: most nodes have one to three edges. `push` on a short array reserves room for about sixteen\n // entries (200 bytes where an exact array takes 64, measured), and a large list pays it for every row. A short array\n // therefore grows into a new exact one; from sixteen entries on `push` amortizes. Nothing iterates an edge array of\n // a node while it tracks, so replacing the array is safe.\n const observers = source.observers;\n const sources = listener.sources;\n const at = observers === null ? 0 : observers.length;\n const index = sources.length;\n source.observers =\n observers === null\n ? [listener, index]\n : (withEdge(observers, listener, index) as Edges<Computation>);\n listener.sources = withEdge(sources, source, at) as Edges<Source>;\n listener.trackIndex = index + 2;\n}\n\n/**\n * The sources the last run of a computation read, in reading order. Use it to inspect the graph (a debugger, a test);\n * it is a snapshot, so changing the returned array changes no edge.\n *\n * @param node The memo or effect.\n * @returns The signals and memos it reads now.\n * @example\n * import { createComputation, createSignalNode, flushSync, readSignal, sourcesOf } from \"@shadow-js/core/extend\";\n *\n * const count = createSignalNode<number>(1, Object.is, \"count\");\n * const effect = createComputation({ kind: \"effect\", fn: () => void readSignal(count) });\n * flushSync();\n * console.log(sourcesOf(effect).length); // 1\n * @see observersOf\n * @since 1.0.0\n */\nexport function sourcesOf(node: Computation): Source[] {\n return everyOther(node.sources) as Source[];\n}\n\n/**\n * The computations that read a signal or memo in their last run, in the order their edges were made. It is a snapshot,\n * so changing the returned array changes no edge. The node's own `observers` array stores pairs (the observer and an\n * index for the engine), so read it through this function.\n *\n * @param source A signal, a memo or a custom source.\n * @returns The memos and effects that read it now.\n * @example\n * import { createComputation, createSignalNode, flushSync, observersOf, readSignal } from \"@shadow-js/core/extend\";\n *\n * const count = createSignalNode<number>(1, Object.is, \"count\");\n * createComputation({ kind: \"effect\", fn: () => void readSignal(count) });\n * flushSync();\n * console.log(observersOf(count).length); // 1\n * @see sourcesOf\n * @since 1.0.0\n */\nexport function observersOf(source: Source): Computation[] {\n return source.observers === null ? [] : (everyOther(source.observers) as Computation[]);\n}\n\n/** True when at least one computation read `source` in its last run. */\nexport function hasObservers(source: Source): boolean {\n return source.observers !== null && source.observers.length > 0;\n}\n\n/** The first element of every pair of an edge array. */\nfunction everyOther<T>(edges: Edges<T>): T[] {\n const out: T[] = [];\n for (let i = 0; i < edges.length; i += 2) out.push(edges[i] as T);\n return out;\n}\n\n// Scratch stack for markObservers; never holds data across calls.\nconst markStack: Computation[] = [];\n\nfunction stale(observer: Computation, next: number): void {\n const previous = observer.state;\n if (observer.kind === KIND_EFFECT) {\n if (previous < next) observer.state = next;\n if (previous === CLEAN) enqueue(observer);\n else if (!rt.inTransition) rt.hooks?.promote(observer);\n return;\n }\n if (previous >= next) return;\n observer.state = next;\n if (previous !== CLEAN) return;\n if (observer.observers !== null && observer.observers.length > 0) markStack.push(observer);\n}\n\n/**\n * A suspension (a transition read pending data inside a held boundary) keeps the node's value until the\n * boundary releases it. True when `error` was one, and the node was recorded for that wake-up.\n */\nfunction trySuspend(node: Computation, error: unknown): boolean {\n return rt.hooks?.suspend(node, error) === true;\n}\n\n/**\n * A memo or effect frozen by a pause keeps its last value and does not refresh until it resumes.\n * A memo that never computed is not frozen (it has no value to keep).\n */\nexport function isFrozen(node: Computation): boolean {\n return node.pauses > 0 && (node.flags & FLAG_UNINIT) === 0;\n}\n\n/**\n * Marks the direct observers of a changed source DIRTY and everything downstream CHECK, and queues\n * the effects it reaches. It does not request a flush: call `schedule` afterward, or use `notify`,\n * which does both. Iterative: the graph can be 100,000 nodes deep (G-10).\n *\n * @param source The source whose value changed.\n * @example\n * import { markObservers, schedule, type SignalNode } from \"@shadow-js/core/extend\";\n *\n * export function push(list: SignalNode<string[]>, item: string): void {\n * list.value.push(item); // same array: writeSignal would see no change\n * markObservers(list);\n * schedule();\n * }\n * @see track\n * @since 1.0.0\n */\nexport function markObservers(source: Source): void {\n staleObservers(source.observers, DIRTY);\n while (markStack.length > 0) {\n const node = markStack.pop();\n if (node !== undefined) staleObservers(node.observers, CHECK);\n }\n}\n\n/** Marks every observer in a list of edge pairs stale at the given level. */\nfunction staleObservers(observers: Edges<Computation> | null, next: number): void {\n if (observers === null) return;\n for (let i = 0; i < observers.length; i += 2) stale(observers[i] as Computation, next);\n}\n\n// Scratch frames for updateIfNecessary; entries above `frameTop` are dead.\nconst frameNodes: Computation[] = [];\nconst frameIndex: number[] = [];\nlet frameTop = 0;\n\n/**\n * Brings `root` up to date: verifies stale sources oldest-first and recomputes only nodes whose\n * sources really changed (equality cut-off, G-2). Iterative so deep chains cannot overflow (G-10).\n * With `eagerSources`, DIRTY nodes also refresh their previous sources first, which keeps the\n * native stack flat for chains where every node reads both a fresh signal and its predecessor.\n */\nexport function updateIfNecessary(root: Computation, eagerSources = false): void {\n if (root.state === CLEAN) return;\n const base = frameTop;\n frameNodes[frameTop] = root;\n frameIndex[frameTop] = 0;\n frameTop += 1;\n root.flags |= FLAG_REFRESHING;\n try {\n while (frameTop > base) {\n const at = frameTop - 1;\n const node = frameNodes[at];\n if (node === undefined) break;\n if (node.state === CHECK || (node.state === DIRTY && eagerSources)) {\n const sources = node.sources;\n let cursor = frameIndex[at] ?? 0;\n let descended = false;\n while (cursor < sources.length) {\n const source = sources[cursor] as Source;\n cursor += 2;\n if (source.kind === KIND_SIGNAL) continue;\n const dependency = source as Computation;\n if (dependency.state === CLEAN || (dependency.flags & FLAG_DISPOSED) !== 0) continue;\n if (isFrozen(dependency)) continue;\n if ((dependency.flags & FLAG_RUNNING) !== 0) throw new ShadowError(\"CYCLE_DETECTED\");\n // An owner that is about to re-run would dispose this dependency: update it first.\n refreshAncestors(dependency);\n if (dependency.state === CLEAN || (dependency.flags & FLAG_DISPOSED) !== 0) continue;\n if (isFrozen(dependency)) continue;\n frameIndex[at] = cursor;\n frameNodes[frameTop] = dependency;\n frameIndex[frameTop] = 0;\n frameTop += 1;\n dependency.flags |= FLAG_REFRESHING;\n descended = true;\n break;\n }\n if (descended) continue;\n }\n if (node.state === DIRTY) recompute(node);\n else node.state = CLEAN;\n node.flags &= ~FLAG_REFRESHING;\n frameTop -= 1;\n }\n } finally {\n // An exception leaves frames on the stack: they must not stay marked as being refreshed.\n for (let i = base; i < frameTop; i += 1) {\n const pending = frameNodes[i];\n if (pending !== undefined) pending.flags &= ~FLAG_REFRESHING;\n }\n frameNodes.length = base;\n frameIndex.length = base;\n frameTop = base;\n }\n}\n\n/**\n * Brings stale owners of `node` up to date, topmost first. An owner that is about to re-run will\n * dispose `node`; computing `node` first would run it with state that is already out of date\n * (a zombie, G-17). Iterative: the owner chain depth is user controlled.\n */\nfunction refreshAncestors(node: Computation): void {\n const stale: Computation[] = [];\n for (let owner = node.parent; owner !== null; owner = owner.parent) {\n if (!(owner instanceof Computation)) continue;\n if (\n owner.state !== CLEAN &&\n (owner.flags & (FLAG_RUNNING | FLAG_DISPOSED | FLAG_REFRESHING)) === 0 &&\n !isFrozen(owner)\n ) {\n stale.push(owner);\n }\n }\n for (let i = stale.length - 1; i >= 0; i -= 1) {\n const ancestor = stale[i];\n if (ancestor !== undefined && (ancestor.flags & FLAG_DISPOSED) === 0) {\n updateIfNecessary(ancestor);\n }\n }\n}\n\n/**\n * Reads a signal's value, subscribing the running computation to it when one is listening. The\n * reader of a custom primitive built on `createSignalNode`.\n *\n * @param signal The signal to read.\n * @returns The current value.\n * @example\n * import { createSignalNode, readSignal } from \"@shadow-js/core/extend\";\n *\n * const name = createSignalNode(\"Ada\", Object.is);\n * export const getName = (): string => readSignal(name);\n * @see track\n * @since 1.0.0\n */\nexport function readSignal<T>(signal: Signal<T>): T {\n if (rt.listener !== null) track(signal);\n return signal.value;\n}\n\n/** Reads a memo: refreshes it if stale, tracks it, rethrows its stored error. */\nexport function readMemo<T>(memo: Computation): T {\n if ((memo.flags & FLAG_RUNNING) !== 0) throw new ShadowError(\"CYCLE_DETECTED\");\n if (memo.state !== CLEAN && (memo.flags & FLAG_DISPOSED) === 0 && !isFrozen(memo)) {\n refreshAncestors(memo);\n if ((memo.flags & FLAG_DISPOSED) === 0) {\n updateIfNecessary(memo, rt.recomputeDepth >= DEEP_LIMIT);\n }\n }\n if (rt.listener !== null) track(memo);\n if ((memo.flags & FLAG_HAS_ERROR) !== 0) throw memo.error;\n return memo.value as T;\n}\n\n/** Re-runs a memo or effect: disposes the previous run, re-tracks sources, stores the result. */\nexport function recompute(node: Computation): void {\n const fn = node.fn;\n if (fn === null) return;\n disposeChildren(node);\n node.runCleanups();\n // Edges are kept and re-confirmed in order while the function runs (see track()).\n node.trackIndex = 0;\n // Each run starts from a clean slate: handlers, ids and child indices belong to one run.\n node.errorHandlers = null;\n node.idCount = 0;\n node.childCount = 0;\n\n const previousOwner = rt.owner;\n const previousListener = rt.listener;\n const previousRunning = rt.running;\n rt.owner = node;\n rt.listener = node;\n rt.running = node;\n rt.recomputeDepth += 1;\n node.state = CLEAN;\n node.flags |= FLAG_RUNNING;\n node.stamp = nextSequence();\n\n let result: unknown;\n let failed = false;\n let failure: unknown;\n const startedAt = __DEV__ ? performance.now() : 0;\n try {\n result = (fn as (previous: unknown) => unknown)(node.value);\n } catch (error) {\n failed = true;\n failure = error;\n } finally {\n rt.owner = previousOwner;\n rt.listener = previousListener;\n rt.running = previousRunning;\n rt.recomputeDepth -= 1;\n node.flags &= ~FLAG_RUNNING;\n // Sources this run did not read again are no longer dependencies.\n if (node.trackIndex < node.sources.length) unlinkFrom(node, node.trackIndex);\n }\n\n const changed = node.kind === KIND_MEMO ? settleMemo(node, result, failed, failure) : true;\n if (node.kind !== KIND_MEMO) settleEffect(node, result, failed, failure);\n if (__DEV__) {\n report(\n DEVTOOLS_EVENT.COMPUTATION_RUN,\n node,\n startedAt,\n performance.now() - startedAt,\n changed,\n sourcesOf(node),\n );\n }\n}\n\n/** Stores a memo's result; says whether its value changed (observers were told). */\nfunction settleMemo(\n node: Computation,\n result: unknown,\n failed: boolean,\n failure: unknown,\n): boolean {\n // A suspended memo keeps its previous value: its readers see nothing change until it resumes.\n if (failed && trySuspend(node, failure)) return false;\n const first = (node.flags & FLAG_UNINIT) !== 0;\n node.flags &= ~FLAG_UNINIT;\n const hadError = (node.flags & FLAG_HAS_ERROR) !== 0;\n let changed: boolean;\n if (failed && routeToHandler(node, failure)) {\n return false;\n }\n if (failed) {\n node.flags |= FLAG_HAS_ERROR;\n node.error = failure;\n changed = true;\n } else {\n node.flags &= ~FLAG_HAS_ERROR;\n node.error = undefined;\n const equals = node.equals;\n try {\n changed = first || hadError || equals === false || !equals(node.value, result);\n if (changed) node.value = result;\n } catch (comparatorError) {\n // A throwing comparator is a failing memo, not a wedged graph: readers see the error.\n node.flags |= FLAG_HAS_ERROR;\n node.error = comparatorError;\n changed = true;\n }\n }\n if (!changed || first) return changed;\n const observers = node.observers;\n if (observers === null) return changed;\n for (let i = 0; i < observers.length; i += 2) {\n const observer = observers[i] as Computation;\n if (observer.state === CHECK) observer.state = DIRTY;\n }\n return changed;\n}\n\n/**\n * A memo that fails inside a boundary (an ancestor registered catchError()/onError()) reports to it\n * when it fails, and keeps its previous value. Readers then see that value instead of the error:\n * the reader may live outside the boundary (the DOM region that displays the memo's result), where a\n * rethrown error would escape the very boundary meant to catch it. Without a handler the error is\n * stored and rethrown to readers, so it is never silent.\n *\n * The first computation counts too: its value is `undefined`, and it is typically read by a\n * consumer outside the boundary (a DOM region), not by the code that created it.\n */\nfunction routeToHandler(node: Computation, failure: unknown): boolean {\n if (!hasErrorHandler(node)) return false;\n node.flags &= ~FLAG_HAS_ERROR;\n node.error = undefined;\n try {\n handleError(failure, node);\n } catch (unhandled) {\n // The chain ended in a handler that rethrew: readers see it, as for any unhandled failure.\n node.flags |= FLAG_HAS_ERROR;\n node.error = unhandled;\n }\n return true;\n}\n\nfunction settleEffect(node: Computation, result: unknown, failed: boolean, failure: unknown): void {\n if (failed) {\n if (!trySuspend(node, failure)) handleError(failure, node);\n return;\n }\n const apply = node.apply;\n let cleanup: unknown;\n if (apply === null) {\n cleanup = result;\n } else {\n const deferred = (node.flags & FLAG_DEFER) !== 0;\n node.flags &= ~FLAG_DEFER;\n const previousValue = node.value;\n node.value = result;\n if (deferred) return;\n const previousOwner = rt.owner;\n const previousListener = rt.listener;\n const previousRunning = rt.running;\n rt.owner = node;\n rt.listener = null;\n // Writes from an effect's apply are legal even when the effect was created inside a memo.\n rt.running = node;\n try {\n cleanup = (apply as (value: unknown, previous: unknown) => unknown)(result, previousValue);\n } catch (error) {\n if (!trySuspend(node, error)) handleError(error, node);\n return;\n } finally {\n rt.owner = previousOwner;\n rt.listener = previousListener;\n rt.running = previousRunning;\n }\n }\n if (typeof cleanup === \"function\") {\n addCleanup(node, cleanup as Cleanup);\n // The effect disposed its own owner while running: nothing will dispose it again, so run now.\n if ((node.flags & FLAG_DISPOSED) !== 0) node.runCleanups();\n }\n}\n"],"mappings":";;;;;;AAwBA,MAAM,aAA4B,OAAO,OAAO,CAAC,CAAC;;AAGlD,MAAM,aAAa;;;;;;;;;;;;;;;;AA+CnB,IAAa,SAAb,MAAmD;;CAEjD,OAAS;;;;;CAKT;;CAEA;;CAEA,YAAuC;;CAEvC,QAAQ;;;;;CAKR;;;;;;;CAQA,YAAY,OAAU,QAAmB,MAA0B;EACjE,KAAK,QAAQ;EACb,KAAK,SAAS;EACd,KAAK,OAAO;EACC,OAAO,eAAe,gBAAgB,MAAM,GAAG,OAAO,MAAM,KAAK;CAChF;AACF;;;;;;;;;;;;;;;;AAiBA,IAAa,cAAb,cAAiC,MAAwB;;CAEvD;;CAEA;;CAEA;;CAEA;;CAEA,QAAiB,KAAA;;CAEjB;;CAEA;;;;;CAKA,QAA6D;;;;;CAK7D,UAAyB;;CAEzB,YAAuC;;CAEvC,QAAQ;;CAER,aAAa;;CAEb;;;;;CAKA;;;;;;;;;;;CAYA,YACE,QACA,MACA,OACA,IACA,QACA,MACA;EACA,MAAM,MAAM;EACZ,KAAK,OAAO;EACZ,KAAK,QAAQ;EACb,KAAK,QAAA;EACL,KAAK,KAAK;EACV,KAAK,SAAS;EACd,KAAK,OAAO;EACZ,KAAK,QAAQ,KAAA;EACb,KAAK,MAAM,aAAa;EAEtB,OACE,eAAe,qBACf,MACA,QACA,SAAA,IAAqB,SAAS,UAC9B,OACC,QAAA,QAAyB,CAC5B;CAEJ;CAEA,iBAA0C;EAC3B,OAAO,eAAe,sBAAsB,IAAI;CAC/D;CAEA,UAAmC;EACjC,KAAK,SAAA;EACL,cAAc,IAAI;EAClB,KAAK,KAAK;EACV,KAAK,QAAQ;CACf;AACF;;;;;AAMA,SAAS,eAAe,QAAgB,IAAkB;CACxD,MAAM,YAAY,OAAO;CACzB,IAAI,cAAc,MAAM;CACxB,MAAM,OAAO,UAAU,SAAS;CAChC,IAAI,OAAO,MAAM;EACf,MAAM,QAAQ,UAAU;EACxB,MAAM,UAAU,UAAU,OAAO;EACjC,UAAU,MAAM;EAChB,UAAU,KAAK,KAAK;EACpB,MAAM,QAAQ,UAAU,KAAK;CAC/B;CACA,UAAU,SAAS;AACrB;;AAGA,SAAgB,cAAc,MAAyB;CACrD,WAAW,MAAM,CAAC;AACpB;;AAGA,SAAS,WAAW,MAAmB,MAAoB;CACzD,MAAM,UAAU,KAAK;CACrB,IAAI,QAAQ,UAAU,MAAM;CAC5B,KAAK,IAAI,IAAI,QAAQ,SAAS,GAAG,KAAK,MAAM,KAAK,GAE/C,eAAe,QAAQ,IAAc,QAAQ,IAAI,EAAY;CAE/D,QAAQ,SAAS;AACnB;;;;;;AAOA,SAAS,SAAY,OAA0B,OAAU,QAAmC;CAC1F,MAAM,SAAS,MAAM;CACrB,IAAI,UAAU,IAAI;EAChB,MAAM,KAAK,OAAO,MAAM;EACxB,OAAO;CACT;CACA,MAAM,OAAO,IAAI,MAAkB,SAAS,CAAC;CAC7C,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAAK,GAAG,KAAK,KAAK,MAAM;CACpD,KAAK,UAAU;CACf,KAAK,SAAS,KAAK;CACnB,OAAO;AACT;;;;;;;;;;;;;;;;;;;;;;;AAwBA,SAAgB,MAAM,QAAsB;CAC1C,MAAM,WAAW,GAAG;CACpB,IAAI,aAAa,MAAM;CACvB,IAAI,OAAO,UAAU,SAAS,OAAO;CACrC,OAAO,QAAQ,SAAS;CAExB,MAAM,WAAW,SAAS;CAC1B,IAAI,WAAW,SAAS,QAAQ,QAAQ;EACtC,IAAI,SAAS,QAAQ,cAAc,QAAQ;GACzC,SAAS,aAAa,WAAW;GACjC;EACF;EACA,WAAW,UAAU,QAAQ;CAC/B;CAKA,MAAM,YAAY,OAAO;CACzB,MAAM,UAAU,SAAS;CACzB,MAAM,KAAK,cAAc,OAAO,IAAI,UAAU;CAC9C,MAAM,QAAQ,QAAQ;CACtB,OAAO,YACL,cAAc,OACV,CAAC,UAAU,KAAK,IACf,SAAS,WAAW,UAAU,KAAK;CAC1C,SAAS,UAAU,SAAS,SAAS,QAAQ,EAAE;CAC/C,SAAS,aAAa,QAAQ;AAChC;;;;;;;;;;;;;;;;;AAkBA,SAAgB,UAAU,MAA6B;CACrD,OAAO,WAAW,KAAK,OAAO;AAChC;;;;;;;;;;;;;;;;;;AAmBA,SAAgB,YAAY,QAA+B;CACzD,OAAO,OAAO,cAAc,OAAO,CAAC,IAAK,WAAW,OAAO,SAAS;AACtE;;AAGA,SAAgB,aAAa,QAAyB;CACpD,OAAO,OAAO,cAAc,QAAQ,OAAO,UAAU,SAAS;AAChE;;AAGA,SAAS,WAAc,OAAsB;CAC3C,MAAM,MAAW,CAAC;CAClB,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,GAAG,IAAI,KAAK,MAAM,EAAO;CAChE,OAAO;AACT;AAGA,MAAM,YAA2B,CAAC;AAElC,SAAS,MAAM,UAAuB,MAAoB;CACxD,MAAM,WAAW,SAAS;CAC1B,IAAI,SAAS,SAAA,GAAsB;EACjC,IAAI,WAAW,MAAM,SAAS,QAAQ;EACtC,IAAI,aAAA,GAAoB,QAAQ,QAAQ;OACnC,IAAI,CAAC,GAAG,cAAc,GAAG,OAAO,QAAQ,QAAQ;EACrD;CACF;CACA,IAAI,YAAY,MAAM;CACtB,SAAS,QAAQ;CACjB,IAAI,aAAA,GAAoB;CACxB,IAAI,SAAS,cAAc,QAAQ,SAAS,UAAU,SAAS,GAAG,UAAU,KAAK,QAAQ;AAC3F;;;;;AAMA,SAAS,WAAW,MAAmB,OAAyB;CAC9D,OAAO,GAAG,OAAO,QAAQ,MAAM,KAAK,MAAM;AAC5C;;;;;AAMA,SAAgB,SAAS,MAA4B;CACnD,OAAO,KAAK,SAAS,MAAM,KAAK,QAAA,QAAyB;AAC3D;;;;;;;;;;;;;;;;;;AAmBA,SAAgB,cAAc,QAAsB;CAClD,eAAe,OAAO,WAAA,CAAgB;CACtC,OAAO,UAAU,SAAS,GAAG;EAC3B,MAAM,OAAO,UAAU,IAAI;EAC3B,IAAI,SAAS,KAAA,GAAW,eAAe,KAAK,WAAA,CAAgB;CAC9D;AACF;;AAGA,SAAS,eAAe,WAAsC,MAAoB;CAChF,IAAI,cAAc,MAAM;CACxB,KAAK,IAAI,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK,GAAG,MAAM,UAAU,IAAmB,IAAI;AACvF;AAGA,MAAM,aAA4B,CAAC;AACnC,MAAM,aAAuB,CAAC;AAC9B,IAAI,WAAW;;;;;;;AAQf,SAAgB,kBAAkB,MAAmB,eAAe,OAAa;CAC/E,IAAI,KAAK,UAAA,GAAiB;CAC1B,MAAM,OAAO;CACb,WAAW,YAAY;CACvB,WAAW,YAAY;CACvB,YAAY;CACZ,KAAK,SAAA;CACL,IAAI;EACF,OAAO,WAAW,MAAM;GACtB,MAAM,KAAK,WAAW;GACtB,MAAM,OAAO,WAAW;GACxB,IAAI,SAAS,KAAA,GAAW;GACxB,IAAI,KAAK,UAAA,KAAoB,KAAK,UAAA,KAAmB,cAAe;IAClE,MAAM,UAAU,KAAK;IACrB,IAAI,SAAS,WAAW,OAAO;IAC/B,IAAI,YAAY;IAChB,OAAO,SAAS,QAAQ,QAAQ;KAC9B,MAAM,SAAS,QAAQ;KACvB,UAAU;KACV,IAAI,OAAO,SAAA,GAAsB;KACjC,MAAM,aAAa;KACnB,IAAI,WAAW,UAAA,MAAoB,WAAW,QAAA,OAA2B,GAAG;KAC5E,IAAI,SAAS,UAAU,GAAG;KAC1B,KAAK,WAAW,QAAA,OAA0B,GAAG,MAAM,IAAI,YAAY,gBAAgB;KAEnF,iBAAiB,UAAU;KAC3B,IAAI,WAAW,UAAA,MAAoB,WAAW,QAAA,OAA2B,GAAG;KAC5E,IAAI,SAAS,UAAU,GAAG;KAC1B,WAAW,MAAM;KACjB,WAAW,YAAY;KACvB,WAAW,YAAY;KACvB,YAAY;KACZ,WAAW,SAAA;KACX,YAAY;KACZ;IACF;IACA,IAAI,WAAW;GACjB;GACA,IAAI,KAAK,UAAA,GAAiB,UAAU,IAAI;QACnC,KAAK,QAAA;GACV,KAAK,SAAS;GACd,YAAY;EACd;CACF,UAAU;EAER,KAAK,IAAI,IAAI,MAAM,IAAI,UAAU,KAAK,GAAG;GACvC,MAAM,UAAU,WAAW;GAC3B,IAAI,YAAY,KAAA,GAAW,QAAQ,SAAS;EAC9C;EACA,WAAW,SAAS;EACpB,WAAW,SAAS;EACpB,WAAW;CACb;AACF;;;;;;AAOA,SAAS,iBAAiB,MAAyB;CACjD,MAAM,QAAuB,CAAC;CAC9B,KAAK,IAAI,QAAQ,KAAK,QAAQ,UAAU,MAAM,QAAQ,MAAM,QAAQ;EAClE,IAAI,EAAE,iBAAiB,cAAc;EACrC,IACE,MAAM,UAAA,MACL,MAAM,QAAA,SAA8D,KACrE,CAAC,SAAS,KAAK,GAEf,MAAM,KAAK,KAAK;CAEpB;CACA,KAAK,IAAI,IAAI,MAAM,SAAS,GAAG,KAAK,GAAG,KAAK,GAAG;EAC7C,MAAM,WAAW,MAAM;EACvB,IAAI,aAAa,KAAA,MAAc,SAAS,QAAA,OAA2B,GACjE,kBAAkB,QAAQ;CAE9B;AACF;;;;;;;;;;;;;;;AAgBA,SAAgB,WAAc,QAAsB;CAClD,IAAI,GAAG,aAAa,MAAM,MAAM,MAAM;CACtC,OAAO,OAAO;AAChB;;AAGA,SAAgB,SAAY,MAAsB;CAChD,KAAK,KAAK,QAAA,OAA0B,GAAG,MAAM,IAAI,YAAY,gBAAgB;CAC7E,IAAI,KAAK,UAAA,MAAoB,KAAK,QAAA,OAA2B,KAAK,CAAC,SAAS,IAAI,GAAG;EACjF,iBAAiB,IAAI;EACrB,KAAK,KAAK,QAAA,OAA2B,GACnC,kBAAkB,MAAM,GAAG,kBAAkB,UAAU;CAE3D;CACA,IAAI,GAAG,aAAa,MAAM,MAAM,IAAI;CACpC,KAAK,KAAK,QAAA,OAA4B,GAAG,MAAM,KAAK;CACpD,OAAO,KAAK;AACd;;AAGA,SAAgB,UAAU,MAAyB;CACjD,MAAM,KAAK,KAAK;CAChB,IAAI,OAAO,MAAM;CACjB,gBAAgB,IAAI;CACpB,KAAK,YAAY;CAEjB,KAAK,aAAa;CAElB,KAAK,gBAAgB;CACrB,KAAK,UAAU;CACf,KAAK,aAAa;CAElB,MAAM,gBAAgB,GAAG;CACzB,MAAM,mBAAmB,GAAG;CAC5B,MAAM,kBAAkB,GAAG;CAC3B,GAAG,QAAQ;CACX,GAAG,WAAW;CACd,GAAG,UAAU;CACb,GAAG,kBAAkB;CACrB,KAAK,QAAA;CACL,KAAK,SAAA;CACL,KAAK,QAAQ,aAAa;CAE1B,IAAI;CACJ,IAAI,SAAS;CACb,IAAI;CACJ,MAAM,YAAsB,YAAY,IAAI;CAC5C,IAAI;EACF,SAAU,GAAsC,KAAK,KAAK;CAC5D,SAAS,OAAO;EACd,SAAS;EACT,UAAU;CACZ,UAAU;EACR,GAAG,QAAQ;EACX,GAAG,WAAW;EACd,GAAG,UAAU;EACb,GAAG,kBAAkB;EACrB,KAAK,SAAS;EAEd,IAAI,KAAK,aAAa,KAAK,QAAQ,QAAQ,WAAW,MAAM,KAAK,UAAU;CAC7E;CAEA,MAAM,UAAU,KAAK,SAAA,IAAqB,WAAW,MAAM,QAAQ,QAAQ,OAAO,IAAI;CACtF,IAAI,KAAK,SAAA,GAAoB,aAAa,MAAM,QAAQ,QAAQ,OAAO;CAErE,OACE,eAAe,iBACf,MACA,WACA,YAAY,IAAI,IAAI,WACpB,SACA,UAAU,IAAI,CAChB;AAEJ;;AAGA,SAAS,WACP,MACA,QACA,QACA,SACS;CAET,IAAI,UAAU,WAAW,MAAM,OAAO,GAAG,OAAO;CAChD,MAAM,SAAS,KAAK,QAAA,QAAyB;CAC7C,KAAK,SAAS;CACd,MAAM,YAAY,KAAK,QAAA,OAA4B;CACnD,IAAI;CACJ,IAAI,UAAU,eAAe,MAAM,OAAO,GACxC,OAAO;CAET,IAAI,QAAQ;EACV,KAAK,SAAA;EACL,KAAK,QAAQ;EACb,UAAU;CACZ,OAAO;EACL,KAAK,SAAS;EACd,KAAK,QAAQ,KAAA;EACb,MAAM,SAAS,KAAK;EACpB,IAAI;GACF,UAAU,SAAS,YAAY,WAAW,SAAS,CAAC,OAAO,KAAK,OAAO,MAAM;GAC7E,IAAI,SAAS,KAAK,QAAQ;EAC5B,SAAS,iBAAiB;GAExB,KAAK,SAAA;GACL,KAAK,QAAQ;GACb,UAAU;EACZ;CACF;CACA,IAAI,CAAC,WAAW,OAAO,OAAO;CAC9B,MAAM,YAAY,KAAK;CACvB,IAAI,cAAc,MAAM,OAAO;CAC/B,KAAK,IAAI,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK,GAAG;EAC5C,MAAM,WAAW,UAAU;EAC3B,IAAI,SAAS,UAAA,GAAiB,SAAS,QAAA;CACzC;CACA,OAAO;AACT;;;;;;;;;;;AAYA,SAAS,eAAe,MAAmB,SAA2B;CACpE,IAAI,CAAC,gBAAgB,IAAI,GAAG,OAAO;CACnC,KAAK,SAAS;CACd,KAAK,QAAQ,KAAA;CACb,IAAI;EACF,YAAY,SAAS,IAAI;CAC3B,SAAS,WAAW;EAElB,KAAK,SAAA;EACL,KAAK,QAAQ;CACf;CACA,OAAO;AACT;AAEA,SAAS,aAAa,MAAmB,QAAiB,QAAiB,SAAwB;CACjG,IAAI,QAAQ;EACV,IAAI,CAAC,WAAW,MAAM,OAAO,GAAG,YAAY,SAAS,IAAI;EACzD;CACF;CACA,MAAM,QAAQ,KAAK;CACnB,IAAI;CACJ,IAAI,UAAU,MACZ,UAAU;MACL;EACL,MAAM,YAAY,KAAK,QAAA,QAAwB;EAC/C,KAAK,SAAS;EACd,MAAM,gBAAgB,KAAK;EAC3B,KAAK,QAAQ;EACb,IAAI,UAAU;EACd,MAAM,gBAAgB,GAAG;EACzB,MAAM,mBAAmB,GAAG;EAC5B,MAAM,kBAAkB,GAAG;EAC3B,GAAG,QAAQ;EACX,GAAG,WAAW;EAEd,GAAG,UAAU;EACb,IAAI;GACF,UAAW,MAAyD,QAAQ,aAAa;EAC3F,SAAS,OAAO;GACd,IAAI,CAAC,WAAW,MAAM,KAAK,GAAG,YAAY,OAAO,IAAI;GACrD;EACF,UAAU;GACR,GAAG,QAAQ;GACX,GAAG,WAAW;GACd,GAAG,UAAU;EACf;CACF;CACA,IAAI,OAAO,YAAY,YAAY;EACjC,WAAW,MAAM,OAAkB;EAEnC,KAAK,KAAK,QAAA,OAA2B,GAAG,KAAK,YAAY;CAC3D;AACF"}