|
definition:
|
sumMax :: Ord b => (a -> Int) -> b -> (a -> b) -> [a] -> (Int, b)
sumMax f defaultMax g as = foldr go (,) as 0 defaultMax
where
go a r n b = (r $! f a + n) $! g a `max` b
|
|
demand:
|
argument 5
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
--- Calculate sum and maximum of a list.
|
|
failfree:
|
(_, _, _, _, _)
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_,_,_,_,_) |-> _}
|
|
name:
|
sumMax
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
_
|
|
signature:
|
Prelude.Ord b => (a -> Prelude.Int) -> b -> (a -> b) -> [a] -> (Prelude.Int, b)
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
yes
|
|
totally-defined:
|
reducible on all ground data terms
|