shelve - Manage shelves of pickled objects.
| Use Case | Command | Description |
|---|---|---|
| 📂 Open a shelf | d = shelve.open(filename) | Open a persistent dictionary backed by (g)dbm |
| 💾 Open with writeback | d = shelve.open(filename, writeback=True) | Cache all accessed entries; write back on close() |
| 📦 Store a value | d[key] = value | Store an arbitrary picklable object at key |
| 🔍 Retrieve a value | data = d[key] | Returns a copy of the stored object (KeyError if missing) |
| ❌ Delete a key | del d[key] | Remove the entry for key (KeyError if missing) |
| ✔️ Check existence | key in d | Return True if key exists |
| 📋 List all keys | list(d.keys()) | Retrieve all keys (may be slow) |
| 🚪 Close the shelf | d.close() | Close the persistent dictionary; may flush changes |
| 🔄 Sync cache to disk | d.sync() | Write back all cached entries and empty the cache |
| 🔒 Context manager | with shelve.open(filename) as d: | Automatically closes the shelf |
https://docs.python.org/3.10/library/shelve.html
The following documentation is automatically generated from the Python source files. It may be incomplete, incorrect or include features that are considered implementation detail and may vary between Python implementations. When in doubt, consult the module reference at the location listed above.
A "shelf" is a persistent, dictionary-like object. The difference with dbm databases is that the values (not the keys!) in a shelf can be essentially arbitrary Python objects — anything that the "pickle" module can handle. This includes most class instances, recursive data types, and objects containing lots of shared sub-objects. The keys are ordinary strings.
To summarize the interface (key is a string, data is an arbitrary object):
import shelve
d = shelve.open(filename) # open, with (g)dbm filename -- no suffix
d[key] = data # store data at key (overwrites old data if
# using an existing key)
data = d[key] # retrieve a COPY of the data at key (raise
# KeyError if no such key) -- NOTE that this
# access returns a *copy* of the entry!
del d[key] # delete data stored at key (raises KeyError
# if no such key)
flag = key in d # true if the key exists
list = d.keys() # a list of all existing keys (slow!)
d.close() # close it
Dependent on the implementation, closing a persistent dictionary may or may not be necessary to flush changes to disk.
Normally, d[key] returns a COPY of the entry. This needs care when mutable entries are mutated: for example, if d[key] is a list,
d[key].append(anitem)
does NOT modify the entry d[key] itself, as stored in the persistent mapping — it only modifies the copy, which is then immediately discarded, so that the append has NO effect whatsoever. To append an item to d[key] in a way that will affect the persistent mapping, use:
data = d[key]
data.append(anitem)
d[key] = data
To avoid the problem with mutable entries, you may pass the keyword argument writeback=True in the call to shelve.open. When you use:
d = shelve.open(filename, writeback=True)
then d keeps a cache of all entries you access, and writes them all back to the persistent mapping when you call d.close(). This ensures that such usage as d[key].append(anitem) works as intended.
However, using keyword argument writeback=True may consume vast amount of memory for the cache, and it may make d.close() very slow, if you access many of d's entries after opening it in this way: d has no way to check which of the entries you access are mutable and/or which ones you actually mutate, so it must cache, and write back at close, all of the entries that you access. You can call d.sync() to write back all the entries in the cache, and empty the cache (d.sync() also synchronizes the persistent dictionary on disk, if feasible).
collections.abc.MutableMapping(collections.abc.Mapping)
Base class for shelf implementations.
This is initialized with a dictionary-like object. See the module's __doc__ string for an overview of the interface.
Method resolution order:
__contains__(self, key)__del__(self)__delitem__(self, key)__enter__(self)__exit__(self, type, value, traceback)__getitem__(self, key)__init__(self, dict, protocol=None, writeback=False, keyencoding='utf-8') — Initialize self.__iter__(self)__len__(self)__setitem__(self, key, value)close(self)get(self, key, default=None) — D.get(k[,d]) -> D[k] if k in D, else d. d defaults to None.sync(self)clear(self) — D.clear() -> None. Remove all items from D.pop(self, key, default=<object object>) — D.pop(k[,d]) -> v, remove specified key and return the corresponding value. If key is not found, d is returned if given, otherwise KeyError is raised.popitem(self) — D.popitem() -> (k, v), remove and return some (key, value) pair as a 2-tuple; but raise KeyError if D is empty.setdefault(self, key, default=None) — D.setdefault(k[,d]) -> D.get(k,d), also set D[k]=d if k not in D.update(self, other=(), /, **kwds) — D.update([E, ]**F) -> None. Update D from mapping/iterable E and F.__eq__(self, other) — Return self==value.items(self) — D.items() -> a set-like object providing a view on D's items.keys(self) — D.keys() -> a set-like object providing a view on D's keys.values(self) — D.values() -> an object providing a view on D's values.__dict__ — dictionary for instance variables (if defined)__weakref__ — list of weak references to the object (if defined)__abstractmethods__ = frozenset()
Shelf implementation using the "BSD" db interface.
This adds methods first(), next(), previous(), last() and set_location() that have no counterpart in [g]dbm databases.
The actual database must be opened using one of the "bsddb" modules "open" routines (i.e. bsddb.hashopen, bsddb.btopen or bsddb.rnopen) and passed to the constructor.
Method resolution order:
__init__(self, dict, protocol=None, writeback=False, keyencoding='utf-8') — Initialize self.first(self)last(self)next(self)previous(self)set_location(self, key)__contains__(self, key)__del__(self)__delitem__(self, key)__enter__(self)__exit__(self, type, value, traceback)__getitem__(self, key)__iter__(self)__len__(self)__setitem__(self, key, value)close(self)get(self, key, default=None) — D.get(k[,d]) -> D[k] if k in D, else d. d defaults to None.sync(self)Data descriptors inherited from Shelf: __dict__, __weakref__
__abstractmethods__ = frozenset()
Shelf implementation using the "dbm" generic dbm interface.
This is initialized with the filename for the dbm database. See the module's __doc__ string for an overview of the interface.
Method resolution order:
__init__(self, filename, flag='c', protocol=None, writeback=False) — Initialize self.__contains__(self, key)__del__(self)__delitem__(self, key)__enter__(self)__exit__(self, type, value, traceback)__getitem__(self, key)__iter__(self)__len__(self)__setitem__(self, key, value)close(self)get(self, key, default=None) — D.get(k[,d]) -> D[k] if k in D, else d. d defaults to None.sync(self)Data descriptors inherited from Shelf: __dict__, __weakref__
__abstractmethods__ = frozenset()
Open a persistent dictionary for reading and writing.
The filename parameter is the base filename for the underlying database. As a side-effect, an extension may be added to the filename and more than one file may be created. The optional flag parameter has the same interpretation as the flag parameter of dbm.open(). The optional protocol parameter specifies the version of the pickle protocol.
See the module's __doc__ string for an overview of the interface.
__all__ = ['Shelf', 'BsdDbShelf', 'DbfilenameShelf', 'open']
/usr/lib/python3.10/shelve.py
Generated by phpman v4.9.27 · Markdown · JSON · MCP Author: Che Dong Under GNU General Public License
2026-07-18 13:21 @216.73.216.114
CrawledBy Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
Enhanced by LLM: deepseek-v4-flash / taotoken.net / www.chedong.com - original format