bpo-35884: Add missing FIFO queue benchmark (GH-11898)

rhettinger · miss-islington · commit 43766f82ddec · 2019-02-16T12:51:02.000-08:00
https://bugs.python.org/issue35884
diff --git a/Tools/scripts/var_access_benchmark.py b/Tools/scripts/var_access_benchmark.py
@@ -214,6 +214,15 @@ def deque_append_pop(trials=trials, a=deque([1])):
         ap(1); pop(); ap(1); pop(); ap(1); pop(); ap(1); pop(); ap(1); pop();
         ap(1); pop(); ap(1); pop(); ap(1); pop(); ap(1); pop(); ap(1); pop();
 
+def deque_append_popleft(trials=trials, a=deque([1])):
+    ap, pop = a.append, a.popleft
+    for t in trials:
+        ap(1); pop(); ap(1); pop(); ap(1); pop(); ap(1); pop(); ap(1); pop();
+        ap(1); pop(); ap(1); pop(); ap(1); pop(); ap(1); pop(); ap(1); pop();
+        ap(1); pop(); ap(1); pop(); ap(1); pop(); ap(1); pop(); ap(1); pop();
+        ap(1); pop(); ap(1); pop(); ap(1); pop(); ap(1); pop(); ap(1); pop();
+        ap(1); pop(); ap(1); pop(); ap(1); pop(); ap(1); pop(); ap(1); pop();
+
 def write_list(trials=trials, a=[1]):
     for t in trials:
         a[0]=1; a[0]=1; a[0]=1; a[0]=1; a[0]=1
@@ -261,7 +270,7 @@ def loop_overhead(trials=trials):
             '\nData structure write access:',
             write_list, write_deque, write_dict,
             '\nStack (or queue) operations:',
-            list_append_pop, deque_append_pop,
+            list_append_pop, deque_append_pop, deque_append_popleft,
             '\nTiming loop overhead:',
             loop_overhead]:
         if isinstance(f, str):
