@@ -9,7 +9,9 @@
99
1010`typerep-map` introduces `TMap` and `TypeRepMap` — data structures like [`Map`](http://hackage.haskell.org/package/containers-0.6.0.1/docs/Data-Map-Lazy.html#t:Map), but where types serve as keys, and values have the types specified in the corresponding key spots.
1111
12−For the more details on the implementation see [this blog post](https://kowainik.github.io/posts/2018-07-11-typerep-map-step-by-step).
12+For the more details on the implementation see the following blog post:
13+
14+* [typerep-map step by step](https://kowainik.github.io/posts/2018-07-11-typerep-map-step-by-step)
1315
1416## Usage example
1517
@@ -49,10 +51,10 @@ False
4951Tables below contain comparision with `DMap TypeRep` of ten `lookup` operations
5052on structure with size `10^4`:
5153
52−| | ghc-8.2.2 | ghc-8.4.3 |
53−|----------------|-----------|-----------|
54−| `DMap TypeRep` | 517.5 ns | 779.9 ns |
55−| `typerep-map` | 205.3 ns | 187.2 ns |
54+| | ghc-8.2.2 | ghc-8.4.3 | ghc-8.8.3 | ghc-8.10.1 |
55+|----------------|-----------|-----------|-----------|------------|
56+| `DMap TypeRep` | 517.5 ns | 779.9 ns | 1.559 μs | 1.786 μs |
57+| `typerep-map` | 205.3 ns | 187.2 ns | 190.1 ns | 169.1 ns |
5658
5759 ghc-8.2.2 | ghc-8.4.3
5860:---------:|:-----------: