|
definition:
|
readFM :: (Read key, Read val) => LeKey key -> String -> FM key val
readFM p s = FM p (read s)
|
|
demand:
|
no demanded arguments
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
--- Transforms a string representation of a finite map into a finite map.
--- One has two provide the same ordering predicate as used in the
--- original finite map.
|
|
failfree:
|
<FAILING>
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_,_,_,_) |-> {FM}}
|
|
name:
|
readFM
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
{FM}
|
|
signature:
|
(Prelude.Read a, Prelude.Read b) => (a -> a -> Prelude.Bool) -> String -> FM a b
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
possibly non-terminating
|
|
totally-defined:
|
possibly non-reducible on same data term
|