One problem I notice with both RXJS and even this one is that in reactive programming a lot of (filter - select) is used.
Doing (filter - select) for large views seems an inefficiency - no different than the old way where we walk the DOM trees.
Doing (filter - select) for large views seems an inefficiency - no different than the old way where we walk the DOM trees.
The point is, walk/filter the data completely prior to updating the view.
Immutable sets may also 'seem' inefficient but compare-by-reference works a of a lot faster than change propogation with compare-by-deeply-nested-values.
In CompSci terms, multiple passes are still O(n) and the data sets aren't large enough for micro-optimizations to matter. Compared to O(holy shit) of triggering many cascading DOM updates, it's a huge improvement.
'Seems' isn't a good enough metric to justify optimization.
Are you talking about changing values of DOM elements,etc.
Or are you talking about destroying elements in DOM and creating new ones ?