def _inner_delitem(self, j, k):
found, s = self._find_slot(j, k)
if not found:
raise KeyError('Key Error: ' + repr(k))
self._table[s] = HashMapTwo._AVAIL # 删除标记
def __iter__(self):
for j in range(len(self._table)):
if not self._is_available(j):
yield self._table[j].key
--------------------------------------------------------------------------------
参考《数据结构与算法Python语言实现》
Linux公社的RSS地址:https://www.linuxidc.com/rssFeed.aspx