CurryInfo: base-3.3.0 / Data.List.findIndex
definition: 
|
findIndex :: (a -> Bool) -> [a] -> Maybe Int findIndex p = listToMaybe . findIndices p |
|
demand:
|
no demanded arguments |
|
deterministic:
|
deterministic operation |
|
documentation:
|
Returns the index `i` of the first occurrences of a list element satisfying a predicate as `(Just i)`, otherwise `Nothing` is returned. |
|
failfree:
|
_ |
|
indeterministic:
|
referentially transparent operation |
|
infix:
|
no fixity defined |
|
iotype:
|
{(_) |-> {.._#lambda508}}
|
|
name:
|
findIndex |
|
precedence:
|
no precedence defined |
|
result-values:
|
{.._#lambda508}
|
|
signature:
|
(a -> Prelude.Bool) -> [a] -> Prelude.Maybe Prelude.Int |
|
solution-complete:
|
operation might suspend on free variables |
|
terminating:
|
possibly non-terminating |
|
totally-defined:
|
reducible on all ground data terms |