estimator.cost.Cost

class estimator.cost.Cost(dict=None, /, **kwargs)

Algorithms costs.

__call__(**kwargs)

Call self as a function.

Methods

__init__([dict])
clear()
combine(right[, base])	Combine left and right.
copy()
filter(**keys)	Return new ordered dictionary from dictionary restricted to the keys.
fromkeys(iterable[, value])
get(k[,d])
items()
keys()
pop(k[,d])	If key is not found, d is returned if given, otherwise KeyError is raised.
popitem()	as a 2-tuple; but raise KeyError if D is empty.
register_impermanent([data])
reorder(*args)	Return a new ordered dict from the key:value pairs in dictionary but reordered such that the keys given to this function come first.
repeat(times[, select])	Return a report with all costs multiplied by times.
sanity_check()	Perform basic checks.
setdefault(k[,d])
str([keyword_width, newline, round_bound, ...])	param keyword_width: keys are printed with this width
update([E, ]**F)	If E present and has a .keys() method, does: for k in E: D[k] = E[k] If E present and lacks .keys() method, does: for (k, v) in E: D[k] = v In either case, this is followed by: for k, v in F.items(): D[k] = v
values()

Attributes

impermanents
key_map
val_map