Gecko [ v99win.today ]

Name	Size	Permission
__pycache__	[ DIR ]	drwxr-xr-x
rdtypes	[ DIR ]	drwxr-xr-x
__init__.py	1.56 KB	-rw-r--r--
_asyncbackend.py	1.53 KB	-rw-r--r--
_asyncio_backend.py	4.34 KB	-rw-r--r--
_curio_backend.py	3.33 KB	-rw-r--r--
_immutable_attr.py	2.92 KB	-rw-r--r--
_immutable_ctx.py	2.4 KB	-rw-r--r--
_trio_backend.py	3.68 KB	-rw-r--r--
asyncbackend.py	3 KB	-rw-r--r--
asyncquery.py	17.4 KB	-rw-r--r--
asyncresolver.py	8.71 KB	-rw-r--r--
dnssec.py	19.19 KB	-rw-r--r--
e164.py	3.6 KB	-rw-r--r--
edns.py	10.72 KB	-rw-r--r--
entropy.py	4.07 KB	-rw-r--r--
enum.py	2.75 KB	-rw-r--r--
exception.py	5.13 KB	-rw-r--r--
flags.py	2.58 KB	-rw-r--r--
grange.py	2.04 KB	-rw-r--r--
immutable.py	1.97 KB	-rw-r--r--
inet.py	4.74 KB	-rw-r--r--
ipv4.py	1.93 KB	-rw-r--r--
ipv6.py	5.92 KB	-rw-r--r--
message.py	52.73 KB	-rw-r--r--
name.py	31.54 KB	-rw-r--r--
namedict.py	3.83 KB	-rw-r--r--
node.py	6.42 KB	-rw-r--r--
opcode.py	2.58 KB	-rw-r--r--
py.typed	0 B	-rw-r--r--
query.py	40.46 KB	-rw-r--r--
rcode.py	3.9 KB	-rw-r--r--
rdata.py	24.32 KB	-rw-r--r--
rdataclass.py	2.81 KB	-rw-r--r--
rdataset.py	14.54 KB	-rw-r--r--
rdatatype.py	6.64 KB	-rw-r--r--
renderer.py	8.59 KB	-rw-r--r--
resolver.py	59.29 KB	-rw-r--r--
reversename.py	3.65 KB	-rw-r--r--
rrset.py	7.44 KB	-rw-r--r--
serial.py	3.53 KB	-rw-r--r--
set.py	7.64 KB	-rw-r--r--
tokenizer.py	21.86 KB	-rw-r--r--
transaction.py	16.93 KB	-rw-r--r--
tsig.py	10.93 KB	-rw-r--r--
tsigkeyring.py	2.43 KB	-rw-r--r--
ttl.py	2.58 KB	-rw-r--r--
update.py	10.55 KB	-rw-r--r--
version.py	1.55 KB	-rw-r--r--
versioned.py	15.91 KB	-rw-r--r--
wire.py	2.48 KB	-rw-r--r--
xfr.py	11.61 KB	-rw-r--r--
zone.py	34.25 KB	-rw-r--r--
zonefile.py	15.25 KB	-rw-r--r--

Code Editor : namedict.py

# Copyright (C) Dnspython Contributors, see LICENSE for text of ISC license

# Copyright (C) 2003-2017 Nominum, Inc.
# Copyright (C) 2016 Coresec Systems AB
#
# Permission to use, copy, modify, and distribute this software and its
# documentation for any purpose with or without fee is hereby granted,
# provided that the above copyright notice and this permission notice
# appear in all copies.
#
# THE SOFTWARE IS PROVIDED "AS IS" AND NOMINUM DISCLAIMS ALL WARRANTIES
# WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
# MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL NOMINUM BE LIABLE FOR
# ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
# WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
# ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT
# OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
#
# THE SOFTWARE IS PROVIDED "AS IS" AND CORESEC SYSTEMS AB DISCLAIMS ALL
# WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED
# WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL CORESEC
# SYSTEMS AB BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR
# CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS
# OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT,
# NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION
# WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.

"""DNS name dictionary"""

from collections.abc import MutableMapping

import dns.name

class NameDict(MutableMapping):
    """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.
    """

__slots__ = ["max_depth", "max_depth_items", "__store"]

def __init__(self, *args, **kwargs):
        super().__init__()
        self.__store = dict()
        #: the maximum depth of the keys that have ever been added
        self.max_depth = 0
        #: the number of items of maximum depth
        self.max_depth_items = 0
        self.update(dict(*args, **kwargs))

def __update_max_depth(self, key):
        if len(key) == self.max_depth:
            self.max_depth_items = self.max_depth_items + 1
        elif len(key) > self.max_depth:
            self.max_depth = len(key)
            self.max_depth_items = 1

def __getitem__(self, key):
        return self.__store[key]

def __setitem__(self, key, value):
        if not isinstance(key, dns.name.Name):
            raise ValueError('NameDict key must be a name')
        self.__store[key] = value
        self.__update_max_depth(key)

def __delitem__(self, key):
        self.__store.pop(key)
        if len(key) == self.max_depth:
            self.max_depth_items = self.max_depth_items - 1
        if self.max_depth_items == 0:
            self.max_depth = 0
            for k in self.__store:
                self.__update_max_depth(k)

def __iter__(self):
        return iter(self.__store)

def __len__(self):
        return len(self.__store)

def has_key(self, key):
        return key in self.__store

def get_deepest_match(self, name):
        """Find the deepest match to *fname* 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*.
        """

depth = len(name)
        if depth > self.max_depth:
            depth = self.max_depth
        for i in range(-depth, 0):
            n = dns.name.Name(name[i:])
            if n in self:
                return (n, self[n])
        v = self[dns.name.empty]
        return (dns.name.empty, v)

${this.title}

Code Editor : namedict.py