private void growSpine(){
  int size=(spine.length << 1) + 1;
  spine=new int[size];
  spineEmpty=new int[size];
  threshold=(int)(spine.length * loadFactor);
  Arrays.fill(spineEmpty,-1);
  GridUnsafe.copyMemory(spineEmpty,INT_ARR_OFF,spine,INT_ARR_OFF,spineEmpty.length << 2);
  for (int i=0; i < this.size; i++) {
    Object obj=objs[i];
    int idx=hash(obj) % spine.length;
    insert(objs[i],i,idx);
  }
}

private void growSpine ( ) { int size = ( spine . length << 1 ) + 1 ; spine = new int [ size ] ; spineEmpty = new int [ size ] ; threshold = ( int ) ( spine . length * loadFactor ) ; Arrays . fill ( spineEmpty , - 1 ) ; GridUnsafe . copyMemory ( spineEmpty , INT_ARR_OFF , spine , INT_ARR_OFF , spineEmpty . length << 2 ) ; for ( int i = 0 ; i < this . size ; i ++ ) { Object obj = objs [ i ] ; int idx = hash ( obj ) % spine . length ; insert ( objs [ i ] , i , idx ) ; } }
expands the hash " spine " - equivalent to increasing the number of buckets in a conventional hash table .
