Dictionary that remembers insertion order
od.clear() -> None. Remove all items from od.
od.copy() -> a shallow copy of od
OD.fromkeys(S[, v]) -> New ordered dictionary with keys from S and values equal to v (which defaults to None).
od.popitem() -> (k, v)
Return and remove a (key, value) pair. Pairs are returned in LIFO order if last is true or FIFO order if false.
Iterate over all elements in the iterator, and when its exhausted yield the last value infinitely.
Retry the function over and over until max retries is exceeded.
For each retry we sleep a for a while before we try again, this interval is increased for every retry until the max seconds is reached.
Parameters: |
|
---|