|
definition: |
isEncSearchOp :: QName -> Bool
isEncSearchOp qf@(mn,_) =
mn `elem` ["Control.Search.Unsafe", "Control.Search.AllValues"] ||
qf `elem` map (\n -> ("Control.AllValues",n))
["allValues", "oneValue", "isFail"]
|
|
demand: |
argument 1 |
|
deterministic: |
deterministic operation |
|
documentation: |
Is this the name of a non-failing encapsulated search operation? |
|
failfree: |
_ |
|
indeterministic: |
referentially transparent operation |
|
infix: |
no fixity defined |
|
iotype: |
{({(,)}) |-> _}
|
|
name: |
isEncSearchOp |
|
precedence: |
no precedence defined |
|
result-values: |
_ |
|
signature: |
(String, String) -> Prelude.Bool |
|
solution-complete: |
operation might suspend on free variables |
|
terminating: |
possibly non-terminating |
|
totally-defined: |
reducible on all ground data terms |