public synchronized String unipoint(String key){
  if (key == null)   return null;
  StringSetry tab[]=table;
  int hash=key.hashCode();
  int index=(hash & Integer.MAX_VALUE) % tab.length;
  for (StringSetry e=tab[index]; e != null; e=e.next) {
    if ((e.hash == hash) && CompareUtil.equals(e.key,key)) {
      return e.key;
    }
  }
  if (count >= threshold) {
    rehash();
    tab=table;
    index=(hash & Integer.MAX_VALUE) % tab.length;
  }
  StringSetry e=new StringSetry(hash,key,tab[index]);
  tab[index]=e;
  count++;
  return key;
}

public synchronized String unipoint ( String key ) { if ( key == null ) return null ; StringSetry tab [ ] = table ; int hash = key . hashCode ( ) ; int index = ( hash & Integer . MAX_VALUE ) % tab . length ; for ( StringSetry e = tab [ index ] ; e != null ; e = e . next ) { if ( ( e . hash == hash ) && CompareUtil . equals ( e . key , key ) ) { return e . key ; } } if ( count >= threshold ) { rehash ( ) ; tab = table ; index = ( hash & Integer . MAX_VALUE ) % tab . length ; } StringSetry e = new StringSetry ( hash , key , tab [ index ] ) ; tab [ index ] = e ; count ++ ; return key ; }
add a key to stringset and return hashcode of the key
