| definition: |
match :: (Data a, Ord a) => RegExp a -> [a] -> Bool
match re s = case re of
[] -> s == []
(Nil:ors) -> match ors s
(Xor or1 or2:ors) -> match (or1 ++ ors) s || match (or2 ++ ors) s
(Literal c:ors) -> case s of
[] -> False
(d:ds) -> if (d == c) then match ors ds else False
(Star r:ors) -> matchstar r ors s
(Plus r:ors) -> matchplus r ors s
(AnyLiteral:ors) -> case s of
[] -> False
(_:ds) -> match ors ds
(Bracket b:ors) -> case s of
[] -> False
(d:ds) -> (matchbracket b d) && match ors ds
(NegBracket b:ors) -> case s of
[] -> False
(d:ds) -> not (matchbracket b d) && match ors ds
(Start r:ors) ->
not . null . filter id . allValues $ matchstart (Start r:ors) s
[End r] ->
not . null . filter id . allValues $ matchend (End r) s
[End r, Nil] ->
not . null . filter id . allValues $ matchend (End r) s
(End _ : _) -> False
(Times (n,m) r:ors) -> matchtimes s n m r ors
(Capture _ r:ors) -> match (r ++ ors) s
|
| demand: |
argument 3 |
| deterministic: |
possibly non-deterministic operation |
| documentation: |
--- The match function is used to match lists with regular expressions --- @param r - The regular expression --- @param s - The input list --- @result True if matched else False |
| failfree: |
<FAILING> |
| indeterministic: |
might be indeterministic |
| infix: |
no fixity defined |
| iotype: |
{(_,_,{[]},_) |-> _ || (_,_,{:},_) |-> _ || (_,_,{:},{[]}) |-> {False} || (_,_,{:},{:}) |-> _}
|
| name: |
match |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
(Prelude.Data a, Prelude.Ord a) => [ORegExp a] -> [a] -> Prelude.Bool |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
possibly non-reducible on same data term |