i ~SSKJr SSKJr SSKJr SSKJr \"S5r"SS\\5r "SS 5r S S jr g ) ) annotations)deque)islice)TypeVar_Tc@\rSrSrSr\SSj5r\SSj5rSrg) _Dependencyz5A class representing a (doubly-ended) queue of items.c.US$![a gf=f)zHead of the dependency.rN) IndexErrorselfs S/home/james-whalen/.local/lib/python3.13/site-packages/griffe/_internal/c3linear.pyhead_Dependency.heads" 7N  s  c[USUR55$![[4a [/SS5s$f=f)zgTail of the dependency. The `islice` object is sufficient for iteration or testing membership (`in`). r)r__len__ ValueErrorr r s rtail_Dependency.tails?  $$4<<>2 2J' $"a# # $s ==N)return _T | None)rr) __name__ __module__ __qualname____firstlineno____doc__propertyrr__static_attributes__rrr r s+? $$r"r c\rSrSrSrS SjrSSjrSSjrSSjr\ SSj5r \ SSj5r \ SS j5r SS jr S rg )_DependencyList(zA 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. cPUVs/sHn[U5PM snUlgs snf)z>Initialize the list. Parameters: *lists: Lists of items. N)r _lists)rlistslsts r__init___DependencyList.__init__0s" 4995C{3'59 9s#cB^[U4SjUR55$)z9Return True if any linearization's tail contains an item.c3B># UHnTUR;v M g7fN)r).0r)items r /_DependencyList.__contains__..:s;{4388#{s)anyr')rr0s `r __contains___DependencyList.__contains__8s;t{{;;;r"cH[UR5nU(aUS- $S$)Nrr)lenr')rsizes rr_DependencyList.__len__<s!4;;!q(q(r"c6URR5$r.)r'__repr__r s rr;_DependencyList.__repr__@s{{##%%r"cXURVs/sHoRPM sn$s snf)zReturn the heads.)r'r)rr)s rheads_DependencyList.headsCs"%)KK0KSK000s'cU$)z3Return self so that `__contains__` could be called.rr s rtails_DependencyList.tailsHs  r"c:[SUR55$)z0True if all elements of the lists are exhausted.c3># UHn[U5S:Hv M g7f)rN)r7)r/xs rr1,_DependencyList.exhausted..Ps4 13q6Q; s)allr'r s r exhausted_DependencyList.exhaustedMs4 444r"cURH.nU(dM URU:XdMUR5 M0 g)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)rr0is rremove_DependencyList.removeRs* AqQVVt^ r")r'N)r(list[_T | None]rNone)r0rrbool)rint)rstr)rrO)rr$)rrQ)r0rrrP)rrrrrr*r4rr;r r>rArHrMr!rr"rr$r$(s\:<)&1155r"r$c/n[U6nUR(aU$URH?nU(dM X2R;dMUR U5 UR U5 O [ S5eMo)zMerge lists of lists in the order defined by the C3Linear algorithm. Parameters: *lists: Lists of items. Returns: The merged list of items. zCannot compute C3 linearization)r$rHr>rAappendrMr)r(resultlinearizationsrs rc3linear_mergerX]svF$e,N   # #M"((Dt%9%99 d#%%d+)>? ? r"N)r(list[_T]rrY) __future__r collectionsr itertoolsrtypingrrr r$rXrr"rr^s=# T]$%)$.22j@r"