(self, key, depth=0)
return ret_hash
Recursively computes a hash
Recursively computes a hash
Recursively computes a hash
def get_hash(self, key, depth=0):
        """
        Recursively computes a hash
        """
        ret_hash = self.before(key)
        if type(key) is int:
            return self.hash_int(key)
        if type(key) is str and len(key) <= 1:
            return self.hash_char(key)
        for v in list(key):
            ret_hash = self.join(ret_hash, self.get_hash(v, depth + 1)) % self.modulo
        if depth == 0:
            ret_hash = self.after(key, ret_hash)
        return ret_hash
def get_hash ( self , key , depth = 0 ) : ret_hash = self . before ( key ) if type ( key ) is int : return self . hash_int ( key ) if type ( key ) is str and len ( key ) <= 1 : return self . hash_char ( key ) for v in list ( key ) : ret_hash = self . join ( ret_hash , self . get_hash ( v , depth + 1 ) ) % self . modulo if depth == 0 : ret_hash = self . after ( key , ret_hash ) return ret_hash