? @ A B C D E F G H I J K L M N O P Q R S TUVWXYZ[\]^_`abcdef Safe-Inferred-./ Safe-Inferred24       Safe-Inferred-./ Safe-InferredJK-Validators transform identities into results.A type which is similar to g@, except that it has a slightly different Applicative instance.The h instance to # relies on its error type being a i%. That way, it can accumulate errors. Safe-Inferred'(=JK !j !!  !j Safe-Inferred!"'(=K"#k"#"#"#kNone'(24:=JKM $%lm&'(no$%&'(&'$%($%lm&'(no Safe-Inferred!"'(=K)*p)*)*)*p None !"'(3=JK+,-./q+,-.//-.+,+,-./qNone)*+,-./ None!"&'(2346=JK1?A constraint for implicit resolution of list membership proofs.2)An inductive list membership proposition. 0123456780123456 562431087012435678  Safe-Inferred!"'(234=HJKM9(A record is parameterized by a universe u, list of rows rs, a large elimination el, and a type constructor f& to be applied to the interpretation el r of each of those r.<kShorthand for a record with a single field. Lifts the field's value into the chosen functor automatically.=@Shorthand for a record with a single field. This is useful for  Applicative or Monad,ic intialization of records as in the idiom: 3dist $ myField <-: someIO <+> yourField <-: otherIO>`Records constructed using the above combinators will often be polymorphic in their interpreter elr. To avoid providing a type annotation, one can provide their interpreters with a singleton tag and pass that in. 9:;<=>?@ABCD9:;<=> 9;:<=>DCBA@? 9;:<=>?@ABCD: = None'=HMK$Fixes a polymorphic record into the Identity functor.EFGHIJKLEFGHIJKLJIHGFEKLEFGHIJKL None !"'3=JKMMProject a field from a 9.NProject a field from a J.OSet a field in a 9 over an arbitrary functor.PSet a field in a J.QModify a field.R}Provide a lens to a record field. Note that this implementation does not support polymorphic update. In the parlance of the lens package, @rLens' :: (r " rs) => Sing r -> Lens' (Rec el f rs) (f (el $ r))SA lens into a J3 that smoothly interoperates with lenses from the lensQ package. Note that polymorphic update is not supported. In the parlance of the lens package, >rLens :: (r " rs) => sing r -> Lens' (PlainRec el rs) (el $ r)MNOPQRSMNOPQRSMNOPQRSMNOPQRSNone!"&'(2346=JKMUfIf two records types are subtypes of each other, that means that they differ only in order of fields.ViOne record is a subtype of another if the fields of the latter are a subset of the fields of the former.XTerm-level record congruence. TUVWXrstuTUVWXVWUXTTUVWXrstuNone!"&'(2346=HJKM]Append for type-level lists.^Append for records.a+Accumulates a homogenous record into a listYZ[\]^_`abcdefvwxyz{YZ[\]^_`abcdef_`^][\bcdYZaefYZ[\]^_`abcdefvwxyz{^_`None $%9:<=UVX^_` U=V^`_<X9:$%None/01234569:;<=>EFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdef| !"##$%&'()*+,-./01223456788 9 9 : : ; < = > ? @ 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 [ \ ] ^ _`abcdefghijklmnopqrstusvwsxyz{|}~  vinyl-0.4.3Data.Vinyl.Idiom.ThunkData.Vinyl.FunctorData.Vinyl.Idiom.IdentityData.Vinyl.Idiom.ValidationData.Vinyl.TyFunData.Vinyl.Universe.Const Data.Vinyl.THData.Vinyl.Universe.IdData.Vinyl.Universe.FieldData.Vinyl.WitnessesData.Vinyl.CoreData.Vinyl.DerivedData.Vinyl.LensData.Vinyl.ConstraintData.Vinyl.OperatorsData.Vinyl.UniverseData.Vinyl.Notation Data.VinylThunkrunThunk $fShowThunk $fMonadThunk$fApplicativeThunkLiftrunLiftPresheaf contramap$fPresheafLift $fFunctorLift$fApplicativeLift$fPresheafLift0$fPresheafLift1$fFunctorLift0$fFunctorLift1Identity runIdentity$fShowIdentity$fMonadIdentity$fApplicativeIdentity ValidatorResultSuccessFailure$fApplicativeResult$fFunctorResult$TCAppTyFunConst Semantics:~> makeUniverse makeUniverse' semanticsIdElFieldSField:::∈IElemElemThereHereImplicit implicitly$fImplicitElem$fImplicitElem0Rec:&RNil=:<-: withUniverse $fStorableRec$fStorableRec0$fEqRec$fEqRec0 $fMonoidRec $fMonoidRec0 LazyHListHList PlainFieldRecFieldRec LazyPlainRecPlainRec toPlainRectoLazyPlainRecrGet'rGetrPut'rPutrModrLens'rLensRecAll:~:<:cast~=FoldRecfoldRecRecApplicativerpure++<+><<$>><<*>> recToList rtraverserdist rdistLazy showWithNamesrshowbase Data.EitherEitherControl.Applicative Applicative Data.MonoidMonoidTFCo:R:App*kTCxTFCo:R:App*kConstxTyRepasType$fTyRepQ $fTyRepNameTFCo:R:AppkkIdxTFCo:R:App**ElField:::TFCo:R:RecAllk*elf:cTFCo:R:RecAllkk1elf[]c$f<:kxs: $f<:kxs[] $fFoldRecRecf $fFoldRecReca$fRecApplicativek:$fRecApplicativek[] TFCo:R:++k:bsTFCo:R:++k[]bs