File Manager

X7ROOT File Manager

Current Path: /opt/hc_python/lib/python3.12/site-packages/dns

opt / hc_python / lib / python3.12 / site-packages / dns /

ðŸ“ ..
ðŸ“„ __init__.py(1.62 KB)
ðŸ“ __pycache__
ðŸ“„ _asyncbackend.py(2.34 KB)
ðŸ“„ _asyncio_backend.py(8.84 KB)
ðŸ“„ _ddr.py(5.12 KB)
ðŸ“„ _features.py(2.43 KB)
ðŸ“„ _immutable_ctx.py(2.4 KB)
ðŸ“„ _trio_backend.py(8.27 KB)
ðŸ“„ asyncbackend.py(2.73 KB)
ðŸ“„ asyncquery.py(30.1 KB)
ðŸ“„ asyncresolver.py(17.43 KB)
ðŸ“„ dnssec.py(40.74 KB)
ðŸ“ dnssecalgs
ðŸ“„ dnssectypes.py(1.76 KB)
ðŸ“„ e164.py(3.88 KB)
ðŸ“„ edns.py(16.69 KB)
ðŸ“„ entropy.py(4.14 KB)
ðŸ“„ enum.py(3.6 KB)
ðŸ“„ exception.py(5.81 KB)
ðŸ“„ flags.py(2.69 KB)
ðŸ“„ grange.py(2.09 KB)
ðŸ“„ immutable.py(1.97 KB)
ðŸ“„ inet.py(5.64 KB)
ðŸ“„ ipv4.py(2.49 KB)
ðŸ“„ ipv6.py(6.4 KB)
ðŸ“„ message.py(66.59 KB)
ðŸ“„ name.py(41.78 KB)
ðŸ“„ namedict.py(3.91 KB)
ðŸ“„ nameserver.py(9.88 KB)
ðŸ“„ node.py(12.37 KB)
ðŸ“„ opcode.py(2.67 KB)
ðŸ“„ py.typed(0 B)
ðŸ“„ query.py(54.98 KB)
ðŸ“ quic
ðŸ“„ rcode.py(4.06 KB)
ðŸ“„ rdata.py(30.29 KB)
ðŸ“„ rdataclass.py(2.91 KB)
ðŸ“„ rdataset.py(16.27 KB)
ðŸ“„ rdatatype.py(7.27 KB)
ðŸ“ rdtypes
ðŸ“„ renderer.py(10.99 KB)
ðŸ“„ resolver.py(72 KB)
ðŸ“„ reversename.py(3.74 KB)
ðŸ“„ rrset.py(8.96 KB)
ðŸ“„ serial.py(3.52 KB)
ðŸ“„ set.py(9 KB)
ðŸ“„ tokenizer.py(23.03 KB)
ðŸ“„ transaction.py(22.06 KB)
ðŸ“„ tsig.py(11.15 KB)
ðŸ“„ tsigkeyring.py(2.57 KB)
ðŸ“„ ttl.py(2.91 KB)
ðŸ“„ update.py(11.96 KB)
ðŸ“„ version.py(1.88 KB)
ðŸ“„ versioned.py(11.49 KB)
ðŸ“„ win32util.py(8.67 KB)
ðŸ“„ wire.py(2.76 KB)
ðŸ“„ xfr.py(12.96 KB)
ðŸ“„ zone.py(50.87 KB)
ðŸ“„ zonefile.py(27.27 KB)
ðŸ“„ zonetypes.py(690 B)

Editing: 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"""

# pylint seems to be confused about this one!
from collections.abc import MutableMapping  # pylint: disable=no-name-in-module

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 *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*.
        """

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)

X7ROOT File Manager

Editing: namedict.py

Upload File

Create Folder