Data.Monoid.DecidablyEmpty

Documentation

class Monoid a => DecidablyEmpty a where

A DecidablyEmpty is one where it can be computed whether or not an arbitrary value is mempty.

By using this class rather than Eq, we avoid unnecessary constraining the contents of Functors. This makes it possible to efficiently combine and/or nest patch maps with Eq-lacking values (e.g. functions) at the leaves.

Minimal complete definition

Nothing

Methods

isEmpty :: a -> Bool

default isEmpty :: Eq a => a -> Bool

Instances

DecidablyEmpty All

Defined in Data.Monoid.DecidablyEmpty

Methods

isEmpty :: All -> Bool

DecidablyEmpty Any

Defined in Data.Monoid.DecidablyEmpty

Methods

isEmpty :: Any -> Bool

DecidablyEmpty IntSet

Defined in Data.Monoid.DecidablyEmpty

Methods

isEmpty :: IntSet -> Bool

DecidablyEmpty Ordering

Defined in Data.Monoid.DecidablyEmpty

Methods

isEmpty :: Ordering -> Bool

DecidablyEmpty ()

Defined in Data.Monoid.DecidablyEmpty

Methods

isEmpty :: () -> Bool

DecidablyEmpty a => DecidablyEmpty (Identity a)

Defined in Data.Monoid.DecidablyEmpty

Methods

isEmpty :: Identity a -> Bool

DecidablyEmpty (First a)

Defined in Data.Monoid.DecidablyEmpty

Methods

isEmpty :: First a -> Bool

DecidablyEmpty (Last a)

Defined in Data.Monoid.DecidablyEmpty

Methods

isEmpty :: Last a -> Bool

DecidablyEmpty a => DecidablyEmpty (Down a)

Defined in Data.Monoid.DecidablyEmpty

Methods

isEmpty :: Down a -> Bool

(Ord a, Bounded a) => DecidablyEmpty (Max a)

Defined in Data.Monoid.DecidablyEmpty

Methods

isEmpty :: Max a -> Bool

(Ord a, Bounded a) => DecidablyEmpty (Min a)

Defined in Data.Monoid.DecidablyEmpty

Methods

isEmpty :: Min a -> Bool

DecidablyEmpty m => DecidablyEmpty (WrappedMonoid m)

Defined in Data.Monoid.DecidablyEmpty

Methods

isEmpty :: WrappedMonoid m -> Bool

DecidablyEmpty a => DecidablyEmpty (Dual a)

Defined in Data.Monoid.DecidablyEmpty

Methods

isEmpty :: Dual a -> Bool

(Num a, Eq a) => DecidablyEmpty (Product a)

Defined in Data.Monoid.DecidablyEmpty

Methods

isEmpty :: Product a -> Bool

(Num a, Eq a) => DecidablyEmpty (Sum a)

Defined in Data.Monoid.DecidablyEmpty

Methods

isEmpty :: Sum a -> Bool

DecidablyEmpty p => DecidablyEmpty (Par1 p)

Defined in Data.Monoid.DecidablyEmpty

Methods

isEmpty :: Par1 p -> Bool

DecidablyEmpty (IntMap v)

Defined in Data.Monoid.DecidablyEmpty

Methods

isEmpty :: IntMap v -> Bool

DecidablyEmpty (Seq v)

Defined in Data.Monoid.DecidablyEmpty

Methods

isEmpty :: Seq v -> Bool

Ord k => DecidablyEmpty (Set k)

Defined in Data.Monoid.DecidablyEmpty

Methods

isEmpty :: Set k -> Bool

DecidablyEmpty (PatchIntMap a)

Defined in Data.Patch.IntMap

Methods

isEmpty :: PatchIntMap a -> Bool

Semigroup a => DecidablyEmpty (Maybe a)

Defined in Data.Monoid.DecidablyEmpty

Methods

isEmpty :: Maybe a -> Bool

