class_docstr: HashMap Data Type
  HashMap() Create a new, empty map. It returns an empty map collection.
  put(key, val) Add a new key-value pair to the map. If the key is already in the map then replace
                  the old value with the new value.
  get(key) Given a key, return the value stored in the map or None otherwise.
  del_(key) or del map[key] Delete the key-value pair from the map using a statement of the form del map[key].
  len() Return the number of key-value pairs stored in the map.
  in Return True for a statement of the form key in map, if the given key is in the map, False otherwise.
class_docstr_tok: ["HashMap","Data","Type","HashMap","(",")","Create","a","new",",","empty","map",".","It","returns","an","empty","map","collection",".","put","(","key",",","val",")","Add","a","new","key-value","pair","to","the","map",".","If","the","key","is","already","in","the","map","then","replace","the","old","value","with","the","new","value",".","get","(","key",")","Given","a","key",",","return","the","value","stored","in","the","map","or","None","otherwise",".","del_","(","key",")","or","del","map","[","key","]","Delete","the","key-value","pair","from","the","map","using","a","statement","of","the","form","del","map","[","key","]",".","len","(",")","Return","the","number","of","key-value","pairs","stored","in","the","map",".","in","Return","True","for","a","statement","of","the","form","key","in","map",",","if","the","given","key","is","in","the","map",",","False","otherwise","."]
docstr: linear probing
docstr_tok: ["linear","probing"]
code: def _rehash(self, old_hash):
      """
      linear probing
      """
      return (old_hash + 1) % self.size
  
file_path: keon-algos/algorithms/map/hashtable.py
label_desc: Use image node_id 6 for calling the HashTable obj's underlying member method code with example usage: obj._rehash(old_hash) and returns: unknown