Safe Haskell | Safe |
---|---|

Language | Haskell98 |

Unique identifier class for use by non-deterministic (noise) and non-sharable (demand) unit generators.

- class (Functor m, Applicative m, Monad m) => UId m where
- type UId_ST = State Int
- uid_st_eval :: UId_ST t -> t
- uid_st_seq :: [UId_ST t] -> ([t], Int)
- uid_st_seq_ :: [UId_ST t] -> [t]
- type Fn1 a b = a -> b
- type Fn2 a b c = a -> b -> c
- type Fn3 a b c d = a -> b -> c -> d
- type Fn4 a b c d e = a -> b -> c -> d -> e
- liftUId :: UId m => (Int -> Fn1 a b) -> Fn1 a (m b)
- liftUId2 :: UId m => (Int -> Fn2 a b c) -> Fn2 a b (m c)
- liftUId3 :: UId m => (Int -> Fn3 a b c d) -> Fn3 a b c (m d)
- liftUId4 :: UId m => (Int -> Fn4 a b c d e) -> Fn4 a b c d (m e)
- clone :: UId m => Int -> m UGen -> m UGen

# Documentation

class (Functor m, Applicative m, Monad m) => UId m where Source #

A class indicating a monad (and functor and applicative) that will generate a sequence of unique integer identifiers.

generateUId :: m Int Source #

uid_st_eval :: UId_ST t -> t Source #

`evalState`

with initial state of zero.

uid_st_eval (replicateM 3 generateUId) == [0,1,2]

uid_st_seq_ :: [UId_ST t] -> [t] Source #

`fst`

of `uid_st_seq`

.

uid_st_seq_ (replicate 3 generateUId) == [0,1,2]