~i3SrSSKJr /SQr"SS\5r"SS\5r"SS \5r"S S \5r"S S \5r"SS\5r "SS\5r "SS\5r "SS\5r "SS\ 5r "SS\ 5rg)zViews of core data structures such as nested Mappings (e.g. dict-of-dicts). These ``Views`` often restrict element access, with either the entire view or layers of nested mappings being read-only. )Mapping) AtlasView AdjacencyViewMultiAdjacencyView UnionAtlasUnionAdjacencyUnionMultiInnerUnionMultiAdjacency FilterAtlasFilterAdjacencyFilterMultiInnerFilterMultiAdjacencycR\rSrSrSrSrSrSrSrSr Sr S r S r S r S rSrg )ra(An AtlasView is a Read-only Mapping of Mappings. It is a View into a dict-of-dict data structure. The inner level of dict is read-write. But the outer level is read-only. See Also ======== AdjacencyView: View into dict-of-dict-of-dict MultiAdjacencyView: View into dict-of-dict-of-dict-of-dict _atlascSUR0$Nrrselfs W/home/mande/repo/quber/.venv/lib/python3.13/site-packages/networkx/classes/coreviews.py __getstate__AtlasView.__getstate__&s$++&&cUSUlgrrrstates r __setstate__AtlasView.__setstate__)s Ho rcXlgNr)rds r__init__AtlasView.__init__,s rc,[UR5$r!)lenrrs r__len__AtlasView.__len__/4;;rc,[UR5$r!)iterrrs r__iter__AtlasView.__iter__2sDKK  rc URU$r!rrkeys r __getitem__AtlasView.__getitem__5s{{3rcfURVs0sHoXR5_M sn$s snfr!rcopyrns rr5AtlasView.copy8)+/;;7;a47<<>!;777.c,[UR5$r!)strrrs r__str__AtlasView.__str__;r)rcPURRSUR<S3$)N()) __class____name__rrs r__repr__AtlasView.__repr__>s$..))*!DKK?!<DJJ>KKrrar`NrFrMrrrrns= #I:$:E# 5LrrcR\rSrSrSrSrSrSrSrSr Sr S r S r S r S rS rg)raA read-only union of dict Adjacencies as a Map of Maps of Maps. The two input dict-of-dict-of-dicts represent the union of `G.succ` and `G.pred`. Return values are UnionAtlas The inner level of dict is read-write. But the middle and outer levels are read-only. succ : a dict-of-dict-of-dict {node: nbrdict} pred : a dict-of-dict-of-dict {node: nbrdict} The keys for the two dicts should be the same See Also ======== UnionAtlas: View into dict-of-dict UnionMultiAdjacency: View into dict-of-dict-of-dict-of-dict r_c4URURS.$rcr_rs rrUnionAdjacency.__getstate__rerc,USUlUSUlgrgr_rs rrUnionAdjacency.__setstate__rirc[[UR55[UR55- 5S:XdeXlX lg)Nr)r&rsrpr`rarks rr#UnionAdjacency.__init__s:3tyy{#c$))+&6671<<<  rc,[UR5$r!)r&r`rs rr'UnionAdjacency.__len__s4::rc,[UR5$r!)r+r`rs rr,UnionAdjacency.__iter__sDJJrcN[URUURU5$r!)rr`rars rr1UnionAdjacency.__getitem__s$**S/4::c?;;rcfURVs0sHoXR5_M sn$s snfr!)r`r5r6s rr5UnionAdjacency.copys)+/::6:a47<<>!:666r:cH[UVs0sHoX_M sn5$s snfr!rrs rr=UnionAdjacency.__str__rrclURRSUR<SUR<S3$rrrs rrDUnionAdjacency.__repr__rrrNrFrMrrrrs<"#I:$  <75Lrrc(\rSrSrSrSrSrSrSrg)r aA read-only union of two inner dicts of MultiAdjacencies. The two input dict-of-dict-of-dicts represent the union of `G.succ[node]` and `G.pred[node]` for MultiDiGraphs. Return values are UnionAtlas. The inner level of dict is read-write. But the outer levels are read-only. See Also ======== UnionAtlas: View into dict-of-dict UnionAdjacency: View into dict-of-dict-of-dict UnionMultiAdjacency: View into dict-of-dict-of-dict-of-dict rMcXR;nXR;nU(aFU(a&[URUURU5$[URU05$[0URU5$r!)r`rar)rnodein_succin_preds rr1UnionMultiInner.__getitem__sk**$**$ !$**T"2DJJt4DEEdjj.3 3"djj.//rc[URR55[URR55-nUVs0sHo"XR 5_M sn$s snfr!)rsr`rprar5)rnodesr7s rr5UnionMultiInner.copysODJJOO%&TZZ__->)??+015a47<<>!5111s A+NrVrMrrr r s I02rr c"\rSrSrSrSrSrSrg)r arA read-only union of two dict MultiAdjacencies. The two input dict-of-dict-of-dict-of-dicts represent the union of `G.succ` and `G.pred` for MultiDiGraphs. Return values are UnionAdjacency. The inner level of dict is read-write. But the outer levels are read-only. See Also ======== UnionAtlas: View into dict-of-dict UnionMultiInner: View into dict-of-dict-of-dict rMcN[URUURU5$r!)r r`ra)rrs rr1UnionMultiAdjacency.__getitem__s!tzz$/D1ABBrN)rCrGrHrIrJrKr1rLrMrrr r s ICrr c<\rSrSrSrSrSrSrSrSr Sr S r g ) r i aA read-only Mapping of Mappings with filtering criteria for nodes. It is a view into a dict-of-dict data structure, and it selects only nodes that meet the criteria defined by ``NODE_OK``. See Also ======== FilterAdjacency FilterMultiInner FilterMultiAdjacency cXlX lgr!)rNODE_OK)rr"rs rr#FilterAtlas.__init__s   rcN^[TRS5(aTRR$[TRS5(a:[TRRTR R 5-5$[U4SjTR 55$)Nlengthrc3X># UHnTRU5(dMSv M! g7fNr.0r7rs r &FilterAtlas.__len__..#=kT\\!_11k* *hasattrrrr&rrrpsumrs`rr'FilterAtlas.__len__s 4<< * *<<&& & 4<< ) )t||))DKK,<,<,>>? ?=dkk===rc^S[TRR5-[TR5:nU(a U4SjTRR5$U4SjTR5$![a SnNKf=f)NFc3J># UHoTR;dMUv M g7fr!rrs rr'FilterAtlas.__iter__..+F1!$++5EAA1# #c3X># UHnTRU5(dMUv M! g7fr!rrs rrr,:;a$,,q/;rr&rrrAttributeErrorrnode_ok_shorters` rr,FilterAtlas.__iter__%n $#dll&8&8"99C ;/ 5Orr c<\rSrSrSrSrSrSrSrSr Sr S r g ) r i:a@A read-only Mapping of Mappings with filtering criteria for nodes and edges. It is a view into a dict-of-dict-of-dict data structure, and it selects nodes and edges that satisfy specific criteria defined by ``NODE_OK`` and ``EDGE_OK``, respectively. See Also ======== FilterAtlas FilterMultiInner FilterMultiAdjacency c(XlX lX0lgr!)rrEDGE_OK)rr"rrs rr#FilterAdjacency.__init__Hs   rcN^[TRS5(aTRR$[TRS5(a:[TRRTR R 5-5$[U4SjTR 55$)Nrrc3X># UHnTRU5(dMSv M! g7frrrs rr*FilterAdjacency.__len__..Trrrrs`rr'FilterAdjacency.__len__Mrrc^S[TRR5-[TR5:nU(a U4SjTRR5$U4SjTR5$![a SnNKf=f)NrFc3J># UHoTR;dMUv M g7fr!rrs rr+FilterAdjacency.__iter__..\rrc3X># UHnTRU5(dMUv M! g7fr!rrs rrr]rrrrs` rr,FilterAdjacency.__iter__Vrrc^^TTR;a6TRT5(a UU4Sjn[TRTU5$[STS35e)NcX>TRU5=(a TRTU5$r!rr)r{rrs r new_node_ok0FilterAdjacency.__getitem__..new_node_okbs"||C(DT\\$-DDrrr)rrr rv)rrrs`` rr1FilterAdjacency.__getitem___sO 4;; 4<<#5#5 Et{{40+> >dV:.//rcH[UVs0sHoX_M sn5$s snfr!rrs rr=FilterAdjacency.__str__hrrcURRnUSUR<SUR<SUR<S3$r)rBrCrrrrQs rrDFilterAdjacency.__repr__ks>~~&&qr$,,)9DLL;K1MMr)rrrNrrMrrr r :s&  >;05Nrr c$\rSrSrSrSrSrSrg)r ipa6A read-only Mapping of Mappings with filtering criteria for nodes and edges. It is a view into a dict-of-dict-of-dict-of-dict data structure, and it selects nodes and edges that meet specific criteria defined by ``NODE_OK`` and ``EDGE_OK``. See Also ======== FilterAtlas FilterAdjacency FilterMultiAdjacency c#^# S[TRR5-[TR5:nU(a!U4SjTRR5nOU4SjTR5nUH@nSnTRUHnTR X55(dMSn O USLdM<Uv MB g![a SnNf=f7f)NrFc3J># UHoTR;dMUv M g7fr!rrs rr,FilterMultiInner.__iter__..sJ#5adkk9I#5rc3X># UHnTRU5(dMUv M! g7fr!rrs rrrsB;a$,,q/;rT)r&rrrrr)rrmy_nodesr7 some_keys_okr0s` rr,FilterMultiInner.__iter__}s $#dll&8&8"99C # UHnTRTU5v M g7fr!r)rr0r{rs rr/FilterMultiInner.__getitem__..s!G6FsDLLc**6Fs"c(>TRTU5$r!r)r0r{rs rr1FilterMultiInner.__getitem__..new_node_oks||C--rrr)rranyr rv)rr{rs`` rr1FilterMultiInner.__getitem__si 4;;  S!!Gdkk#6FGGG .t{{3/= =cU*-..rrMN)rCrGrHrIrJr,r1rLrMrrr r ps $ /rr c\rSrSrSrSrSrg)riaCA read-only Mapping of Mappings with filtering criteria for nodes and edges. It is a view into a dict-of-dict-of-dict-of-dict data structure, and it selects nodes and edges that satisfy specific criteria defined by ``NODE_OK`` and ``EDGE_OK``, respectively. See Also ======== FilterAtlas FilterAdjacency FilterMultiInner c^^TTR;aATRT5(a+UU4Sjn[TRTTRU5$[STS35e)NcX>TRU5=(a TRTX5$r!r)r{r0rrs redge_ok1FilterMultiAdjacency.__getitem__..edge_oks"||C(IT\\$-IIrrr)rrr rv)rrrs`` rr1 FilterMultiAdjacency.__getitem__sU 4;; 4<<#5#5 J$DKK$5t||WM MdV:.//rrMN)rCrGrHrIrJr1rLrMrrrrs  0rrN)rJcollections.abcr__all__rrrrrr r r r r rrMrrr s $ (=(=V8I8,88,4L4Ln1LW1Lh2j2>C.C&,O',O^3Ng3Nl*/*/Z0?0r