| Safe Haskell | Safe |
|---|---|
| Language | Haskell2010 |
Data.Semigroup.Join
Contents
Synopsis
- (∨) :: (Join - Semigroup) a => a -> a -> a
- bottom :: (Join - Monoid) a => a
- type JoinSemilattice a = (Prd a, (Join - Semigroup) a)
- joinLeq :: Eq a => (Join - Semigroup) a => a -> a -> Bool
- joinGeq :: Eq a => (Join - Semigroup) a => a -> a -> Bool
- pcompareJoin :: Eq a => (Join - Semigroup) a => a -> a -> Maybe Ordering
- newtype Join a = Join {
- unJoin :: a
Documentation
(∨) :: (Join - Semigroup) a => a -> a -> a infixr 5 Source #
Join operation on a semilattice.
>>>(> (0::Int)) ∧ ((< 10) ∨ (== 15)) $ 10False
>>>IntSet.fromList [1..5] ∧ IntSet.fromList [2..5]fromList [2,3,4,5]
pcompareJoin :: Eq a => (Join - Semigroup) a => a -> a -> Maybe Ordering Source #
Partial version of compare.
Normally when a implements Prd we should have:
pcompareJoin x y ≡ pcompare x y