+
    �°³jÃ3  ã                   ó  € R t ^ RIHt . ROt ! R R]4      t ! R R]4      t ! R R]4      t ! R R]4      t ! R R]4      t ! R R]4      t	 ! R R]4      t
 ! R R	]4      t ! R R
]4      t ! R R]4      t ! R R]4      tR# )zÅViews 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ÚAdjacencyViewÚMultiAdjacencyViewÚ
UnionAtlasÚUnionAdjacencyÚUnionMultiInnerÚUnionMultiAdjacencyÚFilterAtlasÚFilterAdjacencyÚFilterMultiInnerÚFilterMultiAdjacencyc                   ó^   a € ] tR t^t o RtRtR tR tR tR t	R t
R tR tR	 tR
 tRtV tR# )r   a(  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
c                ó   € R V P                   /# ©Ú_atlasr   ©Úselfs   &Ú[/home/luca/screen-checking/.venv/lib/python3.14/site-packages/networkx/classes/coreviews.pyÚ__getstate__ÚAtlasView.__getstate__&   s   € Ø˜$Ÿ+™+Ð&Ð&ó    c                ó"   € VR ,          V n         R# )r   Nr   ©r   Ústates   &&r   Ú__setstate__ÚAtlasView.__setstate__)   s   € Ø˜H•oˆŽr   c                ó   € Wn         R # ©Nr   )r   Úds   &&r   Ú__init__ÚAtlasView.__init__,   s   € ØŽr   c                ó,   € \        V P                  4      # r   )Úlenr   r   s   &r   Ú__len__ÚAtlasView.__len__/   ó   € Ü�4—;‘;ÓÐr   c                ó,   € \        V P                  4      # r   )Úiterr   r   s   &r   Ú__iter__ÚAtlasView.__iter__2   s   € Ü�D—K‘KÓ Ð r   c                ó(   € V P                   V,          # r   r   ©r   Úkeys   &&r   Ú__getitem__ÚAtlasView.__getitem__5   s   € Ø�{‰{˜3ÕÐr   c                ól   € V P                    Uu/ uF  qW,          P                  4       bK  	  up# u upi r   ©r   Úcopy©r   Úns   & r   r2   ÚAtlasView.copy8   ó)   € Ø+/¯;ª;Ó7©; a�4•7—<‘<“>Ò!©;Ñ7Ð7ùÒ7ó   �1c                ó,   € \        V P                  4      # r   )Ústrr   r   s   &r   Ú__str__ÚAtlasView.__str__;   r&   r   c                óP   € V P                   P                   R V P                  : R2# )Ú(Ú))Ú	__class__Ú__name__r   r   s   &r   Ú__repr__ÚAtlasView.__repr__>   s$   € Ø—.‘.×)Ñ)Ð*¨!¨D¯K©K©?¸!Ð<Ð<r   r   N©r@   Ú
__module__Ú__qualname__Ú__firstlineno__Ú__doc__Ú	__slots__r   r   r    r$   r)   r.   r2   r:   rA   Ú__static_attributes__Ú__classdictcell__©Ú__classdict__s   @r   r   r      sC   ø‡ € ñ
ð €Iò'ò&òò ò!ò ò8ò ÷=ð =r   c                   ó4   a € ] tR t^Bt o RtRtR tR tRtV t	R# )r   a*  An AdjacencyView is a Read-only Map of Maps of Maps.

It is a View into a dict-of-dict-of-dict data structure.
The inner level of dict is read-write. But the
outer levels are read-only.

See Also
========
AtlasView: View into dict-of-dict
MultiAdjacencyView: View into dict-of-dict-of-dict-of-dict
c                ó:   € \        V P                  V,          4      # r   )r   r   ©r   Únames   &&r   r.   ÚAdjacencyView.__getitem__Q   s   € Ü˜Ÿ™ TÕ*Ó+Ð+r   c                ól   € V P                    Uu/ uF  qW,          P                  4       bK  	  up# u upi r   r1   r3   s   & r   r2   ÚAdjacencyView.copyT   r6   r7   © N©
r@   rD   rE   rF   rG   rH   r.   r2   rI   rJ   rK   s   @r   r   r   B   s    ø‡ € ñ
ð €Iò,÷8ð 8r   c                   ó4   a € ] tR t^Xt o RtRtR tR tRtV t	R# )r   a2  An MultiAdjacencyView is a Read-only Map of Maps of Maps of Maps.

