Safe Haskell	Safe-Inferred
Language	Haskell2010

Data.Functor.Misc

Contents

Const2
WrapArg
Convenience functions for DMap

Description

This module provides types and functions with no particular theme, but which are relevant to the use of Functor-based datastructures like DMap.

Synopsis

data Const2 a (b :: x) (c :: x) where
- Const2 :: forall {x} a (b :: x). a -> Const2 a b b
unConst2 :: forall {x} k (v :: x) (v' :: x). Const2 k v v' -> k
dmapToMap :: DMap (Const2 k v) Identity -> Map k v
dmapToIntMap :: DMap (Const2 Key v) Identity -> IntMap v
dmapToMapWith :: forall {k1} f (v :: k1) v' k2. (f v -> v') -> DMap (Const2 k2 v) f -> Map k2 v'
mapToDMap :: Map k v -> DMap (Const2 k v) Identity
weakenDMapWith :: forall {k1} v v' (k2 :: k1 -> Type). (forall (a :: k1). v a -> v') -> DMap k2 v -> Map (Some k2) v'
data WrapArg (a :: k -> Type) (b :: k -> Type) c where
- WrapArg :: forall {k} (b :: k -> Type) (a1 :: k) (a :: k -> Type). b a1 -> WrapArg a b (a a1)
mapWithFunctorToDMap :: forall {k1} k2 f (v :: k1). Map k2 (f v) -> DMap (Const2 k2 v) f
intMapWithFunctorToDMap :: forall {k} f (v :: k). IntMap (f v) -> DMap (Const2 Key v) f
mapKeyValuePairsMonotonic :: forall {k1} {k2} (k3 :: k1 -> Type) (v :: k1 -> Type) (k' :: k2 -> Type) (v' :: k2 -> Type). (DSum k3 v -> DSum k' v') -> DMap k3 v -> DMap k' v'
combineDMapsWithKey :: GCompare f => (forall (a :: k). f a -> These (g a) (h a) -> i a) -> DMap f g -> DMap f h -> DMap f i
data EitherTag (l :: k) (r :: k) (a :: k) where
- LeftTag :: forall {k} (l :: k) (r :: k). EitherTag l r l
- RightTag :: forall {k} (l :: k) (r :: k). EitherTag l r r
dmapToThese :: DMap (EitherTag a b) Identity -> Maybe (These a b)
eitherToDSum :: Either a b -> DSum (EitherTag a b) Identity
dsumToEither :: DSum (EitherTag a b) Identity -> Either a b
newtype ComposeMaybe (f :: k -> Type) (a :: k) = ComposeMaybe {
- getComposeMaybe :: Maybe (f a)
}

Const2

data Const2 a (b :: x) (c :: x) where Source #

Const2 k v v stores a value of a given type k and ensures that a particular type v is always given for the last type parameter

Constructors

Const2 :: forall {x} a (b :: x). a -> Const2 a b b

Instances

Instances details

