WIP on union.disjoint

Author: sjakobi

benchmarks/FineGrained.hs

@@ -67,13 +67,13 @@ bUnion =
     [ bgroup "disjoint" bUnionDisjoint, bgroup "overlap" [], bgroup "same" [] ]
 
 bUnionDisjoint :: [Benchmark]
-bUnionDisjoint = [bgroup "Bytes" [], bgroup "Int" []]
+bUnionDisjoint = [bgroup "Bytes" [env (bytesEnv s) (bytesB s) | s <- defaultSizes], bgroup "Int" []]
   where
+    bytesB s tup = bench (show s) $ whnf (\ ~(as, bs) -> HM.union as bs) tup
     bytesEnv s = do
       g <- newIOGenM defaultGen
-      trues <- undefined s
-      falses <- undefined s
-      return (map (,()) trues, map (,()) falses)
+      (trues, falses) <- Key.Bytes.genDisjoint s bytesLength g
+      return (HM.fromList (map (,()) trues), HM.fromList (map (,()) falses))
 
 
 genInts ::

benchmarks/Key/Bytes.hs

@@ -2,6 +2,7 @@
 
 module Key.Bytes where
 
+import Data.List
 import Control.Monad (replicateM)
 import Data.ByteString.Short
 import Data.Hashable
@@ -26,13 +27,16 @@ genNBytes ::
   m [Bytes]
 genNBytes n len = replicateM n . genBytes len
 
+-- | @genDisjoint n len gen@ generates @n@ 'Bytes' in total. The returned lists
+-- each contain roughly half of the total.
 genDisjoint ::
   (StatefulGen g m) =>
   Int ->
-  Int ->
+  Int -> -- ^ Must be positive
   g ->
   m ([Bytes], [Bytes])
-genDisjoint n len = undefined
+genDisjoint n len gen = Data.List.partition predicate <$> genNBytes n len gen
+  where predicate (Bytes sbs) = even (Data.ByteString.Short.head sbs)
 {-
 instance Uniform Bytes where
   uniformM = genBytes 32