stm-containers 0.2.15 → 0.2.16
raw patch · 2 files changed
+22/−19 lines, 2 filesdep +vectordep ~asyncdep ~basedep ~focusPVP ok
version bump matches the API change (PVP)
Dependencies added: vector
Dependency ranges changed: async, base, focus, hashable, text
API changes (from Hackage documentation)
Files
executables/ConcurrentInsertionBench.hs view
@@ -11,6 +11,7 @@ import qualified Focus import qualified Data.Char as Char import qualified Data.Text as Text+import qualified Data.Vector as Vector type UCMap k v = TVar (UC.HashMap k (TVar v))@@ -108,7 +109,7 @@ ------------------------- main = do- allTransactions <- MWC.runWithCreate $ replicateM actionsNum transactionGenerator+ allTransactions <- MWC.runWithSeed seed $ replicateM actionsNum transactionGenerator defaultMain $! flip map threadsNums $! \threadsNum -> let sliceSize = actionsNum `div` threadsNum@@ -128,5 +129,6 @@ ucSessionRunner threadTransactions ] where+ seed = MWC.toSeed (Vector.fromList [1,2,3,4,5,6,7]) actionsNum = 100000 threadsNums = [1, 2, 4, 6, 8, 12, 16, 32, 40, 52, 64, 80, 128]
stm-containers.cabal view
@@ -1,16 +1,16 @@ name: stm-containers version:- 0.2.15+ 0.2.16 synopsis: Containers for STM description:- This library is based on an STM-specialized implementation of a+ 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 are slightly slower than their counterparts from \"unordered-containers\",- but scale very well on concurrent access patterns.+ which are marginally slower than their counterparts from \"unordered-containers\",+ but scale well on concurrent access patterns. . For details on performance of the library see <http://nikita-volkov.github.io/stm-containers/ this blog post>.@@ -69,7 +69,7 @@ -- general: primitive >= 0.5 && < 0.7, base-prelude < 2,- base < 4.10+ base < 5 default-extensions: Arrows, BangPatterns, ConstraintKinds, DataKinds, DefaultSignatures, DeriveDataTypeable, DeriveFoldable, DeriveFunctor, DeriveGeneric, DeriveTraversable, EmptyDataDecls, FlexibleContexts, FlexibleInstances, FunctionalDependencies, GADTs, GeneralizedNewtypeDeriving, LambdaCase, LiberalTypeSynonyms, MagicHash, MultiParamTypeClasses, MultiWayIf, NoImplicitPrelude, NoMonomorphismRestriction, OverloadedStrings, PatternGuards, ParallelListComp, QuasiQuotes, RankNTypes, RecordWildCards, ScopedTypeVariables, StandaloneDeriving, TemplateHaskell, TupleSections, TypeFamilies, TypeOperators, UnboxedTuples default-language:@@ -93,10 +93,10 @@ QuickCheck >= 2.6 && < 3, HTF == 0.13.*, -- data:- hashable < 1.3,+ hashable, -- control: list-t,- focus >= 0.1.2 && < 0.2,+ focus, transformers, -- debugging: loch-th == 0.2.*,@@ -131,7 +131,7 @@ placeholders == 0.1.*, -- general: list-t,- focus >= 0.1.2 && < 0.2,+ focus, unordered-containers == 0.2.*, free >= 4.6 && < 5, mtl == 2.*,@@ -165,8 +165,8 @@ -- data: text < 1.3, list-t,- focus >= 0.1.2 && < 0.2,- hashable < 1.3,+ focus,+ hashable, hashtables >= 1.1 && < 1.3, containers == 0.5.*, unordered-containers == 0.2.*,@@ -197,18 +197,19 @@ mwc-random == 0.13.*, mwc-random-monad == 0.7.*, -- data:- text < 1.3,+ vector,+ text < 2, list-t,- focus >= 0.1.2 && < 0.2,+ focus, unordered-containers == 0.2.*,- hashable < 1.3,+ hashable, stm-containers, -- debugging: loch-th == 0.2.*, placeholders == 0.1.*, -- general: free >= 4.5 && < 5,- async >= 2.0 && < 2.2,+ async >= 2.0 && < 3, base-prelude, base @@ -232,11 +233,11 @@ mwc-random-monad == 0.7.*, -- data: containers >= 0.5.2 && < 0.6,- text < 1.3,+ text < 2, list-t,- focus >= 0.1.2 && < 0.2,+ focus, unordered-containers == 0.2.*,- hashable < 1.3,+ hashable, stm-containers, -- debugging: loch-th == 0.2.*,@@ -244,7 +245,7 @@ -- general: mtl == 2.*, free >= 4.5 && < 5,- async >= 2.0 && < 2.2,+ async >= 2.0 && < 3, mtl-prelude < 3, base-prelude, base