Well, I was toying around with building Musl with Tup, and it created a graph of over 2,200 vertexes in under 2 seconds.
Ryan (ライアン) Yoko Shimomura > ryo (supercell/EGOIST) > Hiroyuki Sawano >> everyone else <http://kirbyfan64.github.io/> On Dec 14 2016, at 2:53 pm, Andrew Hume <[email protected]> wrote: > i've been working my way through mike's paper on building rules etc. > > one of the things he stresses is the speed of reading in and handling > > the dependency graph. i have never seen this be an issue, but perhaps > > i live in a sheltered environment. > > > > how big is the biggest project (subject of a single tup) you have or have seen? > > the answer should be in the number of vertices in the dependency graph. > > (unless there is a better metric.) > > > > thanks in advance for your replies, > > andrew > > > > \-- \-- tup-users mailing list email: [email protected] unsubscribe: [email protected] options: <http://groups.google.com/group/tup-users?hl=en> \--- You received this message because you are subscribed to the Google Groups "tup-users" group. To unsubscribe from this group and stop receiving emails from it, send an email to [[email protected]](mailto:tup- [email protected]). For more options, visit <https://groups.google.com/d/optout>. -- -- tup-users mailing list email: [email protected] unsubscribe: [email protected] options: http://groups.google.com/group/tup-users?hl=en --- You received this message because you are subscribed to the Google Groups "tup-users" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. For more options, visit https://groups.google.com/d/optout.
