-
A follow up from the discussion with @cskau-g earlier this week. FFI leaf calls are not being inlined ([CL](https://dart-review.googlesource.com/c/sdk/+/179768)).
```
out/ReleaseX64/dart --trace-i…
-
`kotlinx-benchmark` requires benchmark classes to be annotated with `@State`.
It seems reasonable to expect that when there is a base class annotated with `@State` providing common routines and sta…
-
The "broadleaf" tree can contain 2 elements in its leaf nodes. The keys have to be small enough for us to pack both into a single `size_t`. The actual 2nd key and value will occupy the left and right …
-
Hello, from the benchmark code I figured out that this seems to be the way to check if set contains an element:
```
bool res = set.find(i + 1).leaf();
```
However, the following code seems to work…
-
Hi,
I followed the readme file and I keep getting this message while trying to compile the benchmark.
```
btree_impl.h:213:7: error: ‘struct btree::leaf_node’ has no member named ‘is_layer’
```
…
-
### Problem
Currently, cargo benchmarks use the `bench` profile by default. This profile inherits `release`, which makes sense - benchmarks should generally be run in the same context as your optimiz…
-
# The problem
Consider walking over a tree using a streaming library to do something at every leaf:
```haskell
data Tree = Branch Tree Tree | Leaf Int
walkTreeTransformer :: (Monad (m IO), M…
-
### Community Note
* Please vote on this issue by adding a 👍 [reaction](https://blog.github.com/2016-03-10-add-reactions-to-pull-requests-issues-and-comments/) to the original issue to help the…
-
# The problem
Consider walking over a tree using a streaming library to do something at every leaf:
```haskell
data Tree = Branch Tree Tree | Leaf Int
walkTreeTransformer :: (Monad (m IO), M…
-
Right now, if a trial fails, we simply continue.
This seems reasonable for benchmark environment failures, however, for lower level failures (e.g. VM, OS) that the leaf environments rely upon it ca…