DecidablyEmpty [a]

Defined in Data.Monoid.DecidablyEmpty

Methods

isEmpty :: [a] -> Bool

DecidablyEmpty (Proxy s)

Defined in Data.Monoid.DecidablyEmpty

Methods

isEmpty :: Proxy s -> Bool

DecidablyEmpty (U1 p)

Defined in Data.Monoid.DecidablyEmpty

Methods

isEmpty :: U1 p -> Bool

Ord k => DecidablyEmpty (Map k v)

Defined in Data.Monoid.DecidablyEmpty

Methods

isEmpty :: Map k v -> Bool

Ord k => DecidablyEmpty (PatchMap k v)

Defined in Data.Patch.Map

Methods

isEmpty :: PatchMap k v -> Bool

(Ord k, DecidablyEmpty p, Patch p) => DecidablyEmpty (PatchMapWithPatchingMove k p)

Defined in Data.Patch.MapWithPatchingMove

Methods

isEmpty :: PatchMapWithPatchingMove k p -> Bool

(DecidablyEmpty a, DecidablyEmpty b) => DecidablyEmpty (a, b)

Defined in Data.Monoid.DecidablyEmpty

Methods

isEmpty :: (a, b) -> Bool

DecidablyEmpty a => DecidablyEmpty (Const a b)

Defined in Data.Monoid.DecidablyEmpty

Methods

isEmpty :: Const a b -> Bool

DecidablyEmpty (f p) => DecidablyEmpty (Rec1 f p)

Defined in Data.Monoid.DecidablyEmpty

Methods

isEmpty :: Rec1 f p -> Bool

GCompare k2 => DecidablyEmpty (DMap k2 v)

Defined in Data.Monoid.DecidablyEmpty

Methods

isEmpty :: DMap k2 v -> Bool

GCompare k2 => DecidablyEmpty (PatchDMap k2 v)

Defined in Data.Patch.DMap

Methods

isEmpty :: PatchDMap k2 v -> Bool

GCompare k2 => DecidablyEmpty (PatchDMapWithMove k2 v)

Defined in Data.Patch.DMapWithMove

Methods

isEmpty :: PatchDMapWithMove k2 v -> Bool

(DecidablyEmpty a, DecidablyEmpty b, DecidablyEmpty c) => DecidablyEmpty (a, b, c)

Defined in Data.Monoid.DecidablyEmpty

Methods

isEmpty :: (a, b, c) -> Bool

(DecidablyEmpty (f p), DecidablyEmpty (g p)) => DecidablyEmpty ((f :*: g) p)

Defined in Data.Monoid.DecidablyEmpty

Methods

isEmpty :: (f :*: g) p -> Bool

DecidablyEmpty c => DecidablyEmpty (K1 i c p)

Defined in Data.Monoid.DecidablyEmpty

Methods

isEmpty :: K1 i c p -> Bool

(DecidablyEmpty a, DecidablyEmpty b, DecidablyEmpty c, DecidablyEmpty d) => DecidablyEmpty (a, b, c, d)

Defined in Data.Monoid.DecidablyEmpty

Methods

isEmpty :: (a, b, c, d) -> Bool

DecidablyEmpty (f (g p)) => DecidablyEmpty ((f :.: g) p)

Defined in Data.Monoid.DecidablyEmpty

Methods

isEmpty :: (f :.: g) p -> Bool

DecidablyEmpty (f p) => DecidablyEmpty (M1 i c f p)

Defined in Data.Monoid.DecidablyEmpty

Methods

isEmpty :: M1 i c f p -> Bool

(DecidablyEmpty a, DecidablyEmpty b, DecidablyEmpty c, DecidablyEmpty d, DecidablyEmpty e) => DecidablyEmpty (a, b, c, d, e)

Defined in Data.Monoid.DecidablyEmpty

Methods

isEmpty :: (a, b, c, d, e) -> Bool