tesseract::TabConstraint Class Reference

#include <tabvector.h>

Inheritance diagram for tesseract::TabConstraint:

Public Member Functions
	TabConstraint ()=default
Public Member Functions inherited from tesseract::ELIST_LINK
	ELIST_LINK ()
	ELIST_LINK (const ELIST_LINK &)
void	operator= (const ELIST_LINK &)

Static Public Member Functions
static void	CreateConstraint (TabVector *vector, bool is_top)
static bool	CompatibleConstraints (TabConstraint_LIST *list1, TabConstraint_LIST *list2)
static void	MergeConstraints (TabConstraint_LIST *list1, TabConstraint_LIST *list2)
static void	ApplyConstraints (TabConstraint_LIST *constraints)

Detailed Description

Definition at line 67 of file tabvector.h.

Constructor & Destructor Documentation

TabConstraint()

tesseract::TabConstraint::TabConstraint ( )

default

Member Function Documentation

ApplyConstraints()

void tesseract::TabConstraint::ApplyConstraints ( TabConstraint_LIST *  constraints )

static

Definition at line 122 of file tabvector.cpp.

                                                                    {
  int y_min = -INT32_MAX;
  int y_max = INT32_MAX;
  GetConstraints(constraints, &y_min, &y_max);
  int y = (y_min + y_max) / 2;
  TabConstraint_IT it(constraints);
  for (it.mark_cycle_pt(); !it.cycled_list(); it.forward()) {
    TabConstraint *constraint = it.data();
    TabVector *v = constraint->vector_;
    if (constraint->is_top_) {
      v->SetYEnd(y);
      v->set_top_constraints(nullptr);
    } else {
      v->SetYStart(y);
      v->set_bottom_constraints(nullptr);
    }
  }
  delete constraints;
}

CompatibleConstraints()

bool tesseract::TabConstraint::CompatibleConstraints ( TabConstraint_LIST *  list1, TabConstraint_LIST *  list2  )

static

Definition at line 76 of file tabvector.cpp.

                                                                                              {
  if (list1 == list2) {
    return false;
  }
  int y_min = -INT32_MAX;
  int y_max = INT32_MAX;
  if (textord_debug_tabfind > 3) {
    tprintf("Testing constraint compatibility\n");
  }
  GetConstraints(list1, &y_min, &y_max);
  GetConstraints(list2, &y_min, &y_max);
  if (textord_debug_tabfind > 3) {
    tprintf("Resulting range = [%d,%d]\n", y_min, y_max);
  }
  return y_max >= y_min;
}

CreateConstraint()

void tesseract::TabConstraint::CreateConstraint ( TabVector *  vector, bool  is_top  )

static

Definition at line 63 of file tabvector.cpp.

                                                                   {
  auto *constraint = new TabConstraint(vector, is_top);
  auto *constraints = new TabConstraint_LIST;
  TabConstraint_IT it(constraints);
  it.add_to_end(constraint);
  if (is_top) {
    vector->set_top_constraints(constraints);
  } else {
    vector->set_bottom_constraints(constraints);
  }
}

MergeConstraints()

void tesseract::TabConstraint::MergeConstraints ( TabConstraint_LIST *  list1, TabConstraint_LIST *  list2  )

static

Definition at line 95 of file tabvector.cpp.

                                                                                         {
  if (list1 == list2) {
    return;
  }
  TabConstraint_IT it(list2);
  if (textord_debug_tabfind > 3) {
    tprintf("Merging constraints\n");
  }
  // The vectors of all constraints on list2 are now going to be on list1.
  for (it.mark_cycle_pt(); !it.cycled_list(); it.forward()) {
    TabConstraint *constraint = it.data();
    if (textord_debug_tabfind > 3) {
      constraint->vector_->Print("Merge");
    }
    if (constraint->is_top_) {
      constraint->vector_->set_top_constraints(list1);
    } else {
      constraint->vector_->set_bottom_constraints(list1);
    }
  }
  it = list1;
  it.add_list_before(list2);
  delete list2;
}

---

The documentation for this class was generated from the following files:

• /media/home/debian/src/github/tesseract-ocr/tesseract/src/textord/tabvector.h
• /media/home/debian/src/github/tesseract-ocr/tesseract/src/textord/tabvector.cpp