úÎ6     NoneApply a function exhaustively. Apply a function exhaustively. %Apply a monad function exhaustively. %Apply a monad function exhaustively. +Sort a list and leave out duplicates. Like  nub . sort but faster. Sort, then group Sort, then group =Aggregate an association list, such that keys become unique. (c) OReplace all occurences of a specific thing in a list of things another thing. <Counts how many elements there are in a 4 levels deep list. <Counts how many elements there are in a 3 levels deep list. <Counts how many elements there are in a 2 levels deep list. ;Counts how many elements there are in a 1 level deep list. 8Segments the elements of a 3 levels deep list such that A the segments contain at least the specified amount of elements, ) without breaking apart any subsegments. 8Segments the elements of a 2 levels deep list such that A the segments contain at least the specified amount of elements, ) without breaking apart any subsegments.          hx-0.2 Haskell.X exhaustivelyexhaustivelyBy exhaustivelyMexhaustivelyByMuniqSort aggregateBy aggregate aggregateALtrcount4count3count2count1segment3segment2