if not strict:
code = re.sub(r'new Date\((".+")\)', r'\g<1>', code)
code = re.sub(r'new \w+\((.*?)\)', lambda m: json.dumps(m.group(0)), code)
+ code = re.sub(r'parseInt\([^\d]+(\d+)[^\d]+\)', r'\1', code)
+ code = re.sub(r'\(function\([^)]*\)\s*\{[^}]*\}\s*\)\s*\(\s*(["\'][^)]*["\'])\s*\)', r'\1', code)
return re.sub(rf'''(?sx)
{STRING_RE}|
Each of the provided `paths` is tested and the first producing a valid result will be returned.
The next path will also be tested if the path branched but no results could be found.
Supported values for traversal are `Mapping`, `Sequence` and `re.Match`.
- A value of None is treated as the absence of a value.
+ Unhelpful values (`{}`, `None`) are treated as the absence of a value and discarded.
The paths will be wrapped in `variadic`, so that `'key'` is conveniently the same as `('key', )`.
The keys in the path can be one of:
- `None`: Return the current object.
+ - `set`: Requires the only item in the set to be a type or function,
+ like `{type}`/`{func}`. If a `type`, returns only values
+ of this type. If a function, returns `func(obj)`.
- `str`/`int`: Return `obj[key]`. For `re.Match`, return `obj.group(key)`.
- `slice`: Branch out and return all values in `obj[key]`.
- `Ellipsis`: Branch out and return a list of all values.
- `function`: Branch out and return values filtered by the function.
Read as: `[value for key, value in obj if function(key, value)]`.
For `Sequence`s, `key` is the index of the value.
+ For `re.Match`es, `key` is the group number (0 = full match)
+ as well as additionally any group names, if given.
- `dict` Transform the current object and return a matching dict.
Read as: `{key: traverse_obj(obj, path) for key, path in dct.items()}`.
@params paths Paths which to traverse by.
@param default Value to return if the paths do not match.
+ If the last key in the path is a `dict`, it will apply to each value inside
+ the dict instead, depth first. Try to avoid if using nested `dict` keys.
@param expected_type If a `type`, only accept final values of this type.
If any other callable, try to call the function on each result.
+ If the last key in the path is a `dict`, it will apply to each value inside
+ the dict instead, recursively. This does respect branching paths.
@param get_all If `False`, return the first matching result, otherwise all matching ones.
@param casesense If `False`, consider string dictionary keys as case insensitive.
@param traverse_string Whether to traverse into objects as strings.
If `True`, any non-compatible object will first be
converted into a string and then traversed into.
+ The return value of that path will be a string instead,
+ not respecting any further branching.
@returns The result of the object traversal.
If successful, `get_all=True`, and the path branches at least once,
then a list of results is returned instead.
- A list is always returned if the last path branches and no `default` is given.
+ If no `default` is given and the last path branches, a `list` of results
+ is always returned. If a path ends on a `dict` that result will always be a `dict`.
"""
is_sequence = lambda x: isinstance(x, collections.abc.Sequence) and not isinstance(x, (str, bytes))
casefold = lambda k: k.casefold() if isinstance(k, str) else k
else:
type_test = lambda val: try_call(expected_type or IDENTITY, args=(val,))
- def apply_key(key, obj):
- if obj is None:
- return
+ def apply_key(key, obj, is_last):
+ branching = False
+ result = None
+
+ if obj is None and traverse_string:
+ pass
elif key is None:
- yield obj
+ result = obj
+
+ elif isinstance(key, set):
+ assert len(key) == 1, 'Set should only be used to wrap a single item'
+ item = next(iter(key))
+ if isinstance(item, type):
+ if isinstance(obj, item):
+ result = obj
+ else:
+ result = try_call(item, args=(obj,))
elif isinstance(key, (list, tuple)):
- for branch in key:
- _, result = apply_path(obj, branch)
- yield from result
+ branching = True
+ result = itertools.chain.from_iterable(
+ apply_path(obj, branch, is_last)[0] for branch in key)
elif key is ...:
+ branching = True
if isinstance(obj, collections.abc.Mapping):
- yield from obj.values()
+ result = obj.values()
elif is_sequence(obj):
- yield from obj
+ result = obj
elif isinstance(obj, re.Match):
- yield from obj.groups()
+ result = obj.groups()
elif traverse_string:
- yield from str(obj)
+ branching = False
+ result = str(obj)
+ else:
+ result = ()
elif callable(key):
- if is_sequence(obj):
- iter_obj = enumerate(obj)
- elif isinstance(obj, collections.abc.Mapping):
+ branching = True
+ if isinstance(obj, collections.abc.Mapping):
iter_obj = obj.items()
+ elif is_sequence(obj):
+ iter_obj = enumerate(obj)
elif isinstance(obj, re.Match):
- iter_obj = enumerate((obj.group(), *obj.groups()))
+ iter_obj = itertools.chain(
+ enumerate((obj.group(), *obj.groups())),
+ obj.groupdict().items())
elif traverse_string:
+ branching = False
iter_obj = enumerate(str(obj))
else:
- return
- yield from (v for k, v in iter_obj if try_call(key, args=(k, v)))
+ iter_obj = ()
+
+ result = (v for k, v in iter_obj if try_call(key, args=(k, v)))
+ if not branching: # string traversal
+ result = ''.join(result)
elif isinstance(key, dict):
- iter_obj = ((k, _traverse_obj(obj, v)) for k, v in key.items())
- yield {k: v if v is not None else default for k, v in iter_obj
- if v is not None or default is not NO_DEFAULT}
+ iter_obj = ((k, _traverse_obj(obj, v, False, is_last)) for k, v in key.items())
+ result = {
+ k: v if v is not None else default for k, v in iter_obj
+ if v is not None or default is not NO_DEFAULT
+ } or None
elif isinstance(obj, collections.abc.Mapping):
- yield (obj.get(key) if casesense or (key in obj)
- else next((v for k, v in obj.items() if casefold(k) == key), None))
+ result = (obj.get(key) if casesense or (key in obj) else
+ next((v for k, v in obj.items() if casefold(k) == key), None))
elif isinstance(obj, re.Match):
if isinstance(key, int) or casesense:
with contextlib.suppress(IndexError):
- yield obj.group(key)
- return
+ result = obj.group(key)
- if not isinstance(key, str):
- return
+ elif isinstance(key, str):
+ result = next((v for k, v in obj.groupdict().items() if casefold(k) == key), None)
- yield next((v for k, v in obj.groupdict().items() if casefold(k) == key), None)
+ elif isinstance(key, (int, slice)):
+ if is_sequence(obj):
+ branching = isinstance(key, slice)
+ with contextlib.suppress(IndexError):
+ result = obj[key]
+ elif traverse_string:
+ with contextlib.suppress(IndexError):
+ result = str(obj)[key]
- else:
- if is_user_input:
- key = (int_or_none(key) if ':' not in key
- else slice(*map(int_or_none, key.split(':'))))
+ return branching, result if branching else (result,)
- if not isinstance(key, (int, slice)):
- return
+ def lazy_last(iterable):
+ iterator = iter(iterable)
+ prev = next(iterator, NO_DEFAULT)
+ if prev is NO_DEFAULT:
+ return
- if not is_sequence(obj):
- if not traverse_string:
- return
- obj = str(obj)
+ for item in iterator:
+ yield False, prev
+ prev = item
- with contextlib.suppress(IndexError):
- yield obj[key]
+ yield True, prev
- def apply_path(start_obj, path):
+ def apply_path(start_obj, path, test_type):
objs = (start_obj,)
has_branched = False
- for key in variadic(path):
- if is_user_input and key == ':':
- key = ...
+ key = None
+ for last, key in lazy_last(variadic(path, (str, bytes, dict, set))):
+ if is_user_input and isinstance(key, str):
+ if key == ':':
+ key = ...
+ elif ':' in key:
+ key = slice(*map(int_or_none, key.split(':')))
+ elif int_or_none(key) is not None:
+ key = int(key)
if not casesense and isinstance(key, str):
key = key.casefold()
- if key is ... or isinstance(key, (list, tuple)) or callable(key):
- has_branched = True
+ if __debug__ and callable(key):
+ # Verify function signature
+ inspect.signature(key).bind(None, None)
+
+ new_objs = []
+ for obj in objs:
+ branching, results = apply_key(key, obj, last)
+ has_branched |= branching
+ new_objs.append(results)
- key_func = functools.partial(apply_key, key)
- objs = itertools.chain.from_iterable(map(key_func, objs))
+ objs = itertools.chain.from_iterable(new_objs)
- return has_branched, objs
+ if test_type and not isinstance(key, (dict, list, tuple)):
+ objs = map(type_test, objs)
- def _traverse_obj(obj, path, use_list=True):
- has_branched, results = apply_path(obj, path)
- results = LazyList(x for x in map(type_test, results) if x is not None)
+ return objs, has_branched, isinstance(key, dict)
+ def _traverse_obj(obj, path, allow_empty, test_type):
+ results, has_branched, is_dict = apply_path(obj, path, test_type)
+ results = LazyList(item for item in results if item not in (None, {}))
if get_all and has_branched:
- return results.exhaust() if results or use_list else None
+ if results:
+ return results.exhaust()
+ if allow_empty:
+ return [] if default is NO_DEFAULT else default
+ return None
- return results[0] if results else None
+ return results[0] if results else {} if allow_empty and is_dict else None
for index, path in enumerate(paths, 1):
- use_list = default is NO_DEFAULT and index == len(paths)
- result = _traverse_obj(obj, path, use_list)
+ result = _traverse_obj(obj, path, index == len(paths), True)
if result is not None:
return result
def time_seconds(**kwargs):
- t = datetime.datetime.now(datetime.timezone(datetime.timedelta(**kwargs)))
- return t.timestamp()
+ """
+ Returns TZ-aware time in seconds since the epoch (1970-01-01T00:00:00Z)
+ """
+ return time.time() + datetime.timedelta(**kwargs).total_seconds()
# create a JSON Web Signature (jws) with HS256 algorithm
projects / yt-dlp.git / blobdiff