miasm2.core.utils.BoundedDict Class Reference

Inheritance diagram for miasm2.core.utils.BoundedDict:

Collaboration diagram for miasm2.core.utils.BoundedDict:

Public Member Functions
def	__init__
def	__setitem__
def	__contains__
def	has_key
def	keys
def	data
def	__getitem__
def	__delitem__
def	__del__

Private Attributes
	_data
	_min_size
	_max_size
	_size
	_counter
	_delete_cb

Detailed Description

Limited in size dictionnary.

To reduce combinatory cost, once an upper limit @max_size is reached,
@max_size - @min_size elements are suppressed.
The targeted elements are the less accessed.

One can define a callback called when an element is removed

Definition at line 55 of file utils.py.

Constructor & Destructor Documentation

def miasm2.core.utils.BoundedDict.__init__	(		self,
			max_size,
			min_size = None,
			initialdata = None,
			delete_cb = None
	)

Create a BoundedDict
@max_size: maximum size of the dictionnary
@min_size: (optional) number of most used element to keep when resizing
@initialdata: (optional) dict instance with initial data
@delete_cb: (optional) callback called when an element is removed

Definition at line 66 of file utils.py.

                 delete_cb=None):
        """Create a BoundedDict
        @max_size: maximum size of the dictionnary
        @min_size: (optional) number of most used element to keep when resizing
        @initialdata: (optional) dict instance with initial data
        @delete_cb: (optional) callback called when an element is removed
        """
        self._data = initialdata.copy() if initialdata else {}
        self._min_size = min_size if min_size else max_size / 3
        self._max_size = max_size
        self._size = len(self._data)
        # Do not use collections.Counter as it is quite slow
        self._counter = {k: 1 for k in self._data}
        self._delete_cb = delete_cb