private void growHeapMap(int cmid){
  int[] newMap=new int[Math.max((int)(map.length * 1.25),cmid + 1)];
  for (int j=0; j < map.length; j++) {
    newMap[j]=map[j];
  }
  map=newMap;
}

private void growHeapMap ( int cmid ) { int [ ] newMap = new int [ Math . max ( ( int ) ( map . length * 1.25 ) , cmid + 1 ) ] ; for ( int j = 0 ; j < map . length ; j ++ ) { newMap [ j ] = map [ j ] ; } map = newMap ; }
grow the map to be at least as large as would be required to map cmid
