hestia_earth.calculation.utils.EngineDict¶

class hestia_earth.calculation.utils.EngineDict[source]¶

Bases: collections.OrderedDict

EngineDict class. This class creates dictionaries that do not throw error exceptions when we try to access keys that are not in the dictionary. This class also extends dictionaries in order to covert to list EngineDict itself.

Methods

`clear`
`copy`
`evalues`	Method to generate an EngineList from an EngineDict.
`fromkeys`	Create a new ordered dictionary with keys from iterable and values set to value.
`get`	Return the value for key if key is in the dictionary, else default.
`items`
`keys`
`move_to_end`	Move an existing element to the end (or beginning if last is false).
`pop`	value.
`popitem`	Remove and return a (key, value) pair from the dictionary.
`setdefault`	Insert key with a value of default if key is not in the dictionary.
`update`	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`

clear() → None. Remove all items from od.¶

copy() → a shallow copy of od¶

evalues()[source]¶

Method to generate an EngineList from an EngineDict. :param None:

Returns EngineList.

fromkeys(value=None)¶: Create a new ordered 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¶

move_to_end(key, last=True)¶

Move an existing element to the end (or beginning if last is false).

Raise KeyError if the element does not exist.

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(last=True)¶

Remove and return a (key, value) pair from the dictionary.

Pairs are returned in LIFO order if last is true or FIFO order if false.

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¶