Hi Niklas - sounds like a nice usecase.

Though we need to make sure no usages are missing to make that decision (there are some edge cases yet, for example around TH splice application, or type families). Also it's only valid on the set of indexed packages.

I'll merge later, but https://github.com/robinp/haskell-indexer/commit/0592c3d934515c4661c69c5b998e26a543b93b52 has the changes necessary. Note:
- It didn't index ~50 packages
- For some it complained that C libs are missing (like SDL, though I was using the full stack-build Docker image)

- I had to kill a few huge compilations that ate my RAM (Agda, language-python, and some yi packages)

I would estimate 8-12 hours, but didn't follow closely (also it was idling quite some due to the huge compilations).

By the way the per-package entries are available for download in a tarball, so if you just index your local packages and dump the entries along with those of your dependencies into the graphstore, you can get a ~full local index without reexecuting the whole indexing. In the future it would be nice to have tooling that magically fetches the pre-generated entries you need, and merges them locally.

2017-08-31 13:23 GMT+02:00 Niklas Hambüchen <mail@nh2.me>:

Hey Robin,

This is really awesome and useful.

I think it will help a lot to decide whether or not we can
change/deprecate a certain function, as now we can really easily judge
how many callers it has.

How long does that take to generate?
And how did you run it to do it for all of Stackage?

Thanks!

On 31/08/17 06:41, Robin Palotai wrote:
> To find out who else uses your favorite functions and
> how: http://stuff.codereview.me/lts/9.2 .