úÎm     (c) Fumiaki Kinoshita 2015BSD3'Fumiaki Kinoshita <fumiexcel@gmail.com> provisional non-portable Trustworthy *-./4IN "Traversable containers which hold  are witherable.Like 7, but you can remove elements instead of updating them.  f "a  (  ! . f)A definition of ! must satisfy the following laws: identity (" . Just) "a " composition .   ( f) .  g "a  ( .   ( f) . g))Parametricity implies the naturality law: t .  f =  (t . f) is actually #, but left for consistency.  == $ through a filter. through a filter.1Filter each element of a structure targeted by a .  == $  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 exponentially quicker 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 %)., &'()*+,-./0123   #  &'()*+,-./01234      !"#$"%&"#'"#("#)"#*"#+"#,-./0123456789:;withe_4erE8akatG0AJZCWyIhKn3Data.WitherableData.Functor.ComposeCompose Data.ListnubChipped getChipped WitherablewithermapMaybe catMaybesfilterAfilterPeatrunPeatFilter' FilterLike'Filter FilterLike cloneFilterwitherOf forMaybeOf mapMaybeOf catMaybesOf filterAOffilterOfforMaybewitherMblightMordNubOf hashNubOfordNubhashNubbaseGHC.BaseMaybeData.TraversabletraversefmapJustpureidflipString$fWitherableChipped$fApplicativeChipped$fWitherableSeq$fWitherableVector$fWitherableConst$fWitherableProxy$fWitherableHashMap$fWitherableMap$fWitherableIntMap$fWitherable[]$fWitherableEither$fWitherableMaybe$fApplicativePeat $fFunctorPeat