pSrSSKJr SSKJr SSKJr SSKrSSKJr SrSr "S S 5r "S S 5r g) zImplements a buffer for tasks used in task_graph_executor. See go/parallel-processing-in-gcloud-storage for more information. )absolute_import)division)unicode_literalsN)queuezBuffer Contents: zTask Buffer is empty.c$\rSrSrSrSrSrSrg)_PriorityWrapper!aWraps a buffered task and tracks priority information. Attributes: task (Union[task.Task, str]): A buffered item. Expected to be a task or a string (to handle shutdowns) when used by task_graph_executor. priority (int): The priority of this task. A task with a lower value will be executed before a task with a higher value, since queue.PriorityQueue uses a min-heap. cXlX lgN)taskpriority)selfr r s ;lib/googlecloudsdk/command_lib/storage/tasks/task_buffer.py__init___PriorityWrapper.__init__,s IMc4URUR:$r )r )rothers r__lt___PriorityWrapper.__lt__0s ==5>> ))r)r r N)__name__ __module__ __qualname____firstlineno____doc__rr__static_attributes__rrrr!s*rrcB\rSrSrSrSrSrS SjrS\4Sjr Sr S r g ) TaskBuffer4aStores and prioritizes tasks. The current implementation uses a queue.PriorityQueue under the hood, since in experiments we found that the heap it maintains did not add too much overhead. If it does end up being a bottleneck, the same API can be implemented with a collections.deque. c8[R"5Ulgr )r PriorityQueue_queuers rrTaskBuffer.__init__=s%%'DKrcJURR5R$)aRemoves and returns an item from the buffer. Calls to `get` block if there are no elements in the queue, and return prioritized items before non-prioritized items. Returns: A buffered item. Expected to be a task or a string (to handle shutdowns) when used by task_graph_executor. )r#getr r$s rr'TaskBuffer.get@s ;;??  ! !!rcfU(aSOSn[X5nURRU5 g)a0Adds an item to the buffer. Args: task (Union[task.Task, str]): A buffered item. Expected to be a task or a string (to handle shutdowns) when used by task_graph_executor. prioritize (bool): Tasks added with prioritize=True will be returned by `get` before tasks added with prioritize=False. rN)rr#put)rr prioritizer prioritized_items rr+TaskBuffer.putLs)qAH'7KKOO$%rreturnc6URR5$)z*Returns the number of items in the buffer.)r#qsizer$s rsizeTaskBuffer.sizeYs ;;   rcDUR5S:Xa[$[/n[R"UR R 5nU(a>URS5nUR[UR55 U(aM>SRU5$)z.Returns a string representation of the buffer.r ) r2BUFFER_EMPTY_MESSAGE BUFFER_HEADERcopydeepcopyr#rpopappendstrr join)r output_lines temp_queuepriority_wrappers r__str__TaskBuffer.__str__]s{ yy{a !!"?Lt{{001J #*#.3345 * 99\ ""r)r#N)F) rrrrrrr'r+intr2rArrrrrr4s'( " &C #rr) r __future__rrrr8 six.movesrr7r6rrrrrrFs< '' % .**&5#5#r