private void FlagContourPassings(){
  iae=0;
  int ntmp2=jee - 1;
  for (int j=jss + 1; j <= ntmp2; ++j) {
    boolean imb=false;
    int iaend=iae;
    int ntmp3=iee;
    for (int i=iss; i <= ntmp3; ++i) {
      if (funcArray[j - 1][i - 1] <= cont)       imb=true;
 else       if (imb == true) {
        ++iae;
        pathbufia[iae - 1]=i * 1000 + j;
        imb=false;
        if (iae == kBufSize * 3) {
          if (j > jss + 1) {
            iae=iaend;
            jee=j;
          }
 else {
            jee=Math.min(j + 1,jee);
            iee=i;
          }
          return;
        }
      }
    }
  }
}

private void FlagContourPassings ( ) { iae = 0 ; int ntmp2 = jee - 1 ; for ( int j = jss + 1 ; j <= ntmp2 ; ++ j ) { boolean imb = false ; int iaend = iae ; int ntmp3 = iee ; for ( int i = iss ; i <= ntmp3 ; ++ i ) { if ( funcArray [ j - 1 ] [ i - 1 ] <= cont ) imb = true ; else if ( imb == true ) { ++ iae ; pathbufia [ iae - 1 ] = i * 1000 + j ; imb = false ; if ( iae == kBufSize * 3 ) { if ( j > jss + 1 ) { iae = iaend ; jee = j ; } else { jee = Math . min ( j + 1 , jee ) ; iee = i ; } return ; } } } } }
flag points in ia where the the function increases through the contour level , not including the boundaries . this is so we have a list of at least one point on each contour line that doesn ' t intersect a boundary .
