Lines Matching defs:Deque
1 from collections import deque
22 def __init__(self, deque, result):
23 self.deque = deque
26 self.deque.clear()
32 d = deque(xrange(-5125, -5000))
51 self.assertRaises(ValueError, deque, 'abc', -1)
52 self.assertRaises(ValueError, deque, 'abc', -2)
54 d = deque(it, maxlen=3)
56 self.assertEqual(repr(d), 'deque([7, 8, 9], maxlen=3)')
58 self.assertEqual(d, deque(range(10), 3))
67 d = deque(xrange(200), maxlen=10)
80 d = deque(range(10), maxlen=None)
81 self.assertEqual(repr(d), 'deque([0, 1, 2, 3, 4, 5, 6, 7, 8, 9])')
94 deque(it, maxlen=0)
98 d = deque(maxlen=0)
103 d = deque(maxlen=0)
108 self.assertEqual(deque().maxlen, None)
109 self.assertEqual(deque('abc').maxlen, None)
110 self.assertEqual(deque('abc', maxlen=4).maxlen, 4)
111 self.assertEqual(deque('abc', maxlen=2).maxlen, 2)
112 self.assertEqual(deque('abc', maxlen=0).maxlen, 0)
114 d = deque('abc')
120 d = deque(s)
128 d = deque([1, 2, BadCompare(), 3])
130 d = deque([1, 2, 3])
137 d = deque([1, 2, 3, m, 4, 5])
143 d = deque([None]*16)
151 d = deque('xabc'); d.popleft()
152 for e in [d, deque('abc'), deque('ab'), deque(), list(d)]:
156 args = map(deque, ('', 'a', 'b', 'ab', 'ba', 'abc', 'xba', 'xabc', 'cba'))
168 d = deque('a')
176 d = deque('a')
183 d = deque('a')
189 d = deque()
196 d = deque(xrange(n))
207 d = deque('superman')
210 d = deque()
216 d = deque(xrange(n))
228 d = deque(xrange(n))
244 d = deque(data[:i])
256 d = deque(s)
260 d = deque(s)
267 d = deque(s)
268 e = deque(d)
279 d = deque(s)
280 e = deque(d)
290 d = deque(s)
291 e = deque(s)
301 d = deque()
302 d.rotate() # rotate an empty deque
303 self.assertEqual(d, deque())
306 d = deque('ab')
322 d = deque()
327 d = deque(xrange(100))
332 d.clear() # clear an emtpy deque
336 d = deque('abcdefghcij')
338 self.assertEqual(d, deque('abdefghcij'))
340 self.assertEqual(d, deque('abdefghij'))
342 self.assertEqual(d, deque('abdefghij'))
345 d = deque(['a', 'b', BadCmp(), 'c'])
346 e = deque(d)
354 d = deque(['ab'])
357 self.assertEqual(d, deque())
360 d = deque(xrange(200))
367 d = deque(xrange(200))
381 self.assertRaises(TypeError, deque, 'abc', 2, 3);
382 self.assertRaises(TypeError, deque, 1);
385 self.assertRaises(TypeError, hash, deque('abc'))
389 d = deque(xrange(size))
400 d = deque(reversed(xrange(size)))
411 d = deque()
421 d = deque()
431 d = deque()
442 d = deque()
453 d = deque(xrange(200))
454 e = deque(d)
459 d = deque(xrange(200))
467 ## d = deque('abc')
476 d = deque([mut])
485 d = deque([mut])
494 self.assertEqual(list(reversed(deque(s))), list(reversed(s)))
500 deque()
506 # Bug #3680: tp_traverse was not implemented for deque iterator objects
513 container = deque([obj, 1])
515 container = reversed(deque([obj, 1]))
528 self.assertEqual(object.__sizeof__(deque()), basesize)
530 check(deque(), basesize + blocksize)
531 check(deque('a'), basesize + blocksize)
532 check(deque('a' * (BLOCKLEN // 2)), basesize + blocksize)
533 check(deque('a' * (BLOCKLEN // 2 + 1)), basesize + 2 * blocksize)
534 check(deque('a' * (42 * BLOCKLEN)), basesize + 43 * blocksize)
543 self.assertEqual(list(deque(g(s))), list(g(s)))
544 self.assertRaises(TypeError, deque, seq_tests.IterNextOnly(s))
545 self.assertRaises(TypeError, deque, seq_tests.IterNoNext(s))
546 self.assertRaises(ZeroDivisionError, deque, seq_tests.IterGenExc(s))
549 d = deque('abcdefg')
555 d = deque()
560 class Deque(deque):
563 class DequeWithBadIter(deque):
570 d = Deque(xrange(25))
593 d = Deque('abc')
599 e = Deque(d)
609 d = Deque('abcde', maxlen=4)
615 e = Deque(d)
626 ## d = Deque('abc')
645 d = deque('gallahad')
652 class X(deque):
661 class SubclassWithKwargs(deque):
663 deque.__init__(self)
675 >>> from collections import deque
676 >>> d = deque('ghi') # make a new deque with three items
677 >>> for elem in d: # iterate over the deque's elements
684 >>> d # show the representation of the deque
685 deque(['f', 'g', 'h', 'i', 'j'])
690 >>> list(d) # list the contents of the deque
696 >>> list(reversed(d)) # list the contents of a deque in reverse
698 >>> 'h' in d # search the deque
702 deque(['g', 'h', 'i', 'j', 'k', 'l'])
705 deque(['l', 'g', 'h', 'i', 'j', 'k'])
708 deque(['g', 'h', 'i', 'j', 'k', 'l'])
709 >>> deque(reversed(d)) # make a new deque in reverse order
710 deque(['l', 'k', 'j', 'i', 'h', 'g'])
711 >>> d.clear() # empty the deque
712 >>> d.pop() # cannot pop from an empty deque
716 IndexError: pop from an empty deque
720 deque(['c', 'b', 'a'])
729 >>> d = deque('abcdef')
732 deque(['a', 'b', 'd', 'e', 'f'])
737 ... pending = deque(iter(i) for i in iterables)
761 ... d = deque(iterable)
