module Control.Concurrent.STM.TMapChan ( TMapChan (..) , newTMapChan , insert, insertMany, insertFirst , lookup, tryLookup, lookupAll , observe, tryObserve, observeAll , delete, deleteAll , -- * Utils getTChan , broadcast , cloneAt, cloneAll, cloneAllUniquely ) where import Prelude hiding (lookup) import Data.Map.Lazy (Map) import qualified Data.Map.Lazy as Map import qualified Data.Set as Set import Control.Monad (void, forM_) import Control.Concurrent.STM (STM) import Control.Concurrent.STM.TChan (TChan, newTChan, writeTChan, readTChan, tryReadTChan, peekTChan, tryPeekTChan, unGetTChan, cloneTChan) import Control.Concurrent.STM.TVar (TVar, newTVar, readTVar, writeTVar, modifyTVar) newtype TMapChan k a = TMapChan {runTMapChan :: TVar (Map k (TChan a))} newTMapChan :: STM (TMapChan k a) newTMapChan = TMapChan <$> newTVar Map.empty insert :: Ord k => TMapChan k a -> k -> a -> STM () insert t k a = do c <- getTChan t k writeTChan c a insertMany :: Ord k => TMapChan k a -> k -> [a] -> STM () insertMany t k as = forM_ as (insert t k) -- | Inserts the element to the head of the stack, to be viewed next insertFirst :: Ord k => TMapChan k a -> k -> a -> STM () insertFirst t k a = do c <- getTChan t k unGetTChan c a -- | Blocks until there's a value available to remove from the mutlimap lookup :: Ord k => TMapChan k a -> k -> STM a lookup t k = do c <- getTChan t k readTChan c tryLookup :: Ord k => TMapChan k a -> k -> STM (Maybe a) tryLookup t k = do c <- getTChan t k tryReadTChan c lookupAll :: Ord k => TMapChan k a -> k -> STM [a] lookupAll t k = do mNext <- tryLookup t k case mNext of Nothing -> pure [] Just next -> (next:) <$> lookupAll t k -- | Blocks until there's a vale available to view, without removing it observe :: Ord k => TMapChan k a -> k -> STM a observe t k = do c <- getTChan t k peekTChan c tryObserve :: Ord k => TMapChan k a -> k -> STM (Maybe a) tryObserve t k = do c <- getTChan t k tryPeekTChan c observeAll :: Ord k => TMapChan k a -> k -> STM [a] observeAll t k = do mNext <- tryObserve t k case mNext of Nothing -> pure [] Just next -> ((:) next) <$> observeAll t k -- | Deletes the /next/ element in the map, if it exists. Doesn't block. delete :: Ord k => TMapChan k a -> k -> STM () delete t k = void (tryLookup t k) -- | Clears the queue at the key deleteAll :: Ord k => TMapChan k a -> k -> STM () deleteAll t k = void (lookupAll t k) -- * Utils -- | Insert for every key broadcast :: Ord k => TMapChan k a -> a -> STM () broadcast t@(TMapChan xs) a = do ks <- Map.keys <$> readTVar xs forM_ ks (\k -> insert t k a) -- | Creates a new one if it doesn't already exist getTChan :: Ord k => TMapChan k a -> k -> STM (TChan a) getTChan (TMapChan t) k = do xs <- readTVar t case Map.lookup k xs of Nothing -> do c' <- newTChan writeTVar t (Map.insert k c' xs) pure c' Just c' -> pure c' cloneAt :: Ord k => TMapChan k a -> k -- ^ key to clone /from/ -> k -- ^ key to clone /to/ -> STM () cloneAt t@(TMapChan xs) kFrom kTo = do as <- observeAll t kFrom c <- newTChan forM_ as (writeTChan c) modifyTVar xs (Map.insert kTo c) -- | Clones all the content for every key, by the key. cloneAll :: Ord k => TMapChan k a -> k -> STM () cloneAll t@(TMapChan xs) k = do as <- readTVar xs c <- newTChan forM_ (Map.keysSet as) $ \k' -> do as' <- observeAll t k' forM_ as' (writeTChan c) modifyTVar xs (Map.insert k c) -- | Clones all the content from every channel, and inserts the unique subset of them to `k`, in the order of their Ord instance cloneAllUniquely :: ( Ord k , Ord a ) => TMapChan k a -> k -> STM () cloneAllUniquely t@(TMapChan xs) k = do as <- readTVar xs c <- newTChan as' <- newTVar Set.empty forM_ (Map.keysSet as) $ \k' -> do as'More <- Set.fromList <$> observeAll t k' modifyTVar as' (Set.union as'More) as'All <- Set.toAscList <$> readTVar as' forM_ as'All (writeTChan c) modifyTVar xs (Map.insert k c)