Hacker News Reader

The key is topological sorting of a dependency graph. This can be done implicitly by storing a reactive variable node’s depth once it is created, and just making sure that updates are enqueued in separate queues per depth.

I have a somewhat small implementation that transparently batches updates with queueMicrotask in this library (bruh): https://github.com/Technical-Source/bruh/blob/a829af9df9405b...

They used to track a dependency map explicitly so they can determine when your “transaction” begins and ends so you can update all dirty at once.

Another way to deal with it is explicitly not dealing with it, eg. saying it is only (inconsistent) UI and will go away in a millisec…

If b, c, and d were lazily evaluated (pull-based) you would also avoid this issue,