Bas wrote: > Ordering by nr of direct/indirect reverse dependencies might also be > useful.
this is already done. After indexing the cabal pages, the dependencies are all known and a package rank is derived from that graph. That is also used in the (new) function search, functions in base (and bytestring) then really get a high rank. > We could add a .csv file version of the main reverse dependency page > which you can index easily: > http://bifunctor.homelinux.net/~roel/hackage/packages/archive/revdeps-list. >html not really needed, see above. More interesting for package search is a popularity statistics. Thanks for your hint, Uwe _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
