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 # | |
Defined in Algebra.Lattice.Ordered |
|
Foldable Ordered Source # | |
Defined in Algebra.Lattice.Ordered fold :: Monoid m => Ordered m -> m Source # foldMap :: Monoid m => (a -> m) -> Ordered a -> m Source # foldMap' :: Monoid m => (a -> m) -> Ordered a -> m Source # foldr :: (a -> b -> b) -> b -> Ordered a -> b Source # foldr' :: (a -> b -> b) -> b -> Ordered a -> b Source # foldl :: (b -> a -> b) -> b -> Ordered a -> b Source # foldl' :: (b -> a -> b) -> b -> Ordered a -> b Source # foldr1 :: (a -> a -> a) -> Ordered a -> a Source # foldl1 :: (a -> a -> a) -> Ordered a -> a Source # toList :: Ordered a -> [a] Source # null :: Ordered a -> Bool Source # length :: Ordered a -> Int Source # elem :: Eq a => a -> Ordered a -> Bool Source # maximum :: Ord a => Ordered a -> a Source # minimum :: Ord a => Ordered a -> a Source # |
|
Traversable Ordered Source # | |
Defined in Algebra.Lattice.Ordered |
|
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) Source # gunfold :: ( forall b r. Data b => c (b -> r) -> c r) -> ( forall r. r -> c r) -> Constr -> c ( Ordered a) Source # toConstr :: Ordered a -> Constr Source # dataTypeOf :: Ordered a -> DataType Source # dataCast1 :: Typeable t => ( forall d. Data d => c (t d)) -> Maybe (c ( Ordered a)) Source # dataCast2 :: Typeable t => ( forall d e. ( Data d, Data e) => c (t d e)) -> Maybe (c ( Ordered a)) Source # gmapT :: ( forall b. Data b => b -> b) -> Ordered a -> Ordered a Source # gmapQl :: (r -> r' -> r) -> r -> ( forall d. Data d => d -> r') -> Ordered a -> r Source # gmapQr :: forall r r'. (r' -> r -> r) -> r -> ( forall d. Data d => d -> r') -> Ordered a -> r Source # gmapQ :: ( forall d. Data d => d -> u) -> Ordered a -> [u] Source # gmapQi :: Int -> ( forall d. Data d => d -> u) -> Ordered a -> u Source # gmapM :: Monad m => ( forall d. Data d => d -> m d) -> Ordered a -> m ( Ordered a) Source # gmapMp :: MonadPlus m => ( forall d. Data d => d -> m d) -> Ordered a -> m ( Ordered a) Source # gmapMo :: MonadPlus m => ( forall d. Data d => d -> m d) -> Ordered a -> m ( Ordered a) Source # |
|
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 |
|
NFData a => NFData ( Ordered a) Source # | |
Defined in Algebra.Lattice.Ordered |
|
Hashable a => Hashable ( Ordered a) Source # | |
Universe a => Universe ( Ordered a) Source # | |
Defined in Algebra.Lattice.Ordered |
|
Finite a => Finite ( Ordered a) Source # | |
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 |