Lines Matching refs:deque
1 from collections import deque
23 def __init__(self, deque, result):
24 self.deque = deque
27 self.deque.clear()
33 d = deque(range(-5125, -5000))
52 self.assertRaises(ValueError, deque, 'abc', -1)
53 self.assertRaises(ValueError, deque, 'abc', -2)
55 d = deque(it, maxlen=3)
57 self.assertEqual(repr(d), 'deque([7, 8, 9], maxlen=3)')
59 self.assertEqual(d, deque(range(10), 3))
68 d = deque(range(200), maxlen=10)
71 d = deque(range(10), maxlen=None)
72 self.assertEqual(repr(d), 'deque([0, 1, 2, 3, 4, 5, 6, 7, 8, 9])')
76 deque(it, maxlen=0)
80 d = deque(maxlen=0)
85 d = deque(maxlen=0)
90 self.assertEqual(deque().maxlen, None)
91 self.assertEqual(deque('abc').maxlen, None)
92 self.assertEqual(deque('abc', maxlen=4).maxlen, 4)
93 self.assertEqual(deque('abc', maxlen=2).maxlen, 2)
94 self.assertEqual(deque('abc', maxlen=0).maxlen, 0)
96 d = deque('abc')
102 d = deque(s)
110 d = deque([1, 2, BadCompare(), 3])
112 d = deque([1, 2, 3])
119 d = deque([1, 2, 3, m, 4, 5])
125 d = deque([None]*16)
133 d = deque('xabc')
135 for e in [d, deque('abc'), deque('ab'), deque(), list(d)]:
139 args = map(deque, ('', 'a', 'b', 'ab', 'ba', 'abc', 'xba', 'xabc', 'cba'))
152 d = deque(range(n))
158 d = deque(range(n))
164 d = deque(range(n))
174 d = deque([A(), A()])
177 d = deque([A(), A()])
182 d = deque('a')
190 d = deque()
191 e = deque('abc')
192 f = deque('def')
193 self.assertEqual(d + d, deque())
194 self.assertEqual(e + f, deque('abcdef'))
195 self.assertEqual(e + e, deque('abcabc'))
196 self.assertEqual(e + d, deque('abc'))
197 self.assertEqual(d + e, deque('abc'))
198 self.assertIsNot(d + d, deque())
199 self.assertIsNot(e + d, deque('abc'))
200 self.assertIsNot(d + e, deque('abc'))
202 g = deque('abcdef', maxlen=4)
203 h = deque('gh')
204 self.assertEqual(g + h, deque('efgh'))
207 deque('abc') + 'def'
210 d = deque('a')
217 d = deque('a')
223 d = deque()
230 d = deque(range(n))
241 d = deque('superman')
244 d = deque()
251 d = deque(range(n))
259 d = deque(range(n))
265 d = deque(range(n))
273 d = deque(elements * 2)
287 d = deque(range(0, 10000, 10))
295 d = deque('A' * 3)
303 d = deque('ABCDEFGHI')
311 d = deque(data, maxlen=len(data))
317 d = deque(elements, maxlen=len(elements)+1)
326 d = deque()
328 self.assertEqual(d, deque())
332 d = deque('a')
334 self.assertEqual(d, deque('a' * n))
338 d = deque('a', 500)
340 self.assertEqual(d, deque('a' * min(n, 500)))
344 d = deque('abcdef')
346 self.assertEqual(d, deque('abcdef' * n))
350 d = deque('abcdef', 500)
352 self.assertEqual(d, deque(('abcdef' * n)[-500:]))
356 d = deque('abc')
357 self.assertEqual(d * -5, deque())
358 self.assertEqual(d * 0, deque())
359 self.assertEqual(d * 1, deque('abc'))
360 self.assertEqual(d * 2, deque('abcabc'))
361 self.assertEqual(d * 3, deque('abcabcabc'))
364 self.assertEqual(deque() * 0, deque())
365 self.assertEqual(deque() * 1, deque())
366 self.assertEqual(deque() * 5, deque())
368 self.assertEqual(-5 * d, deque())
369 self.assertEqual(0 * d, deque())
370 self.assertEqual(1 * d, deque('abc'))
371 self.assertEqual(2 * d, deque('abcabc'))
372 self.assertEqual(3 * d, deque('abcabcabc'))
374 d = deque('abc', maxlen=5)
375 self.assertEqual(d * -5, deque())
376 self.assertEqual(d * 0, deque())
377 self.assertEqual(d * 1, deque('abc'))
378 self.assertEqual(d * 2, deque('bcabc'))
379 self.assertEqual(d * 30, deque('bcabc'))
383 d = deque(range(n))
395 d = deque(range(n))
411 d = deque(data[:i])
423 d = deque(s)
427 d = deque(s)
434 d = deque(s)
435 e = deque(d)
446 d = deque(s)
447 e = deque(d)
457 d = deque(s)
458 e = deque(s)
468 d = deque()
469 d.rotate() # rotate an empty deque
470 self.assertEqual(d, deque())
473 d = deque('ab')
489 d = deque()
494 d = deque(range(100))
499 d.clear() # clear an empty deque
503 d = deque('abcdefghcij')
505 self.assertEqual(d, deque('abdefghcij'))
507 self.assertEqual(d, deque('abdefghij'))
509 self.assertEqual(d, deque('abdefghij'))
512 d = deque(['a', 'b', BadCmp(), 'c'])
513 e = deque(d)
521 d = deque(['ab'])
524 self.assertEqual(d, deque())
527 d = deque(range(200))
534 self.assertRaises(TypeError, deque, 'abc', 2, 3)
535 self.assertRaises(TypeError, deque, 1)
538 self.assertRaises(TypeError, hash, deque('abc'))
542 d = deque(range(size))
553 d = deque(reversed(range(size)))
565 d = deque()
575 d = deque()
585 d = deque()
596 d = deque()
607 d = deque(range(200))
608 e = deque(d)
613 for d in deque(range(200)), deque(range(200), 100):
622 for d in deque('abc'), deque('abc', 3):
631 orig = deque(range(200))
673 d = deque([mut])
682 d = deque([mut])
692 d = deque(s) if maxlen == -1 else deque(s, maxlen)
700 d = deque([mut])
709 self.assertEqual(list(reversed(deque(s))), list(reversed(s)))
712 klass = type(reversed(deque()))
714 self.assertEqual(list(klass(deque(s))), list(reversed(s)))
720 d = deque()
726 # Bug #3680: tp_traverse was not implemented for deque iterator objects
733 container = deque([obj, 1])
735 container = reversed(deque([obj, 1]))
749 self.assertEqual(object.__sizeof__(deque()), basesize)
751 check(deque(), basesize + blocksize)
752 check(deque('a'), basesize + blocksize)
753 check(deque('a' * (BLOCKLEN - 1)), basesize + blocksize)
754 check(deque('a' * BLOCKLEN), basesize + 2 * blocksize)
755 check(deque('a' * (42 * BLOCKLEN)), basesize + 43 * blocksize)
764 self.assertEqual(list(deque(g(s))), list(g(s)))
765 self.assertRaises(TypeError, deque, seq_tests.IterNextOnly(s))
766 self.assertRaises(TypeError, deque, seq_tests.IterNoNext(s))
767 self.assertRaises(ZeroDivisionError, deque, seq_tests.IterGenExc(s))
770 d = deque('abcdefg')
776 d = deque()
781 class Deque(deque):
784 class DequeWithSlots(deque):
787 class DequeWithBadIter(deque):
861 d = deque('gallahad')
869 class X(deque):
879 # The interpreter used to crash in specific cases where a deque
880 # subclass returned a non-deque.
881 class X(deque):
890 d + deque([1, 2, 3]) # shouldn't crash
893 class SubclassWithKwargs(deque):
895 deque.__init__(self)
903 type2test = deque
919 self.skipTest("Exhausted deque iterator doesn't free a deque")
926 >>> from collections import deque
927 >>> d = deque('ghi') # make a new deque with three items
928 >>> for elem in d: # iterate over the deque's elements
935 >>> d # show the representation of the deque
936 deque(['f', 'g', 'h', 'i', 'j'])
941 >>> list(d) # list the contents of the deque
947 >>> list(reversed(d)) # list the contents of a deque in reverse
949 >>> 'h' in d # search the deque
953 deque(['g', 'h', 'i', 'j', 'k', 'l'])
956 deque(['l', 'g', 'h', 'i', 'j', 'k'])
959 deque(['g', 'h', 'i', 'j', 'k', 'l'])
960 >>> deque(reversed(d)) # make a new deque in reverse order
961 deque(['l', 'k', 'j', 'i', 'h', 'g'])
962 >>> d.clear() # empty the deque
963 >>> d.pop() # cannot pop from an empty deque
967 IndexError: pop from an empty deque
971 deque(['c', 'b', 'a'])
980 >>> d = deque('abcdef')
983 deque(['a', 'b', 'd', 'e', 'f'])
988 ... pending = deque(iter(i) for i in iterables)
1012 ... d = deque(iterable)