On Thu, Sep 20, 2012 at 7:58 AM, Albert-Jan Roskam <fo...@yahoo.com> wrote: > > Can such a program be scaled to lists that do not fit into memory (maybe > using shelve?)?
shelve uses a database (e.g. gdbm) based on hashing. It's an unordered mapping. Unlike a dict, the keys must be strings. http://docs.python.org/library/shelve GNU dbm: http://www.gnu.org.ua/software/gdbm/manual/html_node/Intro.html#SEC2 Hash tables: http://en.wikipedia.org/wiki/Hash_table _______________________________________________ Tutor maillist - Tutor@python.org To unsubscribe or change subscription options: http://mail.python.org/mailman/listinfo/tutor
