Data.List.InnToOut.Basic

Various additional operations on lists

Operations to apply a function or different functions (some can create an inner list) to an element of the outer list

mapI :: (a -> Bool) -> (a -> [a]) -> [a] -> [a]

Function that applies additional function f :: a -> [a] to a if p a = True

mapI2 :: (a -> Bool) -> (a -> b) -> (a -> [b]) -> [a] -> [b]

Function that applies additional function f :: a -> b to a if p a = True and otherwise another function g :: a -> [b] to [a] to obtain [b]

mapI22 :: (a -> Bool) -> (a -> b) -> (b -> d) -> (a -> c) -> (c -> d) -> [a] -> [d]

Function that can apply two different ways of computing something depending of the predicate value p :: a -> Bool and the structure of transition the data for the [a]. It is used if there are two ways to transform data both of them consists of two applied functoins. Similar to arrow techniques.

mapI12 :: (a -> Bool) -> (a -> c) -> (a -> b) -> (b -> c) -> [a] -> [c]

Function that can apply two different ways of computing something depending of the predicate value p :: a -> Bool and the structure of transition the data for the [a]. It is used if there are two ways to transform data and the first one consists of one function and another -- from two applied consequently ones. Similar to arrow techniques.

mapI21 :: (a -> Bool) -> (a -> b) -> (b -> c) -> (a -> c) -> [a] -> [c]

Function that can apply two different ways of computing something depending of the predicate value p :: a -> Bool and the structure of transition the data for the [a]. It is used if there are two ways to transform data and the first one consists of two applied consequently functions and the second -- from one applied function. Similar to arrow techniques.