depdigest.LazyRegistry

class depdigest.LazyRegistry(package_prefix, directory, attr_name='form_name', discovery_mode='filesystem', entrypoint_group=None)

A dictionary-like registry that populates itself lazily.

Parameters:

• package_prefix (str)

• directory (str)

• attr_name (str)

• discovery_mode (str)

• entrypoint_group (str | None)

__init__(package_prefix, directory, attr_name='form_name', discovery_mode='filesystem', entrypoint_group=None)

Parameters:

• package_prefix (str)

• directory (str)

• attr_name (str)

• discovery_mode (str)

• entrypoint_group (str | None)

Methods

__init__(package_prefix, directory[, ...])
clear()	Remove all items from the dict.
copy()	Return a shallow copy of the dict.
fromkeys(iterable[, value])	Create a new dictionary with keys from iterable and values set to value.
get(key[, default])	Return the value for key if key is in the dictionary, else default.
items()	Return a set-like object providing a view on the dict's items.
keys()	Return a set-like object providing a view on the dict's keys.
pop(k[,d])	If the key is not found, return the default if given; otherwise, raise a KeyError.
popitem()	Remove and return a (key, value) pair as a 2-tuple.
setdefault(key[, default])	Insert key with a value of default if key is not in the dictionary.
update([E, ]**F)	If E is present and has a .keys() method, then does: for k in E.keys(): D[k] = E[k] If E is present and lacks a .keys() method, then does: for k, v in E: D[k] = v In either case, this is followed by: for k in F: D[k] = F[k]
values()	Return an object providing a view on the dict's values.