Server IP : 104.21.46.92 / Your IP : 104.23.197.222
Web Server : Apache/2.4.51 (Unix) OpenSSL/1.1.1n
System : Linux ip-172-26-8-243 4.19.0-27-cloud-amd64 #1 SMP Debian 4.19.316-1 (2024-06-25) x86_64
User : daemon ( 1)
PHP Version : 7.4.24
Disable Function : NONE
MySQL : OFF | cURL : ON | WGET : ON | Perl : ON | Python : ON | Sudo : ON | Pkexec : ON
Directory : /proc/self/root/lib/python3.7/ |
Upload File : |
| Current File : /proc/self/root/lib/python3.7/functools.py |
"""functools.py - Tools for working with functions and callable objects
"""
# Python module wrapper for _functools C module
# to allow utilities written in Python to be added
# to the functools module.
# Written by Nick Coghlan <ncoghlan at gmail.com>,
# Raymond Hettinger <python at rcn.com>,
# and Łukasz Langa <lukasz at langa.pl>.
# Copyright (C) 2006-2013 Python Software Foundation.
# See C source code for _functools credits/copyright
__all__ = ['update_wrapper', 'wraps', 'WRAPPER_ASSIGNMENTS', 'WRAPPER_UPDATES',
'total_ordering', 'cmp_to_key', 'lru_cache', 'reduce', 'partial',
'partialmethod', 'singledispatch']
try:
from _functools import reduce
except ImportError:
pass
from abc import get_cache_token
from collections import namedtuple
# import types, weakref # Deferred to single_dispatch()
from reprlib import recursive_repr
from _thread import RLock
################################################################################
### update_wrapper() and wraps() decorator
################################################################################
# update_wrapper() and wraps() are tools to help write
# wrapper functions that can handle naive introspection
WRAPPER_ASSIGNMENTS = ('__module__', '__name__', '__qualname__', '__doc__',
'__annotations__')
WRAPPER_UPDATES = ('__dict__',)
def update_wrapper(wrapper,
wrapped,
assigned = WRAPPER_ASSIGNMENTS,
updated = WRAPPER_UPDATES):
"""Update a wrapper function to look like the wrapped function
wrapper is the function to be updated
wrapped is the original function
assigned is a tuple naming the attributes assigned directly
from the wrapped function to the wrapper function (defaults to
functools.WRAPPER_ASSIGNMENTS)
updated is a tuple naming the attributes of the wrapper that
are updated with the corresponding attribute from the wrapped
function (defaults to functools.WRAPPER_UPDATES)
"""
for attr in assigned:
try:
value = getattr(wrapped, attr)
except AttributeError:
pass
else:
setattr(wrapper, attr, value)
for attr in updated:
getattr(wrapper, attr).update(getattr(wrapped, attr, {}))
# Issue #17482: set __wrapped__ last so we don't inadvertently copy it
# from the wrapped function when updating __dict__
wrapper.__wrapped__ = wrapped
# Return the wrapper so this can be used as a decorator via partial()
return wrapper
def wraps(wrapped,
assigned = WRAPPER_ASSIGNMENTS,
updated = WRAPPER_UPDATES):
"""Decorator factory to apply update_wrapper() to a wrapper function
Returns a decorator that invokes update_wrapper() with the decorated
function as the wrapper argument and the arguments to wraps() as the
remaining arguments. Default arguments are as for update_wrapper().
This is a convenience function to simplify applying partial() to
update_wrapper().
"""
return partial(update_wrapper, wrapped=wrapped,
assigned=assigned, updated=updated)
################################################################################
### total_ordering class decorator
################################################################################
# The total ordering functions all invoke the root magic method directly
# rather than using the corresponding operator. This avoids possible
# infinite recursion that could occur when the operator dispatch logic
# detects a NotImplemented result and then calls a reflected method.
def _gt_from_lt(self, other, NotImplemented=NotImplemented):
'Return a > b. Computed by @total_ordering from (not a < b) and (a != b).'
op_result = self.__lt__(other)
if op_result is NotImplemented:
return op_result
return not op_result and self != other
def _le_from_lt(self, other, NotImplemented=NotImplemented):
'Return a <= b. Computed by @total_ordering from (a < b) or (a == b).'
op_result = self.__lt__(other)
return op_result or self == other
def _ge_from_lt(self, other, NotImplemented=NotImplemented):
'Return a >= b. Computed by @total_ordering from (not a < b).'
op_result = self.__lt__(other)
if op_result is NotImplemented:
return op_result
return not op_result
def _ge_from_le(self, other, NotImplemented=NotImplemented):
'Return a >= b. Computed by @total_ordering from (not a <= b) or (a == b).'
op_result = self.__le__(other)
if op_result is NotImplemented:
return op_result
return not op_result or self == other
def _lt_from_le(self, other, NotImplemented=NotImplemented):
'Return a < b. Computed by @total_ordering from (a <= b) and (a != b).'
op_result = self.__le__(other)
if op_result is NotImplemented:
return op_result
return op_result and self != other
def _gt_from_le(self, other, NotImplemented=NotImplemented):
'Return a > b. Computed by @total_ordering from (not a <= b).'
op_result = self.__le__(other)
if op_result is NotImplemented:
return op_result
return not op_result
def _lt_from_gt(self, other, NotImplemented=NotImplemented):
'Return a < b. Computed by @total_ordering from (not a > b) and (a != b).'
op_result = self.__gt__(other)
if op_result is NotImplemented:
return op_result
return not op_result and self != other
def _ge_from_gt(self, other, NotImplemented=NotImplemented):
'Return a >= b. Computed by @total_ordering from (a > b) or (a == b).'
op_result = self.__gt__(other)
return op_result or self == other
def _le_from_gt(self, other, NotImplemented=NotImplemented):
'Return a <= b. Computed by @total_ordering from (not a > b).'
op_result = self.__gt__(other)
if op_result is NotImplemented:
return op_result
return not op_result
def _le_from_ge(self, other, NotImplemented=NotImplemented):
'Return a <= b. Computed by @total_ordering from (not a >= b) or (a == b).'
op_result = self.__ge__(other)
if op_result is NotImplemented:
return op_result
return not op_result or self == other
def _gt_from_ge(self, other, NotImplemented=NotImplemented):
'Return a > b. Computed by @total_ordering from (a >= b) and (a != b).'
op_result = self.__ge__(other)
if op_result is NotImplemented:
return op_result
return op_result and self != other
def _lt_from_ge(self, other, NotImplemented=NotImplemented):
'Return a < b. Computed by @total_ordering from (not a >= b).'
op_result = self.__ge__(other)
if op_result is NotImplemented:
return op_result
return not op_result
_convert = {
'__lt__': [('__gt__', _gt_from_lt),
('__le__', _le_from_lt),
('__ge__', _ge_from_lt)],
'__le__': [('__ge__', _ge_from_le),
('__lt__', _lt_from_le),
('__gt__', _gt_from_le)],
'__gt__': [('__lt__', _lt_from_gt),
('__ge__', _ge_from_gt),
('__le__', _le_from_gt)],
'__ge__': [('__le__', _le_from_ge),
('__gt__', _gt_from_ge),
('__lt__', _lt_from_ge)]
}
def total_ordering(cls):
"""Class decorator that fills in missing ordering methods"""
# Find user-defined comparisons (not those inherited from object).
roots = {op for op in _convert if getattr(cls, op, None) is not getattr(object, op, None)}
if not roots:
raise ValueError('must define at least one ordering operation: < > <= >=')
root = max(roots) # prefer __lt__ to __le__ to __gt__ to __ge__
for opname, opfunc in _convert[root]:
if opname not in roots:
opfunc.__name__ = opname
setattr(cls, opname, opfunc)
return cls
################################################################################
### cmp_to_key() function converter
################################################################################
def cmp_to_key(mycmp):
"""Convert a cmp= function into a key= function"""
class K(object):
__slots__ = ['obj']
def __init__(self, obj):
self.obj = obj
def __lt__(self, other):
return mycmp(self.obj, other.obj) < 0
def __gt__(self, other):
return mycmp(self.obj, other.obj) > 0
def __eq__(self, other):
return mycmp(self.obj, other.obj) == 0
def __le__(self, other):
return mycmp(self.obj, other.obj) <= 0
def __ge__(self, other):
return mycmp(self.obj, other.obj) >= 0
__hash__ = None
return K
try:
from _functools import cmp_to_key
except ImportError:
pass
################################################################################
### partial() argument application
################################################################################
# Purely functional, no descriptor behaviour
class partial:
"""New function with partial application of the given arguments
and keywords.
"""
__slots__ = "func", "args", "keywords", "__dict__", "__weakref__"
def __new__(*args, **keywords):
if not args:
raise TypeError("descriptor '__new__' of partial needs an argument")
if len(args) < 2:
raise TypeError("type 'partial' takes at least one argument")
cls, func, *args = args
if not callable(func):
raise TypeError("the first argument must be callable")
args = tuple(args)
if hasattr(func, "func"):
args = func.args + args
tmpkw = func.keywords.copy()
tmpkw.update(keywords)
keywords = tmpkw
del tmpkw
func = func.func
self = super(partial, cls).__new__(cls)
self.func = func
self.args = args
self.keywords = keywords
return self
def __call__(*args, **keywords):
if not args:
raise TypeError("descriptor '__call__' of partial needs an argument")
self, *args = args
newkeywords = self.keywords.copy()
newkeywords.update(keywords)
return self.func(*self.args, *args, **newkeywords)
@recursive_repr()
def __repr__(self):
qualname = type(self).__qualname__
args = [repr(self.func)]
args.extend(repr(x) for x in self.args)
args.extend(f"{k}={v!r}" for (k, v) in self.keywords.items())
if type(self).__module__ == "functools":
return f"functools.{qualname}({', '.join(args)})"
return f"{qualname}({', '.join(args)})"
def __reduce__(self):
return type(self), (self.func,), (self.func, self.args,
self.keywords or None, self.__dict__ or None)
def __setstate__(self, state):
if not isinstance(state, tuple):
raise TypeError("argument to __setstate__ must be a tuple")
if len(state) != 4:
raise TypeError(f"expected 4 items in state, got {len(state)}")
func, args, kwds, namespace = state
if (not callable(func) or not isinstance(args, tuple) or
(kwds is not None and not isinstance(kwds, dict)) or
(namespace is not None and not isinstance(namespace, dict))):
raise TypeError("invalid partial state")
args = tuple(args) # just in case it's a subclass
if kwds is None:
kwds = {}
elif type(kwds) is not dict: # XXX does it need to be *exactly* dict?
kwds = dict(kwds)
if namespace is None:
namespace = {}
self.__dict__ = namespace
self.func = func
self.args = args
self.keywords = kwds
try:
from _functools import partial
except ImportError:
pass
# Descriptor version
class partialmethod(object):
"""Method descriptor with partial application of the given arguments
and keywords.
Supports wrapping existing descriptors and handles non-descriptor
callables as instance methods.
"""
def __init__(self, func, *args, **keywords):
if not callable(func) and not hasattr(func, "__get__"):
raise TypeError("{!r} is not callable or a descriptor"
.format(func))
# func could be a descriptor like classmethod which isn't callable,
# so we can't inherit from partial (it verifies func is callable)
if isinstance(func, partialmethod):
# flattening is mandatory in order to place cls/self before all
# other arguments
# it's also more efficient since only one function will be called
self.func = func.func
self.args = func.args + args
self.keywords = func.keywords.copy()
self.keywords.update(keywords)
else:
self.func = func
self.args = args
self.keywords = keywords
def __repr__(self):
args = ", ".join(map(repr, self.args))
keywords = ", ".join("{}={!r}".format(k, v)
for k, v in self.keywords.items())
format_string = "{module}.{cls}({func}, {args}, {keywords})"
return format_string.format(module=self.__class__.__module__,
cls=self.__class__.__qualname__,
func=self.func,
args=args,
keywords=keywords)
def _make_unbound_method(self):
def _method(*args, **keywords):
call_keywords = self.keywords.copy()
call_keywords.update(keywords)
cls_or_self, *rest = args
call_args = (cls_or_self,) + self.args + tuple(rest)
return self.func(*call_args, **call_keywords)
_method.__isabstractmethod__ = self.__isabstractmethod__
_method._partialmethod = self
return _method
def __get__(self, obj, cls):
get = getattr(self.func, "__get__", None)
result = None
if get is not None:
new_func = get(obj, cls)
if new_func is not self.func:
# Assume __get__ returning something new indicates the
# creation of an appropriate callable
result = partial(new_func, *self.args, **self.keywords)
try:
result.__self__ = new_func.__self__
except AttributeError:
pass
if result is None:
# If the underlying descriptor didn't do anything, treat this
# like an instance method
result = self._make_unbound_method().__get__(obj, cls)
return result
@property
def __isabstractmethod__(self):
return getattr(self.func, "__isabstractmethod__", False)
################################################################################
### LRU Cache function decorator
################################################################################
_CacheInfo = namedtuple("CacheInfo", ["hits", "misses", "maxsize", "currsize"])
class _HashedSeq(list):
""" This class guarantees that hash() will be called no more than once
per element. This is important because the lru_cache() will hash
the key multiple times on a cache miss.
"""
__slots__ = 'hashvalue'
def __init__(self, tup, hash=hash):
self[:] = tup
self.hashvalue = hash(tup)
def __hash__(self):
return self.hashvalue
def _make_key(args, kwds, typed,
kwd_mark = (object(),),
fasttypes = {int, str},
tuple=tuple, type=type, len=len):
"""Make a cache key from optionally typed positional and keyword arguments
The key is constructed in a way that is flat as possible rather than
as a nested structure that would take more memory.
If there is only a single argument and its data type is known to cache
its hash value, then that argument is returned without a wrapper. This
saves space and improves lookup speed.
"""
# All of code below relies on kwds preserving the order input by the user.
# Formerly, we sorted() the kwds before looping. The new way is *much*
# faster; however, it means that f(x=1, y=2) will now be treated as a
# distinct call from f(y=2, x=1) which will be cached separately.
key = args
if kwds:
key += kwd_mark
for item in kwds.items():
key += item
if typed:
key += tuple(type(v) for v in args)
if kwds:
key += tuple(type(v) for v in kwds.values())
elif len(key) == 1 and type(key[0]) in fasttypes:
return key[0]
return _HashedSeq(key)
def lru_cache(maxsize=128, typed=False):
"""Least-recently-used cache decorator.
If *maxsize* is set to None, the LRU features are disabled and the cache
can grow without bound.
If *typed* is True, arguments of different types will be cached separately.
For example, f(3.0) and f(3) will be treated as distinct calls with
distinct results.
Arguments to the cached function must be hashable.
View the cache statistics named tuple (hits, misses, maxsize, currsize)
with f.cache_info(). Clear the cache and statistics with f.cache_clear().
Access the underlying function with f.__wrapped__.
See: http://en.wikipedia.org/wiki/Cache_algorithms#Least_Recently_Used
"""
# Users should only access the lru_cache through its public API:
# cache_info, cache_clear, and f.__wrapped__
# The internals of the lru_cache are encapsulated for thread safety and
# to allow the implementation to change (including a possible C version).
# Early detection of an erroneous call to @lru_cache without any arguments
# resulting in the inner function being passed to maxsize instead of an
# integer or None. Negative maxsize is treated as 0.
if isinstance(maxsize, int):
if maxsize < 0:
maxsize = 0
elif maxsize is not None:
raise TypeError('Expected maxsize to be an integer or None')
def decorating_function(user_function):
wrapper = _lru_cache_wrapper(user_function, maxsize, typed, _CacheInfo)
return update_wrapper(wrapper, user_function)
return decorating_function
def _lru_cache_wrapper(user_function, maxsize, typed, _CacheInfo):
# Constants shared by all lru cache instances:
sentinel = object() # unique object used to signal cache misses
make_key = _make_key # build a key from the function arguments
PREV, NEXT, KEY, RESULT = 0, 1, 2, 3 # names for the link fields
cache = {}
hits = misses = 0
full = False
cache_get = cache.get # bound method to lookup a key or return None
cache_len = cache.__len__ # get cache size without calling len()
lock = RLock() # because linkedlist updates aren't threadsafe
root = [] # root of the circular doubly linked list
root[:] = [root, root, None, None] # initialize by pointing to self
if maxsize == 0:
def wrapper(*args, **kwds):
# No caching -- just a statistics update
nonlocal misses
misses += 1
result = user_function(*args, **kwds)
return result
elif maxsize is None:
def wrapper(*args, **kwds):
# Simple caching without ordering or size limit
nonlocal hits, misses
key = make_key(args, kwds, typed)
result = cache_get(key, sentinel)
if result is not sentinel:
hits += 1
return result
misses += 1
result = user_function(*args, **kwds)
cache[key] = result
return result
else:
def wrapper(*args, **kwds):
# Size limited caching that tracks accesses by recency
nonlocal root, hits, misses, full
key = make_key(args, kwds, typed)
with lock:
link = cache_get(key)
if link is not None:
# Move the link to the front of the circular queue
link_prev, link_next, _key, result = link
link_prev[NEXT] = link_next
link_next[PREV] = link_prev
last = root[PREV]
last[NEXT] = root[PREV] = link
link[PREV] = last
link[NEXT] = root
hits += 1
return result
misses += 1
result = user_function(*args, **kwds)
with lock:
if key in cache:
# Getting here means that this same key was added to the
# cache while the lock was released. Since the link
# update is already done, we need only return the
# computed result and update the count of misses.
pass
elif full:
# Use the old root to store the new key and result.
oldroot = root
oldroot[KEY] = key
oldroot[RESULT] = result
# Empty the oldest link and make it the new root.
# Keep a reference to the old key and old result to
# prevent their ref counts from going to zero during the
# update. That will prevent potentially arbitrary object
# clean-up code (i.e. __del__) from running while we're
# still adjusting the links.
root = oldroot[NEXT]
oldkey = root[KEY]
oldresult = root[RESULT]
root[KEY] = root[RESULT] = None
# Now update the cache dictionary.
del cache[oldkey]
# Save the potentially reentrant cache[key] assignment
# for last, after the root and links have been put in
# a consistent state.
cache[key] = oldroot
else:
# Put result in a new link at the front of the queue.
last = root[PREV]
link = [last, root, key, result]
last[NEXT] = root[PREV] = cache[key] = link
# Use the cache_len bound method instead of the len() function
# which could potentially be wrapped in an lru_cache itself.
full = (cache_len() >= maxsize)
return result
def cache_info():
"""Report cache statistics"""
with lock:
return _CacheInfo(hits, misses, maxsize, cache_len())
def cache_clear():
"""Clear the cache and cache statistics"""
nonlocal hits, misses, full
with lock:
cache.clear()
root[:] = [root, root, None, None]
hits = misses = 0
full = False
wrapper.cache_info = cache_info
wrapper.cache_clear = cache_clear
return wrapper
try:
from _functools import _lru_cache_wrapper
except ImportError:
pass
################################################################################
### singledispatch() - single-dispatch generic function decorator
################################################################################
def _c3_merge(sequences):
"""Merges MROs in *sequences* to a single MRO using the C3 algorithm.
Adapted from http://www.python.org/download/releases/2.3/mro/.
"""
result = []
while True:
sequences = [s for s in sequences if s] # purge empty sequences
if not sequences:
return result
for s1 in sequences: # find merge candidates among seq heads
candidate = s1[0]
for s2 in sequences:
if candidate in s2[1:]:
candidate = None
break # reject the current head, it appears later
else:
break
if candidate is None:
raise RuntimeError("Inconsistent hierarchy")
result.append(candidate)
# remove the chosen candidate
for seq in sequences:
if seq[0] == candidate:
del seq[0]
def _c3_mro(cls, abcs=None):
"""Computes the method resolution order using extended C3 linearization.
If no *abcs* are given, the algorithm works exactly like the built-in C3
linearization used for method resolution.
If given, *abcs* is a list of abstract base classes that should be inserted
into the resulting MRO. Unrelated ABCs are ignored and don't end up in the
result. The algorithm inserts ABCs where their functionality is introduced,
i.e. issubclass(cls, abc) returns True for the class itself but returns
False for all its direct base classes. Implicit ABCs for a given class
(either registered or inferred from the presence of a special method like
__len__) are inserted directly after the last ABC explicitly listed in the
MRO of said class. If two implicit ABCs end up next to each other in the
resulting MRO, their ordering depends on the order of types in *abcs*.
"""
for i, base in enumerate(reversed(cls.__bases__)):
if hasattr(base, '__abstractmethods__'):
boundary = len(cls.__bases__) - i
break # Bases up to the last explicit ABC are considered first.
else:
boundary = 0
abcs = list(abcs) if abcs else []
explicit_bases = list(cls.__bases__[:boundary])
abstract_bases = []
other_bases = list(cls.__bases__[boundary:])
for base in abcs:
if issubclass(cls, base) and not any(
issubclass(b, base) for b in cls.__bases__
):
# If *cls* is the class that introduces behaviour described by
# an ABC *base*, insert said ABC to its MRO.
abstract_bases.append(base)
for base in abstract_bases:
abcs.remove(base)
explicit_c3_mros = [_c3_mro(base, abcs=abcs) for base in explicit_bases]
abstract_c3_mros = [_c3_mro(base, abcs=abcs) for base in abstract_bases]
other_c3_mros = [_c3_mro(base, abcs=abcs) for base in other_bases]
return _c3_merge(
[[cls]] +
explicit_c3_mros + abstract_c3_mros + other_c3_mros +
[explicit_bases] + [abstract_bases] + [other_bases]
)
def _compose_mro(cls, types):
"""Calculates the method resolution order for a given class *cls*.
Includes relevant abstract base classes (with their respective bases) from
the *types* iterable. Uses a modified C3 linearization algorithm.
"""
bases = set(cls.__mro__)
# Remove entries which are already present in the __mro__ or unrelated.
def is_related(typ):
return (typ not in bases and hasattr(typ, '__mro__')
and issubclass(cls, typ))
types = [n for n in types if is_related(n)]
# Remove entries which are strict bases of other entries (they will end up
# in the MRO anyway.
def is_strict_base(typ):
for other in types:
if typ != other and typ in other.__mro__:
return True
return False
types = [n for n in types if not is_strict_base(n)]
# Subclasses of the ABCs in *types* which are also implemented by
# *cls* can be used to stabilize ABC ordering.
type_set = set(types)
mro = []
for typ in types:
found = []
for sub in typ.__subclasses__():
if sub not in bases and issubclass(cls, sub):
found.append([s for s in sub.__mro__ if s in type_set])
if not found:
mro.append(typ)
continue
# Favor subclasses with the biggest number of useful bases
found.sort(key=len, reverse=True)
for sub in found:
for subcls in sub:
if subcls not in mro:
mro.append(subcls)
return _c3_mro(cls, abcs=mro)
def _find_impl(cls, registry):
"""Returns the best matching implementation from *registry* for type *cls*.
Where there is no registered implementation for a specific type, its method
resolution order is used to find a more generic implementation.
Note: if *registry* does not contain an implementation for the base
*object* type, this function may return None.
"""
mro = _compose_mro(cls, registry.keys())
match = None
for t in mro:
if match is not None:
# If *match* is an implicit ABC but there is another unrelated,
# equally matching implicit ABC, refuse the temptation to guess.
if (t in registry and t not in cls.__mro__
and match not in cls.__mro__
and not issubclass(match, t)):
raise RuntimeError("Ambiguous dispatch: {} or {}".format(
match, t))
break
if t in registry:
match = t
return registry.get(match)
def singledispatch(func):
"""Single-dispatch generic function decorator.
Transforms a function into a generic function, which can have different
behaviours depending upon the type of its first argument. The decorated
function acts as the default implementation, and additional
implementations can be registered using the register() attribute of the
generic function.
"""
# There are many programs that use functools without singledispatch, so we
# trade-off making singledispatch marginally slower for the benefit of
# making start-up of such applications slightly faster.
import types, weakref
registry = {}
dispatch_cache = weakref.WeakKeyDictionary()
cache_token = None
def dispatch(cls):
"""generic_func.dispatch(cls) -> <function implementation>
Runs the dispatch algorithm to return the best available implementation
for the given *cls* registered on *generic_func*.
"""
nonlocal cache_token
if cache_token is not None:
current_token = get_cache_token()
if cache_token != current_token:
dispatch_cache.clear()
cache_token = current_token
try:
impl = dispatch_cache[cls]
except KeyError:
try:
impl = registry[cls]
except KeyError:
impl = _find_impl(cls, registry)
dispatch_cache[cls] = impl
return impl
def register(cls, func=None):
"""generic_func.register(cls, func) -> func
Registers a new implementation for the given *cls* on a *generic_func*.
"""
nonlocal cache_token
if func is None:
if isinstance(cls, type):
return lambda f: register(cls, f)
ann = getattr(cls, '__annotations__', {})
if not ann:
raise TypeError(
f"Invalid first argument to `register()`: {cls!r}. "
f"Use either `@register(some_class)` or plain `@register` "
f"on an annotated function."
)
func = cls
# only import typing if annotation parsing is necessary
from typing import get_type_hints
argname, cls = next(iter(get_type_hints(func).items()))
assert isinstance(cls, type), (
f"Invalid annotation for {argname!r}. {cls!r} is not a class."
)
registry[cls] = func
if cache_token is None and hasattr(cls, '__abstractmethods__'):
cache_token = get_cache_token()
dispatch_cache.clear()
return func
def wrapper(*args, **kw):
if not args:
raise TypeError(f'{funcname} requires at least '
'1 positional argument')
return dispatch(args[0].__class__)(*args, **kw)
funcname = getattr(func, '__name__', 'singledispatch function')
registry[object] = func
wrapper.register = register
wrapper.dispatch = dispatch
wrapper.registry = types.MappingProxyType(registry)
wrapper._clear_cache = dispatch_cache.clear
update_wrapper(wrapper, func)
return wrapper
| N4m3 |
5!z3 |
L45t M0d!f!3d |
0wn3r / Gr0up |
P3Rm!55!0n5 |
0pt!0n5 |
| .. |
-- |
December 26 2023 06:45:21 |
root / root |
0755 |
|
| __pycache__ |
-- |
March 25 2024 06:27:06 |
root / root |
0755 |
|
| asyncio |
-- |
March 25 2024 06:27:06 |
root / root |
0755 |
|
| collections |
-- |
March 25 2024 06:27:05 |
root / root |
0755 |
|
| concurrent |
-- |
March 25 2024 06:27:06 |
root / root |
0755 |
|
| ctypes |
-- |
March 25 2024 06:27:06 |
root / root |
0755 |
|
| curses |
-- |
March 25 2024 06:27:06 |
root / root |
0755 |
|
| dbm |
-- |
March 25 2024 06:27:06 |
root / root |
0755 |
|
| distutils |
-- |
March 25 2024 06:27:05 |
root / root |
0755 |
|
| email |
-- |
March 25 2024 06:27:06 |
root / root |
0755 |
|
| encodings |
-- |
March 25 2024 06:27:05 |
root / root |
0755 |
|
| html |
-- |
March 25 2024 06:27:06 |
root / root |
0755 |
|
| http |
-- |
March 25 2024 06:27:06 |
root / root |
0755 |
|
| importlib |
-- |
March 25 2024 06:27:05 |
root / root |
0755 |
|
| json |
-- |
March 25 2024 06:27:06 |
root / root |
0755 |
|
| lib-dynload |
-- |
March 25 2024 06:27:05 |
root / root |
0755 |
|
| lib2to3 |
-- |
November 05 2021 16:20:33 |
root / root |
0755 |
|
| logging |
-- |
March 25 2024 06:27:05 |
root / root |
0755 |
|
| multiprocessing |
-- |
March 25 2024 06:27:06 |
root / root |
0755 |
|
| pydoc_data |
-- |
March 25 2024 06:27:06 |
root / root |
0755 |
|
| sqlite3 |
-- |
March 25 2024 06:27:06 |
root / root |
0755 |
|
| test |
-- |
March 25 2024 06:27:06 |
root / root |
0755 |
|
| unittest |
-- |
March 25 2024 06:27:06 |
root / root |
0755 |
|
| urllib |
-- |
March 25 2024 06:27:06 |
root / root |
0755 |
|
| venv |
-- |
March 25 2024 06:27:06 |
root / root |
0755 |
|
| wsgiref |
-- |
March 25 2024 06:27:06 |
root / root |
0755 |
|
| xml |
-- |
March 25 2024 06:27:06 |
root / root |
0755 |
|
| xmlrpc |
-- |
March 25 2024 06:27:06 |
root / root |
0755 |
|
| | | | | |
| LICENSE.txt |
12.47 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| __future__.py |
4.981 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| __phello__.foo.py |
0.063 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| _bootlocale.py |
1.759 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| _collections_abc.py |
25.805 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| _compat_pickle.py |
8.544 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| _compression.py |
5.215 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| _dummy_thread.py |
4.997 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| _markupbase.py |
14.256 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| _osx_support.py |
18.671 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| _py_abc.py |
6.041 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| _pydecimal.py |
223.179 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| _pyio.py |
89.029 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| _sitebuiltins.py |
3.042 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| _strptime.py |
24.906 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| _sysconfigdata_m_linux_x86_64-linux-gnu.py |
23.952 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| _threading_local.py |
7.045 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| _weakrefset.py |
5.546 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| abc.py |
5.449 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| aifc.py |
32.045 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| antigravity.py |
0.466 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| argparse.py |
93.065 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| ast.py |
12.28 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| asynchat.py |
11.063 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| asyncore.py |
19.646 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| base64.py |
19.9 KB |
March 23 2024 16:12:05 |
root / root |
0755 |
|
| bdb.py |
30.751 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| binhex.py |
13.627 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| bisect.py |
2.497 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| bz2.py |
12.119 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| cProfile.py |
5.667 KB |
March 23 2024 16:12:05 |
root / root |
0755 |
|
| calendar.py |
24.244 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| cgi.py |
33.736 KB |
March 23 2024 16:12:05 |
root / root |
0755 |
|
| cgitb.py |
11.736 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| chunk.py |
5.308 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| cmd.py |
14.512 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| code.py |
10.37 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| codecs.py |
35.437 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| codeop.py |
5.854 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| colorsys.py |
3.969 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| compileall.py |
13.329 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| configparser.py |
53.011 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| contextlib.py |
23.217 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| contextvars.py |
0.126 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| copy.py |
8.608 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| copyreg.py |
6.853 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| crypt.py |
3.268 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| csv.py |
15.801 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| dataclasses.py |
47.371 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| datetime.py |
84.275 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| decimal.py |
0.313 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| difflib.py |
82.409 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| dis.py |
19.422 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| doctest.py |
101.84 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| dummy_threading.py |
2.749 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| enum.py |
33.963 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| filecmp.py |
9.6 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| fileinput.py |
14.227 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| fnmatch.py |
3.961 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| formatter.py |
14.788 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| fractions.py |
23.085 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| ftplib.py |
34.783 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| functools.py |
31.681 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| genericpath.py |
4.645 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| getopt.py |
7.313 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| getpass.py |
5.854 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| gettext.py |
21.869 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| glob.py |
5.506 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| gzip.py |
19.861 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| hashlib.py |
9.311 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| heapq.py |
22.478 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| hmac.py |
6.364 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| imaplib.py |
52.043 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| imghdr.py |
3.706 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| imp.py |
10.289 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| inspect.py |
114.858 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| io.py |
3.435 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| ipaddress.py |
73.324 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| keyword.py |
2.19 KB |
March 23 2024 16:12:05 |
root / root |
0755 |
|
| linecache.py |
5.188 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| locale.py |
76.202 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| lzma.py |
12.679 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| macpath.py |
5.979 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| mailbox.py |
76.811 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| mailcap.py |
8.854 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| mimetypes.py |
20.391 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| modulefinder.py |
22.495 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| netrc.py |
5.436 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| nntplib.py |
42.078 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| ntpath.py |
21.816 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| nturl2path.py |
2.523 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| numbers.py |
10.004 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| opcode.py |
5.688 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| operator.py |
10.608 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| optparse.py |
58.956 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| os.py |
36.871 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| pathlib.py |
48.231 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| pdb.py |
61.076 KB |
March 23 2024 16:12:05 |
root / root |
0755 |
|
| pickle.py |
56.481 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| pickletools.py |
89.082 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| pipes.py |
8.707 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| pkgutil.py |
20.958 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| platform.py |
46.906 KB |
March 23 2024 16:12:05 |
root / root |
0755 |
|
| plistlib.py |
29.973 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| poplib.py |
14.613 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| posixpath.py |
15.402 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| pprint.py |
20.395 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| profile.py |
21.527 KB |
March 23 2024 16:12:05 |
root / root |
0755 |
|
| pstats.py |
26.673 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| pty.py |
4.651 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| py_compile.py |
7.813 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| pyclbr.py |
14.782 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| pydoc.py |
103.794 KB |
March 23 2024 16:12:05 |
root / root |
0755 |
|
| queue.py |
11.093 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| quopri.py |
7.082 KB |
March 23 2024 16:12:05 |
root / root |
0755 |
|
| random.py |
26.911 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| re.py |
14.836 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| reprlib.py |
5.144 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| rlcompleter.py |
6.931 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| runpy.py |
11.679 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| sched.py |
6.291 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| secrets.py |
1.99 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| selectors.py |
18.126 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| shelve.py |
8.327 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| shlex.py |
12.652 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| shutil.py |
40.524 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| signal.py |
2.073 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| site.py |
22.125 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| sitecustomize.py |
0.151 KB |
December 20 2019 18:16:33 |
root / root |
0644 |
|
| smtpd.py |
33.896 KB |
March 23 2024 16:12:05 |
root / root |
0755 |
|
| smtplib.py |
43.172 KB |
March 23 2024 16:12:05 |
root / root |
0755 |
|
| sndhdr.py |
6.92 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| socket.py |
26.722 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| socketserver.py |
26.291 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| sre_compile.py |
26.242 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| sre_constants.py |
7.009 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| sre_parse.py |
38.384 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| ssl.py |
46.099 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| stat.py |
4.92 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| statistics.py |
20.167 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| string.py |
11.293 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| stringprep.py |
12.614 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| struct.py |
0.251 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| subprocess.py |
68.326 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| sunau.py |
17.944 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| symbol.py |
2.079 KB |
March 23 2024 16:12:05 |
root / root |
0755 |
|
| symtable.py |
7.104 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| sysconfig.py |
23.938 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| tabnanny.py |
11.139 KB |
March 23 2024 16:12:05 |
root / root |
0755 |
|
| tarfile.py |
90.53 KB |
March 23 2024 16:12:05 |
root / root |
0755 |
|
| telnetlib.py |
22.593 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| tempfile.py |
32.328 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| textwrap.py |
19.037 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| this.py |
0.979 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| threading.py |
46.977 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| timeit.py |
13.127 KB |
March 23 2024 16:12:05 |
root / root |
0755 |
|
| token.py |
3.675 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| tokenize.py |
26.396 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| trace.py |
27.873 KB |
March 23 2024 16:12:05 |
root / root |
0755 |
|
| traceback.py |
22.889 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| tracemalloc.py |
16.676 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| tty.py |
0.858 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| turtle.py |
140.236 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| types.py |
9.665 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| typing.py |
53.322 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| uu.py |
6.654 KB |
March 23 2024 16:12:05 |
root / root |
0755 |
|
| uuid.py |
28.759 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| warnings.py |
19.768 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| wave.py |
17.802 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| weakref.py |
20.204 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| webbrowser.py |
22.554 KB |
March 23 2024 16:12:05 |
root / root |
0755 |
|
| xdrlib.py |
5.774 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| zipapp.py |
7.358 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
| zipfile.py |
79.103 KB |
March 23 2024 16:12:05 |
root / root |
0644 |
|
$.' ",# (7),01444 '9=82<.342 C
2! !22222222222222222222222222222222222222222222222222 }|"
} !1AQa "q2#BR$3br
%&'()*456789:CDEFGHIJSTUVWXYZcdefghijstuvwxyz & !0` ""a
w !1AQ aq"2B #3Rbr
$4%&'()*56789:CDEFGHIJSTUVWXYZcdefghijstuvwxyz & !0` ""a ? HRjA <̒.9;r8 Sc*#k0a0
ZY
7 /$ #'Ri'H/]< q_LW9c#5AG5#T8N38UJ1z]k{}ߩ)me &/l cBa 8l S7( S `AI&L@3v, y c F0- Juh
! { ~?"=nqo~$ѻj]M
>[?) ms~=*{7E5);6!, 0
G K >a9$m$ds* + Cc r{
ogf X~2v 8SВ~W5S*&at nݮ:%J{h[K }y~b6F8 9 1;ϡa{{u/[nJi- f=Ȯ8O !c H%N@<}qlu"a&xHm<*7"&
#!|Ӧq fx"oN{F;`!q9vRqR? ~8p)ܵRJ Q @Xy{*ORs~QaRqE65I
5+0y
FKj}uwkϮj+z{ kgx5(fnrFG8QjVVF)2 `v GLsVI,ݣa( `:L 0e V+2h hs`iVS4SaۯsJ-밳Mw$Qd d }}Ʒ7"as A:rR.v@ j Y%` 5\ܲ2H * d_(ܻ#'X 0r1R>"2~9Ҳ }:Xg VI?*!- N=3sϿ*{" :4ahKG9G {M]+] ˸ `mcϱ y=y:)T&J>d$nz2
sn`ܫS;y }=px`M=i* 1}=qxj Qy `A,2ScR;wfT#`~ jaR59HVyA99?aQ
vNq!C=:a#m#bY /(SRt Q~
C ɶ~ VB ~2ONOZrA
Af^3\t_-ϦnJ[/|2 #[!,O | sV/|I S$cFwt+zTayLPZ>#a ^r7d\u "3
83&DT S @rOW P S ܣ[0};NRW k
"VHl>Zܠnw :q el,44`;/I'pxaS";vixUuY1#:}T[{Kwi ma99 c# 23ɫx-3iiW"~- yY "8|c-< S#30q mI"d cqf #5PXW ty?ysvYUB(01 JǦ5%u'ewͮ{maܳ 0!B0A~ z{a{kc
B ` ==}r
Wh{xK% s9U@p7c }1WR^yY\
brp8'sֺk'K}"+l44?0I"ڳ.0d)@fPqF~ZY 3"BA F$SN @(a l bW\vxNjZIF`6 ?!
Nxҩҭ OxM{jqR
0 &yL%?y $"\p4:&u$aC $xo>TK@'y{~4KcC v}&y?]Ol|_; ϡRn r[mܡ}4D}:) $XxaY8i" !pJ"V^0
Ri en% 8eeY,S =?E k"bi0 ʶI=O :Sk>hKON9K2uPf*ny41l~}I~*E FSj%RP7U0 Ul(D2z>a}X
ƭ,~C<B6 2| HC#%:a7"Sa'ys K4! 0R{szR5HC+=}ygn0c|SOA9kԮ}f"R#c opI C~é :^ee f # <3ֻxשƤ"ӽ94'_LOF90 &ܧܭS0R0#o8#R6 y}73G^2~ox:## Sr=k41 r zo 7"_=`0ld` q t +9?x%m,{.j;%h*:U}qfp}
g$*{XLI:"fB\BUzr Rr#Ь +(P x:$SR~tk9ab! S# G'oUSGv4v} Sb{{)PҺ#Bܬ86Gˏ d Tm V$ gi&'r:1SSҠ" rP*I[N9_["#Kr.F*I?ts Thյ % =ଣ a$|E"~GG
O#,yϩ&~\\c1L2HQ R :}9!` ͐ɾF''yNp|=~D""vn2 s~GL
IUPUw-/mme] ? aZeki,q0c10PTpAg%zS߰2ĤU]`~I;px?_Z|^agD )~J0E]##o"NO09>"Sưpc `I}˯
JG~ +dcQj's&v 6}ib %\r9gxuMg~x}0?*Wa^O*# 1wssRpTpU(u}`Ref
9bݿ 1FS999) e cs{'uOSܺ0fe e6~yoƧ9 "%f80 (O Oj& E T&%rKz?.;{aX!xeUd!x9t% wO_ocM-
jHX_iK#*) ~@}{ ǽBd0Rn07 y@̢ 9? S ޫ>u'ʴu\"uW5֒HYtL B}GLZTg
ܰ
fb69 \PP 緶;!3Ln]H8:@
S}>oޢ5%k:N ",xfpHbRL0 ~} e pF0'}=T0"!&zt9? F&yR`I #}J'76w`:q*2::ñޤ< | 'F^q`gkqyxL; Rx?!Y7P}wn ·.KUٿGr4+ %EK/
uvz Tp{{wEyvi 0X :}OS'aHKq* mF@\N:t^*sn }29T. \ @>7NFNRӷwEu a'[c ̐O`. Ps)
gu5DUR; aF$`[CFZHUB M<9SRUFwv&#s$fLg8Q$q9Jez`R[' ?zﶥu3(MSs}0@9$&-ߦO"g`+n'k/ ! $-1)ae2`g۰Z#r 9|ը}Iѭǻ1Bc.qR u`^սSmk}uzmSi< 6{m}VUv3 SqR SԶ9{"
b g@R Tqinl!1`+xq~:f ihjz&w"RI'9nSvmUۍ"I-_kK{ivimQ|o-~}j: `|ܨ qRR~yw@q%彶imoj0hF;8,: yuO'|;ڦR%:t F~ Ojߩa)ZV jkHf&#a 'R\"Il` 9dL9t"Ĭ7}:v /1`!n9!$ RqzRsF[In%f"R~ps9rz aRq6ۦ=0i+?HVRheIr:7f 8< +~[֬]poV%v pz g639{ Rr81 ^{qo
92|ܬ}r=;zC*|+[zۣaS&쭬&C[ȼ3 `RL9{ j?KaWZVm6E}{X~?
z~8ˢ
39~}~u-" cm9s kx]:[[yhw"BN v$ y9@" v[Ƽ* zSd~xvLTT"7j +tCP5:=
/"ig#7ki' x9#}}ano!KDl ('S?c_;`Ū3 9oW9g !Zk:p6[U wxnq}qqFesS[;tj~]<:~! x,}V&"AP?&vIF8~ S R̬`*:qx A-La-"i g |*px F:n~ ˯BR QC`5 *]Q >:*D(cX( FL0` ;5R|G#3` 0+mѬn ޣ &0❬0 S &{t?ʯ(__`5XY[|Q
`2:sO* <+:Mka&ij
ƫ?Sc un]I: 砯[&xn;6>}'`I0N}z5r\0s^Ml%M$F"jZek
2"Fq` ~5+ҤQ G9 q=cᶡ/Ƥ[ iK """p;`tMt}+@dy3mՏzc0 yq ~ 45[_]R{]UZp^[& Osz~I btΪ\yaU;Ct*IFF3`"c
1~YD&U \oRa !c[[G}P7 zn>3,=lUENR[_9 SJMyE}x,bpAdc RW9?[H$p"#^9O88 zO=!Yy91 ڻM?M#C&nJ p#~ G ekϵo_~xuΨQ t ۲:W6oyFQr $k 9ڼs67\myFTK;[ld7 ya` eY~q[&vMF}p3gW!8Vn:a/ ,i|R,`!W }1Ӿx~x XZG\vR~sӭ&{]Q~9ʡH~"5 -&U +g
j~륢N=Jfd 9BfI nZ8wЮ~a=3x+/l`?"#8-S\pqTZXt%&#` ~{p {m>ycP0(R ^} (y%m}kB1Ѯ,#Q)!o1T *}9y< b04H .
9`> }ga
`~)\oBRaLSg$IZ~% 8)Rcu9b %)S 4ֺ}Z/[ H%v#x b
t{gn=i%]ܧ! w Sp V?5cb_`znxKJ=WT9 qx"qzWUNN/O^xe|k{4V^~Gz|[31 rpjgn
0}k90ne+" VbrO]'0oxh`*!T$d/$~N>Wq&Z9O\1o&,-z ~^NCg N)ʩ70'_Eh u*K9.-v<h$W%~g-G~>ZIa+(aM #9l%c xKGx|" O:8qcyNJyRTj&Omztj ?KaXLebt~A`GBA ":g,h`q` e~+[ YjWH?N>X<5ǩ ѼM8cܪX}^r?I rS"Zm:"57u&|"
>[XHeS$R yଠ:2|Df? ZPDC(x0|R; Ms Vi,:xi`,GAlVFY:=29n~@yW~e N ]_Go'}э_ЯR66!: gFM~q; eX<#%A0R } G&x&?ZƱkeR Knz `9j%@qR [-$u&9zOJKad"[jײc;&B(g<9nȯGxP.fF}P
31 R}<3a~
2xV Dr
\:}#S}HI\OKuI ( G W 2:9%_3N|0}y lMZT [ /9
n3 Mòd d^.}:BNp>czí
Y%-*9ܭhRcd,. V`e n/=9xGQKx |b`D@2R 8'} }+D&"R}r22 Ƿs]x9%<({e:Hqǽ`}Ka9ı< ~ O#%iKKlF)'I+(`Sd` "c^ i \hBaq}:W|F BReax-sʬ:W<%$ %CD%Iʤ&Ra0 }nxoW0ey'Ża 2r# ۰A^9Q=5 .(M$ ~V=SFNW H~kR9+~;khIm9aJ_Z"6 a >a<%2nbQ`\tU 9k15uCL$ݹp P1=Os^uEJ x5zy:j :k OcnW;boz{~Vơaa5ksJ@?1{$=k s^nR)XN1OJxFh R"}?xSac*FSi;7~3 pw0<%~ P+^ Ye}CR /> >"m~&&>M[h [}"d&RO@3^(ʽ*QZy
1V}?O4Rh6R
a3߷
=mR/90CI:c}s۾"xЬˢW$" {PG
xZ1R0xE9+ ^rE` 70l@.' }zN3U<3*? "c=p ' 1"kJ H'x+
oN9 d ~c+jJz7( W]""?n괺6wN"Z`~:|??-E&® V$~X/& xL7p z^tY78Ue# #r=sU/EjRC4mxNݴ9 u:V
ZIcr1xpzsfV9`qLI?\~ ChOOmt עx Z}?S#b-X7 g~zzb3S m*qvsM=w}&ڪ^(! ֵen QYSLSNk!/n00vR wS a9-V`[$`(9cq_@Bq`捭0;79?w<|k1 һlnrPNa&} ~-_O'0`!R%]%b1' X ՝OR9+*" 0O `uaӫ9ԥSy.ox x&(STݽ]Nr3~["veIGlq=M|gsxI6
]ZΪ,zR}~#`F"iqcD>S G }1^+
i; Vi-Z]ܮ` b٥_/y(@ qg W0.:
6 r>QR0+zb+I0T bN"$~)69{0V27S WWccXyKZc' iQLaW `xS\` źʸ& |V|!G[[
3OrPY=15T~я 64/?Z~k}o }3 ]8濴n}a_6pS) 2?WڥiWd}q{*1rXRd&m0cd"J# ,df8Nh;=7pn 6J~O2 ^S J:6ܷ0!wbO P=:-& }
` 9 r9ϧz> X75XkrѢL 7w}xNHR:2 +uN/'~h!nReQ6Q Ew|Yq1uyz8 `;6i<' [ íZhu g>r `x}b2 k꣧o~:hTW4|ki"xQ6Ln0 {e#27@^.1NSy e Q=̩B8< Scc> .Fr:~G=k,^!F~
,}% "rGSYd?aY49PyU !~xm|/NܼPcT,/=Fk|u&{m]۾P>Xi
0'6( ! z^:S|,_&a]uѵ4j b~xƩ:,[
= R Y?}ڼ?x,1دv&@q S z8Xz~"j=}
~h@'hF#p?xQ-lvpxcx&lxG·0 L%y?-y`l7>q2A?"F}c!jB:J +Qv= Vu[Qml%R7aIT}x
? a7
1 -Ll}0O=up" 3ҶW/!|w}w ^qa M8Q?0IEhaX"`a
?!Q!R~q}~O`I0 J y|!@99 >8+u&!
ʰ<6Iz
S )Z_POw *nm=>Jh]&@nTR6IT ^Fx73!ַa$ 5Io:Ȫm Y[80*x"k+\ Ho}l"k, c{Z\
Q pz}3} JXOh٥LdR` 6G^^[bYRʻd}4 2,; CQĴc mV{W\xx,MR l-n~ ?#}"SҥWN;~)"S9cLj뵿ūikiX7yny} t`V's$9:{wEk c$.~k}AprѢ!`lSs 90 I Ý w&ef"pR9g}Tl} NkUK0Up ^ȥ{Hp`bqϩ^:
}' Mz+5x('C $_I?^'z~+-}*?.x^1}My¸& L7&' bqG]˪1$oR8`.q}s־C98cvSfuַ
_ۺx ר :גxP-/mnQG`Rq=>nr!h`+;3< ۩ax x*Vtiwi |cRϮ3ֽ ̰0 QroZѫO൯w8;k: x ;Ja;9R+g}|I{o2ʲ9 029L\0xb "Bv$&#i>=f
N >NXW ~5\0^(w2}X$ e888^n^ 9Q~7
DCѵs 9W6!2\:? (#'$GJW\ 0E"g;Pv Nsx"}/:t+]JM*"^Ud| 0M923"6H^&1oE.7*Htp{g<+cpby=8_skB\j ""[9Pb9B& =93LaaXdP.0\ 0?"J"
"S+=@9<AQաxk",J$S}xZWH"UQ ]Xg<
ߨg3-qe0*R$ܒ
S8}_/e'+-Ӷ[sk%x0-peCr
ϒ~= a(QWd\. \ F0M>grq+SNHO ܥݭ nJ|P6Kc=Is} Ga)a=#vK:oKٍ&R[sټˏ" pw qSR
9!KS&vD A9 R q}
$SnIV[]}A |k|E Mu R.Idk}yvc iUSZ&zn*j-ɭ/SH\y5 ۠"0 xnz#ԯ, eŴ 'c&<ݬ< S`kâna8=ʪ[x"pN02z K8.(v 2@ ~xfuyUWa|:%Q^[|o5ZY"^{9 6Yv*x>_|UִtM 9P## z/0-įdd, :p03S{9=+
![!#= "յjHh:[{?.u_%ccA
}0x9>~9,ah2 Ary$VN
]=$}
#1d Max!^!Kk
FN8+{Ҽo[ MRoe[_m/k.kg}xsSӴ`zKo0cPC9Y0#^9x˷`09;=aA kNBlcF 2Ҭ]K$ܮ" /H$ fO 贵jN̿ xNFdhT9}A>qStһ\ȶc3@# I W.<ѬaA ; q2q
$# !
!}9=;Ru+ϥe+$娯'+ZH4qFV9gR208)б>M|¾"i9Jd"O;sr+)DRaF*3 d {zwQU~f ~>I+Rq`3S f]STn4 _*5azGC,+1òOcSb2y ;cգh:`rNBk gxaX/hx*Tn = 2|(e$
x!' y+S=Y:i
-BK":ơ&v-Y=Onjyf4T P`S7={m/ ZK&Gb G AS *ÿ IoINU8Rw; 1Y
"E Oyto/8~#ñl2f'h ?CYd:qӷeĩ
RL+~A3g=aRt3
QREw_;haSir ^i!|RO mJ/ $l ӿ [` >cF61 z7Ldxw9AXO"hm"NT
I$pG~:bWS|n>Ϣܢ"%qL^ KpNA< &==ffF!yc $=ϭY]eDH>x_TP"a0ch['7a!?wn5 u|c{O1"xsZ&y32 ~AcO45-fR . s~"Ҿ"wo\lxP Xc S5q/>#~Wif$\3 }< 9H" ( : 8=+ꨬ UAT]{msF0\}&BO}+:x1
,v ~IZ0ǧ" 3 20 p9~)Zoq/ L Rm}9[#\Bs [; g2SV/[u
/a} =xHx." Qxh#a$'u<`:>2>+LSiwF1!eg`S }Vv $ |,szΒxD\ Rm o| :{Ӷn!0l, ( RR crsa,49MOH!@ } `9w;At0& .클5,u-cKӣ̺U.L0&%2"~x
[`cnH}y"keRF{(ة `J#}wg< :;M
^\yhX !vBzrF?B/s< B)۱ w5:s e{mѤh]Wm4W4bC3r$ pw`dzt!y`I hM)!e dRm'>?w zKcRq6fp$)wUl`ARAgr :Rg [ iYs5GK=FMG ``KɦuOQ!R/G`@qzd/(K%}bM x>RRV I Y~#"@8
Sgq54v [(q c!FGa? UWZ$y}zק?>"6{""}.$`U S& ' r$1(y7 V<~: Mw'bxb7g~,i F 8½k/{!2S/?:$eSRIRg9czrrNObi
Ѻ/$, ;R vxb" nmxn}3G,.٣u r`[<!@:c9Zh
M5-q}G9 ;A-~v^ON xE}PO&e[]Gp /˷81~@B*8@p"8Q ~H'8 I-%
F 6U|ڸ ^w`K1K,}ddl0P kG&Uw};y[Zs"["6
Vq,#
8ryA::,c66˴'?t} H--":|Ƭ[ 7#99$,+qS\ cy^ݸa"B-9%9Vw~vTꢷ%" [x"2gS?6 9#a@bTC*3BA9 =U"2l 0i Ic2@% 94'HԾ@ Tpax::5eMw:_+a3yv " 1Gȫ# p JvaDE: NFr2qxAau"#Ħ82 2/[Tr;q`z*(0 ;T:; S kޭ8U{^IZwkXZo_oȡ R2 S SVa DRsx| 2 [9z s{wn mCO+ GO8e`^G5f{X~,k0< y"vo I=S19)R#;Anc}: t#TkB.0R-Zgum}fJ+#2P~i%S3P*YA }2r:iRUQq0H9! ={ ~ J}Vײm.ߺiYlkgLrT"
&wH6`3 4e &L"%clyîA0 ~$[3u"pNO= c{rYK
~F
"a"Lr1ӯ 2< "C".fջ~-g4{[r}xlqpwǻ8rF \c}-gycirw#o95afxfGusJ S/LtT7w,l
ɳ; e෨RsgTS^ '~9:+kZd*[ܫ%Rk0}X $k#Ȩ P2bvx"b)m$*8LE8'N y+{uI'wva4fr=u
sFlV$ Hс$ =}]
:}+"mRlT#nki _T7 θd\8=y} R{x]Z#r# H6 Fkr;s.&;s 9HSaխtU-n | vqS {gRtS.P9}0_[;mޭZRX{+"-7! G" 9~nrYXp S!ӭoP̏t (0s# GLanJ!T # ?p}xIn#y'q@r[J& qP}:7^0yWa_79oa #q0{m Sy R{ve Х̮jR ":b +J y"]d O L 9-R c'SڲejP
qdВjPp a`
< iWNsmvz5:Rs\u