Gecko [ dallasfobana2023.variationbd.com ]

Name	Size	Permission
__pycache__	[ DIR ]	drwxr-xr-x
rdtypes	[ DIR ]	drwxr-xr-x
__init__.py	1.3 KB	-rw-r--r--
_compat.py	1.28 KB	-rw-r--r--
dnssec.py	14.44 KB	-rw-r--r--
e164.py	3.07 KB	-rw-r--r--
edns.py	4.28 KB	-rw-r--r--
entropy.py	4.36 KB	-rw-r--r--
exception.py	4.52 KB	-rw-r--r--
flags.py	2.6 KB	-rw-r--r--
grange.py	1.93 KB	-rw-r--r--
hash.py	1.07 KB	-rw-r--r--
inet.py	3.17 KB	-rw-r--r--
ipv4.py	1.98 KB	-rw-r--r--
ipv6.py	5.17 KB	-rw-r--r--
message.py	42.12 KB	-rw-r--r--
name.py	28.74 KB	-rw-r--r--
namedict.py	3.59 KB	-rw-r--r--
node.py	5.91 KB	-rw-r--r--
opcode.py	2.48 KB	-rw-r--r--
query.py	19.18 KB	-rw-r--r--
rcode.py	3.03 KB	-rw-r--r--
rdata.py	14.65 KB	-rw-r--r--
rdataclass.py	3.18 KB	-rw-r--r--
rdataset.py	11.29 KB	-rw-r--r--
rdatatype.py	5.21 KB	-rw-r--r--
renderer.py	11.64 KB	-rw-r--r--
resolver.py	50.88 KB	-rw-r--r--
reversename.py	3.23 KB	-rw-r--r--
rrset.py	5.85 KB	-rw-r--r--
set.py	7.53 KB	-rw-r--r--
tokenizer.py	17.88 KB	-rw-r--r--
tsig.py	7.54 KB	-rw-r--r--
tsigkeyring.py	1.7 KB	-rw-r--r--
ttl.py	2.23 KB	-rw-r--r--
update.py	9.78 KB	-rw-r--r--
version.py	1.23 KB	-rw-r--r--
wiredata.py	3.64 KB	-rw-r--r--
zone.py	39.09 KB	-rw-r--r--

Code Editor : namedict.py

# Copyright (C) 2003-2007, 2009-2011 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.
    @ivar max_depth: the maximum depth of the keys that have ever been
    added to the dictionary.
    @type max_depth: int
    @ivar max_depth_items: the number of items of maximum depth
    @type max_depth_items: int
    """

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

def __init__(self, *args, **kwargs):
        self.__store = dict()
        self.max_depth = 0
        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 I{name} in the dictionary.

The deepest match is the longest name in the dictionary which is
        a superdomain of I{name}.

@param name: the name
        @type name: dns.name.Name object
        @rtype: (key, value) tuple
        """

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)

${this.title}

Code Editor : namedict.py