| definition: |
insert :: Ord key => key -> Set key -> Set key insert k s = Map.insert k () s |
| demand: |
argument 3 |
| deterministic: |
deterministic operation |
| documentation: |
--- Inserts an element into a set if it is not already there. |
| failfree: |
(_, _, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,_,_) |-> {Bin}}
|
| name: |
insert |
| precedence: |
no precedence defined |
| result-values: |
{Bin}
|
| signature: |
Prelude.Ord a => a -> Data.Map.Map a () -> Data.Map.Map a () |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
possibly non-reducible on same data term |