Data.Diverse.Many.Internal

Many type

newtype Many xs

A Many is an anonymous product type (also know as polymorphic record), with no limit on the number of fields.

The following functions are available can be used to manipulate unique fields

• getter/setter for single field: fetch and replace
• getter/setter for multiple fields: select and amend
• folds: forMany or collect

These functions are type specified. This means labels are not required because the types themselves can be used to access the 'Many. It is a compile error to use those functions for duplicate fields.

For duplicate fields, Nat-indexed versions of the functions are available:

• getter/setter for single field: fetchN and replaceN
• getter/setter for multiple fields: selectN and amendN
• folds: forManyN or collectN

Encoding: The record is encoded as (S.Seq Any). This encoding should reasonabily efficient for any number of fields.

The map Key is index + offset of the type in the typelist. The Offset is used to allow efficient cons prefix.

Key = Index of type in typelist + Offset

The constructor will guarantee the correct number and types of the elements. The constructor is only exported in the Data.Diverse.Many.Internal module

Constructors

Many (Seq Any)

Instances

AFunctor Many_ c as => AFunctor Many c as

Given a Case that transforms each type in the typelist, convert a Many xs to Many (CaseResults c xs)

Methods

afmap :: c as -> Many as -> Many (CaseResults * * c as)

Eq (Many_ xs) => Eq (Many xs)

Two Manys are equal if all their fields equal

Methods

(==) :: Many xs -> Many xs -> Bool

(/=) :: Many xs -> Many xs -> Bool

Ord (Many_ xs) => Ord (Many xs)

Two Manys are ordered by compareing their fields in index order

Methods

compare :: Many xs -> Many xs -> Ordering

(<) :: Many xs -> Many xs -> Bool

(<=) :: Many xs -> Many xs -> Bool

(>) :: Many xs -> Many xs -> Bool

(>=) :: Many xs -> Many xs -> Bool

max :: Many xs -> Many xs -> Many xs

min :: Many xs -> Many xs -> Many xs

Read (Many_ xs) => Read (Many xs)

read "5 . False . X . Just O . nil" == (5 :: Int) ./ False ./ 'X' ./ Just 'O' ./ nil

Methods

readsPrec :: Int -> ReadS (Many xs)

readList :: ReadS [Many xs]

readPrec :: ReadPrec (Many xs)

readListPrec :: ReadPrec [Many xs]

Show (Many_ xs) => Show (Many xs)

show (5 :: Int) ./ False ./ 'X' ./ Just 'O' ./ nil == "5 . False . X . Just O . nil" ==

Methods

showsPrec :: Int -> Many xs -> ShowS

show :: Many xs -> String

showList :: [Many xs] -> ShowS

Generic (Many ((:) Type x xs))

A Generic instance encoded as the front value :*: with the aft Many. The C1 and S1 metadata are not encoded.

Associated Types

type Rep (Many ((:) Type x xs)) :: * -> *

Methods

from :: Many ((Type ': x) xs) -> Rep (Many ((Type ': x) xs)) x

