diff --git a/event-list.cabal b/event-list.cabal
--- a/event-list.cabal
+++ b/event-list.cabal
@@ -1,5 +1,5 @@
 Name:             event-list
-Version:          0.1.0.1
+Version:          0.1.0.2
 License:          GPL
 License-File:     LICENSE
 Author:           Henning Thielemann <haskell@henning-thielemann.de>
@@ -26,7 +26,7 @@
 Source-Repository this
   type:     darcs
   location: http://code.haskell.org/~thielema/event-list/
-  tag:      0.1.0.1
+  tag:      0.1.0.2
 
 Flag splitBase
   description: Choose the new smaller, split-up base package.
diff --git a/src/Data/EventList/Absolute/TimeMixed.hs b/src/Data/EventList/Absolute/TimeMixed.hs
--- a/src/Data/EventList/Absolute/TimeMixed.hs
+++ b/src/Data/EventList/Absolute/TimeMixed.hs
@@ -13,11 +13,3 @@
     ) where
 
 import Data.EventList.Absolute.TimeTimePrivate
--- import qualified Data.EventList.Absolute.TimeBody as TimeBodyList
--- import qualified Data.EventList.Absolute.TimeTime as TimeTimeList
-
--- import qualified Data.AlternatingList.List.Disparate as Disp
--- import qualified Data.AlternatingList.List.Uniform as Uniform
-import qualified Data.AlternatingList.List.Mixed as Mixed
-
--- import Data.AlternatingList.List.Mixed ((/.), (./))
diff --git a/src/Data/EventList/Relative/TimeBody.hs b/src/Data/EventList/Relative/TimeBody.hs
--- a/src/Data/EventList/Relative/TimeBody.hs
+++ b/src/Data/EventList/Relative/TimeBody.hs
@@ -373,6 +373,15 @@
 {- |
 'mergeBy' is like 'merge' but does not simply use the methods of the 'Ord' class
 but allows a custom comparison function.
+If in event lists @xs@ and @ys@ there are coinciding elements @x@ and @y@,
+and @cmp x y@ is 'True',
+then @x@ comes before @y@ in @mergeBy cmp xs ys@.
+
+> EventList> EventList.mergeBy (\_ _ -> True) (0 /. 'a' ./ empty) (0 /. 'b' ./ empty)
+> 0 /. 'a' ./ 0 /. 'b' ./ empty
+>
+> EventList> EventList.mergeBy (\_ _ -> False) (0 /. 'a' ./ empty) (0 /. 'b' ./ empty)
+> 0 /. 'b' ./ 0 /. 'a' ./ empty
 -}
 
 {-
diff --git a/src/Data/EventList/Utility.hs b/src/Data/EventList/Utility.hs
--- a/src/Data/EventList/Utility.hs
+++ b/src/Data/EventList/Utility.hs
@@ -37,7 +37,7 @@
 
 beforeBy :: (Ord time) =>
    (body -> body -> Bool) ->
-   (time, body) -> (time, body) -> Bool
+   (time, body) -> (time, body) ->  Bool
 beforeBy before (t0, me0) (t1, me1) =
    case compare t0 t1 of
       LT -> True
diff --git a/src/Test/Data/EventList/Absolute/BodyEnd.hs b/src/Test/Data/EventList/Absolute/BodyEnd.hs
--- a/src/Test/Data/EventList/Absolute/BodyEnd.hs
+++ b/src/Test/Data/EventList/Absolute/BodyEnd.hs
@@ -24,7 +24,6 @@
 
 import qualified Numeric.NonNegative.Class as NonNeg
 import Data.Tuple.HT (mapFst, mapSnd, mapPair, )
-import qualified Control.Monad as Monad
 import Control.Monad.Trans.State (state, evalState, )
 
 import Prelude hiding (filter, concat)
diff --git a/src/Test/Data/EventList/Absolute/TimeEnd.hs b/src/Test/Data/EventList/Absolute/TimeEnd.hs
--- a/src/Test/Data/EventList/Absolute/TimeEnd.hs
+++ b/src/Test/Data/EventList/Absolute/TimeEnd.hs
@@ -24,7 +24,6 @@
 
 import qualified Numeric.NonNegative.Class as NonNeg
 import Data.Tuple.HT (mapFst, mapSnd, mapPair, )
-import qualified Control.Monad as Monad
 import Control.Monad.Trans.State (state, evalState)
 
 import Prelude hiding (filter, concat)
@@ -38,7 +37,7 @@
 
 infixl 4 ==~
 
-(==~) :: (Eq body, Num time) =>
+(==~) :: (Eq body, Eq time, Num time) =>
    AbsTime.T time body -> RelTime.T time body -> Bool
 (==~) xs ys =
    xs == RelTime.toAbsoluteEventList 0 ys
diff --git a/src/Test/Data/EventList/Relative/BodyEnd.hs b/src/Test/Data/EventList/Relative/BodyEnd.hs
--- a/src/Test/Data/EventList/Relative/BodyEnd.hs
+++ b/src/Test/Data/EventList/Relative/BodyEnd.hs
@@ -31,7 +31,6 @@
 import Control.Monad.Trans.State (state, evalState, gets, modify, )
 import Control.Monad (liftM2)
 import Data.Maybe (isJust)
-import qualified Data.List as List