}<      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~None05The = type represents values with two non-exclusive possibilities.This can be useful to represent combinations of two values, where the combination is defined if either input is. Algebraically, the type  These A B represents  (A + B + AB)E, which doesn't factor easily into sums and products--a type like Either A (B, Maybe A)" is unclear and awkward to use." has straightforward instances of , M, &c., and behaves like a hybrid error/writer monad, as would be expected.Case analysis for the  type..Takes two default values and produces a tuple.%Coalesce with the provided operation.7BiMap and coalesce results with the provided operation.A  Traversal of the first half of a , suitable for use with  Control.Lens. A  Traversal of the second half of a , suitable for use with  Control.Lens. A Prism selecting the  constructor. A Prism selecting the  constructor. A Prism selecting the  constructor.  names are ridiculous!   = preview    = preview    = preview    =  .    =  .   =  .  map.  = over   = over   Select all  constructors from a list. Select all  constructors from a list. Select all  constructors from a list.?Select each constructor and partition them into separate lists.0  !"#$%&'()*+,-.  -  !"#$%&'()*+,-.None5KBifoldable bifunctors supporting traversal through an alignable functor.Minimal definition:  bicrosswalk or  bisequenceL.Laws: `bicrosswalk (const empty) (const empty) = const empty bicrosswalk f g = bisequenceL . bimap f g 8GFoldable functors supporting traversal through an alignable functor.Minimal definition:  crosswalk or  sequenceL.Laws: Ccrosswalk (const nil) = const nil crosswalk f = sequenceL . fmap f ;.Alignable functors supporting an "inverse" to ?6: splitting a union shape into its component parts.Minimal definition: nothing; a default definition is provided, but it may not have the desired definition for all functors. See the source for more information.Laws: dunalign nil = (nil, nil) unalign (This <$> x) = (Just <$> x, Nothing <$ x) unalign (That <$> y) = (Nothing <$ y, Just <$> y) unalign (join These <$> x) = (Just <$> x, Just <$> x) unalign ((x `These`) <$> y) = (Just x <$ y, Just <$> y) unalign ((`These` y) <$> x) = (Just <$> x, Just y <$ x) =RFunctors supporting a zip operation that takes the union of non-uniform shapes.+If your functor is actually a functor from  Kleisli Maybe to Hask (so it supports +maybeMap :: (a -> Maybe b) -> f a -> f b ), then an Align\ instance is making your functor lax monoidal w.r.t. the cartesian monoidal structure on  Kleisli Maybe , because These+ is the cartesian product in that category :(a -> Maybe (These b c) ~ (a -> Maybe b, a -> Maybe c))%. This insight is due to rwbarton.Minimal definition: nil and either align or  alignWith.Laws: (`align` nil) = fmap This (nil `align`) = fmap That join align = fmap (join These) align (f <$> x) (g <$> y) = bimap f g <$> align x y alignWith f a b = f <$> align a b >An empty strucutre. ? ing with >Y will produce a structure with the same shape and elements as the other input, modulo  or .? Analogous to K, combines two structures by taking the union of their shapes and using  to hold the elements.@ Analogous to t, combines two structures by taking the union of their shapes and combining the elements with the given function.B&Align two structures and combine with .CAlign two structures as in , but filling in blanks with .DAlign two structures as in , but filling in blanks with .E Left-padded .F Left-padded .G Right-padded .H Right-padded ..56789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`56789:;<=?>@ABCDEFGH=>?@BCDFEHGA;<89:567&56789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`NoneaKeyed version of =.b Analogous to @, but also provides an index. abcdefghiabababcdefghiNone9;<= jThe j monad transformer.The 5 function produces a computation with no output, and # combines multiple outputs with .m3A chronicle monad parameterized by the output type c.The 5 function produces a computation with no output, and # combines multiple outputs with .pp c& is an action that records the output c.Equivalent to  for the Writer monad.qq c& is an action that records the output c and returns a  value.QThis is a convenience function for reporting non-fatal errors in one branch a casex, or similar scenarios when there is no meaningful result but a placeholder of sorts is needed in order to continue.rr c, is an action that ends with a final output c.Equivalent to  for the  monad.ss m' is an action that executes the action m2, returning either its record if it ended with rO, or its final value otherwise, with any record added to the current record. Similar to  in the  monad, but with a notion of non-fatal errors (which are accumulated) vs. fatal errors (which are caught without accumulating).tt x m' is an action that executes the action m6 and discards any record it had. The default value x will be used if m ended via r.uu m' is an action that executes the action m~ and keeps its value only if it had no record. Otherwise, the value (if any) will be discarded and only the record kept.@This can be seen as converting non-fatal errors into fatal ones.vv f m' is an action that executes the action m and applies the function f3 to its output, leaving the return value unchanged.Equivalent to  for the Writer monad.jklmnopqrstuvwxyz{|}~ jklmnopqrstuv mnojklpqrstuvjklmnopqrstuvwxyz{|}~None9;<=? c& is an action that records the output c.Equivalent to  for the  monad. c& is an action that records the output c and returns a  value.QThis is a convenience function for reporting non-fatal errors in one branch a casex, or similar scenarios when there is no meaningful result but a placeholder of sorts is needed in order to continue. c, is an action that ends with a final record c.Equivalent to  for the  monad. m' is an action that executes the action m2, returning either its record if it ended with O, or its final value otherwise, with any record added to the current record. Similar to  in the  monad, but with a notion of non-fatal errors (which are accumulated) vs. fatal errors (which are caught without accumulating). x m' is an action that executes the action m6 and discards any record it had. The default value x will be used if m ended via . m' is an action that executes the action m~ and keeps its value only if it had no record. Otherwise, the value (if any) will be discarded and only the record kept.@This can be seen as converting non-fatal errors into fatal ones. f m' is an action that executes the action m and applies the function f3 to its output, leaving the return value unchanged.Equivalent to  for the  monad. m( lifts a plain 'These c a' value into a  instance. jklo jkloNone@jklmomojkl      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnoppqrstuvwxyz{|}~uvwxyz{s"these-0.7.1-JKfAhQ4C6PhL8gqJ6Qs3Tt Data.These Data.AlignData.Align.KeyControl.Monad.Trans.ChronicleControl.Monad.Chronicle.ClassControl.Monad.ChronicleTheseThisThatthese fromThese mergeThesemergeTheseWithherethere_This_That_ThesejustThisjustThat justTheseisThisisThatisThesemapThesemapThismapThatcatThiscatThatcatThesepartitionThese$fCoArbitraryThese$fFunctionThese$fArbitraryThese$fFromJSONThese $fToJSONThese $fBinaryThese $fNFDataThese$fHashableThese $fMonadThese $fBindThese$fApplicativeThese $fApplyThese$fBitraversable1These$fBitraversableThese$fBifoldable1These$fBifoldableThese$fBifunctorThese$fTraversableThese$fFoldableThese$fFunctorThese$fSemigroupThese $fEqThese $fOrdThese $fReadThese $fShowThese $fDataThese$fGenericThese Bicrosswalk bicrosswalk bisequenceL Crosswalk crosswalk sequenceLUnalignunalignAlignnilalign alignWithalignVectorWithmalignpadZip padZipWith lpadZipWithlpadZip rpadZipWithrpadZip$fBicrosswalkThese$fBicrosswalkEither$fCrosswalkVector$fCrosswalkThese$fCrosswalkSeq $fCrosswalk[]$fCrosswalkMaybe$fCrosswalkIdentity$fUnalignStream$fUnalignProduct$fUnalignZipList $fUnalign[]$fUnalignMaybe$fAlignHashMap $fAlignVector $fAlignBundle $fAlignStream$fAlignProduct $fAlignIntMap $fAlignMap $fAlignSeq$fAlignZipList $fAlign[] $fAlignMaybe AlignWithKey alignWithKey$fAlignWithKeyVector$fAlignWithKeyHashMap$fAlignWithKeyMap$fAlignWithKeyIntMap$fAlignWithKeySeq$fAlignWithKey[]$fAlignWithKeyMaybe ChronicleT runChronicleT Chronicle chronicle runChronicledictatediscloseconfessmementoabsolvecondemnretcon$fMonadFixChronicleT$fMonadWriterwChronicleT$fMonadStatesChronicleT$fMonadRWSrwsChronicleT$fMonadReaderrChronicleT$fMonadErroreChronicleT$fMonadPlusChronicleT$fAlternativeChronicleT$fMonadIOChronicleT$fMonadTransChronicleT$fMonadChronicleT$fBindChronicleT$fApplicativeChronicleT$fApplyChronicleT$fFunctorChronicleTMonadChronicle$fMonadChroniclecRWST$fMonadChroniclecRWST0$fMonadChroniclecWriterT$fMonadChroniclecWriterT0$fMonadChroniclecStateT$fMonadChroniclecStateT0$fMonadChroniclecReaderT$fMonadChroniclecExceptT$fMonadChroniclecErrorT$fMonadChroniclecMaybeT$fMonadChroniclecIdentityT$fMonadChroniclecChronicleT$fMonadChroniclecThesebaseGHC.BaseFunctorMonad Data.MaybeisJustData.Bifunctor BifunctorprismGHC.ListzipzipWithmappendNothingoopscrosswalkVectorreturn>>= mtl-2.2.1-6qsR1PHUy5lL47Hpoa4jCMControl.Monad.Writer.Classtell1data-default-class-0.1.2.0-FYQpjIylblBDctdkHAFeXAData.Default.ClassDefaultControl.Monad.Error.Class throwErrortransformers-0.5.2.0Control.Monad.Trans.ErrorError catchErrorcensorControl.Monad.Trans.Writer.LazyWriter Control.Monadguardjoinfail>>fmapData.TraversablemapMsequenceMonoidmemptymconcatliftM MonadPlusmzeromplusControl.Monad.IO.ClassMonadIOliftIOmfilter<$!>unless replicateM_ replicateMfoldM_foldM zipWithM_zipWithM mapAndUnzipMforever<=<>=>filterMforM Data.Foldablemsum sequence_forM_mapM_ Data.FunctorvoidapliftM5liftM4liftM3liftM2when=<<Control.Monad.Trans.Class MonadTranslift