Stop sub-classing object (#8249)

This commit is contained in:
Patrick Cloke 2020-09-04 06:54:56 -04:00 committed by GitHub
parent 9f8abdcc38
commit c619253db8
No known key found for this signature in database
GPG key ID: 4AEE18F83AFDEB23
168 changed files with 293 additions and 292 deletions

View file

@ -46,7 +46,7 @@ def unwrapFirstError(failure):
@attr.s
class Clock(object):
class Clock:
"""
A Clock wraps a Twisted reactor and provides utilities on top of it.

View file

@ -36,7 +36,7 @@ from synapse.util import Clock, unwrapFirstError
logger = logging.getLogger(__name__)
class ObservableDeferred(object):
class ObservableDeferred:
"""Wraps a deferred object so that we can add observer deferreds. These
observer deferreds do not affect the callback chain of the original
deferred.
@ -188,7 +188,7 @@ def yieldable_gather_results(func, iter, *args, **kwargs):
).addErrback(unwrapFirstError)
class Linearizer(object):
class Linearizer:
"""Limits concurrent access to resources based on a key. Useful to ensure
only a few things happen at a time on a given resource.
@ -338,7 +338,7 @@ class Linearizer(object):
return new_defer
class ReadWriteLock(object):
class ReadWriteLock:
"""An async read write lock.
Example:
@ -502,7 +502,7 @@ def timeout_deferred(deferred, timeout, reactor, on_timeout_cancel=None):
@attr.s(slots=True, frozen=True)
class DoneAwaitable(object):
class DoneAwaitable:
"""Simple awaitable that returns the provided value.
"""

View file

