atlassubbed

13 ms·

1.
by atlassubbed 3y ago
Ah interesting, a trip down memory lane! I made something very similar 5 years ago: https://github.com/atlassubbed/atlas-relax . It was an attempt to build a "stronger" version of React (using DAGs) in under 2
2.
by atlassubbed 6y ago
Topological sorting has many applications. I built this a couple years ago https://github.com/atlassubbed/atlas-relax . It's a DAG-computing framework in JS that allows you to listen to updates in a compute graph.
3.
by atlassubbed 7y ago
Error-boundaries in VDOM frameworks. If you have an asynchronous diff cycle, you might get multiple errors from more than one node in a single diff cycle. One option is to bubble up errors to the nearest LCA that is an error-boundary. In ge
4.
by atlassubbed 7y ago
I found this pretty easy to do with ngraph.forcelayout[0]. I used it to build a basic VDOM-diff visualizing demo[1], which involved dynamically animating edge changes to a graph. If you need something like that, it's pretty easy with n
5.
by atlassubbed 7y ago
This is a funny coincidence. I stumbled upon this library just yesterday from the Big-O cheatsheet[0] site, but didn't think to post it here. Has anyone here done a detailed comparison between ElGrapho and ngraph.pixel[1] or vivagraph[
6.
by atlassubbed 7y ago
I've always liked Dan Abramov's posts. He is very real, if that makes sense. This one really helps me mentally. Showing new work the world is hard, and people will always have something negative to say. There's also the issue
7.
by atlassubbed 8y ago
I don't think any of my concerns were addressed. If I index a <p@key1/> and its position changes in the child list, will the diff move the node (e.g. insertBefore) as opposed to unmounting/remounting it? Also, have you
8.
by atlassubbed 8y ago
Imba claims to use an "imperative, memoized DOM" as opposed to a VDOM. Apparently it looks like they still use a VDOM (i.e. a wrapper around the DOM). The difference is that, at compile time, they attempt to unmix the dynamic part