Data.Ten.Field

Provides Generic1 derivation of Representable10 based on Field10.

Like with Data.Functor.Field, we use parametric functions forall m. f m -> m a to identify positions tagged with type a within f. This leads to instances for Representable10 and Update10.

Documentation

newtype Field10 f a

A Rep10 type as a parametric accessor function.

Constructors

Field10

Fields

• getField10 :: forall m. f m -> m a

Instances

Update10 f => TestEquality (Field10 f :: k -> Type)

Defined in Data.Ten.Field

Methods

testEquality :: forall (a :: k0) (b :: k0). Field10 f a -> Field10 f b -> Maybe (a :~: b)

Update10 f => GEq (Field10 f :: k -> Type)

Defined in Data.Ten.Field

Methods

geq :: forall (a :: k0) (b :: k0). Field10 f a -> Field10 f b -> Maybe (a :~: b)

(Traversable10 f, Applicative10 f, Update10 f) => GCompare (Field10 f :: k -> Type)

Defined in Data.Ten.Field

Methods

gcompare :: forall (a :: k0) (b :: k0). Field10 f a -> Field10 f b -> GOrdering a b

(Constrained10 c f, Applicative10 f) => Entails (Field10 f :: k -> Type) (c :: k -> Constraint)

Defined in Data.Ten.Field

Methods

entailment :: forall (a :: k0). Field10 f a -> Dict1 c a

(Traversable10 f, Applicative10 f) => Eq (Field10 f a)

Defined in Data.Ten.Field

Methods

(==) :: Field10 f a -> Field10 f a -> Bool

(/=) :: Field10 f a -> Field10 f a -> Bool

(Traversable10 f, Applicative10 f) => Ord (Field10 f a)

Defined in Data.Ten.Field

Methods

compare :: Field10 f a -> Field10 f a -> Ordering

(<) :: Field10 f a -> Field10 f a -> Bool

(<=) :: Field10 f a -> Field10 f a -> Bool

(>) :: Field10 f a -> Field10 f a -> Bool

(>=) :: Field10 f a -> Field10 f a -> Bool

max :: Field10 f a -> Field10 f a -> Field10 f a

min :: Field10 f a -> Field10 f a -> Field10 f a

FieldPaths10 f => Show (Field10 f a)

Defined in Data.Ten.Field

Methods

showsPrec :: Int -> Field10 f a -> ShowS

show :: Field10 f a -> String

showList :: [Field10 f a] -> ShowS

(Traversable10 f, Applicative10 f) => Hashable (Field10 f a)

Defined in Data.Ten.Field

Methods

hashWithSalt :: Int -> Field10 f a -> Int

hash :: Field10 f a -> Int

FieldPaths10 f => Portray (Field10 f a)

Defined in Data.Ten.Field

Methods

portray :: Field10 f a -> Portrayal

(Traversable10 f, Applicative10 f, FieldPaths10 f) => Diff (Field10 f a)

Defined in Data.Ten.Field

Methods

diff :: Field10 f a -> Field10 f a -> Maybe Portrayal

class FieldPaths10 (rec :: (k -> Type) -> Type) where

Provides a path of field selectors / lenses identifying each "field".

Methods

fieldPaths10 :: rec (Const [PathComponent])

Instances

FieldPaths10 (Ap10 a :: (k -> Type) -> Type)

Defined in Data.Ten.Field

Methods

fieldPaths10 :: Ap10 a (Const [PathComponent])

(Generic1 rec, GFieldPaths10 (Rep1 rec)) => FieldPaths10 (Wrapped1 (Generic1 :: ((k -> Type) -> Type) -> Constraint) rec :: (k -> Type) -> Type)

Defined in Data.Ten.Field

Methods

fieldPaths10 :: Wrapped1 Generic1 rec (Const [PathComponent])

class GFieldPaths10 (rec :: (k -> Type) -> Type) where

Generic1 implementation of FieldPaths10.

Methods

gfieldPaths10 :: (forall a. [PathComponent] -> r a) -> rec r

Instances

GFieldPaths10 (U1 :: (k -> Type) -> Type)

Defined in Data.Ten.Field

Methods

gfieldPaths10 :: (forall (a :: k0). [PathComponent] -> r a) -> U1 r

