utils – Utilities functions operating on the graph¶
To be raised by functions defined as part of an interface.
When the user sees such an error, it is because an important interface function has been left out of an implementation class.
Add tag.trace to an node or variable.
The argument is returned after being affected (inplace).
- thing – The object where we add .tag.trace.
- user_line – The max number of user line to keep.
We alse use config.traceback.limit for the maximum number of stack level we look.
Decorator which will print a warning message on the first call.
Use it like this:
@deprecated('myfile', 'do something different...') def fn_name(...) ...
And it will print:
WARNING myfile.fn_name deprecated. do something different...
Returns all elements in seq1 which are not in seq2: i.e
Recursively flatten tuple, list and set in a list.
Return the SHA256 hash of a file.
Cache the return value for each tuple of arguments (which must be hashable).
Return those items of collection for which predicate(item) is true.
>>> def even(x): ... return x % 2 == 0 >>> remove(even, [1, 2, 3, 4]) [1, 3]
simple_extract_stack(f=None, limit=None, skips=)¶
This is traceback.extract_stack from python 2.7 with this change:
- Comment the update of the cache.
- Skip internal stack trace level.
The update of the cache call os.stat to verify is the cache is up to date. This take too much time on cluster.
limit - The number of stack level we want to return. If None, mean all what we can.
- skips - partial path of stack level we don’t want to keep and count.
- When we find one level that isn’t skipped, we stop skipping.
Sorts prereqs_d.keys() topologically.
prereqs_d[x] contains all the elements that must come before x in the ordering.
Do not use set, this must always return the same value at the same index. If we just exchange other values, but keep the same pattern of duplication, we must keep the same order.