diff options
| author | Simon Jakobi <simon.jakobi@gmail.com> | 2022-04-02 04:10:18 +0200 |
|---|---|---|
| committer | Simon Jakobi <simon.jakobi@gmail.com> | 2022-04-22 14:09:00 +0200 |
| commit | 0216512be66daca0a44dc65a86b45e029b39d163 (patch) | |
| tree | 4e3f9685b73b319f358d3f6c7eb2254de0b3c7cf /README.md | |
| parent | 78ec692d9c8d6d138f68e179a7ca57784daa2342 (diff) | |
| download | haskell-wip/sjakobi/less-intmap-size.tar.gz | |
Remove two uses of IntMap.sizewip/sjakobi/less-intmap-size
IntMap.size is O(n). The new code should be slightly more efficient.
The transformation of GHC.CmmToAsm.CFG.calcFreqs.nodeCount can be
described formally as the transformation:
(\sum_{0}^{n-1} \sum_{0}^{k-1} i_nk) + n
==>
(\sum_{0}^{n-1} 1 + \sum_{0}^{k-1} i_nk)
Diffstat (limited to 'README.md')
0 files changed, 0 insertions, 0 deletions