Compiler Backend: Explanation of test timings do not follow the actual numbers

[jaisw7]

Source: Compiler Backend

dune exec -- ./bench_patterns.exe -ascii -quota 0.25
Estimated testing time 750ms (3 benchmarks x 250ms). Change using '-quota'.

  Name                        Time/Run   Percentage
 --------------------------- ---------- ------------
  Monomorphic large pattern     6.54ns       67.89%
  Monomorphic small pattern     9.63ns      100.00%
  Polymorphic large pattern     9.63ns       99.97%

These results confirm the performance hypothesis that we obtained earlier by inspecting the lambda code. The shortest running time comes from the small conditional pattern match, and polymorphic variant pattern matching is the slowest

Offending statement

shortest running time comes from the small conditional pattern match

However Time/Run suggests that

shortest running time comes from the large monomorphic pattern match

It's counter-intuitive. We expect that the small conditional pattern match should be faster. But, quantitatively speaking, the jump tables are faster at least for this benchmark.