|
definition:
|
grepShow :: (Data a, Ord a) => RegExp a -> [a] -> [[a]]
grepShow re s = allValues (grepShow' re s)
where grepShow' re' s' | s' =:= _ ++ l ++ _ && match re' l = l
where l free
|
|
demand:
|
no demanded arguments
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
--- The operation `grepShow` returns a list of substrings that match the regular
--- expression.
--- @param r - The regular expression
--- @param s - The input list
--- @return l - The list of substrings from s that match r
|
|
failfree:
|
(_, _, _, _)
|
|
indeterministic:
|
might be indeterministic
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_,_,_,_) |-> _}
|
|
name:
|
grepShow
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
_
|
|
signature:
|
(Prelude.Data a, Prelude.Ord a) => [ORegExp a] -> [a] -> [[a]]
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
possibly non-terminating
|
|
totally-defined:
|
possibly non-reducible on same data term
|