Ord k2 => GCompare (Const2 k2 v :: k1 -> Type) Source #
Instance details Defined in Data.Functor.Misc Methods gcompare :: forall (a :: k1) (b :: k1). Const2 k2 v a -> Const2 k2 v b -> GOrdering a b #
Eq k2 => GEq (Const2 k2 v :: k1 -> Type) Source #
Instance details Defined in Data.Functor.Misc Methods geq :: forall (a :: k1) (b :: k1). Const2 k2 v a -> Const2 k2 v b -> Maybe (a :~: b) #
Show k2 => GShow (Const2 k2 v :: k1 -> Type) Source #
Instance details Defined in Data.Functor.Misc Methods gshowsPrec :: forall (a :: k1). Int -> Const2 k2 v a -> ShowS #
Read k => Read (Const2 k v v) Source #
Instance details Defined in Data.Functor.Misc Methods readsPrec :: Int -> ReadS (Const2 k v v) # readList :: ReadS [Const2 k v v] # readPrec :: ReadPrec (Const2 k v v) # readListPrec :: ReadPrec [Const2 k v v] #
Show k => Show (Const2 k v v') Source #
Instance details Defined in Data.Functor.Misc Methods showsPrec :: Int -> Const2 k v v' -> ShowS # show :: Const2 k v v' -> String # showList :: [Const2 k v v'] -> ShowS #
Eq k => Eq (Const2 k v v') Source #
Instance details Defined in Data.Functor.Misc Methods (==) :: Const2 k v v' -> Const2 k v v' -> Bool # (/=) :: Const2 k v v' -> Const2 k v v' -> Bool #
Ord k => Ord (Const2 k v v') Source #
Instance details Defined in Data.Functor.Misc Methods compare :: Const2 k v v' -> Const2 k v v' -> Ordering # (<) :: Const2 k v v' -> Const2 k v v' -> Bool # (<=) :: Const2 k v v' -> Const2 k v v' -> Bool # (>) :: Const2 k v v' -> Const2 k v v' -> Bool # (>=) :: Const2 k v v' -> Const2 k v v' -> Bool # max :: Const2 k v v' -> Const2 k v v' -> Const2 k v v' # min :: Const2 k v v' -> Const2 k v v' -> Const2 k v v' #

unConst2 :: forall {x} k (v :: x) (v' :: x). Const2 k v v' -> k Source #

Extract the value from a Const2

dmapToMap :: DMap (Const2 k v) Identity -> Map k v Source #

Convert a DMap to a regular Map

dmapToIntMap :: DMap (Const2 Key v) Identity -> IntMap v Source #

Convert a DMap to an IntMap

dmapToMapWith :: forall {k1} f (v :: k1) v' k2. (f v -> v') -> DMap (Const2 k2 v) f -> Map k2 v' Source #

Convert a DMap to a regular Map, applying the given function to remove the wrapping Functor

mapToDMap :: Map k v -> DMap (Const2 k v) Identity Source #

Convert a regular Map to a DMap

weakenDMapWith :: forall {k1} v v' (k2 :: k1 -> Type). (forall (a :: k1). v a -> v') -> DMap k2 v -> Map (Some k2) v' Source #

Convert a DMap to a regular Map by forgetting the types associated with the keys, using a function to remove the wrapping Functor

WrapArg

data WrapArg (a :: k -> Type) (b :: k -> Type) c where Source #

WrapArg can be used to tag a value in one functor with a type representing another functor. This was primarily used with dependent-map < 0.2, in which the value type was not wrapped in a separate functor.

Constructors

WrapArg :: forall {k} (b :: k -> Type) (a1 :: k) (a :: k -> Type). b a1 -> WrapArg a b (a a1)

Instances

Instances details

GCompare f => GCompare (WrapArg g f :: Type -> Type) Source #
Instance details Defined in Data.Functor.Misc Methods gcompare :: WrapArg g f a -> WrapArg g f b -> GOrdering a b #
GEq f => GEq (WrapArg g f :: Type -> Type) Source #
Instance details Defined in Data.Functor.Misc Methods geq :: WrapArg g f a -> WrapArg g f b -> Maybe (a :~: b) #
Read (f a) => Read (WrapArg g f (g a)) Source #
Instance details Defined in Data.Functor.Misc Methods readsPrec :: Int -> ReadS (WrapArg g f (g a)) # readList :: ReadS [WrapArg g f (g a)] # readPrec :: ReadPrec (WrapArg g f (g a)) # readListPrec :: ReadPrec [WrapArg g f (g a)] #
Show (f a) => Show (WrapArg g f (g' a)) Source #
Instance details Defined in Data.Functor.Misc Methods showsPrec :: Int -> WrapArg g f (g' a) -> ShowS # show :: WrapArg g f (g' a) -> String # showList :: [WrapArg g f (g' a)] -> ShowS #
Eq (f a) => Eq (WrapArg g f (g' a)) Source #
Instance details Defined in Data.Functor.Misc Methods (==) :: WrapArg g f (g' a) -> WrapArg g f (g' a) -> Bool # (/=) :: WrapArg g f (g' a) -> WrapArg g f (g' a) -> Bool #
Ord (f a) => Ord (WrapArg g f (g' a)) Source #
Instance details Defined in Data.Functor.Misc Methods compare :: WrapArg g f (g' a) -> WrapArg g f (g' a) -> Ordering # (<) :: WrapArg g f (g' a) -> WrapArg g f (g' a) -> Bool # (<=) :: WrapArg g f (g' a) -> WrapArg g f (g' a) -> Bool # (>) :: WrapArg g f (g' a) -> WrapArg g f (g' a) -> Bool # (>=) :: WrapArg g f (g' a) -> WrapArg g f (g' a) -> Bool # max :: WrapArg g f (g' a) -> WrapArg g f (g' a) -> WrapArg g f (g' a) # min :: WrapArg g f (g' a) -> WrapArg g f (g' a) -> WrapArg g f (g' a) #

Convenience functions for DMap

mapWithFunctorToDMap :: forall {k1} k2 f (v :: k1). Map k2 (f v) -> DMap (Const2 k2 v) f Source #

Convert a regular Map, where the values are already wrapped in a functor, to a DMap

intMapWithFunctorToDMap :: forall {k} f (v :: k). IntMap (f v) -> DMap (Const2 Key v) f Source #

Convert a regular IntMap, where the values are already wrapped in a functor, to a DMap

mapKeyValuePairsMonotonic :: forall {k1} {k2} (k3 :: k1 -> Type) (v :: k1 -> Type) (k' :: k2 -> Type) (v' :: k2 -> Type). (DSum k3 v -> DSum k' v') -> DMap k3 v -> DMap k' v' Source #

Map over all key/value pairs in a DMap, potentially altering the key as well as the value. The provided function MUST preserve the ordering of the keys, or the resulting DMap will be malformed.

combineDMapsWithKey :: GCompare f => (forall (a :: k). f a -> These (g a) (h a) -> i a) -> DMap f g -> DMap f h -> DMap f i Source #

Union two DMaps of different types, yielding another type. Each key that is present in either input map will be present in the output.

data EitherTag (l :: k) (r :: k) (a :: k) where Source #

Tag type for Either to use it as a DSum.

Constructors

LeftTag :: forall {k} (l :: k) (r :: k). EitherTag l r l
RightTag :: forall {k} (l :: k) (r :: k). EitherTag l r r

Instances

Instances details

GCompare (EitherTag l r :: k -> Type) Source #
Instance details Defined in Data.Functor.Misc Methods gcompare :: forall (a :: k) (b :: k). EitherTag l r a -> EitherTag l r b -> GOrdering a b #
GEq (EitherTag l r :: k -> Type) Source #
Instance details Defined in Data.Functor.Misc Methods geq :: forall (a :: k) (b :: k). EitherTag l r a -> EitherTag l r b -> Maybe (a :~: b) #
GShow (EitherTag l r :: k -> Type) Source #
Instance details Defined in Data.Functor.Misc Methods gshowsPrec :: forall (a :: k). Int -> EitherTag l r a -> ShowS #
Show (EitherTag l r a) Source #
Instance details Defined in Data.Functor.Misc Methods showsPrec :: Int -> EitherTag l r a -> ShowS # show :: EitherTag l r a -> String # showList :: [EitherTag l r a] -> ShowS #
Eq (EitherTag l r a) Source #
Instance details Defined in Data.Functor.Misc Methods (==) :: EitherTag l r a -> EitherTag l r a -> Bool # (/=) :: EitherTag l r a -> EitherTag l r a -> Bool #
Ord (EitherTag l r a) Source #
Instance details Defined in Data.Functor.Misc Methods compare :: EitherTag l r a -> EitherTag l r a -> Ordering # (<) :: EitherTag l r a -> EitherTag l r a -> Bool # (<=) :: EitherTag l r a -> EitherTag l r a -> Bool # (>) :: EitherTag l r a -> EitherTag l r a -> Bool # (>=) :: EitherTag l r a -> EitherTag l r a -> Bool # max :: EitherTag l r a -> EitherTag l r a -> EitherTag l r a # min :: EitherTag l r a -> EitherTag l r a -> EitherTag l r a #

dmapToThese :: DMap (EitherTag a b) Identity -> Maybe (These a b) Source #

Extract the values of a DMap of EitherTags.

eitherToDSum :: Either a b -> DSum (EitherTag a b) Identity Source #

Convert Either to a DSum. Inverse of dsumToEither.

dsumToEither :: DSum (EitherTag a b) Identity -> Either a b Source #

Convert DSum to Either. Inverse of eitherToDSum.

newtype ComposeMaybe (f :: k -> Type) (a :: k) Source #

We can't use Compose Maybe instead of ComposeMaybe, because that would make the f parameter have a nominal type role. We need f to be representational so that we can use safe coerce.

Constructors

ComposeMaybe
Fields getComposeMaybe :: Maybe (f a)

Instances

Instances details

Functor f => Functor (ComposeMaybe f) Source #
Instance details Defined in Data.Functor.Misc Methods fmap :: (a -> b) -> ComposeMaybe f a -> ComposeMaybe f b # (<$) :: a -> ComposeMaybe f b -> ComposeMaybe f a #
Show (f a) => Show (ComposeMaybe f a) Source #
Instance details Defined in Data.Functor.Misc Methods showsPrec :: Int -> ComposeMaybe f a -> ShowS # show :: ComposeMaybe f a -> String # showList :: [ComposeMaybe f a] -> ShowS #
Eq (f a) => Eq (ComposeMaybe f a) Source #
Instance details Defined in Data.Functor.Misc Methods (==) :: ComposeMaybe f a -> ComposeMaybe f a -> Bool # (/=) :: ComposeMaybe f a -> ComposeMaybe f a -> Bool #
Ord (f a) => Ord (ComposeMaybe f a) Source #
Instance details Defined in Data.Functor.Misc Methods compare :: ComposeMaybe f a -> ComposeMaybe f a -> Ordering # (<) :: ComposeMaybe f a -> ComposeMaybe f a -> Bool # (<=) :: ComposeMaybe f a -> ComposeMaybe f a -> Bool # (>) :: ComposeMaybe f a -> ComposeMaybe f a -> Bool # (>=) :: ComposeMaybe f a -> ComposeMaybe f a -> Bool # max :: ComposeMaybe f a -> ComposeMaybe f a -> ComposeMaybe f a # min :: ComposeMaybe f a -> ComposeMaybe f a -> ComposeMaybe f a #