muprocdurham.pcfg.PrettyDict

class muprocdurham.pcfg.PrettyDict(*args, empty='{}', compact=True, left='{', right='}', **kwargs)

Bases: defaultdict

Public Data Attributes:

Inherited from defaultdict

default_factory

Factory for default value called by __missing__().

Public Methods:

__init__(*args[, empty, compact, left, right])
__str__()	Return str(self).

Inherited from defaultdict

__repr__()	Return repr(self).
__getattribute__(name, /)	Return getattr(self, name).
__init__(*args, **kwargs)
__or__(value, /)	Return self|value.
__ror__(value, /)	Return value|self.
__missing__	__missing__(key) # Called by __getitem__ for missing key; pseudo-code: if self.default_factory is None: raise KeyError((key,)) self[key] = value = self.default_factory() return value
copy()
__copy__	D.copy() -> a shallow copy of D.
__reduce__	Return state information for pickling.
__class_getitem__	See PEP 585

Inherited from dict

__repr__()	Return repr(self).
__getattribute__(name, /)	Return getattr(self, name).
__lt__(value, /)	Return self<value.
__le__(value, /)	Return self<=value.
__eq__(value, /)	Return self==value.
__ne__(value, /)	Return self!=value.
__gt__(value, /)	Return self>value.
__ge__(value, /)	Return self>=value.
__iter__()	Implement iter(self).
__init__(*args, **kwargs)
__or__(value, /)	Return self|value.
__ror__(value, /)	Return value|self.
__ior__(value, /)	Return self|=value.
__len__()	Return len(self).
__getitem__	x.__getitem__(y) <==> x[y]
__setitem__(key, value, /)	Set self[key] to value.
__delitem__(key, /)	Delete self[key].
__contains__(key, /)	True if the dictionary has the specified key, else False.
__sizeof__()
get(key[, default])	Return the value for key if key is in the dictionary, else default.
setdefault(key[, default])	Insert key with a value of default if key is not in the dictionary.
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.
keys()
items()
values()
update([E, ]**F)	If E is present and has a .keys() method, then does: for k in E: 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]
fromkeys([value])	Create a new dictionary with keys from iterable and values set to value.
clear()
copy()
__reversed__()	Return a reverse iterator over the dict keys.
__class_getitem__	See PEP 585

---

__annotations__ = {}

__class_getitem__()

See PEP 585

__contains__(key, /)

True if the dictionary has the specified key, else False.

__copy__()

D.copy() -> a shallow copy of D.

__delitem__(key, /)

Delete self[key].

__dict__ = mappingproxy({'__module__': 'muprocdurham.pcfg', '__init__': <function PrettyDict.__init__>, '__str__': <function PrettyDict.__str__>, '__dict__': <attribute '__dict__' of 'PrettyDict' objects>, '__weakref__': <attribute '__weakref__' of 'PrettyDict' objects>, '__doc__': None, '__annotations__': {}})

__eq__(value, /)

Return self==value.

__ge__(value, /)

Return self>=value.

__getattribute__(name, /)

Return getattr(self, name).

__getitem__()

x.__getitem__(y) <==> x[y]

__gt__(value, /)

Return self>value.

__hash__ = None

__init__(*args, empty='{}', compact=True, left='{', right='}', **kwargs)

__ior__(value, /)

Return self|=value.

__iter__()

Implement iter(self).

__le__(value, /)

Return self<=value.

__len__()

Return len(self).

__lt__(value, /)

Return self<value.

__missing__()

__missing__(key) # Called by __getitem__ for missing key; pseudo-code: if self.default_factory is None: raise KeyError((key,)) self[key] = value = self.default_factory() return value

__module__ = 'muprocdurham.pcfg'

__ne__(value, /)

Return self!=value.

__new__(**kwargs)

__or__(value, /)

Return self|value.

__reduce__()

Return state information for pickling.

__repr__()

Return repr(self).

__reversed__()

Return a reverse iterator over the dict keys.

__ror__(value, /)

Return value|self.

__setitem__(key, value, /)

Set self[key] to value.

__sizeof__() → size of D in memory, in bytes

__str__()

Return str(self).

__weakref__

list of weak references to the object (if defined)

clear() → None.  Remove all items from D.

copy() → a shallow copy of D.

default_factory

Factory for default value called by __missing__().

fromkeys(value=None, /)

Create a new dictionary with keys from iterable and values set to value.

get(key, default=None, /)

Return the value for key if key is in the dictionary, else default.

items() → a set-like object providing a view on D's items

keys() → a set-like object providing a view on D's keys

pop(k[, d]) → v, remove specified key and return the corresponding value.

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.

Pairs are returned in LIFO (last-in, first-out) order. Raises KeyError if the dict is empty.

setdefault(key, default=None, /)

Insert key with a value of default if key is not in the dictionary.

Return the value for key if key is in the dictionary, else default.

update([E, ]**F) → None.  Update D from dict/iterable E and F.

If E is present and has a .keys() method, then does: for k in E: 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() → an object providing a view on D's values