bench: Add test for map() vs inplace operations in array-likes.

map() is 5 times slower. That's mostly because of inefficiency of creating
containers from iterables of unknown length (like map()).

1 files changed, 12 insertions, 0 deletions

diff --git a/tests/bench/arrayop-1-list_inplace.py b/tests/bench/arrayop-1-list_inplace.py
new file mode 100644
index 000000000..0ee1ef2ec
--- /dev/null
+++ b/tests/bench/arrayop-1-list_inplace.py
@@ -0,0 +1,12 @@
+# Array operation
+# Type: list, inplace operation using for. What's good about this
+# method is that it doesn't require any extra memory allocation.
+import bench
+
+def test(num):
+    for i in iter(range(num//10000)):
+        arr = [0] * 1000
+        for i in range(len(arr)):
+            arr[i] += 1
+
+bench.run(test)