| | |
- builtins.dict(builtins.object)
-
- priorityDictionary
- builtins.object
-
- Benchmarker
- Colorgen
- working_dir
class Benchmarker(builtins.object) |
| |
Benchmarker(active, description)
class for benchmarking a function using a "with"-statement.
Preferable over the "benchmark" function for the following use cases
- benchmarking a code block that isn't wrapped in a function
- benchmarking a function only in some calls
|
| |
Methods defined here:
- __enter__(self)
- __exit__(self, *args)
- __init__(self, active, description)
- Initialize self. See help(type(self)) for accurate signature.
Data descriptors defined here:
- __dict__
- dictionary for instance variables
- __weakref__
- list of weak references to the object
|
class Colorgen(builtins.object) |
| |
Colorgen(hsv, cycleLength=10.67)
|
| |
Methods defined here:
- __call__(self)
- return constant or randomized rgb-color string
- __init__(self, hsv, cycleLength=10.67)
- Initialize self. See help(type(self)) for accurate signature.
- byteTuple(self)
- return color as a tuple of bytes each in [0,255]
- floatTuple(self)
- return color as a tuple of floats each in [0,1]
- get_value(self, opt, index)
Data descriptors defined here:
- __dict__
- dictionary for instance variables
- __weakref__
- list of weak references to the object
Data and other attributes defined here:
- DISTINCT = [(0.17, 1.0, 0.5), (0.0, 0.9, 1.0), (0.35, 0.67, 0.71), (0.14, 0.9, 1.0), (0.56, 1.0, 0.78), (0.07, 0.8, 0.96), (0.79, 0.83, 0.71), (0.5, 0.71, 0.94), (0.84, 0.79, 0.94), (0.2, 0.76, 0.96), (0.0, 0.24, 0.98), (0.5, 1.0, 0.5), (0.77, 0.25, 1.0), (0.09, 0.76, 0.67), (0.15, 0.22, 1.0), (0.0, 1.0, 0.5), (0.38, 0.33, 1.0), (0.67, 1.0, 0.5)]
|
class priorityDictionary(builtins.dict) |
| | |
- Method resolution order:
- priorityDictionary
- builtins.dict
- builtins.object
Methods defined here:
- __init__(self)
- Initialize priorityDictionary by creating binary heap
of pairs (value,key). Note that changing or removing a dict entry will
not remove the old pair from the heap until it is found by smallest() or
until the heap is rebuilt.
- __iter__(self)
- Create destructive sorted iterator of priorityDictionary.
- __setitem__(self, key, val)
- Change value stored in dictionary and add corresponding
pair to heap. Rebuilds the heap if the number of deleted items grows
too large, to avoid memory leakage.
- setdefault(self, key, val)
- Reimplement setdefault to call our customized __setitem__.
- smallest(self)
- Find smallest item after removing deleted items from heap.
- update(self, other)
- D.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]
Data descriptors defined here:
- __dict__
- dictionary for instance variables
- __weakref__
- list of weak references to the object
Methods inherited from builtins.dict:
- __contains__(self, key, /)
- True if the dictionary has the specified key, else False.
- __delitem__(self, key, /)
- Delete self[key].
- __eq__(self, value, /)
- Return self==value.
- __ge__(self, value, /)
- Return self>=value.
- __getattribute__(self, name, /)
- Return getattr(self, name).
- __getitem__(self, key, /)
- Return self[key].
- __gt__(self, value, /)
- Return self>value.
- __ior__(self, value, /)
- Return self|=value.
- __le__(self, value, /)
- Return self<=value.
- __len__(self, /)
- Return len(self).
- __lt__(self, value, /)
- Return self<value.
- __ne__(self, value, /)
- Return self!=value.
- __or__(self, value, /)
- Return self|value.
- __repr__(self, /)
- Return repr(self).
- __reversed__(self, /)
- Return a reverse iterator over the dict keys.
- __ror__(self, value, /)
- Return value|self.
- __sizeof__(...)
- D.__sizeof__() -> size of D in memory, in bytes
- clear(...)
- D.clear() -> None. Remove all items from D.
- copy(...)
- D.copy() -> a shallow copy of D
- get(self, key, default=None, /)
- Return the value for key if key is in the dictionary, else default.
- items(...)
- D.items() -> a set-like object providing a view on D's items
- keys(...)
- D.keys() -> a set-like object providing a view on D's keys
- pop(...)
- D.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(self, /)
- 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.
- values(...)
- D.values() -> an object providing a view on D's values
Class methods inherited from builtins.dict:
- __class_getitem__(...)
- See PEP 585
- fromkeys(iterable, value=None, /)
- Create a new dictionary with keys from iterable and values set to value.
Static methods inherited from builtins.dict:
- __new__(*args, **kwargs) class method of builtins.dict
- Create and return a new object. See help(type) for accurate signature.
Data and other attributes inherited from builtins.dict:
- __hash__ = None
|
class working_dir(builtins.object) |
| |
working_dir(dir)
temporarily change working directory using 'with' statement
|
| |
Methods defined here:
- __enter__(self)
- __exit__(self, type, value, traceback)
- __init__(self, dir)
- Initialize self. See help(type(self)) for accurate signature.
Data descriptors defined here:
- __dict__
- dictionary for instance variables
- __weakref__
- list of weak references to the object
| |