pyGoEdge-UserPanel/.venv/Lib/site-packages/dns/__pycache__/namedict.cpython-312.pyc

<EFBFBD>
g<>
i<><00><00>2<00>dZd
dl
mZ
d
dlZGd<04>de<02>Zy)zDNS name dictionary<72>)
<01>MutableMappingNc<00>Z<00><00>eZ
dZd
Zgd<02>
Z<04>f
d<03>Zd<04>Zd<05>Zd<06>Zd<07>Z	d<08>Z
d	<09>Zd
<EFBFBD>Zd<0B>Z
<0A>x
ZS)<0C>NameDictz<74>A dictionary whose keys are dns.name.Name objects.

    In addition to being like a regular Python dictionary, this
    dictionary can also get the deepest match for a given key.
    )<03>	max_depth<74>max_depth_items<6D>__storec
<00><><00>
<01>t<00>|<00><00>
t<00>|_d
|_d
|_|j
t|
i|<02>
<01>
<01>

y)Nr)<07>super<65>__init__<5F>dict<63>_NameDict__storerr<00>update)<04>self<6C>args<67>kwargs<67>	__class__s   <20><>;E:\Project\pygoedge\.venv\Lib\site-packages\dns/namedict.pyrzNameDict.__init__-s<<00><><00>
<0A><07><18><1A><1B>v<EFBFBD><04><0C><1A><04><0E> <20><04><1C><0C><0B><0B>D<EFBFBD>$<24>)<29>&<26>)<29>*<2A>c<00><><00>t
|
<01>
|jk(r|jd
z|_yt
|
<01>
|jkDrt
|
<01>
|_
d
|_yy)N<>
)<03>lenrr<00>r<00>keys  r<00>__update_max_depthzNameDict.__update_max_depth6sM<00><00><0E>s<EFBFBD>8<EFBFBD>t<EFBFBD>~<7E>~<7E>%<25>#'<27>#7<>#7<>!<21>#;<3B>D<EFBFBD> <20>
<10><13>X<EFBFBD><04><0E><0E>
&<26> <20><13>X<EFBFBD>D<EFBFBD>N<EFBFBD>#$<24>D<EFBFBD> <20>'rc<00> <00>|j|
S<00>
N<>
r
rs  r<00>__getitem__zNameDict.__getitem__=s<00><00><13>|<7C>|<7C>C<EFBFBD> <20> rc<00><><00>t
|
tjj<00>st	d
<01>
<00>
||j
|
<|j
|
<01>

y)NzNameDict key must be a name)<07>
isinstance<EFBFBD>dns<6E>name<6D>Name<6D>
ValueErrorr
<00>_NameDict__update_max_depth)rr<00>values   r<00>__setitem__zNameDict.__setitem__@s<<00><00><19>#<23>s<EFBFBD>x<EFBFBD>x<EFBFBD>}<7D>}<7D>-<2D><1C>:<3A>;<3B>;<3B>!<21><04><0C><0C>S<EFBFBD><19><0C><1F><1F><03>$rc<00>
<00>|jj|
<01>

t|
<01>
|jk(r|jd
z
|_|jdk(r*d|_|jD]}|j|<02>

<00>yy)Nrr)r
<00>poprrrr%)rr<00>
ks   r<00>__delitem__zNameDict.__delitem__Fsm<00><00><0C><0C><0C><18><18><13><1D><0E>s<EFBFBD>8<EFBFBD>t<EFBFBD>~<7E>~<7E>%<25>#'<27>#7<>#7<>!<21>#;<3B>D<EFBFBD> <20><0F><1F><1F>1<EFBFBD>$<24><1E>D<EFBFBD>N<EFBFBD><19>\<5C>\<5C>
<01><14>'<27>'<27>
<01>*<2A>"<22>%rc
<00>,<00>t
|j<00>
Sr)<02>iterr
<00>
rs
 r<00>__iter__zNameDict.__iter__Os<00><00><13>D<EFBFBD>L<EFBFBD>L<EFBFBD>!<21>!rc
<00>,<00>t
|j<00>
Sr)rr
r.s
 r<00>__len__zNameDict.__len__Rs<00><00><12>4<EFBFBD><<3C><<3C> <20> rc<00><00>|
|jvSrrrs  r<00>has_keyzNameDict.has_keyUs<00><00><12>d<EFBFBD>l<EFBFBD>l<EFBFBD>"<22>"rc<00>B
<00>t
|
<01>
}||jkDr|j}t|d
<01>D]1}tjj|
|d<00>
}||vs
<01>*|||fc
S|tjj}tjj|fS)a<>
Find the deepest match to *name* in the dictionary.

        The deepest match is the longest name in the dictionary which is
        a superdomain of *name*.  Note that *superdomain* includes matching
        *name* itself.

        *name*, a ``dns.name.Name``, the name to find.

        Returns a ``(key, value)`` where *key* is the deepest
        ``dns.name.Name``, and *value* is the value associated with *key*.
        rN)rr<00>ranger!r"r#<00>empty)rr"<00>depth<74>
i<>
n<>
vs      r<00>get_deepest_matchzNameDict.get_deepest_matchXs<><00><00><14>D<EFBFBD>	<09><05><10>4<EFBFBD>><3E>><3E>!<21><18>N<EFBFBD>N<EFBFBD>E<EFBFBD><16><05>v<EFBFBD>q<EFBFBD>!<21>A<EFBFBD><13><08><08>
<0A>
<0A>d<EFBFBD>1<EFBFBD>2<EFBFBD>h<EFBFBD>'<27>A<EFBFBD><10>D<EFBFBD>y<EFBFBD><19>4<EFBFBD>
<01>7<EFBFBD>|<7C>#<23>"<22>
<11><13><18><18><1E><1E> <20>
<01><13><08><08><0E><0E>
<01>"<22>"r)<0F>__name__<5F>
__module__<EFBFBD>__qualname__<5F>__doc__<5F>	__slots__rr%rr'r+r/r1r3r;<00>
__classcell__)
rs
@rrr$s<<00><><00><08><<3C>I<EFBFBD>+<2B>%<25>
!<21>%<25>+<2B>
"<22>
!<21>
#<23>#rr)r?<00>collections.abcr<00>dns.namer!r<00>rr<00><module>rE
s <00>


<01>8
<1A>
+<2B><0F>I

#<23>~<7E>I

#r