Note that the benchmark is on the worst case

haskell · Aug 17, 2024 · e4f2b51 · e4f2b51
1 parent 9d9f833
commit e4f2b51
Show file tree

Hide file tree

Showing 2 changed files with 2 additions and 2 deletions.
diff --git a/containers-tests/benchmarks/IntMap.hs b/containers-tests/benchmarks/IntMap.hs
@@ -53,7 +53,7 @@ main = do
         , bench "spanAntitone" $ whnf (M.spanAntitone (<key_mid)) m
         , bench "split" $ whnf (M.split key_mid) m
         , bench "splitLookup" $ whnf (M.splitLookup key_mid) m
-        , bench "eq" $ whnf (\m' -> m' == m') m
+        , bench "eq" $ whnf (\m' -> m' == m') m -- worst case, compares everything
         ]
   where
     elems = elems_hits

diff --git a/containers-tests/benchmarks/IntSet.hs b/containers-tests/benchmarks/IntSet.hs
@@ -56,7 +56,7 @@ main = do
         , bench "split:sparse" $ whnf (IS.split elem_sparse_mid) s_sparse
         , bench "splitMember:dense" $ whnf (IS.splitMember elem_mid) s
         , bench "splitMember:sparse" $ whnf (IS.splitMember elem_sparse_mid) s_sparse
-        , bench "eq" $ whnf (\s' -> s' == s') s
+        , bench "eq" $ whnf (\s' -> s' == s') s -- worst case, compares everything
         ]
   where
     bound = 2^12