| definition: |
checkAndOr' :: (SpanInfo, String, String) -> CSM ()
checkAndOr' n =
case n of
(sI, "foldr", "||") -> (report (Message
(getSpan sI)
( text "superfluous code"
<+> colorizeKey "foldr ||"
)
( text "instead of"
<+> colorizeKey "foldr || False"
<+> text "write"
<+> colorizeKey "or")))
(sI, "foldr", "&&") -> (report (Message
(getSpan sI)
( text "superfluous code"
<+> colorizeKey "foldr && True"
)
( text "instead of"
<+> colorizeKey "foldr &&"
<+> text "write"
<+> colorizeKey "and")))
(sI, "foldl", "||") -> (report (Message
(getSpan sI)
( text "superfluous code"
<+> colorizeKey "foldl ||"
)
( text "instead of"
<+> colorizeKey "foldl || False"
<+> text "write"
<+> colorizeKey "or"
<+> text "(better use of laziness)")))
(sI, "foldl", "&&") -> (report (Message
(getSpan sI)
( text "superfluous code"
<+> colorizeKey "foldr &&"
)
( text "instead of"
<+> colorizeKey "foldr && True"
<+> text "write"
<+> colorizeKey "and"
<+> text "(better use of laziness)")))
_ -> return ()
|
| demand: |
argument 1 |
| deterministic: |
deterministic operation |
| documentation: |
-- If `foldl` / `foldr` is used with `||` or `&&`, a warning is emitted (use 'and' and 'or' instead). |
| failfree: |
<FAILING> |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{({(,,)}) |-> _}
|
| name: |
checkAndOr' |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
(Curry.SpanInfo.SpanInfo, String, String) -> Control.Monad.Trans.State.StateT Types.CheckState Data.Functor.Identity.Identity () |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
possibly non-reducible on same data term |