./devel/hs-stm-containers, Containers for STM

[ CVSweb ] [ Homepage ] [ RSS ] [ Required by ] [ Add to tracker ]

Branch: CURRENT, Version: 1.2.0.3nb2, Package name: hs-stm-containers-1.2.0.3nb2, Maintainer: pkgsrc-users

This library is based on an STM-specialized implementation of Hash Array
Mapped Trie. It provides efficient implementations of Map, Set and other
data structures, which starting from version 1 perform even better than
their counterparts from "unordered-containers", but also scale well on
concurrent access patterns.

Master sites:

Filesize: 8.211 KB

Version history: (Expand)

CVS history: (Expand)


   2024-05-09 03:32:57 by Masatake Daimon | Files touched by this commit (1137) 
Log message:
Recursive revbump after changing the default Haskell compiler
   2024-05-04 08:16:17 by Masatake Daimon | Files touched by this commit (1) 
Log message:
devel/hs-stm-containers: Fix build with GHC 9.8

This breaks build with the currently default GHC 9.6. Please bear with me
until I switch the default compiler.
   2023-11-02 07:37:49 by Masatake Daimon | Files touched by this commit (1141) 
Log message:
Revbump all Haskell after updating lang/ghc96
   2023-10-31 03:55:55 by Masatake Daimon | Files touched by this commit (4) 
Log message:
devel/hs-stm-containers: Update to 1.2.0.3

No change log is provided by the upstream.
   2023-10-09 06:55:01 by Masatake Daimon | Files touched by this commit (988) 
Log message:
Bump Haskell packages after updating lang/ghc94
   2022-08-20 10:08:24 by Thomas Klausner | Files touched by this commit (211) 
Log message:
hs*: recursive bump for new dependencies needed

for hs-aeson, hs-vector
   2022-02-26 04:58:36 by Masatake Daimon | Files touched by this commit (872) 
Log message:
Bump all Haskell packages after enabling "split sections" in mk/haskell.mk
   2022-02-16 10:55:37 by Masatake Daimon | Files touched by this commit (5) 
Log message:
devel/hs-stm-containers: import hs-stm-containers-1.2

This library is based on an STM-specialized implementation of Hash Array
Mapped Trie. It provides efficient implementations of Map, Set and other
data structures, which starting from version 1 perform even better than
their counterparts from "unordered-containers", but also scale well on
concurrent access patterns.