Îőłh$܍      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~€‚ƒ„…†‡ˆ‰Š‹Œ(c) Fumiaki Kinoshita 2020BSD3'Fumiaki Kinoshita  provisional non-portableNone2567>?ŔÁÂÄÎÔŮç \ witherableIndexed variant of  . witherable Effectful .  ( i ->  . f i) áD  .  f witherable Monadic variant of  .. This may have more efficient implementation. witherableIndexed variant of .  witherable   f .   g áD ifilter (i -> Ž () (f i) (g i))  witherableAn enhancement of  with A definition of  ! must satisfy the following laws:  conservation  (‘ ’ . f) áD “ f composition” . ‘ (  f) .   g áD   (” . ‘ (  f) . g))Parametricity implies the naturality law: Whenever t is an /applicative transformation!/ in the sense described in the  documentation, t .   f áD   (t . f)See the  Properties.mdĎ file in the git distribution for some special properties of empty containers.  witherable Effectful .   ( . f) áD  .  f  witherable Monadic variant of  .. This may have more efficient implementation. witherableLike •7, but you can remove elements instead of updating them.Formally, the class  represents a functor from  Kleisli Maybe to Hask.A definition of ! must satisfy the following laws:  conservation (Just . f) áD ‘ f composition f .  g áD  (f <=< g) witherableLike –. witherable  áD  — witherable  f .  g áD filter (Ž () g f) witherableAn infix alias for '. The name of the operator alludes to ˜, and has the same fixity. witherableFlipped version of , the  version of . It has the same fixity as . () = ™   witherable  = ™   witherableúRemoves duplicate elements from a list, keeping only the first occurrence. This is asymptotically faster than using  from  Data.List. witherableęRemoves duplicate elements from a list, keeping only the first occurrence. This is usually faster than =, especially for things that have a slow comparison (like š).9 witherableWither from right to left.G witherable&Methods are good consumers for fusion.X witherableWither from right to left.    41(c) Fumiaki Kinoshita 2015BSD3'Fumiaki Kinoshita  provisional non-portableNoneÔŮjw witherable)This is used to characterize and clone a  . Since FilterLike (Peat a b) s t a bÁ is monomorphic, it can be used to store a filter in a container.z witherable A simple |.{ witherable A simple }.| witherableA | is like a  Řhttp://hackage.haskell.org/package/lens-4.13.2.1/docs/Control-Lens-Type.html#t:Traversal Traversal#, but you can also remove targets.} witherable'This type allows combinators to take a  specializing the parameter f.‚ witherableReconstitute a  from its monomorphic form.ƒ witherableƒ is actually —, but left for consistency.„ witherable „ áD ™… witherable through a filter.† witherable through a filter.‡ witherable  through a filter.ˆ witherable1Filter each element of a structure targeted by a .‰ witherable/Remove the duplicate elements through a filter.Š witherableÉRemove the duplicate elements through a filter. It is often faster than ‰., especially when the comparison is expensive.,  wxyz{|}~€‚ƒ„…†‡ˆ‰Š,  }|{z€~ƒ„…†‡ˆ‰Š‚wxy›      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}}~€‚ƒ„…†‡ˆ‰Š‹ŒŽ‘’“”’“•–—˜’™š’“›’œ’™ž’Ÿ ’“Ą’˘’“Ł’¤’“Ľ’“Ś§%witherable-0.4-EMgVXWX5TGV4CcTPLfXL3K WitherableData.Witherable Data.Functor<&> Data.ListnubWrappedFoldableWrapFilterableunwrapFoldableWitherableWithIndexiwitheriwitherMifilterAFilterableWithIndex imapMaybeifilterwitherwitherMfilterA witherMap FilterablemapMaybe catMaybesfilter<$?><&?>forMaybeordNubhashNub$fFilterable:.:$fFilterable:+:$fFilterable:*:$fFilterableM1$fFilterableRec1$fFilterableK1$fFilterableU1$fFilterableV1$fFilterableMaybeT$fFilterableSum$fFilterableProduct$fFilterableCompose$fFilterableSeq$fFilterableVector$fFilterableConst$fFilterableProxy$fFilterableHashMap$fFilterableMap$fFilterableIntMap$fFilterableZipList$fFilterable[]$fFilterableEither$fFilterableOption$fFilterableMaybe$fWitherable:.:$fWitherable:+:$fWitherable:*:$fWitherableM1$fWitherableRec1$fWitherableK1$fWitherableU1$fWitherableV1$fWitherableBackwards$fWitherableReverse$fWitherableMaybeT$fWitherableIdentityT$fWitherableSum$fWitherableProduct$fWitherableCompose$fWitherableSeq$fWitherableVector$fWitherableConst$fWitherableProxy$fWitherableHashMap$fWitherableMap$fWitherableIntMap$fWitherableZipList$fWitherable[]$fWitherableEither$fWitherableOption$fWitherableMaybe$fFilterableWithIndexEitherSum"$fFilterableWithIndexEitherProduct$fFilterableWithIndex(,)Compose$fFilterableWithIndexIntSeq$fFilterableWithIndexIntVector$fFilterableWithIndexVoidProxy$fFilterableWithIndexkHashMap$fFilterableWithIndexkMap$fFilterableWithIndexIntIntMap$fFilterableWithIndexIntZipList$fFilterableWithIndexInt[]$fFilterableWithIndex()Maybe$fWitherableWithIndexiBackwards$fWitherableWithIndexiReverse$fWitherableWithIndexiIdentityT$fWitherableWithIndexEitherSum"$fWitherableWithIndexEitherProduct$fWitherableWithIndex(,)Compose$fWitherableWithIndexIntSeq$fWitherableWithIndexIntVector$fWitherableWithIndexVoidProxy$fWitherableWithIndexkHashMap$fWitherableWithIndexkMap$fWitherableWithIndexIntIntMap$fWitherableWithIndexIntZipList$fWitherableWithIndexInt[]$fWitherableWithIndex()Maybe$fWitherableWrappedFoldable%$fFilterableWithIndexiWrappedFoldable$fFilterableWrappedFoldable&$fTraversableWithIndexiWrappedFoldable#$fFoldableWithIndexiWrappedFoldable"$fFunctorWithIndexiWrappedFoldable$fFunctorWrappedFoldable$fFoldableWrappedFoldable$fTraversableWrappedFoldable$fApplicativeWrappedFoldable$fAlternativeWrappedFoldable$fFilterableWithIndexiBackwards$fFilterableWithIndexiReverse$fFilterableWithIndexiIdentityT$fFilterableBackwards$fFilterableReverse$fFilterableIdentityTPeatrunPeatWither' WitherLike'Wither WitherLike FilterLike'Filter' FilterLikeFilter cloneFilterwitherOf forMaybeOf mapMaybeOf catMaybesOf filterAOffilterOfordNubOf hashNubOf$fApplicativePeat $fFunctorPeatbaseGHC.BasepureliftA2ghc-prim GHC.Classes&&Data.Traversable Traversablefmap GHC.MaybeJusttraverseData.Functor.ComposeComposeFunctor Data.Maybeid<$>flipString