Add generators benchmark

pyperformance/data-files/benchmarks/MANIFEST

@@ -6,6 +6,7 @@ async_tree	<local>
 async_tree_cpu_io_mixed	<local:async_tree>
 async_tree_io	<local:async_tree>
 async_tree_memoization	<local:async_tree>
+generators	<local>
 chameleon	<local>
 chaos	<local>
 crypto_pyaes	<local>

pyperformance/data-files/benchmarks/bm_generators/pyproject.toml

@@ -0,0 +1,9 @@
+[project]
+name = "pyperformance_bm_generators"
+requires-python = ">=3.8"
+dependencies = ["pyperf"]
+urls = {repository = "https://github.com/python/pyperformance"}
+dynamic = ["version"]
+
+[tool.pyperformance]
+name = "generators"

pyperformance/data-files/benchmarks/bm_generators/run_benchmark.py

@@ -0,0 +1,48 @@
+"""
+Benchmark recursive generators implemented in python
+by traversing a binary tree.
+
+Author: Kumar Aditya
+"""
+
+from __future__ import annotations
+
+from collections.abc import Iterator
+
+import pyperf
+
+
+class Tree:
+    def __init__(self, left: Tree | None, value: int, right: Tree | None) -> None:
+        self.left = left
+        self.value = value
+        self.right = right
+
+    def __iter__(self) -> Iterator[int]:
+        if self.left:
+            yield from self.left
+        yield self.value
+        if self.right:
+            yield from self.right
+
+
+def tree(input: range) -> Tree | None:
+    n = len(input)
+    if n == 0:
+        return None
+    i = n // 2
+    return Tree(tree(input[:i]), input[i], tree(input[i + 1:]))
+
+def bench_generators(loops: int) -> None:
+    assert list(tree(range(10))) == list(range(10))
+    range_it = range(loops)
+    t0 = pyperf.perf_counter()
+    for _ in range_it:
+        for _ in tree(range(100000)):
+            pass
+    return pyperf.perf_counter() - t0
+
+if __name__ == "__main__":
+    runner = pyperf.Runner()
+    runner.metadata['description'] = "Benchmark generators"
+    runner.bench_time_func('generators', bench_generators)