Has list.shift() been proposed?
# pretend lists are implemented in Python and 'self' is a list
def shift(self):
item = self[0]
del self[:1]
return item
This would make queues read nicely... use "append" and "pop" for
a stack, "append" and "shift" for a queue.
(This is while on the thought-train of "making built-in types do
more, rather than introducing more special types", as you'll see
in my next message.)
-- ?!ng
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4