definition: |
isSuffixOf :: Eq a => [a] -> [a] -> Bool isSuffixOf xs ys = isPrefixOf (reverse xs) (reverse ys) |
demand: |
no demanded arguments |
deterministic: |
deterministic operation |
documentation: |
Checks whether a list is a suffix of another. @param xs - a list @param ys - a list @return `True` if `xs` is a suffix of `ys` |
failfree: |
(_, _, _) |
indeterministic: |
referentially transparent operation |
infix: |
no fixity defined |
iotype: |
{(_,_,_) |-> _} |
name: |
isSuffixOf |
precedence: |
no precedence defined |
result-values: |
_ |
signature: |
Prelude.Eq a => [a] -> [a] -> Prelude.Bool |
solution-complete: |
operation might suspend on free variables |
terminating: |
yes |
totally-defined: |
reducible on all ground data terms |