Safe Haskell | Safe |
---|---|
Language | Haskell2010 |
- data SFlow a c
- sMap :: (a -> c) -> SFlow a c
- sFold :: c -> (a -> c -> c) -> SFlow a c
- sCompose :: SFlow b c -> SFlow a b -> SFlow a c
- sMapMaybe :: state -> (update -> Maybe state) -> SFlow update state
- sJoin :: SFlow a b -> SFlow a c -> SFlow a (b, c)
- sFilter :: (b -> Bool) -> SFlow b (Maybe b)
- sFilterWDefault :: (b -> Bool) -> b -> SFlow b b
- mkNodeRef :: SFlow i o -> IO (SFlow i o)
- hotSwap :: SFlow a c -> SFlow a c -> IO ()
- hotSwapSTM :: SFlow a c -> SFlow a c -> STM ()
- fireGraph :: TVar (SFlow a c) -> a -> STM c
- fireGraphIO :: TVar (SFlow a c) -> a -> IO c
Documentation
Signal flow
Takes a value of type a
and returns one of type c
sFilterWDefault :: (b -> Bool) -> b -> SFlow b b Source
hotSwapSTM :: SFlow a c -> SFlow a c -> STM () Source
fireGraph :: TVar (SFlow a c) -> a -> STM c Source
Given a node in the graph, and an input to that node, return the output of that node and the "new node" with updated state
fireGraphIO :: TVar (SFlow a c) -> a -> IO c Source