public HashDocSet(int[] docs,int offset,int len,float inverseLoadFactor){
  int tsize=Math.max(BitUtil.nextHighestPowerOfTwo(len),1);
  if (tsize < len * inverseLoadFactor) {
    tsize<<=1;
  }
  mask=tsize - 1;
  table=new int[tsize];
  for (int i=tsize - 1; i >= 0; i--)   table[i]=EMPTY;
  int end=offset + len;
  for (int i=offset; i < end; i++) {
    put(docs[i]);
  }
  size=len;
}

public HashDocSet ( int [ ] docs , int offset , int len , float inverseLoadFactor ) { int tsize = Math . max ( BitUtil . nextHighestPowerOfTwo ( len ) , 1 ) ; if ( tsize < len * inverseLoadFactor ) { tsize <<= 1 ; } mask = tsize - 1 ; table = new int [ tsize ] ; for ( int i = tsize - 1 ; i >= 0 ; i -- ) table [ i ] = EMPTY ; int end = offset + len ; for ( int i = offset ; i < end ; i ++ ) { put ( docs [ i ] ) ; } size = len ; }
create a hashdocset from a list of * unique * ids
