def _simplify_iter(iters):
- total = sum([len(it) for it in iters])
- l = list([iter(it) for it in iters])
+ total = sum(len(it) for it in iters)
+ l = [iter(it) for it in iters]
del iters
- l = list([(next(it),it) for it in l])
+ l = [(next(it),it) for it in l]
l = filter(lambda x: x[0], l)
count = 0
while l:
for e in merge(inp, bits, table):
f.write(e)
- f.write('\0'.join([os.path.basename(p) for p in infilenames]))
+ f.write('\0'.join(os.path.basename(p) for p in infilenames))
f.seek(12)
f.write(struct.pack('!%dI' % entries, *table))
if forget_packs:
self.packs = []
skip_midx = skip_midx or ignore_midx
- d = dict([(p.name, 1) for p in self.packs])
+ d = dict((p.name, 1) for p in self.packs)
if os.path.exists(self.dir):
if not skip_midx:
midxl = []
def idxmerge(idxlist):
- total = sum([len(i) for i in idxlist])
- iters = [iter(i) for i in idxlist]
+ total = sum(len(i) for i in idxlist)
+ iters = (iter(i) for i in idxlist)
heap = [(next(it), it) for it in iters]
heapq.heapify(heap)
count = 0
# But it's used in a couple of places, so let's put it here.
def pathsplit(p):
l = p.split('/')
- l = list([i+'/' for i in l[:-1]]) + l[-1:]
+ l = [i+'/' for i in l[:-1]] + l[-1:]
if l[-1] == '':
l.pop() # extra blank caused by terminating '/'
return l