h$o        ! " # $ % & ' ( ) * + , - . / 0 1 2 3 4 5 6 7 8 9 : ; < = > ? @ A B C D E F G H I J KLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~        !!!!!!!!""""""""##$$%%&&''()))*+++,,,,,,----------...//////000001233344444455556666666666666777777777777777777777777778888999999999999999999999::::::;;;;<<<<<<<<<<<<<<<<<<<<<<<<============>>>>>>>>>>>>>>>>>??@@AAAAAAAAAAABBBBBBBBBBCCCCCCCCCCCCCCCDDDDDDDDDDDEEEEEEEEEEEEEFFFFFFFFFGGGGGGGGGGHHHHHHHHHHHHHHHHHHHIIJJJKKKKKKKKKLLLLLLLLLLLLLMMMMMMMMMMNNNNNOOOOOOOOOOOPPPPPPPPPQQQQQQQQQQQQQRRRRRRRRRRRRRSSSSSSSSSSSSSSSSSSTUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUVVVVVVVVVVVVVVVVVVVVVVVVVVVVWWXXXXXXXXXXXXXXXXXXXXXXXXXXXXXYYYYYYYYYZZZZZZZZZZZZZZZZZZZZZZZ[[[[[[[[[[[[[\\\\\\\\\\\\]]]]]]]]]]]]]]]]^^^^^^^^^^^^^^_________________________````aaaaabbbbbbbbbbbbbbbccccccccccddddeeeeeeefffffffffffffffffffggggghhhhhhhhhhhiiiiiiiiiijjjjkkkkkkk Safe-Inferred&'(-./0>?pandoraNatural transformationpandoraAlgebra's type operatorpandoraCoalgebra's type operatorpandoraFlipped functors compositionpandoraFunctors compositionpandoraParameter application   222000110 Safe-Inferred&'(-./0>?h   1 2 9 l Safe-Inferred&'(-./0>?   Safe-Inferred&'(-./0>?-   Safe-Inferred&'(-./0>? Safe-Inferred&'(-./0>? Safe-Inferred&'(-./0>?0 Safe-Inferred&'(-./0>?pandora7Type synonymous for at least one element data structure Safe-Inferred&'(-./0>?  Safe-Inferred&'(-./0>?j  8 0  Safe-Inferred&'(-./0>?"pandora When providing a new instance, you should ensure it satisfies the two laws: * Identity: bimap identity identity D identity * Parametricity: bimap (f . g) (h . i) D bimap f h . bimap g i$pandoraPrefix version of #"$#"$##4  Safe-Inferred&'(-./0>? %pandora When providing a new instance, you should ensure it satisfies the two laws: * Identity morphism: contramap identity D identity * Interpreted of morphisms: contramap f . contramap g D contramap (g . f)&pandoraInfix version of ''pandoraPrefix version of &(pandora7Replace all locations in the output with the same value)pandoraFlipped version of (*pandoraFill the input of evaluation+pandoraFlipped infix version of ',pandoraInfix versions of ' with various nesting levels/pandoraInfix flipped versions of ' with various nesting levels %10/.-,+*'()& %10/.-,+*'()&&4(4)4  Safe-Inferred&'(-./0>? 2pandora When providing a new instance, you should ensure it satisfies the two laws: * Identity morphism: comap identity D identity * Interpreted of morphisms: comap (f . g) D comap f . comap g3pandoraInfix version of 44pandoraPrefix version of 35pandora6Replace all locations in the input with the same value6pandoraFlipped version of 57pandora!Discards the result of evaluation8pandora,Computing a value from a structure of values9pandoraFlipped infix version of 4:pandoraInfix versions of 4 with various nesting levels=pandoraInfix flipped versions of 4 with various nesting levels2?>=<9876;54:32?>=<9876;54:3345464  Safe-Inferred&'(-./0>? &Apandora When providing a new instance, you should ensure it satisfies the one law: * Interchange: t >>= f = join (f <$> t)BpandoraInfix and flipped version of D, the dual of =>>CpandoraFlipped version of B, the dual of <<=DpandoraPrefix and flipped version of B, the dual of extendEpandora$Merge effects/contexts, the dual of  duplicateFpandora!Left-to-right Kleisli compositionGpandora!Right-to-left Kleisli compositionHpandoraExperimental methods AIHDGCEFB AIHDGCEFBB1C1F1G1 Safe-Inferred&'(-./0>?"Kpandora When providing a new instance, you should ensure it satisfies the three laws: * Interpreted: (.) <$> u <*> v <*> w D u <*> (v <*> w) * Left interchange: x <*> (f <$> y) D (. f) <$> x <*> y * Right interchange: f <$> (x <*> y) D (f .) <$> x <*> yLpandoraInfix version of MMpandoraPrefix version of LNpandora?$Upandora When providing a new instance, you should ensure it satisfies the two laws: * Associativity of <+>: (x <+> y) <+> z D x <+> (y <+> z) * Left-distributes <$> over <+>: f <$> (x <+> y) D (f <$> x) <+> (f <$> y)VpandoraInfix version of WWpandoraPrefix version of VUWVUWVV3 Safe-Inferred&'(-./0>?%Xpandora When providing a new instance, you should ensure it satisfies the two laws: * Left absorption: x <+> empty D x * Right absorption: empty <+> x D xXYXY Safe-Inferred&'(-./0>?'Zpandora When providing a new instance, you should ensure it satisfies the four laws: * Left adjunction identity: phi cozero D identity * Right adjunction identity: psi zero D identity * Left adjunction interchange: phi f D comap f . eta * Right adjunction interchange: psi f D epsilon . comap f[pandoraLeft adjunction\pandoraRight adjunction]pandoraPrefix and flipped version of a^pandoraPrefix and flipped version of \_pandoraAlso known as unit`pandoraAlso known as counitZ`^]_\[aaZ`^]_\[[3\3a3 Safe-Inferred&'(-./0>?(c bcdefghijk jkihgfedcb Safe-Inferred&'(-./0>?(mnopqrmnopqr Safe-Inferred&'(-./0>?)!stst Safe-Inferred&'(-./0>?+(upandora %Let f :: Distributive g => (a -> g b) When providing a new instance, you should ensure it satisfies the two laws: * Identity morphism: distribute . distribute D identity * Interchange collection: collect f D distribute . comap fvpandoraInfix and flipped version of wwpandoraPrefix version of vxpandora The dual of sequenceypandoraInfix versions of w with various nesting levelsuw{zyxvuw{zyxvv5y5z5{5 Safe-Inferred&'(-./0>?,}pandora When providing a new instance, you should ensure it satisfies the two laws: * Identity: dimap identity identity D identity * Interpreted: dimap (f . g) (h . i) D dimap g h . dimap f ipandoraPrefix version of ~}~}~~4 Safe-Inferred&'(-./0>?/apandora When providing a new instance, you should ensure it satisfies the three laws: * Duplication interchange: comap (comap f) . duplicate D duplicate . comap f * Extension interchange: extend f D comap f . duplicatepandoraInfix and flipped version of , the dual of >>=pandoraFlipped version of >>=, the dual of =<<pandoraPrefix and flipped version of , the dual of bindpandora&Clone existing structure, the dual of joinpandora#Right-to-left Cokleisli compositionpandora#Left-to-right Cokleisli compositionpandoraExperimental methods  1111 Safe-Inferred&'(-./0>?0pandora When providing a new instance, you should ensure it satisfies the two laws: Identity morphisms: invmap identity identity = identity Interpreted of morphisms: invmap g j . invmap f h = invmap (g . f) (h . j) Safe-Inferred&'(-./0>?1% Safe-Inferred&'(-./0>?2pandora Let f :: (Pointable t, Bindable t) => a -> t a Let g :: (Pointable t, Bindable t) => a -> t a Let h :: (Pointable t, Bindable t) => t a When providing a new instance, you should ensure it satisfies the three laws: * Left identity: point a >>= f D f a * Right identity: h >>= point D h * Associativity: h >>= (f >=> g) D (h >>= f) >>= g1111 Safe-Inferred&'(-./0>?3a Safe-Inferred&'(-./0>?5Jpandora When providing a new instance, you should ensure it satisfies the three laws: * Isomorphism (to): tabulate . index D identity * Isomorphism (from): index . tabulate D identity * Right adjoint: tabulate . point D point * Interchange tabulation: comap f . tabulate D tabulate . comap fpandoraInfix and flipped version of pandoraPrefix and flipped version of  Safe-Inferred&'(-./0>?8pandora Let f :: (Applicative t, Applicative g) => t a -> u a Let p :: (Pointable t, Pointable g) => t a -> u a When providing a new instance, you should ensure it satisfies the four laws: * Naturality of traversing: g . traverse f D traverse (g . f) * Naturality of sequencing: f . sequence = sequence . comap f * Preserving point: p (point x) D point x * Preserving apply: f (x <*> y) D f x <*> f ypandoraInfix version of pandoraPrefix version of pandora The dual of  distributepandoraInfix versions of  with various nesting levels5555 Safe-Inferred&'(-./0>?8 Safe-Inferred&'(-./0>?8  Safe-Inferred&'(-./0>?9R! Safe-Inferred&'(-./0>?9" Safe-Inferred&'(-./0>?:# Safe-Inferred&'(-./0>?;pandora When providing a new instance, you should ensure it satisfies the one law: * Associativity: x + (y + z) D (x + y) + z6$ Safe-Inferred&'(-./0>?<'pandora When providing a new instance, you should ensure it satisfies the two laws: * Left distributivity: x * (y + z) D x * y + x * z * Right distributivity: (y + z) * x D y * x + z * x7% Safe-Inferred&'(-./0>?=#pandora When providing a new instance, you should ensure it satisfies the two laws: * Right absorption: zero + x D x * Left absorption: x + zero D x& Safe-Inferred&'(-./0>?>)pandora When providing a new instance, you should ensure it satisfies the one law: * Additive identity is a multiplicative annihilator: zero * x@=@x@ * zero =@zero' Safe-Inferred&'(-./0>??,pandora When providing a new instance, you should ensure it satisfies the two laws: * Right absorption: x * invert x D zero * Left absorption: invert x * x D zero( Safe-Inferred&'(-./0>?@ pandora When providing a new instance, you should ensure it satisfies the one law: * Commutativity of addition: x + y D y + x) Safe-Inferred&'(-./0>?@\* Safe-Inferred&'(-./0>?Bpandora Let f :: (Pointable t, Bindable t) => t a -> b Let g :: (Pointable t, Bindable t) => t a -> b When providing a new instance, you should ensure it satisfies the three laws: * Left identity: extend extract D identity * Right identity: extract . extend f D f * Associativity: extend f . extend g D extend (f . extend g)+ Safe-Inferred&'(-./0>?BY"#$%10/.-,+*'(&)2?>=<9876;543:AIHDGCEBFKSRONPQLMUVWXYZ`^]_[\astuw{zyvx}~, Safe-Inferred&'(-./0>?CB- Safe-Inferred&'(-./0>?C1. Safe-Inferred&'(-./0>?D/ Safe-Inferred&'(-./0>?DZ0 Safe-Inferred&'(-./0>?FIpandora When providing a new instance, you should ensure it satisfies the three laws: * Associativity: x \/ (y \/ z) D (x \/ y) \/ z * Commutativity: x \/ y D y \/ x * Idempotency: x \/ x D xpandora When providing a new instance, you should ensure it satisfies the three laws: * Associativity: x /\ (y /\ z) D (x /\ y) /\ z * Commutativity: x /\ y D y /\ x * Idempotency: x /\ x D x1 Safe-Inferred&'(-./0>?G8pandora When providing a new instance, you should ensure it satisfies the one law: * Absorption: a \/ (a /\ b) D a /\ (a \/ b) D a2 Safe-Inferred&'(-./0>?H pandora When providing a new instance, you should ensure it satisfies one law: * Associativity: x * (y * z) D (x * y) * z3 Safe-Inferred&'(-./0>?IVpandora When providing a new instance, you should ensure it satisfies the four laws: * Reflexivity: x == x D True * Symmetry: x == y D y == x * Transitivity: x == y * y == z D True ===> x == z D True * Negation: x /= y D not (x == y)444 Safe-Inferred&'(-./0>?Jpandora When providing a new instance, you should ensure it satisfies the three laws: * Reflexivity: x <= x D True * Transitivity: x <= y && y <= z D True ===> x <= z D True * Antisymmetry: x <= y && y <= x D True ===> x == y D Truem Safe-Inferred&'(-./0>?K5 Safe-Inferred&'(-./0>?K 6 Safe-Inferred&'(-./0>?K7 Safe-Inferred&'(-./0>?L]08 Safe-Inferred&'(-./0>?L9 Safe-Inferred&'(-./0>?M'11: Safe-Inferred&'(-./0>?M; Safe-Inferred&'(-./0>?M< Safe-Inferred&'(-./0>?NV= Safe-Inferred&'(-./0>?N1> Safe-Inferred&'(-./0>?O ? Safe-Inferred&'(-./0>?P'pandora When providing a new instance, you should ensure it satisfies one law: * Identity morphism: hoist identity D identity * Interpreted of morphisms: hoist (f . g) D hoist f . hoist g@ Safe-Inferred&'(-./0>?Ppandora When providing a new instance, you should ensure it satisfies one law: * Interchange: lift . point D pointA Safe-Inferred&'(-./0>?QPB Safe-Inferred&'(-./0>?QC Safe-Inferred&'(-./0>?RD Safe-Inferred&'(-./0>?ReE Safe-Inferred&'(-./0>?SypandoraCall with current continuationpandora Delimit the continuation of any pandora5Capture the continuation up to the nearest enclosing  and pass itF Safe-Inferred&'(-./0>?Upandora!Take incoming value from pipelinepandora$Give a value to the future consumingpandoraPipeline that does nothingpandora-Do some effectful computation within pipelinepandoraCompose two pipelines into onepandoraRun pipeline and get resultG Safe-Inferred&'(-./0>?W! pandoraMake continuation observablepandora,Listen only first event, call back just oncepandoraInfix version of pandora*Listen only first event, call back foreverpandoraInfix version of pandora2Listen all events from action, call back just oncepandoraInfix version of pandora0Listen all events from action, call back foreverpandoraInfix version of   H Safe-Inferred&'(-./0>?W3I Safe-Inferred&'(-./0>?Xpandora When providing a new instance, you should ensure it satisfies one law: * Interchange: extract . lower D extractn Safe-Inferred&'(-./0>?XJ Safe-Inferred&'(-./0>?Y5 "#$%10/.-,+*'(&)2?>=<9876;543:AIHDGCEBFKSRONPQLMUVWXYZ`^]_[\astuw{zyvx}~K Safe-Inferred&'(-./0>?ZjL Safe-Inferred&'(-./0>?Z  M Safe-Inferred&'(-./0>?[HN Safe-Inferred&'(-./0>?["bcdefghijkO Safe-Inferred&'(-./0>?\6P Safe-Inferred&'(-./0>?\Q Safe-Inferred&'(-./0>?\R Safe-Inferred&'(-./0>?];S Safe-Inferred&'(-./0>?]3T Safe-Inferred&'(-./0>?] U Safe-Inferred&'(-./0>?^eV Safe-Inferred&'(-./0>?^W Safe-Inferred&'(-./0>?_#o Safe-Inferred&'(-./0>?_zX Safe-Inferred&'(-./0>?_  Y Safe-Inferred&'(-./0>?`@mnopqrZ Safe-Inferred&'(-./0>?aB  [ Safe-Inferred&'(-./0>?a\ Safe-Inferred&'(-./0>?b] Safe-Inferred&'(-./0>?bk^ Safe-Inferred&'(-./0>?bp Safe-Inferred&'(-./0>?c) q Safe-Inferred&'(-./0>?c# _ Safe-Inferred&'(-./0>?d'` Safe-Inferred&'(-./0>?da Safe-Inferred&'(-./0>?dr Safe-Inferred&'(-./0>?e9&s Safe-Inferred&'(-./0>?emnopqrb Safe-Inferred&'(-./0>?g!c Safe-Inferred&'(-./0>?hpandoraLens composition infix operatorpandoraGet the target of a lenspandoraInfix version of pandoraReplace the target of a lenspandoraInfix version of pandoraModify the target of a lenspandoraInfix version of   0d Safe-Inferred&'(-./0>?i e Safe-Inferred&'(-./0>?if Safe-Inferred&'(-./0>?jvpandora=Linear data structure that serves as a collection of elementspandora0Transform any traversable structure into a stack  g Safe-Inferred&'(-./0>?jh Safe-Inferred&'(-./0>?k=i Safe-Inferred&'(-./0>?kt Safe-Inferred&'(-./0>?kj Safe-Inferred&'(-./0>?ly(k Safe-Inferred&'(-./0>?m0u Safe-Inferred&'(-./0>?m bcdefghijkmnopqrvwxyz{|}~                                                      !!!!!!!!""""""""##$$%%&&''()))*+++,,,,,,----------...//////000001233344444455556666666666666777777777777777777777777778888999999999999999999999::::::;;;;<<<<<<<<<<<<<<<<<<<<<<<<============>>>>>>>>>>>>>>>>>??@@AAAAAAAAAAABBBBBBBBBBCCCCCCCCCCCCCCCDDDDDDDDDDDEEEEEEEEEEEEEFFFFFFFFFGGGGGGGGGGHHHHHHHHHHHHHHHHHHHIIJJJKKKKKKKKKLLLLLLLLLLLLLMMMMMMMMMMNNNNNOOOOOOOOOOOPPPPPPPPPQQQQQQQQQQQQQRRRRRRRRRRRRRSSSSSSSSSSSSSSSSSSTUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUVVVVVVVVVVVVVVVVVVVVVVVVVVVVWWXXXXXXXXXXXXXXXXXXXXXXXXXXXXXYYYYYYYYYZZZZZZZZZZZZZZZZZZZZZZZ[[[[[[[[[[[[[\\\\\\\\\\\\]]]]]]]]]]]]]]]]^^^^^^^^^^^^^^_________________________````aaaaabbbbbbbbbbbbbbbccccccccccddddeeeeeeefffffffffffffffffffggggghhhhhhhhhhhiiiiiiiiiijjjjkkkkkkk#pandora-0.3.2-EviWPzskOWjgrYKi6A3f1Pandora.Core.FunctorPandora.Core.Morphism/Pandora.Paradigm.Controlflow.Effect.Interpreted(Pandora.Paradigm.Primary.Object.OrderingPandora.Paradigm.Schemes.TUVW-Pandora.Paradigm.Structure.Ability.Insertable+Pandora.Paradigm.Structure.Ability.Nonempty)Pandora.Paradigm.Structure.Ability.ZipperPandora.Pattern.Category!Pandora.Pattern.Functor.Bivariant%Pandora.Pattern.Functor.Contravariant!Pandora.Pattern.Functor.Covariant Pandora.Pattern.Functor.Bindable#Pandora.Pattern.Functor.Applicative#Pandora.Pattern.Functor.Alternative!Pandora.Pattern.Functor.AvoidablePandora.Pattern.Functor.AdjointPandora.Paradigm.Schemes.UTU$Pandora.Paradigm.Primary.Functor.Fix$Pandora.Pattern.Functor.Determinable$Pandora.Pattern.Functor.Distributive!Pandora.Pattern.Functor.Divariant"Pandora.Pattern.Functor.Extendable!Pandora.Pattern.Functor.Invariant!Pandora.Pattern.Functor.PointablePandora.Pattern.Functor.Monad&Pandora.Paradigm.Primary.Functor.Proxy%Pandora.Pattern.Functor.Representable#Pandora.Pattern.Functor.Traversable$Pandora.Paradigm.Primary.Functor.Wye(Pandora.Paradigm.Primary.Transformer.Kan&Pandora.Paradigm.Primary.Functor.Wedge&Pandora.Paradigm.Primary.Functor.These&Pandora.Paradigm.Primary.Functor.Edges Pandora.Pattern.Object.SemigroupPandora.Pattern.Object.RingoidPandora.Pattern.Object.Monoid Pandora.Pattern.Object.QuasiringPandora.Pattern.Object.GroupPandora.Pattern.Object.Ring#Pandora.Pattern.Functor.ExtractablePandora.Pattern.Functor.ComonadPandora.Pattern.Functor(Pandora.Paradigm.Primary.Transformer.Jet'Pandora.Paradigm.Primary.Object.Boolean,Pandora.Paradigm.Primary.Functor.Equivalence%Pandora.Paradigm.Primary.Functor.Endo"Pandora.Pattern.Object.SemilatticePandora.Pattern.Object.LatticePandora.Pattern.Object.SemiringPandora.Pattern.Object.SetoidPandora.Pattern.Object.ChainPandora.Paradigm.Primary.Object+Pandora.Paradigm.Primary.Functor.Validation'Pandora.Paradigm.Primary.Functor.Tagged,Pandora.Paradigm.Structure.Ability.Rotatable(Pandora.Paradigm.Primary.Functor.Product*Pandora.Paradigm.Primary.Functor.Predicate,Pandora.Paradigm.Structure.Ability.Monotonic)Pandora.Paradigm.Primary.Functor.Identity&Pandora.Paradigm.Primary.Functor.Delta)Pandora.Paradigm.Primary.Functor.Constant%Pandora.Pattern.Transformer.Hoistable$Pandora.Pattern.Transformer.Liftable+Pandora.Paradigm.Primary.Transformer.Yoneda,Pandora.Paradigm.Primary.Transformer.Outline)Pandora.Paradigm.Primary.Transformer.Jack0Pandora.Paradigm.Primary.Transformer.Instruction1Pandora.Paradigm.Primary.Transformer.Continuation%Pandora.Paradigm.Controlflow.Pipeline'Pandora.Paradigm.Controlflow.Observable7Pandora.Paradigm.Controlflow.Effect.Transformer.Monadic%Pandora.Pattern.Transformer.LowerablePandora.PatternPandora.Paradigm.Schemes.UTPandora.Paradigm.Schemes.TUTPandora.Paradigm.Schemes.TUPandora.Paradigm.Schemes(Pandora.Paradigm.Primary.Transformer.Tap(Pandora.Paradigm.Primary.Transformer.Day.Pandora.Paradigm.Primary.Transformer.Backwards,Pandora.Paradigm.Primary.Transformer.Reverse9Pandora.Paradigm.Controlflow.Effect.Transformer.Comonadic/Pandora.Paradigm.Controlflow.Effect.Transformer-Pandora.Paradigm.Controlflow.Effect.Adaptable&Pandora.Paradigm.Primary.Functor.Maybe(Pandora.Paradigm.Structure.Interface.Set+Pandora.Paradigm.Primary.Functor.Conclusion Pandora.Paradigm.Primary.Functor Pandora.Paradigm.Inventory.State"Pandora.Paradigm.Inventory.Imprint$Pandora.Paradigm.Inventory.Equipment&Pandora.Paradigm.Inventory.Environment&Pandora.Paradigm.Inventory.Accumulator1Pandora.Paradigm.Primary.Transformer.Construction!Pandora.Paradigm.Structure.Stream0Pandora.Paradigm.Structure.Ability.Comprehension Pandora.Paradigm.Inventory.Store!Pandora.Paradigm.Inventory.Optics/Pandora.Paradigm.Structure.Ability.Substructure,Pandora.Paradigm.Structure.Ability.Focusable Pandora.Paradigm.Structure.StackPandora.Paradigm.Structure.Rose!Pandora.Paradigm.Structure.Binary Pandora.Paradigm.Structure.SplayPandora.Paradigm.InventoryPandora.Paradigm.Structure Pandora.CorePandora.Pattern.ObjectPandora.Pattern.Transformer$Pandora.Paradigm.Structure.Interface#Pandora.Paradigm.Controlflow.EffectPandora.Paradigm.Controlflow$Pandora.Paradigm.Primary.TransformerPandora.Paradigm.Primary"Pandora.Paradigm.Structure.AbilityPandora.Paradigm::|::::|.:::|:.~><-||->.::.:=fix&!% InterpretedPrimaryrun SchematicOrderingLessEqualGreaterorderTUVW$fInterpretedTUVW InsertableinsertNonemptyZipperCategoryidentity.$ $fCategory-> Bivariant<->bimap Contravariant>$< contramap>$$<full>&<>$$<>$$$<>$$$$<>&&<>&&&<>&&&&< Covariant<$>comap<$$>voidloeb<&><$$><$$$><$$$$><&&><&&&><&&&&> $fCovariant->Bindable>>==<<bindjoin>=><=<$>>=<>>= $fBindable-> Applicative<*>apply*><*forever<**><***><****>$fApplicative-> Alternative<+>alter AvoidableemptyAdjoint-||-phipsietaepsilon>.>:<.<<.>:<.<>.>:<.><.>:<.>>.<:>.<<.<:>.<>.<:>.><.<:>.>UTU$fInterpretedUTUFixunfixcataanahylo Determinable determine Distributive>>-collect distribute>>>->>>>->>>>>-$fDistributive-> Divariant>->dimap $fDivariant-> Extendable=>><<=extend duplicate=<==>=$=>><<=$ Invariantinvmap Pointablepoint $fPointable->Monad>>=-->>=-=<<=<<-Proxy$fExtendableProxy $fMonadProxy$fBindableProxy$fDistributiveProxy$fAlternativeProxy$fApplicativeProxy$fPointableProxy$fContravariantProxy$fCovariantProxy RepresentableRepresentation<#>tabulateindex$fRepresentable-> Traversable->>traversesequence->>>->>>>->>>>>WyeEndLeftRightBothwyeswop$fTraversableWye$fCovariantWyeKanRanLan$fInterpretedKan$fCovariantKan$fInterpretedKan0$fContravariantKanWedgeNowhereHereTherewedge$fTraversableWedge$fPointableWedge$fCovariantWedgeTheseThisThatthese$fTraversableThese$fPointableThese$fCovariantTheseEdgesEmptyLeapConnectOverlayedges$fTraversableEdges$fCovariantEdges Semigroup+Ringoid*Monoidzero QuasiringoneGroupinvertRing Extractableextract$fExtractable->Comonad<*+><**+><***+>Jet$fExtractableJet$fPointableJet$fTraversableJet$fCovariantJetBooleanTrueFalsebool?$fGroupBoolean$fQuasiringBoolean$fMonoidBoolean$fRingoidBoolean$fSemigroupBoolean Equivalence$fContravariantEquivalenceEndoendo $fMonoidEndo$fSemigroupEndo$fInvariantEndo SemilatticeSupremum\/Infimum/\LatticeSemiringSetoid==/=Chain<=><<=>>=$fChainOrdering$fSetoidOrdering$fChainBoolean$fSetoidBoolean ValidationFlaws Validated validation$fSemigroupValidation$fChainValidation$fSetoidValidation$fBivariantValidation$fTraversableValidation$fAlternativeValidation$fApplicativeValidation$fPointableValidation$fCovariantValidation:#TaggedTagretagtagself $fGroupTagged$fLatticeTagged$fSupremumTagged$fInfimumTagged$fQuasiringTagged$fRingoidTagged$fMonoidTagged$fSemigroupTagged $fChainTagged$fSetoidTagged$fBivariantTagged$fComonadTagged$fExtendableTagged $fMonadTagged$fBindableTagged$fDistributiveTagged$fTraversableTagged$fApplicativeTagged$fExtractableTagged$fPointableTagged$fCovariantTagged Rotatable Rotationalrotationrotate:*:Productdeltaswapattached$fBivariantProduct$fComonadProduct$fExtendableProduct$fTraversableProduct$fExtractableProduct$fCovariantProduct$fGroupProduct$fLatticeProduct$fSupremumProduct$fInfimumProduct$fQuasiringProduct$fRingoidProduct$fMonoidProduct$fSemigroupProduct$fSetoidProduct Predicateequatesatisfy$fDeterminablePredicate$fContravariantPredicate Monotonicbypassfind $fMonotonicaaIdentity$fGroupIdentity$fLatticeIdentity$fSupremumIdentity$fInfimumIdentity$fQuasiringIdentity$fRingoidIdentity$fMonoidIdentity$fSemigroupIdentity$fChainIdentity$fSetoidIdentity$fAdjointIdentityIdentity$fRepresentableIdentity$fComonadIdentity$fExtendableIdentity$fMonadIdentity$fBindableIdentity$fDistributiveIdentity$fTraversableIdentity$fApplicativeIdentity$fExtractableIdentity$fPointableIdentity$fCovariantIdentityDelta:^:$fRingoidDelta$fSemigroupDelta $fSetoidDelta$fRepresentableDelta$fExtendableDelta$fTraversableDelta$fDistributiveDelta$fApplicativeDelta$fPointableDelta$fCovariantDeltaConstant$fGroupConstant$fLatticeConstant$fSupremumConstant$fInfimumConstant$fQuasiringConstant$fRingoidConstant$fMonoidConstant$fSemigroupConstant$fChainConstant$fSetoidConstant$fBivariantConstant$fTraversableConstant$fInvariantConstant$fContravariantConstant$fCovariantConstant HoistablehoistLiftableliftYonedayoneda$fAdjointYonedaYoneda$fLiftableYoneda$fExtractableYoneda$fPointableYoneda$fAvoidableYoneda$fApplicativeYoneda$fAlternativeYoneda$fCovariantYonedaOutlineLineOutlined$fInterpretedOutline$fHoistableTYPEOutline$fLiftableOutline$fApplicativeOutline$fExtractableOutline$fPointableOutline$fCovariantOutlineJackItOtherjack $fChainJack $fSetoidJack$fLiftableJack$fDistributiveJack$fTraversableJack$fApplicativeJack$fExtractableJack$fAvoidableJack$fAlternativeJack$fPointableJack$fCovariantJack InstructionEnterInstruct$fLiftableInstruction$fTraversableInstruction$fBindableInstruction$fApplicativeInstruction$fAvoidableInstruction$fAlternativeInstruction$fPointableInstruction$fCovariantInstruction Continuationcontinuecwccresetshift interruptable$fLiftableContinuation$fMonadContinuation$fBindableContinuation$fApplicativeContinuation$fPointableContinuation$fCovariantContinuationPipelineawaityieldfinishimpact=*=pipeline$fContravariantPipe$fCovariantPipe Observableobservenotify.:~.follow.:~* subscribe*:~.watch*:~*:>TMtmMonadicwrap$fInterpreted:>$fHoistableTYPE:> $fLiftable:> $fMonad:>$fExtendable:> $fBindable:>$fDistributive:>$fTraversable:> $fAvoidable:>$fAlternative:>$fApplicative:>$fExtractable:> $fPointable:> $fCovariant:> Lowerablelower.|...|....|....>.:<<.:<>.:><.:>UT$fInterpretedUT $fLowerableUT $fLiftableUT>:>.<:<<:>.<:<>:>.<:><:>.<:>>:<.>:<<:<.>:<>:<.>:><:<.>:>TUT$fInterpretedTUT$fLowerableTUT $fLiftableTUT>:.<<:.<>:.><:.>TU$fInterpretedTU$fHoistableTYPETU $fLowerableTU $fLiftableTU$fAdjointTUTTUT $fAdjointUTTU $fAdjointUTUT $fAdjointTUUT $fAdjointTUTUTap$fHoistableTYPETap$fLowerableTap$fExtendableTap $fBindableTap$fTraversableTap$fApplicativeTap$fExtractableTap$fPointableTap$fCovariantTapDay$fHoistableTYPEDay$fLowerableDay$fExtendableDay$fExtractableDay$fApplicativeDay$fPointableDay$fCovariantDay Backwards$fHoistableTYPEBackwards$fLowerableBackwards$fLiftableBackwards$fInterpretedBackwards$fContravariantBackwards$fDistributiveBackwards$fTraversableBackwards$fApplicativeBackwards$fExtractableBackwards$fPointableBackwards$fCovariantBackwardsReverse$fHoistableTYPEReverse$fLowerableReverse$fLiftableReverse$fInterpretedReverse$fContravariantReverse$fDistributiveReverse$fTraversableReverse$fApplicativeReverse$fExtractableReverse$fPointableReverse$fCovariantReverse:<TCtc Comonadicbring$fInterpreted:<$fHoistableTYPE:< $fLowerable:< $fComonad:<$fExtendable:< $fBindable:<$fDistributive:<$fTraversable:<$fAlternative:<$fApplicative:<$fExtractable:< $fPointable:< $fCovariant:< Transformer Adaptableadapt$fAdaptableTYPE:>:>$fAdaptableTYPE:>:>0$fAdaptableTYPE:>:>1$fAdaptableTYPE:>:>2$fAdaptableTYPE:>:>3$fAdaptableTYPE:>:>4$fAdaptableTYPE:>:>5$fAdaptableTYPE:>:>6$fAdaptableTYPEtt$fAdaptableTYPEh:>$fAdaptableTYPEf:>$fAdaptableTYPEz:>$fAdaptableTYPEy:>$fAdaptableTYPEx:>$fAdaptableTYPEw:>$fAdaptableTYPEv:>$fAdaptableTYPEu:>$fAdaptableTYPE:0$fAdaptableTYPEz:>0$fAdaptableTYPEy:>0$fAdaptableTYPEx:>0$fAdaptableTYPEw:>0$fAdaptableTYPEv:>0$fAdaptableTYPEu:>0$fAdaptableTYPEt:>$fAdaptableTYPE:Decisive MemorableStatefulStatecurrentmodifyreplacefold$fAvoidableTUT$fAlternativeTUT $fMonadTUT $fBindableTUT$fPointableTUT$fApplicativeTUT$fCovariantTUT$fMonadicState$fInterpretedState $fMonadState$fBindableState$fPointableState$fApplicativeState$fCovariantState TraceableImprint$fExtendableUT$fExtractableUT$fComonadicImprint$fInterpretedImprint$fExtendableImprint$fExtractableImprint$fDistributiveImprint$fCovariantImprint Equipmentretrieve$fExtendableTU$fExtractableTU $fCovariantTU$fComonadEquipment$fComonadicEquipment$fInterpretedEquipment$fExtendableEquipment$fExtractableEquipment$fCovariantEquipment Configured Environmentenv $fBindableTU$fApplicativeTU $fPointableTU$fMonadicEnvironment$fInterpretedEnvironment$fMonadEnvironment$fBindableEnvironment$fDistributiveEnvironment$fApplicativeEnvironment$fPointableEnvironment$fCovariantEnvironment Accumulated Accumulatorgather$fMonadicAccumulator$fInterpretedAccumulator$fBindableAccumulator$fPointableAccumulator$fApplicativeAccumulator$fCovariantAccumulator Construction Construct deconstructiteratesection$fTraversableTU $fAvoidableTU$fAlternativeTU$fMonoidConstruction$fSemigroupConstruction$fSetoidConstruction$fHoistableTYPEConstruction$fLowerableConstruction$fComonadConstruction$fMonadConstruction$fExtendableConstruction$fBindableConstruction$fTraversableConstruction$fApplicativeConstruction$fExtractableConstruction$fPointableConstruction$fCovariantConstructionStreamrepeat$fRotatable->RightTap$fRotatable->LeftTap Comprehension$fBindableComprehension$fCovariantComprehension$fInterpretedComprehensionStorableStorepositionaccessretrofit$fExtendableTUT$fExtractableTUT$fComonadicStore$fInterpretedStore$fComonadStore$fExtendableStore$fExtractableStore$fCovariantStoreLens:-.|>view^.set.~over%~ represent Substructure Substructural substructuresubLocationRootHead FocusableFocusingfocusingfocusStackpopdeletefilter linearizeforwardbackwardforward' backward'$fMonotonicTUa$fMonotonicMaybea$fMonotonicConstructiona$fInsertableConstruction#$fFocusableLocationHeadConstruction$fInsertableTU$fFocusableLocationHeadTU $fMonoidTU $fSemigroupTU $fSetoidTURose#$fSubstructureMaybeJustConstruction#$fFocusableLocationRootConstruction$fSubstructureMaybeJustTU$fFocusableLocationRootTUBinary rebalance can_be_empty"$fSubstructureWyeRightConstruction!$fSubstructureWyeLeftConstruction$fSubstructureWyeRightTU$fSubstructureWyeLeftTUSplayZigZag maybe_subtree$fRotatableWyeRightConstruction$fRotatableWyeLeftConstruction $fRotatableWyeRightConstruction0$fRotatableWyeLeftConstruction0 $fRotatableWyeRightConstruction1$fRotatableWyeLeftConstruction1zoom$fAdjointEquipmentEnvironment$fAdjointAccumulatorImprint$fAdjointStoreState$fSubstructureWyeRightTap$fSubstructureWyeLeftTap$fSubstructureWyeRightDelta$fSubstructureWyeLeftDelta$fSubstructureWyeRightProduct$fSubstructureWyeLeftProduct$fMonotonicProducts