OrdC

A case statement on Ordering. OrdCond c l e g is l when c ~ LT, e when c ~ EQ, and g when c ~ GT.

If the type has already an Ord instance it is certainly the most easiest to define compare to be equal to Ord's compare.

Ord classes that can be derived for GADTs. This includes:

• Ord
• Ord1
• Ord2

Provides a case condition bound to the given return type. This should be used when one wants Conjure to consider ord-case expressions:

> conjure "mem" mem
>   [ unfun False
>   , unfun True
>   , fun "`compare`" (compare :: Int -> Int -> Ordering)
>   , ordcase (undefined :: Bool)
>   ]
mem :: Int -> Tree -> Bool
-- ...   ...   ...   ...   ...
-- 0.0s, 384 candidates of size 12
-- 0.0s, tested 346 candidates
mem x Leaf  =  False
mem x (Node t1 y t2)  =  case x `compare` y of
LT -> mem x t1
EQ -> True
GT -> mem x t2

Date on which the item has been created, in ISO 8601 format.

Add unsigned integers reporting overflow. The first element of the pair is the result. The second element is the carry flag, which is nonzero on overflow. See also plusWord2#.

Subtract unsigned integers reporting overflow. The first element of the pair is the result. The second element is the carry flag, which is nonzero on overflow.