def rehashing(self): survivor_values = [value for value in self.values if value is not None] self.size_table = next_prime(self.size_table, factor=2) self._keys.clear() # hell's pointers D: don't DRY ;/ self.values = [None] * self.size_table map(self.insert_data, survivor_values)
def __hash_function_2(self, value, data): next_prime_gt = ( next_prime(value % self.size_table) if not check_prime(value % self.size_table) else value % self.size_table ) # gt = bigger than return next_prime_gt - (data % next_prime_gt)
def __hash_function_2(self, value, data): next_prime_gt = next_prime(value % self.size_table) \ if not check_prime(value % self.size_table) else value % self.size_table #gt = bigger than return next_prime_gt - (data % next_prime_gt)
def rehashing(self): survivor_values = [value for value in self.values if value is not None] self.size_table = next_prime(self.size_table, factor=2) self._keys.clear() self.values = [None] * self.size_table #hell's pointers D: don't DRY ;/ map(self.insert_data, survivor_values)