/dports/graphics/tesseract/tesseract-5.0.0/src/ccmain/ |
H A D | equationdetect.cpp | 505 part_grid_->GridCoords(part_box.left(), part_box.bottom(), &grid_x, &grid_y); in InsertPartAfterAbsorb() 788 search.StartSideSearch(part_box.right(), part_box.top(), part_box.bottom()); in IdentifyInlinePartsHorizontal() 793 search.StartSideSearch(part_box.left(), part_box.top(), part_box.bottom()); in IdentifyInlinePartsHorizontal() 908 search.StartVerticalSearch(part_box.left(), part_box.right(), part_box.bottom()); in IsInline() 910 search.StartVerticalSearch(part_box.left(), part_box.right(), part_box.top()); in IsInline() 989 search.StartRadSearch((part_box.left() + part_box.right()) / 2, in IsIndented() 990 (part_box.top() + part_box.bottom()) / 2, kRadiusTh); in IsIndented() 1010 if (!part_box.x_overlap(neighbor_box) || part_box.y_overlap(neighbor_box)) { in IsIndented() 1325 if (part_box.left() < neighbors_left || part_box.right() > neighbors_right) { in IsMathBlockSatellite() 1357 int y = search_bottom ? part_box.bottom() : part_box.top(); in SearchNNVertical() [all …]
|
H A D | equationdetect.h | 174 bool IsNearSmallNeighbor(const TBOX &seed_box, const TBOX &part_box) const;
|
/dports/graphics/tesseract/tesseract-5.0.0/src/textord/ |
H A D | imagefind.cpp | 780 if (black_area * 2 < part_box.area() || !im_box.contains(part_box)) { in DivideImageIntoParts() 784 part_box.set_top(part_box.top() + padding / 2); in DivideImageIntoParts() 785 part_box.set_bottom(part_box.bottom() - padding / 2); in DivideImageIntoParts() 809 if (part_box.right() > left_limit && part_box.right() < box.left()) { in ExpandImageLeft() 824 if (part_box.right() > left_limit && part_box.right() < box.left()) { in ExpandImageLeft() 845 if (part_box.left() < right_limit && part_box.left() > box.right()) { in ExpandImageRight() 860 if (part_box.left() < right_limit && part_box.left() > box.right()) { in ExpandImageRight() 881 if (part_box.top() > bottom_limit && part_box.top() < box.bottom()) { in ExpandImageBottom() 896 if (part_box.top() > bottom_limit && part_box.top() < box.bottom()) { in ExpandImageBottom() 917 if (part_box.bottom() < top_limit && part_box.bottom() > box.top()) { in ExpandImageTop() [all …]
|
H A D | colpartitiongrid.cpp | 431 TBOX full_box(part_box); in BestMergeCandidate() 444 part_box.print(); in BestMergeCandidate() 818 GridCoords(part_box.left(), part_box.bottom(), &grid_x, &grid_y); in MakeColPartSets() 1021 GridCoords(part_box.left(), part_box.bottom(), &grid_x, &grid_y); in ListFindMargins() 1091 AlignedBlob::WithinTestRegion(2, part_box.left(), part_box.bottom()); in FindFigureCaptions() 1120 part_box.print(); in FindFigureCaptions() 1373 if (!part_box.contains(c_box) && !c_box.contains(part_box)) { in FindMergeCandidates() 1450 part_box.print(); in SmoothRegionType() 1454 int max_dist = std::min(part_box.width(), part_box.height()); in SmoothRegionType() 1515 *search_box = part_box; in ComputeSearchBoxAndScaling() [all …]
|
H A D | tablefind.cpp | 680 TBOX part_box = part->bounding_box(); in SetVerticalSpacing() local 695 if (neighbor_box.major_x_overlap(part_box)) { in SetVerticalSpacing() 1388 const TBOX &part_box = part->bounding_box(); in GetTableRegions() local 1407 current_table_box.set_left(part_box.left()); in GetTableRegions() 1511 const TBOX &part_box = part->bounding_box(); in BelongToOneTable() local 1513 if (part_box.overlap(box1) && part_box.overlap(box2) && in BelongToOneTable() 1642 if (result_box->contains(part_box)) { in GrowTableToIncludeLines() 1663 const TBOX &part_box = part.bounding_box(); in HLineBelongsToTable() local 1664 if (!part_box.major_x_overlap(table_box)) { in HLineBelongsToTable() 1798 TBOX part_box = part->bounding_box(); in DeleteSingleColumnTables() local [all …]
|
H A D | workingpartset.cpp | 105 const TBOX &part_box = part->bounding_box(); in MakeBlocks() local 112 !next_block_part->IsLineType() && next_box.bottom() <= part_box.top() && in MakeBlocks() 113 (text_block || part_box.bottom() <= next_box.top())) { in MakeBlocks()
|
H A D | textlineprojection.cpp | 165 TBOX part_box = part.bounding_box(); in DistanceOfBoxFromPartition() local 167 part_box.set_top(part.median_top()); in DistanceOfBoxFromPartition() 168 part_box.set_bottom(part.median_bottom()); in DistanceOfBoxFromPartition() 170 part_box.set_left(part.median_left()); in DistanceOfBoxFromPartition() 171 part_box.set_right(part.median_right()); in DistanceOfBoxFromPartition() 174 return DistanceOfBoxFromBox(box, part_box, part.IsHorizontalType(), denorm, debug); in DistanceOfBoxFromPartition()
|
H A D | colfind.cpp | 1121 const TBOX &part_box = part->bounding_box(); in GridMergePartitions() local 1125 part_box.right() < neighbour->left_margin()) { in GridMergePartitions() 1129 part_box.left() > neighbour->right_margin()) { in GridMergePartitions() 1132 int h_gap = std::max(part_box.left(), neighbour_box.left()) - in GridMergePartitions() 1133 std::min(part_box.right(), neighbour_box.right()); in GridMergePartitions() 1135 part_box.width() < mean_column_gap_ || neighbour_box.width() < mean_column_gap_) { in GridMergePartitions()
|
H A D | colpartition.cpp | 2510 const TBOX &part_box = part.bounding_box(); in UpdateLeftMargin() local 2511 int top = part_box.top(); in UpdateLeftMargin() 2512 int bottom = part_box.bottom(); in UpdateLeftMargin() 2514 int tr_key = part.SortKey(part_box.left(), top); in UpdateLeftMargin() 2516 int br_key = part.SortKey(part_box.left(), bottom); in UpdateLeftMargin() 2599 const TBOX &part_box = part.bounding_box(); in UpdateRightMargin() local 2600 int top = part_box.top(); in UpdateRightMargin() 2601 int bottom = part_box.bottom(); in UpdateRightMargin() 2602 int tl_key = part.SortKey(part_box.right(), top); in UpdateRightMargin() 2604 int bl_key = part.SortKey(part_box.right(), bottom); in UpdateRightMargin()
|
H A D | strokewidth.cpp | 532 const TBOX &part_box = part->bounding_box(); in MarkLeaderNeighbours() local 537 blobsearch.StartSideSearch(side == LR_LEFT ? part_box.left() : part_box.right(), in MarkLeaderNeighbours() 538 part_box.bottom(), part_box.top()); in MarkLeaderNeighbours() 542 if (!blob_box.y_overlap(part_box)) { in MarkLeaderNeighbours() 545 int x_gap = blob_box.x_gap(part_box); in MarkLeaderNeighbours()
|
/dports/graphics/tesseract/tesseract-5.0.0/unittest/ |
H A D | tablefind_test.cc | 212 TBOX part_box(10, 5, 100, 15); in TEST_F() local 219 TBOX blob_box = part_box; in TEST_F() 252 TBOX part_box(10, 5, 100, 15); in TEST_F() local 259 TBOX blob_box = part_box; in TEST_F()
|
H A D | equationdetect_test.cc | 83 bool RunIsNearSmallNeighbor(const TBOX &seed_box, const TBOX &part_box) { in RunIsNearSmallNeighbor() argument 84 return IsNearSmallNeighbor(seed_box, part_box); in RunIsNearSmallNeighbor()
|
/dports/science/hypre/hypre-2.23.0/src/struct_mv/ |
H A D | assumed_part.c | 1639 hypre_Box *result_box, *part_box, *part_dbox; in hypre_StructAssumedPartitionGetProcsFromBox() local 1657 part_box = hypre_BoxCreate(ndim); in hypre_StructAssumedPartitionGetProcsFromBox() 1736 hypre_BoxIMinD(part_box, d) = p + 1; in hypre_StructAssumedPartitionGetProcsFromBox() 1741 hypre_BoxIMinD(part_box, d) = extra + q + 1; in hypre_StructAssumedPartitionGetProcsFromBox() 1749 hypre_BoxIMaxD(part_box, d) = p + 1; in hypre_StructAssumedPartitionGetProcsFromBox() 1754 hypre_BoxIMaxD(part_box, d) = extra + q + 1; in hypre_StructAssumedPartitionGetProcsFromBox() 1764 start = hypre_BoxIMin(part_box); in hypre_StructAssumedPartitionGetProcsFromBox() 1766 hypre_BoxGetSize(part_box, loop_size); in hypre_StructAssumedPartitionGetProcsFromBox() 1829 hypre_BoxDestroy(part_box); in hypre_StructAssumedPartitionGetProcsFromBox()
|
/dports/cad/horizon-eda/horizon-2.1.0/src/pool-prj-mgr/pool-mgr/kicad_symbol_import_wizard/ |
H A D | kicad_symbol_import_wizard.hpp | 43 Gtk::Box *part_box = nullptr; member in horizon::KiCadSymbolImportWizard
|
H A D | kicad_symbol_import_wizard.cpp | 30 GET_WIDGET(part_box); in KiCadSymbolImportWizard() 412 part_box->set_visible(part_uuid); in import()
|