To elaborate, this "worst-case" was found by compiling a graph of ~400 trivial computations with ~3600 random dependencies between them.
The were some fears about Impromptu's compile times, given its use of dep't types. No! The cost of an async graph of *3600* edges: about 8s!pic.twitter.com/f2JaoAYCb7
-
-
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
Green chart: each node has four random dependencies from nodes coming before it. Blue chart: each node depends on half the nodes before it.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
Looks like the compile time is roughly linear in the number of nodes (code size?), given the "better-than-linear" results in the blue chart.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.