Data.Vinyl.ARec

Constant-time field accessors for extensible records. The trade-off is the usual lists vs arrays one: it is fast to add an element to the head of a list, but element access is linear time; array access time is uniform, but extending the array is more slower.

Documentation

data ARec (f :: k -> *) (ts :: [k])

An array-backed extensible record with constant-time field access.

Instances

(is ~ RImage rs ss, IndexWitnesses is, NatToInt (RLength rs)) => RecSubset (ARec :: (k -> Type) -> [k] -> Type) (rs :: [k]) (ss :: [k]) is

Defined in Data.Vinyl.ARec.Internal

Associated Types

type RecSubsetFCtx ARec f

Methods

rsubsetC :: forall g (f :: k0 -> Type). (Functor g, RecSubsetFCtx ARec f) => (ARec f rs -> g (ARec f rs)) -> ARec f ss -> g (ARec f ss)

rcastC :: forall (f :: k0 -> Type). RecSubsetFCtx ARec f => ARec f ss -> ARec f rs

rreplaceC :: forall (f :: k0 -> Type). RecSubsetFCtx ARec f => ARec f rs -> ARec f ss -> ARec f ss

RecElem (ARec :: (a -> Type) -> [a] -> Type) (t :: a) (t' :: a) (t ': ts :: [a]) (t' ': ts :: [a]) 'Z

Defined in Data.Vinyl.ARec.Internal

Associated Types

type RecElemFCtx ARec f

Methods

rlensC :: (Functor g, RecElemFCtx ARec f) => (f t -> g (f t')) -> ARec f (t ': ts) -> g (ARec f (t' ': ts))

rgetC :: (RecElemFCtx ARec f, t ~ t') => ARec f (t ': ts) -> f t

rputC :: RecElemFCtx ARec f => f t' -> ARec f (t ': ts) -> ARec f (t' ': ts)

(RIndex t (s ': ts) ~ 'S i, NatToInt i, RecElem (ARec :: (a -> Type) -> [a] -> Type) t t' ts ts' i) => RecElem (ARec :: (a -> Type) -> [a] -> Type) (t :: a) (t' :: a) (s ': ts :: [a]) (s ': ts' :: [a]) ('S i)

Defined in Data.Vinyl.ARec.Internal

Associated Types

type RecElemFCtx ARec f

Methods

rlensC :: (Functor g, RecElemFCtx ARec f) => (f t -> g (f t')) -> ARec f (s ': ts) -> g (ARec f (s ': ts'))

rgetC :: (RecElemFCtx ARec f, t ~ t') => ARec f (s ': ts) -> f t

rputC :: RecElemFCtx ARec f => f t' -> ARec f (s ': ts) -> ARec f (s ': ts')

(RPureConstrained (IndexableField rs) rs, RecApplicative rs, Eq (Rec f rs)) => Eq (ARec f rs)

Defined in Data.Vinyl.ARec.Internal

Methods

(==) :: ARec f rs -> ARec f rs -> Bool

(/=) :: ARec f rs -> ARec f rs -> Bool

(RPureConstrained (IndexableField rs) rs, RecApplicative rs, Ord (Rec f rs)) => Ord (ARec f rs)

Defined in Data.Vinyl.ARec.Internal

Methods

compare :: ARec f rs -> ARec f rs -> Ordering

(<) :: ARec f rs -> ARec f rs -> Bool

(<=) :: ARec f rs -> ARec f rs -> Bool

(>) :: ARec f rs -> ARec f rs -> Bool

(>=) :: ARec f rs -> ARec f rs -> Bool

max :: ARec f rs -> ARec f rs -> ARec f rs

min :: ARec f rs -> ARec f rs -> ARec f rs

(RPureConstrained (IndexableField rs) rs, RecApplicative rs, Show (Rec f rs)) => Show (ARec f rs)

Defined in Data.Vinyl.ARec.Internal

Methods

showsPrec :: Int -> ARec f rs -> ShowS

show :: ARec f rs -> String

showList :: [ARec f rs] -> ShowS

type RecSubsetFCtx (ARec :: (k -> Type) -> [k] -> Type) (f :: k -> Type)

Defined in Data.Vinyl.ARec.Internal

type RecSubsetFCtx (ARec :: (k -> Type) -> [k] -> Type) (f :: k -> Type) = ()

type RecElemFCtx (ARec :: (a -> Type) -> [a] -> Type) (f :: a -> Type)

Defined in Data.Vinyl.ARec.Internal

type RecElemFCtx (ARec :: (a -> Type) -> [a] -> Type) (f :: a -> Type) = ()

type RecElemFCtx (ARec :: (a -> Type) -> [a] -> Type) (f :: a -> Type)

Defined in Data.Vinyl.ARec.Internal

type RecElemFCtx (ARec :: (a -> Type) -> [a] -> Type) (f :: a -> Type) = ()

class NatToInt (RIndex t ts) => IndexableField ts t

Defines a constraint that lets us index into an ARec in order to produce a Rec using fromARec.

Instances

NatToInt (RIndex t ts) => IndexableField (ts :: [k]) (t :: k)

Defined in Data.Vinyl.ARec.Internal

class ToARec (us :: [k])

Minimal complete definition

aRecValues

Instances

ToARec ('[] :: [k])

Defined in Data.Vinyl.ARec.Internal

Methods

aRecValues :: forall (f :: k0 -> Type). Rec f '[] -> ARecBuilder f '[]

ToARec us => ToARec (u ': us :: [k])

Defined in Data.Vinyl.ARec.Internal

Methods

aRecValues :: forall (f :: k0 -> Type). Rec f (u ': us) -> ARecBuilder f (u ': us)

toARec :: forall f ts. (NatToInt (RLength ts), ToARec ts) => Rec f ts -> ARec f ts

Convert a Rec into an ARec for constant-time field access.

fromARec :: forall f ts. (RecApplicative ts, RPureConstrained (IndexableField ts) ts) => ARec f ts -> Rec f ts

Convert an ARec into a Rec.

aget :: forall t f ts. NatToInt (RIndex t ts) => ARec f ts -> f t

Get a field from an ARec.

arecGetSubset :: forall rs ss f. (IndexWitnesses (RImage rs ss), NatToInt (RLength rs)) => ARec f ss -> ARec f rs

Get a subset of a record's fields.

arecSetSubset :: forall rs ss f. IndexWitnesses (RImage rs ss) => ARec f ss -> ARec f rs -> ARec f ss

Set a subset of a larger record's fields to all of the fields of a smaller record.

arecRepsMatchCoercion :: AllRepsMatch f xs g ys => Coercion (ARec f xs) (ARec g ys)

Given that xs and ys have the same length, and mapping f over xs and g over ys produces lists whose elements are pairwise Coercible, ARec f xs and ARec g ys are Coercible.

arecConsMatchCoercion :: (forall (x :: k). Coercible (f x) (g x)) => Coercion (ARec f xs) (ARec g xs)

Given that forall x. Coercible (f x) (g x), produce a coercion from ARec f xs to ARec g xs. While the constraint looks a lot like Coercible f g, it is actually weaker.