Archive for the ‘List Comprehension’ tag
Python’s List Multiply — Use List Comprehension Instead
Brief: I ran into a snag parsing a CSV today — I have lines upon lines of 27 integers each. Each line represents a cube of values — each cube has dimensions 3×3×3. Here’s an example line and the corresponding cube it represents.
A line …
0, 0, 0, 0, 0, 0, 0, 50, 0, 2, 22, 0, 0, 4, 0, 5, 0, 17, 0, 26, 24, 0, 0, 0, 0, 0, 0,
The corresponding cube …



… Where the three major squares represents three levels of depth; each major square has three rows and three columns — the values in each depth are organized rowmajor.
So let’s say the lines in a file are read from stdin thanks to the magic of posix pipes.
We might be able to use a construct like this to store all of our lines in the variable cases as below …
import sys cases = [] for line in sys.stdin: entry = [int(i) for i in line[:1].split(",") if i != ''] current_cases = [[[[0] * 3] * 3] * 3] # Doesn't work ... for ii, i in enumerate(entry): current_cases[ii/9%3][ii/3%3][ii%3] = i # ii is the index (of enumeration), i is the value (from the 'entry') cases.append(current_cases)
Let’s break apart the line that assigns entry first — it’s equal to the below …
entry = line[:1] # get rid of the trailing newline character entry = entry.split(",") # break apart the line by comma character entry = [int(i) for i in entry if i != ''] # convert each element into an integer # except for the trailing empty string
Now let’s break apart the line that assigns current_cases — here’s the logic behind getting each element of the 27element cube …
[ i x x i x x i x x i x x i x x i x x i x x i x x i x x ]  column index [ i i i x x x x x x i i i x x x x x x i i i x x x x x x ]  row index [ i i i i i i i i i x x x x x x x x x x x x x x x x x x ]  depth index
The columns are indexed by [index (mod 3)] — every third item falls in the same column. The rows are indexed by [index /3 (mod 3)] — every run of three items out of nine are part of the same row. The levels of depth are indexed by [index /9 (mod 3)] — every run of nine items out of the 27 elements is part of the same depth.
So here’s the line that doesn’t work …
current_cases = [[[[0] * 3] * 3] * 3]
In current_cases as defined above, there are only three integers — not 27 that are allocated in memory. The above saves cubes where the depth index and the row index don’t matter, only the innermost column index has any meaning. The strange thing is, this wasn’t immediately intuitive to me — I expected the list multiply operation to create nested lists — instead, each of the two enclosing levels of lists just creates additional references to the same list.
This is the line we must use instead to make the nested lists correctly save the cubes …
current_cases = [[[0 for i in xrange(3)] for i in xrange(3)] for i in xrange(3)] # or ... current_cases = [[[0] * 3] for i in xrange(3)] for i in xrange(3)] # or ... current_cases = [[[0, 0, 0] for i in xrange(3)] for i in xrange(3)]
Here, the comprehension iteratively creates the correct 27 memory locations needed for each cube. Each nested comprehension is responsible for creating a unique list at the correct depth.
Putting it together, the correct listing for this task is …
import sys cases = [] for line in sys.stdin: entry = [int(i) for i in line[:1].split(",") if i != ''] current_cases = [[[0 for i in xrange(3)] for i in xrange(3)] for i in xrange(3)] for ii, i in enumerate(entry): current_cases[ii/9%3][ii/3%3][ii%3] = i cases.append(current_cases)
I’ve written this solution down this time because I seem to rediscover it every time I encounter it. Hopefully, this will save you some work too 😀