| Home | Trees | Indices | Help | 
 | 
|---|
|  | 
       object --+            
                |            
    _abcoll.Sized --+        
                    |        
       object --+   |        
                |   |        
 _abcoll.Iterable --+        
                    |        
       object --+   |        
                |   |        
_abcoll.Container --+        
                    |        
      _abcoll.Mapping --+    
                        |    
   _abcoll.MutableMapping --+
                            |
                           NameDict
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.
| 
 | |||
| Inherited from  | |||
| 
 | |||
| 
 | |||
| 
 | |||
| 
 | |||
| 
 | |||
| 
 | |||
| 
 | |||
| 
 | |||
| 
 | |||
| 
 | |||
| Inherited from  Inherited from  Inherited from  | |||
| 
 | |||
| Inherited from  | |||
| 
 | |||
| __store | |||
| max_depth | |||
| max_depth_items | |||
| Inherited from  | |||
| 
 | |||
| 
 x.__init__(...) initializes x; see help(type(x)) for signature 
 | 
| 
 
 | 
| 
 
 | 
| 
 
 | 
| 
 
 | 
| 
 
 | 
| 
 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*. | 
| Home | Trees | Indices | Help | 
 | 
|---|
| Generated by Epydoc 3.0.1 on Sat Dec 8 10:59:55 2018 | http://epydoc.sourceforge.net |