Ki dZddlmZmZddlmZmZddlmZmZddl m Z m Z ddl Z ddl mZddlmZmZmZeGd d ZGd d eZGd deZy)a) TaskMessageQueue - FIFO queue for task-related messages. This implements the core message queue pattern from the MCP Tasks spec. When a handler needs to send a request (like elicitation) during a task-augmented request, the message is enqueued instead of sent directly. Messages are delivered to the client only through the `tasks/result` endpoint. This pattern enables: 1. Decoupling request handling from message delivery 2. Proper bidirectional communication via the tasks/result stream 3. Automatic status management (working <-> input_required) )ABCabstractmethod) dataclassfield)datetimetimezone)AnyLiteralN)Resolver)JSONRPCNotificationJSONRPCRequest RequestIdceZdZUdZeded< eezed< edZ e ed< dZ e e eefdzed < dZedzed <y) QueuedMessagez A message queued for delivery via tasks/result. Messages are stored with their type and a resolver for requests that expect responses. )request notificationtypemessagecHtjtjSN)rnowrutcw/home/jay/workspace/scripts/.codegraph-venv/lib/python3.12/site-packages/mcp/shared/experimental/tasks/message_queue.pyzQueuedMessage.)s X\\8Rr)default_factory timestampNresolveroriginal_request_id)__name__ __module__ __qualname____doc__r __annotations__r r rrrrr dictstrr r rrrrrrsl + ,,Q 1 11'0RSIxS(04HhtCH~&-4D,0T)0NrrceZdZdZedededdfdZedededzfdZedededzfdZ edede fd Z edede efd Z ededdfd Zededdfd Zy) TaskMessageQueuea" Abstract interface for task message queuing. This is a FIFO queue that stores messages to be delivered via `tasks/result`. When a task-augmented handler calls elicit() or sends a notification, the message is enqueued here instead of being sent directly to the client. The `tasks/result` handler then dequeues and sends these messages through the transport, with `relatedRequestId` set to the tasks/result request ID so responses are routed correctly. Implementations can use in-memory storage, Redis, etc. task_idrreturnNc Kyw)z Add a message to the queue for a task. Args: task_id: The task identifier message: The message to enqueue Nr)selfr*rs renqueuezTaskMessageQueue.enqueueBc Kyw)z Remove and return the next message from the queue. Args: task_id: The task identifier Returns: The next message, or None if queue is empty Nrr-r*s rdequeuezTaskMessageQueue.dequeueLr/r0c Kyw)z Return the next message without removing it. Args: task_id: The task identifier Returns: The next message, or None if queue is empty Nrr2s rpeekzTaskMessageQueue.peekXr/r0c Kyw)z Check if the queue is empty for a task. Args: task_id: The task identifier Returns: True if no messages are queued Nrr2s ris_emptyzTaskMessageQueue.is_emptydr/r0c Kyw)a Remove and return all messages from the queue. This is useful for cleanup when a task is cancelled or completed. Args: task_id: The task identifier Returns: All queued messages (may be empty) Nrr2s rclearzTaskMessageQueue.clearpr/r0c Kyw)z Wait until a message is available in the queue. This blocks until either: 1. A message is enqueued for this task 2. The wait is cancelled Args: task_id: The task identifier Nrr2s rwait_for_messagez!TaskMessageQueue.wait_for_message~r/r0c Kyw)z Signal that a message is available for a task. This wakes up any coroutines waiting in wait_for_message(). Args: task_id: The task identifier Nrr2s rnotify_message_availablez)TaskMessageQueue.notify_message_availabler/r0)r!r"r#r$rr'rr.r3r5boolr7listr9r;r=rrrr)r)3s   S = T    S  ]T-A      #  -$*>      c  d      3  4 +>      c  d     c d  rr)ceZdZdZddZdedeefdZdededdfdZ dededzfd Z dededzfd Z dede fd Z dedeefd Zdeddfd ZdeddfdZddedzddfdZy)InMemoryTaskMessageQueueaA In-memory implementation of TaskMessageQueue. This is suitable for single-process servers. For distributed systems, implement TaskMessageQueue with Redis, RabbitMQ, etc. Features: - FIFO ordering per task - Async wait for message availability - Thread-safe for single-process async use r+Nc i|_i|_yr)_queues_events)r-s r__init__z!InMemoryTaskMessageQueue.__init__s79 /1 rr*cZ||jvrg|j|<|j|S)z#Get or create the queue for a task.)rCr2s r _get_queuez#InMemoryTaskMessageQueue._get_queues+ $,, &$&DLL !||G$$rrcK|j|}|j||j|d{y7w)zAdd a message to the queue.N)rGappendr=)r-r*rqueues rr.z InMemoryTaskMessageQueue.enqueues4( W++G444s7A?AcTK|j|}|sy|jdSw)z#Remove and return the next message.Nr)rGpopr-r*rJs rr3z InMemoryTaskMessageQueue.dequeues((yy|s&(c<K|j|}|sy|dSw)z,Return the next message without removing it.Nr)rGrMs rr5zInMemoryTaskMessageQueue.peeks#(QxscHK|j|}t|dk(Sw)zCheck if the queue is empty.r)rGlenrMs rr7z!InMemoryTaskMessageQueue.is_emptys"(5zQs "cfK|j|}t|}|j|Sw)zRemove and return all messages.)rGr?r9)r-r*rJmessagess rr9zInMemoryTaskMessageQueue.clears+(; s/1cK|j|d{sytj|j|<|j|}|j|d{sy|j d{y7h7 7 w)z"Wait until a message is available.N)r7anyioEventrDwait)r-r*events rr;z)InMemoryTaskMessageQueue.wait_for_messagesz]]7+++ !&  W W%]]7+++ jjl,, s4BBA B!B"B:B;BBBcdK||jvr|j|jyyw)z#Signal that a message is available.N)rDsetr2s rr=z1InMemoryTaskMessageQueue.notify_message_availables, dll " LL ! % % ' #s.0c|9|jj|d|jj|dy|jj|jjy)z Clean up queues and events. Args: task_id: If provided, clean up only this task. Otherwise clean up all. N)rCrLrDr9r2s rcleanupz InMemoryTaskMessageQueue.cleanupsR   LL  Wd + LL  Wd + LL   LL   r)r+Nr)r!r"r#r$rEr'r?rrGr.r3r5r>r7r9r;r=r[rrrrArAs 2%#%$}*=% 5S5=5T5S]T-A#-$*>cd 34 +>cd"(c(d( !sTz !T !rrA)r$abcrr dataclassesrrrrtypingr r rT&mcp.shared.experimental.tasks.resolverr mcp.typesr r rrr)rArrrras^ $(' ;DD OO O0a sa HZ!/Z!r