And a correction to the size method I suggested for the queue object: def size(self): return sum(map(len, self.superlist)) The previous one was giving wrong results when get was called N times and N % maximum_sublist_size != 0. I believe this should be implemented in C, otherwise the overhead would be too much for queues that never grew.
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