Sound.SC3.Lang.Pattern

Synopsis

# Documentation

data P a Source

Instances

 Monad P Functor P Applicative P Eq a => Eq (P a) Fractional a => Fractional (P a) Num a => Num (P a) Show a => Show (P a) Monoid (P a)

pfoldr :: Seed -> (a -> b -> b) -> b -> P a -> bSource

evalP :: Int -> P a -> [a]Source

pfix :: Seed -> P a -> P aSource

pcontinue :: P x -> (x -> P x -> P a) -> P aSource

pmap :: (a -> b) -> P a -> P bSource

punfoldr :: (x -> Maybe (a, x)) -> x -> P aSource

preturn :: a -> P aSource

pbind :: P x -> (x -> P a) -> P aSource

pappend :: P a -> P a -> P aSource

ppure :: a -> P aSource

papply :: P (a -> b) -> P a -> P bSource

prp :: (StdGen -> (P a, StdGen)) -> P aSource

pscan :: (x -> y -> (x, a)) -> Maybe (x -> a) -> x -> P y -> P aSource

pzipWith :: (a -> b -> c) -> P a -> P b -> P cSource

Apply f pointwise to elements of p and q.

pcycle :: P a -> P aSource

prepeat :: a -> P aSource

pfilter :: (a -> Bool) -> P a -> P aSource

plist :: [P a] -> P aSource

pcons :: a -> P a -> P aSource

preplicate_ :: Int -> P a -> P aSource

preplicate :: P Int -> P a -> P aSource

pn :: P a -> P Int -> P aSource

pn_ :: P a -> Int -> P aSource

ptake_ :: Int -> P a -> P aSource

n initial values at p.

ptake :: P Int -> P a -> P aSource

prestrict_ :: Int -> P a -> P aSource

n initial values at pcycle of p.

prestrict :: P Int -> P a -> P aSource

pmapMaybe :: (a -> Maybe b) -> P a -> P bSource

preject :: (a -> Bool) -> P a -> P aSource

pzipWith3 :: (a -> b -> c -> d) -> P a -> P b -> P c -> P dSource

pzip :: P a -> P b -> P (a, b)Source

pseries :: Num a => a -> a -> Int -> P aSource

pgeom :: Num a => a -> a -> Int -> P aSource

pstutter' :: P Int -> P a -> P aSource

pstutter :: P Int -> P a -> P aSource

Count false values preceding each true value.

Count false values following each true value.

pclutch' :: P a -> P Bool -> P aSource

pbool :: (Ord a, Num a) => P a -> P BoolSource

pclutch :: (Num b, Ord b) => P a -> P b -> P aSource

pcollect :: (a -> b) -> P a -> P bSource

pdegreeToKey :: RealFrac a => P a -> P [a] -> P a -> P aSource

pfin :: P Int -> P a -> P aSource

pfin_ :: Int -> P a -> P aSource

wrap :: (Ord a, Num a) => a -> a -> a -> aSource

pwrap :: (Ord a, Num a) => P a -> P a -> P a -> P aSource

prsd :: Eq a => P a -> P aSource

Remove successive duplicates.

psequence :: P (P a) -> P aSource

pduple :: (a, a) -> P aSource

pinterleave :: P a -> P a -> P aSource

ptrigger :: P Bool -> P a -> P (Maybe a)Source

pif :: Int -> P Bool -> P a -> P a -> P aSource

pif' :: P Bool -> P a -> P a -> P aSource

phead :: P a -> P aSource

ptail :: P a -> P aSource

pdrop :: P Int -> P a -> P aSource

pscanl :: (a -> y -> a) -> a -> P y -> P aSource

pzipWith_c :: (a -> b -> c) -> P a -> P b -> P cSource

(+.) :: Num a => P a -> P a -> P aSource

(*.) :: Num a => P a -> P a -> P aSource

(/.) :: Fractional a => P a -> P a -> P aSource

(-.) :: Num a => P a -> P a -> P aSource

pseq_ :: [P a] -> Int -> P aSource

pseq :: [P a] -> P Int -> P aSource

pser_ :: [P a] -> Int -> P aSource

n values from the infinite cycle of the streams at l.

pser :: [P a] -> P Int -> P aSource

pswitch :: [P a] -> P Int -> P aSource

pswitch1m :: IntMap (P a) -> P Int -> P aSource

pswitch1 :: [P a] -> P Int -> P aSource

ppatlace :: [P a] -> P Int -> P aSource

prrandf :: Random a => (a -> a -> a -> a) -> a -> a -> P aSource

prrand :: Random a => a -> a -> P aSource

prrandexp :: (Floating a, Random a) => a -> a -> P aSource

pchoosea :: Array Int (P a) -> P aSource

pchoose :: [P a] -> P aSource

prand :: [P a] -> P Int -> P aSource

pwhite :: Random a => P a -> P a -> P Int -> P aSource

pexprand :: (Floating a, Random a) => P a -> P a -> P Int -> P aSource

pxrand :: Eq a => [P a] -> P Int -> P aSource

pwrand :: [P a] -> [P a] -> P Int -> P aSource