It is a View into a dict-of-dict-of-dict-of-dict data structure.
The inner level of dict is read-write. But the
outer levels are read-only.

See Also
========
AtlasView: View into dict-of-dict
AdjacencyView: View into dict-of-dict-of-dict
c                ó:   € \        V P                  V,          4      # r   )r   r   rO   s   &&r   r.   ÚMultiAdjacencyView.__getitem__g   s   € Ü˜TŸ[™[¨Õ.Ó/Ð/r   c                ól   € V P                    Uu/ uF  qW,          P                  4       bK  	  up# u upi r   r1   r3   s   & r   r2   ÚMultiAdjacencyView.copyj   r6   r7   rT   NrU   rK   s   @r   r   r   X   s    ø‡ € ñ
ð €Iò0÷8ð 8r   c                   ó^   a € ] tR t^nt o RtRtR tR tR tR t	R t
R tR tR	 tR
 tRtV tR# )r   aˆ  A read-only union of two atlases (dict-of-dict).

The two dict-of-dicts represent the inner dict of
an Adjacency:  `G.succ[node]` and `G.pred[node]`.
The inner level of dict of both hold attribute key:value
pairs and is read-write. But the outer level is read-only.

See Also
========
UnionAdjacency: View into dict-of-dict-of-dict
UnionMultiAdjacency: View into dict-of-dict-of-dict-of-dict
c                ó6   € R V P                   RV P                  /# ©Ú_succÚ_predr]   r   s   &r   r   ÚUnionAtlas.__getstate__~   ó   € Ø˜Ÿ™ W¨d¯j©jÐ9Ð9r   c                ó>   € VR ,          V n         VR,          V n        R# ©r^   r_   Nr]   r   s   &&r   r   ÚUnionAtlas.__setstate__�   ó   € Ø˜7•^ˆŒ
Ø˜7•^ˆŽ
r   c                ó   € Wn         W n        R # r   r]   ©r   ÚsuccÚpreds   &&&r   r    ÚUnionAtlas.__init__…   s   € ØŒ
ØŽ
r   c                ó†   € \        V P                  P                  4       V P                  P                  4       ,          4      # r   )r#   r^   Úkeysr_   r   s   &r   r$   ÚUnionAtlas.__len__‰   s(   € Ü�4—:‘:—?‘?Ó$ t§z¡z§¡Ó'8Õ8Ó9Ð9r   c                óª   € \        \        V P                  P                  4       4      \        V P                  P                  4       4      ,          4      # r   )r(   Úsetr^   rl   r_   r   s   &r   r)   ÚUnionAtlas.__iter__Œ   s2   € Ü”C˜Ÿ
™
Ÿ™Ó)Ó*¬S°·±·±Ó1BÓ-CÕCÓDÐDr   c                ór   €  V P                   V,          #   \         d    T P                  T,          u # i ; ir   )r^   ÚKeyErrorr_   r,   s   &&r   r.   ÚUnionAtlas.__getitem__�   s2   € ð	#Ø—:‘:˜c•?Ð"øÜô 	#Ø—:‘:˜c•?Ò"ð	#ús   ‚ •6µ6c                ó0  € V P                   P                  4        UUu/ uF  w  rWP                  4       bK  	  pppV P                  P                  4        F6  w  rW9   d   W1,          P	                  V4       K$  VP                  4       W1&   K8  	  V# u uppi r   )r^   Úitemsr2   r_   Úupdate)r   ÚnbrÚddÚresults   &   r   r2   ÚUnionAtlas.copy•   sw   € Ø04·
±
×0@Ñ0@Ô0BÔCÑ0B¡W S�#—w‘w“y’.Ñ0BˆÑCØ—z‘z×'Ñ'Ö)‰GˆCØŒ}Ø•×"Ñ" 2Ö&à Ÿg™g›i�“ñ	 *ð
 ˆùó Ds   žBc                óN   € \        V  Uu/ uF  qW,          bK  	  up4      # u upi r   ©r9   ©r   rw   s   & r   r:   ÚUnionAtlas.__str__ž   ó#   € Ü©dÓ3©d s˜�’N©dÑ3Ó4Ð4ùÒ3ó   Š"c                ól   € V P                   P                   R V P                  : RV P                  : R2# ©r=   z, r>   ©r?   r@   r^   r_   r   s   &r   rA   ÚUnionAtlas.__repr__¡   ó.   € Ø—.‘.×)Ñ)Ð*¨!¨D¯J©J©>¸¸D¿J¹J¹>ÈÐKÐKr   ©r_   r^   Nr]   rC   rK   s   @r   r   r   n   sF   ø‡ € ñð #€Iò:ò$òò:òEò#òò5÷Lð Lr   c                   ó^   a € ] tR t^¥t o RtRtR tR tR tR t	R t
