File size: 7,090 Bytes
fbd9366 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 | import codecs
from collections import Counter
import fnmatch
import hashlib
import os
import pickle
from typing import Any, Callable, Dict, List, Optional, Union
from typing_extensions import Literal
def set_os_envs(envs: Optional[Dict[str, Any]] = None):
"""
Special value __delete__ or None indicates that the ENV_VAR should be removed
"""
if envs is None:
envs = {}
DEL = {None, "__delete__"}
for k, v in envs.items():
if v in DEL:
os.environ.pop(k, None)
os.environ.update({k: str(v) for k, v in envs.items() if v not in DEL})
def argmax(L):
return max(zip(L, range(len(L))))[1]
def _match_patterns_helper(element, patterns):
for p in patterns:
if callable(p) and p(element):
return True
if fnmatch.fnmatch(element, p):
return True
return False
def match_patterns(
item: str,
include: Union[str, List[str], Callable, List[Callable], None] = None,
exclude: Union[str, List[str], Callable, List[Callable], None] = None,
*,
precedence: Literal["include", "exclude"] = "exclude",
):
"""
Args:
include: None to disable `include` filter and delegate to exclude
precedence: "include" or "exclude"
"""
assert precedence in ["include", "exclude"]
if exclude is None:
exclude = []
if isinstance(exclude, (str, Callable)):
exclude = [exclude]
if isinstance(include, (str, Callable)):
include = [include]
if include is None:
# exclude is the sole veto vote
return not _match_patterns_helper(item, exclude)
if precedence == "include":
return _match_patterns_helper(item, include)
else:
if _match_patterns_helper(item, exclude):
return False
else:
return _match_patterns_helper(item, include)
def filter_patterns(
items: List[str],
include: Union[str, List[str], Callable, List[Callable], None] = None,
exclude: Union[str, List[str], Callable, List[Callable], None] = None,
*,
precedence: Literal["include", "exclude"] = "exclude",
ordering: Literal["original", "include"] = "original",
):
"""
Args:
ordering: affects the order of items in the returned list. Does not affect the
content of the returned list.
- "original": keep the ordering of items in the input list
- "include": order items by the order of include patterns
"""
assert ordering in ["original", "include"]
if include is None or isinstance(include, str) or ordering == "original":
return [
x
for x in items
if match_patterns(x, include=include, exclude=exclude, precedence=precedence)
]
else:
items = items.copy()
ret = []
for inc in include:
for i, item in enumerate(items):
if item is None:
continue
if match_patterns(item, include=inc, exclude=exclude, precedence=precedence):
ret.append(item)
items[i] = None
return ret
def getitem_nested(cfg, key: str):
"""
Recursively get key, if key has '.' in it
"""
keys = key.split(".")
for k in keys:
assert k in cfg, f'{k} in key "{key}" does not exist in config'
cfg = cfg[k]
return cfg
def setitem_nested(cfg, key: str, value):
"""
Recursively get key, if key has '.' in it
"""
keys = key.split(".")
for k in keys[:-1]:
assert k in cfg, f'{k} in key "{key}" does not exist in config'
cfg = cfg[k]
cfg[keys[-1]] = value
def getattr_nested(obj, key: str):
"""
Recursively get attribute
"""
keys = key.split(".")
for k in keys:
assert hasattr(obj, k), f'{k} in attribute "{key}" does not exist'
obj = getattr(obj, k)
return obj
def setattr_nested(obj, key: str, value):
"""
Recursively set attribute
"""
keys = key.split(".")
for k in keys[:-1]:
assert hasattr(obj, k), f'{k} in attribute "{key}" does not exist'
obj = getattr(obj, k)
setattr(obj, keys[-1], value)
class PeriodicEvent:
"""
triggers every period
"""
def __init__(self, period: int, initial_value=0):
self._period = period
assert self._period >= 1
self._last_threshold = initial_value
self._last_value = initial_value
self._trigger_counts = 0
def __call__(self, new_value=None, increment=None):
assert bool(new_value is None) != bool(increment is None), (
"you must specify one and only one of new_value or increment, " "but not both"
)
d = self._period
if new_value is None:
new_value = self._last_value + increment
assert new_value >= self._last_value, (
f"value must be monotonically increasing. "
f"Current value {new_value} < last value {self._last_value}"
)
self._last_value = new_value
if new_value - self._last_threshold >= d:
self._last_threshold += (new_value - self._last_threshold) // d * d
self._trigger_counts += 1
return True
else:
return False
@property
def trigger_counts(self):
return self._trigger_counts
@property
def current_value(self):
return self._last_value
class Once:
def __init__(self):
self._triggered = False
def __call__(self):
if not self._triggered:
self._triggered = True
return True
else:
return False
def __bool__(self):
raise RuntimeError("`Once` objects should be used by calling ()")
_GLOBAL_ONCE_SET = set()
_GLOBAL_NTIMES_COUNTER = Counter()
def global_once(name):
"""
Try this to automate the name:
https://gist.github.com/techtonik/2151727#gistcomment-2333747
"""
if name in _GLOBAL_ONCE_SET:
return False
else:
_GLOBAL_ONCE_SET.add(name)
return True
def global_n_times(name, n: int):
"""
Triggers N times
"""
assert n >= 1
if _GLOBAL_NTIMES_COUNTER[name] < n:
_GLOBAL_NTIMES_COUNTER[name] += 1
return True
else:
return False
class Every:
def __init__(self, n: int, on_first: bool = False):
assert n > 0
self._i = 0 if on_first else 1
self._n = n
def __call__(self):
return self._i % self._n == 0
def __bool__(self):
raise RuntimeError("`Every` objects should be used by calling ()")
def encode_base64(obj) -> str:
return codecs.encode(pickle.dumps(obj), "base64").decode()
def decode_base64(s: str):
return pickle.loads(codecs.decode(s.encode(), "base64"))
def safe_hash(input_tuple):
# keep 128 bits of the hash
tuple_string = repr(input_tuple).encode("utf-8")
sha256 = hashlib.sha256()
sha256.update(tuple_string)
seed = int(sha256.hexdigest(), 16)
return seed & 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF
|