25 grid.lgStrictRepeat =
true;
39 grid.lgNegativeIncrements =
true;
44 fprintf(
ioQQQ,
" The increment (third parameter) should not be zero.\n" );
45 fprintf(
ioQQQ,
" Sorry.\n" );
51 fprintf(
ioQQQ,
" This command has changed since the definition given in Porter et al. 2006, PASP, 118, 920.\n" );
52 fprintf(
ioQQQ,
" The grid command now requires three parameters: lower limit, upper limit, and increment.\n" );
53 fprintf(
ioQQQ,
" The keywords RANGE and STEPS are no longer necessary.\n" );
54 fprintf(
ioQQQ,
" Sorry.\n" );
70 fprintf(
ioQQQ,
" Invalid repetion number for cycle: %ld\n",
grid.nCycle );
71 fprintf(
ioQQQ,
" Usage: grid <p1> <p2> <p3> cycle [ <n> ] with n >= 2.\n" );
82 fprintf(
ioQQQ,
"The increment (third parameter) has the wrong sign. It doesn't take you from the initial to the final grid value (first and second parameter, resp.).\n" );
83 fprintf(
ioQQQ,
" Sorry.\n" );
93 long eps =
max(
nint(abs(feps)),3);
102 grid.numParamValues[
optimize.nparm-1] = long(ratio) + 1;
106 fprintf(
ioQQQ,
" There must be at least two grid points in each dimension.\n" );
107 fprintf(
ioQQQ,
" Sorry.\n" );
122 fprintf(
ioQQQ,
"The current implementation of the grid command works with log parameter values even when you specify LINEAR.\n");
123 fprintf(
ioQQQ,
"A non-positive value was entered. The grid command cannot deal with this.\n");
bool fp_equal(sys_float x, sys_float y, int n=3)
#define DEBUG_ENTRY(funcname)
bool nMatch(const char *chKey) const
void ParseGrid(Parser &p)