úÎk      provisionaljulian.fleischer@fu-berlin.deUnsafetrace x shows and returns x.  debug x a shows x and returns a. This is a shorthand for . portable provisionaljulian.fleischer@fu-berlin.deSafeflip ($) , fixity is infixl 1 (like >>= but for non-monadic functions) Like ->>:, but wraps its result so that it can be used in a monad.  Fixity is infixl 1. flip (.) , fixity is infixl 9 (same as for . ), from F#. portable provisionaljulian.fleischer@fu-berlin.deSafeApply a function exhaustively. Apply a function exhaustively. 'Apply a monadic function exhaustively. 'Apply a monadic 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.  "breakLast xs == (init xs, last xs)8If an Either contains the same types in Left and Right, * unify it by dropping the Either wrapper.           hx-0.3 Haskell.X.OpsHaskell.X.Unsafe Haskell.Xbase Data.Functor<$>tracedebugio->>=>>|> exhaustivelyexhaustivelyBy exhaustivelyMexhaustivelyByMuniqSort aggregateBy aggregate aggregateALtrcount4count3count2count1segment3segment2 breakLastuneitherGHC.IOunsafePerformIO