R tR tR	 tR
 tRtV tR# )r   a  A 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
c                ó6   € R V P                   RV P                  /# r]   r]   r   s   &r   r   ÚUnionAdjacency.__getstate__¹   ra   r   c                ó>   € VR ,          V n         VR,          V n        R# rc   r]   r   s   &&r   r   ÚUnionAdjacency.__setstate__¼   re   r   c                ó¬   € \        \        VP                  4       4      \        VP                  4       4      ,          4      ^ 8X  g   Q hWn        W n        R# )é    N)r#   ro   rl   r^   r_   rg   s   &&&r   r    ÚUnionAdjacency.__init__À   s:   € ä”3�t—y‘y“{Ó#¤c¨$¯)©)«+Ó&6Õ6Ó7¸1Ô<Ð<Ð<ØŒ
ØŽ
r   c                ó,   € \        V P                  4      # r   )r#   r^   r   s   &r   r$   ÚUnionAdjacency.__len__Æ   s   € Ü�4—:‘:‹Ðr   c                ó,   € \        V P                  4      # r   )r(   r^   r   s   &r   r)   ÚUnionAdjacency.__iter__É   s   € Ü�D—J‘JÓÐr   c                ó^   € \        V P                  V,          V P                  V,          4      # r   )r   r^   r_   r}   s   &&r   r.   ÚUnionAdjacency.__getitem__Ì   s   € Ü˜$Ÿ*™* S�/¨4¯:©:°c­?Ó;Ð;r   c                ól   € V P                    Uu/ uF  qW,          P                  4       bK  	  up# u upi r   )r^   r2   r3   s   & r   r2   ÚUnionAdjacency.copyÏ   s)   € Ø+/¯:ª:Ó6©: a�4•7—<‘<“>Ò!©:Ñ6Ð6ùÒ6r7   c                óN   € \        V  Uu/ uF  qW,          bK  	  up4      # u upi r   r|   r}   s   & r   r:   ÚUnionAdjacency.__str__Ò   r   r€   c                ól   € V P                   P                   R V P                  : RV P                  : R2# r‚   rƒ   r   s   &r   rA   ÚUnionAdjacency.__repr__Õ   r…   r   r†   Nr]   rC   rK   s   @r   r   r   ¥   sE   ø‡ € ñð" #€Iò:ò$òòò ò<ò7ò5÷Lð Lr   c                   ó4   a € ] tR t^Ùt o RtRtR tR tRtV t	R# )r   a·  A 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
c                ó*  € WP                   9   pWP                  9   pV'       dT   V'       d/   \        V P                   V,          V P                  V,          4      # \        V P                   V,          / 4      # \        / V P                  V,          4      # r   )r^   r_   r   )r   ÚnodeÚin_succÚin_preds   &&  r   r.   ÚUnionMultiInner.__getitem__ê   sk   € ØŸ*™*Ñ$ˆØŸ*™*Ñ$ˆßßÜ! $§*¡*¨TÕ"2°D·J±J¸tÕ4DÓEÐEÜ˜dŸj™j¨Õ.°Ó3Ð3Ü˜"˜dŸj™j¨Õ.Ó/Ð/r   c                óî   € \        V P                  P                  4       4      \        V P                  P                  4       4      ,          pV Uu/ uF  q"W,          P	                  4       bK  	  up# u upi r   )ro   r^   rl   r_   r2   )r   Únodesr4   s   &  r   r2   ÚUnionMultiInner.copyó   sO   € Ü�D—J‘J—O‘OÓ%Ó&¬¨T¯Z©Z¯_©_Ó->Ó)?Õ?ˆÙ+0Ó1©5 a�4•7—<‘<“>Ò!©5Ñ1Ð1ùÒ1s   ÁA2rT   NrU   rK   s   @r   r   r   Ù   s    ø‡ € ñð €Iò0÷2ð 2r   c                   ó.   a € ] tR t^øt o RtRtR tRtV tR# )r	   ar  A 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
c                ó^   € \        V P                  V,          V P                  V,          4      # r   )r   r^   r_   )r   r�   s   &&r   r.   ÚUnionMultiAdjacency.__getitem__  s!   € Ü˜tŸz™z¨$Õ/°·±¸DÕ1AÓBÐBr   rT   N)	r@   rD   rE   rF   rG   rH   r.   rI   rJ   rK   s   @r   r	   r	   ø   s   ø‡ € ñ
ð €I÷Cð Cr   c                   óH   a € ] tR tRt o RtR tR tR tR tR t	R t
R	tV tR
# )r
   i  a  A 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
