Safe Haskell | Trustworthy |
---|---|
Language | Haskell98 |
Data.Unique.Prim
Documentation
A Uniq
is a value that can only be constructed under controlled
conditions (in IO or ST, basically), and once constructed can only be
compared to Uniq
values created under the same conditions (in the same
monad). Upon comparison, a Uniq
is ONLY ever equal to itself. Beyond
that, no promises regarding ordering are made except that once constructed
the order is deterministic and a proper ordering relation (eg, > is
transitive and irreflexive, etc.)
Instances
Eq (Uniq s) Source # | |
Ord (Uniq s) Source # | |
Show (Uniq RealWorld) Source # | There is only one |
Instances
Show (Uniq RealWorld) | There is only one |
GShow (Tag RealWorld) | |
Defined in Unsafe.Unique.Tag Methods gshowsPrec :: forall (a :: k). Int -> Tag RealWorld a -> ShowS | |
Show (Tag RealWorld a) | |