Sorts and prints Haskell packages by number of reverse dependencies

reverse-deps-sorted.hs

import Data.List (sort)
import qualified Data.Map as Map
import Distribution.PackDeps
import Control.Monad

main :: IO ()
main = do
  newest <- loadNewest

  let reverses = getReverses newest
      packagesOrderedByNumberOfDeps = reverse $ sort [ (length deps, name) |  (name, (_,deps)) <- Map.toList reverses ]

  forM_ (take 300 $ packagesOrderedByNumberOfDeps) $ \(ndeps, name) ->
    putStrLn $ show ndeps ++ " " ++ name