Inheritance diagram for python.utils.TreeDict:

Collaboration diagram for python.utils.TreeDict:

Public Member Functions
def	__init__ (self, dic={}, key_wrapper=None)

def	__missing__ (self, key, wrap=True)

def	__setitem__ (self, key, value, wrap=True)

def	to_dict (self)

def	__repr__ (self, level=0)

Public Attributes
	default_factory

	key_wrapper

Private Member Functions
def	_repr_pretty_ (self, p, cycle)

Detailed Description

Definition at line 22 of file Reconstruction/RecExample/RecExOnline/python/utils.py.

Constructor & Destructor Documentation

◆ init()

def python.utils.TreeDict.__init__	(	self,
		dic = `{}`,
		key_wrapper = `None`
	)

Definition at line 23 of file Reconstruction/RecExample/RecExOnline/python/utils.py.

     def __init__(self, dic = {}, key_wrapper=None):
         super(defaultdict,self).__init__(dic)
         self.default_factory = tree(key_wrapper)
         self.key_wrapper = key_wrapper

Member Function Documentation

◆ missing()

def python.utils.TreeDict.__missing__	(	self,
		key,
		wrap = `True`
	)

Definition at line 27 of file Reconstruction/RecExample/RecExOnline/python/utils.py.

     def __missing__(self, key, wrap=True):
         if self.default_factory is None: raise KeyError((key,))
         if wrap and self.key_wrapper:
             key = self.key_wrapper(key)
             if len(key) == 1:
                 return self.__missing__(key[0], wrap=False)
             else:
                 return self[key[0]][key[1]]
         self[key] = value = self.default_factory()
         return value

◆ repr()

def python.utils.TreeDict.__repr__	(	self,
		level = `0`
	)

Definition at line 48 of file Reconstruction/RecExample/RecExOnline/python/utils.py.

     def __repr__(self, level=0):
         ret = u''
         items = list(self.items())
         len_key = 0
         for i, (key, val) in enumerate(items):
             LS = BRANCH if i < len(items)-1 else TAIL
             ret += SPACE(' '*len_key)*level + LS(key.ljust(len_key)) + '\n'
             if isinstance(val, TreeDict):
                 ret += val.__repr__(level+1)
             else:
                 ret += SPACE(' '*len_key)*(level+1) + LS(str(val).ljust(len_key)) + '\n' 
         return ret

◆ setitem()

def python.utils.TreeDict.__setitem__	(	self,
		key,
		value,
		wrap = `True`
	)

Definition at line 37 of file Reconstruction/RecExample/RecExOnline/python/utils.py.

     def __setitem__(self, key, value, wrap=True):
         if wrap and self.key_wrapper:
             key = self.key_wrapper(key)
             if len(key) == 1:
                 self.__setitem__(key[0], value, wrap=False)
             else:
                 self[key[0]][key[1]] = value
         else:
             super(defaultdict, self).__setitem__(key, value)