#include <rejctmap.h>
Definition at line 201 of file rejctmap.h.
◆ REJMAP() [1/2]
◆ REJMAP() [2/2]
REJMAP::REJMAP |
( |
const REJMAP & |
rejmap | ) |
|
|
inline |
◆ accept_count()
int16_t REJMAP::accept_count |
( |
| ) |
|
Definition at line 281 of file rejctmap.cpp.
285 for (i = 0; i < len; i++) {
286 if (ptr[i].accepted ())
◆ full_print()
void REJMAP::full_print |
( |
FILE * |
fp | ) |
|
Definition at line 335 of file rejctmap.cpp.
338 for (i = 0; i < len; i++) {
339 ptr[i].full_print (fp);
◆ initialise()
void REJMAP::initialise |
( |
int16_t |
length | ) |
|
◆ length()
int32_t REJMAP::length |
( |
| ) |
const |
|
inline |
◆ operator=()
Definition at line 267 of file rejctmap.cpp.
269 for (
int i = 0; i < len; i++) {
270 ptr[i] = source.ptr[i];
void initialise(int16_t length)
◆ operator[]()
REJ& REJMAP::operator[] |
( |
int16_t |
index | ) |
const |
|
inline |
◆ print()
void REJMAP::print |
( |
FILE * |
fp | ) |
|
Definition at line 323 of file rejctmap.cpp.
327 for (i = 0; i < len; i++) {
328 buff[i] = ptr[i].display_char ();
331 fprintf (fp,
"\"%s\"", buff);
◆ quality_recoverable_rejects()
bool REJMAP::quality_recoverable_rejects |
( |
| ) |
|
Definition at line 302 of file rejctmap.cpp.
303 for (
int i = 0; i < len; i++) {
304 if (ptr[i].accept_if_good_quality ())
◆ recoverable_rejects()
bool REJMAP::recoverable_rejects |
( |
| ) |
|
Definition at line 293 of file rejctmap.cpp.
294 for (
int i = 0; i < len; i++) {
295 if (ptr[i].recoverable ())
◆ rej_word_bad_permuter()
void REJMAP::rej_word_bad_permuter |
( |
| ) |
|
Definition at line 381 of file rejctmap.cpp.
384 for (i = 0; i < len; i++) {
385 if (ptr[i].accepted()) ptr[i].setrej_bad_permuter ();
◆ rej_word_bad_quality()
void REJMAP::rej_word_bad_quality |
( |
| ) |
|
Definition at line 417 of file rejctmap.cpp.
420 for (i = 0; i < len; i++) {
421 if (ptr[i].accepted()) ptr[i].setrej_bad_quality();
◆ rej_word_block_rej()
void REJMAP::rej_word_block_rej |
( |
| ) |
|
Definition at line 435 of file rejctmap.cpp.
438 for (i = 0; i < len; i++) {
439 if (ptr[i].accepted()) ptr[i].setrej_block_rej();
◆ rej_word_contains_blanks()
void REJMAP::rej_word_contains_blanks |
( |
| ) |
|
Definition at line 372 of file rejctmap.cpp.
375 for (i = 0; i < len; i++) {
376 if (ptr[i].accepted()) ptr[i].setrej_contains_blanks();
◆ rej_word_doc_rej()
void REJMAP::rej_word_doc_rej |
( |
| ) |
|
Definition at line 426 of file rejctmap.cpp.
429 for (i = 0; i < len; i++) {
430 if (ptr[i].accepted()) ptr[i].setrej_doc_rej();
◆ rej_word_mostly_rej()
void REJMAP::rej_word_mostly_rej |
( |
| ) |
|
Definition at line 408 of file rejctmap.cpp.
411 for (i = 0; i < len; i++) {
412 if (ptr[i].accepted()) ptr[i].setrej_mostly_rej();
◆ rej_word_no_alphanums()
void REJMAP::rej_word_no_alphanums |
( |
| ) |
|
Definition at line 399 of file rejctmap.cpp.
402 for (i = 0; i < len; i++) {
403 if (ptr[i].accepted()) ptr[i].setrej_no_alphanums();
◆ rej_word_not_tess_accepted()
void REJMAP::rej_word_not_tess_accepted |
( |
| ) |
|
Definition at line 363 of file rejctmap.cpp.
366 for (i = 0; i < len; i++) {
367 if (ptr[i].accepted()) ptr[i].setrej_not_tess_accepted();
◆ rej_word_row_rej()
void REJMAP::rej_word_row_rej |
( |
| ) |
|
Definition at line 444 of file rejctmap.cpp.
447 for (i = 0; i < len; i++) {
448 if (ptr[i].accepted()) ptr[i].setrej_row_rej();
◆ rej_word_small_xht()
void REJMAP::rej_word_small_xht |
( |
| ) |
|
Definition at line 345 of file rejctmap.cpp.
348 for (i = 0; i < len; i++) {
349 ptr[i].setrej_small_xht ();
◆ rej_word_tess_failure()
void REJMAP::rej_word_tess_failure |
( |
| ) |
|
Definition at line 354 of file rejctmap.cpp.
357 for (i = 0; i < len; i++) {
358 ptr[i].setrej_tess_failure ();
◆ rej_word_xht_fixup()
void REJMAP::rej_word_xht_fixup |
( |
| ) |
|
Definition at line 390 of file rejctmap.cpp.
393 for (i = 0; i < len; i++) {
394 if (ptr[i].accepted()) ptr[i].setrej_xht_fixup();
◆ reject_count()
int16_t REJMAP::reject_count |
( |
| ) |
|
|
inline |
◆ remove_pos()
void REJMAP::remove_pos |
( |
int16_t |
pos | ) |
|
Definition at line 311 of file rejctmap.cpp.
319 for (; pos < len; pos++) ptr[pos] = ptr[pos + 1];
The documentation for this class was generated from the following files: