private int exceptionEndRange(int bcIndex){
  int max=bcodes.length();
  if (startPCs != null) {
    for (    int spc : startPCs) {
      if (bcIndex < spc && max > spc) {
        max=spc;
      }
    }
    for (    int epc : endPCs) {
      if (bcIndex < epc && max > epc) {
        max=epc;
      }
    }
  }
  return max;
}

private int exceptionEndRange ( int bcIndex ) { int max = bcodes . length ( ) ; if ( startPCs != null ) { for ( int spc : startPCs ) { if ( bcIndex < spc && max > spc ) { max = spc ; } } for ( int epc : endPCs ) { if ( bcIndex < epc && max > epc ) { max = epc ; } } } return max ; }
given a starting bytecode index , find the greatest bcindex that is still has the same inscope exception handlers .
