|
definition:
|
grepPos :: (Data a, Ord a) => RegExp a -> [a] -> Int
grepPos re s = grepPos' re s 0
where
-- grepPos' :: (Data a, Ord a) => RegExp a -> [a] -> Int -> Int
grepPos' _ [] _ = -1
grepPos' r (x : xs) n = if match (r ++ [Star ([AnyLiteral])]) (x : xs)
then n
else grepPos' r xs (n+1)
|
|
demand:
|
argument 4
|
|
deterministic:
|
possibly non-deterministic operation
|
|
documentation:
|
--- The operation `grepPos` returns the first starting position of a substring
--- which matches the regular expression.
--- @param r - The regular expression
--- @param s - The input list
--- @result n - The startindex of the first substring that matches,
--- -1 if no substring matches
|
|
failfree:
|
<FAILING>
|
|
indeterministic:
|
might be indeterministic
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_,_,_,_) |-> _}
|
|
name:
|
grepPos
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
_
|
|
signature:
|
(Prelude.Data a, Prelude.Ord a) => [ORegExp a] -> [a] -> Prelude.Int
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
possibly non-terminating
|
|
totally-defined:
|
possibly non-reducible on same data term
|