Safe Haskell	None
Language	Haskell2010

SizedGrid

Contents

Rexported for generics-sop

Synopsis

module SizedGrid.Ordinal
module SizedGrid.Grid.Grid
module SizedGrid.Grid.Focused
module SizedGrid.Grid.Class
module SizedGrid.Coord.Periodic
module SizedGrid.Coord.HardWrap
module SizedGrid.Coord.Class
module SizedGrid.Coord
class (AllF f xs, SListI xs) => All (f :: k -> Constraint) (xs :: [k])
class SListI (xs :: [k])
class f (g x) => Compose (f :: k -> Constraint) (g :: k1 -> k) (x :: k1)
newtype I a = I a

Documentation

module SizedGrid.Ordinal

module SizedGrid.Grid.Grid

module SizedGrid.Grid.Focused

module SizedGrid.Grid.Class

module SizedGrid.Coord.Periodic

module SizedGrid.Coord.HardWrap

module SizedGrid.Coord.Class

module SizedGrid.Coord

Rexported for generics-sop

class (AllF f xs, SListI xs) => All (f :: k -> Constraint) (xs :: [k]) #

Require a constraint for every element of a list.

If you have a datatype that is indexed over a type-level list, then you can use All to indicate that all elements of that type-level list must satisfy a given constraint.

Example: The constraint

All Eq '[ Int, Bool, Char ]

is equivalent to the constraint

(Eq Int, Eq Bool, Eq Char)

Example: A type signature such as

f :: All Eq xs => NP I xs -> ...

means that f can assume that all elements of the n-ary product satisfy Eq.

Instances

(AllF f xs, SListI xs) => All (f :: k -> Constraint) (xs :: [k])
Instance details Defined in Generics.SOP.Constraint

class SListI (xs :: [k]) #

Implicit singleton list.

A singleton list can be used to reveal the structure of a type-level list argument that the function is quantified over.

The class SListI should have instances that match the constructors of SList.

Since: generics-sop-0.2

Minimal complete definition

sList

Instances

