dumbdbm Namespace Reference

Data Structures
class	_Database

Functions
def	__setitem__
def	__delitem__
def	keys
def	has_key
def	__contains__
def	iterkeys
def	__len__
def	close
def	__del__
def	open

Variables
	_open = __builtin__.open
int	_BLOCKSIZE = 512
	error = IOError
tuple	npos = ((pos + _BLOCKSIZE - 1) // _BLOCKSIZE)
	Does not work under MW compiler pos = ((pos + _BLOCKSIZE - 1) / _BLOCKSIZE) * _BLOCKSIZE f.seek(pos) More...
	pos = npos
	__iter__ = iterkeys
	_index
	_datfile
	_dirfile
	_bakfile

Detailed Description

A dumb and slow but simple dbm clone.

For database spam, spam.dir contains the index (a text file),
spam.bak *may* contain a backup of the index (also a text file),
while spam.dat contains the data (a binary file).

XXX TO DO:

- seems to contain a bug when updating...

- reclaim free space (currently, space once occupied by deleted or expanded
items is never reused)

- support concurrent access (currently, if two processes take turns making
updates, they can mess up the index)

- support efficient access to large databases (currently, the whole index
is read when the database is opened, and some updates rewrite the whole index)

- support opening for read-only (flag = 'm')

Function Documentation

def dumbdbm.__contains__	(		self,
			key
	)

Definition at line 135 of file dumbdbm.py.

    def __contains__(self, key):
        return self._index.has_key(key)