o Xi`)@srdZddlmZddlmZmZmZddlmZm Z m Z e dZ Gdddee Z Gdd d ee ee Z d S) z@Mutable list for nodes in a graph with safe mutation properties.) annotations)IterableIteratorSequence)GenericTypeVaroverloadTc@s@eZdZdZdZdd d Zedd d ZdddZdddZ dS)_LinkBoxaA link in a doubly linked list that has a reference to the actual object in the link. The :class:`_LinkBox` is a container for the actual object in the list. It is used to maintain the links between the elements in the linked list. The actual object is stored in the :attr:`value` attribute. By using a separate container for the actual object, we can safely remove the object from the list without losing the links. This allows us to remove the object from the list during iteration and place the object into a different list without breaking any chains. This is an internal class and should only be initialized by the :class:`DoublyLinkedSet`. Attributes: prev: The previous box in the list. next: The next box in the list. erased: A flag to indicate if the box has been removed from the list. owning_list: The :class:`DoublyLinkedSet` to which the box belongs. value: The actual object in the list. )next owning_listprevvalueownerDoublyLinkedSet[T]rT | NonereturnNonecCs||_||_||_||_dS)aJCreate a new link box. Args: owner: The linked list to which this box belongs. value: The value to be stored in the link box. When the value is None, the link box is considered erased (default). The root box of the list should be created with a None value. N)r r rr )selfrrrH/home/ubuntu/.local/lib/python3.10/site-packages/onnx_ir/_linked_list.py__init__$s  z_LinkBox.__init__boolcCs |jduSN)rrrrrerased2s z_LinkBox.erasedcCs8|jdur td|j|j}}|||_|_d|_dS)z@Remove the link from the list and detach the value from the box.Nz_LinkBox is already erased)r ValueErrorr r )rr next_rrrerase6s  z_LinkBox.erasestrc Cs*d|jd|jd|jjd|jjd S)Nz _LinkBox(z , erased=z, prev=z, next=))rrr r rrrr__repr__@s*z_LinkBox.__repr__N)rrrrrr)rr)rrrr) __name__ __module__ __qualname____doc__ __slots__rpropertyrrr!rrrrr s    r c@seZdZdZdZd1d2dd Zd3d d Zd3d dZd4ddZe d5ddZ e d6ddZ ddZ d7ddZ d8d!d"Z d9d$d%Z d9d&d'Zd:d(d)Zd;d*d+Zd;d,d-Zdr?cCst|tr t||S||jks||j kr&td|d|jd|jd|dkrBt|}t|}t| dD]}t|}q9|St|}t|}t|D]}t|}qN|S)zFGet the node at the given index. Complexity is O(n). zIndex out of range: z not in range [-z, r r) isinstancer@tupler* IndexErrorreversedr rangeiter)rr;iteratoritem_rrrr>s"     r5 _LinkBox[T] new_valuecCs|dur t|jjd|j|ur|S|j|ur"td|jdt|}|jvr0||t ||}|j }||_ ||_ ||_ ||_ |j d7_ ||j|<|S)aInsert a new value after the given box. All insertion methods should call this method to ensure that the list is updated correctly. Example:: Before: A <-> B <-> C ^v0 ^v1 ^v2 Call: _insert_one_after(B, v3) After: A <-> B <-> new_box <-> C ^v0 ^v1 ^v3 ^v2 Args: box: The box which the new value is to be inserted. new_value: The new value to be inserted. Nz does not support None valuesValue r2rB) TypeError __class__r#rr ridr,remover r r r*)rr5rM new_value_idnew_box original_nextrrr_insert_one_afters"     z!DoublyLinkedSet._insert_one_after new_values Iterable[T]cCs|}|D]}|||}qdS)z/Insert multiple new values after the given box.N)rV)rr5rWinsertion_pointrMrrr_insert_many_aftersz"DoublyLinkedSet._insert_many_afterrcCsNt|}|jvrtd|d|j|}||jd8_|j|=dS)zRemove a node from the list.rNr2rBN)rQr,rrr*)rrvalue_idr5rrrrRs   zDoublyLinkedSet.removecCs||jj|}dS)zAppend a node to the list.N)rVr+r )rrrKrrrappendszDoublyLinkedSet.appendcCs|D]}||qdSr)r\)rr-rrrrr/s zDoublyLinkedSet.extendcCs8t|}|jvrtd|d|j|}|||S)zInsert new nodes after the given node. Args: value: The value after which the new values are to be inserted. new_values: The new values to be inserted. rNr2)rQr,rrZrrrWr[rYrrr insert_afters   zDoublyLinkedSet.insert_aftercCs:t|}|jvrtd|d|j|j}|||S)zInsert new nodes before the given node. Args: value: The value before which the new values are to be inserted. new_values: The new values to be inserted. rNr2)rQr,rr rZr]rrr insert_before s   zDoublyLinkedSet.insert_beforercCsdt|dS)NzDoublyLinkedSet(r )listrrrrr!szDoublyLinkedSet.__repr__r)r-r.rr)rr1)rr8)r;r8rr )r;r@rrA)r5rLrMr rrL)r5rLrWrX)rr rr)r-rXrr)rr rWrXrrr")r#r$r%r&r'rr6r7r:rr>rVrZrRr\r/r^r_r!rrrrr)Ds(       1   r)N)r& __future__rcollections.abcrrrtypingrrrr r r)rrrrs 7