Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/kowainik/typerep-map
⚡️Efficient implementation of Map with types as keys
https://github.com/kowainik/typerep-map
arrays binary-search cache dependent-map dmap hacktoberfest haskell typerep-map
Last synced: 23 days ago
JSON representation
⚡️Efficient implementation of Map with types as keys
- Host: GitHub
- URL: https://github.com/kowainik/typerep-map
- Owner: kowainik
- License: mpl-2.0
- Created: 2017-12-15T23:16:22.000Z (over 6 years ago)
- Default Branch: main
- Last Pushed: 2024-01-18T06:59:21.000Z (6 months ago)
- Last Synced: 2024-06-17T02:21:19.399Z (25 days ago)
- Topics: arrays, binary-search, cache, dependent-map, dmap, hacktoberfest, haskell, typerep-map
- Language: Haskell
- Homepage: https://kowainik.github.io/projects/typerep-map
- Size: 188 KB
- Stars: 97
- Watchers: 7
- Forks: 17
- Open Issues: 15
-
Metadata Files:
- Readme: README.md
- Changelog: CHANGELOG.md
- License: LICENSE
- Codeowners: .github/CODEOWNERS
Lists
- awesome-stars - kowainik/typerep-map - ⚡️Efficient implementation of Map with types as keys (Haskell)
README
# typerep-map
[](https://github.com/kowainik/typerep-map/actions)
[](https://hackage.haskell.org/package/typerep-map)
[](LICENSE)
`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.
For the more details on the implementation see the following blog post:
* [typerep-map step by step](https://kowainik.github.io/posts/2018-07-11-typerep-map-step-by-step)
## Usage example
```haskell
ghci> import Data.TMap
ghci> tm = insert True $ one (42 :: Int)
ghci> size tm
2
ghci> res = lookup tm
ghci> res :: Maybe Int
Just 42
ghci> res :: Maybe Bool
Just True
ghci> res :: Maybe String
Nothing
ghci> lookup (insert "hello" tm) :: Maybe String
Just "hello"
ghci> member @Int tm
True
ghci> tm' = delete @Int tm
ghci> member @Int tm'
False
```
## Benchmarks
Tables below contain comparision with `DMap TypeRep` of ten `lookup` operations
on structure with size `10^4`:
| | ghc-8.2.2 | ghc-8.4.3 | ghc-8.8.3 | ghc-8.10.1 |
|----------------|-----------|-----------|-----------|------------|
| `DMap TypeRep` | 517.5 ns | 779.9 ns | 1.559 μs | 1.786 μs |
| `typerep-map` | 205.3 ns | 187.2 ns | 190.1 ns | 169.1 ns |
ghc-8.2.2 | ghc-8.4.3
:---------:|:-----------:
 | 
 | 