38 BOOL8 REJ::rej_before_nn_accept() {
45 BOOL8 REJ::rej_between_nn_and_mm() {
52 BOOL8 REJ::rej_between_mm_and_quality_accept() {
57 BOOL8 REJ::rej_between_quality_and_minimal_rej_accept() {
63 BOOL8 REJ::rej_before_mm_accept() {
64 return rej_between_nn_and_mm () ||
65 (rej_before_nn_accept () &&
70 BOOL8 REJ::rej_before_quality_accept() {
71 return rej_between_mm_and_quality_accept () ||
81 rej_between_quality_and_minimal_rej_accept () ||
93 (!rej_between_nn_and_mm () &&
94 !rej_between_mm_and_quality_accept () &&
95 !rej_between_quality_and_minimal_rej_accept ()));
249 fprintf (fp,
"R_NOT_TESS_ACCEPTED: %s\n",
251 fprintf (fp,
"R_CONTAINS_BLANKS: %s\n",
254 fprintf (fp,
"R_HYPHEN: %s\n",
flag (
R_HYPHEN) ?
"T" :
"F");
255 fprintf (fp,
"R_DUBIOUS: %s\n",
flag (
R_DUBIOUS) ?
"T" :
"F");
260 fprintf (fp,
"R_DOC_REJ: %s\n",
flag (
R_DOC_REJ) ?
"T" :
"F");
262 fprintf (fp,
"R_ROW_REJ: %s\n",
flag (
R_ROW_REJ) ?
"T" :
"F");
268 fprintf (fp,
"R_MINIMAL_REJ_ACCEPT: %s\n",
284 REJ *from = source.ptr;
292 for (i = 0; i < len; i++) {
315 for (i = 0; i < len; i++) {
331 0, len *
sizeof (
REJ));
341 for (i = 0; i < len; i++) {
342 if (ptr[i].accepted ())
352 for (i = 0; i < len; i++) {
353 if (ptr[i].recoverable ())
363 for (i = 0; i < len; i++) {
364 if (ptr[i].accept_if_good_quality ())
384 0, len *
sizeof (
REJ));
388 for (i = 0; i < pos; i++)
391 for (; pos < len; pos++)
392 new_ptr[pos] = ptr[pos + 1];
404 for (i = 0; i < len; i++) {
408 fprintf (fp,
"\"%s\"", buff);
415 for (i = 0; i < len; i++) {
425 for (i = 0; i < len; i++) {
434 for (i = 0; i < len; i++) {
443 for (i = 0; i < len; i++) {
452 for (i = 0; i < len; i++) {
461 for (i = 0; i < len; i++) {
470 for (i = 0; i < len; i++) {
479 for (i = 0; i < len; i++) {
488 for (i = 0; i < len; i++) {
497 for (i = 0; i < len; i++) {
506 for (i = 0; i < len; i++) {
515 for (i = 0; i < len; i++) {
524 for (i = 0; i < len; i++) {