#include <rejctmap.h>
Definition at line 204 of file rejctmap.h.
◆ REJMAP() [1/2]
◆ REJMAP() [2/2]
REJMAP::REJMAP |
( |
const REJMAP & |
rejmap | ) |
|
Definition at line 275 of file rejctmap.cpp.
278 REJ *from = source.ptr;
281 len = source.length ();
284 ptr = (
REJ *) malloc(len *
sizeof (
REJ));
286 for (i = 0; i < len; i++) {
◆ ~REJMAP()
◆ accept_count()
inT16 REJMAP::accept_count |
( |
| ) |
|
Definition at line 329 of file rejctmap.cpp.
333 for (i = 0; i < len; i++) {
334 if (ptr[i].accepted ())
◆ full_print()
void REJMAP::full_print |
( |
FILE * |
fp | ) |
|
Definition at line 403 of file rejctmap.cpp.
406 for (i = 0; i < len; i++) {
void full_print(FILE *fp)
◆ initialise()
void REJMAP::initialise |
( |
inT16 |
length | ) |
|
◆ length()
inT32 REJMAP::length |
( |
| ) |
const |
|
inline |
◆ operator=()
Definition at line 297 of file rejctmap.cpp.
309 for (i = 0; i < len; i++) {
void initialise(inT16 length)
◆ operator[]()
REJ& REJMAP::operator[] |
( |
inT16 |
index | ) |
const |
|
inline |
◆ print()
void REJMAP::print |
( |
FILE * |
fp | ) |
|
Definition at line 391 of file rejctmap.cpp.
395 for (i = 0; i < len; i++) {
399 fprintf (fp,
"\"%s\"", buff);
◆ quality_recoverable_rejects()
BOOL8 REJMAP::quality_recoverable_rejects |
( |
| ) |
|
Definition at line 352 of file rejctmap.cpp.
355 for (i = 0; i < len; i++) {
356 if (ptr[i].accept_if_good_quality ())
◆ recoverable_rejects()
BOOL8 REJMAP::recoverable_rejects |
( |
| ) |
|
Definition at line 341 of file rejctmap.cpp.
344 for (i = 0; i < len; i++) {
345 if (ptr[i].recoverable ())
◆ rej_word_bad_permuter()
void REJMAP::rej_word_bad_permuter |
( |
| ) |
|
Definition at line 449 of file rejctmap.cpp.
452 for (i = 0; i < len; i++) {
void setrej_bad_permuter()
◆ rej_word_bad_quality()
void REJMAP::rej_word_bad_quality |
( |
| ) |
|
Definition at line 485 of file rejctmap.cpp.
488 for (i = 0; i < len; i++) {
void setrej_bad_quality()
◆ rej_word_block_rej()
void REJMAP::rej_word_block_rej |
( |
| ) |
|
Definition at line 503 of file rejctmap.cpp.
506 for (i = 0; i < len; i++) {
◆ rej_word_contains_blanks()
void REJMAP::rej_word_contains_blanks |
( |
| ) |
|
Definition at line 440 of file rejctmap.cpp.
443 for (i = 0; i < len; i++) {
void setrej_contains_blanks()
◆ rej_word_doc_rej()
void REJMAP::rej_word_doc_rej |
( |
| ) |
|
Definition at line 494 of file rejctmap.cpp.
497 for (i = 0; i < len; i++) {
◆ rej_word_mostly_rej()
void REJMAP::rej_word_mostly_rej |
( |
| ) |
|
Definition at line 476 of file rejctmap.cpp.
479 for (i = 0; i < len; i++) {
◆ rej_word_no_alphanums()
void REJMAP::rej_word_no_alphanums |
( |
| ) |
|
Definition at line 467 of file rejctmap.cpp.
470 for (i = 0; i < len; i++) {
void setrej_no_alphanums()
◆ rej_word_not_tess_accepted()
void REJMAP::rej_word_not_tess_accepted |
( |
| ) |
|
Definition at line 431 of file rejctmap.cpp.
434 for (i = 0; i < len; i++) {
void setrej_not_tess_accepted()
◆ rej_word_row_rej()
void REJMAP::rej_word_row_rej |
( |
| ) |
|
Definition at line 512 of file rejctmap.cpp.
515 for (i = 0; i < len; i++) {
◆ rej_word_small_xht()
void REJMAP::rej_word_small_xht |
( |
| ) |
|
Definition at line 413 of file rejctmap.cpp.
416 for (i = 0; i < len; i++) {
◆ rej_word_tess_failure()
void REJMAP::rej_word_tess_failure |
( |
| ) |
|
Definition at line 422 of file rejctmap.cpp.
425 for (i = 0; i < len; i++) {
void setrej_tess_failure()
◆ rej_word_xht_fixup()
void REJMAP::rej_word_xht_fixup |
( |
| ) |
|
Definition at line 458 of file rejctmap.cpp.
461 for (i = 0; i < len; i++) {
◆ reject_count()
inT16 REJMAP::reject_count |
( |
| ) |
|
|
inline |
◆ remove_pos()
void REJMAP::remove_pos |
( |
inT16 |
pos | ) |
|
Definition at line 363 of file rejctmap.cpp.
375 new_ptr = (
REJ *) malloc(len *
sizeof(
REJ));
379 for (i = 0; i < pos; i++)
382 for (; pos < len; pos++)
383 new_ptr[pos] = ptr[pos + 1];
The documentation for this class was generated from the following files:
- /home/stefan/src/github/tesseract-ocr/tesseract/ccstruct/rejctmap.h
- /home/stefan/src/github/tesseract-ocr/tesseract/ccstruct/rejctmap.cpp