úÎ^æ     (c) Fumiaki Kinoshita 2015BSD3'Fumiaki Kinoshita <fumiexcel@gmail.com> provisional non-portable Trustworthy *-./3HM "Traversable containers which hold  are witherable.Like traverse7, but you can remove elements instead of updating them. traverse f "a  (  . f)A definition of ! must satisfy the following laws: identity ( . Just) "a  compositionCompose . fmap ( f) .  g "a  (Compose . fmap ( 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 .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 !>) hashNubOf :: (Witherable t, Eq a, Hashable a) => t a -> t a*  "#$%&'()*+,-./   !   "#$%&'()*+,-./0      !"#$%!&'(!)*+,-./012345678witherable-0.1.3Data.Witherable Data.ListnubDataListChipped getChipped WitherablewithermapMaybe catMaybesfilterAfilterDungeon runDungeonFilter' FilterLike'Filter FilterLike cloneFilterwitherOf mapMaybeOf catMaybesOf filterAOffilterOfordNubOf hashNubOfordNubhashNubbase Data.MaybeMaybeGHC.BasefmapJustControl.ApplicativepureidblightMwitherMString$fWitherableChipped$fApplicativeChipped$fWitherableSeq$fWitherableVector$fWitherableConst$fWitherableProxy$fWitherableHashMap$fWitherableMap$fWitherableIntMap$fWitherable[]$fWitherableEither$fWitherableMaybe$fApplicativeDungeon$fFunctorDungeon