Iterating over a sequence in reverse
28th January 2004
At work today we stumbled across a situation where we needed to display a list of items in reverse order. The decision to show them in reverse is made in the presentation layer, so altering the code that generates the list in the application logic layer would add coupling between the layers that we would rather avoid. Python’s reverse() function acts on a data structure in place, which we would rather avoid as well. Then we realised that Python’s generators could be used to create a proxy around the sequence allowing us to cycle through it in reverse without altering the sequence itself. Here’s the code:
class ReverseIteratorProxy:
def __init__(self, sequence):
self.sequence = sequence
def __iter__(self):
length = len(self.sequence)
i = length
while i > 0:
i = i - 1
yield self.sequence[i]
>>> l = range(10)
>>> l
[0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
>>> for i in ReverseIteratorProxy(l):
... print i,
...
9 8 7 6 5 4 3 2 1 0
>>>
I was going to explain how the above code works, but after several false starts I realised that explaining generators is best left to the experts.
Update: Unsurprisingly, this isn’t exactly a new idea. PEP 322 covers reverse iteration, and the Python Tutorial uses it to illustrate both iterators and generators. Aah well.
More recent articles
- Notes on the new Claude analysis JavaScript code execution tool - 24th October 2024
- Initial explorations of Anthropic's new Computer Use capability - 22nd October 2024
- Everything I built with Claude Artifacts this week - 21st October 2024