| definition: |
renameSymbolInPat :: (QName -> QName) -> Pattern -> Pattern renameSymbolInPat ren pat = case pat of PComb qf pats -> PComb (ren qf) (map (renameSymbolInPat ren) pats) PAs var apat -> PAs var (renameSymbolInPat ren apat) PTuple ps -> PTuple (map (renameSymbolInPat ren) ps) PList ps -> PList (map (renameSymbolInPat ren) ps) _ -> pat -- PVar or PLit |
| demand: |
argument 2 |
| deterministic: |
deterministic operation |
| failfree: |
(_, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,{PComb}) |-> {PComb} || (_,{PAs}) |-> {PAs} || (_,{PTuple}) |-> {PTuple} || (_,{PList}) |-> {PList} || (_,{PVar}) |-> {PVar} || (_,{PLit}) |-> {PLit}}
|
| name: |
renameSymbolInPat |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
((String, String) -> (String, String)) -> AbstractHaskell.Types.Pattern -> AbstractHaskell.Types.Pattern |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
reducible on all ground data terms |