o ae @sddlmZmZddlmZddlmZGdddeZGdddeZ Gdd d e Z e e e e Gd d d e Z e e e e e Z dddZddZdS))SequenceHashable)Integral)reducec@s<eZdZdZdZddZddZddZd d Zd d Z d S) _PListBuilderzc Helper class to allow construction of a list without having to reverse it in the end. )_head_tailcCst|_t|_dSN) _EMPTY_PLISTrrselfr 3/usr/lib/python3/dist-packages/pyrsistent/_plist.py__init__ s z_PListBuilder.__init__cCs:|js|||_|j|_|jS|||j_|jj|_|jSr )rrrest)r elem constructorr r r_appends  z_PListBuilder._appendcC||ddS)NcSs t|tSr )PListr )er r r z+_PListBuilder.append_elem..rr rr r r append_elemz_PListBuilder.append_elemcCr)NcS|Sr r )lr r rrsz,_PListBuilder.append_plist..r)r plr r r append_plistrz_PListBuilder.append_plistcCs|jSr )rr r r rbuild!sz_PListBuilder.buildN) __name__ __module__ __qualname____doc__ __slots__rrrr r!r r r rrs  rc@seZdZdZejZejZddZddZddZ e Z dd Z d d Z d d Z e ZddZddZddZddZddZddZddZddZdS) _PListBase) __weakref__cCstt|ffSr )plistlistr r r r __reduce__.sz_PListBase.__reduce__cCstdd|DS)a Return the length of the list, computed by traversing it. This is obviously O(n) but with the current implementation where a list is also a node the overhead of storing the length in every node would be quite significant. css|]}dVqdS)Nr ).0_r r r :sz%_PListBase.__len__..)sumr r r r__len__2sz_PListBase.__len__cCsdt|S)Nz plist({0}))formatr*r r r r__repr__<sz_PListBase.__repr__cCs t||S)z Return a new list with elem inserted as new head. >>> plist([1, 2]).cons(3) plist([3, 1, 2]) )rrr r rcons@s z_PListBase.conscCs|}|D]}||}q|S)a  Return a new list with all elements of iterable repeatedly cons:ed to the current list. NB! The elements will be inserted in the reverse order of the iterable. Runs in O(len(iterable)). >>> plist([1, 2]).mcons([3, 4]) plist([4, 3, 1, 2]) r4)r iterableheadrr r rmconsIs  z_PListBase.mconscCs(t}|}|r||j}|j}|s|S)a Return a reversed version of list. Runs in O(n) where n is the length of the list. >>> plist([1, 2, 3]).reverse() plist([3, 2, 1]) Also supports the standard reversed function. >>> reversed(plist([1, 2, 3])) plist([3, 2, 1]) )r)r4firstr)r resultr7r r rreverseXs  z_PListBase.reversecCsXt}|}d}|r ||kr ||j|j}|d7}|r ||ks |s&|tfS||fS)z Spilt the list at position specified by index. Returns a tuple containing the list up until index and the list after the index. Runs in O(index). >>> plist([1, 2, 3, 4]).split(2) (plist([1, 2]), plist([3, 4])) rr,)rrr9rr r!)r indexlb right_listir r rsplitms    z_PListBase.splitccs$|}|r|jV|j}|sdSdSr r9r)r lir r r__iter__s  z_PListBase.__iter__cCst|tstSt|t|kSr ) isinstancer'NotImplementedtuple)r otherr r r__lt__s z_PListBase.__lt__cCsNt|tstS|}|}|r!|r!|j|jksdS|j}|j}|r!|s| o&| S)z Traverses the lists, checking equality of elements. This is an O(n) operation, but preserves the standard semantics of list equality. F)rDr'rEr9r)r rG self_head other_headr r r__eq__s   z_PListBase.__eq__c Cst|tr'|jdur|jdur|jdus|jdkr||jStt||St|ts5t dt |j |dkr?|t |7}z||j WStyW}ztd|d}~ww)Nr,z-'%s' object cannot be interpreted as an indexrPList index out of range)rDslicestartstopstep_dropr)rFr TypeErrortyper"lenr9AttributeError IndexError)r r<rr r r __getitem__s (    z_PListBase.__getitem__cCs6|dkrtd|}|dkr|j}|d8}|dks|S)NrrLr,)rVr)r countr7r r rrQsz_PListBase._dropcCs tt|Sr )hashrFr r r r__hash__s z_PListBase.__hash__cCsHt}|}|r|j|kr||jS||j|j}|std|)a  Return new list with first element equal to elem removed. O(k) where k is the position of the element that is removed. Raises ValueError if no matching element is found. >>> plist([1, 2, 1]).remove(1) plist([2, 1]) z{0} not found in PList)rr9r rr ValueErrorr2)r rbuilderr7r r rremoves    z_PListBase.removeN)r"r#r$r&rrXr<r+r1r3__str__r4r8r; __reversed__r@rCrHrKrWrQrZr]r r r rr'%s(   r'cs0eZdZdZdZfddZddZeZZS)ra Classical Lisp style singly linked list. Adding elements to the head using cons is O(1). Element access is O(k) where k is the position of the element in the list. Taking the length of the list is O(n). Fully supports the Sequence and Hashable protocols including indexing and slicing but if you need fast random access go for the PVector instead. Do not instantiate directly, instead use the factory functions :py:func:`l` or :py:func:`plist` to create an instance. Some examples: >>> x = plist([1, 2]) >>> y = x.cons(3) >>> x plist([1, 2]) >>> y plist([3, 1, 2]) >>> y.first 3 >>> y.rest == x True >>> y[:2] plist([3, 1]) rAcs tt||}||_||_|Sr )superr__new__r9r)clsr9rinstance __class__r rrasz PList.__new__cCdS)NTr r r r r__bool__zPList.__bool__) r"r#r$r%r&rarg __nonzero__ __classcell__r r rdrrs   rc@s4eZdZdZddZeZeddZeddZdS) _EmptyPListr cCrf)NFr r r r rrg rhz_EmptyPList.__bool__cCstd)NzEmpty PList has no first)rUr r r rr9sz_EmptyPList.firstcCrr r r r r rrsz_EmptyPList.restN) r"r#r$r&rgripropertyr9rr r r rrk s rkr FcCs$|s t|}|tdd|tS)a  Creates a new persistent list containing all elements of iterable. Optional parameter reverse specifies if the elements should be inserted in reverse order or not. >>> plist([1, 2, 3]) plist([1, 2, 3]) >>> plist([1, 2, 3], reverse=True) plist([3, 2, 1]) cSs ||Sr r5)rrr r rr/rzplist..)r*r;rr )r6r;r r rr) s r)cGst|S)zj Creates a new persistent list containing all arguments. >>> l(1, 2, 3) plist([1, 2, 3]) )r))elementsr r rr2srN)r F)collections.abcrrnumbersr functoolsrobjectrr'rregisterrkr r)rr r r rs  : (