35 BOOL8 REJ::rej_before_nn_accept() {
42 BOOL8 REJ::rej_between_nn_and_mm() {
49 BOOL8 REJ::rej_between_mm_and_quality_accept() {
54 BOOL8 REJ::rej_between_quality_and_minimal_rej_accept() {
60 BOOL8 REJ::rej_before_mm_accept() {
61 return rej_between_nn_and_mm () ||
62 (rej_before_nn_accept () &&
67 BOOL8 REJ::rej_before_quality_accept() {
68 return rej_between_mm_and_quality_accept () ||
78 rej_between_quality_and_minimal_rej_accept () ||
90 (!rej_between_nn_and_mm () &&
91 !rej_between_mm_and_quality_accept () &&
92 !rej_between_quality_and_minimal_rej_accept ()));
244 fprintf (fp,
"R_NOT_TESS_ACCEPTED: %s\n",
246 fprintf (fp,
"R_CONTAINS_BLANKS: %s\n",
249 fprintf (fp,
"R_HYPHEN: %s\n",
flag (
R_HYPHEN) ?
"T" :
"F");
250 fprintf (fp,
"R_DUBIOUS: %s\n",
flag (
R_DUBIOUS) ?
"T" :
"F");
255 fprintf (fp,
"R_DOC_REJ: %s\n",
flag (
R_DOC_REJ) ?
"T" :
"F");
257 fprintf (fp,
"R_ROW_REJ: %s\n",
flag (
R_ROW_REJ) ?
"T" :
"F");
263 fprintf (fp,
"R_MINIMAL_REJ_ACCEPT: %s\n",
278 REJ *from = source.ptr;
286 for (i = 0; i < len; i++) {
307 initialise (source.len);
309 for (i = 0; i < len; i++) {
325 0, len *
sizeof (
REJ));
335 for (i = 0; i < len; i++) {
346 for (i = 0; i < len; i++) {
357 for (i = 0; i < len; i++) {
378 0, len *
sizeof (
REJ));
382 for (i = 0; i < pos; i++)
385 for (; pos < len; pos++)
386 new_ptr[pos] = ptr[pos + 1];
398 for (i = 0; i < len; i++) {
399 buff[i] = ptr[i].display_char ();
402 fprintf (fp,
"\"%s\"", buff);
409 for (i = 0; i < len; i++) {
410 ptr[i].full_print (fp);
419 for (i = 0; i < len; i++) {
420 ptr[i].setrej_small_xht ();
428 for (i = 0; i < len; i++) {
429 ptr[i].setrej_tess_failure ();
437 for (i = 0; i < len; i++) {
438 if (ptr[i].
accepted()) ptr[i].setrej_not_tess_accepted();
446 for (i = 0; i < len; i++) {
447 if (ptr[i].
accepted()) ptr[i].setrej_contains_blanks();
455 for (i = 0; i < len; i++) {
456 if (ptr[i].
accepted()) ptr[i].setrej_bad_permuter ();
464 for (i = 0; i < len; i++) {
465 if (ptr[i].
accepted()) ptr[i].setrej_xht_fixup();
473 for (i = 0; i < len; i++) {
474 if (ptr[i].
accepted()) ptr[i].setrej_no_alphanums();
482 for (i = 0; i < len; i++) {
483 if (ptr[i].
accepted()) ptr[i].setrej_mostly_rej();
491 for (i = 0; i < len; i++) {
492 if (ptr[i].
accepted()) ptr[i].setrej_bad_quality();
500 for (i = 0; i < len; i++) {
501 if (ptr[i].
accepted()) ptr[i].setrej_doc_rej();
509 for (i = 0; i < len; i++) {
510 if (ptr[i].
accepted()) ptr[i].setrej_block_rej();
518 for (i = 0; i < len; i++) {
519 if (ptr[i].
accepted()) ptr[i].setrej_row_rej();
REJMAP & operator=(const REJMAP &source)
void setrej_contains_blanks()
void setrej_tess_failure()
void rej_word_contains_blanks()
void full_print(FILE *fp)
void free_struct(void *deadstruct, inT32, const char *)
void rej_word_no_alphanums()
void rej_word_bad_quality()
void setrej_1Il_conflict()
void rej_word_tess_failure()
void full_print(FILE *fp)
void remove_pos(inT16 pos)
void * alloc_struct(inT32 count, const char *)
BOOL8 quality_recoverable_rejects()
void initialise(inT16 length)
void setrej_bad_repetition()
void rej_word_not_tess_accepted()
void setrej_hyphen_accept()
void rej_word_xht_fixup()
void setrej_bad_permuter()
void setrej_not_tess_accepted()
void setrej_minimal_rej_accept()
BOOL8 accept_if_good_quality()
void rej_word_block_rej()
void setrej_quality_accept()
void setrej_no_alphanums()
void setrej_bad_quality()
BOOL8 flag(REJ_FLAGS rej_flag)
void rej_word_mostly_rej()
void rej_word_small_xht()
void rej_word_bad_permuter()
BOOL8 recoverable_rejects()