2019-08-28 15:19:21 +03:00
|
|
|
module Hasura.GraphQL.Execute.LiveQuery.TMap
|
|
|
|
( TMap
|
|
|
|
, new
|
|
|
|
, reset
|
|
|
|
, null
|
|
|
|
, lookup
|
|
|
|
, insert
|
|
|
|
, delete
|
|
|
|
, toList
|
|
|
|
) where
|
|
|
|
|
|
|
|
import Hasura.Prelude hiding (lookup, null, toList)
|
|
|
|
|
|
|
|
import qualified Data.HashMap.Strict as Map
|
|
|
|
|
|
|
|
import Control.Concurrent.STM
|
|
|
|
|
|
|
|
-- | A coarse-grained transactional map implemented by simply wrapping a 'Map.HashMap' in a 'TVar'.
|
|
|
|
-- Compared to "StmContainers.Map", this provides much faster iteration over the elements at the
|
|
|
|
-- cost of significantly increased contention on writes.
|
|
|
|
newtype TMap k v = TMap { unTMap :: TVar (Map.HashMap k v) }
|
|
|
|
|
|
|
|
new :: STM (TMap k v)
|
|
|
|
new = TMap <$> newTVar Map.empty
|
|
|
|
|
|
|
|
reset :: TMap k v -> STM ()
|
|
|
|
reset = flip writeTVar Map.empty . unTMap
|
|
|
|
|
|
|
|
null :: TMap k v -> STM Bool
|
|
|
|
null = fmap Map.null . readTVar . unTMap
|
|
|
|
|
|
|
|
lookup :: (Eq k, Hashable k) => k -> TMap k v -> STM (Maybe v)
|
|
|
|
lookup k = fmap (Map.lookup k) . readTVar . unTMap
|
|
|
|
|
|
|
|
insert :: (Eq k, Hashable k) => v -> k -> TMap k v -> STM ()
|
2020-03-18 04:31:22 +03:00
|
|
|
insert !v k mapTv = modifyTVar' (unTMap mapTv) $ Map.insert k v
|
2019-08-28 15:19:21 +03:00
|
|
|
|
|
|
|
delete :: (Eq k, Hashable k) => k -> TMap k v -> STM ()
|
|
|
|
delete k mapTv = modifyTVar' (unTMap mapTv) $ Map.delete k
|
|
|
|
|
|
|
|
toList :: TMap k v -> STM [(k, v)]
|
|
|
|
toList = fmap Map.toList . readTVar . unTMap
|