Gecko [ v3.cesa.co.za ]

Name	Size	Permission	Date
__pycache__	[ DIR ]	drwxr-xr-x	2026-06-08 18:08
rdtypes	[ DIR ]	drwxr-xr-x	2026-06-08 18:08
LICENSE	1.49 KB	-rw-r--r--	1980-01-01 08:00
__init__.py	1.37 KB	-rw-r--r--	1980-01-01 08:00
_compat.py	1.47 KB	-rw-r--r--	1980-01-01 08:00
dnssec.py	16.12 KB	-rw-r--r--	1980-01-01 08:00
e164.py	3.67 KB	-rw-r--r--	1980-01-01 08:00
edns.py	7.25 KB	-rw-r--r--	1980-01-01 08:00
entropy.py	4.66 KB	-rw-r--r--	1980-01-01 08:00
exception.py	4.76 KB	-rw-r--r--	1980-01-01 08:00
flags.py	2.86 KB	-rw-r--r--	1980-01-01 08:00
grange.py	2.01 KB	-rw-r--r--	1980-01-01 08:00
hash.py	1.29 KB	-rw-r--r--	1980-01-01 08:00
inet.py	3.3 KB	-rw-r--r--	1980-01-01 08:00
ipv4.py	2.05 KB	-rw-r--r--	1980-01-01 08:00
ipv6.py	5.4 KB	-rw-r--r--	1980-01-01 08:00
message.py	40.49 KB	-rw-r--r--	1980-01-01 08:00
name.py	30.53 KB	-rw-r--r--	1980-01-01 08:00
namedict.py	3.87 KB	-rw-r--r--	1980-01-01 08:00
node.py	6.2 KB	-rw-r--r--	1980-01-01 08:00
opcode.py	2.77 KB	-rw-r--r--	1980-01-01 08:00
query.py	23.14 KB	-rw-r--r--	1980-01-01 08:00
rcode.py	3.53 KB	-rw-r--r--	1980-01-01 08:00
rdata.py	14.11 KB	-rw-r--r--	1980-01-01 08:00
rdataclass.py	3.14 KB	-rw-r--r--	1980-01-01 08:00
rdataset.py	11.19 KB	-rw-r--r--	1980-01-01 08:00
rdatatype.py	5.78 KB	-rw-r--r--	1980-01-01 08:00
renderer.py	10.57 KB	-rw-r--r--	1980-01-01 08:00
resolver.py	49.03 KB	-rw-r--r--	1980-01-01 08:00
reversename.py	3.21 KB	-rw-r--r--	1980-01-01 08:00
rrset.py	6.01 KB	-rw-r--r--	1980-01-01 08:00
set.py	7.14 KB	-rw-r--r--	1980-01-01 08:00
tokenizer.py	17.62 KB	-rw-r--r--	1980-01-01 08:00
tsig.py	7.63 KB	-rw-r--r--	1980-01-01 08:00
tsigkeyring.py	1.77 KB	-rw-r--r--	1980-01-01 08:00
ttl.py	2.29 KB	-rw-r--r--	1980-01-01 08:00
update.py	10.1 KB	-rw-r--r--	1980-01-01 08:00
version.py	1.37 KB	-rw-r--r--	1980-01-01 08:00
wiredata.py	3.66 KB	-rw-r--r--	1980-01-01 08:00
zone.py	41.39 KB	-rw-r--r--	1980-01-01 08:00

Rename

# 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"""

import collections
import dns.name
from ._compat import xrange

class NameDict(collections.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(NameDict, self).__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):
        value = self.__store.pop(key)
        if len(value) == 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 xrange(-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)