Lines Matching +full:merge +full:- +full:stream

32     # The 'merge' function has examples in its docstring which we should test
37     # create a finder which returns the doctests from the merge method.
42             return dtf.find(py_heapq.merge)
82                 parentpos = (pos-1) >> 1
101         self.assertEqual(heap, sorted(data)[-10:])
104         # An iterator returning a heap's elements, smallest-first.
112         # Less-naive "N-best" algorithm, much faster (if len(data) is big
116         # (10 log-time steps).
123         self.assertEqual(list(self.heapiter(heap)), sorted(data)[-10:])
135         self.assertEqual(list(self.heapiter(heap)), sorted(data)[-10:])
158         # _heapop_max has an optimization for one-item lists which isn't
184                 tup = random.choice('ABC'), random.randrange(-500, 500)
194                                  list(self.module.merge(*seqs, key=key, reverse=reverse)))
195                 self.assertEqual(list(self.module.merge()), [])
200         self.assertEqual(list(self.module.merge([], [])), [])
201         self.assertEqual(list(self.module.merge([], [], key=lambda: 6)), [])
204         # Issue 19018: Heapq.merge suppresses IndexError from user generator
210             list(self.module.merge(iterable(), iterable()))
217             stream = random.randrange(4)
220             obj.pair = (x, stream)
221             inputs[stream].append(obj)
222         for stream in inputs:
223             stream.sort()
224         result = [i.pair for i in self.module.merge(*inputs)]
437         # See bpo-39421: Strong references need to be taken