2019-02-26 22:26:40 +03:00
|
|
|
import abc
|
|
|
|
import asyncio
|
|
|
|
import time
|
|
|
|
|
2019-02-27 12:15:32 +03:00
|
|
|
from . import helpers
|
|
|
|
|
2019-02-26 22:26:40 +03:00
|
|
|
|
|
|
|
class RequestIter(abc.ABC):
|
|
|
|
"""
|
|
|
|
Helper class to deal with requests that need offsets to iterate.
|
|
|
|
|
|
|
|
It has some facilities, such as automatically sleeping a desired
|
|
|
|
amount of time between requests if needed (but not more).
|
|
|
|
|
|
|
|
Can be used synchronously if the event loop is not running and
|
|
|
|
as an asynchronous iterator otherwise.
|
|
|
|
|
|
|
|
`limit` is the total amount of items that the iterator should return.
|
|
|
|
This is handled on this base class, and will be always ``>= 0``.
|
|
|
|
|
|
|
|
`left` will be reset every time the iterator is used and will indicate
|
|
|
|
the amount of items that should be emitted left, so that subclasses can
|
|
|
|
be more efficient and fetch only as many items as they need.
|
|
|
|
|
|
|
|
Iterators may be used with ``reversed``, and their `reverse` flag will
|
|
|
|
be set to ``True`` if that's the case. Note that if this flag is set,
|
|
|
|
`buffer` should be filled in reverse too.
|
|
|
|
"""
|
|
|
|
def __init__(self, client, limit, *, reverse=False, wait_time=None, **kwargs):
|
|
|
|
self.client = client
|
|
|
|
self.reverse = reverse
|
|
|
|
self.wait_time = wait_time
|
|
|
|
self.kwargs = kwargs
|
|
|
|
self.limit = max(float('inf') if limit is None else limit, 0)
|
2019-03-29 20:32:00 +03:00
|
|
|
self.left = self.limit
|
2019-02-26 22:26:40 +03:00
|
|
|
self.buffer = None
|
2019-03-29 20:32:00 +03:00
|
|
|
self.index = 0
|
2019-02-26 22:26:40 +03:00
|
|
|
self.total = None
|
2019-03-29 20:32:00 +03:00
|
|
|
self.last_load = 0
|
2019-02-26 22:26:40 +03:00
|
|
|
|
|
|
|
async def _init(self, **kwargs):
|
|
|
|
"""
|
|
|
|
Called when asynchronous initialization is necessary. All keyword
|
|
|
|
arguments passed to `__init__` will be forwarded here, and it's
|
|
|
|
preferable to use named arguments in the subclasses without defaults
|
|
|
|
to avoid forgetting or misspelling any of them.
|
|
|
|
|
|
|
|
This method may ``raise StopAsyncIteration`` if it cannot continue.
|
2019-02-27 12:04:12 +03:00
|
|
|
|
2019-03-02 23:17:36 +03:00
|
|
|
This method may actually fill the initial buffer if it needs to,
|
|
|
|
and similarly to `_load_next_chunk`, ``return True`` to indicate
|
|
|
|
that this is the last iteration (just the initial load).
|
2019-02-26 22:26:40 +03:00
|
|
|
"""
|
|
|
|
|
|
|
|
async def __anext__(self):
|
2019-02-27 13:24:47 +03:00
|
|
|
if self.buffer is None:
|
|
|
|
self.buffer = []
|
2019-03-02 23:17:36 +03:00
|
|
|
if await self._init(**self.kwargs):
|
|
|
|
self.left = len(self.buffer)
|
2019-02-26 22:26:40 +03:00
|
|
|
|
2019-02-27 11:31:15 +03:00
|
|
|
if self.left <= 0: # <= 0 because subclasses may change it
|
|
|
|
raise StopAsyncIteration
|
|
|
|
|
2019-02-26 22:26:40 +03:00
|
|
|
if self.index == len(self.buffer):
|
|
|
|
# asyncio will handle times <= 0 to sleep 0 seconds
|
|
|
|
if self.wait_time:
|
|
|
|
await asyncio.sleep(
|
|
|
|
self.wait_time - (time.time() - self.last_load),
|
|
|
|
loop=self.client.loop
|
|
|
|
)
|
|
|
|
self.last_load = time.time()
|
|
|
|
|
|
|
|
self.index = 0
|
2019-02-27 13:24:47 +03:00
|
|
|
self.buffer = []
|
|
|
|
if await self._load_next_chunk():
|
|
|
|
self.left = len(self.buffer)
|
2019-02-26 22:26:40 +03:00
|
|
|
|
|
|
|
if not self.buffer:
|
|
|
|
raise StopAsyncIteration
|
|
|
|
|
|
|
|
result = self.buffer[self.index]
|
|
|
|
self.left -= 1
|
|
|
|
self.index += 1
|
|
|
|
return result
|
|
|
|
|
2019-02-27 18:13:11 +03:00
|
|
|
def __next__(self):
|
2019-02-28 10:07:31 +03:00
|
|
|
try:
|
|
|
|
return self.client.loop.run_until_complete(self.__anext__())
|
|
|
|
except StopAsyncIteration:
|
|
|
|
raise StopIteration
|
2019-02-27 18:13:11 +03:00
|
|
|
|
2019-02-26 22:26:40 +03:00
|
|
|
def __aiter__(self):
|
2019-02-27 13:24:47 +03:00
|
|
|
self.buffer = None
|
2019-02-26 22:26:40 +03:00
|
|
|
self.index = 0
|
|
|
|
self.last_load = 0
|
|
|
|
self.left = self.limit
|
|
|
|
return self
|
|
|
|
|
|
|
|
def __iter__(self):
|
|
|
|
if self.client.loop.is_running():
|
|
|
|
raise RuntimeError(
|
|
|
|
'You must use "async for" if the event loop '
|
|
|
|
'is running (i.e. you are inside an "async def")'
|
|
|
|
)
|
|
|
|
|
2019-02-27 11:31:15 +03:00
|
|
|
return self.__aiter__()
|
2019-02-26 22:26:40 +03:00
|
|
|
|
2019-02-27 12:15:32 +03:00
|
|
|
async def collect(self):
|
|
|
|
"""
|
|
|
|
Create a `self` iterator and collect it into a `TotalList`
|
|
|
|
(a normal list with a `.total` attribute).
|
|
|
|
"""
|
|
|
|
result = helpers.TotalList()
|
|
|
|
async for message in self:
|
|
|
|
result.append(message)
|
|
|
|
|
2019-02-27 12:39:56 +03:00
|
|
|
result.total = self.total
|
2019-02-27 12:15:32 +03:00
|
|
|
return result
|
|
|
|
|
2019-02-26 22:26:40 +03:00
|
|
|
@abc.abstractmethod
|
|
|
|
async def _load_next_chunk(self):
|
|
|
|
"""
|
|
|
|
Called when the next chunk is necessary.
|
2019-02-27 13:24:47 +03:00
|
|
|
|
|
|
|
It should extend the `buffer` with new items.
|
|
|
|
|
|
|
|
It should return ``True`` if it's the last chunk,
|
|
|
|
after which moment the method won't be called again
|
|
|
|
during the same iteration.
|
2019-02-26 22:26:40 +03:00
|
|
|
"""
|
|
|
|
raise NotImplementedError
|
|
|
|
|
|
|
|
def __reversed__(self):
|
|
|
|
self.reverse = not self.reverse
|
|
|
|
return self # __aiter__ will be called after, too
|