> it would be quite helpful if `pretty`
> gained a special-case for the infinite band-width case
Absolutely +1 this.
Not "pretty" but similar:
https://github.com/jwaldmann/wl-pprint-text/commit/7843d96db57ab01c0be336a5be0d7bca61902005
- J.W.
___
Dear Simon,
thanks for looking into this.
> is StableName in the inner loop?
Yes. This application's inner loop uses a
HashMap (StableName Expression) Int for memoization.
This is the Tseitin transform: for each node, build a literal.
Each node is stable-named.
I guess the RTS's hashmap
Dear ghc devs,
would the StablePtr performance issue (slow hash table)
https://ghc.haskell.org/trac/ghc/ticket/13165
also affect StableNames?
Cf. https://github.com/ekmett/ersatz/issues/30
Could making 10^5 stable names, and accessing each just once,
take noticeable time? Where would this show
Hi Ben, thanks,
> 4. run the build, `cabal configure --ghc-options="-p -hc" $args && cabal
> build`
cabal configure $args --ghc-options="+RTS -p -hc -RTS"
> You should end up with a .prof and .hp file.
Yes, that works. - Typical output starts like this
COST CENTRE MODULE %time
Hi,
> ... to compile it with a profiled GHC and look at the report?
How hard is it to build hackage or stackage
with a profiled ghc? (Does it require ghc magic, or can I do it?)
> ... some obvious sub-optimal algorithms in GHC.
obvious to whom? you mean sub-optimality is already known,
or that
> .. :type should report the real type
What about defaulting? Is it real?
https://ghc.haskell.org/trac/ghc/ticket/11994
- J.W.
___
ghc-devs mailing list
ghc-devs@haskell.org
http://mail.haskell.org/cgi-bin/mailman/listinfo/ghc-devs
... a proposal for removing transformers dependency from ghc library.
+1
- J.W.
(I subscribed to this list just to send this one message ...)
___
ghc-devs mailing list
ghc-devs@haskell.org
http://www.haskell.org/mailman/listinfo/ghc-devs
