summaryrefslogtreecommitdiff
path: root/lore/Control/Concurrent
diff options
context:
space:
mode:
Diffstat (limited to 'lore/Control/Concurrent')
-rw-r--r--lore/Control/Concurrent/Go.hs100
-rw-r--r--lore/Control/Concurrent/Sima.hs12
2 files changed, 0 insertions, 112 deletions
diff --git a/lore/Control/Concurrent/Go.hs b/lore/Control/Concurrent/Go.hs
deleted file mode 100644
index 711611f..0000000
--- a/lore/Control/Concurrent/Go.hs
+++ /dev/null
@@ -1,100 +0,0 @@
--- based on
--- https://stackoverflow.com/questions/4522387/how-can-i-emulate-gos-channels-with-haskell
--- but this version encodes end-of-stream on the communication channel, as a Nothing
-
-module Control.Concurrent.Go
- ( chan
- , readCh
- , (-<-)
- , writeCh
- , (->-)
- , go
- )
-where
-
-import Control.Concurrent ( forkIO
- , ThreadId
- , threadDelay
- )
-import Control.Concurrent.STM.TChan ( newTChan
- , readTChan
- , writeTChan
- , isEmptyTChan
- , TChan
- )
-import Control.Monad ( forM_ )
-import GHC.Conc ( atomically )
-
--- | Make a new channel.
-chan :: _
-chan = atomically . newTChan
-
--- | Take from a channel.
-readCh :: TChan a -> IO a
-readCh = atomically . readTChan
-
--- | Alias for 'readCh'.
---
--- >>> c <- chan
--- >>> writeCh c "val"
--- >>> -<- c
--- "val"
---
--- I don't think this looks terrible with do-notation:
---
--- >>> c <- chan
--- >>> writeCh c "val"
--- >>> result <- -<- c
--- >>> print result
--- "val"
-(-<-) :: TChan a -> IO a
-(-<-) = readCh
-
--- | Write to a channel.
-writeCh :: TChan a -> a -> IO ()
-writeCh ch v = atomically $ writeTChan ch v
-
--- | Alias for 'writeCh', but flipped to make it read better.
---
--- >>> c <- chan
--- >>> "val" ->- c
--- >>> readCh c
--- "val"
-(->-) :: TChan a -> a -> IO ()
-(->-) = flip writeCh
-
--- | Starts a background process.
-go :: IO () -> IO ThreadId
-go = forkIO
-
-
-{- Example: (TODO: move to module-level docs)
-
--- can I just implement forM/Traversable over the channel?
-forRange :: TChan (Maybe a) -> (a -> IO b) -> IO [b]
-forRange ch fn = helper fn [] where
- -- helper :: (a -> IO b) -> [b] -> IO [b]
- helper fn acc = do
- jv <- readCh ch
- case jv of
- Nothing -> return $ reverse acc
- Just v -> do
- b <- fn v
- helper fn (b : acc)
-
-feedData :: (Num a, Enum a) => TChan (Maybe a) -> IO ()
-feedData ch = do
- forM_ [1 .. 9999] (\x -> writeCh ch (Just x))
- writeQ ch Nothing -- EOF value
-
-printData :: TChan (Maybe Int) -> IO ()
-printData c = do
- forRange c (print :: Int -> IO ())
- return ()
-
-main :: IO ()
-main = do
- ch <- chan
- go $ feedData ch
- printData ch
--}
diff --git a/lore/Control/Concurrent/Sima.hs b/lore/Control/Concurrent/Sima.hs
deleted file mode 100644
index b69c0bb..0000000
--- a/lore/Control/Concurrent/Sima.hs
+++ /dev/null
@@ -1,12 +0,0 @@
-module Control.Concurrent.Sima
- ( mapPool
- )
-where
-
-import qualified Control.Concurrent.MSem as Sem
-
--- | Simaphore-based throttled 'mapConcurrently'.
-mapPool :: Traversable t => Int -> (a -> IO b) -> t a -> IO (t b)
-mapPool n f xs = do
- sima <- Sem.new n
- mapConcurrently (Sem.with sima . f) xs