Lines Matching full:d
33 d = deque(range(-5125, -5000))
34 d.__init__(range(200))
36 d.append(i)
38 d.appendleft(i)
39 self.assertEqual(list(d), list(range(-200, 400)))
40 self.assertEqual(len(d), 600)
42 left = [d.popleft() for i in range(250)]
44 self.assertEqual(list(d), list(range(50, 400)))
46 right = [d.pop() for i in range(250)]
49 self.assertEqual(list(d), list(range(50, 150)))
55 d = deque(it, maxlen=3)
57 self.assertEqual(repr(d), 'deque([7, 8, 9], maxlen=3)')
58 self.assertEqual(list(d), [7, 8, 9])
59 self.assertEqual(d, deque(range(10), 3))
60 d.append(10)
61 self.assertEqual(list(d), [8, 9, 10])
62 d.appendleft(7)
63 self.assertEqual(list(d), [7, 8, 9])
64 d.extend([10, 11])
65 self.assertEqual(list(d), [9, 10, 11])
66 d.extendleft([8, 7])
67 self.assertEqual(list(d), [7, 8, 9])
68 d = deque(range(200), maxlen=10)
69 d.append(d)
70 self.assertEqual(repr(d)[-30:], ', 198, 199, [...]], 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])')
80 d = deque(maxlen=0)
81 d.extend(it)
85 d = deque(maxlen=0)
86 d.extendleft(it)
96 d = deque('abc')
97 d.maxlen = 10
102 d = deque(s)
104 self.assertEqual(s.count(letter), d.count(letter), (s, d, letter))
105 self.assertRaises(TypeError, d.count) # too few args
106 self.assertRaises(TypeError, d.count, 1, 2) # too many args
110 d = deque([1, 2, BadCompare(), 3])
111 self.assertRaises(ArithmeticError, d.count, 2)
112 d = deque([1, 2, 3])
113 self.assertRaises(ArithmeticError, d.count, BadCompare())
116 self.d.pop()
119 d = deque([1, 2, 3, m, 4, 5])
120 m.d = d
121 self.assertRaises(RuntimeError, d.count, 3)
125 d = deque([None]*16)
126 for i in range(len(d)):
127 d.rotate(-1)
128 d.rotate(1)
129 self.assertEqual(d.count(1), 0)
130 self.assertEqual(d.count(None), 16)
133 d = deque('xabc')
134 d.popleft()
135 for e in [d, deque('abc'), deque('ab'), deque(), list(d)]:
136 self.assertEqual(d==e, type(d)==type(e) and list(d)==list(e))
137 self.assertEqual(d!=e, not(type(d)==type(e) and list(d)==list(e)))
152 d = deque(range(n))
154 self.assertTrue(i in d)
155 self.assertTrue((n+1) not in d)
158 d = deque(range(n))
159 d[n//2] = MutateCmp(d, False)
161 n in d
164 d = deque(range(n))
165 d[n//2] = BadCmp()
167 n in d
172 d.clear()
174 d = deque([A(), A()])
176 _ = 3 in d
177 d = deque([A(), A()])
179 _ = d.count(3)
182 d = deque('a')
183 self.assertRaises(TypeError, d.extend, 1)
184 d.extend('bcd')
185 self.assertEqual(list(d), list('abcd'))
186 d.extend(d)
187 self.assertEqual(list(d), list('abcdabcd'))
190 d = deque()
193 self.assertEqual(d + d, deque())
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'))
210 d = deque('a')
211 d += 'bcd'
212 self.assertEqual(list(d), list('abcd'))
213 d += d
214 self.assertEqual(list(d), list('abcdabcd'))
217 d = deque('a')
218 self.assertRaises(TypeError, d.extendleft, 1)
219 d.extendleft('bcd')
220 self.assertEqual(list(d), list(reversed('abcd')))
221 d.extendleft(d)
222 self.assertEqual(list(d), list('abcddcba'))
223 d = deque()
224 d.extendleft(range(1000))
225 self.assertEqual(list(d), list(reversed(range(1000))))
226 self.assertRaises(SyntaxError, d.extendleft, fail())
230 d = deque(range(n))
233 d.popleft()
236 d.append(i)
239 assert d[j] == l[j]
241 d = deque('superman')
242 self.assertEqual(d[0], 's')
243 self.assertEqual(d[-1], 'n')
244 d = deque()
245 self.assertRaises(IndexError, d.__getitem__, 0)
246 self.assertRaises(IndexError, d.__getitem__, -1)
251 d = deque(range(n))
253 self.assertEqual(d.index(i), i)
256 d.index(n+1)
259 d = deque(range(n))
260 d[n//2] = MutateCmp(d, False)
262 d.index(n)
265 d = deque(range(n))
266 d[n//2] = BadCmp()
268 d.index(n)
273 d = deque(elements * 2)
282 d.index(element, start, stop)
284 self.assertEqual(d.index(element, start, stop), target)
287 d = deque(range(0, 10000, 10))
289 i = d.index(8500, 700)
290 self.assertEqual(d[i], 8500)
292 d.rotate()
295 d = deque('A' * 3)
297 i = d.index("Hello world", 0, 4)
303 d = deque('ABCDEFGHI')
305 d.insert(i, 'Z')
307 self.assertEqual(list(d), s)
311 d = deque(data, maxlen=len(data))
313 d.insert(2, None)
317 d = deque(elements, maxlen=len(elements)+1)
318 d.insert(i, 'Z')
320 self.assertEqual(d[i], 'Z')
322 self.assertEqual(d[i-1], 'Z')
326 d = deque()
327 d *= n
328 self.assertEqual(d, deque())
329 self.assertIsNone(d.maxlen)
332 d = deque('a')
333 d *= n
334 self.assertEqual(d, deque('a' * n))
335 self.assertIsNone(d.maxlen)
338 d = deque('a', 500)
339 d *= n
340 self.assertEqual(d, deque('a' * min(n, 500)))
341 self.assertEqual(d.maxlen, 500)
344 d = deque('abcdef')
345 d *= n
346 self.assertEqual(d, deque('abcdef' * n))
347 self.assertIsNone(d.maxlen)
350 d = deque('abcdef', 500)
351 d *= n
352 self.assertEqual(d, deque(('abcdef' * n)[-500:]))
353 self.assertEqual(d.maxlen, 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'))
362 self.assertIsNot(d * 1, d)
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))
385 d[i] = 10 * i
386 self.assertEqual(list(d), [10*i for i in range(n)])
387 l = list(d)
389 d[i] = 7*i
391 self.assertEqual(list(d), l)
395 d = deque(range(n))
396 self.assertRaises(IndexError, d.__delitem__, -n-1)
397 self.assertRaises(IndexError, d.__delitem__, n)
399 self.assertEqual(len(d), n-i)
400 j = random.randrange(-len(d), len(d))
401 val = d[j]
402 self.assertIn(val, d)
403 del d[j]
404 self.assertNotIn(val, d)
405 self.assertEqual(len(d), 0)
411 d = deque(data[:i])
412 r = d.reverse()
413 self.assertEqual(list(d), list(reversed(data[:i])))
415 d.reverse()
416 self.assertEqual(list(d), data[:i])
417 self.assertRaises(TypeError, d.reverse, 1) # Arity is zero
423 d = deque(s)
424 d.rotate(1) # verify rot(1)
425 self.assertEqual(''.join(d), 'eabcd')
427 d = deque(s)
428 d.rotate(-1) # verify rot(-1)
429 self.assertEqual(''.join(d), 'bcdea')
430 d.rotate() # check default to 1
431 self.assertEqual(tuple(d), s)
434 d = deque(s)
435 e = deque(d)
436 d.rotate(i) # check vs. rot(1) n times
439 self.assertEqual(tuple(d), tuple(e))
440 d.rotate(-i) # check that it works in reverse
441 self.assertEqual(tuple(d), s)
446 d = deque(s)
447 e = deque(d)
448 d.rotate(-i)
451 self.assertEqual(tuple(d), tuple(e))
452 d.rotate(i) # check that it works in reverse
453 self.assertEqual(tuple(d), s)
457 d = deque(s)
460 dr = d.rotate
463 self.assertEqual(tuple(d), tuple(e))
465 self.assertRaises(TypeError, d.rotate, 'x') # Wrong arg type
466 self.assertRaises(TypeError, d.rotate, 1, 10) # Too many args
468 d = deque()
469 d.rotate() # rotate an empty deque
470 self.assertEqual(d, deque())
473 d = deque('ab')
474 self.assertEqual(len(d), 2)
475 d.popleft()
476 self.assertEqual(len(d), 1)
477 d.pop()
478 self.assertEqual(len(d), 0)
479 self.assertRaises(IndexError, d.pop)
480 self.assertEqual(len(d), 0)
481 d.append('c')
482 self.assertEqual(len(d), 1)
483 d.appendleft('d')
484 self.assertEqual(len(d), 2)
485 d.clear()
486 self.assertEqual(len(d), 0)
489 d = deque()
490 self.assertRaises(IndexError, d.pop)
491 self.assertRaises(IndexError, d.popleft)
494 d = deque(range(100))
495 self.assertEqual(len(d), 100)
496 d.clear()
497 self.assertEqual(len(d), 0)
498 self.assertEqual(list(d), [])
499 d.clear() # clear an empty deque
500 self.assertEqual(list(d), [])
503 d = deque('abcdefghcij')
504 d.remove('c')
505 self.assertEqual(d, deque('abdefghcij'))
506 d.remove('c')
507 self.assertEqual(d, deque('abdefghij'))
508 self.assertRaises(ValueError, d.remove, 'c')
509 self.assertEqual(d, deque('abdefghij'))
512 d = deque(['a', 'b', BadCmp(), 'c'])
513 e = deque(d)
514 self.assertRaises(RuntimeError, d.remove, 'c')
515 for x, y in zip(d, e):
521 d = deque(['ab'])
522 d.extend([MutateCmp(d, match), 'c'])
523 self.assertRaises(IndexError, d.remove, 'c')
524 self.assertEqual(d, deque())
527 d = deque(range(200))
528 e = eval(repr(d))
529 self.assertEqual(list(d), list(e))
530 d.append(d)
531 self.assertEqual(repr(d)[-20:], '7, 198, 199, [...]])')
542 d = deque(range(size))
543 append, pop = d.append, d.popleft
549 self.assertEqual(list(d), list(range(BIG-size, BIG)))
553 d = deque(reversed(range(size)))
554 append, pop = d.appendleft, d.pop
560 self.assertEqual(list(reversed(list(d))),
565 d = deque()
566 append, pop = d.append, d.popleft
575 d = deque()
576 append, pop = d.appendleft, d.pop
585 d = deque()
586 append, pop = d.append, d.pop
593 self.assertEqual(len(d), 0)
596 d = deque()
597 append, pop = d.appendleft, d.popleft
604 self.assertEqual(len(d), 0)
607 d = deque(range(200))
608 e = deque(d)
609 self.assertNotEqual(id(d), id(e))
610 self.assertEqual(list(d), list(e))
613 for d in deque(range(200)), deque(range(200), 100):
615 s = pickle.dumps(d, i)
617 self.assertNotEqual(id(e), id(d))
618 self.assertEqual(list(e), list(d))
619 self.assertEqual(e.maxlen, d.maxlen)
622 for d in deque('abc'), deque('abc', 3):
623 d.append(d)
625 e = pickle.loads(pickle.dumps(d, i))
626 self.assertNotEqual(id(e), id(d))
628 self.assertEqual(e.maxlen, d.maxlen)
637 it, d = pickle.loads(dump)
639 d[i] = x
646 it, d = pickle.loads(dump)
648 d[i] = x
656 it, d = pickle.loads(dump)
658 d[i] = x
665 it, d = pickle.loads(dump)
667 d[i] = x
673 d = deque([mut])
674 e = copy.deepcopy(d)
675 self.assertEqual(list(d), list(e))
677 self.assertNotEqual(id(d), id(e))
678 self.assertNotEqual(list(d), list(e))
682 d = deque([mut])
683 e = copy.copy(d)
684 self.assertEqual(list(d), list(e))
686 self.assertNotEqual(id(d), id(e))
687 self.assertEqual(list(d), list(e))
692 d = deque(s) if maxlen == -1 else deque(s, maxlen)
693 e = d.copy()
694 self.assertEqual(d, e)
695 self.assertEqual(d.maxlen, e.maxlen)
696 self.assertTrue(all(x is y for x, y in zip(d, e)))
700 d = deque([mut])
701 e = d.copy()
702 self.assertEqual(list(d), list(e))
704 self.assertNotEqual(id(d), id(e))
705 self.assertEqual(list(d), list(e))
720 d = deque()
722 d.append(1)
770 d = deque('abcdefg')
771 it = iter(d)
772 d.pop()
776 d = deque()
777 it = iter(d)
778 d.append(10)
794 d = Deque(range(25))
795 d.__init__(range(200))
797 d.append(i)
799 d.appendleft(i)
800 self.assertEqual(list(d), list(range(-200, 400)))
801 self.assertEqual(len(d), 600)
803 left = [d.popleft() for i in range(250)]
805 self.assertEqual(list(d), list(range(50, 400)))
807 right = [d.pop() for i in range(250)]
810 self.assertEqual(list(d), list(range(50, 150)))
812 d.clear()
813 self.assertEqual(len(d), 0)
817 for d in cls('abc'), cls('abcde', maxlen=4):
818 d.x = ['x']
819 d.z = ['z']
821 e = d.__copy__()
822 self.assertEqual(type(d), type(e))
823 self.assertEqual(list(d), list(e))
825 e = cls(d)
826 self.assertEqual(type(d), type(e))
827 self.assertEqual(list(d), list(e))
830 s = pickle.dumps(d, proto)
832 self.assertNotEqual(id(d), id(e))
833 self.assertEqual(type(d), type(e))
834 self.assertEqual(list(d), list(e))
835 self.assertEqual(e.x, d.x)
836 self.assertEqual(e.z, d.z)
841 for d in Deque('abc'), Deque('abc', 3):
842 d.append(d)
844 e = pickle.loads(pickle.dumps(d, proto))
845 self.assertNotEqual(id(e), id(d))
846 self.assertEqual(type(e), type(d))
847 self.assertEqual(e.maxlen, d.maxlen)
848 dd = d.pop()
851 self.assertEqual(e, d)
853 d.x = d
854 e = pickle.loads(pickle.dumps(d, proto))
857 for d in DequeWithBadIter('abc'), DequeWithBadIter('abc', 2):
858 self.assertRaises(TypeError, pickle.dumps, d, proto)
861 d = deque('gallahad')
862 p = weakref.proxy(d)
863 self.assertEqual(str(p), str(d))
864 d = None
883 d = X()
888 d * 42 # shouldn't crash
890 d + deque([1, 2, 3]) # shouldn't crash
927 >>> d = deque('ghi') # make a new deque with three items
928 >>> for elem in d: # iterate over the deque's elements
933 >>> d.append('j') # add a new entry to the right side
934 >>> d.appendleft('f') # add a new entry to the left side
935 >>> d # show the representation of the deque
937 >>> d.pop() # return and remove the rightmost item
939 >>> d.popleft() # return and remove the leftmost item
941 >>> list(d) # list the contents of the deque
943 >>> d[0] # peek at leftmost item
945 >>> d[-1] # peek at rightmost item
947 >>> list(reversed(d)) # list the contents of a deque in reverse
949 >>> 'h' in d # search the deque
951 >>> d.extend('jkl') # add multiple elements at once
952 >>> d
954 >>> d.rotate(1) # right rotation
955 >>> d
957 >>> d.rotate(-1) # left rotation
958 >>> d
960 >>> deque(reversed(d)) # make a new deque in reverse order
962 >>> d.clear() # empty the deque
963 >>> d.pop() # cannot pop from an empty deque
966 d.pop()
969 >>> d.extendleft('abc') # extendleft() reverses the input order
970 >>> d
975 >>> def delete_nth(d, n):
976 ... d.rotate(-n)
977 ... d.popleft()
978 ... d.rotate(n)
980 >>> d = deque('abcdef')
981 >>> delete_nth(d, 2) # remove the entry at d[2]
982 >>> d
983 deque(['a', 'b', 'd', 'e', 'f'])
998 >>> for value in roundrobin('abc', 'd', 'efgh'):
1002 d
1012 ... d = deque(iterable)
1013 ... while len(d) > 1:
1014 ... pair = [d.popleft(), d.popleft()]
1015 ... d.append(pair)
1016 ... return list(d)
1019 [[[['a', 'b'], ['c', 'd']], [['e', 'f'], ['g', 'h']]]]