



Synopsis 



Documentation 


 Methods    unfoldR :: (acc > Maybe (y, acc)) > acc > (acc, s y)  Source 
  reduceL :: (x > acc > Maybe acc) > acc > s x > acc  Source 
  mapAccumL :: (x > acc > Maybe (y, acc)) > acc > s x > (acc, s y)  Source 
  (++) :: s a > s a > s a  Source 
  zipWith :: (a > b > c) > s a > s b > s c  Source 

  Instances  


generate :: C s => (acc > Maybe (y, acc)) > acc > s y  Source 


fromList :: C s => [y] > s y  Source 


iterate :: C s => (a > a) > a > s a  Source 






foldL' :: C s => (x > acc > acc) > acc > s x > acc  Source 



can be used to check against native length implementation




crochetL :: C s => (x > acc > Maybe (y, acc)) > acc > s x > s y  Source 


scanL :: C s => (x > acc > acc) > acc > s x > s acc  Source 


map :: C s => (a > b) > s a > s b  Source 


unzip :: C s => s (a, b) > (s a, s b)  Source 


delay1 :: C s => a > s a > s a  Source 

This is a fusion friendly implementation of delay.
However, in order to be a crochetL
the output has the same length as the input,
that is, the last element is removed  at least for finite input.








zipWith3 :: C s => (a > b > c > d) > s a > s b > s c > s d  Source 


zipWith4 :: C s => (a > b > c > d > e) > s a > s b > s c > s d > s e  Source 


Produced by Haddock version 2.3.0 