c                ó   € Wn         W n        R # r   )r   ÚNODE_OK)r   r   r©   s   &&&r   r    ÚFilterAtlas.__init__  s   € ØŒØŽr   c                óZ  a € \        S P                  R 4      '       d   S P                  P                  # \        S P                  R4      '       d?   \        S P                  P                  S P
                  P                  4       ,          4      # \        V 3R lS P
                   4       4      # )Úlengthr¢   c              3   óZ   <"  € T F   pSP                  V4      '       g   K  ^x € K"  	  R# 5i©é   N©r©   ©Ú.0r4   r   s   & €r   Ú	<genexpr>Ú&FilterAtlas.__len__.<locals>.<genexpr>#  ó   øé € Ð=™k˜¨T¯\©\¸!¯_—1’1›kùó   ƒ+¡
+©Úhasattrr©   r¬   r#   r¢   r   rl   Úsumr   s   fr   r$   ÚFilterAtlas.__len__  ós   ø€ ô �4—<‘< ×*Ò*Ø—<‘<×&Ñ&Ð&Ü�4—<‘< ×)Ò)Ü�t—|‘|×)Ñ)¨D¯K©K×,<Ñ,<Ó,>Õ>Ó?Ð?ÜÔ=˜dŸkškÓ=Ó=Ð=r   c                ó   a €  ^\        S P                  P                  4      ,          \        S P                  4      8  pV'       d!   V 3R lS P                  P                   4       # V 3R lS P                   4       #   \         d    Rp LMi ; i)é   Fc              3   óL   <"  € T F  qSP                   9   g   K  Vx € K  	  R # 5ir   r   r±   s   & €r   r³   Ú'FilterAtlas.__iter__.<locals>.<genexpr>+  ó   øé € ÐFÑ1˜!¸$¿+¹+Ñ5E—A’AÓ1ùó   ƒ$š
$c              3   óZ   <"  € T F   pSP                  V4      '       g   K  Vx € K"  	  R # 5ir   r°   r±   s   & €r   r³   r¿   ,  ó   øé € Ð:™;�a¨$¯,©,°q¯/—’›;ùr¶   ©r#   r©   r¢   r   ÚAttributeError©r   Únode_ok_shorters   f r   r)   ÚFilterAtlas.__iter__%  ón   ø€ ð	$Ø¤# d§l¡l×&8Ñ&8Ó"9Õ9¼CÀÇÁÓ<LÑLˆO÷ ÜF˜tŸ|™|×1Ò1ÓFÐFÜ:˜4Ÿ;š;Ó:Ð:øô	 ô 	$Ø#ŠOð	$úó   ƒ<A= Á=BÂBc                ó”   € WP                   9   d+   V P                  V4      '       d   V P                   V,          # \        R V R24      h)úKey ú
 not found)r   r©   rr   r,   s   &&r   r.   ÚFilterAtlas.__getitem__.  s=   € Ø—+‘+Ô $§,¡,¨s×"3Ò"3Ø—;‘;˜sÕ#Ð#Ü˜˜c˜U *Ð-Ó.Ð.r   c                óN   € \        V  Uu/ uF  qW,          bK  	  up4      # u upi r   r|   r}   s   & r   r:   ÚFilterAtlas.__str__3  r   r€   c                ól   € V P                   P                   R V P                  : RV P                  : R2# r‚   )r?   r@   r   r©   r   s   &r   rA   ÚFilterAtlas.__repr__6  s/   € Ø—.‘.×)Ñ)Ð*¨!¨D¯K©K©?¸"¸T¿\¹\Ñ<LÈAÐNÐNr   )r©   r   N©r@   rD   rE   rF   rG   r    r$   r)   r.   r:   rA   rI   rJ   rK   s   @r   r
   r
     s/   ø‡ € ñ
