(      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMN O P Q R S T U V W X Y Z [ \ ] ^ _ ` a b c d e f g h i j k l m n o p q r s t u v w x y z { | } ~                                   ! " # $ % & ' Safe>?f@Constrained Foldable for a specified type instead for all types.Safe->?FTConvert something v into rg using handlers. This class is required in order to step through all the different types in a variant.Safe,-FST(xZips up xs and ys, which must be the same length The typelist xs replaced by ys at the indices ns. ns and ys must be the same length. ns must be within bounds of xs The type x replaced by an y if an n matches i.  The typelist zs with the first xs replaced by ys. xs must be the same size as ys  The typelist xs with the first x replaced by y. It is okay for x not to exist in xs  The typelist xs with the type at Nat n replaced by y. n must be within bounds of xs  The typelist xs without the type at Nat n. n must be within bounds of xs )Ensures two typelists are the same lengthLabelled access into the listIndexed access into the listEnsures that the label in tagged label v only ever appears once in xs. Ensures that x only ever appears once in xsEEnsures that the type list contain unique types. Not implemented as  (xs ~ Nub xs) for better type error messages.&Errors if a label exists in a typelist%Errors if a type exists in a typelistSearches for y in ys if not found, than use y, and repeat search with next (y ': ys) in ctx else if found, then don't use y, then repeat search with next (y ': ys) in ctx)Get the first index of a type from a listBGet the first position of a type (indexed by 1) Will return 0 if x doesn't exists in xs.  Safe +,-<FSTOY%9Tests if all the types in a typelist satisfy a constraint'Return a list of results from applying  to every type in the xs typelist.The result from evaluating a Case with a type from a typelist.XTakes two lists which must be the same length and returns a list of corresponding pairs.!Returns the typelist without the   type Returns a xs appended with ys-Set complement. Returns the set of things in xs that are not in ys.)Ensures two typelists are the same length! Get the first type in a typelist"Get the typelist without the ! type# The typelist xs replaced by ys at the indices ns. ns and ys must be the same length. ns must be within bounds of xs$ The typelist xs without the type at Nat n replaced by y. n must be within bounds of xs% The typelist xs without the type at Nat n. n must be within bounds of xs& The typelist zs with the first xs replaced by ys. xs must be the same size as ys' The typelist xs with the first x replaced by y. It is okay for x not to exist in xs( The typelist xs without first x. It is okay for x not to exist in xs)Get the types with labels ls from xs*!Get the types at an list of index+\It's actually ok for the position to be zero, but if it's not zero then the types must match,Get the type at a label-Get the type at an index.VGet the first index of a type (Indexed by 1) Will return 0 if x doesn't exists in xs./aGet the first index of a type (Indexed by 0) Will result in type error if x doesn't exist in xs.0Ensures that the label list all 1s1Ensures that the label in tagged label v only ever appears once in xs.2 Ensures that x only ever appears once in xs3/Return the list of distinct types in a typelist4/Ensures that the type list contain unique types5 Ensures x is a unique member in xs iff it exists in ys6 For each y in ys, snocs them to end of xs if y doesn't already exist in xs7Snoc x to end of xs if x doesn't already exist in xs8 Ensures that x is a member of xs at n if it exists, and that ( can be used.9 Ensures that x is a member of xs at n , and that ( can be used.: Ensures that x is a unique member of xs if it exists, and that ( can be used.; Ensures that x is a unique member of xs , and that ( can be used.< Every x in xs is a `UniqueMember x ys`= Ensures that x is a unique member of xs , and that ( can be used.& !"#$%&'()*+,-./0123456789:;<=&=<;:9876543210/.-,+*)('&%$#"! Safe,->?FSTT>TAllows iterating over the types in a typelist, whilst also incrementing an Nat index?&Return the next iteration without the ! type x in (x ': xs)@-Allows iterating over the types in a typelistA&Return the next iteration without the ! type x in (x ': xs)>?@A@A>?>?@ASafe->?FSTVZJB8This class allows defining handlers that can handle the ! type in the xs typelist. In conjunction with  @, you can define handlers that can handle all the types in the xs typelist.See Data.Diverse.CaseFunc and Data.Diverse.Cases.C3Return the handler/continuation when x is observed.BCBCBCSafe+-;<=>?FQSTVeDHThis handler stores a polymorphic function that doesn't change the type. let x = (5 :: Int)   (6 :: Int8)   (7 :: Int16)   (8 :: Int32)     y = (15 :: Int)   (16 :: Int8)   (17 :: Int16)   (18 :: Int32)      (D @) (+10)) x `shouldBe` y FIThis handler stores a polymorphic function that returns a different type. let y =  (5 :: Int) ::  '[Int, Bool]  y (F @. (show . typeRep . (pure @Proxy))) `shouldBe` Int let x = (5 :: Int)   False   'X'   Just 'O'   (6 :: Int)   Just 'A'      (:) [] (  (F @p (show . typeRep . (pure @Proxy))) x) `shouldBe` ["Int", "Bool", "Char", "Maybe Char", "Int", "Maybe Char"] DEFGFGIHDEKJDEFGSafe>?gLGiven a 7 that transforms each type in the typelist, convert a f xs to f (CasesResult2 c xs)LMLMLM None&'+,-.;<=>?FGQSTVh$PT**P avoids the following: Illegal type synonym family application in instance: AnyN)A friendlier type constraint synomyn for O)A friendlier type constraint synomyn for P)A friendlier type constraint synomyn for Q)A friendlier type constraint synomyn for R)A friendlier type constraint synomyn for +For each type x in larger, generate the (k, v) in smaller (if it exists)S)A friendlier type constraint synomyn for ~T)A friendlier type constraint synomyn for { and zUA variation of W which uses > instead of @V)A friendlier type constraint synomyn for { and zWCollects the output from Cing each field in a [. Uses @ to prepare the B to accept the next type in the xs typelist.@Internally, this holds the left-over [(k, v)] from the original [ for the remaining typelist xs..That is, the first v in the (k, v) is of type x7, and the length of the list is equal to the length of xs.,A variation of U which uses - instead of B. Variation of W which uses - instead of B/3Return the handler/continuation when x is observed.XmThis instance allows converting to and from Many There are instances for converting tuples of up to size 15.08Many stored as a list. This is useful when folding over [= efficienty so that the conversion to List is only done once[mA Many is an anonymous product type (also know as polymorphic record), with no limit on the number of fields.MThe following functions are available can be used to manipulate unique fields getter/setter for single field: n and s#getter/setter for multiple fields: ~ and folds: z or {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.JFor duplicate fields, Nat-indexed versions of the functions are available: getter/setter for single field: q and y#getter/setter for multiple fields:  and folds: | or }uEncoding: The record is encoded as (S.Seq Any). This encoding should reasonabily efficient for any number of fields.gThe map Key is index + offset of the type in the typelist. The Offset is used to allow efficient cons a. (Key = Index of type in typelist + OffsetvThe constructor will guarantee the correct number and types of the elements. The constructor is only exported in the Data.Diverse.Many.Internal module](Converts from a value (eg a tuple) to a [, via a 1 wrapper^BConverts from a Many to a value (eg a tuple), via a Tagged wrapper_Empty [.`0Create a Many from a single value. Analogous to 2a1Add an element to the left of a Many. Not named cons to avoid conflict with bInfix version of a.)Mnemonic: Element on the left is smaller b than the larger [ to the right.c1Add an element to the right of a Many Not named snoc to avoid conflict with dJAdd an element to the right of a Many iff the field doesn't already exist.eInfix version of c.Mnemonic: Many is larger e than the smaller elementfInfix version of g. Mnemonic: a b with an extra slash (meaning [ ) in front.gAppends two Manys togetherhXSplit a non-empty Many into the first element, then the rest of the Many. Analogous to 3iVSplit a non-empty Many into initial part of Many, and the last element. Analogous to 4jUExtract the first element of a Many, which guaranteed to be non-empty. Analogous to 5k Extract the kD element of a Many, which guaranteed to be non-empty. Analogous to  l`Extract the elements after the front of a Many, which guaranteed to be non-empty. Analogous to 6m-Return all the elements of a Many except the k6 one, which guaranteed to be non-empty. Analogous to !n/Getter by unique type. Get the field with type x. let x = (5 :: Int) b False b 'X' b Just 'O' b _ n @Int x `shouldBe` 5 o5Getter by label. Get the value of the field with tag label! which can be any type not just  KnownSymbol. let y = False b Tagged @Foo 'X' b Tagged @Hi True b _ o# @Foo y `shouldBe` Tagged @Foo 'X' o @Hi y `shouldBe` Tagged @Hi True p Variation of o specialized for 1 that untags the field.qDGetter by index. Get the value of the field at index type-level Nat n let x = (5 :: Int) b False b 'X' b Just 'O' b _ q @1 x `shouldBe` False r/Setter by unique type. Set the field with type x. let x = (5 :: Int) b False b 'X' b Just 'O' b _ r @Int x 6 `shouldBe` (6 :: Int) b False b 'X' b Just 'O' b _ s;Polymorphic setter by unique type. Set the field with type x, and replace with type y let x = (5 :: Int) b False b 'X' b Just 'O' b _ s) @Int x (Just True) `shouldBe` Just True b False b 'X' b Just 'O' b _ t1Setter by unique label. Set the field with label l. let y = (5 :: Int) b False b Tagged @Foo 'X' b Tagged @"Hello" (6 :: Int) b _ t4 @Foo y (Tagged @Foo 'Y') `shouldBe` (5 :: Int) b False b Tagged @Foo 'Y' b Tagged @"Hello" (6 :: Int) b _ t: @"Hello" y (Tagged @"Hello" 7) `shouldBe` (5 :: Int) b False b Tagged @Foo 'X' b Tagged @"Hello" (7 :: Int) b _ u;Polymorphic setter by unique type. Set the field with type x, and replace with type y let y = (5 :: Int) b False b Tagged @Foo 'X' b Tagged @"Hello" (6 :: Int) b _# replaceL @Foo y (Tagged @Bar 'Y') shouldBe (5 :: Int) b False b Tagged Bar Y b Tagged Hello (6 :: Int) b _G replaceL @"Hello" y (Tagged @"Hello" False) `shouldBe` (5 :: Int) b False b Tagged @Foo 'X' b Tagged @"Hello" False b _ v Variation of t specialized to 12 that automatically tags the value to be replaced.w Variation of u specialized to 12 that automatically tags the value to be replaced.xDSetter by index. Set the value of the field at index type-level Nat n let x = (5 :: Int) b False b 'X' b Just 'O' b _ x @0 x 7 shouldBe yPolymorphic version of x73Internal function for construction - do not expose!z Folds any [%, even with indistinct types. Given distinct handlers for the fields in [ , create < of the results of running the handlers over the fields in [. let x = (5 :: Int) b False b 'X' b Just 'O' b (6 :: Int) b Just 'A' b _ y = show @Int b show @Char b show @(Maybe Char) b show @Bool b _  (:) [] (z ( "I y) x) `shouldBe` ["5", "False", "'X'", "Just 'O'", "6", "Just 'A'"] {This is flip z let x = (5 :: Int) b False b 'X' b Just 'O' b (6 :: Int) b Just 'A' b _ y = show @Int b show @Char b show @(Maybe Char) b show @Bool b _  (:) [] ({ x ( "G y)) `shouldBe` ["5", "False", "'X'", "Just 'O'", "6", "Just 'A'"] | Folds any [%, even with indistinct types. Given index handlers for the fields in [ , create < of the results of running the handlers over the fields in [. let x = (5 :: Int) b False b 'X' b Just 'O' b (6 :: Int) b Just 'A' b _ y = show @Int b show @Bool b show @Char b show @(Maybe Char) b show @Int b show @(Maybe Char) b _  (:) [] (| ( #I y) x) `shouldBe` ["5", "False", "'X'", "Just 'O'", "6", "Just 'A'"] }This is flip | let x = (5 :: Int) b False b 'X' b Just 'O' b (6 :: Int) b Just 'A' b _ y = show @Int b show @Bool b show @Char b show @(Maybe Char) b show @Int b show @(Maybe Char) b _  (:) [] (} x ( #G y)) `shouldBe` ["5", "False", "'X'", "Just 'O'", "6", "Just 'A'"] ~ Construct a [B with a smaller number of fields than the original. Analogous to n getter but for multiple fields.8This can also be used to reorder fields in the original [. let x = (5 :: Int) b False b 'X' b Just 'O' b (6 :: Int) b Just 'A' b _ ~# @'[Bool, Char] x `shouldBe` False b 'X' b _ A variation of ~ which selects by labels let x = False b Tagged @"Hi" (5 :: Int) b Tagged @Foo False b Tagged @Bar 'X' b Tagged @"Bye" O b _ - @'[Foo, Bar] x `shouldBe` Tagged @Foo False b Tagged @Bar 'X' b _ 6 @'["Hi", "Bye"] x `shouldBe` Tagged @"Hi" (5 :: Int) b Tagged @"Bye" 'O' b _ A variation of ~ 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) b False b 'X' b Just 'O' b (6 :: Int) b Just 'A' b _ # @'[5, 4, 0] x `shouldBe` Just 'A' b (6 :: Int) b (5 ::Int) b _ Sets the subset of [ in the larger [. Analogous to s setter but for multiple fields. let x = (5 :: Int) b False b 'X' b Just 'O' b _ # @'[Int, Maybe Char] x ((6 :: Int) b Just 'P' b _) `shouldBe` (6 :: Int) b False b 'X' b Just 'P' b _ A variation of  which amends via labels. let x = False . Tagged @"Hi" (5 :: Int) . Tagged @Foo False . Tagged @Bar 'X' . Tagged @"Bye" 'O' ./ _ # @'[Foo, Bar] x (Tagged @Foo True . Tagged @Bar 'Y' . nil) shouldBe False . Tagged @"Hi" (5 :: Int) . Tagged @Foo True . Tagged @Bar 'Y' . Tagged @"Bye" 'O' ./ _ - @'["Hi", "Bye"] x (Tagged @"Hi" (6 :: Int) . Tagged @"Bye" 'P' . nil) shouldBe False . Tagged @"Hi" (6 :: Int) . Tagged @Foo False . Tagged @Bar 'X' . Tagged @"Bye" 'P' ./ _ Polymorphic version of . Analogous to s setter but for multiple fields.A variation of  which amends via labels. let x = False b Tagged @"Hi" (5 :: Int) b Tagged @Foo False b Tagged @Bar X b Tagged @"Bye" 'O' b _  @'[Foo, Bar] x ('Y' b True b nil) `shouldBe` False b Tagged @"Hi" (5 :: Int) b 'Y' b True b Tagged @"Bye" 'O' b _  @'["Hi", "Bye"] x (True b Tagged @"Changed" True b _) `shouldBe` False b True b Tagged @Foo False b Tagged @Bar 'X' b Tagged @"Changed" True b _ A variation of  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) b False b 'X' b Just 'O' b (6 :: Int) b Just 'A' b _  @'[5, 4, 0] x (Just 'B' b (8 :: Int) b (4 ::Int) b _) `shouldBe` (4 :: Int) b False b 'X' b Just 'O' b (8 :: Int) b Just 'B' b _ A polymorphic variation of A 8 instance encoded as the j value 9 with the l [. The : and ; metadata are not encoded.A terminating 8 instance encoded as a _.  read "5 . False . X . Just O . nil" == (5 :: Int) b False b 'X' b Just 'O' b _ show (5 :: Int) b False b 'X' b Just 'O' b _ == "5 . False . X . Just O . nil" ==Two [s are ordered by <ing their fields in index orderTwo [%s are equal if all their fields equalGiven a 7 that transforms each type in the typelist, convert a Many xs to Many (CaseResults c xs)Recursive AFunctor instance for non empty type list delegate afmap'ing the remainder to an instance of Collector' with one less type in the type list1Terminating AFunctor instance for empty type list-This single field instance is the reason for 10 wrapper. Otherwise this instance will overlap.8These instances add about 7 seconds to the compile time! nill case that doesn't even use /, so that an instance of  CaseAny '[] is not needed. nill case that doesn't even use caseAnyN, so that an instance of  CaseAnyN '[] is not needed.Folds values by Aing Bs through the xs typelist. nill case that doesn't even use C, so that an instance of Case '[] is not needed.Folds values by Aing Emitters through the xs typelist. nill case that doesn't even use C, so that an instance of Case '[] is not needed.for each x in smaller1, convert it to a (k, v) to insert into the x in largerfor each x in smaller1, convert it to a (k, v) to insert into the x in largerfor each y in smaller1, convert it to a (k, v) to insert into the x in  Many largerfor each x in smaller1, convert it to a (k, v) to insert into the x in  Many largerFor each type x in larger?, find the index in ys, and create an (incrementing key, value)JFor each type x in larger, find the index in ys, and create a (key, value)9NOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~9[\XYZ^]_`abcdegfhijklmnopqsrutwvyxS~RPQNOVWz{TU|}*=>?@ABCDEFG+HUIWJ,K.L-/XYZ0MN[\a5b5c5d5e5f5g5 None'l8NOPQRSTUVWXYZ[]^_`abcdefghijklmnopqrstuvwxyz{|}~8[XYZ^]_`abcdegfhijklmnopqsrutwvyxS~RPQNOVWz{TU|} None+-;<=>?FSTVhKA variation of  which uses q to get the handler by index. There may be different handlers for the same type, but the handlers must be in the same order as the input xs typelist. Use # to construct this safely ensuring n starts at 0. Contains a [4 of handlers/continuations for all the types in the xs typelist. This uses n/ to get the unique handler for the type at the ! of xs.Use  to construct this with , constraint to reduce programming confusion.Create an instance of B for either handling ing a Which. let y =  (5 :: Int) ::  '[Int, Bool]  y (  (show @Bool b show @Int b nul)) `shouldBe` "5" Or for handling { from a [. let x = (5 :: Int) b False b 'X' b Just 'O' b (6 :: Int) b Just 'A' b nul y = show @Int b show @Char b show @(Maybe Char) b show @Bool b nul  (:) [] ({ x ($ y)) `shouldBe` ["5", "False", "X ", "Just 'O'", "6", "Just 'A'"] !This function imposes additional  SameLength! constraints than when using the 5 constructor directly. It is better practice to use @ to prevent programming confusion with dead code. However, the A constructor is still exported to allow creating a master-of-all-B.A variation of  without the  SameLength. constraint to allow creating a master-of-all-B.Safe Constructor for  ensuring that the n( Nat starts at 0. It is an instance of CaseN for either handling $ing a Which in index order. let y = %6 @0 Proxy (5 :: Int) :: Which '[Int, Bool, Bool, Int] $ y (  (show @Int b show @Bool b show @Bool b show @Int b nul)) `shouldBe` "5" Or for handling } from a [. let x = (5 :: Int) b False b 'X' b Just 'O' b (6 :: Int) b Just 'A' b nul y = show @Int b show @Bool b show @Char b show @(Maybe Char) b show @Int b show @(Maybe Char) b nul  (:) [] (} x ($ y)) `shouldBe` ["5", "False", "X ", "Just 'O'", "6", "Just 'A'"] A variation of  without the  SameLength. constraint to allow creating a master-of-all-B.UndecidableInstances because fs appers more often.UndecidableInstances because fs appears more often.OP None&'+,-;<=>?AFGQSTVchBQbDo not export constructor Stores the right Any to be compared when the correct type is discoveredRbDo not export constructor Stores the right Any to be compared when the correct type is discoveredA switch/case statement for . This is equivalent to flip Use B instances like  & to apply a 5 of functions to a variant of values in index order. let y =  @0 (5 :: Int) ::  '[Int, Bool, Bool, Int]  y (  # (show @Int   show @Bool   show @Bool   show @Int    )) `shouldBe` "5" +Or you may use your own custom instance of B. is a variation of  which ?!s through the possibilities in a , delegating work to CaseN, ensuring termination when  only contains one type.$A friendlier constraint synonym for  reinterpretN. is an instance of  for which A!s through the possibilities in a , delegating handling to B, ensuring termination when  only contains one type.$A friendlier constraint synonym for  reinterpretN.$A friendlier constraint synonym for .$A friendlier constraint synonym for .$A friendlier constraint synonym for .$A friendlier constraint synonym for .$A friendlier constraint synonym for .$A friendlier constraint synonym for .$A friendlier constraint synonym for .A  is an anonymous sum type (also known as a polymorphic variant, or co-record) which can only contain one of the types in the typelist. This is essentially a typed version of '(.\The following functions are available can be used to manipulate unique types in the typelist constructor:  destructor:  injection:  and catamorphism:  or ~These functions are type specified. This means labels are not required because the types themselves can be used to access the E. It is a compile error to use those functions for duplicate fields.fFor duplicate types in the list of possible types, Nat-indexed version of the functions are available: constructor:  destructor:  inejction:  and  reinterpretNcatamorphism:  or {Encoding: The variant contains a value whose type is at the given position in the type list. This is the same encoding as  Rhttps://github.com/haskus/haskus-utils/blob/master/src/lib/Haskus/Utils/Variant.hsHaskus.Util.Variant and  Rhttps://hackage.haskell.org/package/HList-0.4.1.0/docs/src/Data-HList-Variant.htmlData.Hlist.Variant.(The constructor is only exported in the Data.Diverse.Which.Internal module Analogous to S . Renamed  to avoid conflicts.Since 'Which '[]' values logically don't exist, this witnesses the logical reasoning tool of "ex falso quodlibet", ie "from falsehood, anything follows".A 'Which '[]' is a , with no alternatives, which may occur as a T -over from ing a  Which '[x]6 with one type. It is an uninhabited type, just like UA  Which '[Void] is equivalent to  Which '[] A  Which '[Void] might occur if you lift a U into a Which with ). This allows you to convert it back to U or  Which '[]Monoid that is always VLift a value into a  of possibly other types xs. xsT can be inferred or specified with TypeApplications. NB. forall is used to specify xs3 first, so TypeApplications can be used to specify xs first T 'A' @_ @'[Int, Bool, Char, Maybe String] :: Which '[Int, Bool, Char, Maybe String] A variation of  where x is specified via a label let y = T @Foo (Tagged (5 :: Int)) :: Which '[Bool, Tagged Foo Int, Tagged Bar Char] x =  @Foo y x shouldBe (Right (Tagged 5))  Variation of  specialized to 1# that automatically tags the value.A variation of  into a  of a single type.  'A' :: Which '[Char] A variation of  into a  where x is the first type. ! 'A' :: Which '[Char, Int, Bool] Lift a value into a H of possibly other (possibley indistinct) types, where the value is the n -th type. < @4 (5 :: Int) :: Which '[Bool, Int, Char, Bool, Int, Char] It is  what value is inside a  of one type. let x = pick' 'A' :: Which '[Char]  x `shouldBe` 'A'  the n-th type of a  , and get W the X value or the T-over possibilities. let x = - 'A' @_ @'[Int, Bool, Char, Maybe String] :: " '[Int, Bool, Char, Maybe String]  @1 x `shouldBe` Left ( 'A') ::  '[Int, Char, Maybe String]  a type in a  and W get the X value or the T-over possibilities. let x = * 'A' @'[Int, Bool, Char, Maybe String] :: " '[Int, Bool, Char, Maybe String]  @Char x `shouldBe` Right 'A'  @Int x `shouldBe` Left ( 'A') ::  '[Bool, Char, Maybe String] A variation of ! where x is specified via a label let y = T @Foo (Tagged (5 :: Int)) :: Which '[Bool, Tagged Foo Int, Tagged Bar Char] x =  @Foo Proxy y x shouldBe (Right (Tagged 5))  Variation of  specialized to 1 which untags the field. Variation of  which returns a Maybe Variation of  which returns a Maybe Variation of  which returns a Maybe Variation of  specialized to 1 which untags the field.A variation of a   which "s the first type in the type list. let x = * 'A' @'[Int, Bool, Char, Maybe String] :: " '[Int, Bool, Char, Maybe String]  x `shouldBe` Left ( 'A') ::  '[Bool, Char, Maybe String]  Variation of  which returns a Maybe Convert a  to another 1 that may include other possibilities. That is, branch is equal or is a subset of tree.AThis can also be used to rearrange the order of the types in the .It is a compile error if tree has duplicate types with branch.NB. Use TypeApplications with  _ to specify tree@. let a = pick' (5 :: Int) ::  '[Int] b =  @_ @[Int, Bool] a ::  '[Int, Bool] c =  @_ @[Bool, Int] b ::  '[Bool, Int] A simple version of 5 which add another type to the front of the typelist.A restricted version of  which only rearranges the typesA variation of  where branch+is additionally specified by a labels list. let y =  (5 :: Tagged Bar Int) y' =  @'[Bar] y :: . '[Tagged Bar Int, Tagged Foo Bool] y'' =  @'[Bar, Foo] y' :: $ '[Tagged Foo Bool, Tagged Bar Int]  y'' (F @A (show . typeRep . (pure @Proxy))) `shouldBe` "Tagged * Bar Int" A variation of  which uses a Nat list indices, to specify how to reorder the fields, where indices[branch_idx] = tree_idx This variation allows tree! to contain duplicate types with branch$ since the mapping is specified by indicies. let y =  (5 :: Int) y' = # @'[0] @_ @[Int, Bool] y y'' =  @[1,0] @_ @[Bool, Int] y'  y'' (F @4 (show . typeRep . (pure @Proxy))) `shouldBe` "Int"  Convert a  into possibly another 6 with a totally different typelist. Returns either a  with the X value, or a  with the Tover  compliment types.It is a compile error if branch or  compliment has duplicate types with tree.NB. forall used to specify branch3 first, so TypeApplications can be used to specify branch first.  let a = " @[Int, Char, Bool] (5 :: Int) :: ! '[Int, Char, Bool] let b =  ([String, Char] y b `shouldBe` Left ( (5 :: Int)) ::  '[Int, Bool] let c =  ([String, Int] a c `shouldBe` Right ( (5 :: Int)) ::  '[String, Int]  Variation of  which returns a Maybe.A variation of  where the branch. is additionally specified with a labels list. let y = d @[Tagged Bar Int, Tagged Foo Bool, Tagged Hi Char, Tagged Bye Bool] (5 :: Tagged Bar Int) y' =  @[Foo, Bar] y x = P @[Tagged Foo Bool, Tagged Bar Int] (5 :: Tagged Bar Int) y' `shouldBe` Right x  Variation of  which returns a Maybe.A limited variation of  which uses a Nat list n, to specify how to reorder the fields, where indices[branch_idx] = tree_idx This variation allows tree! to contain duplicate types with branch$ since the mapping is specified by indicies.However, unlike  reinterpert, in this variation, branch must be a subset of treeL instead of any arbitrary Which. Also it returns a Maybe instead of Either.This is so that the same indices can be used in narrowN.A switch/case statement for . This is equivalent to flip Use B instances like  ) to apply a % of functions to a variant of values. let y =  (5 :: Int) ::  '[Int, Bool]  y (  " (show @Bool   show @Int    )) `shouldBe` "5" Or F @2 to apply a polymorphic function that work on all Typeables. let y =  (5 :: Int) ::  '[Int, Bool]  y (F @. (show . typeRep . (pure @Proxy))) `shouldBe` Int +Or you may use your own custom instance of B.Catamorphism for  . This is flip .Catamorphism for . This is equivalent to flip .rReading a 'Which '[]' value is always a parse error, considering 'Which '[]' as a data type with no constructors. (<  ) == EQ ( ==  ) == TrueA 8 instance encoded as either the x value (Y ) or the ed remaining 'Which xs'. The : and ; metadata are not encoded.A terminating 8$ instance for one type encoded with pick'. The : and ; metadata are not encoded.A terminating 86 instance for no types encoded as a 'Which '[]'. The : and ; metadata are not encoded. The Unique x branch1 is important to get a compile error if the from branch doesn't have a unique xAllow 'Which '[Void]' to be ed or ,ed into anything else This is safe because  Which '[Void]F is uninhabited, and this is already something that can be done with Allow U to be ed or ,ed into anything else This is safe because VoidF is uninhabited, and this is already something that can be done with Allow 'Which '[]' to be ed or ,ed into anything else This is safe because  Which '[]F is uninhabited, and this is already something that can be done with :Terminating case of the loop, ensuring that a instance of Case '[]) with an empty typelist is not required. each type in a , and either handle the C with value discovered, or A( trying the next type in the type list.:Terminating case of the loop, ensuring that a instance of Case '[]< with an empty typelist is not required. You can't reduce  each type in a , and either handle the C with value discovered, or ?( trying the next type in the type list.Two Tes are only equal iff they both contain the equivalnet value at the same type index.!A 9 with a type at smaller type index is considered smaller.$ show (pick' 'A') == "pick 'A'"%This Zb instance tries to read using the each type in the typelist, using the first successful type read.23[\]^_`QaRbcdefghijklNoneh12None, !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGLMNOPQRSTUVWXYZ[]^_`abcdefghijklmnopqrstuvwxyz{|}~m*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefgh ijkkllmnopq r s t u v w x y z { | } ~      & ) " #  $                 %                                   ! " # $ % & ' ( ) * + , - . / 0 1 2 3 4 5 6 7 8 9 : ;<=><?@ A B C D E F GHIJKLMKLNKLO<PQ<PR S<TU<TV<TW<TXYZ[ A \ \ ] ] ^ ^ _ _ ` ` B y { C E G a & ) b c<de<fg<dh<ij<fk<fl<Tm<no p p q r s s b c t t u u v v w w x xy+data-diverse-3.0.0.0-1uvhqpsfH5XHrzofhKYrHsData.Diverse.AFoldableData.Diverse.ReduceData.Diverse.TypeLevel.InternalData.Diverse.TypeLevelData.Diverse.ReiterateData.Diverse.CaseData.Diverse.CaseFuncData.Diverse.AFunctorData.Diverse.Many.InternalData.Diverse.CasesData.Diverse.Which.Internal ReiterateData.Diverse.Many./nilafmapData.Diverse.WhichpickWhichswitch Data.TypeableTypeablenulafoldrforMany Data.DiverseCase Control.LensconssnocPreludelastinitcasescasesNswitchNpickNCasesNDataDynamicCases AFoldableafoldl'ReducereduceReducedZipImplReplacesIndexImplReplaceIfIndex ReplacesImpl ReplaceImplReplaceIndexImplRemoveIndexImplSameLengthImplKindAtLabelImplKindAtIndexImplUniqueLabelImpl UniqueImplIsDistinctImplIsUniqueLabelImpl IsUniqueImplNubImpl IndexOfImplPositionOfImplAllConstrained CaseResults CaseResultZipInitAppend Complement SameLengthLastHeadTail ReplacesIndex ReplaceIndex RemoveIndexReplacesReplaceRemove KindsAtLabelsKindsAtIndicesKindAtPositionIs KindAtLabel KindAtIndex PositionOfIndexOf UniqueLabels UniqueLabelUniqueNub IsDistinctUniqueIfExists AppendUnique SnocUnique MaybeMemberAtMemberAtMaybeUniqueMemberUniqueLabelMember UniqueMembers UniqueMember ReiterateN reiterateN reiteratecase' CaseFunc'CaseFunc$fCaseCaseFunc:$fReiterateCaseFuncxs$fCaseCaseFunc':$fReiterateCaseFunc'xsAFunctorAmendNAmendN'AmendAmend'SelectNSelectCollectN CollectorNCollect CollectorIsManytoManyfromManyManytoMany' fromMany'singleprefixpostfixpostfix'\././appendviewfviewbfrontbackaftforegrabgrabLgrabTaggrabNreplace'replace replaceL'replaceL replaceTag' replaceTag replaceN'replaceNcollectforManyNcollectNselectselectLselectNamend'amendL'amendamendLamendN'amendN $fNFDataMany $fNFDataMany0 $fGenericMany$fGenericMany0 $fReadMany $fReadMany_ $fReadMany_0 $fShowMany $fShowMany_ $fShowMany_0 $fMonoidMany $fMonoidMany_$fMonoidMany_0$fSemigroupMany$fSemigroupMany_$fSemigroupMany_0 $fOrdMany $fOrdMany_ $fOrdMany_0$fEqMany $fEqMany_ $fEqMany_0$fAFunctorManycas$fAFunctorMany_c:$fAFunctorMany_c[]#$fIsManyTYPETagged:(,,,,,,,,,,,,,,)"$fIsManyTYPETagged:(,,,,,,,,,,,,,)!$fIsManyTYPETagged:(,,,,,,,,,,,,) $fIsManyTYPETagged:(,,,,,,,,,,,)$fIsManyTYPETagged:(,,,,,,,,,,)$fIsManyTYPETagged:(,,,,,,,,,)$fIsManyTYPETagged:(,,,,,,,,)$fIsManyTYPETagged:(,,,,,,,)$fIsManyTYPETagged:(,,,,,,)$fIsManyTYPETagged:(,,,,,)$fIsManyTYPETagged:(,,,,)$fIsManyTYPETagged:(,,,)$fIsManyTYPETagged:(,,)$fIsManyTYPETagged:(,)$fIsManyTYPETagged:a$fIsManyTYPETagged[]()$fAFoldableCollectorAnyr$fAFoldableCollectorAnyr0$fAFoldableCollectorAnyNr$fAFoldableCollectorAnyNr0$fAFoldableCollectorr$fAFoldableCollectorr0$fAFoldableCollectorNr$fAFoldableCollectorNr0$fReiterateCaseSelect:$fReiterateNCaseSelectNn:$fReiterateCaseAmend':$fReiterateCaseAmend:$fReiterateNCaseAmendN'n:$fReiterateNCaseAmendNn:$fCaseAnyCaseAmendN:$fCaseAnyCaseAmendN':$fCaseAnyCaseAmend:$fCaseAnyCaseAmend':$fCaseAnyCaseSelectN:$fCaseAnyCaseSelect:cases'casesN' $fCaseCasesxs$fReiterateCasesxs$fCaseCasesNxs$fReiterateNCasesNnxsSwitchN SwitcherNSwitchSwitcher ReinterpretN' ReinterpretL' ReinterpretL Reinterpret' Reinterpret DiversifyN DiversifyL Diversify impossible impossible'zilchpickLpickTagpickOnlypick0obvioustrialNtrialtrialLtrialTagtrialN'trial'trialL' trialTag'trial0trial0' diversify diversify0 diversify' diversifyL diversifyN reinterpret reinterpret' reinterpretL reinterpretL' reinterpretN'whichwhichN $fNFDataWhich $fReadWhich $fShowWhich $fOrdWhich $fEqWhich$fSemigroupWhich$fGenericWhich$fGenericWhich0$fGenericWhich1$fCaseCaseDiversify:$fReiterateCaseDiversifybranch'$fCaseCaseDiversifyN:"$fReiterateNCaseDiversifyNnbranch'$fCaseCaseReinterpret:$fReiterateCaseReinterprettree'$fCaseCaseReinterpret': $fReiterateCaseReinterpret'tree'$fCaseCaseReinterpretN':#$fReiterateNCaseReinterpretN'ntree'$fNFDataWhich0$fReduceWhichSwitcher$fReduceVoidSwitcher$fReduceWhichSwitcher0$fReduceWhichSwitcher1$fReduceWhichSwitcher2$fReduceWhichSwitcherN$fReduceWhichSwitcherN0$fSwitchN[]Whichcrnxs$fCaseCaseEqWhich:$fReiterateCaseEqWhich: $fEqWhich0$fCaseCaseOrdWhich:$fReiterateCaseOrdWhich: $fOrdWhich0$fCaseCaseShowWhich:$fReiterateCaseShowWhich: $fShowWhich0 $fReadWhich0$fWhichReadWhich_$fWhichReadWhich_0base GHC.TypeLitsnatValGHC.NumNum WrappedAny CaseSelect CollectorAnyNCaseAny CollectorAnycaseAnyMany_#tagged-0.8.5-IjnWAcOCwov90XohUoYw8a Data.TaggedTaggedcontainers-0.5.10.2Data.Sequence.Internal singletonviewlviewrGHC.Listheadtail fromList' GHC.GenericsGeneric:*:C1S1ghc-prim GHC.Classescompare CaseAmendN CaseAmendN' CaseAmend CaseAmend' CaseSelectNrunMany_ CaseOrdWhich CaseEqWhich Data.Voidabsurd Data.EitherLeftVoidGHC.BasememptyEitherRight:+:GHC.ReadReadWhich_ WhichRead whichReadPrec CaseShowWhichCaseReinterpretN'CaseReinterpret'CaseReinterpretCaseDiversifyN CaseDiversify