CurryInfo: containers-3.0.0 / Data.Set.member

definition:
member :: Ord key => key -> Set key -> Bool
member = Map.member
demand:
no demanded arguments
deterministic:
deterministic operation
documentation:
--- Returns `True` if an element is contained in a set.
--- @param e - an element to be checked for containment
--- @param s - a set
--- @return `True` if `e` is contained in `s`
failfree:
_
indeterministic:
referentially transparent operation
infix:
no fixity defined
iotype:
{(_) |-> {member}}
name:
member
precedence:
no precedence defined
result-values:
{member}
signature:
Prelude.Ord a => a -> Data.Map.Map a () -> Prelude.Bool
solution-complete:
operation might suspend on free variables
terminating:
yes
totally-defined:
reducible on all ground data terms