òò>ò;ò/ò
5÷Oð Or   c                   óH   a € ] tR tRt o RtR tR tR tR tR t	R t
R	tV tR
# )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                ó*   € Wn         W n        W0n        R # r   )r   r©   ÚEDGE_OK)r   r   r©   rÖ   s   &&&&r   r    ÚFilterAdjacency.__init__H  s   € ØŒØŒØŽr   c                óZ  a € \        S P                  R 4      '       d   S P                  P                  # \        S P                  R4      '       d?   \        S P                  P                  S P
                  P                  4       ,          4      # \        V 3R lS P
                   4       4      # )r¬   r¢   c              3   óZ   <"  € T F   pSP                  V4      '       g   K  ^x € K"  	  R# 5ir®   r°   r±   s   & €r   r³   Ú*FilterAdjacency.__len__.<locals>.<genexpr>T  rµ   r¶   r·   r   s   fr   r$   ÚFilterAdjacency.__len__M  r»   r   c                ó   a €  ^\        S P                  P                  4      ,          \        S P                  4      8  pV'       d!   V 3R lS P                  P                   4       # V 3R lS P                   4       #   \         d    Rp LMi ; i)r½   Fc              3   óL   <"  € T F  qSP                   9   g   K  Vx € K  	  R # 5ir   r   r±   s   & €r   r³   Ú+FilterAdjacency.__iter__.<locals>.<genexpr>\  rÀ   rÁ   c              3   óZ   <"  € T F   pSP                  V4      '       g   K  Vx € K"  	  R # 5ir   r°   r±   s   & €r   r³   rÞ   ]  rÃ   r¶   rÄ   rÆ   s   f r   r)   ÚFilterAdjacency.__iter__V  rÉ   rÊ   c                ó¼   a a€ SS P                   9   d<   S P                  S4      '       d%   VV 3R  lp\        S P                   S,          V4      # \        RS R24      h)c                 óZ   <€ SP                  V 4      ;'       d    SP                  SV 4      # r   ©r©   rÖ   )rw   r�   r   s   &€€r   Únew_node_okÚ0FilterAdjacency.__getitem__.<locals>.new_node_okb  s%   ø€ Ø—|‘| CÓ(×DÐD¨T¯\©\¸$ÀÓ-DÐDr   rÌ   rÍ   )r   r©   r
   rr   )r   r�   rä   s   ff r   r.   ÚFilterAdjacency.__getitem___  sO   ù€ Ø�4—;‘;Ô 4§<¡<°×#5Ò#5öEô ˜tŸ{™{¨4Õ0°+Ó>Ð>Ü˜˜d˜V :Ð.Ó/Ð/r   c                óN   € \        V  Uu/ uF  qW,          bK  	  up4      # u upi r   r|   r}   s   & r   r:   ÚFilterAdjacency.__str__h  r   r€   c                óŒ   € V P                   P                  pV R V P                  : RV P                  : RV P                  : R2# r‚   )r?   r@   r   r©   rÖ   rO   s   & r   rA   ÚFilterAdjacency.__repr__k  s>   € Ø�~‰~×&Ñ&ˆØ��q˜Ÿ™™ r¨$¯,©,Ñ)9¸¸D¿L¹LÑ;KÈ1ÐMÐMr   )rÖ   r©   r   NrÓ   rK   s   @r   r   r   :  s/   ø‡ € ñòò
