code
stringlengths
3
6.57k
sorted()
cpu_count()
cmp(a, b)
key(a)
multicore_sorted(in_data)
sorted(in_data)
multicore_sorted(in_data, cmp=cmp)
multicore_sorted(in_data, key=key)
multicore_sorted(in_data, reverse=True)
list(reversed(out_data)
print('OK')
Copyright (C)
multicore_sorted(iterable, **kwargs)
Bn()
bn('processes')
kwargs.pop('processes', None)
cpu_count()
Pool()
Pool()
sorted(iterable, **kwargs)
len(iterable)
bn('chunks')
xrange(processes)
enumerate(iterable)
append(item)
below. (chunk, kwargs)
bn('pool')
Pool(processes=processes)
bn('map')
pool.map(picklable_sorted, chunks)
bn('pool')
pool.close()
bn('merge_sorted')
merge_sorted(chunks, **kwargs)
heapq.merge()
bn('test_import')
bn('test_timsort')
sorted(chain(*chunks)
print(bn)
picklable_sorted(chunk)
Pool()
map()
print((chunk, kwargs)
sorted(chunk, **kwargs)
merge_sorted(chunks, cmp=None, key=None, reverse=False)
Bn()
bn('init')
cmp_to_key(cmp)
cmp_key(key(a)
iter(chunk)
chunk.next()
object()
bn('min')
enumerate(items)
min()
K(item)
K(item)
K(item)
bn('append')
result.append(min_item)
bn('fetch')
next()
print(bn)
cmp(a, b)
key(a)
tests()
randint(-100, 100)
xrange(4 * 10**6)
sorted(in_data)
list(reversed(out_data)
Bn()
bn('sorted')
sorted(in_data)
bn('multicore_sorted')
multicore_sorted(in_data)
print(bn)
multicore_sorted(in_data)
sorted(in_data)
multicore_sorted(in_data, cmp=cmp)
multicore_sorted(in_data, key=key)
multicore_sorted(in_data, reverse=True)
multicore_sorted(in_data, cmp=cmp, key=key)
multicore_sorted(in_data, cmp=cmp, reverse=True)
multicore_sorted(in_data, key=key, reverse=True)
multicore_sorted(in_data, cmp=cmp, key=key, reverse=True)
print('OK')
tests()
tree.is_leaf(i)
times.append(tree.get_time(i)
out_degrees.append(len(tree.children(i)
out_degrees.pop(0)
all(x == 2 or x == 0 for x in out_degrees)
len(times)
BirthDeathSimulatorTest(unittest.TestCase)
test_bad_waiting_distributions(self)
self.assertRaises(TreeSimulatorError)
bd_sim.simulate_tree()
self.assertRaises(TreeSimulatorError)
BirthDeathFitnessSimulator(lambda _: 0, 1, num_extant=4)
bd_sim.simulate_tree()