@ -43,7 +43,7 @@ response_cache_total = Gauge("synapse_util_caches_response_cache:total", "", ["n
@attr.s
class CacheMetric(object):
class CacheMetric:
_cache = attr.ib()
_cache_type = attr.ib(type=str)

View file

@ -64,7 +64,7 @@ cache_pending_metric = Gauge(
_CacheSentinel = object()
class CacheEntry(object):
class CacheEntry:
__slots__ = ["deferred", "callbacks", "invalidated"]
def __init__(self, deferred, callbacks):
@ -80,7 +80,7 @@ class CacheEntry(object):
self.callbacks.clear()
class Cache(object):
class Cache:
__slots__ = (
"cache",
"name",
@ -288,7 +288,7 @@ class Cache(object):
self._pending_deferred_cache.clear()
class _CacheDescriptorBase(object):
class _CacheDescriptorBase:
def __init__(self, orig: _CachedFunction, num_args, cache_context=False):
self.orig = orig
@ -705,7 +705,7 @@ def cachedList(
Example:
class Example(object):
class Example:
@cached(num_args=2)
def do_something(self, first_arg):
...

View file

@ -40,7 +40,7 @@ class DictionaryEntry(namedtuple("DictionaryEntry", ("full", "known_absent", "va
return len(self.value)
class DictionaryCache(object):
class DictionaryCache:
"""Caches key -> dictionary lookups, supporting caching partial dicts, i.e.
fetching a subset of dictionary keys for a particular key.
"""
@ -53,7 +53,7 @@ class DictionaryCache(object):
self.thread = None
# caches_by_name[name] = self.cache
class Sentinel(object):
class Sentinel:
__slots__ = []
self.sentinel = Sentinel()

View file

@ -26,7 +26,7 @@ logger = logging.getLogger(__name__)
SENTINEL = object()
class ExpiringCache(object):
class ExpiringCache:
def __init__(
self,
cache_name,
@ -190,7 +190,7 @@ class ExpiringCache(object):
return False
class _CacheEntry(object):
class _CacheEntry:
__slots__ = ["time", "value"]
def __init__(self, time, value):

View file

@ -30,7 +30,7 @@ def enumerate_leaves(node, depth):
yield m
class _Node(object):
class _Node:
__slots__ = ["prev_node", "next_node", "key", "value", "callbacks"]
def __init__(self, prev_node, next_node, key, value, callbacks=set()):
@ -41,7 +41,7 @@ class _Node(object):
self.callbacks = callbacks
class LruCache(object):
class LruCache:
"""
Least-recently-used cache.
Supports del_multi only if cache_type=TreeCache

View file

@ -23,7 +23,7 @@ from synapse.util.caches import register_cache
logger = logging.getLogger(__name__)
class ResponseCache(object):
class ResponseCache:
"""
This caches a deferred response. Until the deferred completes it will be
returned from the cache. This means that if the client retries the request

View file

@ -3,7 +3,7 @@ from typing import Dict
SENTINEL = object()
class TreeCache(object):
class TreeCache:
"""
Tree-based backing store for LruCache. Allows subtrees of data to be deleted
efficiently.
@ -89,7 +89,7 @@ def iterate_tree_cache_entry(d):
yield d
class _Entry(object):
class _Entry:
__slots__ = ["value"]
def __init__(self, value):

View file

@ -26,7 +26,7 @@ logger = logging.getLogger(__name__)
SENTINEL = object()
class TTLCache(object):
class TTLCache:
"""A key/value cache implementation where each entry has its own TTL"""
def __init__(self, cache_name, timer=time.time):
@ -154,7 +154,7 @@ class TTLCache(object):
@attr.s(frozen=True, slots=True)
class _CacheEntry(object):
class _CacheEntry:
"""TTLCache entry"""
# expiry_time is the first attribute, so that entries are sorted by expiry.

View file

@ -34,7 +34,7 @@ def user_joined_room(distributor, user, room_id):
distributor.fire("user_joined_room", user=user, room_id=room_id)
class Distributor(object):
class Distributor:
"""A central dispatch point for loosely-connected pieces of code to
register, observe, and fire signals.
@ -103,7 +103,7 @@ def maybeAwaitableDeferred(f, *args, **kw):
return succeed(result)
class Signal(object):
class Signal:
"""A Signal is a dispatch point that stores a list of callables as
observers of it.

View file

@ -20,7 +20,7 @@ from twisted.internet import threads
from synapse.logging.context import make_deferred_yieldable, run_in_background
class BackgroundFileConsumer(object):
class BackgroundFileConsumer:
"""A consumer that writes to a file like object. Supports both push
and pull producers

View file

@ -14,7 +14,7 @@
# limitations under the License.
class JsonEncodedObject(object):
class JsonEncodedObject:
""" A common base class for defining protocol units that are represented
as JSON.

View file

@ -93,7 +93,7 @@ def measure_func(name: Optional[str] = None) -> Callable[[T], T]:
return wrapper
class Measure(object):
class Measure:
__slots__ = [
"clock",
"name",

View file

@ -29,7 +29,7 @@ from synapse.logging.context import (
logger = logging.getLogger(__name__)
class FederationRateLimiter(object):
class FederationRateLimiter:
def __init__(self, clock, config):
"""
Args:
@ -60,7 +60,7 @@ class FederationRateLimiter(object):
return self.ratelimiters[host].ratelimit()
class _PerHostRatelimiter(object):
class _PerHostRatelimiter:
def __init__(self, clock, config):
"""
Args:

View file

@ -114,7 +114,7 @@ async def get_retry_limiter(destination, clock, store, ignore_backoff=False, **k
)
class RetryDestinationLimiter(object):
class RetryDestinationLimiter:
def __init__(
self,
destination,

View file

@ -14,7 +14,7 @@
# limitations under the License.
class _Entry(object):
class _Entry:
__slots__ = ["end_key", "queue"]
def __init__(self, end_key):
@ -22,7 +22,7 @@ class _Entry(object):
self.queue = []
class WheelTimer(object):
class WheelTimer:
"""Stores arbitrary objects that will be returned after their timers have
expired.
"""