>ò;ò0ò5÷Nð Nr   c                   ó0   a € ] tR tRt o RtR tR tRtV tR# )r   ip  a6  A 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              #  óÆ  a "  €  ^\        S P                  P                  4      ,          \        S P                  4      8  pV'       d"   V 3R lS P                  P                   4       pMV 3R lS P                   4       pV FF  pRpS P                  V,           F  pS P                  W54      '       g   K  Rp M	  VRJ g   KB  Vx € KH  	  R#   \         d    Rp Lœi ; i5i)r½   Fc              3   óL   <"  € T F  qSP                   9   g   K  Vx € K  	  R # 5ir   r   r±   s   & €r   r³   Ú,FilterMultiInner.__iter__.<locals>.<genexpr>ƒ  s   øé € ÐJÑ#5˜a¸d¿k¹kÑ9IŸšÓ#5ùrÁ   c              3   óZ   <"  € T F   pSP                  V4      '       g   K  Vx € K"  	  R # 5ir   r°   r±   s   & €r   r³   rî   …  s   øé € ÐB¡;˜a°$·,±,¸q·/Ÿš£;ùr¶   TN)r#   r©   r¢   r   rÅ   rÖ   )r   rÇ   Úmy_nodesr4   Úsome_keys_okr-   s   f     r   r)   ÚFilterMultiInner.__iter__}  s·   øé € ð	$Ø¤# d§l¡l×&8Ñ&8Ó"9Õ9¼CÀÇÁÓ<LÑLˆO÷ ÜJ 4§<¡<×#5Ò#5ÓJ‰HäB 4§;¢;ÓBˆHÛˆAØ ˆLØ—{‘{ 1—~�~�Ø—<‘< ×'Ô'Ø#'�LÙñ &ð ˜tÕ#Ø”ó øô ô 	$Ø#ŠOð	$üs;   ƒC!…<C ÁC!Á	A(C!Â6	C!Ã
C!ÃCÃC!ÃCÃC!c                ó„  a a€ SS P                   9   d    S P                  S4      '       d‰   \        ;QJ d1    VV 3R  lS P                   S,           4       F  '       g   K   RM&	  RM"! VV 3R  lS P                   S,           4       4      '       d%   VV 3R lp\        S P                   S,          V4      # \	        RS R24      h)c              3   óH   <"  € T F  pSP                  SV4      x € K  	  R # 5ir   ©rÖ   )r²   r-   rw   r   s   & €€r   r³   Ú/FilterMultiInner.__getitem__.<locals>.<genexpr>“  s!   øé € ÐGÑ6F¨s�D—L‘L  c×*Ð*Ó6Fùs   ƒ"TFc                 ó(   <€ SP                  SV 4      # r   rõ   )r-   rw   r   s   &€€r   rä   Ú1FilterMultiInner.__getitem__.<locals>.new_node_ok–  s   ø€ Ø—|‘| C¨Ó-Ð-r   rÌ   rÍ   )r   r©   Úanyr
   rr   )r   rw   rä   s   ff r   r.   ÚFilterMultiInner.__getitem__�  s‚   ù€ à�4—;‘;ÔØ—‘˜S×!Ò!ß“ÕG°d·k±kÀ#Ö6FÓG——’ÕG°d·k±kÀ#Ö6FÓG×GÒGö.ô ˜tŸ{™{¨3Õ/°Ó=Ð=Ü˜˜c˜U *Ð-Ó.Ð.r   rT   N)	r@   rD   rE   rF   rG   r)   r.   rI   rJ   rK   s   @r   r   r   p  s   ø‡ € ñ
ò÷$/ð /r   c                   ó*   a € ] tR tRt o RtR tRtV tR# )r   i�  aC  A 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                óÒ   a a€ SS P                   9   dG   S P                  S4      '       d0   VV 3R  lp\        S P                   S,          S P                  V4      # \        RS R24      h)c                 óZ   <€ SP                  V 4      ;'       d    SP                  SW4      # r   rã   )rw   r-   r�   r   s   &&€€r   Úedge_okÚ1FilterMultiAdjacency.__getitem__.<locals>.edge_ok¯  s%   ø€ Ø—|‘| CÓ(×IÐI¨T¯\©\¸$ÀÓ-IÐIr   rÌ   rÍ   )r   r©   r   rr   )r   r�   rþ   s   ff r   r.   Ú FilterMultiAdjacency.__getitem__¬  sU   ù€ Ø�4—;‘;Ô 4§<¡<°×#5Ò#5öJô $ D§K¡K°Õ$5°t·|±|ÀWÓMÐMÜ˜˜d˜V :Ð.Ó/Ð/r   rT   N)r@   rD   rE   rF   rG   r.   rI   rJ   rK   s   @r   r   r   �  s   ø‡ € ñ÷0ð 0r   N)r   r   r   r   r   r   r	   r
   r   r   r   )rG   Úcollections.abcr   Ú__all__r   r   r   r   r   r   r	   r
   r   r   r   rT   r   r   Ú<module>r     sª   ðñõ
 $ò€ô(=�ô (=ôV8�Iô 8ô,8˜ô 8ô,4L�ô 4Lôn1L�Wô 1Lôh2�jô 2ô>C˜.ô Cô&,O�'ô ,Oô^3N�gô 3Nôl*/�ô */ôZ0˜?ö 0r   