public synchronized boolean put(long fp){
  int index=(int)(fp & this.mask);
  long[] list=this.table[index];
  if (list != null) {
    int listlen=list.length;
    for (int i=0; i < listlen; i++) {
      if (list[i] == fp)       return true;
    }
  }
  if (count >= threshold) {
    rehash();
    index=(int)(fp & this.mask);
    list=this.table[index];
  }
  int len=(list == null ? 0 : list.length);
  long[] newList=new long[len + 1];
  if (list != null)   System.arraycopy(list,0,newList,0,len);
  newList[len]=fp;
  this.table[index]=newList;
  this.count++;
  return false;
}

public synchronized boolean put ( long fp ) { int index = ( int ) ( fp & this . mask ) ; long [ ] list = this . table [ index ] ; if ( list != null ) { int listlen = list . length ; for ( int i = 0 ; i < listlen ; i ++ ) { if ( list [ i ] == fp ) return true ; } } if ( count >= threshold ) { rehash ( ) ; index = ( int ) ( fp & this . mask ) ; list = this . table [ index ] ; } int len = ( list == null ? 0 : list . length ) ; long [ ] newList = new long [ len + 1 ] ; if ( list != null ) System . arraycopy ( list , 0 , newList , 0 , len ) ; newList [ len ] = fp ; this . table [ index ] = newList ; this . count ++ ; return false ; }
tests if the specified fingerprint is in this set . as a side effect , updates the set to contain the fingerprint .
