CurryInfo: base-3.4.0 / Data.List.scanr
definition: 
|
scanr :: (a -> b -> b) -> b -> [a] -> [b]
scanr _ q0 [] = [q0]
scanr f q0 (x:xs) = f x q : qs
where qs@(q:_) = scanr f q0 xs
|
|
demand:
|
argument 3 |
|
deterministic:
|
deterministic operation |
|
documentation:
|
`scanr` is the right-to-left dual of `scanl`. |
|
failfree:
|
(_, _, _) |
|
indeterministic:
|
referentially transparent operation |
|
infix:
|
no fixity defined |
|
iotype:
|
{(_,_,{[]}) |-> {:} || (_,_,{:}) |-> {:}}
|
|
name:
|
scanr |
|
precedence:
|
no precedence defined |
|
result-values:
|
{:}
|
|
signature:
|
(a -> b -> b) -> b -> [a] -> [b] |
|
solution-complete:
|
operation might suspend on free variables |
|
terminating:
|
yes |
|
totally-defined:
|
possibly non-reducible on same data term |