NOTICE: This package has been removed from pkgsrc

./wip/hs-hashmap, Persistent containers Map and Set based on hashing

[ CVSweb ] [ Homepage ] [ RSS ] [ Required by ]

Branch: CURRENT, Version: 1.2.0.1, Package name: hs-hashmap-1.2.0.1, Maintainer: pho

An implementation of persistent Map and Set containers based on
hashing. The implementation is build on top of Data.IntMap.IntMap and
Data.IntSet.IntSet, with very similar API. It uses Hashable class from
the hashable package for hashing.

This package can be used as a drop-in replacement for Data.Map and
Data.Set modules.

The Map key value is an Data.IntMap.IntMap indexed by the hash value,
containing either one (key, value) or a Data.Map.Map key value for all
keys with the same hash value.

The Set elem is an Data.IntMap.IntMap indexed by the hash value,
containing either one elem or Data.Set.Set elem for all elements with
the same hash value.


Required to run:
[wip/ghc] [devel/hs-hashable]

Required to build:
[pkgtools/cwrappers]

Master sites:

SHA1: 76c6e976f86ed8f2e6a8c49129f77dff4e43628b
RMD160: ae826ac9272964f7214387d7df58ab9fd0cf4711
Filesize: 10.132 KB

Version history: (Expand)

CVS history: (Expand)


   2014-08-29 16:10:14 by Ryosuke Moro | Files touched by this commit (101) 
Log message:
make it clear what package depend on

discussed with wiz@.
   2014-05-25 23:59:28 by Ryosuke Moro | Files touched by this commit (58) 
Log message:
Remove hs-hashable, hs-primitive, hs-stm, imported to pkgsrc/devel.
   2011-11-14 10:27:46 by PHO / phonohawk | Files touched by this commit (5) | Imported package
Log message:
Import hs-hashmap-1.2.0.1 as wip/hs-hashmap.

An implementation of persistent Map and Set containers based on
hashing. The implementation is build on top of Data.IntMap.IntMap and
Data.IntSet.IntSet, with very similar API. It uses Hashable class from
the hashable package for hashing.

This package can be used as a drop-in replacement for Data.Map and
Data.Set modules.

The Map key value is an Data.IntMap.IntMap indexed by the hash value,
containing either one (key, value) or a Data.Map.Map key value for all
keys with the same hash value.

The Set elem is an Data.IntMap.IntMap indexed by the hash value,
containing either one elem or Data.Set.Set elem for all elements with
the same hash value.