summaryrefslogtreecommitdiff
path: root/tests/bench/arrayop-2-list_map.py
diff options
context:
space:
mode:
authorDamien George <damien.p.george@gmail.com>2019-06-18 23:44:16 +1000
committerDamien George <damien.p.george@gmail.com>2019-06-28 16:28:59 +1000
commitd86fb670e6d78ca38dbaedfdde35180e3b8f4bb3 (patch)
treecfb199a27fadfd5d04d3aa13f7b22b02db555453 /tests/bench/arrayop-2-list_map.py
parentd165a401dce66ba952b016d116b60e77b11f3e1f (diff)
tests: Rename "bench" tests to "internal_bench" and run-internalbench.py
To emphasise these benchmark tests compare the internal performance of features amongst themselves, rather than absolute performance testing.
Diffstat (limited to 'tests/bench/arrayop-2-list_map.py')
-rw-r--r--tests/bench/arrayop-2-list_map.py12
1 files changed, 0 insertions, 12 deletions
diff --git a/tests/bench/arrayop-2-list_map.py b/tests/bench/arrayop-2-list_map.py
deleted file mode 100644
index 9d5095c53..000000000
--- a/tests/bench/arrayop-2-list_map.py
+++ /dev/null
@@ -1,12 +0,0 @@
-# Array operation
-# Type: list, map() call. This method requires allocation of
-# the same amount of memory as original array (to hold result
-# array). On the other hand, input array stays intact.
-import bench
-
-def test(num):
- for i in iter(range(num//10000)):
- arr = [0] * 1000
- arr2 = list(map(lambda x: x + 1, arr))
-
-bench.run(test)