(Functor10 rec, FieldPaths10 rec) => GFieldPaths10 (Rec1 rec :: (k -> Type) -> Type)

Defined in Data.Ten.Field

Methods

gfieldPaths10 :: (forall (a :: k0). [PathComponent] -> r a) -> Rec1 rec r

(GFieldPaths10 f, GFieldPaths10 g) => GFieldPaths10 (f :*: g :: (k -> Type) -> Type)

Defined in Data.Ten.Field

Methods

gfieldPaths10 :: (forall (a :: k0). [PathComponent] -> r a) -> (f :*: g) r

(Functor f, FieldPaths f, GFieldPaths10 g) => GFieldPaths10 (f :.: g :: (k -> Type) -> Type)

Defined in Data.Ten.Field

Methods

gfieldPaths10 :: (forall (a :: k0). [PathComponent] -> r a) -> (f :.: g) r

(KnownSymbol sym, GFieldPaths10 rec) => GFieldPaths10 (M1 S ('MetaSel ('Just sym) b c d) rec :: (k -> Type) -> Type)

Defined in Data.Ten.Field

Methods

gfieldPaths10 :: (forall (a :: k0). [PathComponent] -> r a) -> M1 S ('MetaSel ('Just sym) b c d) rec r

GFieldPaths10 rec => GFieldPaths10 (M1 D ('MetaData n m p 'True) (M1 C i (M1 S j rec)) :: (k -> Type) -> Type)

Defined in Data.Ten.Field

Methods

gfieldPaths10 :: (forall (a :: k0). [PathComponent] -> r a) -> M1 D ('MetaData n m p 'True) (M1 C i (M1 S j rec)) r

GFieldPaths10 rec => GFieldPaths10 (M1 D ('MetaData n m p 'False) rec :: (k -> Type) -> Type)

Defined in Data.Ten.Field

Methods

gfieldPaths10 :: (forall (a :: k0). [PathComponent] -> r a) -> M1 D ('MetaData n m p 'False) rec r

GFieldPaths10 rec => GFieldPaths10 (M1 C i rec :: (k -> Type) -> Type)

Defined in Data.Ten.Field

Methods

gfieldPaths10 :: (forall (a :: k0). [PathComponent] -> r a) -> M1 C i rec r

class Constrained10 (c :: k -> Constraint) (f :: (k -> Type) -> Type) where

Constrained10 c f means that in f m, all applications of m are to types x that satisfy constraint c.

Methods

constrained10 :: f (Dict1 c)

Recover instances of c to accompany each m element in f.

Instances

Constrained10 (c :: k -> Constraint) (U1 :: (k -> Type) -> Type)

Defined in Data.Ten.Field

Methods

constrained10 :: U1 (Dict1 c)

c a => Constrained10 (c :: k -> Constraint) (Ap10 a :: (k -> Type) -> Type)

Defined in Data.Ten.Field

Methods

constrained10 :: Ap10 a (Dict1 c)

Constrained10 c f => Constrained10 (c :: k -> Constraint) (Rec1 f :: (k -> Type) -> Type)

Defined in Data.Ten.Field

Methods

constrained10 :: Rec1 f (Dict1 c)

(Constrained10 c f, Constrained10 c g) => Constrained10 (c :: k -> Constraint) (f :*: g :: (k -> Type) -> Type)

Defined in Data.Ten.Field

Methods

constrained10 :: (f :*: g) (Dict1 c)

(Generic1 f, Constrained10 c (Rep1 f)) => Constrained10 (c :: k -> Constraint) (Wrapped1 (Generic1 :: ((k -> Type) -> Type) -> Constraint) f :: (k -> Type) -> Type)

Defined in Data.Ten.Field

Methods

constrained10 :: Wrapped1 Generic1 f (Dict1 c)

(Applicative f, Constrained10 c g) => Constrained10 (c :: k -> Constraint) (f :.: g :: (k -> Type) -> Type)

Defined in Data.Ten.Field

Methods

constrained10 :: (f :.: g) (Dict1 c)

Constrained10 c f => Constrained10 (c :: k -> Constraint) (M1 i c1 f :: (k -> Type) -> Type)

Defined in Data.Ten.Field

Methods

constrained10 :: M1 i c1 f (Dict1 c)