to :: Rep (Many ((Type ': x) xs)) x -> Many ((Type ': x) xs)

Generic (Many ([] Type))

A terminating Generic instance encoded as a nil.

Associated Types

type Rep (Many ([] Type)) :: * -> *

Methods

from :: Many [Type] -> Rep (Many [Type]) x

to :: Rep (Many [Type]) x -> Many [Type]

Semigroup (Many_ xs) => Semigroup (Many xs)

Methods

(<>) :: Many xs -> Many xs -> Many xs

sconcat :: NonEmpty (Many xs) -> Many xs

stimes :: Integral b => b -> Many xs -> Many xs

Monoid (Many_ xs) => Monoid (Many xs)

Methods

mempty :: Many xs

mappend :: Many xs -> Many xs -> Many xs

mconcat :: [Many xs] -> Many xs

(NFData x, NFData (Many xs)) => NFData (Many ((:) * x xs))

Methods

rnf :: Many ((* ': x) xs) -> ()

NFData (Many ([] Type))

Methods

rnf :: Many [Type] -> ()

type Rep (Many ((:) Type x xs))

type Rep (Many ((:) Type x xs)) = (:*:) (Rec0 x) (Rec0 (Many xs))

type Rep (Many ([] Type))

type Rep (Many ([] Type)) = U1

Isomorphism

class IsMany t xs a where

This instance allows converting to and from Many There are instances for converting tuples of up to size 15.

Minimal complete definition

toMany, fromMany

Methods

toMany :: t xs a -> Many xs

fromMany :: Many xs -> t xs a

Instances

IsMany * (Tagged [Type]) ([] Type) ()

These instances add about 7 seconds to the compile time!

Methods

toMany :: [Type] () a -> Many ()

fromMany :: Many () -> [Type] () a

IsMany * (Tagged [Type]) ((:) Type a ([] Type)) a

This single field instance is the reason for Tagged wrapper. Otherwise this instance will overlap.

Methods

toMany :: (Type ': a) [Type] a a -> Many a

fromMany :: Many a -> (Type ': a) [Type] a a

IsMany * (Tagged [Type]) ((:) Type a ((:) Type b ([] Type))) (a, b)

Methods

toMany :: (Type ': a) ((Type ': b) [Type]) (a, b) a -> Many (a, b)

fromMany :: Many (a, b) -> (Type ': a) ((Type ': b) [Type]) (a, b) a

IsMany * (Tagged [Type]) ((:) Type a ((:) Type b ((:) Type c ([] Type)))) (a, b, c)

Methods

toMany :: (Type ': a) ((Type ': b) ((Type ': c) [Type])) (a, b, c) a -> Many (a, b, c)

fromMany :: Many (a, b, c) -> (Type ': a) ((Type ': b) ((Type ': c) [Type])) (a, b, c) a

IsMany * (Tagged [Type]) ((:) Type a ((:) Type b ((:) Type c ((:) Type d ([] Type))))) (a, b, c, d)

Methods

toMany :: (Type ': a) ((Type ': b) ((Type ': c) ((Type ': d) [Type]))) (a, b, c, d) a -> Many (a, b, c, d)

fromMany :: Many (a, b, c, d) -> (Type ': a) ((Type ': b) ((Type ': c) ((Type ': d) [Type]))) (a, b, c, d) a

IsMany * (Tagged [Type]) ((:) Type a ((:) Type b ((:) Type c ((:) Type d ((:) Type e ([] Type)))))) (a, b, c, d, e)

Methods

toMany :: (Type ': a) ((Type ': b) ((Type ': c) ((Type ': d) ((Type ': e) [Type])))) (a, b, c, d, e) a -> Many (a, b, c, d, e)

fromMany :: Many (a, b, c, d, e) -> (Type ': a) ((Type ': b) ((Type ': c) ((Type ': d) ((Type ': e) [Type])))) (a, b, c, d, e) a

IsMany * (Tagged [Type]) ((:) Type a ((:) Type b ((:) Type c ((:) Type d ((:) Type e ((:) Type f ([] Type))))))) (a, b, c, d, e, f)

Methods

toMany :: (Type ': a) ((Type ': b) ((Type ': c) ((Type ': d) ((Type ': e) ((Type ': f) [Type]))))) (a, b, c, d, e, f) a -> Many (a, b, c, d, e, f)

fromMany :: Many (a, b, c, d, e, f) -> (Type ': a) ((Type ': b) ((Type ': c) ((Type ': d) ((Type ': e) ((Type ': f) [Type]))))) (a, b, c, d, e, f) a

IsMany * (Tagged [Type]) ((:) Type a ((:) Type b ((:) Type c ((:) Type d ((:) Type e ((:) Type f ((:) Type g ([] Type)))))))) (a, b, c, d, e, f, g)

Methods

toMany :: (Type ': a) ((Type ': b) ((Type ': c) ((Type ': d) ((Type ': e) ((Type ': f) ((Type ': g) [Type])))))) (a, b, c, d, e, f, g) a -> Many (a, b, c, d, e, f, g)

fromMany :: Many (a, b, c, d, e, f, g) -> (Type ': a) ((Type ': b) ((Type ': c) ((Type ': d) ((Type ': e) ((Type ': f) ((Type ': g) [Type])))))) (a, b, c, d, e, f, g) a

IsMany * (Tagged [Type]) ((:) Type a ((:) Type b ((:) Type c ((:) Type d ((:) Type e ((:) Type f ((:) Type g ((:) Type h ([] Type))))))))) (a, b, c, d, e, f, g, h)

Methods

toMany :: (Type ': a) ((Type ': b) ((Type ': c) ((Type ': d) ((Type ': e) ((Type ': f) ((Type ': g) ((Type ': h) [Type]))))))) (a, b, c, d, e, f, g, h) a -> Many (a, b, c, d, e, f, g, h)

fromMany :: Many (a, b, c, d, e, f, g, h) -> (Type ': a) ((Type ': b) ((Type ': c) ((Type ': d) ((Type ': e) ((Type ': f) ((Type ': g) ((Type ': h) [Type]))))))) (a, b, c, d, e, f, g, h) a

IsMany * (Tagged [Type]) ((:) Type a ((:) Type b ((:) Type c ((:) Type d ((:) Type e ((:) Type f ((:) Type g ((:) Type h ((:) Type i ([] Type)))))))))) (a, b, c, d, e, f, g, h, i)

Methods

toMany :: (Type ': a) ((Type ': b) ((Type ': c) ((Type ': d) ((Type ': e) ((Type ': f) ((Type ': g) ((Type ': h) ((Type ': i) [Type])))))))) (a, b, c, d, e, f, g, h, i) a -> Many (a, b, c, d, e, f, g, h, i)

fromMany :: Many (a, b, c, d, e, f, g, h, i) -> (Type ': a) ((Type ': b) ((Type ': c) ((Type ': d) ((Type ': e) ((Type ': f) ((Type ': g) ((Type ': h) ((Type ': i) [Type])))))))) (a, b, c, d, e, f, g, h, i) a

IsMany * (Tagged [Type]) ((:) Type a ((:) Type b ((:) Type c ((:) Type d ((:) Type e ((:) Type f ((:) Type g ((:) Type h ((:) Type i ((:) Type j ([] Type))))))))))) (a, b, c, d, e, f, g, h, i, j)

Methods

toMany :: (Type ': a) ((Type ': b) ((Type ': c) ((Type ': d) ((Type ': e) ((Type ': f) ((Type ': g) ((Type ': h) ((Type ': i) ((Type ': j) [Type]))))))))) (a, b, c, d, e, f, g, h, i, j) a -> Many (a, b, c, d, e, f, g, h, i, j)

fromMany :: Many (a, b, c, d, e, f, g, h, i, j) -> (Type ': a) ((Type ': b) ((Type ': c) ((Type ': d) ((Type ': e) ((Type ': f) ((Type ': g) ((Type ': h) ((Type ': i) ((Type ': j) [Type]))))))))) (a, b, c, d, e, f, g, h, i, j) a

IsMany * (Tagged [Type]) ((:) Type a ((:) Type b ((:) Type c ((:) Type d ((:) Type e ((:) Type f ((:) Type g ((:) Type h ((:) Type i ((:) Type j ((:) Type k ([] Type)))))))))))) (a, b, c, d, e, f, g, h, i, j, k)

Methods

toMany :: (Type ': a) ((Type ': b) ((Type ': c) ((Type ': d) ((Type ': e) ((Type ': f) ((Type ': g) ((Type ': h) ((Type ': i) ((Type ': j) ((Type ': k) [Type])))))))))) (a, b, c, d, e, f, g, h, i, j, k) a -> Many (a, b, c, d, e, f, g, h, i, j, k)

fromMany :: Many (a, b, c, d, e, f, g, h, i, j, k) -> (Type ': a) ((Type ': b) ((Type ': c) ((Type ': d) ((Type ': e) ((Type ': f) ((Type ': g) ((Type ': h) ((Type ': i) ((Type ': j) ((Type ': k) [Type])))))))))) (a, b, c, d, e, f, g, h, i, j, k) a

IsMany * (Tagged [Type]) ((:) Type a ((:) Type b ((:) Type c ((:) Type d ((:) Type e ((:) Type f ((:) Type g ((:) Type h ((:) Type i ((:) Type j ((:) Type k ((:) Type l ([] Type))))))))))))) (a, b, c, d, e, f, g, h, i, j, k, l)

Methods

toMany :: (Type ': a) ((Type ': b) ((Type ': c) ((Type ': d) ((Type ': e) ((Type ': f) ((Type ': g) ((Type ': h) ((Type ': i) ((Type ': j) ((Type ': k) ((Type ': l) [Type]))))))))))) (a, b, c, d, e, f, g, h, i, j, k, l) a -> Many (a, b, c, d, e, f, g, h, i, j, k, l)

fromMany :: Many (a, b, c, d, e, f, g, h, i, j, k, l) -> (Type ': a) ((Type ': b) ((Type ': c) ((Type ': d) ((Type ': e) ((Type ': f) ((Type ': g) ((Type ': h) ((Type ': i) ((Type ': j) ((Type ': k) ((Type ': l) [Type]))))))))))) (a, b, c, d, e, f, g, h, i, j, k, l) a

IsMany * (Tagged [Type]) ((:) Type a ((:) Type b ((:) Type c ((:) Type d ((:) Type e ((:) Type f ((:) Type g ((:) Type h ((:) Type i ((:) Type j ((:) Type k ((:) Type l ((:) Type m ([] Type)))))))))))))) (a, b, c, d, e, f, g, h, i, j, k, l, m)

Methods

toMany :: (Type ': a) ((Type ': b) ((Type ': c) ((Type ': d) ((Type ': e) ((Type ': f) ((Type ': g) ((Type ': h) ((Type ': i) ((Type ': j) ((Type ': k) ((Type ': l) ((Type ': m) [Type])))))))))))) (a, b, c, d, e, f, g, h, i, j, k, l, m) a -> Many (a, b, c, d, e, f, g, h, i, j, k, l, m)

fromMany :: Many (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (Type ': a) ((Type ': b) ((Type ': c) ((Type ': d) ((Type ': e) ((Type ': f) ((Type ': g) ((Type ': h) ((Type ': i) ((Type ': j) ((Type ': k) ((Type ': l) ((Type ': m) [Type])))))))))))) (a, b, c, d, e, f, g, h, i, j, k, l, m) a

IsMany * (Tagged [Type]) ((:) Type a ((:) Type b ((:) Type c ((:) Type d ((:) Type e ((:) Type f ((:) Type g ((:) Type h ((:) Type i ((:) Type j ((:) Type k ((:) Type l ((:) Type m ((:) Type n ([] Type))))))))))))))) (a, b, c, d, e, f, g, h, i, j, k, l, m, n)

Methods

toMany :: (Type ': a) ((Type ': b) ((Type ': c) ((Type ': d) ((Type ': e) ((Type ': f) ((Type ': g) ((Type ': h) ((Type ': i) ((Type ': j) ((Type ': k) ((Type ': l) ((Type ': m) ((Type ': n) [Type]))))))))))))) (a, b, c, d, e, f, g, h, i, j, k, l, m, n) a -> Many (a, b, c, d, e, f, g, h, i, j, k, l, m, n)

fromMany :: Many (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (Type ': a) ((Type ': b) ((Type ': c) ((Type ': d) ((Type ': e) ((Type ': f) ((Type ': g) ((Type ': h) ((Type ': i) ((Type ': j) ((Type ': k) ((Type ': l) ((Type ': m) ((Type ': n) [Type]))))))))))))) (a, b, c, d, e, f, g, h, i, j, k, l, m, n) a

IsMany * (Tagged [Type]) ((:) Type a ((:) Type b ((:) Type c ((:) Type d ((:) Type e ((:) Type f ((:) Type g ((:) Type h ((:) Type i ((:) Type j ((:) Type k ((:) Type l ((:) Type m ((:) Type n ((:) Type o ([] Type)))))))))))))))) (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o)

Methods

toMany :: (Type ': a) ((Type ': b) ((Type ': c) ((Type ': d) ((Type ': e) ((Type ': f) ((Type ': g) ((Type ': h) ((Type ': i) ((Type ': j) ((Type ': k) ((Type ': l) ((Type ': m) ((Type ': n) ((Type ': o) [Type])))))))))))))) (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) a -> Many (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o)

fromMany :: Many (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (Type ': a) ((Type ': b) ((Type ': c) ((Type ': d) ((Type ': e) ((Type ': f) ((Type ': g) ((Type ': h) ((Type ': i) ((Type ': j) ((Type ': k) ((Type ': l) ((Type ': m) ((Type ': n) ((Type ': o) [Type])))))))))))))) (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) a

fromMany' :: IsMany Tagged xs a => Many xs -> a

Converts from a Many to a value (eg a tuple), via a Tagged wrapper

toMany' :: IsMany Tagged xs a => a -> Many xs

Converts from a value (eg a tuple) to a Many, via a Tagged wrapper

Construction

nil :: Many '[]

Analogous to null. Named nil to avoid conflicting with null.

single :: x -> Many '[x]

Create a Many from a single value. Analogous to singleton

prefix :: x -> Many xs -> Many (x ': xs) infixr 5

Add an element to the left of a Many. Not named cons to avoid conflict with cons

(./) :: x -> Many xs -> Many (x ': xs) infixr 5

Infix version of prefix.

Mnemonic: Element on the left is smaller ./ than the larger Many to the right.

postfix :: Many xs -> y -> Many (Append xs '[y]) infixl 5

Add an element to the right of a Many Not named snoc to avoid conflict with snoc

postfix' :: forall y xs n. MaybeUniqueMemberAt n y xs => Many xs -> y -> Many (SnocUnique xs y) infixl 5

Add an element to the right of a Many iff the field doesn't already exist.

(\.) :: Many xs -> y -> Many (Append xs '[y]) infixl 5

Infix version of postfix.

Mnemonic: Many is larger \. than the smaller element

append :: Many xs -> Many ys -> Many (Append xs ys) infixr 5

Appends two Manys together

class CanAppendUnique xs ys where

Minimal complete definition

append'

Methods

append' :: Many xs -> Many ys -> Many (AppendUnique xs ys) infixr 5

Appends the unique fields fields from the right Many using postfix'

Instances

CanAppendUnique xs ([] Type)

Methods

append' :: Many xs -> Many [Type] -> Many (AppendUnique Type xs [Type])

(MaybeUniqueMemberAt Type n y xs, CanAppendUnique (SnocUnique Type xs y) ys, (~) [Type] (AppendUnique Type (SnocUnique Type xs y) ys) (AppendUnique Type xs ((:) Type y ys))) => CanAppendUnique xs ((:) Type y ys)

Methods

append' :: Many xs -> Many ((Type ': y) ys) -> Many (AppendUnique Type xs ((Type ': y) ys))

(/./) :: Many xs -> Many ys -> Many (Append xs ys) infixr 5

Infix version of append.

Mnemonic: prefix ./ with an extra slash (meaning Many) in front.

Simple queries

viewf :: Many (x ': xs) -> (x, Many xs)

Split a non-empty Many into the first element, then the rest of the Many. Analogous to viewl

viewb :: Many (x ': xs) -> (Many (Init (x ': xs)), Last (x ': xs))

Split a non-empty Many into initial part of Many, and the last element. Analogous to viewr

front :: Many (x ': xs) -> x

Extract the first element of a Many, which guaranteed to be non-empty. Analogous to head

back :: Many (x ': xs) -> Last (x ': xs)

Extract the back element of a Many, which guaranteed to be non-empty. Analogous to last

aft :: Many (x ': xs) -> Many xs

Extract the elements after the front of a Many, which guaranteed to be non-empty. Analogous to tail

fore :: Many (x ': xs) -> Many (Init (x ': xs))

Return all the elements of a Many except the back one, which guaranteed to be non-empty. Analogous to init

Single field

Getter for single field

fetch :: forall x xs. UniqueMember x xs => Many xs -> x

Getter by unique type. Get the field with type x.

let x = (5 :: Int) ./ False ./ 'X' ./ Just 'O' ./ nil
fetch @Int x `shouldBe` 5

fetchL :: forall l x xs proxy. (UniqueLabelMember l xs, x ~ KindAtLabel l xs) => proxy l -> Many xs -> x

Getter by label. Get the value of the field with tag label which can be any type not just KnownSymbol.

let y = False ./ Tagged @Foo 'X' ./ Tagged @Hi True ./ nil
fetchL @Foo Proxy y `shouldBe` Tagged @Foo 'X'
fetchL @Hi Proxy y `shouldBe` Tagged @Hi True

fetchN :: forall n x xs proxy. MemberAt n x xs => proxy n -> Many xs -> x

Getter by index. Get the value of the field at index type-level Nat n

let x = (5 :: Int) ./ False ./ 'X' ./ Just 'O' ./ nil
fetchN @1 Proxy x `shouldBe` False

Setter for single field

replace :: forall x xs. UniqueMember x xs => Many xs -> x -> Many xs

Setter by unique type. Set the field with type x.

let x = (5 :: Int) ./ False ./ 'X' ./ Just 'O' ./ nil
replace @Int x 6 `shouldBe` (6 :: Int) ./ False ./ 'X' ./ Just 'O' ./ nil

replace' :: forall x y xs proxy. UniqueMember x xs => proxy x -> Many xs -> y -> Many (Replace x y xs)

Polymorphic setter by unique type. Set the field with type x, and replace with type y

let x = (5 :: Int) ./ False ./ 'X' ./ Just 'O' ./ nil
replace' @Int Proxy x (Just True) `shouldBe` Just True ./ False ./ 'X' ./ Just 'O' ./ nil

replaceL :: forall l x xs proxy. (UniqueLabelMember l xs, x ~ KindAtLabel l xs) => proxy l -> Many xs -> x -> Many xs

Setter by unique label. Set the field with label l.

let y = (5 :: Int) ./ False ./ Tagged @Foo 'X' ./ Tagged @"Hello" (6 :: Int) ./ nil
replaceL @Foo Proxy y (Tagged @Foo 'Y') `shouldBe`
    (5 :: Int) ./ False ./ Tagged @Foo 'Y' ./ Tagged @"Hello" (6 :: Int) ./ nil
replaceL @"Hello" Proxy y (Tagged @"Hello" 7) `shouldBe`
    (5 :: Int) ./ False ./ Tagged @Foo 'X' ./ Tagged @"Hello" (7 :: Int) ./ nil

replaceL' :: forall l x y xs proxy. (UniqueLabelMember l xs, x ~ KindAtLabel l xs) => proxy l -> Many xs -> y -> Many (Replace x y xs)

Polymorphic setter by unique type. Set the field with type x, and replace with type y

let y = (5 :: Int) ./ False ./ Tagged @Foo 'X' ./ Tagged @"Hello" (6 :: Int) ./ nil
replaceL' @Foo Proxy y (Tagged @Bar 'Y') shouldBe
    (5 :: Int) ./ False ./ Tagged Bar Y ./ Tagged Hello (6 :: Int) ./ nil
replaceL' @"Hello" Proxy y (Tagged @"Hello" False) `shouldBe`
    (5 :: Int) ./ False ./ Tagged @Foo 'X' ./ Tagged @"Hello" False ./ nil

replaceN :: forall n x y xs proxy. MemberAt n x xs => proxy n -> Many xs -> y -> Many xs

Setter by index. Set the value of the field at index type-level Nat n

let x = (5 :: Int) ./ False ./ 'X' ./ Just 'O' ./ nil
replaceN @0 Proxy x 7 shouldBe

replaceN' :: forall n x y xs proxy. MemberAt n x xs => proxy n -> Many xs -> y -> Many (ReplaceIndex n y xs)

Polymorphic version of replaceN

Multiple fields

Getter for multiple fields

type Select smaller larger = AFoldable (CollectorAny (CaseSelect smaller larger) larger) (Maybe (Int, WrappedAny))

A friendlier type constraint synomyn for select

select :: forall smaller larger. Select smaller larger => Many larger -> Many smaller

Construct a Many with a smaller number of fields than the original. Analogous to fetch getter but for multiple fields.

This can also be used to reorder fields in the original Many.

let x = (5 :: Int) ./ False ./ 'X' ./ Just 'O' ./ (6 :: Int) ./ Just 'A' ./ nil
select @'[Bool, Char] x `shouldBe` False ./ 'X' ./ nil

selectL :: forall ls smaller larger proxy. (Select smaller larger, smaller ~ KindsAtLabels ls larger, IsDistinct ls, UniqueLabels ls larger) => proxy ls -> Many larger -> Many smaller

A variation of select which selects by labels

let x = False ./ Tagged @"Hi" (5 :: Int) ./ Tagged @Foo False ./ Tagged @Bar 'X' ./ Tagged @"Bye" O ./ nil
selectL @'[Foo, Bar] Proxy x `shouldBe` Tagged @Foo False ./ Tagged @Bar 'X' ./ nil
selectL @'["Hi", "Bye"] Proxy x `shouldBe` Tagged @"Hi" (5 :: Int) ./ Tagged @"Bye" 'O' ./ nil

type SelectN ns smaller larger = (AFoldable (CollectorAnyN (CaseSelectN ns smaller) 0 larger) (Maybe (Int, WrappedAny)), smaller ~ KindsAtIndices ns larger, IsDistinct ns)

A friendlier type constraint synomyn for selectN

selectN :: forall ns smaller larger proxy. SelectN ns smaller larger => proxy ns -> Many larger -> Many smaller

A variation of select which uses a Nat list n to specify how to reorder the fields, where

indices[branch_idx] = tree_idx@

This variation allows smaller or larger to contain indistinct since the mapping is specified by indicies.

let x = (5 :: Int) ./ False ./ 'X' ./ Just 'O' ./ (6 :: Int) ./ Just 'A' ./ nil
selectN (Proxy @'[5, 4, 0]) x `shouldBe` Just 'A' ./ (6 :: Int) ./ (5 ::Int) ./ nil

Setter for multiple fields

type Amend smaller larger = (AFoldable (CollectorAny (CaseAmend larger) smaller) (Int, WrappedAny), IsDistinct smaller)

A friendlier type constraint synomyn for amend

amend :: forall smaller larger. Amend smaller larger => Many larger -> Many smaller -> Many larger

Sets the subset of Many in the larger Many. Analogous to replace setter but for multiple fields.

let x = (5 :: Int) ./ False ./ 'X' ./ Just 'O' ./ nil
amend @'[Int, Maybe Char] x ((6 :: Int) ./ Just 'P' ./ nil) `shouldBe`
    (6 :: Int) ./ False ./ 'X' ./ Just 'P' ./ nil

type Amend' smaller smaller' larger = (AFoldable (CollectorAny (CaseAmend' larger) (Zip smaller smaller')) (Int, WrappedAny), IsDistinct smaller)

A friendlier type constraint synomyn for amend'

amend' :: forall smaller smaller' larger proxy. Amend' smaller smaller' larger => proxy smaller -> Many larger -> Many smaller' -> Many (Replaces smaller smaller' larger)

amendL :: forall ls smaller larger proxy. (Amend smaller larger, smaller ~ KindsAtLabels ls larger, IsDistinct ls, UniqueLabels ls larger) => proxy ls -> Many larger -> Many smaller -> Many larger

A variation of amend which amends via labels.

let x = False . Tagged @"Hi" (5 :: Int) . Tagged @Foo False . Tagged @Bar 'X' . Tagged @"Bye" 'O' ./ nil
amendL @'[Foo, Bar] Proxy x (Tagged @Foo True . Tagged @Bar 'Y' . nil) shouldBe
    False . Tagged @"Hi" (5 :: Int) . Tagged @Foo True . Tagged @Bar 'Y' . Tagged @"Bye" 'O' ./ nil
amendL @'["Hi", "Bye"] Proxy x (Tagged @"Hi" (6 :: Int) . Tagged @"Bye" 'P' . nil) shouldBe
    False . Tagged @"Hi" (6 :: Int) . Tagged @Foo False . Tagged @Bar 'X' . Tagged @"Bye" 'P' ./ nil

amendL' :: forall ls smaller smaller' larger proxy. (Amend' smaller smaller' larger, smaller ~ KindsAtLabels ls larger, IsDistinct ls, UniqueLabels ls larger) => proxy ls -> Many larger -> Many smaller' -> Many (Replaces smaller smaller' larger)

A variation of amend which amends via labels.

let x = False ./ Tagged @"Hi" (5 :: Int) ./ Tagged @Foo False ./ Tagged @Bar X ./ Tagged @"Bye" 'O' ./ nil
amendL' @'[Foo, Bar] Proxy x ('Y' ./ True ./ nil) `shouldBe`
    False ./ Tagged @"Hi" (5 :: Int) ./ 'Y' ./ True ./ Tagged @"Bye" 'O' ./ nil
amendL' @'["Hi", "Bye"] Proxy x (True ./ Tagged @"Changed" True ./ nil) `shouldBe`
    False ./ True ./ Tagged @Foo False ./ Tagged @Bar 'X' ./ Tagged @"Changed" True ./ nil

type AmendN ns smaller larger = (AFoldable (CollectorAnyN (CaseAmendN ns larger) 0 smaller) (Int, WrappedAny), smaller ~ KindsAtIndices ns larger, IsDistinct ns)

A friendlier type constraint synomyn for amendN

amendN :: forall ns smaller larger proxy. AmendN ns smaller larger => proxy ns -> Many larger -> Many smaller -> Many larger

A variation of amend which uses a Nat list n to specify how to reorder the fields, where

indices[branch_idx] = tree_idx@

This variation allows smaller or larger to contain indistinct since the mapping is specified by indicies.

let x = (5 :: Int) ./ False ./ 'X' ./ Just 'O' ./ (6 :: Int) ./ Just 'A' ./ nil
amendN (Proxy @'[5, 4, 0]) x (Just 'B' ./ (8 :: Int) ./ (4 ::Int) ./ nil) `shouldBe`
    (4 :: Int) ./ False ./ 'X' ./ Just 'O' ./ (8 :: Int) ./ Just 'B' ./ nil

type AmendN' ns smaller smaller' larger = (AFoldable (CollectorAnyN (CaseAmendN' ns larger) 0 (Zip smaller smaller')) (Int, WrappedAny), smaller ~ KindsAtIndices ns larger, IsDistinct ns)

A friendlier type constraint synomyn for amendN

amendN' :: forall ns smaller smaller' larger proxy. AmendN' ns smaller smaller' larger => proxy ns -> Many larger -> Many smaller' -> Many (ReplacesIndex ns smaller' larger)

A polymorphic variation of amendN

Destruction

By type

type Collect c r xs = (AFoldable (Collector c xs) r, Case (c r) xs)

A friendlier type constraint synomyn for collect and forMany

data Collector c xs r

Collects the output from case'ing each field in a Many. Uses Reiterate to prepare the Case to accept the next type in the xs typelist.

Internally, this holds the left-over [(k, v)] from the original Many for the remaining typelist xs.

That is, the first v in the (k, v) is of type x, and the length of the list is equal to the length of xs.

Instances

(Case (c r) ((:) Type x xs), Reiterate (c r) ((:) Type x xs), AFoldable (Collector * c xs) r, (~) * r (CaseResult * Type (c r) x)) => AFoldable (Collector * c ((:) Type x xs)) r

Folds values by reiterateing Cases through the xs typelist.

Methods

afoldr :: (r -> b -> b) -> b -> Collector * c ((Type ': x) xs) r -> b

AFoldable (Collector * c ([] Type)) r

nill case that doesn't even use case', so that an instance of Case '[] is not needed.

Methods

afoldr :: (r -> b -> b) -> b -> Collector * c [Type] r -> b

forMany :: Collect c r xs => c r xs -> Many xs -> Collector c xs r

Folds any Many, even with indistinct types. Given distinct handlers for the fields in Many, create AFoldable of the results of running the handlers over the fields in Many.

let x = (5 :: Int) ./ False ./ 'X' ./ Just 'O' ./ (6 :: Int) ./ Just 'A' ./ nil
    y = show @Int ./ show @Char ./ show @(Maybe Char) ./ show @Bool ./ nil
afoldr (:) [] (forMany (cases y) x) `shouldBe`
    ["5", "False", "'X'", "Just 'O'", "6", "Just 'A'"]

collect :: Collect c r xs => Many xs -> c r xs -> Collector c xs r

This is flip forMany

let x = (5 :: Int) ./ False ./ 'X' ./ Just 'O' ./ (6 :: Int) ./ Just 'A' ./ nil
    y = show @Int ./ show @Char ./ show @(Maybe Char) ./ show @Bool ./ nil
afoldr (:) [] (collect x (cases y)) `shouldBe`
    ["5", "False", "'X'", "Just 'O'", "6", "Just 'A'"]

By Nat index offset

type CollectN c r n xs = (AFoldable (CollectorN c n xs) r, Case (c r n) xs)

A friendlier type constraint synomyn for collect and forMany

data CollectorN c n xs r

A variation of Collector which uses ReiterateN instead of Reiterate

Instances

(Case (c r n) ((:) Type x xs), ReiterateN (c r) n ((:) Type x xs), AFoldable (CollectorN * c ((+) n 1) xs) r, (~) * r (CaseResult * Type (c r n) x)) => AFoldable (CollectorN * c n ((:) Type x xs)) r

Folds values by reiterateing Emitters through the xs typelist.

Methods

afoldr :: (r -> b -> b) -> b -> CollectorN * c n ((Type ': x) xs) r -> b

AFoldable (CollectorN * c n ([] Type)) r

nill case that doesn't even use case', so that an instance of Case '[] is not needed.

Methods

afoldr :: (r -> b -> b) -> b -> CollectorN * c n [Type] r -> b

forManyN :: CollectN c r n xs => c r n xs -> Many xs -> CollectorN c n xs r

Folds any Many, even with indistinct types. Given index handlers for the fields in Many, create AFoldable of the results of running the handlers over the fields in Many.

let x = (5 :: Int) ./ False ./ 'X' ./ Just 'O' ./ (6 :: Int) ./ Just 'A' ./ nil
    y = show @Int ./ show @Bool ./ show @Char ./ show @(Maybe Char) ./ show @Int ./ show @(Maybe Char) ./ nil
afoldr (:) [] (forManyN (casesN y) x) `shouldBe`
    ["5", "False", "'X'", "Just 'O'", "6", "Just 'A'"]

collectN :: CollectN c r n xs => Many xs -> c r n xs -> CollectorN c n xs r

This is flip forManyN

let x = (5 :: Int) ./ False ./ 'X' ./ Just 'O' ./ (6 :: Int) ./ Just 'A' ./ nil
    y = show @Int ./ show @Bool ./ show @Char ./ show @(Maybe Char) ./ show @Int ./ show @(Maybe Char) ./ nil
afoldr (:) [] (collectN x (casesN y)) `shouldBe`
    ["5", "False", "'X'", "Just 'O'", "6", "Just 'A'"]