typerep-map: Efficient implementation of a dependent map with types as keys

[ data, data-structures, library, mpl, types ] [ Propose Tags ]

This version is deprecated.

A dependent map from type representations to values of these types.

Here is an illustration of such a map:

    TMap
---------------
 Int  -> 5
 Bool -> True
 Char -> 'x'

In addition to TMap, we provide TypeRepMap parametrized by a vinyl-style interpretation. This data structure is equivalent to DMap TypeRep, but with significantly more efficient lookups.

[Skip to Readme]

Modules

[Index]

Data
- Data.TMap
- Data.TypeRepMap
  - Data.TypeRepMap.Internal

Downloads

typerep-map-0.1.0.tar.gz [browse] (Cabal source package)
Package description (as included in the package)

Maintainer's Corner

Package maintainers

vrom911

For package maintainers and hackage trustees

edit package information

Candidates

0.1.0, 0.2.0, 0.3.0, 0.3.1, 0.3.2, 0.3.3.0

Versions [RSS]	0.1.0, 0.2.0, 0.3.0, 0.3.1, 0.3.2, 0.3.3.0, 0.4.0.0, 0.5.0.0, 0.6.0.0 (info)
Change log	CHANGELOG.md
Dependencies	base (>=4.9 && <5), containers, ghc-prim, primitive (>=0.6.4), vector [details]
License	MIT
Copyright	2017-2018 Kowainik
Author	Kowainik, Vladislav Zavialov
Maintainer	xrom.xkov@gmail.com
Category	Data, Data Structures, Types
Home page	https://github.com/kowainik/typerep-map
Bug tracker	https://github.com/kowainik/typerep-map/issues
Source repo	head: git clone https://github.com/kowainik/typerep-map.git
Uploaded	by vrom911 at 2018-07-11T03:57:21Z
Distributions	NixOS:0.6.0.0
Reverse Dependencies	5 direct, 16 indirect [details]
Downloads	19472 total (76 in the last 30 days)
Rating	2.5 (votes: 3) [estimated by Bayesian average]
Your Rating	λ λ λ
Status	Docs available [build log] Last success reported on 2018-07-11 [all 1 reports]

Readme for typerep-map-0.1.0

[back to package description]

typerep-map

typerep-map introduces TMap and TypeRepMap — data structures like Map, but where types serve as keys, and values have the types specified in the corresponding key spots.

Usage example

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
`DMap TypeRep`	517.5 ns	779.9 ns
`typerep-map`	205.3 ns	187.2 ns

ghc-8.2.2	ghc-8.4.3