bifunctors,              

    containers                == 0.5.*,

import Data.Bifunctor
import Data.Function

import Control.Arrow

instance Ord LogEntry where
  compare a b = compare (logTime a) (logTime b)

pushEntry entry idx = consLeft entry $ findWithDefault ([], []) (btcAddr entry) idx where 
                      consLeft a (ex, ix) = (a : ex, ix)

pushEntry entry = first (entry :) . findWithDefault ([], []) (btcAddr entry) 

import Data.Map.Strict as M

import Control.Arrow

  testAddrs = catMaybes [ Ananke.btcAddr $ T.pack "123"
                        , Ananke.btcAddr $ T.pack "456"
                        , Ananke.btcAddr $ T.pack "789" ]

  testAddrs = catMaybes [ parseBtcAddr $ T.pack "123"
                        , parseBtcAddr $ T.pack "456"
                        , parseBtcAddr $ T.pack "789" ]

  expected = do

  testIntervals = do

    maybeToList . fmap (LogInterval addr) $ I.interval start end

    return $ LogInterval addr (I.interval start end)
  expected = M.map (\i -> ([], i)) . fromListWith (++) . fmap (intervalBtcAddr &&& return) $ testIntervals