-h ddlmZddlmZddlmZddlmZedZGddeeZ Gdd Z dd Z dS)) annotations)deque)islice)TypeVar_TcBeZdZdZeddZed dZdS) _Dependencyz5A class representing a (doubly-ended) queue of items.return _T | Nonec6 |dS#t$rYdSwxYw)zHead of the dependency.rN) IndexErrorselfs M/var/www/FlaskApp/flask-venv/lib/python3.11/site-packages/_griffe/c3linear.pyheadz_Dependency.heads2 7N   44 s  rc t|d|S#ttf$rtgddcYSwxYw)zwTail of the dependency. The `islice` object is sufficient for iteration or testing membership (`in`). r)r__len__ ValueErrorr rs rtailz_Dependency.tailsY  $$4<<>>22 2J' $ $ $"a## # # # $s"%"A  A N)r r )r r)__name__ __module__ __qualname____doc__propertyrrrr r sX?? X$$$X$$$rr ceZdZdZddZdd Zdd ZddZeddZ eddZ eddZ ddZ dS)_DependencyListzA class representing a list of linearizations (dependencies). The last element of DependencyList is a list of parents. It's needed to the merge process preserves the local precedence order of direct parent classes. listslist[_T | None]r Nonec(d|D|_dS)zVInitialize the list. Parameters: *lists: Lists of items. c,g|]}t|Sr)r .0lsts r z,_DependencyList.__init__..6s 999C{3''999rN_lists)rr s r__init__z_DependencyList.__init__0s :95999 ritemrboolcDtfd|jDS)z9Return True if any linearization's tail contains an item.c3*K|] }|jvVdSN)r)r&r'r,s r z/_DependencyList.__contains__..:s*;;438#;;;;;;r)anyr*)rr,s `r __contains__z_DependencyList.__contains__8s(;;;;t{;;;;;;rintc<t|j}|r|dz ndS)Nrr)lenr*)rsizes rrz_DependencyList.__len__<s$4;!(qq(rstrc4|jSr0)r*__repr__rs rr:z_DependencyList.__repr__@s{##%%%rc$d|jDS)zReturn the heads.cg|] }|j Sr)rr%s rr(z)_DependencyList.heads..Fs000S000rr)rs rheadsz_DependencyList.headsCs10DK0000rc|S)z3Return self so that `__contains__` could be called.rrs rtailsz_DependencyList.tailsHs  rc>td|jDS)z0True if all elements of the lists are exhausted.c3<K|]}t|dkVdS)rN)r6)r&xs rr1z,_DependencyList.exhausted..Ps,4413q66Q;444444r)allr*rs r exhaustedz_DependencyList.exhaustedMs#44 444444rr c\|jD]#}|r|j|kr|$dS)zRemove an item from the lists. Once an item removed from heads, the leftmost elements of the tails get promoted to become the new heads. N)r*rpopleft)rr,is rremovez_DependencyList.removeRs?   A QVt^^   rN)r r!r r")r,rr r-)r r4)r r8)r r!)r r)r r-)r,r r r") rrrrr+r3rr:rr=r?rDrHrrrrr(s::::<<<<))))&&&&111X1X555X5rrr list[_T]r cg}t|} |jr|S|jD]9}|r5||jvr,||||n:t dZ)zMerge lists of lists in the order defined by the C3Linear algorithm. Parameters: *lists: Lists of items. Returns: The merged list of items. TzCannot compute C3 linearization)rrDr=r?appendrHr)r resultlinearizationsrs rc3linear_mergerN]sF$e,N@  # M"( @ @D ^%999 d###%%d+++>?? ?@rN)r rIr rI) __future__r collectionsr itertoolsrtypingrrr rrNrrrrSs#""""" WT]]$$$$$%)$$$.22222222j@@@@@@r