h$,A      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~                                                                                                                                                                                                                                                                                                                                    None '(-./029<>?  subcategories Similar to  from mono-traversable, but uses newtype instaed of GADTs, which is efficient. To restrict the construction, we hide genuine constructor and expose the constrained pattern synonym  9 and specifies type roles tightly (note: the role for mono5 should NOT be representational honestly; indeed, WrapMono mono a could be coerced to WrapMono mono' a iff mono and +mono' are representationally equivalent AND Element a ~ Element a.)  None!'(-./029<=>?    44None'(-./029<=>?NNone'(-./029<=>?None'(-./09<>?11None'(-./09<>?Y4None'(-./09<>?3None'(-./029<>?  None'(-./09<>?q0     None'(-./029<>? None'(-./029<=>?v  None! '(-./029<=>? subcategoriesFree monoid functor from fullsubcategory. It must be a pointed foldable functor with the property that for any  w and  f :: a -> w,  f must be a monoid homomorphism and the following must be hold:   f .  == f Hence, Sets! cannot be a free monoid functor; subcategoriesThe  function takes the input list's length as a hint. Its behaviour should be equivalent to . The hint can be used to construct the structure l more efficiently compared to . If the given hint does not equal to the input list's length the behaviour of fromListN is not specified. subcategoriesN.B. If we require g to be " we cannot directly lift plain  to . This is rather annoying, so we require the strongest possible constraint to g here. subcategoriesFold-optic for  instances. In the terminology of lens, cfolded is a constrained variant of folded optic. 6 cfolded :: (CFoldable t, Dom t a) => Fold (t a) a  subcategoriesLifts  along given function.  cfolding :: (CFoldable t, Dom t a) => (s -> t a) -> Fold s a  None'(-./09<>?@      !  " # $%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~                                                                                                                                                                                                                                                                                                                                     ,subcategories-0.2.0.0-6dPWN72oste9A35Ievm4xj$Control.Subcategory.RebindableSyntaxControl.Subcategory.FunctorControl.Subcategory.SemialignControl.Subcategory.PointedControl.Subcategory.Bind%Control.Subcategory.Applicative.Class%Control.Subcategory.Alternative.ClassControl.Subcategory.ApplicativeControl.Subcategory.AlternativeControl.Subcategory.ZipControl.Subcategory.Foldable$Control.Subcategory.Wrapper.InternalControl.SubcategorybaseGHC.Num fromInteger-ghc-prim GHC.Classes==negateEqNumGHC.OverloadedLabels fromLabelsignumabs*+/=WrapMono WrapFunctor runFunctor unwrapMono coerceToMonowithMonoCoercibleCFunctorcmap<$: ConstrainedDomdefaultCmapConst<$:>$fMonoFunctorIntSet$fConstrainedPrimArray$fConstrainedVector$fConstrainedVector0$fConstrainedVector1$fConstrainedVector2$fConstrainedTree$fConstrainedHashMap$fConstrainedHashSet$fConstrainedSet$fConstrainedMap$fConstrainedIntMap$fConstrainedWrapMono$fConstrainedWrappedMono$fConstrainedSeq$fConstrainedM1$fConstrainedCompose$fConstrainedProduct$fConstrainedSum$fConstrained:.:$fConstrained:*:$fConstrained:+:$fConstrainedK1$fConstrained->$fConstrainedWrappedArrow$fConstrainedConst$fConstrainedAlt$fConstrainedAp$fConstrainedURec$fConstrainedURec0$fConstrainedURec1$fConstrainedURec2$fConstrainedURec3$fConstrainedURec4$fConstrainedRec1$fConstrainedArg$fConstrainedWrappedMonad$fConstrainedArrowMonad$fConstrainedProxy$fConstrainedST$fConstrainedST0$fConstrained(,)$fConstrainedU1$fConstrainedV1$fConstrainedEither$fConstrainedComplex$fConstrainedMin$fConstrainedMax$fConstrainedFirst$fConstrainedLast$fConstrainedOption$fConstrainedArgOrder$fConstrainedOptDescr$fConstrainedArgDescr$fConstrainedZipList$fConstrainedIdentity$fConstrainedHandler$fConstrainedSTM$fConstrainedFirst0$fConstrainedLast0$fConstrainedDual$fConstrainedSum0$fConstrainedProduct0$fConstrainedDown$fConstrainedReadPrec$fConstrainedReadP$fConstrainedNonEmpty$fConstrainedPar1$fConstrainedIO$fConstrainedMaybe$fConstrained[]$fConstrainedWrapFunctor$fCFunctorPrimArray$fCFunctorVector$fCFunctorVector0$fCFunctorVector1$fCFunctorVector2$fCFunctorTree$fCFunctorHashMap$fCFunctorHashSet $fCFunctorSet $fCFunctorMap$fCFunctorIntMap$fCFunctorWrapMono$fCFunctorWrappedMono $fCFunctorSeq $fCFunctorM1$fCFunctorCompose$fCFunctorProduct $fCFunctorSum $fCFunctor:.: $fCFunctor:*: $fCFunctor:+: $fCFunctorK1 $fCFunctor->$fCFunctorWrappedArrow$fCFunctorConst$fCFunctorURec$fCFunctorURec0$fCFunctorURec1$fCFunctorURec2$fCFunctorURec3$fCFunctorURec4$fCFunctorRec1 $fCFunctorArg$fCFunctorWrappedMonad$fCFunctorArrowMonad$fCFunctorProxy $fCFunctorST $fCFunctorST0 $fCFunctor(,) $fCFunctorU1 $fCFunctorV1$fCFunctorEither$fCFunctorComplex $fCFunctorMin $fCFunctorMax$fCFunctorFirst$fCFunctorLast$fCFunctorOption$fCFunctorArgOrder$fCFunctorOptDescr$fCFunctorArgDescr$fCFunctorZipList$fCFunctorIdentity$fCFunctorHandler $fCFunctorSTM$fCFunctorFirst0$fCFunctorLast0$fCFunctorDual$fCFunctorSum0$fCFunctorProduct0$fCFunctorDown$fCFunctorReadPrec$fCFunctorReadP$fCFunctorNonEmpty$fCFunctorPar1 $fCFunctorIO$fCFunctorMaybe $fCFunctor[]$fCFunctorWrapFunctor$fCFunctorArray$fConstrainedArray$fCFunctorSmallArray$fConstrainedSmallArray $fCFunctorAlt $fCFunctorApCAligncnil CSemialign calignWithcaligncsaligncpadZip cpadZipWith$fCSemialignWrapMono$fCSemialignPrimArray$fCSemialignArray$fCSemialignSmallArray$fCSemialignVector$fCSemialignVector0$fCSemialignVector1$fCSemialign:.:$fCSemialignCompose$fCSemialign:*:$fCSemialignProduct$fCSemialignWrapMono0$fCSemialignWrapFunctor$fCAlignWrapMono$fCAlignPrimArray $fCAlignArray$fCAlignSmallArray$fCAlignVector$fCAlignVector0$fCAlignVector1 $fCAlign:.:$fCAlignCompose $fCAlign:*:$fCAlignProduct$fCAlignWrapFunctor$fCSemialign->$fCAlignHashMap$fCSemialignHashMap $fCAlignMap$fCSemialignMap $fCAlignProxy$fCSemialignProxy$fCAlignVector2$fCSemialignVector2 $fCAlignSeq$fCSemialignSeq$fCSemialignTree$fCAlignIntMap$fCSemialignIntMap$fCSemialignNonEmpty$fCSemialignIdentity$fCAlignZipList$fCSemialignZipList$fCAlignOption$fCSemialignOption $fCAlignMaybe$fCSemialignMaybe $fCAlign[]$fCSemialign[]CPointedcpure$fCPointedArray$fCPointedSmallArray$fCPointedPrimArray$fCPointedVector$fCPointedVector0$fCPointedVector1$fCPointedVector2$fCPointedWrapMono$fCPointedHashSet$fCPointedWrapMono0$fCPointedReadPrec$fCPointedReadP$fCPointedProduct$fCPointedCompose $fCPointed:.: $fCPointed:*:$fCPointedRec1$fCPointedProxy $fCPointedU1$fCPointedEither $fCPointedSet $fCPointedSeq$fCPointedTree$fCPointedDown$fCPointedProduct0 $fCPointedSum$fCPointedDual $fCPointedSTM$fCPointedIdentity$fCPointedZipList$fCPointedNonEmpty$fCPointedOption$fCPointedLast$fCPointedFirst$fCPointedLast0$fCPointedFirst0 $fCPointedMax $fCPointedMin$fCPointedPar1 $fCPointedST $fCPointedST0 $fCPointedIO$fCPointedMaybe $fCPointed[]$fCPointedWrapFunctorCMonadCBind>>-cjoin-<<creturn$fCBindProduct $fCBind(,)$fCBindReadPrec $fCBindReadP$fCBindHashSet $fCBind-> $fCBindOption $fCBindSeq$fCBindNonEmpty$fCBindWrapMono $fCBindSet$fCBindHashMap $fCBindMap $fCBindIntMap $fCBindMaybe $fCBindTree $fCBindEither$fCBindIdentity $fCBindST $fCBindST0 $fCBindSTM $fCBindIO $fCBind[]$fCBindWrapFunctor $fCMonadf CApplicativepair<.>.><. CAlternativecemptyCChoiceCApprunCAppdefaultLeftApplydefaultRightApply$fCApplicativeHashSet$fCApplicativeSet$fCApplicativeHashMap$fCApplicativeMap$fCApplicativeIntMap$fCApplicative(,)$fCApplicativeWrapFunctor$fCApplicativeProduct$fCApplicativeEither$fCApplicative->$fCApplicativeNonEmpty$fCApplicativeOption$fCApplicativeSeq$fCApplicativeTree$fCApplicativeIdentity$fCApplicativeMaybe$fCApplicativeZipList$fCApplicativeST$fCApplicativeST0$fCApplicativeReadPrec$fCApplicativeArray$fCApplicativeSmallArray$fCApplicativeVector$fCApplicativeReadP$fCApplicativeSTM$fCApplicativeIO$fCApplicative[]$fCApplicativeConst$fDomOverkfgab $fMonoidCApp$fSemigroupCApp$fConstrainedCApp $fReadCApp $fShowCApp$fEqCApp $fOrdCApp $fFunctorCApp$fApplicativeCApp$fAlternativeCApp$fCPointedCApp$fCApplicativeCApp$fCAlternativeCApp $fCChoiceCApp$fCFunctorCApp ifThenElse>>=>>returnCAltrunAlt$fCAlternativeReadPrec$fCAlternativeArray$fCAlternativeSmallArray$fCAlternativePrimArray$fCAlternativeVector$fCAlternativeVector0$fCAlternativeVector1$fCAlternativeVector2$fCAlternativeReadP$fCAlternativeOption$fCAlternativeSeq$fCAlternativeMaybe$fCAlternative[]$fCAlternativeProduct$fCAlternativeCompose$fCAlternativeWrapMono$fCAlternativeSet$fCAlternativeHashSet$fCAlternativeMap$fCAlternativeHashMap$fCAlternativeIntMap$fCChoiceHashMap$fCChoiceWrapMono $fCChoiceMap $fCChoiceSet$fCChoiceHashSet$fCChoiceProduct$fCChoiceCompose$fCChoiceReadPrec$fCChoiceReadP$fCChoiceIntMap$fCChoiceEither$fCChoiceNonEmpty$fCChoiceOption $fCChoiceSeq$fCChoiceArray$fCChoiceSmallArray$fCChoicePrimArray$fCChoiceVector$fCChoiceVector0$fCChoiceVector1$fCChoiceVector2$fCChoiceMaybe $fCChoice[] $fMonoidCAlt$fSemigroupCAlt $fFunctorCAlt$fConstrainedCAlt$fApplicativeCAlt$fAlternativeCAlt$fCPointedCAlt$fCApplicativeCAlt$fCAlternativeCAlt $fCChoiceCAlt$fCFunctorCAltCUnzipcunzip cunzipWithCZippy runCZippyCRepeatcrepeatCZipczipWithczip cunzipDefault$fCZipWrapMono$fCZipPrimArray $fCZipArray$fCZipSmallArray $fCZip:.: $fCZipCompose $fCZip:*: $fCZipProduct $fCZipProxy $fCZipVector $fCZipVector0 $fCZipVector1 $fCZipVector2$fCZipWrapFunctor$fCRepeatWrapFunctor$fMonoidCZippy$fSemigroupCZippy$fCRepeatCZippy $fCZipCZippy$fCSemialignCZippy$fCFunctorCZippy$fCUnzipWrapMono $fCUnzip:.:$fCUnzipCompose $fCUnzip:*:$fCUnzipProduct$fCUnzipVector$fCUnzipVector0$fCUnzipVector1$fCUnzipVector2 $fCUnzip[]$fCUnzipWrapFunctor $fShowCZippy $fReadCZippy$fFunctorCZippy $fZipCZippy$fSemialignCZippy $fEqCZippy $fOrdCZippy$fConstrainedCZippy$fRepeatCZippy$fCUnzipHashMap$fCUnzipIntMap $fCUnzipMap $fCUnzipSeq $fCUnzipProxy $fCUnzipTree$fCUnzipNonEmpty$fCUnzipIdentity$fCUnzipZipList$fCUnzipOption $fCUnzipMaybe $fCRepeat-> $fCRepeatTree$fCRepeatNonEmpty$fCRepeatIdentity$fCRepeatZipList$fCRepeatOption$fCRepeatMaybe $fCRepeat[] $fCZipIntMap $fCZipHashMap $fCZipMap $fCZipSeq$fCZip-> $fCZipTree$fCZipNonEmpty$fCZipIdentity $fCZipZipList $fCZipOption $fCZipMaybe$fCZip[] CFreeMonoidcbasicFromListcconscsnoc cfromListNctakecdropcinitctailcsplitAt creplicate cgenerate cgenerateM cgenerateAcunconscunsnoccreverse cinterspersecnubcnubOrdcsortcsortBycinsert cinsertBy ctakeWhile cdropWhilecspancbreakcfilter cpartition CTraversable ctraverse CFoldablecfoldMap cfoldMap'cfoldcfoldrcfoldlMcfoldlM'cfoldrMcfoldrM'cfoldlcfoldr'cfoldl' cbasicToListcfoldr1cfoldl1cindexcnullclengthcanycallcelemcnotElemcminimumcmaximumcsumcproduct cctraverse_ ctraverse_clastcheadcfind cfindIndex cfindIndices celemIndex celemIndicesctoList cfromListcfolded$fCFoldableVector$fCFoldableVector0$fCFoldableVector1$fCFoldableVector2$fCFoldableWrapMono$fCFoldableHashSet$fCFoldableSet$fCFoldablePrimArray$fCFoldableProduct$fCFoldableSum$fCFoldable:*:$fCFoldable:+:$fCFoldableWrapFunctor$fCTraversableVector$fCTraversableVector0$fCTraversableVector1$fCTraversableVector2$fCTraversableWrapMono$fCTraversableHashSet$fCTraversableSet$fCTraversableProduct$fCTraversableArray$fCTraversableSmallArray$fCTraversablePrimArray$fCTraversableSum$fCTraversable:*:$fCTraversable:+:$fCTraversableK1$fCTraversableConst$fCTraversableURec$fCTraversableURec0$fCTraversableURec1$fCTraversableURec2$fCTraversableURec3$fCTraversableURec4$fCTraversableArg$fCTraversableProxy$fCTraversable(,)$fCTraversableU1$fCTraversableV1$fCTraversableComplex$fCTraversableMax$fCTraversableMin$fCTraversableOption$fCTraversableZipList$fCTraversableIdentity$fCTraversableFirst$fCTraversableLast$fCTraversableFirst0$fCTraversableLast0$fCTraversableDown$fCTraversableNonEmpty$fCTraversablePar1$fCTraversableSeq$fCTraversableHashMap$fCTraversableMap$fCTraversableIntMap$fCTraversableEither$fCTraversableMaybe$fCTraversable[]$fCTraversableWrapFunctor$fCFreeMonoid[]$fCFoldableArray$fCFoldableSmallArray $fCFoldableK1$fCFoldableConst $fCFoldableAp$fCFoldableAlt$fCFoldableURec$fCFoldableURec0$fCFoldableURec1$fCFoldableURec2$fCFoldableURec3$fCFoldableURec4$fCFoldableRec1$fCFoldableArg$fCFoldableProxy$fCFoldable(,) $fCFoldableU1 $fCFoldableV1$fCFoldableComplex$fCFoldableMax$fCFoldableMin$fCFoldableOption$fCFoldableZipList$fCFoldableIdentity$fCFoldableFirst$fCFoldableLast$fCFoldableFirst0$fCFoldableLast0$fCFoldableDown$fCFoldableNonEmpty$fCFoldablePar1$fCFoldableSeq$fCFoldableHashMap$fCFoldableMap$fCFoldableIntMap$fCFoldableEither$fCFoldableMaybe $fCFoldable[]cctraverseFreeMonoidcctraverseZipFreeMonoidcfolding$fCFreeMonoidWrapMono$fCFreeMonoidSeq$fCFreeMonoidArray$fCFreeMonoidSmallArray$fCFreeMonoidPrimArray$fCFreeMonoidVector$fCFreeMonoidVector0$fCFreeMonoidVector1$fCFreeMonoidVector2/mono-traversable-1.0.15.3-AJanSQpEp5DkYwYiEFK5HData.MonoTraversable WrappedMono WrapMono' Control.ArrowleftApp^<<<<^>>^^>>returnAArrow&&&second***arrfirstKleisli runKleisli ArrowZero zeroArrow ArrowPlus<+> ArrowChoicerightleft|||+++ ArrowApplyapp ArrowMonad ArrowLooploopControl.Category>>><<<GHC.BaseMonoidData.Traversable Traversable