WIP

Author: sjakobi

benchmarks/FineGrained.hs

@@ -8,9 +8,7 @@
 module Main where
 
 import Control.Monad (replicateM)
-import qualified Data.HashMap.Internal as HMI
 import qualified Data.HashMap.Strict as HM
-import Data.Hashable (Hashable, hash)
 import Key.Bytes
 import System.Random.Stateful
 import Test.Tasty.Bench
@@ -21,7 +19,7 @@ main =
   defaultMain
     [ bFromList
     -- bgroup "insert" bInsert
-    -- union
+    , bUnion
     ]
 
 defaultGen :: StdGen
@@ -30,26 +28,8 @@ defaultGen = mkStdGen 42
 defaultSizes :: [Int]
 defaultSizes = [0, 1, 10, 100, 1000, 10_000, 100_000]
 
-{-
-bInsert = [ env m $ \d -> bench (show s) $ whnf (\(k, v, m) -> HM.insert k v m) d ]
-  where m s = do
-          g <- newIOGenM defaultGen
-          let hm = HM.empty
-          forM_ [1..s] $ \v -> do
-            b <- genBytes 32 g
-            HMI.unsafeInsert b v hm
-          return (m, newKeys) -- separate existing, new
--}
-
-{-
-matrix :: (NFData env) => [Int] -> (Int -> IO env) -> (env -> Benchmarkable) -> Benchmark
-matrix sizes e x = b -- [ b @Bytes, b @Int] -- , b @SlowInt, b @Colli ]
-  where
-    b = bgroup "bla" [runTemplate @Int e x s | s <- sizes]
-
-runTemplate :: forall env. (NFData env) => (Int -> IO env) -> (env -> Benchmarkable) -> Int -> Benchmark
-runTemplate e b s = env (e s) $ \x -> bench (show s) (b x)
--}
+bytesLength :: Int
+bytesLength = 32
 
 bFromList :: Benchmark
 bFromList =
@@ -60,10 +40,10 @@ bFromList =
         [ env
             ( do
                 g <- newIOGenM defaultGen
-                genNBytes s 32 g
+                genNBytes s bytesLength g
             )
             $ \keys ->
-              bench (show s) $ whnf (HM.fromList . map (, ())) keys
+              bench (show s) $ whnf (HM.fromList . map (,())) keys
         | s <- sizes
         ],
       bgroup
@@ -80,6 +60,22 @@ bFromList =
   where
     sizes = defaultSizes
 
+bUnion :: Benchmark
+bUnion =
+  bgroup
+    "union"
+    [ bgroup "disjoint" bUnionDisjoint, bgroup "overlap" [], bgroup "same" [] ]
+
+bUnionDisjoint :: [Benchmark]
+bUnionDisjoint = [bgroup "Bytes" [], bgroup "Int" []]
+  where
+    bytesEnv s = do
+      g <- newIOGenM defaultGen
+      trues <- undefined s
+      falses <- undefined s
+      return (map (,()) trues, map (,()) falses)
+      
+
 genInts ::
   (StatefulGen g m) =>
   Int ->
@@ -94,3 +90,24 @@ bFromList = matrix defaultSizes e' b'
     e' s = uniformListM s defaultGen
     b' = whnf HM.fromList
 -}
+
+{-
+bInsert = [ env m $ \d -> bench (show s) $ whnf (\(k, v, m) -> HM.insert k v m) d ]
+  where m s = do
+          g <- newIOGenM defaultGen
+          let hm = HM.empty
+          forM_ [1..s] $ \v -> do
+            b <- genBytes 32 g
+            HMI.unsafeInsert b v hm
+          return (m, newKeys) -- separate existing, new
+-}
+
+{-
+matrix :: (NFData env) => [Int] -> (Int -> IO env) -> (env -> Benchmarkable) -> Benchmark
+matrix sizes e x = b -- [ b @Bytes, b @Int] -- , b @SlowInt, b @Colli ]
+  where
+    b = bgroup "bla" [runTemplate @Int e x s | s <- sizes]
+
+runTemplate :: forall env. (NFData env) => (Int -> IO env) -> (env -> Benchmarkable) -> Int -> Benchmark
+runTemplate e b s = env (e s) $ \x -> bench (show s) (b x)
+-}

benchmarks/Key/Bytes.hs

@@ -26,5 +26,14 @@ genNBytes ::
   m [Bytes]
 genNBytes n len = replicateM n . genBytes len
 
+genDisjoint ::
+  (StatefulGen g m) =>
+  Int ->
+  Int ->
+  g ->
+  m ([Bytes], [Bytes])
+genDisjoint n len = undefined
+{-
 instance Uniform Bytes where
   uniformM = genBytes 32 
+-}