mirrors/cpython
1
0
Fork 0
mirror of https://github.com/python/cpython.git synced 2025-12-04 00:30:19 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions 8

Make sure "del d[n]" is properly supported. Was necessary because the

Browse source 
same method that implements __setitem__ also implements __delitem__.
Also, there were several good use cases (removing items from a queue
and implementing Forth style stack ops).
This commit is contained in:
Raymond Hettinger 2004-05-12 20:55:56 +00:00
parent fd3f4fb7b1
commit 0e371f2cb6
3 changed files with 63 additions and 14 deletions
Download patch file Download diff file Expand all files Collapse all files

17
Lib/test/test_deque.py
View file

@ -90,6 +90,20 @@ class TestBasic(unittest.TestCase):
l[i] = 7*i
self.assertEqual(list(d), l)
def test_delitem(self):
n = 500 # O(n**2) test, don't make this too big
d = deque(xrange(n))
self.assertRaises(IndexError, d.__delitem__, -n-1)
self.assertRaises(IndexError, d.__delitem__, n)
for i in xrange(n):
self.assertEqual(len(d), n-i)
j = random.randrange(-len(d), len(d))
val = d[j]
self.assert_(val in d)
del d[j]
self.assert_(val not in d)
self.assertEqual(len(d), 0)
def test_rotate(self):
s = tuple('abcde')
n = len(s)
@ -476,9 +490,7 @@ deque(['c', 'b', 'a'])
>>> def delete_nth(d, n):
... "del d[n]"
... d.rotate(-n)
... d.popleft()
... d.rotate(n)
@ -524,7 +536,6 @@ h
>>> print maketree('abcdefgh')
[[[['a', 'b'], ['c', 'd']], [['e', 'f'], ['g', 'h']]]]
"""