Merge pull request #16389 from seberg/hardcode-scalar-buffers

ENH: Hardcode buffer handling for simple scalars

1 files changed, 33 insertions, 0 deletions

diff --git a/benchmarks/benchmarks/bench_scalar.py b/benchmarks/benchmarks/bench_scalar.py
new file mode 100644
index 000000000..219e48bed
--- /dev/null
+++ b/benchmarks/benchmarks/bench_scalar.py
@@ -0,0 +1,33 @@
+from .common import Benchmark, TYPES1
+
+import numpy as np
+
+
+class ScalarMath(Benchmark):
+    # Test scalar math, note that each of these is run repeatedly to offset
+    # the function call overhead to some degree.
+    params = [TYPES1]
+    param_names = ["type"]
+    def setup(self, typename):
+        self.num = np.dtype(typename).type(2)
+
+    def time_addition(self, typename):
+        n = self.num
+        res = n + n + n + n + n + n + n + n + n + n
+
+    def time_addition_pyint(self, typename):
+        n = self.num
+        res = n + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1
+
+    def time_multiplication(self, typename):
+        n = self.num
+        res = n * n * n * n * n * n * n * n * n * n
+
+    def time_power_of_two(self, typename):
+        n = self.num
+        res = n**2, n**2, n**2, n**2, n**2, n**2, n**2, n**2, n**2, n**2
+
+    def time_abs(self, typename):
+        n = self.num
+        res = abs(abs(abs(abs(abs(abs(abs(abs(abs(abs(n))))))))))
+