úÎ%"!À5      !"#$%&'()*+,-./01234(c) Fumiaki Kinoshita 2015BSD3'Fumiaki Kinoshita <fumiexcel@gmail.com> provisional non-portable Trustworthy /234:OT"Traversable containers which hold 5 are witherable.Like 67, but you can remove elements instead of updating them.A definition of ! must satisfy the following laws: identity (7 . Just) "a 7 composition8 . 9 ( f) .  g "a  (8 . 9 ( f) . g))Parametricity implies the naturality law: t .  f "a  (t . f) : f "a  (9 ; . f)  f .  g "a  (f <=< g)  "a  < 8 . 9 ( f) .  g "a  (x -> 8 $ 9 (b -> (b&&)  $ f x) (g x)  f .  g "a filter (= (>) f g) )This is used to characterize and clone a  . Since FilterLike (Peat a b) s t a bA is monomorphic, it can be used to store a filter in a container.  A simple .  A simple .A  is like a  Xhttp://hackage.haskell.org/package/lens-4.13.2.1/docs/Control-Lens-Type.html#t:Traversal Traversal#, but you can also remove targets.'This type allows combinators to take a  specializing the parameter f.Reconstitute a  from its monomorphic form. is actually <, but left for consistency.  == ? through a filter. through a filter. through a filter.1Filter each element of a structure targeted by a .  = ?  A variant of  that works on @. is  with its arguments flipped./Remove the duplicate elements through a filter.IRemove the duplicate elements through a filter. It is often faster than ., especially when the comparison is expensive.zRemoves duplicate elements from a list, keeping only the first occurrence. This is asymptotically faster than using  from  Data.List.jRemoves duplicate elements from a list, keeping only the first occurrence. This is usually faster than <, especially for things that have a slow comparion (like A)..  !"#$%&'()*+,-   %   !"#$%&'()*+,-B       !"#$%&'()*+,-./01234567897:;78<7=>78?7:@78A78B78CDEF78GHIJ78KL)witherable-0.1.3.4-9bmM315LyBr5eZtS0U0NCIData.Witherable Data.ListnubChipped getChipped WitherablewithermapMaybe catMaybesfilterAfilterPeatrunPeatFilter' FilterLike'Filter FilterLike cloneFilterwitherOf forMaybeOf mapMaybeOf catMaybesOf filterAOffilterOfforMaybewitherMblightMordNubOf hashNubOfordNubhashNub$fWitherableChipped$fApplicativeChipped$fWitherableMaybeT$fWitherableCompose$fWitherableSeq$fWitherableVector$fWitherableConst$fWitherableProxy$fWitherableHashMap$fWitherableMap$fWitherableIntMap$fWitherable[]$fWitherableEither$fWitherableMaybe$fApplicativePeat $fFunctorPeat$fFunctorChipped$fFoldableChipped$fTraversableChipped $fOrdChipped $fEqChipped $fReadChipped $fShowChippedbaseGHC.BaseMaybeData.Traversable TraversablepureData.Functor.ComposeComposefmaptraverseJustidliftA2ghc-prim GHC.Classes&&fliptransformers-0.5.2.0Control.Monad.Trans.MaybeMaybeTString