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 |
Algebra.Lattice.Dropped
Description
Synopsis
- data Dropped a
- retractDropped :: BoundedMeetSemiLattice a => Dropped a -> a
- foldDropped :: b -> (a -> b) -> Dropped a -> b
Documentation
Graft a distinct top onto an otherwise unbounded lattice. As a bonus, the top will be an absorbing element for the join.
Instances
Foldable Dropped Source # | |
Defined in Algebra.Lattice.Dropped Methods fold :: Monoid m => Dropped m -> m # foldMap :: Monoid m => (a -> m) -> Dropped a -> m # foldMap' :: Monoid m => (a -> m) -> Dropped a -> m # foldr :: (a -> b -> b) -> b -> Dropped a -> b # foldr' :: (a -> b -> b) -> b -> Dropped a -> b # foldl :: (b -> a -> b) -> b -> Dropped a -> b # foldl' :: (b -> a -> b) -> b -> Dropped a -> b # foldr1 :: (a -> a -> a) -> Dropped a -> a # foldl1 :: (a -> a -> a) -> Dropped a -> a # elem :: Eq a => a -> Dropped a -> Bool # maximum :: Ord a => Dropped a -> a # minimum :: Ord a => Dropped a -> a # | |
Traversable Dropped Source # | |
Applicative Dropped Source # | |
Functor Dropped Source # | |
Monad Dropped Source # | |
Generic1 Dropped Source # | |
Arbitrary a => Arbitrary (Dropped a) Source # | |
CoArbitrary a => CoArbitrary (Dropped a) Source # | |
Defined in Algebra.Lattice.Dropped Methods coarbitrary :: Dropped a -> Gen b -> Gen b # | |
Function a => Function (Dropped a) Source # | |
Data a => Data (Dropped a) Source # | |
Defined in Algebra.Lattice.Dropped Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Dropped a -> c (Dropped a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Dropped a) # toConstr :: Dropped a -> Constr # dataTypeOf :: Dropped a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Dropped a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Dropped a)) # gmapT :: (forall b. Data b => b -> b) -> Dropped a -> Dropped a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Dropped a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Dropped a -> r # gmapQ :: (forall d. Data d => d -> u) -> Dropped a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Dropped a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Dropped a -> m (Dropped a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Dropped a -> m (Dropped a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Dropped a -> m (Dropped a) # | |
Generic (Dropped a) Source # | |
Read a => Read (Dropped a) Source # | |
Show a => Show (Dropped a) Source # | |
NFData a => NFData (Dropped a) Source # | |
Defined in Algebra.Lattice.Dropped | |
Eq a => Eq (Dropped a) Source # | |
Ord a => Ord (Dropped a) Source # | |
Hashable a => Hashable (Dropped a) Source # | |
Defined in Algebra.Lattice.Dropped | |
BoundedJoinSemiLattice a => BoundedJoinSemiLattice (Dropped a) Source # | |
Defined in Algebra.Lattice.Dropped | |
Lattice a => BoundedMeetSemiLattice (Dropped a) Source # | |
Defined in Algebra.Lattice.Dropped | |
Lattice a => Lattice (Dropped a) Source # | |
PartialOrd a => PartialOrd (Dropped a) Source # | |
Finite a => Finite (Dropped a) Source # | |
Defined in Algebra.Lattice.Dropped | |
Universe a => Universe (Dropped a) Source # | |
Defined in Algebra.Lattice.Dropped | |
type Rep1 Dropped Source # | |
Defined in Algebra.Lattice.Dropped type Rep1 Dropped = D1 ('MetaData "Dropped" "Algebra.Lattice.Dropped" "lattices-2.2.1-83qrGPcFdIWCf2lUVrFvrH" 'False) (C1 ('MetaCons "Drop" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1) :+: C1 ('MetaCons "Top" 'PrefixI 'False) (U1 :: Type -> Type)) | |
type Rep (Dropped a) Source # | |
Defined in Algebra.Lattice.Dropped type Rep (Dropped a) = D1 ('MetaData "Dropped" "Algebra.Lattice.Dropped" "lattices-2.2.1-83qrGPcFdIWCf2lUVrFvrH" 'False) (C1 ('MetaCons "Drop" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)) :+: C1 ('MetaCons "Top" 'PrefixI 'False) (U1 :: Type -> Type)) |
retractDropped :: BoundedMeetSemiLattice a => Dropped a -> a Source #
Interpret
using the Dropped
aBoundedMeetSemiLattice
of a
.