I have a list of size < N and I want to pad it up to the size N with a value.
Certainly, I can use something like the following, but I feel that there should be something I missed:
>>> N = 5
>>> a = [1]
>>> map(lambda x, y: y if x is None else x, a, ['']*N)
[1, '', '', '', '']
a += [''] * (N - len(a))
or if you don't want to change a
in place
new_a = a + [''] * (N - len(a))
you can always create a subclass of list and call the method whatever you please
class MyList(list):
def ljust(self, n, fillvalue=''):
return self + [fillvalue] * (n - len(self))
a = MyList(['1'])
b = a.ljust(5, '')
There is no built-in function for this. But you could compose the built-ins for your task (or anything :p).
(Modified from itertool's padnone
and take
recipes)
from itertools import chain, repeat, islice
def pad_infinite(iterable, padding=None):
return chain(iterable, repeat(padding))
def pad(iterable, size, padding=None):
return islice(pad_infinite(iterable, padding), size)
Usage:
>>> list(pad([1,2,3], 7, ''))
[1, 2, 3, '', '', '', '']
I think this approach is more visual and pythonic.
a = (a + N * [''])[:N]
gnibbler's answer is nicer, but if you need a builtin, you could use itertools.izip_longest
(zip_longest
in Py3k):
itertools.izip_longest( xrange( N ), list )
which will return a list of tuples ( i, list[ i ] )
filled-in to None. If you need to get rid of the counter, do something like:
map( itertools.itemgetter( 1 ), itertools.izip_longest( xrange( N ), list ) )
You could also use a simple generator without any build ins. But I would not pad the list, but let the application logic deal with an empty list.
Anyhow, iterator without buildins
def pad(iterable, padding='.', length=7):
'''
>>> iterable = [1,2,3]
>>> list(pad(iterable))
[1, 2, 3, '.', '.', '.', '.']
'''
for count, i in enumerate(iterable):
yield i
while count < length - 1:
count += 1
yield padding
if __name__ == '__main__':
import doctest
doctest.testmod()
If you want to pad with None instead of '', map() does the job:
>>> map(None,[1,2,3],xrange(7))
[(1, 0), (2, 1), (3, 2), (None, 3), (None, 4), (None, 5), (None, 6)]
>>> zip(*map(None,[1,2,3],xrange(7)))[0]
(1, 2, 3, None, None, None, None)
more-itertools
is a library that includes a special padded
tool for this kind of problem:
import more_itertools as mit
list(mit.padded(a, "", N))
# [1, '', '', '', '']
Alternatively, more_itertools
also implements Python itertools recipes including padnone
and take
as mentioned by @kennytm, so they don't have to be reimplemented:
list(mit.take(N, mit.padnone(a)))
# [1, None, None, None, None]
If you wish to replace the default None
padding, use a list comprehension:
["" if i is None else i for i in mit.take(N, mit.padnone(a))]
# [1, '', '', '', '']
To go off of kennytm:
def pad(l, size, padding):
return l + [padding] * abs((len(l)-size))
>>> l = [1,2,3]
>>> pad(l, 7, 0)
[1, 2, 3, 0, 0, 0, 0]
extra_length = desired_length - len(l)
l.extend(value for _ in range(extra_length))
This avoids any extra allocation, unlike any solution that depends on creating and appending the list [value] * extra_length
. The "extend" method first calls __length_hint__
on the iterator, and extends the allocation for l
by that much before filling it in from the iterator.
来源:https://stackoverflow.com/questions/3438756/some-built-in-to-pad-a-list-in-python