Copilot.Library.Utils

Utility bounded-list functions (e.g., folds, scans, etc.)

Functions similar to the Prelude functions on lists

take :: (Integral a, Typed b) => a -> Stream b -> [Stream b]

tails :: Typed a => Stream a -> [Stream a]

cycle :: Typed a => [a] -> Stream a

Folds

nfoldl :: (Typed a, Typed b) => Int -> (Stream a -> Stream b -> Stream a) -> Stream a -> Stream b -> Stream a

nfoldl1 :: Typed a => Int -> (Stream a -> Stream a -> Stream a) -> Stream a -> Stream a

nfoldr :: (Typed a, Typed b) => Int -> (Stream a -> Stream b -> Stream b) -> Stream b -> Stream a -> Stream b

nfoldr1 :: Typed a => Int -> (Stream a -> Stream a -> Stream a) -> Stream a -> Stream a

Scans

nscanl :: (Typed a, Typed b) => Int -> (Stream a -> Stream b -> Stream a) -> Stream a -> Stream b -> [Stream a]

nscanr :: Typed a => Int -> (Stream a -> Stream b -> Stream b) -> Stream b -> Stream a -> [Stream b]

nscanl1 :: Typed a => Int -> (Stream a -> Stream a -> Stream a) -> Stream a -> [Stream a]

nscanr1 :: Typed a => Int -> (Stream a -> Stream a -> Stream a) -> Stream a -> [Stream a]

Indexing

case' :: Typed a => [Stream Bool] -> [Stream a] -> Stream a

Case-like function: The index of the first predicate that is true in the predicate list selects the stream result. If no predicate is true, the last element is chosen (default element)

(!!) :: (Typed a, Integral a) => [Stream a] -> Stream a -> Stream a

Index. WARNING: Very expensive! Consider using this only for very short lists.