dsap.mapping.probe_hash_map.ProbeHashMap

class documentation

class ProbeHashMap(HashMapBase):

Hash map implemented with linear probing for collision resolution.

Method	`__iter__`	Undocumented
Method	`_bucket_delitem`	Undocumented
Method	`_bucket_getitem`	Undocumented
Method	`_bucket_setitem`	Undocumented
Method	`_find_slot`	Search for key k in bucket at index j.
Method	`_is_available`	Return True if index j is available in table.
Constant	`_AVAIL`	Undocumented

Inherited from HashMapBase:

Method	`__delitem__`	Undocumented
Method	`__getitem__`	Undocumented
Method	`__init__`	Create an empty hash-table map.
Method	`__len__`	Undocumented
Method	`__setitem__`	Undocumented
Method	`_hash_function`	Undocumented
Method	`_resize`	Resize bucket array to capacity c and rehash all items.
Instance Variable	`_n`	Undocumented
Instance Variable	`_prime`	Undocumented
Instance Variable	`_scale`	Undocumented
Instance Variable	`_shift`	Undocumented
Instance Variable	`_table`	Undocumented

Inherited from MapBase (via HashMapBase):

Class _Item Lightweight composite to store key-value pairs as map items.

def __iter__(self): ¶

Undocumented

def _bucket_delitem(self, j, k): ¶

Undocumented

def _bucket_getitem(self, j, k): ¶

Undocumented

def _bucket_setitem(self, j, k, v): ¶

Undocumented

def _find_slot(self, j, k): ¶

Search for key k in bucket at index j.

Return (success, index) tuple, described as follows: If match was found, success is True and index denotes its location. If no match found, success is False and index denotes first available slot.

def _is_available(self, j): ¶

Return True if index j is available in table.

_AVAIL = ¶

Undocumented

Value

object()