Warning: chmod(): Operation not permitted in /var/www/hopeinstoughton_www/wp-content/plugins/simple-universal-google-analytics/main.php on line 8 [0] in function chmod in /var/www/hopeinstoughton_www/wp-content/plugins/simple-universal-google-analytics/main.php on line 8 [1] in function include_once in /var/www/hopeinstoughton_www/wp-settings.php on line 560 [2] in function require_once in /var/www/hopeinstoughton_www/wp-config.php on line 85 [3] in function require_once in /var/www/hopeinstoughton_www/wp-load.php on line 50 [4] in function require_once in /var/www/hopeinstoughton_www/wp-blog-header.php on line 13 [5] in function require in /var/www/hopeinstoughton_www/index.php on line 17
| Server IP : 94.177.8.99 / Your IP : 216.73.217.165 Web Server : Apache/2.4.58 (Ubuntu) System : Linux aries 6.8.0-134-generic #134-Ubuntu SMP PREEMPT_DYNAMIC Fri Jun 26 18:43:11 UTC 2026 x86_64 User : www-data ( 33) PHP Version : 8.1.34 Disable Function : NONE MySQL : OFF | cURL : ON | WGET : ON | Perl : ON | Python : OFF | Sudo : ON | Pkexec : OFF Directory : /nuitka/eggshell.build/ |
Upload File : |
�� }��return�Ns.�� �
on_timeout�.��$ � _set_timeout.<locals>.on_timeout�.��
�ioloop�.��
�IOLoop�.�� �current�.�� � add_timeout�.�� �add_done_callback�.�� �<lambda>�.��" � _set_timeout.<locals>.<lambda>�.��
�future�.�� �done�.�� �
set_exception�.�� �gen�.�� � TimeoutError�.�� �io_loop�.�� �remove_timeout�.�� �timeout_handle�.�� �q�.�� �get�.�� �maxsize can't be None�.�K .�� �maxsize can't be negative�.�� �_maxsize�.�� �_init�.�� � collections�.�� �deque�.�� �_getters�.�� �_putters�.�� �_unfinished_tasks�.�� �Event�.��
� _finished�.�� �set�.��) �%Number of items allowed in the queue.�.��
�_queue�.��! � Number of items in the queue.�.�� �maxsize�.�� �qsize�.��
�Future�.�� �
put_nowait�.��
� QueueFull�.��
�append�.�� �item�.�� � _set_timeout�.�� �
set_result�.�� N��.��� X� Put an item into the queue, perhaps waiting until there is room.
Returns a Future, which raises `tornado.util.TimeoutError` after a
timeout.
``timeout`` may be a number denoting a time (on the same
scale as `tornado.ioloop.IOLoop.time`, normally `time.time`), or a
`datetime.timedelta` object for a deadline relative to the
current time.
�.�� �_consume_expired�.�� �empty�.��/ �)queue non-empty, why are getters waiting?���.�� �popleft�.�� �_Queue__put_internal�.��& �"future_set_result_unless_cancelled�.�� �_get�.�� �full�.�� �{Put an item into the queue without blocking.
If no free slot is immediately available, raise `QueueFull`.
�.�� �
get_nowait�.�� �
QueueEmpty�.��5 X. Remove and return an item from the queue.
Returns an awaitable which resolves once an item is available, or raises
`tornado.util.TimeoutError` after a timeout.
``timeout`` may be a number denoting a time (on the same
scale as `tornado.ioloop.IOLoop.time`, normally `time.time`), or a
`datetime.timedelta` object for a deadline relative to the
current time.
.. note::
The ``timeout`` argument of this method differs from that
of the standard library's `queue.Queue.get`. That method
interprets numeric values as relative timeouts; this one
interprets them as absolute deadlines and requires
``timedelta`` objects for relative timeouts (consistent
with other timeouts in Tornado).
�.��. �(queue not full, why are putters waiting?���.��* �&too many values to unpack (expected 2)�.��� ��Remove and return an item from the queue without blocking.
Return an item if one is immediately available, else raise
`QueueEmpty`.
�.��% �!task_done() called too many times�.�K.��� X� Indicate that a formerly enqueued task is complete.
Used by queue consumers. For each `.get` used to fetch a task, a
subsequent call to `.task_done` tells the queue that the processing
on the task is complete.
If a `.join` is blocking, it resumes when all items have been
processed; that is, when every `.put` is matched by a `.task_done`.
Raises `ValueError` if called more times than `.put`.
�.�� �wait�.��� ��Block until all items in the queue are processed.
Returns an awaitable, which raises `tornado.util.TimeoutError` after a
timeout.
�.�� �_QueueIterator�.�� �clear�.�� �_put�.�� �self�.�� �
<%s at %s %s>�.�� �__name__�.�� �_format�.�� �<%s %s>�.�� �
maxsize=%r�.��
� queue=%r�.�� � getters[%s]�.�� � putters[%s]�.��
� tasks=%s�.�� �heapq�.�� �heappush�.�� �heappop�.�� �pop�.��� X� Asynchronous queues for coroutines. These classes are very similar
to those provided in the standard library's `asyncio package
<https://docs.python.org/3/library/asyncio-queue.html>`_.
.. warning::
Unlike the standard library's `queue` module, the classes defined here
are *not* thread-safe. To use these queues from another thread,
use `.IOLoop.add_callback` to transfer control to the `.IOLoop` thread
before calling any queue methods.
�.�� �__doc__�.��< �8/usr/local/lib/python3.8/dist-packages/tornado/queues.py�.�� �__file__�.�� �__spec__�.��
�origin�.�� � has_location�.�� �
__cached__�.�� �datetime�.�� �tornado�.�� hh��.�� �tornado.concurrent�.�� h&h5��.�� �
tornado.locks�.�� h ��.�� �Union�.�� �TypeVar�.�� �Generic�.��
� Awaitable�.�� �Optional�.��
�typing�.�� �_T���.�� �_T�.��B ]�(�Queue��
PriorityQueue�� LifoQueue�� QueueFull��
QueueEmpty�e.�� �__all__�.�� �builtins�� Exception�����.��
� metaclass�.�� � __prepare__�.�� � __getitem__�.��2 �.%s.__prepare__() must return a mapping, not %s�.�� � <metaclass>�.�� �tornado.queues�.�� �
__module__�.��> �:Raised by `.Queue.get_nowait` when the queue has no items.�.�� � __qualname__�.�� �__orig_bases__�.��F �BRaised by `.Queue.put_nowait` when a queue is at its maximum size.�.�� �timeout�.��
� timedelta�.�h.�� }�(h� Queue[_T]�hNu.�� �__init__�.�� �_QueueIterator.__init__�.��
� __anext__�.�� �_QueueIterator.__anext__�.�� �Queue�.��� X� Coordinate producer and consumer coroutines.
If maxsize is 0 (the default) the queue size is unbounded.
.. testcode::
import asyncio
from tornado.ioloop import IOLoop
from tornado.queues import Queue
q = Queue(maxsize=2)
async def consumer():
async for item in q:
try:
print('Doing work on %s' % item)
await asyncio.sleep(0.01)
finally:
q.task_done()
async def producer():
for item in range(5):
await q.put(item)
print('Put %s' % item)
async def main():
# Start consumer without waiting (since it never finishes).
IOLoop.current().spawn_callback(consumer)
await producer() # Wait for producer to put all tasks.
await q.join() # Wait for consumer to finish all tasks.
print('Done')
asyncio.run(main())
.. testoutput::
Put 0
Put 1
Doing work on 0
Put 2
Doing work on 1
Put 3
Doing work on 2
Put 4
Doing work on 3
Doing work on 4
Done
In versions of Python without native coroutines (before 3.5),
``consumer()`` could be written as::
@gen.coroutine
def consumer():
while True:
item = yield q.get()
try:
print('Doing work on %s' % item)
yield gen.sleep(0.01)
finally:
q.task_done()
.. versionchanged:: 4.3
Added ``async for`` support in Python 3.5.
�.�� K ��.�� �int�.�� �Queue.__init__�.�� �property�.�� �
Queue.maxsize�.�� � Queue.qsize�.�� �bool�.�� � Queue.empty�.�� �
Queue.full�.�� �float�.�� � Future[None]�.�� �put�.��
� Queue.put�.�� �Queue.put_nowait�.��
� Queue.get�.�� �Queue.get_nowait�.��
� task_done�.�� �Queue.task_done�.�� �join�.�� �
Queue.join�.��
� __aiter__�.�� �Queue.__aiter__�.�� � Queue._init�.�� �
Queue._get�.�� �
Queue._put�.�� �__put_internal�.�� �Queue.__put_internal�.�� �Queue._consume_expired�.�� �str�.�� �__repr__�.�� �Queue.__repr__�.�� �__str__�.�� �
Queue.__str__�.�� �
Queue._format�.�� �
PriorityQueue�.��� X� A `.Queue` that retrieves entries in priority order, lowest first.
Entries are typically tuples like ``(priority number, data)``.
.. testcode::
import asyncio
from tornado.queues import PriorityQueue
async def main():
q = PriorityQueue()
q.put((1, 'medium-priority item'))
q.put((0, 'high-priority item'))
q.put((10, 'low-priority item'))
print(await q.get())
print(await q.get())
print(await q.get())
asyncio.run(main())
.. testoutput::
(0, 'high-priority item')
(1, 'medium-priority item')
(10, 'low-priority item')
�.�� �PriorityQueue._init�.�� �PriorityQueue._put�.�� �PriorityQueue._get�.��
� LifoQueue�.��� X� A `.Queue` that retrieves the most recently put items first.
.. testcode::
import asyncio
from tornado.queues import LifoQueue
async def main():
q = LifoQueue()
q.put(3)
q.put(2)
q.put(1)
print(await q.get())
print(await q.get())
print(await q.get())
asyncio.run(main())
.. testoutput::
1
2
3
�.�� �LifoQueue._init�.�� �LifoQueue._put�.�� �LifoQueue._get�.�� �_�hh��.�� hh��.�� �<module tornado.queues>�.�� � __class__���.�� hG��.�� hGh$��.�� hGh��.�� hGh*��.�� hG�result���.�� (h h�hhht�.�� hGh�h ��.�� hGh*�putter���.�� hGh���.�� h ��.�� (hGh*h�h t�.�� hGh*�getter���.�� � �.