Safe Haskell | None |
---|---|
Language | Haskell98 |
Lava.Generic
Documentation
transStruct :: Struct [a] -> [Struct a] #
Instances
Generic () # | |
Generic Symbol # | |
Generic a => Generic [a] # | |
Generic (Signal a) # | |
(Generic a, Generic b) => Generic (a, b) # | |
(Generic a, Generic b, Generic c) => Generic (a, b, c) # | |
(Generic a, Generic b, Generic c, Generic d) => Generic (a, b, c, d) # | |
(Generic a, Generic b, Generic c, Generic d, Generic e) => Generic (a, b, c, d, e) # | |
(Generic a, Generic b, Generic c, Generic d, Generic e, Generic f) => Generic (a, b, c, d, e, f) # | |
(Generic a, Generic b, Generic c, Generic d, Generic e, Generic f, Generic g) => Generic (a, b, c, d, e, f, g) # | |
pickSymbol :: Generic a => String -> a -> Symbol #
class ConstructiveSig a where #
Instances
class Generic a => Constructive a where #
Instances
Constructive () # | |
ConstructiveSig a => Constructive (Signal a) # | |
(Constructive a, Constructive b) => Constructive (a, b) # | |
(Constructive a, Constructive b, Constructive c) => Constructive (a, b, c) # | |
(Constructive a, Constructive b, Constructive c, Constructive d) => Constructive (a, b, c, d) # | |
(Constructive a, Constructive b, Constructive c, Constructive d, Constructive e) => Constructive (a, b, c, d, e) # | |
(Constructive a, Constructive b, Constructive c, Constructive d, Constructive e, Constructive f) => Constructive (a, b, c, d, e, f) # | |
(Constructive a, Constructive b, Constructive c, Constructive d, Constructive e, Constructive f, Constructive g) => Constructive (a, b, c, d, e, f, g) # | |
zeroList :: Constructive a => Int -> [a] #
varList :: Constructive a => Int -> String -> [a] #
randomList :: Constructive a => Int -> Rnd -> [a] #
splitRndList :: Rnd -> [Rnd] #
class ConstructiveSig a => FiniteSig a where #
Minimal complete definition
class Constructive a => Finite a where #
Minimal complete definition
Instances
Finite () # | |
FiniteSig a => Finite (Signal a) # | |
(Finite a, Finite b) => Finite (a, b) # | |
(Finite a, Finite b, Finite c) => Finite (a, b, c) # | |
(Finite a, Finite b, Finite c, Finite d) => Finite (a, b, c, d) # | |
(Finite a, Finite b, Finite c, Finite d, Finite e) => Finite (a, b, c, d, e) # | |
(Finite a, Finite b, Finite c, Finite d, Finite e, Finite f) => Finite (a, b, c, d, e, f) # | |
(Finite a, Finite b, Finite c, Finite d, Finite e, Finite f, Finite g) => Finite (a, b, c, d, e, f, g) # | |
domainList :: Finite a => Int -> [[a]] #
Minimal complete definition
Methods
ifThenElse :: Signal Bool -> (a, a) -> a #
Instances
Choice () # | |
Choice Symbol # | |
Choice a => Choice [a] # | |
Choice (Signal a) # | |
Choice b => Choice (a -> b) # | |
(Choice a, Choice b) => Choice (a, b) # | |
(Choice a, Choice b, Choice c) => Choice (a, b, c) # | |
(Choice a, Choice b, Choice c, Choice d) => Choice (a, b, c, d) # | |
(Choice a, Choice b, Choice c, Choice d, Choice e) => Choice (a, b, c, d, e) # | |
(Choice a, Choice b, Choice c, Choice d, Choice e, Choice f) => Choice (a, b, c, d, e, f) # | |
(Choice a, Choice b, Choice c, Choice d, Choice e, Choice f, Choice g) => Choice (a, b, c, d, e, f, g) # | |
strongZipWith :: (a -> b -> c) -> [a] -> [b] -> [c] #
lazyZipWith :: (a -> b -> c) -> [a] -> [b] -> [c] #