private void growEntries(){
  int newLen=(next.length << 1) + 1;
  int[] newNext=new int[newLen];
  GridUnsafe.copyMemory(next,INT_ARR_OFF,newNext,INT_ARR_OFF,size << 2);
  next=newNext;
  nextEmpty=new int[newLen];
  Arrays.fill(nextEmpty,-1);
  Object[] newObjs=new Object[newLen];
  System.arraycopy(objs,0,newObjs,0,size);
  objs=newObjs;
}

private void growEntries ( ) { int newLen = ( next . length << 1 ) + 1 ; int [ ] newNext = new int [ newLen ] ; GridUnsafe . copyMemory ( next , INT_ARR_OFF , newNext , INT_ARR_OFF , size << 2 ) ; next = newNext ; nextEmpty = new int [ newLen ] ; Arrays . fill ( nextEmpty , - 1 ) ; Object [ ] newObjs = new Object [ newLen ] ; System . arraycopy ( objs , 0 , newObjs , 0 , size ) ; objs = newObjs ; }
increases hash table capacity by lengthening entry arrays .
