comefrom: <awangdev>[tool]. Hash Function_1.java
code: public int hashCode(char[] key, int HASH_SIZE) {
          if (key.length == 0) {
              return 0;
          }
          long hashRst = 0;
          for (int i = 0; i < key.length ; i++) {
              hashRst = hashRst * 33 + (int)(key[i]);
              hashRst = hashRst % HASH_SIZE;
          }
          return (int)hashRst;
      }
masked: public int sample_funcname ( char [ ] var_0 , int var_1 ) {
    if ( var_0 . length == 0 ) {
      return 0 ;
    }
    long var_4 = 0 ;
    for ( int var_5 = 0 ;
    var_5 < var_0 . length ;
    var_5 ++ ) {
      var_4 = var_4 * 33 + ( int ) ( var_0 [ var_5 ] ) ;
      var_4 = var_4 % var_1 ;
    }
    return ( int ) var_4 ;
  }
  