summaryrefslogtreecommitdiffstats
path: root/Modules
diff options
context:
space:
mode:
authorRaymond Hettinger <python@rcn.com>2004-06-26 04:42:06 (GMT)
committerRaymond Hettinger <python@rcn.com>2004-06-26 04:42:06 (GMT)
commit616f4f61bae92b5733b346552d6b522ad1409937 (patch)
treeab24886f849639a7970389a6bc2a41dacd646c69 /Modules
parenta7f56bc0cc1eef6c0ba3bfab754f3f827159a06a (diff)
downloadcpython-616f4f61bae92b5733b346552d6b522ad1409937.zip
cpython-616f4f61bae92b5733b346552d6b522ad1409937.tar.gz
cpython-616f4f61bae92b5733b346552d6b522ad1409937.tar.bz2
Add a comment with implementation notes.
Diffstat (limited to 'Modules')
-rw-r--r--Modules/collectionsmodule.c7
1 files changed, 7 insertions, 0 deletions
diff --git a/Modules/collectionsmodule.c b/Modules/collectionsmodule.c
index 4026ea5..da276ce 100644
--- a/Modules/collectionsmodule.c
+++ b/Modules/collectionsmodule.c
@@ -359,6 +359,13 @@ deque_item(dequeobject *deque, int i)
return item;
}
+/* delitem() implemented in terms of rotate for simplicity and reasonable
+ performance near the end points. If for some reason this method becomes
+ popular, it is not hard to re-implement this using direct data movement
+ (similar to code in list slice assignment) and achieve a two or threefold
+ performance boost.
+*/
+
static int
deque_del_item(dequeobject *deque, int i)
{