cartesian-profunctors
Safe HaskellNone
LanguageHaskell2010

Data.FunctorShape

Documentation

data Shape (f :: Type -> Type) Source #

Instances

Instances details
Show (f Ignored) => Show (Shape f) Source # 
Instance details

Defined in Data.FunctorShape

Methods

showsPrec :: Int -> Shape f -> ShowS #

show :: Shape f -> String #

showList :: [Shape f] -> ShowS #

PTraversable f => Enum (Shape f) Source # 
Instance details

Defined in Data.FunctorShape

Methods

enumeration :: FinFn (Shape f) (Shape f) Source #

withEnum :: (forall (n :: Nat). KnownNat n => (Shape f -> Finite n) -> (Finite n -> Shape f) -> r) -> r Source #

WeakEq f => Eq (Shape f) Source # 
Instance details

Defined in Data.FunctorShape

Methods

(==) :: Shape f -> Shape f -> Bool #

(/=) :: Shape f -> Shape f -> Bool #

WeakOrd f => Ord (Shape f) Source # 
Instance details

Defined in Data.FunctorShape

Methods

compare :: Shape f -> Shape f -> Ordering #

(<) :: Shape f -> Shape f -> Bool #

(<=) :: Shape f -> Shape f -> Bool #

(>) :: Shape f -> Shape f -> Bool #

(>=) :: Shape f -> Shape f -> Bool #

max :: Shape f -> Shape f -> Shape f #

min :: Shape f -> Shape f -> Shape f #

pattern Shape :: () => f a -> Shape f Source #

mapShape :: (forall a. f a -> g a) -> Shape f -> Shape g Source #

data Ignored Source #

Constructors

Ignored 

Instances

Instances details
Show Ignored Source # 
Instance details

Defined in Data.FunctorShape

Eq Ignored Source # 
Instance details

Defined in Data.FunctorShape

Methods

(==) :: Ignored -> Ignored -> Bool #

(/=) :: Ignored -> Ignored -> Bool #

Ord Ignored Source # 
Instance details

Defined in Data.FunctorShape

type WeakEq (f :: Type -> Type) = Eq (f Ignored) Source #

type WeakOrd (f :: Type -> Type) = Ord (f Ignored) Source #