Copyright | (C) 2010-2015 Maximilian Bolingbroke 2015-2019 Oleg Grenrus |
---|---|
License | BSD-3-Clause (see the file LICENSE) |
Maintainer | Oleg Grenrus <oleg.grenrus@iki.fi> |
Safe Haskell | Safe |
Language | Haskell2010 |
Synopsis
- newtype Ordered a = Ordered {
- getOrdered :: a
Documentation
Ordered | |
|
Instances
Monad Ordered Source # | |
Functor Ordered Source # | |
Applicative Ordered Source # | |
Foldable Ordered Source # | |
Defined in Algebra.Lattice.Ordered fold :: Monoid m => Ordered m -> m # foldMap :: Monoid m => (a -> m) -> Ordered a -> m # foldr :: (a -> b -> b) -> b -> Ordered a -> b # foldr' :: (a -> b -> b) -> b -> Ordered a -> b # foldl :: (b -> a -> b) -> b -> Ordered a -> b # foldl' :: (b -> a -> b) -> b -> Ordered a -> b # foldr1 :: (a -> a -> a) -> Ordered a -> a # foldl1 :: (a -> a -> a) -> Ordered a -> a # elem :: Eq a => a -> Ordered a -> Bool # maximum :: Ord a => Ordered a -> a # minimum :: Ord a => Ordered a -> a # | |
Traversable Ordered Source # | |
Eq a => Eq (Ordered a) Source # | |
Data a => Data (Ordered a) Source # | |
Defined in Algebra.Lattice.Ordered gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Ordered a -> c (Ordered a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Ordered a) # toConstr :: Ordered a -> Constr # dataTypeOf :: Ordered a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Ordered a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Ordered a)) # gmapT :: (forall b. Data b => b -> b) -> Ordered a -> Ordered a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Ordered a -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Ordered a -> r # gmapQ :: (forall d. Data d => d -> u) -> Ordered a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Ordered a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Ordered a -> m (Ordered a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Ordered a -> m (Ordered a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Ordered a -> m (Ordered a) # | |
Ord a => Ord (Ordered a) Source # | |
Defined in Algebra.Lattice.Ordered | |
Read a => Read (Ordered a) Source # | |
Show a => Show (Ordered a) Source # | |
Generic (Ordered a) Source # | |
Function a => Function (Ordered a) Source # | |
Arbitrary a => Arbitrary (Ordered a) Source # | |
CoArbitrary a => CoArbitrary (Ordered a) Source # | |
Defined in Algebra.Lattice.Ordered coarbitrary :: Ordered a -> Gen b -> Gen b # | |
NFData a => NFData (Ordered a) Source # | |
Defined in Algebra.Lattice.Ordered | |
Hashable a => Hashable (Ordered a) Source # | |
Defined in Algebra.Lattice.Ordered | |
Universe a => Universe (Ordered a) Source # | |
Defined in Algebra.Lattice.Ordered | |
Finite a => Finite (Ordered a) Source # | |
Defined in Algebra.Lattice.Ordered | |
Ord a => PartialOrd (Ordered a) Source # | |
(Ord a, Bounded a) => BoundedMeetSemiLattice (Ordered a) Source # | |
Defined in Algebra.Lattice.Ordered | |
(Ord a, Bounded a) => BoundedJoinSemiLattice (Ordered a) Source # | |
Defined in Algebra.Lattice.Ordered | |
Ord a => Lattice (Ordered a) Source # | |
(Ord a, Bounded a) => Heyting (Ordered a) Source # | This is interesting logic, as it satisfies both de Morgan laws; but isn't Boolean: i.e. law of exluded middle doesn't hold. |
Generic1 Ordered Source # | |
type Rep (Ordered a) Source # | |
Defined in Algebra.Lattice.Ordered | |
type Rep1 Ordered Source # | |
Defined in Algebra.Lattice.Ordered |