SListI ([] :: [k])
Instance details Defined in Generics.SOP.Sing Methods sList :: SList [] #
SListI xs => SListI (x ': xs :: [k])
Instance details Defined in Generics.SOP.Sing Methods sList :: SList (x ': xs) #

class f (g x) => Compose (f :: k -> Constraint) (g :: k1 -> k) (x :: k1) infixr 9 #

Composition of constraints.

Note that the result of the composition must be a constraint, and therefore, in f :. g, the kind of f is k -> Constraint. The kind of g, however, is l -> k and can thus be an normal type constructor.

A typical use case is in connection with All on an NP or an NS. For example, in order to denote that all elements on an NP f xs satisfy Show, we can say All (Show :. f) xs.

Since: generics-sop-0.2

Instances

f (g x) => Compose (f :: k2 -> Constraint) (g :: k1 -> k2) (x :: k1)
Instance details Defined in Generics.SOP.Constraint

newtype I a #

The identity type functor.

Like Identity, but with a shorter name.

Constructors

I a

Instances

Monad I
Instance details Defined in Generics.SOP.BasicFunctors Methods (>>=) :: I a -> (a -> I b) -> I b # (>>) :: I a -> I b -> I b # return :: a -> I a # fail :: String -> I a #
Functor I
Instance details Defined in Generics.SOP.BasicFunctors Methods fmap :: (a -> b) -> I a -> I b # (<$) :: a -> I b -> I a #
Applicative I
Instance details Defined in Generics.SOP.BasicFunctors Methods pure :: a -> I a # (<>) :: I (a -> b) -> I a -> I b # liftA2 :: (a -> b -> c) -> I a -> I b -> I c # (>) :: I a -> I b -> I b # (<*) :: I a -> I b -> I a #
Foldable I
Instance details Defined in Generics.SOP.BasicFunctors Methods fold :: Monoid m => I m -> m # foldMap :: Monoid m => (a -> m) -> I a -> m # foldr :: (a -> b -> b) -> b -> I a -> b # foldr' :: (a -> b -> b) -> b -> I a -> b # foldl :: (b -> a -> b) -> b -> I a -> b # foldl' :: (b -> a -> b) -> b -> I a -> b # foldr1 :: (a -> a -> a) -> I a -> a # foldl1 :: (a -> a -> a) -> I a -> a # toList :: I a -> [a] # null :: I a -> Bool # length :: I a -> Int # elem :: Eq a => a -> I a -> Bool # maximum :: Ord a => I a -> a # minimum :: Ord a => I a -> a # sum :: Num a => I a -> a # product :: Num a => I a -> a #
Traversable I
Instance details Defined in Generics.SOP.BasicFunctors Methods traverse :: Applicative f => (a -> f b) -> I a -> f (I b) # sequenceA :: Applicative f => I (f a) -> f (I a) # mapM :: Monad m => (a -> m b) -> I a -> m (I b) # sequence :: Monad m => I (m a) -> m (I a) #
Eq1 I	Since: generics-sop-0.2.4.0
Instance details Defined in Generics.SOP.BasicFunctors Methods liftEq :: (a -> b -> Bool) -> I a -> I b -> Bool #
Ord1 I	Since: generics-sop-0.2.4.0
Instance details Defined in Generics.SOP.BasicFunctors Methods liftCompare :: (a -> b -> Ordering) -> I a -> I b -> Ordering #
Read1 I	Since: generics-sop-0.2.4.0
Instance details Defined in Generics.SOP.BasicFunctors Methods liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (I a) # liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [I a] # liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (I a) # liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [I a] #
Show1 I	Since: generics-sop-0.2.4.0
Instance details Defined in Generics.SOP.BasicFunctors Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> I a -> ShowS # liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [I a] -> ShowS #
NFData1 I	Since: generics-sop-0.2.5.0
Instance details Defined in Generics.SOP.BasicFunctors Methods liftRnf :: (a -> ()) -> I a -> () #
Eq a => Eq (I a)
Instance details Defined in Generics.SOP.BasicFunctors Methods (==) :: I a -> I a -> Bool # (/=) :: I a -> I a -> Bool #
Ord a => Ord (I a)
Instance details Defined in Generics.SOP.BasicFunctors Methods compare :: I a -> I a -> Ordering # (<) :: I a -> I a -> Bool # (<=) :: I a -> I a -> Bool # (>) :: I a -> I a -> Bool # (>=) :: I a -> I a -> Bool # max :: I a -> I a -> I a # min :: I a -> I a -> I a #
Read a => Read (I a)
Instance details Defined in Generics.SOP.BasicFunctors Methods readsPrec :: Int -> ReadS (I a) # readList :: ReadS [I a] # readPrec :: ReadPrec (I a) # readListPrec :: ReadPrec [I a] #
Show a => Show (I a)
Instance details Defined in Generics.SOP.BasicFunctors Methods showsPrec :: Int -> I a -> ShowS # show :: I a -> String # showList :: [I a] -> ShowS #
Generic (I a)
Instance details Defined in Generics.SOP.BasicFunctors Associated Types type Rep (I a) :: Type -> Type # Methods from :: I a -> Rep (I a) x # to :: Rep (I a) x -> I a #
NFData a => NFData (I a)	Since: generics-sop-0.2.5.0
Instance details Defined in Generics.SOP.BasicFunctors Methods rnf :: I a -> () #
type Rep (I a)
Instance details Defined in Generics.SOP.BasicFunctors type Rep (I a) = D1 (MetaData "I" "Generics.SOP.BasicFunctors" "generics-sop-0.3.2.0-1LIoMWx8QIZINcf2OfoAby" True) (C1 (MetaCons "I" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a)))
type Code (I a)
Instance details Defined in Generics.SOP.Instances type Code (I a) = (a ': ([] :: [Type])) ': ([] :: [[Type]])
type DatatypeInfoOf (I a)
Instance details Defined in Generics.SOP.Instances type DatatypeInfoOf (I a) = Newtype "Generics.SOP.BasicFunctors" "I" (Constructor "I")