add async_generators benchmark

pyperformance/data-files/benchmarks/MANIFEST

@@ -2,6 +2,7 @@
 
 name	metafile
 2to3	<local>
+async_generators	<local>
 async_tree	<local>
 async_tree_cpu_io_mixed	<local:async_tree>
 async_tree_io	<local:async_tree>

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

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

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

@@ -0,0 +1,45 @@
+"""
+Benchmark recursive async generators implemented in python
+by traversing a binary tree.
+
+Author: Kumar Aditya
+"""
+
+from __future__ import annotations
+
+from collections.abc import AsyncIterator
+
+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
+
+    async def __aiter__(self) -> AsyncIterator[int]:
+        if self.left:
+            async for i in self.left:
+                yield i
+        yield self.value
+        if self.right:
+            async for i in self.right:
+                yield i
+
+
+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:]))
+
+async def bench_async_generators() -> None:
+    async for _ in tree(range(100000)):
+        pass
+
+if __name__ == "__main__":
+    runner = pyperf.Runner()
+    runner.metadata['description'] = "Benchmark async generators"
+    runner.bench_async_func('async_generators', bench_async_generators)