protected void normalize(){
  int newPivotIndex=pivotType.calculate(buffer.length);
  int newStart=newPivotIndex - pivotType.calculate(size);
  int newEnd=newStart + size;
  System.arraycopy(buffer,start,buffer,newStart,size);
  if (newStart > start) {
    for (int i=start; i < newStart; i++) {
      buffer[i]=null;
    }
  }
 else {
    for (int i=Math.max(start,newEnd); i < end; i++) {
      buffer[i]=null;
    }
  }
  start=newStart;
  end=newEnd;
  pivotIndex=newPivotIndex;
}

protected void normalize ( ) { int newPivotIndex = pivotType . calculate ( buffer . length ) ; int newStart = newPivotIndex - pivotType . calculate ( size ) ; int newEnd = newStart + size ; System . arraycopy ( buffer , start , buffer , newStart , size ) ; if ( newStart > start ) { for ( int i = start ; i < newStart ; i ++ ) { buffer [ i ] = null ; } } else { for ( int i = Math . max ( start , newEnd ) ; i < end ; i ++ ) { buffer [ i ] = null ; } } start = newStart ; end = newEnd ; pivotIndex = newPivotIndex ; }
normalizes list by moving the content into ideal position balanced over pivot . it is called to prevent growth of the buffer when there is enough empty space .
