-#endif /* HAVE_CONFIG_H */
-
-#include "allheaders.h"
-#include "math.h"
-
- /* These functions are not intended to work on very low-res images */
-static const l_int32 MinWidth = 100;
-static const l_int32 MinHeight = 100;
-
-/*------------------------------------------------------------------*
- * Top level page segmentation *
- *------------------------------------------------------------------*/
-/*!
- * \brief pixGetRegionsBinary()
- *
- * \param[in] pixs 1 bpp, assumed to be 300 to 400 ppi
- * \param[out] ppixhm [optional] halftone mask
- * \param[out] ppixtm [optional] textline mask
- * \param[out] ppixtb [optional] textblock mask
- * \param[in] pixadb input for collecting debug pix; use NULL to skip
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) It is best to deskew the image before segmenting.
- * (2) Passing in %pixadb enables debug output.
- *
- */
-l_ok
-pixGetRegionsBinary(PIX *pixs,
- PIX **ppixhm,
- PIX **ppixtm,
- PIX **ppixtb,
- PIXA *pixadb)
-{
-l_int32 w, h, htfound, tlfound;
-PIX *pixr, *pix1, *pix2;
-PIX *pixtext; /* text pixels only */
-PIX *pixhm2; /* halftone mask; 2x reduction */
-PIX *pixhm; /* halftone mask; */
-PIX *pixtm2; /* textline mask; 2x reduction */
-PIX *pixtm; /* textline mask */
-PIX *pixvws; /* vertical white space mask */
-PIX *pixtb2; /* textblock mask; 2x reduction */
-PIX *pixtbf2; /* textblock mask; 2x reduction; small comps filtered */
-PIX *pixtb; /* textblock mask */
-
- PROCNAME("pixGetRegionsBinary");
-
- if (ppixhm) *ppixhm = NULL;
- if (ppixtm) *ppixtm = NULL;
- if (ppixtb) *ppixtb = NULL;
- if (!pixs || pixGetDepth(pixs) != 1)
- return ERROR_INT("pixs undefined or not 1 bpp", procName, 1);
- pixGetDimensions(pixs, &w, &h, NULL);
- if (w < MinWidth || h < MinHeight) {
- L_ERROR("pix too small: w = %d, h = %d\n", procName, w, h);
- return 1;
- }
-
- /* 2x reduce, to 150 -200 ppi */
- pixr = pixReduceRankBinaryCascade(pixs, 1, 0, 0, 0);
- if (pixadb) pixaAddPix(pixadb, pixr, L_COPY);
-
- /* Get the halftone mask */
- pixhm2 = pixGenerateHalftoneMask(pixr, &pixtext, &htfound, pixadb);
-
- /* Get the textline mask from the text pixels */
- pixtm2 = pixGenTextlineMask(pixtext, &pixvws, &tlfound, pixadb);
-
- /* Get the textblock mask from the textline mask */
- pixtb2 = pixGenTextblockMask(pixtm2, pixvws, pixadb);
- pixDestroy(&pixr);
- pixDestroy(&pixtext);
- pixDestroy(&pixvws);
-
- /* Remove small components from the mask, where a small
- * component is defined as one with both width and height < 60 */
- pixtbf2 = NULL;
- if (pixtb2) {
- pixtbf2 = pixSelectBySize(pixtb2, 60, 60, 4, L_SELECT_IF_EITHER,
- L_SELECT_IF_GTE, NULL);
- pixDestroy(&pixtb2);
- if (pixadb) pixaAddPix(pixadb, pixtbf2, L_COPY);
- }
-
- /* Expand all masks to full resolution, and do filling or
- * small dilations for better coverage. */
- pixhm = pixExpandReplicate(pixhm2, 2);
- pix1 = pixSeedfillBinary(NULL, pixhm, pixs, 8);
- pixOr(pixhm, pixhm, pix1);
- pixDestroy(&pixhm2);
- pixDestroy(&pix1);
- if (pixadb) pixaAddPix(pixadb, pixhm, L_COPY);
-
- pix1 = pixExpandReplicate(pixtm2, 2);
- pixtm = pixDilateBrick(NULL, pix1, 3, 3);
- pixDestroy(&pixtm2);
- pixDestroy(&pix1);
- if (pixadb) pixaAddPix(pixadb, pixtm, L_COPY);
-
- if (pixtbf2) {
- pix1 = pixExpandReplicate(pixtbf2, 2);
- pixtb = pixDilateBrick(NULL, pix1, 3, 3);
- pixDestroy(&pixtbf2);
- pixDestroy(&pix1);
- if (pixadb) pixaAddPix(pixadb, pixtb, L_COPY);
- } else {
- pixtb = pixCreateTemplate(pixs); /* empty mask */
- }
-
- /* Debug: identify objects that are neither text nor halftone image */
- if (pixadb) {
- pix1 = pixSubtract(NULL, pixs, pixtm); /* remove text pixels */
- pix2 = pixSubtract(NULL, pix1, pixhm); /* remove halftone pixels */
- pixaAddPix(pixadb, pix2, L_INSERT);
- pixDestroy(&pix1);
- }
-
- /* Debug: display textline components with random colors */
- if (pixadb) {
- l_int32 w, h;
- BOXA *boxa;
- PIXA *pixa;
- boxa = pixConnComp(pixtm, &pixa, 8);
- pixGetDimensions(pixtm, &w, &h, NULL);
- pix1 = pixaDisplayRandomCmap(pixa, w, h);
- pixcmapResetColor(pixGetColormap(pix1), 0, 255, 255, 255);
- pixaAddPix(pixadb, pix1, L_INSERT);
- pixaDestroy(&pixa);
- boxaDestroy(&boxa);
- }
-
- /* Debug: identify the outlines of each textblock */
- if (pixadb) {
- PIXCMAP *cmap;
- PTAA *ptaa;
- ptaa = pixGetOuterBordersPtaa(pixtb);
- lept_mkdir("lept/pageseg");
- ptaaWriteDebug("/tmp/lept/pageseg/tb_outlines.ptaa", ptaa, 1);
- pix1 = pixRenderRandomCmapPtaa(pixtb, ptaa, 1, 16, 1);
- cmap = pixGetColormap(pix1);
- pixcmapResetColor(cmap, 0, 130, 130, 130);
- pixaAddPix(pixadb, pix1, L_INSERT);
- ptaaDestroy(&ptaa);
- }
-
- /* Debug: get b.b. for all mask components */
- if (pixadb) {
- BOXA *bahm, *batm, *batb;
- bahm = pixConnComp(pixhm, NULL, 4);
- batm = pixConnComp(pixtm, NULL, 4);
- batb = pixConnComp(pixtb, NULL, 4);
- boxaWriteDebug("/tmp/lept/pageseg/htmask.boxa", bahm);
- boxaWriteDebug("/tmp/lept/pageseg/textmask.boxa", batm);
- boxaWriteDebug("/tmp/lept/pageseg/textblock.boxa", batb);
- boxaDestroy(&bahm);
- boxaDestroy(&batm);
- boxaDestroy(&batb);
- }
- if (pixadb) {
- pixaConvertToPdf(pixadb, 0, 1.0, 0, 0, "Debug page segmentation",
- "/tmp/lept/pageseg/debug.pdf");
- L_INFO("Writing debug pdf to /tmp/lept/pageseg/debug.pdf\n", procName);
- }
-
- if (ppixhm)
- *ppixhm = pixhm;
- else
- pixDestroy(&pixhm);
- if (ppixtm)
- *ppixtm = pixtm;
- else
- pixDestroy(&pixtm);
- if (ppixtb)
- *ppixtb = pixtb;
- else
- pixDestroy(&pixtb);
-
- return 0;
-}
-
-
-/*------------------------------------------------------------------*
- * Halftone region extraction *
- *------------------------------------------------------------------*/
-/*!
- * \brief pixGenHalftoneMask()
- *
- *
- * Deprecated:
- * This wrapper avoids an ABI change with tesseract 3.0.4.
- * It should be removed when we no longer need to support 3.0.4.
- * The debug parameter is ignored (assumed 0).
- *
- */
-PIX *
-pixGenHalftoneMask(PIX *pixs,
- PIX **ppixtext,
- l_int32 *phtfound,
- l_int32 debug)
-{
- return pixGenerateHalftoneMask(pixs, ppixtext, phtfound, NULL);
-}
-
-
-/*!
- * \brief pixGenerateHalftoneMask()
- *
- * \param[in] pixs 1 bpp, assumed to be 150 to 200 ppi
- * \param[out] ppixtext [optional] text part of pixs
- * \param[out] phtfound [optional] 1 if the mask is not empty
- * \param[in] pixadb input for collecting debug pix; use NULL to skip
- * \return pixd halftone mask, or NULL on error
- *
- *
- * Notes:
- * (1) This is not intended to work on small thumbnails. The
- * dimensions of pixs must be at least MinWidth x MinHeight.
- *
- */
-PIX *
-pixGenerateHalftoneMask(PIX *pixs,
- PIX **ppixtext,
- l_int32 *phtfound,
- PIXA *pixadb)
-{
-l_int32 w, h, empty;
-PIX *pix1, *pix2, *pixhs, *pixhm, *pixd;
-
- PROCNAME("pixGenerateHalftoneMask");
-
- if (ppixtext) *ppixtext = NULL;
- if (phtfound) *phtfound = 0;
- if (!pixs || pixGetDepth(pixs) != 1)
- return (PIX *)ERROR_PTR("pixs undefined or not 1 bpp", procName, NULL);
- pixGetDimensions(pixs, &w, &h, NULL);
- if (w < MinWidth || h < MinHeight) {
- L_ERROR("pix too small: w = %d, h = %d\n", procName, w, h);
- return NULL;
- }
-
- /* Compute seed for halftone parts at 8x reduction */
- pix1 = pixReduceRankBinaryCascade(pixs, 4, 4, 0, 0);
- pix2 = pixOpenBrick(NULL, pix1, 5, 5);
- pixhs = pixExpandReplicate(pix2, 4); /* back to 2x reduction */
- pixDestroy(&pix1);
- pixDestroy(&pix2);
- if (pixadb) pixaAddPix(pixadb, pixhs, L_COPY);
-
- /* Compute mask for connected regions */
- pixhm = pixCloseSafeBrick(NULL, pixs, 4, 4);
- if (pixadb) pixaAddPix(pixadb, pixhm, L_COPY);
-
- /* Fill seed into mask to get halftone mask */
- pixd = pixSeedfillBinary(NULL, pixhs, pixhm, 4);
- if (pixadb) pixaAddPix(pixadb, pixd, L_COPY);
-
-#if 0
- pixOpenBrick(pixd, pixd, 9, 9);
-#endif
-
- /* Check if mask is empty */
- pixZero(pixd, &empty);
- if (phtfound && !empty)
- *phtfound = 1;
-
- /* Optionally, get all pixels that are not under the halftone mask */
- if (ppixtext) {
- if (empty)
- *ppixtext = pixCopy(NULL, pixs);
- else
- *ppixtext = pixSubtract(NULL, pixs, pixd);
- if (pixadb) pixaAddPix(pixadb, *ppixtext, L_COPY);
- }
-
- pixDestroy(&pixhs);
- pixDestroy(&pixhm);
- return pixd;
-}
-
-
-/*------------------------------------------------------------------*
- * Textline extraction *
- *------------------------------------------------------------------*/
-/*!
- * \brief pixGenTextlineMask()
- *
- * \param[in] pixs 1 bpp, assumed to be 150 to 200 ppi
- * \param[out] ppixvws vertical whitespace mask
- * \param[out] ptlfound [optional] 1 if the mask is not empty
- * \param[in] pixadb input for collecting debug pix; use NULL to skip
- * \return pixd textline mask, or NULL on error
- *
- *
- * Notes:
- * (1) The input pixs should be deskewed.
- * (2) pixs should have no halftone pixels.
- * (3) This is not intended to work on small thumbnails. The
- * dimensions of pixs must be at least MinWidth x MinHeight.
- * (4) Both the input image and the returned textline mask
- * are at the same resolution.
- *
- */
-PIX *
-pixGenTextlineMask(PIX *pixs,
- PIX **ppixvws,
- l_int32 *ptlfound,
- PIXA *pixadb)
-{
-l_int32 w, h, empty;
-PIX *pix1, *pix2, *pixvws, *pixd;
-
- PROCNAME("pixGenTextlineMask");
-
- if (ptlfound) *ptlfound = 0;
- if (!ppixvws)
- return (PIX *)ERROR_PTR("&pixvws not defined", procName, NULL);
- *ppixvws = NULL;
- if (!pixs || pixGetDepth(pixs) != 1)
- return (PIX *)ERROR_PTR("pixs undefined or not 1 bpp", procName, NULL);
- pixGetDimensions(pixs, &w, &h, NULL);
- if (w < MinWidth || h < MinHeight) {
- L_ERROR("pix too small: w = %d, h = %d\n", procName, w, h);
- return NULL;
- }
-
- /* First we need a vertical whitespace mask. Invert the image. */
- pix1 = pixInvert(NULL, pixs);
-
- /* The whitespace mask will break textlines where there
- * is a large amount of white space below or above.
- * This can be prevented by identifying regions of the
- * inverted image that have large horizontal extent (bigger than
- * the separation between columns) and significant
- * vertical extent (bigger than the separation between
- * textlines), and subtracting this from the bg. */
- pix2 = pixMorphCompSequence(pix1, "o80.60", 0);
- pixSubtract(pix1, pix1, pix2);
- if (pixadb) pixaAddPix(pixadb, pix1, L_COPY);
- pixDestroy(&pix2);
-
- /* Identify vertical whitespace by opening the remaining bg.
- * o5.1 removes thin vertical bg lines and o1.200 extracts
- * long vertical bg lines. */
- pixvws = pixMorphCompSequence(pix1, "o5.1 + o1.200", 0);
- *ppixvws = pixvws;
- if (pixadb) pixaAddPix(pixadb, pixvws, L_COPY);
- pixDestroy(&pix1);
-
- /* Three steps to getting text line mask:
- * (1) close the characters and words in the textlines
- * (2) open the vertical whitespace corridors back up
- * (3) small opening to remove noise */
- pix1 = pixMorphSequence(pixs, "c30.1", 0);
- if (pixadb) pixaAddPix(pixadb, pix1, L_COPY);
- pixd = pixSubtract(NULL, pix1, pixvws);
- pixOpenBrick(pixd, pixd, 3, 3);
- if (pixadb) pixaAddPix(pixadb, pixd, L_COPY);
- pixDestroy(&pix1);
-
- /* Check if text line mask is empty */
- if (ptlfound) {
- pixZero(pixd, &empty);
- if (!empty)
- *ptlfound = 1;
- }
-
- return pixd;
-}
-
-
-/*------------------------------------------------------------------*
- * Textblock extraction *
- *------------------------------------------------------------------*/
-/*!
- * \brief pixGenTextblockMask()
- *
- * \param[in] pixs 1 bpp, textline mask, assumed to be 150 to 200 ppi
- * \param[in] pixvws vertical white space mask
- * \param[in] pixadb input for collecting debug pix; use NULL to skip
- * \return pixd textblock mask, or NULL if empty or on error
- *
- *
- * Notes:
- * (1) Both the input masks (textline and vertical white space) and
- * the returned textblock mask are at the same resolution.
- * (2) This is not intended to work on small thumbnails. The
- * dimensions of pixs must be at least MinWidth x MinHeight.
- * (3) The result is somewhat noisy, in that small "blocks" of
- * text may be included. These can be removed by post-processing,
- * using, e.g.,
- * pixSelectBySize(pix, 60, 60, 4, L_SELECT_IF_EITHER,
- * L_SELECT_IF_GTE, NULL);
- *
- */
-PIX *
-pixGenTextblockMask(PIX *pixs,
- PIX *pixvws,
- PIXA *pixadb)
-{
-l_int32 w, h, empty;
-PIX *pix1, *pix2, *pix3, *pixd;
-
- PROCNAME("pixGenTextblockMask");
-
- if (!pixs || pixGetDepth(pixs) != 1)
- return (PIX *)ERROR_PTR("pixs undefined or not 1 bpp", procName, NULL);
- pixGetDimensions(pixs, &w, &h, NULL);
- if (w < MinWidth || h < MinHeight) {
- L_ERROR("pix too small: w = %d, h = %d\n", procName, w, h);
- return NULL;
- }
- if (!pixvws)
- return (PIX *)ERROR_PTR("pixvws not defined", procName, NULL);
-
- /* Join pixels vertically to make a textblock mask */
- pix1 = pixMorphSequence(pixs, "c1.10 + o4.1", 0);
- pixZero(pix1, &empty);
- if (empty) {
- pixDestroy(&pix1);
- L_INFO("no fg pixels in textblock mask\n", procName);
- return NULL;
- }
- if (pixadb) pixaAddPix(pixadb, pix1, L_COPY);
-
- /* Solidify the textblock mask and remove noise:
- * (1) For each cc, close the blocks and dilate slightly
- * to form a solid mask.
- * (2) Small horizontal closing between components.
- * (3) Open the white space between columns, again.
- * (4) Remove small components. */
- pix2 = pixMorphSequenceByComponent(pix1, "c30.30 + d3.3", 8, 0, 0, NULL);
- pixCloseSafeBrick(pix2, pix2, 10, 1);
- if (pixadb) pixaAddPix(pixadb, pix2, L_COPY);
- pix3 = pixSubtract(NULL, pix2, pixvws);
- if (pixadb) pixaAddPix(pixadb, pix3, L_COPY);
- pixd = pixSelectBySize(pix3, 25, 5, 8, L_SELECT_IF_BOTH,
- L_SELECT_IF_GTE, NULL);
- if (pixadb) pixaAddPix(pixadb, pixd, L_COPY);
-
- pixDestroy(&pix1);
- pixDestroy(&pix2);
- pixDestroy(&pix3);
- return pixd;
-}
-
-
-/*------------------------------------------------------------------*
- * Location of page foreground *
- *------------------------------------------------------------------*/
-/*!
- * \brief pixFindPageForeground()
- *
- * \param[in] pixs full resolution (any type or depth
- * \param[in] threshold for binarization; typically about 128
- * \param[in] mindist min distance of text from border to allow
- * cleaning near border; at 2x reduction, this
- * should be larger than 50; typically about 70
- * \param[in] erasedist when conditions are satisfied, erase anything
- * within this distance of the edge;
- * typically 20-30 at 2x reduction
- * \param[in] showmorph debug: set to a negative integer to show steps
- * in generating masks; this is typically used
- * for debugging region extraction
- * \param[in] pixac debug: allocate outside and pass this in to
- * accumulate results of each call to this function,
- * which can be displayed in a mosaic or a pdf.
- * \return box region including foreground, with some pixel noise
- * removed, or NULL if not found
- *
- *
- * Notes:
- * (1) This doesn't simply crop to the fg. It attempts to remove
- * pixel noise and junk at the edge of the image before cropping.
- * The input %threshold is used if pixs is not 1 bpp.
- * (2) This is not intended to work on small thumbnails. The
- * dimensions of pixs must be at least MinWidth x MinHeight.
- * (3) Debug: set showmorph to display the intermediate image in
- * the morphological operations on this page.
- * (4) Debug: to get pdf output of results when called repeatedly,
- * call with an existing pixac, which will add an image of this page,
- * with the fg outlined. If no foreground is found, there is
- * no output for this page image.
- *
- */
-BOX *
-pixFindPageForeground(PIX *pixs,
- l_int32 threshold,
- l_int32 mindist,
- l_int32 erasedist,
- l_int32 showmorph,
- PIXAC *pixac)
-{
-l_int32 flag, nbox, intersects;
-l_int32 w, h, bx, by, bw, bh, left, right, top, bottom;
-PIX *pixb, *pixb2, *pixseed, *pixsf, *pixm, *pix1, *pixg2;
-BOX *box, *boxfg, *boxin, *boxd;
-BOXA *ba1, *ba2;
-
- PROCNAME("pixFindPageForeground");
-
- if (!pixs)
- return (BOX *)ERROR_PTR("pixs not defined", procName, NULL);
- pixGetDimensions(pixs, &w, &h, NULL);
- if (w < MinWidth || h < MinHeight) {
- L_ERROR("pix too small: w = %d, h = %d\n", procName, w, h);
- return NULL;
- }
-
- /* Binarize, downscale by 0.5, remove the noise to generate a seed,
- * and do a seedfill back from the seed into those 8-connected
- * components of the binarized image for which there was at least
- * one seed pixel. Also clear out any components that are within
- * 10 pixels of the edge at 2x reduction. */
- flag = (showmorph) ? 100 : 0;
- pixb = pixConvertTo1(pixs, threshold);
- pixb2 = pixScale(pixb, 0.5, 0.5);
- pixseed = pixMorphSequence(pixb2, "o1.2 + c9.9 + o3.3", flag);
- pix1 = pixMorphSequence(pixb2, "o50.1", 0);
- pixOr(pixseed, pixseed, pix1);
- pixDestroy(&pix1);
- pix1 = pixMorphSequence(pixb2, "o1.50", 0);
- pixOr(pixseed, pixseed, pix1);
- pixDestroy(&pix1);
- pixsf = pixSeedfillBinary(NULL, pixseed, pixb2, 8);
- pixSetOrClearBorder(pixsf, 10, 10, 10, 10, PIX_SET);
- pixm = pixRemoveBorderConnComps(pixsf, 8);
-
- /* Now, where is the main block of text? We want to remove noise near
- * the edge of the image, but to do that, we have to be convinced that
- * (1) there is noise and (2) it is far enough from the text block
- * and close enough to the edge. For each edge, if the block
- * is more than mindist from that edge, then clean 'erasedist'
- * pixels from the edge. */
- pix1 = pixMorphSequence(pixm, "c50.50", flag);
- ba1 = pixConnComp(pix1, NULL, 8);
- ba2 = boxaSort(ba1, L_SORT_BY_AREA, L_SORT_DECREASING, NULL);
- pixGetDimensions(pix1, &w, &h, NULL);
- nbox = boxaGetCount(ba2);
- if (nbox > 1) {
- box = boxaGetBox(ba2, 0, L_CLONE);
- boxGetGeometry(box, &bx, &by, &bw, &bh);
- left = (bx > mindist) ? erasedist : 0;
- right = (w - bx - bw > mindist) ? erasedist : 0;
- top = (by > mindist) ? erasedist : 0;
- bottom = (h - by - bh > mindist) ? erasedist : 0;
- pixSetOrClearBorder(pixm, left, right, top, bottom, PIX_CLR);
- boxDestroy(&box);
- }
- pixDestroy(&pix1);
- boxaDestroy(&ba1);
- boxaDestroy(&ba2);
-
- /* Locate the foreground region; don't bother cropping */
- pixClipToForeground(pixm, NULL, &boxfg);
-
- /* Sanity check the fg region. Make sure it's not confined
- * to a thin boundary on the left and right sides of the image,
- * in which case it is likely to be noise. */
- if (boxfg) {
- boxin = boxCreate(0.1 * w, 0, 0.8 * w, h);
- boxIntersects(boxfg, boxin, &intersects);
- boxDestroy(&boxin);
- if (!intersects) boxDestroy(&boxfg);
- }
-
- boxd = NULL;
- if (boxfg) {
- boxAdjustSides(boxfg, boxfg, -2, 2, -2, 2); /* tiny expansion */
- boxd = boxTransform(boxfg, 0, 0, 2.0, 2.0);
-
- /* Save the debug image showing the box for this page */
- if (pixac) {
- pixg2 = pixConvert1To4Cmap(pixb);
- pixRenderBoxArb(pixg2, boxd, 3, 255, 0, 0);
- pixacompAddPix(pixac, pixg2, IFF_DEFAULT);
- pixDestroy(&pixg2);
- }
- }
-
- pixDestroy(&pixb);
- pixDestroy(&pixb2);
- pixDestroy(&pixseed);
- pixDestroy(&pixsf);
- pixDestroy(&pixm);
- boxDestroy(&boxfg);
- return boxd;
-}
-
-
-/*------------------------------------------------------------------*
- * Extraction of characters from image with only text *
- *------------------------------------------------------------------*/
-/*!
- * \brief pixSplitIntoCharacters()
- *
- * \param[in] pixs 1 bpp, contains only deskewed text
- * \param[in] minw min component width for initial filtering; typ. 4
- * \param[in] minh min component height for initial filtering; typ. 4
- * \param[out] pboxa [optional] character bounding boxes
- * \param[out] ppixa [optional] character images
- * \param[out] ppixdebug [optional] showing splittings
- *
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This is a simple function that attempts to find split points
- * based on vertical pixel profiles.
- * (2) It should be given an image that has an arbitrary number
- * of text characters.
- * (3) The returned pixa includes the boxes from which the
- * (possibly split) components are extracted.
- *
- */
-l_ok
-pixSplitIntoCharacters(PIX *pixs,
- l_int32 minw,
- l_int32 minh,
- BOXA **pboxa,
- PIXA **ppixa,
- PIX **ppixdebug)
-{
-l_int32 ncomp, i, xoff, yoff;
-BOXA *boxa1, *boxa2, *boxat1, *boxat2, *boxad;
-BOXAA *baa;
-PIX *pix, *pix1, *pix2, *pixdb;
-PIXA *pixa1, *pixadb;
-
- PROCNAME("pixSplitIntoCharacters");
-
- if (pboxa) *pboxa = NULL;
- if (ppixa) *ppixa = NULL;
- if (ppixdebug) *ppixdebug = NULL;
- if (!pixs || pixGetDepth(pixs) != 1)
- return ERROR_INT("pixs not defined or not 1 bpp", procName, 1);
-
- /* Remove the small stuff */
- pix1 = pixSelectBySize(pixs, minw, minh, 8, L_SELECT_IF_BOTH,
- L_SELECT_IF_GT, NULL);
-
- /* Small vertical close for consolidation */
- pix2 = pixMorphSequence(pix1, "c1.10", 0);
- pixDestroy(&pix1);
-
- /* Get the 8-connected components */
- boxa1 = pixConnComp(pix2, &pixa1, 8);
- pixDestroy(&pix2);
- boxaDestroy(&boxa1);
-
- /* Split the components if obvious */
- ncomp = pixaGetCount(pixa1);
- boxa2 = boxaCreate(ncomp);
- pixadb = (ppixdebug) ? pixaCreate(ncomp) : NULL;
- for (i = 0; i < ncomp; i++) {
- pix = pixaGetPix(pixa1, i, L_CLONE);
- if (ppixdebug) {
- boxat1 = pixSplitComponentWithProfile(pix, 10, 7, &pixdb);
- if (pixdb)
- pixaAddPix(pixadb, pixdb, L_INSERT);
- } else {
- boxat1 = pixSplitComponentWithProfile(pix, 10, 7, NULL);
- }
- pixaGetBoxGeometry(pixa1, i, &xoff, &yoff, NULL, NULL);
- boxat2 = boxaTransform(boxat1, xoff, yoff, 1.0, 1.0);
- boxaJoin(boxa2, boxat2, 0, -1);
- pixDestroy(&pix);
- boxaDestroy(&boxat1);
- boxaDestroy(&boxat2);
- }
- pixaDestroy(&pixa1);
-
- /* Generate the debug image */
- if (ppixdebug) {
- if (pixaGetCount(pixadb) > 0) {
- *ppixdebug = pixaDisplayTiledInRows(pixadb, 32, 1500,
- 1.0, 0, 20, 1);
- }
- pixaDestroy(&pixadb);
- }
-
- /* Do a 2D sort on the bounding boxes, and flatten the result to 1D */
- baa = boxaSort2d(boxa2, NULL, 0, 0, 5);
- boxad = boxaaFlattenToBoxa(baa, NULL, L_CLONE);
- boxaaDestroy(&baa);
- boxaDestroy(&boxa2);
-
- /* Optionally extract the pieces from the input image */
- if (ppixa)
- *ppixa = pixClipRectangles(pixs, boxad);
- if (pboxa)
- *pboxa = boxad;
- else
- boxaDestroy(&boxad);
- return 0;
-}
-
-
-/*!
- * \brief pixSplitComponentWithProfile()
- *
- * \param[in] pixs 1 bpp, exactly one connected component
- * \param[in] delta distance used in extrema finding in a numa; typ. 10
- * \param[in] mindel minimum required difference between profile
- * minimum and profile values +2 and -2 away; typ. 7
- * \param[out] ppixdebug [optional] debug image of splitting
- * \return boxa of c.c. after splitting, or NULL on error
- *
- *
- * Notes:
- * (1) This will split the most obvious cases of touching characters.
- * The split points it is searching for are narrow and deep
- * minimima in the vertical pixel projection profile, after a
- * large vertical closing has been applied to the component.
- *
- */
-BOXA *
-pixSplitComponentWithProfile(PIX *pixs,
- l_int32 delta,
- l_int32 mindel,
- PIX **ppixdebug)
-{
-l_int32 w, h, n2, i, firstmin, xmin, xshift;
-l_int32 nmin, nleft, nright, nsplit, isplit, ncomp;
-l_int32 *array1, *array2;
-BOX *box;
-BOXA *boxad;
-NUMA *na1, *na2, *nasplit;
-PIX *pix1, *pixdb;
-
- PROCNAME("pixSplitComponentsWithProfile");
-
- if (ppixdebug) *ppixdebug = NULL;
- if (!pixs || pixGetDepth(pixs) != 1)
- return (BOXA *)ERROR_PTR("pixa undefined or not 1 bpp", procName, NULL);
- pixGetDimensions(pixs, &w, &h, NULL);
-
- /* Closing to consolidate characters vertically */
- pix1 = pixCloseSafeBrick(NULL, pixs, 1, 100);
-
- /* Get extrema of column projections */
- boxad = boxaCreate(2);
- na1 = pixCountPixelsByColumn(pix1); /* w elements */
- pixDestroy(&pix1);
- na2 = numaFindExtrema(na1, delta, NULL);
- n2 = numaGetCount(na2);
- if (n2 < 3) { /* no split possible */
- box = boxCreate(0, 0, w, h);
- boxaAddBox(boxad, box, L_INSERT);
- numaDestroy(&na1);
- numaDestroy(&na2);
- return boxad;
- }
-
- /* Look for sufficiently deep and narrow minima.
- * All minima of of interest must be surrounded by max on each
- * side. firstmin is the index of first possible minimum. */
- array1 = numaGetIArray(na1);
- array2 = numaGetIArray(na2);
- if (ppixdebug) numaWriteStderr(na2);
- firstmin = (array1[array2[0]] > array1[array2[1]]) ? 1 : 2;
- nasplit = numaCreate(n2); /* will hold split locations */
- for (i = firstmin; i < n2 - 1; i+= 2) {
- xmin = array2[i];
- nmin = array1[xmin];
- if (xmin + 2 >= w) break; /* no more splits possible */
- nleft = array1[xmin - 2];
- nright = array1[xmin + 2];
- if (ppixdebug) {
- lept_stderr(
- "Splitting: xmin = %d, w = %d; nl = %d, nmin = %d, nr = %d\n",
- xmin, w, nleft, nmin, nright);
- }
- if (nleft - nmin >= mindel && nright - nmin >= mindel) /* split */
- numaAddNumber(nasplit, xmin);
- }
- nsplit = numaGetCount(nasplit);
-
-#if 0
- if (ppixdebug && nsplit > 0) {
- lept_mkdir("lept/split");
- gplotSimple1(na1, GPLOT_PNG, "/tmp/lept/split/split", NULL);
- }
-#endif
-
- numaDestroy(&na1);
- numaDestroy(&na2);
- LEPT_FREE(array1);
- LEPT_FREE(array2);
-
- if (nsplit == 0) { /* no splitting */
- numaDestroy(&nasplit);
- box = boxCreate(0, 0, w, h);
- boxaAddBox(boxad, box, L_INSERT);
- return boxad;
- }
-
- /* Use split points to generate b.b. after splitting */
- for (i = 0, xshift = 0; i < nsplit; i++) {
- numaGetIValue(nasplit, i, &isplit);
- box = boxCreate(xshift, 0, isplit - xshift, h);
- boxaAddBox(boxad, box, L_INSERT);
- xshift = isplit + 1;
- }
- box = boxCreate(xshift, 0, w - xshift, h);
- boxaAddBox(boxad, box, L_INSERT);
- numaDestroy(&nasplit);
-
- if (ppixdebug) {
- pixdb = pixConvertTo32(pixs);
- ncomp = boxaGetCount(boxad);
- for (i = 0; i < ncomp; i++) {
- box = boxaGetBox(boxad, i, L_CLONE);
- pixRenderBoxBlend(pixdb, box, 1, 255, 0, 0, 0.5);
- boxDestroy(&box);
- }
- *ppixdebug = pixdb;
- }
-
- return boxad;
-}
-
-
-/*------------------------------------------------------------------*
- * Extraction of lines of text *
- *------------------------------------------------------------------*/
-/*!
- * \brief pixExtractTextlines()
- *
- * \param[in] pixs any depth, assumed to have nearly horizontal text
- * \param[in] maxw, maxh initial filtering: remove any components in pixs
- * with components larger than maxw or maxh
- * \param[in] minw, minh final filtering: remove extracted 'lines'
- * with sizes smaller than minw or minh; use
- * 0 for default.
- * \param[in] adjw, adjh final adjustment of boxes representing each
- * text line. If > 0, these increase the box
- * size at each edge by this amount.
- * \param[in] pixadb pixa for saving intermediate steps; NULL to omit
- * \return pixa of textline images, including bounding boxes, or
- * NULL on error
- *
- *
- * Notes:
- * (1) This function assumes that textline fragments have sufficient
- * vertical separation and small enough skew so that a
- * horizontal dilation sufficient to join words will not join
- * textlines. It does not guarantee that horizontally adjacent
- * textline fragments on the same line will be joined.
- * (2) For images with multiple columns, it attempts to avoid joining
- * textlines across the space between columns. If that is not
- * a concern, you can also use pixExtractRawTextlines(),
- * which will join them with alacrity.
- * (3) This first removes components from pixs that are either
- * wide (> %maxw) or tall (> %maxh).
- * (4) A final filtering operation removes small components, such
- * that width < %minw or height < %minh.
- * (5) For reasonable accuracy, the resolution of pixs should be
- * at least 100 ppi. For reasonable efficiency, the resolution
- * should not exceed 600 ppi.
- * (6) This can be used to determine if some region of a scanned
- * image is horizontal text.
- * (7) As an example, for a pix with resolution 300 ppi, a reasonable
- * set of parameters is:
- * pixExtractTextlines(pix, 150, 150, 36, 20, 5, 5, NULL);
- * The defaults minw and minh for 300 ppi are about 36 and 20,
- * so the same result is obtained with:
- * pixExtractTextlines(pix, 150, 150, 0, 0, 5, 5, NULL);
- * (8) The output pixa is composed of subimages, one for each textline,
- * and the boxa in the pixa tells where in %pixs each textline goes.
- *
- */
-PIXA *
-pixExtractTextlines(PIX *pixs,
- l_int32 maxw,
- l_int32 maxh,
- l_int32 minw,
- l_int32 minh,
- l_int32 adjw,
- l_int32 adjh,
- PIXA *pixadb)
-{
-char buf[64];
-l_int32 res, csize, empty;
-BOXA *boxa1, *boxa2, *boxa3;
-PIX *pix1, *pix2, *pix3;
-PIXA *pixa1, *pixa2, *pixa3;
-
- PROCNAME("pixExtractTextlines");
-
- if (!pixs)
- return (PIXA *)ERROR_PTR("pixs not defined", procName, NULL);
-
- /* Binarize carefully, if necessary */
- if (pixGetDepth(pixs) > 1) {
- pix2 = pixConvertTo8(pixs, FALSE);
- pix3 = pixCleanBackgroundToWhite(pix2, NULL, NULL, 1.0, 70, 190);
- pix1 = pixThresholdToBinary(pix3, 150);
- pixDestroy(&pix2);
- pixDestroy(&pix3);
- } else {
- pix1 = pixClone(pixs);
- }
- pixZero(pix1, &empty);
- if (empty) {
- pixDestroy(&pix1);
- L_INFO("no fg pixels in input image\n", procName);
- return NULL;
- }
- if (pixadb) pixaAddPix(pixadb, pix1, L_COPY);
-
- /* Remove any very tall or very wide connected components */
- pix2 = pixSelectBySize(pix1, maxw, maxh, 8, L_SELECT_IF_BOTH,
- L_SELECT_IF_LT, NULL);
- if (pixadb) pixaAddPix(pixadb, pix2, L_COPY);
- pixDestroy(&pix1);
-
- /* Filter to solidify the text lines within the x-height region.
- * The closing (csize) bridges gaps between words. The opening
- * removes isolated bridges between textlines. */
- if ((res = pixGetXRes(pixs)) == 0) {
- L_INFO("Resolution is not set: setting to 300 ppi\n", procName);
- res = 300;
- }
- csize = L_MIN(120., 60.0 * res / 300.0);
- snprintf(buf, sizeof(buf), "c%d.1 + o%d.1", csize, csize / 3);
- pix3 = pixMorphCompSequence(pix2, buf, 0);
- if (pixadb) pixaAddPix(pixadb, pix3, L_COPY);
-
- /* Extract the connected components. These should be dilated lines */
- boxa1 = pixConnComp(pix3, &pixa1, 4);
- if (pixadb) {
- pix1 = pixaDisplayRandomCmap(pixa1, 0, 0);
- pixcmapResetColor(pixGetColormap(pix1), 0, 255, 255, 255);
- pixaAddPix(pixadb, pix1, L_INSERT);
- }
-
- /* Set minw, minh if default is requested */
- minw = (minw != 0) ? minw : (l_int32)(0.12 * res);
- minh = (minh != 0) ? minh : (l_int32)(0.07 * res);
-
- /* Remove line components that are too small */
- pixa2 = pixaSelectBySize(pixa1, minw, minh, L_SELECT_IF_BOTH,
- L_SELECT_IF_GTE, NULL);
- if (pixadb) {
- pix1 = pixaDisplayRandomCmap(pixa2, 0, 0);
- pixcmapResetColor(pixGetColormap(pix1), 0, 255, 255, 255);
- pixaAddPix(pixadb, pix1, L_INSERT);
- pix1 = pixConvertTo32(pix2);
- pixRenderBoxaArb(pix1, pixa2->boxa, 2, 255, 0, 0);
- pixaAddPix(pixadb, pix1, L_INSERT);
- }
-
- /* Selectively AND with the version before dilation, and save */
- boxa2 = pixaGetBoxa(pixa2, L_CLONE);
- boxa3 = boxaAdjustSides(boxa2, -adjw, adjw, -adjh, adjh);
- pixa3 = pixClipRectangles(pix2, boxa3);
- if (pixadb) {
- pix1 = pixaDisplayRandomCmap(pixa3, 0, 0);
- pixcmapResetColor(pixGetColormap(pix1), 0, 255, 255, 255);
- pixaAddPix(pixadb, pix1, L_INSERT);
- }
-
- pixDestroy(&pix2);
- pixDestroy(&pix3);
- pixaDestroy(&pixa1);
- pixaDestroy(&pixa2);
- boxaDestroy(&boxa1);
- boxaDestroy(&boxa2);
- boxaDestroy(&boxa3);
- return pixa3;
-}
-
-
-/*!
- * \brief pixExtractRawTextlines()
- *
- * \param[in] pixs any depth, assumed to have nearly horizontal text
- * \param[in] maxw, maxh initial filtering: remove any components in pixs
- * with components larger than maxw or maxh;
- * use 0 for default values.
- * \param[in] adjw, adjh final adjustment of boxes representing each
- * text line. If > 0, these increase the box
- * size at each edge by this amount.
- * \param[in] pixadb pixa for saving intermediate steps; NULL to omit
- * \return pixa of textline images, including bounding boxes, or
- * NULL on error
- *
- *
- * Notes:
- * (1) This function assumes that textlines have sufficient
- * vertical separation and small enough skew so that a
- * horizontal dilation sufficient to join words will not join
- * textlines. It aggressively joins textlines across multiple
- * columns, so if that is not desired, you must either (a) make
- * sure that %pixs is a single column of text or (b) use instead
- * pixExtractTextlines(), which is more conservative
- * about joining text fragments that have vertical overlap.
- * (2) This first removes components from pixs that are either
- * very wide (> %maxw) or very tall (> %maxh).
- * (3) For reasonable accuracy, the resolution of pixs should be
- * at least 100 ppi. For reasonable efficiency, the resolution
- * should not exceed 600 ppi.
- * (4) This can be used to determine if some region of a scanned
- * image is horizontal text.
- * (5) As an example, for a pix with resolution 300 ppi, a reasonable
- * set of parameters is:
- * pixExtractRawTextlines(pix, 150, 150, 0, 0, NULL);
- * (6) The output pixa is composed of subimages, one for each textline,
- * and the boxa in the pixa tells where in %pixs each textline goes.
- *
- */
-PIXA *
-pixExtractRawTextlines(PIX *pixs,
- l_int32 maxw,
- l_int32 maxh,
- l_int32 adjw,
- l_int32 adjh,
- PIXA *pixadb)
-{
-char buf[64];
-l_int32 res, csize, empty;
-BOXA *boxa1, *boxa2, *boxa3;
-BOXAA *baa1;
-PIX *pix1, *pix2, *pix3;
-PIXA *pixa1, *pixa2;
-
- PROCNAME("pixExtractRawTextlines");
-
- if (!pixs)
- return (PIXA *)ERROR_PTR("pixs not defined", procName, NULL);
-
- /* Set maxw, maxh if default is requested */
- if ((res = pixGetXRes(pixs)) == 0) {
- L_INFO("Resolution is not set: setting to 300 ppi\n", procName);
- res = 300;
- }
- maxw = (maxw != 0) ? maxw : (l_int32)(0.5 * res);
- maxh = (maxh != 0) ? maxh : (l_int32)(0.5 * res);
-
- /* Binarize carefully, if necessary */
- if (pixGetDepth(pixs) > 1) {
- pix2 = pixConvertTo8(pixs, FALSE);
- pix3 = pixCleanBackgroundToWhite(pix2, NULL, NULL, 1.0, 70, 190);
- pix1 = pixThresholdToBinary(pix3, 150);
- pixDestroy(&pix2);
- pixDestroy(&pix3);
- } else {
- pix1 = pixClone(pixs);
- }
- pixZero(pix1, &empty);
- if (empty) {
- pixDestroy(&pix1);
- L_INFO("no fg pixels in input image\n", procName);
- return NULL;
- }
- if (pixadb) pixaAddPix(pixadb, pix1, L_COPY);
-
- /* Remove any very tall or very wide connected components */
- pix2 = pixSelectBySize(pix1, maxw, maxh, 8, L_SELECT_IF_BOTH,
- L_SELECT_IF_LT, NULL);
- if (pixadb) pixaAddPix(pixadb, pix2, L_COPY);
- pixDestroy(&pix1);
-
- /* Filter to solidify the text lines within the x-height region.
- * The closing (csize) bridges gaps between words. */
- csize = L_MIN(120., 60.0 * res / 300.0);
- snprintf(buf, sizeof(buf), "c%d.1", csize);
- pix3 = pixMorphCompSequence(pix2, buf, 0);
- if (pixadb) pixaAddPix(pixadb, pix3, L_COPY);
-
- /* Extract the connected components. These should be dilated lines */
- boxa1 = pixConnComp(pix3, &pixa1, 4);
- if (pixadb) {
- pix1 = pixaDisplayRandomCmap(pixa1, 0, 0);
- pixcmapResetColor(pixGetColormap(pix1), 0, 255, 255, 255);
- pixaAddPix(pixadb, pix1, L_INSERT);
- }
-
- /* Do a 2-d sort, and generate a bounding box for each set of text
- * line segments that is aligned horizontally (i.e., has vertical
- * overlap) into a box representing a single text line. */
- baa1 = boxaSort2d(boxa1, NULL, -1, -1, 5);
- boxaaGetExtent(baa1, NULL, NULL, NULL, &boxa2);
- if (pixadb) {
- pix1 = pixConvertTo32(pix2);
- pixRenderBoxaArb(pix1, boxa2, 2, 255, 0, 0);
- pixaAddPix(pixadb, pix1, L_INSERT);
- }
-
- /* Optionally adjust the sides of each text line box, and then
- * use the boxes to generate a pixa of the text lines. */
- boxa3 = boxaAdjustSides(boxa2, -adjw, adjw, -adjh, adjh);
- pixa2 = pixClipRectangles(pix2, boxa3);
- if (pixadb) {
- pix1 = pixaDisplayRandomCmap(pixa2, 0, 0);
- pixcmapResetColor(pixGetColormap(pix1), 0, 255, 255, 255);
- pixaAddPix(pixadb, pix1, L_INSERT);
- }
-
- pixDestroy(&pix2);
- pixDestroy(&pix3);
- pixaDestroy(&pixa1);
- boxaDestroy(&boxa1);
- boxaDestroy(&boxa2);
- boxaDestroy(&boxa3);
- boxaaDestroy(&baa1);
- return pixa2;
-}
-
-
-/*------------------------------------------------------------------*
- * How many text columns *
- *------------------------------------------------------------------*/
-/*!
- * \brief pixCountTextColumns()
- *
- * \param[in] pixs 1 bpp
- * \param[in] deltafract fraction of (max - min) to be used in the delta
- * for extrema finding; typ 0.3
- * \param[in] peakfract fraction of (max - min) to be used to threshold
- * the peak value; typ. 0.5
- * \param[in] clipfract fraction of image dimension removed on each side;
- * typ. 0.1, which leaves w and h reduced by 0.8
- * \param[out] pncols number of columns; -1 if not determined
- * \param[in] pixadb [optional] pre-allocated, for showing
- * intermediate computation; use null to skip
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) It is assumed that pixs has the correct resolution set.
- * If the resolution is 0, we set to 300 and issue a warning.
- * (2) If necessary, the image is scaled to between 37 and 75 ppi;
- * most of the processing is done at this resolution.
- * (3) If no text is found (essentially a blank page),
- * this returns ncols = 0.
- * (4) For debug output, input a pre-allocated pixa.
- *
- */
-l_ok
-pixCountTextColumns(PIX *pixs,
- l_float32 deltafract,
- l_float32 peakfract,
- l_float32 clipfract,
- l_int32 *pncols,
- PIXA *pixadb)
-{
-l_int32 w, h, res, i, n, npeak;
-l_float32 scalefact, redfact, minval, maxval, val4, val5, fract;
-BOX *box;
-NUMA *na1, *na2, *na3, *na4, *na5;
-PIX *pix1, *pix2, *pix3, *pix4, *pix5;
-
- PROCNAME("pixCountTextColumns");
-
- if (!pncols)
- return ERROR_INT("&ncols not defined", procName, 1);
- *pncols = -1; /* init */
- if (!pixs || pixGetDepth(pixs) != 1)
- return ERROR_INT("pixs not defined or not 1 bpp", procName, 1);
- if (deltafract < 0.15 || deltafract > 0.75)
- L_WARNING("deltafract not in [0.15 ... 0.75]\n", procName);
- if (peakfract < 0.25 || peakfract > 0.9)
- L_WARNING("peakfract not in [0.25 ... 0.9]\n", procName);
- if (clipfract < 0.0 || clipfract >= 0.5)
- return ERROR_INT("clipfract not in [0.0 ... 0.5)\n", procName, 1);
- if (pixadb) pixaAddPix(pixadb, pixs, L_COPY);
-
- /* Scale to between 37.5 and 75 ppi */
- if ((res = pixGetXRes(pixs)) == 0) {
- L_WARNING("resolution undefined; set to 300\n", procName);
- pixSetResolution(pixs, 300, 300);
- res = 300;
- }
- if (res < 37) {
- L_WARNING("resolution %d very low\n", procName, res);
- scalefact = 37.5 / res;
- pix1 = pixScale(pixs, scalefact, scalefact);
- } else {
- redfact = (l_float32)res / 37.5;
- if (redfact < 2.0)
- pix1 = pixClone(pixs);
- else if (redfact < 4.0)
- pix1 = pixReduceRankBinaryCascade(pixs, 1, 0, 0, 0);
- else if (redfact < 8.0)
- pix1 = pixReduceRankBinaryCascade(pixs, 1, 2, 0, 0);
- else if (redfact < 16.0)
- pix1 = pixReduceRankBinaryCascade(pixs, 1, 2, 2, 0);
- else
- pix1 = pixReduceRankBinaryCascade(pixs, 1, 2, 2, 2);
- }
- if (pixadb) pixaAddPix(pixadb, pix1, L_COPY);
-
- /* Crop inner 80% of image */
- pixGetDimensions(pix1, &w, &h, NULL);
- box = boxCreate(clipfract * w, clipfract * h,
- (1.0 - 2 * clipfract) * w, (1.0 - 2 * clipfract) * h);
- pix2 = pixClipRectangle(pix1, box, NULL);
- pixGetDimensions(pix2, &w, &h, NULL);
- boxDestroy(&box);
- if (pixadb) pixaAddPix(pixadb, pix2, L_COPY);
-
- /* Deskew */
- pix3 = pixDeskew(pix2, 0);
- if (pixadb) pixaAddPix(pixadb, pix3, L_COPY);
-
- /* Close to increase column counts for text */
- pix4 = pixCloseSafeBrick(NULL, pix3, 5, 21);
- if (pixadb) pixaAddPix(pixadb, pix4, L_COPY);
- pixInvert(pix4, pix4);
- na1 = pixCountByColumn(pix4, NULL);
-
- if (pixadb) {
- gplotSimple1(na1, GPLOT_PNG, "/tmp/lept/plot", NULL);
- pix5 = pixRead("/tmp/lept/plot.png");
- pixaAddPix(pixadb, pix5, L_INSERT);
- }
-
- /* Analyze the column counts. na4 gives the locations of
- * the extrema in normalized units (0.0 to 1.0) across the
- * cropped image. na5 gives the magnitude of the
- * extrema, normalized to the dynamic range. The peaks
- * are values that are at least peakfract of (max - min). */
- numaGetMax(na1, &maxval, NULL);
- numaGetMin(na1, &minval, NULL);
- fract = (l_float32)(maxval - minval) / h; /* is there much at all? */
- if (fract < 0.05) {
- L_INFO("very little content on page; 0 text columns\n", procName);
- *pncols = 0;
- } else {
- na2 = numaFindExtrema(na1, deltafract * (maxval - minval), &na3);
- na4 = numaTransform(na2, 0, 1.0 / w);
- na5 = numaTransform(na3, -minval, 1.0 / (maxval - minval));
- n = numaGetCount(na4);
- for (i = 0, npeak = 0; i < n; i++) {
- numaGetFValue(na4, i, &val4);
- numaGetFValue(na5, i, &val5);
- if (val4 > 0.3 && val4 < 0.7 && val5 >= peakfract) {
- npeak++;
- L_INFO("Peak(loc,val) = (%5.3f,%5.3f)\n", procName, val4, val5);
- }
- }
- *pncols = npeak + 1;
- numaDestroy(&na2);
- numaDestroy(&na3);
- numaDestroy(&na4);
- numaDestroy(&na5);
- }
-
- pixDestroy(&pix1);
- pixDestroy(&pix2);
- pixDestroy(&pix3);
- pixDestroy(&pix4);
- numaDestroy(&na1);
- return 0;
-}
-
-
-/*------------------------------------------------------------------*
- * Decision text vs photo *
- *------------------------------------------------------------------*/
-/*!
- * \brief pixDecideIfText()
- *
- * \param[in] pixs any depth
- * \param[in] box [optional] if null, use entire pixs
- * \param[out] pistext 1 if text; 0 if photo; -1 if not determined or empty
- * \param[in] pixadb [optional] pre-allocated, for showing intermediate
- * computation; use NULL to skip
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) It is assumed that pixs has the correct resolution set.
- * If the resolution is 0, we set to 300 and issue a warning.
- * (2) If necessary, the image is scaled to 300 ppi; most of the
- * processing is done at this resolution.
- * (3) Text is assumed to be in horizontal lines.
- * (4) Because thin vertical lines are removed before filtering for
- * text lines, this should identify tables as text.
- * (5) If %box is null and pixs contains both text lines and line art,
- * this function might return %istext == true.
- * (6) If the input pixs is empty, or for some other reason the
- * result can not be determined, return -1.
- * (7) For debug output, input a pre-allocated pixa.
- *
- */
-l_ok
-pixDecideIfText(PIX *pixs,
- BOX *box,
- l_int32 *pistext,
- PIXA *pixadb)
-{
-l_int32 i, empty, maxw, w, h, n1, n2, n3, minlines, big_comp;
-l_float32 ratio1, ratio2;
-L_BMF *bmf;
-BOXA *boxa1, *boxa2, *boxa3, *boxa4, *boxa5;
-PIX *pix1, *pix2, *pix3, *pix4, *pix5, *pix6, *pix7;
-PIXA *pixa1;
-SEL *sel1;
-
- PROCNAME("pixDecideIfText");
-
- if (!pistext)
- return ERROR_INT("&istext not defined", procName, 1);
- *pistext = -1;
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
-
- /* Crop, convert to 1 bpp, 300 ppi */
- if ((pix1 = pixPrepare1bpp(pixs, box, 0.1, 300)) == NULL)
- return ERROR_INT("pix1 not made", procName, 1);
-
- pixZero(pix1, &empty);
- if (empty) {
- pixDestroy(&pix1);
- L_INFO("pix is empty\n", procName);
- return 0;
- }
- w = pixGetWidth(pix1);
-
- /* Identify and remove tall, thin vertical lines (as found in tables)
- * that are up to 9 pixels wide. Make a hit-miss sel with an
- * 81 pixel vertical set of hits and with 3 pairs of misses that
- * are 10 pixels apart horizontally. It is necessary to use a
- * hit-miss transform; if we only opened with a vertical line of
- * hits, we would remove solid regions of pixels that are not
- * text or vertical lines. */
- pix2 = pixCreate(11, 81, 1);
- for (i = 0; i < 81; i++)
- pixSetPixel(pix2, 5, i, 1);
- sel1 = selCreateFromPix(pix2, 40, 5, NULL);
- selSetElement(sel1, 20, 0, SEL_MISS);
- selSetElement(sel1, 20, 10, SEL_MISS);
- selSetElement(sel1, 40, 0, SEL_MISS);
- selSetElement(sel1, 40, 10, SEL_MISS);
- selSetElement(sel1, 60, 0, SEL_MISS);
- selSetElement(sel1, 60, 10, SEL_MISS);
- pix3 = pixHMT(NULL, pix1, sel1);
- pix4 = pixSeedfillBinaryRestricted(NULL, pix3, pix1, 8, 5, 1000);
- pix5 = pixXor(NULL, pix1, pix4);
- pixDestroy(&pix2);
- selDestroy(&sel1);
-
- /* Convert the text lines to separate long horizontal components */
- pix6 = pixMorphCompSequence(pix5, "c30.1 + o15.1 + c60.1 + o2.2", 0);
-
- /* Estimate the distance to the bottom of the significant region */
- if (box) { /* use full height */
- pixGetDimensions(pix6, NULL, &h, NULL);
- } else { /* use height of region that has text lines */
- pixFindThreshFgExtent(pix6, 400, NULL, &h);
- }
-
- if (pixadb) {
- bmf = bmfCreate(NULL, 6);
- pixaAddPixWithText(pixadb, pix1, 1, bmf, "threshold/crop to binary",
- 0x0000ff00, L_ADD_BELOW);
- pixaAddPixWithText(pixadb, pix3, 2, bmf, "hit-miss for vertical line",
- 0x0000ff00, L_ADD_BELOW);
- pixaAddPixWithText(pixadb, pix4, 2, bmf, "restricted seed-fill",
- 0x0000ff00, L_ADD_BELOW);
- pixaAddPixWithText(pixadb, pix5, 2, bmf, "remove using xor",
- 0x0000ff00, L_ADD_BELOW);
- pixaAddPixWithText(pixadb, pix6, 2, bmf, "make long horiz components",
- 0x0000ff00, L_ADD_BELOW);
- }
-
- /* Extract the connected components */
- if (pixadb) {
- boxa1 = pixConnComp(pix6, &pixa1, 8);
- pix7 = pixaDisplayRandomCmap(pixa1, 0, 0);
- pixcmapResetColor(pixGetColormap(pix7), 0, 255, 255, 255);
- pixaAddPixWithText(pixadb, pix7, 2, bmf, "show connected components",
- 0x0000ff00, L_ADD_BELOW);
- pixDestroy(&pix7);
- pixaDestroy(&pixa1);
- bmfDestroy(&bmf);
- } else {
- boxa1 = pixConnComp(pix6, NULL, 8);
- }
-
- /* Analyze the connected components. The following conditions
- * at 300 ppi must be satisfied if the image is text:
- * (1) There are no components that are wider than 400 pixels and
- * taller than 175 pixels.
- * (2) The second longest component is at least 60% of the
- * (possibly cropped) image width. This catches images
- * that don't have any significant content.
- * (3) Of the components that are at least 40% of the length
- * of the longest (n2), at least 80% of them must not exceed
- * 60 pixels in height.
- * (4) The number of those long, thin components (n3) must
- * equal or exceed a minimum that scales linearly with the
- * image height.
- * Most images that are not text fail more than one of these
- * conditions. */
- boxa2 = boxaSort(boxa1, L_SORT_BY_WIDTH, L_SORT_DECREASING, NULL);
- boxaGetBoxGeometry(boxa2, 1, NULL, NULL, &maxw, NULL); /* 2nd longest */
- boxa3 = boxaSelectBySize(boxa1, 0.4 * maxw, 0, L_SELECT_WIDTH,
- L_SELECT_IF_GTE, NULL);
- boxa4 = boxaSelectBySize(boxa3, 0, 60, L_SELECT_HEIGHT,
- L_SELECT_IF_LTE, NULL);
- boxa5 = boxaSelectBySize(boxa1, 400, 175, L_SELECT_IF_BOTH,
- L_SELECT_IF_GT, NULL);
- big_comp = (boxaGetCount(boxa5) == 0) ? 0 : 1;
- n1 = boxaGetCount(boxa1);
- n2 = boxaGetCount(boxa3);
- n3 = boxaGetCount(boxa4);
- ratio1 = (l_float32)maxw / (l_float32)w;
- ratio2 = (l_float32)n3 / (l_float32)n2;
- minlines = L_MAX(2, h / 125);
- if (big_comp || ratio1 < 0.6 || ratio2 < 0.8 || n3 < minlines)
- *pistext = 0;
- else
- *pistext = 1;
- if (pixadb) {
- if (*pistext == 1) {
- L_INFO("This is text: \n n1 = %d, n2 = %d, n3 = %d, "
- "minlines = %d\n maxw = %d, ratio1 = %4.2f, h = %d, "
- "big_comp = %d\n", procName, n1, n2, n3, minlines,
- maxw, ratio1, h, big_comp);
- } else {
- L_INFO("This is not text: \n n1 = %d, n2 = %d, n3 = %d, "
- "minlines = %d\n maxw = %d, ratio1 = %4.2f, h = %d, "
- "big_comp = %d\n", procName, n1, n2, n3, minlines,
- maxw, ratio1, h, big_comp);
- }
- }
-
- boxaDestroy(&boxa1);
- boxaDestroy(&boxa2);
- boxaDestroy(&boxa3);
- boxaDestroy(&boxa4);
- boxaDestroy(&boxa5);
- pixDestroy(&pix1);
- pixDestroy(&pix3);
- pixDestroy(&pix4);
- pixDestroy(&pix5);
- pixDestroy(&pix6);
- return 0;
-}
-
-
-/*!
- * \brief pixFindThreshFgExtent()
- *
- * \param[in] pixs 1 bpp
- * \param[in] thresh threshold number of pixels in row
- * \param[out] ptop [optional] location of top of region
- * \param[out] pbot [optional] location of bottom of region
- * \return 0 if OK, 1 on error
- */
-l_ok
-pixFindThreshFgExtent(PIX *pixs,
- l_int32 thresh,
- l_int32 *ptop,
- l_int32 *pbot)
-{
-l_int32 i, n;
-l_int32 *array;
-NUMA *na;
-
- PROCNAME("pixFindThreshFgExtent");
-
- if (ptop) *ptop = 0;
- if (pbot) *pbot = 0;
- if (!ptop && !pbot)
- return ERROR_INT("nothing to determine", procName, 1);
- if (!pixs || pixGetDepth(pixs) != 1)
- return ERROR_INT("pixs not defined or not 1 bpp", procName, 1);
-
- na = pixCountPixelsByRow(pixs, NULL);
- n = numaGetCount(na);
- array = numaGetIArray(na);
- if (ptop) {
- for (i = 0; i < n; i++) {
- if (array[i] >= thresh) {
- *ptop = i;
- break;
- }
- }
- }
- if (pbot) {
- for (i = n - 1; i >= 0; i--) {
- if (array[i] >= thresh) {
- *pbot = i;
- break;
- }
- }
- }
- LEPT_FREE(array);
- numaDestroy(&na);
- return 0;
-}
-
-
-/*------------------------------------------------------------------*
- * Decision: table vs text *
- *------------------------------------------------------------------*/
-/*!
- * \brief pixDecideIfTable()
- *
- * \param[in] pixs any depth, any resolution >= 75 ppi
- * \param[in] box [optional] if null, use entire pixs
- * \param[in] orient L_PORTRAIT_MODE, L_LANDSCAPE_MODE
- * \param[out] pscore 0 - 4; -1 if not determined
- * \param[in] pixadb [optional] pre-allocated, for showing intermediate
- * computation; use NULL to skip
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) It is assumed that pixs has the correct resolution set.
- * If the resolution is 0, we assume it is 300 ppi and issue a warning.
- * (2) If %orient == L_LANDSCAPE_MODE, the image is rotated 90 degrees
- * clockwise before being analyzed.
- * (3) The interpretation of the returned score:
- * -1 undetermined
- * 0 no table
- * 1 unlikely to have a table
- * 2 likely to have a table
- * 3 even more likely to have a table
- * 4 extremely likely to have a table
- * * Setting the condition for finding a table at score >= 2 works
- * well, except for false positives on kanji and landscape text.
- * * These false positives can be removed by setting the condition
- * at score >= 3, but recall is lowered because it will not find
- * tables without either horizontal or vertical lines.
- * (4) Most of the processing takes place at 75 ppi.
- * (5) Internally, three numbers are determined, for horizontal and
- * vertical fg lines, and for vertical bg lines. From these,
- * four tests are made to decide if there is a table occupying
- * a significant part of the image.
- * (6) Images have arbitrary content and would be likely to trigger
- * this detector, so they are checked for first, and if found,
- * return with a 0 (no table) score.
- * (7) Musical scores (tablature) are likely to trigger the detector.
- * (8) Tables of content with more than 2 columns are likely to
- * trigger the detector.
- * (9) For debug output, input a pre-allocated pixa.
- *
- */
-l_ok
-pixDecideIfTable(PIX *pixs,
- BOX *box,
- l_int32 orient,
- l_int32 *pscore,
- PIXA *pixadb)
-{
-l_int32 empty, nhb, nvb, nvw, score, htfound;
-PIX *pix1, *pix2, *pix3, *pix4, *pix5, *pix6, *pix7, *pix8, *pix9;
-
- PROCNAME("pixDecideIfTable");
-
- if (!pscore)
- return ERROR_INT("&score not defined", procName, 1);
- *pscore = -1;
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
-
- /* Check if there is an image region. First convert to 1 bpp
- * at 175 ppi. If an image is found, assume there is no table. */
- pix1 = pixPrepare1bpp(pixs, box, 0.1, 175);
- pix2 = pixGenerateHalftoneMask(pix1, NULL, &htfound, NULL);
- if (htfound && pixadb) pixaAddPix(pixadb, pix2, L_COPY);
- pixDestroy(&pix1);
- pixDestroy(&pix2);
- if (htfound) {
- *pscore = 0;
- L_INFO("pix has an image region\n", procName);
- return 0;
- }
-
- /* Crop, convert to 1 bpp, 75 ppi */
- if ((pix1 = pixPrepare1bpp(pixs, box, 0.05, 75)) == NULL)
- return ERROR_INT("pix1 not made", procName, 1);
-
- pixZero(pix1, &empty);
- if (empty) {
- *pscore = 0;
- pixDestroy(&pix1);
- L_INFO("pix is empty\n", procName);
- return 0;
- }
-
- /* The 2x2 dilation on 75 ppi makes these two approaches very similar:
- * (1) pix1 = pixPrepare1bpp(..., 300); // 300 ppi resolution
- * pix2 = pixReduceRankBinaryCascade(pix1, 1, 1, 0, 0);
- * (2) pix1 = pixPrepare1bpp(..., 75); // 75 ppi resolution
- * pix2 = pixDilateBrick(NULL, pix1, 2, 2);
- * But (2) is more efficient if the input image to pixPrepare1bpp()
- * is not at 300 ppi. */
- pix2 = pixDilateBrick(NULL, pix1, 2, 2);
-
- /* Deskew both horizontally and vertically; rotate by 90
- * degrees if in landscape mode. */
- pix3 = pixDeskewBoth(pix2, 1);
- if (pixadb) {
- pixaAddPix(pixadb, pix2, L_COPY);
- pixaAddPix(pixadb, pix3, L_COPY);
- }
- if (orient == L_LANDSCAPE_MODE)
- pix4 = pixRotate90(pix3, 1);
- else
- pix4 = pixClone(pix3);
- pixDestroy(&pix1);
- pixDestroy(&pix2);
- pixDestroy(&pix3);
- pix1 = pixClone(pix4);
- pixDestroy(&pix4);
-
- /* Look for horizontal and vertical lines */
- pix2 = pixMorphSequence(pix1, "o100.1 + c1.4", 0);
- pix3 = pixSeedfillBinary(NULL, pix2, pix1, 8);
- pix4 = pixMorphSequence(pix1, "o1.100 + c4.1", 0);
- pix5 = pixSeedfillBinary(NULL, pix4, pix1, 8);
- pix6 = pixOr(NULL, pix3, pix5);
- if (pixadb) {
- pixaAddPix(pixadb, pix2, L_COPY);
- pixaAddPix(pixadb, pix4, L_COPY);
- pixaAddPix(pixadb, pix3, L_COPY);
- pixaAddPix(pixadb, pix5, L_COPY);
- pixaAddPix(pixadb, pix6, L_COPY);
- }
- pixCountConnComp(pix2, 8, &nhb); /* number of horizontal black lines */
- pixCountConnComp(pix4, 8, &nvb); /* number of vertical black lines */
-
- /* Remove the lines */
- pixSubtract(pix1, pix1, pix6);
- if (pixadb) pixaAddPix(pixadb, pix1, L_COPY);
-
- /* Remove noise pixels */
- pix7 = pixMorphSequence(pix1, "c4.1 + o8.1", 0);
- if (pixadb) pixaAddPix(pixadb, pix7, L_COPY);
-
- /* Look for vertical white space. Invert to convert white bg
- * to fg. Use a single rank-1 2x reduction, which closes small
- * fg holes, for the final processing at 37.5 ppi.
- * The vertical opening is then about 3 inches on a 300 ppi image.
- * We also remove vertical whitespace that is less than 5 pixels
- * wide at this resolution (about 0.1 inches) */
- pixInvert(pix7, pix7);
- pix8 = pixMorphSequence(pix7, "r1 + o1.100", 0);
- pix9 = pixSelectBySize(pix8, 5, 0, 8, L_SELECT_WIDTH,
- L_SELECT_IF_GTE, NULL);
- pixCountConnComp(pix9, 8, &nvw); /* number of vertical white lines */
- if (pixadb) {
- pixaAddPix(pixadb, pixScale(pix8, 2.0, 2.0), L_INSERT);
- pixaAddPix(pixadb, pixScale(pix9, 2.0, 2.0), L_INSERT);
- }
-
- /* Require at least 2 of the following 4 conditions for a table.
- * Some tables do not have black (fg) lines, and for those we
- * require more than 6 long vertical whitespace (bg) lines. */
- score = 0;
- if (nhb > 1) score++;
- if (nvb > 2) score++;
- if (nvw > 3) score++;
- if (nvw > 6) score++;
- *pscore = score;
-
- pixDestroy(&pix1);
- pixDestroy(&pix2);
- pixDestroy(&pix3);
- pixDestroy(&pix4);
- pixDestroy(&pix5);
- pixDestroy(&pix6);
- pixDestroy(&pix7);
- pixDestroy(&pix8);
- pixDestroy(&pix9);
- return 0;
-}
-
-
-/*!
- * \brief pixPrepare1bpp()
- *
- * \param[in] pixs any depth
- * \param[in] box [optional] if null, use entire pixs
- * \param[in] cropfract fraction to be removed from the boundary;
- * use 0.0 to retain the entire image
- * \param[in] outres desired resolution of output image; if the
- * input image resolution is not set, assume
- * 300 ppi; use 0 to skip scaling.
- * \return pixd if OK, NULL on error
- *
- *
- * Notes:
- * (1) This handles some common pre-processing operations,
- * where the page segmentation algorithm takes a 1 bpp image.
- *
- */
-PIX *
-pixPrepare1bpp(PIX *pixs,
- BOX *box,
- l_float32 cropfract,
- l_int32 outres)
-{
-l_int32 w, h, res;
-l_float32 factor;
-BOX *box1;
-PIX *pix1, *pix2, *pix3, *pix4, *pix5;
-
- PROCNAME("pixPrepare1bpp");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
-
- /* Crop the image. If no box is given, use %cropfract to remove
- * pixels near the image boundary; this helps avoid false
- * negatives from noise that is often found there. */
- if (box) {
- pix1 = pixClipRectangle(pixs, box, NULL);
- } else {
- pixGetDimensions(pixs, &w, &h, NULL);
- box1 = boxCreate((l_int32)(cropfract * w), (l_int32)(cropfract * h),
- (l_int32)((1.0 - 2 * cropfract) * w),
- (l_int32)((1.0 - 2 * cropfract) * h));
- pix1 = pixClipRectangle(pixs, box1, NULL);
- boxDestroy(&box1);
- }
-
- /* Convert to 1 bpp with adaptive background cleaning */
- if (pixGetDepth(pixs) > 1) {
- pix2 = pixConvertTo8(pix1, 0);
- pix3 = pixCleanBackgroundToWhite(pix2, NULL, NULL, 1.0, 70, 160);
- pixDestroy(&pix1);
- pixDestroy(&pix2);
- if (!pix3) {
- L_INFO("pix cleaning failed\n", procName);
- return NULL;
- }
- pix4 = pixThresholdToBinary(pix3, 200);
- pixDestroy(&pix3);
- } else {
- pix4 = pixClone(pix1);
- pixDestroy(&pix1);
- }
-
- /* Scale the image to the requested output resolution;
- do not scale if %outres <= 0 */
- if (outres <= 0)
- return pix4;
- if ((res = pixGetXRes(pixs)) == 0) {
- L_WARNING("Resolution is not set: using 300 ppi\n", procName);
- res = 300;
- }
- if (res != outres) {
- factor = (l_float32)outres / (l_float32)res;
- pix5 = pixScale(pix4, factor, factor);
- } else {
- pix5 = pixClone(pix4);
- }
- pixDestroy(&pix4);
- return pix5;
-}
-
-
-/*------------------------------------------------------------------*
- * Estimate the grayscale background value *
- *------------------------------------------------------------------*/
-/*!
- * \brief pixEstimateBackground()
- *
- * \param[in] pixs 8 bpp, with or without colormap
- * \param[in] darkthresh pixels below this value are never considered
- * part of the background; typ. 70; use 0 to skip
- * \param[in] edgecrop fraction of half-width on each side, and of
- * half-height at top and bottom, that are cropped
- * \param[out] pbg estimated background, or 0 on error
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) Caller should check that return bg value is > 0.
- *
- */
-l_ok
-pixEstimateBackground(PIX *pixs,
- l_int32 darkthresh,
- l_float32 edgecrop,
- l_int32 *pbg)
-{
-l_int32 w, h, sampling;
-l_float32 fbg;
-BOX *box;
-PIX *pix1, *pix2, *pixm;
-
- PROCNAME("pixEstimateBackground");
-
- if (!pbg)
- return ERROR_INT("&bg not defined", procName, 1);
- *pbg = 0;
- if (!pixs || pixGetDepth(pixs) != 8)
- return ERROR_INT("pixs not defined or not 8 bpp", procName, 1);
- if (darkthresh > 128)
- L_WARNING("darkthresh unusually large\n", procName);
- if (edgecrop < 0.0 || edgecrop >= 1.0)
- return ERROR_INT("edgecrop not in [0.0 ... 1.0)", procName, 1);
-
- pix1 = pixRemoveColormap(pixs, REMOVE_CMAP_TO_GRAYSCALE);
- pixGetDimensions(pix1, &w, &h, NULL);
-
- /* Optionally crop inner part of image */
- if (edgecrop > 0.0) {
- box = boxCreate(0.5 * edgecrop * w, 0.5 * edgecrop * h,
- (1.0 - edgecrop) * w, (1.0 - edgecrop) * h);
- pix2 = pixClipRectangle(pix1, box, NULL);
- boxDestroy(&box);
- } else {
- pix2 = pixClone(pix1);
- }
-
- /* We will use no more than 50K samples */
- sampling = L_MAX(1, (l_int32)sqrt((l_float64)(w * h) / 50000. + 0.5));
-
- /* Optionally make a mask over all pixels lighter than %darkthresh */
- pixm = NULL;
- if (darkthresh > 0) {
- pixm = pixThresholdToBinary(pix2, darkthresh);
- pixInvert(pixm, pixm);
- }
-
- pixGetRankValueMasked(pix2, pixm, 0, 0, sampling, 0.5, &fbg, NULL);
- *pbg = (l_int32)(fbg + 0.5);
- pixDestroy(&pix1);
- pixDestroy(&pix2);
- pixDestroy(&pixm);
- return 0;
-}
-
-
-/*---------------------------------------------------------------------*
- * Largest white or black rectangles in an image *
- *---------------------------------------------------------------------*/
-/*!
- * \brief pixFindLargeRectangles()
- *
- * \param[in] pixs 1 bpp
- * \param[in] polarity 0 within background, 1 within foreground
- * \param[in] nrect number of rectangles to be found
- * \param[out] pboxa largest rectangles, sorted by decreasing area
- * \param[in,out] ppixdb optional return output with rectangles drawn on it
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This does a greedy search to find the largest rectangles,
- * either black or white and without overlaps, in %pix.
- * (2) See pixFindLargestRectangle(), which is called multiple
- * times, for details. On each call, the largest rectangle
- * found is painted, so that none of its pixels can be
- * used later, before calling it again.
- * (3) This function is surprisingly fast. Although
- * pixFindLargestRectangle() runs at about 50 MPix/sec, when it
- * is run multiple times by pixFindLargeRectangles(), it processes
- * at 150 - 250 MPix/sec, and the time is approximately linear
- * in %nrect. For example, for a 1 MPix image, searching for
- * the largest 50 boxes takes about 0.2 seconds.
- *
- */
-l_ok
-pixFindLargeRectangles(PIX *pixs,
- l_int32 polarity,
- l_int32 nrect,
- BOXA **pboxa,
- PIX **ppixdb)
-{
-l_int32 i, op, bx, by, bw, bh;
-BOX *box;
-BOXA *boxa;
-PIX *pix;
-
- PROCNAME("pixFindLargeRectangles");
-
- if (ppixdb) *ppixdb = NULL;
- if (!pboxa)
- return ERROR_INT("&boxa not defined", procName, 1);
- *pboxa = NULL;
- if (!pixs || pixGetDepth(pixs) != 1)
- return ERROR_INT("pixs not defined or not 1 bpp", procName, 1);
- if (polarity != 0 && polarity != 1)
- return ERROR_INT("invalid polarity", procName, 1);
- if (nrect > 1000) {
- L_WARNING("large num rectangles = %d requested; using 1000\n",
- procName, nrect);
- nrect = 1000;
- }
-
- pix = pixCopy(NULL, pixs);
- boxa = boxaCreate(nrect);
- *pboxa = boxa;
-
- /* Sequentially find largest rectangle and fill with opposite color */
- for (i = 0; i < nrect; i++) {
- if (pixFindLargestRectangle(pix, polarity, &box, NULL) == 1) {
- boxDestroy(&box);
- L_ERROR("failure in pixFindLargestRectangle\n", procName);
- break;
- }
- boxaAddBox(boxa, box, L_INSERT);
- op = (polarity == 0) ? PIX_SET : PIX_CLR;
- boxGetGeometry(box, &bx, &by, &bw, &bh);
- pixRasterop(pix, bx, by, bw, bh, op, NULL, 0, 0);
- }
-
- if (ppixdb)
- *ppixdb = pixDrawBoxaRandom(pixs, boxa, 3);
-
- pixDestroy(&pix);
- return 0;
-}
-
-
-/*!
- * \brief pixFindLargestRectangle()
- *
- * \param[in] pixs 1 bpp
- * \param[in] polarity 0 within background, 1 within foreground
- * \param[out] pbox largest area rectangle
- * \param[in,out] ppixdb optional return output with rectangle drawn on it
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This is a simple and elegant solution to a problem in
- * computational geometry that at first appears to be quite
- * difficult: what is the largest rectangle that can be
- * placed in the image, covering only pixels of one polarity
- * (bg or fg)? The solution is O(n), where n is the number
- * of pixels in the image, and it requires nothing more than
- * using a simple recursion relation in a single sweep of the image.
- * (2) In a sweep from UL to LR with left-to-right being the fast
- * direction, calculate the largest white rectangle at (x, y),
- * using previously calculated values at pixels #1 and #2:
- * #1: (x, y - 1)
- * #2: (x - 1, y)
- * We also need the most recent "black" pixels that were seen
- * in the current row and column.
- * Consider the largest area. There are only two possibilities:
- * (a) Min(w(1), horizdist) * (h(1) + 1)
- * (b) Min(h(2), vertdist) * (w(2) + 1)
- * where
- * horizdist: the distance from the rightmost "black" pixel seen
- * in the current row across to the current pixel
- * vertdist: the distance from the lowest "black" pixel seen
- * in the current column down to the current pixel
- * and we choose the Max of (a) and (b).
- * (3) To convince yourself that these recursion relations are correct,
- * it helps to draw the maximum rectangles at #1 and #2.
- * Then for #1, you try to extend the rectangle down one line,
- * so that the height is h(1) + 1. Do you get the full
- * width of #1, w(1)? It depends on where the black pixels are
- * in the current row. You know the final width is bounded by w(1)
- * and w(2) + 1, but the actual value depends on the distribution
- * of black pixels in the current row that are at a distance
- * from the current pixel that is between these limits.
- * We call that value "horizdist", and the area is then given
- * by the expression (a) above. Using similar reasoning for #2,
- * where you attempt to extend the rectangle to the right
- * by 1 pixel, you arrive at (b). The largest rectangle is
- * then found by taking the Max.
- *
- */
-l_ok
-pixFindLargestRectangle(PIX *pixs,
- l_int32 polarity,
- BOX **pbox,
- PIX **ppixdb)
-{
-l_int32 i, j, w, h, d, wpls, val;
-l_int32 wp, hp, w1, w2, h1, h2, wmin, hmin, area1, area2;
-l_int32 xmax, ymax; /* LR corner of the largest rectangle */
-l_int32 maxarea, wmax, hmax, vertdist, horizdist, prevfg;
-l_int32 *lowestfg;
-l_uint32 *datas, *lines;
-l_uint32 **linew, **lineh;
-BOX *box;
-PIX *pixw, *pixh; /* keeps the width and height for the largest */
- /* rectangles whose LR corner is located there. */
-
- PROCNAME("pixFindLargestRectangle");
-
- if (ppixdb) *ppixdb = NULL;
- if (!pbox)
- return ERROR_INT("&box not defined", procName, 1);
- *pbox = NULL;
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
- pixGetDimensions(pixs, &w, &h, &d);
- if (d != 1)
- return ERROR_INT("pixs not 1 bpp", procName, 1);
- if (polarity != 0 && polarity != 1)
- return ERROR_INT("invalid polarity", procName, 1);
-
- /* Initialize lowest "fg" seen so far for each column */
- lowestfg = (l_int32 *)LEPT_CALLOC(w, sizeof(l_int32));
- for (i = 0; i < w; i++)
- lowestfg[i] = -1;
-
- /* The combination (val ^ polarity) is the color for which we
- * are searching for the maximum rectangle. For polarity == 0,
- * we search in the bg (white). */
- pixw = pixCreate(w, h, 32); /* stores width */
- pixh = pixCreate(w, h, 32); /* stores height */
- linew = (l_uint32 **)pixGetLinePtrs(pixw, NULL);
- lineh = (l_uint32 **)pixGetLinePtrs(pixh, NULL);
- datas = pixGetData(pixs);
- wpls = pixGetWpl(pixs);
- maxarea = xmax = ymax = wmax = hmax = 0;
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- prevfg = -1;
- for (j = 0; j < w; j++) {
- val = GET_DATA_BIT(lines, j);
- if ((val ^ polarity) == 0) { /* bg (0) if polarity == 0, etc. */
- if (i == 0 && j == 0) {
- wp = hp = 1;
- } else if (i == 0) {
- wp = linew[i][j - 1] + 1;
- hp = 1;
- } else if (j == 0) {
- wp = 1;
- hp = lineh[i - 1][j] + 1;
- } else {
- /* Expand #1 prev rectangle down */
- w1 = linew[i - 1][j];
- h1 = lineh[i - 1][j];
- horizdist = j - prevfg;
- wmin = L_MIN(w1, horizdist); /* width of new rectangle */
- area1 = wmin * (h1 + 1);
-
- /* Expand #2 prev rectangle to right */
- w2 = linew[i][j - 1];
- h2 = lineh[i][j - 1];
- vertdist = i - lowestfg[j];
- hmin = L_MIN(h2, vertdist); /* height of new rectangle */
- area2 = hmin * (w2 + 1);
-
- if (area1 > area2) {
- wp = wmin;
- hp = h1 + 1;
- } else {
- wp = w2 + 1;
- hp = hmin;
- }
- }
- } else { /* fg (1) if polarity == 0; bg (0) if polarity == 1 */
- prevfg = j;
- lowestfg[j] = i;
- wp = hp = 0;
- }
- linew[i][j] = wp;
- lineh[i][j] = hp;
- if (wp * hp > maxarea) {
- maxarea = wp * hp;
- xmax = j;
- ymax = i;
- wmax = wp;
- hmax = hp;
- }
- }
- }
-
- /* Translate from LR corner to Box coords (UL corner, w, h) */
- box = boxCreate(xmax - wmax + 1, ymax - hmax + 1, wmax, hmax);
- *pbox = box;
-
- if (ppixdb) {
- *ppixdb = pixConvertTo8(pixs, TRUE);
- pixRenderHashBoxArb(*ppixdb, box, 6, 2, L_NEG_SLOPE_LINE, 1, 255, 0, 0);
- }
-
- LEPT_FREE(linew);
- LEPT_FREE(lineh);
- LEPT_FREE(lowestfg);
- pixDestroy(&pixw);
- pixDestroy(&pixh);
- return 0;
-}
-
-
-/*---------------------------------------------------------------------*
- * Generate rectangle inside connected component *
- *---------------------------------------------------------------------*/
-/*!
- * \brief pixFindRectangleInCC()
- *
- * \param[in] pixs 1 bpp, with sufficient closings to make the fg be
- * a single c.c. that is a convex hull
- * \param[in] boxs [optional] if NULL, %pixs should be a minimum
- * container of a single c.c.
- * \param[in] fract first and all consecutive lines found must be at
- * least this fraction of the fast scan dimension
- * \param[in] dir L_SCAN_HORIZONTAL, L_SCAN_VERTICAL; direction of
- * fast scan
- * \param[in] select L_GEOMETRIC_UNION, L_GEOMETRIC_INTERSECTION,
- * L_LARGEST_AREA, L_SMALEST_AREA
- * \param[in] debug if 1, generates output pdf showing intermediate
- * computation and final result
- * \return box of included rectangle, or NULL on error
- *
- *
- * Notes:
- * (1) Computation is similar to pixFindLargestRectangle(), but allows
- * a different set of results to choose from.
- * (2) Select the fast scan direction. Then, scanning in the slow
- * direction, finds the longest run of ON pixels in the fast
- * scan direction and look for the first first run that is longer
- * than %fract of the dimension. Continues until a shorter run
- * is found. This generates a box of ON pixels fitting into the c.c.
- * (3) Do this from both slow scan directions and use %select to get
- * a resulting box from these two.
- * (4) The extracted rectangle is not necessarily the largest that
- * can fit in the c.c. To get that, use pixFindLargestRectangle().
- */
-BOX *
-pixFindRectangleInCC(PIX *pixs,
- BOX *boxs,
- l_float32 fract,
- l_int32 dir,
- l_int32 select,
- l_int32 debug)
-{
-l_int32 x, y, i, j, w, h, w1, h1, w2, h2, found, res;
-l_int32 xfirst, xlast, xstart, yfirst, ylast, length;
-BOX *box1, *box2, *box3, *box4, *box5;
-PIX *pix1, *pix2, *pixdb1, *pixdb2;
-PIXA *pixadb;
-
- PROCNAME("pixFindRectangleInCC");
-
- if (!pixs || pixGetDepth(pixs) != 1)
- return (BOX *)ERROR_PTR("pixs undefined or not 1 bpp", procName, NULL);
- if (fract <= 0.0 || fract > 1.0)
- return (BOX *)ERROR_PTR("invalid fraction", procName, NULL);
- if (dir != L_SCAN_VERTICAL && dir != L_SCAN_HORIZONTAL)
- return (BOX *)ERROR_PTR("invalid scan direction", procName, NULL);
- if (select != L_GEOMETRIC_UNION && select != L_GEOMETRIC_INTERSECTION &&
- select != L_LARGEST_AREA && select != L_SMALLEST_AREA)
- return (BOX *)ERROR_PTR("invalid select", procName, NULL);
-
- /* Extract the c.c. if necessary */
- x = y = 0;
- if (boxs) {
- pix1 = pixClipRectangle(pixs, boxs, NULL);
- boxGetGeometry(boxs, &x, &y, NULL, NULL);
- } else {
- pix1 = pixClone(pixs);
- }
-
- /* All fast scans are horizontal; rotate 90 deg cw if necessary */
- if (dir == L_SCAN_VERTICAL)
- pix2 = pixRotate90(pix1, 1);
- else /* L_SCAN_HORIZONTAL */
- pix2 = pixClone(pix1);
- pixGetDimensions(pix2, &w, &h, NULL);
-
- pixadb = (debug) ? pixaCreate(0) : NULL;
- pixdb1 = NULL;
- if (pixadb) {
- lept_mkdir("lept/rect");
- pixaAddPix(pixadb, pix1, L_CLONE);
- pixdb1 = pixConvertTo32(pix2);
- }
- pixDestroy(&pix1);
-
- /* Scanning down, find the first scanline with a long enough run.
- * That run goes from (xfirst, yfirst) to (xlast, yfirst). */
- found = FALSE;
- for (i = 0; i < h; i++) {
- pixFindMaxHorizontalRunOnLine(pix2, i, &xstart, &length);
- if (length >= (l_int32)(fract * w + 0.5)) {
- yfirst = i;
- xfirst = xstart;
- xlast = xfirst + length - 1;
- found = TRUE;
- break;
- }
- }
- if (!found) {
- L_WARNING("no run of sufficient size was found\n", procName);
- pixDestroy(&pix2);
- pixDestroy(&pixdb1);
- pixaDestroy(&pixadb);
- return NULL;
- }
-
- /* Continue down until the condition fails */
- w1 = xlast - xfirst + 1;
- h1 = h - yfirst; /* initialize */
- for (i = yfirst + 1; i < h; i++) {
- pixFindMaxHorizontalRunOnLine(pix2, i, &xstart, &length);
- if (xstart > xfirst || (xstart + length - 1 < xlast) ||
- i == h - 1) {
- ylast = i - 1;
- h1 = ylast - yfirst + 1;
- break;
- }
- }
- box1 = boxCreate(xfirst, yfirst, w1, h1);
-
- /* Scanning up, find the first scanline with a long enough run.
- * That run goes from (xfirst, ylast) to (xlast, ylast). */
- for (i = h - 1; i >= 0; i--) {
- pixFindMaxHorizontalRunOnLine(pix2, i, &xstart, &length);
- if (length >= (l_int32)(fract * w + 0.5)) {
- ylast = i;
- xfirst = xstart;
- xlast = xfirst + length - 1;
- break;
- }
- }
-
- /* Continue up until the condition fails */
- w2 = xlast - xfirst + 1;
- h2 = ylast + 1; /* initialize */
- for (i = ylast - 1; i >= 0; i--) {
- pixFindMaxHorizontalRunOnLine(pix2, i, &xstart, &length);
- if (xstart > xfirst || (xstart + length - 1 < xlast) ||
- i == 0) {
- yfirst = i + 1;
- h2 = ylast - yfirst + 1;
- break;
- }
- }
- box2 = boxCreate(xfirst, yfirst, w2, h2);
- pixDestroy(&pix2);
-
- if (pixadb) {
- pixRenderBoxArb(pixdb1, box1, 2, 255, 0, 0);
- pixRenderBoxArb(pixdb1, box2, 2, 0, 255, 0);
- pixaAddPix(pixadb, pixdb1, L_INSERT);
- }
-
- /* Select the final result from the two boxes */
- if (select == L_GEOMETRIC_UNION)
- box3 = boxBoundingRegion(box1, box2);
- else if (select == L_GEOMETRIC_INTERSECTION)
- box3 = boxOverlapRegion(box1, box2);
- else if (select == L_LARGEST_AREA)
- box3 = (w1 * h1 >= w2 * h2) ? boxCopy(box1) : boxCopy(box2);
- else /* select == L_SMALLEST_AREA) */
- box3 = (w1 * h1 <= w2 * h2) ? boxCopy(box1) : boxCopy(box2);
- boxDestroy(&box1);
- boxDestroy(&box2);
-
- /* Rotate the box 90 degrees ccw if necessary */
- box4 = NULL;
- if (box3) {
- if (dir == L_SCAN_VERTICAL)
- box4 = boxRotateOrth(box3, w, h, 3);
- else
- box4 = boxCopy(box3);
- }
-
- /* Transform back to global coordinates if %boxs exists */
- box5 = (box4) ? boxTransform(box4, x, y, 1.0, 1.0) : NULL;
- boxDestroy(&box3);
- boxDestroy(&box4);
-
- /* Debug output */
- if (pixadb) {
- pixdb1 = pixConvertTo8(pixs, 0);
- pixAddConstantGray(pixdb1, 190);
- pixdb2 = pixConvertTo32(pixdb1);
- if (box5) pixRenderBoxArb(pixdb2, box5, 4, 0, 0, 255);
- pixaAddPix(pixadb, pixdb2, L_INSERT);
- res = pixGetXRes(pixs);
- L_INFO("Writing debug files to /tmp/lept/rect/\n", procName);
- pixaConvertToPdf(pixadb, res, 1.0, L_DEFAULT_ENCODE, 75, NULL,
- "/tmp/lept/rect/fitrect.pdf");
- pix1 = pixaDisplayTiledAndScaled(pixadb, 32, 800, 1, 0, 40, 2);
- pixWrite("/tmp/lept/rect/fitrect.png", pix1, IFF_PNG);
- pixDestroy(&pix1);
- pixDestroy(&pixdb1);
- pixaDestroy(&pixadb);
- }
-
- return box5;
-}
-
-/*------------------------------------------------------------------*
- * Automatic photoinvert for OCR *
- *------------------------------------------------------------------*/
-/*!
- * \brief pixAutoPhotoinvert()
- *
- * \param[in] pixs any depth, colormap ok
- * \param[in] thresh binarization threshold; use 0 for default
- * \param[out] ppixm [optional] image regions to be inverted
- * \param[out] pixadb [optional] debug; input NULL to skip
- * \return pixd 1 bpp image to be sent to OCR, or NULL on error
- *
- *
- * Notes:
- * (1) A 1 bpp image is returned, where pixels in image regions are
- * photo-inverted.
- * (2) If there is light text with a dark background, this will
- * identify the region and photoinvert the pixels there if
- * there are at least 60% fg pixels in the region.
- * (3) For debug output, input a (typically empty) %pixadb.
- *
- */
-PIX *
-pixAutoPhotoinvert(PIX *pixs,
- l_int32 thresh,
- PIX **ppixm,
- PIXA *pixadb)
-{
-l_int32 i, n, empty, x, y, w, h;
-l_float32 fgfract;
-BOX *box1;
-BOXA *boxa1;
-PIX *pix1, *pix2, *pix3, *pix4, *pix5;
-PIXA *pixa1;
-
- PROCNAME("pixAutoPhotoinvert");
-
- if (ppixm) *ppixm = NULL;
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- if (thresh == 0) thresh = 128;
-
- if ((pix1 = pixConvertTo1(pixs, thresh)) == NULL)
- return (PIX *)ERROR_PTR("pix1 not made", procName, NULL);
- if (pixadb) pixaAddPix(pixadb, pix1, L_COPY);
-
- /* Make the halftone mask to identify region for photo-inversion */
- pix2 = pixGenerateHalftoneMask(pix1, NULL, NULL, pixadb);
- pix3 = pixMorphSequence(pix2, "o15.15 + c25.25", 0); /* clean it up */
- if (pixadb) {
- pixaAddPix(pixadb, pix2, L_CLONE);
- pixaAddPix(pixadb, pix3, L_COPY);
- }
- pixDestroy(&pix2);
- pixZero(pix3, &empty);
- if (empty) {
- pixDestroy(&pix3);
- return pix1;
- }
-
- /* Examine each component and validate the inversion.
- * Require at least 60% of pixels under each component to be FG. */
- boxa1 = pixConnCompBB(pix3, 8);
- n = boxaGetCount(boxa1);
- for (i = 0; i < n; i++) {
- box1 = boxaGetBox(boxa1, i, L_COPY);
- pix5 = pixClipRectangle(pix1, box1, NULL);
- pixForegroundFraction(pix5, &fgfract);
- if (pixadb) lept_stderr("fg fraction: %5.3f\n", fgfract);
- if (fgfract < 0.6) { /* erase from the mask */
- boxGetGeometry(box1, &x, &y, &w, &h);
- pixRasterop(pix3, x, y, w, h, PIX_CLR, NULL, 0, 0);
- }
- pixDestroy(&pix5);
- boxDestroy(&box1);
- }
- boxaDestroy(&boxa1);
- pixZero(pix3, &empty);
- if (empty) {
- pixDestroy(&pix3);
- return pix1;
- }
-
- /* Combine pixels of the photo-inverted pix with the binarized input */
- pix4 = pixInvert(NULL, pix1);
- pixCombineMasked(pix1, pix4, pix3);
-
- if (pixadb) {
- pixaAddPix(pixadb, pix4, L_CLONE);
- pixaAddPix(pixadb, pix1, L_COPY);
- }
- pixDestroy(&pix4);
- if (ppixm)
- *ppixm = pix3;
- else
- pixDestroy(&pix3);
- return pix1;
-}
diff --git a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/paintcmap.c b/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/paintcmap.c
deleted file mode 100644
index b0f27982..00000000
--- a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/paintcmap.c
+++ /dev/null
@@ -1,765 +0,0 @@
-/*====================================================================*
- - Copyright (C) 2001 Leptonica. All rights reserved.
- -
- - Redistribution and use in source and binary forms, with or without
- - modification, are permitted provided that the following conditions
- - are met:
- - 1. Redistributions of source code must retain the above copyright
- - notice, this list of conditions and the following disclaimer.
- - 2. Redistributions in binary form must reproduce the above
- - copyright notice, this list of conditions and the following
- - disclaimer in the documentation and/or other materials
- - provided with the distribution.
- -
- - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- - ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- - LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- - A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL ANY
- - CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
- - EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
- - PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
- - PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
- - OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
- - NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- *====================================================================*/
-
-/*!
- * \file paintcmap.c
- *
- *
- * These in-place functions paint onto colormap images.
- *
- * Repaint selected pixels in region
- * l_int32 pixSetSelectCmap()
- *
- * Repaint non-white pixels in region
- * l_int32 pixColorGrayRegionsCmap()
- * l_int32 pixColorGrayCmap()
- * l_int32 pixColorGrayMaskedCmap()
- * l_int32 addColorizedGrayToCmap()
- *
- * Repaint selected pixels through mask
- * l_int32 pixSetSelectMaskedCmap()
- *
- * Repaint all pixels through mask
- * l_int32 pixSetMaskedCmap()
- *
- *
- * The 'set select' functions condition the setting on a specific
- * pixel value (i.e., index into the colormap) of the underyling
- * Pix that is being modified. The same conditioning is used in
- * pixBlendCmap().
- *
- * The pixColorGrayCmap() function sets all truly gray (r = g = b) pixels,
- * with the exception of either black or white pixels, to a new color.
- *
- * The pixSetSelectMaskedCmap() function conditions pixel painting
- * on both a specific pixel value and location within the fg mask.
- * By contrast, pixSetMaskedCmap() sets all pixels under the
- * mask foreground, without considering the initial pixel values.
- *
- */
-
-#ifdef HAVE_CONFIG_H
-#include
-#endif /* HAVE_CONFIG_H */
-
-#include
-#include "allheaders.h"
-
-/*-------------------------------------------------------------*
- * Repaint selected pixels in region *
- *-------------------------------------------------------------*/
-/*!
- * \brief pixSetSelectCmap()
- *
- * \param[in] pixs 1, 2, 4 or 8 bpp, with colormap
- * \param[in] box [optional] region to set color; can be NULL
- * \param[in] sindex colormap index of pixels to be changed
- * \param[in] rval, gval, bval new color to paint
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This is an in-place operation.
- * (2) It sets all pixels in region that have the color specified
- * by the colormap index %sindex to the new color.
- * (3) %sindex must be in the existing colormap; otherwise an
- * error is returned.
- * (4) If the new color exists in the colormap, it is used;
- * otherwise, it is added to the colormap. If it cannot be
- * added because the colormap is full, an error is returned.
- * (5) If %box is NULL, applies function to the entire image; otherwise,
- * clips the operation to the intersection of the box and pix.
- * (6) An example of use would be to set to a specific color all
- * the light (background) pixels within a certain region of
- * a 3-level 2 bpp image, while leaving light pixels outside
- * this region unchanged.
- *
- */
-l_ok
-pixSetSelectCmap(PIX *pixs,
- BOX *box,
- l_int32 sindex,
- l_int32 rval,
- l_int32 gval,
- l_int32 bval)
-{
-l_int32 i, j, w, h, d, n, x1, y1, x2, y2, bw, bh, val, wpls;
-l_int32 index; /* of new color to be set */
-l_uint32 *lines, *datas;
-PIXCMAP *cmap;
-
- PROCNAME("pixSetSelectCmap");
-
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
- if ((cmap = pixGetColormap(pixs)) == NULL)
- return ERROR_INT("no colormap", procName, 1);
- d = pixGetDepth(pixs);
- if (d != 1 && d != 2 && d != 4 && d != 8)
- return ERROR_INT("depth not in {1,2,4,8}", procName, 1);
-
- /* Add new color if necessary; get index of this color in cmap */
- n = pixcmapGetCount(cmap);
- if (sindex >= n)
- return ERROR_INT("sindex too large; no cmap entry", procName, 1);
- if (pixcmapGetIndex(cmap, rval, gval, bval, &index)) { /* not found */
- if (pixcmapAddColor(cmap, rval, gval, bval))
- return ERROR_INT("error adding cmap entry", procName, 1);
- else
- index = n; /* we've added one color */
- }
-
- /* Determine the region of substitution */
- pixGetDimensions(pixs, &w, &h, NULL);
- if (!box) {
- x1 = y1 = 0;
- x2 = w;
- y2 = h;
- } else {
- boxGetGeometry(box, &x1, &y1, &bw, &bh);
- x2 = x1 + bw - 1;
- y2 = y1 + bh - 1;
- }
-
- /* Replace pixel value sindex by index in the region */
- datas = pixGetData(pixs);
- wpls = pixGetWpl(pixs);
- for (i = y1; i <= y2; i++) {
- if (i < 0 || i >= h) /* clip */
- continue;
- lines = datas + i * wpls;
- for (j = x1; j <= x2; j++) {
- if (j < 0 || j >= w) /* clip */
- continue;
- switch (d) {
- case 1:
- val = GET_DATA_BIT(lines, j);
- if (val == sindex) {
- if (index == 0)
- CLEAR_DATA_BIT(lines, j);
- else
- SET_DATA_BIT(lines, j);
- }
- break;
- case 2:
- val = GET_DATA_DIBIT(lines, j);
- if (val == sindex)
- SET_DATA_DIBIT(lines, j, index);
- break;
- case 4:
- val = GET_DATA_QBIT(lines, j);
- if (val == sindex)
- SET_DATA_QBIT(lines, j, index);
- break;
- case 8:
- val = GET_DATA_BYTE(lines, j);
- if (val == sindex)
- SET_DATA_BYTE(lines, j, index);
- break;
- default:
- return ERROR_INT("depth not in {1,2,4,8}", procName, 1);
- }
- }
- }
-
- return 0;
-}
-
-
-/*-------------------------------------------------------------*
- * Repaint gray pixels in region *
- *-------------------------------------------------------------*/
-/*!
- * \brief pixColorGrayRegionsCmap()
- *
- * \param[in] pixs 8 bpp, with colormap
- * \param[in] boxa of regions in which to apply color
- * \param[in] type L_PAINT_LIGHT, L_PAINT_DARK
- * \param[in] rval, gval, bval target color
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This is an in-place operation.
- * (2) If %type == L_PAINT_LIGHT, it colorizes non-black pixels,
- * preserving antialiasing.
- * If %type == L_PAINT_DARK, it colorizes non-white pixels,
- * preserving antialiasing. See pixColorGrayCmap() for details.
- * (3) This can also be called through pixColorGrayRegions().
- * (4) This increases the colormap size by the number of
- * different gray (non-black or non-white) colors in the
- * selected regions of pixs. If there is not enough room in
- * the colormap for this expansion, it returns 1 (error),
- * and the caller should check the return value.
- * (5) Because two boxes in %boxa can overlap, pixels that
- * are colorized in the first box must be excluded in the
- * second because their value exceeds the size of the map.
- *
- */
-l_ok
-pixColorGrayRegionsCmap(PIX *pixs,
- BOXA *boxa,
- l_int32 type,
- l_int32 rval,
- l_int32 gval,
- l_int32 bval)
-{
-l_int32 i, j, k, w, h, n, nc, x1, y1, x2, y2, bw, bh, wpl;
-l_int32 val, nval;
-l_int32 *map;
-l_uint32 *line, *data;
-BOX *box;
-NUMA *na;
-PIXCMAP *cmap;
-
- PROCNAME("pixColorGrayRegionsCmap");
-
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
- if (!boxa)
- return ERROR_INT("boxa not defined", procName, 1);
- if ((cmap = pixGetColormap(pixs)) == NULL)
- return ERROR_INT("no colormap", procName, 1);
- if (pixGetDepth(pixs) != 8)
- return ERROR_INT("depth not 8 bpp", procName, 1);
- if (type != L_PAINT_DARK && type != L_PAINT_LIGHT)
- return ERROR_INT("invalid type", procName, 1);
-
- nc = pixcmapGetCount(cmap);
- if (addColorizedGrayToCmap(cmap, type, rval, gval, bval, &na))
- return ERROR_INT("no room; cmap full", procName, 1);
- map = numaGetIArray(na);
- numaDestroy(&na);
- if (!map)
- return ERROR_INT("map not made", procName, 1);
-
- pixGetDimensions(pixs, &w, &h, NULL);
- data = pixGetData(pixs);
- wpl = pixGetWpl(pixs);
- n = boxaGetCount(boxa);
- for (k = 0; k < n; k++) {
- box = boxaGetBox(boxa, k, L_CLONE);
- boxGetGeometry(box, &x1, &y1, &bw, &bh);
- x2 = x1 + bw - 1;
- y2 = y1 + bh - 1;
-
- /* Remap gray pixels in the region */
- for (i = y1; i <= y2; i++) {
- if (i < 0 || i >= h) /* clip */
- continue;
- line = data + i * wpl;
- for (j = x1; j <= x2; j++) {
- if (j < 0 || j >= w) /* clip */
- continue;
- val = GET_DATA_BYTE(line, j);
- if (val >= nc) continue; /* from overlapping b.b. */
- nval = map[val];
- if (nval != 256)
- SET_DATA_BYTE(line, j, nval);
- }
- }
- boxDestroy(&box);
- }
-
- LEPT_FREE(map);
- return 0;
-}
-
-
-/*!
- * \brief pixColorGrayCmap()
- *
- * \param[in] pixs 2, 4 or 8 bpp, with colormap
- * \param[in] box [optional] region to set color; can be NULL
- * \param[in] type L_PAINT_LIGHT, L_PAINT_DARK
- * \param[in] rval, gval, bval target color
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This is an in-place operation.
- * (2) If %type == L_PAINT_LIGHT, it colorizes non-black pixels,
- * preserving antialiasing.
- * If %type == L_PAINT_DARK, it colorizes non-white pixels,
- * preserving antialiasing.
- * (3) %box gives the region to apply color; if NULL, this
- * colorizes the entire image.
- * (4) If the cmap is only 2 or 4 bpp, pixs is converted in-place
- * to an 8 bpp cmap. A 1 bpp cmap is not a valid input pix.
- * (5) This can also be called through pixColorGray().
- * (6) This operation increases the colormap size by the number of
- * different gray (non-black or non-white) colors in the
- * input colormap. If there is not enough room in the colormap
- * for this expansion, it returns 1 (error), and the caller
- * should check the return value.
- * (7) Using the darkness of each original pixel in the rect,
- * it generates a new color (based on the input rgb values).
- * If %type == L_PAINT_LIGHT, the new color is a (generally)
- * darken-to-black version of the input rgb color, where the
- * amount of darkening increases with the darkness of the
- * original pixel color.
- * If %type == L_PAINT_DARK, the new color is a (generally)
- * faded-to-white version of the input rgb color, where the
- * amount of fading increases with the brightness of the
- * original pixel color.
- *
- */
-l_ok
-pixColorGrayCmap(PIX *pixs,
- BOX *box,
- l_int32 type,
- l_int32 rval,
- l_int32 gval,
- l_int32 bval)
-{
-l_int32 w, h, d, ret;
-PIX *pixt;
-BOXA *boxa;
-PIXCMAP *cmap;
-
- PROCNAME("pixColorGrayCmap");
-
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
- if ((cmap = pixGetColormap(pixs)) == NULL)
- return ERROR_INT("no colormap", procName, 1);
- pixGetDimensions(pixs, &w, &h, &d);
- if (d != 2 && d != 4 && d != 8)
- return ERROR_INT("depth not in {2, 4, 8}", procName, 1);
- if (type != L_PAINT_DARK && type != L_PAINT_LIGHT)
- return ERROR_INT("invalid type", procName, 1);
-
- /* If 2 bpp or 4 bpp, convert in-place to 8 bpp. */
- if (d == 2 || d == 4) {
- pixt = pixConvertTo8(pixs, 1);
- pixTransferAllData(pixs, &pixt, 0, 0);
- }
-
- /* If box == NULL, color the entire image */
- boxa = boxaCreate(1);
- if (box) {
- boxaAddBox(boxa, box, L_COPY);
- } else {
- box = boxCreate(0, 0, w, h);
- boxaAddBox(boxa, box, L_INSERT);
- }
- ret = pixColorGrayRegionsCmap(pixs, boxa, type, rval, gval, bval);
-
- boxaDestroy(&boxa);
- return ret;
-}
-
-
-/*!
- * \brief pixColorGrayMaskedCmap()
- *
- * \param[in] pixs 8 bpp, with colormap
- * \param[in] pixm 1 bpp mask, through which to apply color
- * \param[in] type L_PAINT_LIGHT, L_PAINT_DARK
- * \param[in] rval, gval, bval target color
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This is an in-place operation.
- * (2) If %type == L_PAINT_LIGHT, it colorizes non-black pixels,
- * preserving antialiasing.
- * If %type == L_PAINT_DARK, it colorizes non-white pixels,
- * preserving antialiasing. See pixColorGrayCmap() for details.
- * (3) This increases the colormap size by the number of
- * different gray (non-black or non-white) colors in the
- * input colormap. If there is not enough room in the colormap
- * for this expansion, it returns 1 (error).
- *
- */
-l_ok
-pixColorGrayMaskedCmap(PIX *pixs,
- PIX *pixm,
- l_int32 type,
- l_int32 rval,
- l_int32 gval,
- l_int32 bval)
-{
-l_int32 i, j, w, h, wm, hm, wmin, hmin, wpl, wplm;
-l_int32 val, nval;
-l_int32 *map;
-l_uint32 *line, *data, *linem, *datam;
-NUMA *na;
-PIXCMAP *cmap;
-
- PROCNAME("pixColorGrayMaskedCmap");
-
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
- if (!pixm || pixGetDepth(pixm) != 1)
- return ERROR_INT("pixm undefined or not 1 bpp", procName, 1);
- if ((cmap = pixGetColormap(pixs)) == NULL)
- return ERROR_INT("no colormap", procName, 1);
- if (pixGetDepth(pixs) != 8)
- return ERROR_INT("depth not 8 bpp", procName, 1);
- if (type != L_PAINT_DARK && type != L_PAINT_LIGHT)
- return ERROR_INT("invalid type", procName, 1);
-
- if (addColorizedGrayToCmap(cmap, type, rval, gval, bval, &na))
- return ERROR_INT("no room; cmap full", procName, 1);
- map = numaGetIArray(na);
- numaDestroy(&na);
- if (!map)
- return ERROR_INT("map not made", procName, 1);
-
- pixGetDimensions(pixs, &w, &h, NULL);
- pixGetDimensions(pixm, &wm, &hm, NULL);
- if (wm != w)
- L_WARNING("wm = %d differs from w = %d\n", procName, wm, w);
- if (hm != h)
- L_WARNING("hm = %d differs from h = %d\n", procName, hm, h);
- wmin = L_MIN(w, wm);
- hmin = L_MIN(h, hm);
-
- data = pixGetData(pixs);
- wpl = pixGetWpl(pixs);
- datam = pixGetData(pixm);
- wplm = pixGetWpl(pixm);
-
- /* Remap gray pixels in the region */
- for (i = 0; i < hmin; i++) {
- line = data + i * wpl;
- linem = datam + i * wplm;
- for (j = 0; j < wmin; j++) {
- if (GET_DATA_BIT(linem, j) == 0)
- continue;
- val = GET_DATA_BYTE(line, j);
- nval = map[val];
- if (nval != 256)
- SET_DATA_BYTE(line, j, nval);
- }
- }
-
- LEPT_FREE(map);
- return 0;
-}
-
-
-/*!
- * \brief addColorizedGrayToCmap()
- *
- * \param[in] cmap from 2 or 4 bpp pix
- * \param[in] type L_PAINT_LIGHT, L_PAINT_DARK
- * \param[in] rval, gval, bval target color
- * \param[out] pna [optional] table for mapping new cmap entries
- * \return 0 if OK; 1 on error; 2 if new colors will not fit in cmap.
- *
- *
- * Notes:
- * (1) If %type == L_PAINT_LIGHT, it colorizes non-black pixels,
- * preserving antialiasing.
- * If %type == L_PAINT_DARK, it colorizes non-white pixels,
- * preserving antialiasing.
- * (2) This increases the colormap size by the number of
- * different gray (non-black or non-white) colors in the
- * input colormap. If there is not enough room in the colormap
- * for this expansion, it returns 1 (treated as a warning);
- * the caller should check the return value.
- * (3) This can be used to determine if the new colors will fit in
- * the cmap, using null for &na. Returns 0 if they fit; 2 if
- * they don't fit.
- * (4) The mapping table contains, for each gray color found, the
- * index of the corresponding colorized pixel. Non-gray
- * pixels are assigned the invalid index 256.
- * (5) See pixColorGrayCmap() for usage.
- *
- */
-l_ok
-addColorizedGrayToCmap(PIXCMAP *cmap,
- l_int32 type,
- l_int32 rval,
- l_int32 gval,
- l_int32 bval,
- NUMA **pna)
-{
-l_int32 i, n, erval, egval, ebval, nrval, ngval, nbval, newindex;
-NUMA *na;
-
- PROCNAME("addColorizedGrayToCmap");
-
- if (pna) *pna = NULL;
- if (!cmap)
- return ERROR_INT("cmap not defined", procName, 1);
- if (type != L_PAINT_DARK && type != L_PAINT_LIGHT)
- return ERROR_INT("invalid type", procName, 1);
-
- n = pixcmapGetCount(cmap);
- na = numaCreate(n);
- for (i = 0; i < n; i++) {
- pixcmapGetColor(cmap, i, &erval, &egval, &ebval);
- if (type == L_PAINT_LIGHT) {
- if (erval == egval && erval == ebval && erval != 0) {
- nrval = (l_int32)(rval * (l_float32)erval / 255.);
- ngval = (l_int32)(gval * (l_float32)egval / 255.);
- nbval = (l_int32)(bval * (l_float32)ebval / 255.);
- if (pixcmapAddNewColor(cmap, nrval, ngval, nbval, &newindex)) {
- numaDestroy(&na);
- L_WARNING("no room; colormap full\n", procName);
- return 2;
- }
- numaAddNumber(na, newindex);
- } else {
- numaAddNumber(na, 256); /* invalid number; not gray */
- }
- } else { /* L_PAINT_DARK */
- if (erval == egval && erval == ebval && erval != 255) {
- nrval = rval +
- (l_int32)((255. - rval) * (l_float32)erval / 255.);
- ngval = gval +
- (l_int32)((255. - gval) * (l_float32)egval / 255.);
- nbval = bval +
- (l_int32)((255. - bval) * (l_float32)ebval / 255.);
- if (pixcmapAddNewColor(cmap, nrval, ngval, nbval, &newindex)) {
- numaDestroy(&na);
- L_WARNING("no room; colormap full\n", procName);
- return 2;
- }
- numaAddNumber(na, newindex);
- } else {
- numaAddNumber(na, 256); /* invalid number; not gray */
- }
- }
- }
-
- if (pna)
- *pna = na;
- else
- numaDestroy(&na);
- return 0;
-}
-
-
-/*-------------------------------------------------------------*
- * Repaint selected pixels through mask *
- *-------------------------------------------------------------*/
-/*!
- * \brief pixSetSelectMaskedCmap()
- *
- * \param[in] pixs 2, 4 or 8 bpp, with colormap
- * \param[in] pixm [optional] 1 bpp mask; no-op if NULL
- * \param[in] x, y UL corner of mask relative to pixs
- * \param[in] sindex cmap index of pixels in pixs to be changed
- * \param[in] rval, gval, bval new color to substitute
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This is an in-place operation.
- * (2) This paints through the fg of pixm and replaces all pixels
- * in pixs that have the value %sindex with the new color.
- * (3) If pixm == NULL, a warning is given.
- * (4) %sindex must be in the existing colormap; otherwise an
- * error is returned.
- * (5) If the new color exists in the colormap, it is used;
- * otherwise, it is added to the colormap. If the colormap
- * is full, an error is returned.
- *
- */
-l_ok
-pixSetSelectMaskedCmap(PIX *pixs,
- PIX *pixm,
- l_int32 x,
- l_int32 y,
- l_int32 sindex,
- l_int32 rval,
- l_int32 gval,
- l_int32 bval)
-{
-l_int32 i, j, w, h, d, n, wm, hm, wpls, wplm, val;
-l_int32 index; /* of new color to be set */
-l_uint32 *lines, *linem, *datas, *datam;
-PIXCMAP *cmap;
-
- PROCNAME("pixSetSelectMaskedCmap");
-
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
- if ((cmap = pixGetColormap(pixs)) == NULL)
- return ERROR_INT("no colormap", procName, 1);
- if (!pixm) {
- L_WARNING("no mask; nothing to do\n", procName);
- return 0;
- }
-
- d = pixGetDepth(pixs);
- if (d != 2 && d != 4 && d != 8)
- return ERROR_INT("depth not in {2, 4, 8}", procName, 1);
-
- /* add new color if necessary; get index of this color in cmap */
- n = pixcmapGetCount(cmap);
- if (sindex >= n)
- return ERROR_INT("sindex too large; no cmap entry", procName, 1);
- if (pixcmapGetIndex(cmap, rval, gval, bval, &index)) { /* not found */
- if (pixcmapAddColor(cmap, rval, gval, bval))
- return ERROR_INT("error adding cmap entry", procName, 1);
- else
- index = n; /* we've added one color */
- }
-
- /* replace pixel value sindex by index when fg pixel in pixmc
- * overlays it */
- pixGetDimensions(pixs, &w, &h, NULL);
- datas = pixGetData(pixs);
- wpls = pixGetWpl(pixs);
- wm = pixGetWidth(pixm);
- hm = pixGetHeight(pixm);
- datam = pixGetData(pixm);
- wplm = pixGetWpl(pixm);
- for (i = 0; i < hm; i++) {
- if (i + y < 0 || i + y >= h) continue;
- lines = datas + (y + i) * wpls;
- linem = datam + i * wplm;
- for (j = 0; j < wm; j++) {
- if (j + x < 0 || j + x >= w) continue;
- if (GET_DATA_BIT(linem, j)) {
- switch (d) {
- case 2:
- val = GET_DATA_DIBIT(lines, x + j);
- if (val == sindex)
- SET_DATA_DIBIT(lines, x + j, index);
- break;
- case 4:
- val = GET_DATA_QBIT(lines, x + j);
- if (val == sindex)
- SET_DATA_QBIT(lines, x + j, index);
- break;
- case 8:
- val = GET_DATA_BYTE(lines, x + j);
- if (val == sindex)
- SET_DATA_BYTE(lines, x + j, index);
- break;
- default:
- return ERROR_INT("depth not in {1,2,4,8}", procName, 1);
- }
- }
- }
- }
-
- return 0;
-}
-
-
-/*-------------------------------------------------------------*
- * Repaint all pixels through mask *
- *-------------------------------------------------------------*/
-/*!
- * \brief pixSetMaskedCmap()
- *
- * \param[in] pixs 2, 4 or 8 bpp, colormapped
- * \param[in] pixm [optional] 1 bpp mask; no-op if NULL
- * \param[in] x, y origin of pixm relative to pixs;
- * can be negative
- * \param[in] rval, gval, bval new color to set at each masked pixel
- * \return 0 if OK; 1 on error
- *
- *
- * Notes:
- * (1) This is an in-place operation.
- * (2) It paints a single color through the mask (as a stencil).
- * (3) The mask origin is placed at (%x,%y) on %pixs, and the
- * operation is clipped to the intersection of the mask and pixs.
- * (4) If %pixm == NULL, a warning is given.
- * (5) Typically, %pixm is a small binary mask located somewhere
- * on the larger %pixs.
- * (6) If the color is in the colormap, it is used. Otherwise,
- * it is added if possible; an error is returned if the
- * colormap is already full.
- *
- */
-l_ok
-pixSetMaskedCmap(PIX *pixs,
- PIX *pixm,
- l_int32 x,
- l_int32 y,
- l_int32 rval,
- l_int32 gval,
- l_int32 bval)
-{
-l_int32 w, h, d, wpl, wm, hm, wplm;
-l_int32 i, j, index;
-l_uint32 *data, *datam, *line, *linem;
-PIXCMAP *cmap;
-
- PROCNAME("pixSetMaskedCmap");
-
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
- if ((cmap = pixGetColormap(pixs)) == NULL)
- return ERROR_INT("no colormap in pixs", procName, 1);
- if (!pixm) {
- L_WARNING("no mask; nothing to do\n", procName);
- return 0;
- }
- d = pixGetDepth(pixs);
- if (d != 2 && d != 4 && d != 8)
- return ERROR_INT("depth not in {2,4,8}", procName, 1);
- if (pixGetDepth(pixm) != 1)
- return ERROR_INT("pixm not 1 bpp", procName, 1);
-
- /* Add new color if necessary; store in 'index' */
- if (pixcmapGetIndex(cmap, rval, gval, bval, &index)) { /* not found */
- if (pixcmapAddColor(cmap, rval, gval, bval))
- return ERROR_INT("no room in cmap", procName, 1);
- index = pixcmapGetCount(cmap) - 1;
- }
-
- pixGetDimensions(pixs, &w, &h, NULL);
- wpl = pixGetWpl(pixs);
- data = pixGetData(pixs);
- pixGetDimensions(pixm, &wm, &hm, NULL);
- wplm = pixGetWpl(pixm);
- datam = pixGetData(pixm);
- for (i = 0; i < hm; i++) {
- if (i + y < 0 || i + y >= h) continue;
- line = data + (i + y) * wpl;
- linem = datam + i * wplm;
- for (j = 0; j < wm; j++) {
- if (j + x < 0 || j + x >= w) continue;
- if (GET_DATA_BIT(linem, j)) { /* paint color */
- switch (d) {
- case 2:
- SET_DATA_DIBIT(line, j + x, index);
- break;
- case 4:
- SET_DATA_QBIT(line, j + x, index);
- break;
- case 8:
- SET_DATA_BYTE(line, j + x, index);
- break;
- default:
- return ERROR_INT("depth not in {2,4,8}", procName, 1);
- }
- }
- }
- }
-
- return 0;
-}
diff --git a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/parseprotos.c b/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/parseprotos.c
deleted file mode 100644
index bc1a8969..00000000
--- a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/parseprotos.c
+++ /dev/null
@@ -1,978 +0,0 @@
-/*====================================================================*
- - Copyright (C) 2001 Leptonica. All rights reserved.
- -
- - Redistribution and use in source and binary forms, with or without
- - modification, are permitted provided that the following conditions
- - are met:
- - 1. Redistributions of source code must retain the above copyright
- - notice, this list of conditions and the following disclaimer.
- - 2. Redistributions in binary form must reproduce the above
- - copyright notice, this list of conditions and the following
- - disclaimer in the documentation and/or other materials
- - provided with the distribution.
- -
- - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- - ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- - LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- - A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL ANY
- - CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
- - EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
- - PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
- - PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
- - OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
- - NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- *====================================================================*/
-
-/*
- * \file parseprotos.c
- *
- *
- * char *parseForProtos()
- *
- * Static helpers
- * static l_int32 getNextNonCommentLine()
- * static l_int32 getNextNonBlankLine()
- * static l_int32 getNextNonDoubleSlashLine()
- * static l_int32 searchForProtoSignature()
- * static char *captureProtoSignature()
- * static char *cleanProtoSignature()
- * static l_int32 skipToEndOfFunction()
- * static l_int32 skipToMatchingBrace()
- * static l_int32 skipToSemicolon()
- * static l_int32 getOffsetForCharacter()
- * static l_int32 getOffsetForMatchingRP()
- *
- */
-
-#ifdef HAVE_CONFIG_H
-#include
-#endif /* HAVE_CONFIG_H */
-
-#include
-#include "allheaders.h"
-
-static const l_int32 Bufsize = 2048; /* max token size */
-
-static l_int32 getNextNonCommentLine(SARRAY *sa, l_int32 start, l_int32 *pnext);
-static l_int32 getNextNonBlankLine(SARRAY *sa, l_int32 start, l_int32 *pnext);
-static l_int32 getNextNonDoubleSlashLine(SARRAY *sa, l_int32 start,
- l_int32 *pnext);
-static l_int32 searchForProtoSignature(SARRAY *sa, l_int32 begin,
- l_int32 *pstart, l_int32 *pstop, l_int32 *pcharindex,
- l_int32 *pfound);
-static char * captureProtoSignature(SARRAY *sa, l_int32 start, l_int32 stop,
- l_int32 charindex);
-static char * cleanProtoSignature(char *str);
-static l_int32 skipToEndOfFunction(SARRAY *sa, l_int32 start,
- l_int32 charindex, l_int32 *pnext);
-static l_int32 skipToMatchingBrace(SARRAY *sa, l_int32 start,
- l_int32 lbindex, l_int32 *prbline, l_int32 *prbindex);
-static l_int32 skipToSemicolon(SARRAY *sa, l_int32 start,
- l_int32 charindex, l_int32 *pnext);
-static l_int32 getOffsetForCharacter(SARRAY *sa, l_int32 start, char tchar,
- l_int32 *psoffset, l_int32 *pboffset, l_int32 *ptoffset);
-static l_int32 getOffsetForMatchingRP(SARRAY *sa, l_int32 start,
- l_int32 soffsetlp, l_int32 boffsetlp, l_int32 toffsetlp,
- l_int32 *psoffset, l_int32 *pboffset, l_int32 *ptoffset);
-
-
-/*
- * \brief parseForProtos()
- *
- * \param[in] filein output of cpp
- * \param[in] prestring [optional] string that prefaces each decl;
- * use NULL to omit
- * \return parsestr string of function prototypes, or NULL on error
- *
- *
- * Notes:
- * (1) We parse the output of cpp:
- * cpp -ansi
- * Three plans were attempted, with success on the third.
- * (2) Plan 1. A cursory examination of the cpp output indicated that
- * every function was preceded by a cpp comment statement.
- * So we just need to look at statements beginning after comments.
- * Unfortunately, this is NOT the case. Some functions start
- * without cpp comment lines, typically when there are no
- * comments in the source that immediately precede the function.
- * (3) Plan 2. Consider the keywords in the language that start
- * parts of the cpp file. Some, like 'enum', 'union' and
- * 'struct', are followed after a while by '{', and eventually
- * end with '}, plus an optional token and a final ';'.
- * Others, like 'extern', 'static' and 'typedef', are never
- * the beginnings of global function definitions. Function
- * prototypes have one or more sets of '(' followed eventually
- * by a ')', and end with ';'. But function definitions have
- * tokens, followed by '(', more tokens, ')' and then
- * immediately a '{'. We would generate a prototype from this
- * by adding a ';' to all tokens up to the ')'. So we use
- * these special tokens to decide what we are parsing. And
- * whenever a function definition is found and the prototype
- * extracted, we skip through the rest of the function
- * past the corresponding '}'. This token ends a line, and
- * is often on a line of its own. But as it turns out,
- * the only keyword we need to consider is 'static'.
- * (4) Plan 3. Consider the parentheses and braces for various
- * declarations. A struct, enum, or union has a pair of
- * braces followed by a semicolon. With the exception of an
- * __attribute__ declaration for a struct, they cannot have parentheses
- * before the left brace, but a struct can have lots of parentheses
- * within the brace set. A function prototype has no braces.
- * A function declaration can have sets of left and right
- * parentheses, but these are followed by a left brace.
- * So plan 3 looks at the way parentheses and braces are
- * organized. Once the beginning of a function definition
- * is found, the prototype is extracted and we search for
- * the ending right brace.
- * (5) To find the ending right brace, it is necessary to do some
- * careful parsing. For example, in this file, we have
- * left and right braces as characters, and these must not
- * be counted. Somewhat more tricky, the file fhmtauto.c
- * generates code, and includes a right brace in a string.
- * So we must not include braces that are in strings. But how
- * do we know if something is inside a string? Keep state,
- * starting with not-inside, and every time you hit a double quote
- * that is not escaped, toggle the condition. Any brace
- * found in the state of being within a string is ignored.
- * (6) When a prototype is extracted, it is put in a canonical
- * form (i.e., cleaned up). Finally, we check that it is
- * not static and save it. (If static, it is ignored).
- * (7) The %prestring for unix is NULL; it is included here so that
- * you can use Microsoft's declaration for importing or
- * exporting to a dll. See environ.h for examples of use.
- * Here, we set: %prestring = "LEPT_DLL ". Note in particular
- * the space character that will separate 'LEPT_DLL' from
- * the standard unix prototype that follows.
- *
- */
-char *
-parseForProtos(const char *filein,
- const char *prestring)
-{
-char *strdata, *str, *newstr, *parsestr, *secondword;
-l_int32 start, next, stop, charindex, found;
-size_t nbytes;
-SARRAY *sa, *saout, *satest;
-
- PROCNAME("parseForProtos");
-
- if (!filein)
- return (char *)ERROR_PTR("filein not defined", procName, NULL);
-
- /* Read in the cpp output into memory, one string for each
- * line in the file, omitting blank lines. */
- strdata = (char *)l_binaryRead(filein, &nbytes);
- sa = sarrayCreateLinesFromString(strdata, 0);
-
- saout = sarrayCreate(0);
- next = 0;
- while (1) { /* repeat after each non-static prototype is extracted */
- searchForProtoSignature(sa, next, &start, &stop, &charindex, &found);
- if (!found)
- break;
-/* lept_stderr(" start = %d, stop = %d, charindex = %d\n",
- start, stop, charindex); */
- str = captureProtoSignature(sa, start, stop, charindex);
-
- /* Make sure that the signature found by cpp does not begin with
- * static, extern or typedef. We get 'extern' declarations
- * from header files, and with some versions of cpp running on
- * #include we get something of the form:
- * extern ... (( ... )) ... ( ... ) { ...
- * For this, the 1st '(' is the lp, the 2nd ')' is the rp,
- * and there is a lot of garbage between the rp and the lp.
- * It is easiest to simply reject any signature that starts
- * with 'extern'. Note also that an 'extern' token has been
- * prepended to each prototype, so the 'static' or
- * 'extern' keywords we are looking for, if they exist,
- * would be the second word. We also have a typedef in
- * bmpio.c that has the form:
- * typedef struct __attribute__((....)) { ...} ... ;
- * This is avoided by blacklisting 'typedef' along with 'extern'
- * and 'static'. */
- satest = sarrayCreateWordsFromString(str);
- secondword = sarrayGetString(satest, 1, L_NOCOPY);
- if (strcmp(secondword, "static") && /* not static */
- strcmp(secondword, "extern") && /* not extern */
- strcmp(secondword, "typedef")) { /* not typedef */
- if (prestring) { /* prepend it to the prototype */
- newstr = stringJoin(prestring, str);
- sarrayAddString(saout, newstr, L_INSERT);
- LEPT_FREE(str);
- } else {
- sarrayAddString(saout, str, L_INSERT);
- }
- } else {
- LEPT_FREE(str);
- }
- sarrayDestroy(&satest);
-
- skipToEndOfFunction(sa, stop, charindex, &next);
- if (next == -1) break;
- }
-
- /* Flatten into a string with newlines between prototypes */
- parsestr = sarrayToString(saout, 1);
- LEPT_FREE(strdata);
- sarrayDestroy(&sa);
- sarrayDestroy(&saout);
-
- return parsestr;
-}
-
-
-/*
- * \brief getNextNonCommentLine()
- *
- * \param[in] sa output from cpp, by line)
- * \param[in] start starting index to search)
- * \param[out] pnext index of first uncommented line after the start line
- * \return 0 if OK, o on error
- *
- *
- * Notes:
- * (1) Skips over all consecutive comment lines, beginning at 'start'
- * (2) If all lines to the end are '#' comments, return next = -1
- *
- */
-static l_int32
-getNextNonCommentLine(SARRAY *sa,
- l_int32 start,
- l_int32 *pnext)
-{
-char *str;
-l_int32 i, n;
-
- PROCNAME("getNextNonCommentLine");
-
- if (!sa)
- return ERROR_INT("sa not defined", procName, 1);
- if (!pnext)
- return ERROR_INT("&pnext not defined", procName, 1);
-
- /* Init for situation where this line and all following are comments */
- *pnext = -1;
-
- n = sarrayGetCount(sa);
- for (i = start; i < n; i++) {
- if ((str = sarrayGetString(sa, i, L_NOCOPY)) == NULL)
- return ERROR_INT("str not returned; shouldn't happen", procName, 1);
- if (str[0] != '#') {
- *pnext = i;
- return 0;
- }
- }
-
- return 0;
-}
-
-
-/*
- * \brief getNextNonBlankLine()
- *
- * \param[in] sa output from cpp, by line
- * \param[in] start starting index to search
- * \param[out] pnext index of first nonblank line after the start line
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) Skips over all consecutive blank lines, beginning at 'start'
- * (2) A blank line has only whitespace characters (' ', '\t', '\n', '\r')
- * (3) If all lines to the end are blank, return next = -1
- *
- */
-static l_int32
-getNextNonBlankLine(SARRAY *sa,
- l_int32 start,
- l_int32 *pnext)
-{
-char *str;
-l_int32 i, j, n, len;
-
- PROCNAME("getNextNonBlankLine");
-
- if (!sa)
- return ERROR_INT("sa not defined", procName, 1);
- if (!pnext)
- return ERROR_INT("&pnext not defined", procName, 1);
-
- /* Init for situation where this line and all following are blank */
- *pnext = -1;
-
- n = sarrayGetCount(sa);
- for (i = start; i < n; i++) {
- if ((str = sarrayGetString(sa, i, L_NOCOPY)) == NULL)
- return ERROR_INT("str not returned; shouldn't happen", procName, 1);
- len = strlen(str);
- for (j = 0; j < len; j++) {
- if (str[j] != ' ' && str[j] != '\t'
- && str[j] != '\n' && str[j] != '\r') { /* non-blank */
- *pnext = i;
- return 0;
- }
- }
- }
-
- return 0;
-}
-
-
-/*
- * \brief getNextNonDoubleSlashLine()
- *
- * \param[in] sa output from cpp, by line
- * \param[in] start starting index to search
- * \param[out] pnext index of first uncommented line after the start line
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) Skips over all consecutive '//' lines, beginning at 'start'
- * (2) If all lines to the end start with '//', return next = -1
- *
- */
-static l_int32
-getNextNonDoubleSlashLine(SARRAY *sa,
- l_int32 start,
- l_int32 *pnext)
-{
-char *str;
-l_int32 i, n, len;
-
- PROCNAME("getNextNonDoubleSlashLine");
-
- if (!sa)
- return ERROR_INT("sa not defined", procName, 1);
- if (!pnext)
- return ERROR_INT("&pnext not defined", procName, 1);
-
- /* Init for situation where this line and all following
- * start with '//' */
- *pnext = -1;
-
- n = sarrayGetCount(sa);
- for (i = start; i < n; i++) {
- if ((str = sarrayGetString(sa, i, L_NOCOPY)) == NULL)
- return ERROR_INT("str not returned; shouldn't happen", procName, 1);
- len = strlen(str);
- if (len < 2 || str[0] != '/' || str[1] != '/') {
- *pnext = i;
- return 0;
- }
- }
-
- return 0;
-}
-
-
-/*
- * \brief searchForProtoSignature()
- *
- * \param[in] sa output from cpp, by line
- * \param[in] begin beginning index to search
- * \param[out] pstart starting index for function definition
- * \param[out] pstop index of line on which proto is completed
- * \param[out] pcharindex char index of completing ')' character
- * \param[out] pfound 1 if valid signature is found; 0 otherwise
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) If this returns found == 0, it means that there are no
- * more function definitions in the file. Caller must check
- * this value and exit the loop over the entire cpp file.
- * (2) This follows plan 3 (see above). We skip comment and blank
- * lines at the beginning. Then we don't check for keywords.
- * Instead, find the relative locations of the first occurrences
- * of these four tokens: left parenthesis (lp), right
- * parenthesis (rp), left brace (lb) and semicolon (sc).
- * (3) The signature of a function definition looks like this:
- * .... '(' .... ')' '{'
- * where the lp and rp must both precede the lb, with only
- * whitespace between the rp and the lb. The '....'
- * are sets of tokens that have no braces.
- * (4) If a function definition is found, this returns found = 1,
- * with 'start' being the first line of the definition and
- * 'charindex' being the position of the ')' in line 'stop'
- * at the end of the arg list.
- *
- */
-static l_int32
-searchForProtoSignature(SARRAY *sa,
- l_int32 begin,
- l_int32 *pstart,
- l_int32 *pstop,
- l_int32 *pcharindex,
- l_int32 *pfound)
-{
-l_int32 next, rbline, rbindex, scline;
-l_int32 soffsetlp, soffsetrp, soffsetlb, soffsetsc;
-l_int32 boffsetlp, boffsetrp, boffsetlb, boffsetsc;
-l_int32 toffsetlp, toffsetrp, toffsetlb, toffsetsc;
-
- PROCNAME("searchForProtoSignature");
-
- if (!sa)
- return ERROR_INT("sa not defined", procName, 1);
- if (!pstart)
- return ERROR_INT("&start not defined", procName, 1);
- if (!pstop)
- return ERROR_INT("&stop not defined", procName, 1);
- if (!pcharindex)
- return ERROR_INT("&charindex not defined", procName, 1);
- if (!pfound)
- return ERROR_INT("&found not defined", procName, 1);
-
- *pfound = FALSE;
-
- while (1) {
-
- /* Skip over sequential '#' comment lines */
- getNextNonCommentLine(sa, begin, &next);
- if (next == -1) return 0;
- if (next != begin) {
- begin = next;
- continue;
- }
-
- /* Skip over sequential blank lines */
- getNextNonBlankLine(sa, begin, &next);
- if (next == -1) return 0;
- if (next != begin) {
- begin = next;
- continue;
- }
-
- /* Skip over sequential lines starting with '//' */
- getNextNonDoubleSlashLine(sa, begin, &next);
- if (next == -1) return 0;
- if (next != begin) {
- begin = next;
- continue;
- }
-
- /* Search for specific character sequence patterns; namely
- * a lp, a matching rp, a lb and a semicolon.
- * Abort the search if no lp is found. */
- getOffsetForCharacter(sa, next, '(', &soffsetlp, &boffsetlp,
- &toffsetlp);
- if (soffsetlp == -1)
- break;
- getOffsetForMatchingRP(sa, next, soffsetlp, boffsetlp, toffsetlp,
- &soffsetrp, &boffsetrp, &toffsetrp);
- getOffsetForCharacter(sa, next, '{', &soffsetlb, &boffsetlb,
- &toffsetlb);
- getOffsetForCharacter(sa, next, ';', &soffsetsc, &boffsetsc,
- &toffsetsc);
-
- /* We've found a lp. Now weed out the case where a matching
- * rp and a lb are not both found. */
- if (soffsetrp == -1 || soffsetlb == -1)
- break;
-
- /* Check if a left brace occurs before a left parenthesis;
- * if so, skip it */
- if (toffsetlb < toffsetlp) {
- skipToMatchingBrace(sa, next + soffsetlb, boffsetlb,
- &rbline, &rbindex);
- skipToSemicolon(sa, rbline, rbindex, &scline);
- begin = scline + 1;
- continue;
- }
-
- /* Check if a semicolon occurs before a left brace or
- * a left parenthesis; if so, skip it */
- if ((soffsetsc != -1) &&
- (toffsetsc < toffsetlb || toffsetsc < toffsetlp)) {
- skipToSemicolon(sa, next, 0, &scline);
- begin = scline + 1;
- continue;
- }
-
- /* OK, it should be a function definition. We haven't
- * checked that there is only white space between the
- * rp and lb, but we've only seen problems with two
- * extern inlines in sys/stat.h, and this is handled
- * later by eliminating any prototype beginning with 'extern'. */
- *pstart = next;
- *pstop = next + soffsetrp;
- *pcharindex = boffsetrp;
- *pfound = TRUE;
- break;
- }
-
- return 0;
-}
-
-
-/*
- * \brief captureProtoSignature()
- *
- * \param[in] sa output from cpp, by line
- * \param[in] start starting index to search; never a comment line
- * \param[in] stop index of line on which pattern is completed
- * \param[in] charindex char index of completing ')' character
- * \return cleanstr prototype string, or NULL on error
- *
- *
- * Notes:
- * (1) Return all characters, ending with a ';' after the ')'
- *
- */
-static char *
-captureProtoSignature(SARRAY *sa,
- l_int32 start,
- l_int32 stop,
- l_int32 charindex)
-{
-char *str, *newstr, *protostr, *cleanstr;
-SARRAY *sap;
-l_int32 i;
-
- PROCNAME("captureProtoSignature");
-
- if (!sa)
- return (char *)ERROR_PTR("sa not defined", procName, NULL);
-
- sap = sarrayCreate(0);
- for (i = start; i < stop; i++) {
- str = sarrayGetString(sa, i, L_COPY);
- sarrayAddString(sap, str, L_INSERT);
- }
- str = sarrayGetString(sa, stop, L_COPY);
- str[charindex + 1] = '\0';
- newstr = stringJoin(str, ";");
- sarrayAddString(sap, newstr, L_INSERT);
- LEPT_FREE(str);
- protostr = sarrayToString(sap, 2);
- sarrayDestroy(&sap);
- cleanstr = cleanProtoSignature(protostr);
- LEPT_FREE(protostr);
-
- return cleanstr;
-}
-
-
-/*
- * \brief cleanProtoSignature()
- *
- * \param[in] instr input prototype string
- * \return cleanstr clean prototype string, or NULL on error
- *
- *
- * Notes:
- * (1) Adds 'extern' at beginning and regularizes spaces
- * between tokens.
- *
- */
-static char *
-cleanProtoSignature(char *instr)
-{
-char *str, *cleanstr;
-char buf[Bufsize];
-char externstring[] = "extern";
-l_int32 i, j, nwords, nchars, index, len;
-SARRAY *sa, *saout;
-
- PROCNAME("cleanProtoSignature");
-
- if (!instr)
- return (char *)ERROR_PTR("instr not defined", procName, NULL);
-
- sa = sarrayCreateWordsFromString(instr);
- nwords = sarrayGetCount(sa);
- saout = sarrayCreate(0);
- sarrayAddString(saout, externstring, L_COPY);
- for (i = 0; i < nwords; i++) {
- str = sarrayGetString(sa, i, L_NOCOPY);
- nchars = strlen(str);
- index = 0;
- for (j = 0; j < nchars; j++) {
- if (index > Bufsize - 6) {
- sarrayDestroy(&sa);
- sarrayDestroy(&saout);
- return (char *)ERROR_PTR("token too large", procName, NULL);
- }
- if (str[j] == '(') {
- buf[index++] = ' ';
- buf[index++] = '(';
- buf[index++] = ' ';
- } else if (str[j] == ')') {
- buf[index++] = ' ';
- buf[index++] = ')';
- } else {
- buf[index++] = str[j];
- }
- }
- buf[index] = '\0';
- sarrayAddString(saout, buf, L_COPY);
- }
-
- /* Flatten to a prototype string with spaces added after
- * each word, and remove the last space */
- cleanstr = sarrayToString(saout, 2);
- len = strlen(cleanstr);
- cleanstr[len - 1] = '\0';
-
- sarrayDestroy(&sa);
- sarrayDestroy(&saout);
- return cleanstr;
-}
-
-
-/*
- * \brief skipToEndOfFunction()
- *
- * \param[in] sa output from cpp, by line
- * \param[in] start index of starting line with left bracket to search
- * \param[in] lbindex starting char index for left bracket
- * \param[out] pnext index of line following the ending '}' for function
- * \return 0 if OK, 1 on error
- */
-static l_int32
-skipToEndOfFunction(SARRAY *sa,
- l_int32 start,
- l_int32 lbindex,
- l_int32 *pnext)
-{
-l_int32 end, rbindex;
-l_int32 soffsetlb, boffsetlb, toffsetlb;
-
- PROCNAME("skipToEndOfFunction");
-
- if (!sa)
- return ERROR_INT("sa not defined", procName, 1);
- if (!pnext)
- return ERROR_INT("&next not defined", procName, 1);
-
- getOffsetForCharacter(sa, start, '{', &soffsetlb, &boffsetlb,
- &toffsetlb);
- skipToMatchingBrace(sa, start + soffsetlb, boffsetlb, &end, &rbindex);
- if (end == -1) { /* shouldn't happen! */
- *pnext = -1;
- return 1;
- }
-
- *pnext = end + 1;
- return 0;
-}
-
-
-/*
- * \brief skipToMatchingBrace()
- *
- * \param[in] sa output from cpp, by line
- * \param[in] start index of starting line with left bracket to search
- * \param[in] lbindex starting char index for left bracket
- * \param[out] pstop index of line with the matching right bracket
- * \param[out] prbindex char index of matching right bracket
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) If the matching right brace is not found, returns
- * stop = -1. This shouldn't happen.
- *
- */
-static l_int32
-skipToMatchingBrace(SARRAY *sa,
- l_int32 start,
- l_int32 lbindex,
- l_int32 *pstop,
- l_int32 *prbindex)
-{
-char *str;
-l_int32 i, j, jstart, n, sumbrace, found, instring, nchars;
-
- PROCNAME("skipToMatchingBrace");
-
- if (!sa)
- return ERROR_INT("sa not defined", procName, 1);
- if (!pstop)
- return ERROR_INT("&stop not defined", procName, 1);
- if (!prbindex)
- return ERROR_INT("&rbindex not defined", procName, 1);
-
- instring = 0; /* init to FALSE; toggle on double quotes */
- *pstop = -1;
- n = sarrayGetCount(sa);
- sumbrace = 1;
- found = FALSE;
- for (i = start; i < n; i++) {
- str = sarrayGetString(sa, i, L_NOCOPY);
- jstart = 0;
- if (i == start)
- jstart = lbindex + 1;
- nchars = strlen(str);
- for (j = jstart; j < nchars; j++) {
- /* Toggle the instring state every time you encounter
- * a double quote that is NOT escaped. */
- if (j == jstart && str[j] == '\"')
- instring = 1 - instring;
- if (j > jstart && str[j] == '\"' && str[j-1] != '\\')
- instring = 1 - instring;
- /* Record the braces if they are neither a literal character
- * nor within a string. */
- if (str[j] == '{' && str[j+1] != '\'' && !instring) {
- sumbrace++;
- } else if (str[j] == '}' && str[j+1] != '\'' && !instring) {
- sumbrace--;
- if (sumbrace == 0) {
- found = TRUE;
- *prbindex = j;
- break;
- }
- }
- }
- if (found) {
- *pstop = i;
- return 0;
- }
- }
-
- return ERROR_INT("matching right brace not found", procName, 1);
-}
-
-
-/*
- * \brief skipToSemicolon()
- *
- * \param[in] sa output from cpp, by line
- * \param[in] start index of starting line to search
- * \param[in] charindex starting char index for search
- * \param[out] pnext index of line containing the next ';'
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) If the semicolon isn't found, returns next = -1.
- * This shouldn't happen.
- * (2) This is only used in contexts where the semicolon is
- * not within a string.
- *
- */
-static l_int32
-skipToSemicolon(SARRAY *sa,
- l_int32 start,
- l_int32 charindex,
- l_int32 *pnext)
-{
-char *str;
-l_int32 i, j, n, jstart, nchars, found;
-
- PROCNAME("skipToSemicolon");
-
- if (!sa)
- return ERROR_INT("sa not defined", procName, 1);
- if (!pnext)
- return ERROR_INT("&next not defined", procName, 1);
-
- *pnext = -1;
- n = sarrayGetCount(sa);
- found = FALSE;
- for (i = start; i < n; i++) {
- str = sarrayGetString(sa, i, L_NOCOPY);
- jstart = 0;
- if (i == start)
- jstart = charindex + 1;
- nchars = strlen(str);
- for (j = jstart; j < nchars; j++) {
- if (str[j] == ';') {
- found = TRUE;;
- break;
- }
- }
- if (found) {
- *pnext = i;
- return 0;
- }
- }
-
- return ERROR_INT("semicolon not found", procName, 1);
-}
-
-
-/*
- * \brief getOffsetForCharacter()
- *
- * \param[in] sa output from cpp, by line
- * \param[in] start starting index in sa to search;
- * never a comment line
- * \param[in] tchar we are searching for the first instance of this
- * \param[out] psoffset offset in strings from start index
- * \param[out] pboffset offset in bytes within string in which
- * the character is first found
- * \param[out] ptoffset offset in total bytes from beginning of string
- * indexed by 'start' to the location where
- * the character is first found
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) We are searching for the first instance of 'tchar', starting
- * at the beginning of the string indexed by start.
- * (2) If the character is not found, soffset is returned as -1,
- * and the other offsets are set to very large numbers. The
- * caller must check the value of soffset.
- * (3) This is only used in contexts where it is not necessary to
- * consider if the character is inside a string.
- *
- */
-static l_int32
-getOffsetForCharacter(SARRAY *sa,
- l_int32 start,
- char tchar,
- l_int32 *psoffset,
- l_int32 *pboffset,
- l_int32 *ptoffset)
-{
-char *str;
-l_int32 i, j, n, nchars, totchars, found;
-
- PROCNAME("getOffsetForCharacter");
-
- if (!sa)
- return ERROR_INT("sa not defined", procName, 1);
- if (!psoffset)
- return ERROR_INT("&soffset not defined", procName, 1);
- if (!pboffset)
- return ERROR_INT("&boffset not defined", procName, 1);
- if (!ptoffset)
- return ERROR_INT("&toffset not defined", procName, 1);
-
- *psoffset = -1; /* init to not found */
- *pboffset = 100000000;
- *ptoffset = 100000000;
-
- n = sarrayGetCount(sa);
- found = FALSE;
- totchars = 0;
- for (i = start; i < n; i++) {
- if ((str = sarrayGetString(sa, i, L_NOCOPY)) == NULL)
- return ERROR_INT("str not returned; shouldn't happen", procName, 1);
- nchars = strlen(str);
- for (j = 0; j < nchars; j++) {
- if (str[j] == tchar) {
- found = TRUE;
- break;
- }
- }
- if (found)
- break;
- totchars += nchars;
- }
-
- if (found) {
- *psoffset = i - start;
- *pboffset = j;
- *ptoffset = totchars + j;
- }
-
- return 0;
-}
-
-
-/*
- * \brief getOffsetForMatchingRP()
- *
- * \param[in] sa output from cpp, by line
- * \param[in] start starting index in sa to search;
- * never a comment line
- * \param[in] soffsetlp string offset to first LP
- * \param[in] boffsetlp byte offset within string to first LP
- * \param[in] toffsetlp total byte offset to first LP
- * \param[out] psoffset offset in strings from start index
- * \param[out] pboffset offset in bytes within string in which
- * the matching RP is found
- * \param[out] ptoffset offset in total bytes from beginning of string
- * indexed by 'start' to the location where
- * the matching RP is found
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) We are searching for the matching right parenthesis (RP) that
- * corresponds to the first LP found beginning at the string
- * indexed by start.
- * (2) If the matching RP is not found, soffset is returned as -1,
- * and the other offsets are set to very large numbers. The
- * caller must check the value of soffset.
- * (3) This is only used in contexts where it is not necessary to
- * consider if the character is inside a string.
- * (4) We must do this because although most arg lists have a single
- * left and right parenthesis, it is possible to construct
- * more complicated prototype declarations, such as those
- * where functions are passed in. The C++ rules for prototypes
- * are strict, and require that for functions passed in as args,
- * the function name arg be placed in parenthesis, as well
- * as its arg list, thus incurring two extra levels of parentheses.
- *
- */
-static l_int32
-getOffsetForMatchingRP(SARRAY *sa,
- l_int32 start,
- l_int32 soffsetlp,
- l_int32 boffsetlp,
- l_int32 toffsetlp,
- l_int32 *psoffset,
- l_int32 *pboffset,
- l_int32 *ptoffset)
-{
-char *str;
-l_int32 i, j, n, nchars, totchars, leftmatch, firstline, jstart, found;
-
- PROCNAME("getOffsetForMatchingRP");
-
- if (!sa)
- return ERROR_INT("sa not defined", procName, 1);
- if (!psoffset)
- return ERROR_INT("&soffset not defined", procName, 1);
- if (!pboffset)
- return ERROR_INT("&boffset not defined", procName, 1);
- if (!ptoffset)
- return ERROR_INT("&toffset not defined", procName, 1);
-
- *psoffset = -1; /* init to not found */
- *pboffset = 100000000;
- *ptoffset = 100000000;
-
- n = sarrayGetCount(sa);
- found = FALSE;
- totchars = toffsetlp;
- leftmatch = 1; /* count of (LP - RP); we're finished when it goes to 0. */
- firstline = start + soffsetlp;
- for (i = firstline; i < n; i++) {
- if ((str = sarrayGetString(sa, i, L_NOCOPY)) == NULL)
- return ERROR_INT("str not returned; shouldn't happen", procName, 1);
- nchars = strlen(str);
- jstart = 0;
- if (i == firstline)
- jstart = boffsetlp + 1;
- for (j = jstart; j < nchars; j++) {
- if (str[j] == '(')
- leftmatch++;
- else if (str[j] == ')')
- leftmatch--;
- if (leftmatch == 0) {
- found = TRUE;
- break;
- }
- }
- if (found)
- break;
- if (i == firstline)
- totchars += nchars - boffsetlp;
- else
- totchars += nchars;
- }
-
- if (found) {
- *psoffset = i - start;
- *pboffset = j;
- *ptoffset = totchars + j;
- }
-
- return 0;
-}
diff --git a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/partify.c b/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/partify.c
deleted file mode 100644
index 4625b84a..00000000
--- a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/partify.c
+++ /dev/null
@@ -1,315 +0,0 @@
-/*====================================================================*
- - Copyright (C) 2001 Leptonica. All rights reserved.
- -
- - Redistribution and use in source and binary forms, with or without
- - modification, are permitted provided that the following conditions
- - are met:
- - 1. Redistributions of source code must retain the above copyright
- - notice, this list of conditions and the following disclaimer.
- - 2. Redistributions in binary form must reproduce the above
- - copyright notice, this list of conditions and the following
- - disclaimer in the documentation and/or other materials
- - provided with the distribution.
- -
- - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- - ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- - LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- - A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL ANY
- - CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
- - EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
- - PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
- - PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
- - OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
- - NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- *====================================================================*/
-
-/*!
- * \file partify.c
- *
- *
- * Top level
- * l_int32 partifyFiles()
- * l_int32 partifyPixac()
- *
- * Helpers
- * static BOXA *pixLocateStaveSets()
- * static l_int32 boxaRemoveVGaps()
- *
- */
-
-#ifdef HAVE_CONFIG_H
-#include
-#endif /* HAVE_CONFIG_H */
-
-#include "allheaders.h"
-
- /* Static helplers */
-static BOXA *pixLocateStaveSets(PIX *pixs, l_int32 pageno, PIXA *pixadb);
-static l_ok boxaRemoveVGaps(BOXA *boxa);
-
-/*---------------------------------------------------------------------*
- * Top level *
- *---------------------------------------------------------------------*/
-/*!
- * \brief partifyFiles()
- *
- * \param[in] dirname directory of files
- * \param[in] substr required filename substring; use NULL for all files
- * \param[in] nparts number of parts to generate (counting from top)
- * \param[in] outroot root name of output pdf files
- * \param[in] debugfile [optional] set to NULL for no debug output
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) All page images are compressed in png format into a pixacomp.
- * (2) Each page image is deskewed, binarized at 300 ppi,
- * partified into %nparts, and saved in a set of pixacomps
- * in tiff-g4 format.
- * (3) Each partified pixacomp is rendered into a set of page images,
- * and output as a pdf.
- *
- */
-l_ok
-partifyFiles(const char *dirname,
- const char *substr,
- l_int32 nparts,
- const char *outroot,
- const char *debugfile)
-{
-PIXA *pixadb;
-PIXAC *pixac;
-
- PROCNAME("partifyFiles");
-
- if (!dirname)
- return ERROR_INT("dirname not defined", procName, 1);
- if (nparts < 0 || nparts > 10)
- return ERROR_INT("nparts not in [1 ... 10]", procName, 1);
- if (!outroot || outroot[0] == '\n')
- return ERROR_INT("outroot undefined or empty", procName, 1);
-
- pixadb = (debugfile) ? pixaCreate(0) : NULL;
- pixac = pixacompCreateFromFiles(dirname, substr, IFF_PNG);
- partifyPixac(pixac, nparts, outroot, pixadb);
- if (pixadb) {
- L_INFO("writing debug output to %s\n", procName, debugfile);
- pixaConvertToPdf(pixadb, 300, 1.0, L_FLATE_ENCODE, 0,
- "Partify Debug", debugfile);
- }
- pixacompDestroy(&pixac);
- pixaDestroy(&pixadb);
- return 0;
-}
-
-
-/*!
- * \brief partifyPixac()
- *
- * \param[in] pixac with at least one image
- * \param[in] nparts number of parts to generate (counting from top)
- * \param[in] outroot root name of output pdf files
- * \param[in] pixadb [optional] debug pixa; can be NULL
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) See partifyPixac().
- * (2) If the image files do not have a resolution, 300 ppi is assumed.
- *
- */
-l_ok
-partifyPixac(PIXAC *pixac,
- l_int32 nparts,
- const char *outroot,
- PIXA *pixadb)
-{
-char buf[512];
-l_int32 i, j, pageno, res, npage, nbox, icount, line;
-l_float32 factor;
-L_BMF *bmf;
-BOX *box1, *box2;
-BOXA *boxa1, *boxa2, *boxa3;
-PIX *pix1, *pix2, *pix3, *pix4, *pix5;
-PIXAC **pixaca;
-
- PROCNAME("partifyPixac");
-
- if (!pixac)
- return ERROR_INT("pixac not defined", procName, 1);
- if ((npage = pixacompGetCount(pixac)) == 0)
- return ERROR_INT("pixac is empty", procName, 1);
- if (nparts < 1 || nparts > 10)
- return ERROR_INT("nparts not in [1 ... 10]", procName, 1);
- if (!outroot || outroot[0] == '\n')
- return ERROR_INT("outroot undefined or empty", procName, 1);
-
- /* Initialize the output array for each of the nparts */
- pixaca = (PIXAC **)LEPT_CALLOC(nparts, sizeof(PIXAC *));
- for (i = 0; i < nparts; i++)
- pixaca[i] = pixacompCreate(0);
-
- /* Process each page */
- line = 1;
- bmf = bmfCreate(NULL, 10);
- for (pageno = 0; pageno < npage; pageno++) {
- if ((pix1 = pixacompGetPix(pixac, pageno)) == NULL) {
- L_ERROR("pix for page %d not found\n", procName, pageno);
- continue;
- }
-
- /* Scale, binarize and deskew */
- res = pixGetXRes(pix1);
- if (res == 0 || res == 300 || res > 600) {
- pix2 = pixClone(pix1);
- } else {
- factor = 300.0 / (l_float32)res;
- if (factor > 3)
- L_WARNING("resolution is very low\n", procName);
- pix2 = pixScale(pix1, factor, factor);
- }
- pix3 = pixConvertTo1Adaptive(pix2);
- pix4 = pixDeskew(pix3, 0);
- pixDestroy(&pix1);
- pixDestroy(&pix2);
- pixDestroy(&pix3);
- if (!pix4) {
- L_ERROR("pix for page %d not deskewed\n", procName, pageno);
- continue;
- }
- pix1 = pixClone(pix4); /* rename */
- pixDestroy(&pix4);
-
- /* Find the stave sets at 4x reduction */
- boxa1 = pixLocateStaveSets(pix1, pageno, pixadb);
-
- /* Break each stave set into the separate staves (parts).
- * A typical set will have more than one part, but if one of
- * the parts is a keyboard, it will usually have two staves
- * (also called a Grand Staff), composed of treble and
- * bass staves. For example, a classical violin sonata
- * could have a staff for the violin and two staves for
- * the piano. We would set nparts == 2, and extract both
- * of the piano staves as the piano part. */
- nbox = boxaGetCount(boxa1);
- lept_stderr("number of boxes in page %d: %d\n", pageno, nbox);
- for (i = 0; i < nbox; i++, line++) {
- snprintf(buf, sizeof(buf), "%d", line);
- box1 = boxaGetBox(boxa1, i, L_COPY);
- pix2 = pixClipRectangle(pix1, box1, NULL);
- pix3 = pixMorphSequence(pix2, "d1.20 + o50.1 + o1.30", 0);
- boxa2 = pixConnCompBB(pix3, 8);
- boxa3 = boxaSort(boxa2, L_SORT_BY_Y, L_SORT_INCREASING, NULL);
- boxaRemoveVGaps(boxa3);
- icount = boxaGetCount(boxa3);
- if (icount < nparts)
- L_WARNING("nparts requested = %d, but only found %d\n",
- procName, nparts, icount);
- for (j = 0; j < icount && j < nparts; j++) {
- box2 = boxaGetBox(boxa3, j, L_COPY);
- if (j == nparts - 1) /* extend the box to the bottom */
- boxSetSideLocations(box2, -1, -1, -1,
- pixGetHeight(pix1) - 1);
- pix4 = pixClipRectangle(pix2, box2, NULL);
- pix5 = pixAddTextlines(pix4, bmf, buf, 1, L_ADD_LEFT);
- pixacompAddPix(pixaca[j], pix5, IFF_TIFF_G4);
- boxDestroy(&box2);
- pixDestroy(&pix4);
- pixDestroy(&pix5);
- }
- boxaDestroy(&boxa2);
- boxaDestroy(&boxa3);
- boxDestroy(&box1);
- pixDestroy(&pix2);
- pixDestroy(&pix3);
- }
- boxaDestroy(&boxa1);
- pixDestroy(&pix1);
- }
-
- /* Output separate pdfs for each part */
- for (i = 0; i < nparts; i++) {
- snprintf(buf, sizeof(buf), "%s-%d.pdf", outroot, i);
- L_INFO("writing part %d: %s\n", procName, i, buf);
- pixacompConvertToPdf(pixaca[i], 300, 1.0, L_G4_ENCODE, 0, NULL, buf);
- pixacompDestroy(&pixaca[i]);
- }
- LEPT_FREE(pixaca);
- bmfDestroy(&bmf);
- return 0;
-}
-
-
-/*
- * \brief pixLocateStaveSets()
- *
- * \param[in] pixs 1 bpp, 300 ppi, deskewed
- * \param[in] pageno page number; used for debug output
- * \param[in] pixadb [optional] debug pixa; can be NULL
- * \return boxa containing the stave sets at full resolution
- */
-static BOXA *
-pixLocateStaveSets(PIX *pixs,
- l_int32 pageno,
- PIXA *pixadb)
-{
-BOXA *boxa1, *boxa2, *boxa3, *boxa4;
-PIX *pix1, *pix2;
-
- /* Find the stave sets at 4x reduction */
- pix1 = pixMorphSequence(pixs, "r11", 0);
- boxa1 = pixConnCompBB(pix1, 8);
- boxa2 = boxaSelectByArea(boxa1, 15000, L_SELECT_IF_GT, NULL);
- boxa3 = boxaSort(boxa2, L_SORT_BY_Y, L_SORT_INCREASING, NULL);
- if (pixadb) {
- pix2 = pixConvertTo32(pix1);
- pixRenderBoxaArb(pix2, boxa3, 2, 255, 0, 0);
- pixaAddPix(pixadb, pix2, L_INSERT);
- pixDisplay(pix2, 100 * pageno, 100);
- }
- boxaDestroy(&boxa1);
- boxaDestroy(&boxa2);
-
- boxaRemoveVGaps(boxa3);
- if (pixadb) {
- pix2 = pixConvertTo32(pix1);
- pixRenderBoxaArb(pix2, boxa3, 2, 0, 255, 0);
- pixaAddPix(pixadb, pix2, L_INSERT);
- pixDisplay(pix2, 100 * pageno, 600);
- }
- boxa4 = boxaTransform(boxa3, 0, 0, 4.0, 4.0); /* back to full res */
- boxaDestroy(&boxa3);
- pixDestroy(&pix1);
- return boxa4;
-}
-
-
-/*
- * \brief boxaRemoveVGaps()
- *
- * \param[in] boxa
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) The boxes in %boxa are aligned vertically. Move the horizontal
- * edges vertically to remove the gaps between boxes.
- *
- */
-static l_ok
-boxaRemoveVGaps(BOXA *boxa)
-{
-l_int32 nbox, i, y1, h1, y2, h2, delta;
-
- nbox = boxaGetCount(boxa);
- for (i = 0; i < nbox - 1; i++) {
- boxaGetBoxGeometry(boxa, i, NULL, &y1, NULL, &h1);
- boxaGetBoxGeometry(boxa, i + 1, NULL, &y2, NULL, &h2);
- delta = (y2 - y1 - h1) / 2;
- boxaAdjustBoxSides(boxa, i, 0, 0, 0, delta);
- boxaAdjustBoxSides(boxa, i + 1, 0, 0, -delta, 0);
- }
- boxaAdjustBoxSides(boxa, nbox - 1, 0, 0, 0, delta); /* bot of last */
- return 0;
-}
diff --git a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/partition.c b/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/partition.c
deleted file mode 100644
index 3d4c74b9..00000000
--- a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/partition.c
+++ /dev/null
@@ -1,662 +0,0 @@
-/*====================================================================*
- - Copyright (C) 2001 Leptonica. All rights reserved.
- -
- - Redistribution and use in source and binary forms, with or without
- - modification, are permitted provided that the following conditions
- - are met:
- - 1. Redistributions of source code must retain the above copyright
- - notice, this list of conditions and the following disclaimer.
- - 2. Redistributions in binary form must reproduce the above
- - copyright notice, this list of conditions and the following
- - disclaimer in the documentation and/or other materials
- - provided with the distribution.
- -
- - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- - ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- - LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- - A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL ANY
- - CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
- - EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
- - PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
- - PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
- - OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
- - NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- *====================================================================*/
-
-/*!
- * \file partition.c
- *
- *
- * Whitespace block extraction
- * BOXA *boxaGetWhiteblocks()
- *
- * Helpers
- * static PARTEL *partelCreate()
- * static void partelDestroy()
- * static l_int32 partelSetSize()
- * static BOXA *boxaGenerateSubboxes()
- * static BOX *boxaSelectPivotBox()
- * static l_int32 boxaCheckIfOverlapIsSmall()
- * BOXA *boxaPruneSortedOnOverlap()
- *
- */
-
-#ifdef HAVE_CONFIG_H
-#include
-#endif /* HAVE_CONFIG_H */
-
-#include "allheaders.h"
-
-/*! Partition element */
-struct PartitionElement {
- l_float32 size; /* sorting key */
- BOX *box; /* region of the element */
- BOXA *boxa; /* set of intersecting boxes */
-};
-typedef struct PartitionElement PARTEL;
-
-static PARTEL * partelCreate(BOX *box);
-static void partelDestroy(PARTEL **ppartel);
-static l_int32 partelSetSize(PARTEL *partel, l_int32 sortflag);
-static BOXA * boxaGenerateSubboxes(BOX *box, BOXA *boxa, l_int32 maxperim,
- l_float32 fract);
-static BOX * boxaSelectPivotBox(BOX *box, BOXA *boxa, l_int32 maxperim,
- l_float32 fract);
-static l_int32 boxCheckIfOverlapIsBig(BOX *box, BOXA *boxa,
- l_float32 maxoverlap);
-
-static const l_int32 DefaultMaxPops = 20000;
-
-
-#ifndef NO_CONSOLE_IO
-#define OUTPUT_HEAP_STATS 0
-#endif /* ~NO_CONSOLE_IO */
-
-/*------------------------------------------------------------------*
- * Whitespace block extraction *
- *------------------------------------------------------------------*/
-/*!
- * \brief boxaGetWhiteblocks()
- *
- * \param[in] boxas typ. a set of bounding boxes of fg components
- * \param[in] box initial region; typically including all boxes
- * in boxas; if null, it computes the region to
- * include all boxes in boxas
- * \param[in] sortflag L_SORT_BY_WIDTH, L_SORT_BY_HEIGHT,
- * L_SORT_BY_MIN_DIMENSION, L_SORT_BY_MAX_DIMENSION,
- * L_SORT_BY_PERIMETER, L_SORT_BY_AREA
- * \param[in] maxboxes max number of output whitespace boxes; e.g., 100
- * \param[in] maxoverlap maximum fractional overlap of a box by any
- * of the larger boxes; e.g., 0.2
- * \param[in] maxperim maximum half-perimeter, in pixels, for which
- * pivot is selected by proximity to box centroid;
- * e.g., 200
- * \param[in] fract fraction of box diagonal that is an acceptable
- * distance from the box centroid to select
- * the pivot; e.g., 0.2
- * \param[in] maxpops max number of pops from the heap; use 0 as default
- * \return boxa of sorted whitespace boxes, or NULL on error
- *
- *
- * Notes:
- * (1) This uses the elegant Breuel algorithm, found in "Two
- * Geometric Algorithms for Layout Analysis", 2002,
- * url: "citeseer.ist.psu.edu/breuel02two.html".
- * It starts with the bounding boxes (b.b.) of the connected
- * components (c.c.) in a region, along with the rectangle
- * representing that region. It repeatedly divides the
- * rectangle into four maximal rectangles that exclude a
- * pivot rectangle, sorting them in a priority queue
- * according to one of the six sort flags. It returns a boxa
- * of the "largest" set that have no intersection with boxes
- * from the input boxas.
- * (2) If box == NULL, the initial region is the minimal region
- * that includes the origin and every box in boxas.
- * (3) maxboxes is the maximum number of whitespace boxes that will
- * be returned. The actual number will depend on the image
- * and the values chosen for maxoverlap and maxpops. In many
- * cases, the actual number will be 'maxboxes'.
- * (4) maxoverlap allows pruning of whitespace boxes depending on
- * the overlap. To avoid all pruning, use maxoverlap = 1.0.
- * To select only boxes that have no overlap with each other
- * (maximal pruning), choose maxoverlap = 0.0.
- * Otherwise, no box can have more than the 'maxoverlap' fraction
- * of its area overlapped by any larger (in the sense of the
- * sortflag) box.
- * (5) Choose maxperim (actually, maximum half-perimeter) to
- * represent a c.c. that is small enough so that you don't care
- * about the white space that could be inside of it. For all such
- * c.c., the pivot for 'quadfurcation' of a rectangle is selected
- * as having a reasonable proximity to the rectangle centroid.
- * (6) Use fract in the range [0.0 ... 1.0]. Set fract = 0.0
- * to choose the small box nearest the centroid as the pivot.
- * If you choose fract > 0.0, it is suggested that you call
- * boxaPermuteRandom() first, to permute the boxes (see usage below).
- * This should reduce the search time for each of the pivot boxes.
- * (7) Choose maxpops to be the maximum number of rectangles that
- * are popped from the heap. This is an indirect way to limit the
- * execution time. Use 0 for default (a fairly large number).
- * At any time, you can expect the heap to contain about
- * 2.5 times as many boxes as have been popped off.
- * (8) The output result is a sorted set of overlapping
- * boxes, constrained by 'maxboxes', 'maxoverlap' and 'maxpops'.
- * (9) The main defect of the method is that it abstracts out the
- * actual components, retaining only the b.b. for analysis.
- * Consider a component with a large b.b. If this is chosen
- * as a pivot, all white space inside is immediately taken
- * out of consideration. Furthermore, even if it is never chosen
- * as a pivot, as the partitioning continues, at no time will
- * any of the whitespace inside this component be part of a
- * rectangle with zero overlapping boxes. Thus, the interiors
- * of all boxes are necessarily excluded from the union of
- * the returned whitespace boxes.
- * (10) It should be noted that the algorithm puts a large number
- * of partels on the queue. Setting a limit of X partels to
- * remove from the queue, one typically finds that there will be
- * several times that number (say, 2X - 3X) left on the queue.
- * For an efficient algorithm to find the largest white or
- * or black rectangles, without permitting them to overlap,
- * see pixFindLargeRectangles().
- * (11) USAGE: One way to accommodate to this weakness is to remove such
- * large b.b. before starting the computation. For example,
- * if 'box' is an input image region containing 'boxa' b.b. of c.c.:
- *
- * // Faster pivot choosing
- * boxaPermuteRandom(boxa, boxa);
- *
- * // Remove anything either large width or height
- * boxat = boxaSelectBySize(boxa, maxwidth, maxheight,
- * L_SELECT_IF_BOTH, L_SELECT_IF_LT,
- * NULL);
- *
- * boxad = boxaGetWhiteblocks(boxat, box, type, maxboxes,
- * maxoverlap, maxperim, fract,
- * maxpops);
- *
- * The result will be rectangular regions of "white space" that
- * extend into (and often through) the excluded components.
- * (11) As a simple example, suppose you wish to find the columns on a page.
- * First exclude large c.c. that may block the columns, and then call:
- *
- * boxad = boxaGetWhiteblocks(boxa, box, L_SORT_BY_HEIGHT,
- * 20, 0.15, 200, 0.2, 2000);
- *
- * to get the 20 tallest boxes with no more than 0.15 overlap
- * between a box and any of the taller ones, and avoiding the
- * use of any c.c. with a b.b. half perimeter greater than 200
- * as a pivot.
- *
- */
-BOXA *
-boxaGetWhiteblocks(BOXA *boxas,
- BOX *box,
- l_int32 sortflag,
- l_int32 maxboxes,
- l_float32 maxoverlap,
- l_int32 maxperim,
- l_float32 fract,
- l_int32 maxpops)
-{
-l_int32 i, w, h, n, nsub, npush, npop;
-BOX *boxsub;
-BOXA *boxa, *boxa4, *boxasub, *boxad;
-PARTEL *partel;
-L_HEAP *lh;
-
- PROCNAME("boxaGetWhiteblocks");
-
- if (!boxas)
- return (BOXA *)ERROR_PTR("boxas not defined", procName, NULL);
- if (sortflag != L_SORT_BY_WIDTH && sortflag != L_SORT_BY_HEIGHT &&
- sortflag != L_SORT_BY_MIN_DIMENSION &&
- sortflag != L_SORT_BY_MAX_DIMENSION &&
- sortflag != L_SORT_BY_PERIMETER && sortflag != L_SORT_BY_AREA)
- return (BOXA *)ERROR_PTR("invalid sort flag", procName, NULL);
- if (maxboxes < 1) {
- maxboxes = 1;
- L_WARNING("setting maxboxes = 1\n", procName);
- }
- if (maxoverlap < 0.0 || maxoverlap > 1.0)
- return (BOXA *)ERROR_PTR("invalid maxoverlap", procName, NULL);
- if (maxpops == 0)
- maxpops = DefaultMaxPops;
-
- if (!box) {
- boxaGetExtent(boxas, &w, &h, NULL);
- box = boxCreate(0, 0, w, h);
- }
-
- /* Prime the heap */
- lh = lheapCreate(20, L_SORT_DECREASING);
- partel = partelCreate(box);
- partel->boxa = boxaCopy(boxas, L_CLONE);
- partelSetSize(partel, sortflag);
- lheapAdd(lh, partel);
-
- npush = 1;
- npop = 0;
- boxad = boxaCreate(0);
- while (1) {
- if ((partel = (PARTEL *)lheapRemove(lh)) == NULL) /* we're done */
- break;
-
- npop++; /* How many boxes have we retrieved from the queue? */
- if (npop > maxpops) {
- partelDestroy(&partel);
- break;
- }
-
- /* Extract the contents */
- boxa = boxaCopy(partel->boxa, L_CLONE);
- box = boxClone(partel->box);
- partelDestroy(&partel);
-
- /* Can we output this one? */
- n = boxaGetCount(boxa);
- if (n == 0) {
- if (boxCheckIfOverlapIsBig(box, boxad, maxoverlap) == 0)
- boxaAddBox(boxad, box, L_INSERT);
- else
- boxDestroy(&box);
- boxaDestroy(&boxa);
- if (boxaGetCount(boxad) >= maxboxes) /* we're done */
- break;
- continue;
- }
-
-
- /* Generate up to 4 subboxes and put them on the heap */
- boxa4 = boxaGenerateSubboxes(box, boxa, maxperim, fract);
- boxDestroy(&box);
- nsub = boxaGetCount(boxa4);
- for (i = 0; i < nsub; i++) {
- boxsub = boxaGetBox(boxa4, i, L_CLONE);
- boxasub = boxaIntersectsBox(boxa, boxsub);
- partel = partelCreate(boxsub);
- partel->boxa = boxasub;
- partelSetSize(partel, sortflag);
- lheapAdd(lh, partel);
- boxDestroy(&boxsub);
- }
- npush += nsub; /* How many boxes have we put on the queue? */
-
-/* boxaWriteStderr(boxa4); */
-
- boxaDestroy(&boxa4);
- boxaDestroy(&boxa);
- }
-
-#if OUTPUT_HEAP_STATS
- lept_stderr("Heap statistics:\n");
- lept_stderr(" Number of boxes pushed: %d\n", npush);
- lept_stderr(" Number of boxes popped: %d\n", npop);
- lept_stderr(" Number of boxes on heap: %d\n", lheapGetCount(lh));
-#endif /* OUTPUT_HEAP_STATS */
-
- /* Clean up the heap */
- while ((partel = (PARTEL *)lheapRemove(lh)) != NULL)
- partelDestroy(&partel);
- lheapDestroy(&lh, FALSE);
-
- return boxad;
-}
-
-
-/*------------------------------------------------------------------*
- * Helpers *
- *------------------------------------------------------------------*/
-/*!
- * \brief partelCreate()
- *
- * \param[in] box region; inserts a copy
- * \return partel, or NULL on error
- */
-static PARTEL *
-partelCreate(BOX *box)
-{
-PARTEL *partel;
-
- partel = (PARTEL *)LEPT_CALLOC(1, sizeof(PARTEL));
- partel->box = boxCopy(box);
- return partel;
-}
-
-
-/*!
- * \brief partelDestroy()
- *
- * \param[in,out] ppartel contents will be set to null before returning
- * \return void
- */
-static void
-partelDestroy(PARTEL **ppartel)
-{
-PARTEL *partel;
-
- PROCNAME("partelDestroy");
-
- if (ppartel == NULL) {
- L_WARNING("ptr address is null!\n", procName);
- return;
- }
-
- if ((partel = *ppartel) == NULL)
- return;
-
- boxDestroy(&partel->box);
- boxaDestroy(&partel->boxa);
- LEPT_FREE(partel);
- *ppartel = NULL;
- return;
-}
-
-
-/*!
- * \brief partelSetSize()
- *
- * \param[in] partel
- * \param[in] sortflag L_SORT_BY_WIDTH, L_SORT_BY_HEIGHT,
- * L_SORT_BY_MIN_DIMENSION, L_SORT_BY_MAX_DIMENSION,
- * L_SORT_BY_PERIMETER, L_SORT_BY_AREA
- * \return 0 if OK, 1 on error
- */
-static l_int32
-partelSetSize(PARTEL *partel,
- l_int32 sortflag)
-{
-l_int32 w, h;
-
- PROCNAME("partelSetSize");
-
- if (!partel)
- return ERROR_INT("partel not defined", procName, 1);
-
- boxGetGeometry(partel->box, NULL, NULL, &w, &h);
- if (sortflag == L_SORT_BY_WIDTH)
- partel->size = (l_float32)w;
- else if (sortflag == L_SORT_BY_HEIGHT)
- partel->size = (l_float32)h;
- else if (sortflag == L_SORT_BY_MIN_DIMENSION)
- partel->size = (l_float32)L_MIN(w, h);
- else if (sortflag == L_SORT_BY_MAX_DIMENSION)
- partel->size = (l_float32)L_MAX(w, h);
- else if (sortflag == L_SORT_BY_PERIMETER)
- partel->size = (l_float32)(w + h);
- else if (sortflag == L_SORT_BY_AREA)
- partel->size = (l_float32)(w * h);
- else
- return ERROR_INT("invalid sortflag", procName, 1);
- return 0;
-}
-
-
-/*!
- * \brief boxaGenerateSubboxes()
- *
- * \param[in] box region to be split into up to four overlapping
- * subregions
- * \param[in] boxa boxes of rectangles intersecting the box
- * \param[in] maxperim maximum half-perimeter for which pivot
- * is selected by proximity to box centroid
- * \param[in] fract fraction of box diagonal that is an acceptable
- * distance from the box centroid to select the pivot
- * \return boxa of four or less overlapping subrectangles of
- * the box, or NULL on error
- */
-static BOXA *
-boxaGenerateSubboxes(BOX *box,
- BOXA *boxa,
- l_int32 maxperim,
- l_float32 fract)
-{
-l_int32 x, y, w, h, xp, yp, wp, hp;
-BOX *boxp; /* pivot box */
-BOX *boxsub;
-BOXA *boxa4;
-
- PROCNAME("boxaGenerateSubboxes");
-
- if (!box)
- return (BOXA *)ERROR_PTR("box not defined", procName, NULL);
- if (!boxa)
- return (BOXA *)ERROR_PTR("boxa not defined", procName, NULL);
-
- boxa4 = boxaCreate(4);
- boxp = boxaSelectPivotBox(box, boxa, maxperim, fract);
- boxGetGeometry(box, &x, &y, &w, &h);
- boxGetGeometry(boxp, &xp, &yp, &wp, &hp);
- boxDestroy(&boxp);
- if (xp > x) { /* left sub-box */
- boxsub = boxCreate(x, y, xp - x, h);
- boxaAddBox(boxa4, boxsub, L_INSERT);
- }
- if (yp > y) { /* top sub-box */
- boxsub = boxCreate(x, y, w, yp - y);
- boxaAddBox(boxa4, boxsub, L_INSERT);
- }
- if (xp + wp < x + w) { /* right sub-box */
- boxsub = boxCreate(xp + wp, y, x + w - xp - wp, h);
- boxaAddBox(boxa4, boxsub, L_INSERT);
- }
- if (yp + hp < y + h) { /* bottom sub-box */
- boxsub = boxCreate(x, yp + hp, w, y + h - yp - hp);
- boxaAddBox(boxa4, boxsub, L_INSERT);
- }
-
- return boxa4;
-}
-
-
-/*!
- * \brief boxaSelectPivotBox()
- *
- * \param[in] box containing box; to be split by the pivot box
- * \param[in] boxa boxes of rectangles, from which 1 is to be chosen
- * \param[in] maxperim maximum half-perimeter for which pivot
- * is selected by proximity to box centroid
- * \param[in] fract fraction of box diagonal that is an acceptable
- * distance from the box centroid to select the pivot
- * \return box pivot box for subdivision into 4 rectangles,
- * or NULL on error
- *
- *
- * Notes:
- * (1) This is a tricky piece that wasn't discussed in the
- * Breuel's 2002 paper.
- * (2) Selects a box from boxa whose centroid is reasonably close to
- * the centroid of the containing box (xc, yc) and whose
- * half-perimeter does not exceed the maxperim value.
- * (3) If there are no boxes in the boxa that are small enough,
- * then it selects the smallest of the larger boxes,
- * without reference to its location in the containing box.
- * (4) If a small box has a centroid at a distance from the
- * centroid of the containing box that is not more than
- * the fraction 'fract' of the diagonal of the containing
- * box, that box is chosen as the pivot, terminating the
- * search for the nearest small box.
- * (5) Use fract in the range [0.0 ... 1.0]. Set fract = 0.0
- * to choose the small box nearest the centroid.
- * (6) Choose maxperim to represent a connected component that is
- * small enough so that you don't care about the white space
- * that could be inside of it.
- *
- */
-static BOX *
-boxaSelectPivotBox(BOX *box,
- BOXA *boxa,
- l_int32 maxperim,
- l_float32 fract)
-{
-l_int32 i, n, bw, bh, w, h;
-l_int32 smallfound, minindex, perim, minsize;
-l_float32 delx, dely, mindist, threshdist, dist, x, y, cx, cy;
-BOX *boxt;
-
- PROCNAME("boxaSelectPivotBox");
-
- if (!box)
- return (BOX *)ERROR_PTR("box not defined", procName, NULL);
- if (!boxa)
- return (BOX *)ERROR_PTR("boxa not defined", procName, NULL);
- n = boxaGetCount(boxa);
- if (n == 0)
- return (BOX *)ERROR_PTR("no boxes in boxa", procName, NULL);
- if (fract < 0.0 || fract > 1.0) {
- L_WARNING("fract out of bounds; using 0.0\n", procName);
- fract = 0.0;
- }
-
- boxGetGeometry(box, NULL, NULL, &w, &h);
- boxGetCenter(box, &x, &y);
- threshdist = fract * (w * w + h * h);
- mindist = 1000000000.;
- minindex = 0;
- smallfound = FALSE;
- for (i = 0; i < n; i++) {
- boxt = boxaGetBox(boxa, i, L_CLONE);
- boxGetGeometry(boxt, NULL, NULL, &bw, &bh);
- boxGetCenter(boxt, &cx, &cy);
- boxDestroy(&boxt);
- if (bw + bh > maxperim)
- continue;
- smallfound = TRUE;
- delx = cx - x;
- dely = cy - y;
- dist = delx * delx + dely * dely;
- if (dist <= threshdist)
- return boxaGetBox(boxa, i, L_COPY);
- if (dist < mindist) {
- minindex = i;
- mindist = dist;
- }
- }
-
- /* If there are small boxes but none are within 'fract' of the
- * centroid, return the nearest one. */
- if (smallfound == TRUE)
- return boxaGetBox(boxa, minindex, L_COPY);
-
- /* No small boxes; return the smallest of the large boxes */
- minsize = 1000000000;
- minindex = 0;
- for (i = 0; i < n; i++) {
- boxaGetBoxGeometry(boxa, i, NULL, NULL, &bw, &bh);
- perim = bw + bh;
- if (perim < minsize) {
- minsize = perim;
- minindex = i;
- }
- }
- return boxaGetBox(boxa, minindex, L_COPY);
-}
-
-
-/*!
- * \brief boxCheckIfOverlapIsBig()
- *
- * \param[in] box to be tested
- * \param[in] boxa of boxes already stored
- * \param[in] maxoverlap maximum fractional overlap of the input box
- * by any of the boxes in boxa
- * \return 0 if box has small overlap with every box in boxa;
- * 1 otherwise or on error
- */
-static l_int32
-boxCheckIfOverlapIsBig(BOX *box,
- BOXA *boxa,
- l_float32 maxoverlap)
-{
-l_int32 i, n, bigoverlap;
-l_float32 fract;
-BOX *boxt;
-
- PROCNAME("boxCheckIfOverlapIsBig");
-
- if (!box)
- return ERROR_INT("box not defined", procName, 1);
- if (!boxa)
- return ERROR_INT("boxa not defined", procName, 1);
- if (maxoverlap < 0.0 || maxoverlap > 1.0)
- return ERROR_INT("invalid maxoverlap", procName, 1);
-
- n = boxaGetCount(boxa);
- if (n == 0 || maxoverlap == 1.0)
- return 0;
-
- bigoverlap = 0;
- for (i = 0; i < n; i++) {
- boxt = boxaGetBox(boxa, i, L_CLONE);
- boxOverlapFraction(boxt, box, &fract);
- boxDestroy(&boxt);
- if (fract > maxoverlap) {
- bigoverlap = 1;
- break;
- }
- }
-
- return bigoverlap;
-}
-
-
-/*!
- * \brief boxaPruneSortedOnOverlap()
- *
- * \param[in] boxas sorted by size in decreasing order
- * \param[in] maxoverlap maximum fractional overlap of a box by any
- * of the larger boxes
- * \return boxad pruned, or NULL on error
- *
- *
- * Notes:
- * (1) This selectively removes smaller boxes when they are overlapped
- * by any larger box by more than the input 'maxoverlap' fraction.
- * (2) To avoid all pruning, use maxoverlap = 1.0. To select only
- * boxes that have no overlap with each other (maximal pruning),
- * set maxoverlap = 0.0.
- * (3) If there are no boxes in boxas, returns an empty boxa.
- *
- */
-BOXA *
-boxaPruneSortedOnOverlap(BOXA *boxas,
- l_float32 maxoverlap)
-{
-l_int32 i, j, n, remove;
-l_float32 fract;
-BOX *box1, *box2;
-BOXA *boxad;
-
- PROCNAME("boxaPruneSortedOnOverlap");
-
- if (!boxas)
- return (BOXA *)ERROR_PTR("boxas not defined", procName, NULL);
- if (maxoverlap < 0.0 || maxoverlap > 1.0)
- return (BOXA *)ERROR_PTR("invalid maxoverlap", procName, NULL);
-
- n = boxaGetCount(boxas);
- if (n == 0 || maxoverlap == 1.0)
- return boxaCopy(boxas, L_COPY);
-
- boxad = boxaCreate(0);
- box2 = boxaGetBox(boxas, 0, L_COPY);
- boxaAddBox(boxad, box2, L_INSERT);
- for (j = 1; j < n; j++) { /* prune on j */
- box2 = boxaGetBox(boxas, j, L_COPY);
- remove = FALSE;
- for (i = 0; i < j; i++) { /* test on i */
- box1 = boxaGetBox(boxas, i, L_CLONE);
- boxOverlapFraction(box1, box2, &fract);
- boxDestroy(&box1);
- if (fract > maxoverlap) {
- remove = TRUE;
- break;
- }
- }
- if (remove == TRUE)
- boxDestroy(&box2);
- else
- boxaAddBox(boxad, box2, L_INSERT);
- }
-
- return boxad;
-}
diff --git a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pdfio1.c b/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pdfio1.c
deleted file mode 100644
index c95f2a38..00000000
--- a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pdfio1.c
+++ /dev/null
@@ -1,2255 +0,0 @@
-/*====================================================================*
- - Copyright (C) 2001 Leptonica. All rights reserved.
- -
- - Redistribution and use in source and binary forms, with or without
- - modification, are permitted provided that the following conditions
- - are met:
- - 1. Redistributions of source code must retain the above copyright
- - notice, this list of conditions and the following disclaimer.
- - 2. Redistributions in binary form must reproduce the above
- - copyright notice, this list of conditions and the following
- - disclaimer in the documentation and/or other materials
- - provided with the distribution.
- -
- - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- - ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- - LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- - A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL ANY
- - CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
- - EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
- - PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
- - PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
- - OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
- - NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- *====================================================================*/
-
-/*!
- * \file pdfio1.c
- *
- *
- * Higher-level operations for generating pdf from images.
- * Use poppler's pdfimages to invert the process, extracting
- * raster images from pdf.
- *
- * |=============================================================|
- * | Important notes |
- * |=============================================================|
- * | Some of these functions require I/O libraries such as |
- * | libtiff, libjpeg, libpng, libz and libopenjp2. If you do |
- * | not have these libraries, some calls will fail. For |
- * | example, if you do not have libopenjp2, you cannot write a |
- * | pdf where transcoding is required to incorporate a |
- * | jp2k image. |
- * | |
- * | You can manually deactivate all pdf writing by setting |
- * | this in environ.h: |
- * | \code |
- * | #define USE_PDFIO 0 |
- * | \endcode |
- * | This will link the stub file pdfiostub.c. |
- * |=============================================================|
- *
- * Set 1. These functions convert a set of image files
- * to a multi-page pdf file, with one image on each page.
- * All images are rendered at the same (input) resolution.
- * The images can be specified as being in a directory, or they
- * can be in an sarray. The output pdf can be either a file
- * or an array of bytes in memory.
- *
- * Set 2. These functions are a special case of set 1, where
- * no scaling or change in quality is required. For jpeg and jp2k
- * images, the bytes in each file can be directly incorporated
- * into the output pdf, and the wrapping up of multiple image
- * files is very fast. For non-interlaced png, the data bytes
- * including the predictors can also be written directly into the
- * flate pdf data. For other image formats (e.g., tiff-g4),
- * transcoding is required, where the image data is first decompressed
- * and then the G4 or Flate (gzip) encodings are generated.
- *
- * Set 3. These functions convert a set of images in memory
- * to a multi-page pdf, with one image on each page. The pdf
- * output can be either a file or an array of bytes in memory.
- *
- * Set 4. These functions implement a pdf output "device driver"
- * for wrapping (encoding) any number of images on a single page
- * in pdf. The input can be either an image file or a Pix;
- * the pdf output can be either a file or an array of bytes in memory.
- *
- * Set 5. These "segmented" functions take a set of image
- * files, along with optional segmentation information, and
- * generate a multi-page pdf file, where each page consists
- * in general of a mixed raster pdf of image and non-image regions.
- * The segmentation information for each page can be input as
- * either a mask over the image parts, or as a Boxa of those
- * regions.
- *
- * Set 6. These "segmented" functions convert an image and
- * an optional Boxa of image regions into a mixed raster pdf file
- * for the page. The input image can be either a file or a Pix.
- *
- * Set 7. These functions take a set of single-page pdf files
- * and concatenates it into a multi-page pdf. The input can be
- * a set of either single page pdf files or pdf 'strings' in memory.
- * The output can be either a file or an array of bytes in memory.
- *
- * The images in the pdf file can be rendered using a pdf viewer,
- * such as evince, gv, xpdf or acroread.
- *
- * Reference on the pdf file format:
- * http://www.adobe.com/devnet/pdf/pdf_reference_archive.html
- *
- * 1. Convert specified image files to pdf (one image file per page)
- * l_int32 convertFilesToPdf()
- * l_int32 saConvertFilesToPdf()
- * l_int32 saConvertFilesToPdfData()
- * l_int32 selectDefaultPdfEncoding()
- *
- * 2. Convert specified image files to pdf without scaling
- * l_int32 convertUnscaledFilesToPdf()
- * l_int32 saConvertUnscaledFilesToPdf()
- * l_int32 saConvertUnscaledFilesToPdfData()
- * l_int32 convertUnscaledToPdfData()
- *
- * 3. Convert multiple images to pdf (one image per page)
- * l_int32 pixaConvertToPdf()
- * l_int32 pixaConvertToPdfData()
- *
- * 4. Single page, multi-image converters
- * l_int32 convertToPdf()
- * l_int32 convertImageDataToPdf()
- * l_int32 convertToPdfData()
- * l_int32 convertImageDataToPdfData()
- * l_int32 pixConvertToPdf()
- * l_int32 pixWriteStreamPdf()
- * l_int32 pixWriteMemPdf()
- *
- * 5. Segmented multi-page, multi-image converter
- * l_int32 convertSegmentedFilesToPdf()
- * BOXAA *convertNumberedMasksToBoxaa()
- *
- * 6. Segmented single page, multi-image converters
- * l_int32 convertToPdfSegmented()
- * l_int32 pixConvertToPdfSegmented()
- * l_int32 convertToPdfDataSegmented()
- * l_int32 pixConvertToPdfDataSegmented()
- *
- * 7. Multipage concatenation
- * l_int32 concatenatePdf()
- * l_int32 saConcatenatePdf()
- * l_int32 ptraConcatenatePdf()
- * l_int32 concatenatePdfToData()
- * l_int32 saConcatenatePdfToData()
- *
- * The top-level multi-image functions can be visualized as follows:
- * Output pdf data to file:
- * convertToPdf() and convertImageDataToPdf()
- * --> pixConvertToPdf()
- * --> pixConvertToPdfData()
- *
- * Output pdf data to array in memory:
- * convertToPdfData() and convertImageDataToPdfData()
- * --> pixConvertToPdfData()
- *
- * The top-level segmented image functions can be visualized as follows:
- * Output pdf data to file:
- * convertToPdfSegmented()
- * --> pixConvertToPdfSegmented()
- * --> pixConvertToPdfDataSegmented()
- *
- * Output pdf data to array in memory:
- * convertToPdfDataSegmented()
- * --> pixConvertToPdfDataSegmented()
- *
- * For multi-page concatenation, there are three different types of input
- * (1) directory and optional filename filter
- * (2) sarray of filenames
- * (3) ptra of byte arrays of pdf data
- * and two types of output for the concatenated pdf data
- * (1) filename
- * (2) data array and size
- * High-level interfaces are given for each of the six combinations.
- *
- * Note: When wrapping small images into pdf, it is useful to give
- * them a relatively low resolution value, to avoid rounding errors
- * when rendering the images. For example, if you want an image
- * of width w pixels to be 5 inches wide on a screen, choose a
- * resolution w/5.
- *
- * The very fast functions in section (2) require neither transcoding
- * nor parsing of the compressed jpeg file. With three types of image
- * compression, the compressed strings can be incorporated into
- * the pdf data without decompression and re-encoding: jpeg, jp2k
- * and png. The DCTDecode and JPXDecode filters can handle the
- * entire jpeg and jp2k encoded string as a byte array in the pdf file.
- * The FlateDecode filter can handle the png compressed image data,
- * including predictors that occur as the first byte in each
- * raster line, but it is necessary to store only the png IDAT chunk
- * data in the pdf array. The alternative for wrapping png images
- * is to transcode them: uncompress into a raster (a pix) and then
- * gzip the raster data. This typically results in a larger pdf file
- * because it doesn't use the two-dimensional png predictor.
- * Colormaps, which are found in png PLTE chunks, must always be
- * pulled out and included separately in the pdf. For CCITT-G4
- * compression, you can not simply include a tiff G4 file -- you must
- * either parse it and extract the G4 compressed data within it,
- * or uncompress to a raster and G4 compress again.
- *
- */
-
-#ifdef HAVE_CONFIG_H
-#include
-#endif /* HAVE_CONFIG_H */
-
-#include
-#include
-#include "allheaders.h"
-
-/* --------------------------------------------*/
-#if USE_PDFIO /* defined in environ.h */
- /* --------------------------------------------*/
-
- /* Typical scan resolution in ppi (pixels/inch) */
-static const l_int32 DefaultInputRes = 300;
-
-/*---------------------------------------------------------------------*
- * Convert specified image files to pdf (one image file per page) *
- *---------------------------------------------------------------------*/
-/*!
- * \brief convertFilesToPdf()
- *
- * \param[in] dirname directory name containing images
- * \param[in] substr [optional] substring filter on filenames;
- * can be NULL
- * \param[in] res input resolution of all images
- * \param[in] scalefactor scaling factor applied to each image; > 0.0
- * \param[in] type encoding type (L_JPEG_ENCODE, L_G4_ENCODE,
- * L_FLATE_ENCODE, L_JP2K_ENCODE or
- * L_DEFAULT_ENCODE for default)
- * \param[in] quality for jpeg: 1-100; 0 for default (75)
- * for jp2k: 27-45; 0 for default (34)
- * \param[in] title [optional] pdf title; if null, taken from
- * the first image filename
- * \param[in] fileout pdf file of all images
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) If %substr is not NULL, only image filenames that contain
- * the substring can be used. If %substr == NULL, all files
- * in the directory are used.
- * (2) The files in the directory, after optional filtering by
- * the substring, are lexically sorted in increasing order
- * before concatenation.
- * (3) The scalefactor is applied to each image before encoding.
- * If you enter a value <= 0.0, it will be set to 1.0.
- * (4) Specifying one of the four encoding types for %type forces
- * all images to be compressed with that type. Use 0 to have
- * the type determined for each image based on depth and whether
- * or not it has a colormap.
- *
- */
-l_ok
-convertFilesToPdf(const char *dirname,
- const char *substr,
- l_int32 res,
- l_float32 scalefactor,
- l_int32 type,
- l_int32 quality,
- const char *title,
- const char *fileout)
-{
-l_int32 ret;
-SARRAY *sa;
-
- PROCNAME("convertFilesToPdf");
-
- if (!dirname)
- return ERROR_INT("dirname not defined", procName, 1);
- if (!fileout)
- return ERROR_INT("fileout not defined", procName, 1);
-
- if ((sa = getSortedPathnamesInDirectory(dirname, substr, 0, 0)) == NULL)
- return ERROR_INT("sa not made", procName, 1);
- ret = saConvertFilesToPdf(sa, res, scalefactor, type, quality,
- title, fileout);
- sarrayDestroy(&sa);
- return ret;
-}
-
-
-/*!
- * \brief saConvertFilesToPdf()
- *
- * \param[in] sa string array of pathnames for images
- * \param[in] res input resolution of all images
- * \param[in] scalefactor scaling factor applied to each image; > 0.0
- * \param[in] type encoding type (L_JPEG_ENCODE, L_G4_ENCODE,
- * L_FLATE_ENCODE, L_JP2K_ENCODE or
- * L_DEFAULT_ENCODE for default)
- * \param[in] quality for jpeg: 1-100; 0 for default (75)
- * for jp2k: 27-45; 0 for default (34)
- * \param[in] title [optional] pdf title; if null, taken from
- * the first image filename
- * \param[in] fileout pdf file of all images
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) See convertFilesToPdf().
- *
- */
-l_ok
-saConvertFilesToPdf(SARRAY *sa,
- l_int32 res,
- l_float32 scalefactor,
- l_int32 type,
- l_int32 quality,
- const char *title,
- const char *fileout)
-{
-l_uint8 *data;
-l_int32 ret;
-size_t nbytes;
-
- PROCNAME("saConvertFilesToPdf");
-
- if (!sa)
- return ERROR_INT("sa not defined", procName, 1);
-
- ret = saConvertFilesToPdfData(sa, res, scalefactor, type, quality,
- title, &data, &nbytes);
- if (ret) {
- if (data) LEPT_FREE(data);
- return ERROR_INT("pdf data not made", procName, 1);
- }
-
- ret = l_binaryWrite(fileout, "w", data, nbytes);
- LEPT_FREE(data);
- if (ret)
- L_ERROR("pdf data not written to file\n", procName);
- return ret;
-}
-
-
-/*!
- * \brief saConvertFilesToPdfData()
- *
- * \param[in] sa string array of pathnames for images
- * \param[in] res input resolution of all images
- * \param[in] scalefactor scaling factor applied to each image; > 0.0
- * \param[in] type encoding type (L_JPEG_ENCODE, L_G4_ENCODE,
- * L_FLATE_ENCODE, L_JP2K_ENCODE or
- * L_DEFAULT_ENCODE for default)
- * \param[in] quality for jpeg: 1-100; 0 for default (75)
- * for jp2k: 27-45; 0 for default (34)
- * \param[in] title [optional] pdf title; if null, taken from
- * the first image filename
- * \param[out] pdata output pdf data (of all images
- * \param[out] pnbytes size of output pdf data
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) See convertFilesToPdf().
- *
- */
-l_ok
-saConvertFilesToPdfData(SARRAY *sa,
- l_int32 res,
- l_float32 scalefactor,
- l_int32 type,
- l_int32 quality,
- const char *title,
- l_uint8 **pdata,
- size_t *pnbytes)
-{
-char *fname;
-const char *pdftitle;
-l_uint8 *imdata;
-l_int32 i, n, ret, pagetype, npages, scaledres;
-size_t imbytes;
-L_BYTEA *ba;
-PIX *pixs, *pix;
-L_PTRA *pa_data;
-
- PROCNAME("saConvertFilesToPdfData");
-
- if (!pdata)
- return ERROR_INT("&data not defined", procName, 1);
- *pdata = NULL;
- if (!pnbytes)
- return ERROR_INT("&nbytes not defined", procName, 1);
- *pnbytes = 0;
- if (!sa)
- return ERROR_INT("sa not defined", procName, 1);
- if (scalefactor <= 0.0) scalefactor = 1.0;
- if (type != L_JPEG_ENCODE && type != L_G4_ENCODE &&
- type != L_FLATE_ENCODE && type != L_JP2K_ENCODE) {
- type = L_DEFAULT_ENCODE;
- }
-
- /* Generate all the encoded pdf strings */
- n = sarrayGetCount(sa);
- pa_data = ptraCreate(n);
- pdftitle = NULL;
- for (i = 0; i < n; i++) {
- if (i && (i % 10 == 0)) lept_stderr(".. %d ", i);
- fname = sarrayGetString(sa, i, L_NOCOPY);
- if ((pixs = pixRead(fname)) == NULL) {
- L_ERROR("image not readable from file %s\n", procName, fname);
- continue;
- }
- if (!pdftitle)
- pdftitle = (title) ? title : fname;
- if (scalefactor != 1.0)
- pix = pixScale(pixs, scalefactor, scalefactor);
- else
- pix = pixClone(pixs);
- pixDestroy(&pixs);
- scaledres = (l_int32)(res * scalefactor);
-
- /* Select the encoding type */
- if (type != L_DEFAULT_ENCODE) {
- pagetype = type;
- } else if (selectDefaultPdfEncoding(pix, &pagetype) != 0) {
- pixDestroy(&pix);
- L_ERROR("encoding type selection failed for file %s\n",
- procName, fname);
- continue;
- }
-
- ret = pixConvertToPdfData(pix, pagetype, quality, &imdata, &imbytes,
- 0, 0, scaledres, pdftitle, NULL, 0);
- pixDestroy(&pix);
- if (ret) {
- LEPT_FREE(imdata);
- L_ERROR("pdf encoding failed for %s\n", procName, fname);
- continue;
- }
- ba = l_byteaInitFromMem(imdata, imbytes);
- LEPT_FREE(imdata);
- ptraAdd(pa_data, ba);
- }
- ptraGetActualCount(pa_data, &npages);
- if (npages == 0) {
- L_ERROR("no pdf files made\n", procName);
- ptraDestroy(&pa_data, FALSE, FALSE);
- return 1;
- }
-
- /* Concatenate them */
- lept_stderr("\nconcatenating ... ");
- ret = ptraConcatenatePdfToData(pa_data, NULL, pdata, pnbytes);
- lept_stderr("done\n");
-
- ptraGetActualCount(pa_data, &npages); /* recalculate in case it changes */
- for (i = 0; i < npages; i++) {
- ba = (L_BYTEA *)ptraRemove(pa_data, i, L_NO_COMPACTION);
- l_byteaDestroy(&ba);
- }
- ptraDestroy(&pa_data, FALSE, FALSE);
- return ret;
-}
-
-
-/*!
- * \brief selectDefaultPdfEncoding()
- *
- * \param[in] pix
- * \param[out] ptype L_G4_ENCODE, L_JPEG_ENCODE, L_FLATE_ENCODE
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This attempts to choose an encoding for the pix that results
- * in the smallest file, assuming that if jpeg encoded, it will
- * use quality = 75. The decision is approximate, in that
- * (a) all colormapped images will be losslessly encoded with
- * gzip (flate), and (b) an image with less than about 20 colors
- * is likely to be smaller if flate encoded than if encoded
- * as a jpeg (dct). For example, an image made by pixScaleToGray3()
- * will have 10 colors, and flate encoding will give about
- * twice the compression as jpeg with quality = 75.
- *
- */
-l_ok
-selectDefaultPdfEncoding(PIX *pix,
- l_int32 *ptype)
-{
-l_int32 w, h, d, factor, ncolors;
-PIXCMAP *cmap;
-
- PROCNAME("selectDefaultPdfEncoding");
-
- if (!ptype)
- return ERROR_INT("&type not defined", procName, 1);
- *ptype = L_FLATE_ENCODE; /* default universal encoding */
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
- pixGetDimensions(pix, &w, &h, &d);
- cmap = pixGetColormap(pix);
- if (d == 8 && !cmap) {
- factor = L_MAX(1, (l_int32)sqrt((l_float64)(w * h) / 20000.));
- pixNumColors(pix, factor, &ncolors);
- if (ncolors < 20)
- *ptype = L_FLATE_ENCODE;
- else
- *ptype = L_JPEG_ENCODE;
- } else if (d == 1) {
- *ptype = L_G4_ENCODE;
- } else if (cmap || d == 2 || d == 4) {
- *ptype = L_FLATE_ENCODE;
- } else if (d == 8 || d == 32) {
- *ptype = L_JPEG_ENCODE;
- } else {
- return ERROR_INT("type selection failure", procName, 1);
- }
-
- return 0;
-}
-
-
-/*---------------------------------------------------------------------*
- * Convert specified image files to pdf without scaling *
- *---------------------------------------------------------------------*/
-/*!
- * \brief convertUnscaledFilesToPdf()
- *
- * \param[in] dirname directory name containing images
- * \param[in] substr [optional] substring filter on filenames; can be NULL
- * \param[in] title [optional] pdf title; if null, taken from the first
- * image filename
- * \param[in] fileout pdf file of all images
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) If %substr is not NULL, only image filenames that contain
- * the substring can be used. If %substr == NULL, all files
- * in the directory are used.
- * (2) The files in the directory, after optional filtering by
- * the substring, are lexically sorted in increasing order
- * before concatenation.
- * (3) This is very fast for jpeg, jp2k and some png files, because
- * the compressed data is wrapped up and concatenated. For tiffg4
- * and other types of png, the images must be read and recompressed.
- *
- */
-l_ok
-convertUnscaledFilesToPdf(const char *dirname,
- const char *substr,
- const char *title,
- const char *fileout)
-{
-l_int32 ret;
-SARRAY *sa;
-
- PROCNAME("convertUnscaledFilesToPdf");
-
- if (!dirname)
- return ERROR_INT("dirname not defined", procName, 1);
- if (!fileout)
- return ERROR_INT("fileout not defined", procName, 1);
-
- if ((sa = getSortedPathnamesInDirectory(dirname, substr, 0, 0)) == NULL)
- return ERROR_INT("sa not made", procName, 1);
- ret = saConvertUnscaledFilesToPdf(sa, title, fileout);
- sarrayDestroy(&sa);
- return ret;
-}
-
-
-/*!
- * \brief saConvertUnscaledFilesToPdf()
- *
- * \param[in] sa string array of pathnames for images
- * \param[in] title [optional] pdf title; if null, taken from the first
- * image filename
- * \param[in] fileout pdf file of all images
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) See convertUnscaledFilesToPdf().
- *
- */
-l_ok
-saConvertUnscaledFilesToPdf(SARRAY *sa,
- const char *title,
- const char *fileout)
-{
-l_uint8 *data;
-l_int32 ret;
-size_t nbytes;
-
- PROCNAME("saConvertUnscaledFilesToPdf");
-
- if (!sa)
- return ERROR_INT("sa not defined", procName, 1);
-
- ret = saConvertUnscaledFilesToPdfData(sa, title, &data, &nbytes);
- if (ret) {
- if (data) LEPT_FREE(data);
- return ERROR_INT("pdf data not made", procName, 1);
- }
-
- ret = l_binaryWrite(fileout, "w", data, nbytes);
- LEPT_FREE(data);
- if (ret)
- L_ERROR("pdf data not written to file\n", procName);
- return ret;
-}
-
-
-/*!
- * \brief saConvertUnscaledFilesToPdfData()
- *
- * \param[in] sa string array of pathnames for image files
- * \param[in] title [optional] pdf title; if null, taken from the first
- * image filename
- * \param[out] pdata output pdf data (of all images)
- * \param[out] pnbytes size of output pdf data
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This is very fast for jpeg, jp2k and some png files, because
- * the compressed data is wrapped up and concatenated. For tiffg4
- * and other types of png, the images must be read and recompressed.
- *
- */
-l_ok
-saConvertUnscaledFilesToPdfData(SARRAY *sa,
- const char *title,
- l_uint8 **pdata,
- size_t *pnbytes)
-{
-char *fname;
-l_uint8 *imdata;
-l_int32 i, n, ret, npages;
-size_t imbytes;
-L_BYTEA *ba;
-L_PTRA *pa_data;
-
- PROCNAME("saConvertUnscaledFilesToPdfData");
-
- if (!pdata)
- return ERROR_INT("&data not defined", procName, 1);
- *pdata = NULL;
- if (!pnbytes)
- return ERROR_INT("&nbytes not defined", procName, 1);
- *pnbytes = 0;
- if (!sa)
- return ERROR_INT("sa not defined", procName, 1);
-
- /* Generate all the encoded pdf strings */
- n = sarrayGetCount(sa);
- pa_data = ptraCreate(n);
- for (i = 0; i < n; i++) {
- if (i && (i % 10 == 0)) lept_stderr(".. %d ", i);
- fname = sarrayGetString(sa, i, L_NOCOPY);
-
- /* Generate the pdf data */
- if (convertUnscaledToPdfData(fname, title, &imdata, &imbytes))
- continue;
-
- /* ... and add it to the array of single page data */
- ba = l_byteaInitFromMem(imdata, imbytes);
- if (imdata) LEPT_FREE(imdata);
- ptraAdd(pa_data, ba);
- }
- ptraGetActualCount(pa_data, &npages);
- if (npages == 0) {
- L_ERROR("no pdf files made\n", procName);
- ptraDestroy(&pa_data, FALSE, FALSE);
- return 1;
- }
-
- /* Concatenate to generate a multipage pdf */
- lept_stderr("\nconcatenating ... ");
- ret = ptraConcatenatePdfToData(pa_data, NULL, pdata, pnbytes);
- lept_stderr("done\n");
-
- /* Clean up */
- ptraGetActualCount(pa_data, &npages); /* maybe failed to read some files */
- for (i = 0; i < npages; i++) {
- ba = (L_BYTEA *)ptraRemove(pa_data, i, L_NO_COMPACTION);
- l_byteaDestroy(&ba);
- }
- ptraDestroy(&pa_data, FALSE, FALSE);
- return ret;
-}
-
-
-/*!
- * \brief convertUnscaledToPdfData()
- *
- * \param[in] fname of image file in all formats
- * \param[in] title [optional] pdf title; can be NULL
- * \param[out] pdata output pdf data for image
- * \param[out] pnbytes size of output pdf data
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This is very fast for jpeg, jp2k and some png files, because
- * the compressed data is wrapped up and concatenated. For tiffg4
- * and other types of png, the images must be read and recompressed.
- *
- */
-l_ok
-convertUnscaledToPdfData(const char *fname,
- const char *title,
- l_uint8 **pdata,
- size_t *pnbytes)
-{
-const char *pdftitle = NULL;
-char *tail = NULL;
-l_int32 format;
-L_COMP_DATA *cid;
-
- PROCNAME("convertUnscaledToPdfData");
-
- if (!pdata)
- return ERROR_INT("&data not defined", procName, 1);
- *pdata = NULL;
- if (!pnbytes)
- return ERROR_INT("&nbytes not defined", procName, 1);
- *pnbytes = 0;
- if (!fname)
- return ERROR_INT("fname not defined", procName, 1);
-
- findFileFormat(fname, &format);
- if (format == IFF_UNKNOWN) {
- L_WARNING("file %s format is unknown; skip\n", procName, fname);
- return 1;
- }
- if (format == IFF_PS || format == IFF_LPDF) {
- L_WARNING("file %s format is %d; skip\n", procName, fname, format);
- return 1;
- }
-
- /* Generate the image data required for pdf generation, always
- * in binary (not ascii85) coding. Note that jpeg, jp2k and
- * some png files are not transcoded. */
- l_generateCIDataForPdf(fname, NULL, 0, &cid);
- if (!cid) {
- L_ERROR("file %s format is %d; unreadable\n", procName, fname, format);
- return 1;
- }
-
- /* If %title == NULL, use the tail of %fname. */
- if (title) {
- pdftitle = title;
- } else {
- splitPathAtDirectory(fname, NULL, &tail);
- pdftitle = tail;
- }
-
- /* Generate the pdf string for this page (image). This destroys
- * the cid by attaching it to an lpd and destroying the lpd. */
- cidConvertToPdfData(cid, pdftitle, pdata, pnbytes);
- LEPT_FREE(tail);
- return 0;
-}
-
-
-/*---------------------------------------------------------------------*
- * Convert multiple images to pdf (one image per page) *
- *---------------------------------------------------------------------*/
-/*!
- * \brief pixaConvertToPdf()
- *
- * \param[in] pixa containing images all at the same resolution
- * \param[in] res override the resolution of each input image,
- * in ppi; use 0 to respect the resolution
- * embedded in the input images
- * \param[in] scalefactor scaling factor applied to each image; > 0.0
- * \param[in] type encoding type (L_JPEG_ENCODE, L_G4_ENCODE,
- * L_FLATE_ENCODE, L_JP2K_ENCODE, or
- * L_DEFAULT_ENCODE for default)
- * \param[in] quality for jpeg: 1-100; 0 for default (75)
- * for jp2k: 27-45; 0 for default (34)
- * \param[in] title [optional] pdf title
- * \param[in] fileout pdf file of all images
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) The images are encoded with G4 if 1 bpp; JPEG if 8 bpp without
- * colormap and many colors, or 32 bpp; FLATE for anything else.
- * (2) The scalefactor must be > 0.0; otherwise it is set to 1.0.
- * (3) Specifying one of the three encoding types for %type forces
- * all images to be compressed with that type. Use 0 to have
- * the type determined for each image based on depth and whether
- * or not it has a colormap.
- *
- */
-l_ok
-pixaConvertToPdf(PIXA *pixa,
- l_int32 res,
- l_float32 scalefactor,
- l_int32 type,
- l_int32 quality,
- const char *title,
- const char *fileout)
-{
-l_uint8 *data;
-l_int32 ret;
-size_t nbytes;
-
- PROCNAME("pixaConvertToPdf");
-
- if (!pixa)
- return ERROR_INT("pixa not defined", procName, 1);
-
- ret = pixaConvertToPdfData(pixa, res, scalefactor, type, quality,
- title, &data, &nbytes);
- if (ret) {
- LEPT_FREE(data);
- return ERROR_INT("conversion to pdf failed", procName, 1);
- }
-
- ret = l_binaryWrite(fileout, "w", data, nbytes);
- LEPT_FREE(data);
- if (ret)
- L_ERROR("pdf data not written to file\n", procName);
- return ret;
-}
-
-
-/*!
- * \brief pixaConvertToPdfData()
- *
- * \param[in] pixa containing images all at the same resolution
- * \param[in] res input resolution of all images
- * \param[in] scalefactor scaling factor applied to each image; > 0.0
- * \param[in] type encoding type (L_JPEG_ENCODE, L_G4_ENCODE,
- * L_FLATE_ENCODE, L_JP2K_ENCODE, or
- * L_DEFAULT_ENCODE for default)
- * \param[in] quality for jpeg: 1-100; 0 for default (75)
- * for jp2k: 27-45; 0 for default (34)
- * \param[in] title [optional] pdf title
- * \param[out] pdata output pdf data of all images
- * \param[out] pnbytes size of output pdf data
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) See pixaConvertToPdf().
- *
- */
-l_ok
-pixaConvertToPdfData(PIXA *pixa,
- l_int32 res,
- l_float32 scalefactor,
- l_int32 type,
- l_int32 quality,
- const char *title,
- l_uint8 **pdata,
- size_t *pnbytes)
-{
-l_uint8 *imdata;
-l_int32 i, n, ret, scaledres, pagetype;
-size_t imbytes;
-L_BYTEA *ba;
-PIX *pixs, *pix;
-L_PTRA *pa_data;
-
- PROCNAME("pixaConvertToPdfData");
-
- if (!pdata)
- return ERROR_INT("&data not defined", procName, 1);
- *pdata = NULL;
- if (!pnbytes)
- return ERROR_INT("&nbytes not defined", procName, 1);
- *pnbytes = 0;
- if (!pixa)
- return ERROR_INT("pixa not defined", procName, 1);
- if (scalefactor <= 0.0) scalefactor = 1.0;
- if (type != L_DEFAULT_ENCODE && type != L_JPEG_ENCODE &&
- type != L_G4_ENCODE && type != L_FLATE_ENCODE &&
- type != L_JP2K_ENCODE) {
- L_WARNING("invalid compression type; using per-page default\n",
- procName);
- type = L_DEFAULT_ENCODE;
- }
-
- /* Generate all the encoded pdf strings */
- n = pixaGetCount(pixa);
- pa_data = ptraCreate(n);
- for (i = 0; i < n; i++) {
- if ((pixs = pixaGetPix(pixa, i, L_CLONE)) == NULL) {
- L_ERROR("pix[%d] not retrieved\n", procName, i);
- continue;
- }
- if (scalefactor != 1.0)
- pix = pixScale(pixs, scalefactor, scalefactor);
- else
- pix = pixClone(pixs);
- pixDestroy(&pixs);
- scaledres = (l_int32)(res * scalefactor);
-
- /* Select the encoding type */
- if (type != L_DEFAULT_ENCODE) {
- pagetype = type;
- } else if (selectDefaultPdfEncoding(pix, &pagetype) != 0) {
- L_ERROR("encoding type selection failed for pix[%d]\n",
- procName, i);
- pixDestroy(&pix);
- continue;
- }
-
- ret = pixConvertToPdfData(pix, pagetype, quality, &imdata, &imbytes,
- 0, 0, scaledres, title, NULL, 0);
- pixDestroy(&pix);
- if (ret) {
- LEPT_FREE(imdata);
- L_ERROR("pdf encoding failed for pix[%d]\n", procName, i);
- continue;
- }
- ba = l_byteaInitFromMem(imdata, imbytes);
- LEPT_FREE(imdata);
- ptraAdd(pa_data, ba);
- }
- ptraGetActualCount(pa_data, &n);
- if (n == 0) {
- L_ERROR("no pdf files made\n", procName);
- ptraDestroy(&pa_data, FALSE, FALSE);
- return 1;
- }
-
- /* Concatenate them */
- ret = ptraConcatenatePdfToData(pa_data, NULL, pdata, pnbytes);
-
- ptraGetActualCount(pa_data, &n); /* recalculate in case it changes */
- for (i = 0; i < n; i++) {
- ba = (L_BYTEA *)ptraRemove(pa_data, i, L_NO_COMPACTION);
- l_byteaDestroy(&ba);
- }
- ptraDestroy(&pa_data, FALSE, FALSE);
- return ret;
-}
-
-
-/*---------------------------------------------------------------------*
- * Single page, multi-image converters *
- *---------------------------------------------------------------------*/
-/*!
- * \brief convertToPdf()
- *
- * \param[in] filein input image file -- any format
- * \param[in] type encoding type (L_JPEG_ENCODE, L_G4_ENCODE,
- * L_FLATE_ENCODE, or L_JP2K_ENCODE)
- * \param[in] quality for jpeg: 1-100; 0 for default (75)
- * for jp2k: 27-45; 0 for default (34)
- * \param[in] fileout output pdf file; only required on last
- * image on page
- * \param[in] x, y location of lower-left corner of image,
- * in pixels, relative to the PostScript origin
- * (0,0) at the lower-left corner of the page
- * \param[in] res override the resolution of the input image,
- * in ppi; use 0 to respect the resolution
- * embedded in the input images
- * \param[in] title [optional] pdf title; if null, taken from filein
- * \param[in,out] plpd ptr to lpd, which is created on the first
- * invocation and returned until last image is
- * processed, at which time it is destroyed
- * \param[in] position in image sequence: L_FIRST_IMAGE, L_NEXT_IMAGE,
- * L_LAST_IMAGE
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) To wrap only one image in pdf, input %plpd = NULL, and
- * the value of %position will be ignored:
- * convertToPdf(... type, quality, x, y, res, NULL, 0);
- * (2) To wrap multiple images on a single pdf page, this is called
- * once for each successive image. Do it this way:
- * L_PDF_DATA *lpd;
- * convertToPdf(... type, quality, x, y, res, &lpd, L_FIRST_IMAGE);
- * convertToPdf(... type, quality, x, y, res, &lpd, L_NEXT_IMAGE);
- * ...
- * convertToPdf(... type, quality, x, y, res, &lpd, L_LAST_IMAGE);
- * This will write the result to the value of %fileout specified
- * in the first call; succeeding values of %fileout are ignored.
- * On the last call: the pdf data bytes are computed and written
- * to %fileout, lpd is destroyed internally, and the returned
- * value of lpd is null. So the client has nothing to clean up.
- * (3) (a) Set %res == 0 to respect the resolution embedded in the
- * image file. If no resolution is embedded, it will be set
- * to the default value.
- * (b) Set %res to some other value to override the file resolution.
- * (4) (a) If the input %res and the resolution of the output device
- * are equal, the image will be "displayed" at the same size
- * as the original.
- * (b) If the input %res is 72, the output device will render
- * the image at 1 pt/pixel.
- * (c) Some possible choices for the default input pix resolution are:
- * 72 ppi Render pix on any output device at one pt/pixel
- * 96 ppi Windows default for generated display images
- * 300 ppi Typical default for scanned images.
- * We choose 300, which is sensible for rendering page images.
- * However, images come from a variety of sources, and
- * some are explicitly created for viewing on a display.
- *
- */
-l_ok
-convertToPdf(const char *filein,
- l_int32 type,
- l_int32 quality,
- const char *fileout,
- l_int32 x,
- l_int32 y,
- l_int32 res,
- const char *title,
- L_PDF_DATA **plpd,
- l_int32 position)
-{
-l_uint8 *data;
-l_int32 ret;
-size_t nbytes;
-
- PROCNAME("convertToPdf");
-
- if (!filein)
- return ERROR_INT("filein not defined", procName, 1);
- if (!plpd || (position == L_LAST_IMAGE)) {
- if (!fileout)
- return ERROR_INT("fileout not defined", procName, 1);
- }
-
- if (convertToPdfData(filein, type, quality, &data, &nbytes, x, y,
- res, title, plpd, position))
- return ERROR_INT("pdf data not made", procName, 1);
-
- if (!plpd || (position == L_LAST_IMAGE)) {
- ret = l_binaryWrite(fileout, "w", data, nbytes);
- LEPT_FREE(data);
- if (ret)
- return ERROR_INT("pdf data not written to file", procName, 1);
- }
-
- return 0;
-}
-
-
-/*!
- * \brief convertImageDataToPdf()
- *
- * \param[in] imdata array of formatted image data; e.g., png, jpeg
- * \param[in] size size of image data
- * \param[in] type encoding type (L_JPEG_ENCODE, L_G4_ENCODE,
- * L_FLATE_ENCODE, or L_JP2K_ENCODE)
- * \param[in] quality for jpeg: 1-100; 0 for default (75)
- * for jp2k: 27-45; 0 for default (34)
- * \param[in] fileout output pdf file; only required on last
- * image on page
- * \param[in] x, y location of lower-left corner of image,
- * in pixels, relative to the PostScript origin
- * (0,0) at the lower-left corner of the page
- * \param[in] res override the resolution of the input image,
- * in ppi; use 0 to respect the resolution
- * embedded in the input images
- * \param[in] title [optional] pdf title
- * \param[in,out] plpd ptr to lpd, which is created on the first
- * invocation and returned until last image is
- * processed, at which time it is destroyed
- * \param[in] position in image sequence: L_FIRST_IMAGE, L_NEXT_IMAGE,
- * L_LAST_IMAGE
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) If %res == 0 and the input resolution field is 0,
- * this will use DefaultInputRes.
- * (2) See comments in convertToPdf().
- *
- */
-l_ok
-convertImageDataToPdf(l_uint8 *imdata,
- size_t size,
- l_int32 type,
- l_int32 quality,
- const char *fileout,
- l_int32 x,
- l_int32 y,
- l_int32 res,
- const char *title,
- L_PDF_DATA **plpd,
- l_int32 position)
-{
-l_int32 ret;
-PIX *pix;
-
- PROCNAME("convertImageDataToPdf");
-
- if (!imdata)
- return ERROR_INT("image data not defined", procName, 1);
- if (!plpd || (position == L_LAST_IMAGE)) {
- if (!fileout)
- return ERROR_INT("fileout not defined", procName, 1);
- }
-
- if ((pix = pixReadMem(imdata, size)) == NULL)
- return ERROR_INT("pix not read", procName, 1);
- if (type != L_JPEG_ENCODE && type != L_G4_ENCODE &&
- type != L_FLATE_ENCODE && type != L_JP2K_ENCODE) {
- selectDefaultPdfEncoding(pix, &type);
- }
- ret = pixConvertToPdf(pix, type, quality, fileout, x, y, res,
- title, plpd, position);
- pixDestroy(&pix);
- return ret;
-}
-
-
-/*!
- * \brief convertToPdfData()
- *
- * \param[in] filein input image file -- any format
- * \param[in] type encoding type (L_JPEG_ENCODE, L_G4_ENCODE,
- * L_FLATE_ENCODE, or L_JP2K_ENCODE)
- * \param[in] quality for jpeg: 1-100; 0 for default (75)
- * for jp2k: 27-45; 0 for default (34)
- * \param[out] pdata pdf data in memory
- * \param[out] pnbytes number of bytes in pdf data
- * \param[in] x, y location of lower-left corner of image,
- * in pixels, relative to the PostScript origin
- * (0,0) at the lower-left corner of the page
- * \param[in] res override the resolution of the input image,
- * in ppi; use 0 to respect the resolution
- * embedded in the input images
- * \param[in] title [optional] pdf title; if null, use filein
- * \param[in,out] plpd ptr to lpd, which is created on the first
- * invocation and returned until last image is
- * processed, at which time it is destroyed
- * \param[in] position in image sequence: L_FIRST_IMAGE, L_NEXT_IMAGE,
- * L_LAST_IMAGE
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) If %res == 0 and the input resolution field is 0,
- * this will use DefaultInputRes.
- * (2) See comments in convertToPdf().
- *
- */
-l_ok
-convertToPdfData(const char *filein,
- l_int32 type,
- l_int32 quality,
- l_uint8 **pdata,
- size_t *pnbytes,
- l_int32 x,
- l_int32 y,
- l_int32 res,
- const char *title,
- L_PDF_DATA **plpd,
- l_int32 position)
-{
-PIX *pix;
-
- PROCNAME("convertToPdfData");
-
- if (!pdata)
- return ERROR_INT("&data not defined", procName, 1);
- *pdata = NULL;
- if (!pnbytes)
- return ERROR_INT("&nbytes not defined", procName, 1);
- *pnbytes = 0;
- if (!filein)
- return ERROR_INT("filein not defined", procName, 1);
-
- if ((pix = pixRead(filein)) == NULL)
- return ERROR_INT("pix not made", procName, 1);
-
- pixConvertToPdfData(pix, type, quality, pdata, pnbytes,
- x, y, res, (title) ? title : filein, plpd, position);
- pixDestroy(&pix);
- return 0;
-}
-
-
-/*!
- * \brief convertImageDataToPdfData()
- *
- * \param[in] imdata array of formatted image data; e.g., png, jpeg
- * \param[in] size size of image data
- * \param[in] type encoding type (L_JPEG_ENCODE, L_G4_ENCODE,
- * L_FLATE_ENCODE, or L_JP2K_ENCODE)
- * \param[in] quality for jpeg: 1-100; 0 for default (75)
- * for jp2k: 27-45; 0 for default (34)
- * \param[out] pdata pdf data in memory
- * \param[out] pnbytes number of bytes in pdf data
- * \param[in] x, y location of lower-left corner of image,
- * in pixels, relative to the PostScript origin
- * (0,0) at the lower-left corner of the page
- * \param[in] res override the resolution of the input image,
- * in ppi; use 0 to respect the resolution
- * embedded in the input images
- * \param[in] title [optional] pdf title
- * \param[out] plpd ptr to lpd, which is created on the first
- * invocation and returned until last image is
- * processed, at which time it is destroyed
- * \param[in] position in image sequence: L_FIRST_IMAGE, L_NEXT_IMAGE,
- * L_LAST_IMAGE
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) If %res == 0 and the input resolution field is 0,
- * this will use DefaultInputRes.
- * (2) See comments in convertToPdf().
- *
- */
-l_ok
-convertImageDataToPdfData(l_uint8 *imdata,
- size_t size,
- l_int32 type,
- l_int32 quality,
- l_uint8 **pdata,
- size_t *pnbytes,
- l_int32 x,
- l_int32 y,
- l_int32 res,
- const char *title,
- L_PDF_DATA **plpd,
- l_int32 position)
-{
-l_int32 ret;
-PIX *pix;
-
- PROCNAME("convertImageDataToPdfData");
-
- if (!pdata)
- return ERROR_INT("&data not defined", procName, 1);
- *pdata = NULL;
- if (!pnbytes)
- return ERROR_INT("&nbytes not defined", procName, 1);
- *pnbytes = 0;
- if (!imdata)
- return ERROR_INT("image data not defined", procName, 1);
- if (plpd) { /* part of multi-page invocation */
- if (position == L_FIRST_IMAGE)
- *plpd = NULL;
- }
-
- if ((pix = pixReadMem(imdata, size)) == NULL)
- return ERROR_INT("pix not read", procName, 1);
- if (type != L_JPEG_ENCODE && type != L_G4_ENCODE &&
- type != L_FLATE_ENCODE && type != L_JP2K_ENCODE) {
- selectDefaultPdfEncoding(pix, &type);
- }
- ret = pixConvertToPdfData(pix, type, quality, pdata, pnbytes,
- x, y, res, title, plpd, position);
- pixDestroy(&pix);
- return ret;
-}
-
-
-/*!
- * \brief pixConvertToPdf()
- *
- * \param[in] pix
- * \param[in] type encoding type (L_JPEG_ENCODE, L_G4_ENCODE,
- * L_FLATE_ENCODE, L_JP2K_ENCODE)
- * \param[in] quality for jpeg: 1-100; 0 for default (75)
- * for jp2k: 27-45; 0 for default (34)
- * \param[in] fileout output pdf file; only required on last
- * image on page
- * \param[in] x, y location of lower-left corner of image,
- * in pixels, relative to the PostScript origin
- * (0,0) at the lower-left corner of the page
- * \param[in] res override the resolution of the input image,
- * in ppi; use 0 to respect the resolution
- * embedded in the input images
- * \param[in] title [optional] pdf title
- * \param[in,out] plpd ptr to lpd, which is created on the first
- * invocation and returned until last image is
- * processed, at which time it is destroyed
- * \param[in] position in image sequence: L_FIRST_IMAGE, L_NEXT_IMAGE,
- * L_LAST_IMAGE
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) If %res == 0 and the input resolution field is 0,
- * this will use DefaultInputRes.
- * (2) This only writes data to fileout if it is the last
- * image to be written on the page.
- * (3) See comments in convertToPdf().
- *
- */
-l_ok
-pixConvertToPdf(PIX *pix,
- l_int32 type,
- l_int32 quality,
- const char *fileout,
- l_int32 x,
- l_int32 y,
- l_int32 res,
- const char *title,
- L_PDF_DATA **plpd,
- l_int32 position)
-{
-l_uint8 *data;
-l_int32 ret;
-size_t nbytes;
-
- PROCNAME("pixConvertToPdf");
-
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
- if (!plpd || (position == L_LAST_IMAGE)) {
- if (!fileout)
- return ERROR_INT("fileout not defined", procName, 1);
- }
-
- if (pixConvertToPdfData(pix, type, quality, &data, &nbytes,
- x, y, res, title, plpd, position)) {
- LEPT_FREE(data);
- return ERROR_INT("pdf data not made", procName, 1);
- }
-
- if (!plpd || (position == L_LAST_IMAGE)) {
- ret = l_binaryWrite(fileout, "w", data, nbytes);
- LEPT_FREE(data);
- if (ret)
- return ERROR_INT("pdf data not written to file", procName, 1);
- }
- return 0;
-}
-
-
-/*!
- * \brief pixWriteStreamPdf()
- *
- * \param[in] fp file stream opened for writing
- * \param[in] pix all depths, cmap OK
- * \param[in] res override the resolution of the input image, in ppi;
- * use 0 to respect the resolution embedded in the input
- * \param[in] title [optional] pdf title; taken from the first image
- * placed on a page; e.g., an input image filename
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This is the simplest interface for writing a single image
- * with pdf encoding to a stream. It uses G4 encoding for 1 bpp,
- * JPEG encoding for 8 bpp (no cmap) and 32 bpp, and FLATE
- * encoding for everything else.
- *
- */
-l_ok
-pixWriteStreamPdf(FILE *fp,
- PIX *pix,
- l_int32 res,
- const char *title)
-{
-l_uint8 *data;
-size_t nbytes, nbytes_written;
-
- PROCNAME("pixWriteStreamPdf");
-
- if (!fp)
- return ERROR_INT("stream not opened", procName, 1);
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
-
- if (pixWriteMemPdf(&data, &nbytes, pix, res, title) != 0) {
- LEPT_FREE(data);
- return ERROR_INT("pdf data not made", procName, 1);
- }
-
- nbytes_written = fwrite(data, 1, nbytes, fp);
- LEPT_FREE(data);
- if (nbytes != nbytes_written)
- return ERROR_INT("failure writing pdf data to stream", procName, 1);
- return 0;
-}
-
-
-/*!
- * \brief pixWriteMemPdf()
- *
- * \param[out] pdata pdf as byte array
- * \param[out] pnbytes number of bytes in pdf array
- * \param[in] pix all depths, cmap OK
- * \param[in] res override the resolution of the input image, in ppi;
- * use 0 to respect the res embedded in the input
- * \param[in] title [optional] pdf title; taken from the first image
- * placed on a page; e.g., an input image filename
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This is the simplest interface for writing a single image
- * with pdf encoding to memory. It uses G4 encoding for 1 bpp,
- * and makes a guess whether to use JPEG or FLATE encoding for
- * everything else.
- *
- */
-l_ok
-pixWriteMemPdf(l_uint8 **pdata,
- size_t *pnbytes,
- PIX *pix,
- l_int32 res,
- const char *title)
-{
-l_int32 ret, type;
-
- PROCNAME("pixWriteMemPdf");
-
- if (pdata) *pdata = NULL;
- if (pnbytes) *pnbytes = 0;
- if (!pdata || !pnbytes)
- return ERROR_INT("&data or &nbytes not defined", procName, 1);
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
-
- selectDefaultPdfEncoding(pix, &type);
- ret = pixConvertToPdfData(pix, type, 75, pdata, pnbytes,
- 0, 0, res, title, NULL, 0);
- if (ret)
- return ERROR_INT("pdf data not made", procName, 1);
- return 0;
-}
-
-
-/*---------------------------------------------------------------------*
- * Segmented multi-page, multi-image converter *
- *---------------------------------------------------------------------*/
-/*!
- * \brief convertSegmentedFilesToPdf()
- *
- * \param[in] dirname directory name containing images
- * \param[in] substr [optional] substring filter on filenames;
- * can be NULL
- * \param[in] res input resolution of all images
- * \param[in] type compression type for non-image regions; the
- * image regions are always compressed with
- * L_JPEG_ENCODE
- * \param[in] thresh used for converting gray --> 1 bpp with
- * L_G4_ENCODE
- * \param[in] baa [optional] boxaa of image regions
- * \param[in] quality used for JPEG only; 0 for default (75)
- * \param[in] scalefactor scaling factor applied to each image region
- * \param[in] title [optional] pdf title; if null, taken from
- * the first image filename
- * \param[in] fileout pdf file of all images
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) If %substr is not NULL, only image filenames that contain
- * the substring can be used. If %substr == NULL, all files
- * in the directory are used.
- * (2) The files in the directory, after optional filtering by
- * the substring, are lexically sorted in increasing order
- * before concatenation.
- * (3) The images are encoded with G4 if 1 bpp; JPEG if 8 bpp without
- * colormap and many colors, or 32 bpp; FLATE for anything else.
- * (4) The boxaa, if it exists, contains one boxa of "image regions"
- * for each image file. The boxa must be aligned with the
- * sorted set of images.
- * (5) The scalefactor is applied to each image region. It is
- * typically < 1.0, to save bytes in the final pdf, because
- * the resolution is often not critical in non-text regions.
- * (6) If the non-image regions have pixel depth > 1 and the encoding
- * type is G4, they are automatically scaled up by 2x and
- * thresholded. Otherwise, no scaling is performed on them.
- * (7) Note that this function can be used to generate multipage
- * G4 compressed pdf from any input, by using %boxaa == NULL
- * and %type == L_G4_ENCODE.
- *
- */
-l_ok
-convertSegmentedFilesToPdf(const char *dirname,
- const char *substr,
- l_int32 res,
- l_int32 type,
- l_int32 thresh,
- BOXAA *baa,
- l_int32 quality,
- l_float32 scalefactor,
- const char *title,
- const char *fileout)
-{
-char *fname;
-l_uint8 *imdata, *data;
-l_int32 i, npages, nboxa, nboxes, ret;
-size_t imbytes, databytes;
-BOXA *boxa;
-L_BYTEA *ba;
-L_PTRA *pa_data;
-SARRAY *sa;
-
- PROCNAME("convertSegmentedFilesToPdf");
-
- if (!dirname)
- return ERROR_INT("dirname not defined", procName, 1);
- if (!fileout)
- return ERROR_INT("fileout not defined", procName, 1);
-
- if ((sa = getNumberedPathnamesInDirectory(dirname, substr, 0, 0, 10000))
- == NULL)
- return ERROR_INT("sa not made", procName, 1);
-
- npages = sarrayGetCount(sa);
- /* If necessary, extend the boxaa, which is page-aligned with
- * the image files, to be as large as the set of images. */
- if (baa) {
- nboxa = boxaaGetCount(baa);
- if (nboxa < npages) {
- boxa = boxaCreate(1);
- boxaaExtendWithInit(baa, npages, boxa);
- boxaDestroy(&boxa);
- }
- }
-
- /* Generate and save all the encoded pdf strings */
- pa_data = ptraCreate(npages);
- for (i = 0; i < npages; i++) {
- fname = sarrayGetString(sa, i, L_NOCOPY);
- if (!strcmp(fname, "")) continue;
- boxa = NULL;
- if (baa) {
- boxa = boxaaGetBoxa(baa, i, L_CLONE);
- nboxes = boxaGetCount(boxa);
- if (nboxes == 0)
- boxaDestroy(&boxa);
- }
- ret = convertToPdfDataSegmented(fname, res, type, thresh, boxa,
- quality, scalefactor, title,
- &imdata, &imbytes);
- boxaDestroy(&boxa); /* safe; in case nboxes > 0 */
- if (ret) {
- L_ERROR("pdf encoding failed for %s\n", procName, fname);
- continue;
- }
- ba = l_byteaInitFromMem(imdata, imbytes);
- if (imdata) LEPT_FREE(imdata);
- ptraAdd(pa_data, ba);
- }
- sarrayDestroy(&sa);
-
- ptraGetActualCount(pa_data, &npages);
- if (npages == 0) {
- L_ERROR("no pdf files made\n", procName);
- ptraDestroy(&pa_data, FALSE, FALSE);
- return 1;
- }
-
- /* Concatenate */
- ret = ptraConcatenatePdfToData(pa_data, NULL, &data, &databytes);
-
- /* Clean up */
- ptraGetActualCount(pa_data, &npages); /* recalculate in case it changes */
- for (i = 0; i < npages; i++) {
- ba = (L_BYTEA *)ptraRemove(pa_data, i, L_NO_COMPACTION);
- l_byteaDestroy(&ba);
- }
- ptraDestroy(&pa_data, FALSE, FALSE);
-
- if (ret) {
- if (data) LEPT_FREE(data);
- return ERROR_INT("pdf data not made", procName, 1);
- }
-
- ret = l_binaryWrite(fileout, "w", data, databytes);
- LEPT_FREE(data);
- if (ret)
- L_ERROR("pdf data not written to file\n", procName);
- return ret;
-}
-
-
-/*!
- * \brief convertNumberedMasksToBoxaa()
- *
- * \param[in] dirname directory name containing mask images
- * \param[in] substr [optional] substring filter on filenames; can be NULL
- * \param[in] numpre number of characters in name before number
- * \param[in] numpost number of characters in name after number, up
- * to a dot before an extension
- * \return boxaa of mask regions, or NULL on error
- *
- *
- * Notes:
- * (1) This is conveniently used to generate the input boxaa
- * for convertSegmentedFilesToPdf(). It guarantees that the
- * boxa will be aligned with the page images, even if some
- * of the boxa are empty.
- *
- */
-BOXAA *
-convertNumberedMasksToBoxaa(const char *dirname,
- const char *substr,
- l_int32 numpre,
- l_int32 numpost)
-{
-char *fname;
-l_int32 i, n;
-BOXA *boxa;
-BOXAA *baa;
-PIX *pix;
-SARRAY *sa;
-
- PROCNAME("convertNumberedMasksToBoxaa");
-
- if (!dirname)
- return (BOXAA *)ERROR_PTR("dirname not defined", procName, NULL);
-
- if ((sa = getNumberedPathnamesInDirectory(dirname, substr, numpre,
- numpost, 10000)) == NULL)
- return (BOXAA *)ERROR_PTR("sa not made", procName, NULL);
-
- /* Generate and save all the encoded pdf strings */
- n = sarrayGetCount(sa);
- baa = boxaaCreate(n);
- boxa = boxaCreate(1);
- boxaaInitFull(baa, boxa);
- boxaDestroy(&boxa);
- for (i = 0; i < n; i++) {
- fname = sarrayGetString(sa, i, L_NOCOPY);
- if (!strcmp(fname, "")) continue;
- if ((pix = pixRead(fname)) == NULL) {
- L_WARNING("invalid image on page %d\n", procName, i);
- continue;
- }
- boxa = pixConnComp(pix, NULL, 8);
- boxaaReplaceBoxa(baa, i, boxa);
- pixDestroy(&pix);
- }
-
- sarrayDestroy(&sa);
- return baa;
-}
-
-
-/*---------------------------------------------------------------------*
- * Segmented single page, multi-image converters *
- *---------------------------------------------------------------------*/
-/*!
- * \brief convertToPdfSegmented()
- *
- * \param[in] filein input image file -- any format
- * \param[in] res input image resolution; typ. 300 ppi;
- * use 0 for default
- * \param[in] type compression type for non-image regions; image
- * regions are always compressed with L_JPEG_ENCODE
- * \param[in] thresh for converting gray --> 1 bpp with L_G4_ENCODE
- * \param[in] boxa [optional] of image regions; can be null
- * \param[in] quality used for jpeg image regions; 0 for default
- * \param[in] scalefactor used for jpeg regions; must be <= 1.0
- * \param[in] title [optional] pdf title; typically taken from the
- * input file for the pix
- * \param[in] fileout output pdf file
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) If there are no image regions, set %boxa == NULL;
- * %quality and %scalefactor are ignored.
- * (2) Typically, %scalefactor is < 1.0, because the image regions
- * can be rendered at a lower resolution (for better compression)
- * than the text regions. If %scalefactor == 0, we use 1.0.
- * If the input image is 1 bpp and scalefactor < 1.0, we
- * use scaleToGray() to downsample the image regions to gray
- * before compressing them.
- * (3) If the compression type for non-image regions is L_G4_ENCODE
- * and bpp > 1, the image is upscaled 2x and thresholded
- * to 1 bpp. That is the only situation where %thresh is used.
- * (4) The parameter %quality is only used for image regions.
- * If %type == L_JPEG_ENCODE, default jpeg quality (75) is
- * used for the non-image regions.
- * (5) Processing matrix for non-image regions.
- *
- * Input G4 JPEG FLATE
- * ----------|---------------------------------------------------
- * 1 bpp | 1x, 1 bpp 1x flate, 1 bpp 1x, 1 bpp
- * |
- * cmap | 2x, 1 bpp 1x flate, cmap 1x, cmap
- * |
- * 2,4 bpp | 2x, 1 bpp 1x flate 1x, 2,4 bpp
- * no cmap | 2,4 bpp
- * |
- * 8,32 bpp | 2x, 1 bpp 1x (jpeg) 1x, 8,32 bpp
- * no cmap | 8,32 bpp
- *
- * Summary:
- * (a) if G4 is requested, G4 is used, with 2x upscaling
- * for all cases except 1 bpp.
- * (b) if JPEG is requested, use flate encoding for all cases
- * except 8 bpp without cmap and 32 bpp (rgb).
- * (c) if FLATE is requested, use flate with no transformation
- * of the raster data.
- * (6) Calling options/sequence for these functions:
- * file --> file (convertToPdfSegmented)
- * pix --> file (pixConvertToPdfSegmented)
- * pix --> data (pixConvertToPdfDataSegmented)
- * file --> data (convertToPdfDataSegmented)
- * pix --> data (pixConvertToPdfDataSegmented)
- *
- */
-l_ok
-convertToPdfSegmented(const char *filein,
- l_int32 res,
- l_int32 type,
- l_int32 thresh,
- BOXA *boxa,
- l_int32 quality,
- l_float32 scalefactor,
- const char *title,
- const char *fileout)
-{
-l_int32 ret;
-PIX *pixs;
-
- PROCNAME("convertToPdfSegmented");
-
- if (!filein)
- return ERROR_INT("filein not defined", procName, 1);
- if (!fileout)
- return ERROR_INT("fileout not defined", procName, 1);
- if (type != L_G4_ENCODE && type != L_JPEG_ENCODE &&
- type != L_FLATE_ENCODE)
- return ERROR_INT("invalid conversion type", procName, 1);
- if (boxa && scalefactor > 1.0) {
- L_WARNING("setting scalefactor to 1.0\n", procName);
- scalefactor = 1.0;
- }
-
- if ((pixs = pixRead(filein)) == NULL)
- return ERROR_INT("pixs not made", procName, 1);
-
- ret = pixConvertToPdfSegmented(pixs, res, type, thresh, boxa, quality,
- scalefactor, (title) ? title : filein,
- fileout);
- pixDestroy(&pixs);
- return ret;
-}
-
-
-/*!
- * \brief pixConvertToPdfSegmented()
- *
- * \param[in] pixs any depth, cmap OK
- * \param[in] res input image resolution; typ. 300 ppi;
- * use 0 for default
- * \param[in] type compression type for non-image regions; image
- * regions are always compressed with L_JPEG_ENCODE
- * \param[in] thresh for converting gray --> 1 bpp with L_G4_ENCODE
- * \param[in] boxa [optional] of image regions; can be null
- * \param[in] quality used for jpeg image regions; 0 for default
- * \param[in] scalefactor used for jpeg regions; must be <= 1.0
- * \param[in] title [optional] pdf title; typically taken from the
- * input file for the pix
- * \param[in] fileout output pdf file
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) See convertToPdfSegmented() for details.
- *
- */
-l_ok
-pixConvertToPdfSegmented(PIX *pixs,
- l_int32 res,
- l_int32 type,
- l_int32 thresh,
- BOXA *boxa,
- l_int32 quality,
- l_float32 scalefactor,
- const char *title,
- const char *fileout)
-{
-l_uint8 *data;
-l_int32 ret;
-size_t nbytes;
-
- PROCNAME("pixConvertToPdfSegmented");
-
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
- if (!fileout)
- return ERROR_INT("fileout not defined", procName, 1);
- if (type != L_G4_ENCODE && type != L_JPEG_ENCODE &&
- type != L_FLATE_ENCODE)
- return ERROR_INT("invalid conversion type", procName, 1);
- if (boxa && scalefactor > 1.0) {
- L_WARNING("setting scalefactor to 1.0\n", procName);
- scalefactor = 1.0;
- }
-
- ret = pixConvertToPdfDataSegmented(pixs, res, type, thresh, boxa, quality,
- scalefactor, title, &data, &nbytes);
- if (ret)
- return ERROR_INT("pdf generation failure", procName, 1);
-
- ret = l_binaryWrite(fileout, "w", data, nbytes);
- if (data) LEPT_FREE(data);
- return ret;
-}
-
-
-/*!
- * \brief convertToPdfDataSegmented()
- *
- * \param[in] filein input image file -- any format
- * \param[in] res input image resolution; typ. 300 ppi;
- * use 0 for default
- * \param[in] type compression type for non-image regions; image
- * regions are always compressed with L_JPEG_ENCODE
- * \param[in] thresh for converting gray --> 1 bpp with L_G4_ENCODE
- * \param[in] boxa [optional] image regions; can be null
- * \param[in] quality used for jpeg image regions; 0 for default
- * \param[in] scalefactor used for jpeg regions; must be <= 1.0
- * \param[in] title [optional] pdf title; if null, uses filein
- * \param[out] pdata pdf data in memory
- * \param[out] pnbytes number of bytes in pdf data
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) If there are no image regions, set %boxa == NULL;
- * %quality and %scalefactor are ignored.
- * (2) Typically, %scalefactor is < 1.0. The image regions are
- *
- */
-l_ok
-convertToPdfDataSegmented(const char *filein,
- l_int32 res,
- l_int32 type,
- l_int32 thresh,
- BOXA *boxa,
- l_int32 quality,
- l_float32 scalefactor,
- const char *title,
- l_uint8 **pdata,
- size_t *pnbytes)
-{
-l_int32 ret;
-PIX *pixs;
-
- PROCNAME("convertToPdfDataSegmented");
-
- if (!pdata)
- return ERROR_INT("&data not defined", procName, 1);
- *pdata = NULL;
- if (!pnbytes)
- return ERROR_INT("&nbytes not defined", procName, 1);
- *pnbytes = 0;
- if (!filein)
- return ERROR_INT("filein not defined", procName, 1);
- if (type != L_G4_ENCODE && type != L_JPEG_ENCODE &&
- type != L_FLATE_ENCODE)
- return ERROR_INT("invalid conversion type", procName, 1);
- if (boxa && scalefactor > 1.0) {
- L_WARNING("setting scalefactor to 1.0\n", procName);
- scalefactor = 1.0;
- }
-
- if ((pixs = pixRead(filein)) == NULL)
- return ERROR_INT("pixs not made", procName, 1);
-
- ret = pixConvertToPdfDataSegmented(pixs, res, type, thresh, boxa,
- quality, scalefactor,
- (title) ? title : filein,
- pdata, pnbytes);
- pixDestroy(&pixs);
- return ret;
-}
-
-
-/*!
- * \brief pixConvertToPdfDataSegmented()
- *
- * \param[in] pixs any depth, cmap OK
- * \param[in] res input image resolution; typ. 300 ppi;
- * use 0 for default
- * \param[in] type compression type for non-image regions; image
- * regions are always compressed with L_JPEG_ENCODE
- * \param[in] thresh for converting gray --> 1 bpp with L_G4_ENCODE
- * \param[in] boxa [optional] of image regions; can be null
- * \param[in] quality used for jpeg image regions; 0 for default
- * \param[in] scalefactor used for jpeg regions; must be <= 1.0
- * \param[in] title [optional] pdf title; typically taken from the
- * input file for the pix
- * \param[out] pdata pdf data in memory
- * \param[out] pnbytes number of bytes in pdf data
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) See convertToPdfSegmented() for details.
- *
- */
-l_ok
-pixConvertToPdfDataSegmented(PIX *pixs,
- l_int32 res,
- l_int32 type,
- l_int32 thresh,
- BOXA *boxa,
- l_int32 quality,
- l_float32 scalefactor,
- const char *title,
- l_uint8 **pdata,
- size_t *pnbytes)
-{
-l_int32 i, nbox, seq, bx, by, bw, bh, upscale;
-l_float32 scale;
-BOX *box, *boxc, *box2;
-PIX *pix, *pixt1, *pixt2, *pixt3, *pixt4, *pixt5, *pixt6;
-PIXCMAP *cmap;
-L_PDF_DATA *lpd;
-
- PROCNAME("pixConvertToPdfDataSegmented");
-
- if (!pdata)
- return ERROR_INT("&data not defined", procName, 1);
- *pdata = NULL;
- if (!pnbytes)
- return ERROR_INT("&nbytes not defined", procName, 1);
- *pnbytes = 0;
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
- if (type != L_G4_ENCODE && type != L_JPEG_ENCODE &&
- type != L_FLATE_ENCODE)
- return ERROR_INT("invalid conversion type", procName, 1);
- if (boxa && (scalefactor <= 0.0 || scalefactor > 1.0)) {
- L_WARNING("setting scalefactor to 1.0\n", procName);
- scalefactor = 1.0;
- }
-
- /* Adjust scalefactor so that the product with res gives an integer */
- if (res <= 0)
- res = DefaultInputRes;
- scale = (l_float32)((l_int32)(scalefactor * res + 0.5)) / (l_float32)res;
- cmap = pixGetColormap(pixs);
-
- /* Simple case: single image to be encoded */
- if (!boxa || boxaGetCount(boxa) == 0) {
- if (pixGetDepth(pixs) > 1 && type == L_G4_ENCODE) {
- if (cmap)
- pixt1 = pixRemoveColormap(pixs, REMOVE_CMAP_TO_GRAYSCALE);
- else
- pixt1 = pixConvertTo8(pixs, FALSE);
- pixt2 = pixScaleGray2xLIThresh(pixt1, thresh);
- pixConvertToPdfData(pixt2, type, quality, pdata, pnbytes,
- 0, 0, 2 * res, title, NULL, 0);
- pixDestroy(&pixt1);
- pixDestroy(&pixt2);
- } else {
- pixConvertToPdfData(pixs, type, quality, pdata, pnbytes,
- 0, 0, res, title, NULL, 0);
- }
- return 0;
- }
-
- /* Multiple images to be encoded. If %type == L_G4_ENCODE,
- * jpeg encode a version of pixs that is blanked in the non-image
- * regions, and paint the scaled non-image part onto it through a mask.
- * Otherwise, we must put the non-image part down first and
- * then render all the image regions separately on top of it,
- * at their own resolution. */
- pixt1 = pixSetBlackOrWhiteBoxa(pixs, boxa, L_SET_WHITE); /* non-image */
- nbox = boxaGetCount(boxa);
- if (type == L_G4_ENCODE) {
- pixt2 = pixCreateTemplate(pixs); /* only image regions */
- pixSetBlackOrWhite(pixt2, L_SET_WHITE);
- for (i = 0; i < nbox; i++) {
- box = boxaGetBox(boxa, i, L_CLONE);
- pix = pixClipRectangle(pixs, box, &boxc);
- boxGetGeometry(boxc, &bx, &by, &bw, &bh);
- pixRasterop(pixt2, bx, by, bw, bh, PIX_SRC, pix, 0, 0);
- pixDestroy(&pix);
- boxDestroy(&box);
- boxDestroy(&boxc);
- }
- pixt3 = pixRemoveColormap(pixt2, REMOVE_CMAP_BASED_ON_SRC);
- if (pixGetDepth(pixt3) == 1)
- pixt4 = pixScaleToGray(pixt3, scale);
- else
- pixt4 = pixScale(pixt3, scale, scale);
- pixConvertToPdfData(pixt4, L_JPEG_ENCODE, quality, pdata, pnbytes,
- 0, 0, (l_int32)(scale * res), title,
- &lpd, L_FIRST_IMAGE);
-
- if (pixGetDepth(pixt1) == 1) {
- pixt5 = pixClone(pixt1);
- upscale = 1;
- } else {
- pixt6 = pixConvertTo8(pixt1, 0);
- pixt5 = pixScaleGray2xLIThresh(pixt6, thresh);
- pixDestroy(&pixt6);
- upscale = 2;
- }
- pixConvertToPdfData(pixt5, L_G4_ENCODE, quality, pdata, pnbytes,
- 0, 0, upscale * res, title, &lpd, L_LAST_IMAGE);
- pixDestroy(&pixt2);
- pixDestroy(&pixt3);
- pixDestroy(&pixt4);
- pixDestroy(&pixt5);
- } else {
- /* Put the non-image part down first. This is the full
- size of the page, so we can use it to find the page
- height in pixels, which is required for determining
- the LL corner of the image relative to the LL corner
- of the page. */
- pixConvertToPdfData(pixt1, type, quality, pdata, pnbytes, 0, 0,
- res, title, &lpd, L_FIRST_IMAGE);
- for (i = 0; i < nbox; i++) {
- box = boxaGetBox(boxa, i, L_CLONE);
- pixt2 = pixClipRectangle(pixs, box, &boxc);
- pixt3 = pixRemoveColormap(pixt2, REMOVE_CMAP_BASED_ON_SRC);
- if (pixGetDepth(pixt3) == 1)
- pixt4 = pixScaleToGray(pixt3, scale);
- else
- pixt4 = pixScale(pixt3, scale, scale);
- box2 = boxTransform(boxc, 0, 0, scale, scale);
- boxGetGeometry(box2, &bx, &by, NULL, &bh);
- seq = (i == nbox - 1) ? L_LAST_IMAGE : L_NEXT_IMAGE;
- pixConvertToPdfData(pixt4, L_JPEG_ENCODE, quality, pdata, pnbytes,
- bx, by, (l_int32)(scale * res), title,
- &lpd, seq);
- pixDestroy(&pixt2);
- pixDestroy(&pixt3);
- pixDestroy(&pixt4);
- boxDestroy(&box);
- boxDestroy(&boxc);
- boxDestroy(&box2);
- }
- }
-
- pixDestroy(&pixt1);
- return 0;
-}
-
-
-/*---------------------------------------------------------------------*
- * Multi-page concatenation *
- *---------------------------------------------------------------------*/
-/*!
- * \brief concatenatePdf()
- *
- * \param[in] dirname directory name containing single-page pdf files
- * \param[in] substr [optional] substring filter on filenames; can be NULL
- * \param[in] fileout concatenated pdf file
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This only works with leptonica-formatted single-page pdf files.
- * (2) If %substr is not NULL, only filenames that contain
- * the substring can be returned. If %substr == NULL,
- * none of the filenames are filtered out.
- * (3) The files in the directory, after optional filtering by
- * the substring, are lexically sorted in increasing order
- * before concatenation.
- *
- */
-l_ok
-concatenatePdf(const char *dirname,
- const char *substr,
- const char *fileout)
-{
-l_int32 ret;
-SARRAY *sa;
-
- PROCNAME("concatenatePdf");
-
- if (!dirname)
- return ERROR_INT("dirname not defined", procName, 1);
- if (!fileout)
- return ERROR_INT("fileout not defined", procName, 1);
-
- if ((sa = getSortedPathnamesInDirectory(dirname, substr, 0, 0)) == NULL)
- return ERROR_INT("sa not made", procName, 1);
- ret = saConcatenatePdf(sa, fileout);
- sarrayDestroy(&sa);
- return ret;
-}
-
-
-/*!
- * \brief saConcatenatePdf()
- *
- * \param[in] sa string array of pathnames for single-page pdf files
- * \param[in] fileout concatenated pdf file
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This only works with leptonica-formatted single-page pdf files.
- *
- */
-l_ok
-saConcatenatePdf(SARRAY *sa,
- const char *fileout)
-{
-l_uint8 *data;
-l_int32 ret;
-size_t nbytes;
-
- PROCNAME("saConcatenatePdf");
-
- if (!sa)
- return ERROR_INT("sa not defined", procName, 1);
- if (!fileout)
- return ERROR_INT("fileout not defined", procName, 1);
-
- ret = saConcatenatePdfToData(sa, &data, &nbytes);
- if (ret)
- return ERROR_INT("pdf data not made", procName, 1);
- ret = l_binaryWrite(fileout, "w", data, nbytes);
- LEPT_FREE(data);
- return ret;
-}
-
-
-/*!
- * \brief ptraConcatenatePdf()
- *
- * \param[in] pa array of pdf strings, each for a single-page pdf file
- * \param[in] fileout concatenated pdf file
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This only works with leptonica-formatted single-page pdf files.
- *
- */
-l_ok
-ptraConcatenatePdf(L_PTRA *pa,
- const char *fileout)
-{
-l_uint8 *data;
-l_int32 ret;
-size_t nbytes;
-
- PROCNAME("ptraConcatenatePdf");
-
- if (!pa)
- return ERROR_INT("pa not defined", procName, 1);
- if (!fileout)
- return ERROR_INT("fileout not defined", procName, 1);
-
- ret = ptraConcatenatePdfToData(pa, NULL, &data, &nbytes);
- if (ret)
- return ERROR_INT("pdf data not made", procName, 1);
- ret = l_binaryWrite(fileout, "w", data, nbytes);
- LEPT_FREE(data);
- return ret;
-}
-
-
-/*!
- * \brief concatenatePdfToData()
- *
- * \param[in] dirname directory name containing single-page pdf files
- * \param[in] substr [optional] substring filter on filenames; can be NULL
- * \param[out] pdata concatenated pdf data in memory
- * \param[out] pnbytes number of bytes in pdf data
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This only works with leptonica-formatted single-page pdf files.
- * (2) If %substr is not NULL, only filenames that contain
- * the substring can be returned. If %substr == NULL,
- * none of the filenames are filtered out.
- * (3) The files in the directory, after optional filtering by
- * the substring, are lexically sorted in increasing order
- * before concatenation.
- *
- */
-l_ok
-concatenatePdfToData(const char *dirname,
- const char *substr,
- l_uint8 **pdata,
- size_t *pnbytes)
-{
-l_int32 ret;
-SARRAY *sa;
-
- PROCNAME("concatenatePdfToData");
-
- if (!pdata)
- return ERROR_INT("&data not defined", procName, 1);
- *pdata = NULL;
- if (!pnbytes)
- return ERROR_INT("&nbytes not defined", procName, 1);
- *pnbytes = 0;
- if (!dirname)
- return ERROR_INT("dirname not defined", procName, 1);
-
- if ((sa = getSortedPathnamesInDirectory(dirname, substr, 0, 0)) == NULL)
- return ERROR_INT("sa not made", procName, 1);
- ret = saConcatenatePdfToData(sa, pdata, pnbytes);
- sarrayDestroy(&sa);
- return ret;
-}
-
-
-/*!
- * \brief saConcatenatePdfToData()
- *
- * \param[in] sa string array of pathnames for single-page pdf files
- * \param[out] pdata concatenated pdf data in memory
- * \param[out] pnbytes number of bytes in pdf data
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This only works with leptonica-formatted single-page pdf files.
- *
- */
-l_ok
-saConcatenatePdfToData(SARRAY *sa,
- l_uint8 **pdata,
- size_t *pnbytes)
-{
-char *fname;
-l_int32 i, npages, ret;
-L_BYTEA *bas;
-L_PTRA *pa_data; /* input pdf data for each page */
-
- PROCNAME("saConcatenatePdfToData");
-
- if (!pdata)
- return ERROR_INT("&data not defined", procName, 1);
- *pdata = NULL;
- if (!pnbytes)
- return ERROR_INT("&nbytes not defined", procName, 1);
- *pnbytes = 0;
- if (!sa)
- return ERROR_INT("sa not defined", procName, 1);
-
- /* Read the pdf files into memory */
- if ((npages = sarrayGetCount(sa)) == 0)
- return ERROR_INT("no filenames found", procName, 1);
- pa_data = ptraCreate(npages);
- for (i = 0; i < npages; i++) {
- fname = sarrayGetString(sa, i, L_NOCOPY);
- bas = l_byteaInitFromFile(fname);
- ptraAdd(pa_data, bas);
- }
-
- ret = ptraConcatenatePdfToData(pa_data, sa, pdata, pnbytes);
-
- /* Cleanup: some pages could have been removed */
- ptraGetActualCount(pa_data, &npages);
- for (i = 0; i < npages; i++) {
- bas = (L_BYTEA *)ptraRemove(pa_data, i, L_NO_COMPACTION);
- l_byteaDestroy(&bas);
- }
- ptraDestroy(&pa_data, FALSE, FALSE);
- return ret;
-}
-
-/* --------------------------------------------*/
-#endif /* USE_PDFIO */
-/* --------------------------------------------*/
diff --git a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pdfio1stub.c b/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pdfio1stub.c
deleted file mode 100644
index 78cf1158..00000000
--- a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pdfio1stub.c
+++ /dev/null
@@ -1,309 +0,0 @@
-/*====================================================================*
- - Copyright (C) 2001 Leptonica. All rights reserved.
- -
- - Redistribution and use in source and binary forms, with or without
- - modification, are permitted provided that the following conditions
- - are met:
- - 1. Redistributions of source code must retain the above copyright
- - notice, this list of conditions and the following disclaimer.
- - 2. Redistributions in binary form must reproduce the above
- - copyright notice, this list of conditions and the following
- - disclaimer in the documentation and/or other materials
- - provided with the distribution.
- -
- - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- - ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- - LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- - A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL ANY
- - CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
- - EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
- - PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
- - PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
- - OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
- - NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- *====================================================================*/
-
-/*!
- * \file pdfio1stub.c
- *
- *
- * Stubs for pdfio1.c functions
- *
- */
-
-#ifdef HAVE_CONFIG_H
-#include
-#endif /* HAVE_CONFIG_H */
-
-#include "allheaders.h"
-
-/* --------------------------------------------*/
-#if !USE_PDFIO /* defined in environ.h */
-/* --------------------------------------------*/
-
-/* ----------------------------------------------------------------------*/
-
-l_ok convertFilesToPdf(const char *dirname, const char *substr,
- l_int32 res, l_float32 scalefactor,
- l_int32 type, l_int32 quality,
- const char *title, const char *fileout)
-{
- return ERROR_INT("function not present", "convertFilesToPdf", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok saConvertFilesToPdf(SARRAY *sa, l_int32 res, l_float32 scalefactor,
- l_int32 type, l_int32 quality,
- const char *title, const char *fileout)
-{
- return ERROR_INT("function not present", "saConvertFilesToPdf", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok saConvertFilesToPdfData(SARRAY *sa, l_int32 res,
- l_float32 scalefactor, l_int32 type,
- l_int32 quality, const char *title,
- l_uint8 **pdata, size_t *pnbytes)
-{
- return ERROR_INT("function not present", "saConvertFilesToPdfData", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok selectDefaultPdfEncoding(PIX *pix, l_int32 *ptype)
-{
- return ERROR_INT("function not present", "selectDefaultPdfEncoding", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok convertUnscaledFilesToPdf(const char *dirname, const char *substr,
- const char *title, const char *fileout)
-{
- return ERROR_INT("function not present", "convertUnscaledFilesToPdf", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok saConvertUnscaledFilesToPdf(SARRAY *sa, const char *title,
- const char *fileout)
-{
- return ERROR_INT("function not present", "saConvertUnscaledFilesToPdf", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok saConvertUnscaledFilesToPdfData(SARRAY *sa, const char *title,
- l_uint8 **pdata, size_t *pnbytes)
-{
- return ERROR_INT("function not present",
- "saConvertUnscaledFilesToPdfData", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok convertUnscaledToPdfData(const char *fname, const char *title,
- l_uint8 **pdata, size_t *pnbytes)
-{
- return ERROR_INT("function not present", "convertUnscaledToPdfData", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok pixaConvertToPdf(PIXA *pixa, l_int32 res, l_float32 scalefactor,
- l_int32 type, l_int32 quality,
- const char *title, const char *fileout)
-{
- return ERROR_INT("function not present", "pixaConvertToPdf", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok pixaConvertToPdfData(PIXA *pixa, l_int32 res, l_float32 scalefactor,
- l_int32 type, l_int32 quality, const char *title,
- l_uint8 **pdata, size_t *pnbytes)
-{
- return ERROR_INT("function not present", "pixaConvertToPdfData", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok convertToPdf(const char *filein,
- l_int32 type, l_int32 quality,
- const char *fileout,
- l_int32 x, l_int32 y, l_int32 res,
- const char *title,
- L_PDF_DATA **plpd, l_int32 position)
-{
- return ERROR_INT("function not present", "convertToPdf", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok convertImageDataToPdf(l_uint8 *imdata, size_t size,
- l_int32 type, l_int32 quality,
- const char *fileout,
- l_int32 x, l_int32 y, l_int32 res,
- const char *title,
- L_PDF_DATA **plpd, l_int32 position)
-{
- return ERROR_INT("function not present", "convertImageDataToPdf", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok convertToPdfData(const char *filein,
- l_int32 type, l_int32 quality,
- l_uint8 **pdata, size_t *pnbytes,
- l_int32 x, l_int32 y, l_int32 res,
- const char *title,
- L_PDF_DATA **plpd, l_int32 position)
-{
- return ERROR_INT("function not present", "convertToPdfData", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok convertImageDataToPdfData(l_uint8 *imdata, size_t size,
- l_int32 type, l_int32 quality,
- l_uint8 **pdata, size_t *pnbytes,
- l_int32 x, l_int32 y, l_int32 res,
- const char *title,
- L_PDF_DATA **plpd, l_int32 position)
-{
- return ERROR_INT("function not present", "convertImageDataToPdfData", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok pixConvertToPdf(PIX *pix, l_int32 type, l_int32 quality,
- const char *fileout,
- l_int32 x, l_int32 y, l_int32 res,
- const char *title,
- L_PDF_DATA **plpd, l_int32 position)
-{
- return ERROR_INT("function not present", "pixConvertToPdf", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok pixWriteStreamPdf(FILE *fp, PIX *pix, l_int32 res, const char *title)
-{
- return ERROR_INT("function not present", "pixWriteStreamPdf", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok pixWriteMemPdf(l_uint8 **pdata, size_t *pnbytes, PIX *pix,
- l_int32 res, const char *title)
-{
- return ERROR_INT("function not present", "pixWriteMemPdf", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok convertSegmentedFilesToPdf(const char *dirname, const char *substr,
- l_int32 res, l_int32 type, l_int32 thresh,
- BOXAA *baa, l_int32 quality,
- l_float32 scalefactor, const char *title,
- const char *fileout)
-{
- return ERROR_INT("function not present", "convertSegmentedFilesToPdf", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-BOXAA * convertNumberedMasksToBoxaa(const char *dirname, const char *substr,
- l_int32 numpre, l_int32 numpost)
-{
- return (BOXAA *)ERROR_PTR("function not present",
- "convertNumberedMasksToBoxaa", NULL);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok convertToPdfSegmented(const char *filein, l_int32 res, l_int32 type,
- l_int32 thresh, BOXA *boxa, l_int32 quality,
- l_float32 scalefactor, const char *title,
- const char *fileout)
-{
- return ERROR_INT("function not present", "convertToPdfSegmented", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok pixConvertToPdfSegmented(PIX *pixs, l_int32 res, l_int32 type,
- l_int32 thresh, BOXA *boxa, l_int32 quality,
- l_float32 scalefactor, const char *title,
- const char *fileout)
-{
- return ERROR_INT("function not present", "pixConvertToPdfSegmented", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok convertToPdfDataSegmented(const char *filein, l_int32 res,
- l_int32 type, l_int32 thresh, BOXA *boxa,
- l_int32 quality, l_float32 scalefactor,
- const char *title,
- l_uint8 **pdata, size_t *pnbytes)
-{
- return ERROR_INT("function not present", "convertToPdfDataSegmented", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok pixConvertToPdfDataSegmented(PIX *pixs, l_int32 res, l_int32 type,
- l_int32 thresh, BOXA *boxa,
- l_int32 quality, l_float32 scalefactor,
- const char *title,
- l_uint8 **pdata, size_t *pnbytes)
-{
- return ERROR_INT("function not present", "pixConvertToPdfDataSegmented", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok concatenatePdf(const char *dirname, const char *substr,
- const char *fileout)
-{
- return ERROR_INT("function not present", "concatenatePdf", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok saConcatenatePdf(SARRAY *sa, const char *fileout)
-{
- return ERROR_INT("function not present", "saConcatenatePdf", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok ptraConcatenatePdf(L_PTRA *pa, const char *fileout)
-{
- return ERROR_INT("function not present", "ptraConcatenatePdf", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok concatenatePdfToData(const char *dirname, const char *substr,
- l_uint8 **pdata, size_t *pnbytes)
-{
- return ERROR_INT("function not present", "concatenatePdfToData", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok saConcatenatePdfToData(SARRAY *sa, l_uint8 **pdata, size_t *pnbytes)
-{
- return ERROR_INT("function not present", "saConcatenatePdfToData", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-/* --------------------------------------------*/
-#endif /* !USE_PDFIO */
-/* --------------------------------------------*/
diff --git a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pdfio2.c b/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pdfio2.c
deleted file mode 100644
index 82407993..00000000
--- a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pdfio2.c
+++ /dev/null
@@ -1,2589 +0,0 @@
-/*====================================================================*
- - Copyright (C) 2001 Leptonica. All rights reserved.
- -
- - Redistribution and use in source and binary forms, with or without
- - modification, are permitted provided that the following conditions
- - are met:
- - 1. Redistributions of source code must retain the above copyright
- - notice, this list of conditions and the following disclaimer.
- - 2. Redistributions in binary form must reproduce the above
- - copyright notice, this list of conditions and the following
- - disclaimer in the documentation and/or other materials
- - provided with the distribution.
- -
- - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- - ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- - LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- - A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL ANY
- - CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
- - EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
- - PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
- - PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
- - OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
- - NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- *====================================================================*/
-
-/*!
- * \file pdfio2.c
- *
- *
- * Lower-level operations for generating pdf.
- *
- * Intermediate function for single page, multi-image conversion
- * l_int32 pixConvertToPdfData()
- *
- * Intermediate function for generating multipage pdf output
- * l_int32 ptraConcatenatePdfToData()
- *
- * Convert tiff multipage to pdf file
- * l_int32 convertTiffMultipageToPdf()
- *
- * Low-level CID-based operations
- *
- * Without transcoding
- * l_int32 l_generateCIDataForPdf()
- * L_COMP_DATA *l_generateFlateDataPdf()
- * L_COMP_DATA *l_generateJpegData()
- * L_COMP_DATA *l_generateJpegDataMem()
- * static L_COMP_DATA *l_generateJp2kData()
- *
- * With transcoding
- * l_int32 l_generateCIData()
- * l_int32 pixGenerateCIData()
- * L_COMP_DATA *l_generateFlateData()
- * static L_COMP_DATA *pixGenerateFlateData()
- * static L_COMP_DATA *pixGenerateJpegData()
- * static L_COMP_DATA *pixGenerateJp2kData()
- * static L_COMP_DATA *pixGenerateG4Data()
- * L_COMP_DATA *l_generateG4Data()
- *
- * Other
- * l_int32 cidConvertToPdfData()
- * void l_CIDataDestroy()
- *
- * Helper functions for generating the output pdf string
- * static l_int32 l_generatePdf()
- * static void generateFixedStringsPdf()
- * static char *generateEscapeString()
- * static void generateMediaboxPdf()
- * static l_int32 generatePageStringPdf()
- * static l_int32 generateContentStringPdf()
- * static l_int32 generatePreXStringsPdf()
- * static l_int32 generateColormapStringsPdf()
- * static void generateTrailerPdf()
- * static l_int32 makeTrailerStringPdf()
- * static l_int32 generateOutputDataPdf()
- *
- * Helper functions for generating multipage pdf output
- * static l_int32 parseTrailerPdf()
- * static char *generatePagesObjStringPdf()
- * static L_BYTEA *substituteObjectNumbers()
- *
- * Create/destroy/access pdf data
- * static L_PDF_DATA *pdfdataCreate()
- * static void pdfdataDestroy()
- * static L_COMP_DATA *pdfdataGetCid()
- *
- * Set flags for special modes
- * void l_pdfSetG4ImageMask()
- * void l_pdfSetDateAndVersion()
- *
- */
-
-#ifdef HAVE_CONFIG_H
-#include
-#endif /* HAVE_CONFIG_H */
-
-#include
-#include
-#include "allheaders.h"
-
-/* --------------------------------------------*/
-#if USE_PDFIO /* defined in environ.h */
- /* --------------------------------------------*/
-
- /* Typical scan resolution in ppi (pixels/inch) */
-static const l_int32 DefaultInputRes = 300;
-
- /* Static helpers */
-static L_COMP_DATA *l_generateJp2kData(const char *fname);
-static L_COMP_DATA *pixGenerateFlateData(PIX *pixs, l_int32 ascii85flag);
-static L_COMP_DATA *pixGenerateJpegData(PIX *pixs, l_int32 ascii85flag,
- l_int32 quality);
-static L_COMP_DATA *pixGenerateJp2kData(PIX *pixs, l_int32 quality);
-static L_COMP_DATA *pixGenerateG4Data(PIX *pixs, l_int32 ascii85flag);
-
-static l_int32 l_generatePdf(l_uint8 **pdata, size_t *pnbytes,
- L_PDF_DATA *lpd);
-static void generateFixedStringsPdf(L_PDF_DATA *lpd);
-static char *generateEscapeString(const char *str);
-static void generateMediaboxPdf(L_PDF_DATA *lpd);
-static l_int32 generatePageStringPdf(L_PDF_DATA *lpd);
-static l_int32 generateContentStringPdf(L_PDF_DATA *lpd);
-static l_int32 generatePreXStringsPdf(L_PDF_DATA *lpd);
-static l_int32 generateColormapStringsPdf(L_PDF_DATA *lpd);
-static void generateTrailerPdf(L_PDF_DATA *lpd);
-static char *makeTrailerStringPdf(L_DNA *daloc);
-static l_int32 generateOutputDataPdf(l_uint8 **pdata, size_t *pnbytes,
- L_PDF_DATA *lpd);
-
-static l_int32 parseTrailerPdf(L_BYTEA *bas, L_DNA **pda);
-static char *generatePagesObjStringPdf(NUMA *napage);
-static L_BYTEA *substituteObjectNumbers(L_BYTEA *bas, NUMA *na_objs);
-
-static L_PDF_DATA *pdfdataCreate(const char *title);
-static void pdfdataDestroy(L_PDF_DATA **plpd);
-static L_COMP_DATA *pdfdataGetCid(L_PDF_DATA *lpd, l_int32 index);
-
-
-/* ---------------- Defaults for rendering options ----------------- */
- /* Output G4 as writing through image mask; this is the default */
-static l_int32 var_WRITE_G4_IMAGE_MASK = 1;
- /* Write date/time and lib version into pdf; this is the default */
-static l_int32 var_WRITE_DATE_AND_VERSION = 1;
-
-#define L_SMALLBUF 256
-#define L_BIGBUF 2048 /* must be able to hold hex colormap */
-
-
-#ifndef NO_CONSOLE_IO
-#define DEBUG_MULTIPAGE 0
-#endif /* ~NO_CONSOLE_IO */
-
-
-/*---------------------------------------------------------------------*
- * Intermediate function for generating multipage pdf output *
- *---------------------------------------------------------------------*/
-/*!
- * \brief pixConvertToPdfData()
- *
- * \param[in] pix all depths; cmap OK
- * \param[in] type L_G4_ENCODE, L_JPEG_ENCODE, L_FLATE_ENCODE,
- * L_JP2K_ENCODE
- * \param[in] quality for jpeg: 1-100; 0 for default (75)
- * for jp2k: 27-45; 0 for default (34)
- * \param[out] pdata pdf array
- * \param[out] pnbytes number of bytes in pdf array
- * \param[in] x, y location of lower-left corner of image, in pixels,
- * relative to the PostScript origin (0,0) at
- * the lower-left corner of the page)
- * \param[in] res override the resolution of the input image, in ppi;
- * use 0 to respect resolution embedded in the input
- * \param[in] title [optional] pdf title; can be null
- * \param[in,out] plpd ptr to lpd; created on the first invocation and
- * returned until last image is processed
- * \param[in] position in image sequence: L_FIRST_IMAGE, L_NEXT_IMAGE,
- * L_LAST_IMAGE
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) If %res == 0 and the input resolution field is 0,
- * this will use DefaultInputRes.
- * (2) This only writes %data if it is the last image to be
- * written on the page.
- * (3) See comments in convertToPdf().
- *
- */
-l_ok
-pixConvertToPdfData(PIX *pix,
- l_int32 type,
- l_int32 quality,
- l_uint8 **pdata,
- size_t *pnbytes,
- l_int32 x,
- l_int32 y,
- l_int32 res,
- const char *title,
- L_PDF_DATA **plpd,
- l_int32 position)
-{
-l_int32 pixres, w, h, ret;
-l_float32 xpt, ypt, wpt, hpt;
-L_COMP_DATA *cid = NULL;
-L_PDF_DATA *lpd = NULL;
-
- PROCNAME("pixConvertToPdfData");
-
- if (!pdata)
- return ERROR_INT("&data not defined", procName, 1);
- *pdata = NULL;
- if (!pnbytes)
- return ERROR_INT("&nbytes not defined", procName, 1);
- *pnbytes = 0;
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
- if (type != L_JPEG_ENCODE && type != L_G4_ENCODE &&
- type != L_FLATE_ENCODE && type != L_JP2K_ENCODE) {
- selectDefaultPdfEncoding(pix, &type);
- }
- if (plpd) { /* part of multi-page invocation */
- if (position == L_FIRST_IMAGE)
- *plpd = NULL;
- }
-
- /* Generate the compressed image data. It must NOT
- * be ascii85 encoded. */
- pixGenerateCIData(pix, type, quality, 0, &cid);
- if (!cid)
- return ERROR_INT("cid not made", procName, 1);
-
- /* Get media box in pts. Guess the input image resolution
- * based on the input parameter %res, the resolution data in
- * the pix, and the size of the image. */
- pixres = cid->res;
- w = cid->w;
- h = cid->h;
- if (res <= 0.0) {
- if (pixres > 0)
- res = pixres;
- else
- res = DefaultInputRes;
- }
- xpt = x * 72. / res;
- ypt = y * 72. / res;
- wpt = w * 72. / res;
- hpt = h * 72. / res;
-
- /* Set up lpd */
- if (!plpd) { /* single image */
- if ((lpd = pdfdataCreate(title)) == NULL)
- return ERROR_INT("lpd not made", procName, 1);
- } else if (position == L_FIRST_IMAGE) { /* first of multiple images */
- if ((lpd = pdfdataCreate(title)) == NULL)
- return ERROR_INT("lpd not made", procName, 1);
- *plpd = lpd;
- } else { /* not the first of multiple images */
- lpd = *plpd;
- }
-
- /* Add the data to the lpd */
- ptraAdd(lpd->cida, cid);
- lpd->n++;
- ptaAddPt(lpd->xy, xpt, ypt);
- ptaAddPt(lpd->wh, wpt, hpt);
-
- /* If a single image or the last of multiple images,
- * generate the pdf and destroy the lpd */
- if (!plpd || (position == L_LAST_IMAGE)) {
- ret = l_generatePdf(pdata, pnbytes, lpd);
- pdfdataDestroy(&lpd);
- if (plpd) *plpd = NULL;
- if (ret)
- return ERROR_INT("pdf output not made", procName, 1);
- }
-
- return 0;
-}
-
-
-/*---------------------------------------------------------------------*
- * Intermediate function for generating multipage pdf output *
- *---------------------------------------------------------------------*/
-/*!
- * \brief ptraConcatenatePdfToData()
- *
- * \param[in] pa_data ptra array of pdf strings, each for a
- * single-page pdf file
- * \param[in] sa [optional] string array of pathnames for
- * input pdf files; can be null
- * \param[out] pdata concatenated pdf data in memory
- * \param[out] pnbytes number of bytes in pdf data
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This only works with leptonica-formatted single-page pdf files.
- * pdf files generated by other programs will have unpredictable
- * (and usually bad) results. The requirements for each pdf file:
- * (a) The Catalog and Info objects are the first two.
- * (b) Object 3 is Pages
- * (c) Object 4 is Page
- * (d) The remaining objects are Contents, XObjects, and ColorSpace
- * (2) We remove trailers from each page, and append the full trailer
- * for all pages at the end.
- * (3) For all but the first file, remove the ID and the first 3
- * objects (catalog, info, pages), so that each subsequent
- * file has only objects of these classes:
- * Page, Contents, XObject, ColorSpace (Indexed RGB).
- * For those objects, we substitute these refs to objects
- * in the local file:
- * Page: Parent(object 3), Contents, XObject(typically multiple)
- * XObject: [ColorSpace if indexed]
- * The Pages object on the first page (object 3) has a Kids array
- * of references to all the Page objects, with a Count equal
- * to the number of pages. Each Page object refers back to
- * this parent.
- *
- */
-l_ok
-ptraConcatenatePdfToData(L_PTRA *pa_data,
- SARRAY *sa,
- l_uint8 **pdata,
- size_t *pnbytes)
-{
-char *fname, *str_pages, *str_trailer;
-l_uint8 *pdfdata, *data;
-l_int32 i, j, index, nobj, npages;
-l_int32 *sizes, *locs;
-size_t size;
-L_BYTEA *bas, *bad, *bat1, *bat2;
-L_DNA *da_locs, *da_sizes, *da_outlocs, *da;
-L_DNAA *daa_locs; /* object locations on each page */
-NUMA *na_objs, *napage;
-NUMAA *naa_objs; /* object mapping numbers to new values */
-
- PROCNAME("ptraConcatenatePdfToData");
-
- if (!pdata)
- return ERROR_INT("&data not defined", procName, 1);
- *pdata = NULL;
- if (!pnbytes)
- return ERROR_INT("&nbytes not defined", procName, 1);
- *pnbytes = 0;
- if (!pa_data)
- return ERROR_INT("pa_data not defined", procName, 1);
-
- /* Parse the files and find the object locations.
- * Remove file data that cannot be parsed. */
- ptraGetActualCount(pa_data, &npages);
- daa_locs = l_dnaaCreate(npages);
- for (i = 0; i < npages; i++) {
- bas = (L_BYTEA *)ptraGetPtrToItem(pa_data, i);
- if (parseTrailerPdf(bas, &da_locs) != 0) {
- bas = (L_BYTEA *)ptraRemove(pa_data, i, L_NO_COMPACTION);
- l_byteaDestroy(&bas);
- if (sa) {
- fname = sarrayGetString(sa, i, L_NOCOPY);
- L_ERROR("can't parse file %s; skipping\n", procName, fname);
- } else {
- L_ERROR("can't parse file %d; skipping\n", procName, i);
- }
- } else {
- l_dnaaAddDna(daa_locs, da_locs, L_INSERT);
- }
- }
-
- /* Recompute npages in case some of the files were not pdf */
- ptraCompactArray(pa_data);
- ptraGetActualCount(pa_data, &npages);
- if (npages == 0) {
- l_dnaaDestroy(&daa_locs);
- return ERROR_INT("no parsable pdf files found", procName, 1);
- }
-
- /* Find the mapping from initial to final object numbers */
- naa_objs = numaaCreate(npages); /* stores final object numbers */
- napage = numaCreate(npages); /* stores "Page" object numbers */
- index = 0;
- for (i = 0; i < npages; i++) {
- da = l_dnaaGetDna(daa_locs, i, L_CLONE);
- nobj = l_dnaGetCount(da);
- if (i == 0) {
- numaAddNumber(napage, 4); /* object 4 on first page */
- na_objs = numaMakeSequence(0.0, 1.0, nobj - 1);
- index = nobj - 1;
- } else { /* skip the first 3 objects in each file */
- numaAddNumber(napage, index); /* Page object is first we add */
- na_objs = numaMakeConstant(0.0, nobj - 1);
- numaReplaceNumber(na_objs, 3, 3); /* refers to parent of all */
- for (j = 4; j < nobj - 1; j++)
- numaSetValue(na_objs, j, index++);
- }
- numaaAddNuma(naa_objs, na_objs, L_INSERT);
- l_dnaDestroy(&da);
- }
-
- /* Make the Pages object (#3) */
- str_pages = generatePagesObjStringPdf(napage);
-
- /* Build the output */
- bad = l_byteaCreate(5000);
- da_outlocs = l_dnaCreate(0); /* locations of all output objects */
- for (i = 0; i < npages; i++) {
- bas = (L_BYTEA *)ptraGetPtrToItem(pa_data, i);
- pdfdata = l_byteaGetData(bas, &size);
- da_locs = l_dnaaGetDna(daa_locs, i, L_CLONE); /* locs on this page */
- na_objs = numaaGetNuma(naa_objs, i, L_CLONE); /* obj # on this page */
- nobj = l_dnaGetCount(da_locs) - 1;
- da_sizes = l_dnaDiffAdjValues(da_locs); /* object sizes on this page */
- sizes = l_dnaGetIArray(da_sizes);
- locs = l_dnaGetIArray(da_locs);
- if (i == 0) {
- l_byteaAppendData(bad, pdfdata, sizes[0]);
- l_byteaAppendData(bad, pdfdata + locs[1], sizes[1]);
- l_byteaAppendData(bad, pdfdata + locs[2], sizes[2]);
- l_byteaAppendString(bad, str_pages);
- for (j = 0; j < 4; j++)
- l_dnaAddNumber(da_outlocs, locs[j]);
- }
- for (j = 4; j < nobj; j++) {
- l_dnaAddNumber(da_outlocs, l_byteaGetSize(bad));
- bat1 = l_byteaInitFromMem(pdfdata + locs[j], sizes[j]);
- bat2 = substituteObjectNumbers(bat1, na_objs);
- data = l_byteaGetData(bat2, &size);
- l_byteaAppendData(bad, data, size);
- l_byteaDestroy(&bat1);
- l_byteaDestroy(&bat2);
- }
- if (i == npages - 1) /* last one */
- l_dnaAddNumber(da_outlocs, l_byteaGetSize(bad));
- LEPT_FREE(sizes);
- LEPT_FREE(locs);
- l_dnaDestroy(&da_locs);
- numaDestroy(&na_objs);
- l_dnaDestroy(&da_sizes);
- }
-
- /* Add the trailer */
- str_trailer = makeTrailerStringPdf(da_outlocs);
- l_byteaAppendString(bad, str_trailer);
-
- /* Transfer the output data */
- *pdata = l_byteaCopyData(bad, pnbytes);
- l_byteaDestroy(&bad);
-
-#if DEBUG_MULTIPAGE
- lept_stderr("******** object mapper **********");
- numaaWriteStream(stderr, naa_objs);
-
- lept_stderr("******** Page object numbers ***********");
- numaWriteStderr(napage);
-
- lept_stderr("******** Pages object ***********\n");
- lept_stderr("%s\n", str_pages);
-#endif /* DEBUG_MULTIPAGE */
-
- numaDestroy(&napage);
- numaaDestroy(&naa_objs);
- l_dnaDestroy(&da_outlocs);
- l_dnaaDestroy(&daa_locs);
- LEPT_FREE(str_pages);
- LEPT_FREE(str_trailer);
- return 0;
-}
-
-
-/*---------------------------------------------------------------------*
- * Convert tiff multipage to pdf file *
- *---------------------------------------------------------------------*/
-/*!
- * \brief convertTiffMultipageToPdf()
- *
- * \param[in] filein (tiff)
- * \param[in] fileout (pdf)
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) A multipage tiff file can also be converted to PS, using
- * convertTiffMultipageToPS()
- *
- */
-l_ok
-convertTiffMultipageToPdf(const char *filein,
- const char *fileout)
-{
-l_int32 istiff;
-PIXA *pixa;
-FILE *fp;
-
- PROCNAME("convertTiffMultipageToPdf");
-
- if ((fp = fopenReadStream(filein)) == NULL)
- return ERROR_INT("file not found", procName, 1);
- istiff = fileFormatIsTiff(fp);
- fclose(fp);
- if (!istiff)
- return ERROR_INT("file not tiff format", procName, 1);
-
- pixa = pixaReadMultipageTiff(filein);
- pixaConvertToPdf(pixa, 0, 1.0, 0, 0, "weasel2", fileout);
- pixaDestroy(&pixa);
- return 0;
-}
-
-
-/*---------------------------------------------------------------------*
- * Low-level CID-based operations *
- *---------------------------------------------------------------------*/
-/*!
- * \brief l_generateCIDataForPdf()
- *
- * \param[in] fname [optional] can be null
- * \param[in] pix [optional] can be null
- * \param[in] quality for jpeg if transcoded: 1-100; 0 for default (75)
- * for jp2k if transcoded: 27-45; 0 for default (34)
- * \param[out] pcid compressed data
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) You must set either filename or pix.
- * (2) Given an image file and optionally a pix raster of that data,
- * this provides a CID that is compatible with PDF, preferably
- * without transcoding.
- * (3) The pix is included for efficiency, in case transcoding
- * is required and the pix is available to the caller.
- * (4) We don't try to open files named "stdin" or "-" for Tesseract
- * compatibility reasons. We may remove this restriction
- * in the future.
- *
- */
-l_ok
-l_generateCIDataForPdf(const char *fname,
- PIX *pix,
- l_int32 quality,
- L_COMP_DATA **pcid)
-{
-l_int32 format, type;
-L_COMP_DATA *cid;
-PIX *pixt;
-
- PROCNAME("l_generateCIDataForPdf");
-
- if (!pcid)
- return ERROR_INT("&cid not defined", procName, 1);
- *pcid = cid = NULL;
- if (!fname && !pix)
- return ERROR_INT("neither fname nor pix are defined", procName, 1);
-
- /* If a compressed file is given that is not 'stdin', see if we
- * can generate the pdf output without transcoding. */
- if (fname && strcmp(fname, "-") != 0 && strcmp(fname, "stdin") != 0) {
- findFileFormat(fname, &format);
- if (format == IFF_UNKNOWN)
- L_WARNING("file %s format is unknown\n", procName, fname);
- if (format == IFF_PS || format == IFF_LPDF) {
- L_ERROR("file %s is unsupported format %d\n",
- procName, fname, format);
- return 1;
- }
- if (format == IFF_JFIF_JPEG) {
- cid = l_generateJpegData(fname, 0);
- } else if (format == IFF_JP2) {
- cid = l_generateJp2kData(fname);
- } else if (format == IFF_PNG) {
- cid = l_generateFlateDataPdf(fname, pix);
- }
-
- }
-
- /* Otherwise, use the pix to generate the pdf output */
- if (!cid) {
- if (!pix)
- pixt = pixRead(fname);
- else
- pixt = pixClone(pix);
- if (!pixt)
- return ERROR_INT("pixt not made", procName, 1);
- if (selectDefaultPdfEncoding(pixt, &type)) {
- pixDestroy(&pixt);
- return 1;
- }
- pixGenerateCIData(pixt, type, quality, 0, &cid);
- pixDestroy(&pixt);
- }
- if (!cid) {
- L_ERROR("totally kerflummoxed\n", procName);
- return 1;
- }
- *pcid = cid;
- return 0;
-}
-
-
-/*!
- * \brief l_generateFlateDataPdf()
- *
- * \param[in] fname preferably png
- * \param[in] pixs [optional] can be null
- * \return cid containing png data, or NULL on error
- *
- *
- * Notes:
- * (1) If you hand this a png file, you are going to get
- * png predictors embedded in the flate data. So it has
- * come to this. http://xkcd.com/1022/
- * (2) Exception: if the png is interlaced or if it is RGBA,
- * it will be transcoded.
- * (3) If transcoding is required, this will not have to read from
- * file if you also input a pix.
- *
- */
-L_COMP_DATA *
-l_generateFlateDataPdf(const char *fname,
- PIX *pixs)
-{
-l_uint8 *pngcomp = NULL; /* entire PNG compressed file */
-l_uint8 *datacomp = NULL; /* gzipped raster data */
-l_uint8 *cmapdata = NULL; /* uncompressed colormap */
-char *cmapdatahex = NULL; /* hex ascii uncompressed colormap */
-l_uint32 i, j, n;
-l_int32 format, interlaced;
-l_int32 ncolors; /* in colormap */
-l_int32 bps; /* bits/sample: usually 8 */
-l_int32 spp; /* samples/pixel: 1-grayscale/cmap); 3-rgb; 4-rgba */
-l_int32 w, h, cmapflag;
-l_int32 xres, yres;
-size_t nbytescomp = 0, nbytespng = 0;
-FILE *fp;
-L_COMP_DATA *cid;
-PIX *pix;
-PIXCMAP *cmap = NULL;
-
- PROCNAME("l_generateFlateDataPdf");
-
- if (!fname)
- return (L_COMP_DATA *)ERROR_PTR("fname not defined", procName, NULL);
-
- findFileFormat(fname, &format);
- spp = 0; /* init to spp != 4 if not png */
- interlaced = 0; /* initialize to no interlacing */
- bps = 0; /* initialize to a nonsense value */
- if (format == IFF_PNG) {
- isPngInterlaced(fname, &interlaced);
- if (readHeaderPng(fname, NULL, NULL, &bps, &spp, NULL))
- return (L_COMP_DATA *)ERROR_PTR("bad png input", procName, NULL);
- }
-
- /* PDF is capable of inlining some types of PNG files, but not all
- of them. We need to transcode anything with interlacing, an
- alpha channel, or 1 bpp (which would otherwise be photo-inverted).
-
- Be careful with spp. Any PNG image file with an alpha
- channel is converted on reading to RGBA (spp == 4). This
- includes the (gray + alpha) format with spp == 2. You
- will get different results if you look at spp via
- readHeaderPng() versus pixGetSpp() */
- if (format != IFF_PNG || interlaced || bps == 1 || spp == 4 || spp == 2) {
- if (!pixs)
- pix = pixRead(fname);
- else
- pix = pixClone(pixs);
- if (!pix)
- return (L_COMP_DATA *)ERROR_PTR("pix not made", procName, NULL);
- cid = pixGenerateFlateData(pix, 0);
- pixDestroy(&pix);
- return cid;
- }
-
- /* It's png. Generate the pdf data without transcoding.
- * Implementation by Jeff Breidenbach.
- * First, read the metadata */
- if ((fp = fopenReadStream(fname)) == NULL)
- return (L_COMP_DATA *)ERROR_PTR("stream not opened", procName, NULL);
- freadHeaderPng(fp, &w, &h, &bps, &spp, &cmapflag);
- fgetPngResolution(fp, &xres, &yres);
- fclose(fp);
-
- /* We get pdf corruption when inlining the data from 16 bpp png. */
- if (bps == 16)
- return l_generateFlateData(fname, 0);
-
- /* Read the entire png file */
- if ((pngcomp = l_binaryRead(fname, &nbytespng)) == NULL)
- return (L_COMP_DATA *)ERROR_PTR("unable to read file",
- procName, NULL);
-
- /* Extract flate data, copying portions of it to memory, including
- * the predictor information in a byte at the beginning of each
- * raster line. The flate data makes up the vast majority of
- * the png file, so after extraction we expect datacomp to
- * be nearly full (i.e., nbytescomp will be only slightly less
- * than nbytespng). Also extract the colormap if present. */
- if ((datacomp = (l_uint8 *)LEPT_CALLOC(1, nbytespng)) == NULL) {
- LEPT_FREE(pngcomp);
- return (L_COMP_DATA *)ERROR_PTR("unable to allocate memory",
- procName, NULL);
- }
-
- /* Parse the png file. Each chunk consists of:
- * length: 4 bytes
- * name: 4 bytes (e.g., "IDAT")
- * data: n bytes
- * CRC: 4 bytes
- * Start at the beginning of the data section of the first chunk,
- * byte 16, because the png file begins with 8 bytes of header,
- * followed by the first 8 bytes of the first chunk
- * (length and name). On each loop, increment by 12 bytes to
- * skip over the CRC, length and name of the next chunk. */
- for (i = 16; i < nbytespng; i += 12) { /* do each successive chunk */
- /* Get the chunk length */
- n = pngcomp[i - 8] << 24;
- n += pngcomp[i - 7] << 16;
- n += pngcomp[i - 6] << 8;
- n += pngcomp[i - 5] << 0;
- if (n >= nbytespng - i) { /* "n + i" can overflow */
- LEPT_FREE(pngcomp);
- LEPT_FREE(datacomp);
- pixcmapDestroy(&cmap);
- L_ERROR("invalid png: i = %d, n = %d, nbytes = %zu\n", procName,
- i, n, nbytespng);
- return NULL;
- }
-
- /* Is it a data chunk? */
- if (memcmp(pngcomp + i - 4, "IDAT", 4) == 0) {
- memcpy(datacomp + nbytescomp, pngcomp + i, n);
- nbytescomp += n;
- }
-
- /* Is it a palette chunk? */
- if (cmapflag && !cmap &&
- memcmp(pngcomp + i - 4, "PLTE", 4) == 0) {
- if ((n / 3) > (1 << bps)) {
- LEPT_FREE(pngcomp);
- LEPT_FREE(datacomp);
- pixcmapDestroy(&cmap);
- L_ERROR("invalid png: i = %d, n = %d, cmapsize = %d\n",
- procName, i, n, (1 << bps));
- return NULL;
- }
- cmap = pixcmapCreate(bps);
- for (j = i; j < i + n; j += 3) {
- pixcmapAddColor(cmap, pngcomp[j], pngcomp[j + 1],
- pngcomp[j + 2]);
- }
- }
- i += n; /* move to the end of the data chunk */
- }
- LEPT_FREE(pngcomp);
-
- if (nbytescomp == 0) {
- LEPT_FREE(datacomp);
- pixcmapDestroy(&cmap);
- return (L_COMP_DATA *)ERROR_PTR("invalid PNG file", procName, NULL);
- }
-
- /* Extract and encode the colormap data as hexascii */
- ncolors = 0;
- if (cmap) {
- pixcmapSerializeToMemory(cmap, 3, &ncolors, &cmapdata);
- pixcmapDestroy(&cmap);
- if (!cmapdata) {
- LEPT_FREE(datacomp);
- return (L_COMP_DATA *)ERROR_PTR("cmapdata not made",
- procName, NULL);
- }
- cmapdatahex = pixcmapConvertToHex(cmapdata, ncolors);
- LEPT_FREE(cmapdata);
- }
-
- /* Note that this is the only situation where the predictor
- * field of the CID is set to 1. Adobe's predictor values on
- * p. 76 of pdf_reference_1-7.pdf give 1 for no predictor and
- * 10-14 for inline predictors, the specifics of which are
- * ignored by the pdf interpreter, which just needs to know that
- * the first byte on each compressed scanline is some predictor
- * whose type can be inferred from the byte itself. */
- cid = (L_COMP_DATA *)LEPT_CALLOC(1, sizeof(L_COMP_DATA));
- cid->datacomp = datacomp;
- cid->type = L_FLATE_ENCODE;
- cid->cmapdatahex = cmapdatahex;
- cid->nbytescomp = nbytescomp;
- cid->ncolors = ncolors;
- cid->predictor = TRUE;
- cid->w = w;
- cid->h = h;
- cid->bps = bps;
- cid->spp = spp;
- cid->res = xres;
- return cid;
-}
-
-
-/*!
- * \brief l_generateJpegData()
- *
- * \param[in] fname of jpeg file
- * \param[in] ascii85flag 0 for jpeg; 1 for ascii85-encoded jpeg
- * \return cid containing jpeg data, or NULL on error
- *
- *
- * Notes:
- * (1) Set ascii85flag:
- * ~ 0 for binary data (not permitted in PostScript)
- * ~ 1 for ascii85 (5 for 4) encoded binary data
- * (not permitted in pdf)
- * (2) Do not free the data. l_generateJpegDataMem() will free
- * the data if the data is invalid, or if it does not use
- * ascii encoding.
- *
- */
-L_COMP_DATA *
-l_generateJpegData(const char *fname,
- l_int32 ascii85flag)
-{
-l_uint8 *data = NULL;
-size_t nbytes;
-
- PROCNAME("l_generateJpegData");
-
- if (!fname)
- return (L_COMP_DATA *)ERROR_PTR("fname not defined", procName, NULL);
-
- /* The returned jpeg data in memory is the entire jpeg file,
- * which starts with ffd8 and ends with ffd9 */
- if ((data = l_binaryRead(fname, &nbytes)) == NULL)
- return (L_COMP_DATA *)ERROR_PTR("data not extracted", procName, NULL);
-
- return l_generateJpegDataMem(data, nbytes, ascii85flag);
-}
-
-
-/*!
- * \brief l_generateJpegDataMem()
- *
- * \param[in] data of jpeg file
- * \param[in] nbytes of jpeg file
- * \param[in] ascii85flag 0 for jpeg; 1 for ascii85-encoded jpeg
- * \return cid containing jpeg data, or NULL on error
- *
- *
- * Notes:
- * (1) See l_generateJpegData().
- *
- */
-L_COMP_DATA *
-l_generateJpegDataMem(l_uint8 *data,
- size_t nbytes,
- l_int32 ascii85flag)
-{
-char *data85 = NULL; /* ascii85 encoded jpeg compressed file */
-l_int32 w, h, xres, yres, bps, spp;
-l_int32 nbytes85;
-L_COMP_DATA *cid;
-
- PROCNAME("l_generateJpegDataMem");
-
- if (!data)
- return (L_COMP_DATA *)ERROR_PTR("data not defined", procName, NULL);
-
- /* Read the metadata */
- if (readHeaderMemJpeg(data, nbytes, &w, &h, &spp, NULL, NULL)) {
- LEPT_FREE(data);
- return (L_COMP_DATA *)ERROR_PTR("bad jpeg metadata", procName, NULL);
- }
- bps = 8;
- readResolutionMemJpeg(data, nbytes, &xres, &yres);
-
- /* Optionally, encode the compressed data */
- if (ascii85flag == 1) {
- data85 = encodeAscii85(data, nbytes, &nbytes85);
- LEPT_FREE(data);
- if (!data85)
- return (L_COMP_DATA *)ERROR_PTR("data85 not made", procName, NULL);
- else
- data85[nbytes85 - 1] = '\0'; /* remove the newline */
- }
-
- cid = (L_COMP_DATA *)LEPT_CALLOC(1, sizeof(L_COMP_DATA));
- if (ascii85flag == 0) {
- cid->datacomp = data;
- } else { /* ascii85 */
- cid->data85 = data85;
- cid->nbytes85 = nbytes85;
- }
- cid->type = L_JPEG_ENCODE;
- cid->nbytescomp = nbytes;
- cid->w = w;
- cid->h = h;
- cid->bps = bps;
- cid->spp = spp;
- cid->res = xres;
- return cid;
-}
-
-
-/*!
- * \brief l_generateJp2kData()
- *
- * \param[in] fname of jp2k file
- * \return cid containing jp2k data, or NULL on error
- *
- *
- * Notes:
- * (1) This is only called after the file is verified to be jp2k.
- *
- */
-static L_COMP_DATA *
-l_generateJp2kData(const char *fname)
-{
-l_int32 w, h, bps, spp, xres, yres;
-size_t nbytes;
-L_COMP_DATA *cid;
-FILE *fp;
-
- PROCNAME("l_generateJp2kData");
-
- if (!fname)
- return (L_COMP_DATA *)ERROR_PTR("fname not defined", procName, NULL);
-
- if (readHeaderJp2k(fname, &w, &h, &bps, &spp))
- return (L_COMP_DATA *)ERROR_PTR("bad jp2k metadata", procName, NULL);
-
- if ((cid = (L_COMP_DATA *)LEPT_CALLOC(1, sizeof(L_COMP_DATA))) == NULL)
- return (L_COMP_DATA *)ERROR_PTR("cid not made", procName, NULL);
-
- /* The returned jp2k data in memory is the entire jp2k file */
- if ((cid->datacomp = l_binaryRead(fname, &nbytes)) == NULL) {
- l_CIDataDestroy(&cid);
- return (L_COMP_DATA *)ERROR_PTR("data not extracted", procName, NULL);
- }
-
- xres = yres = 0;
- if ((fp = fopenReadStream(fname)) != NULL) {
- fgetJp2kResolution(fp, &xres, &yres);
- fclose(fp);
- }
- cid->type = L_JP2K_ENCODE;
- cid->nbytescomp = nbytes;
- cid->w = w;
- cid->h = h;
- cid->bps = bps;
- cid->spp = spp;
- cid->res = xres;
- return cid;
-}
-
-
-/*!
- * \brief l_generateCIData()
- *
- * \param[in] fname
- * \param[in] type L_G4_ENCODE, L_JPEG_ENCODE, L_FLATE_ENCODE,
- * L_JP2K_ENCODE
- * \param[in] quality for jpeg if transcoded: 1-100; 0 for default (75)
- * for jp2k if transcoded: 27-45; 0 for default (34)
- * \param[in] ascii85 0 for binary; 1 for ascii85-encoded
- * \param[out] pcid compressed data
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This can be used for both PostScript and pdf.
- * (1) Set ascii85:
- * ~ 0 for binary data (not permitted in PostScript)
- * ~ 1 for ascii85 (5 for 4) encoded binary data
- * (2) This attempts to compress according to the requested type.
- * If this can't be done, it falls back to ordinary flate encoding.
- * (3) This differs from l_generateCIDataPdf(), which determines
- * the format and attempts to generate the CID without transcoding.
- *
- */
-l_ok
-l_generateCIData(const char *fname,
- l_int32 type,
- l_int32 quality,
- l_int32 ascii85,
- L_COMP_DATA **pcid)
-{
-l_int32 format, d, bps, spp, iscmap;
-L_COMP_DATA *cid;
-PIX *pix;
-
- PROCNAME("l_generateCIData");
-
- if (!pcid)
- return ERROR_INT("&cid not defined", procName, 1);
- *pcid = NULL;
- if (!fname)
- return ERROR_INT("fname not defined", procName, 1);
- if (type != L_G4_ENCODE && type != L_JPEG_ENCODE &&
- type != L_FLATE_ENCODE && type != L_JP2K_ENCODE)
- return ERROR_INT("invalid conversion type", procName, 1);
- if (ascii85 != 0 && ascii85 != 1)
- return ERROR_INT("invalid ascii85", procName, 1);
-
- /* Sanity check on requested encoding */
- pixReadHeader(fname, &format, NULL, NULL, &bps, &spp, &iscmap);
- d = bps * spp;
- if (d == 24) d = 32;
- if (iscmap && type != L_FLATE_ENCODE) {
- L_WARNING("pixs has cmap; using flate encoding\n", procName);
- type = L_FLATE_ENCODE;
- } else if (d < 8 && type == L_JPEG_ENCODE) {
- L_WARNING("pixs has < 8 bpp; using flate encoding\n", procName);
- type = L_FLATE_ENCODE;
- } else if (d < 8 && type == L_JP2K_ENCODE) {
- L_WARNING("pixs has < 8 bpp; using flate encoding\n", procName);
- type = L_FLATE_ENCODE;
- } else if (d > 1 && type == L_G4_ENCODE) {
- L_WARNING("pixs has > 1 bpp; using flate encoding\n", procName);
- type = L_FLATE_ENCODE;
- }
-
- if (type == L_JPEG_ENCODE) {
- if (format == IFF_JFIF_JPEG) { /* do not transcode */
- cid = l_generateJpegData(fname, ascii85);
- } else {
- if ((pix = pixRead(fname)) == NULL)
- return ERROR_INT("pix not returned", procName, 1);
- cid = pixGenerateJpegData(pix, ascii85, quality);
- pixDestroy(&pix);
- }
- if (!cid)
- return ERROR_INT("jpeg data not made", procName, 1);
- } else if (type == L_JP2K_ENCODE) {
- if (format == IFF_JP2) { /* do not transcode */
- cid = l_generateJp2kData(fname);
- } else {
- if ((pix = pixRead(fname)) == NULL)
- return ERROR_INT("pix not returned", procName, 1);
- cid = pixGenerateJp2kData(pix, quality);
- pixDestroy(&pix);
- }
- if (!cid)
- return ERROR_INT("jp2k data not made", procName, 1);
- } else if (type == L_G4_ENCODE) {
- if ((cid = l_generateG4Data(fname, ascii85)) == NULL)
- return ERROR_INT("g4 data not made", procName, 1);
- } else if (type == L_FLATE_ENCODE) {
- if ((cid = l_generateFlateData(fname, ascii85)) == NULL)
- return ERROR_INT("flate data not made", procName, 1);
- } else {
- return ERROR_INT("invalid conversion type", procName, 1);
- }
- *pcid = cid;
-
- return 0;
-}
-
-
-/*!
- * \brief pixGenerateCIData()
- *
- * \param[in] pixs 8 or 32 bpp, no colormap
- * \param[in] type L_G4_ENCODE, L_JPEG_ENCODE, L_FLATE_ENCODE or
- * L_JP2K_ENCODE
- * \param[in] quality for jpeg if transcoded: 1-100; 0 for default (75)
- * for jp2k if transcoded: 27-45; 0 for default (34)
- * \param[in] ascii85 0 for binary; 1 for ascii85-encoded
- * \param[out] pcid compressed data
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) Set ascii85:
- * ~ 0 for binary data (not permitted in PostScript)
- * ~ 1 for ascii85 (5 for 4) encoded binary data
- *
- */
-l_ok
-pixGenerateCIData(PIX *pixs,
- l_int32 type,
- l_int32 quality,
- l_int32 ascii85,
- L_COMP_DATA **pcid)
-{
-l_int32 d;
-PIXCMAP *cmap;
-
- PROCNAME("pixGenerateCIData");
-
- if (!pcid)
- return ERROR_INT("&cid not defined", procName, 1);
- *pcid = NULL;
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
- if (type != L_G4_ENCODE && type != L_JPEG_ENCODE &&
- type != L_FLATE_ENCODE && type != L_JP2K_ENCODE) {
- selectDefaultPdfEncoding(pixs, &type);
- }
- if (ascii85 != 0 && ascii85 != 1)
- return ERROR_INT("invalid ascii85", procName, 1);
-
- /* Conditionally modify the encoding type if libz is
- * available and the requested library is missing. */
-#if defined(HAVE_LIBZ)
-# if !defined(HAVE_LIBJPEG)
- if (type == L_JPEG_ENCODE) {
- L_WARNING("no libjpeg; using flate encoding\n", procName);
- type = L_FLATE_ENCODE;
- }
-# endif /* !defined(HAVE_LIBJPEG) */
-# if !defined(HAVE_LIBJP2K)
- if (type == L_JP2K_ENCODE) {
- L_WARNING("no libjp2k; using flate encoding\n", procName);
- type = L_FLATE_ENCODE;
- }
-# endif /* !defined(HAVE_LIBJP2K) */
-# if !defined(HAVE_LIBTIFF)
- if (type == L_G4_ENCODE) {
- L_WARNING("no libtiff; using flate encoding\n", procName);
- type = L_FLATE_ENCODE;
- }
-# endif /* !defined(HAVE_LIBTIFF) */
-#endif /* defined(HAVE_LIBZ) */
-
- /* Sanity check on requested encoding */
- d = pixGetDepth(pixs);
- cmap = pixGetColormap(pixs);
- if (cmap && type != L_FLATE_ENCODE) {
- L_WARNING("pixs has cmap; using flate encoding\n", procName);
- type = L_FLATE_ENCODE;
- } else if (d < 8 && (type == L_JPEG_ENCODE || type == L_JP2K_ENCODE)) {
- L_WARNING("pixs has < 8 bpp; using flate encoding\n", procName);
- type = L_FLATE_ENCODE;
- } else if (d > 1 && type == L_G4_ENCODE) {
- L_WARNING("pixs has > 1 bpp; using flate encoding\n", procName);
- type = L_FLATE_ENCODE;
- }
-
- if (type == L_JPEG_ENCODE) {
- if ((*pcid = pixGenerateJpegData(pixs, ascii85, quality)) == NULL)
- return ERROR_INT("jpeg data not made", procName, 1);
- } else if (type == L_JP2K_ENCODE) {
- if ((*pcid = pixGenerateJp2kData(pixs, quality)) == NULL)
- return ERROR_INT("jp2k data not made", procName, 1);
- } else if (type == L_G4_ENCODE) {
- if ((*pcid = pixGenerateG4Data(pixs, ascii85)) == NULL)
- return ERROR_INT("g4 data not made", procName, 1);
- } else { /* type == L_FLATE_ENCODE */
- if ((*pcid = pixGenerateFlateData(pixs, ascii85)) == NULL)
- return ERROR_INT("flate data not made", procName, 1);
- }
- return 0;
-}
-
-
-/*!
- * \brief l_generateFlateData()
- *
- * \param[in] fname
- * \param[in] ascii85flag 0 for gzipped; 1 for ascii85-encoded gzipped
- * \return cid flate compressed image data, or NULL on error
- *
- *
- * Notes:
- * (1) The input image is converted to one of these 4 types:
- * ~ 1 bpp
- * ~ 8 bpp, no colormap
- * ~ 8 bpp, colormap
- * ~ 32 bpp rgb
- * (2) Set ascii85flag:
- * ~ 0 for binary data (not permitted in PostScript)
- * ~ 1 for ascii85 (5 for 4) encoded binary data
- *
- */
-L_COMP_DATA *
-l_generateFlateData(const char *fname,
- l_int32 ascii85flag)
-{
-L_COMP_DATA *cid;
-PIX *pixs;
-
- PROCNAME("l_generateFlateData");
-
- if (!fname)
- return (L_COMP_DATA *)ERROR_PTR("fname not defined", procName, NULL);
-
- if ((pixs = pixRead(fname)) == NULL)
- return (L_COMP_DATA *)ERROR_PTR("pixs not made", procName, NULL);
- cid = pixGenerateFlateData(pixs, ascii85flag);
- pixDestroy(&pixs);
- return cid;
-}
-
-
-/*!
- * \brief pixGenerateFlateData()
- *
- * \param[in] pixs
- * \param[in] ascii85flag 0 for gzipped; 1 for ascii85-encoded gzipped
- * \return cid flate compressed image data, or NULL on error
- *
- *
- * Notes:
- * (1) If called with an RGBA pix (spp == 4), the alpha channel
- * will be removed, projecting a white backgrouond through
- * any transparency.
- * (2) If called with a colormapped pix, any transparency in the
- * alpha component in the colormap will be ignored, as it is
- * for all leptonica operations on colormapped pix.
- *
- */
-static L_COMP_DATA *
-pixGenerateFlateData(PIX *pixs,
- l_int32 ascii85flag)
-{
-l_uint8 *data = NULL; /* uncompressed raster data in required format */
-l_uint8 *datacomp = NULL; /* gzipped raster data */
-char *data85 = NULL; /* ascii85 encoded gzipped raster data */
-l_uint8 *cmapdata = NULL; /* uncompressed colormap */
-char *cmapdata85 = NULL; /* ascii85 encoded uncompressed colormap */
-char *cmapdatahex = NULL; /* hex ascii uncompressed colormap */
-l_int32 ncolors; /* in colormap; not used if cmapdata85 is null */
-l_int32 bps; /* bits/sample: usually 8 */
-l_int32 spp; /* samples/pixel: 1-grayscale/cmap); 3-rgb */
-l_int32 w, h, d, cmapflag;
-l_int32 ncmapbytes85 = 0;
-l_int32 nbytes85 = 0;
-size_t nbytes, nbytescomp;
-L_COMP_DATA *cid;
-PIX *pixt;
-PIXCMAP *cmap;
-
- PROCNAME("pixGenerateFlateData");
-
- if (!pixs)
- return (L_COMP_DATA *)ERROR_PTR("pixs not defined", procName, NULL);
-
- /* Convert the image to one of these 4 types:
- * 1 bpp
- * 8 bpp, no colormap
- * 8 bpp, colormap
- * 32 bpp rgb */
- pixGetDimensions(pixs, &w, &h, &d);
- cmap = pixGetColormap(pixs);
- cmapflag = (cmap) ? 1 : 0;
- if (d == 2 || d == 4 || d == 16) {
- pixt = pixConvertTo8(pixs, cmapflag);
- cmap = pixGetColormap(pixt);
- d = pixGetDepth(pixt);
- } else if (d == 32 && pixGetSpp(pixs) == 4) { /* remove alpha */
- pixt = pixAlphaBlendUniform(pixs, 0xffffff00);
- } else {
- pixt = pixClone(pixs);
- }
- spp = (d == 32) ? 3 : 1;
- bps = (d == 32) ? 8 : d;
-
- /* Extract and encode the colormap data as both ascii85 and hexascii */
- ncolors = 0;
- if (cmap) {
- pixcmapSerializeToMemory(cmap, 3, &ncolors, &cmapdata);
- if (!cmapdata) {
- pixDestroy(&pixt);
- return (L_COMP_DATA *)ERROR_PTR("cmapdata not made",
- procName, NULL);
- }
-
- cmapdata85 = encodeAscii85(cmapdata, 3 * ncolors, &ncmapbytes85);
- cmapdatahex = pixcmapConvertToHex(cmapdata, ncolors);
- LEPT_FREE(cmapdata);
- }
-
- /* Extract and compress the raster data */
- pixGetRasterData(pixt, &data, &nbytes);
- pixDestroy(&pixt);
- datacomp = zlibCompress(data, nbytes, &nbytescomp);
- LEPT_FREE(data);
- if (!datacomp) {
- LEPT_FREE(cmapdata85);
- LEPT_FREE(cmapdatahex);
- return (L_COMP_DATA *)ERROR_PTR("datacomp not made", procName, NULL);
- }
-
- /* Optionally, encode the compressed data */
- if (ascii85flag == 1) {
- data85 = encodeAscii85(datacomp, nbytescomp, &nbytes85);
- LEPT_FREE(datacomp);
- if (!data85) {
- LEPT_FREE(cmapdata85);
- LEPT_FREE(cmapdatahex);
- return (L_COMP_DATA *)ERROR_PTR("data85 not made", procName, NULL);
- } else {
- data85[nbytes85 - 1] = '\0'; /* remove the newline */
- }
- }
-
- cid = (L_COMP_DATA *)LEPT_CALLOC(1, sizeof(L_COMP_DATA));
- if (ascii85flag == 0) {
- cid->datacomp = datacomp;
- } else { /* ascii85 */
- cid->data85 = data85;
- cid->nbytes85 = nbytes85;
- }
- cid->type = L_FLATE_ENCODE;
- cid->cmapdatahex = cmapdatahex;
- cid->cmapdata85 = cmapdata85;
- cid->nbytescomp = nbytescomp;
- cid->ncolors = ncolors;
- cid->w = w;
- cid->h = h;
- cid->bps = bps;
- cid->spp = spp;
- cid->res = pixGetXRes(pixs);
- cid->nbytes = nbytes; /* only for debugging */
- return cid;
-}
-
-
-/*!
- * \brief pixGenerateJpegData()
- *
- * \param[in] pixs 8 or 32 bpp, no colormap
- * \param[in] ascii85flag 0 for jpeg; 1 for ascii85-encoded jpeg
- * \param[in] quality 0 for default, which is 75
- * \return cid jpeg compressed data, or NULL on error
- *
- *
- * Notes:
- * (1) Set ascii85flag:
- * ~ 0 for binary data (not permitted in PostScript)
- * ~ 1 for ascii85 (5 for 4) encoded binary data
- *
- */
-static L_COMP_DATA *
-pixGenerateJpegData(PIX *pixs,
- l_int32 ascii85flag,
- l_int32 quality)
-{
-l_int32 d;
-char *fname;
-L_COMP_DATA *cid;
-
- PROCNAME("pixGenerateJpegData");
-
- if (!pixs)
- return (L_COMP_DATA *)ERROR_PTR("pixs not defined", procName, NULL);
- if (pixGetColormap(pixs))
- return (L_COMP_DATA *)ERROR_PTR("pixs has colormap", procName, NULL);
- d = pixGetDepth(pixs);
- if (d != 8 && d != 32)
- return (L_COMP_DATA *)ERROR_PTR("pixs not 8 or 32 bpp", procName, NULL);
-
- /* Compress to a temp jpeg file */
- fname = l_makeTempFilename();
- if (pixWriteJpeg(fname, pixs, quality, 0)) {
- LEPT_FREE(fname);
- return NULL;
- }
-
- /* Generate the data */
- cid = l_generateJpegData(fname, ascii85flag);
- if (lept_rmfile(fname) != 0)
- L_ERROR("temp file %s was not deleted\n", procName, fname);
- LEPT_FREE(fname);
- return cid;
-}
-
-
-/*!
- * \brief pixGenerateJp2kData()
- *
- * \param[in] pixs 8 or 32 bpp, no colormap
- * \param[in] quality 0 for default, which is 34
- * \return cid jp2k compressed data, or NULL on error
- *
- *
- * Notes:
- * (1) The quality can be set between 27 (very poor) and 45
- * (nearly perfect). Use 0 for default (34). Use 100 for lossless,
- * but this is very expensive and not recommended.
- *
- */
-static L_COMP_DATA *
-pixGenerateJp2kData(PIX *pixs,
- l_int32 quality)
-{
-l_int32 d;
-char *fname;
-L_COMP_DATA *cid;
-
- PROCNAME("pixGenerateJp2kData");
-
- if (!pixs)
- return (L_COMP_DATA *)ERROR_PTR("pixs not defined", procName, NULL);
- if (pixGetColormap(pixs))
- return (L_COMP_DATA *)ERROR_PTR("pixs has colormap", procName, NULL);
- d = pixGetDepth(pixs);
- if (d != 8 && d != 32)
- return (L_COMP_DATA *)ERROR_PTR("pixs not 8 or 32 bpp", procName, NULL);
-
- /* Compress to a temp jp2k file */
- fname = l_makeTempFilename();
- if (pixWriteJp2k(fname, pixs, quality, 5, 0, 0)) {
- LEPT_FREE(fname);
- return NULL;
- }
-
- /* Generate the data */
- cid = l_generateJp2kData(fname);
- if (lept_rmfile(fname) != 0)
- L_ERROR("temp file %s was not deleted\n", procName, fname);
- LEPT_FREE(fname);
- return cid;
-}
-
-
-/*!
- * \brief pixGenerateG4Data()
- *
- * \param[in] pixs 1 bpp
- * \param[in] ascii85flag 0 for gzipped; 1 for ascii85-encoded gzipped
- * \return cid g4 compressed image data, or NULL on error
- *
- *
- * Notes:
- * (1) Set ascii85flag:
- * ~ 0 for binary data (not permitted in PostScript)
- * ~ 1 for ascii85 (5 for 4) encoded binary data
- *
- */
-static L_COMP_DATA *
-pixGenerateG4Data(PIX *pixs,
- l_int32 ascii85flag)
-{
-char *fname;
-L_COMP_DATA *cid;
-
- PROCNAME("pixGenerateG4Data");
-
- if (!pixs)
- return (L_COMP_DATA *)ERROR_PTR("pixs not defined", procName, NULL);
- if (pixGetDepth(pixs) != 1)
- return (L_COMP_DATA *)ERROR_PTR("pixs not 1 bpp", procName, NULL);
-
- /* Compress to a temp tiff g4 file */
- fname = l_makeTempFilename();
- if (pixWrite(fname, pixs, IFF_TIFF_G4)) {
- LEPT_FREE(fname);
- return NULL;
- }
-
- cid = l_generateG4Data(fname, ascii85flag);
- if (lept_rmfile(fname) != 0)
- L_ERROR("temp file %s was not deleted\n", procName, fname);
- LEPT_FREE(fname);
- return cid;
-}
-
-
-/*!
- * \brief l_generateG4Data()
- *
- * \param[in] fname of g4 compressed file
- * \param[in] ascii85flag 0 for g4 compressed; 1 for ascii85-encoded g4
- * \return cid g4 compressed image data, or NULL on error
- *
- *
- * Notes:
- * (1) Set ascii85flag:
- * ~ 0 for binary data (not permitted in PostScript)
- * ~ 1 for ascii85 (5 for 4) encoded binary data
- * (not permitted in pdf)
- *
- */
-L_COMP_DATA *
-l_generateG4Data(const char *fname,
- l_int32 ascii85flag)
-{
-l_uint8 *datacomp = NULL; /* g4 compressed raster data */
-char *data85 = NULL; /* ascii85 encoded g4 compressed data */
-l_int32 w, h, xres, yres;
-l_int32 minisblack; /* TRUE or FALSE */
-l_int32 nbytes85;
-size_t nbytescomp;
-L_COMP_DATA *cid;
-FILE *fp;
-
- PROCNAME("l_generateG4Data");
-
- if (!fname)
- return (L_COMP_DATA *)ERROR_PTR("fname not defined", procName, NULL);
-
- /* Read the resolution */
- if ((fp = fopenReadStream(fname)) == NULL)
- return (L_COMP_DATA *)ERROR_PTR("stream not opened", procName, NULL);
- getTiffResolution(fp, &xres, &yres);
- fclose(fp);
-
- /* The returned ccitt g4 data in memory is the block of
- * bytes in the tiff file, starting after 8 bytes and
- * ending before the directory. */
- if (extractG4DataFromFile(fname, &datacomp, &nbytescomp,
- &w, &h, &minisblack)) {
- return (L_COMP_DATA *)ERROR_PTR("datacomp not extracted",
- procName, NULL);
- }
-
- /* Optionally, encode the compressed data */
- if (ascii85flag == 1) {
- data85 = encodeAscii85(datacomp, nbytescomp, &nbytes85);
- LEPT_FREE(datacomp);
- if (!data85)
- return (L_COMP_DATA *)ERROR_PTR("data85 not made", procName, NULL);
- else
- data85[nbytes85 - 1] = '\0'; /* remove the newline */
- }
-
- cid = (L_COMP_DATA *)LEPT_CALLOC(1, sizeof(L_COMP_DATA));
- if (ascii85flag == 0) {
- cid->datacomp = datacomp;
- } else { /* ascii85 */
- cid->data85 = data85;
- cid->nbytes85 = nbytes85;
- }
- cid->type = L_G4_ENCODE;
- cid->nbytescomp = nbytescomp;
- cid->w = w;
- cid->h = h;
- cid->bps = 1;
- cid->spp = 1;
- cid->minisblack = minisblack;
- cid->res = xres;
- return cid;
-}
-
-
-/*!
- * \brief cidConvertToPdfData()
- *
- * \param[in] cid compressed image data
- * \param[in] title [optional] pdf title; can be NULL
- * \param[out] pdata output pdf data for image
- * \param[out] pnbytes size of output pdf data
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) Caller must not destroy the cid. It is absorbed in the
- * lpd and destroyed by this function.
- *
- */
-l_ok
-cidConvertToPdfData(L_COMP_DATA *cid,
- const char *title,
- l_uint8 **pdata,
- size_t *pnbytes)
-{
-l_int32 res, ret;
-l_float32 wpt, hpt;
-L_PDF_DATA *lpd = NULL;
-
- PROCNAME("cidConvertToPdfData");
-
- if (!pdata || !pnbytes)
- return ERROR_INT("&data and &nbytes not both defined", procName, 1);
- *pdata = NULL;
- *pnbytes = 0;
- if (!cid)
- return ERROR_INT("cid not defined", procName, 1);
-
- /* Get media box parameters, in pts */
- res = cid->res;
- if (res <= 0)
- res = DefaultInputRes;
- wpt = cid->w * 72. / res;
- hpt = cid->h * 72. / res;
-
- /* Set up the pdf data struct (lpd) */
- if ((lpd = pdfdataCreate(title)) == NULL)
- return ERROR_INT("lpd not made", procName, 1);
- ptraAdd(lpd->cida, cid);
- lpd->n++;
- ptaAddPt(lpd->xy, 0, 0); /* xpt = ypt = 0 */
- ptaAddPt(lpd->wh, wpt, hpt);
-
- /* Generate the pdf string and destroy the lpd */
- ret = l_generatePdf(pdata, pnbytes, lpd);
- pdfdataDestroy(&lpd);
- if (ret)
- return ERROR_INT("pdf output not made", procName, 1);
- return 0;
-}
-
-
-/*!
- * \brief l_CIDataDestroy()
- *
- * \param[in,out] pcid will be set to null before returning
- * \return void
- */
-void
-l_CIDataDestroy(L_COMP_DATA **pcid)
-{
-L_COMP_DATA *cid;
-
- PROCNAME("l_CIDataDestroy");
-
- if (pcid == NULL) {
- L_WARNING("ptr address is null!\n", procName);
- return;
- }
- if ((cid = *pcid) == NULL)
- return;
-
- if (cid->datacomp) LEPT_FREE(cid->datacomp);
- if (cid->data85) LEPT_FREE(cid->data85);
- if (cid->cmapdata85) LEPT_FREE(cid->cmapdata85);
- if (cid->cmapdatahex) LEPT_FREE(cid->cmapdatahex);
- LEPT_FREE(cid);
- *pcid = NULL;
- return;
-}
-
-
-/*---------------------------------------------------------------------*
- * Helper functions for generating the output pdf string *
- *---------------------------------------------------------------------*/
-/*!
- * \brief l_generatePdf()
- *
- * \param[out] pdata pdf array
- * \param[out] pnbytes number of bytes in pdf array
- * \param[in] lpd all the required input image data
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) On error, no data is returned.
- * (2) The objects are:
- * 1: Catalog
- * 2: Info
- * 3: Pages
- * 4: Page
- * 5: Contents (rendering command)
- * 6 to 6+n-1: n XObjects
- * 6+n to 6+n+m-1: m colormaps
- *
- */
-static l_int32
-l_generatePdf(l_uint8 **pdata,
- size_t *pnbytes,
- L_PDF_DATA *lpd)
-{
- PROCNAME("l_generatePdf");
-
- if (!pdata)
- return ERROR_INT("&data not defined", procName, 1);
- *pdata = NULL;
- if (!pnbytes)
- return ERROR_INT("&nbytes not defined", procName, 1);
- *pnbytes = 0;
- if (!lpd)
- return ERROR_INT("lpd not defined", procName, 1);
-
- generateFixedStringsPdf(lpd);
- generateMediaboxPdf(lpd);
- generatePageStringPdf(lpd);
- generateContentStringPdf(lpd);
- generatePreXStringsPdf(lpd);
- generateColormapStringsPdf(lpd);
- generateTrailerPdf(lpd);
- return generateOutputDataPdf(pdata, pnbytes, lpd);
-}
-
-
-static void
-generateFixedStringsPdf(L_PDF_DATA *lpd)
-{
-char buf[L_SMALLBUF];
-char *version, *datestr;
-SARRAY *sa;
-
- PROCNAME("generateFixedStringsPdf");
-
- /* Accumulate data for the header and objects 1-3 */
- lpd->id = stringNew("%PDF-1.5\n");
- l_dnaAddNumber(lpd->objsize, strlen(lpd->id));
-
- lpd->obj1 = stringNew("1 0 obj\n"
- "<<\n"
- "/Type /Catalog\n"
- "/Pages 3 0 R\n"
- ">>\n"
- "endobj\n");
- l_dnaAddNumber(lpd->objsize, strlen(lpd->obj1));
-
- sa = sarrayCreate(0);
- sarrayAddString(sa, "2 0 obj\n"
- "<<\n", L_COPY);
- if (var_WRITE_DATE_AND_VERSION) {
- datestr = l_getFormattedDate();
- snprintf(buf, sizeof(buf), "/CreationDate (D:%s)\n", datestr);
- sarrayAddString(sa, buf, L_COPY);
- LEPT_FREE(datestr);
- version = getLeptonicaVersion();
- snprintf(buf, sizeof(buf),
- "/Producer (leptonica: %s)\n", version);
- LEPT_FREE(version);
- } else {
- snprintf(buf, sizeof(buf), "/Producer (leptonica)\n");
- }
- sarrayAddString(sa, buf, L_COPY);
- if (lpd->title) {
- char *hexstr;
- if ((hexstr = generateEscapeString(lpd->title)) != NULL) {
- snprintf(buf, sizeof(buf), "/Title %s\n", hexstr);
- sarrayAddString(sa, buf, L_COPY);
- } else {
- L_ERROR("title string is not ascii\n", procName);
- }
- LEPT_FREE(hexstr);
- }
- sarrayAddString(sa, ">>\n"
- "endobj\n", L_COPY);
- lpd->obj2 = sarrayToString(sa, 0);
- l_dnaAddNumber(lpd->objsize, strlen(lpd->obj2));
- sarrayDestroy(&sa);
-
- lpd->obj3 = stringNew("3 0 obj\n"
- "<<\n"
- "/Type /Pages\n"
- "/Kids [ 4 0 R ]\n"
- "/Count 1\n"
- ">>\n");
- l_dnaAddNumber(lpd->objsize, strlen(lpd->obj3));
-
- /* Do the post-datastream string */
- lpd->poststream = stringNew("\n"
- "endstream\n"
- "endobj\n");
- return;
-}
-
-
-/*!
- * \brief generateEscapeString()
- *
- * \param[in] str input string
- * \return hex escape string, or null on error
- *
- *
- * Notes:
- * (1) If the input string is not ascii, returns null.
- * (2) This takes an input ascii string and generates a hex
- * ascii output string with 4 bytes out for each byte in.
- * The feff code at the beginning tells the pdf interpreter
- * that the data is to be interpreted as big-endian, 4 bytes
- * at a time. For ascii, the first two bytes are 0 and the
- * last two bytes are less than 0x80.
- *
- */
-static char *
-generateEscapeString(const char *str)
-{
-char smallbuf[8];
-char *buffer;
-l_int32 i, nchar, buflen;
-
- PROCNAME("generateEscapeString");
-
- if (!str)
- return (char *)ERROR_PTR("str not defined", procName, NULL);
- nchar = strlen(str);
- for (i = 0; i < nchar; i++) {
- if (str[i] < 0)
- return (char *)ERROR_PTR("str not all ascii", procName, NULL);
- }
-
- buflen = 4 * nchar + 10;
- buffer = (char *)LEPT_CALLOC(buflen, sizeof(char));
- stringCat(buffer, buflen, "");
- return buffer;
-}
-
-
-static void
-generateMediaboxPdf(L_PDF_DATA *lpd)
-{
-l_int32 i;
-l_float32 xpt, ypt, wpt, hpt, maxx, maxy;
-
- /* First get the full extent of all the images.
- * This is the mediabox, in pts. */
- maxx = maxy = 0;
- for (i = 0; i < lpd->n; i++) {
- ptaGetPt(lpd->xy, i, &xpt, &ypt);
- ptaGetPt(lpd->wh, i, &wpt, &hpt);
- maxx = L_MAX(maxx, xpt + wpt);
- maxy = L_MAX(maxy, ypt + hpt);
- }
-
- lpd->mediabox = boxCreate(0, 0, (l_int32)(maxx + 0.5),
- (l_int32)(maxy + 0.5));
-
- /* ypt is in standard image coordinates: the location of
- * the UL image corner with respect to the UL media box corner.
- * Rewrite each ypt for PostScript coordinates: the location of
- * the LL image corner with respect to the LL media box corner. */
- for (i = 0; i < lpd->n; i++) {
- ptaGetPt(lpd->xy, i, &xpt, &ypt);
- ptaGetPt(lpd->wh, i, &wpt, &hpt);
- ptaSetPt(lpd->xy, i, xpt, maxy - ypt - hpt);
- }
-
- return;
-}
-
-
-static l_int32
-generatePageStringPdf(L_PDF_DATA *lpd)
-{
-char *buf;
-char *xstr;
-l_int32 bufsize, i, wpt, hpt;
-SARRAY *sa;
-
- PROCNAME("generatePageStringPdf");
-
- /* Allocate 1000 bytes for the boilerplate text, and
- * 50 bytes for each reference to an image in the
- * ProcSet array. */
- bufsize = 1000 + 50 * lpd->n;
- if ((buf = (char *)LEPT_CALLOC(bufsize, sizeof(char))) == NULL)
- return ERROR_INT("calloc fail for buf", procName, 1);
-
- boxGetGeometry(lpd->mediabox, NULL, NULL, &wpt, &hpt);
- sa = sarrayCreate(lpd->n);
- for (i = 0; i < lpd->n; i++) {
- snprintf(buf, bufsize, "/Im%d %d 0 R ", i + 1, 6 + i);
- sarrayAddString(sa, buf, L_COPY);
- }
- xstr = sarrayToString(sa, 0);
- sarrayDestroy(&sa);
- if (!xstr) {
- LEPT_FREE(buf);
- return ERROR_INT("xstr not made", procName, 1);
- }
-
- snprintf(buf, bufsize, "4 0 obj\n"
- "<<\n"
- "/Type /Page\n"
- "/Parent 3 0 R\n"
- "/MediaBox [%d %d %d %d]\n"
- "/Contents 5 0 R\n"
- "/Resources\n"
- "<<\n"
- "/XObject << %s >>\n"
- "/ProcSet [ /ImageB /ImageI /ImageC ]\n"
- ">>\n"
- ">>\n"
- "endobj\n",
- 0, 0, wpt, hpt, xstr);
-
- lpd->obj4 = stringNew(buf);
- l_dnaAddNumber(lpd->objsize, strlen(lpd->obj4));
- sarrayDestroy(&sa);
- LEPT_FREE(buf);
- LEPT_FREE(xstr);
- return 0;
-}
-
-
-static l_int32
-generateContentStringPdf(L_PDF_DATA *lpd)
-{
-char *buf;
-char *cstr;
-l_int32 i, bufsize;
-l_float32 xpt, ypt, wpt, hpt;
-SARRAY *sa;
-
- PROCNAME("generateContentStringPdf");
-
- bufsize = 1000 + 200 * lpd->n;
- if ((buf = (char *)LEPT_CALLOC(bufsize, sizeof(char))) == NULL)
- return ERROR_INT("calloc fail for buf", procName, 1);
-
- sa = sarrayCreate(lpd->n);
- for (i = 0; i < lpd->n; i++) {
- ptaGetPt(lpd->xy, i, &xpt, &ypt);
- ptaGetPt(lpd->wh, i, &wpt, &hpt);
- snprintf(buf, bufsize,
- "q %.4f %.4f %.4f %.4f %.4f %.4f cm /Im%d Do Q\n",
- wpt, 0.0, 0.0, hpt, xpt, ypt, i + 1);
- sarrayAddString(sa, buf, L_COPY);
- }
- cstr = sarrayToString(sa, 0);
- sarrayDestroy(&sa);
- if (!cstr) {
- LEPT_FREE(buf);
- return ERROR_INT("cstr not made", procName, 1);
- }
-
- snprintf(buf, bufsize, "5 0 obj\n"
- "<< /Length %d >>\n"
- "stream\n"
- "%s"
- "endstream\n"
- "endobj\n",
- (l_int32)strlen(cstr), cstr);
-
- lpd->obj5 = stringNew(buf);
- l_dnaAddNumber(lpd->objsize, strlen(lpd->obj5));
- sarrayDestroy(&sa);
- LEPT_FREE(buf);
- LEPT_FREE(cstr);
- return 0;
-}
-
-
-static l_int32
-generatePreXStringsPdf(L_PDF_DATA *lpd)
-{
-char buff[256];
-char buf[L_BIGBUF];
-char *cstr, *bstr, *fstr, *pstr, *xstr;
-l_int32 i, cmindex;
-L_COMP_DATA *cid;
-SARRAY *sa;
-
- PROCNAME("generatePreXStringsPdf");
-
- sa = lpd->saprex;
- cmindex = 6 + lpd->n; /* starting value */
- for (i = 0; i < lpd->n; i++) {
- pstr = cstr = NULL;
- if ((cid = pdfdataGetCid(lpd, i)) == NULL)
- return ERROR_INT("cid not found", procName, 1);
-
- if (cid->type == L_G4_ENCODE) {
- if (var_WRITE_G4_IMAGE_MASK) {
- cstr = stringNew("/ImageMask true\n"
- "/ColorSpace /DeviceGray");
- } else {
- cstr = stringNew("/ColorSpace /DeviceGray");
- }
- bstr = stringNew("/BitsPerComponent 1\n"
- "/Interpolate true");
- snprintf(buff, sizeof(buff),
- "/Filter /CCITTFaxDecode\n"
- "/DecodeParms\n"
- "<<\n"
- "/K -1\n"
- "/Columns %d\n"
- ">>", cid->w);
- fstr = stringNew(buff);
- } else if (cid->type == L_JPEG_ENCODE) {
- if (cid->spp == 1)
- cstr = stringNew("/ColorSpace /DeviceGray");
- else if (cid->spp == 3)
- cstr = stringNew("/ColorSpace /DeviceRGB");
- else if (cid->spp == 4) /* pdf supports cmyk */
- cstr = stringNew("/ColorSpace /DeviceCMYK");
- else
- L_ERROR("in jpeg: spp != 1, 3 or 4\n", procName);
- bstr = stringNew("/BitsPerComponent 8");
- fstr = stringNew("/Filter /DCTDecode");
- } else if (cid->type == L_JP2K_ENCODE) {
- if (cid->spp == 1)
- cstr = stringNew("/ColorSpace /DeviceGray");
- else if (cid->spp == 3)
- cstr = stringNew("/ColorSpace /DeviceRGB");
- else
- L_ERROR("in jp2k: spp != 1 && spp != 3\n", procName);
- bstr = stringNew("/BitsPerComponent 8");
- fstr = stringNew("/Filter /JPXDecode");
- } else { /* type == L_FLATE_ENCODE */
- if (cid->ncolors > 0) { /* cmapped */
- snprintf(buff, sizeof(buff), "/ColorSpace %d 0 R", cmindex++);
- cstr = stringNew(buff);
- } else {
- if (cid->spp == 1 && cid->bps == 1)
- cstr = stringNew("/ColorSpace /DeviceGray\n"
- "/Decode [1 0]");
- else if (cid->spp == 1) /* 8 bpp */
- cstr = stringNew("/ColorSpace /DeviceGray");
- else if (cid->spp == 3)
- cstr = stringNew("/ColorSpace /DeviceRGB");
- else
- L_ERROR("unknown colorspace: spp = %d\n",
- procName, cid->spp);
- }
- snprintf(buff, sizeof(buff), "/BitsPerComponent %d", cid->bps);
- bstr = stringNew(buff);
- fstr = stringNew("/Filter /FlateDecode");
- if (cid->predictor == TRUE) {
- snprintf(buff, sizeof(buff),
- "/DecodeParms\n"
- "<<\n"
- " /Columns %d\n"
- " /Predictor 14\n"
- " /Colors %d\n"
- " /BitsPerComponent %d\n"
- ">>\n", cid->w, cid->spp, cid->bps);
- pstr = stringNew(buff);
- }
- }
- if (!pstr) /* no decode parameters */
- pstr = stringNew("");
-
- snprintf(buf, sizeof(buf),
- "%d 0 obj\n"
- "<<\n"
- "/Length %zu\n"
- "/Subtype /Image\n"
- "%s\n" /* colorspace */
- "/Width %d\n"
- "/Height %d\n"
- "%s\n" /* bits/component */
- "%s\n" /* filter */
- "%s" /* decode parms; can be empty */
- ">>\n"
- "stream\n",
- 6 + i, cid->nbytescomp, cstr,
- cid->w, cid->h, bstr, fstr, pstr);
- xstr = stringNew(buf);
- sarrayAddString(sa, xstr, L_INSERT);
- l_dnaAddNumber(lpd->objsize,
- strlen(xstr) + cid->nbytescomp + strlen(lpd->poststream));
- LEPT_FREE(cstr);
- LEPT_FREE(bstr);
- LEPT_FREE(fstr);
- LEPT_FREE(pstr);
- }
-
- return 0;
-}
-
-
-static l_int32
-generateColormapStringsPdf(L_PDF_DATA *lpd)
-{
-char buf[L_BIGBUF];
-char *cmstr;
-l_int32 i, cmindex, ncmap;
-L_COMP_DATA *cid;
-SARRAY *sa;
-
- PROCNAME("generateColormapStringsPdf");
-
- /* In our canonical format, we have 5 objects, followed
- * by n XObjects, followed by m colormaps, so the index of
- * the first colormap object is 6 + n. */
- sa = lpd->sacmap;
- cmindex = 6 + lpd->n; /* starting value */
- ncmap = 0;
- for (i = 0; i < lpd->n; i++) {
- if ((cid = pdfdataGetCid(lpd, i)) == NULL)
- return ERROR_INT("cid not found", procName, 1);
- if (cid->ncolors == 0) continue;
-
- ncmap++;
- snprintf(buf, sizeof(buf), "%d 0 obj\n"
- "[ /Indexed /DeviceRGB\n"
- "%d\n"
- "%s\n"
- "]\n"
- "endobj\n",
- cmindex, cid->ncolors - 1, cid->cmapdatahex);
- cmindex++;
- cmstr = stringNew(buf);
- l_dnaAddNumber(lpd->objsize, strlen(cmstr));
- sarrayAddString(sa, cmstr, L_INSERT);
- }
-
- lpd->ncmap = ncmap;
- return 0;
-}
-
-
-static void
-generateTrailerPdf(L_PDF_DATA *lpd)
-{
-l_int32 i, n, size, linestart;
-L_DNA *daloc, *dasize;
-
- /* Let nobj be the number of numbered objects. These numbered
- * objects are indexed by their pdf number in arrays naloc[]
- * and nasize[]. The 0th object is the 9 byte header. Then
- * the number of objects in nasize, which includes the header,
- * is n = nobj + 1. The array naloc[] has n + 1 elements,
- * because it includes as the last element the starting
- * location of xref. The indexing of these objects, their
- * starting locations and sizes are:
- *
- * Object number Starting location Size
- * ------------- ----------------- --------------
- * 0 daloc[0] = 0 dasize[0] = 9
- * 1 daloc[1] = 9 dasize[1] = 49
- * n daloc[n] dasize[n]
- * xref daloc[n+1]
- *
- * We first generate daloc.
- */
- dasize = lpd->objsize;
- daloc = lpd->objloc;
- linestart = 0;
- l_dnaAddNumber(daloc, linestart); /* header */
- n = l_dnaGetCount(dasize);
- for (i = 0; i < n; i++) {
- l_dnaGetIValue(dasize, i, &size);
- linestart += size;
- l_dnaAddNumber(daloc, linestart);
- }
- l_dnaGetIValue(daloc, n, &lpd->xrefloc); /* save it */
-
- /* Now make the actual trailer string */
- lpd->trailer = makeTrailerStringPdf(daloc);
-}
-
-
-static char *
-makeTrailerStringPdf(L_DNA *daloc)
-{
-char *outstr;
-char buf[L_BIGBUF];
-l_int32 i, n, linestart, xrefloc;
-SARRAY *sa;
-
- PROCNAME("makeTrailerStringPdf");
-
- if (!daloc)
- return (char *)ERROR_PTR("daloc not defined", procName, NULL);
- n = l_dnaGetCount(daloc) - 1; /* numbered objects + 1 (yes, +1) */
-
- sa = sarrayCreate(0);
- snprintf(buf, sizeof(buf), "xref\n"
- "0 %d\n"
- "0000000000 65535 f \n", n);
- sarrayAddString(sa, buf, L_COPY);
- for (i = 1; i < n; i++) {
- l_dnaGetIValue(daloc, i, &linestart);
- snprintf(buf, sizeof(buf), "%010d 00000 n \n", linestart);
- sarrayAddString(sa, buf, L_COPY);
- }
-
- l_dnaGetIValue(daloc, n, &xrefloc);
- snprintf(buf, sizeof(buf), "trailer\n"
- "<<\n"
- "/Size %d\n"
- "/Root 1 0 R\n"
- "/Info 2 0 R\n"
- ">>\n"
- "startxref\n"
- "%d\n"
- "%%%%EOF\n", n, xrefloc);
- sarrayAddString(sa, buf, L_COPY);
- outstr = sarrayToString(sa, 0);
- sarrayDestroy(&sa);
- return outstr;
-}
-
-
-/*!
- * \brief generateOutputDataPdf()
- *
- * \param[out] pdata pdf data array
- * \param[out] pnbytes size of pdf data array
- * \param[in] lpd input data used to make pdf
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) Only called from l_generatePdf(). On error, no data is returned.
- *
- */
-static l_int32
-generateOutputDataPdf(l_uint8 **pdata,
- size_t *pnbytes,
- L_PDF_DATA *lpd)
-{
-char *str;
-l_uint8 *data;
-l_int32 nimages, i, len;
-l_int32 *sizes, *locs;
-size_t nbytes;
-L_COMP_DATA *cid;
-
- PROCNAME("generateOutputDataPdf");
-
- if (!pdata)
- return ERROR_INT("&data not defined", procName, 1);
- *pdata = NULL;
- if (!pnbytes)
- return ERROR_INT("&nbytes not defined", procName, 1);
- nbytes = lpd->xrefloc + strlen(lpd->trailer);
- *pnbytes = nbytes;
- if ((data = (l_uint8 *)LEPT_CALLOC(nbytes, sizeof(l_uint8))) == NULL)
- return ERROR_INT("calloc fail for data", procName, 1);
- *pdata = data;
-
- sizes = l_dnaGetIArray(lpd->objsize);
- locs = l_dnaGetIArray(lpd->objloc);
- memcpy(data, lpd->id, sizes[0]);
- memcpy(data + locs[1], lpd->obj1, sizes[1]);
- memcpy(data + locs[2], lpd->obj2, sizes[2]);
- memcpy(data + locs[3], lpd->obj3, sizes[3]);
- memcpy(data + locs[4], lpd->obj4, sizes[4]);
- memcpy(data + locs[5], lpd->obj5, sizes[5]);
-
- /* Each image has 3 parts: variable preamble, the compressed
- * data stream, and the fixed poststream. */
- nimages = lpd->n;
- for (i = 0; i < nimages; i++) {
- if ((cid = pdfdataGetCid(lpd, i)) == NULL) { /* should not happen */
- LEPT_FREE(sizes);
- LEPT_FREE(locs);
- return ERROR_INT("cid not found", procName, 1);
- }
- str = sarrayGetString(lpd->saprex, i, L_NOCOPY);
- len = strlen(str);
- memcpy(data + locs[6 + i], str, len);
- memcpy(data + locs[6 + i] + len,
- cid->datacomp, cid->nbytescomp);
- memcpy(data + locs[6 + i] + len + cid->nbytescomp,
- lpd->poststream, strlen(lpd->poststream));
- }
-
- /* Each colormap is simply a stored string */
- for (i = 0; i < lpd->ncmap; i++) {
- str = sarrayGetString(lpd->sacmap, i, L_NOCOPY);
- memcpy(data + locs[6 + nimages + i], str, strlen(str));
- }
-
- /* And finally the trailer */
- memcpy(data + lpd->xrefloc, lpd->trailer, strlen(lpd->trailer));
- LEPT_FREE(sizes);
- LEPT_FREE(locs);
- return 0;
-}
-
-
-/*---------------------------------------------------------------------*
- * Helper functions for generating multipage pdf output *
- *---------------------------------------------------------------------*/
-/*!
- * \brief parseTrailerPdf()
- *
- * \param[in] bas lba of a pdf file
- * \param[out] pda byte locations of the beginning of each object
- * \return 0 if OK, 1 on error
- */
-static l_int32
-parseTrailerPdf(L_BYTEA *bas,
- L_DNA **pda)
-{
-char *str;
-l_uint8 nl = '\n';
-l_uint8 *data;
-l_int32 i, j, start, startloc, xrefloc, found, loc, nobj, objno, trailer_ok;
-size_t size;
-L_DNA *da, *daobj, *daxref;
-SARRAY *sa;
-
- PROCNAME("parseTrailerPdf");
-
- if (!pda)
- return ERROR_INT("&da not defined", procName, 1);
- *pda = NULL;
- if (!bas)
- return ERROR_INT("bas not defined", procName, 1);
- data = l_byteaGetData(bas, &size);
- if (memcmp(data, "%PDF-1.", 7) != 0)
- return ERROR_INT("PDF header signature not found", procName, 1);
-
- /* Search for "startxref" starting 50 bytes from the EOF */
- start = 0;
- if (size > 50)
- start = size - 50;
- arrayFindSequence(data + start, size - start,
- (l_uint8 *)"startxref\n", 10, &loc, &found);
- if (!found)
- return ERROR_INT("startxref not found!", procName, 1);
- if (sscanf((char *)(data + start + loc + 10), "%d\n", &xrefloc) != 1)
- return ERROR_INT("xrefloc not found!", procName, 1);
- if (xrefloc < 0 || xrefloc >= size)
- return ERROR_INT("invalid xrefloc!", procName, 1);
- sa = sarrayCreateLinesFromString((char *)(data + xrefloc), 0);
- str = sarrayGetString(sa, 1, L_NOCOPY);
- if ((sscanf(str, "0 %d", &nobj)) != 1) {
- sarrayDestroy(&sa);
- return ERROR_INT("nobj not found", procName, 1);
- }
-
- /* Get starting locations. The numa index is the
- * object number. loc[0] is the ID; loc[nobj + 1] is xrefloc. */
- da = l_dnaCreate(nobj + 1);
- *pda = da;
- for (i = 0; i < nobj; i++) {
- str = sarrayGetString(sa, i + 2, L_NOCOPY);
- sscanf(str, "%d", &startloc);
- l_dnaAddNumber(da, startloc);
- }
- l_dnaAddNumber(da, xrefloc);
-
-#if DEBUG_MULTIPAGE
- lept_stderr("************** Trailer string ************\n");
- lept_stderr("xrefloc = %d", xrefloc);
- sarrayWriteStream(stderr, sa);
-
- lept_stderr("************** Object locations ************");
- l_dnaWriteStream(stderr, da);
-#endif /* DEBUG_MULTIPAGE */
- sarrayDestroy(&sa);
-
- /* Verify correct parsing */
- trailer_ok = TRUE;
- for (i = 1; i < nobj; i++) {
- l_dnaGetIValue(da, i, &startloc);
- if ((sscanf((char *)(data + startloc), "%d 0 obj", &objno)) != 1) {
- L_ERROR("bad trailer for object %d\n", procName, i);
- trailer_ok = FALSE;
- break;
- }
- }
-
- /* If the trailer is broken, reconstruct the correct obj locations */
- if (!trailer_ok) {
- L_INFO("rebuilding pdf trailer\n", procName);
- l_dnaEmpty(da);
- l_dnaAddNumber(da, 0);
- l_byteaFindEachSequence(bas, (l_uint8 *)" 0 obj\n", 7, &daobj);
- nobj = l_dnaGetCount(daobj);
- for (i = 0; i < nobj; i++) {
- l_dnaGetIValue(daobj, i, &loc);
- for (j = loc - 1; j > 0; j--) {
- if (data[j] == nl)
- break;
- }
- l_dnaAddNumber(da, j + 1);
- }
- l_byteaFindEachSequence(bas, (l_uint8 *)"xref", 4, &daxref);
- l_dnaGetIValue(daxref, 0, &loc);
- l_dnaAddNumber(da, loc);
- l_dnaDestroy(&daobj);
- l_dnaDestroy(&daxref);
- }
-
- return 0;
-}
-
-
-static char *
-generatePagesObjStringPdf(NUMA *napage)
-{
-char *str;
-char *buf;
-l_int32 i, n, index, bufsize;
-SARRAY *sa;
-
- PROCNAME("generatePagesObjStringPdf");
-
- if (!napage)
- return (char *)ERROR_PTR("napage not defined", procName, NULL);
-
- n = numaGetCount(napage);
- bufsize = 100 + 16 * n; /* large enough to hold the output string */
- buf = (char *)LEPT_CALLOC(bufsize, sizeof(char));
- sa = sarrayCreate(n);
- for (i = 0; i < n; i++) {
- numaGetIValue(napage, i, &index);
- snprintf(buf, bufsize, " %d 0 R ", index);
- sarrayAddString(sa, buf, L_COPY);
- }
-
- str = sarrayToString(sa, 0);
- snprintf(buf, bufsize - 1, "3 0 obj\n"
- "<<\n"
- "/Type /Pages\n"
- "/Kids [%s]\n"
- "/Count %d\n"
- ">>\n", str, n);
- sarrayDestroy(&sa);
- LEPT_FREE(str);
- return buf;
-}
-
-
-/*!
- * \brief substituteObjectNumbers()
- *
- * \param[in] bas lba of a pdf object
- * \param[in] na_objs object number mapping array
- * \return bad lba of rewritten pdf for the object
- *
- *
- * Notes:
- * (1) Interpret the first set of bytes as the object number,
- * map to the new number, and write it out.
- * (2) Find all occurrences of this 4-byte sequence: " 0 R"
- * (3) Find the location and value of the integer preceding this,
- * and map it to the new value.
- * (4) Rewrite the object with new object numbers.
- *
- */
-static L_BYTEA *
-substituteObjectNumbers(L_BYTEA *bas,
- NUMA *na_objs)
-{
-l_uint8 space = ' ';
-l_uint8 *datas;
-l_uint8 buf[32]; /* only needs to hold one integer in ascii format */
-l_int32 start, nrepl, i, j, objin, objout, found;
-l_int32 *objs, *matches;
-size_t size;
-L_BYTEA *bad;
-L_DNA *da_match;
-
- datas = l_byteaGetData(bas, &size);
- bad = l_byteaCreate(100);
- objs = numaGetIArray(na_objs); /* object number mapper */
-
- /* Substitute the object number on the first line */
- sscanf((char *)datas, "%d", &objin);
- objout = objs[objin];
- snprintf((char *)buf, 32, "%d", objout);
- l_byteaAppendString(bad, (char *)buf);
-
- /* Find the set of matching locations for object references */
- arrayFindSequence(datas, size, &space, 1, &start, &found);
- da_match = arrayFindEachSequence(datas, size, (l_uint8 *)" 0 R", 4);
- if (!da_match) {
- l_byteaAppendData(bad, datas + start, size - start);
- LEPT_FREE(objs);
- return bad;
- }
-
- /* Substitute all the object reference numbers */
- nrepl = l_dnaGetCount(da_match);
- matches = l_dnaGetIArray(da_match);
- for (i = 0; i < nrepl; i++) {
- /* Find the first space before the object number */
- for (j = matches[i] - 1; j > 0; j--) {
- if (datas[j] == space)
- break;
- }
- /* Copy bytes from 'start' up to the object number */
- l_byteaAppendData(bad, datas + start, j - start + 1);
- sscanf((char *)(datas + j + 1), "%d", &objin);
- objout = objs[objin];
- snprintf((char *)buf, 32, "%d", objout);
- l_byteaAppendString(bad, (char *)buf);
- start = matches[i];
- }
- l_byteaAppendData(bad, datas + start, size - start);
-
- LEPT_FREE(objs);
- LEPT_FREE(matches);
- l_dnaDestroy(&da_match);
- return bad;
-}
-
-
-/*---------------------------------------------------------------------*
- * Create/destroy/access pdf data *
- *---------------------------------------------------------------------*/
-static L_PDF_DATA *
-pdfdataCreate(const char *title)
-{
-L_PDF_DATA *lpd;
-
- lpd = (L_PDF_DATA *)LEPT_CALLOC(1, sizeof(L_PDF_DATA));
- if (title) lpd->title = stringNew(title);
- lpd->cida = ptraCreate(10);
- lpd->xy = ptaCreate(10);
- lpd->wh = ptaCreate(10);
- lpd->saprex = sarrayCreate(10);
- lpd->sacmap = sarrayCreate(10);
- lpd->objsize = l_dnaCreate(20);
- lpd->objloc = l_dnaCreate(20);
- return lpd;
-}
-
-static void
-pdfdataDestroy(L_PDF_DATA **plpd)
-{
-l_int32 i;
-L_COMP_DATA *cid;
-L_PDF_DATA *lpd;
-
- PROCNAME("pdfdataDestroy");
-
- if (plpd== NULL) {
- L_WARNING("ptr address is null!\n", procName);
- return;
- }
- if ((lpd = *plpd) == NULL)
- return;
-
- if (lpd->title) LEPT_FREE(lpd->title);
- for (i = 0; i < lpd->n; i++) {
- cid = (L_COMP_DATA *)ptraRemove(lpd->cida, i, L_NO_COMPACTION);
- l_CIDataDestroy(&cid);
- }
-
- ptraDestroy(&lpd->cida, 0, 0);
- if (lpd->id) LEPT_FREE(lpd->id);
- if (lpd->obj1) LEPT_FREE(lpd->obj1);
- if (lpd->obj2) LEPT_FREE(lpd->obj2);
- if (lpd->obj3) LEPT_FREE(lpd->obj3);
- if (lpd->obj4) LEPT_FREE(lpd->obj4);
- if (lpd->obj5) LEPT_FREE(lpd->obj5);
- if (lpd->poststream) LEPT_FREE(lpd->poststream);
- if (lpd->trailer) LEPT_FREE(lpd->trailer);
- if (lpd->xy) ptaDestroy(&lpd->xy);
- if (lpd->wh) ptaDestroy(&lpd->wh);
- if (lpd->mediabox) boxDestroy(&lpd->mediabox);
- if (lpd->saprex) sarrayDestroy(&lpd->saprex);
- if (lpd->sacmap) sarrayDestroy(&lpd->sacmap);
- if (lpd->objsize) l_dnaDestroy(&lpd->objsize);
- if (lpd->objloc) l_dnaDestroy(&lpd->objloc);
- LEPT_FREE(lpd);
- *plpd = NULL;
- return;
-}
-
-
-static L_COMP_DATA *
-pdfdataGetCid(L_PDF_DATA *lpd,
- l_int32 index)
-{
- PROCNAME("pdfdataGetCid");
-
- if (!lpd)
- return (L_COMP_DATA *)ERROR_PTR("lpd not defined", procName, NULL);
- if (index < 0 || index >= lpd->n)
- return (L_COMP_DATA *)ERROR_PTR("invalid image index", procName, NULL);
-
- return (L_COMP_DATA *)ptraGetPtrToItem(lpd->cida, index);
-}
-
-
-/*---------------------------------------------------------------------*
- * Set flags for special modes *
- *---------------------------------------------------------------------*/
-/*!
- * \brief l_pdfSetG4ImageMask()
- *
- * \param[in] flag 1 for writing g4 data as fg only through a mask;
- * 0 for writing fg and bg
- * \return void
- *
- *
- * Notes:
- * (1) The default is for writing only the fg (through the mask).
- * That way when you write a 1 bpp image, the bg is transparent,
- * so any previously written image remains visible behind it.
- *
- */
-void
-l_pdfSetG4ImageMask(l_int32 flag)
-{
- var_WRITE_G4_IMAGE_MASK = flag;
-}
-
-
-/*!
- * \brief l_pdfSetDateAndVersion()
- *
- * \param[in] flag 1 for writing date/time and leptonica version;
- * 0 for omitting this from the metadata
- * \return void
- *
- *
- * Notes:
- * (1) The default is for writing this data. For regression tests
- * that compare output against golden files, it is useful to omit.
- *
- */
-void
-l_pdfSetDateAndVersion(l_int32 flag)
-{
- var_WRITE_DATE_AND_VERSION = flag;
-}
-
-/* --------------------------------------------*/
-#endif /* USE_PDFIO */
-/* --------------------------------------------*/
diff --git a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pdfio2stub.c b/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pdfio2stub.c
deleted file mode 100644
index cb297b12..00000000
--- a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pdfio2stub.c
+++ /dev/null
@@ -1,172 +0,0 @@
-/*====================================================================*
- - Copyright (C) 2001 Leptonica. All rights reserved.
- -
- - Redistribution and use in source and binary forms, with or without
- - modification, are permitted provided that the following conditions
- - are met:
- - 1. Redistributions of source code must retain the above copyright
- - notice, this list of conditions and the following disclaimer.
- - 2. Redistributions in binary form must reproduce the above
- - copyright notice, this list of conditions and the following
- - disclaimer in the documentation and/or other materials
- - provided with the distribution.
- -
- - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- - ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- - LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- - A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL ANY
- - CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
- - EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
- - PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
- - PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
- - OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
- - NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- *====================================================================*/
-
-/*!
- * \file pdfio2stub.c
- *
- *
- * Stubs for pdfio2.c functions
- *
- */
-
-#ifdef HAVE_CONFIG_H
-#include
-#endif /* HAVE_CONFIG_H */
-
-#include "allheaders.h"
-
-/* --------------------------------------------*/
-#if !USE_PDFIO /* defined in environ.h */
-/* --------------------------------------------*/
-
-/* ----------------------------------------------------------------------*/
-
-l_ok pixConvertToPdfData(PIX *pix, l_int32 type, l_int32 quality,
- l_uint8 **pdata, size_t *pnbytes,
- l_int32 x, l_int32 y, l_int32 res,
- const char *title,
- L_PDF_DATA **plpd, l_int32 position)
-{
- return ERROR_INT("function not present", "pixConvertToPdfData", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok ptraConcatenatePdfToData(L_PTRA *pa_data, SARRAY *sa,
- l_uint8 **pdata, size_t *pnbytes)
-{
- return ERROR_INT("function not present", "ptraConcatenatePdfToData", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok convertTiffMultipageToPdf(const char *filein, const char *fileout)
-{
- return ERROR_INT("function not present", "convertTiffMultipageToPdf", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok l_generateCIDataForPdf(const char *fname, PIX *pix, l_int32 quality,
- L_COMP_DATA **pcid)
-{
- return ERROR_INT("function not present", "l_generateCIDataForPdf", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-L_COMP_DATA * l_generateFlateDataPdf(const char *fname, PIX *pix)
-{
- return (L_COMP_DATA *)ERROR_PTR("function not present",
- "l_generateFlateDataPdf", NULL);
-}
-
-/* ----------------------------------------------------------------------*/
-
-L_COMP_DATA * l_generateJpegData(const char *fname, l_int32 ascii85flag)
-{
- return (L_COMP_DATA *)ERROR_PTR("function not present",
- "l_generateJpegData", NULL);
-}
-
-/* ----------------------------------------------------------------------*/
-
-L_COMP_DATA * l_generateJpegDataMem(l_uint8 *data, size_t nbytes,
- l_int32 ascii85flag)
-{
- return (L_COMP_DATA *)ERROR_PTR("function not present",
- "l_generateJpegDataMem", NULL);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok l_generateCIData(const char *fname, l_int32 type, l_int32 quality,
- l_int32 ascii85, L_COMP_DATA **pcid)
-{
- return ERROR_INT("function not present", "l_generateCIData", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok pixGenerateCIData(PIX *pixs, l_int32 type, l_int32 quality,
- l_int32 ascii85, L_COMP_DATA **pcid)
-{
- return ERROR_INT("function not present", "pixGenerateCIData", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-L_COMP_DATA * l_generateFlateData(const char *fname, l_int32 ascii85flag)
-{
- return (L_COMP_DATA *)ERROR_PTR("function not present",
- "l_generateFlateData", NULL);
-}
-
-/* ----------------------------------------------------------------------*/
-
-L_COMP_DATA * l_generateG4Data(const char *fname, l_int32 ascii85flag)
-{
- return (L_COMP_DATA *)ERROR_PTR("function not present",
- "l_generateG4Data", NULL);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok cidConvertToPdfData(L_COMP_DATA *cid, const char *title,
- l_uint8 **pdata, size_t *pnbytes)
-{
- return ERROR_INT("function not present", "cidConvertToPdfData", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-void l_CIDataDestroy(L_COMP_DATA **pcid)
-{
- L_ERROR("function not present\n", "l_CIDataDestroy");
- return;
-}
-
-/* ----------------------------------------------------------------------*/
-
-void l_pdfSetG4ImageMask(l_int32 flag)
-{
- L_ERROR("function not present\n", "l_pdfSetG4ImageMask");
- return;
-}
-
-/* ----------------------------------------------------------------------*/
-
-void l_pdfSetDateAndVersion(l_int32 flag)
-{
- L_ERROR("function not present\n", "l_pdfSetDateAndVersion");
- return;
-}
-
-/* ----------------------------------------------------------------------*/
-
-/* --------------------------------------------*/
-#endif /* !USE_PDFIO */
-/* --------------------------------------------*/
diff --git a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pix.h b/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pix.h
deleted file mode 100644
index 597b8dbd..00000000
--- a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pix.h
+++ /dev/null
@@ -1,1342 +0,0 @@
-/*====================================================================*
- - Copyright (C) 2001 Leptonica. All rights reserved.
- -
- - Redistribution and use in source and binary forms, with or without
- - modification, are permitted provided that the following conditions
- - are met:
- - 1. Redistributions of source code must retain the above copyright
- - notice, this list of conditions and the following disclaimer.
- - 2. Redistributions in binary form must reproduce the above
- - copyright notice, this list of conditions and the following
- - disclaimer in the documentation and/or other materials
- - provided with the distribution.
- -
- - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- - ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- - LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- - A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL ANY
- - CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
- - EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
- - PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
- - PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
- - OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
- - NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- *====================================================================*/
-
-#ifndef LEPTONICA_PIX_H
-#define LEPTONICA_PIX_H
-
-/*!
- * \file pix.h
- *
- *
- * Valid image types in leptonica:
- * Pix: 1 bpp, with and without colormap
- * Pix: 2 bpp, with and without colormap
- * Pix: 4 bpp, with and without colormap
- * Pix: 8 bpp, with and without colormap
- * Pix: 16 bpp (1 spp)
- * Pix: 32 bpp (rgb, 3 spp)
- * Pix: 32 bpp (rgba, 4 spp)
- * FPix: 32 bpp float
- * DPix: 64 bpp double
- * Notes:
- * (1) The only valid Pix image type with alpha is rgba.
- * In particular, the alpha component is not used in
- * cmapped images.
- * (2) PixComp can hold any Pix with IFF_PNG encoding.
- *
- * Contents:
- *
- * (1) This file defines most of the image-related structs used in leptonica:
- * struct Pix
- * struct PixColormap
- * struct RGBA_Quad
- * struct Pixa
- * struct Pixaa
- * struct Box
- * struct Boxa
- * struct Boxaa
- * struct Pta
- * struct Ptaa
- * struct Pixacc
- * struct PixTiling
- * struct FPix
- * struct FPixa
- * struct DPix
- * struct PixComp
- * struct PixaComp
- *
- * (2) This file has definitions for:
- * Colors for RGBA
- * Colors for drawing boxes
- * Perceptual color weights
- * Colormap conversion flags
- * Rasterop bit flags
- * Structure access flags (for insert, copy, clone, copy-clone)
- * Sorting flags (by type and direction)
- * Blending flags
- * Graphics pixel setting flags
- * Size and location filter flags
- * Color component selection flags
- * 16-bit conversion flags
- * Rotation and shear flags
- * Affine transform order flags
- * Grayscale filling flags
- * Flags for setting to white or black
- * Flags for getting white or black pixel value
- * Flags for 8 and 16 bit pixel sums
- * Dithering flags
- * Distance flags
- * Value flags
- * Statistical measures
- * Set selection flags
- * Text orientation flags
- * Edge orientation flags
- * Line orientation flags
- * Image orientation flags
- * Scan direction flags
- * Box size adjustment flags
- * Flags for modifying box boundaries using a second box
- * Handling overlapping bounding boxes in boxa
- * Selecting or making a box from two (intersecting) boxes
- * Flags for replacing invalid boxes
- * Flags for box corners and center
- * Horizontal warp
- * Pixel selection for resampling
- * Thinning flags
- * Runlength flags
- * Edge filter flags
- * Subpixel color component ordering in LCD display
- * HSV histogram flags
- * Region flags (inclusion, exclusion)
- * Flags for adding text to a pix
- * Flags for plotting on a pix
- * Flags for making simple masks
- * Flags for selecting display program
- * Flags in the 'special' pix field for non-default operations
- * Handling negative values in conversion to unsigned int
- * Relative to zero flags
- * Flags for adding or removing trailing slash from string
- *
- * (3) This file has typedefs for the pix allocator and deallocator functions
- * alloc_fn()
- * dealloc_fn().
- *
- */
-
-
-/*-------------------------------------------------------------------------*
- * Basic Pix *
- *-------------------------------------------------------------------------*/
- /* The 'special' field is by default 0, but it can hold integers
- * that direct non-default actions, e.g., in png and jpeg I/O. */
-
-/*! Basic Pix */
-struct Pix
-{
- l_uint32 w; /*!< width in pixels */
- l_uint32 h; /*!< height in pixels */
- l_uint32 d; /*!< depth in bits (bpp) */
- l_uint32 spp; /*!< number of samples per pixel */
- l_uint32 wpl; /*!< 32-bit words/line */
- l_uint32 refcount; /*!< reference count (1 if no clones) */
- l_int32 xres; /*!< image res (ppi) in x direction */
- /*!< (use 0 if unknown) */
- l_int32 yres; /*!< image res (ppi) in y direction */
- /*!< (use 0 if unknown) */
- l_int32 informat; /*!< input file format, IFF_* */
- l_int32 special; /*!< special instructions for I/O, etc */
- char *text; /*!< text string associated with pix */
- struct PixColormap *colormap; /*!< colormap (may be null) */
- l_uint32 *data; /*!< the image data */
-};
-typedef struct Pix PIX;
-
-/*! Colormap of a Pix */
-struct PixColormap
-{
- void *array; /*!< colormap table (array of RGBA_QUAD) */
- l_int32 depth; /*!< of pix (1, 2, 4 or 8 bpp) */
- l_int32 nalloc; /*!< number of color entries allocated */
- l_int32 n; /*!< number of color entries used */
-};
-typedef struct PixColormap PIXCMAP;
-
-
- /*! Colormap table entry (after the BMP version).
- * Note that the BMP format stores the colormap table exactly
- * as it appears here, with color samples being stored sequentially,
- * in the order (b,g,r,a). */
-struct RGBA_Quad
-{
- l_uint8 blue; /*!< blue value */
- l_uint8 green; /*!< green value */
- l_uint8 red; /*!< red value */
- l_uint8 alpha; /*!< alpha value */
-};
-typedef struct RGBA_Quad RGBA_QUAD;
-
-
-/*-------------------------------------------------------------------------*
- * Colors for 32 RGBA *
- *-------------------------------------------------------------------------*/
-/*
- * Notes:
- * (1) These are the byte indices for colors in 32 bpp images.
- * They are used through the GET/SET_DATA_BYTE accessors.
- * The 4th byte, typically known as the "alpha channel" and used
- * for blending, is used to a small extent in leptonica.
- * (2) Do not change these values! If you redefine them, functions
- * that have the shifts hardcoded for efficiency and conciseness
- * (instead of using the constants below) will break. These
- * functions are labelled with "***" next to their names at
- * the top of the files in which they are defined.
- * (3) The shifts to extract the red, green, blue and alpha components
- * from a 32 bit pixel are defined here.
- *
- */
-
-/*! RGBA Color */
-enum {
- COLOR_RED = 0, /*!< red color index in RGBA_QUAD */
- COLOR_GREEN = 1, /*!< green color index in RGBA_QUAD */
- COLOR_BLUE = 2, /*!< blue color index in RGBA_QUAD */
- L_ALPHA_CHANNEL = 3 /*!< alpha value index in RGBA_QUAD */
-};
-
-static const l_int32 L_RED_SHIFT =
- 8 * (sizeof(l_uint32) - 1 - COLOR_RED); /* 24 */
-static const l_int32 L_GREEN_SHIFT =
- 8 * (sizeof(l_uint32) - 1 - COLOR_GREEN); /* 16 */
-static const l_int32 L_BLUE_SHIFT =
- 8 * (sizeof(l_uint32) - 1 - COLOR_BLUE); /* 8 */
-static const l_int32 L_ALPHA_SHIFT =
- 8 * (sizeof(l_uint32) - 1 - L_ALPHA_CHANNEL); /* 0 */
-
-
-/*-------------------------------------------------------------------------*
- * Colors for drawing boxes *
- *-------------------------------------------------------------------------*/
-/*! Box Color */
-enum {
- L_DRAW_RED = 0, /*!< draw in red */
- L_DRAW_GREEN = 1, /*!< draw in green */
- L_DRAW_BLUE = 2, /*!< draw in blue */
- L_DRAW_SPECIFIED = 3, /*!< draw specified color */
- L_DRAW_RGB = 4, /*!< draw as sequence of r,g,b */
- L_DRAW_RANDOM = 5 /*!< draw randomly chosen colors */
-};
-
-
-/*-------------------------------------------------------------------------*
- * Perceptual color weights *
- *-------------------------------------------------------------------------*/
-/*
- * Notes:
- * (1) These perceptual weighting factors are ad-hoc, but they do
- * add up to 1. Unlike, for example, the weighting factors for
- * converting RGB to luminance, or more specifically to Y in the
- * YUV colorspace. Those numbers come from the
- * International Telecommunications Union, via ITU-R.
- *
- */
-static const l_float32 L_RED_WEIGHT = 0.3f; /*!< Percept. weight for red */
-static const l_float32 L_GREEN_WEIGHT = 0.5f; /*!< Percept. weight for green */
-static const l_float32 L_BLUE_WEIGHT = 0.2f; /*!< Percept. weight for blue */
-
-
-/*-------------------------------------------------------------------------*
- * Flags for colormap conversion *
- *-------------------------------------------------------------------------*/
-/*! Cmap Conversion */
-enum {
- REMOVE_CMAP_TO_BINARY = 0, /*!< remove colormap for conv to 1 bpp */
- REMOVE_CMAP_TO_GRAYSCALE = 1, /*!< remove colormap for conv to 8 bpp */
- REMOVE_CMAP_TO_FULL_COLOR = 2, /*!< remove colormap for conv to 32 bpp */
- REMOVE_CMAP_WITH_ALPHA = 3, /*!< remove colormap and alpha */
- REMOVE_CMAP_BASED_ON_SRC = 4 /*!< remove depending on src format */
-};
-
-
-/*------------------------------------------------------------------------*
- *!
- *
- * The following operation bit flags have been modified from
- * Sun's pixrect.h.
- *
- * The 'op' in 'rasterop' is represented by an integer
- * composed with Boolean functions using the set of five integers
- * given below. The integers, and the op codes resulting from
- * boolean expressions on them, need only be in the range from 0 to 15.
- * The function is applied on a per-pixel basis.
- *
- * Examples: the op code representing ORing the src and dest
- * is computed using the bit OR, as PIX_SRC | PIX_DST; the op
- * code representing XORing src and dest is found from
- * PIX_SRC ^ PIX_DST; the op code representing ANDing src and dest
- * is found from PIX_SRC & PIX_DST. Note that
- * PIX_NOT(PIX_CLR) = PIX_SET, and v.v., as they must be.
- *
- * We use the following set of definitions:
- *
- * #define PIX_SRC 0xc
- * #define PIX_DST 0xa
- * #define PIX_NOT(op) (op) ^ 0xf
- * #define PIX_CLR 0x0
- * #define PIX_SET 0xf
- *
- * These definitions differ from Sun's, in that Sun left-shifted
- * each value by 1 pixel, and used the least significant bit as a
- * flag for the "pseudo-operation" of clipping. We don't need
- * this bit, because it is both efficient and safe ALWAYS to clip
- * the rectangles to the src and dest images, which is what we do.
- * See the notes in rop.h on the general choice of these bit flags.
- *
- * [If for some reason you need compatibility with Sun's xview package,
- * you can adopt the original Sun definitions to avoid redefinition conflicts:
- *
- * #define PIX_SRC (0xc << 1)
- * #define PIX_DST (0xa << 1)
- * #define PIX_NOT(op) ((op) ^ 0x1e)
- * #define PIX_CLR (0x0 << 1)
- * #define PIX_SET (0xf << 1)
- * ]
- *
- * We have, for reference, the following 16 unique op flags:
- *
- * PIX_CLR 0000 0x0
- * PIX_SET 1111 0xf
- * PIX_SRC 1100 0xc
- * PIX_DST 1010 0xa
- * PIX_NOT(PIX_SRC) 0011 0x3
- * PIX_NOT(PIX_DST) 0101 0x5
- * PIX_SRC | PIX_DST 1110 0xe
- * PIX_SRC & PIX_DST 1000 0x8
- * PIX_SRC ^ PIX_DST 0110 0x6
- * PIX_NOT(PIX_SRC) | PIX_DST 1011 0xb
- * PIX_NOT(PIX_SRC) & PIX_DST 0010 0x2
- * PIX_SRC | PIX_NOT(PIX_DST) 1101 0xd
- * PIX_SRC & PIX_NOT(PIX_DST) 0100 0x4
- * PIX_NOT(PIX_SRC | PIX_DST) 0001 0x1
- * PIX_NOT(PIX_SRC & PIX_DST) 0111 0x7
- * PIX_NOT(PIX_SRC ^ PIX_DST) 1001 0x9
- *
- *
- *-------------------------------------------------------------------------*/
-
-#define PIX_SRC (0xc) /*!< use source pixels */
-#define PIX_DST (0xa) /*!< use destination pixels */
-#define PIX_NOT(op) ((op) ^ 0x0f) /*!< invert operation %op */
-#define PIX_CLR (0x0) /*!< clear pixels */
-#define PIX_SET (0xf) /*!< set pixels */
-
-#define PIX_PAINT (PIX_SRC | PIX_DST) /*!< paint = src | dst */
-#define PIX_MASK (PIX_SRC & PIX_DST) /*!< mask = src & dst */
-#define PIX_SUBTRACT (PIX_DST & PIX_NOT(PIX_SRC)) /*!< subtract = */
- /*!< src & !dst */
-#define PIX_XOR (PIX_SRC ^ PIX_DST) /*!< xor = src ^ dst */
-
-
-/*-------------------------------------------------------------------------*
- *
- * Important Notes:
- *
- * (1) The image data is stored in a single contiguous
- * array of l_uint32, into which the pixels are packed.
- * By "packed" we mean that there are no unused bits
- * between pixels, except for end-of-line padding to
- * satisfy item (2) below.
- *
- * (2) Every image raster line begins on a 32-bit word
- * boundary within this array.
- *
- * (3) Pix image data is stored in 32-bit units, with the
- * pixels ordered from left to right in the image being
- * stored in order from the MSB to LSB within the word,
- * for both big-endian and little-endian machines.
- * This is the natural ordering for big-endian machines,
- * as successive bytes are stored and fetched progressively
- * to the right. However, for little-endians, when storing
- * we re-order the bytes from this byte stream order, and
- * reshuffle again for byte access on 32-bit entities.
- * So if the bytes come in sequence from left to right, we
- * store them on little-endians in byte order:
- * 3 2 1 0 7 6 5 4 ...
- * This MSB to LSB ordering allows left and right shift
- * operations on 32 bit words to move the pixels properly.
- *
- * (4) We use 32 bit pixels for both RGB and RGBA color images.
- * The A (alpha) byte is ignored in most leptonica functions
- * operating on color images. Within each 4 byte pixel, the
- * color samples are ordered from MSB to LSB, as follows:
- *
- * | MSB | 2nd MSB | 3rd MSB | LSB |
- * red green blue alpha
- * 0 1 2 3 (big-endian)
- * 3 2 1 0 (little-endian)
- *
- * Because we use MSB to LSB ordering within the 32-bit word,
- * the individual 8-bit samples can be accessed with
- * GET_DATA_BYTE and SET_DATA_BYTE macros, using the
- * (implicitly big-ending) ordering
- * red: byte 0 (MSB)
- * green: byte 1 (2nd MSB)
- * blue: byte 2 (3rd MSB)
- * alpha: byte 3 (LSB)
- *
- * The specific color assignment is made in this file,
- * through the definitions of COLOR_RED, etc. Then the R, G
- * B and A sample values can be retrieved using
- * redval = GET_DATA_BYTE(&pixel, COLOR_RED);
- * greenval = GET_DATA_BYTE(&pixel, COLOR_GREEN);
- * blueval = GET_DATA_BYTE(&pixel, COLOR_BLUE);
- * alphaval = GET_DATA_BYTE(&pixel, L_ALPHA_CHANNEL);
- * and they can be set with
- * SET_DATA_BYTE(&pixel, COLOR_RED, redval);
- * SET_DATA_BYTE(&pixel, COLOR_GREEN, greenval);
- * SET_DATA_BYTE(&pixel, COLOR_BLUE, blueval);
- * SET_DATA_BYTE(&pixel, L_ALPHA_CHANNEL, alphaval);
- *
- * More efficiently, these components can be extracted directly
- * by shifting and masking, explicitly using the values in
- * L_RED_SHIFT, etc.:
- * (pixel32 >> L_RED_SHIFT) & 0xff; (red)
- * (pixel32 >> L_GREEN_SHIFT) & 0xff; (green)
- * (pixel32 >> L_BLUE_SHIFT) & 0xff; (blue)
- * (pixel32 >> L_ALPHA_SHIFT) & 0xff; (alpha)
- * The functions extractRGBValues() and extractRGBAValues() are
- * provided to do this. Likewise, the pixels can be set
- * directly by shifting, using composeRGBPixel() and
- * composeRGBAPixel().
- *
- * All these operations work properly on both big- and little-endians.
- *
- * (5) A reference count is held within each pix, giving the
- * number of ptrs to the pix. When a pixClone() call
- * is made, the ref count is increased by 1, and
- * when a pixDestroy() call is made, the reference count
- * of the pix is decremented. The pix is only destroyed
- * when the reference count goes to zero.
- *
- * (6) The version numbers (below) are used in the serialization
- * of these data structures. They are placed in the files,
- * and rarely (if ever) change. Provision is currently made for
- * backward compatibility in reading from boxaa version 2.
- *
- * (7) The serialization dependencies are as follows:
- * pixaa : pixa : boxa
- * boxaa : boxa
- * So, for example, pixaa and boxaa can be changed without
- * forcing a change in pixa or boxa. However, if pixa is
- * changed, it forces a change in pixaa, and if boxa is
- * changed, if forces a change in the other three.
- * We define four version numbers:
- * PIXAA_VERSION_NUMBER
- * PIXA_VERSION_NUMBER
- * BOXAA_VERSION_NUMBER
- * BOXA_VERSION_NUMBER
- *
- *-------------------------------------------------------------------------*/
-
-
-
-/*-------------------------------------------------------------------------*
- * Array of pix *
- *-------------------------------------------------------------------------*/
-
- /* Serialization for primary data structures */
-#define PIXAA_VERSION_NUMBER 2 /*!< Version for Pixaa serialization */
-#define PIXA_VERSION_NUMBER 2 /*!< Version for Pixa serialization */
-#define BOXA_VERSION_NUMBER 2 /*!< Version for Boxa serialization */
-#define BOXAA_VERSION_NUMBER 3 /*!< Version for Boxaa serialization */
-
-/*! Array of pix */
-struct Pixa
-{
- l_int32 n; /*!< number of Pix in ptr array */
- l_int32 nalloc; /*!< number of Pix ptrs allocated */
- l_uint32 refcount; /*!< reference count (1 if no clones) */
- struct Pix **pix; /*!< the array of ptrs to pix */
- struct Boxa *boxa; /*!< array of boxes */
-};
-typedef struct Pixa PIXA;
-
-/*! Array of arrays of pix */
-struct Pixaa
-{
- l_int32 n; /*!< number of Pixa in ptr array */
- l_int32 nalloc; /*!< number of Pixa ptrs allocated */
- struct Pixa **pixa; /*!< array of ptrs to pixa */
- struct Boxa *boxa; /*!< array of boxes */
-};
-typedef struct Pixaa PIXAA;
-
-
-/*-------------------------------------------------------------------------*
- * Basic rectangle and rectangle arrays *
- *-------------------------------------------------------------------------*/
-
-/*! Basic rectangle */
-struct Box
-{
- l_int32 x; /*!< left coordinate */
- l_int32 y; /*!< top coordinate */
- l_int32 w; /*!< box width */
- l_int32 h; /*!< box height */
- l_uint32 refcount; /*!< reference count (1 if no clones) */
-};
-typedef struct Box BOX;
-
-/*! Array of Box */
-struct Boxa
-{
- l_int32 n; /*!< number of box in ptr array */
- l_int32 nalloc; /*!< number of box ptrs allocated */
- l_uint32 refcount; /*!< reference count (1 if no clones) */
- struct Box **box; /*!< box ptr array */
-};
-typedef struct Boxa BOXA;
-
-/*! Array of Boxa */
-struct Boxaa
-{
- l_int32 n; /*!< number of boxa in ptr array */
- l_int32 nalloc; /*!< number of boxa ptrs allocated */
- struct Boxa **boxa; /*!< boxa ptr array */
-};
-typedef struct Boxaa BOXAA;
-
-
-/*-------------------------------------------------------------------------*
- * Array of points *
- *-------------------------------------------------------------------------*/
-#define PTA_VERSION_NUMBER 1 /*!< Version for Pta serialization */
-
-/*! Array of points */
-struct Pta
-{
- l_int32 n; /*!< actual number of pts */
- l_int32 nalloc; /*!< size of allocated arrays */
- l_uint32 refcount; /*!< reference count (1 if no clones) */
- l_float32 *x, *y; /*!< arrays of floats */
-};
-typedef struct Pta PTA;
-
-
-/*-------------------------------------------------------------------------*
- * Array of Pta *
- *-------------------------------------------------------------------------*/
-
-/*! Array of Pta */
-struct Ptaa
-{
- l_int32 n; /*!< number of pta in ptr array */
- l_int32 nalloc; /*!< number of pta ptrs allocated */
- struct Pta **pta; /*!< pta ptr array */
-};
-typedef struct Ptaa PTAA;
-
-
-/*-------------------------------------------------------------------------*
- * Pix accumulator container *
- *-------------------------------------------------------------------------*/
-
-/*! Pix accumulator container */
-struct Pixacc
-{
- l_int32 w; /*!< array width */
- l_int32 h; /*!< array height */
- l_int32 offset; /*!< used to allow negative */
- /*!< intermediate results */
- struct Pix *pix; /*!< the 32 bit accumulator pix */
-};
-typedef struct Pixacc PIXACC;
-
-
-/*-------------------------------------------------------------------------*
- * Pix tiling *
- *-------------------------------------------------------------------------*/
-
-/*! Pix tiling */
-struct PixTiling
-{
- struct Pix *pix; /*!< input pix (a clone) */
- l_int32 nx; /*!< number of tiles horizontally */
- l_int32 ny; /*!< number of tiles vertically */
- l_int32 w; /*!< tile width */
- l_int32 h; /*!< tile height */
- l_int32 xoverlap; /*!< overlap on left and right */
- l_int32 yoverlap; /*!< overlap on top and bottom */
- l_int32 strip; /*!< strip for paint; default is TRUE */
-};
-typedef struct PixTiling PIXTILING;
-
-
-/*-------------------------------------------------------------------------*
- * FPix: pix with float array *
- *-------------------------------------------------------------------------*/
-#define FPIX_VERSION_NUMBER 2 /*!< Version for FPix serialization */
-
-/*! Pix with float array */
-struct FPix
-{
- l_int32 w; /*!< width in pixels */
- l_int32 h; /*!< height in pixels */
- l_int32 wpl; /*!< 32-bit words/line */
- l_uint32 refcount; /*!< reference count (1 if no clones) */
- l_int32 xres; /*!< image res (ppi) in x direction */
- /*!< (use 0 if unknown) */
- l_int32 yres; /*!< image res (ppi) in y direction */
- /*!< (use 0 if unknown) */
- l_float32 *data; /*!< the float image data */
-};
-typedef struct FPix FPIX;
-
-/*! Array of FPix */
-struct FPixa
-{
- l_int32 n; /*!< number of fpix in ptr array */
- l_int32 nalloc; /*!< number of fpix ptrs allocated */
- l_uint32 refcount; /*!< reference count (1 if no clones) */
- struct FPix **fpix; /*!< the array of ptrs to fpix */
-};
-typedef struct FPixa FPIXA;
-
-
-/*-------------------------------------------------------------------------*
- * DPix: pix with double array *
- *-------------------------------------------------------------------------*/
-#define DPIX_VERSION_NUMBER 2 /*!< Version for DPix serialization */
-
-/*! Pix with double array */
-struct DPix
-{
- l_int32 w; /*!< width in pixels */
- l_int32 h; /*!< height in pixels */
- l_int32 wpl; /*!< 32-bit words/line */
- l_uint32 refcount; /*!< reference count (1 if no clones) */
- l_int32 xres; /*!< image res (ppi) in x direction */
- /*!< (use 0 if unknown) */
- l_int32 yres; /*!< image res (ppi) in y direction */
- /*!< (use 0 if unknown) */
- l_float64 *data; /*!< the double image data */
-};
-typedef struct DPix DPIX;
-
-
-/*-------------------------------------------------------------------------*
- * PixComp: compressed pix *
- *-------------------------------------------------------------------------*/
-
-/*! Compressed Pix */
-struct PixComp
-{
- l_int32 w; /*!< width in pixels */
- l_int32 h; /*!< height in pixels */
- l_int32 d; /*!< depth in bits */
- l_int32 xres; /*!< image res (ppi) in x direction */
- /*!< (use 0 if unknown) */
- l_int32 yres; /*!< image res (ppi) in y direction */
- /*!< (use 0 if unknown) */
- l_int32 comptype; /*!< compressed format (IFF_TIFF_G4, */
- /*!< IFF_PNG, IFF_JFIF_JPEG) */
- char *text; /*!< text string associated with pix */
- l_int32 cmapflag; /*!< flag (1 for cmap, 0 otherwise) */
- l_uint8 *data; /*!< the compressed image data */
- size_t size; /*!< size of the data array */
-};
-typedef struct PixComp PIXC;
-
-
-/*-------------------------------------------------------------------------*
- * PixaComp: array of compressed pix *
- *-------------------------------------------------------------------------*/
-#define PIXACOMP_VERSION_NUMBER 2 /*!< Version for PixaComp serialization */
-
-/*! Array of compressed pix */
-struct PixaComp
-{
- l_int32 n; /*!< number of PixComp in ptr array */
- l_int32 nalloc; /*!< number of PixComp ptrs allocated */
- l_int32 offset; /*!< indexing offset into ptr array */
- struct PixComp **pixc; /*!< the array of ptrs to PixComp */
- struct Boxa *boxa; /*!< array of boxes */
-};
-typedef struct PixaComp PIXAC;
-
-
-/*-------------------------------------------------------------------------*
- * Access and storage flags *
- *-------------------------------------------------------------------------*/
-/*
- *
- * For Pix, Box, Pta and Numa, there are 3 standard methods for handling
- * the retrieval or insertion of a struct:
- * (1) direct insertion (Don't do this if there is another handle
- * somewhere to this same struct!)
- * (2) copy (Always safe, sets up a refcount of 1 on the new object.
- * Can be undesirable if very large, such as an image or
- * an array of images.)
- * (3) clone (Makes another handle to the same struct, and bumps the
- * refcount up by 1. OK to use except in two situations:
- * (a) You change data through one of the handles but don't
- * want those changes to be seen by the other handle.
- * (b) The application is multi-threaded. Because the clone
- * operation is not atomic (e.g., locked with a mutex),
- * it is possible to end up with an incorrect ref count,
- * causing either a memory leak or a crash.
- *
- * For Pixa and Boxa, which are structs that hold an array of clonable
- * structs, there is an additional method:
- * (4) copy-clone (Makes a new higher-level struct with a refcount
- * of 1, but clones all the structs in the array.)
- *
- * Unlike the other structs, when retrieving a string from an Sarray,
- * you are allowed to get a handle without a copy or clone (i.e., the
- * string is not owned by the handle). You must not either free the string
- * or insert it in some other struct that would own it. Specifically,
- * for an Sarray, the copyflag for retrieval is either:
- * L_COPY or L_NOCOPY
- * and for insertion, the copyflag is either:
- * L_COPY or one of {L_INSERT , L_NOCOPY} (the latter are equivalent
- * for insertion))
- * Typical patterns are:
- * (1) Reference a string in an Sarray with L_NOCOPY and insert a copy
- * of it in another Sarray with L_COPY.
- * (2) Copy a string from an Sarray with L_COPY and insert it in
- * another Sarray with L_INSERT (or L_NOCOPY).
- * In both cases, a copy is made and both Sarrays own their instance
- * of that string.
- *
- */
-
-/*! Object Access */
-enum {
- L_NOCOPY = 0, /*!< do not copy the object; do not delete the ptr */
- L_INSERT = L_NOCOPY, /*!< stuff it in; do not copy or clone */
- L_COPY = 1, /*!< make/use a copy of the object */
- L_CLONE = 2, /*!< make/use clone (ref count) of the object */
- L_COPY_CLONE = 3 /*!< make a new array object (e.g., pixa) and fill */
- /*!< the array with clones (e.g., pix) */
-};
-
-
-/*----------------------------------------------------------------------------*
- * Sort flags *
- *----------------------------------------------------------------------------*/
-/*! Sort Mode */
-enum {
- L_SHELL_SORT = 1, /*!< use shell sort */
- L_BIN_SORT = 2 /*!< use bin sort */
-};
-
-/*! Sort Order */
-enum {
- L_SORT_INCREASING = 1, /*!< sort in increasing order */
- L_SORT_DECREASING = 2 /*!< sort in decreasing order */
-};
-
-/*! Sort Type */
-enum {
- L_SORT_BY_X = 1, /*!< sort box or c.c. by left edge location */
- L_SORT_BY_Y = 2, /*!< sort box or c.c. by top edge location */
- L_SORT_BY_RIGHT = 3, /*!< sort box or c.c. by right edge location */
- L_SORT_BY_BOT = 4, /*!< sort box or c.c. by bot edge location */
- L_SORT_BY_WIDTH = 5, /*!< sort box or c.c. by width */
- L_SORT_BY_HEIGHT = 6, /*!< sort box or c.c. by height */
- L_SORT_BY_MIN_DIMENSION = 7, /*!< sort box or c.c. by min dimension */
- L_SORT_BY_MAX_DIMENSION = 8, /*!< sort box or c.c. by max dimension */
- L_SORT_BY_PERIMETER = 9, /*!< sort box or c.c. by perimeter */
- L_SORT_BY_AREA = 10, /*!< sort box or c.c. by area */
- L_SORT_BY_ASPECT_RATIO = 11 /*!< sort box or c.c. by width/height ratio */
-};
-
-
-/*---------------------------------------------------------------------------*
- * Blend flags *
- *---------------------------------------------------------------------------*/
-/*! Blend Types */
-enum {
- L_BLEND_WITH_INVERSE = 1, /*!< add some of src inverse to itself */
- L_BLEND_TO_WHITE = 2, /*!< shift src colors towards white */
- L_BLEND_TO_BLACK = 3, /*!< shift src colors towards black */
- L_BLEND_GRAY = 4, /*!< blend src directly with blender */
- L_BLEND_GRAY_WITH_INVERSE = 5 /*!< add amount of src inverse to itself, */
- /*!< based on blender pix value */
-};
-
-/*! Paint Selection */
-enum {
- L_PAINT_LIGHT = 1, /*!< colorize non-black pixels */
- L_PAINT_DARK = 2 /*!< colorize non-white pixels */
-};
-
-
-/*-------------------------------------------------------------------------*
- * Graphics pixel setting *
- *-------------------------------------------------------------------------*/
-/*! Pixel Setting */
-enum {
- L_SET_PIXELS = 1, /*!< set all bits in each pixel to 1 */
- L_CLEAR_PIXELS = 2, /*!< set all bits in each pixel to 0 */
- L_FLIP_PIXELS = 3 /*!< flip all bits in each pixel */
-};
-
-
-/*-------------------------------------------------------------------------*
- * Size and location filter flags *
- *-------------------------------------------------------------------------*/
-/*! Size Comparison */
-enum {
- L_SELECT_IF_LT = 1, /*!< save if value is less than threshold */
- L_SELECT_IF_GT = 2, /*!< save if value is more than threshold */
- L_SELECT_IF_LTE = 3, /*!< save if value is <= to the threshold */
- L_SELECT_IF_GTE = 4 /*!< save if value is >= to the threshold */
-};
-
-/*! Size Selection */
-enum {
- L_SELECT_BY_WIDTH = 1, /*!< select by width; 1 bpp */
- L_SELECT_BY_HEIGHT = 2, /*!< select by height; 1 bpp */
- L_SELECT_BY_MAX_DIMENSION = 3, /*!< select by max of width and */
- /*!< height; 1 bpp */
- L_SELECT_BY_AREA = 4, /*!< select by foreground area; 1 bpp */
- L_SELECT_BY_PERIMETER = 5 /*!< select by perimeter; 1 bpp */
-};
-
-/*! Location Filter */
-enum {
- L_SELECT_WIDTH = 1, /*!< width must satisfy constraint */
- L_SELECT_HEIGHT = 2, /*!< height must satisfy constraint */
- L_SELECT_XVAL = 3, /*!< x value must satisfy constraint */
- L_SELECT_YVAL = 4, /*!< y value must satisfy constraint */
- L_SELECT_IF_EITHER = 5, /*!< either width or height (or xval */
- /*!< or yval) can satisfy constraint */
- L_SELECT_IF_BOTH = 6 /*!< both width and height (or xval */
- /*!< and yval must satisfy constraint */
-};
-
-/*! Boxa Check */
-enum {
- L_CHECK_WIDTH = 1, /*!< check and possibly modify width */
- L_CHECK_HEIGHT = 2, /*!< check and possibly modify height */
- L_CHECK_BOTH = 3 /*!< check and possibly modify both */
-};
-
-
-/*-------------------------------------------------------------------------*
- * Color component selection flags *
- *-------------------------------------------------------------------------*/
-/*! Color Selection */
-enum {
- L_SELECT_RED = 1, /*!< use red component */
- L_SELECT_GREEN = 2, /*!< use green component */
- L_SELECT_BLUE = 3, /*!< use blue component */
- L_SELECT_MIN = 4, /*!< use min color component */
- L_SELECT_MAX = 5, /*!< use max color component */
- L_SELECT_AVERAGE = 6, /*!< use average of color components */
- L_SELECT_HUE = 7, /*!< use hue value (in HSV color space) */
- L_SELECT_SATURATION = 8 /*!< use saturation value (in HSV space) */
-};
-
-
-/*-------------------------------------------------------------------------*
- * 16-bit conversion flags *
- *-------------------------------------------------------------------------*/
-/*! 16-bit Conversion */
-enum {
- L_LS_BYTE = 1, /*!< use LSB */
- L_MS_BYTE = 2, /*!< use MSB */
- L_AUTO_BYTE = 3, /*!< use LSB if max(val) < 256; else MSB */
- L_CLIP_TO_FF = 4, /*!< use max(val, 255) */
- L_LS_TWO_BYTES = 5, /*!< use two LSB */
- L_MS_TWO_BYTES = 6, /*!< use two MSB */
- L_CLIP_TO_FFFF = 7 /*!< use max(val, 65535) */
-};
-
-
-/*-------------------------------------------------------------------------*
- * Rotate and shear flags *
- *-------------------------------------------------------------------------*/
-/*! Rotation Type */
-enum {
- L_ROTATE_AREA_MAP = 1, /*!< use area map rotation, if possible */
- L_ROTATE_SHEAR = 2, /*!< use shear rotation */
- L_ROTATE_SAMPLING = 3 /*!< use sampling */
-};
-
-/*! Background Color */
-enum {
- L_BRING_IN_WHITE = 1, /*!< bring in white pixels from the outside */
- L_BRING_IN_BLACK = 2 /*!< bring in black pixels from the outside */
-};
-
-/*! Shear Point */
-enum {
- L_SHEAR_ABOUT_CORNER = 1, /*!< shear image about UL corner */
- L_SHEAR_ABOUT_CENTER = 2 /*!< shear image about center */
-};
-
-
-/*-------------------------------------------------------------------------*
- * Affine transform order flags *
- *-------------------------------------------------------------------------*/
-/*! Affine Transform Order */
-enum {
- L_TR_SC_RO = 1, /*!< translate, scale, rotate */
- L_SC_RO_TR = 2, /*!< scale, rotate, translate */
- L_RO_TR_SC = 3, /*!< rotate, translate, scale */
- L_TR_RO_SC = 4, /*!< translate, rotate, scale */
- L_RO_SC_TR = 5, /*!< rotate, scale, translate */
- L_SC_TR_RO = 6 /*!< scale, translate, rotate */
-};
-
-
-/*-------------------------------------------------------------------------*
- * Grayscale filling flags *
- *-------------------------------------------------------------------------*/
-/*! Grayscale Fill */
-enum {
- L_FILL_WHITE = 1, /*!< fill white pixels (e.g, in fg map) */
- L_FILL_BLACK = 2 /*!< fill black pixels (e.g., in bg map) */
-};
-
-
-/*-------------------------------------------------------------------------*
- * Flags for setting to white or black *
- *-------------------------------------------------------------------------*/
-/*! BlackWhite Set */
-enum {
- L_SET_WHITE = 1, /*!< set pixels to white */
- L_SET_BLACK = 2 /*!< set pixels to black */
-};
-
-
-/*-------------------------------------------------------------------------*
- * Flags for getting white or black value *
- *-------------------------------------------------------------------------*/
-/*! BlackWhite Get */
-enum {
- L_GET_WHITE_VAL = 1, /*!< get white pixel value */
- L_GET_BLACK_VAL = 2 /*!< get black pixel value */
-};
-
-
-/*-------------------------------------------------------------------------*
- * Flags for 8 bit and 16 bit pixel sums *
- *-------------------------------------------------------------------------*/
-/*! BlackWhite Sum */
-enum {
- L_WHITE_IS_MAX = 1, /*!< white pixels are 0xff or 0xffff; black are 0 */
- L_BLACK_IS_MAX = 2 /*!< black pixels are 0xff or 0xffff; white are 0 */
-};
-
-
-/*-------------------------------------------------------------------------*
- * Dither parameters *
- * If within this grayscale distance from black or white, *
- * do not propagate excess or deficit to neighboring pixels. *
- *-------------------------------------------------------------------------*/
-/*! Dither Distance */
-enum {
- DEFAULT_CLIP_LOWER_1 = 10, /*!< dist to black with no prop; 1 bpp */
- DEFAULT_CLIP_UPPER_1 = 10, /*!< dist to black with no prop; 1 bpp */
- DEFAULT_CLIP_LOWER_2 = 5, /*!< dist to black with no prop; 2 bpp */
- DEFAULT_CLIP_UPPER_2 = 5 /*!< dist to black with no prop; 2 bpp */
-};
-
-
-/*-------------------------------------------------------------------------*
- * Distance type flags *
- *-------------------------------------------------------------------------*/
-/*! Distance Type */
-enum {
- L_MANHATTAN_DISTANCE = 1, /*!< L1 distance (e.g., in color space) */
- L_EUCLIDEAN_DISTANCE = 2 /*!< L2 distance */
-};
-
-
-/*-------------------------------------------------------------------------*
- * Distance Value flags *
- *-------------------------------------------------------------------------*/
-/*! Distance Value */
-enum {
- L_NEGATIVE = 1, /*!< values < 0 */
- L_NON_NEGATIVE = 2, /*!< values >= 0 */
- L_POSITIVE = 3, /*!< values > 0 */
- L_NON_POSITIVE = 4, /*!< values <= 0 */
- L_ZERO = 5, /*!< values = 0 */
- L_ALL = 6 /*!< all values */
-};
-
-
-/*-------------------------------------------------------------------------*
- * Statistical measures *
- *-------------------------------------------------------------------------*/
-/*! Stats Type */
-enum {
- L_MEAN_ABSVAL = 1, /*!< average of abs values */
- L_MEDIAN_VAL = 2, /*!< median value of set */
- L_MODE_VAL = 3, /*!< mode value of set */
- L_MODE_COUNT = 4, /*!< mode count of set */
- L_ROOT_MEAN_SQUARE = 5, /*!< rms of values */
- L_STANDARD_DEVIATION = 6, /*!< standard deviation from mean */
- L_VARIANCE = 7 /*!< variance of values */
-};
-
-
-/*-------------------------------------------------------------------------*
- * Set index selection flags *
- *-------------------------------------------------------------------------*/
-/*! Index Selection */
-enum {
- L_CHOOSE_CONSECUTIVE = 1, /*!< select 'n' consecutive */
- L_CHOOSE_SKIP_BY = 2 /*!< select at intervals of 'n' */
-};
-
-
-/*-------------------------------------------------------------------------*
- * Text orientation flags *
- *-------------------------------------------------------------------------*/
-/*! Text Orientation */
-enum {
- L_TEXT_ORIENT_UNKNOWN = 0, /*!< low confidence on text orientation */
- L_TEXT_ORIENT_UP = 1, /*!< portrait, text rightside-up */
- L_TEXT_ORIENT_LEFT = 2, /*!< landscape, text up to left */
- L_TEXT_ORIENT_DOWN = 3, /*!< portrait, text upside-down */
- L_TEXT_ORIENT_RIGHT = 4 /*!< landscape, text up to right */
-};
-
-
-/*-------------------------------------------------------------------------*
- * Edge orientation flags *
- *-------------------------------------------------------------------------*/
-/*! Edge Orientation */
-enum {
- L_HORIZONTAL_EDGES = 0, /*!< filters for horizontal edges */
- L_VERTICAL_EDGES = 1, /*!< filters for vertical edges */
- L_ALL_EDGES = 2 /*!< filters for all edges */
-};
-
-
-/*-------------------------------------------------------------------------*
- * Line orientation flags *
- *-------------------------------------------------------------------------*/
-/*! Line Orientation */
-enum {
- L_HORIZONTAL_LINE = 0, /*!< horizontal line */
- L_POS_SLOPE_LINE = 1, /*!< 45 degree line with positive slope */
- L_VERTICAL_LINE = 2, /*!< vertical line */
- L_NEG_SLOPE_LINE = 3, /*!< 45 degree line with negative slope */
- L_OBLIQUE_LINE = 4 /*!< neither horizontal nor vertical */
-};
-
-
-/*-------------------------------------------------------------------------*
- * Image orientation flags *
- *-------------------------------------------------------------------------*/
-/*! Image Orientation */
-enum {
- L_PORTRAIT_MODE = 0, /*!< typical: page is viewed with height > width */
- L_LANDSCAPE_MODE = 1 /*!< page is viewed at 90 deg to portrait mode */
-};
-
-
-/*-------------------------------------------------------------------------*
- * Scan direction flags *
- *-------------------------------------------------------------------------*/
-/*! Scan Direction */
-enum {
- L_FROM_LEFT = 0, /*!< scan from left */
- L_FROM_RIGHT = 1, /*!< scan from right */
- L_FROM_TOP = 2, /*!< scan from top */
- L_FROM_BOT = 3, /*!< scan from bottom */
- L_SCAN_NEGATIVE = 4, /*!< scan in negative direction */
- L_SCAN_POSITIVE = 5, /*!< scan in positive direction */
- L_SCAN_BOTH = 6, /*!< scan in both directions */
- L_SCAN_HORIZONTAL = 7, /*!< horizontal scan (direction unimportant) */
- L_SCAN_VERTICAL = 8 /*!< vertical scan (direction unimportant) */
-};
-
-
-/*-------------------------------------------------------------------------*
- * Box size adjustment and location flags *
- *-------------------------------------------------------------------------*/
-/*! Box Adjustment */
-enum {
- L_ADJUST_SKIP = 0, /*!< do not adjust */
- L_ADJUST_LEFT = 1, /*!< adjust left edge */
- L_ADJUST_RIGHT = 2, /*!< adjust right edge */
- L_ADJUST_LEFT_AND_RIGHT = 3, /*!< adjust both left and right edges */
- L_ADJUST_TOP = 4, /*!< adjust top edge */
- L_ADJUST_BOT = 5, /*!< adjust bottom edge */
- L_ADJUST_TOP_AND_BOT = 6, /*!< adjust both top and bottom edges */
- L_ADJUST_CHOOSE_MIN = 7, /*!< choose the min median value */
- L_ADJUST_CHOOSE_MAX = 8, /*!< choose the max median value */
- L_SET_LEFT = 9, /*!< set left side to a given value */
- L_SET_RIGHT = 10, /*!< set right side to a given value */
- L_SET_TOP = 11, /*!< set top side to a given value */
- L_SET_BOT = 12, /*!< set bottom side to a given value */
- L_GET_LEFT = 13, /*!< get left side location */
- L_GET_RIGHT = 14, /*!< get right side location */
- L_GET_TOP = 15, /*!< get top side location */
- L_GET_BOT = 16 /*!< get bottom side location */
-};
-
-
-/*-------------------------------------------------------------------------*
- * Flags for modifying box boundaries using a second box *
- *-------------------------------------------------------------------------*/
-/*! Box Boundary Mod */
-enum {
- L_USE_MINSIZE = 1, /*!< use boundaries giving min size */
- L_USE_MAXSIZE = 2, /*!< use boundaries giving max size */
- L_SUB_ON_LOC_DIFF = 3, /*!< modify boundary if big location diff */
- L_SUB_ON_SIZE_DIFF = 4, /*!< modify boundary if big size diff */
- L_USE_CAPPED_MIN = 5, /*!< modify boundary with capped min */
- L_USE_CAPPED_MAX = 6 /*!< modify boundary with capped max */
-};
-
-
-/*-------------------------------------------------------------------------*
- * Handling overlapping bounding boxes in boxa *
- *-------------------------------------------------------------------------*/
-/*! Box Overlap Mod */
-enum {
- L_COMBINE = 1, /*!< resize to bounding region; remove smaller */
- L_REMOVE_SMALL = 2 /*!< only remove smaller */
-};
-
-
-/*-------------------------------------------------------------------------*
- * Selecting or making a box from two (intersecting) boxes *
- *-------------------------------------------------------------------------*/
-/*! Box Combine or Select */
-enum {
- L_GEOMETRIC_UNION = 1, /*!< use union of two boxes */
- L_GEOMETRIC_INTERSECTION = 2, /*!< use intersection of two boxes */
- L_LARGEST_AREA = 3, /*!< use box with largest area */
- L_SMALLEST_AREA = 4 /*!< use box with smallest area */
-};
-
-
-/*-------------------------------------------------------------------------*
- * Flags for replacing invalid boxes *
- *-------------------------------------------------------------------------*/
-/*! Box Replacement */
-enum {
- L_USE_ALL_BOXES = 1, /*!< consider all boxes in the sequence */
- L_USE_SAME_PARITY_BOXES = 2 /*!< consider boxes with the same parity */
-};
-
-
-/*-------------------------------------------------------------------------*
- * Flags for box corners and center *
- *-------------------------------------------------------------------------*/
-/*! Box Corners and Center */
-enum {
- L_UPPER_LEFT = 1, /*!< UL corner */
- L_UPPER_RIGHT = 2, /*!< UR corner */
- L_LOWER_LEFT = 3, /*!< LL corner */
- L_LOWER_RIGHT = 4, /*!< LR corner */
- L_BOX_CENTER = 5 /*!< center */
-};
-
-
-/*-------------------------------------------------------------------------*
- * Horizontal warp *
- *-------------------------------------------------------------------------*/
-/*! Horiz Warp Stretch */
-enum {
- L_WARP_TO_LEFT = 1, /*!< increasing stretch or contraction to left */
- L_WARP_TO_RIGHT = 2 /*!< increasing stretch or contraction to right */
-};
-
-/*! Horiz Warp Mode */
-enum {
- L_LINEAR_WARP = 1, /*!< stretch or contraction grows linearly */
- L_QUADRATIC_WARP = 2 /*!< stretch or contraction grows quadratically */
-};
-
-
-/*-------------------------------------------------------------------------*
- * Pixel selection for resampling *
- *-------------------------------------------------------------------------*/
-/*! Pixel Selection */
-enum {
- L_INTERPOLATED = 1, /*!< linear interpolation from src pixels */
- L_SAMPLED = 2 /*!< nearest src pixel sampling only */
-};
-
-
-/*-------------------------------------------------------------------------*
- * Thinning flags *
- *-------------------------------------------------------------------------*/
-/*! Thinning Polarity */
-enum {
- L_THIN_FG = 1, /*!< thin foreground of 1 bpp image */
- L_THIN_BG = 2 /*!< thin background of 1 bpp image */
-};
-
-
-/*-------------------------------------------------------------------------*
- * Runlength flags *
- *-------------------------------------------------------------------------*/
-/*! Runlength Direction */
-enum {
- L_HORIZONTAL_RUNS = 0, /*!< determine runlengths of horizontal runs */
- L_VERTICAL_RUNS = 1 /*!< determine runlengths of vertical runs */
-};
-
-
-/*-------------------------------------------------------------------------*
- * Edge filter flags *
- *-------------------------------------------------------------------------*/
-/*! Edge Filter */
-enum {
- L_SOBEL_EDGE = 1, /*!< Sobel edge filter */
- L_TWO_SIDED_EDGE = 2 /*!< Two-sided edge filter */
-};
-
-
-/*-------------------------------------------------------------------------*
- * Subpixel color component ordering in LCD display *
- *-------------------------------------------------------------------------*/
-/*! Subpixel Color Order */
-enum {
- L_SUBPIXEL_ORDER_RGB = 1, /*!< sensor order left-to-right RGB */
- L_SUBPIXEL_ORDER_BGR = 2, /*!< sensor order left-to-right BGR */
- L_SUBPIXEL_ORDER_VRGB = 3, /*!< sensor order top-to-bottom RGB */
- L_SUBPIXEL_ORDER_VBGR = 4 /*!< sensor order top-to-bottom BGR */
-};
-
-
-/*-------------------------------------------------------------------------*
- * HSV histogram flags *
- *-------------------------------------------------------------------------*/
-/*! HSV Histogram */
-enum {
- L_HS_HISTO = 1, /*!< Use hue-saturation histogram */
- L_HV_HISTO = 2, /*!< Use hue-value histogram */
- L_SV_HISTO = 3 /*!< Use saturation-value histogram */
-};
-
-
-/*-------------------------------------------------------------------------*
- * HSV Region flags (inclusion, exclusion) *
- *-------------------------------------------------------------------------*/
-/*! HSV Region */
-enum {
- L_INCLUDE_REGION = 1, /*!< Use pixels with specified HSV region */
- L_EXCLUDE_REGION = 2 /*!< Use pixels outside HSV region */
-};
-
-
-/*-------------------------------------------------------------------------*
- * Location flags for adding text to a pix *
- *-------------------------------------------------------------------------*/
-/*! Add Text Location */
-enum {
- L_ADD_ABOVE = 1, /*!< Add text above the image */
- L_ADD_BELOW = 2, /*!< Add text below the image */
- L_ADD_LEFT = 3, /*!< Add text to the left of the image */
- L_ADD_RIGHT = 4, /*!< Add text to the right of the image */
- L_ADD_AT_TOP = 5, /*!< Add text over the top of the image */
- L_ADD_AT_BOT = 6, /*!< Add text over the bottom of the image */
- L_ADD_AT_LEFT = 7, /*!< Add text over left side of the image */
- L_ADD_AT_RIGHT = 8 /*!< Add text over right side of the image */
-};
-
-
-/*-------------------------------------------------------------------------*
- * Flags for plotting on a pix *
- *-------------------------------------------------------------------------*/
-/*! Pix Plot */
-enum {
- L_PLOT_AT_TOP = 1, /*!< Plot horizontally at top */
- L_PLOT_AT_MID_HORIZ = 2, /*!< Plot horizontally at middle */
- L_PLOT_AT_BOT = 3, /*!< Plot horizontally at bottom */
- L_PLOT_AT_LEFT = 4, /*!< Plot vertically at left */
- L_PLOT_AT_MID_VERT = 5, /*!< Plot vertically at middle */
- L_PLOT_AT_RIGHT = 6 /*!< Plot vertically at right */
-};
-
-
-/*-------------------------------------------------------------------------*
- * Flags for making simple masks *
- *-------------------------------------------------------------------------*/
-/*! Mask Generation */
-enum {
- L_USE_INNER = 1, /*!< Select the interior part */
- L_USE_OUTER = 2 /*!< Select the outer part (e.g., a frame) */
-};
-
-
-/*-------------------------------------------------------------------------*
- * Flags for selecting display program *
- *-------------------------------------------------------------------------*/
-/*! Display Program */
-enum {
- L_DISPLAY_WITH_XZGV = 1, /*!< Use xzgv with pixDisplay() */
- L_DISPLAY_WITH_XLI = 2, /*!< Use xli with pixDisplay() */
- L_DISPLAY_WITH_XV = 3, /*!< Use xv with pixDisplay() */
- L_DISPLAY_WITH_IV = 4, /*!< Use irfvanview (win) with pixDisplay() */
- L_DISPLAY_WITH_OPEN = 5 /*!< Use open (apple) with pixDisplay() */
-};
-
-/*-------------------------------------------------------------------------*
- * Flag(s) used in the 'special' pix field for non-default operations *
- * - 0 is default for chroma sampling in jpeg *
- * - 10-19 are used for zlib compression in png write *
- * - 4 and 8 are used for specifying connectivity in labelling *
- *-------------------------------------------------------------------------*/
-/*! Flags used in Pix::special */
-enum {
- L_NO_CHROMA_SAMPLING_JPEG = 1 /*!< Write full resolution chroma */
-};
-
-
-/*-------------------------------------------------------------------------*
- * Handling negative values in conversion to unsigned int *
- *-------------------------------------------------------------------------*/
-/*! Negative Value */
-enum {
- L_CLIP_TO_ZERO = 1, /*!< Clip negative values to 0 */
- L_TAKE_ABSVAL = 2 /*!< Convert to positive using L_ABS() */
-};
-
-
-/*-------------------------------------------------------------------------*
- * Relative to zero flags *
- *-------------------------------------------------------------------------*/
-/*! Relative To Zero */
-enum {
- L_LESS_THAN_ZERO = 1, /*!< Choose values less than zero */
- L_EQUAL_TO_ZERO = 2, /*!< Choose values equal to zero */
- L_GREATER_THAN_ZERO = 3 /*!< Choose values greater than zero */
-};
-
-
-/*-------------------------------------------------------------------------*
- * Flags for adding or removing trailing slash from string *
- *-------------------------------------------------------------------------*/
-/*! Trailing Slash */
-enum {
- L_ADD_TRAIL_SLASH = 1, /*!< Add trailing slash to string */
- L_REMOVE_TRAIL_SLASH = 2 /*!< Remove trailing slash from string */
-};
-
-
-/*-------------------------------------------------------------------------*
- * Pix allocator and deallocator function types *
- *-------------------------------------------------------------------------*/
-/*! Allocator function type */
-typedef void *(*alloc_fn)(size_t);
-
-/*! Deallocator function type */
-typedef void (*dealloc_fn)(void *);
-
-
-#endif /* LEPTONICA_PIX_H */
diff --git a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pix1.c b/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pix1.c
deleted file mode 100644
index 527d42fe..00000000
--- a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pix1.c
+++ /dev/null
@@ -1,1930 +0,0 @@
-/*====================================================================*
- - Copyright (C) 2001 Leptonica. All rights reserved.
- -
- - Redistribution and use in source and binary forms, with or without
- - modification, are permitted provided that the following conditions
- - are met:
- - 1. Redistributions of source code must retain the above copyright
- - notice, this list of conditions and the following disclaimer.
- - 2. Redistributions in binary form must reproduce the above
- - copyright notice, this list of conditions and the following
- - disclaimer in the documentation and/or other materials
- - provided with the distribution.
- -
- - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- - ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- - LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- - A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL ANY
- - CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
- - EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
- - PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
- - PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
- - OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
- - NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- *====================================================================*/
-
-/*!
- * \file pix1.c
- *
- *
- * The pixN.c {N = 1,2,3,4,5} files are sorted by the type of operation.
- * The primary functions in these files are:
- *
- * pix1.c: constructors, destructors and field accessors
- * pix2.c: pixel poking of image, pad and border pixels
- * pix3.c: masking and logical ops, counting, mirrored tiling
- * pix4.c: histograms, statistics, fg/bg estimation
- * pix5.c: property measurements, rectangle extraction
- *
- *
- * This file has the basic constructors, destructors and field accessors
- *
- * Pix memory management (allows custom allocator and deallocator)
- * static void *pix_malloc()
- * static void pix_free()
- * void setPixMemoryManager()
- *
- * Pix creation
- * PIX *pixCreate()
- * PIX *pixCreateNoInit()
- * PIX *pixCreateTemplate()
- * PIX *pixCreateTemplateNoInit()
- * PIX *pixCreateWithCmap()
- * PIX *pixCreateHeader()
- * PIX *pixClone()
- *
- * Pix destruction
- * void pixDestroy()
- * static void pixFree()
- *
- * Pix copy
- * PIX *pixCopy()
- * l_int32 pixResizeImageData()
- * l_int32 pixCopyColormap()
- * l_int32 pixSizesEqual()
- * l_int32 pixTransferAllData()
- * l_int32 pixSwapAndDestroy()
- *
- * Pix accessors
- * l_int32 pixGetWidth()
- * l_int32 pixSetWidth()
- * l_int32 pixGetHeight()
- * l_int32 pixSetHeight()
- * l_int32 pixGetDepth()
- * l_int32 pixSetDepth()
- * l_int32 pixGetDimensions()
- * l_int32 pixSetDimensions()
- * l_int32 pixCopyDimensions()
- * l_int32 pixGetSpp()
- * l_int32 pixSetSpp()
- * l_int32 pixCopySpp()
- * l_int32 pixGetWpl()
- * l_int32 pixSetWpl()
- * l_int32 pixGetRefcount()
- * l_int32 pixChangeRefcount()
- * l_uint32 pixGetXRes()
- * l_int32 pixSetXRes()
- * l_uint32 pixGetYRes()
- * l_int32 pixSetYRes()
- * l_int32 pixGetResolution()
- * l_int32 pixSetResolution()
- * l_int32 pixCopyResolution()
- * l_int32 pixScaleResolution()
- * l_int32 pixGetInputFormat()
- * l_int32 pixSetInputFormat()
- * l_int32 pixCopyInputFormat()
- * l_int32 pixSetSpecial()
- * char *pixGetText()
- * l_int32 pixSetText()
- * l_int32 pixAddText()
- * l_int32 pixCopyText()
- * PIXCMAP *pixGetColormap()
- * l_int32 pixSetColormap()
- * l_int32 pixDestroyColormap()
- * l_uint32 *pixGetData()
- * l_int32 pixSetData()
- * l_uint32 *pixExtractData()
- * l_int32 pixFreeData()
- *
- * Pix line ptrs
- * void **pixGetLinePtrs()
- *
- * Pix debug
- * l_int32 pixPrintStreamInfo()
- *
- *
- * !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
- * Important notes on direct management of pix image data
- * !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
- *
- * Custom allocator and deallocator
- * --------------------------------
- *
- * At the lowest level, you can specify the function that does the
- * allocation and deallocation of the data field in the pix.
- * By default, this is malloc and free. However, by calling
- * setPixMemoryManager(), custom functions can be substituted.
- * When using this, keep two things in mind:
- *
- * (1) Call setPixMemoryManager() before any pix have been allocated
- * (2) Destroy all pix as usual, in order to prevent leaks.
- *
- * In pixalloc.c, we provide an example custom allocator and deallocator.
- * To use it, you must call pmsCreate() before any pix have been allocated
- * and pmsDestroy() at the end after all pix have been destroyed.
- *
- *
- * Direct manipulation of the pix data field
- * -----------------------------------------
- *
- * Memory management of the (image) data field in the pix is
- * handled differently from that in the colormap or text fields.
- * For colormap and text, the functions pixSetColormap() and
- * pixSetText() remove the existing heap data and insert the
- * new data. For the image data, pixSetData() just reassigns the
- * data field; any existing data will be lost if there isn't
- * another handle for it.
- *
- * Why is pixSetData() limited in this way? Because the image
- * data can be very large, we need flexible ways to handle it,
- * particularly when you want to re-use the data in a different
- * context without making a copy. Here are some different
- * things you might want to do:
- *
- * (1) Use pixCopy(pixd, pixs) where pixd is not the same size
- * as pixs. This will remove the data in pixd, allocate a
- * new data field in pixd, and copy the data from pixs, leaving
- * pixs unchanged.
- *
- * (2) Use pixTransferAllData(pixd, &pixs, ...) to transfer the
- * data from pixs to pixd without making a copy of it. If
- * pixs is not cloned, this will do the transfer and destroy pixs.
- * But if the refcount of pixs is greater than 1, it just copies
- * the data and decrements the ref count.
- *
- * (3) Use pixSwapAndDestroy(pixd, &pixs) to replace pixs by an
- * existing pixd. This is similar to pixTransferAllData(), but
- * simpler, in that it never makes any copies and if pixs is
- * cloned, the other references are not changed by this operation.
- *
- * (4) Use pixExtractData() to extract the image data from the pix
- * without copying if possible. This could be used, for example,
- * to convert from a pix to some other data structure with minimal
- * heap allocation. After the data is extracated, the pixels can
- * be munged and used in another context. However, the danger
- * here is that the pix might have a refcount > 1, in which case
- * a copy of the data must be made and the input pix left unchanged.
- * If there are no clones, the image data can be extracted without
- * a copy, and the data ptr in the pix must be nulled before
- * destroying it because the pix will no longer 'own' the data.
- *
- * We have provided accessors and functions here that should be
- * sufficient so that you can do anything you want without
- * explicitly referencing any of the pix member fields.
- *
- * However, to avoid memory smashes and leaks when doing special operations
- * on the pix data field, look carefully at the behavior of the image
- * data accessors and keep in mind that when you invoke pixDestroy(),
- * the pix considers itself the owner of all its heap data.
- *
- */
-
-#ifdef HAVE_CONFIG_H
-#include
-#endif /* HAVE_CONFIG_H */
-
-#include
-#include "allheaders.h"
-
-static void pixFree(PIX *pix);
-
-
-/*-------------------------------------------------------------------------*
- * Pix Memory Management *
- * *
- * These functions give you the freedom to specify at compile or run *
- * time the allocator and deallocator to be used for pix. It has no *
- * effect on memory management for other data structs, which are *
- * controlled by the #defines in environ.h. Likewise, the #defines *
- * in environ.h have no effect on the pix memory management. *
- * The default functions are malloc and free. Use setPixMemoryManager() *
- * to specify other functions to use. *
- *-------------------------------------------------------------------------*/
-
-/*! Pix memory manager */
- /*
- *
- * Notes:
- * (1) The allocator and deallocator function types,
- * alloc_fn and dealloc_fn, are defined in pix.h.
- *
- */
-struct PixMemoryManager
-{
- alloc_fn allocator;
- dealloc_fn deallocator;
-};
-
-/*! Default Pix memory manager */
-static struct PixMemoryManager pix_mem_manager = {
- &malloc,
- &free
-};
-
-static void *
-pix_malloc(size_t size)
-{
-#ifndef _MSC_VER
- return (*pix_mem_manager.allocator)(size);
-#else /* _MSC_VER */
- /* Under MSVC++, pix_mem_manager is initialized after a call
- * to pix_malloc. Just ignore the custom allocator feature. */
- return malloc(size);
-#endif /* _MSC_VER */
-}
-
-static void
-pix_free(void *ptr)
-{
-#ifndef _MSC_VER
- (*pix_mem_manager.deallocator)(ptr);
- return;
-#else /* _MSC_VER */
- /* Under MSVC++, pix_mem_manager is initialized after a call
- * to pix_malloc. Just ignore the custom allocator feature. */
- free(ptr);
- return;
-#endif /* _MSC_VER */
-}
-
-/*!
- * \brief setPixMemoryManager()
- *
- * \param[in] allocator [optional] use NULL to skip
- * \param[in] deallocator [optional] use NULL to skip
- * \return void
- *
- *
- * Notes:
- * (1) Use this to change the alloc and/or dealloc functions;
- * e.g., setPixMemoryManager(my_malloc, my_free).
- * (2) The C99 standard (section 6.7.5.3, par. 8) says:
- * A declaration of a parameter as "function returning type"
- * shall be adjusted to "pointer to function returning type"
- * so that it can be in either of these two forms:
- * (a) type (function-ptr(type, ...))
- * (b) type ((*function-ptr)(type, ...))
- * because form (a) is implictly converted to form (b), as in the
- * definition of struct PixMemoryManager above. So, for example,
- * we should be able to declare either of these:
- * (a) void *(allocator(size_t))
- * (b) void *((*allocator)(size_t))
- * However, MSVC++ only accepts the second version.
- *
- */
-void
-setPixMemoryManager(alloc_fn allocator,
- dealloc_fn deallocator)
-{
- if (allocator) pix_mem_manager.allocator = allocator;
- if (deallocator) pix_mem_manager.deallocator = deallocator;
- return;
-}
-
-
-/*--------------------------------------------------------------------*
- * Pix Creation *
- *--------------------------------------------------------------------*/
-/*!
- * \brief pixCreate()
- *
- * \param[in] width, height, depth
- * \return pixd with data allocated and initialized to 0,
- * or NULL on error
- */
-PIX *
-pixCreate(l_int32 width,
- l_int32 height,
- l_int32 depth)
-{
-PIX *pixd;
-
- PROCNAME("pixCreate");
-
- if ((pixd = pixCreateNoInit(width, height, depth)) == NULL)
- return (PIX *)ERROR_PTR("pixd not made", procName, NULL);
- memset(pixd->data, 0, 4LL * pixd->wpl * pixd->h);
- return pixd;
-}
-
-
-/*!
- * \brief pixCreateNoInit()
- *
- * \param[in] width, height, depth
- * \return pixd with data allocated but not initialized,
- * or NULL on error
- *
- *
- * Notes:
- * (1) Must set pad bits to avoid reading uninitialized data, because
- * some optimized routines (e.g., pixConnComp()) read from pad bits.
- *
- */
-PIX *
-pixCreateNoInit(l_int32 width,
- l_int32 height,
- l_int32 depth)
-{
-l_int32 wpl;
-PIX *pixd;
-l_uint32 *data;
-
- PROCNAME("pixCreateNoInit");
- if ((pixd = pixCreateHeader(width, height, depth)) == NULL)
- return (PIX *)ERROR_PTR("pixd not made", procName, NULL);
- wpl = pixGetWpl(pixd);
- if ((data = (l_uint32 *)pix_malloc(4LL * wpl * height)) == NULL) {
- pixDestroy(&pixd);
- return (PIX *)ERROR_PTR("pix_malloc fail for data", procName, NULL);
- }
- pixSetData(pixd, data);
- pixSetPadBits(pixd, 0);
- return pixd;
-}
-
-
-/*!
- * \brief pixCreateTemplate()
- *
- * \param[in] pixs
- * \return pixd, or NULL on error
- *
- *
- * Notes:
- * (1) Makes a Pix of the same size as the input Pix, with the
- * data array allocated and initialized to 0.
- * (2) Copies the other fields, including colormap if it exists.
- *
- */
-PIX *
-pixCreateTemplate(const PIX *pixs)
-{
-PIX *pixd;
-
- PROCNAME("pixCreateTemplate");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
-
- if ((pixd = pixCreateTemplateNoInit(pixs)) == NULL)
- return (PIX *)ERROR_PTR("pixd not made", procName, NULL);
- memset(pixd->data, 0, 4LL * pixd->wpl * pixd->h);
- return pixd;
-}
-
-
-/*!
- * \brief pixCreateTemplateNoInit()
- *
- * \param[in] pixs
- * \return pixd, or NULL on error
- *
- *
- * Notes:
- * (1) Makes a Pix of the same size as the input Pix, with
- * the data array allocated but not initialized to 0.
- * (2) Copies the other fields, including colormap if it exists.
- *
- */
-PIX *
-pixCreateTemplateNoInit(const PIX *pixs)
-{
-l_int32 w, h, d;
-PIX *pixd;
-
- PROCNAME("pixCreateTemplateNoInit");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
-
- pixGetDimensions(pixs, &w, &h, &d);
- if ((pixd = pixCreateNoInit(w, h, d)) == NULL)
- return (PIX *)ERROR_PTR("pixd not made", procName, NULL);
- pixCopySpp(pixd, pixs);
- pixCopyResolution(pixd, pixs);
- pixCopyColormap(pixd, pixs);
- pixCopyText(pixd, pixs);
- pixCopyInputFormat(pixd, pixs);
- return pixd;
-}
-
-
-/*!
- * \brief pixCreateWithCmap()
- *
- * \param[in] width
- * \param[in] height
- * \param[in] depth 2, 4 or 8 bpp
- * \param[in] initcolor L_SET_BLACK, L_SET_WHITE
- * \return pixd with the initialization color assigned to all pixels,
- * or NULL on error.
- *
- *
- * Notes:
- * (1) Creates a pix with a cmap, initialized to value 0.
- * (2) Initializes the pix black or white by adding that color
- * to the cmap at index 0.
- *
- */
-PIX *
-pixCreateWithCmap(l_int32 width,
- l_int32 height,
- l_int32 depth,
- l_int32 initcolor)
-{
-PIX *pix;
-PIXCMAP *cmap;
-
- PROCNAME("pixCreateWithCmap");
-
- if (depth != 2 && depth != 4 && depth != 8)
- return (PIX *)ERROR_PTR("depth not 2, 4 or 8 bpp", procName, NULL);
-
- if ((pix = pixCreate(width, height, depth)) == NULL)
- return (PIX *)ERROR_PTR("pix not made", procName, NULL);
- cmap = pixcmapCreate(depth);
- pixSetColormap(pix, cmap);
- if (initcolor == L_SET_BLACK)
- pixcmapAddColor(cmap, 0, 0, 0);
- else /* L_SET_WHITE */
- pixcmapAddColor(cmap, 255, 255, 255);
- return pix;
-}
-
-
-/*!
- * \brief pixCreateHeader()
- *
- * \param[in] width, height, depth
- * \return pixd with no data allocated, or NULL on error
- *
- *
- * Notes:
- * (1) It is assumed that all 32 bit pix have 3 spp. If there is
- * a valid alpha channel, this will be set to 4 spp later.
- * (2) All pixCreate*() functions call pixCreateHeader().
- If the number of bytes to be allocated is larger than the
- * maximum value in an int32, we can get overflow, resulting
- * in a smaller amount of memory actually being allocated.
- * Later, an attempt to access memory that wasn't allocated will
- * cause a crash. So to avoid crashing a program (or worse)
- * with bad (or malicious) input, we limit the requested
- * allocation of image data in a typesafe way.
- *
- */
-PIX *
-pixCreateHeader(l_int32 width,
- l_int32 height,
- l_int32 depth)
-{
-l_int32 wpl;
-l_uint64 wpl64, bignum;
-PIX *pixd;
-
- PROCNAME("pixCreateHeader");
-
- if ((depth != 1) && (depth != 2) && (depth != 4) && (depth != 8)
- && (depth != 16) && (depth != 24) && (depth != 32))
- return (PIX *)ERROR_PTR("depth must be {1, 2, 4, 8, 16, 24, 32}",
- procName, NULL);
- if (width <= 0)
- return (PIX *)ERROR_PTR("width must be > 0", procName, NULL);
- if (height <= 0)
- return (PIX *)ERROR_PTR("height must be > 0", procName, NULL);
-
- /* Avoid overflow in malloc, malicious or otherwise */
- wpl64 = ((l_uint64)width * (l_uint64)depth + 31) / 32;
- if (wpl64 > ((1LL << 29) - 1)) {
- L_ERROR("requested w = %d, h = %d, d = %d\n",
- procName, width, height, depth);
- return (PIX *)ERROR_PTR("wpl >= 2^29", procName, NULL);
- }
- wpl = (l_int32)wpl64;
- bignum = 4LL * wpl * height; /* number of bytes to be requested */
- if (bignum > ((1LL << 31) - 1)) {
- L_ERROR("requested w = %d, h = %d, d = %d\n",
- procName, width, height, depth);
- return (PIX *)ERROR_PTR("requested bytes >= 2^31", procName, NULL);
- }
-
- pixd = (PIX *)LEPT_CALLOC(1, sizeof(PIX));
- pixSetWidth(pixd, width);
- pixSetHeight(pixd, height);
- pixSetDepth(pixd, depth);
- pixSetWpl(pixd, wpl);
- if (depth == 24 || depth == 32)
- pixSetSpp(pixd, 3);
- else
- pixSetSpp(pixd, 1);
- pixd->refcount = 1;
- pixd->informat = IFF_UNKNOWN;
- return pixd;
-}
-
-
-/*!
- * \brief pixClone()
- *
- * \param[in] pixs
- * \return same pix ptr, or NULL on error
- *
- *
- * Notes:
- * (1) A "clone" is simply a handle (ptr) to an existing pix.
- * It is implemented because (a) images can be large and
- * hence expensive to copy, and (b) extra handles to a data
- * structure need to be made with a simple policy to avoid
- * both double frees and memory leaks. Pix are reference
- * counted. The side effect of pixClone() is an increase
- * by 1 in the ref count.
- * (2) The protocol to be used is:
- * (a) Whenever you want a new handle to an existing image,
- * call pixClone(), which just bumps a ref count.
- * (b) Always call pixDestroy() on all handles. This
- * decrements the ref count, nulls the handle, and
- * only destroys the pix when pixDestroy() has been
- * called on all handles.
- *
- */
-PIX *
-pixClone(PIX *pixs)
-{
- PROCNAME("pixClone");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- pixChangeRefcount(pixs, 1);
-
- return pixs;
-}
-
-
-/*--------------------------------------------------------------------*
- * Pix Destruction *
- *--------------------------------------------------------------------*/
-/*!
- * \brief pixDestroy()
- *
- * \param[in,out] ppix will be set to null before returning
- * \return void
- *
- *
- * Notes:
- * (1) Decrements the ref count and, if 0, destroys the pix.
- * (2) Always nulls the input ptr.
- *
- */
-void
-pixDestroy(PIX **ppix)
-{
-PIX *pix;
-
- PROCNAME("pixDestroy");
-
- if (!ppix) {
- L_WARNING("ptr address is null!\n", procName);
- return;
- }
-
- if ((pix = *ppix) == NULL)
- return;
- pixFree(pix);
- *ppix = NULL;
- return;
-}
-
-
-/*!
- * \brief pixFree()
- *
- * \param[in] pix
- * \return void
- *
- *
- * Notes:
- * (1) Decrements the ref count and, if 0, destroys the pix.
- *
- */
-static void
-pixFree(PIX *pix)
-{
-l_uint32 *data;
-char *text;
-
- if (!pix) return;
-
- pixChangeRefcount(pix, -1);
- if (pixGetRefcount(pix) <= 0) {
- if ((data = pixGetData(pix)) != NULL)
- pix_free(data);
- if ((text = pixGetText(pix)) != NULL)
- LEPT_FREE(text);
- pixDestroyColormap(pix);
- LEPT_FREE(pix);
- }
- return;
-}
-
-
-/*-------------------------------------------------------------------------*
- * Pix Copy *
- *-------------------------------------------------------------------------*/
-/*!
- * \brief pixCopy()
- *
- * \param[in] pixd [optional] can be null, equal to pixs,
- * different from pixs
- * \param[in] pixs
- * \return pixd, or NULL on error
- *
- *
- * Notes:
- * (1) There are three cases:
- * (a) pixd == null (makes a new pix; refcount = 1)
- * (b) pixd == pixs (no-op)
- * (c) pixd != pixs (data copy; no change in refcount)
- * If the refcount of pixd > 1, case (c) will side-effect
- * these handles.
- * (2) The general pattern of use is:
- * pixd = pixCopy(pixd, pixs);
- * This will work for all three cases.
- * For clarity when the case is known, you can use:
- * (a) pixd = pixCopy(NULL, pixs);
- * (c) pixCopy(pixd, pixs);
- * (3) For case (c), we check if pixs and pixd are the same
- * size (w,h,d). If so, the data is copied directly.
- * Otherwise, the data is reallocated to the correct size
- * and the copy proceeds. The refcount of pixd is unchanged.
- * (4) This operation, like all others that may involve a pre-existing
- * pixd, will side-effect any existing clones of pixd.
- *
- */
-PIX *
-pixCopy(PIX *pixd, /* can be null */
- const PIX *pixs)
-{
-l_int32 bytes;
-
- PROCNAME("pixCopy");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, pixd);
- if (pixs == pixd)
- return pixd;
-
- /* Total bytes in image data */
- bytes = 4 * pixGetWpl(pixs) * pixGetHeight(pixs);
-
- /* If we're making a new pix ... */
- if (!pixd) {
- if ((pixd = pixCreateTemplate(pixs)) == NULL)
- return (PIX *)ERROR_PTR("pixd not made", procName, NULL);
- memcpy(pixd->data, pixs->data, bytes);
- return pixd;
- }
-
- /* Reallocate image data if sizes are different. If this fails,
- * pixd hasn't been changed. But we want to signal that the copy
- * failed, so return NULL. This will cause a memory leak if the
- * return ptr is assigned to pixd, but that is preferred to proceeding
- * with an incorrect pixd, and in any event this use case of
- * pixCopy() -- reallocating into an existing pix -- is infrequent. */
- if (pixResizeImageData(pixd, pixs) == 1)
- return (PIX *)ERROR_PTR("reallocation of data failed", procName, NULL);
-
- /* Copy non-image data fields */
- pixCopyColormap(pixd, pixs);
- pixCopySpp(pixd, pixs);
- pixCopyResolution(pixd, pixs);
- pixCopyInputFormat(pixd, pixs);
- pixCopyText(pixd, pixs);
-
- /* Copy image data */
- memcpy(pixd->data, pixs->data, bytes);
- return pixd;
-}
-
-
-/*!
- * \brief pixResizeImageData()
- *
- * \param[in] pixd gets new uninitialized buffer for image data
- * \param[in] pixs determines the size of the buffer; not changed
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) If the sizes of data in pixs and pixd are unequal, this
- * frees the existing image data in pixd and allocates
- * an uninitialized buffer that will hold the required amount
- * of image data in pixs. The image data from pixs is not
- * copied into the new buffer.
- * (2) On failure to allocate, pixd is unchanged.
- *
- */
-l_ok
-pixResizeImageData(PIX *pixd,
- const PIX *pixs)
-{
-l_int32 w, h, d, wpl, bytes;
-l_uint32 *data;
-
- PROCNAME("pixResizeImageData");
-
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
- if (!pixd)
- return ERROR_INT("pixd not defined", procName, 1);
-
- if (pixSizesEqual(pixs, pixd)) /* nothing to do */
- return 0;
-
- /* Make sure we can copy the data */
- pixGetDimensions(pixs, &w, &h, &d);
- wpl = pixGetWpl(pixs);
- bytes = 4 * wpl * h;
- if ((data = (l_uint32 *)pix_malloc(bytes)) == NULL)
- return ERROR_INT("pix_malloc fail for data", procName, 1);
-
- /* OK, do it */
- pixSetWidth(pixd, w);
- pixSetHeight(pixd, h);
- pixSetDepth(pixd, d);
- pixSetWpl(pixd, wpl);
- pixFreeData(pixd); /* free any existing image data */
- pixSetData(pixd, data); /* set the uninitialized memory buffer */
- pixCopyResolution(pixd, pixs);
- return 0;
-}
-
-
-/*!
- * \brief pixCopyColormap()
- *
- * \param[in] pixd
- * \param[in] pixs copies the colormap to %pixd
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This destroys the colormap in pixd, unless the operation is a no-op
- *
- */
-l_ok
-pixCopyColormap(PIX *pixd,
- const PIX *pixs)
-{
-l_int32 valid;
-const PIXCMAP *cmaps;
-PIXCMAP *cmapd;
-
- PROCNAME("pixCopyColormap");
-
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
- if (!pixd)
- return ERROR_INT("pixd not defined", procName, 1);
- if (pixs == pixd)
- return 0; /* no-op */
-
- pixDestroyColormap(pixd);
- if ((cmaps = pixs->colormap) == NULL) /* not an error */
- return 0;
- pixcmapIsValid(cmaps, &valid);
- if (!valid)
- return ERROR_INT("cmap not valid", procName, 1);
-
- if ((cmapd = pixcmapCopy(cmaps)) == NULL)
- return ERROR_INT("cmapd not made", procName, 1);
- pixSetColormap(pixd, cmapd);
- return 0;
-}
-
-
-/*!
- * \brief pixSizesEqual()
- *
- * \param[in] pix1, pix2
- * \return 1 if the two pix have same {h, w, d}; 0 otherwise.
- */
-l_int32
-pixSizesEqual(const PIX *pix1,
- const PIX *pix2)
-{
- PROCNAME("pixSizesEqual");
-
- if (!pix1 || !pix2)
- return ERROR_INT("pix1 and pix2 not both defined", procName, 0);
-
- if (pix1 == pix2)
- return 1;
-
- if ((pixGetWidth(pix1) != pixGetWidth(pix2)) ||
- (pixGetHeight(pix1) != pixGetHeight(pix2)) ||
- (pixGetDepth(pix1) != pixGetDepth(pix2)))
- return 0;
- else
- return 1;
-}
-
-
-/*!
- * \brief pixTransferAllData()
- *
- * \param[in] pixd must be different from pixs
- * \param[in,out] ppixs will be nulled if refcount goes to 0
- * \param[in] copytext 1 to copy the text field; 0 to skip
- * \param[in] copyformat 1 to copy the informat field; 0 to skip
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This does a complete data transfer from pixs to pixd,
- * followed by the destruction of pixs (refcount permitting).
- * (2) If the refcount of pixs is 1, pixs is destroyed. Otherwise,
- * the data in pixs is copied (rather than transferred) to pixd.
- * (3) This operation, like all others with a pre-existing pixd,
- * will side-effect any existing clones of pixd. The pixd
- * refcount does not change.
- * (4) When might you use this? Suppose you have an in-place Pix
- * function (returning void) with the typical signature:
- * void function-inplace(PIX *pix, ...)
- * where "..." are non-pointer input parameters, and suppose
- * further that you sometimes want to return an arbitrary Pix
- * in place of the input Pix. There are two ways you can do this:
- * (a) The straightforward way is to change the function
- * signature to take the address of the Pix ptr:
- * \code
- * void function-inplace(PIX **ppix, ...) {
- * PIX *pixt = function-makenew(*ppix);
- * pixDestroy(ppix);
- * *ppix = pixt;
- * return;
- * }
- * \endcode
- * Here, the input and returned pix are different, as viewed
- * by the calling function, and the inplace function is
- * expected to destroy the input pix to avoid a memory leak.
- * (b) Keep the signature the same and use pixTransferAllData()
- * to return the new Pix in the input Pix struct:
- * \code
- * void function-inplace(PIX *pix, ...) {
- * PIX *pixt = function-makenew(pix);
- * pixTransferAllData(pix, &pixt, 0, 0);
- * // pixDestroy() is called on pixt
- * return;
- * }
- * \endcode
- * Here, the input and returned pix are the same, as viewed
- * by the calling function, and the inplace function must
- * never destroy the input pix, because the calling function
- * maintains an unchanged handle to it.
- *
- */
-l_ok
-pixTransferAllData(PIX *pixd,
- PIX **ppixs,
- l_int32 copytext,
- l_int32 copyformat)
-{
-l_int32 nbytes;
-PIX *pixs;
-
- PROCNAME("pixTransferAllData");
-
- if (!ppixs)
- return ERROR_INT("&pixs not defined", procName, 1);
- if ((pixs = *ppixs) == NULL)
- return ERROR_INT("pixs not defined", procName, 1);
- if (!pixd)
- return ERROR_INT("pixd not defined", procName, 1);
- if (pixs == pixd) /* no-op */
- return ERROR_INT("pixd == pixs", procName, 1);
-
- if (pixGetRefcount(pixs) == 1) { /* transfer the data, cmap, text */
- pixFreeData(pixd); /* dealloc any existing data */
- pixSetData(pixd, pixGetData(pixs)); /* transfer new data from pixs */
- pixs->data = NULL; /* pixs no longer owns data */
- pixSetColormap(pixd, pixGetColormap(pixs)); /* frees old; sets new */
- pixs->colormap = NULL; /* pixs no longer owns colormap */
- if (copytext) {
- pixSetText(pixd, pixGetText(pixs));
- pixSetText(pixs, NULL);
- }
- } else { /* preserve pixs by making a copy of the data, cmap, text */
- pixResizeImageData(pixd, pixs);
- nbytes = 4 * pixGetWpl(pixs) * pixGetHeight(pixs);
- memcpy(pixGetData(pixd), pixGetData(pixs), nbytes);
- pixCopyColormap(pixd, pixs);
- if (copytext)
- pixCopyText(pixd, pixs);
- }
-
- pixCopySpp(pixd, pixs);
- pixCopyResolution(pixd, pixs);
- pixCopyDimensions(pixd, pixs);
- if (copyformat)
- pixCopyInputFormat(pixd, pixs);
-
- /* This will destroy pixs if data was transferred;
- * otherwise, it just decrements its refcount. */
- pixDestroy(ppixs);
- return 0;
-}
-
-
-/*!
- * \brief pixSwapAndDestroy()
- *
- * \param[out] ppixd [optional] input pixd can be null,
- * and it must be different from pixs
- * \param[in,out] ppixs will be nulled after the swap
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) Simple operation to change the handle name safely.
- * After this operation, the original image in pixd has
- * been destroyed, pixd points to what was pixs, and
- * the input pixs ptr has been nulled.
- * (2) This works safely whether or not pixs and pixd are cloned.
- * If pixs is cloned, the other handles still point to
- * the original image, with the ref count reduced by 1.
- * (3) Usage example:
- * \code
- * Pix *pix1 = pixRead("...");
- * Pix *pix2 = function(pix1, ...);
- * pixSwapAndDestroy(&pix1, &pix2);
- * pixDestroy(&pix1); // holds what was in pix2
- * \endcode
- * Example with clones ([] shows ref count of image generated
- * by the function):
- * \code
- * Pix *pixs = pixRead("...");
- * Pix *pix1 = pixClone(pixs);
- * Pix *pix2 = function(pix1, ...); [1]
- * Pix *pix3 = pixClone(pix2); [1] --> [2]
- * pixSwapAndDestroy(&pix1, &pix2);
- * pixDestroy(&pixs); // still holds read image
- * pixDestroy(&pix1); // holds what was in pix2 [2] --> [1]
- * pixDestroy(&pix3); // holds what was in pix2 [1] --> [0]
- * \endcode
- *
- */
-l_ok
-pixSwapAndDestroy(PIX **ppixd,
- PIX **ppixs)
-{
- PROCNAME("pixSwapAndDestroy");
-
- if (!ppixd)
- return ERROR_INT("&pixd not defined", procName, 1);
- if (!ppixs)
- return ERROR_INT("&pixs not defined", procName, 1);
- if (*ppixs == NULL)
- return ERROR_INT("pixs not defined", procName, 1);
- if (ppixs == ppixd) /* no-op */
- return ERROR_INT("&pixd == &pixs", procName, 1);
-
- pixDestroy(ppixd);
- *ppixd = pixClone(*ppixs);
- pixDestroy(ppixs);
- return 0;
-}
-
-
-/*--------------------------------------------------------------------*
- * Accessors *
- *--------------------------------------------------------------------*/
-l_int32
-pixGetWidth(const PIX *pix)
-{
- PROCNAME("pixGetWidth");
-
- if (!pix)
- return ERROR_INT("pix not defined", procName, 0);
-
- return pix->w;
-}
-
-
-l_int32
-pixSetWidth(PIX *pix,
- l_int32 width)
-{
- PROCNAME("pixSetWidth");
-
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
- if (width < 0) {
- pix->w = 0;
- return ERROR_INT("width must be >= 0", procName, 1);
- }
-
- pix->w = width;
- return 0;
-}
-
-
-l_int32
-pixGetHeight(const PIX *pix)
-{
- PROCNAME("pixGetHeight");
-
- if (!pix)
- return ERROR_INT("pix not defined", procName, 0);
-
- return pix->h;
-}
-
-
-l_int32
-pixSetHeight(PIX *pix,
- l_int32 height)
-{
- PROCNAME("pixSetHeight");
-
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
- if (height < 0) {
- pix->h = 0;
- return ERROR_INT("h must be >= 0", procName, 1);
- }
-
- pix->h = height;
- return 0;
-}
-
-
-l_int32
-pixGetDepth(const PIX *pix)
-{
- PROCNAME("pixGetDepth");
-
- if (!pix)
- return ERROR_INT("pix not defined", procName, 0);
-
- return pix->d;
-}
-
-
-l_int32
-pixSetDepth(PIX *pix,
- l_int32 depth)
-{
- PROCNAME("pixSetDepth");
-
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
- if (depth < 1)
- return ERROR_INT("d must be >= 1", procName, 1);
-
- pix->d = depth;
- return 0;
-}
-
-
-/*!
- * \brief pixGetDimensions()
- *
- * \param[in] pix
- * \param[out] pw, ph, pd [optional] each can be null
- * \return 0 if OK, 1 on error
- */
-l_ok
-pixGetDimensions(const PIX *pix,
- l_int32 *pw,
- l_int32 *ph,
- l_int32 *pd)
-{
- PROCNAME("pixGetDimensions");
-
- if (pw) *pw = 0;
- if (ph) *ph = 0;
- if (pd) *pd = 0;
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
- if (pw) *pw = pix->w;
- if (ph) *ph = pix->h;
- if (pd) *pd = pix->d;
- return 0;
-}
-
-
-/*!
- * \brief pixSetDimensions()
- *
- * \param[in] pix
- * \param[in] w, h, d use 0 to skip the setting for any of these
- * \return 0 if OK, 1 on error
- */
-l_ok
-pixSetDimensions(PIX *pix,
- l_int32 w,
- l_int32 h,
- l_int32 d)
-{
- PROCNAME("pixSetDimensions");
-
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
- if (w > 0) pixSetWidth(pix, w);
- if (h > 0) pixSetHeight(pix, h);
- if (d > 0) pixSetDepth(pix, d);
- return 0;
-}
-
-
-/*!
- * \brief pixCopyDimensions()
- *
- * \param[in] pixd
- * \param[in] pixs
- * \return 0 if OK, 1 on error
- */
-l_ok
-pixCopyDimensions(PIX *pixd,
- const PIX *pixs)
-{
- PROCNAME("pixCopyDimensions");
-
- if (!pixd)
- return ERROR_INT("pixd not defined", procName, 1);
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
- if (pixs == pixd)
- return 0; /* no-op */
-
- pixSetWidth(pixd, pixGetWidth(pixs));
- pixSetHeight(pixd, pixGetHeight(pixs));
- pixSetDepth(pixd, pixGetDepth(pixs));
- pixSetWpl(pixd, pixGetWpl(pixs));
- return 0;
-}
-
-
-l_int32
-pixGetSpp(const PIX *pix)
-{
- PROCNAME("pixGetSpp");
-
- if (!pix)
- return ERROR_INT("pix not defined", procName, 0);
-
- return pix->spp;
-}
-
-
-/*
- * \brief pixSetSpp()
- *
- * \param[in] pix
- * \param[in] spp 1, 3 or 4 samples
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) For a 32 bpp pix, this can be used to ignore the
- * alpha sample (spp == 3) or to use it (spp == 4).
- * For example, to write a spp == 4 image without the alpha
- * sample (as an rgb pix), call pixSetSpp(pix, 3) and
- * then write it out as a png.
- *
- */
-l_int32
-pixSetSpp(PIX *pix,
- l_int32 spp)
-{
- PROCNAME("pixSetSpp");
-
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
- if (spp < 1)
- return ERROR_INT("spp must be >= 1", procName, 1);
-
- pix->spp = spp;
- return 0;
-}
-
-
-/*!
- * \brief pixCopySpp()
- *
- * \param[in] pixd
- * \param[in] pixs
- * \return 0 if OK, 1 on error
- */
-l_ok
-pixCopySpp(PIX *pixd,
- const PIX *pixs)
-{
- PROCNAME("pixCopySpp");
-
- if (!pixd)
- return ERROR_INT("pixd not defined", procName, 1);
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
- if (pixs == pixd)
- return 0; /* no-op */
-
- pixSetSpp(pixd, pixGetSpp(pixs));
- return 0;
-}
-
-
-l_int32
-pixGetWpl(const PIX *pix)
-{
- PROCNAME("pixGetWpl");
-
- if (!pix)
- return ERROR_INT("pix not defined", procName, 0);
- return pix->wpl;
-}
-
-
-l_int32
-pixSetWpl(PIX *pix,
- l_int32 wpl)
-{
- PROCNAME("pixSetWpl");
-
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
-
- pix->wpl = wpl;
- return 0;
-}
-
-
-l_int32
-pixGetRefcount(const PIX *pix)
-{
- PROCNAME("pixGetRefcount");
-
- if (!pix)
- return ERROR_INT("pix not defined", procName, 0);
- return pix->refcount;
-}
-
-
-l_int32
-pixChangeRefcount(PIX *pix,
- l_int32 delta)
-{
- PROCNAME("pixChangeRefcount");
-
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
-
- pix->refcount += delta;
- return 0;
-}
-
-
-l_int32
-pixGetXRes(const PIX *pix)
-{
- PROCNAME("pixGetXRes");
-
- if (!pix)
- return ERROR_INT("pix not defined", procName, 0);
- return pix->xres;
-}
-
-
-l_int32
-pixSetXRes(PIX *pix,
- l_int32 res)
-{
- PROCNAME("pixSetXRes");
-
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
-
- pix->xres = res;
- return 0;
-}
-
-
-l_int32
-pixGetYRes(const PIX *pix)
-{
- PROCNAME("pixGetYRes");
-
- if (!pix)
- return ERROR_INT("pix not defined", procName, 0);
- return pix->yres;
-}
-
-
-l_int32
-pixSetYRes(PIX *pix,
- l_int32 res)
-{
- PROCNAME("pixSetYRes");
-
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
-
- pix->yres = res;
- return 0;
-}
-
-
-/*!
- * \brief pixGetResolution()
- *
- * \param[in] pix
- * \param[out] pxres, pyres [optional] each can be null
- * \return 0 if OK, 1 on error
- */
-l_ok
-pixGetResolution(const PIX *pix,
- l_int32 *pxres,
- l_int32 *pyres)
-{
- PROCNAME("pixGetResolution");
-
- if (pxres) *pxres = 0;
- if (pyres) *pyres = 0;
- if (!pxres && !pyres)
- return ERROR_INT("no output requested", procName, 1);
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
- if (pxres) *pxres = pix->xres;
- if (pyres) *pyres = pix->yres;
- return 0;
-}
-
-
-/*!
- * \brief pixSetResolution()
- *
- * \param[in] pix
- * \param[in] xres, yres use 0 to skip setting a value for either of these
- * \return 0 if OK, 1 on error
- */
-l_ok
-pixSetResolution(PIX *pix,
- l_int32 xres,
- l_int32 yres)
-{
- PROCNAME("pixSetResolution");
-
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
- if (xres > 0) pix->xres = xres;
- if (yres > 0) pix->yres = yres;
- return 0;
-}
-
-
-l_int32
-pixCopyResolution(PIX *pixd,
- const PIX *pixs)
-{
- PROCNAME("pixCopyResolution");
-
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
- if (!pixd)
- return ERROR_INT("pixd not defined", procName, 1);
- if (pixs == pixd)
- return 0; /* no-op */
-
- pixSetXRes(pixd, pixGetXRes(pixs));
- pixSetYRes(pixd, pixGetYRes(pixs));
- return 0;
-}
-
-
-l_int32
-pixScaleResolution(PIX *pix,
- l_float32 xscale,
- l_float32 yscale)
-{
-l_float64 xres, yres;
-l_float64 maxres = 100000000.0;
-
- PROCNAME("pixScaleResolution");
-
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
- if (xscale <= 0 || yscale <= 0)
- return ERROR_INT("invalid scaling ratio", procName, 1);
-
- xres = (l_float64)xscale * (l_float32)(pix->xres) + 0.5;
- yres = (l_float64)yscale * (l_float32)(pix->yres) + 0.5;
- pix->xres = (l_uint32)L_MIN(xres, maxres);
- pix->yres = (l_uint32)L_MIN(yres, maxres);
- return 0;
-}
-
-
-l_int32
-pixGetInputFormat(const PIX *pix)
-{
- PROCNAME("pixGetInputFormat");
-
- if (!pix)
- return ERROR_INT("pix not defined", procName, 0);
- return pix->informat;
-}
-
-
-l_int32
-pixSetInputFormat(PIX *pix,
- l_int32 informat)
-{
- PROCNAME("pixSetInputFormat");
-
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
- pix->informat = informat;
- return 0;
-}
-
-
-l_int32
-pixCopyInputFormat(PIX *pixd,
- const PIX *pixs)
-{
- PROCNAME("pixCopyInputFormat");
-
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
- if (!pixd)
- return ERROR_INT("pixd not defined", procName, 1);
- if (pixs == pixd)
- return 0; /* no-op */
-
- pixSetInputFormat(pixd, pixGetInputFormat(pixs));
- return 0;
-}
-
-
-l_int32
-pixSetSpecial(PIX *pix,
- l_int32 special)
-{
- PROCNAME("pixSetSpecial");
-
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
- pix->special = special;
- return 0;
-}
-
-
-/*!
- * \brief pixGetText()
- *
- * \param[in] pix
- * \return ptr to existing text string
- *
- *
- * Notes:
- * (1) The text string belongs to the pix:
- * * the caller must NOT free it
- * * it must not be used after the pix is destroyed
- *
- */
-char *
-pixGetText(PIX *pix)
-{
- PROCNAME("pixGetText");
-
- if (!pix)
- return (char *)ERROR_PTR("pix not defined", procName, NULL);
- return pix->text;
-}
-
-
-/*!
- * \brief pixSetText()
- *
- * \param[in] pix
- * \param[in] textstring can be null
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This removes any existing textstring and puts a copy of
- * the input textstring there.
- *
- */
-l_ok
-pixSetText(PIX *pix,
- const char *textstring)
-{
- PROCNAME("pixSetText");
-
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
-
- stringReplace(&pix->text, textstring);
- return 0;
-}
-
-
-/*!
- * \brief pixAddText()
- *
- * \param[in] pix
- * \param[in] textstring can be null
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This adds the new textstring to any existing text.
- * (2) Either or both the existing text and the new text
- * string can be null.
- *
- */
-l_ok
-pixAddText(PIX *pix,
- const char *textstring)
-{
-char *newstring;
-
- PROCNAME("pixAddText");
-
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
-
- newstring = stringJoin(pixGetText(pix), textstring);
- stringReplace(&pix->text, newstring);
- LEPT_FREE(newstring);
- return 0;
-}
-
-
-l_int32
-pixCopyText(PIX *pixd,
- const PIX *pixs)
-{
- PROCNAME("pixCopyText");
-
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
- if (!pixd)
- return ERROR_INT("pixd not defined", procName, 1);
- if (pixs == pixd)
- return 0; /* no-op */
-
- pixSetText(pixd, pixs->text);
- return 0;
-}
-
-
-PIXCMAP *
-pixGetColormap(PIX *pix)
-{
- PROCNAME("pixGetColormap");
-
- if (!pix)
- return (PIXCMAP *)ERROR_PTR("pix not defined", procName, NULL);
- return pix->colormap;
-}
-
-
-/*!
- * \brief pixSetColormap()
- *
- * \param[in] pix
- * \param[in] colormap to be assigned
- * \return 0 if OK, 1 on error.
- *
- *
- * Notes:
- * (1) Unlike with the pix data field, pixSetColormap() destroys
- * any existing colormap before assigning the new one.
- * Because colormaps are not ref counted, it is important that
- * the new colormap does not belong to any other pix.
- *
- */
-l_ok
-pixSetColormap(PIX *pix,
- PIXCMAP *colormap)
-{
- PROCNAME("pixSetColormap");
-
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
-
- pixDestroyColormap(pix);
- pix->colormap = colormap;
- return 0;
-}
-
-
-/*!
- * \brief pixDestroyColormap()
- *
- * \param[in] pix
- * \return 0 if OK, 1 on error
- */
-l_ok
-pixDestroyColormap(PIX *pix)
-{
-PIXCMAP *cmap;
-
- PROCNAME("pixDestroyColormap");
-
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
-
- if ((cmap = pix->colormap) != NULL) {
- pixcmapDestroy(&cmap);
- pix->colormap = NULL;
- }
- return 0;
-}
-
-
-/*!
- * \brief pixGetData()
- *
- * \param[in] pix
- * \return ptr to image data
- *
- *
- * Notes:
- * (1) This gives a new handle for the data. The data is still
- * owned by the pix, so do not call LEPT_FREE() on it.
- *
- */
-l_uint32 *
-pixGetData(PIX *pix)
-{
- PROCNAME("pixGetData");
-
- if (!pix)
- return (l_uint32 *)ERROR_PTR("pix not defined", procName, NULL);
- return pix->data;
-}
-
-
-/*!
- * \brief pixSetData()
- *
- * \param[in] pix
- * \param[in] data
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This does not free any existing data. To free existing
- * data, use pixFreeData() before pixSetData().
- *
- */
-l_int32
-pixSetData(PIX *pix,
- l_uint32 *data)
-{
- PROCNAME("pixSetData");
-
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
-
- pix->data = data;
- return 0;
-}
-
-
-/*!
- * \brief pixExtractData()
- *
- * \param[in] pix
- * \return ptr to data, or null on error
- *
- *
- * Notes:
- * (1) This extracts the pix image data for use in another context.
- * The caller still needs to use pixDestroy() on the input pix.
- * (2) If refcount == 1, the data is extracted and the
- * pix->data ptr is set to NULL.
- * (3) If refcount > 1, this simply returns a copy of the data,
- * using the pix allocator, and leaving the input pix unchanged.
- *
- */
-l_uint32 *
-pixExtractData(PIX *pixs)
-{
-l_int32 count, bytes;
-l_uint32 *data, *datas;
-
- PROCNAME("pixExtractData");
-
- if (!pixs)
- return (l_uint32 *)ERROR_PTR("pixs not defined", procName, NULL);
-
- count = pixGetRefcount(pixs);
- if (count == 1) { /* extract */
- data = pixGetData(pixs);
- pixSetData(pixs, NULL);
- } else { /* refcount > 1; copy */
- bytes = 4 * pixGetWpl(pixs) * pixGetHeight(pixs);
- datas = pixGetData(pixs);
- if ((data = (l_uint32 *)pix_malloc(bytes)) == NULL)
- return (l_uint32 *)ERROR_PTR("data not made", procName, NULL);
- memcpy(data, datas, bytes);
- }
-
- return data;
-}
-
-
-/*!
- * \brief pixFreeData()
- *
- * \param[in] pix
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This frees the data and sets the pix data ptr to null.
- * It should be used before pixSetData() in the situation where
- * you want to free any existing data before doing
- * a subsequent assignment with pixSetData().
- *
- */
-l_int32
-pixFreeData(PIX *pix)
-{
-l_uint32 *data;
-
- PROCNAME("pixFreeData");
-
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
-
- if ((data = pixGetData(pix)) != NULL) {
- pix_free(data);
- pix->data = NULL;
- }
- return 0;
-}
-
-
-/*--------------------------------------------------------------------*
- * Pix line ptrs *
- *--------------------------------------------------------------------*/
-/*!
- * \brief pixGetLinePtrs()
- *
- * \param[in] pix
- * \param[out] psize [optional] array size, which is the pix height
- * \return array of line ptrs, or NULL on error
- *
- *
- * Notes:
- * (1) This is intended to be used for fast random pixel access.
- * For example, for an 8 bpp image,
- * val = GET_DATA_BYTE(lines8[i], j);
- * is equivalent to, but much faster than,
- * pixGetPixel(pix, j, i, &val);
- * (2) How much faster? For 1 bpp, it's from 6 to 10x faster.
- * For 8 bpp, it's an amazing 30x faster. So if you are
- * doing random access over a substantial part of the image,
- * use this line ptr array.
- * (3) When random access is used in conjunction with a stack,
- * queue or heap, the overall computation time depends on
- * the operations performed on each struct that is popped
- * or pushed, and whether we are using a priority queue (O(logn))
- * or a queue or stack (O(1)). For example, for maze search,
- * the overall ratio of time for line ptrs vs. pixGet/Set* is
- * Maze type Type Time ratio
- * binary queue 0.4
- * gray heap (priority queue) 0.6
- * (4) Because this returns a void** and the accessors take void*,
- * the compiler cannot check the pointer types. It is
- * strongly recommended that you adopt a naming scheme for
- * the returned ptr arrays that indicates the pixel depth.
- * (This follows the original intent of Simonyi's "Hungarian"
- * application notation, where naming is used proactively
- * to make errors visibly obvious.) By doing this, you can
- * tell by inspection if the correct accessor is used.
- * For example, for an 8 bpp pixg:
- * void **lineg8 = pixGetLinePtrs(pixg, NULL);
- * val = GET_DATA_BYTE(lineg8[i], j); // fast access; BYTE, 8
- * ...
- * LEPT_FREE(lineg8); // don't forget this
- * (5) These are convenient for accessing bytes sequentially in an
- * 8 bpp grayscale image. People who write image processing code
- * on 8 bpp images are accustomed to grabbing pixels directly out
- * of the raster array. Note that for little endians, you first
- * need to reverse the byte order in each 32-bit word.
- * Here's a typical usage pattern:
- * pixEndianByteSwap(pix); // always safe; no-op on big-endians
- * l_uint8 **lineptrs = (l_uint8 **)pixGetLinePtrs(pix, NULL);
- * pixGetDimensions(pix, &w, &h, NULL);
- * for (i = 0; i < h; i++) {
- * l_uint8 *line = lineptrs[i];
- * for (j = 0; j < w; j++) {
- * val = line[j];
- * ...
- * }
- * }
- * pixEndianByteSwap(pix); // restore big-endian order
- * LEPT_FREE(lineptrs);
- * This can be done even more simply as follows:
- * l_uint8 **lineptrs = pixSetupByteProcessing(pix, &w, &h);
- * for (i = 0; i < h; i++) {
- * l_uint8 *line = lineptrs[i];
- * for (j = 0; j < w; j++) {
- * val = line[j];
- * ...
- * }
- * }
- * pixCleanupByteProcessing(pix, lineptrs);
- *
- */
-void **
-pixGetLinePtrs(PIX *pix,
- l_int32 *psize)
-{
-l_int32 i, h, wpl;
-l_uint32 *data;
-void **lines;
-
- PROCNAME("pixGetLinePtrs");
-
- if (psize) *psize = 0;
- if (!pix)
- return (void **)ERROR_PTR("pix not defined", procName, NULL);
-
- h = pixGetHeight(pix);
- if (psize) *psize = h;
- if ((lines = (void **)LEPT_CALLOC(h, sizeof(void *))) == NULL)
- return (void **)ERROR_PTR("lines not made", procName, NULL);
- wpl = pixGetWpl(pix);
- data = pixGetData(pix);
- for (i = 0; i < h; i++)
- lines[i] = (void *)(data + i * wpl);
-
- return lines;
-}
-
-
-/*--------------------------------------------------------------------*
- * Print output for debugging *
- *--------------------------------------------------------------------*/
-extern const char *ImageFileFormatExtensions[];
-
-/*!
- * \brief pixPrintStreamInfo()
- *
- * \param[in] fp file stream
- * \param[in] pix
- * \param[in] text [optional] identifying string; can be null
- * \return 0 if OK, 1 on error
- */
-l_ok
-pixPrintStreamInfo(FILE *fp,
- const PIX *pix,
- const char *text)
-{
-l_int32 informat;
-const PIXCMAP *cmap;
-
- PROCNAME("pixPrintStreamInfo");
-
- if (!fp)
- return ERROR_INT("fp not defined", procName, 1);
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
-
- if (text)
- fprintf(fp, " Pix Info for %s:\n", text);
- fprintf(fp, " width = %d, height = %d, depth = %d, spp = %d\n",
- pixGetWidth(pix), pixGetHeight(pix), pixGetDepth(pix),
- pixGetSpp(pix));
- fprintf(fp, " wpl = %d, data = %p, refcount = %d\n",
- pixGetWpl(pix), pix->data, pixGetRefcount(pix));
- fprintf(fp, " xres = %d, yres = %d\n", pixGetXRes(pix), pixGetYRes(pix));
- if ((cmap = pix->colormap) != NULL)
- pixcmapWriteStream(fp, cmap);
- else
- fprintf(fp, " no colormap\n");
- informat = pixGetInputFormat(pix);
- fprintf(fp, " input format: %d (%s)\n", informat,
- ImageFileFormatExtensions[informat]);
- if (pix->text != NULL)
- fprintf(fp, " text: %s\n", pix->text);
-
- return 0;
-}
diff --git a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pix2.c b/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pix2.c
deleted file mode 100644
index ce2f39ce..00000000
--- a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pix2.c
+++ /dev/null
@@ -1,3506 +0,0 @@
-/*====================================================================*
- - Copyright (C) 2001 Leptonica. All rights reserved.
- -
- - Redistribution and use in source and binary forms, with or without
- - modification, are permitted provided that the following conditions
- - are met:
- - 1. Redistributions of source code must retain the above copyright
- - notice, this list of conditions and the following disclaimer.
- - 2. Redistributions in binary form must reproduce the above
- - copyright notice, this list of conditions and the following
- - disclaimer in the documentation and/or other materials
- - provided with the distribution.
- -
- - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- - ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- - LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- - A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL ANY
- - CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
- - EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
- - PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
- - PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
- - OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
- - NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- *====================================================================*/
-
-/*!
- * \file pix2.c
- *
- *
- * This file has these basic operations:
- *
- * (1) Get and set: individual pixels, full image, rectangular region,
- * pad pixels, border pixels, and color components for RGB
- * (2) Add and remove border pixels
- * (3) Endian byte swaps
- * (4) Simple method for byte-processing images (instead of words)
- *
- * Pixel poking
- * l_int32 pixGetPixel()
- * l_int32 pixSetPixel()
- * l_int32 pixGetRGBPixel()
- * l_int32 pixSetRGBPixel()
- * l_int32 pixSetCmapPixel()
- * l_int32 pixGetRandomPixel()
- * l_int32 pixClearPixel()
- * l_int32 pixFlipPixel()
- * void setPixelLow()
- *
- * Find black or white value
- * l_int32 pixGetBlackOrWhiteVal()
- *
- * Full image clear/set/set-to-arbitrary-value
- * l_int32 pixClearAll()
- * l_int32 pixSetAll()
- * l_int32 pixSetAllGray()
- * l_int32 pixSetAllArbitrary()
- * l_int32 pixSetBlackOrWhite()
- * l_int32 pixSetComponentArbitrary()
- *
- * Rectangular region clear/set/set-to-arbitrary-value/blend
- * l_int32 pixClearInRect()
- * l_int32 pixSetInRect()
- * l_int32 pixSetInRectArbitrary()
- * l_int32 pixBlendInRect()
- *
- * Set pad bits
- * l_int32 pixSetPadBits()
- * l_int32 pixSetPadBitsBand()
- *
- * Assign border pixels
- * l_int32 pixSetOrClearBorder()
- * l_int32 pixSetBorderVal()
- * l_int32 pixSetBorderRingVal()
- * l_int32 pixSetMirroredBorder()
- * PIX *pixCopyBorder()
- *
- * Add and remove border
- * PIX *pixAddBorder()
- * PIX *pixAddBlackOrWhiteBorder()
- * PIX *pixAddBorderGeneral()
- * PIX *pixRemoveBorder()
- * PIX *pixRemoveBorderGeneral()
- * PIX *pixRemoveBorderToSize()
- * PIX *pixAddMirroredBorder()
- * PIX *pixAddRepeatedBorder()
- * PIX *pixAddMixedBorder()
- * PIX *pixAddContinuedBorder()
- *
- * Helper functions using alpha
- * l_int32 pixShiftAndTransferAlpha()
- * PIX *pixDisplayLayersRGBA()
- *
- * Color sample setting and extraction
- * PIX *pixCreateRGBImage()
- * PIX *pixGetRGBComponent()
- * l_int32 pixSetRGBComponent()
- * PIX *pixGetRGBComponentCmap()
- * l_int32 pixCopyRGBComponent()
- * l_int32 composeRGBPixel()
- * l_int32 composeRGBAPixel()
- * void extractRGBValues()
- * void extractRGBAValues()
- * l_int32 extractMinMaxComponent()
- * l_int32 pixGetRGBLine()
- *
- * Raster line pixel setter
- * l_int32 setLineDataVal()
- *
- * Conversion between big and little endians
- * PIX *pixEndianByteSwapNew()
- * l_int32 pixEndianByteSwap()
- * l_int32 lineEndianByteSwap()
- * PIX *pixEndianTwoByteSwapNew()
- * l_int32 pixEndianTwoByteSwap()
- *
- * Extract raster data as binary string
- * l_int32 pixGetRasterData()
- *
- * Test alpha component opaqueness
- * l_int32 pixAlphaIsOpaque
- *
- * Setup helpers for 8 bpp byte processing
- * l_uint8 **pixSetupByteProcessing()
- * l_int32 pixCleanupByteProcessing()
- *
- * Setting parameters for antialias masking with alpha transforms
- * void l_setAlphaMaskBorder()
- *
- */
-
-#ifdef HAVE_CONFIG_H
-#include
-#endif /* HAVE_CONFIG_H */
-
-#include
-#include "allheaders.h"
-
-static const l_uint32 rmask32[] = {0x0,
- 0x00000001, 0x00000003, 0x00000007, 0x0000000f,
- 0x0000001f, 0x0000003f, 0x0000007f, 0x000000ff,
- 0x000001ff, 0x000003ff, 0x000007ff, 0x00000fff,
- 0x00001fff, 0x00003fff, 0x00007fff, 0x0000ffff,
- 0x0001ffff, 0x0003ffff, 0x0007ffff, 0x000fffff,
- 0x001fffff, 0x003fffff, 0x007fffff, 0x00ffffff,
- 0x01ffffff, 0x03ffffff, 0x07ffffff, 0x0fffffff,
- 0x1fffffff, 0x3fffffff, 0x7fffffff, 0xffffffff};
-
- /* This is a global that determines the default 8 bpp alpha mask values
- * for rings at distance 1 and 2 from the border. Declare extern
- * to use. To change the values, use l_setAlphaMaskBorder(). */
-LEPT_DLL l_float32 AlphaMaskBorderVals[2] = {0.0, 0.5};
-
-
-#ifndef NO_CONSOLE_IO
-#define DEBUG_SERIALIZE 0
-#endif /* ~NO_CONSOLE_IO */
-
-
-/*-------------------------------------------------------------*
- * Pixel poking *
- *-------------------------------------------------------------*/
-/*!
- * \brief pixGetPixel()
- *
- * \param[in] pix
- * \param[in] x,y pixel coords
- * \param[out] pval pixel value
- * \return 0 if OK; 1 or 2 on error
- *
- *
- * Notes:
- * (1) This returns the value in the data array. If the pix is
- * colormapped, it returns the colormap index, not the rgb value.
- * (2) Because of the function overhead and the parameter checking,
- * this is much slower than using the GET_DATA_*() macros directly.
- * Speed on a 1 Mpixel RGB image, using a 3 GHz machine:
- * * pixGet/pixSet: ~25 Mpix/sec
- * * GET_DATA/SET_DATA: ~350 MPix/sec
- * If speed is important and you're doing random access into
- * the pix, use pixGetLinePtrs() and the array access macros.
- * (3) If the point is outside the image, this returns an error (2),
- * with 0 in %pval. To avoid spamming output, it fails silently.
- *
- */
-l_ok
-pixGetPixel(PIX *pix,
- l_int32 x,
- l_int32 y,
- l_uint32 *pval)
-{
-l_int32 w, h, d, wpl, val;
-l_uint32 *line, *data;
-
- PROCNAME("pixGetPixel");
-
- if (!pval)
- return ERROR_INT("&val not defined", procName, 1);
- *pval = 0;
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
-
- pixGetDimensions(pix, &w, &h, &d);
- if (x < 0 || x >= w || y < 0 || y >= h)
- return 2;
-
- wpl = pixGetWpl(pix);
- data = pixGetData(pix);
- line = data + y * wpl;
- switch (d)
- {
- case 1:
- val = GET_DATA_BIT(line, x);
- break;
- case 2:
- val = GET_DATA_DIBIT(line, x);
- break;
- case 4:
- val = GET_DATA_QBIT(line, x);
- break;
- case 8:
- val = GET_DATA_BYTE(line, x);
- break;
- case 16:
- val = GET_DATA_TWO_BYTES(line, x);
- break;
- case 32:
- val = line[x];
- break;
- default:
- return ERROR_INT("depth must be in {1,2,4,8,16,32} bpp", procName, 1);
- }
-
- *pval = val;
- return 0;
-}
-
-
-/*!
- * \brief pixSetPixel()
- *
- * \param[in] pix
- * \param[in] x,y pixel coords
- * \param[in] val value to be inserted
- * \return 0 if OK; 1 or 2 on error
- *
- *
- * Notes:
- * (1) Warning: the input value is not checked for overflow with respect
- * the the depth of %pix, and the sign bit (if any) is ignored.
- * * For d == 1, %val > 0 sets the bit on.
- * * For d == 2, 4, 8 and 16, %val is masked to the maximum allowable
- * pixel value, and any (invalid) higher order bits are discarded.
- * (2) See pixGetPixel() for information on performance.
- * (3) If the point is outside the image, this returns an error (2),
- * with 0 in %pval. To avoid spamming output, it fails silently.
- *
- */
-l_ok
-pixSetPixel(PIX *pix,
- l_int32 x,
- l_int32 y,
- l_uint32 val)
-{
-l_int32 w, h, d, wpl;
-l_uint32 *line, *data;
-
- PROCNAME("pixSetPixel");
-
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
- pixGetDimensions(pix, &w, &h, &d);
- if (x < 0 || x >= w || y < 0 || y >= h)
- return 2;
-
- data = pixGetData(pix);
- wpl = pixGetWpl(pix);
- line = data + y * wpl;
- switch (d)
- {
- case 1:
- if (val)
- SET_DATA_BIT(line, x);
- else
- CLEAR_DATA_BIT(line, x);
- break;
- case 2:
- SET_DATA_DIBIT(line, x, val);
- break;
- case 4:
- SET_DATA_QBIT(line, x, val);
- break;
- case 8:
- SET_DATA_BYTE(line, x, val);
- break;
- case 16:
- SET_DATA_TWO_BYTES(line, x, val);
- break;
- case 32:
- line[x] = val;
- break;
- default:
- return ERROR_INT("depth must be in {1,2,4,8,16,32} bpp", procName, 1);
- }
-
- return 0;
-}
-
-
-/*!
- * \brief pixGetRGBPixel()
- *
- * \param[in] pix 32 bpp rgb, not colormapped
- * \param[in] x,y pixel coords
- * \param[out] prval [optional] red component
- * \param[out] pgval [optional] green component
- * \param[out] pbval [optional] blue component
- * \return 0 if OK; 1 or 2 on error
- *
- * Notes:
- * (1) If the point is outside the image, this returns an error (2),
- * with 0 in %pval. To avoid spamming output, it fails silently.
- */
-l_ok
-pixGetRGBPixel(PIX *pix,
- l_int32 x,
- l_int32 y,
- l_int32 *prval,
- l_int32 *pgval,
- l_int32 *pbval)
-{
-l_int32 w, h, d, wpl;
-l_uint32 *data, *ppixel;
-
- PROCNAME("pixGetRGBPixel");
-
- if (prval) *prval = 0;
- if (pgval) *pgval = 0;
- if (pbval) *pbval = 0;
- if (!prval && !pgval && !pbval)
- return ERROR_INT("no output requested", procName, 1);
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
- pixGetDimensions(pix, &w, &h, &d);
- if (d != 32)
- return ERROR_INT("pix not 32 bpp", procName, 1);
- if (x < 0 || x >= w || y < 0 || y >= h)
- return 2;
-
- wpl = pixGetWpl(pix);
- data = pixGetData(pix);
- ppixel = data + y * wpl + x;
- if (prval) *prval = GET_DATA_BYTE(ppixel, COLOR_RED);
- if (pgval) *pgval = GET_DATA_BYTE(ppixel, COLOR_GREEN);
- if (pbval) *pbval = GET_DATA_BYTE(ppixel, COLOR_BLUE);
- return 0;
-}
-
-
-/*!
- * \brief pixSetRGBPixel()
- *
- * \param[in] pix 32 bpp rgb
- * \param[in] x,y pixel coords
- * \param[in] rval red component
- * \param[in] gval green component
- * \param[in] bval blue component
- * \return 0 if OK; 1 or 2 on error
- *
- * Notes:
- * (1) If the point is outside the image, this returns an error (2),
- * and to avoid spamming output, it fails silently.
- */
-l_ok
-pixSetRGBPixel(PIX *pix,
- l_int32 x,
- l_int32 y,
- l_int32 rval,
- l_int32 gval,
- l_int32 bval)
-{
-l_int32 w, h, d, wpl;
-l_uint32 pixel;
-l_uint32 *data, *line;
-
- PROCNAME("pixSetRGBPixel");
-
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
- pixGetDimensions(pix, &w, &h, &d);
- if (d != 32)
- return ERROR_INT("pix not 32 bpp", procName, 1);
- if (x < 0 || x >= w || y < 0 || y >= h)
- return 2;
-
- wpl = pixGetWpl(pix);
- data = pixGetData(pix);
- line = data + y * wpl;
- composeRGBPixel(rval, gval, bval, &pixel);
- *(line + x) = pixel;
- return 0;
-}
-
-
-/*!
- * \brief pixSetCmapPixel()
- *
- * \param[in] pix 2, 4 or 8 bpp, colormapped
- * \param[in] x,y pixel coords
- * \param[in] rval red component
- * \param[in] gval green component
- * \param[in] bval blue component
- * \return 0 if OK; 1 or 2 on error
- *
- * Notes:
- * (1) If the point is outside the image, this returns an error (2),
- * and to avoid spamming output, it fails silently.
- * (2) - If the color already exists, use it.
- * - If the color does not exist in the colormap, it is added
- * if possible.
- * - If there is not room in the colormap for the new color:
- * * if d < 8, return 2 with a warning.
- * * if d == 8, find and use the nearest color.
- * (3) Note that this operation scales with the number of colors
- * in the colormap, and therefore can be very expensive if an
- * attempt is made to set many pixels. (In that case, it should
- * be implemented with a map:rgb-->index for efficiency.)
- * This is best used with very small images.
- */
-l_ok
-pixSetCmapPixel(PIX *pix,
- l_int32 x,
- l_int32 y,
- l_int32 rval,
- l_int32 gval,
- l_int32 bval)
-{
-l_int32 w, h, d, index;
-PIXCMAP *cmap;
-
- PROCNAME("pixSetCmapPixel");
-
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
- if ((cmap = pixGetColormap(pix)) == NULL)
- return ERROR_INT("pix is not colormapped", procName, 1);
- pixGetDimensions(pix, &w, &h, &d);
- if (d != 2 && d != 4 && d != 8)
- return ERROR_INT("pix depth not 2, 4 or 8", procName, 1);
- if (x < 0 || x >= w || y < 0 || y >= h)
- return 2;
-
- if (d == 8) { /* always add */
- pixcmapAddNearestColor(cmap, rval, gval, bval, &index);
- } else { /* d < 8 */
- if (pixcmapAddNewColor(cmap, rval, gval, bval, &index) == 2)
- return ERROR_INT("colormap is full", procName, 2);
- }
- pixSetPixel(pix, x, y, index);
- return 0;
-}
-
-
-/*!
- * \brief pixGetRandomPixel()
- *
- * \param[in] pix any depth; can be colormapped
- * \param[out] pval [optional] pixel value
- * \param[out] px [optional] x coordinate chosen; can be null
- * \param[out] py [optional] y coordinate chosen; can be null
- * \return 0 if OK; 1 on error
- *
- *
- * Notes:
- * (1) If the pix is colormapped, it returns the rgb value.
- *
- */
-l_ok
-pixGetRandomPixel(PIX *pix,
- l_uint32 *pval,
- l_int32 *px,
- l_int32 *py)
-{
-l_int32 w, h, x, y, rval, gval, bval;
-l_uint32 val;
-PIXCMAP *cmap;
-
- PROCNAME("pixGetRandomPixel");
-
- if (pval) *pval = 0;
- if (px) *px = 0;
- if (py) *py = 0;
- if (!pval && !px && !py)
- return ERROR_INT("no output requested", procName, 1);
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
-
- pixGetDimensions(pix, &w, &h, NULL);
- x = rand() % w;
- y = rand() % h;
- if (px) *px = x;
- if (py) *py = y;
- if (pval) {
- pixGetPixel(pix, x, y, &val);
- if ((cmap = pixGetColormap(pix)) != NULL) {
- pixcmapGetColor(cmap, val, &rval, &gval, &bval);
- composeRGBPixel(rval, gval, bval, pval);
- } else {
- *pval = val;
- }
- }
-
- return 0;
-}
-
-
-/*!
- * \brief pixClearPixel()
- *
- * \param[in] pix any depth; warning if colormapped
- * \param[in] x,y pixel coords
- * \return 0 if OK; 1 or 2 on error.
- *
- * Notes:
- * (1) If the point is outside the image, this returns an error (2),
- * with 0 in %pval. To avoid spamming output, it fails silently.
- */
-l_ok
-pixClearPixel(PIX *pix,
- l_int32 x,
- l_int32 y)
-{
-l_int32 w, h, d, wpl;
-l_uint32 *line, *data;
-
- PROCNAME("pixClearPixel");
-
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
- if (pixGetColormap(pix))
- L_WARNING("cmapped: setting to 0 may not be intended\n", procName);
- pixGetDimensions(pix, &w, &h, &d);
- if (x < 0 || x >= w || y < 0 || y >= h)
- return 2;
-
- wpl = pixGetWpl(pix);
- data = pixGetData(pix);
- line = data + y * wpl;
- switch (d)
- {
- case 1:
- CLEAR_DATA_BIT(line, x);
- break;
- case 2:
- CLEAR_DATA_DIBIT(line, x);
- break;
- case 4:
- CLEAR_DATA_QBIT(line, x);
- break;
- case 8:
- SET_DATA_BYTE(line, x, 0);
- break;
- case 16:
- SET_DATA_TWO_BYTES(line, x, 0);
- break;
- case 32:
- line[x] = 0;
- break;
- default:
- return ERROR_INT("depth must be in {1,2,4,8,16,32} bpp", procName, 1);
- }
-
- return 0;
-}
-
-
-/*!
- * \brief pixFlipPixel()
- *
- * \param[in] pix any depth, warning if colormapped
- * \param[in] x,y pixel coords
- * \return 0 if OK; 1 or 2 on error
- *
- * Notes:
- * (1) If the point is outside the image, this returns an error (2),
- * with 0 in %pval. To avoid spamming output, it fails silently.
- */
-l_ok
-pixFlipPixel(PIX *pix,
- l_int32 x,
- l_int32 y)
-{
-l_int32 w, h, d, wpl;
-l_uint32 val;
-l_uint32 *line, *data;
-
- PROCNAME("pixFlipPixel");
-
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
- if (pixGetColormap(pix))
- L_WARNING("cmapped: setting to 0 may not be intended\n", procName);
- pixGetDimensions(pix, &w, &h, &d);
- if (x < 0 || x >= w || y < 0 || y >= h)
- return 2;
-
- data = pixGetData(pix);
- wpl = pixGetWpl(pix);
- line = data + y * wpl;
- switch (d)
- {
- case 1:
- val = GET_DATA_BIT(line, x);
- if (val)
- CLEAR_DATA_BIT(line, x);
- else
- SET_DATA_BIT(line, x);
- break;
- case 2:
- val = GET_DATA_DIBIT(line, x);
- val ^= 0x3;
- SET_DATA_DIBIT(line, x, val);
- break;
- case 4:
- val = GET_DATA_QBIT(line, x);
- val ^= 0xf;
- SET_DATA_QBIT(line, x, val);
- break;
- case 8:
- val = GET_DATA_BYTE(line, x);
- val ^= 0xff;
- SET_DATA_BYTE(line, x, val);
- break;
- case 16:
- val = GET_DATA_TWO_BYTES(line, x);
- val ^= 0xffff;
- SET_DATA_TWO_BYTES(line, x, val);
- break;
- case 32:
- val = line[x] ^ 0xffffffff;
- line[x] = val;
- break;
- default:
- return ERROR_INT("depth must be in {1,2,4,8,16,32} bpp", procName, 1);
- }
-
- return 0;
-}
-
-
-/*!
- * \brief setPixelLow()
- *
- * \param[in] line ptr to beginning of line,
- * \param[in] x pixel location in line
- * \param[in] depth bpp
- * \param[in] val to be inserted
- * \return void
- *
- *
- * Notes:
- * (1) Caution: input variables are not checked!
- *
- */
-void
-setPixelLow(l_uint32 *line,
- l_int32 x,
- l_int32 depth,
- l_uint32 val)
-{
- switch (depth)
- {
- case 1:
- if (val)
- SET_DATA_BIT(line, x);
- else
- CLEAR_DATA_BIT(line, x);
- break;
- case 2:
- SET_DATA_DIBIT(line, x, val);
- break;
- case 4:
- SET_DATA_QBIT(line, x, val);
- break;
- case 8:
- SET_DATA_BYTE(line, x, val);
- break;
- case 16:
- SET_DATA_TWO_BYTES(line, x, val);
- break;
- case 32:
- line[x] = val;
- break;
- default:
- lept_stderr("illegal depth in setPixelLow()\n");
- }
-
- return;
-}
-
-
-/*-------------------------------------------------------------*
- * Find black or white value *
- *-------------------------------------------------------------*/
-/*!
- * \brief pixGetBlackOrWhiteVal()
- *
- * \param[in] pixs all depths; cmap ok
- * \param[in] op L_GET_BLACK_VAL, L_GET_WHITE_VAL
- * \param[out] pval pixel value
- * \return 0 if OK; 1 on error
- *
- *
- * Notes:
- * (1) Side effect. For a colormapped image, if the requested
- * color is not present and there is room to add it in the cmap,
- * it is added and the new index is returned. If there is no room,
- * the index of the closest color in intensity is returned.
- *
- */
-l_ok
-pixGetBlackOrWhiteVal(PIX *pixs,
- l_int32 op,
- l_uint32 *pval)
-{
-l_int32 d, val;
-PIXCMAP *cmap;
-
- PROCNAME("pixGetBlackOrWhiteVal");
-
- if (!pval)
- return ERROR_INT("&val not defined", procName, 1);
- *pval = 0;
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
- if (op != L_GET_BLACK_VAL && op != L_GET_WHITE_VAL)
- return ERROR_INT("invalid op", procName, 1);
-
- cmap = pixGetColormap(pixs);
- d = pixGetDepth(pixs);
- if (!cmap) {
- if ((d == 1 && op == L_GET_WHITE_VAL) ||
- (d > 1 && op == L_GET_BLACK_VAL)) { /* min val */
- val = 0;
- } else { /* max val */
- val = (d == 32) ? 0xffffff00 : (1 << d) - 1;
- }
- } else { /* handle colormap */
- if (op == L_GET_BLACK_VAL)
- pixcmapAddBlackOrWhite(cmap, 0, &val);
- else /* L_GET_WHITE_VAL */
- pixcmapAddBlackOrWhite(cmap, 1, &val);
- }
- *pval = val;
-
- return 0;
-}
-
-
-/*-------------------------------------------------------------*
- * Full image clear/set/set-to-arbitrary-value/invert *
- *-------------------------------------------------------------*/
-/*!
- * \brief pixClearAll()
- *
- * \param[in] pix all depths; use cmapped with caution
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) Clears all data to 0. For 1 bpp, this is white; for grayscale
- * or color, this is black.
- * (2) Caution: for colormapped pix, this sets the color to the first
- * one in the colormap. Be sure that this is the intended color!
- *
- */
-l_ok
-pixClearAll(PIX *pix)
-{
- PROCNAME("pixClearAll");
-
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
-
- pixRasterop(pix, 0, 0, pixGetWidth(pix), pixGetHeight(pix),
- PIX_CLR, NULL, 0, 0);
- return 0;
-}
-
-
-/*!
- * \brief pixSetAll()
- *
- * \param[in] pix all depths; use cmapped with caution
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) Sets all data to 1. For 1 bpp, this is black; for grayscale
- * or color, this is white.
- * (2) Caution: for colormapped pix, this sets the pixel value to the
- * maximum value supported by the colormap: 2^d - 1. However, this
- * color may not be defined, because the colormap may not be full.
- *
- */
-l_ok
-pixSetAll(PIX *pix)
-{
-l_int32 n;
-PIXCMAP *cmap;
-
- PROCNAME("pixSetAll");
-
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
- if ((cmap = pixGetColormap(pix)) != NULL) {
- n = pixcmapGetCount(cmap);
- if (n < cmap->nalloc) /* cmap is not full */
- return ERROR_INT("cmap entry does not exist", procName, 1);
- }
-
- pixRasterop(pix, 0, 0, pixGetWidth(pix), pixGetHeight(pix),
- PIX_SET, NULL, 0, 0);
- return 0;
-}
-
-
-/*!
- * \brief pixSetAllGray()
- *
- * \param[in] pix all depths, cmap ok
- * \param[in] grayval in range 0 ... 255
- * \return 0 if OK; 1 on error
- *
- *
- * Notes:
- * (1) N.B. For all images, %grayval == 0 represents black and
- * %grayval == 255 represents white.
- * (2) For depth < 8, we do our best to approximate the gray level.
- * For 1 bpp images, any %grayval < 128 is black; >= 128 is white.
- * For 32 bpp images, each r,g,b component is set to %grayval,
- * and the alpha component is preserved.
- * (3) If pix is colormapped, it adds the gray value, replicated in
- * all components, to the colormap if it's not there and there
- * is room. If the colormap is full, it finds the closest color in
- * L2 distance of components. This index is written to all pixels.
- *
- */
-l_ok
-pixSetAllGray(PIX *pix,
- l_int32 grayval)
-{
-l_int32 d, spp, index;
-l_uint32 val32;
-PIX *alpha;
-PIXCMAP *cmap;
-
- PROCNAME("pixSetAllGray");
-
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
- if (grayval < 0) {
- L_WARNING("grayval < 0; setting to 0\n", procName);
- grayval = 0;
- } else if (grayval > 255) {
- L_WARNING("grayval > 255; setting to 255\n", procName);
- grayval = 255;
- }
-
- /* Handle the colormap case */
- cmap = pixGetColormap(pix);
- if (cmap) {
- pixcmapAddNearestColor(cmap, grayval, grayval, grayval, &index);
- pixSetAllArbitrary(pix, index);
- return 0;
- }
-
- /* Non-cmapped */
- d = pixGetDepth(pix);
- spp = pixGetSpp(pix);
- if (d == 1) {
- if (grayval < 128) /* black */
- pixSetAll(pix);
- else
- pixClearAll(pix); /* white */
- } else if (d < 8) {
- grayval >>= 8 - d;
- pixSetAllArbitrary(pix, grayval);
- } else if (d == 8) {
- pixSetAllArbitrary(pix, grayval);
- } else if (d == 16) {
- grayval |= (grayval << 8);
- pixSetAllArbitrary(pix, grayval);
- } else if (d == 32 && spp == 3) {
- composeRGBPixel(grayval, grayval, grayval, &val32);
- pixSetAllArbitrary(pix, val32);
- } else if (d == 32 && spp == 4) {
- alpha = pixGetRGBComponent(pix, L_ALPHA_CHANNEL);
- composeRGBPixel(grayval, grayval, grayval, &val32);
- pixSetAllArbitrary(pix, val32);
- pixSetRGBComponent(pix, alpha, L_ALPHA_CHANNEL);
- pixDestroy(&alpha);
- } else {
- L_ERROR("invalid depth: %d\n", procName, d);
- return 1;
- }
-
- return 0;
-}
-
-
-/*!
- * \brief pixSetAllArbitrary()
- *
- * \param[in] pix all depths; use cmapped with caution
- * \param[in] val value to set all pixels
- * \return 0 if OK; 1 on error
- *
- *
- * Notes:
- * (1) Caution 1! For colormapped pix, %val is used as an index
- * into a colormap. Be sure that index refers to the intended color.
- * If the color is not in the colormap, you should first add it
- * and then call this function.
- * (2) Caution 2! For 32 bpp pix, the interpretation of the LSB
- * of %val depends on whether spp == 3 (RGB) or spp == 4 (RGBA).
- * For RGB, the LSB is ignored in image transformations.
- * For RGBA, the LSB is interpreted as the alpha (transparency)
- * component; full transparency has alpha == 0x0, whereas
- * full opacity has alpha = 0xff. An RGBA image with full
- * opacity behaves like an RGB image.
- * (3) As an example of (2), suppose you want to initialize a 32 bpp
- * pix with partial opacity, say 0xee337788. If the pix is 3 spp,
- * the 0x88 alpha component will be ignored and may be changed
- * in subsequent processing. However, if the pix is 4 spp, the
- * alpha component will be retained and used. The function
- * pixCreate(w, h, 32) makes an RGB image by default, and
- * pixSetSpp(pix, 4) can be used to promote an RGB image to RGBA.
- *
- */
-l_ok
-pixSetAllArbitrary(PIX *pix,
- l_uint32 val)
-{
-l_int32 n, i, j, w, h, d, wpl, npix;
-l_uint32 maxval, wordval;
-l_uint32 *data, *line;
-PIXCMAP *cmap;
-
- PROCNAME("pixSetAllArbitrary");
-
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
-
- /* If colormapped, make sure that val is less than the size
- * of the cmap array. */
- if ((cmap = pixGetColormap(pix)) != NULL) {
- n = pixcmapGetCount(cmap);
- if (val >= n) {
- L_WARNING("index not in colormap; using last color\n", procName);
- val = n - 1;
- }
- }
-
- /* Make sure val isn't too large for the pixel depth.
- * If it is too large, set the pixel color to white. */
- pixGetDimensions(pix, &w, &h, &d);
- if (d < 32) {
- maxval = (1 << d) - 1;
- if (val > maxval) {
- L_WARNING("val = %d too large for depth; using maxval = %d\n",
- procName, val, maxval);
- val = maxval;
- }
- }
-
- /* Set up word to tile with */
- wordval = 0;
- npix = 32 / d; /* number of pixels per 32 bit word */
- for (j = 0; j < npix; j++)
- wordval |= (val << (j * d));
- wpl = pixGetWpl(pix);
- data = pixGetData(pix);
- for (i = 0; i < h; i++) {
- line = data + i * wpl;
- for (j = 0; j < wpl; j++) {
- *(line + j) = wordval;
- }
- }
- return 0;
-}
-
-
-/*!
- * \brief pixSetBlackOrWhite()
- *
- * \param[in] pixs all depths; cmap ok
- * \param[in] op L_SET_BLACK, L_SET_WHITE
- * \return 0 if OK; 1 on error
- *
- *
- * Notes:
- * (1) Function for setting all pixels in an image to either black
- * or white.
- * (2) If pixs is colormapped, it adds black or white to the
- * colormap if it's not there and there is room. If the colormap
- * is full, it finds the closest color in intensity.
- * This index is written to all pixels.
- *
- */
-l_ok
-pixSetBlackOrWhite(PIX *pixs,
- l_int32 op)
-{
-l_int32 d, index;
-PIXCMAP *cmap;
-
- PROCNAME("pixSetBlackOrWhite");
-
- if (!pixs)
- return ERROR_INT("pix not defined", procName, 1);
- if (op != L_SET_BLACK && op != L_SET_WHITE)
- return ERROR_INT("invalid op", procName, 1);
-
- cmap = pixGetColormap(pixs);
- d = pixGetDepth(pixs);
- if (!cmap) {
- if ((d == 1 && op == L_SET_BLACK) || (d > 1 && op == L_SET_WHITE))
- pixSetAll(pixs);
- else
- pixClearAll(pixs);
- } else { /* handle colormap */
- if (op == L_SET_BLACK)
- pixcmapAddBlackOrWhite(cmap, 0, &index);
- else /* L_SET_WHITE */
- pixcmapAddBlackOrWhite(cmap, 1, &index);
- pixSetAllArbitrary(pixs, index);
- }
-
- return 0;
-}
-
-
-/*!
- * \brief pixSetComponentArbitrary()
- *
- * \param[in] pix 32 bpp
- * \param[in] comp COLOR_RED, COLOR_GREEN, COLOR_BLUE, L_ALPHA_CHANNEL
- * \param[in] val value to set this component
- * \return 0 if OK; 1 on error
- *
- *
- * Notes:
- * (1) For example, this can be used to set the alpha component to opaque:
- * pixSetComponentArbitrary(pix, L_ALPHA_CHANNEL, 255)
- *
- */
-l_ok
-pixSetComponentArbitrary(PIX *pix,
- l_int32 comp,
- l_int32 val)
-{
-l_int32 i, nwords;
-l_uint32 mask1, mask2;
-l_uint32 *data;
-
- PROCNAME("pixSetComponentArbitrary");
-
- if (!pix || pixGetDepth(pix) != 32)
- return ERROR_INT("pix not defined or not 32 bpp", procName, 1);
- if (comp != COLOR_RED && comp != COLOR_GREEN && comp != COLOR_BLUE &&
- comp != L_ALPHA_CHANNEL)
- return ERROR_INT("invalid component", procName, 1);
- if (val < 0 || val > 255)
- return ERROR_INT("val not in [0 ... 255]", procName, 1);
-
- mask1 = ~(255 << (8 * (3 - comp)));
- mask2 = val << (8 * (3 - comp));
- nwords = pixGetHeight(pix) * pixGetWpl(pix);
- data = pixGetData(pix);
- for (i = 0; i < nwords; i++) {
- data[i] &= mask1; /* clear out the component */
- data[i] |= mask2; /* insert the new component value */
- }
-
- return 0;
-}
-
-
-/*-------------------------------------------------------------*
- * Rectangular region clear/set/set-to-arbitrary-value *
- *-------------------------------------------------------------*/
-/*!
- * \brief pixClearInRect()
- *
- * \param[in] pix all depths; can be cmapped
- * \param[in] box in which all pixels will be cleared
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) Clears all data in rect to 0. For 1 bpp, this is white;
- * for grayscale or color, this is black.
- * (2) Caution: for colormapped pix, this sets the color to the first
- * one in the colormap. Be sure that this is the intended color!
- *
- */
-l_ok
-pixClearInRect(PIX *pix,
- BOX *box)
-{
-l_int32 x, y, w, h;
-
- PROCNAME("pixClearInRect");
-
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
- if (!box)
- return ERROR_INT("box not defined", procName, 1);
-
- boxGetGeometry(box, &x, &y, &w, &h);
- pixRasterop(pix, x, y, w, h, PIX_CLR, NULL, 0, 0);
- return 0;
-}
-
-
-/*!
- * \brief pixSetInRect()
- *
- * \param[in] pix all depths, can be cmapped
- * \param[in] box in which all pixels will be set
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) Sets all data in rect to 1. For 1 bpp, this is black;
- * for grayscale or color, this is white.
- * (2) Caution: for colormapped pix, this sets the pixel value to the
- * maximum value supported by the colormap: 2^d - 1. However, this
- * color may not be defined, because the colormap may not be full.
- *
- */
-l_ok
-pixSetInRect(PIX *pix,
- BOX *box)
-{
-l_int32 n, x, y, w, h;
-PIXCMAP *cmap;
-
- PROCNAME("pixSetInRect");
-
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
- if (!box)
- return ERROR_INT("box not defined", procName, 1);
- if ((cmap = pixGetColormap(pix)) != NULL) {
- n = pixcmapGetCount(cmap);
- if (n < cmap->nalloc) /* cmap is not full */
- return ERROR_INT("cmap entry does not exist", procName, 1);
- }
-
- boxGetGeometry(box, &x, &y, &w, &h);
- pixRasterop(pix, x, y, w, h, PIX_SET, NULL, 0, 0);
- return 0;
-}
-
-
-/*!
- * \brief pixSetInRectArbitrary()
- *
- * \param[in] pix all depths; can be cmapped
- * \param[in] box in which all pixels will be set to val
- * \param[in] val value to set all pixels
- * \return 0 if OK; 1 on error
- *
- *
- * Notes:
- * (1) For colormapped pix, be sure the value is the intended
- * one in the colormap.
- * (2) Caution: for colormapped pix, this sets each pixel in the
- * rect to the color at the index equal to val. Be sure that
- * this index exists in the colormap and that it is the intended one!
- *
- */
-l_ok
-pixSetInRectArbitrary(PIX *pix,
- BOX *box,
- l_uint32 val)
-{
-l_int32 n, x, y, xstart, xend, ystart, yend, bw, bh, w, h, d, wpl, maxval;
-l_uint32 *data, *line;
-BOX *boxc;
-PIXCMAP *cmap;
-
- PROCNAME("pixSetInRectArbitrary");
-
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
- if (!box)
- return ERROR_INT("box not defined", procName, 1);
- pixGetDimensions(pix, &w, &h, &d);
- if (d != 1 && d != 2 && d != 4 && d !=8 && d != 16 && d != 32)
- return ERROR_INT("depth must be in {1,2,4,8,16,32} bpp", procName, 1);
- if ((cmap = pixGetColormap(pix)) != NULL) {
- n = pixcmapGetCount(cmap);
- if (val >= n) {
- L_WARNING("index not in colormap; using last color\n", procName);
- val = n - 1;
- }
- }
-
- maxval = (d == 32) ? 0xffffff00 : (1 << d) - 1;
- if (val > maxval) val = maxval;
-
- /* Handle the simple cases: the min and max values */
- if (val == 0) {
- pixClearInRect(pix, box);
- return 0;
- }
- if (d == 1 ||
- (d == 2 && val == 3) ||
- (d == 4 && val == 0xf) ||
- (d == 8 && val == 0xff) ||
- (d == 16 && val == 0xffff) ||
- (d == 32 && ((val ^ 0xffffff00) >> 8 == 0))) {
- pixSetInRect(pix, box);
- return 0;
- }
-
- /* Find the overlap of box with the input pix */
- if ((boxc = boxClipToRectangle(box, w, h)) == NULL)
- return ERROR_INT("no overlap of box with image", procName, 1);
- boxGetGeometry(boxc, &xstart, &ystart, &bw, &bh);
- xend = xstart + bw - 1;
- yend = ystart + bh - 1;
- boxDestroy(&boxc);
-
- wpl = pixGetWpl(pix);
- data = pixGetData(pix);
- for (y = ystart; y <= yend; y++) {
- line = data + y * wpl;
- for (x = xstart; x <= xend; x++) {
- switch(d)
- {
- case 2:
- SET_DATA_DIBIT(line, x, val);
- break;
- case 4:
- SET_DATA_QBIT(line, x, val);
- break;
- case 8:
- SET_DATA_BYTE(line, x, val);
- break;
- case 16:
- SET_DATA_TWO_BYTES(line, x, val);
- break;
- case 32:
- line[x] = val;
- break;
- default:
- return ERROR_INT("depth not 2|4|8|16|32 bpp", procName, 1);
- }
- }
- }
-
- return 0;
-}
-
-
-/*!
- * \brief pixBlendInRect()
- *
- * \param[in] pixs 32 bpp rgb
- * \param[in] box [optional] in which all pixels will be blended
- * \param[in] val blend value; 0xrrggbb00
- * \param[in] fract fraction of color to be blended with each pixel in pixs
- * \return 0 if OK; 1 on error
- *
- *
- * Notes:
- * (1) This is an in-place function. It blends the input color %val
- * with the pixels in pixs in the specified rectangle.
- * If no rectangle is specified, it blends over the entire image.
- *
- */
-l_ok
-pixBlendInRect(PIX *pixs,
- BOX *box,
- l_uint32 val,
- l_float32 fract)
-{
-l_int32 i, j, bx, by, bw, bh, w, h, wpls;
-l_int32 prval, pgval, pbval, rval, gval, bval;
-l_uint32 val32;
-l_uint32 *datas, *lines;
-
- PROCNAME("pixBlendInRect");
-
- if (!pixs || pixGetDepth(pixs) != 32)
- return ERROR_INT("pixs not defined or not 32 bpp", procName, 1);
-
- extractRGBValues(val, &rval, &gval, &bval);
- pixGetDimensions(pixs, &w, &h, NULL);
- datas = pixGetData(pixs);
- wpls = pixGetWpl(pixs);
- if (!box) {
- for (i = 0; i < h; i++) { /* scan over box */
- lines = datas + i * wpls;
- for (j = 0; j < w; j++) {
- val32 = *(lines + j);
- extractRGBValues(val32, &prval, &pgval, &pbval);
- prval = (l_int32)((1. - fract) * prval + fract * rval);
- pgval = (l_int32)((1. - fract) * pgval + fract * gval);
- pbval = (l_int32)((1. - fract) * pbval + fract * bval);
- composeRGBPixel(prval, pgval, pbval, &val32);
- *(lines + j) = val32;
- }
- }
- return 0;
- }
-
- boxGetGeometry(box, &bx, &by, &bw, &bh);
- for (i = 0; i < bh; i++) { /* scan over box */
- if (by + i < 0 || by + i >= h) continue;
- lines = datas + (by + i) * wpls;
- for (j = 0; j < bw; j++) {
- if (bx + j < 0 || bx + j >= w) continue;
- val32 = *(lines + bx + j);
- extractRGBValues(val32, &prval, &pgval, &pbval);
- prval = (l_int32)((1. - fract) * prval + fract * rval);
- pgval = (l_int32)((1. - fract) * pgval + fract * gval);
- pbval = (l_int32)((1. - fract) * pbval + fract * bval);
- composeRGBPixel(prval, pgval, pbval, &val32);
- *(lines + bx + j) = val32;
- }
- }
- return 0;
-}
-
-
-/*-------------------------------------------------------------*
- * Set pad bits *
- *-------------------------------------------------------------*/
-/*!
- * \brief pixSetPadBits()
- *
- * \param[in] pix 1, 2, 4, 8, 16, 32 bpp
- * \param[in] val 0 or 1
- * \return 0 if OK; 1 on error
- *
- *
- * Notes:
- * (1) The pad bits are the bits that expand each scanline to a
- * multiple of 32 bits. They are usually not used in
- * image processing operations. When boundary conditions
- * are important, as in seedfill, they must be set properly.
- * (2) This sets the value of the pad bits (if any) in the last
- * 32-bit word in each scanline.
- * (3) For 32 bpp pix, there are no pad bits, so this is a no-op.
- * (4) When writing formatted output, such as tiff, png or jpeg,
- * the pad bits have no effect on the raster image that is
- * generated by reading back from the file. However, in some
- * cases, the compressed file itself will depend on the pad
- * bits. This is seen, for example, in Windows with 2 and 4 bpp
- * tiff-compressed images that have pad bits on each scanline.
- * It is sometimes convenient to use a golden file with a
- * byte-by-byte check to verify invariance. Consequently,
- * and because setting the pad bits is cheap, the pad bits are
- * set to 0 before writing these compressed files.
- *
- */
-l_ok
-pixSetPadBits(PIX *pix,
- l_int32 val)
-{
-l_int32 i, w, h, d, wpl, endbits, fullwords;
-l_uint32 mask;
-l_uint32 *data, *pword;
-
- PROCNAME("pixSetPadBits");
-
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
-
- pixGetDimensions(pix, &w, &h, &d);
- if (d == 32) /* no padding exists for 32 bpp */
- return 0;
-
- data = pixGetData(pix);
- wpl = pixGetWpl(pix);
- endbits = 32 - (((l_int64)w * d) % 32);
- if (endbits == 32) /* no partial word */
- return 0;
- fullwords = (1LL * w * d) / 32;
- mask = rmask32[endbits];
- if (val == 0)
- mask = ~mask;
-
- for (i = 0; i < h; i++) {
- pword = data + i * wpl + fullwords;
- if (val == 0) /* clear */
- *pword = *pword & mask;
- else /* set */
- *pword = *pword | mask;
- }
-
- return 0;
-}
-
-
-/*!
- * \brief pixSetPadBitsBand()
- *
- * \param[in] pix 1, 2, 4, 8, 16, 32 bpp
- * \param[in] by starting y value of band
- * \param[in] bh height of band
- * \param[in] val 0 or 1
- * \return 0 if OK; 1 on error
- *
- *
- * Notes:
- * (1) The pad bits are the bits that expand each scanline to a
- * multiple of 32 bits. They are usually not used in
- * image processing operations. When boundary conditions
- * are important, as in seedfill, they must be set properly.
- * (2) This sets the value of the pad bits (if any) in the last
- * 32-bit word in each scanline, within the specified
- * band of raster lines.
- * (3) For 32 bpp pix, there are no pad bits, so this is a no-op.
- *
- */
-l_ok
-pixSetPadBitsBand(PIX *pix,
- l_int32 by,
- l_int32 bh,
- l_int32 val)
-{
-l_int32 i, w, h, d, wpl, endbits, fullwords;
-l_uint32 mask;
-l_uint32 *data, *pword;
-
- PROCNAME("pixSetPadBitsBand");
-
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
-
- pixGetDimensions(pix, &w, &h, &d);
- if (d == 32) /* no padding exists for 32 bpp */
- return 0;
-
- if (by < 0)
- by = 0;
- if (by >= h)
- return ERROR_INT("start y not in image", procName, 1);
- if (by + bh > h)
- bh = h - by;
-
- data = pixGetData(pix);
- wpl = pixGetWpl(pix);
- endbits = 32 - (((l_int64)w * d) % 32);
- if (endbits == 32) /* no partial word */
- return 0;
- fullwords = (l_int64)w * d / 32;
-
- mask = rmask32[endbits];
- if (val == 0)
- mask = ~mask;
-
- for (i = by; i < by + bh; i++) {
- pword = data + i * wpl + fullwords;
- if (val == 0) /* clear */
- *pword = *pword & mask;
- else /* set */
- *pword = *pword | mask;
- }
-
- return 0;
-}
-
-
-/*-------------------------------------------------------------*
- * Set border pixels *
- *-------------------------------------------------------------*/
-/*!
- * \brief pixSetOrClearBorder()
- *
- * \param[in] pixs all depths
- * \param[in] left, right, top, bot amount to set or clear
- * \param[in] op operation PIX_SET or PIX_CLR
- * \return 0 if OK; 1 on error
- *
- *
- * Notes:
- * (1) The border region is defined to be the region in the
- * image within a specific distance of each edge. Here, we
- * allow the pixels within a specified distance of each
- * edge to be set independently. This either sets or
- * clears all pixels in the border region.
- * (2) For binary images, use PIX_SET for black and PIX_CLR for white.
- * (3) For grayscale or color images, use PIX_SET for white
- * and PIX_CLR for black.
- *
- */
-l_ok
-pixSetOrClearBorder(PIX *pixs,
- l_int32 left,
- l_int32 right,
- l_int32 top,
- l_int32 bot,
- l_int32 op)
-{
-l_int32 w, h;
-
- PROCNAME("pixSetOrClearBorder");
-
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
- if (op != PIX_SET && op != PIX_CLR)
- return ERROR_INT("op must be PIX_SET or PIX_CLR", procName, 1);
-
- pixGetDimensions(pixs, &w, &h, NULL);
- pixRasterop(pixs, 0, 0, left, h, op, NULL, 0, 0);
- pixRasterop(pixs, w - right, 0, right, h, op, NULL, 0, 0);
- pixRasterop(pixs, 0, 0, w, top, op, NULL, 0, 0);
- pixRasterop(pixs, 0, h - bot, w, bot, op, NULL, 0, 0);
-
- return 0;
-}
-
-
-/*!
- * \brief pixSetBorderVal()
- *
- * \param[in] pixs 8, 16 or 32 bpp
- * \param[in] left, right, top, bot amount to set
- * \param[in] val value to set at each border pixel
- * \return 0 if OK; 1 on error
- *
- *
- * Notes:
- * (1) The border region is defined to be the region in the
- * image within a specific distance of each edge. Here, we
- * allow the pixels within a specified distance of each
- * edge to be set independently. This sets the pixels
- * in the border region to the given input value.
- * (2) For efficiency, use pixSetOrClearBorder() if
- * you're setting the border to either black or white.
- * (3) If d != 32, the input value should be masked off
- * to the appropriate number of least significant bits.
- * (4) The code is easily generalized for 2 or 4 bpp.
- *
- */
-l_ok
-pixSetBorderVal(PIX *pixs,
- l_int32 left,
- l_int32 right,
- l_int32 top,
- l_int32 bot,
- l_uint32 val)
-{
-l_int32 w, h, d, wpls, i, j, bstart, rstart;
-l_uint32 *datas, *lines;
-
- PROCNAME("pixSetBorderVal");
-
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
- pixGetDimensions(pixs, &w, &h, &d);
- if (d != 8 && d != 16 && d != 32)
- return ERROR_INT("depth must be 8, 16 or 32 bpp", procName, 1);
-
- datas = pixGetData(pixs);
- wpls = pixGetWpl(pixs);
- if (d == 8) {
- val &= 0xff;
- for (i = 0; i < top; i++) {
- lines = datas + i * wpls;
- for (j = 0; j < w; j++)
- SET_DATA_BYTE(lines, j, val);
- }
- rstart = w - right;
- bstart = h - bot;
- for (i = top; i < bstart; i++) {
- lines = datas + i * wpls;
- for (j = 0; j < left; j++)
- SET_DATA_BYTE(lines, j, val);
- for (j = rstart; j < w; j++)
- SET_DATA_BYTE(lines, j, val);
- }
- for (i = bstart; i < h; i++) {
- lines = datas + i * wpls;
- for (j = 0; j < w; j++)
- SET_DATA_BYTE(lines, j, val);
- }
- } else if (d == 16) {
- val &= 0xffff;
- for (i = 0; i < top; i++) {
- lines = datas + i * wpls;
- for (j = 0; j < w; j++)
- SET_DATA_TWO_BYTES(lines, j, val);
- }
- rstart = w - right;
- bstart = h - bot;
- for (i = top; i < bstart; i++) {
- lines = datas + i * wpls;
- for (j = 0; j < left; j++)
- SET_DATA_TWO_BYTES(lines, j, val);
- for (j = rstart; j < w; j++)
- SET_DATA_TWO_BYTES(lines, j, val);
- }
- for (i = bstart; i < h; i++) {
- lines = datas + i * wpls;
- for (j = 0; j < w; j++)
- SET_DATA_TWO_BYTES(lines, j, val);
- }
- } else { /* d == 32 */
- for (i = 0; i < top; i++) {
- lines = datas + i * wpls;
- for (j = 0; j < w; j++)
- *(lines + j) = val;
- }
- rstart = w - right;
- bstart = h - bot;
- for (i = top; i < bstart; i++) {
- lines = datas + i * wpls;
- for (j = 0; j < left; j++)
- *(lines + j) = val;
- for (j = rstart; j < w; j++)
- *(lines + j) = val;
- }
- for (i = bstart; i < h; i++) {
- lines = datas + i * wpls;
- for (j = 0; j < w; j++)
- *(lines + j) = val;
- }
- }
-
- return 0;
-}
-
-
-/*!
- * \brief pixSetBorderRingVal()
- *
- * \param[in] pixs any depth; cmap OK
- * \param[in] dist distance from outside; must be > 0; first ring is 1
- * \param[in] val value to set at each border pixel
- * \return 0 if OK; 1 on error
- *
- *
- * Notes:
- * (1) The rings are single-pixel-wide rectangular sets of
- * pixels at a given distance from the edge of the pix.
- * This sets all pixels in a given ring to a value.
- *
- */
-l_ok
-pixSetBorderRingVal(PIX *pixs,
- l_int32 dist,
- l_uint32 val)
-{
-l_int32 w, h, d, i, j, xend, yend;
-
- PROCNAME("pixSetBorderRingVal");
-
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
- if (dist < 1)
- return ERROR_INT("dist must be > 0", procName, 1);
- pixGetDimensions(pixs, &w, &h, &d);
- if (w < 2 * dist + 1 || h < 2 * dist + 1)
- return ERROR_INT("ring doesn't exist", procName, 1);
- if (d < 32 && (val >= (1 << d)))
- return ERROR_INT("invalid pixel value", procName, 1);
-
- xend = w - dist;
- yend = h - dist;
- for (j = dist - 1; j <= xend; j++)
- pixSetPixel(pixs, j, dist - 1, val);
- for (j = dist - 1; j <= xend; j++)
- pixSetPixel(pixs, j, yend, val);
- for (i = dist - 1; i <= yend; i++)
- pixSetPixel(pixs, dist - 1, i, val);
- for (i = dist - 1; i <= yend; i++)
- pixSetPixel(pixs, xend, i, val);
-
- return 0;
-}
-
-
-/*!
- * \brief pixSetMirroredBorder()
- *
- * \param[in] pixs all depths; colormap ok
- * \param[in] left, right, top, bot number of pixels to set
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This applies what is effectively mirror boundary conditions
- * to a border region in the image. It is in-place.
- * (2) This is useful for setting pixels near the border to a
- * value representative of the near pixels to the interior.
- * (3) The general pixRasterop() is used for an in-place operation here
- * because there is no overlap between the src and dest rectangles.
- *
- */
-l_ok
-pixSetMirroredBorder(PIX *pixs,
- l_int32 left,
- l_int32 right,
- l_int32 top,
- l_int32 bot)
-{
-l_int32 i, j, w, h;
-
- PROCNAME("pixSetMirroredBorder");
-
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
-
- pixGetDimensions(pixs, &w, &h, NULL);
- for (j = 0; j < left; j++)
- pixRasterop(pixs, left - 1 - j, top, 1, h - top - bot, PIX_SRC,
- pixs, left + j, top);
- for (j = 0; j < right; j++)
- pixRasterop(pixs, w - right + j, top, 1, h - top - bot, PIX_SRC,
- pixs, w - right - 1 - j, top);
- for (i = 0; i < top; i++)
- pixRasterop(pixs, 0, top - 1 - i, w, 1, PIX_SRC,
- pixs, 0, top + i);
- for (i = 0; i < bot; i++)
- pixRasterop(pixs, 0, h - bot + i, w, 1, PIX_SRC,
- pixs, 0, h - bot - 1 - i);
-
- return 0;
-}
-
-
-/*!
- * \brief pixCopyBorder()
- *
- * \param[in] pixd all depths; colormap ok; can be NULL
- * \param[in] pixs same depth and size as pixd
- * \param[in] left, right, top, bot number of pixels to copy
- * \return pixd, or NULL on error if pixd is not defined
- *
- *
- * Notes:
- * (1) pixd can be null, but otherwise it must be the same size
- * and depth as pixs. Always returns pixd.
- * (2) This is useful in situations where by setting a few border
- * pixels we can avoid having to copy all pixels in pixs into
- * pixd as an initialization step for some operation.
- * Nevertheless, for safety, if making a new pixd, all the
- * non-border pixels are initialized to 0.
- *
- */
-PIX *
-pixCopyBorder(PIX *pixd,
- PIX *pixs,
- l_int32 left,
- l_int32 right,
- l_int32 top,
- l_int32 bot)
-{
-l_int32 w, h;
-
- PROCNAME("pixCopyBorder");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, pixd);
-
- if (pixd) {
- if (pixd == pixs) {
- L_WARNING("same: nothing to do\n", procName);
- return pixd;
- } else if (!pixSizesEqual(pixs, pixd)) {
- return (PIX *)ERROR_PTR("pixs and pixd sizes differ",
- procName, pixd);
- }
- } else {
- if ((pixd = pixCreateTemplate(pixs)) == NULL)
- return (PIX *)ERROR_PTR("pixd not made", procName, pixd);
- }
-
- pixGetDimensions(pixs, &w, &h, NULL);
- pixRasterop(pixd, 0, 0, left, h, PIX_SRC, pixs, 0, 0);
- pixRasterop(pixd, w - right, 0, right, h, PIX_SRC, pixs, w - right, 0);
- pixRasterop(pixd, 0, 0, w, top, PIX_SRC, pixs, 0, 0);
- pixRasterop(pixd, 0, h - bot, w, bot, PIX_SRC, pixs, 0, h - bot);
- return pixd;
-}
-
-
-
-/*-------------------------------------------------------------*
- * Add and remove border *
- *-------------------------------------------------------------*/
-/*!
- * \brief pixAddBorder()
- *
- * \param[in] pixs all depths; colormap ok
- * \param[in] npix number of pixels to be added to each side
- * \param[in] val value of added border pixels
- * \return pixd with the added exterior pixels, or NULL on error
- *
- *
- * Notes:
- * (1) See pixGetBlackOrWhiteVal() for values of black and white pixels.
- *
- */
-PIX *
-pixAddBorder(PIX *pixs,
- l_int32 npix,
- l_uint32 val)
-{
- PROCNAME("pixAddBorder");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- if (npix == 0)
- return pixClone(pixs);
- return pixAddBorderGeneral(pixs, npix, npix, npix, npix, val);
-}
-
-
-/*!
- * \brief pixAddBlackOrWhiteBorder()
- *
- * \param[in] pixs all depths; colormap ok
- * \param[in] left, right, top, bot number of pixels added
- * \param[in] op L_GET_BLACK_VAL, L_GET_WHITE_VAL
- * \return pixd with the added exterior pixels, or NULL on error
- *
- *
- * Notes:
- * (1) See pixGetBlackOrWhiteVal() for possible side effect (adding
- * a color to a colormap).
- * (2) The only complication is that pixs may have a colormap.
- * There are two ways to add the black or white border:
- * (a) As done here (simplest, most efficient)
- * (b) l_int32 ws, hs, d;
- * pixGetDimensions(pixs, &ws, &hs, &d);
- * Pix *pixd = pixCreate(ws + left + right, hs + top + bot, d);
- * PixColormap *cmap = pixGetColormap(pixs);
- * if (cmap != NULL)
- * pixSetColormap(pixd, pixcmapCopy(cmap));
- * pixSetBlackOrWhite(pixd, L_SET_WHITE); // uses cmap
- * pixRasterop(pixd, left, top, ws, hs, PIX_SET, pixs, 0, 0);
- *
- */
-PIX *
-pixAddBlackOrWhiteBorder(PIX *pixs,
- l_int32 left,
- l_int32 right,
- l_int32 top,
- l_int32 bot,
- l_int32 op)
-{
-l_uint32 val;
-
- PROCNAME("pixAddBlackOrWhiteBorder");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- if (op != L_GET_BLACK_VAL && op != L_GET_WHITE_VAL)
- return (PIX *)ERROR_PTR("invalid op", procName, NULL);
-
- pixGetBlackOrWhiteVal(pixs, op, &val);
- return pixAddBorderGeneral(pixs, left, right, top, bot, val);
-}
-
-
-/*!
- * \brief pixAddBorderGeneral()
- *
- * \param[in] pixs all depths; colormap ok
- * \param[in] left, right, top, bot number of pixels added
- * \param[in] val value of added border pixels
- * \return pixd with the added exterior pixels, or NULL on error
- *
- *
- * Notes:
- * (1) For binary images:
- * white: val = 0
- * black: val = 1
- * For grayscale images:
- * white: val = 2 ** d - 1
- * black: val = 0
- * For rgb color images:
- * white: val = 0xffffff00
- * black: val = 0
- * For colormapped images, set val to the appropriate colormap index.
- * (2) If the added border is either black or white, you can use
- * pixAddBlackOrWhiteBorder()
- * The black and white values for all images can be found with
- * pixGetBlackOrWhiteVal()
- * which, if pixs is cmapped, may add an entry to the colormap.
- * Alternatively, if pixs has a colormap, you can find the index
- * of the pixel whose intensity is closest to white or black:
- * white: pixcmapGetRankIntensity(cmap, 1.0, &index);
- * black: pixcmapGetRankIntensity(cmap, 0.0, &index);
- * and use that for val.
- *
- */
-PIX *
-pixAddBorderGeneral(PIX *pixs,
- l_int32 left,
- l_int32 right,
- l_int32 top,
- l_int32 bot,
- l_uint32 val)
-{
-l_int32 ws, hs, wd, hd, d, maxval, op;
-PIX *pixd;
-
- PROCNAME("pixAddBorderGeneral");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- if (left < 0 || right < 0 || top < 0 || bot < 0)
- return (PIX *)ERROR_PTR("negative border added!", procName, NULL);
-
- pixGetDimensions(pixs, &ws, &hs, &d);
- wd = ws + left + right;
- hd = hs + top + bot;
- if ((pixd = pixCreateNoInit(wd, hd, d)) == NULL)
- return (PIX *)ERROR_PTR("pixd not made", procName, NULL);
- pixCopyResolution(pixd, pixs);
- pixCopyColormap(pixd, pixs);
-
- /* Set the new border pixels */
- maxval = (d == 32) ? 0xffffff00 : (1 << d) - 1;
- op = UNDEF;
- if (val == 0)
- op = PIX_CLR;
- else if (val >= maxval)
- op = PIX_SET;
- if (op == UNDEF) {
- pixSetAllArbitrary(pixd, val);
- } else { /* just set or clear the border pixels */
- pixRasterop(pixd, 0, 0, left, hd, op, NULL, 0, 0);
- pixRasterop(pixd, wd - right, 0, right, hd, op, NULL, 0, 0);
- pixRasterop(pixd, 0, 0, wd, top, op, NULL, 0, 0);
- pixRasterop(pixd, 0, hd - bot, wd, bot, op, NULL, 0, 0);
- }
-
- /* Copy pixs into the interior */
- pixRasterop(pixd, left, top, ws, hs, PIX_SRC, pixs, 0, 0);
- return pixd;
-}
-
-
-/*!
- * \brief pixRemoveBorder()
- *
- * \param[in] pixs all depths; colormap ok
- * \param[in] npix number to be removed from each of the 4 sides
- * \return pixd with pixels removed around border, or NULL on error
- */
-PIX *
-pixRemoveBorder(PIX *pixs,
- l_int32 npix)
-{
- PROCNAME("pixRemoveBorder");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- if (npix == 0)
- return pixClone(pixs);
- return pixRemoveBorderGeneral(pixs, npix, npix, npix, npix);
-}
-
-
-/*!
- * \brief pixRemoveBorderGeneral()
- *
- * \param[in] pixs all depths; colormap ok
- * \param[in] left, right, top, bot number of pixels removed
- * \return pixd with pixels removed around border, or NULL on error
- */
-PIX *
-pixRemoveBorderGeneral(PIX *pixs,
- l_int32 left,
- l_int32 right,
- l_int32 top,
- l_int32 bot)
-{
-l_int32 ws, hs, wd, hd, d;
-PIX *pixd;
-
- PROCNAME("pixRemoveBorderGeneral");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- if (left < 0 || right < 0 || top < 0 || bot < 0)
- return (PIX *)ERROR_PTR("negative border removed!", procName, NULL);
-
- pixGetDimensions(pixs, &ws, &hs, &d);
- wd = ws - left - right;
- hd = hs - top - bot;
- if (wd <= 0)
- return (PIX *)ERROR_PTR("width must be > 0", procName, NULL);
- if (hd <= 0)
- return (PIX *)ERROR_PTR("height must be > 0", procName, NULL);
- if ((pixd = pixCreateNoInit(wd, hd, d)) == NULL)
- return (PIX *)ERROR_PTR("pixd not made", procName, NULL);
- pixCopyResolution(pixd, pixs);
- pixCopySpp(pixd, pixs);
- pixCopyColormap(pixd, pixs);
-
- pixRasterop(pixd, 0, 0, wd, hd, PIX_SRC, pixs, left, top);
- if (pixGetDepth(pixs) == 32 && pixGetSpp(pixs) == 4)
- pixShiftAndTransferAlpha(pixd, pixs, -left, -top);
- return pixd;
-}
-
-
-/*!
- * \brief pixRemoveBorderToSize()
- *
- * \param[in] pixs all depths; colormap ok
- * \param[in] wd target width; use 0 if only removing from height
- * \param[in] hd target height; use 0 if only removing from width
- * \return pixd with pixels removed around border, or NULL on error
- *
- *
- * Notes:
- * (1) Removes pixels as evenly as possible from the sides of the
- * image, leaving the central part.
- * (2) Returns clone if no pixels requested removed, or the target
- * sizes are larger than the image.
- *
- */
-PIX *
-pixRemoveBorderToSize(PIX *pixs,
- l_int32 wd,
- l_int32 hd)
-{
-l_int32 w, h, top, bot, left, right, delta;
-
- PROCNAME("pixRemoveBorderToSize");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
-
- pixGetDimensions(pixs, &w, &h, NULL);
- if ((wd <= 0 || wd >= w) && (hd <= 0 || hd >= h))
- return pixClone(pixs);
-
- left = right = (w - wd) / 2;
- delta = w - 2 * left - wd;
- right += delta;
- top = bot = (h - hd) / 2;
- delta = h - hd - 2 * top;
- bot += delta;
- if (wd <= 0 || wd > w)
- left = right = 0;
- else if (hd <= 0 || hd > h)
- top = bot = 0;
-
- return pixRemoveBorderGeneral(pixs, left, right, top, bot);
-}
-
-
-/*!
- * \brief pixAddMirroredBorder()
- *
- * \param[in] pixs all depths; colormap ok
- * \param[in] left, right, top, bot number of pixels added
- * \return pixd, or NULL on error
- *
- *
- * Notes:
- * (1) This applies what is effectively mirror boundary conditions.
- * For the added border pixels in pixd, the pixels in pixs
- * near the border are mirror-copied into the border region.
- * (2) This is useful for avoiding special operations near
- * boundaries when doing image processing operations
- * such as rank filters and convolution. In use, one first
- * adds mirrored pixels to each side of the image. The number
- * of pixels added on each side is half the filter dimension.
- * Then the image processing operations proceed over a
- * region equal to the size of the original image, and
- * write directly into a dest pix of the same size as pixs.
- * (3) The general pixRasterop() is used for an in-place operation here
- * because there is no overlap between the src and dest rectangles.
- *
- */
-PIX *
-pixAddMirroredBorder(PIX *pixs,
- l_int32 left,
- l_int32 right,
- l_int32 top,
- l_int32 bot)
-{
-l_int32 i, j, w, h;
-PIX *pixd;
-
- PROCNAME("pixAddMirroredBorder");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- pixGetDimensions(pixs, &w, &h, NULL);
- if (left > w || right > w || top > h || bot > h)
- return (PIX *)ERROR_PTR("border too large", procName, NULL);
-
- /* Set pixels on left, right, top and bottom, in that order */
- pixd = pixAddBorderGeneral(pixs, left, right, top, bot, 0);
- for (j = 0; j < left; j++)
- pixRasterop(pixd, left - 1 - j, top, 1, h, PIX_SRC,
- pixd, left + j, top);
- for (j = 0; j < right; j++)
- pixRasterop(pixd, left + w + j, top, 1, h, PIX_SRC,
- pixd, left + w - 1 - j, top);
- for (i = 0; i < top; i++)
- pixRasterop(pixd, 0, top - 1 - i, left + w + right, 1, PIX_SRC,
- pixd, 0, top + i);
- for (i = 0; i < bot; i++)
- pixRasterop(pixd, 0, top + h + i, left + w + right, 1, PIX_SRC,
- pixd, 0, top + h - 1 - i);
-
- return pixd;
-}
-
-
-/*!
- * \brief pixAddRepeatedBorder()
- *
- * \param[in] pixs all depths; colormap ok
- * \param[in] left, right, top, bot number of pixels added
- * \return pixd, or NULL on error
- *
- *
- * Notes:
- * (1) This applies a repeated border, as if the central part of
- * the image is tiled over the plane. So, for example, the
- * pixels in the left border come from the right side of the image.
- * (2) The general pixRasterop() is used for an in-place operation here
- * because there is no overlap between the src and dest rectangles.
- *
- */
-PIX *
-pixAddRepeatedBorder(PIX *pixs,
- l_int32 left,
- l_int32 right,
- l_int32 top,
- l_int32 bot)
-{
-l_int32 w, h;
-PIX *pixd;
-
- PROCNAME("pixAddRepeatedBorder");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- pixGetDimensions(pixs, &w, &h, NULL);
- if (left > w || right > w || top > h || bot > h)
- return (PIX *)ERROR_PTR("border too large", procName, NULL);
-
- pixd = pixAddBorderGeneral(pixs, left, right, top, bot, 0);
-
- /* Set pixels on left, right, top and bottom, in that order */
- pixRasterop(pixd, 0, top, left, h, PIX_SRC, pixd, w, top);
- pixRasterop(pixd, left + w, top, right, h, PIX_SRC, pixd, left, top);
- pixRasterop(pixd, 0, 0, left + w + right, top, PIX_SRC, pixd, 0, h);
- pixRasterop(pixd, 0, top + h, left + w + right, bot, PIX_SRC, pixd, 0, top);
-
- return pixd;
-}
-
-
-/*!
- * \brief pixAddMixedBorder()
- *
- * \param[in] pixs all depths; colormap ok
- * \param[in] left, right, top, bot number of pixels added
- * \return pixd, or NULL on error
- *
- *
- * Notes:
- * (1) This applies mirrored boundary conditions horizontally
- * and repeated b.c. vertically.
- * (2) It is specifically used for avoiding special operations
- * near boundaries when convolving a hue-saturation histogram
- * with a given window size. The repeated b.c. are used
- * vertically for hue, and the mirrored b.c. are used
- * horizontally for saturation. The number of pixels added
- * on each side is approximately (but not quite) half the
- * filter dimension. The image processing operations can
- * then proceed over a region equal to the size of the original
- * image, and write directly into a dest pix of the same
- * size as pixs.
- * (3) The general pixRasterop() can be used for an in-place
- * operation here because there is no overlap between the
- * src and dest rectangles.
- *
- */
-PIX *
-pixAddMixedBorder(PIX *pixs,
- l_int32 left,
- l_int32 right,
- l_int32 top,
- l_int32 bot)
-{
-l_int32 j, w, h;
-PIX *pixd;
-
- PROCNAME("pixAddMixedBorder");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- pixGetDimensions(pixs, &w, &h, NULL);
- if (left > w || right > w || top > h || bot > h)
- return (PIX *)ERROR_PTR("border too large", procName, NULL);
-
- /* Set mirrored pixels on left and right;
- * then set repeated pixels on top and bottom. */
- pixd = pixAddBorderGeneral(pixs, left, right, top, bot, 0);
- for (j = 0; j < left; j++)
- pixRasterop(pixd, left - 1 - j, top, 1, h, PIX_SRC,
- pixd, left + j, top);
- for (j = 0; j < right; j++)
- pixRasterop(pixd, left + w + j, top, 1, h, PIX_SRC,
- pixd, left + w - 1 - j, top);
- pixRasterop(pixd, 0, 0, left + w + right, top, PIX_SRC, pixd, 0, h);
- pixRasterop(pixd, 0, top + h, left + w + right, bot, PIX_SRC, pixd, 0, top);
-
- return pixd;
-}
-
-
-/*!
- * \brief pixAddContinuedBorder()
- *
- * \param[in] pixs all depths; colormap ok
- * \param[in] left, right, top, bot pixels on each side to be added
- * \return pixd, or NULL on error
- *
- *
- * Notes:
- * (1) This adds pixels on each side whose values are equal to
- * the value on the closest boundary pixel.
- *
- */
-PIX *
-pixAddContinuedBorder(PIX *pixs,
- l_int32 left,
- l_int32 right,
- l_int32 top,
- l_int32 bot)
-{
-l_int32 i, j, w, h;
-PIX *pixd;
-
- PROCNAME("pixAddContinuedBorder");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
-
- pixd = pixAddBorderGeneral(pixs, left, right, top, bot, 0);
- pixGetDimensions(pixs, &w, &h, NULL);
- for (j = 0; j < left; j++)
- pixRasterop(pixd, j, top, 1, h, PIX_SRC, pixd, left, top);
- for (j = 0; j < right; j++)
- pixRasterop(pixd, left + w + j, top, 1, h,
- PIX_SRC, pixd, left + w - 1, top);
- for (i = 0; i < top; i++)
- pixRasterop(pixd, 0, i, left + w + right, 1, PIX_SRC, pixd, 0, top);
- for (i = 0; i < bot; i++)
- pixRasterop(pixd, 0, top + h + i, left + w + right, 1,
- PIX_SRC, pixd, 0, top + h - 1);
-
- return pixd;
-}
-
-
-/*-------------------------------------------------------------------*
- * Helper functions using alpha *
- *-------------------------------------------------------------------*/
-/*!
- * \brief pixShiftAndTransferAlpha()
- *
- * \param[in] pixd 32 bpp
- * \param[in] pixs 32 bpp
- * \param[in] shiftx, shifty
- * \return 0 if OK; 1 on error
- */
-l_ok
-pixShiftAndTransferAlpha(PIX *pixd,
- PIX *pixs,
- l_float32 shiftx,
- l_float32 shifty)
-{
-l_int32 w, h;
-PIX *pix1, *pix2;
-
- PROCNAME("pixShiftAndTransferAlpha");
-
- if (!pixs || !pixd)
- return ERROR_INT("pixs and pixd not both defined", procName, 1);
- if (pixGetDepth(pixs) != 32 || pixGetSpp(pixs) != 4)
- return ERROR_INT("pixs not 32 bpp and 4 spp", procName, 1);
- if (pixGetDepth(pixd) != 32)
- return ERROR_INT("pixd not 32 bpp", procName, 1);
-
- if (shiftx == 0 && shifty == 0) {
- pixCopyRGBComponent(pixd, pixs, L_ALPHA_CHANNEL);
- return 0;
- }
-
- pix1 = pixGetRGBComponent(pixs, L_ALPHA_CHANNEL);
- pixGetDimensions(pixd, &w, &h, NULL);
- pix2 = pixCreate(w, h, 8);
- pixRasterop(pix2, 0, 0, w, h, PIX_SRC, pix1, -shiftx, -shifty);
- pixSetRGBComponent(pixd, pix2, L_ALPHA_CHANNEL);
- pixDestroy(&pix1);
- pixDestroy(&pix2);
- return 0;
-}
-
-
-/*!
- * \brief pixDisplayLayersRGBA()
- *
- * \param[in] pixs cmap or 32 bpp rgba
- * \param[in] val 32 bit unsigned color to use as background
- * \param[in] maxw max output image width; 0 for no scaling
- * \return pixd showing various image views, or NULL on error
- *
- *
- * Notes:
- * (1) Use %val == 0xffffff00 for white background.
- * (2) Three views are given:
- * ~ the image with a fully opaque alpha
- * ~ the alpha layer
- * ~ the image as it would appear with a white background.
- *
- */
-PIX *
-pixDisplayLayersRGBA(PIX *pixs,
- l_uint32 val,
- l_int32 maxw)
-{
-l_int32 w, width;
-l_float32 scalefact;
-PIX *pix1, *pix2, *pixd;
-PIXA *pixa;
-PIXCMAP *cmap;
-
- PROCNAME("pixDisplayLayersRGBA");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- cmap = pixGetColormap(pixs);
- if (!cmap && !(pixGetDepth(pixs) == 32 && pixGetSpp(pixs) == 4))
- return (PIX *)ERROR_PTR("pixs not cmap and not 32 bpp rgba",
- procName, NULL);
- if ((w = pixGetWidth(pixs)) == 0)
- return (PIX *)ERROR_PTR("pixs width 0 !!", procName, NULL);
-
- if (cmap)
- pix1 = pixRemoveColormap(pixs, REMOVE_CMAP_WITH_ALPHA);
- else
- pix1 = pixCopy(NULL, pixs);
-
- /* Scale if necessary so the output width is not larger than maxw */
- scalefact = (maxw == 0) ? 1.0 : L_MIN(1.0, (l_float32)(maxw) / w);
- width = (l_int32)(scalefact * w);
-
- pixa = pixaCreate(3);
- pixSetSpp(pix1, 3);
- pixaAddPix(pixa, pix1, L_INSERT); /* show the rgb values */
- pix1 = pixGetRGBComponent(pixs, L_ALPHA_CHANNEL);
- pix2 = pixConvertTo32(pix1);
- pixaAddPix(pixa, pix2, L_INSERT); /* show the alpha channel */
- pixDestroy(&pix1);
- pix1 = pixAlphaBlendUniform(pixs, (val & 0xffffff00));
- pixaAddPix(pixa, pix1, L_INSERT); /* with %val color bg showing */
- pixd = pixaDisplayTiledInRows(pixa, 32, width, scalefact, 0, 25, 2);
- pixaDestroy(&pixa);
- return pixd;
-}
-
-
-/*-------------------------------------------------------------*
- * Color sample setting and extraction *
- *-------------------------------------------------------------*/
-/*!
- * \brief pixCreateRGBImage()
- *
- * \param[in] pixr 8 bpp red pix
- * \param[in] pixg 8 bpp green pix
- * \param[in] pixb 8 bpp blue pix
- * \return 32 bpp pix, interleaved with 4 samples/pixel,
- * or NULL on error
- *
- *
- * Notes:
- * (1) the 4th byte, sometimes called the "alpha channel",
- * and which is often used for blending between different
- * images, is left with 0 value.
- * (2) see Note (4) in pix.h for details on storage of
- * 8-bit samples within each 32-bit word.
- * (3) This implementation, setting the r, g and b components
- * sequentially, is much faster than setting them in parallel
- * by constructing an RGB dest pixel and writing it to dest.
- * The reason is there are many more cache misses when reading
- * from 3 input images simultaneously.
- *
- */
-PIX *
-pixCreateRGBImage(PIX *pixr,
- PIX *pixg,
- PIX *pixb)
-{
-l_int32 wr, wg, wb, hr, hg, hb, dr, dg, db;
-PIX *pixd;
-
- PROCNAME("pixCreateRGBImage");
-
- if (!pixr)
- return (PIX *)ERROR_PTR("pixr not defined", procName, NULL);
- if (!pixg)
- return (PIX *)ERROR_PTR("pixg not defined", procName, NULL);
- if (!pixb)
- return (PIX *)ERROR_PTR("pixb not defined", procName, NULL);
- pixGetDimensions(pixr, &wr, &hr, &dr);
- pixGetDimensions(pixg, &wg, &hg, &dg);
- pixGetDimensions(pixb, &wb, &hb, &db);
- if (dr != 8 || dg != 8 || db != 8)
- return (PIX *)ERROR_PTR("input pix not all 8 bpp", procName, NULL);
- if (wr != wg || wr != wb)
- return (PIX *)ERROR_PTR("widths not the same", procName, NULL);
- if (hr != hg || hr != hb)
- return (PIX *)ERROR_PTR("heights not the same", procName, NULL);
-
- if ((pixd = pixCreate(wr, hr, 32)) == NULL)
- return (PIX *)ERROR_PTR("pixd not made", procName, NULL);
- pixCopyResolution(pixd, pixr);
- pixSetRGBComponent(pixd, pixr, COLOR_RED);
- pixSetRGBComponent(pixd, pixg, COLOR_GREEN);
- pixSetRGBComponent(pixd, pixb, COLOR_BLUE);
-
- return pixd;
-}
-
-
-/*!
- * \brief pixGetRGBComponent()
- *
- * \param[in] pixs 32 bpp, or colormapped
- * \param[in] comp one of {COLOR_RED, COLOR_GREEN, COLOR_BLUE,
- * L_ALPHA_CHANNEL}
- * \return pixd the selected 8 bpp component image of the
- * input 32 bpp image or NULL on error
- *
- *
- * Notes:
- * (1) Three calls to this function generate the r, g and b 8 bpp
- * component images. This is much faster than generating the
- * three images in parallel, by extracting a src pixel and setting
- * the pixels of each component image from it. The reason is
- * there are many more cache misses when writing to three
- * output images simultaneously.
- *
- */
-PIX *
-pixGetRGBComponent(PIX *pixs,
- l_int32 comp)
-{
-l_int32 i, j, w, h, wpls, wpld, val;
-l_uint32 *lines, *lined;
-l_uint32 *datas, *datad;
-PIX *pixd;
-
- PROCNAME("pixGetRGBComponent");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- if (pixGetColormap(pixs))
- return pixGetRGBComponentCmap(pixs, comp);
- if (pixGetDepth(pixs) != 32)
- return (PIX *)ERROR_PTR("pixs not 32 bpp", procName, NULL);
- if (comp != COLOR_RED && comp != COLOR_GREEN &&
- comp != COLOR_BLUE && comp != L_ALPHA_CHANNEL)
- return (PIX *)ERROR_PTR("invalid comp", procName, NULL);
-
- pixGetDimensions(pixs, &w, &h, NULL);
- if ((pixd = pixCreate(w, h, 8)) == NULL)
- return (PIX *)ERROR_PTR("pixd not made", procName, NULL);
- pixCopyResolution(pixd, pixs);
- wpls = pixGetWpl(pixs);
- wpld = pixGetWpl(pixd);
- datas = pixGetData(pixs);
- datad = pixGetData(pixd);
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- lined = datad + i * wpld;
- for (j = 0; j < w; j++) {
- val = GET_DATA_BYTE(lines + j, comp);
- SET_DATA_BYTE(lined, j, val);
- }
- }
-
- return pixd;
-}
-
-
-/*!
- * \brief pixSetRGBComponent()
- *
- * \param[in] pixd 32 bpp
- * \param[in] pixs 8 bpp
- * \param[in] comp one of the set: {COLOR_RED, COLOR_GREEN,
- * COLOR_BLUE, L_ALPHA_CHANNEL}
- * \return 0 if OK; 1 on error
- *
- *
- * Notes:
- * (1) This places the 8 bpp pixel in pixs into the
- * specified component (properly interleaved) in pixd,
- * (2) The two images are registered to the UL corner; the sizes
- * need not be the same, but a warning is issued if they differ.
- *
- */
-l_ok
-pixSetRGBComponent(PIX *pixd,
- PIX *pixs,
- l_int32 comp)
-{
-l_uint8 srcbyte;
-l_int32 i, j, w, h, ws, hs, wd, hd;
-l_int32 wpls, wpld;
-l_uint32 *lines, *lined;
-l_uint32 *datas, *datad;
-
- PROCNAME("pixSetRGBComponent");
-
- if (!pixd)
- return ERROR_INT("pixd not defined", procName, 1);
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
- if (pixGetDepth(pixd) != 32)
- return ERROR_INT("pixd not 32 bpp", procName, 1);
- if (pixGetDepth(pixs) != 8)
- return ERROR_INT("pixs not 8 bpp", procName, 1);
- if (comp != COLOR_RED && comp != COLOR_GREEN &&
- comp != COLOR_BLUE && comp != L_ALPHA_CHANNEL)
- return ERROR_INT("invalid comp", procName, 1);
- pixGetDimensions(pixs, &ws, &hs, NULL);
- pixGetDimensions(pixd, &wd, &hd, NULL);
- if (ws != wd || hs != hd)
- L_WARNING("images sizes not equal\n", procName);
- w = L_MIN(ws, wd);
- h = L_MIN(hs, hd);
- if (comp == L_ALPHA_CHANNEL)
- pixSetSpp(pixd, 4);
- datas = pixGetData(pixs);
- datad = pixGetData(pixd);
- wpls = pixGetWpl(pixs);
- wpld = pixGetWpl(pixd);
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- lined = datad + i * wpld;
- for (j = 0; j < w; j++) {
- srcbyte = GET_DATA_BYTE(lines, j);
- SET_DATA_BYTE(lined + j, comp, srcbyte);
- }
- }
-
- return 0;
-}
-
-
-/*!
- * \brief pixGetRGBComponentCmap()
- *
- * \param[in] pixs colormapped
- * \param[in] comp one of the set: {COLOR_RED, COLOR_GREEN, COLOR_BLUE}
- * \return pixd the selected 8 bpp component image of the
- * input cmapped image, or NULL on error
- *
- *
- * Notes:
- * (1) In leptonica, we do not support alpha in colormaps.
- *
- */
-PIX *
-pixGetRGBComponentCmap(PIX *pixs,
- l_int32 comp)
-{
-l_int32 i, j, w, h, val, index;
-l_int32 wplc, wpld;
-l_uint32 *linec, *lined;
-l_uint32 *datac, *datad;
-PIX *pixc, *pixd;
-PIXCMAP *cmap;
-RGBA_QUAD *cta;
-
- PROCNAME("pixGetRGBComponentCmap");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- if ((cmap = pixGetColormap(pixs)) == NULL)
- return (PIX *)ERROR_PTR("pixs not cmapped", procName, NULL);
- if (comp == L_ALPHA_CHANNEL)
- return (PIX *)ERROR_PTR("alpha in cmaps not supported", procName, NULL);
- if (comp != COLOR_RED && comp != COLOR_GREEN && comp != COLOR_BLUE)
- return (PIX *)ERROR_PTR("invalid comp", procName, NULL);
-
- /* If not 8 bpp, make a cmapped 8 bpp pix */
- if (pixGetDepth(pixs) == 8)
- pixc = pixClone(pixs);
- else
- pixc = pixConvertTo8(pixs, TRUE);
-
- pixGetDimensions(pixs, &w, &h, NULL);
- if ((pixd = pixCreateNoInit(w, h, 8)) == NULL) {
- pixDestroy(&pixc);
- return (PIX *)ERROR_PTR("pixd not made", procName, NULL);
- }
- pixCopyResolution(pixd, pixs);
- wplc = pixGetWpl(pixc);
- wpld = pixGetWpl(pixd);
- datac = pixGetData(pixc);
- datad = pixGetData(pixd);
- cta = (RGBA_QUAD *)cmap->array;
-
- for (i = 0; i < h; i++) {
- linec = datac + i * wplc;
- lined = datad + i * wpld;
- if (comp == COLOR_RED) {
- for (j = 0; j < w; j++) {
- index = GET_DATA_BYTE(linec, j);
- val = cta[index].red;
- SET_DATA_BYTE(lined, j, val);
- }
- } else if (comp == COLOR_GREEN) {
- for (j = 0; j < w; j++) {
- index = GET_DATA_BYTE(linec, j);
- val = cta[index].green;
- SET_DATA_BYTE(lined, j, val);
- }
- } else if (comp == COLOR_BLUE) {
- for (j = 0; j < w; j++) {
- index = GET_DATA_BYTE(linec, j);
- val = cta[index].blue;
- SET_DATA_BYTE(lined, j, val);
- }
- }
- }
-
- pixDestroy(&pixc);
- return pixd;
-}
-
-
-/*!
- * \brief pixCopyRGBComponent()
- *
- * \param[in] pixd 32 bpp
- * \param[in] pixs 32 bpp
- * \param[in] comp one of the set: {COLOR_RED, COLOR_GREEN,
- * COLOR_BLUE, L_ALPHA_CHANNEL}
- * \return 0 if OK; 1 on error
- *
- *
- * Notes:
- * (1) The two images are registered to the UL corner. The sizes
- * are usually the same, and a warning is issued if they differ.
- *
- */
-l_ok
-pixCopyRGBComponent(PIX *pixd,
- PIX *pixs,
- l_int32 comp)
-{
-l_int32 i, j, w, h, ws, hs, wd, hd, val;
-l_int32 wpls, wpld;
-l_uint32 *lines, *lined;
-l_uint32 *datas, *datad;
-
- PROCNAME("pixCopyRGBComponent");
-
- if (!pixd && pixGetDepth(pixd) != 32)
- return ERROR_INT("pixd not defined or not 32 bpp", procName, 1);
- if (!pixs && pixGetDepth(pixs) != 32)
- return ERROR_INT("pixs not defined or not 32 bpp", procName, 1);
- if (comp != COLOR_RED && comp != COLOR_GREEN &&
- comp != COLOR_BLUE && comp != L_ALPHA_CHANNEL)
- return ERROR_INT("invalid component", procName, 1);
- pixGetDimensions(pixs, &ws, &hs, NULL);
- pixGetDimensions(pixd, &wd, &hd, NULL);
- if (ws != wd || hs != hd)
- L_WARNING("images sizes not equal\n", procName);
- w = L_MIN(ws, wd);
- h = L_MIN(hs, hd);
- if (comp == L_ALPHA_CHANNEL)
- pixSetSpp(pixd, 4);
- wpls = pixGetWpl(pixs);
- wpld = pixGetWpl(pixd);
- datas = pixGetData(pixs);
- datad = pixGetData(pixd);
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- lined = datad + i * wpld;
- for (j = 0; j < w; j++) {
- val = GET_DATA_BYTE(lines + j, comp);
- SET_DATA_BYTE(lined + j, comp, val);
- }
- }
- return 0;
-}
-
-
-/*!
- * \brief composeRGBPixel()
- *
- * \param[in] rval, gval, bval
- * \param[out] ppixel 32-bit pixel
- * \return 0 if OK; 1 on error
- *
- *
- * Notes:
- * (1) All channels are 8 bits: the input values must be between
- * 0 and 255. For speed, this is not enforced by masking
- * with 0xff before shifting.
- * (2) A slower implementation uses macros:
- * SET_DATA_BYTE(ppixel, COLOR_RED, rval);
- * SET_DATA_BYTE(ppixel, COLOR_GREEN, gval);
- * SET_DATA_BYTE(ppixel, COLOR_BLUE, bval);
- *
- */
-l_ok
-composeRGBPixel(l_int32 rval,
- l_int32 gval,
- l_int32 bval,
- l_uint32 *ppixel)
-{
- PROCNAME("composeRGBPixel");
-
- if (!ppixel)
- return ERROR_INT("&pixel not defined", procName, 1);
-
- *ppixel = ((l_uint32)rval << L_RED_SHIFT) |
- ((l_uint32)gval << L_GREEN_SHIFT) |
- ((l_uint32)bval << L_BLUE_SHIFT);
- return 0;
-}
-
-
-/*!
- * \brief composeRGBAPixel()
- *
- * \param[in] rval, gval, bval, aval
- * \param[out] ppixel 32-bit pixel
- * \return 0 if OK; 1 on error
- *
- *
- * Notes:
- * (1) All channels are 8 bits: the input values must be between
- * 0 and 255. For speed, this is not enforced by masking
- * with 0xff before shifting.
- *
- */
-l_ok
-composeRGBAPixel(l_int32 rval,
- l_int32 gval,
- l_int32 bval,
- l_int32 aval,
- l_uint32 *ppixel)
-{
- PROCNAME("composeRGBAPixel");
-
- if (!ppixel)
- return ERROR_INT("&pixel not defined", procName, 1);
-
- *ppixel = ((l_uint32)rval << L_RED_SHIFT) |
- ((l_uint32)gval << L_GREEN_SHIFT) |
- ((l_uint32)bval << L_BLUE_SHIFT) |
- aval;
- return 0;
-}
-
-
-/*!
- * \brief extractRGBValues()
- *
- * \param[in] pixel 32 bit
- * \param[out] prval [optional] red component
- * \param[out] pgval [optional] green component
- * \param[out] pbval [optional] blue component
- * \return void
- *
- *
- * Notes:
- * (1) A slower implementation uses macros:
- * *prval = GET_DATA_BYTE(&pixel, COLOR_RED);
- * *pgval = GET_DATA_BYTE(&pixel, COLOR_GREEN);
- * *pbval = GET_DATA_BYTE(&pixel, COLOR_BLUE);
- *
- */
-void
-extractRGBValues(l_uint32 pixel,
- l_int32 *prval,
- l_int32 *pgval,
- l_int32 *pbval)
-{
- if (prval) *prval = (pixel >> L_RED_SHIFT) & 0xff;
- if (pgval) *pgval = (pixel >> L_GREEN_SHIFT) & 0xff;
- if (pbval) *pbval = (pixel >> L_BLUE_SHIFT) & 0xff;
- return;
-}
-
-
-/*!
- * \brief extractRGBAValues()
- *
- * \param[in] pixel 32 bit
- * \param[out] prval [optional] red component
- * \param[out] pgval [optional] green component
- * \param[out] pbval [optional] blue component
- * \param[out] paval [optional] alpha component
- * \return void
- */
-void
-extractRGBAValues(l_uint32 pixel,
- l_int32 *prval,
- l_int32 *pgval,
- l_int32 *pbval,
- l_int32 *paval)
-{
- if (prval) *prval = (pixel >> L_RED_SHIFT) & 0xff;
- if (pgval) *pgval = (pixel >> L_GREEN_SHIFT) & 0xff;
- if (pbval) *pbval = (pixel >> L_BLUE_SHIFT) & 0xff;
- if (paval) *paval = (pixel >> L_ALPHA_SHIFT) & 0xff;
- return;
-}
-
-
-/*!
- * \brief extractMinMaxComponent()
- *
- * \param[in] pixel 32 bpp RGB
- * \param[in] type L_CHOOSE_MIN or L_CHOOSE_MAX
- * \return component in range [0 ... 255], or NULL on error
- */
-l_int32
-extractMinMaxComponent(l_uint32 pixel,
- l_int32 type)
-{
-l_int32 rval, gval, bval, val;
-
- extractRGBValues(pixel, &rval, &gval, &bval);
- if (type == L_CHOOSE_MIN) {
- val = L_MIN(rval, gval);
- val = L_MIN(val, bval);
- } else { /* type == L_CHOOSE_MAX */
- val = L_MAX(rval, gval);
- val = L_MAX(val, bval);
- }
- return val;
-}
-
-
-/*!
- * \brief pixGetRGBLine()
- *
- * \param[in] pixs 32 bpp
- * \param[in] row
- * \param[in] bufr array of red samples; size w bytes
- * \param[in] bufg array of green samples; size w bytes
- * \param[in] bufb array of blue samples; size w bytes
- * \return 0 if OK; 1 on error
- *
- *
- * Notes:
- * (1) This puts rgb components from the input line in pixs
- * into the given buffers.
- *
- */
-l_ok
-pixGetRGBLine(PIX *pixs,
- l_int32 row,
- l_uint8 *bufr,
- l_uint8 *bufg,
- l_uint8 *bufb)
-{
-l_uint32 *lines;
-l_int32 j, w, h;
-l_int32 wpls;
-
- PROCNAME("pixGetRGBLine");
-
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
- if (pixGetDepth(pixs) != 32)
- return ERROR_INT("pixs not 32 bpp", procName, 1);
- if (!bufr || !bufg || !bufb)
- return ERROR_INT("buffer not defined", procName, 1);
-
- pixGetDimensions(pixs, &w, &h, NULL);
- if (row < 0 || row >= h)
- return ERROR_INT("row out of bounds", procName, 1);
- wpls = pixGetWpl(pixs);
- lines = pixGetData(pixs) + row * wpls;
-
- for (j = 0; j < w; j++) {
- bufr[j] = GET_DATA_BYTE(lines + j, COLOR_RED);
- bufg[j] = GET_DATA_BYTE(lines + j, COLOR_GREEN);
- bufb[j] = GET_DATA_BYTE(lines + j, COLOR_BLUE);
- }
-
- return 0;
-}
-
-
-/*-------------------------------------------------------------*
- * Raster line pixel setter *
- *-------------------------------------------------------------*/
-/*!
- * \brief setLineDataVal()
- *
- * \param[in] line ptr to first word in raster line data
- * \param[in] j index of pixels into the raster line
- * \param[in] d depth of the pixel
- * \param[in] val pixel value to be set
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This is a convenience function to set a pixel value in a
- * raster line where the depth of the image can have different
- * values (1, 2, 4, 8, 16 or 32).
- *
- */
-l_ok
-setLineDataVal(l_uint32 *line,
- l_int32 j,
- l_int32 d,
- l_uint32 val)
-{
- PROCNAME("setLineDataVal");
-
- if (!line)
- return ERROR_INT("line not defined", procName, 1);
- if (j < 0)
- return ERROR_INT("j must be >= 0", procName, 1);
- if (d != 1 && d != 2 && d != 4 && d != 8 && d != 16 && d != 32)
- return ERROR_INT("invalid d", procName, 1);
-
- if (d == 1)
- SET_DATA_BIT_VAL(line, j, val);
- else if (d == 2)
- SET_DATA_DIBIT(line, j, val);
- else if (d == 4)
- SET_DATA_QBIT(line, j, val);
- else if (d == 8)
- SET_DATA_BYTE(line, j, val);
- else if (d == 16)
- SET_DATA_TWO_BYTES(line, j, val);
- else /* d == 32 */
- *(line + j) = val;
- return 0;
-}
-
-
-/*-------------------------------------------------------------*
- * Pixel endian conversion *
- *-------------------------------------------------------------*/
-/*!
- * \brief pixEndianByteSwapNew()
- *
- * \param[in] pixs
- * \return pixd, or NULL on error
- *
- *
- * Notes:
- * (1) This is used to convert the data in a pix to a
- * serialized byte buffer in raster order, and, for RGB,
- * in order RGBA. This requires flipping bytes within
- * each 32-bit word for little-endian platforms, because the
- * words have a MSB-to-the-left rule, whereas byte raster-order
- * requires the left-most byte in each word to be byte 0.
- * For big-endians, no swap is necessary, so this returns a clone.
- * (2) Unlike pixEndianByteSwap(), which swaps the bytes in-place,
- * this returns a new pix (or a clone). We provide this
- * because often when serialization is done, the source
- * pix needs to be restored to canonical little-endian order,
- * and this requires a second byte swap. In such a situation,
- * it is twice as fast to make a new pix in big-endian order,
- * use it, and destroy it.
- *
- */
-PIX *
-pixEndianByteSwapNew(PIX *pixs)
-{
-l_uint32 *datas, *datad;
-l_int32 i, j, h, wpl;
-l_uint32 word;
-PIX *pixd;
-
- PROCNAME("pixEndianByteSwapNew");
-
-#ifdef L_BIG_ENDIAN
-
- return pixClone(pixs);
-
-#else /* L_LITTLE_ENDIAN */
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
-
- datas = pixGetData(pixs);
- wpl = pixGetWpl(pixs);
- h = pixGetHeight(pixs);
- pixd = pixCreateTemplate(pixs);
- datad = pixGetData(pixd);
- for (i = 0; i < h; i++) {
- for (j = 0; j < wpl; j++, datas++, datad++) {
- word = *datas;
- *datad = (word >> 24) |
- ((word >> 8) & 0x0000ff00) |
- ((word << 8) & 0x00ff0000) |
- (word << 24);
- }
- }
-
- return pixd;
-
-#endif /* L_BIG_ENDIAN */
-
-}
-
-
-/*!
- * \brief pixEndianByteSwap()
- *
- * \param[in] pixs
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This is used on little-endian platforms to swap
- * the bytes within a word; bytes 0 and 3 are swapped,
- * and bytes 1 and 2 are swapped.
- * (2) This is required for little-endians in situations
- * where we convert from a serialized byte order that is
- * in raster order, as one typically has in file formats,
- * to one with MSB-to-the-left in each 32-bit word, or v.v.
- * See pix.h for a description of the canonical format
- * (MSB-to-the left) that is used for both little-endian
- * and big-endian platforms. For big-endians, the
- * MSB-to-the-left word order has the bytes in raster
- * order when serialized, so no byte flipping is required.
- *
- */
-l_ok
-pixEndianByteSwap(PIX *pixs)
-{
-l_uint32 *data;
-l_int32 i, j, h, wpl;
-l_uint32 word;
-
- PROCNAME("pixEndianByteSwap");
-
-#ifdef L_BIG_ENDIAN
-
- return 0;
-
-#else /* L_LITTLE_ENDIAN */
-
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
-
- data = pixGetData(pixs);
- wpl = pixGetWpl(pixs);
- h = pixGetHeight(pixs);
- for (i = 0; i < h; i++) {
- for (j = 0; j < wpl; j++, data++) {
- word = *data;
- *data = (word >> 24) |
- ((word >> 8) & 0x0000ff00) |
- ((word << 8) & 0x00ff0000) |
- (word << 24);
- }
- }
-
- return 0;
-
-#endif /* L_BIG_ENDIAN */
-
-}
-
-
-/*!
- * \brief lineEndianByteSwap()
- *
- * \param[in] datad dest byte array data, reordered on little-endians
- * \param[in] datas a src line of pix data)
- * \param[in] wpl number of 32 bit words in the line
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This is used on little-endian platforms to swap
- * the bytes within each word in the line of image data.
- * Bytes 0 <==> 3 and 1 <==> 2 are swapped in the dest
- * byte array data8d, relative to the pix data in datas.
- * (2) The bytes represent 8 bit pixel values. They are swapped
- * for little endians so that when the dest array datad
- * is addressed by bytes, the pixels are chosen sequentially
- * from left to right in the image.
- *
- */
-l_int32
-lineEndianByteSwap(l_uint32 *datad,
- l_uint32 *datas,
- l_int32 wpl)
-{
-l_int32 j;
-l_uint32 word;
-
- PROCNAME("lineEndianByteSwap");
-
- if (!datad || !datas)
- return ERROR_INT("datad and datas not both defined", procName, 1);
-
-#ifdef L_BIG_ENDIAN
-
- memcpy(datad, datas, 4 * wpl);
- return 0;
-
-#else /* L_LITTLE_ENDIAN */
-
- for (j = 0; j < wpl; j++, datas++, datad++) {
- word = *datas;
- *datad = (word >> 24) |
- ((word >> 8) & 0x0000ff00) |
- ((word << 8) & 0x00ff0000) |
- (word << 24);
- }
- return 0;
-
-#endif /* L_BIG_ENDIAN */
-
-}
-
-
-/*!
- * \brief pixEndianTwoByteSwapNew()
- *
- * \param[in] pixs
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This is used on little-endian platforms to swap the
- * 2-byte entities within a 32-bit word.
- * (2) This is equivalent to a full byte swap, as performed
- * by pixEndianByteSwap(), followed by byte swaps in
- * each of the 16-bit entities separately.
- * (3) Unlike pixEndianTwoByteSwap(), which swaps the shorts in-place,
- * this returns a new pix (or a clone). We provide this
- * to avoid having to swap twice in situations where the input
- * pix must be restored to canonical little-endian order.
- *
- */
-PIX *
-pixEndianTwoByteSwapNew(PIX *pixs)
-{
-l_uint32 *datas, *datad;
-l_int32 i, j, h, wpl;
-l_uint32 word;
-PIX *pixd;
-
- PROCNAME("pixEndianTwoByteSwapNew");
-
-#ifdef L_BIG_ENDIAN
-
- return pixClone(pixs);
-
-#else /* L_LITTLE_ENDIAN */
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
-
- datas = pixGetData(pixs);
- wpl = pixGetWpl(pixs);
- h = pixGetHeight(pixs);
- pixd = pixCreateTemplate(pixs);
- datad = pixGetData(pixd);
- for (i = 0; i < h; i++) {
- for (j = 0; j < wpl; j++, datas++, datad++) {
- word = *datas;
- *datad = (word << 16) | (word >> 16);
- }
- }
-
- return pixd;
-
-#endif /* L_BIG_ENDIAN */
-
-}
-
-
-/*!
- * \brief pixEndianTwoByteSwap()
- *
- * \param[in] pixs
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This is used on little-endian platforms to swap the
- * 2-byte entities within a 32-bit word.
- * (2) This is equivalent to a full byte swap, as performed
- * by pixEndianByteSwap(), followed by byte swaps in
- * each of the 16-bit entities separately.
- *
- */
-l_ok
-pixEndianTwoByteSwap(PIX *pixs)
-{
-l_uint32 *data;
-l_int32 i, j, h, wpl;
-l_uint32 word;
-
- PROCNAME("pixEndianTwoByteSwap");
-
-#ifdef L_BIG_ENDIAN
-
- return 0;
-
-#else /* L_LITTLE_ENDIAN */
-
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
-
- data = pixGetData(pixs);
- wpl = pixGetWpl(pixs);
- h = pixGetHeight(pixs);
- for (i = 0; i < h; i++) {
- for (j = 0; j < wpl; j++, data++) {
- word = *data;
- *data = (word << 16) | (word >> 16);
- }
- }
-
- return 0;
-
-#endif /* L_BIG_ENDIAN */
-
-}
-
-
-/*-------------------------------------------------------------*
- * Extract raster data as binary string *
- *-------------------------------------------------------------*/
-/*!
- * \brief pixGetRasterData()
- *
- * \param[in] pixs 1, 8, 32 bpp
- * \param[out] pdata raster data in memory
- * \param[out] pnbytes number of bytes in data string
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This returns the raster data as a byte string, padded to the
- * byte. For 1 bpp, the first pixel is the MSbit in the first byte.
- * For rgb, the bytes are in (rgb) order. This is the format
- * required for flate encoding of pixels in a PostScript file.
- *
- */
-l_ok
-pixGetRasterData(PIX *pixs,
- l_uint8 **pdata,
- size_t *pnbytes)
-{
-l_int32 w, h, d, wpl, i, j, rval, gval, bval;
-l_int32 databpl; /* bytes for each raster line in returned data */
-l_uint8 *line, *data; /* packed data in returned array */
-l_uint32 *rline, *rdata; /* data in pix raster */
-
- PROCNAME("pixGetRasterData");
-
- if (pdata) *pdata = NULL;
- if (pnbytes) *pnbytes = 0;
- if (!pdata || !pnbytes)
- return ERROR_INT("&data and &nbytes not both defined", procName, 1);
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
- pixGetDimensions(pixs, &w, &h, &d);
- if (d != 1 && d != 2 && d != 4 && d != 8 && d != 16 && d != 32)
- return ERROR_INT("depth not in {1,2,4,8,16,32}", procName, 1);
- rdata = pixGetData(pixs);
- wpl = pixGetWpl(pixs);
- if (d == 1)
- databpl = (w + 7) / 8;
- else if (d == 2)
- databpl = (w + 3) / 4;
- else if (d == 4)
- databpl = (w + 1) / 2;
- else if (d == 8 || d == 16)
- databpl = w * (d / 8);
- else /* d == 32 bpp rgb */
- databpl = 3 * w;
- if ((data = (l_uint8 *)LEPT_CALLOC((size_t)databpl * h, sizeof(l_uint8)))
- == NULL)
- return ERROR_INT("data not allocated", procName, 1);
- *pdata = data;
- *pnbytes = (size_t)databpl * h;
-
- for (i = 0; i < h; i++) {
- rline = rdata + i * wpl;
- line = data + i * databpl;
- if (d <= 8) {
- for (j = 0; j < databpl; j++)
- line[j] = GET_DATA_BYTE(rline, j);
- } else if (d == 16) {
- for (j = 0; j < w; j++)
- line[2 * j] = GET_DATA_TWO_BYTES(rline, j);
- } else { /* d == 32 bpp rgb */
- for (j = 0; j < w; j++) {
- extractRGBValues(rline[j], &rval, &gval, &bval);
- *(line + 3 * j) = rval;
- *(line + 3 * j + 1) = gval;
- *(line + 3 * j + 2) = bval;
- }
- }
- }
-
- return 0;
-}
-
-
-/*-------------------------------------------------------------*
- * Test alpha component opaqueness *
- *-------------------------------------------------------------*/
-/*!
- * \brief pixAlphaIsOpaque()
- *
- * \param[in] pix 32 bpp, spp == 4
- * \param[out] popaque 1 if spp == 4 and all alpha component
- * values are 255 (opaque); 0 otherwise
- * \return 0 if OK, 1 on error
- * Notes:
- * 1) On error, opaque is returned as 0 (FALSE).
- */
-l_ok
-pixAlphaIsOpaque(PIX *pix,
- l_int32 *popaque)
-{
-l_int32 w, h, wpl, i, j, alpha;
-l_uint32 *data, *line;
-
- PROCNAME("pixAlphaIsOpaque");
-
- if (!popaque)
- return ERROR_INT("&opaque not defined", procName, 1);
- *popaque = FALSE;
- if (!pix)
- return ERROR_INT("&pix not defined", procName, 1);
- if (pixGetDepth(pix) != 32)
- return ERROR_INT("&pix not 32 bpp", procName, 1);
- if (pixGetSpp(pix) != 4)
- return ERROR_INT("&pix not 4 spp", procName, 1);
-
- data = pixGetData(pix);
- wpl = pixGetWpl(pix);
- pixGetDimensions(pix, &w, &h, NULL);
- for (i = 0; i < h; i++) {
- line = data + i * wpl;
- for (j = 0; j < w; j++) {
- alpha = GET_DATA_BYTE(line + j, L_ALPHA_CHANNEL);
- if (alpha ^ 0xff) /* not opaque */
- return 0;
- }
- }
-
- *popaque = TRUE;
- return 0;
-}
-
-
-/*-------------------------------------------------------------*
- * Setup helpers for 8 bpp byte processing *
- *-------------------------------------------------------------*/
-/*!
- * \brief pixSetupByteProcessing()
- *
- * \param[in] pix 8 bpp, no colormap
- * \param[out] pw [optional] width
- * \param[out] ph [optional] height
- * \return line ptr array, or NULL on error
- *
- *
- * Notes:
- * (1) This is a simple helper for processing 8 bpp images with
- * direct byte access. It can swap byte order within each word.
- * (2) After processing, you must call pixCleanupByteProcessing(),
- * which frees the lineptr array and restores byte order.
- * (3) Usage:
- * l_uint8 **lineptrs = pixSetupByteProcessing(pix, &w, &h);
- * for (i = 0; i < h; i++) {
- * l_uint8 *line = lineptrs[i];
- * for (j = 0; j < w; j++) {
- * val = line[j];
- * ...
- * }
- * }
- * pixCleanupByteProcessing(pix, lineptrs);
- *
- */
-l_uint8 **
-pixSetupByteProcessing(PIX *pix,
- l_int32 *pw,
- l_int32 *ph)
-{
-l_int32 w, h;
-
- PROCNAME("pixSetupByteProcessing");
-
- if (pw) *pw = 0;
- if (ph) *ph = 0;
- if (!pix || pixGetDepth(pix) != 8)
- return (l_uint8 **)ERROR_PTR("pix not defined or not 8 bpp",
- procName, NULL);
- pixGetDimensions(pix, &w, &h, NULL);
- if (pw) *pw = w;
- if (ph) *ph = h;
- if (pixGetColormap(pix))
- return (l_uint8 **)ERROR_PTR("pix has colormap", procName, NULL);
-
- pixEndianByteSwap(pix);
- return (l_uint8 **)pixGetLinePtrs(pix, NULL);
-}
-
-
-/*!
- * \brief pixCleanupByteProcessing()
- *
- * \param[in] pix 8 bpp, no colormap
- * \param[in] lineptrs ptrs to the beginning of each raster line of data
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This must be called after processing that was initiated
- * by pixSetupByteProcessing() has finished.
- *
- */
-l_ok
-pixCleanupByteProcessing(PIX *pix,
- l_uint8 **lineptrs)
-{
- PROCNAME("pixCleanupByteProcessing");
-
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
- if (!lineptrs)
- return ERROR_INT("lineptrs not defined", procName, 1);
-
- pixEndianByteSwap(pix);
- LEPT_FREE(lineptrs);
- return 0;
-}
-
-
-/*------------------------------------------------------------------------*
- * Setting parameters for antialias masking with alpha transforms *
- *------------------------------------------------------------------------*/
-/*!
- * \brief l_setAlphaMaskBorder()
- *
- * \param[in] val1, val2 in [0.0 ... 1.0]
- * \return void
- *
- *
- * Notes:
- * (1) This sets the opacity values used to generate the two outer
- * boundary rings in the alpha mask associated with geometric
- * transforms such as pixRotateWithAlpha().
- * (2) The default values are val1 = 0.0 (completely transparent
- * in the outermost ring) and val2 = 0.5 (half transparent
- * in the second ring). When the image is blended, this
- * completely removes the outer ring (shrinking the image by
- * 2 in each direction), and alpha-blends with 0.5 the second ring.
- * Using val1 = 0.25 and val2 = 0.75 gives a slightly more
- * blurred border, with no perceptual difference at screen resolution.
- * (3) The actual mask values are found by multiplying these
- * normalized opacity values by 255.
- *
- */
-void
-l_setAlphaMaskBorder(l_float32 val1,
- l_float32 val2)
-{
- val1 = L_MAX(0.0, L_MIN(1.0, val1));
- val2 = L_MAX(0.0, L_MIN(1.0, val2));
- AlphaMaskBorderVals[0] = val1;
- AlphaMaskBorderVals[1] = val2;
-}
diff --git a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pix3.c b/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pix3.c
deleted file mode 100644
index 20ab924c..00000000
--- a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pix3.c
+++ /dev/null
@@ -1,3717 +0,0 @@
-/*====================================================================*
- - Copyright (C) 2001 Leptonica. All rights reserved.
- -
- - Redistribution and use in source and binary forms, with or without
- - modification, are permitted provided that the following conditions
- - are met:
- - 1. Redistributions of source code must retain the above copyright
- - notice, this list of conditions and the following disclaimer.
- - 2. Redistributions in binary form must reproduce the above
- - copyright notice, this list of conditions and the following
- - disclaimer in the documentation and/or other materials
- - provided with the distribution.
- -
- - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- - ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- - LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- - A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL ANY
- - CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
- - EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
- - PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
- - PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
- - OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
- - NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- *====================================================================*/
-
-/*!
- * \file pix3.c
- *
- *
- * This file has these operations:
- *
- * (1) Mask-directed operations
- * (2) Full-image bit-logical operations
- * (3) Foreground pixel counting operations on 1 bpp images
- * (4) Average and variance of pixel values
- * (5) Mirrored tiling of a smaller image
- *
- *
- * Masked operations
- * l_int32 pixSetMasked()
- * l_int32 pixSetMaskedGeneral()
- * l_int32 pixCombineMasked()
- * l_int32 pixCombineMaskedGeneral()
- * l_int32 pixPaintThroughMask()
- * l_int32 pixCopyWithBoxa() -- this is boxa-directed
- * PIX *pixPaintSelfThroughMask()
- * PIX *pixMakeMaskFromVal()
- * PIX *pixMakeMaskFromLUT()
- * PIX *pixMakeArbMaskFromRGB()
- * PIX *pixSetUnderTransparency()
- * PIX *pixMakeAlphaFromMask()
- * l_int32 pixGetColorNearMaskBoundary()
- * PIX *pixDisplaySelectedPixels() -- for debugging
- *
- * One and two-image boolean operations on arbitrary depth images
- * PIX *pixInvert()
- * PIX *pixOr()
- * PIX *pixAnd()
- * PIX *pixXor()
- * PIX *pixSubtract()
- *
- * Foreground pixel counting in 1 bpp images
- * l_int32 pixZero()
- * l_int32 pixForegroundFraction()
- * NUMA *pixaCountPixels()
- * l_int32 pixCountPixels()
- * l_int32 pixCountPixelsInRect()
- * NUMA *pixCountByRow()
- * NUMA *pixCountByColumn()
- * NUMA *pixCountPixelsByRow()
- * NUMA *pixCountPixelsByColumn()
- * l_int32 pixCountPixelsInRow()
- * NUMA *pixGetMomentByColumn()
- * l_int32 pixThresholdPixelSum()
- * l_int32 *makePixelSumTab8()
- * l_int32 *makePixelCentroidTab8()
- *
- * Average of pixel values in gray images
- * NUMA *pixAverageByRow()
- * NUMA *pixAverageByColumn()
- * l_int32 pixAverageInRect()
- *
- * Average of pixel values in RGB images
- * l_int32 pixAverageInRectRGB()
- *
- * Variance of pixel values in gray images
- * NUMA *pixVarianceByRow()
- * NUMA *pixVarianceByColumn()
- * l_int32 pixVarianceInRect()
- *
- * Average of absolute value of pixel differences in gray images
- * NUMA *pixAbsDiffByRow()
- * NUMA *pixAbsDiffByColumn()
- * l_int32 pixAbsDiffInRect()
- * l_int32 pixAbsDiffOnLine()
- *
- * Count of pixels with specific value
- * l_int32 pixCountArbInRect()
- *
- * Mirrored tiling
- * PIX *pixMirroredTiling()
- *
- * Representative tile near but outside region
- * l_int32 pixFindRepCloseTile()
- *
- * Static helper function
- * static BOXA *findTileRegionsForSearch()
- *
- */
-
-#ifdef HAVE_CONFIG_H
-#include
-#endif /* HAVE_CONFIG_H */
-
-#include
-#include
-#include "allheaders.h"
-
-static BOXA *findTileRegionsForSearch(BOX *box, l_int32 w, l_int32 h,
- l_int32 searchdir, l_int32 mindist,
- l_int32 tsize, l_int32 ntiles);
-
-#ifndef NO_CONSOLE_IO
-#define EQUAL_SIZE_WARNING 0
-#endif /* ~NO_CONSOLE_IO */
-
-/*-------------------------------------------------------------*
- * Masked operations *
- *-------------------------------------------------------------*/
-/*!
- * \brief pixSetMasked()
- *
- * \param[in] pixd 1, 2, 4, 8, 16 or 32 bpp; or colormapped
- * \param[in] pixm [optional] 1 bpp mask; no operation if NULL
- * \param[in] val value to set at each masked pixel
- * \return 0 if OK; 1 on error
- *
- *
- * Notes:
- * (1) In-place operation.
- * (2) NOTE: For cmapped images, this calls pixSetMaskedCmap().
- * %val must be the 32-bit color representation of the RGB pixel.
- * It is not the index into the colormap!
- * (2) If pixm == NULL, a warning is given.
- * (3) This is an implicitly aligned operation, where the UL
- * corners of pixd and pixm coincide. A warning is
- * issued if the two image sizes differ significantly,
- * but the operation proceeds.
- * (4) Each pixel in pixd that co-locates with an ON pixel
- * in pixm is set to the specified input value.
- * Other pixels in pixd are not changed.
- * (5) You can visualize this as painting the color through
- * the mask, as a stencil.
- * (6) If you do not want to have the UL corners aligned,
- * use the function pixSetMaskedGeneral(), which requires
- * you to input the UL corner of pixm relative to pixd.
- * (7) Implementation details: see comments in pixPaintThroughMask()
- * for when we use rasterop to do the painting.
- *
- */
-l_ok
-pixSetMasked(PIX *pixd,
- PIX *pixm,
- l_uint32 val)
-{
-l_int32 wd, hd, wm, hm, w, h, d, wpld, wplm;
-l_int32 i, j, rval, gval, bval;
-l_uint32 *datad, *datam, *lined, *linem;
-
- PROCNAME("pixSetMasked");
-
- if (!pixd)
- return ERROR_INT("pixd not defined", procName, 1);
- if (!pixm) {
- L_WARNING("no mask; nothing to do\n", procName);
- return 0;
- }
- if (pixGetColormap(pixd)) {
- extractRGBValues(val, &rval, &gval, &bval);
- return pixSetMaskedCmap(pixd, pixm, 0, 0, rval, gval, bval);
- }
-
- if (pixGetDepth(pixm) != 1)
- return ERROR_INT("pixm not 1 bpp", procName, 1);
- d = pixGetDepth(pixd);
- if (d == 1)
- val &= 1;
- else if (d == 2)
- val &= 3;
- else if (d == 4)
- val &= 0x0f;
- else if (d == 8)
- val &= 0xff;
- else if (d == 16)
- val &= 0xffff;
- else if (d != 32)
- return ERROR_INT("pixd not 1, 2, 4, 8, 16 or 32 bpp", procName, 1);
- pixGetDimensions(pixm, &wm, &hm, NULL);
-
- /* If d == 1, use rasterop; it's about 25x faster */
- if (d == 1) {
- if (val == 0) {
- PIX *pixmi = pixInvert(NULL, pixm);
- pixRasterop(pixd, 0, 0, wm, hm, PIX_MASK, pixmi, 0, 0);
- pixDestroy(&pixmi);
- } else { /* val == 1 */
- pixRasterop(pixd, 0, 0, wm, hm, PIX_PAINT, pixm, 0, 0);
- }
- return 0;
- }
-
- /* For d < 32, use rasterop for val == 0 (black); ~3x faster. */
- if (d < 32 && val == 0) {
- PIX *pixmd = pixUnpackBinary(pixm, d, 1);
- pixRasterop(pixd, 0, 0, wm, hm, PIX_MASK, pixmd, 0, 0);
- pixDestroy(&pixmd);
- return 0;
- }
-
- /* For d < 32, use rasterop for val == maxval (white); ~3x faster. */
- if (d < 32 && val == ((1 << d) - 1)) {
- PIX *pixmd = pixUnpackBinary(pixm, d, 0);
- pixRasterop(pixd, 0, 0, wm, hm, PIX_PAINT, pixmd, 0, 0);
- pixDestroy(&pixmd);
- return 0;
- }
-
- pixGetDimensions(pixd, &wd, &hd, &d);
- w = L_MIN(wd, wm);
- h = L_MIN(hd, hm);
- if (L_ABS(wd - wm) > 7 || L_ABS(hd - hm) > 7) /* allow a small tolerance */
- L_WARNING("pixd and pixm sizes differ\n", procName);
-
- datad = pixGetData(pixd);
- datam = pixGetData(pixm);
- wpld = pixGetWpl(pixd);
- wplm = pixGetWpl(pixm);
- for (i = 0; i < h; i++) {
- lined = datad + i * wpld;
- linem = datam + i * wplm;
- for (j = 0; j < w; j++) {
- if (GET_DATA_BIT(linem, j)) {
- switch(d)
- {
- case 2:
- SET_DATA_DIBIT(lined, j, val);
- break;
- case 4:
- SET_DATA_QBIT(lined, j, val);
- break;
- case 8:
- SET_DATA_BYTE(lined, j, val);
- break;
- case 16:
- SET_DATA_TWO_BYTES(lined, j, val);
- break;
- case 32:
- *(lined + j) = val;
- break;
- default:
- return ERROR_INT("shouldn't get here", procName, 1);
- }
- }
- }
- }
-
- return 0;
-}
-
-
-/*!
- * \brief pixSetMaskedGeneral()
- *
- * \param[in] pixd 8, 16 or 32 bpp
- * \param[in] pixm [optional] 1 bpp mask; no operation if null
- * \param[in] val value to set at each masked pixel
- * \param[in] x, y location of UL corner of pixm relative to pixd;
- * can be negative
- * \return 0 if OK; 1 on error
- *
- *
- * Notes:
- * (1) This is an in-place operation.
- * (2) Alignment is explicit. If you want the UL corners of
- * the two images to be aligned, use pixSetMasked().
- * (3) A typical use would be painting through the foreground
- * of a small binary mask pixm, located somewhere on a
- * larger pixd. Other pixels in pixd are not changed.
- * (4) You can visualize this as painting the color through
- * the mask, as a stencil.
- * (5) This uses rasterop to handle clipping and different depths of pixd.
- * (6) If pixd has a colormap, you should call pixPaintThroughMask().
- * (7) Why is this function here, if pixPaintThroughMask() does the
- * same thing, and does it more generally? I've retained it here
- * to show how one can paint through a mask using only full
- * image rasterops, rather than pixel peeking in pixm and poking
- * in pixd. It's somewhat baroque, but I found it amusing.
- *
- */
-l_ok
-pixSetMaskedGeneral(PIX *pixd,
- PIX *pixm,
- l_uint32 val,
- l_int32 x,
- l_int32 y)
-{
-l_int32 wm, hm, d;
-PIX *pixmu, *pixc;
-
- PROCNAME("pixSetMaskedGeneral");
-
- if (!pixd)
- return ERROR_INT("pixd not defined", procName, 1);
- if (!pixm) /* nothing to do */
- return 0;
-
- d = pixGetDepth(pixd);
- if (d != 8 && d != 16 && d != 32)
- return ERROR_INT("pixd not 8, 16 or 32 bpp", procName, 1);
- if (pixGetDepth(pixm) != 1)
- return ERROR_INT("pixm not 1 bpp", procName, 1);
-
- /* Unpack binary to depth d, with inversion: 1 --> 0, 0 --> 0xff... */
- if ((pixmu = pixUnpackBinary(pixm, d, 1)) == NULL)
- return ERROR_INT("pixmu not made", procName, 1);
-
- /* Clear stenciled pixels in pixd */
- pixGetDimensions(pixm, &wm, &hm, NULL);
- pixRasterop(pixd, x, y, wm, hm, PIX_SRC & PIX_DST, pixmu, 0, 0);
-
- /* Generate image with requisite color */
- if ((pixc = pixCreateTemplate(pixmu)) == NULL) {
- pixDestroy(&pixmu);
- return ERROR_INT("pixc not made", procName, 1);
- }
- pixSetAllArbitrary(pixc, val);
-
- /* Invert stencil mask, and paint color color into stencil */
- pixInvert(pixmu, pixmu);
- pixAnd(pixmu, pixmu, pixc);
-
- /* Finally, repaint stenciled pixels, with val, in pixd */
- pixRasterop(pixd, x, y, wm, hm, PIX_SRC | PIX_DST, pixmu, 0, 0);
-
- pixDestroy(&pixmu);
- pixDestroy(&pixc);
- return 0;
-}
-
-
-/*!
- * \brief pixCombineMasked()
- *
- * \param[in] pixd 1 bpp, 8 bpp gray or 32 bpp rgb; no cmap
- * \param[in] pixs 1 bpp, 8 bpp gray or 32 bpp rgb; no cmap
- * \param[in] pixm [optional] 1 bpp mask; no operation if NULL
- * \return 0 if OK; 1 on error
- *
- *
- * Notes:
- * (1) In-place operation; pixd is changed.
- * (2) This sets each pixel in pixd that co-locates with an ON
- * pixel in pixm to the corresponding value of pixs.
- * (3) pixs and pixd must be the same depth and not colormapped.
- * (4) All three input pix are aligned at the UL corner, and the
- * operation is clipped to the intersection of all three images.
- * (5) If pixm == NULL, it's a no-op.
- * (6) Implementation: see notes in pixCombineMaskedGeneral().
- * For 8 bpp selective masking, you might guess that it
- * would be faster to generate an 8 bpp version of pixm,
- * using pixConvert1To8(pixm, 0, 255), and then use a
- * general combine operation
- * d = (d & ~m) | (s & m)
- * on a word-by-word basis. Not always. The word-by-word
- * combine takes a time that is independent of the mask data.
- * If the mask is relatively sparse, the byte-check method
- * is actually faster!
- *
- */
-l_ok
-pixCombineMasked(PIX *pixd,
- PIX *pixs,
- PIX *pixm)
-{
-l_int32 w, h, d, ws, hs, ds, wm, hm, dm, wmin, hmin;
-l_int32 wpl, wpls, wplm, i, j, val;
-l_uint32 *data, *datas, *datam, *line, *lines, *linem;
-PIX *pixt;
-
- PROCNAME("pixCombineMasked");
-
- if (!pixm) /* nothing to do */
- return 0;
- if (!pixd)
- return ERROR_INT("pixd not defined", procName, 1);
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
- pixGetDimensions(pixd, &w, &h, &d);
- pixGetDimensions(pixs, &ws, &hs, &ds);
- pixGetDimensions(pixm, &wm, &hm, &dm);
- if (d != ds)
- return ERROR_INT("pixs and pixd depths differ", procName, 1);
- if (dm != 1)
- return ERROR_INT("pixm not 1 bpp", procName, 1);
- if (d != 1 && d != 8 && d != 32)
- return ERROR_INT("pixd not 1, 8 or 32 bpp", procName, 1);
- if (pixGetColormap(pixd) || pixGetColormap(pixs))
- return ERROR_INT("pixs and/or pixd is cmapped", procName, 1);
-
- /* For d = 1, use rasterop. pixt is the part from pixs, under
- * the fg of pixm, that is to be combined with pixd. We also
- * use pixt to remove all fg of pixd that is under the fg of pixm.
- * Then pixt and pixd are combined by ORing. */
- wmin = L_MIN(w, L_MIN(ws, wm));
- hmin = L_MIN(h, L_MIN(hs, hm));
- if (d == 1) {
- pixt = pixAnd(NULL, pixs, pixm);
- pixRasterop(pixd, 0, 0, wmin, hmin, PIX_DST & PIX_NOT(PIX_SRC),
- pixm, 0, 0);
- pixRasterop(pixd, 0, 0, wmin, hmin, PIX_SRC | PIX_DST, pixt, 0, 0);
- pixDestroy(&pixt);
- return 0;
- }
-
- data = pixGetData(pixd);
- datas = pixGetData(pixs);
- datam = pixGetData(pixm);
- wpl = pixGetWpl(pixd);
- wpls = pixGetWpl(pixs);
- wplm = pixGetWpl(pixm);
- if (d == 8) {
- for (i = 0; i < hmin; i++) {
- line = data + i * wpl;
- lines = datas + i * wpls;
- linem = datam + i * wplm;
- for (j = 0; j < wmin; j++) {
- if (GET_DATA_BIT(linem, j)) {
- val = GET_DATA_BYTE(lines, j);
- SET_DATA_BYTE(line, j, val);
- }
- }
- }
- } else { /* d == 32 */
- for (i = 0; i < hmin; i++) {
- line = data + i * wpl;
- lines = datas + i * wpls;
- linem = datam + i * wplm;
- for (j = 0; j < wmin; j++) {
- if (GET_DATA_BIT(linem, j))
- line[j] = lines[j];
- }
- }
- }
-
- return 0;
-}
-
-
-/*!
- * \brief pixCombineMaskedGeneral()
- *
- * \param[in] pixd 1 bpp, 8 bpp gray or 32 bpp rgb
- * \param[in] pixs 1 bpp, 8 bpp gray or 32 bpp rgb
- * \param[in] pixm [optional] 1 bpp mask
- * \param[in] x, y origin of pixs and pixm relative to pixd; can be negative
- * \return 0 if OK; 1 on error
- *
- *
- * Notes:
- * (1) In-place operation; pixd is changed.
- * (2) This is a generalized version of pixCombinedMasked(), where
- * the source and mask can be placed at the same (arbitrary)
- * location relative to pixd.
- * (3) pixs and pixd must be the same depth and not colormapped.
- * (4) The UL corners of both pixs and pixm are aligned with
- * the point (x, y) of pixd, and the operation is clipped to
- * the intersection of all three images.
- * (5) If pixm == NULL, it's a no-op.
- * (6) Implementation. There are two ways to do these. In the first,
- * we use rasterop, ORing the part of pixs under the mask
- * with pixd (which has been appropriately cleared there first).
- * In the second, the mask is used one pixel at a time to
- * selectively replace pixels of pixd with those of pixs.
- * Here, we use rasterop for 1 bpp and pixel-wise replacement
- * for 8 and 32 bpp. To use rasterop for 8 bpp, for example,
- * we must first generate an 8 bpp version of the mask.
- * The code is simple:
- *
- * Pix *pixm8 = pixConvert1To8(NULL, pixm, 0, 255);
- * Pix *pixt = pixAnd(NULL, pixs, pixm8);
- * pixRasterop(pixd, x, y, wmin, hmin, PIX_DST & PIX_NOT(PIX_SRC),
- * pixm8, 0, 0);
- * pixRasterop(pixd, x, y, wmin, hmin, PIX_SRC | PIX_DST,
- * pixt, 0, 0);
- * pixDestroy(&pixt);
- * pixDestroy(&pixm8);
- *
- */
-l_ok
-pixCombineMaskedGeneral(PIX *pixd,
- PIX *pixs,
- PIX *pixm,
- l_int32 x,
- l_int32 y)
-{
-l_int32 d, w, h, ws, hs, ds, wm, hm, dm, wmin, hmin;
-l_int32 wpl, wpls, wplm, i, j, val;
-l_uint32 *data, *datas, *datam, *line, *lines, *linem;
-PIX *pixt;
-
- PROCNAME("pixCombineMaskedGeneral");
-
- if (!pixm) /* nothing to do */
- return 0;
- if (!pixd)
- return ERROR_INT("pixd not defined", procName, 1);
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
- pixGetDimensions(pixd, &w, &h, &d);
- pixGetDimensions(pixs, &ws, &hs, &ds);
- pixGetDimensions(pixm, &wm, &hm, &dm);
- if (d != ds)
- return ERROR_INT("pixs and pixd depths differ", procName, 1);
- if (dm != 1)
- return ERROR_INT("pixm not 1 bpp", procName, 1);
- if (d != 1 && d != 8 && d != 32)
- return ERROR_INT("pixd not 1, 8 or 32 bpp", procName, 1);
- if (pixGetColormap(pixd) || pixGetColormap(pixs))
- return ERROR_INT("pixs and/or pixd is cmapped", procName, 1);
-
- /* For d = 1, use rasterop. pixt is the part from pixs, under
- * the fg of pixm, that is to be combined with pixd. We also
- * use pixt to remove all fg of pixd that is under the fg of pixm.
- * Then pixt and pixd are combined by ORing. */
- wmin = L_MIN(ws, wm);
- hmin = L_MIN(hs, hm);
- if (d == 1) {
- pixt = pixAnd(NULL, pixs, pixm);
- pixRasterop(pixd, x, y, wmin, hmin, PIX_DST & PIX_NOT(PIX_SRC),
- pixm, 0, 0);
- pixRasterop(pixd, x, y, wmin, hmin, PIX_SRC | PIX_DST, pixt, 0, 0);
- pixDestroy(&pixt);
- return 0;
- }
-
- wpl = pixGetWpl(pixd);
- data = pixGetData(pixd);
- wpls = pixGetWpl(pixs);
- datas = pixGetData(pixs);
- wplm = pixGetWpl(pixm);
- datam = pixGetData(pixm);
-
- for (i = 0; i < hmin; i++) {
- if (y + i < 0 || y + i >= h) continue;
- line = data + (y + i) * wpl;
- lines = datas + i * wpls;
- linem = datam + i * wplm;
- for (j = 0; j < wmin; j++) {
- if (x + j < 0 || x + j >= w) continue;
- if (GET_DATA_BIT(linem, j)) {
- switch (d)
- {
- case 8:
- val = GET_DATA_BYTE(lines, j);
- SET_DATA_BYTE(line, x + j, val);
- break;
- case 32:
- *(line + x + j) = *(lines + j);
- break;
- default:
- return ERROR_INT("shouldn't get here", procName, 1);
- }
- }
- }
- }
-
- return 0;
-}
-
-
-/*!
- * \brief pixPaintThroughMask()
- *
- * \param[in] pixd 1, 2, 4, 8, 16 or 32 bpp; or colormapped
- * \param[in] pixm [optional] 1 bpp mask
- * \param[in] x, y origin of pixm relative to pixd; can be negative
- * \param[in] val pixel value to set at each masked pixel
- * \return 0 if OK; 1 on error
- *
- *
- * Notes:
- * (1) In-place operation. Calls pixSetMaskedCmap() for colormapped
- * images.
- * (2) For 1, 2, 4, 8 and 16 bpp gray, we take the appropriate
- * number of least significant bits of val.
- * (3) If pixm == NULL, it's a no-op.
- * (4) The mask origin is placed at (x,y) on pixd, and the
- * operation is clipped to the intersection of rectangles.
- * (5) For rgb, the components in val are in the canonical locations,
- * with red in location COLOR_RED, etc.
- * (6) Implementation detail 1:
- * For painting with val == 0 or val == maxval, you can use rasterop.
- * If val == 0, invert the mask so that it's 0 over the region
- * into which you want to write, and use PIX_SRC & PIX_DST to
- * clear those pixels. To write with val = maxval (all 1's),
- * use PIX_SRC | PIX_DST to set all bits under the mask.
- * (7) Implementation detail 2:
- * The rasterop trick can be used for depth > 1 as well.
- * For val == 0, generate the mask for depth d from the binary
- * mask using
- * pixmd = pixUnpackBinary(pixm, d, 1);
- * and use pixRasterop() with PIX_MASK. For val == maxval,
- * pixmd = pixUnpackBinary(pixm, d, 0);
- * and use pixRasterop() with PIX_PAINT.
- * But note that if d == 32 bpp, it is about 3x faster to use
- * the general implementation (not pixRasterop()).
- * (8) Implementation detail 3:
- * It might be expected that the switch in the inner loop will
- * cause large branching delays and should be avoided.
- * This is not the case, because the entrance is always the
- * same and the compiler can correctly predict the jump.
- *
- */
-l_ok
-pixPaintThroughMask(PIX *pixd,
- PIX *pixm,
- l_int32 x,
- l_int32 y,
- l_uint32 val)
-{
-l_int32 d, w, h, wm, hm, wpl, wplm, i, j, rval, gval, bval;
-l_uint32 *data, *datam, *line, *linem;
-
- PROCNAME("pixPaintThroughMask");
-
- if (!pixm) /* nothing to do */
- return 0;
- if (!pixd)
- return ERROR_INT("pixd not defined", procName, 1);
- if (pixGetColormap(pixd)) {
- extractRGBValues(val, &rval, &gval, &bval);
- return pixSetMaskedCmap(pixd, pixm, x, y, rval, gval, bval);
- }
-
- if (pixGetDepth(pixm) != 1)
- return ERROR_INT("pixm not 1 bpp", procName, 1);
- d = pixGetDepth(pixd);
- if (d == 1)
- val &= 1;
- else if (d == 2)
- val &= 3;
- else if (d == 4)
- val &= 0x0f;
- else if (d == 8)
- val &= 0xff;
- else if (d == 16)
- val &= 0xffff;
- else if (d != 32)
- return ERROR_INT("pixd not 1, 2, 4, 8, 16 or 32 bpp", procName, 1);
- pixGetDimensions(pixm, &wm, &hm, NULL);
-
- /* If d == 1, use rasterop; it's about 25x faster. */
- if (d == 1) {
- if (val == 0) {
- PIX *pixmi = pixInvert(NULL, pixm);
- pixRasterop(pixd, x, y, wm, hm, PIX_MASK, pixmi, 0, 0);
- pixDestroy(&pixmi);
- } else { /* val == 1 */
- pixRasterop(pixd, x, y, wm, hm, PIX_PAINT, pixm, 0, 0);
- }
- return 0;
- }
-
- /* For d < 32, use rasterop if val == 0 (black); ~3x faster. */
- if (d < 32 && val == 0) {
- PIX *pixmd = pixUnpackBinary(pixm, d, 1);
- pixRasterop(pixd, x, y, wm, hm, PIX_MASK, pixmd, 0, 0);
- pixDestroy(&pixmd);
- return 0;
- }
-
- /* For d < 32, use rasterop if val == maxval (white); ~3x faster. */
- if (d < 32 && val == ((1 << d) - 1)) {
- PIX *pixmd = pixUnpackBinary(pixm, d, 0);
- pixRasterop(pixd, x, y, wm, hm, PIX_PAINT, pixmd, 0, 0);
- pixDestroy(&pixmd);
- return 0;
- }
-
- /* All other cases */
- pixGetDimensions(pixd, &w, &h, NULL);
- wpl = pixGetWpl(pixd);
- data = pixGetData(pixd);
- wplm = pixGetWpl(pixm);
- datam = pixGetData(pixm);
- for (i = 0; i < hm; i++) {
- if (y + i < 0 || y + i >= h) continue;
- line = data + (y + i) * wpl;
- linem = datam + i * wplm;
- for (j = 0; j < wm; j++) {
- if (x + j < 0 || x + j >= w) continue;
- if (GET_DATA_BIT(linem, j)) {
- switch (d)
- {
- case 2:
- SET_DATA_DIBIT(line, x + j, val);
- break;
- case 4:
- SET_DATA_QBIT(line, x + j, val);
- break;
- case 8:
- SET_DATA_BYTE(line, x + j, val);
- break;
- case 16:
- SET_DATA_TWO_BYTES(line, x + j, val);
- break;
- case 32:
- *(line + x + j) = val;
- break;
- default:
- return ERROR_INT("shouldn't get here", procName, 1);
- }
- }
- }
- }
-
- return 0;
-}
-
-
-/*!
- * \brief pixCopyWithBoxa()
- *
- * \param[in] pixs all depths; cmap ok
- * \param[in] boxa e.g., from components of a photomask
- * \param[in] background L_SET_WHITE or L_SET_BLACK
- * \return pixd or NULL on error
- *
- *
- * Notes:
- * (1) Pixels from pixs are copied ("blitted") through each box into pixd.
- * (2) Pixels not copied are preset to either white or black.
- * (3) This fast and simple implementation can use rasterop because
- * each region to be copied is rectangular.
- * (4) A much slower implemention that doesn't use rasterop would make
- * a 1 bpp mask from the boxa and then copy, pixel by pixel,
- * through the mask:
- * pixGetDimensions(pixs, &w, &h, NULL);
- * pixm = pixCreate(w, h, 1);
- * pixm = pixMaskBoxa(pixm, pixm, boxa);
- * pixd = pixCreateTemplate(pixs);
- * pixSetBlackOrWhite(pixd, background);
- * pixCombineMasked(pixd, pixs, pixm);
- * pixDestroy(&pixm);
- *
- */
-PIX *
-pixCopyWithBoxa(PIX *pixs,
- BOXA *boxa,
- l_int32 background)
-{
-l_int32 i, n, x, y, w, h;
-PIX *pixd;
-
- PROCNAME("pixCopyWithBoxa");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- if (!boxa)
- return (PIX *)ERROR_PTR("boxa not defined", procName, NULL);
- if (background != L_SET_WHITE && background != L_SET_BLACK)
- return (PIX *)ERROR_PTR("invalid background", procName, NULL);
-
- pixd = pixCreateTemplate(pixs);
- pixSetBlackOrWhite(pixd, background);
- n = boxaGetCount(boxa);
- for (i = 0; i < n; i++) {
- boxaGetBoxGeometry(boxa, i, &x, &y, &w, &h);
- pixRasterop(pixd, x, y, w, h, PIX_SRC, pixs, x, y);
- }
- return pixd;
-}
-
-
-/*!
- * \brief pixPaintSelfThroughMask()
- *
- * \param[in] pixd 8 bpp gray or 32 bpp rgb; not colormapped
- * \param[in] pixm 1 bpp mask
- * \param[in] x, y origin of pixm relative to pixd; must not be negative
- * \param[in] searchdir L_HORIZ, L_VERT or L_BOTH_DIRECTIONS
- * \param[in] mindist min distance of nearest tile edge to box; >= 0
- * \param[in] tilesize requested size for tiling; may be reduced
- * \param[in] ntiles number of tiles tested in each row/column
- * \param[in] distblend distance outside the fg used for blending with pixs
- * \return 0 if OK; 1 on error
- *
- *
- * Notes:
- * (1) In-place operation; pixd is changed.
- * (2) If pixm == NULL, it's a no-op.
- * (3) The mask origin is placed at (x,y) on pixd, and the
- * operation is clipped to the intersection of pixd and the
- * fg of the mask.
- * (4) %tsize is the the requested size for tiling. The actual
- * actual size for each c.c. will be bounded by the minimum
- * dimension of the c.c.
- * (5) For %mindist, %searchdir and %ntiles, see pixFindRepCloseTile().
- * They determine the set of possible tiles that can be used
- * to build a larger mirrored tile to paint onto pixd through
- * the c.c. of pixm.
- * (6) %distblend is used for alpha blending. It is only applied
- * if there is exactly one c.c. in the mask. Use distblend == 0
- * to skip blending and just paint through the 1 bpp mask.
- * (7) To apply blending to more than 1 component, call this function
- * repeatedly with %pixm, %x and %y representing one component of
- * the mask each time. This would be done as follows, for an
- * underlying image pixs and mask pixm of components to fill:
- * Boxa *boxa = pixConnComp(pixm, &pixa, 8);
- * n = boxaGetCount(boxa);
- * for (i = 0; i < n; i++) {
- * Pix *pix = pixaGetPix(pixa, i, L_CLONE);
- * Box *box = pixaGetBox(pixa, i, L_CLONE);
- * boxGetGeometry(box, &bx, &by, &bw, &bh);
- * pixPaintSelfThroughMask(pixs, pix, bx, by, searchdir,
- * mindist, tilesize, ntiles, distblend);
- * pixDestroy(&pix);
- * boxDestroy(&box);
- * }
- * pixaDestroy(&pixa);
- * boxaDestroy(&boxa);
- * (8) If no tiles can be found, this falls back to estimating the
- * color near the boundary of the region to be textured.
- * (9) This can be used to replace the pixels in some regions of
- * an image by selected neighboring pixels. The mask represents
- * the pixels to be replaced. For each connected component in
- * the mask, this function selects up to two tiles of neighboring
- * pixels to be used for replacement of pixels represented by
- * the component (i.e., under the FG of that component in the mask).
- * After selection, mirror replication is used to generate an
- * image that is large enough to cover the component. Alpha
- * blending can also be used outside of the component, but near the
- * edge, to blur the transition between painted and original pixels.
- *
- */
-l_ok
-pixPaintSelfThroughMask(PIX *pixd,
- PIX *pixm,
- l_int32 x,
- l_int32 y,
- l_int32 searchdir,
- l_int32 mindist,
- l_int32 tilesize,
- l_int32 ntiles,
- l_int32 distblend)
-{
-l_int32 w, h, d, wm, hm, dm, i, n, bx, by, bw, bh, edgeblend, retval, minside;
-l_uint32 pixval;
-BOX *box, *boxv, *boxh;
-BOXA *boxa;
-PIX *pixf, *pixv, *pixh, *pix1, *pix2, *pix3, *pix4, *pix5;
-PIXA *pixa;
-
- PROCNAME("pixPaintSelfThroughMask");
-
- if (!pixm) /* nothing to do */
- return 0;
- if (!pixd)
- return ERROR_INT("pixd not defined", procName, 1);
- if (pixGetColormap(pixd) != NULL)
- return ERROR_INT("pixd has colormap", procName, 1);
- pixGetDimensions(pixd, &w, &h, &d);
- if (d != 8 && d != 32)
- return ERROR_INT("pixd not 8 or 32 bpp", procName, 1);
- pixGetDimensions(pixm, &wm, &hm, &dm);
- if (dm != 1)
- return ERROR_INT("pixm not 1 bpp", procName, 1);
- if (x < 0 || y < 0)
- return ERROR_INT("x and y must be non-negative", procName, 1);
- if (searchdir != L_HORIZ && searchdir != L_VERT &&
- searchdir != L_BOTH_DIRECTIONS)
- return ERROR_INT("invalid searchdir", procName, 1);
- if (tilesize < 2)
- return ERROR_INT("tilesize must be >= 2", procName, 1);
- if (distblend < 0)
- return ERROR_INT("distblend must be >= 0", procName, 1);
-
- /* Embed mask in full sized mask */
- if (wm < w || hm < h) {
- pixf = pixCreate(w, h, 1);
- pixRasterop(pixf, x, y, wm, hm, PIX_SRC, pixm, 0, 0);
- } else {
- pixf = pixCopy(NULL, pixm);
- }
-
- /* Get connected components of mask */
- boxa = pixConnComp(pixf, &pixa, 8);
- if ((n = pixaGetCount(pixa)) == 0) {
- L_WARNING("no fg in mask\n", procName);
- pixDestroy(&pixf);
- pixaDestroy(&pixa);
- boxaDestroy(&boxa);
- return 1;
- }
- boxaDestroy(&boxa);
-
- /* For each c.c., generate one or two representative tiles for
- * texturizing and apply through the mask. The input 'tilesize'
- * is the requested value. Note that if there is exactly one
- * component, and blending at the edge is requested, an alpha mask
- * is generated, which is larger than the bounding box of the c.c. */
- edgeblend = (n == 1 && distblend > 0) ? 1 : 0;
- if (distblend > 0 && n > 1)
- L_WARNING("%d components; can not blend at edges\n", procName, n);
- retval = 0;
- for (i = 0; i < n; i++) {
- if (edgeblend) {
- pix1 = pixMakeAlphaFromMask(pixf, distblend, &box);
- } else {
- pix1 = pixaGetPix(pixa, i, L_CLONE);
- box = pixaGetBox(pixa, i, L_CLONE);
- }
- boxGetGeometry(box, &bx, &by, &bw, &bh);
- minside = L_MIN(bw, bh);
-
- boxh = boxv = NULL;
- if (searchdir == L_HORIZ || searchdir == L_BOTH_DIRECTIONS) {
- pixFindRepCloseTile(pixd, box, L_HORIZ, mindist,
- L_MIN(minside, tilesize), ntiles, &boxh, 0);
- }
- if (searchdir == L_VERT || searchdir == L_BOTH_DIRECTIONS) {
- pixFindRepCloseTile(pixd, box, L_VERT, mindist,
- L_MIN(minside, tilesize), ntiles, &boxv, 0);
- }
- if (!boxh && !boxv) {
- L_WARNING("tile region not selected; paint color near boundary\n",
- procName);
- pixDestroy(&pix1);
- pix1 = pixaGetPix(pixa, i, L_CLONE);
- pixaGetBoxGeometry(pixa, i, &bx, &by, NULL, NULL);
- retval = pixGetColorNearMaskBoundary(pixd, pixm, box, distblend,
- &pixval, 0);
- pixSetMaskedGeneral(pixd, pix1, pixval, bx, by);
- pixDestroy(&pix1);
- boxDestroy(&box);
- continue;
- }
-
- /* Extract the selected squares from pixd */
- pixh = (boxh) ? pixClipRectangle(pixd, boxh, NULL) : NULL;
- pixv = (boxv) ? pixClipRectangle(pixd, boxv, NULL) : NULL;
- if (pixh && pixv)
- pix2 = pixBlend(pixh, pixv, 0, 0, 0.5);
- else if (pixh)
- pix2 = pixClone(pixh);
- else /* pixv */
- pix2 = pixClone(pixv);
- pixDestroy(&pixh);
- pixDestroy(&pixv);
- boxDestroy(&boxh);
- boxDestroy(&boxv);
-
- /* Generate an image the size of the b.b. of the c.c.,
- * possibly extended by the blending distance, which
- * is then either painted through the c.c. mask or
- * blended using the alpha mask for that c.c. */
- pix3 = pixMirroredTiling(pix2, bw, bh);
- if (edgeblend) {
- pix4 = pixClipRectangle(pixd, box, NULL);
- pix5 = pixBlendWithGrayMask(pix4, pix3, pix1, 0, 0);
- pixRasterop(pixd, bx, by, bw, bh, PIX_SRC, pix5, 0, 0);
- pixDestroy(&pix4);
- pixDestroy(&pix5);
- } else {
- pixCombineMaskedGeneral(pixd, pix3, pix1, bx, by);
- }
- pixDestroy(&pix1);
- pixDestroy(&pix2);
- pixDestroy(&pix3);
- boxDestroy(&box);
- }
-
- pixaDestroy(&pixa);
- pixDestroy(&pixf);
- return retval;
-}
-
-
-/*!
- * \brief pixMakeMaskFromVal()
- *
- * \param[in] pixs 2, 4 or 8 bpp; can be colormapped
- * \param[in] val pixel value
- * \return pixd 1 bpp mask, or NULL on error
- *
- *
- * Notes:
- * (1) This generates a 1 bpp mask image, where a 1 is written in
- * the mask for each pixel in pixs that has a value %val.
- * (2) If no pixels have the value, an empty mask is generated.
- *
- */
-PIX *
-pixMakeMaskFromVal(PIX *pixs,
- l_int32 val)
-{
-l_int32 w, h, d, i, j, sval, wpls, wpld;
-l_uint32 *datas, *datad, *lines, *lined;
-PIX *pixd;
-
- PROCNAME("pixMakeMaskFromVal");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- pixGetDimensions(pixs, &w, &h, &d);
- if (d != 2 && d != 4 && d != 8)
- return (PIX *)ERROR_PTR("pix not 2, 4 or 8 bpp", procName, NULL);
-
- pixd = pixCreate(w, h, 1);
- pixCopyResolution(pixd, pixs);
- pixCopyInputFormat(pixd, pixs);
- datas = pixGetData(pixs);
- datad = pixGetData(pixd);
- wpls = pixGetWpl(pixs);
- wpld = pixGetWpl(pixd);
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- lined = datad + i * wpld;
- for (j = 0; j < w; j++) {
- if (d == 2)
- sval = GET_DATA_DIBIT(lines, j);
- else if (d == 4)
- sval = GET_DATA_QBIT(lines, j);
- else /* d == 8 */
- sval = GET_DATA_BYTE(lines, j);
- if (sval == val)
- SET_DATA_BIT(lined, j);
- }
- }
-
- return pixd;
-}
-
-
-/*!
- * \brief pixMakeMaskFromLUT()
- *
- * \param[in] pixs 2, 4 or 8 bpp; can be colormapped
- * \param[in] tab 256-entry LUT; 1 means to write to mask
- * \return pixd 1 bpp mask, or NULL on error
- *
- *
- * Notes:
- * (1) This generates a 1 bpp mask image, where a 1 is written in
- * the mask for each pixel in pixs that has a value corresponding
- * to a 1 in the LUT.
- * (2) The LUT should be of size 256.
- *
- */
-PIX *
-pixMakeMaskFromLUT(PIX *pixs,
- l_int32 *tab)
-{
-l_int32 w, h, d, i, j, val, wpls, wpld;
-l_uint32 *datas, *datad, *lines, *lined;
-PIX *pixd;
-
- PROCNAME("pixMakeMaskFromLUT");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- if (!tab)
- return (PIX *)ERROR_PTR("tab not defined", procName, NULL);
- pixGetDimensions(pixs, &w, &h, &d);
- if (d != 2 && d != 4 && d != 8)
- return (PIX *)ERROR_PTR("pix not 2, 4 or 8 bpp", procName, NULL);
-
- pixd = pixCreate(w, h, 1);
- pixCopyResolution(pixd, pixs);
- pixCopyInputFormat(pixd, pixs);
- datas = pixGetData(pixs);
- datad = pixGetData(pixd);
- wpls = pixGetWpl(pixs);
- wpld = pixGetWpl(pixd);
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- lined = datad + i * wpld;
- for (j = 0; j < w; j++) {
- if (d == 2)
- val = GET_DATA_DIBIT(lines, j);
- else if (d == 4)
- val = GET_DATA_QBIT(lines, j);
- else /* d == 8 */
- val = GET_DATA_BYTE(lines, j);
- if (tab[val] == 1)
- SET_DATA_BIT(lined, j);
- }
- }
-
- return pixd;
-}
-
-
-/*!
- * \brief pixMakeArbMaskFromRGB()
- *
- * \param[in] pixs 32 bpp RGB
- * \param[in] rc, gc, bc arithmetic factors; can be negative
- * \param[in] thresh lower threshold on weighted sum of components
- * \return pixd 1 bpp mask, or NULL on error
- *
- *
- * Notes:
- * (1) This generates a 1 bpp mask image, where a 1 is written in
- * the mask for each pixel in pixs that satisfies
- * rc * rval + gc * gval + bc * bval > thresh
- * where rval is the red component, etc.
- * (2) Unlike with pixConvertToGray(), there are no constraints
- * on the color coefficients, which can be negative. For
- * example, a mask that discriminates against red and in favor
- * of blue will have rc < 0.0 and bc > 0.0.
- * (3) To make the result independent of intensity (the 'V' in HSV),
- * select coefficients so that %thresh = 0. Then the result
- * is not changed when all components are multiplied by the
- * same constant (as long as nothing saturates). This can be
- * useful if, for example, the illumination is not uniform.
- *
- */
-PIX *
-pixMakeArbMaskFromRGB(PIX *pixs,
- l_float32 rc,
- l_float32 gc,
- l_float32 bc,
- l_float32 thresh)
-{
-PIX *pix1, *pix2;
-
- PROCNAME("pixMakeArbMaskFromRGB");
-
- if (!pixs || pixGetDepth(pixs) != 32)
- return (PIX *)ERROR_PTR("pixs undefined or not 32 bpp", procName, NULL);
- if (thresh >= 255.0) thresh = 254.0; /* avoid 8 bit overflow */
-
- if ((pix1 = pixConvertRGBToGrayArb(pixs, rc, gc, bc)) == NULL)
- return (PIX *)ERROR_PTR("pix1 not made", procName, NULL);
- pix2 = pixThresholdToBinary(pix1, thresh + 1);
- pixInvert(pix2, pix2);
- pixDestroy(&pix1);
- return pix2;
-}
-
-
-/*!
- * \brief pixSetUnderTransparency()
- *
- * \param[in] pixs 32 bpp rgba
- * \param[in] val 32 bit unsigned color to use where alpha == 0
- * \param[in] debug displays layers of pixs
- * \return pixd 32 bpp rgba, or NULL on error
- *
- *
- * Notes:
- * (1) This sets the r, g and b components under every fully
- * transparent alpha component to %val. The alpha components
- * are unchanged.
- * (2) Full transparency is denoted by alpha == 0. Setting
- * all pixels to a constant %val where alpha is transparent
- * can improve compressibility by reducing the entropy.
- * (3) The visual result depends on how the image is displayed.
- * (a) For display devices that respect the use of the alpha
- * layer, this will not affect the appearance.
- * (b) For typical leptonica operations, alpha is ignored,
- * so there will be a change in appearance because this
- * resets the rgb values in the fully transparent region.
- * (4) pixRead() and pixWrite() will, by default, read and write
- * 4-component (rgba) pix in png format. To ignore the alpha
- * component after reading, or omit it on writing, pixSetSpp(..., 3).
- * (5) Here are some examples:
- * * To convert all fully transparent pixels in a 4 component
- * (rgba) png file to white:
- * pixs = pixRead();
- * pixd = pixSetUnderTransparency(pixs, 0xffffff00, 0);
- * * To write pixd with the alpha component:
- * pixWrite(, pixd, IFF_PNG);
- * * To write and rgba image without the alpha component, first do:
- * pixSetSpp(pixd, 3);
- * If you later want to use the alpha, spp must be reset to 4.
- * * (fancier) To remove the alpha by blending the image over
- * a white background:
- * pixRemoveAlpha()
- * This changes all pixel values where the alpha component is
- * not opaque (255).
- * (6) Caution. rgb images in leptonica typically have value 0 in
- * the alpha channel, which is fully transparent. If spp for
- * such an image were changed from 3 to 4, the image becomes
- * fully transparent, and this function will set each pixel to %val.
- * If you really want to set every pixel to the same value,
- * use pixSetAllArbitrary().
- * (7) This is useful for compressing an RGBA image where the part
- * of the image that is fully transparent is random junk; compression
- * is typically improved by setting that region to a constant.
- * For rendering as a 3 component RGB image over a uniform
- * background of arbitrary color, use pixAlphaBlendUniform().
- *
- */
-PIX *
-pixSetUnderTransparency(PIX *pixs,
- l_uint32 val,
- l_int32 debug)
-{
-PIX *pixg, *pixm, *pixt, *pixd;
-
- PROCNAME("pixSetUnderTransparency");
-
- if (!pixs || pixGetDepth(pixs) != 32)
- return (PIX *)ERROR_PTR("pixs not defined or not 32 bpp",
- procName, NULL);
-
- if (pixGetSpp(pixs) != 4) {
- L_WARNING("no alpha channel; returning a copy\n", procName);
- return pixCopy(NULL, pixs);
- }
-
- /* Make a mask from the alpha component with ON pixels
- * wherever the alpha component is fully transparent (0).
- * The hard way:
- * l_int32 *lut = (l_int32 *)LEPT_CALLOC(256, sizeof(l_int32));
- * lut[0] = 1;
- * pixg = pixGetRGBComponent(pixs, L_ALPHA_CHANNEL);
- * pixm = pixMakeMaskFromLUT(pixg, lut);
- * LEPT_FREE(lut);
- * But there's an easier way to set pixels in a mask where
- * the alpha component is 0 ... */
- pixg = pixGetRGBComponent(pixs, L_ALPHA_CHANNEL);
- pixm = pixThresholdToBinary(pixg, 1);
-
- if (debug) {
- pixt = pixDisplayLayersRGBA(pixs, 0xffffff00, 600);
- pixDisplay(pixt, 0, 0);
- pixDestroy(&pixt);
- }
-
- pixd = pixCopy(NULL, pixs);
- pixSetMasked(pixd, pixm, (val & 0xffffff00));
- pixDestroy(&pixg);
- pixDestroy(&pixm);
- return pixd;
-}
-
-
-/*!
- * \brief pixMakeAlphaFromMask()
- *
- * \param[in] pixs 1 bpp
- * \param[in] dist blending distance; typically 10 - 30
- * \param[out] pbox [optional] use NULL to get the full size
- * \return pixd (8 bpp gray, or NULL on error
- *
- *
- * Notes:
- * (1) This generates a 8 bpp alpha layer that is opaque (256)
- * over the FG of pixs, and goes transparent linearly away
- * from the FG pixels, decaying to 0 (transparent) is an
- * 8-connected distance given by %dist. If %dist == 0,
- * this does a simple conversion from 1 to 8 bpp.
- * (2) If &box == NULL, this returns an alpha mask that is the
- * full size of pixs. Otherwise, the returned mask pixd covers
- * just the FG pixels of pixs, expanded by %dist in each
- * direction (if possible), and the returned box gives the
- * location of the returned mask relative to pixs.
- * (3) This is useful for painting through a mask and allowing
- * blending of the painted image with an underlying image
- * in the mask background for pixels near foreground mask pixels.
- * For example, with an underlying rgb image pix1, an overlaying
- * image rgb pix2, binary mask pixm, and dist > 0, this
- * blending is achieved with:
- * pix3 = pixMakeAlphaFromMask(pixm, dist, &box);
- * boxGetGeometry(box, &x, &y, NULL, NULL);
- * pix4 = pixBlendWithGrayMask(pix1, pix2, pix3, x, y);
- *
- */
-PIX *
-pixMakeAlphaFromMask(PIX *pixs,
- l_int32 dist,
- BOX **pbox)
-{
-l_int32 w, h;
-BOX *box1, *box2;
-PIX *pix1, *pixd;
-
- PROCNAME("pixMakeAlphaFromMask");
-
- if (pbox) *pbox = NULL;
- if (!pixs || pixGetDepth(pixs) != 1)
- return (PIX *)ERROR_PTR("pixs undefined or not 1 bpp", procName, NULL);
- if (dist < 0)
- return (PIX *)ERROR_PTR("dist must be >= 0", procName, NULL);
-
- /* If requested, extract just the region to be affected by the mask */
- if (pbox) {
- pixClipToForeground(pixs, NULL, &box1);
- if (!box1) {
- L_WARNING("no ON pixels in mask\n", procName);
- return pixCreateTemplate(pixs); /* all background (0) */
- }
-
- boxAdjustSides(box1, box1, -dist, dist, -dist, dist);
- pixGetDimensions(pixs, &w, &h, NULL);
- box2 = boxClipToRectangle(box1, w, h);
- *pbox = box2;
- pix1 = pixClipRectangle(pixs, box2, NULL);
- boxDestroy(&box1);
- } else {
- pix1 = pixCopy(NULL, pixs);
- }
-
- if (dist == 0) {
- pixd = pixConvert1To8(NULL, pix1, 0, 255);
- pixDestroy(&pix1);
- return pixd;
- }
-
- /* Blur the boundary of the input mask */
- pixInvert(pix1, pix1);
- pixd = pixDistanceFunction(pix1, 8, 8, L_BOUNDARY_FG);
- pixMultConstantGray(pixd, 256.0 / dist);
- pixInvert(pixd, pixd);
- pixDestroy(&pix1);
- return pixd;
-}
-
-
-/*!
- * \brief pixGetColorNearMaskBoundary()
- *
- * \param[in] pixs 32 bpp rgb
- * \param[in] pixm 1 bpp mask, full image
- * \param[in] box region of mask; typically b.b. of a component
- * \param[in] dist distance into BG from mask boundary to use
- * \param[out] pval average pixel value
- * \param[in] debug 1 to output mask images
- * \return 0 if OK, 1 on error.
- *
- *
- * Notes:
- * (1) This finds the average color in a set of pixels that are
- * roughly a distance %dist from the c.c. boundary and in the
- * background of the mask image.
- *
- */
-l_ok
-pixGetColorNearMaskBoundary(PIX *pixs,
- PIX *pixm,
- BOX *box,
- l_int32 dist,
- l_uint32 *pval,
- l_int32 debug)
-{
-char op[64];
-l_int32 empty, bx, by;
-l_float32 rval, gval, bval;
-BOX *box1, *box2;
-PIX *pix1, *pix2, *pix3;
-
- PROCNAME("pixGetColorNearMaskBoundary");
-
- if (!pval)
- return ERROR_INT("&pval not defined", procName, 1);
- *pval = 0xffffff00; /* white */
- if (!pixs || pixGetDepth(pixs) != 32)
- return ERROR_INT("pixs undefined or not 32 bpp", procName, 1);
- if (!pixm || pixGetDepth(pixm) != 1)
- return ERROR_INT("pixm undefined or not 1 bpp", procName, 1);
- if (!box)
- return ERROR_INT("box not defined", procName, 1);
- if (dist < 0)
- return ERROR_INT("dist must be >= 0", procName, 1);
-
- /* Clip mask piece, expanded beyond %box by (%dist + 5) on each side.
- * box1 is the region requested; box2 is the actual region retrieved,
- * which is clipped to %pixm */
- box1 = boxAdjustSides(NULL, box, -dist - 5, dist + 5, -dist - 5, dist + 5);
- pix1 = pixClipRectangle(pixm, box1, &box2);
-
- /* Expand FG by %dist into the BG */
- if (dist == 0) {
- pix2 = pixCopy(NULL, pix1);
- } else {
- snprintf(op, sizeof(op), "d%d.%d", 2 * dist, 2 * dist);
- pix2 = pixMorphSequence(pix1, op, 0);
- }
-
- /* Expand again by 5 pixels on all sides (dilate 11x11) and XOR,
- * getting the annulus of FG pixels between %dist and %dist + 5 */
- pix3 = pixCopy(NULL, pix2);
- pixDilateBrick(pix3, pix3, 11, 11);
- pixXor(pix3, pix3, pix2);
- pixZero(pix3, &empty);
- if (!empty) {
- /* Scan the same region in %pixs, to get average under FG in pix3 */
- boxGetGeometry(box2, &bx, &by, NULL, NULL);
- pixGetAverageMaskedRGB(pixs, pix3, bx, by, 1, L_MEAN_ABSVAL,
- &rval, &gval, &bval);
- composeRGBPixel((l_int32)(rval + 0.5), (l_int32)(gval + 0.5),
- (l_int32)(bval + 0.5), pval);
- } else {
- L_WARNING("no pixels found\n", procName);
- }
-
- if (debug) {
- lept_rmdir("masknear"); /* erase previous images */
- lept_mkdir("masknear");
- pixWriteDebug("/tmp/masknear/input.png", pix1, IFF_PNG);
- pixWriteDebug("/tmp/masknear/adjusted.png", pix2, IFF_PNG);
- pixWriteDebug("/tmp/masknear/outerfive.png", pix3, IFF_PNG);
- lept_stderr("Input box; with adjusted sides; clipped\n");
- boxPrintStreamInfo(stderr, box);
- boxPrintStreamInfo(stderr, box1);
- boxPrintStreamInfo(stderr, box2);
- }
-
- pixDestroy(&pix1);
- pixDestroy(&pix2);
- pixDestroy(&pix3);
- boxDestroy(&box1);
- boxDestroy(&box2);
- return 0;
-}
-
-
-/*!
- * \brief pixDisplaySelectedPixels()
- *
- * \param[in] pixs [optional] any depth
- * \param[in] pixm 1 bpp mask, aligned UL corner with %pixs
- * \param[in] sel [optional] pattern to paint at each pixel in pixm
- * \param[in] val rgb rendering of pattern
- * \return pixd, or NULL on error
- *
- *
- * Notes:
- * (1) For every fg pixel in %pixm, this paints the pattern in %sel
- * in color %val on a copy of %pixs.
- * (2) The implementation is to dilate %pixm by %sel, and then
- * paint through the dilated mask onto %pixs.
- * (3) If %pixs == NULL, it paints on a white image.
- * (4) If %sel == NULL, it paints only the pixels in the input %pixm.
- * (5) This visualization would typically be used in debugging.
- *
- */
-PIX *
-pixDisplaySelectedPixels(PIX *pixs,
- PIX *pixm,
- SEL *sel,
- l_uint32 val)
-{
-l_int32 w, h;
-PIX *pix1, *pix2;
-
- PROCNAME("pixDisplaySelectedPixels");
-
- if (!pixm || pixGetDepth(pixm) != 1)
- return (PIX *)ERROR_PTR("pixm undefined or not 1 bpp", procName, NULL);
-
- if (pixs) {
- pix1 = pixConvertTo32(pixs);
- } else {
- pixGetDimensions(pixm, &w, &h, NULL);
- pix1 = pixCreate(w, h, 32);
- pixSetAll(pix1);
- }
-
- if (sel)
- pix2 = pixDilate(NULL, pixm, sel);
- else
- pix2 = pixClone(pixm);
- pixSetMasked(pix1, pix2, val);
- pixDestroy(&pix2);
- return pix1;
-}
-
-
-/*-------------------------------------------------------------*
- * One and two-image boolean ops on arbitrary depth images *
- *-------------------------------------------------------------*/
-/*!
- * \brief pixInvert()
- *
- * \param[in] pixd [optional]; this can be null, equal to pixs,
- * or different from pixs
- * \param[in] pixs
- * \return pixd, or NULL on error
- *
- *
- * Notes:
- * (1) This inverts pixs, for all pixel depths.
- * (2) There are 3 cases:
- * (a) pixd == null, ~src --> new pixd
- * (b) pixd == pixs, ~src --> src (in-place)
- * (c) pixd != pixs, ~src --> input pixd
- * (3) For clarity, if the case is known, use these patterns:
- * (a) pixd = pixInvert(NULL, pixs);
- * (b) pixInvert(pixs, pixs);
- * (c) pixInvert(pixd, pixs);
- *
- */
-PIX *
-pixInvert(PIX *pixd,
- PIX *pixs)
-{
- PROCNAME("pixInvert");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
-
- /* Prepare pixd for in-place operation */
- if ((pixd = pixCopy(pixd, pixs)) == NULL)
- return (PIX *)ERROR_PTR("pixd not made", procName, NULL);
-
- pixRasterop(pixd, 0, 0, pixGetWidth(pixd), pixGetHeight(pixd),
- PIX_NOT(PIX_DST), NULL, 0, 0); /* invert pixd */
-
- return pixd;
-}
-
-
-/*!
- * \brief pixOr()
- *
- * \param[in] pixd [optional]; this can be null, equal to pixs1,
- * different from pixs1
- * \param[in] pixs1 can be == pixd
- * \param[in] pixs2 must be != pixd
- * \return pixd always
- *
- *
- * Notes:
- * (1) This gives the union of two images with equal depth,
- * aligning them to the the UL corner. pixs1 and pixs2
- * need not have the same width and height.
- * (2) There are 3 cases:
- * (a) pixd == null, (src1 | src2) --> new pixd
- * (b) pixd == pixs1, (src1 | src2) --> src1 (in-place)
- * (c) pixd != pixs1, (src1 | src2) --> input pixd
- * (3) For clarity, if the case is known, use these patterns:
- * (a) pixd = pixOr(NULL, pixs1, pixs2);
- * (b) pixOr(pixs1, pixs1, pixs2);
- * (c) pixOr(pixd, pixs1, pixs2);
- * (4) The size of the result is determined by pixs1.
- * (5) The depths of pixs1 and pixs2 must be equal.
- * (6) Note carefully that the order of pixs1 and pixs2 only matters
- * for the in-place case. For in-place, you must have
- * pixd == pixs1. Setting pixd == pixs2 gives an incorrect
- * result: the copy puts pixs1 image data in pixs2, and
- * the rasterop is then between pixs2 and pixs2 (a no-op).
- *
- */
-PIX *
-pixOr(PIX *pixd,
- PIX *pixs1,
- PIX *pixs2)
-{
- PROCNAME("pixOr");
-
- if (!pixs1)
- return (PIX *)ERROR_PTR("pixs1 not defined", procName, pixd);
- if (!pixs2)
- return (PIX *)ERROR_PTR("pixs2 not defined", procName, pixd);
- if (pixd == pixs2)
- return (PIX *)ERROR_PTR("cannot have pixs2 == pixd", procName, pixd);
- if (pixGetDepth(pixs1) != pixGetDepth(pixs2))
- return (PIX *)ERROR_PTR("depths of pixs* unequal", procName, pixd);
-
-#if EQUAL_SIZE_WARNING
- if (!pixSizesEqual(pixs1, pixs2))
- L_WARNING("pixs1 and pixs2 not equal sizes\n", procName);
-#endif /* EQUAL_SIZE_WARNING */
-
- /* Prepare pixd to be a copy of pixs1 */
- if ((pixd = pixCopy(pixd, pixs1)) == NULL)
- return (PIX *)ERROR_PTR("pixd not made", procName, pixd);
-
- /* src1 | src2 --> dest */
- pixRasterop(pixd, 0, 0, pixGetWidth(pixd), pixGetHeight(pixd),
- PIX_SRC | PIX_DST, pixs2, 0, 0);
-
- return pixd;
-}
-
-
-/*!
- * \brief pixAnd()
- *
- * \param[in] pixd [optional]; this can be null, equal to pixs1,
- * different from pixs1
- * \param[in] pixs1 can be == pixd
- * \param[in] pixs2 must be != pixd
- * \return pixd always
- *
- *
- * Notes:
- * (1) This gives the intersection of two images with equal depth,
- * aligning them to the the UL corner. pixs1 and pixs2
- * need not have the same width and height.
- * (2) There are 3 cases:
- * (a) pixd == null, (src1 & src2) --> new pixd
- * (b) pixd == pixs1, (src1 & src2) --> src1 (in-place)
- * (c) pixd != pixs1, (src1 & src2) --> input pixd
- * (3) For clarity, if the case is known, use these patterns:
- * (a) pixd = pixAnd(NULL, pixs1, pixs2);
- * (b) pixAnd(pixs1, pixs1, pixs2);
- * (c) pixAnd(pixd, pixs1, pixs2);
- * (4) The size of the result is determined by pixs1.
- * (5) The depths of pixs1 and pixs2 must be equal.
- * (6) Note carefully that the order of pixs1 and pixs2 only matters
- * for the in-place case. For in-place, you must have
- * pixd == pixs1. Setting pixd == pixs2 gives an incorrect
- * result: the copy puts pixs1 image data in pixs2, and
- * the rasterop is then between pixs2 and pixs2 (a no-op).
- *
- */
-PIX *
-pixAnd(PIX *pixd,
- PIX *pixs1,
- PIX *pixs2)
-{
- PROCNAME("pixAnd");
-
- if (!pixs1)
- return (PIX *)ERROR_PTR("pixs1 not defined", procName, pixd);
- if (!pixs2)
- return (PIX *)ERROR_PTR("pixs2 not defined", procName, pixd);
- if (pixd == pixs2)
- return (PIX *)ERROR_PTR("cannot have pixs2 == pixd", procName, pixd);
- if (pixGetDepth(pixs1) != pixGetDepth(pixs2))
- return (PIX *)ERROR_PTR("depths of pixs* unequal", procName, pixd);
-
-#if EQUAL_SIZE_WARNING
- if (!pixSizesEqual(pixs1, pixs2))
- L_WARNING("pixs1 and pixs2 not equal sizes\n", procName);
-#endif /* EQUAL_SIZE_WARNING */
-
- /* Prepare pixd to be a copy of pixs1 */
- if ((pixd = pixCopy(pixd, pixs1)) == NULL)
- return (PIX *)ERROR_PTR("pixd not made", procName, pixd);
-
- /* src1 & src2 --> dest */
- pixRasterop(pixd, 0, 0, pixGetWidth(pixd), pixGetHeight(pixd),
- PIX_SRC & PIX_DST, pixs2, 0, 0);
-
- return pixd;
-}
-
-
-/*!
- * \brief pixXor()
- *
- * \param[in] pixd [optional]; this can be null, equal to pixs1,
- * different from pixs1
- * \param[in] pixs1 can be == pixd
- * \param[in] pixs2 must be != pixd
- * \return pixd always
- *
- *
- * Notes:
- * (1) This gives the XOR of two images with equal depth,
- * aligning them to the the UL corner. pixs1 and pixs2
- * need not have the same width and height.
- * (2) There are 3 cases:
- * (a) pixd == null, (src1 ^ src2) --> new pixd
- * (b) pixd == pixs1, (src1 ^ src2) --> src1 (in-place)
- * (c) pixd != pixs1, (src1 ^ src2) --> input pixd
- * (3) For clarity, if the case is known, use these patterns:
- * (a) pixd = pixXor(NULL, pixs1, pixs2);
- * (b) pixXor(pixs1, pixs1, pixs2);
- * (c) pixXor(pixd, pixs1, pixs2);
- * (4) The size of the result is determined by pixs1.
- * (5) The depths of pixs1 and pixs2 must be equal.
- * (6) Note carefully that the order of pixs1 and pixs2 only matters
- * for the in-place case. For in-place, you must have
- * pixd == pixs1. Setting pixd == pixs2 gives an incorrect
- * result: the copy puts pixs1 image data in pixs2, and
- * the rasterop is then between pixs2 and pixs2 (a no-op).
- *
- */
-PIX *
-pixXor(PIX *pixd,
- PIX *pixs1,
- PIX *pixs2)
-{
- PROCNAME("pixXor");
-
- if (!pixs1)
- return (PIX *)ERROR_PTR("pixs1 not defined", procName, pixd);
- if (!pixs2)
- return (PIX *)ERROR_PTR("pixs2 not defined", procName, pixd);
- if (pixd == pixs2)
- return (PIX *)ERROR_PTR("cannot have pixs2 == pixd", procName, pixd);
- if (pixGetDepth(pixs1) != pixGetDepth(pixs2))
- return (PIX *)ERROR_PTR("depths of pixs* unequal", procName, pixd);
-
-#if EQUAL_SIZE_WARNING
- if (!pixSizesEqual(pixs1, pixs2))
- L_WARNING("pixs1 and pixs2 not equal sizes\n", procName);
-#endif /* EQUAL_SIZE_WARNING */
-
- /* Prepare pixd to be a copy of pixs1 */
- if ((pixd = pixCopy(pixd, pixs1)) == NULL)
- return (PIX *)ERROR_PTR("pixd not made", procName, pixd);
-
- /* src1 ^ src2 --> dest */
- pixRasterop(pixd, 0, 0, pixGetWidth(pixd), pixGetHeight(pixd),
- PIX_SRC ^ PIX_DST, pixs2, 0, 0);
-
- return pixd;
-}
-
-
-/*!
- * \brief pixSubtract()
- *
- * \param[in] pixd [optional]; this can be null, equal to pixs1,
- * equal to pixs2, or different from both pixs1 and pixs2
- * \param[in] pixs1 can be == pixd
- * \param[in] pixs2 can be == pixd
- * \return pixd always
- *
- *
- * Notes:
- * (1) This gives the set subtraction of two images with equal depth,
- * aligning them to the the UL corner. pixs1 and pixs2
- * need not have the same width and height.
- * (2) Source pixs2 is always subtracted from source pixs1.
- * The result is
- * pixs1 \ pixs2 = pixs1 & (~pixs2)
- * (3) There are 4 cases:
- * (a) pixd == null, (src1 - src2) --> new pixd
- * (b) pixd == pixs1, (src1 - src2) --> src1 (in-place)
- * (c) pixd == pixs2, (src1 - src2) --> src2 (in-place)
- * (d) pixd != pixs1 && pixd != pixs2),
- * (src1 - src2) --> input pixd
- * (4) For clarity, if the case is known, use these patterns:
- * (a) pixd = pixSubtract(NULL, pixs1, pixs2);
- * (b) pixSubtract(pixs1, pixs1, pixs2);
- * (c) pixSubtract(pixs2, pixs1, pixs2);
- * (d) pixSubtract(pixd, pixs1, pixs2);
- * (5) The size of the result is determined by pixs1.
- * (6) The depths of pixs1 and pixs2 must be equal.
- *
- */
-PIX *
-pixSubtract(PIX *pixd,
- PIX *pixs1,
- PIX *pixs2)
-{
-l_int32 w, h;
-
- PROCNAME("pixSubtract");
-
- if (!pixs1)
- return (PIX *)ERROR_PTR("pixs1 not defined", procName, pixd);
- if (!pixs2)
- return (PIX *)ERROR_PTR("pixs2 not defined", procName, pixd);
- if (pixGetDepth(pixs1) != pixGetDepth(pixs2))
- return (PIX *)ERROR_PTR("depths of pixs* unequal", procName, pixd);
-
-#if EQUAL_SIZE_WARNING
- if (!pixSizesEqual(pixs1, pixs2))
- L_WARNING("pixs1 and pixs2 not equal sizes\n", procName);
-#endif /* EQUAL_SIZE_WARNING */
-
- pixGetDimensions(pixs1, &w, &h, NULL);
- if (!pixd) {
- pixd = pixCopy(NULL, pixs1);
- pixRasterop(pixd, 0, 0, w, h, PIX_DST & PIX_NOT(PIX_SRC),
- pixs2, 0, 0); /* src1 & (~src2) */
- } else if (pixd == pixs1) {
- pixRasterop(pixd, 0, 0, w, h, PIX_DST & PIX_NOT(PIX_SRC),
- pixs2, 0, 0); /* src1 & (~src2) */
- } else if (pixd == pixs2) {
- pixRasterop(pixd, 0, 0, w, h, PIX_NOT(PIX_DST) & PIX_SRC,
- pixs1, 0, 0); /* src1 & (~src2) */
- } else { /* pixd != pixs1 && pixd != pixs2 */
- pixCopy(pixd, pixs1); /* sizes pixd to pixs1 if unequal */
- pixRasterop(pixd, 0, 0, w, h, PIX_DST & PIX_NOT(PIX_SRC),
- pixs2, 0, 0); /* src1 & (~src2) */
- }
-
- return pixd;
-}
-
-
-/*-------------------------------------------------------------*
- * Pixel counting *
- *-------------------------------------------------------------*/
-/*!
- * \brief pixZero()
- *
- * \param[in] pix all depths; colormap OK
- * \param[out] pempty 1 if all bits in image data field are 0; 0 otherwise
- * \return 0 if OK; 1 on error
- *
- *
- * Notes:
- * (1) For a binary image, if there are no fg (black) pixels, empty = 1.
- * (2) For a grayscale image, if all pixels are black (0), empty = 1.
- * (3) For an RGB image, if all 4 components in every pixel is 0,
- * empty = 1.
- * (4) For a colormapped image, pixel values are 0. The colormap
- * is ignored.
- *
- */
-l_ok
-pixZero(PIX *pix,
- l_int32 *pempty)
-{
-l_int32 w, h, wpl, i, j, fullwords, endbits;
-l_uint32 endmask;
-l_uint32 *data, *line;
-
- PROCNAME("pixZero");
-
- if (!pempty)
- return ERROR_INT("&empty not defined", procName, 1);
- *pempty = 1;
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
-
- w = pixGetWidth(pix) * pixGetDepth(pix); /* in bits */
- h = pixGetHeight(pix);
- wpl = pixGetWpl(pix);
- data = pixGetData(pix);
- fullwords = w / 32;
- endbits = w & 31;
- endmask = (endbits == 0) ? 0 : (0xffffffffU << (32 - endbits));
-
- for (i = 0; i < h; i++) {
- line = data + wpl * i;
- for (j = 0; j < fullwords; j++)
- if (*line++) {
- *pempty = 0;
- return 0;
- }
- if (endbits) {
- if (*line & endmask) {
- *pempty = 0;
- return 0;
- }
- }
- }
-
- return 0;
-}
-
-
-/*!
- * \brief pixForegroundFraction()
- *
- * \param[in] pix 1 bpp
- * \param[out] pfract fraction of ON pixels
- * \return 0 if OK; 1 on error
- */
-l_ok
-pixForegroundFraction(PIX *pix,
- l_float32 *pfract)
-{
-l_int32 w, h, count;
-
- PROCNAME("pixForegroundFraction");
-
- if (!pfract)
- return ERROR_INT("&fract not defined", procName, 1);
- *pfract = 0.0;
- if (!pix || pixGetDepth(pix) != 1)
- return ERROR_INT("pix not defined or not 1 bpp", procName, 1);
-
- pixCountPixels(pix, &count, NULL);
- pixGetDimensions(pix, &w, &h, NULL);
- *pfract = (l_float32)count / (l_float32)(w * h);
- return 0;
-}
-
-
-/*!
- * \brief pixaCountPixels()
- *
- * \param[in] pixa array of 1 bpp pix
- * \return na of ON pixels in each pix, or NULL on error
- */
-NUMA *
-pixaCountPixels(PIXA *pixa)
-{
-l_int32 d, i, n, count;
-l_int32 *tab;
-NUMA *na;
-PIX *pix;
-
- PROCNAME("pixaCountPixels");
-
- if (!pixa)
- return (NUMA *)ERROR_PTR("pix not defined", procName, NULL);
-
- if ((n = pixaGetCount(pixa)) == 0)
- return numaCreate(1);
-
- pix = pixaGetPix(pixa, 0, L_CLONE);
- d = pixGetDepth(pix);
- pixDestroy(&pix);
- if (d != 1)
- return (NUMA *)ERROR_PTR("pixa not 1 bpp", procName, NULL);
-
- if ((na = numaCreate(n)) == NULL)
- return (NUMA *)ERROR_PTR("na not made", procName, NULL);
- tab = makePixelSumTab8();
- for (i = 0; i < n; i++) {
- pix = pixaGetPix(pixa, i, L_CLONE);
- pixCountPixels(pix, &count, tab);
- numaAddNumber(na, count);
- pixDestroy(&pix);
- }
-
- LEPT_FREE(tab);
- return na;
-}
-
-
-/*!
- * \brief pixCountPixels()
- *
- * \param[in] pixs 1 bpp
- * \param[out] pcount count of ON pixels
- * \param[in] tab8 [optional] 8-bit pixel lookup table
- * \return 0 if OK; 1 on error
- */
-l_ok
-pixCountPixels(PIX *pixs,
- l_int32 *pcount,
- l_int32 *tab8)
-{
-l_uint32 endmask;
-l_int32 w, h, wpl, i, j;
-l_int32 fullwords, endbits, sum;
-l_int32 *tab;
-l_uint32 *data;
-
- PROCNAME("pixCountPixels");
-
- if (!pcount)
- return ERROR_INT("&count not defined", procName, 1);
- *pcount = 0;
- if (!pixs || pixGetDepth(pixs) != 1)
- return ERROR_INT("pixs not defined or not 1 bpp", procName, 1);
-
- tab = (tab8) ? tab8 : makePixelSumTab8();
- pixGetDimensions(pixs, &w, &h, NULL);
- wpl = pixGetWpl(pixs);
- data = pixGetData(pixs);
- fullwords = w >> 5;
- endbits = w & 31;
- endmask = (endbits == 0) ? 0 : (0xffffffffU << (32 - endbits));
-
- sum = 0;
- for (i = 0; i < h; i++, data += wpl) {
- for (j = 0; j < fullwords; j++) {
- l_uint32 word = data[j];
- if (word) {
- sum += tab[word & 0xff] +
- tab[(word >> 8) & 0xff] +
- tab[(word >> 16) & 0xff] +
- tab[(word >> 24) & 0xff];
- }
- }
- if (endbits) {
- l_uint32 word = data[j] & endmask;
- if (word) {
- sum += tab[word & 0xff] +
- tab[(word >> 8) & 0xff] +
- tab[(word >> 16) & 0xff] +
- tab[(word >> 24) & 0xff];
- }
- }
- }
- *pcount = sum;
-
- if (!tab8) LEPT_FREE(tab);
- return 0;
-}
-
-
-/*!
- * \brief pixCountPixelsInRect()
- *
- * \param[in] pixs 1 bpp
- * \param[in] box (can be null)
- * \param[out] pcount count of ON pixels
- * \param[in] tab8 [optional] 8-bit pixel lookup table
- * \return 0 if OK; 1 on error
- */
-l_ok
-pixCountPixelsInRect(PIX *pixs,
- BOX *box,
- l_int32 *pcount,
- l_int32 *tab8)
-{
-l_int32 bx, by, bw, bh;
-PIX *pix1;
-
- PROCNAME("pixCountPixelsInRect");
-
- if (!pcount)
- return ERROR_INT("&count not defined", procName, 1);
- *pcount = 0;
- if (!pixs || pixGetDepth(pixs) != 1)
- return ERROR_INT("pixs not defined or not 1 bpp", procName, 1);
-
- if (box) {
- boxGetGeometry(box, &bx, &by, &bw, &bh);
- pix1 = pixCreate(bw, bh, 1);
- pixRasterop(pix1, 0, 0, bw, bh, PIX_SRC, pixs, bx, by);
- pixCountPixels(pix1, pcount, tab8);
- pixDestroy(&pix1);
- } else {
- pixCountPixels(pixs, pcount, tab8);
- }
-
- return 0;
-}
-
-
-/*!
- * \brief pixCountByRow()
- *
- * \param[in] pix 1 bpp
- * \param[in] box [optional] clipping box for count; can be null
- * \return na of number of ON pixels by row, or NULL on error
- *
- *
- * Notes:
- * (1) To resample for a bin size different from 1, use
- * numaUniformSampling() on the result of this function.
- *
- */
-NUMA *
-pixCountByRow(PIX *pix,
- BOX *box)
-{
-l_int32 i, j, w, h, wpl, count, xstart, xend, ystart, yend, bw, bh;
-l_uint32 *line, *data;
-NUMA *na;
-
- PROCNAME("pixCountByRow");
-
- if (!pix || pixGetDepth(pix) != 1)
- return (NUMA *)ERROR_PTR("pix undefined or not 1 bpp", procName, NULL);
- if (!box)
- return pixCountPixelsByRow(pix, NULL);
-
- pixGetDimensions(pix, &w, &h, NULL);
- if (boxClipToRectangleParams(box, w, h, &xstart, &ystart, &xend, ¥d,
- &bw, &bh) == 1)
- return (NUMA *)ERROR_PTR("invalid clipping box", procName, NULL);
-
- if ((na = numaCreate(bh)) == NULL)
- return (NUMA *)ERROR_PTR("na not made", procName, NULL);
- numaSetParameters(na, ystart, 1);
- data = pixGetData(pix);
- wpl = pixGetWpl(pix);
- for (i = ystart; i < yend; i++) {
- count = 0;
- line = data + i * wpl;
- for (j = xstart; j < xend; j++) {
- if (GET_DATA_BIT(line, j))
- count++;
- }
- numaAddNumber(na, count);
- }
-
- return na;
-}
-
-
-/*!
- * \brief pixCountByColumn()
- *
- * \param[in] pix 1 bpp
- * \param[in] box [optional] clipping box for count; can be null
- * \return na of number of ON pixels by column, or NULL on error
- *
- *
- * Notes:
- * (1) To resample for a bin size different from 1, use
- * numaUniformSampling() on the result of this function.
- *
- */
-NUMA *
-pixCountByColumn(PIX *pix,
- BOX *box)
-{
-l_int32 i, j, w, h, wpl, count, xstart, xend, ystart, yend, bw, bh;
-l_uint32 *line, *data;
-NUMA *na;
-
- PROCNAME("pixCountByColumn");
-
- if (!pix || pixGetDepth(pix) != 1)
- return (NUMA *)ERROR_PTR("pix undefined or not 1 bpp", procName, NULL);
- if (!box)
- return pixCountPixelsByColumn(pix);
-
- pixGetDimensions(pix, &w, &h, NULL);
- if (boxClipToRectangleParams(box, w, h, &xstart, &ystart, &xend, ¥d,
- &bw, &bh) == 1)
- return (NUMA *)ERROR_PTR("invalid clipping box", procName, NULL);
-
- if ((na = numaCreate(bw)) == NULL)
- return (NUMA *)ERROR_PTR("na not made", procName, NULL);
- numaSetParameters(na, xstart, 1);
- data = pixGetData(pix);
- wpl = pixGetWpl(pix);
- for (j = xstart; j < xend; j++) {
- count = 0;
- for (i = ystart; i < yend; i++) {
- line = data + i * wpl;
- if (GET_DATA_BIT(line, j))
- count++;
- }
- numaAddNumber(na, count);
- }
-
- return na;
-}
-
-
-/*!
- * \brief pixCountPixelsByRow()
- *
- * \param[in] pix 1 bpp
- * \param[in] tab8 [optional] 8-bit pixel lookup table
- * \return na of counts, or NULL on error
- */
-NUMA *
-pixCountPixelsByRow(PIX *pix,
- l_int32 *tab8)
-{
-l_int32 h, i, count;
-l_int32 *tab;
-NUMA *na;
-
- PROCNAME("pixCountPixelsByRow");
-
- if (!pix || pixGetDepth(pix) != 1)
- return (NUMA *)ERROR_PTR("pix undefined or not 1 bpp", procName, NULL);
-
- h = pixGetHeight(pix);
- if ((na = numaCreate(h)) == NULL)
- return (NUMA *)ERROR_PTR("na not made", procName, NULL);
-
- tab = (tab8) ? tab8 : makePixelSumTab8();
- for (i = 0; i < h; i++) {
- pixCountPixelsInRow(pix, i, &count, tab);
- numaAddNumber(na, count);
- }
-
- if (!tab8) LEPT_FREE(tab);
- return na;
-}
-
-
-/*!
- * \brief pixCountPixelsByColumn()
- *
- * \param[in] pix 1 bpp
- * \return na of counts in each column, or NULL on error
- */
-NUMA *
-pixCountPixelsByColumn(PIX *pix)
-{
-l_int32 i, j, w, h, wpl;
-l_uint32 *line, *data;
-l_float32 *array;
-NUMA *na;
-
- PROCNAME("pixCountPixelsByColumn");
-
- if (!pix || pixGetDepth(pix) != 1)
- return (NUMA *)ERROR_PTR("pix undefined or not 1 bpp", procName, NULL);
-
- pixGetDimensions(pix, &w, &h, NULL);
- if ((na = numaCreate(w)) == NULL)
- return (NUMA *)ERROR_PTR("na not made", procName, NULL);
- numaSetCount(na, w);
- array = numaGetFArray(na, L_NOCOPY);
- data = pixGetData(pix);
- wpl = pixGetWpl(pix);
- for (i = 0; i < h; i++) {
- line = data + wpl * i;
- for (j = 0; j < w; j++) {
- if (GET_DATA_BIT(line, j))
- array[j] += 1.0;
- }
- }
-
- return na;
-}
-
-
-/*!
- * \brief pixCountPixelsInRow()
- *
- * \param[in] pix 1 bpp
- * \param[in] row number
- * \param[out] pcount sum of ON pixels in raster line
- * \param[in] tab8 [optional] 8-bit pixel lookup table
- * \return 0 if OK; 1 on error
- */
-l_ok
-pixCountPixelsInRow(PIX *pix,
- l_int32 row,
- l_int32 *pcount,
- l_int32 *tab8)
-{
-l_uint32 word, endmask;
-l_int32 j, w, h, wpl;
-l_int32 fullwords, endbits, sum;
-l_int32 *tab;
-l_uint32 *line;
-
- PROCNAME("pixCountPixelsInRow");
-
- if (!pcount)
- return ERROR_INT("&count not defined", procName, 1);
- *pcount = 0;
- if (!pix || pixGetDepth(pix) != 1)
- return ERROR_INT("pix not defined or not 1 bpp", procName, 1);
-
- pixGetDimensions(pix, &w, &h, NULL);
- if (row < 0 || row >= h)
- return ERROR_INT("row out of bounds", procName, 1);
- wpl = pixGetWpl(pix);
- line = pixGetData(pix) + row * wpl;
- fullwords = w >> 5;
- endbits = w & 31;
- endmask = (endbits == 0) ? 0 : (0xffffffffU << (32 - endbits));
-
- tab = (tab8) ? tab8 : makePixelSumTab8();
- sum = 0;
- for (j = 0; j < fullwords; j++) {
- word = line[j];
- if (word) {
- sum += tab[word & 0xff] +
- tab[(word >> 8) & 0xff] +
- tab[(word >> 16) & 0xff] +
- tab[(word >> 24) & 0xff];
- }
- }
- if (endbits) {
- word = line[j] & endmask;
- if (word) {
- sum += tab[word & 0xff] +
- tab[(word >> 8) & 0xff] +
- tab[(word >> 16) & 0xff] +
- tab[(word >> 24) & 0xff];
- }
- }
- *pcount = sum;
-
- if (!tab8) LEPT_FREE(tab);
- return 0;
-}
-
-
-/*!
- * \brief pixGetMomentByColumn()
- *
- * \param[in] pix 1 bpp
- * \param[in] order of moment, either 1 or 2
- * \return na of first moment of fg pixels, by column, or NULL on error
- */
-NUMA *
-pixGetMomentByColumn(PIX *pix,
- l_int32 order)
-{
-l_int32 i, j, w, h, wpl;
-l_uint32 *line, *data;
-l_float32 *array;
-NUMA *na;
-
- PROCNAME("pixGetMomentByColumn");
-
- if (!pix || pixGetDepth(pix) != 1)
- return (NUMA *)ERROR_PTR("pix undefined or not 1 bpp", procName, NULL);
- if (order != 1 && order != 2)
- return (NUMA *)ERROR_PTR("order of moment not 1 or 2", procName, NULL);
-
- pixGetDimensions(pix, &w, &h, NULL);
- if ((na = numaCreate(w)) == NULL)
- return (NUMA *)ERROR_PTR("na not made", procName, NULL);
- numaSetCount(na, w);
- array = numaGetFArray(na, L_NOCOPY);
- data = pixGetData(pix);
- wpl = pixGetWpl(pix);
- for (i = 0; i < h; i++) {
- line = data + wpl * i;
- for (j = 0; j < w; j++) {
- if (GET_DATA_BIT(line, j)) {
- if (order == 1)
- array[j] += i;
- else /* order == 2 */
- array[j] += i * i;
- }
- }
- }
-
- return na;
-}
-
-
-/*!
- * \brief pixThresholdPixelSum()
- *
- * \param[in] pix 1 bpp
- * \param[in] thresh threshold
- * \param[out] pabove 1 if above threshold;
- * 0 if equal to or less than threshold
- * \param[in] tab8 [optional] 8-bit pixel lookup table
- * \return 0 if OK; 1 on error
- *
- *
- * Notes:
- * (1) This sums the ON pixels and returns immediately if the count
- * goes above threshold. It is therefore more efficient
- * for matching images (by running this function on the xor of
- * the 2 images) than using pixCountPixels(), which counts all
- * pixels before returning.
- *
- */
-l_ok
-pixThresholdPixelSum(PIX *pix,
- l_int32 thresh,
- l_int32 *pabove,
- l_int32 *tab8)
-{
-l_uint32 word, endmask;
-l_int32 *tab;
-l_int32 w, h, wpl, i, j;
-l_int32 fullwords, endbits, sum;
-l_uint32 *line, *data;
-
- PROCNAME("pixThresholdPixelSum");
-
- if (!pabove)
- return ERROR_INT("&above not defined", procName, 1);
- *pabove = 0;
- if (!pix || pixGetDepth(pix) != 1)
- return ERROR_INT("pix not defined or not 1 bpp", procName, 1);
-
- tab = (tab8) ? tab8 : makePixelSumTab8();
- pixGetDimensions(pix, &w, &h, NULL);
- wpl = pixGetWpl(pix);
- data = pixGetData(pix);
- fullwords = w >> 5;
- endbits = w & 31;
- endmask = 0xffffffff << (32 - endbits);
-
- sum = 0;
- for (i = 0; i < h; i++) {
- line = data + wpl * i;
- for (j = 0; j < fullwords; j++) {
- word = line[j];
- if (word) {
- sum += tab[word & 0xff] +
- tab[(word >> 8) & 0xff] +
- tab[(word >> 16) & 0xff] +
- tab[(word >> 24) & 0xff];
- }
- }
- if (endbits) {
- word = line[j] & endmask;
- if (word) {
- sum += tab[word & 0xff] +
- tab[(word >> 8) & 0xff] +
- tab[(word >> 16) & 0xff] +
- tab[(word >> 24) & 0xff];
- }
- }
- if (sum > thresh) {
- *pabove = 1;
- if (!tab8) LEPT_FREE(tab);
- return 0;
- }
- }
-
- if (!tab8) LEPT_FREE(tab);
- return 0;
-}
-
-
-/*!
- * \brief makePixelSumTab8()
- *
- * \return table of 256 l_int32.
- *
- *
- * Notes:
- * (1) This table of integers gives the number of 1 bits
- * in the 8 bit index.
- *
- */
-l_int32 *
-makePixelSumTab8(void)
-{
-l_uint8 byte;
-l_int32 i;
-l_int32 *tab;
-
- tab = (l_int32 *)LEPT_CALLOC(256, sizeof(l_int32));
- for (i = 0; i < 256; i++) {
- byte = (l_uint8)i;
- tab[i] = (byte & 0x1) +
- ((byte >> 1) & 0x1) +
- ((byte >> 2) & 0x1) +
- ((byte >> 3) & 0x1) +
- ((byte >> 4) & 0x1) +
- ((byte >> 5) & 0x1) +
- ((byte >> 6) & 0x1) +
- ((byte >> 7) & 0x1);
- }
- return tab;
-}
-
-
-/*!
- * \brief makePixelCentroidTab8()
- *
- * \return table of 256 l_int32.
- *
- *
- * Notes:
- * (1) This table of integers gives the centroid weight of the 1 bits
- * in the 8 bit index. In other words, if sumtab is obtained by
- * makePixelSumTab8, and centroidtab is obtained by
- * makePixelCentroidTab8, then, for 1 <= i <= 255,
- * centroidtab[i] / (float)sumtab[i]
- * is the centroid of the 1 bits in the 8-bit index i, where the
- * MSB is considered to have position 0 and the LSB is considered
- * to have position 7.
- *
- */
-l_int32 *
-makePixelCentroidTab8(void)
-{
-l_int32 i;
-l_int32 *tab;
-
- tab = (l_int32 *)LEPT_CALLOC(256, sizeof(l_int32));
- tab[0] = 0;
- tab[1] = 7;
- for (i = 2; i < 4; i++) {
- tab[i] = tab[i - 2] + 6;
- }
- for (i = 4; i < 8; i++) {
- tab[i] = tab[i - 4] + 5;
- }
- for (i = 8; i < 16; i++) {
- tab[i] = tab[i - 8] + 4;
- }
- for (i = 16; i < 32; i++) {
- tab[i] = tab[i - 16] + 3;
- }
- for (i = 32; i < 64; i++) {
- tab[i] = tab[i - 32] + 2;
- }
- for (i = 64; i < 128; i++) {
- tab[i] = tab[i - 64] + 1;
- }
- for (i = 128; i < 256; i++) {
- tab[i] = tab[i - 128];
- }
- return tab;
-}
-
-
-/*-------------------------------------------------------------*
- * Average of pixel values in gray images *
- *-------------------------------------------------------------*/
-/*!
- * \brief pixAverageByRow()
- *
- * \param[in] pix 8 or 16 bpp; no colormap
- * \param[in] box [optional] clipping box for sum; can be null
- * \param[in] type L_WHITE_IS_MAX, L_BLACK_IS_MAX
- * \return na of pixel averages by row, or NULL on error
- *
- *
- * Notes:
- * (1) To resample for a bin size different from 1, use
- * numaUniformSampling() on the result of this function.
- * (2) If type == L_BLACK_IS_MAX, black pixels get the maximum
- * value (0xff for 8 bpp, 0xffff for 16 bpp) and white get 0.
- *
- */
-NUMA *
-pixAverageByRow(PIX *pix,
- BOX *box,
- l_int32 type)
-{
-l_int32 i, j, w, h, d, wpl, xstart, xend, ystart, yend, bw, bh;
-l_uint32 *line, *data;
-l_float64 norm, sum;
-NUMA *na;
-
- PROCNAME("pixAverageByRow");
-
- if (!pix)
- return (NUMA *)ERROR_PTR("pix not defined", procName, NULL);
- pixGetDimensions(pix, &w, &h, &d);
- if (d != 8 && d != 16)
- return (NUMA *)ERROR_PTR("pix not 8 or 16 bpp", procName, NULL);
- if (type != L_WHITE_IS_MAX && type != L_BLACK_IS_MAX)
- return (NUMA *)ERROR_PTR("invalid type", procName, NULL);
- if (pixGetColormap(pix) != NULL)
- return (NUMA *)ERROR_PTR("pix colormapped", procName, NULL);
-
- if (boxClipToRectangleParams(box, w, h, &xstart, &ystart, &xend, ¥d,
- &bw, &bh) == 1)
- return (NUMA *)ERROR_PTR("invalid clipping box", procName, NULL);
-
- norm = 1. / (l_float32)bw;
- if ((na = numaCreate(bh)) == NULL)
- return (NUMA *)ERROR_PTR("na not made", procName, NULL);
- numaSetParameters(na, ystart, 1);
- data = pixGetData(pix);
- wpl = pixGetWpl(pix);
- for (i = ystart; i < yend; i++) {
- sum = 0.0;
- line = data + i * wpl;
- if (d == 8) {
- for (j = xstart; j < xend; j++)
- sum += GET_DATA_BYTE(line, j);
- if (type == L_BLACK_IS_MAX)
- sum = bw * 255 - sum;
- } else { /* d == 16 */
- for (j = xstart; j < xend; j++)
- sum += GET_DATA_TWO_BYTES(line, j);
- if (type == L_BLACK_IS_MAX)
- sum = bw * 0xffff - sum;
- }
- numaAddNumber(na, (l_float32)(norm * sum));
- }
-
- return na;
-}
-
-
-/*!
- * \brief pixAverageByColumn()
- *
- * \param[in] pix 8 or 16 bpp; no colormap
- * \param[in] box [optional] clipping box for sum; can be null
- * \param[in] type L_WHITE_IS_MAX, L_BLACK_IS_MAX
- * \return na of pixel averages by column, or NULL on error
- *
- *
- * Notes:
- * (1) To resample for a bin size different from 1, use
- * numaUniformSampling() on the result of this function.
- * (2) If type == L_BLACK_IS_MAX, black pixels get the maximum
- * value (0xff for 8 bpp, 0xffff for 16 bpp) and white get 0.
- *
- */
-NUMA *
-pixAverageByColumn(PIX *pix,
- BOX *box,
- l_int32 type)
-{
-l_int32 i, j, w, h, d, wpl, xstart, xend, ystart, yend, bw, bh;
-l_uint32 *line, *data;
-l_float32 norm, sum;
-NUMA *na;
-
- PROCNAME("pixAverageByColumn");
-
- if (!pix)
- return (NUMA *)ERROR_PTR("pix not defined", procName, NULL);
- pixGetDimensions(pix, &w, &h, &d);
-
- if (d != 8 && d != 16)
- return (NUMA *)ERROR_PTR("pix not 8 or 16 bpp", procName, NULL);
- if (type != L_WHITE_IS_MAX && type != L_BLACK_IS_MAX)
- return (NUMA *)ERROR_PTR("invalid type", procName, NULL);
- if (pixGetColormap(pix) != NULL)
- return (NUMA *)ERROR_PTR("pix colormapped", procName, NULL);
-
- if (boxClipToRectangleParams(box, w, h, &xstart, &ystart, &xend, ¥d,
- &bw, &bh) == 1)
- return (NUMA *)ERROR_PTR("invalid clipping box", procName, NULL);
-
- if ((na = numaCreate(bw)) == NULL)
- return (NUMA *)ERROR_PTR("na not made", procName, NULL);
- numaSetParameters(na, xstart, 1);
- norm = 1. / (l_float32)bh;
- data = pixGetData(pix);
- wpl = pixGetWpl(pix);
- for (j = xstart; j < xend; j++) {
- sum = 0.0;
- if (d == 8) {
- for (i = ystart; i < yend; i++) {
- line = data + i * wpl;
- sum += GET_DATA_BYTE(line, j);
- }
- if (type == L_BLACK_IS_MAX)
- sum = bh * 255 - sum;
- } else { /* d == 16 */
- for (i = ystart; i < yend; i++) {
- line = data + i * wpl;
- sum += GET_DATA_TWO_BYTES(line, j);
- }
- if (type == L_BLACK_IS_MAX)
- sum = bh * 0xffff - sum;
- }
- numaAddNumber(na, (l_float32)(norm * sum));
- }
-
- return na;
-}
-
-
-/*!
- * \brief pixAverageInRect()
- *
- * \param[in] pixs 1, 2, 4, 8 bpp; not cmapped
- * \param[in] pixm [optional] 1 bpp mask; if null, use all pixels
- * \param[in] box [optional] if null, use entire image
- * \param[in] minval ignore values less than this
- * \param[in] maxval ignore values greater than this
- * \param[in] subsamp subsample factor: integer; use 1 for all pixels
- * \param[out] pave average of pixel values under consideration
- * \return 0 if OK; 1 on error; 2 if all pixels are filtered out
- *
- *
- * Notes:
- * (1) The average is computed with 4 optional filters: a rectangle,
- * a mask, a contiguous set of range values, and subsampling.
- * In practice you might use only one or two of these.
- * (2) The mask %pixm is a blocking mask: only count pixels in the bg.
- * If it exists, alignment is assumed at UL corner and computation
- * is over the minimum intersection of %pixs and %pixm.
- * If you want the average of pixels under the mask fg, invert it.
- * (3) Set the range limits %minval = 0 and %maxval = 255 to use
- * all non-masked pixels (regardless of value) in the average.
- * (4) If no pixels are used in the averaging, the returned average
- * value is 0 and the function returns 2. This is not an error,
- * but it says to disregard the returned average value.
- * (5) For example, to average all pixels in a given clipping rect %box,
- * pixAverageInRect(pixs, NULL, box, 0, 255, 1, &aveval);
- *
- */
-l_ok
-pixAverageInRect(PIX *pixs,
- PIX *pixm,
- BOX *box,
- l_int32 minval,
- l_int32 maxval,
- l_int32 subsamp,
- l_float32 *pave)
-{
-l_int32 w, h, d, wpls, wm, hm, dm, wplm, val, count;
-l_int32 i, j, xstart, xend, ystart, yend;
-l_uint32 *datas, *datam, *lines, *linem;
-l_float32 ave;
-l_float64 sum;
-
- PROCNAME("pixAverageInRect");
-
- if (!pave)
- return ERROR_INT("&ave not defined", procName, 1);
- *pave = 0;
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
- if (pixGetColormap(pixs) != NULL)
- return ERROR_INT("pixs is colormapped", procName, 1);
- pixGetDimensions(pixs, &w, &h, &d);
- if (d != 1 && d != 2 && d != 4 && d != 8)
- return ERROR_INT("pixs not 1, 2, 4 or 8 bpp", procName, 1);
- if (pixm) {
- pixGetDimensions(pixm, &wm, &hm, &dm);
- if (dm != 1)
- return ERROR_INT("pixm not 1 bpp", procName, 1);
- w = L_MIN(w, wm);
- h = L_MIN(h, hm);
- }
- if (subsamp < 1)
- return ERROR_INT("subsamp must be >= 1", procName, 1);
-
- if (boxClipToRectangleParams(box, w, h, &xstart, &ystart, &xend, ¥d,
- NULL, NULL) == 1)
- return ERROR_INT("invalid clipping box", procName, 1);
-
- datas = pixGetData(pixs);
- wpls = pixGetWpl(pixs);
- if (pixm) {
- datam = pixGetData(pixm);
- wplm = pixGetWpl(pixm);
- }
- sum = 0.0;
- count = 0;
- for (i = ystart; i < yend; i += subsamp) {
- lines = datas + i * wpls;
- if (pixm)
- linem = datam + i * wplm;
- for (j = xstart; j < xend; j += subsamp) {
- if (pixm && (GET_DATA_BIT(linem, j) == 1))
- continue;
- if (d == 1)
- val = GET_DATA_BIT(lines, j);
- else if (d == 2)
- val = GET_DATA_DIBIT(lines, j);
- else if (d == 4)
- val = GET_DATA_QBIT(lines, j);
- else /* d == 8 */
- val = GET_DATA_BYTE(lines, j);
- if (val >= minval && val <= maxval) {
- sum += val;
- count++;
- }
- }
- }
-
- if (count == 0)
- return 2; /* not an error; don't use the average value (0.0) */
- *pave = sum / (l_float32)count;
- return 0;
-}
-
-
-/*-------------------------------------------------------------*
- * Average of pixel values in RGB images *
- *-------------------------------------------------------------*/
-/*!
- * \brief pixAverageInRectRGB()
- *
- * \param[in] pixs rgb; not cmapped
- * \param[in] pixm [optional] 1 bpp mask; if null, use all pixels
- * \param[in] box [optional] if null, use entire image
- * \param[in] subsamp subsample factor: integer; use 1 for all pixels
- * \param[out] pave average color of pixel values under consideration,
- * in format 0xrrggbb00.
- * \return 0 if OK; 1 on error; 2 if all pixels are filtered out
- *
- *
- * Notes:
- * (1) The average is computed with 3 optional filters: a rectangle,
- * a mask, and subsampling.
- * In practice you might use only one or two of these.
- * (2) The mask %pixm is a blocking mask: only count pixels in the bg.
- * If it exists, alignment is assumed at UL corner and computation
- * is over the minimum intersection of %pixs and %pixm.
- * If you want the average of pixels under the mask fg, invert it.
- * (3) If no pixels are used in the averaging, the returned average
- * value is 0 and the function returns 2. This is not an error,
- * but it says to disregard the returned average value.
- * (4) For example, to average all pixels in a given clipping rect %box,
- * pixAverageInRectRGB(pixs, NULL, box, 1, &aveval);
- *
- */
-l_ok
-pixAverageInRectRGB(PIX *pixs,
- PIX *pixm,
- BOX *box,
- l_int32 subsamp,
- l_uint32 *pave)
-{
-l_int32 w, h, wpls, wm, hm, dm, wplm, i, j, xstart, xend, ystart, yend;
-l_int32 rval, gval, bval, rave, gave, bave, count;
-l_uint32 *datas, *datam, *lines, *linem;
-l_uint32 pixel;
-l_float64 rsum, gsum, bsum;
-
- PROCNAME("pixAverageInRectRGB");
-
- if (!pave)
- return ERROR_INT("&ave not defined", procName, 1);
- *pave = 0;
- if (!pixs || pixGetDepth(pixs) != 32)
- return ERROR_INT("pixs undefined or not 32 bpp", procName, 1);
- pixGetDimensions(pixs, &w, &h, NULL);
- if (pixm) {
- pixGetDimensions(pixm, &wm, &hm, &dm);
- if (dm != 1)
- return ERROR_INT("pixm not 1 bpp", procName, 1);
- w = L_MIN(w, wm);
- h = L_MIN(h, hm);
- }
- if (subsamp < 1)
- return ERROR_INT("subsamp must be >= 1", procName, 1);
-
- if (boxClipToRectangleParams(box, w, h, &xstart, &ystart, &xend, ¥d,
- NULL, NULL) == 1)
- return ERROR_INT("invalid clipping box", procName, 1);
-
- datas = pixGetData(pixs);
- wpls = pixGetWpl(pixs);
- if (pixm) {
- datam = pixGetData(pixm);
- wplm = pixGetWpl(pixm);
- }
- rsum = gsum = bsum = 0.0;
- count = 0;
- for (i = ystart; i < yend; i += subsamp) {
- lines = datas + i * wpls;
- if (pixm)
- linem = datam + i * wplm;
- for (j = xstart; j < xend; j += subsamp) {
- if (pixm && (GET_DATA_BIT(linem, j) == 1))
- continue;
- pixel = *(lines + j);
- extractRGBValues(pixel, &rval, &gval, &bval);
- rsum += rval;
- gsum += gval;
- bsum += bval;
- count++;
- }
- }
-
- if (count == 0)
- return 2; /* not an error */
- rave = (l_uint32)(rsum / (l_float64)count);
- gave = (l_uint32)(gsum / (l_float64)count);
- bave = (l_uint32)(bsum / (l_float64)count);
- composeRGBPixel(rave, gave, bave, pave);
- return 0;
-}
-
-
-/*------------------------------------------------------------------*
- * Variance of pixel values in gray images *
- *------------------------------------------------------------------*/
-/*!
- * \brief pixVarianceByRow()
- *
- * \param[in] pix 8 or 16 bpp; no colormap
- * \param[in] box [optional] clipping box for variance; can be null
- * \return na of rmsdev by row, or NULL on error
- *
- *
- * Notes:
- * (1) To resample for a bin size different from 1, use
- * numaUniformSampling() on the result of this function.
- * (2) We are actually computing the RMS deviation in each row.
- * This is the square root of the variance.
- *
- */
-NUMA *
-pixVarianceByRow(PIX *pix,
- BOX *box)
-{
-l_int32 i, j, w, h, d, wpl, xstart, xend, ystart, yend, bw, bh, val;
-l_uint32 *line, *data;
-l_float64 sum1, sum2, norm, ave, var, rootvar;
-NUMA *na;
-
- PROCNAME("pixVarianceByRow");
-
- if (!pix)
- return (NUMA *)ERROR_PTR("pix not defined", procName, NULL);
- pixGetDimensions(pix, &w, &h, &d);
- if (d != 8 && d != 16)
- return (NUMA *)ERROR_PTR("pix not 8 or 16 bpp", procName, NULL);
- if (pixGetColormap(pix) != NULL)
- return (NUMA *)ERROR_PTR("pix colormapped", procName, NULL);
-
- if (boxClipToRectangleParams(box, w, h, &xstart, &ystart, &xend, ¥d,
- &bw, &bh) == 1)
- return (NUMA *)ERROR_PTR("invalid clipping box", procName, NULL);
-
- if ((na = numaCreate(bh)) == NULL)
- return (NUMA *)ERROR_PTR("na not made", procName, NULL);
- numaSetParameters(na, ystart, 1);
- norm = 1. / (l_float32)bw;
- data = pixGetData(pix);
- wpl = pixGetWpl(pix);
- for (i = ystart; i < yend; i++) {
- sum1 = sum2 = 0.0;
- line = data + i * wpl;
- for (j = xstart; j < xend; j++) {
- if (d == 8)
- val = GET_DATA_BYTE(line, j);
- else /* d == 16 */
- val = GET_DATA_TWO_BYTES(line, j);
- sum1 += val;
- sum2 += (l_float64)(val) * val;
- }
- ave = norm * sum1;
- var = norm * sum2 - ave * ave;
- rootvar = sqrt(var);
- numaAddNumber(na, (l_float32)rootvar);
- }
-
- return na;
-}
-
-
-/*!
- * \brief pixVarianceByColumn()
- *
- * \param[in] pix 8 or 16 bpp; no colormap
- * \param[in] box [optional] clipping box for variance; can be null
- * \return na of rmsdev by column, or NULL on error
- *
- *
- * Notes:
- * (1) To resample for a bin size different from 1, use
- * numaUniformSampling() on the result of this function.
- * (2) We are actually computing the RMS deviation in each row.
- * This is the square root of the variance.
- *
- */
-NUMA *
-pixVarianceByColumn(PIX *pix,
- BOX *box)
-{
-l_int32 i, j, w, h, d, wpl, xstart, xend, ystart, yend, bw, bh, val;
-l_uint32 *line, *data;
-l_float64 sum1, sum2, norm, ave, var, rootvar;
-NUMA *na;
-
- PROCNAME("pixVarianceByColumn");
-
- if (!pix)
- return (NUMA *)ERROR_PTR("pix not defined", procName, NULL);
- pixGetDimensions(pix, &w, &h, &d);
- if (d != 8 && d != 16)
- return (NUMA *)ERROR_PTR("pix not 8 or 16 bpp", procName, NULL);
- if (pixGetColormap(pix) != NULL)
- return (NUMA *)ERROR_PTR("pix colormapped", procName, NULL);
-
- if (boxClipToRectangleParams(box, w, h, &xstart, &ystart, &xend, ¥d,
- &bw, &bh) == 1)
- return (NUMA *)ERROR_PTR("invalid clipping box", procName, NULL);
-
- if ((na = numaCreate(bw)) == NULL)
- return (NUMA *)ERROR_PTR("na not made", procName, NULL);
- numaSetParameters(na, xstart, 1);
- norm = 1. / (l_float32)bh;
- data = pixGetData(pix);
- wpl = pixGetWpl(pix);
- for (j = xstart; j < xend; j++) {
- sum1 = sum2 = 0.0;
- for (i = ystart; i < yend; i++) {
- line = data + wpl * i;
- if (d == 8)
- val = GET_DATA_BYTE(line, j);
- else /* d == 16 */
- val = GET_DATA_TWO_BYTES(line, j);
- sum1 += val;
- sum2 += (l_float64)(val) * val;
- }
- ave = norm * sum1;
- var = norm * sum2 - ave * ave;
- rootvar = sqrt(var);
- numaAddNumber(na, (l_float32)rootvar);
- }
-
- return na;
-}
-
-
-/*!
- * \brief pixVarianceInRect()
- *
- * \param[in] pix 1, 2, 4, 8 bpp; not cmapped
- * \param[in] box [optional] if null, use entire image
- * \param[out] prootvar sqrt variance of pixel values in region
- * \return 0 if OK; 1 on error
- */
-l_ok
-pixVarianceInRect(PIX *pix,
- BOX *box,
- l_float32 *prootvar)
-{
-l_int32 w, h, d, wpl, i, j, xstart, xend, ystart, yend, bw, bh, val;
-l_uint32 *data, *line;
-l_float64 sum1, sum2, norm, ave, var;
-
- PROCNAME("pixVarianceInRect");
-
- if (!prootvar)
- return ERROR_INT("&rootvar not defined", procName, 1);
- *prootvar = 0.0;
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
- pixGetDimensions(pix, &w, &h, &d);
- if (d != 1 && d != 2 && d != 4 && d != 8)
- return ERROR_INT("pix not 1, 2, 4 or 8 bpp", procName, 1);
- if (pixGetColormap(pix) != NULL)
- return ERROR_INT("pix is colormapped", procName, 1);
-
- if (boxClipToRectangleParams(box, w, h, &xstart, &ystart, &xend, ¥d,
- &bw, &bh) == 1)
- return ERROR_INT("invalid clipping box", procName, 1);
-
- wpl = pixGetWpl(pix);
- data = pixGetData(pix);
- sum1 = sum2 = 0.0;
- for (i = ystart; i < yend; i++) {
- line = data + i * wpl;
- for (j = xstart; j < xend; j++) {
- if (d == 1) {
- val = GET_DATA_BIT(line, j);
- sum1 += val;
- sum2 += (l_float64)(val) * val;
- } else if (d == 2) {
- val = GET_DATA_DIBIT(line, j);
- sum1 += val;
- sum2 += (l_float64)(val) * val;
- } else if (d == 4) {
- val = GET_DATA_QBIT(line, j);
- sum1 += val;
- sum2 += (l_float64)(val) * val;
- } else { /* d == 8 */
- val = GET_DATA_BYTE(line, j);
- sum1 += val;
- sum2 += (l_float64)(val) * val;
- }
- }
- }
- norm = 1.0 / ((l_float64)(bw) * bh);
- ave = norm * sum1;
- var = norm * sum2 - ave * ave;
- *prootvar = (l_float32)sqrt(var);
- return 0;
-}
-
-
-/*---------------------------------------------------------------------*
- * Average of absolute value of pixel differences in gray images *
- *---------------------------------------------------------------------*/
-/*!
- * \brief pixAbsDiffByRow()
- *
- * \param[in] pix 8 bpp; no colormap
- * \param[in] box [optional] clipping box for region; can be null
- * \return na of abs val pixel difference averages by row, or NULL on error
- *
- *
- * Notes:
- * (1) This is an average over differences of adjacent pixels along
- * each row.
- * (2) To resample for a bin size different from 1, use
- * numaUniformSampling() on the result of this function.
- *
- */
-NUMA *
-pixAbsDiffByRow(PIX *pix,
- BOX *box)
-{
-l_int32 i, j, w, h, wpl, xstart, xend, ystart, yend, bw, bh, val0, val1;
-l_uint32 *line, *data;
-l_float64 norm, sum;
-NUMA *na;
-
- PROCNAME("pixAbsDiffByRow");
-
- if (!pix || pixGetDepth(pix) != 8)
- return (NUMA *)ERROR_PTR("pix undefined or not 8 bpp", procName, NULL);
- if (pixGetColormap(pix) != NULL)
- return (NUMA *)ERROR_PTR("pix colormapped", procName, NULL);
-
- pixGetDimensions(pix, &w, &h, NULL);
- if (boxClipToRectangleParams(box, w, h, &xstart, &ystart, &xend, ¥d,
- &bw, &bh) == 1)
- return (NUMA *)ERROR_PTR("invalid clipping box", procName, NULL);
- if (bw < 2)
- return (NUMA *)ERROR_PTR("row width must be >= 2", procName, NULL);
-
- norm = 1. / (l_float32)(bw - 1);
- if ((na = numaCreate(bh)) == NULL)
- return (NUMA *)ERROR_PTR("na not made", procName, NULL);
- numaSetParameters(na, ystart, 1);
- data = pixGetData(pix);
- wpl = pixGetWpl(pix);
- for (i = ystart; i < yend; i++) {
- sum = 0.0;
- line = data + i * wpl;
- val0 = GET_DATA_BYTE(line, xstart);
- for (j = xstart + 1; j < xend; j++) {
- val1 = GET_DATA_BYTE(line, j);
- sum += L_ABS(val1 - val0);
- val0 = val1;
- }
- numaAddNumber(na, (l_float32)(norm * sum));
- }
-
- return na;
-}
-
-
-/*!
- * \brief pixAbsDiffByColumn()
- *
- * \param[in] pix 8 bpp; no colormap
- * \param[in] box [optional] clipping box for region; can be null
- * \return na of abs val pixel difference averages by column,
- * or NULL on error
- *
- *
- * Notes:
- * (1) This is an average over differences of adjacent pixels along
- * each column.
- * (2) To resample for a bin size different from 1, use
- * numaUniformSampling() on the result of this function.
- *
- */
-NUMA *
-pixAbsDiffByColumn(PIX *pix,
- BOX *box)
-{
-l_int32 i, j, w, h, wpl, xstart, xend, ystart, yend, bw, bh, val0, val1;
-l_uint32 *line, *data;
-l_float64 norm, sum;
-NUMA *na;
-
- PROCNAME("pixAbsDiffByColumn");
-
- if (!pix || pixGetDepth(pix) != 8)
- return (NUMA *)ERROR_PTR("pix undefined or not 8 bpp", procName, NULL);
- if (pixGetColormap(pix) != NULL)
- return (NUMA *)ERROR_PTR("pix colormapped", procName, NULL);
-
- pixGetDimensions(pix, &w, &h, NULL);
- if (boxClipToRectangleParams(box, w, h, &xstart, &ystart, &xend, ¥d,
- &bw, &bh) == 1)
- return (NUMA *)ERROR_PTR("invalid clipping box", procName, NULL);
- if (bh < 2)
- return (NUMA *)ERROR_PTR("column height must be >= 2", procName, NULL);
-
- norm = 1. / (l_float32)(bh - 1);
- if ((na = numaCreate(bw)) == NULL)
- return (NUMA *)ERROR_PTR("na not made", procName, NULL);
- numaSetParameters(na, xstart, 1);
- data = pixGetData(pix);
- wpl = pixGetWpl(pix);
- for (j = xstart; j < xend; j++) {
- sum = 0.0;
- line = data + ystart * wpl;
- val0 = GET_DATA_BYTE(line, j);
- for (i = ystart + 1; i < yend; i++) {
- line = data + i * wpl;
- val1 = GET_DATA_BYTE(line, j);
- sum += L_ABS(val1 - val0);
- val0 = val1;
- }
- numaAddNumber(na, (l_float32)(norm * sum));
- }
-
- return na;
-}
-
-
-/*!
- * \brief pixAbsDiffInRect()
- *
- * \param[in] pix 8 bpp; not cmapped
- * \param[in] box [optional] if null, use entire image
- * \param[in] dir differences along L_HORIZONTAL_LINE or L_VERTICAL_LINE
- * \param[out] pabsdiff average of abs diff pixel values in region
- * \return 0 if OK; 1 on error
- *
- *
- * Notes:
- * (1) This gives the average over the abs val of differences of
- * adjacent pixels values, along either each
- * row: dir == L_HORIZONTAL_LINE
- * column: dir == L_VERTICAL_LINE
- *
- */
-l_ok
-pixAbsDiffInRect(PIX *pix,
- BOX *box,
- l_int32 dir,
- l_float32 *pabsdiff)
-{
-l_int32 w, h, wpl, i, j, xstart, xend, ystart, yend, bw, bh, val0, val1;
-l_uint32 *data, *line;
-l_float64 norm, sum;
-
- PROCNAME("pixAbsDiffInRect");
-
- if (!pabsdiff)
- return ERROR_INT("&absdiff not defined", procName, 1);
- *pabsdiff = 0.0;
- if (!pix || pixGetDepth(pix) != 8)
- return ERROR_INT("pix undefined or not 8 bpp", procName, 1);
- if (dir != L_HORIZONTAL_LINE && dir != L_VERTICAL_LINE)
- return ERROR_INT("invalid direction", procName, 1);
- if (pixGetColormap(pix) != NULL)
- return ERROR_INT("pix is colormapped", procName, 1);
-
- pixGetDimensions(pix, &w, &h, NULL);
- if (boxClipToRectangleParams(box, w, h, &xstart, &ystart, &xend, ¥d,
- &bw, &bh) == 1)
- return ERROR_INT("invalid clipping box", procName, 1);
-
- wpl = pixGetWpl(pix);
- data = pixGetData(pix);
- if (dir == L_HORIZONTAL_LINE) {
- norm = 1. / (l_float32)(bh * (bw - 1));
- sum = 0.0;
- for (i = ystart; i < yend; i++) {
- line = data + i * wpl;
- val0 = GET_DATA_BYTE(line, xstart);
- for (j = xstart + 1; j < xend; j++) {
- val1 = GET_DATA_BYTE(line, j);
- sum += L_ABS(val1 - val0);
- val0 = val1;
- }
- }
- } else { /* vertical line */
- norm = 1. / (l_float32)(bw * (bh - 1));
- sum = 0.0;
- for (j = xstart; j < xend; j++) {
- line = data + ystart * wpl;
- val0 = GET_DATA_BYTE(line, j);
- for (i = ystart + 1; i < yend; i++) {
- line = data + i * wpl;
- val1 = GET_DATA_BYTE(line, j);
- sum += L_ABS(val1 - val0);
- val0 = val1;
- }
- }
- }
- *pabsdiff = (l_float32)(norm * sum);
- return 0;
-}
-
-
-/*!
- * \brief pixAbsDiffOnLine()
- *
- * \param[in] pix 8 bpp; not cmapped
- * \param[in] x1, y1 first point; x1 <= x2, y1 <= y2
- * \param[in] x2, y2 first point
- * \param[out] pabsdiff average of abs diff pixel values on line
- * \return 0 if OK; 1 on error
- *
- *
- * Notes:
- * (1) This gives the average over the abs val of differences of
- * adjacent pixels values, along a line that is either horizontal
- * or vertical.
- * (2) If horizontal, require x1 < x2; if vertical, require y1 < y2.
- *
- */
-l_ok
-pixAbsDiffOnLine(PIX *pix,
- l_int32 x1,
- l_int32 y1,
- l_int32 x2,
- l_int32 y2,
- l_float32 *pabsdiff)
-{
-l_int32 w, h, i, j, dir, size, sum;
-l_uint32 val0, val1;
-
- PROCNAME("pixAbsDiffOnLine");
-
- if (!pabsdiff)
- return ERROR_INT("&absdiff not defined", procName, 1);
- *pabsdiff = 0.0;
- if (!pix || pixGetDepth(pix) != 8)
- return ERROR_INT("pix undefined or not 8 bpp", procName, 1);
- if (y1 == y2) {
- dir = L_HORIZONTAL_LINE;
- } else if (x1 == x2) {
- dir = L_VERTICAL_LINE;
- } else {
- return ERROR_INT("line is neither horiz nor vert", procName, 1);
- }
- if (pixGetColormap(pix) != NULL)
- return ERROR_INT("pix is colormapped", procName, 1);
-
- pixGetDimensions(pix, &w, &h, NULL);
- sum = 0;
- if (dir == L_HORIZONTAL_LINE) {
- x1 = L_MAX(x1, 0);
- x2 = L_MIN(x2, w - 1);
- if (x1 >= x2)
- return ERROR_INT("x1 >= x2", procName, 1);
- size = x2 - x1;
- pixGetPixel(pix, x1, y1, &val0);
- for (j = x1 + 1; j <= x2; j++) {
- pixGetPixel(pix, j, y1, &val1);
- sum += L_ABS((l_int32)val1 - (l_int32)val0);
- val0 = val1;
- }
- } else { /* vertical */
- y1 = L_MAX(y1, 0);
- y2 = L_MIN(y2, h - 1);
- if (y1 >= y2)
- return ERROR_INT("y1 >= y2", procName, 1);
- size = y2 - y1;
- pixGetPixel(pix, x1, y1, &val0);
- for (i = y1 + 1; i <= y2; i++) {
- pixGetPixel(pix, x1, i, &val1);
- sum += L_ABS((l_int32)val1 - (l_int32)val0);
- val0 = val1;
- }
- }
- *pabsdiff = (l_float32)sum / (l_float32)size;
- return 0;
-}
-
-
-/*-------------------------------------------------------------*
- * Count of pixels with specific value *
- *-------------------------------------------------------------*/
-/*!
- * \brief pixCountArbInRect()
- *
- * \param[in] pixs 8 bpp, or colormapped
- * \param[in] box [optional] over which count is made;
- * use entire image if NULL
- * \param[in] val pixel value to count
- * \param[in] factor subsampling factor; integer >= 1
- * \param[out] pcount count; estimate it if factor > 1
- * \return na histogram, or NULL on error
- *
- *
- * Notes:
- * (1) If pixs is cmapped, %val is compared to the colormap index;
- * otherwise, %val is compared to the grayscale value.
- * (2) Set the subsampling %factor > 1 to reduce the amount of computation.
- * If %factor > 1, multiply the count by %factor * %factor.
- *
- */
-l_int32
-pixCountArbInRect(PIX *pixs,
- BOX *box,
- l_int32 val,
- l_int32 factor,
- l_int32 *pcount)
-{
-l_int32 i, j, bx, by, bw, bh, w, h, wpl, pixval;
-l_uint32 *data, *line;
-
- PROCNAME("pixCountArbInRect");
-
- if (!pcount)
- return ERROR_INT("&count not defined", procName, 1);
- *pcount = 0;
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
- if (pixGetDepth(pixs) != 8 && !pixGetColormap(pixs))
- return ERROR_INT("pixs neither 8 bpp nor colormapped",
- procName, 1);
- if (factor < 1)
- return ERROR_INT("sampling factor < 1", procName, 1);
-
- pixGetDimensions(pixs, &w, &h, NULL);
- data = pixGetData(pixs);
- wpl = pixGetWpl(pixs);
-
- if (!box) {
- for (i = 0; i < h; i += factor) {
- line = data + i * wpl;
- for (j = 0; j < w; j += factor) {
- pixval = GET_DATA_BYTE(line, j);
- if (pixval == val) (*pcount)++;
- }
- }
- } else {
- boxGetGeometry(box, &bx, &by, &bw, &bh);
- for (i = 0; i < bh; i += factor) {
- if (by + i < 0 || by + i >= h) continue;
- line = data + (by + i) * wpl;
- for (j = 0; j < bw; j += factor) {
- if (bx + j < 0 || bx + j >= w) continue;
- pixval = GET_DATA_BYTE(line, bx + j);
- if (pixval == val) (*pcount)++;
- }
- }
- }
-
- if (factor > 1) /* assume pixel color is randomly distributed */
- *pcount = *pcount * factor * factor;
- return 0;
-}
-
-
-/*-------------------------------------------------------------*
- * Mirrored tiling of a smaller image *
- *-------------------------------------------------------------*/
-/*!
- * \brief pixMirroredTiling()
- *
- * \param[in] pixs 8 or 32 bpp, small tile; to be replicated
- * \param[in] w, h dimensions of output pix
- * \return pixd usually larger pix, mirror-tiled with pixs,
- * or NULL on error
- *
- *
- * Notes:
- * (1) This uses mirrored tiling, where each row alternates
- * with LR flips and every column alternates with TB
- * flips, such that the result is a tiling with identical
- * 2 x 2 tiles, each of which is composed of these transforms:
- * -----------------
- * | 1 | LR |
- * -----------------
- * | TB | LR/TB |
- * -----------------
- *
- */
-PIX *
-pixMirroredTiling(PIX *pixs,
- l_int32 w,
- l_int32 h)
-{
-l_int32 wt, ht, d, i, j, nx, ny;
-PIX *pixd, *pixsfx, *pixsfy, *pixsfxy, *pix;
-
- PROCNAME("pixMirroredTiling");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- pixGetDimensions(pixs, &wt, &ht, &d);
- if (wt <= 0 || ht <= 0)
- return (PIX *)ERROR_PTR("pixs size illegal", procName, NULL);
- if (d != 8 && d != 32)
- return (PIX *)ERROR_PTR("depth not 32 bpp", procName, NULL);
-
- if ((pixd = pixCreate(w, h, d)) == NULL)
- return (PIX *)ERROR_PTR("pixd not made", procName, NULL);
- pixCopySpp(pixd, pixs);
-
- nx = (w + wt - 1) / wt;
- ny = (h + ht - 1) / ht;
- pixsfx = pixFlipLR(NULL, pixs);
- pixsfy = pixFlipTB(NULL, pixs);
- pixsfxy = pixFlipTB(NULL, pixsfx);
- for (i = 0; i < ny; i++) {
- for (j = 0; j < nx; j++) {
- pix = pixs;
- if ((i & 1) && !(j & 1))
- pix = pixsfy;
- else if (!(i & 1) && (j & 1))
- pix = pixsfx;
- else if ((i & 1) && (j & 1))
- pix = pixsfxy;
- pixRasterop(pixd, j * wt, i * ht, wt, ht, PIX_SRC, pix, 0, 0);
- }
- }
-
- pixDestroy(&pixsfx);
- pixDestroy(&pixsfy);
- pixDestroy(&pixsfxy);
- return pixd;
-}
-
-
-/*!
- * \brief pixFindRepCloseTile()
- *
- * \param[in] pixs 32 bpp rgb
- * \param[in] box region of pixs to search around
- * \param[in] searchdir L_HORIZ or L_VERT; direction to search
- * \param[in] mindist min distance of selected tile edge from box; >= 0
- * \param[in] tsize tile size; > 1; even; typically ~50
- * \param[in] ntiles number of tiles tested in each row/column
- * \param[out] pboxtile region of best tile
- * \param[in] debug 1 for debug output
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This looks for one or two square tiles with conforming median
- * intensity and low variance, that is outside but near the input box.
- * (2) %mindist specifies the gap between the box and the
- * potential tiles. The tiles are given an overlap of 50%.
- * %ntiles specifies the number of tiles that are tested
- * beyond %mindist for each row or column.
- * (3) For example, if %mindist = 20, %tilesize = 50 and %ntiles = 3,
- * a horizontal search to the right will have 3 tiles in each row,
- * with left edges at 20, 45 and 70 from the right edge of the
- * input %box. The number of rows of tiles is determined by
- * the height of %box and %tsize, with the 50% overlap..
- *
- */
-l_ok
-pixFindRepCloseTile(PIX *pixs,
- BOX *box,
- l_int32 searchdir,
- l_int32 mindist,
- l_int32 tsize,
- l_int32 ntiles,
- BOX **pboxtile,
- l_int32 debug)
-{
-l_int32 w, h, i, n, bestindex;
-l_float32 var_of_mean, median_of_mean, median_of_stdev, mean_val, stdev_val;
-l_float32 mindels, bestdelm, delm, dels, mean, stdev;
-BOXA *boxa;
-NUMA *namean, *nastdev;
-PIX *pix, *pixg;
-PIXA *pixa;
-
- PROCNAME("pixFindRepCloseTile");
-
- if (!pboxtile)
- return ERROR_INT("&boxtile not defined", procName, 1);
- *pboxtile = NULL;
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
- if (!box)
- return ERROR_INT("box not defined", procName, 1);
- if (searchdir != L_HORIZ && searchdir != L_VERT)
- return ERROR_INT("invalid searchdir", procName, 1);
- if (mindist < 0)
- return ERROR_INT("mindist must be >= 0", procName, 1);
- if (tsize < 2)
- return ERROR_INT("tsize must be > 1", procName, 1);
- if (ntiles > 7) {
- L_WARNING("ntiles = %d; larger than suggested max of 7\n",
- procName, ntiles);
- }
-
- /* Locate tile regions */
- pixGetDimensions(pixs, &w, &h, NULL);
- boxa = findTileRegionsForSearch(box, w, h, searchdir, mindist,
- tsize, ntiles);
- if (!boxa)
- return ERROR_INT("no tiles found", procName, 1);
-
- /* Generate the tiles and the mean and stdev of intensity */
- pixa = pixClipRectangles(pixs, boxa);
- n = pixaGetCount(pixa);
- namean = numaCreate(n);
- nastdev = numaCreate(n);
- for (i = 0; i < n; i++) {
- pix = pixaGetPix(pixa, i, L_CLONE);
- pixg = pixConvertRGBToGray(pix, 0.33, 0.34, 0.33);
- pixGetAverageMasked(pixg, NULL, 0, 0, 1, L_MEAN_ABSVAL, &mean);
- pixGetAverageMasked(pixg, NULL, 0, 0, 1, L_STANDARD_DEVIATION, &stdev);
- numaAddNumber(namean, mean);
- numaAddNumber(nastdev, stdev);
- pixDestroy(&pix);
- pixDestroy(&pixg);
- }
-
- /* Find the median and variance of the averages. We require
- * the best tile to have a mean pixel intensity within a standard
- * deviation of the median of mean intensities, and choose the
- * tile in that set with the smallest stdev of pixel intensities
- * (as a proxy for the tile with least visible structure).
- * The median of the stdev is used, for debugging, as a normalizing
- * factor for the stdev of intensities within a tile. */
- numaGetStatsUsingHistogram(namean, 256, NULL, NULL, NULL, &var_of_mean,
- &median_of_mean, 0.0, NULL, NULL);
- numaGetStatsUsingHistogram(nastdev, 256, NULL, NULL, NULL, NULL,
- &median_of_stdev, 0.0, NULL, NULL);
- mindels = 1000.0;
- bestdelm = 1000.0;
- bestindex = 0;
- for (i = 0; i < n; i++) {
- numaGetFValue(namean, i, &mean_val);
- numaGetFValue(nastdev, i, &stdev_val);
- if (var_of_mean == 0.0) { /* uniform color; any box will do */
- delm = 0.0; /* any value < 1.01 */
- dels = 1.0; /* n'importe quoi */
- } else {
- delm = L_ABS(mean_val - median_of_mean) / sqrt(var_of_mean);
- dels = stdev_val / median_of_stdev;
- }
- if (delm < 1.01) {
- if (dels < mindels) {
- if (debug) {
- lept_stderr("i = %d, mean = %7.3f, delm = %7.3f,"
- " stdev = %7.3f, dels = %7.3f\n",
- i, mean_val, delm, stdev_val, dels);
- }
- mindels = dels;
- bestdelm = delm;
- bestindex = i;
- }
- }
- }
- *pboxtile = boxaGetBox(boxa, bestindex, L_COPY);
-
- if (debug) {
- L_INFO("median of mean = %7.3f\n", procName, median_of_mean);
- L_INFO("standard dev of mean = %7.3f\n", procName, sqrt(var_of_mean));
- L_INFO("median of stdev = %7.3f\n", procName, median_of_stdev);
- L_INFO("best tile: index = %d\n", procName, bestindex);
- L_INFO("delta from median in units of stdev = %5.3f\n",
- procName, bestdelm);
- L_INFO("stdev as fraction of median stdev = %5.3f\n",
- procName, mindels);
- }
-
- numaDestroy(&namean);
- numaDestroy(&nastdev);
- pixaDestroy(&pixa);
- boxaDestroy(&boxa);
- return 0;
-}
-
-
-/*!
- * \brief findTileRegionsForSearch()
- *
- * \param[in] box region of Pix to search around
- * \param[in] w, h dimensions of Pix
- * \param[in] searchdir L_HORIZ or L_VERT; direction to search
- * \param[in] mindist min distance of selected tile edge from box; >= 0
- * \param[in] tsize tile size; > 1; even; typically ~50
- * \param[in] ntiles number of tiles tested in each row/column
- * \return boxa if OK, or NULL on error
- *
- *
- * Notes:
- * (1) See calling function pixfindRepCloseTile().
- *
- */
-static BOXA *
-findTileRegionsForSearch(BOX *box,
- l_int32 w,
- l_int32 h,
- l_int32 searchdir,
- l_int32 mindist,
- l_int32 tsize,
- l_int32 ntiles)
-{
-l_int32 bx, by, bw, bh, left, right, top, bot, i, j, nrows, ncols;
-l_int32 x0, y0, x, y, w_avail, w_needed, h_avail, h_needed, t_avail;
-BOX *box1;
-BOXA *boxa;
-
- PROCNAME("findTileRegionsForSearch");
-
- if (!box)
- return (BOXA *)ERROR_PTR("box not defined", procName, NULL);
- if (ntiles == 0)
- return (BOXA *)ERROR_PTR("no tiles requested", procName, NULL);
-
- boxGetGeometry(box, &bx, &by, &bw, &bh);
- if (searchdir == L_HORIZ) {
- /* Find the tile parameters for the search. Note that the
- * tiles are overlapping by 50% in each direction. */
- left = bx; /* distance to left of box */
- right = w - bx - bw + 1; /* distance to right of box */
- w_avail = L_MAX(left, right) - mindist;
- if (tsize & 1) tsize++; /* be sure it's even */
- if (w_avail < tsize) {
- L_ERROR("tsize = %d, w_avail = %d\n", procName, tsize, w_avail);
- return NULL;
- }
- w_needed = tsize + (ntiles - 1) * (tsize / 2);
- if (w_needed > w_avail) {
- t_avail = 1 + 2 * (w_avail - tsize) / tsize;
- L_WARNING("ntiles = %d; room for only %d\n", procName,
- ntiles, t_avail);
- ntiles = t_avail;
- w_needed = tsize + (ntiles - 1) * (tsize / 2);
- }
- nrows = L_MAX(1, 1 + 2 * (bh - tsize) / tsize);
-
- /* Generate the tile regions to search */
- boxa = boxaCreate(0);
- if (left > right) /* search to left */
- x0 = bx - w_needed;
- else /* search to right */
- x0 = bx + bw + mindist;
- for (i = 0; i < nrows; i++) {
- y = by + i * tsize / 2;
- for (j = 0; j < ntiles; j++) {
- x = x0 + j * tsize / 2;
- box1 = boxCreate(x, y, tsize, tsize);
- boxaAddBox(boxa, box1, L_INSERT);
- }
- }
- } else { /* L_VERT */
- /* Find the tile parameters for the search */
- top = by; /* distance above box */
- bot = h - by - bh + 1; /* distance below box */
- h_avail = L_MAX(top, bot) - mindist;
- if (h_avail < tsize) {
- L_ERROR("tsize = %d, h_avail = %d\n", procName, tsize, h_avail);
- return NULL;
- }
- h_needed = tsize + (ntiles - 1) * (tsize / 2);
- if (h_needed > h_avail) {
- t_avail = 1 + 2 * (h_avail - tsize) / tsize;
- L_WARNING("ntiles = %d; room for only %d\n", procName,
- ntiles, t_avail);
- ntiles = t_avail;
- h_needed = tsize + (ntiles - 1) * (tsize / 2);
- }
- ncols = L_MAX(1, 1 + 2 * (bw - tsize) / tsize);
-
- /* Generate the tile regions to search */
- boxa = boxaCreate(0);
- if (top > bot) /* search above */
- y0 = by - h_needed;
- else /* search below */
- y0 = by + bh + mindist;
- for (j = 0; j < ncols; j++) {
- x = bx + j * tsize / 2;
- for (i = 0; i < ntiles; i++) {
- y = y0 + i * tsize / 2;
- box1 = boxCreate(x, y, tsize, tsize);
- boxaAddBox(boxa, box1, L_INSERT);
- }
- }
- }
- return boxa;
-}
diff --git a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pix4.c b/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pix4.c
deleted file mode 100644
index eb40bd9c..00000000
--- a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pix4.c
+++ /dev/null
@@ -1,3460 +0,0 @@
-/*====================================================================*
- - Copyright (C) 2001 Leptonica. All rights reserved.
- -
- - Redistribution and use in source and binary forms, with or without
- - modification, are permitted provided that the following conditions
- - are met:
- - 1. Redistributions of source code must retain the above copyright
- - notice, this list of conditions and the following disclaimer.
- - 2. Redistributions in binary form must reproduce the above
- - copyright notice, this list of conditions and the following
- - disclaimer in the documentation and/or other materials
- - provided with the distribution.
- -
- - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- - ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- - LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- - A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL ANY
- - CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
- - EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
- - PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
- - PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
- - OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
- - NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- *====================================================================*/
-
-/*!
- * \file pix4.c
- *
- *
- * This file has these operations:
- *
- * (1) Pixel histograms
- * (2) Pixel row/column statistics
- * (3) Foreground/background estimation
- *
- * Pixel histogram, rank val, averaging and min/max
- * NUMA *pixGetGrayHistogram()
- * NUMA *pixGetGrayHistogramMasked()
- * NUMA *pixGetGrayHistogramInRect()
- * NUMAA *pixGetGrayHistogramTiled()
- * l_int32 pixGetColorHistogram()
- * l_int32 pixGetColorHistogramMasked()
- * NUMA *pixGetCmapHistogram()
- * NUMA *pixGetCmapHistogramMasked()
- * NUMA *pixGetCmapHistogramInRect()
- * l_int32 pixCountRGBColors()
- * L_AMAP *pixGetColorAmapHistogram()
- * l_int32 amapGetCountForColor()
- * l_int32 pixGetRankValue()
- * l_int32 pixGetRankValueMaskedRGB()
- * l_int32 pixGetRankValueMasked()
- * l_int32 pixGetPixelAverage()
- * l_int32 pixGetPixelStats()
- * l_int32 pixGetAverageMaskedRGB()
- * l_int32 pixGetAverageMasked()
- * l_int32 pixGetAverageTiledRGB()
- * PIX *pixGetAverageTiled()
- * NUMA *pixRowStats()
- * NUMA *pixColumnStats()
- * l_int32 pixGetRangeValues()
- * l_int32 pixGetExtremeValue()
- * l_int32 pixGetMaxValueInRect()
- * l_int32 pixGetBinnedComponentRange()
- * l_int32 pixGetRankColorArray()
- * l_int32 pixGetBinnedColor()
- * PIX *pixDisplayColorArray()
- * PIX *pixRankBinByStrip()
- *
- * Pixelwise aligned statistics
- * PIX *pixaGetAlignedStats()
- * l_int32 pixaExtractColumnFromEachPix()
- * l_int32 pixGetRowStats()
- * l_int32 pixGetColumnStats()
- * l_int32 pixSetPixelColumn()
- *
- * Foreground/background estimation
- * l_int32 pixThresholdForFgBg()
- * l_int32 pixSplitDistributionFgBg()
- *
- */
-
-#ifdef HAVE_CONFIG_H
-#include
-#endif /* HAVE_CONFIG_H */
-
-#include
-#include
-#include "allheaders.h"
-
-
-/*------------------------------------------------------------------*
- * Pixel histogram and averaging *
- *------------------------------------------------------------------*/
-/*!
- * \brief pixGetGrayHistogram()
- *
- * \param[in] pixs 1, 2, 4, 8, 16 bpp; can be colormapped
- * \param[in] factor subsampling factor; integer >= 1
- * \return na histogram, or NULL on error
- *
- *
- * Notes:
- * (1) If pixs has a colormap, it is converted to 8 bpp gray.
- * If you want a histogram of the colormap indices, use
- * pixGetCmapHistogram().
- * (2) If pixs does not have a colormap, the output histogram is
- * of size 2^d, where d is the depth of pixs.
- * (3) Set the subsampling factor > 1 to reduce the amount of computation.
- *
- */
-NUMA *
-pixGetGrayHistogram(PIX *pixs,
- l_int32 factor)
-{
-l_int32 i, j, w, h, d, wpl, val, size, count;
-l_uint32 *data, *line;
-l_float32 *array;
-NUMA *na;
-PIX *pixg;
-
- PROCNAME("pixGetGrayHistogram");
-
- if (!pixs)
- return (NUMA *)ERROR_PTR("pixs not defined", procName, NULL);
- d = pixGetDepth(pixs);
- if (d > 16)
- return (NUMA *)ERROR_PTR("depth not in {1,2,4,8,16}", procName, NULL);
- if (factor < 1)
- return (NUMA *)ERROR_PTR("sampling must be >= 1", procName, NULL);
-
- if (pixGetColormap(pixs))
- pixg = pixRemoveColormap(pixs, REMOVE_CMAP_TO_GRAYSCALE);
- else
- pixg = pixClone(pixs);
-
- pixGetDimensions(pixg, &w, &h, &d);
- size = 1 << d;
- if ((na = numaCreate(size)) == NULL) {
- pixDestroy(&pixg);
- return (NUMA *)ERROR_PTR("na not made", procName, NULL);
- }
- numaSetCount(na, size); /* all initialized to 0.0 */
- array = numaGetFArray(na, L_NOCOPY);
-
- if (d == 1) { /* special case */
- pixCountPixels(pixg, &count, NULL);
- array[0] = w * h - count;
- array[1] = count;
- pixDestroy(&pixg);
- return na;
- }
-
- wpl = pixGetWpl(pixg);
- data = pixGetData(pixg);
- for (i = 0; i < h; i += factor) {
- line = data + i * wpl;
- if (d == 2) {
- for (j = 0; j < w; j += factor) {
- val = GET_DATA_DIBIT(line, j);
- array[val] += 1.0;
- }
- } else if (d == 4) {
- for (j = 0; j < w; j += factor) {
- val = GET_DATA_QBIT(line, j);
- array[val] += 1.0;
- }
- } else if (d == 8) {
- for (j = 0; j < w; j += factor) {
- val = GET_DATA_BYTE(line, j);
- array[val] += 1.0;
- }
- } else { /* d == 16 */
- for (j = 0; j < w; j += factor) {
- val = GET_DATA_TWO_BYTES(line, j);
- array[val] += 1.0;
- }
- }
- }
-
- pixDestroy(&pixg);
- return na;
-}
-
-
-/*!
- * \brief pixGetGrayHistogramMasked()
- *
- * \param[in] pixs 8 bpp, or colormapped
- * \param[in] pixm [optional] 1 bpp mask over which histogram is
- * to be computed; use all pixels if null
- * \param[in] x, y UL corner of pixm relative to the UL corner of pixs;
- * can be < 0; these values are ignored if pixm is null
- * \param[in] factor subsampling factor; integer >= 1
- * \return na histogram, or NULL on error
- *
- *
- * Notes:
- * (1) If pixs is cmapped, it is converted to 8 bpp gray.
- * If you want a histogram of the colormap indices, use
- * pixGetCmapHistogramMasked().
- * (2) This always returns a 256-value histogram of pixel values.
- * (3) Set the subsampling factor > 1 to reduce the amount of computation.
- * (4) Clipping of pixm (if it exists) to pixs is done in the inner loop.
- * (5) Input x,y are ignored unless pixm exists.
- *
- */
-NUMA *
-pixGetGrayHistogramMasked(PIX *pixs,
- PIX *pixm,
- l_int32 x,
- l_int32 y,
- l_int32 factor)
-{
-l_int32 i, j, w, h, wm, hm, dm, wplg, wplm, val;
-l_uint32 *datag, *datam, *lineg, *linem;
-l_float32 *array;
-NUMA *na;
-PIX *pixg;
-
- PROCNAME("pixGetGrayHistogramMasked");
-
- if (!pixm)
- return pixGetGrayHistogram(pixs, factor);
- if (!pixs)
- return (NUMA *)ERROR_PTR("pixs not defined", procName, NULL);
- if (pixGetDepth(pixs) != 8 && !pixGetColormap(pixs))
- return (NUMA *)ERROR_PTR("pixs neither 8 bpp nor colormapped",
- procName, NULL);
- pixGetDimensions(pixm, &wm, &hm, &dm);
- if (dm != 1)
- return (NUMA *)ERROR_PTR("pixm not 1 bpp", procName, NULL);
- if (factor < 1)
- return (NUMA *)ERROR_PTR("sampling must be >= 1", procName, NULL);
-
- if ((na = numaCreate(256)) == NULL)
- return (NUMA *)ERROR_PTR("na not made", procName, NULL);
- numaSetCount(na, 256); /* all initialized to 0.0 */
- array = numaGetFArray(na, L_NOCOPY);
-
- if (pixGetColormap(pixs))
- pixg = pixRemoveColormap(pixs, REMOVE_CMAP_TO_GRAYSCALE);
- else
- pixg = pixClone(pixs);
- pixGetDimensions(pixg, &w, &h, NULL);
- datag = pixGetData(pixg);
- wplg = pixGetWpl(pixg);
- datam = pixGetData(pixm);
- wplm = pixGetWpl(pixm);
-
- /* Generate the histogram */
- for (i = 0; i < hm; i += factor) {
- if (y + i < 0 || y + i >= h) continue;
- lineg = datag + (y + i) * wplg;
- linem = datam + i * wplm;
- for (j = 0; j < wm; j += factor) {
- if (x + j < 0 || x + j >= w) continue;
- if (GET_DATA_BIT(linem, j)) {
- val = GET_DATA_BYTE(lineg, x + j);
- array[val] += 1.0;
- }
- }
- }
-
- pixDestroy(&pixg);
- return na;
-}
-
-
-/*!
- * \brief pixGetGrayHistogramInRect()
- *
- * \param[in] pixs 8 bpp, or colormapped
- * \param[in] box [optional] over which histogram is to be computed;
- * use full image if NULL
- * \param[in] factor subsampling factor; integer >= 1
- * \return na histogram, or NULL on error
- *
- *
- * Notes:
- * (1) If pixs is cmapped, it is converted to 8 bpp gray.
- * If you want a histogram of the colormap indices, use
- * pixGetCmapHistogramInRect().
- * (2) This always returns a 256-value histogram of pixel values.
- * (3) Set the subsampling %factor > 1 to reduce the amount of computation.
- *
- */
-NUMA *
-pixGetGrayHistogramInRect(PIX *pixs,
- BOX *box,
- l_int32 factor)
-{
-l_int32 i, j, bx, by, bw, bh, w, h, wplg, val;
-l_uint32 *datag, *lineg;
-l_float32 *array;
-NUMA *na;
-PIX *pixg;
-
- PROCNAME("pixGetGrayHistogramInRect");
-
- if (!box)
- return pixGetGrayHistogram(pixs, factor);
- if (!pixs)
- return (NUMA *)ERROR_PTR("pixs not defined", procName, NULL);
- if (pixGetDepth(pixs) != 8 && !pixGetColormap(pixs))
- return (NUMA *)ERROR_PTR("pixs neither 8 bpp nor colormapped",
- procName, NULL);
- if (factor < 1)
- return (NUMA *)ERROR_PTR("sampling must be >= 1", procName, NULL);
-
- if ((na = numaCreate(256)) == NULL)
- return (NUMA *)ERROR_PTR("na not made", procName, NULL);
- numaSetCount(na, 256); /* all initialized to 0.0 */
- array = numaGetFArray(na, L_NOCOPY);
-
- if (pixGetColormap(pixs))
- pixg = pixRemoveColormap(pixs, REMOVE_CMAP_TO_GRAYSCALE);
- else
- pixg = pixClone(pixs);
- pixGetDimensions(pixg, &w, &h, NULL);
- datag = pixGetData(pixg);
- wplg = pixGetWpl(pixg);
- boxGetGeometry(box, &bx, &by, &bw, &bh);
-
- /* Generate the histogram */
- for (i = 0; i < bh; i += factor) {
- if (by + i < 0 || by + i >= h) continue;
- lineg = datag + (by + i) * wplg;
- for (j = 0; j < bw; j += factor) {
- if (bx + j < 0 || bx + j >= w) continue;
- val = GET_DATA_BYTE(lineg, bx + j);
- array[val] += 1.0;
- }
- }
-
- pixDestroy(&pixg);
- return na;
-}
-
-
-/*!
- * \brief pixGetGrayHistogramTiled()
- *
- * \param[in] pixs any depth, colormap OK
- * \param[in] factor subsampling factor; integer >= 1
- * \param[in] nx, ny tiling; >= 1; typically small
- * \return naa set of histograms, or NULL on error
- *
- *
- * Notes:
- * (1) If pixs is cmapped, it is converted to 8 bpp gray.
- * (2) This returns a set of 256-value histograms of pixel values.
- * (3) Set the subsampling factor > 1 to reduce the amount of computation.
- *
- */
-NUMAA *
-pixGetGrayHistogramTiled(PIX *pixs,
- l_int32 factor,
- l_int32 nx,
- l_int32 ny)
-{
-l_int32 i, n;
-NUMA *na;
-NUMAA *naa;
-PIX *pix1, *pix2;
-PIXA *pixa;
-
- PROCNAME("pixGetGrayHistogramTiled");
-
- if (!pixs)
- return (NUMAA *)ERROR_PTR("pixs not defined", procName, NULL);
- if (factor < 1)
- return (NUMAA *)ERROR_PTR("sampling must be >= 1", procName, NULL);
- if (nx < 1 || ny < 1)
- return (NUMAA *)ERROR_PTR("nx and ny must both be > 0", procName, NULL);
-
- n = nx * ny;
- if ((naa = numaaCreate(n)) == NULL)
- return (NUMAA *)ERROR_PTR("naa not made", procName, NULL);
-
- pix1 = pixConvertTo8(pixs, FALSE);
- pixa = pixaSplitPix(pix1, nx, ny, 0, 0);
- for (i = 0; i < n; i++) {
- pix2 = pixaGetPix(pixa, i, L_CLONE);
- na = pixGetGrayHistogram(pix2, factor);
- numaaAddNuma(naa, na, L_INSERT);
- pixDestroy(&pix2);
- }
-
- pixDestroy(&pix1);
- pixaDestroy(&pixa);
- return naa;
-}
-
-
-/*!
- * \brief pixGetColorHistogram()
- *
- * \param[in] pixs rgb or colormapped
- * \param[in] factor subsampling factor; integer >= 1
- * \param[out] pnar red histogram
- * \param[out] pnag green histogram
- * \param[out] pnab blue histogram
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This generates a set of three 256 entry histograms,
- * one for each color component (r,g,b).
- * (2) Set the subsampling %factor > 1 to reduce the amount of computation.
- *
- */
-l_ok
-pixGetColorHistogram(PIX *pixs,
- l_int32 factor,
- NUMA **pnar,
- NUMA **pnag,
- NUMA **pnab)
-{
-l_int32 i, j, w, h, d, wpl, index, rval, gval, bval;
-l_uint32 *data, *line;
-l_float32 *rarray, *garray, *barray;
-NUMA *nar, *nag, *nab;
-PIXCMAP *cmap;
-
- PROCNAME("pixGetColorHistogram");
-
- if (pnar) *pnar = NULL;
- if (pnag) *pnag = NULL;
- if (pnab) *pnab = NULL;
- if (!pnar || !pnag || !pnab)
- return ERROR_INT("&nar, &nag, &nab not all defined", procName, 1);
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
- pixGetDimensions(pixs, &w, &h, &d);
- cmap = pixGetColormap(pixs);
- if (cmap && (d != 2 && d != 4 && d != 8))
- return ERROR_INT("colormap and not 2, 4, or 8 bpp", procName, 1);
- if (!cmap && d != 32)
- return ERROR_INT("no colormap and not rgb", procName, 1);
- if (factor < 1)
- return ERROR_INT("sampling factor must be >= 1", procName, 1);
-
- /* Set up the histogram arrays */
- nar = numaCreate(256);
- nag = numaCreate(256);
- nab = numaCreate(256);
- numaSetCount(nar, 256);
- numaSetCount(nag, 256);
- numaSetCount(nab, 256);
- rarray = numaGetFArray(nar, L_NOCOPY);
- garray = numaGetFArray(nag, L_NOCOPY);
- barray = numaGetFArray(nab, L_NOCOPY);
- *pnar = nar;
- *pnag = nag;
- *pnab = nab;
-
- /* Generate the color histograms */
- data = pixGetData(pixs);
- wpl = pixGetWpl(pixs);
- if (cmap) {
- for (i = 0; i < h; i += factor) {
- line = data + i * wpl;
- for (j = 0; j < w; j += factor) {
- if (d == 8)
- index = GET_DATA_BYTE(line, j);
- else if (d == 4)
- index = GET_DATA_QBIT(line, j);
- else /* 2 bpp */
- index = GET_DATA_DIBIT(line, j);
- pixcmapGetColor(cmap, index, &rval, &gval, &bval);
- rarray[rval] += 1.0;
- garray[gval] += 1.0;
- barray[bval] += 1.0;
- }
- }
- } else { /* 32 bpp rgb */
- for (i = 0; i < h; i += factor) {
- line = data + i * wpl;
- for (j = 0; j < w; j += factor) {
- extractRGBValues(line[j], &rval, &gval, &bval);
- rarray[rval] += 1.0;
- garray[gval] += 1.0;
- barray[bval] += 1.0;
- }
- }
- }
-
- return 0;
-}
-
-
-/*!
- * \brief pixGetColorHistogramMasked()
- *
- * \param[in] pixs 32 bpp rgb, or colormapped
- * \param[in] pixm [optional] 1 bpp mask over which histogram is
- * to be computed; use all pixels if null
- * \param[in] x, y UL corner of pixm relative to the UL corner of pixs;
- * can be < 0; these values are ignored if pixm is null
- * \param[in] factor subsampling factor; integer >= 1
- * \param[out] pnar red histogram
- * \param[out] pnag green histogram
- * \param[out] pnab blue histogram
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This generates a set of three 256 entry histograms,
- * (2) Set the subsampling %factor > 1 to reduce the amount of computation.
- * (3) Clipping of pixm (if it exists) to pixs is done in the inner loop.
- * (4) Input x,y are ignored unless pixm exists.
- *
- */
-l_ok
-pixGetColorHistogramMasked(PIX *pixs,
- PIX *pixm,
- l_int32 x,
- l_int32 y,
- l_int32 factor,
- NUMA **pnar,
- NUMA **pnag,
- NUMA **pnab)
-{
-l_int32 i, j, w, h, d, wm, hm, dm, wpls, wplm, index, rval, gval, bval;
-l_uint32 *datas, *datam, *lines, *linem;
-l_float32 *rarray, *garray, *barray;
-NUMA *nar, *nag, *nab;
-PIXCMAP *cmap;
-
- PROCNAME("pixGetColorHistogramMasked");
-
- if (!pixm)
- return pixGetColorHistogram(pixs, factor, pnar, pnag, pnab);
-
- if (pnar) *pnar = NULL;
- if (pnag) *pnag = NULL;
- if (pnab) *pnab = NULL;
- if (!pnar || !pnag || !pnab)
- return ERROR_INT("&nar, &nag, &nab not all defined", procName, 1);
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
- pixGetDimensions(pixs, &w, &h, &d);
- cmap = pixGetColormap(pixs);
- if (cmap && (d != 2 && d != 4 && d != 8))
- return ERROR_INT("colormap and not 2, 4, or 8 bpp", procName, 1);
- if (!cmap && d != 32)
- return ERROR_INT("no colormap and not rgb", procName, 1);
- pixGetDimensions(pixm, &wm, &hm, &dm);
- if (dm != 1)
- return ERROR_INT("pixm not 1 bpp", procName, 1);
- if (factor < 1)
- return ERROR_INT("sampling factor must be >= 1", procName, 1);
-
- /* Set up the histogram arrays */
- nar = numaCreate(256);
- nag = numaCreate(256);
- nab = numaCreate(256);
- numaSetCount(nar, 256);
- numaSetCount(nag, 256);
- numaSetCount(nab, 256);
- rarray = numaGetFArray(nar, L_NOCOPY);
- garray = numaGetFArray(nag, L_NOCOPY);
- barray = numaGetFArray(nab, L_NOCOPY);
- *pnar = nar;
- *pnag = nag;
- *pnab = nab;
-
- /* Generate the color histograms */
- datas = pixGetData(pixs);
- wpls = pixGetWpl(pixs);
- datam = pixGetData(pixm);
- wplm = pixGetWpl(pixm);
- if (cmap) {
- for (i = 0; i < hm; i += factor) {
- if (y + i < 0 || y + i >= h) continue;
- lines = datas + (y + i) * wpls;
- linem = datam + i * wplm;
- for (j = 0; j < wm; j += factor) {
- if (x + j < 0 || x + j >= w) continue;
- if (GET_DATA_BIT(linem, j)) {
- if (d == 8)
- index = GET_DATA_BYTE(lines, x + j);
- else if (d == 4)
- index = GET_DATA_QBIT(lines, x + j);
- else /* 2 bpp */
- index = GET_DATA_DIBIT(lines, x + j);
- pixcmapGetColor(cmap, index, &rval, &gval, &bval);
- rarray[rval] += 1.0;
- garray[gval] += 1.0;
- barray[bval] += 1.0;
- }
- }
- }
- } else { /* 32 bpp rgb */
- for (i = 0; i < hm; i += factor) {
- if (y + i < 0 || y + i >= h) continue;
- lines = datas + (y + i) * wpls;
- linem = datam + i * wplm;
- for (j = 0; j < wm; j += factor) {
- if (x + j < 0 || x + j >= w) continue;
- if (GET_DATA_BIT(linem, j)) {
- extractRGBValues(lines[x + j], &rval, &gval, &bval);
- rarray[rval] += 1.0;
- garray[gval] += 1.0;
- barray[bval] += 1.0;
- }
- }
- }
- }
-
- return 0;
-}
-
-
-/*!
- * \brief pixGetCmapHistogram()
- *
- * \param[in] pixs colormapped: d = 2, 4 or 8
- * \param[in] factor subsampling factor; integer >= 1
- * \return na histogram of cmap indices, or NULL on error
- *
- *
- * Notes:
- * (1) This generates a histogram of colormap pixel indices,
- * and is of size 2^d.
- * (2) Set the subsampling %factor > 1 to reduce the amount of computation.
- *
- */
-NUMA *
-pixGetCmapHistogram(PIX *pixs,
- l_int32 factor)
-{
-l_int32 i, j, w, h, d, wpl, val, size;
-l_uint32 *data, *line;
-l_float32 *array;
-NUMA *na;
-
- PROCNAME("pixGetCmapHistogram");
-
- if (!pixs)
- return (NUMA *)ERROR_PTR("pixs not defined", procName, NULL);
- if (pixGetColormap(pixs) == NULL)
- return (NUMA *)ERROR_PTR("pixs not cmapped", procName, NULL);
- if (factor < 1)
- return (NUMA *)ERROR_PTR("sampling must be >= 1", procName, NULL);
- pixGetDimensions(pixs, &w, &h, &d);
- if (d != 2 && d != 4 && d != 8)
- return (NUMA *)ERROR_PTR("d not 2, 4 or 8", procName, NULL);
-
- size = 1 << d;
- if ((na = numaCreate(size)) == NULL)
- return (NUMA *)ERROR_PTR("na not made", procName, NULL);
- numaSetCount(na, size); /* all initialized to 0.0 */
- array = numaGetFArray(na, L_NOCOPY);
-
- wpl = pixGetWpl(pixs);
- data = pixGetData(pixs);
- for (i = 0; i < h; i += factor) {
- line = data + i * wpl;
- for (j = 0; j < w; j += factor) {
- if (d == 8)
- val = GET_DATA_BYTE(line, j);
- else if (d == 4)
- val = GET_DATA_QBIT(line, j);
- else /* d == 2 */
- val = GET_DATA_DIBIT(line, j);
- array[val] += 1.0;
- }
- }
-
- return na;
-}
-
-
-/*!
- * \brief pixGetCmapHistogramMasked()
- *
- * \param[in] pixs colormapped: d = 2, 4 or 8
- * \param[in] pixm [optional] 1 bpp mask over which histogram is
- * to be computed; use all pixels if null
- * \param[in] x, y UL corner of pixm relative to the UL corner of pixs;
- * can be < 0; these values are ignored if pixm is null
- * \param[in] factor subsampling factor; integer >= 1
- * \return na histogram, or NULL on error
- *
- *
- * Notes:
- * (1) This generates a histogram of colormap pixel indices,
- * and is of size 2^d.
- * (2) Set the subsampling %factor > 1 to reduce the amount of computation.
- * (3) Clipping of pixm to pixs is done in the inner loop.
- *
- */
-NUMA *
-pixGetCmapHistogramMasked(PIX *pixs,
- PIX *pixm,
- l_int32 x,
- l_int32 y,
- l_int32 factor)
-{
-l_int32 i, j, w, h, d, wm, hm, dm, wpls, wplm, val, size;
-l_uint32 *datas, *datam, *lines, *linem;
-l_float32 *array;
-NUMA *na;
-
- PROCNAME("pixGetCmapHistogramMasked");
-
- if (!pixm)
- return pixGetCmapHistogram(pixs, factor);
-
- if (!pixs)
- return (NUMA *)ERROR_PTR("pixs not defined", procName, NULL);
- if (pixGetColormap(pixs) == NULL)
- return (NUMA *)ERROR_PTR("pixs not cmapped", procName, NULL);
- pixGetDimensions(pixm, &wm, &hm, &dm);
- if (dm != 1)
- return (NUMA *)ERROR_PTR("pixm not 1 bpp", procName, NULL);
- if (factor < 1)
- return (NUMA *)ERROR_PTR("sampling must be >= 1", procName, NULL);
- pixGetDimensions(pixs, &w, &h, &d);
- if (d != 2 && d != 4 && d != 8)
- return (NUMA *)ERROR_PTR("d not 2, 4 or 8", procName, NULL);
-
- size = 1 << d;
- if ((na = numaCreate(size)) == NULL)
- return (NUMA *)ERROR_PTR("na not made", procName, NULL);
- numaSetCount(na, size); /* all initialized to 0.0 */
- array = numaGetFArray(na, L_NOCOPY);
-
- datas = pixGetData(pixs);
- wpls = pixGetWpl(pixs);
- datam = pixGetData(pixm);
- wplm = pixGetWpl(pixm);
-
- for (i = 0; i < hm; i += factor) {
- if (y + i < 0 || y + i >= h) continue;
- lines = datas + (y + i) * wpls;
- linem = datam + i * wplm;
- for (j = 0; j < wm; j += factor) {
- if (x + j < 0 || x + j >= w) continue;
- if (GET_DATA_BIT(linem, j)) {
- if (d == 8)
- val = GET_DATA_BYTE(lines, x + j);
- else if (d == 4)
- val = GET_DATA_QBIT(lines, x + j);
- else /* d == 2 */
- val = GET_DATA_DIBIT(lines, x + j);
- array[val] += 1.0;
- }
- }
- }
-
- return na;
-}
-
-
-/*!
- * \brief pixGetCmapHistogramInRect()
- *
- * \param[in] pixs colormapped: d = 2, 4 or 8
- * \param[in] box [optional] over which histogram is to be computed;
- * use full image if NULL
- * \param[in] factor subsampling factor; integer >= 1
- * \return na histogram, or NULL on error
- *
- *
- * Notes:
- * (1) This generates a histogram of colormap pixel indices,
- * and is of size 2^d.
- * (2) Set the subsampling %factor > 1 to reduce the amount of computation.
- * (3) Clipping to the box is done in the inner loop.
- *
- */
-NUMA *
-pixGetCmapHistogramInRect(PIX *pixs,
- BOX *box,
- l_int32 factor)
-{
-l_int32 i, j, bx, by, bw, bh, w, h, d, wpls, val, size;
-l_uint32 *datas, *lines;
-l_float32 *array;
-NUMA *na;
-
- PROCNAME("pixGetCmapHistogramInRect");
-
- if (!box)
- return pixGetCmapHistogram(pixs, factor);
- if (!pixs)
- return (NUMA *)ERROR_PTR("pixs not defined", procName, NULL);
- if (pixGetColormap(pixs) == NULL)
- return (NUMA *)ERROR_PTR("pixs not cmapped", procName, NULL);
- if (factor < 1)
- return (NUMA *)ERROR_PTR("sampling must be >= 1", procName, NULL);
- pixGetDimensions(pixs, &w, &h, &d);
- if (d != 2 && d != 4 && d != 8)
- return (NUMA *)ERROR_PTR("d not 2, 4 or 8", procName, NULL);
-
- size = 1 << d;
- if ((na = numaCreate(size)) == NULL)
- return (NUMA *)ERROR_PTR("na not made", procName, NULL);
- numaSetCount(na, size); /* all initialized to 0.0 */
- array = numaGetFArray(na, L_NOCOPY);
-
- datas = pixGetData(pixs);
- wpls = pixGetWpl(pixs);
- boxGetGeometry(box, &bx, &by, &bw, &bh);
-
- for (i = 0; i < bh; i += factor) {
- if (by + i < 0 || by + i >= h) continue;
- lines = datas + (by + i) * wpls;
- for (j = 0; j < bw; j += factor) {
- if (bx + j < 0 || bx + j >= w) continue;
- if (d == 8)
- val = GET_DATA_BYTE(lines, bx + j);
- else if (d == 4)
- val = GET_DATA_QBIT(lines, bx + j);
- else /* d == 2 */
- val = GET_DATA_DIBIT(lines, bx + j);
- array[val] += 1.0;
- }
- }
-
- return na;
-}
-
-
-/*!
- * \brief pixCountRGBColors()
- *
- * \param[in] pixs rgb or rgba
- * \param[in] factor subsampling factor; integer >= 1
- * \param[out] pncolors number of colors found
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) If %factor == 1, this gives the exact number of colors.
- *
- */
-l_ok
-pixCountRGBColors(PIX *pixs,
- l_int32 factor,
- l_int32 *pncolors)
-{
-L_AMAP *amap;
-
- PROCNAME("pixCountRGBColors");
-
- if (!pncolors)
- return ERROR_INT("&ncolors not defined", procName, 1);
- if (!pixs || pixGetDepth(pixs) != 32)
- return ERROR_INT("pixs not defined or not 32 bpp", procName, 1);
- if (factor <= 0)
- return ERROR_INT("factor must be > 0", procName, 1);
- amap = pixGetColorAmapHistogram(pixs, factor);
- *pncolors = l_amapSize(amap);
- l_amapDestroy(&amap);
- return 0;
-}
-
-
-/*!
- * \brief pixGetColorAmapHistogram()
- *
- * \param[in] pixs rgb or rgba
- * \param[in] factor subsampling factor; integer >= 1
- * \return amap, or NULL on error
- *
- *
- * Notes:
- * (1) This generates an ordered map from pixel value to histogram count.
- * (2) Use amapGetCountForColor() to use the map to look up a count.
- *
- */
-L_AMAP *
-pixGetColorAmapHistogram(PIX *pixs,
- l_int32 factor)
-{
-l_int32 i, j, w, h, wpl;
-l_uint32 *data, *line;
-L_AMAP *amap;
-RB_TYPE key, value;
-RB_TYPE *pval;
-
- PROCNAME("pixGetColorAmapHistogram");
-
- if (!pixs)
- return (L_AMAP *)ERROR_PTR("pixs not defined", procName, NULL);
- if (pixGetDepth(pixs) != 32)
- return (L_AMAP *)ERROR_PTR("pixs not 32 bpp", procName, NULL);
- if (factor <= 0)
- return (L_AMAP *)ERROR_PTR("factor must be > 0", procName, NULL);
- pixGetDimensions(pixs, &w, &h, NULL);
- data = pixGetData(pixs);
- wpl = pixGetWpl(pixs);
- amap = l_amapCreate(L_UINT_TYPE);
- for (i = 0; i < h; i += factor) {
- line = data + i * wpl;
- for (j = 0; j < w; j += factor) {
- key.utype = line[j];
- pval = l_amapFind(amap, key);
- if (!pval)
- value.itype = 1;
- else
- value.itype = 1 + pval->itype;
- l_amapInsert(amap, key, value);
- }
- }
-
- return amap;
-}
-
-
-/*!
- * \brief amapGetCountForColor()
- *
- * \param[in] amap map from pixel value to count
- * \param[in] val rgb or rgba pixel value
- * \return count, or -1 on error
- *
- *
- * Notes:
- * (1) The ordered map is made by pixGetColorAmapHistogram().
- *
- */
-l_int32
-amapGetCountForColor(L_AMAP *amap,
- l_uint32 val)
-{
-RB_TYPE key;
-RB_TYPE *pval;
-
- PROCNAME("amapGetCountForColor");
-
- if (!amap)
- return ERROR_INT("amap not defined", procName, -1);
-
- key.utype = val;
- pval = l_amapFind(amap, key);
- return (pval) ? pval->itype : 0;
-}
-
-
-/*!
- * \brief pixGetRankValue()
- *
- * \param[in] pixs 8 bpp, 32 bpp or colormapped
- * \param[in] factor subsampling factor; integer >= 1
- * \param[in] rank between 0.0 and 1.0; 1.0 is brightest, 0.0 is darkest
- * \param[out] pvalue pixel value corresponding to input rank
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) Simple function to get rank values of an image.
- * For a color image, the median value (rank = 0.5) can be
- * used to linearly remap the colors based on the median
- * of a target image, using pixLinearMapToTargetColor().
- *
- */
-l_ok
-pixGetRankValue(PIX *pixs,
- l_int32 factor,
- l_float32 rank,
- l_uint32 *pvalue)
-{
-l_int32 d;
-l_float32 val, rval, gval, bval;
-PIX *pixt;
-PIXCMAP *cmap;
-
- PROCNAME("pixGetRankValue");
-
- if (!pvalue)
- return ERROR_INT("&value not defined", procName, 1);
- *pvalue = 0;
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
- d = pixGetDepth(pixs);
- cmap = pixGetColormap(pixs);
- if (d != 8 && d != 32 && !cmap)
- return ERROR_INT("pixs not 8 or 32 bpp, or cmapped", procName, 1);
- if (cmap)
- pixt = pixRemoveColormap(pixs, REMOVE_CMAP_BASED_ON_SRC);
- else
- pixt = pixClone(pixs);
- d = pixGetDepth(pixt);
-
- if (d == 8) {
- pixGetRankValueMasked(pixt, NULL, 0, 0, factor, rank, &val, NULL);
- *pvalue = lept_roundftoi(val);
- } else {
- pixGetRankValueMaskedRGB(pixt, NULL, 0, 0, factor, rank,
- &rval, &gval, &bval);
- composeRGBPixel(lept_roundftoi(rval), lept_roundftoi(gval),
- lept_roundftoi(bval), pvalue);
- }
-
- pixDestroy(&pixt);
- return 0;
-}
-
-
-/*!
- * \brief pixGetRankValueMaskedRGB()
- *
- * \param[in] pixs 32 bpp
- * \param[in] pixm [optional] 1 bpp mask over which rank val is to be taken;
- * use all pixels if null
- * \param[in] x, y UL corner of pixm relative to the UL corner of pixs;
- * can be < 0; these values are ignored if pixm is null
- * \param[in] factor subsampling factor; integer >= 1
- * \param[in] rank between 0.0 and 1.0; 1.0 is brightest, 0.0 is darkest
- * \param[out] prval [optional] red component val for input rank
- * \param[out] pgval [optional] green component val for input rank
- * \param[out] pbval [optional] blue component val for input rank
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) Computes the rank component values of pixels in pixs that
- * are under the fg of the optional mask. If the mask is null, it
- * computes the average of the pixels in pixs.
- * (2) Set the subsampling %factor > 1 to reduce the amount of
- * computation.
- * (4) Input x,y are ignored unless pixm exists.
- * (5) The rank must be in [0.0 ... 1.0], where the brightest pixel
- * has rank 1.0. For the median pixel value, use 0.5.
- *
- */
-l_ok
-pixGetRankValueMaskedRGB(PIX *pixs,
- PIX *pixm,
- l_int32 x,
- l_int32 y,
- l_int32 factor,
- l_float32 rank,
- l_float32 *prval,
- l_float32 *pgval,
- l_float32 *pbval)
-{
-l_float32 scale;
-PIX *pixmt, *pixt;
-
- PROCNAME("pixGetRankValueMaskedRGB");
-
- if (prval) *prval = 0.0;
- if (pgval) *pgval = 0.0;
- if (pbval) *pbval = 0.0;
- if (!prval && !pgval && !pbval)
- return ERROR_INT("no results requested", procName, 1);
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
- if (pixGetDepth(pixs) != 32)
- return ERROR_INT("pixs not 32 bpp", procName, 1);
- if (pixm && pixGetDepth(pixm) != 1)
- return ERROR_INT("pixm not 1 bpp", procName, 1);
- if (factor < 1)
- return ERROR_INT("sampling factor must be >= 1", procName, 1);
- if (rank < 0.0 || rank > 1.0)
- return ERROR_INT("rank not in [0.0 ... 1.0]", procName, 1);
-
- pixmt = NULL;
- if (pixm) {
- scale = 1.0 / (l_float32)factor;
- pixmt = pixScale(pixm, scale, scale);
- }
- if (prval) {
- pixt = pixScaleRGBToGrayFast(pixs, factor, COLOR_RED);
- pixGetRankValueMasked(pixt, pixmt, x / factor, y / factor,
- factor, rank, prval, NULL);
- pixDestroy(&pixt);
- }
- if (pgval) {
- pixt = pixScaleRGBToGrayFast(pixs, factor, COLOR_GREEN);
- pixGetRankValueMasked(pixt, pixmt, x / factor, y / factor,
- factor, rank, pgval, NULL);
- pixDestroy(&pixt);
- }
- if (pbval) {
- pixt = pixScaleRGBToGrayFast(pixs, factor, COLOR_BLUE);
- pixGetRankValueMasked(pixt, pixmt, x / factor, y / factor,
- factor, rank, pbval, NULL);
- pixDestroy(&pixt);
- }
- pixDestroy(&pixmt);
- return 0;
-}
-
-
-/*!
- * \brief pixGetRankValueMasked()
- *
- * \param[in] pixs 8 bpp, or colormapped
- * \param[in] pixm [optional] 1 bpp mask, over which the rank val
- * is to be taken; use all pixels if null
- * \param[in] x, y UL corner of pixm relative to the UL corner of pixs;
- * can be < 0; these values are ignored if pixm is null
- * \param[in] factor subsampling factor; integer >= 1
- * \param[in] rank between 0.0 and 1.0; 1.0 is brightest, 0.0 is darkest
- * \param[out] pval pixel value corresponding to input rank
- * \param[out] pna [optional] of histogram
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) Computes the rank value of pixels in pixs that are under
- * the fg of the optional mask. If the mask is null, it
- * computes the average of the pixels in pixs.
- * (2) Set the subsampling %factor > 1 to reduce the amount of
- * computation.
- * (3) Clipping of pixm (if it exists) to pixs is done in the inner loop.
- * (4) Input x,y are ignored unless pixm exists.
- * (5) The rank must be in [0.0 ... 1.0], where the brightest pixel
- * has rank 1.0. For the median pixel value, use 0.5.
- * (6) The histogram can optionally be returned, so that other rank
- * values can be extracted without recomputing the histogram.
- * In that case, just use
- * numaHistogramGetValFromRank(na, rank, &val);
- * on the returned Numa for additional rank values.
- *
- */
-l_ok
-pixGetRankValueMasked(PIX *pixs,
- PIX *pixm,
- l_int32 x,
- l_int32 y,
- l_int32 factor,
- l_float32 rank,
- l_float32 *pval,
- NUMA **pna)
-{
-NUMA *na;
-
- PROCNAME("pixGetRankValueMasked");
-
- if (pna) *pna = NULL;
- if (!pval)
- return ERROR_INT("&val not defined", procName, 1);
- *pval = 0.0;
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
- if (pixGetDepth(pixs) != 8 && !pixGetColormap(pixs))
- return ERROR_INT("pixs neither 8 bpp nor colormapped", procName, 1);
- if (pixm && pixGetDepth(pixm) != 1)
- return ERROR_INT("pixm not 1 bpp", procName, 1);
- if (factor < 1)
- return ERROR_INT("sampling factor must be >= 1", procName, 1);
- if (rank < 0.0 || rank > 1.0)
- return ERROR_INT("rank not in [0.0 ... 1.0]", procName, 1);
-
- if ((na = pixGetGrayHistogramMasked(pixs, pixm, x, y, factor)) == NULL)
- return ERROR_INT("na not made", procName, 1);
- numaHistogramGetValFromRank(na, rank, pval);
- if (pna)
- *pna = na;
- else
- numaDestroy(&na);
-
- return 0;
-}
-
-
-/*!
- * \brief pixGetPixelAverage()
- *
- * \param[in] pixs 8 or 32 bpp, or colormapped
- * \param[in] pixm [optional] 1 bpp mask over which average is
- * to be taken; use all pixels if null
- * \param[in] x, y UL corner of pixm relative to the UL corner of pixs;
- * can be < 0
- * \param[in] factor subsampling factor; >= 1
- * \param[out] pval average pixel value
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) For rgb pix, this is a more direct computation of the
- * average value of the pixels in %pixs that are under the
- * mask %pixm. It is faster than pixGetPixelStats(), which
- * calls pixGetAverageMaskedRGB() and has the overhead of
- * generating a temporary pix of each of the three components;
- * this can take most of the time if %factor > 1.
- * (2) If %pixm is null, this gives the average value of all
- * pixels in %pixs. The returned value is an integer.
- * (3) For color %pixs, the returned pixel value is in the standard
- * uint32 RGBA packing.
- * (4) Clipping of pixm (if it exists) to pixs is done in the inner loop.
- * (5) Input x,y are ignored if %pixm does not exist.
- * (6) For general averaging of 1, 2, 4 or 8 bpp grayscale, use
- * pixAverageInRect().
- *
- */
-l_ok
-pixGetPixelAverage(PIX *pixs,
- PIX *pixm,
- l_int32 x,
- l_int32 y,
- l_int32 factor,
- l_uint32 *pval)
-{
-l_int32 i, j, w, h, d, wm, hm, wpl1, wplm, val, rval, gval, bval, count;
-l_uint32 *data1, *datam, *line1, *linem;
-l_float64 sum, rsum, gsum, bsum;
-PIX *pix1;
-
- PROCNAME("pixGetPixelAverage");
-
- if (!pval)
- return ERROR_INT("&val not defined", procName, 1);
- *pval = 0;
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
- d = pixGetDepth(pixs);
- if (d != 32 && !pixGetColormap(pixs))
- return ERROR_INT("pixs not rgb or colormapped", procName, 1);
- if (pixm && pixGetDepth(pixm) != 1)
- return ERROR_INT("pixm not 1 bpp", procName, 1);
- if (factor < 1)
- return ERROR_INT("sampling factor must be >= 1", procName, 1);
-
- if (pixGetColormap(pixs))
- pix1 = pixRemoveColormap(pixs, REMOVE_CMAP_BASED_ON_SRC);
- else
- pix1 = pixClone(pixs);
- pixGetDimensions(pix1, &w, &h, &d);
- if (d == 1) {
- pixDestroy(&pix1);
- return ERROR_INT("pix1 is just 1 bpp", procName, 1);
- }
- data1 = pixGetData(pix1);
- wpl1 = pixGetWpl(pix1);
-
- sum = rsum = gsum = bsum = 0.0;
- count = 0;
- if (!pixm) {
- for (i = 0; i < h; i += factor) {
- line1 = data1 + i * wpl1;
- for (j = 0; j < w; j += factor) {
- if (d == 8) {
- val = GET_DATA_BYTE(line1, j);
- sum += val;
- } else { /* rgb */
- extractRGBValues(*(line1 + j), &rval, &gval, &bval);
- rsum += rval;
- gsum += gval;
- bsum += bval;
- }
- count++;
- }
- }
- } else { /* masked */
- pixGetDimensions(pixm, &wm, &hm, NULL);
- datam = pixGetData(pixm);
- wplm = pixGetWpl(pixm);
- for (i = 0; i < hm; i += factor) {
- if (y + i < 0 || y + i >= h) continue;
- line1 = data1 + (y + i) * wpl1;
- linem = datam + i * wplm;
- for (j = 0; j < wm; j += factor) {
- if (x + j < 0 || x + j >= w) continue;
- if (GET_DATA_BIT(linem, j)) {
- if (d == 8) {
- val = GET_DATA_BYTE(line1, x + j);
- sum += val;
- } else { /* rgb */
- extractRGBValues(*(line1 + x + j), &rval, &gval, &bval);
- rsum += rval;
- gsum += gval;
- bsum += bval;
- }
- count++;
- }
- }
- }
- }
-
- pixDestroy(&pix1);
- if (count == 0)
- return ERROR_INT("no pixels sampled", procName, 1);
- if (d == 8) {
- *pval = (l_uint32)(sum / (l_float64)count);
- } else { /* d == 32 */
- rval = (l_uint32)(rsum / (l_float64)count);
- gval = (l_uint32)(gsum / (l_float64)count);
- bval = (l_uint32)(bsum / (l_float64)count);
- composeRGBPixel(rval, gval, bval, pval);
- }
-
- return 0;
-}
-
-
-/*!
- * \brief pixGetPixelStats()
- *
- * \param[in] pixs 8 bpp, 32 bpp or colormapped
- * \param[in] factor subsampling factor; integer >= 1
- * \param[in] type L_MEAN_ABSVAL, L_ROOT_MEAN_SQUARE,
- * L_STANDARD_DEVIATION, L_VARIANCE
- * \param[out] pvalue pixel value corresponding to input type
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) Simple function to get one of four statistical values of an image.
- * (2) It does not take a mask: it uses the entire image.
- * (3) To get the average pixel value of an RGB image, suggest using
- * pixGetPixelAverage(), which is considerably faster.
- *
- */
-l_ok
-pixGetPixelStats(PIX *pixs,
- l_int32 factor,
- l_int32 type,
- l_uint32 *pvalue)
-{
-l_int32 d;
-l_float32 val, rval, gval, bval;
-PIX *pixt;
-PIXCMAP *cmap;
-
- PROCNAME("pixGetPixelStats");
-
- if (!pvalue)
- return ERROR_INT("&value not defined", procName, 1);
- *pvalue = 0;
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
- d = pixGetDepth(pixs);
- cmap = pixGetColormap(pixs);
- if (d != 8 && d != 32 && !cmap)
- return ERROR_INT("pixs not 8 or 32 bpp, or cmapped", procName, 1);
- if (cmap)
- pixt = pixRemoveColormap(pixs, REMOVE_CMAP_BASED_ON_SRC);
- else
- pixt = pixClone(pixs);
- d = pixGetDepth(pixt);
-
- if (d == 8) {
- pixGetAverageMasked(pixt, NULL, 0, 0, factor, type, &val);
- *pvalue = lept_roundftoi(val);
- } else {
- pixGetAverageMaskedRGB(pixt, NULL, 0, 0, factor, type,
- &rval, &gval, &bval);
- composeRGBPixel(lept_roundftoi(rval), lept_roundftoi(gval),
- lept_roundftoi(bval), pvalue);
- }
-
- pixDestroy(&pixt);
- return 0;
-}
-
-
-/*!
- * \brief pixGetAverageMaskedRGB()
- *
- * \param[in] pixs 32 bpp, or colormapped
- * \param[in] pixm [optional] 1 bpp mask over which average is
- * to be taken; use all pixels if null
- * \param[in] x, y UL corner of pixm relative to the UL corner of pixs;
- * can be < 0
- * \param[in] factor subsampling factor; >= 1
- * \param[in] type L_MEAN_ABSVAL, L_ROOT_MEAN_SQUARE,
- * L_STANDARD_DEVIATION, L_VARIANCE
- * \param[out] prval [optional] measured red value of given 'type'
- * \param[out] pgval [optional] measured green value of given 'type'
- * \param[out] pbval [optional] measured blue value of given 'type'
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) For usage, see pixGetAverageMasked().
- * (2) If there is a colormap, it is removed before the 8 bpp
- * component images are extracted.
- * (3) A better name for this would be: pixGetPixelStatsRGB()
- *
- */
-l_ok
-pixGetAverageMaskedRGB(PIX *pixs,
- PIX *pixm,
- l_int32 x,
- l_int32 y,
- l_int32 factor,
- l_int32 type,
- l_float32 *prval,
- l_float32 *pgval,
- l_float32 *pbval)
-{
-PIX *pixt;
-PIXCMAP *cmap;
-
- PROCNAME("pixGetAverageMaskedRGB");
-
- if (prval) *prval = 0.0;
- if (pgval) *pgval = 0.0;
- if (pbval) *pbval = 0.0;
- if (!prval && !pgval && !pbval)
- return ERROR_INT("no values requested", procName, 1);
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
- cmap = pixGetColormap(pixs);
- if (pixGetDepth(pixs) != 32 && !cmap)
- return ERROR_INT("pixs neither 32 bpp nor colormapped", procName, 1);
- if (pixm && pixGetDepth(pixm) != 1)
- return ERROR_INT("pixm not 1 bpp", procName, 1);
- if (factor < 1)
- return ERROR_INT("sampling factor must be >= 1", procName, 1);
- if (type != L_MEAN_ABSVAL && type != L_ROOT_MEAN_SQUARE &&
- type != L_STANDARD_DEVIATION && type != L_VARIANCE)
- return ERROR_INT("invalid measure type", procName, 1);
-
- if (prval) {
- if (cmap)
- pixt = pixGetRGBComponentCmap(pixs, COLOR_RED);
- else
- pixt = pixGetRGBComponent(pixs, COLOR_RED);
- pixGetAverageMasked(pixt, pixm, x, y, factor, type, prval);
- pixDestroy(&pixt);
- }
- if (pgval) {
- if (cmap)
- pixt = pixGetRGBComponentCmap(pixs, COLOR_GREEN);
- else
- pixt = pixGetRGBComponent(pixs, COLOR_GREEN);
- pixGetAverageMasked(pixt, pixm, x, y, factor, type, pgval);
- pixDestroy(&pixt);
- }
- if (pbval) {
- if (cmap)
- pixt = pixGetRGBComponentCmap(pixs, COLOR_BLUE);
- else
- pixt = pixGetRGBComponent(pixs, COLOR_BLUE);
- pixGetAverageMasked(pixt, pixm, x, y, factor, type, pbval);
- pixDestroy(&pixt);
- }
-
- return 0;
-}
-
-
-/*!
- * \brief pixGetAverageMasked()
- *
- * \param[in] pixs 8 or 16 bpp, or colormapped
- * \param[in] pixm [optional] 1 bpp mask over which average is
- * to be taken; use all pixels if null
- * \param[in] x, y UL corner of pixm relative to the UL corner of pixs;
- * can be < 0
- * \param[in] factor subsampling factor; >= 1
- * \param[in] type L_MEAN_ABSVAL, L_ROOT_MEAN_SQUARE,
- * L_STANDARD_DEVIATION, L_VARIANCE
- * \param[out] pval measured value of given 'type'
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) Use L_MEAN_ABSVAL to get the average value of pixels in pixs
- * that are under the fg of the optional mask. If the mask
- * is null, it finds the average of the pixels in pixs.
- * (2) Likewise, use L_ROOT_MEAN_SQUARE to get the rms value of
- * pixels in pixs, either masked or not; L_STANDARD_DEVIATION
- * to get the standard deviation from the mean of the pixels;
- * L_VARIANCE to get the average squared difference from the
- * expected value. The variance is the square of the stdev.
- * For the standard deviation, we use
- * sqrt([([x] - x)]^2) = sqrt([x^2] - [x]^2)
- * (3) Set the subsampling %factor > 1 to reduce the amount of
- * computation.
- * (4) Clipping of pixm (if it exists) to pixs is done in the inner loop.
- * (5) Input x,y are ignored unless pixm exists.
- * (6) A better name for this would be: pixGetPixelStatsGray()
- *
- */
-l_ok
-pixGetAverageMasked(PIX *pixs,
- PIX *pixm,
- l_int32 x,
- l_int32 y,
- l_int32 factor,
- l_int32 type,
- l_float32 *pval)
-{
-l_int32 i, j, w, h, d, wm, hm, wplg, wplm, val, count;
-l_uint32 *datag, *datam, *lineg, *linem;
-l_float64 sumave, summs, ave, meansq, var;
-PIX *pixg;
-
- PROCNAME("pixGetAverageMasked");
-
- if (!pval)
- return ERROR_INT("&val not defined", procName, 1);
- *pval = 0.0;
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
- d = pixGetDepth(pixs);
- if (d != 8 && d != 16 && !pixGetColormap(pixs))
- return ERROR_INT("pixs not 8 or 16 bpp or colormapped", procName, 1);
- if (pixm && pixGetDepth(pixm) != 1)
- return ERROR_INT("pixm not 1 bpp", procName, 1);
- if (factor < 1)
- return ERROR_INT("sampling factor must be >= 1", procName, 1);
- if (type != L_MEAN_ABSVAL && type != L_ROOT_MEAN_SQUARE &&
- type != L_STANDARD_DEVIATION && type != L_VARIANCE)
- return ERROR_INT("invalid measure type", procName, 1);
-
- if (pixGetColormap(pixs))
- pixg = pixRemoveColormap(pixs, REMOVE_CMAP_TO_GRAYSCALE);
- else
- pixg = pixClone(pixs);
- pixGetDimensions(pixg, &w, &h, &d);
- datag = pixGetData(pixg);
- wplg = pixGetWpl(pixg);
-
- sumave = summs = 0.0;
- count = 0;
- if (!pixm) {
- for (i = 0; i < h; i += factor) {
- lineg = datag + i * wplg;
- for (j = 0; j < w; j += factor) {
- if (d == 8)
- val = GET_DATA_BYTE(lineg, j);
- else /* d == 16 */
- val = GET_DATA_TWO_BYTES(lineg, j);
- if (type != L_ROOT_MEAN_SQUARE)
- sumave += val;
- if (type != L_MEAN_ABSVAL)
- summs += (l_float64)(val) * val;
- count++;
- }
- }
- } else {
- pixGetDimensions(pixm, &wm, &hm, NULL);
- datam = pixGetData(pixm);
- wplm = pixGetWpl(pixm);
- for (i = 0; i < hm; i += factor) {
- if (y + i < 0 || y + i >= h) continue;
- lineg = datag + (y + i) * wplg;
- linem = datam + i * wplm;
- for (j = 0; j < wm; j += factor) {
- if (x + j < 0 || x + j >= w) continue;
- if (GET_DATA_BIT(linem, j)) {
- if (d == 8)
- val = GET_DATA_BYTE(lineg, x + j);
- else /* d == 16 */
- val = GET_DATA_TWO_BYTES(lineg, x + j);
- if (type != L_ROOT_MEAN_SQUARE)
- sumave += val;
- if (type != L_MEAN_ABSVAL)
- summs += (l_float64)(val) * val;
- count++;
- }
- }
- }
- }
-
- pixDestroy(&pixg);
- if (count == 0)
- return ERROR_INT("no pixels sampled", procName, 1);
- ave = sumave / (l_float64)count;
- meansq = summs / (l_float64)count;
- var = meansq - ave * ave;
- if (type == L_MEAN_ABSVAL)
- *pval = (l_float32)ave;
- else if (type == L_ROOT_MEAN_SQUARE)
- *pval = (l_float32)sqrt(meansq);
- else if (type == L_STANDARD_DEVIATION)
- *pval = (l_float32)sqrt(var);
- else /* type == L_VARIANCE */
- *pval = (l_float32)var;
-
- return 0;
-}
-
-
-/*!
- * \brief pixGetAverageTiledRGB()
- *
- * \param[in] pixs 32 bpp, or colormapped
- * \param[in] sx, sy tile size; must be at least 2 x 2
- * \param[in] type L_MEAN_ABSVAL, L_ROOT_MEAN_SQUARE, L_STANDARD_DEVIATION
- * \param[out] ppixr [optional] tiled 'average' of red component
- * \param[out] ppixg [optional] tiled 'average' of green component
- * \param[out] ppixb [optional] tiled 'average' of blue component
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) For usage, see pixGetAverageTiled().
- * (2) If there is a colormap, it is removed before the 8 bpp
- * component images are extracted.
- *
- */
-l_ok
-pixGetAverageTiledRGB(PIX *pixs,
- l_int32 sx,
- l_int32 sy,
- l_int32 type,
- PIX **ppixr,
- PIX **ppixg,
- PIX **ppixb)
-{
-PIX *pixt;
-PIXCMAP *cmap;
-
- PROCNAME("pixGetAverageTiledRGB");
-
- if (ppixr) *ppixr = NULL;
- if (ppixg) *ppixg = NULL;
- if (ppixb) *ppixb = NULL;
- if (!ppixr && !ppixg && !ppixb)
- return ERROR_INT("no data requested", procName, 1);
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
- cmap = pixGetColormap(pixs);
- if (pixGetDepth(pixs) != 32 && !cmap)
- return ERROR_INT("pixs neither 32 bpp nor colormapped", procName, 1);
- if (sx < 2 || sy < 2)
- return ERROR_INT("sx and sy not both > 1", procName, 1);
- if (type != L_MEAN_ABSVAL && type != L_ROOT_MEAN_SQUARE &&
- type != L_STANDARD_DEVIATION)
- return ERROR_INT("invalid measure type", procName, 1);
-
- if (ppixr) {
- if (cmap)
- pixt = pixGetRGBComponentCmap(pixs, COLOR_RED);
- else
- pixt = pixGetRGBComponent(pixs, COLOR_RED);
- *ppixr = pixGetAverageTiled(pixt, sx, sy, type);
- pixDestroy(&pixt);
- }
- if (ppixg) {
- if (cmap)
- pixt = pixGetRGBComponentCmap(pixs, COLOR_GREEN);
- else
- pixt = pixGetRGBComponent(pixs, COLOR_GREEN);
- *ppixg = pixGetAverageTiled(pixt, sx, sy, type);
- pixDestroy(&pixt);
- }
- if (ppixb) {
- if (cmap)
- pixt = pixGetRGBComponentCmap(pixs, COLOR_BLUE);
- else
- pixt = pixGetRGBComponent(pixs, COLOR_BLUE);
- *ppixb = pixGetAverageTiled(pixt, sx, sy, type);
- pixDestroy(&pixt);
- }
-
- return 0;
-}
-
-
-/*!
- * \brief pixGetAverageTiled()
- *
- * \param[in] pixs 8 bpp, or colormapped
- * \param[in] sx, sy tile size; must be at least 2 x 2
- * \param[in] type L_MEAN_ABSVAL, L_ROOT_MEAN_SQUARE, L_STANDARD_DEVIATION
- * \return pixd average values in each tile, or NULL on error
- *
- *
- * Notes:
- * (1) Only computes for tiles that are entirely contained in pixs.
- * (2) Use L_MEAN_ABSVAL to get the average abs value within the tile;
- * L_ROOT_MEAN_SQUARE to get the rms value within each tile;
- * L_STANDARD_DEVIATION to get the standard dev. from the average
- * within each tile.
- * (3) If colormapped, converts to 8 bpp gray.
- *
- */
-PIX *
-pixGetAverageTiled(PIX *pixs,
- l_int32 sx,
- l_int32 sy,
- l_int32 type)
-{
-l_int32 i, j, k, m, w, h, wd, hd, d, pos, wplt, wpld, valt;
-l_uint32 *datat, *datad, *linet, *lined, *startt;
-l_float64 sumave, summs, ave, meansq, normfact;
-PIX *pixt, *pixd;
-
- PROCNAME("pixGetAverageTiled");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- pixGetDimensions(pixs, &w, &h, &d);
- if (d != 8 && !pixGetColormap(pixs))
- return (PIX *)ERROR_PTR("pixs not 8 bpp or cmapped", procName, NULL);
- if (sx < 2 || sy < 2)
- return (PIX *)ERROR_PTR("sx and sy not both > 1", procName, NULL);
- wd = w / sx;
- hd = h / sy;
- if (wd < 1 || hd < 1)
- return (PIX *)ERROR_PTR("wd or hd == 0", procName, NULL);
- if (type != L_MEAN_ABSVAL && type != L_ROOT_MEAN_SQUARE &&
- type != L_STANDARD_DEVIATION)
- return (PIX *)ERROR_PTR("invalid measure type", procName, NULL);
-
- pixt = pixRemoveColormap(pixs, REMOVE_CMAP_TO_GRAYSCALE);
- pixd = pixCreate(wd, hd, 8);
- datat = pixGetData(pixt);
- wplt = pixGetWpl(pixt);
- datad = pixGetData(pixd);
- wpld = pixGetWpl(pixd);
- normfact = 1. / (l_float64)(sx * sy);
- for (i = 0; i < hd; i++) {
- lined = datad + i * wpld;
- linet = datat + i * sy * wplt;
- for (j = 0; j < wd; j++) {
- if (type == L_MEAN_ABSVAL || type == L_STANDARD_DEVIATION) {
- sumave = 0.0;
- for (k = 0; k < sy; k++) {
- startt = linet + k * wplt;
- for (m = 0; m < sx; m++) {
- pos = j * sx + m;
- valt = GET_DATA_BYTE(startt, pos);
- sumave += valt;
- }
- }
- ave = normfact * sumave;
- }
- if (type == L_ROOT_MEAN_SQUARE || type == L_STANDARD_DEVIATION) {
- summs = 0.0;
- for (k = 0; k < sy; k++) {
- startt = linet + k * wplt;
- for (m = 0; m < sx; m++) {
- pos = j * sx + m;
- valt = GET_DATA_BYTE(startt, pos);
- summs += (l_float64)(valt) * valt;
- }
- }
- meansq = normfact * summs;
- }
- if (type == L_MEAN_ABSVAL)
- valt = (l_int32)(ave + 0.5);
- else if (type == L_ROOT_MEAN_SQUARE)
- valt = (l_int32)(sqrt(meansq) + 0.5);
- else /* type == L_STANDARD_DEVIATION */
- valt = (l_int32)(sqrt(meansq - ave * ave) + 0.5);
- SET_DATA_BYTE(lined, j, valt);
- }
- }
-
- pixDestroy(&pixt);
- return pixd;
-}
-
-
-/*!
- * \brief pixRowStats()
- *
- * \param[in] pixs 8 bpp; not cmapped
- * \param[in] box [optional] clipping box; can be null
- * \param[out] pnamean [optional] numa of mean values
- * \param[out] pnamedian [optional] numa of median values
- * \param[out] pnamode [optional] numa of mode intensity values
- * \param[out] pnamodecount [optional] numa of mode counts
- * \param[out] pnavar [optional] numa of variance
- * \param[out] pnarootvar [optional] numa of square root of variance
- * \return na numa of requested statistic for each row, or NULL on error
- *
- *
- * Notes:
- * (1) This computes numas that represent column vectors of statistics,
- * with each of its values derived from the corresponding row of a Pix.
- * (2) Use NULL on input to prevent computation of any of the 5 numas.
- * (3) Other functions that compute pixel row statistics are:
- * pixCountPixelsByRow()
- * pixAverageByRow()
- * pixVarianceByRow()
- * pixGetRowStats()
- *
- */
-l_int32
-pixRowStats(PIX *pixs,
- BOX *box,
- NUMA **pnamean,
- NUMA **pnamedian,
- NUMA **pnamode,
- NUMA **pnamodecount,
- NUMA **pnavar,
- NUMA **pnarootvar)
-{
-l_int32 i, j, k, w, h, val, wpls, sum, sumsq, target, max, modeval;
-l_int32 xstart, xend, ystart, yend, bw, bh;
-l_int32 *histo;
-l_uint32 *lines, *datas;
-l_float32 norm;
-l_float32 *famean, *fameansq, *favar, *farootvar;
-l_float32 *famedian, *famode, *famodecount;
-
- PROCNAME("pixRowStats");
-
- if (pnamean) *pnamean = NULL;
- if (pnamedian) *pnamedian = NULL;
- if (pnamode) *pnamode = NULL;
- if (pnamodecount) *pnamodecount = NULL;
- if (pnavar) *pnavar = NULL;
- if (pnarootvar) *pnarootvar = NULL;
- if (!pixs || pixGetDepth(pixs) != 8)
- return ERROR_INT("pixs undefined or not 8 bpp", procName, 1);
- famean = fameansq = favar = farootvar = NULL;
- famedian = famode = famodecount = NULL;
-
- pixGetDimensions(pixs, &w, &h, NULL);
- if (boxClipToRectangleParams(box, w, h, &xstart, &ystart, &xend, ¥d,
- &bw, &bh) == 1)
- return ERROR_INT("invalid clipping box", procName, 1);
-
- /* We need the mean for variance and root variance */
- datas = pixGetData(pixs);
- wpls = pixGetWpl(pixs);
- if (pnamean || pnavar || pnarootvar) {
- norm = 1. / (l_float32)bw;
- famean = (l_float32 *)LEPT_CALLOC(bh, sizeof(l_float32));
- fameansq = (l_float32 *)LEPT_CALLOC(bh, sizeof(l_float32));
- if (pnavar || pnarootvar) {
- favar = (l_float32 *)LEPT_CALLOC(bh, sizeof(l_float32));
- if (pnarootvar)
- farootvar = (l_float32 *)LEPT_CALLOC(bh, sizeof(l_float32));
- }
- for (i = ystart; i < yend; i++) {
- sum = sumsq = 0;
- lines = datas + i * wpls;
- for (j = xstart; j < xend; j++) {
- val = GET_DATA_BYTE(lines, j);
- sum += val;
- sumsq += val * val;
- }
- famean[i] = norm * sum;
- fameansq[i] = norm * sumsq;
- if (pnavar || pnarootvar) {
- favar[i] = fameansq[i] - famean[i] * famean[i];
- if (pnarootvar)
- farootvar[i] = sqrtf(favar[i]);
- }
- }
- LEPT_FREE(fameansq);
- if (pnamean)
- *pnamean = numaCreateFromFArray(famean, bh, L_INSERT);
- else
- LEPT_FREE(famean);
- if (pnavar)
- *pnavar = numaCreateFromFArray(favar, bh, L_INSERT);
- else
- LEPT_FREE(favar);
- if (pnarootvar)
- *pnarootvar = numaCreateFromFArray(farootvar, bh, L_INSERT);
- }
-
- /* We need a histogram to find the median and/or mode values */
- if (pnamedian || pnamode || pnamodecount) {
- histo = (l_int32 *)LEPT_CALLOC(256, sizeof(l_int32));
- if (pnamedian) {
- *pnamedian = numaMakeConstant(0, bh);
- famedian = numaGetFArray(*pnamedian, L_NOCOPY);
- }
- if (pnamode) {
- *pnamode = numaMakeConstant(0, bh);
- famode = numaGetFArray(*pnamode, L_NOCOPY);
- }
- if (pnamodecount) {
- *pnamodecount = numaMakeConstant(0, bh);
- famodecount = numaGetFArray(*pnamodecount, L_NOCOPY);
- }
- for (i = ystart; i < yend; i++) {
- lines = datas + i * wpls;
- memset(histo, 0, 1024);
- for (j = xstart; j < xend; j++) {
- val = GET_DATA_BYTE(lines, j);
- histo[val]++;
- }
-
- if (pnamedian) {
- sum = 0;
- target = (bw + 1) / 2;
- for (k = 0; k < 256; k++) {
- sum += histo[k];
- if (sum >= target) {
- famedian[i] = k;
- break;
- }
- }
- }
-
- if (pnamode || pnamodecount) {
- max = 0;
- modeval = 0;
- for (k = 0; k < 256; k++) {
- if (histo[k] > max) {
- max = histo[k];
- modeval = k;
- }
- }
- if (pnamode)
- famode[i] = modeval;
- if (pnamodecount)
- famodecount[i] = max;
- }
- }
- LEPT_FREE(histo);
- }
-
- return 0;
-}
-
-
-/*!
- * \brief pixColumnStats()
- *
- * \param[in] pixs 8 bpp; not cmapped
- * \param[in] box [optional] clipping box; can be null
- * \param[out] pnamean [optional] numa of mean values
- * \param[out] pnamedian [optional] numa of median values
- * \param[out] pnamode [optional] numa of mode intensity values
- * \param[out] pnamodecount [optional] numa of mode counts
- * \param[out] pnavar [optional] numa of variance
- * \param[out] pnarootvar [optional] numa of square root of variance
- * \return na numa of requested statistic for each column,
- * or NULL on error
- *
- *
- * Notes:
- * (1) This computes numas that represent row vectors of statistics,
- * with each of its values derived from the corresponding col of a Pix.
- * (2) Use NULL on input to prevent computation of any of the 5 numas.
- * (3) Other functions that compute pixel column statistics are:
- * pixCountPixelsByColumn()
- * pixAverageByColumn()
- * pixVarianceByColumn()
- * pixGetColumnStats()
- *
- */
-l_int32
-pixColumnStats(PIX *pixs,
- BOX *box,
- NUMA **pnamean,
- NUMA **pnamedian,
- NUMA **pnamode,
- NUMA **pnamodecount,
- NUMA **pnavar,
- NUMA **pnarootvar)
-{
-l_int32 i, j, k, w, h, val, wpls, sum, sumsq, target, max, modeval;
-l_int32 xstart, xend, ystart, yend, bw, bh;
-l_int32 *histo;
-l_uint32 *lines, *datas;
-l_float32 norm;
-l_float32 *famean, *fameansq, *favar, *farootvar;
-l_float32 *famedian, *famode, *famodecount;
-
- PROCNAME("pixColumnStats");
-
- if (pnamean) *pnamean = NULL;
- if (pnamedian) *pnamedian = NULL;
- if (pnamode) *pnamode = NULL;
- if (pnamodecount) *pnamodecount = NULL;
- if (pnavar) *pnavar = NULL;
- if (pnarootvar) *pnarootvar = NULL;
- if (!pixs || pixGetDepth(pixs) != 8)
- return ERROR_INT("pixs undefined or not 8 bpp", procName, 1);
- famean = fameansq = favar = farootvar = NULL;
- famedian = famode = famodecount = NULL;
-
- pixGetDimensions(pixs, &w, &h, NULL);
- if (boxClipToRectangleParams(box, w, h, &xstart, &ystart, &xend, ¥d,
- &bw, &bh) == 1)
- return ERROR_INT("invalid clipping box", procName, 1);
-
- /* We need the mean for variance and root variance */
- datas = pixGetData(pixs);
- wpls = pixGetWpl(pixs);
- if (pnamean || pnavar || pnarootvar) {
- norm = 1. / (l_float32)bh;
- famean = (l_float32 *)LEPT_CALLOC(bw, sizeof(l_float32));
- fameansq = (l_float32 *)LEPT_CALLOC(bw, sizeof(l_float32));
- if (pnavar || pnarootvar) {
- favar = (l_float32 *)LEPT_CALLOC(bw, sizeof(l_float32));
- if (pnarootvar)
- farootvar = (l_float32 *)LEPT_CALLOC(bw, sizeof(l_float32));
- }
- for (j = xstart; j < xend; j++) {
- sum = sumsq = 0;
- for (i = ystart, lines = datas; i < yend; lines += wpls, i++) {
- val = GET_DATA_BYTE(lines, j);
- sum += val;
- sumsq += val * val;
- }
- famean[j] = norm * sum;
- fameansq[j] = norm * sumsq;
- if (pnavar || pnarootvar) {
- favar[j] = fameansq[j] - famean[j] * famean[j];
- if (pnarootvar)
- farootvar[j] = sqrtf(favar[j]);
- }
- }
- LEPT_FREE(fameansq);
- if (pnamean)
- *pnamean = numaCreateFromFArray(famean, bw, L_INSERT);
- else
- LEPT_FREE(famean);
- if (pnavar)
- *pnavar = numaCreateFromFArray(favar, bw, L_INSERT);
- else
- LEPT_FREE(favar);
- if (pnarootvar)
- *pnarootvar = numaCreateFromFArray(farootvar, bw, L_INSERT);
- }
-
- /* We need a histogram to find the median and/or mode values */
- if (pnamedian || pnamode || pnamodecount) {
- histo = (l_int32 *)LEPT_CALLOC(256, sizeof(l_int32));
- if (pnamedian) {
- *pnamedian = numaMakeConstant(0, bw);
- famedian = numaGetFArray(*pnamedian, L_NOCOPY);
- }
- if (pnamode) {
- *pnamode = numaMakeConstant(0, bw);
- famode = numaGetFArray(*pnamode, L_NOCOPY);
- }
- if (pnamodecount) {
- *pnamodecount = numaMakeConstant(0, bw);
- famodecount = numaGetFArray(*pnamodecount, L_NOCOPY);
- }
- for (j = xstart; j < xend; j++) {
- memset(histo, 0, 1024);
- for (i = ystart, lines = datas; i < yend; lines += wpls, i++) {
- val = GET_DATA_BYTE(lines, j);
- histo[val]++;
- }
-
- if (pnamedian) {
- sum = 0;
- target = (bh + 1) / 2;
- for (k = 0; k < 256; k++) {
- sum += histo[k];
- if (sum >= target) {
- famedian[j] = k;
- break;
- }
- }
- }
-
- if (pnamode || pnamodecount) {
- max = 0;
- modeval = 0;
- for (k = 0; k < 256; k++) {
- if (histo[k] > max) {
- max = histo[k];
- modeval = k;
- }
- }
- if (pnamode)
- famode[j] = modeval;
- if (pnamodecount)
- famodecount[j] = max;
- }
- }
- LEPT_FREE(histo);
- }
-
- return 0;
-}
-
-
-/*!
- * \brief pixGetRangeValues()
- *
- * \param[in] pixs 8 bpp grayscale, 32 bpp rgb, or colormapped
- * \param[in] factor subsampling factor; >= 1; ignored if colormapped
- * \param[in] color L_SELECT_RED, L_SELECT_GREEN or L_SELECT_BLUE
- * \param[out] pminval [optional] minimum value of component
- * \param[out] pmaxval [optional] maximum value of component
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) If pixs is 8 bpp grayscale, the color selection type is ignored.
- *
- */
-l_ok
-pixGetRangeValues(PIX *pixs,
- l_int32 factor,
- l_int32 color,
- l_int32 *pminval,
- l_int32 *pmaxval)
-{
-l_int32 d;
-PIXCMAP *cmap;
-
- PROCNAME("pixGetRangeValues");
-
- if (pminval) *pminval = 0;
- if (pmaxval) *pmaxval = 0;
- if (!pminval && !pmaxval)
- return ERROR_INT("no result requested", procName, 1);
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
-
- cmap = pixGetColormap(pixs);
- if (cmap)
- return pixcmapGetRangeValues(cmap, color, pminval, pmaxval,
- NULL, NULL);
-
- if (factor < 1)
- return ERROR_INT("sampling factor must be >= 1", procName, 1);
- d = pixGetDepth(pixs);
- if (d != 8 && d != 32)
- return ERROR_INT("pixs not 8 or 32 bpp", procName, 1);
-
- if (d == 8) {
- pixGetExtremeValue(pixs, factor, L_SELECT_MIN,
- NULL, NULL, NULL, pminval);
- pixGetExtremeValue(pixs, factor, L_SELECT_MAX,
- NULL, NULL, NULL, pmaxval);
- } else if (color == L_SELECT_RED) {
- pixGetExtremeValue(pixs, factor, L_SELECT_MIN,
- pminval, NULL, NULL, NULL);
- pixGetExtremeValue(pixs, factor, L_SELECT_MAX,
- pmaxval, NULL, NULL, NULL);
- } else if (color == L_SELECT_GREEN) {
- pixGetExtremeValue(pixs, factor, L_SELECT_MIN,
- NULL, pminval, NULL, NULL);
- pixGetExtremeValue(pixs, factor, L_SELECT_MAX,
- NULL, pmaxval, NULL, NULL);
- } else if (color == L_SELECT_BLUE) {
- pixGetExtremeValue(pixs, factor, L_SELECT_MIN,
- NULL, NULL, pminval, NULL);
- pixGetExtremeValue(pixs, factor, L_SELECT_MAX,
- NULL, NULL, pmaxval, NULL);
- } else {
- return ERROR_INT("invalid color", procName, 1);
- }
-
- return 0;
-}
-
-
-/*!
- * \brief pixGetExtremeValue()
- *
- * \param[in] pixs 8 bpp grayscale, 32 bpp rgb, or colormapped
- * \param[in] factor subsampling factor; >= 1; ignored if colormapped
- * \param[in] type L_SELECT_MIN or L_SELECT_MAX
- * \param[out] prval [optional] red component
- * \param[out] pgval [optional] green component
- * \param[out] pbval [optional] blue component
- * \param[out] pgrayval [optional] min or max gray value
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) If pixs is grayscale, the result is returned in &grayval.
- * Otherwise, if there is a colormap or d == 32,
- * each requested color component is returned. At least
- * one color component (address) must be input.
- *
- */
-l_ok
-pixGetExtremeValue(PIX *pixs,
- l_int32 factor,
- l_int32 type,
- l_int32 *prval,
- l_int32 *pgval,
- l_int32 *pbval,
- l_int32 *pgrayval)
-{
-l_int32 i, j, w, h, d, wpl;
-l_int32 val, extval, rval, gval, bval, extrval, extgval, extbval;
-l_uint32 pixel;
-l_uint32 *data, *line;
-PIXCMAP *cmap;
-
- PROCNAME("pixGetExtremeValue");
-
- if (prval) *prval = -1;
- if (pgval) *pgval = -1;
- if (pbval) *pbval = -1;
- if (pgrayval) *pgrayval = -1;
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
- if (type != L_SELECT_MIN && type != L_SELECT_MAX)
- return ERROR_INT("invalid type", procName, 1);
-
- cmap = pixGetColormap(pixs);
- if (cmap) {
- if (type == L_SELECT_MIN) {
- if (prval) pixcmapGetRangeValues(cmap, L_SELECT_RED, prval, NULL,
- NULL, NULL);
- if (pgval) pixcmapGetRangeValues(cmap, L_SELECT_GREEN, pgval, NULL,
- NULL, NULL);
- if (pbval) pixcmapGetRangeValues(cmap, L_SELECT_BLUE, pbval, NULL,
- NULL, NULL);
- } else { /* type == L_SELECT_MAX */
- if (prval) pixcmapGetRangeValues(cmap, L_SELECT_RED, NULL, prval,
- NULL, NULL);
- if (pgval) pixcmapGetRangeValues(cmap, L_SELECT_GREEN, NULL, pgval,
- NULL, NULL);
- if (pbval) pixcmapGetRangeValues(cmap, L_SELECT_BLUE, NULL, pbval,
- NULL, NULL);
- }
- return 0;
- }
-
- pixGetDimensions(pixs, &w, &h, &d);
- if (factor < 1)
- return ERROR_INT("sampling factor must be >= 1", procName, 1);
- if (d != 8 && d != 32)
- return ERROR_INT("pixs not 8 or 32 bpp", procName, 1);
- if (d == 8 && !pgrayval)
- return ERROR_INT("can't return result in grayval", procName, 1);
- if (d == 32 && !prval && !pgval && !pbval)
- return ERROR_INT("can't return result in r/g/b-val", procName, 1);
-
- data = pixGetData(pixs);
- wpl = pixGetWpl(pixs);
- if (d == 8) {
- if (type == L_SELECT_MIN)
- extval = 100000;
- else /* get max */
- extval = -1;
-
- for (i = 0; i < h; i += factor) {
- line = data + i * wpl;
- for (j = 0; j < w; j += factor) {
- val = GET_DATA_BYTE(line, j);
- if ((type == L_SELECT_MIN && val < extval) ||
- (type == L_SELECT_MAX && val > extval))
- extval = val;
- }
- }
- *pgrayval = extval;
- return 0;
- }
-
- /* 32 bpp rgb */
- if (type == L_SELECT_MIN) {
- extrval = 100000;
- extgval = 100000;
- extbval = 100000;
- } else {
- extrval = -1;
- extgval = -1;
- extbval = -1;
- }
- for (i = 0; i < h; i += factor) {
- line = data + i * wpl;
- for (j = 0; j < w; j += factor) {
- pixel = line[j];
- if (prval) {
- rval = (pixel >> L_RED_SHIFT) & 0xff;
- if ((type == L_SELECT_MIN && rval < extrval) ||
- (type == L_SELECT_MAX && rval > extrval))
- extrval = rval;
- }
- if (pgval) {
- gval = (pixel >> L_GREEN_SHIFT) & 0xff;
- if ((type == L_SELECT_MIN && gval < extgval) ||
- (type == L_SELECT_MAX && gval > extgval))
- extgval = gval;
- }
- if (pbval) {
- bval = (pixel >> L_BLUE_SHIFT) & 0xff;
- if ((type == L_SELECT_MIN && bval < extbval) ||
- (type == L_SELECT_MAX && bval > extbval))
- extbval = bval;
- }
- }
- }
- if (prval) *prval = extrval;
- if (pgval) *pgval = extgval;
- if (pbval) *pbval = extbval;
- return 0;
-}
-
-
-/*!
- * \brief pixGetMaxValueInRect()
- *
- * \param[in] pixs 8, 16 or 32 bpp grayscale; no color space components
- * \param[in] box [optional] region; set box = NULL to use entire pixs
- * \param[out] pmaxval [optional] max value in region
- * \param[out] pxmax [optional] x location of max value
- * \param[out] pymax [optional] y location of max value
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This can be used to find the maximum and its location
- * in a 2-dimensional histogram, where the x and y directions
- * represent two color components (e.g., saturation and hue).
- * (2) Note that here a 32 bpp pixs has pixel values that are simply
- * numbers. They are not 8 bpp components in a colorspace.
- *
- */
-l_ok
-pixGetMaxValueInRect(PIX *pixs,
- BOX *box,
- l_uint32 *pmaxval,
- l_int32 *pxmax,
- l_int32 *pymax)
-{
-l_int32 i, j, w, h, d, wpl, bw, bh;
-l_int32 xstart, ystart, xend, yend, xmax, ymax;
-l_uint32 val, maxval;
-l_uint32 *data, *line;
-
- PROCNAME("pixGetMaxValueInRect");
-
- if (pmaxval) *pmaxval = 0;
- if (pxmax) *pxmax = 0;
- if (pymax) *pymax = 0;
- if (!pmaxval && !pxmax && !pymax)
- return ERROR_INT("no data requested", procName, 1);
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
- if (pixGetColormap(pixs) != NULL)
- return ERROR_INT("pixs has colormap", procName, 1);
- pixGetDimensions(pixs, &w, &h, &d);
- if (d != 8 && d != 16 && d != 32)
- return ERROR_INT("pixs not 8, 16 or 32 bpp", procName, 1);
-
- xstart = ystart = 0;
- xend = w - 1;
- yend = h - 1;
- if (box) {
- boxGetGeometry(box, &xstart, &ystart, &bw, &bh);
- xend = xstart + bw - 1;
- yend = ystart + bh - 1;
- }
-
- data = pixGetData(pixs);
- wpl = pixGetWpl(pixs);
- maxval = 0;
- xmax = ymax = 0;
- for (i = ystart; i <= yend; i++) {
- line = data + i * wpl;
- for (j = xstart; j <= xend; j++) {
- if (d == 8)
- val = GET_DATA_BYTE(line, j);
- else if (d == 16)
- val = GET_DATA_TWO_BYTES(line, j);
- else /* d == 32 */
- val = line[j];
- if (val > maxval) {
- maxval = val;
- xmax = j;
- ymax = i;
- }
- }
- }
- if (maxval == 0) { /* no counts; pick the center of the rectangle */
- xmax = (xstart + xend) / 2;
- ymax = (ystart + yend) / 2;
- }
-
- if (pmaxval) *pmaxval = maxval;
- if (pxmax) *pxmax = xmax;
- if (pymax) *pymax = ymax;
- return 0;
-}
-
-
-/*!
- * \brief pixGetBinnedComponentRange()
- *
- * \param[in] pixs 32 bpp rgb
- * \param[in] nbins number of equal population bins; must be > 1
- * \param[in] factor subsampling factor; >= 1
- * \param[in] color L_SELECT_RED, L_SELECT_GREEN or L_SELECT_BLUE
- * \param[out] pminval [optional] minimum value of component
- * \param[out] pmaxval [optional] maximum value of component
- * \param[out] pcarray [optional] color array of bins
- * \param[in] fontsize [optional] 0 for no debug; for debug, valid set
- * is {4,6,8,10,12,14,16,18,20}.
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This returns the min and max average values of the
- * selected color component in the set of rank bins,
- * where the ranking is done using the specified component.
- *
- */
-l_ok
-pixGetBinnedComponentRange(PIX *pixs,
- l_int32 nbins,
- l_int32 factor,
- l_int32 color,
- l_int32 *pminval,
- l_int32 *pmaxval,
- l_uint32 **pcarray,
- l_int32 fontsize)
-{
-l_int32 i, minval, maxval, rval, gval, bval;
-l_uint32 *carray;
-PIX *pixt;
-
- PROCNAME("pixGetBinnedComponentRange");
-
- if (pminval) *pminval = 0;
- if (pmaxval) *pmaxval = 0;
- if (pcarray) *pcarray = NULL;
- if (!pminval && !pmaxval)
- return ERROR_INT("no result requested", procName, 1);
- if (!pixs || pixGetDepth(pixs) != 32)
- return ERROR_INT("pixs not defined or not 32 bpp", procName, 1);
- if (factor < 1)
- return ERROR_INT("sampling factor must be >= 1", procName, 1);
- if (color != L_SELECT_RED && color != L_SELECT_GREEN &&
- color != L_SELECT_BLUE)
- return ERROR_INT("invalid color", procName, 1);
- if (fontsize < 0 || fontsize > 20 || fontsize & 1 || fontsize == 2)
- return ERROR_INT("invalid fontsize", procName, 1);
-
- pixGetRankColorArray(pixs, nbins, color, factor, &carray, NULL, 0);
- if (fontsize > 0) {
- for (i = 0; i < nbins; i++)
- L_INFO("c[%d] = %x\n", procName, i, carray[i]);
- pixt = pixDisplayColorArray(carray, nbins, 200, 5, fontsize);
- pixDisplay(pixt, 100, 100);
- pixDestroy(&pixt);
- }
-
- extractRGBValues(carray[0], &rval, &gval, &bval);
- minval = rval;
- if (color == L_SELECT_GREEN)
- minval = gval;
- else if (color == L_SELECT_BLUE)
- minval = bval;
- extractRGBValues(carray[nbins - 1], &rval, &gval, &bval);
- maxval = rval;
- if (color == L_SELECT_GREEN)
- maxval = gval;
- else if (color == L_SELECT_BLUE)
- maxval = bval;
-
- if (pminval) *pminval = minval;
- if (pmaxval) *pmaxval = maxval;
- if (pcarray)
- *pcarray = carray;
- else
- LEPT_FREE(carray);
- return 0;
-}
-
-
-/*!
- * \brief pixGetRankColorArray()
- *
- * \param[in] pixs 32 bpp or cmapped
- * \param[in] nbins number of equal population bins; must be > 1
- * \param[in] type color selection flag
- * \param[in] factor subsampling factor; integer >= 1
- * \param[out] pcarray array of colors, ranked by intensity
- * \param[in] pixadb [optional] debug: caller passes this in.
- * Use to display color squares and to
- * capture plots of color components
- * \param[in] fontsize [optional] debug: only used if pixadb exists.
- * Valid set is {4,6,8,10,12,14,16,18,20}.
- * fontsize == 6 is typical.
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) The color selection flag is one of: L_SELECT_RED, L_SELECT_GREEN,
- * L_SELECT_BLUE, L_SELECT_MIN, L_SELECT_MAX, L_SELECT_AVERAGE,
- * L_SELECT_HUE, L_SELECT_SATURATION.
- * (2) Then it finds the histogram of the selected color type in each
- * RGB pixel. For each of the %nbins sets of pixels,
- * ordered by this color type value, find the average RGB color,
- * and return this as a "rank color" array. The output array
- * has %nbins colors.
- * (3) Set the subsampling factor > 1 to reduce the amount of
- * computation. Typically you want at least 10,000 pixels
- * for reasonable statistics.
- * (4) The rank color as a function of rank can then be found from
- * rankint = (l_int32)(rank * (nbins - 1) + 0.5);
- * extractRGBValues(array[rankint], &rval, &gval, &bval);
- * where the rank is in [0.0 ... 1.0].
- * This function is meant to be simple and approximate.
- * (5) Compare this with pixGetBinnedColor(), which generates equal
- * width intensity bins and finds the average color in each bin.
- *
- */
-l_ok
-pixGetRankColorArray(PIX *pixs,
- l_int32 nbins,
- l_int32 type,
- l_int32 factor,
- l_uint32 **pcarray,
- PIXA *pixadb,
- l_int32 fontsize)
-{
-l_int32 ret;
-l_uint32 *array;
-NUMA *na, *nan, *narbin;
-PIX *pix1, *pixc, *pixg, *pixd;
-PIXCMAP *cmap;
-
- PROCNAME("pixGetRankColorArray");
-
- if (!pcarray)
- return ERROR_INT("&carray not defined", procName, 1);
- *pcarray = NULL;
- if (factor < 1)
- return ERROR_INT("sampling factor must be >= 1", procName, 1);
- if (nbins < 2)
- return ERROR_INT("nbins must be at least 2", procName, 1);
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
- cmap = pixGetColormap(pixs);
- if (pixGetDepth(pixs) != 32 && !cmap)
- return ERROR_INT("pixs neither 32 bpp nor cmapped", procName, 1);
- if (type != L_SELECT_RED && type != L_SELECT_GREEN &&
- type != L_SELECT_BLUE && type != L_SELECT_MIN &&
- type != L_SELECT_MAX && type != L_SELECT_AVERAGE &&
- type != L_SELECT_HUE && type != L_SELECT_SATURATION)
- return ERROR_INT("invalid type", procName, 1);
- if (pixadb) {
- if (fontsize < 0 || fontsize > 20 || fontsize & 1 || fontsize == 2) {
- L_WARNING("invalid fontsize %d; setting to 6\n", procName,
- fontsize);
- fontsize = 6;
- }
- }
-
- /* Downscale by factor and remove colormap if it exists */
- pix1 = pixScaleByIntSampling(pixs, factor);
- if (cmap)
- pixc = pixRemoveColormap(pix1, REMOVE_CMAP_TO_FULL_COLOR);
- else
- pixc = pixClone(pix1);
- pixDestroy(&pix1);
-
- /* Get normalized histogram of the selected component */
- if (type == L_SELECT_RED)
- pixg = pixGetRGBComponent(pixc, COLOR_RED);
- else if (type == L_SELECT_GREEN)
- pixg = pixGetRGBComponent(pixc, COLOR_GREEN);
- else if (type == L_SELECT_BLUE)
- pixg = pixGetRGBComponent(pixc, COLOR_BLUE);
- else if (type == L_SELECT_MIN)
- pixg = pixConvertRGBToGrayMinMax(pixc, L_CHOOSE_MIN);
- else if (type == L_SELECT_MAX)
- pixg = pixConvertRGBToGrayMinMax(pixc, L_CHOOSE_MAX);
- else if (type == L_SELECT_AVERAGE)
- pixg = pixConvertRGBToGray(pixc, 0.34, 0.33, 0.33);
- else if (type == L_SELECT_HUE)
- pixg = pixConvertRGBToHue(pixc);
- else /* L_SELECT_SATURATION */
- pixg = pixConvertRGBToSaturation(pixc);
- if ((na = pixGetGrayHistogram(pixg, 1)) == NULL) {
- pixDestroy(&pixc);
- pixDestroy(&pixg);
- return ERROR_INT("na not made", procName, 1);
- }
- nan = numaNormalizeHistogram(na, 1.0);
-
- /* Get the following arrays:
- * (1) nar: cumulative normalized histogram (rank vs intensity value).
- * With 256 intensity values, we have 257 rank values.
- * (2) nai: "average" intensity as function of rank bin, for
- * %nbins equally spaced in rank between 0.0 and 1.0.
- * (3) narbin: bin number of discretized rank as a function of
- * intensity. This is the 'inverse' of nai.
- * (4) nabb: intensity value of the right bin boundary, for each
- * of the %nbins discretized rank bins. */
- if (!pixadb) {
- numaDiscretizeRankAndIntensity(nan, nbins, &narbin, NULL, NULL, NULL);
- } else {
- NUMA *nai, *nar, *nabb;
- numaDiscretizeRankAndIntensity(nan, nbins, &narbin, &nai, &nar, &nabb);
- lept_mkdir("lept/regout");
- pix1 = gplotSimplePix1(nan, "Normalized Histogram");
- pixaAddPix(pixadb, pix1, L_INSERT);
- pix1 = gplotSimplePix1(nar, "Cumulative Histogram");
- pixaAddPix(pixadb, pix1, L_INSERT);
- pix1 = gplotSimplePix1(nai, "Intensity vs. rank bin");
- pixaAddPix(pixadb, pix1, L_INSERT);
- pix1 = gplotSimplePix1(narbin, "LUT: rank bin vs. Intensity");
- pixaAddPix(pixadb, pix1, L_INSERT);
- pix1 = gplotSimplePix1(nabb, "Intensity of right edge vs. rank bin");
- pixaAddPix(pixadb, pix1, L_INSERT);
- numaDestroy(&nai);
- numaDestroy(&nar);
- numaDestroy(&nabb);
- }
-
- /* Get the average color in each bin for pixels whose grayscale
- * values fall in the bin range. %narbin is the LUT that
- * determines the bin number from the grayscale version of
- * the image. Because this mapping may not be unique,
- * some bins may not be represented in the LUT. In use, to get fair
- * allocation into all the bins, bin population is monitored
- * as pixels are accumulated, and when bins fill up,
- * pixels are required to overflow into succeeding bins. */
- pixGetBinnedColor(pixc, pixg, 1, nbins, narbin, pcarray, pixadb);
- ret = 0;
- if ((array = *pcarray) == NULL) {
- L_ERROR("color array not returned\n", procName);
- ret = 1;
- }
- if (array && pixadb) {
- pixd = pixDisplayColorArray(array, nbins, 200, 5, fontsize);
- pixWriteDebug("/tmp/lept/regout/rankhisto.png", pixd, IFF_PNG);
- pixDestroy(&pixd);
- }
-
- pixDestroy(&pixc);
- pixDestroy(&pixg);
- numaDestroy(&na);
- numaDestroy(&nan);
- numaDestroy(&narbin);
- return ret;
-}
-
-
-/*!
- * \brief pixGetBinnedColor()
- *
- * \param[in] pixs 32 bpp
- * \param[in] pixg 8 bpp grayscale version of pixs
- * \param[in] factor sampling factor along pixel counting direction
- * \param[in] nbins number of intensity bins
- * \param[in] nalut LUT for mapping from intensity to bin number
- * \param[out] pcarray array of average color values in each bin
- * \param[in] pixadb [optional] debug: caller passes this in.
- * Use to display color squares and to
- * capture plots of color components
- * \return 0 if OK; 1 on error
- *
- *
- * Notes:
- * (1) This takes a color image, a grayscale (intensity) version,
- * a LUT from intensity to bin number, and the number of bins.
- * It computes the average color for pixels whose intensity
- * is in each bin. This is returned as an array of l_uint32
- * colors in our standard RGBA ordering.
- * (2) This function generates equal width intensity bins and
- * finds the average color in each bin. Compare this with
- * pixGetRankColorArray(), which rank orders the pixels
- * by the value of the selected component in each pixel,
- * sets up bins with equal population (not intensity width!),
- * and gets the average color in each bin.
- *
- */
-l_ok
-pixGetBinnedColor(PIX *pixs,
- PIX *pixg,
- l_int32 factor,
- l_int32 nbins,
- NUMA *nalut,
- l_uint32 **pcarray,
- PIXA *pixadb)
-{
-l_int32 i, j, w, h, wpls, wplg, grayval, bin, rval, gval, bval, success;
-l_int32 npts, avepts, maxpts;
-l_uint32 *datas, *datag, *lines, *lineg, *carray;
-l_float64 norm;
-l_float64 *rarray, *garray, *barray, *narray;
-PIX *pix1;
-
- PROCNAME("pixGetBinnedColor");
-
- if (!pcarray)
- return ERROR_INT("&carray not defined", procName, 1);
- *pcarray = NULL;
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
- if (!pixg)
- return ERROR_INT("pixg not defined", procName, 1);
- if (!nalut)
- return ERROR_INT("nalut not defined", procName, 1);
- if (factor < 1) {
- L_WARNING("sampling factor less than 1; setting to 1\n", procName);
- factor = 1;
- }
-
- /* Find the color for each rank bin. Note that we can have
- * multiple bins filled with pixels having the same gray value.
- * Therefore, because in general the mapping from gray value
- * to bin number is not unique, if a bin fills up (actually,
- * we allow it to slightly overfill), we roll the excess
- * over to the next bin, etc. */
- pixGetDimensions(pixs, &w, &h, NULL);
- npts = (w + factor - 1) * (h + factor - 1) / (factor * factor);
- avepts = (npts + nbins - 1) / nbins; /* average number of pts in a bin */
- maxpts = (l_int32)((1.0 + 0.5 / (l_float32)nbins) * avepts);
- datas = pixGetData(pixs);
- wpls = pixGetWpl(pixs);
- datag = pixGetData(pixg);
- wplg = pixGetWpl(pixg);
- rarray = (l_float64 *)LEPT_CALLOC(nbins, sizeof(l_float64));
- garray = (l_float64 *)LEPT_CALLOC(nbins, sizeof(l_float64));
- barray = (l_float64 *)LEPT_CALLOC(nbins, sizeof(l_float64));
- narray = (l_float64 *)LEPT_CALLOC(nbins, sizeof(l_float64));
- for (i = 0; i < h; i += factor) {
- lines = datas + i * wpls;
- lineg = datag + i * wplg;
- for (j = 0; j < w; j += factor) {
- grayval = GET_DATA_BYTE(lineg, j);
- numaGetIValue(nalut, grayval, &bin);
- extractRGBValues(lines[j], &rval, &gval, &bval);
- while (narray[bin] >= maxpts && bin < nbins - 1)
- bin++;
- rarray[bin] += rval;
- garray[bin] += gval;
- barray[bin] += bval;
- narray[bin] += 1.0; /* count samples in each bin */
- }
- }
-
- for (i = 0; i < nbins; i++) {
- norm = 1. / narray[i];
- rarray[i] *= norm;
- garray[i] *= norm;
- barray[i] *= norm;
-/* lept_stderr("narray[%d] = %f\n", i, narray[i]); */
- }
-
- if (pixadb) {
- NUMA *nared, *nagreen, *nablue;
- nared = numaCreate(nbins);
- nagreen = numaCreate(nbins);
- nablue = numaCreate(nbins);
- for (i = 0; i < nbins; i++) {
- numaAddNumber(nared, rarray[i]);
- numaAddNumber(nagreen, garray[i]);
- numaAddNumber(nablue, barray[i]);
- }
- lept_mkdir("lept/regout");
- pix1 = gplotSimplePix1(nared, "Average red val vs. rank bin");
- pixaAddPix(pixadb, pix1, L_INSERT);
- pix1 = gplotSimplePix1(nagreen, "Average green val vs. rank bin");
- pixaAddPix(pixadb, pix1, L_INSERT);
- pix1 = gplotSimplePix1(nablue, "Average blue val vs. rank bin");
- pixaAddPix(pixadb, pix1, L_INSERT);
- numaDestroy(&nared);
- numaDestroy(&nagreen);
- numaDestroy(&nablue);
- }
-
- /* Save colors for all bins in a single array */
- success = TRUE;
- if ((carray = (l_uint32 *)LEPT_CALLOC(nbins, sizeof(l_uint32))) == NULL) {
- success = FALSE;
- L_ERROR("carray not made\n", procName);
- goto cleanup_arrays;
- }
- *pcarray = carray;
- for (i = 0; i < nbins; i++) {
- rval = (l_int32)(rarray[i] + 0.5);
- gval = (l_int32)(garray[i] + 0.5);
- bval = (l_int32)(barray[i] + 0.5);
- composeRGBPixel(rval, gval, bval, carray + i);
- }
-
-cleanup_arrays:
- LEPT_FREE(rarray);
- LEPT_FREE(garray);
- LEPT_FREE(barray);
- LEPT_FREE(narray);
- return (success) ? 0 : 1;
-}
-
-
-/*!
- * \brief pixDisplayColorArray()
- *
- * \param[in] carray array of colors: 0xrrggbb00
- * \param[in] ncolors size of array
- * \param[in] side size of each color square; suggest 200
- * \param[in] ncols number of columns in output color matrix
- * \param[in] fontsize to label each square with text. Valid set is
- * {4,6,8,10,12,14,16,18,20}. Use 0 to disable.
- * \return pixd color array, or NULL on error
- */
-PIX *
-pixDisplayColorArray(l_uint32 *carray,
- l_int32 ncolors,
- l_int32 side,
- l_int32 ncols,
- l_int32 fontsize)
-{
-char textstr[256];
-l_int32 i, rval, gval, bval;
-L_BMF *bmf;
-PIX *pix1, *pix2, *pix3, *pix4;
-PIXA *pixa;
-
- PROCNAME("pixDisplayColorArray");
-
- if (!carray)
- return (PIX *)ERROR_PTR("carray not defined", procName, NULL);
- if (fontsize < 0 || fontsize > 20 || fontsize & 1 || fontsize == 2)
- return (PIX *)ERROR_PTR("invalid fontsize", procName, NULL);
-
- bmf = (fontsize == 0) ? NULL : bmfCreate(NULL, fontsize);
- pixa = pixaCreate(ncolors);
- for (i = 0; i < ncolors; i++) {
- pix1 = pixCreate(side, side, 32);
- pixSetAllArbitrary(pix1, carray[i]);
- pix2 = pixAddBorder(pix1, 2, 1);
- if (bmf) {
- extractRGBValues(carray[i], &rval, &gval, &bval);
- snprintf(textstr, sizeof(textstr),
- "%d: (%d %d %d)", i, rval, gval, bval);
- pix3 = pixAddSingleTextblock(pix2, bmf, textstr, 0xff000000,
- L_ADD_BELOW, NULL);
- } else {
- pix3 = pixClone(pix2);
- }
- pixaAddPix(pixa, pix3, L_INSERT);
- pixDestroy(&pix1);
- pixDestroy(&pix2);
- }
- pix4 = pixaDisplayTiledInColumns(pixa, ncols, 1.0, 20, 2);
- pixaDestroy(&pixa);
- bmfDestroy(&bmf);
- return pix4;
-}
-
-
-/*!
- * \brief pixRankBinByStrip()
- *
- * \param[in] pixs 32 bpp or cmapped
- * \param[in] direction L_SCAN_HORIZONTAL or L_SCAN_VERTICAL
- * \param[in] size of strips in scan direction
- * \param[in] nbins number of equal population bins; must be > 1
- * \param[in] type color selection flag
- * \return pixd result, or NULL on error
- *
- *
- * Notes:
- * (1) This generates a pix where each column represents a strip of
- * the input image. If %direction == L_SCAN_HORIZONTAL, the
- * input impage is tiled into vertical strips of width %size,
- * where %size is a compromise between getting better spatial
- * columnwise resolution (small %size) and getting better
- * columnwise statistical information (larger %size). Likewise
- * with rows of the image if %direction == L_SCAN_VERTICAL.
- * (2) For L_HORIZONTAL_SCAN, the output pix contains rank binned
- * median colors in each column that correspond to a vertical
- * strip of width %size in the input image.
- * (3) The color selection flag is one of: L_SELECT_RED, L_SELECT_GREEN,
- * L_SELECT_BLUE, L_SELECT_MIN, L_SELECT_MAX, L_SELECT_AVERAGE.
- * It determines how the rank ordering is done.
- * (4) Typical input values might be %size = 5, %nbins = 10.
- *
- */
-PIX *
-pixRankBinByStrip(PIX *pixs,
- l_int32 direction,
- l_int32 size,
- l_int32 nbins,
- l_int32 type)
-{
-l_int32 i, j, w, h, nstrips;
-l_uint32 *array;
-BOXA *boxa;
-PIX *pix1, *pix2, *pixd;
-PIXA *pixa;
-PIXCMAP *cmap;
-
- PROCNAME("pixRankBinByStrip");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- cmap = pixGetColormap(pixs);
- if (pixGetDepth(pixs) != 32 && !cmap)
- return (PIX *)ERROR_PTR("pixs neither 32 bpp nor cmapped",
- procName, NULL);
- if (direction != L_SCAN_HORIZONTAL && direction != L_SCAN_VERTICAL)
- return (PIX *)ERROR_PTR("invalid direction", procName, NULL);
- if (size < 1)
- return (PIX *)ERROR_PTR("size < 1", procName, NULL);
- if (nbins < 2)
- return (PIX *)ERROR_PTR("nbins must be at least 2", procName, NULL);
- if (type != L_SELECT_RED && type != L_SELECT_GREEN &&
- type != L_SELECT_BLUE && type != L_SELECT_MIN &&
- type != L_SELECT_MAX && type != L_SELECT_AVERAGE)
- return (PIX *)ERROR_PTR("invalid type", procName, NULL);
-
- /* Downscale by factor and remove colormap if it exists */
- if (cmap)
- pix1 = pixRemoveColormap(pixs, REMOVE_CMAP_TO_FULL_COLOR);
- else
- pix1 = pixClone(pixs);
- pixGetDimensions(pixs, &w, &h, NULL);
-
- pixd = NULL;
- boxa = makeMosaicStrips(w, h, direction, size);
- pixa = pixClipRectangles(pix1, boxa);
- nstrips = pixaGetCount(pixa);
- if (direction == L_SCAN_HORIZONTAL) {
- pixd = pixCreate(nstrips, nbins, 32);
- for (i = 0; i < nstrips; i++) {
- pix2 = pixaGetPix(pixa, i, L_CLONE);
- pixGetRankColorArray(pix2, nbins, type, 1, &array, NULL, 0);
- for (j = 0; j < nbins; j++)
- pixSetPixel(pixd, i, j, array[j]);
- LEPT_FREE(array);
- pixDestroy(&pix2);
- }
- } else { /* L_SCAN_VERTICAL */
- pixd = pixCreate(nbins, nstrips, 32);
- for (i = 0; i < nstrips; i++) {
- pix2 = pixaGetPix(pixa, i, L_CLONE);
- pixGetRankColorArray(pix2, nbins, type, 1, &array, NULL, 0);
- for (j = 0; j < nbins; j++)
- pixSetPixel(pixd, j, i, array[j]);
- LEPT_FREE(array);
- pixDestroy(&pix2);
- }
- }
- pixDestroy(&pix1);
- boxaDestroy(&boxa);
- pixaDestroy(&pixa);
- return pixd;
-}
-
-
-
-/*-------------------------------------------------------------*
- * Pixelwise aligned statistics *
- *-------------------------------------------------------------*/
-/*!
- * \brief pixaGetAlignedStats()
- *
- * \param[in] pixa of identically sized, 8 bpp pix; not cmapped
- * \param[in] type L_MEAN_ABSVAL, L_MEDIAN_VAL, L_MODE_VAL, L_MODE_COUNT
- * \param[in] nbins of histogram for median and mode; ignored for mean
- * \param[in] thresh on histogram for mode val; ignored for all other types
- * \return pix with pixelwise aligned stats, or NULL on error.
- *
- *
- * Notes:
- * (1) Each pixel in the returned pix represents an average
- * (or median, or mode) over the corresponding pixels in each
- * pix in the pixa.
- * (2) The %thresh parameter works with L_MODE_VAL only, and
- * sets a minimum occupancy of the mode bin.
- * If the occupancy of the mode bin is less than %thresh, the
- * mode value is returned as 0. To always return the actual
- * mode value, set %thresh = 0. See pixGetRowStats().
- *
- */
-PIX *
-pixaGetAlignedStats(PIXA *pixa,
- l_int32 type,
- l_int32 nbins,
- l_int32 thresh)
-{
-l_int32 j, n, w, h, d;
-l_float32 *colvect;
-PIX *pixt, *pixd;
-
- PROCNAME("pixaGetAlignedStats");
-
- if (!pixa)
- return (PIX *)ERROR_PTR("pixa not defined", procName, NULL);
- if (type != L_MEAN_ABSVAL && type != L_MEDIAN_VAL &&
- type != L_MODE_VAL && type != L_MODE_COUNT)
- return (PIX *)ERROR_PTR("invalid type", procName, NULL);
- n = pixaGetCount(pixa);
- if (n == 0)
- return (PIX *)ERROR_PTR("no pix in pixa", procName, NULL);
- pixaGetPixDimensions(pixa, 0, &w, &h, &d);
- if (d != 8)
- return (PIX *)ERROR_PTR("pix not 8 bpp", procName, NULL);
-
- pixd = pixCreate(w, h, 8);
- pixt = pixCreate(n, h, 8);
- colvect = (l_float32 *)LEPT_CALLOC(h, sizeof(l_float32));
- for (j = 0; j < w; j++) {
- pixaExtractColumnFromEachPix(pixa, j, pixt);
- pixGetRowStats(pixt, type, nbins, thresh, colvect);
- pixSetPixelColumn(pixd, j, colvect);
- }
-
- LEPT_FREE(colvect);
- pixDestroy(&pixt);
- return pixd;
-}
-
-
-/*!
- * \brief pixaExtractColumnFromEachPix()
- *
- * \param[in] pixa of identically sized, 8 bpp; not cmapped
- * \param[in] col column index
- * \param[in] pixd pix into which each column is inserted
- * \return 0 if OK, 1 on error
- */
-l_ok
-pixaExtractColumnFromEachPix(PIXA *pixa,
- l_int32 col,
- PIX *pixd)
-{
-l_int32 i, k, n, w, h, ht, val, wplt, wpld;
-l_uint32 *datad, *datat;
-PIX *pixt;
-
- PROCNAME("pixaExtractColumnFromEachPix");
-
- if (!pixa)
- return ERROR_INT("pixa not defined", procName, 1);
- if (!pixd || pixGetDepth(pixd) != 8)
- return ERROR_INT("pixd not defined or not 8 bpp", procName, 1);
- n = pixaGetCount(pixa);
- pixGetDimensions(pixd, &w, &h, NULL);
- if (n != w)
- return ERROR_INT("pix width != n", procName, 1);
- pixt = pixaGetPix(pixa, 0, L_CLONE);
- wplt = pixGetWpl(pixt);
- pixGetDimensions(pixt, NULL, &ht, NULL);
- pixDestroy(&pixt);
- if (h != ht)
- return ERROR_INT("pixd height != column height", procName, 1);
-
- datad = pixGetData(pixd);
- wpld = pixGetWpl(pixd);
- for (k = 0; k < n; k++) {
- pixt = pixaGetPix(pixa, k, L_CLONE);
- datat = pixGetData(pixt);
- for (i = 0; i < h; i++) {
- val = GET_DATA_BYTE(datat, col);
- SET_DATA_BYTE(datad + i * wpld, k, val);
- datat += wplt;
- }
- pixDestroy(&pixt);
- }
-
- return 0;
-}
-
-
-/*!
- * \brief pixGetRowStats()
- *
- * \param[in] pixs 8 bpp; not cmapped
- * \param[in] type L_MEAN_ABSVAL, L_MEDIAN_VAL, L_MODE_VAL, L_MODE_COUNT
- * \param[in] nbins of histogram for median and mode; ignored for mean
- * \param[in] thresh on histogram for mode; ignored for mean and median
- * \param[in] colvect vector of results gathered across the rows of pixs
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This computes a column vector of statistics using each
- * row of a Pix. The result is put in %colvect.
- * (2) The %thresh parameter works with L_MODE_VAL only, and
- * sets a minimum occupancy of the mode bin.
- * If the occupancy of the mode bin is less than %thresh, the
- * mode value is returned as 0. To always return the actual
- * mode value, set %thresh = 0.
- * (3) What is the meaning of this %thresh parameter?
- * For each row, the total count in the histogram is w, the
- * image width. So %thresh, relative to w, gives a measure
- * of the ratio of the bin width to the width of the distribution.
- * The larger %thresh, the narrower the distribution must be
- * for the mode value to be returned (instead of returning 0).
- * (4) If the Pix consists of a set of corresponding columns,
- * one for each Pix in a Pixa, the width of the Pix is the
- * number of Pix in the Pixa and the column vector can
- * be stored as a column in a Pix of the same size as
- * each Pix in the Pixa.
- *
- */
-l_ok
-pixGetRowStats(PIX *pixs,
- l_int32 type,
- l_int32 nbins,
- l_int32 thresh,
- l_float32 *colvect)
-{
-l_int32 i, j, k, w, h, val, wpls, sum, target, max, modeval;
-l_int32 *histo, *gray2bin, *bin2gray;
-l_uint32 *lines, *datas;
-
- PROCNAME("pixGetRowStats");
-
- if (!pixs || pixGetDepth(pixs) != 8)
- return ERROR_INT("pixs not defined or not 8 bpp", procName, 1);
- if (!colvect)
- return ERROR_INT("colvect not defined", procName, 1);
- if (type != L_MEAN_ABSVAL && type != L_MEDIAN_VAL &&
- type != L_MODE_VAL && type != L_MODE_COUNT)
- return ERROR_INT("invalid type", procName, 1);
- if (type != L_MEAN_ABSVAL && (nbins < 1 || nbins > 256))
- return ERROR_INT("invalid nbins", procName, 1);
- pixGetDimensions(pixs, &w, &h, NULL);
-
- datas = pixGetData(pixs);
- wpls = pixGetWpl(pixs);
- if (type == L_MEAN_ABSVAL) {
- for (i = 0; i < h; i++) {
- sum = 0;
- lines = datas + i * wpls;
- for (j = 0; j < w; j++)
- sum += GET_DATA_BYTE(lines, j);
- colvect[i] = (l_float32)sum / (l_float32)w;
- }
- return 0;
- }
-
- /* We need a histogram; binwidth ~ 256 / nbins */
- histo = (l_int32 *)LEPT_CALLOC(nbins, sizeof(l_int32));
- gray2bin = (l_int32 *)LEPT_CALLOC(256, sizeof(l_int32));
- bin2gray = (l_int32 *)LEPT_CALLOC(nbins, sizeof(l_int32));
- for (i = 0; i < 256; i++) /* gray value --> histo bin */
- gray2bin[i] = (i * nbins) / 256;
- for (i = 0; i < nbins; i++) /* histo bin --> gray value */
- bin2gray[i] = (i * 256 + 128) / nbins;
-
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- for (k = 0; k < nbins; k++)
- histo[k] = 0;
- for (j = 0; j < w; j++) {
- val = GET_DATA_BYTE(lines, j);
- histo[gray2bin[val]]++;
- }
-
- if (type == L_MEDIAN_VAL) {
- sum = 0;
- target = (w + 1) / 2;
- for (k = 0; k < nbins; k++) {
- sum += histo[k];
- if (sum >= target) {
- colvect[i] = bin2gray[k];
- break;
- }
- }
- } else if (type == L_MODE_VAL) {
- max = 0;
- modeval = 0;
- for (k = 0; k < nbins; k++) {
- if (histo[k] > max) {
- max = histo[k];
- modeval = k;
- }
- }
- if (max < thresh)
- colvect[i] = 0;
- else
- colvect[i] = bin2gray[modeval];
- } else { /* type == L_MODE_COUNT */
- max = 0;
- for (k = 0; k < nbins; k++) {
- if (histo[k] > max)
- max = histo[k];
- }
- colvect[i] = max;
- }
- }
-
- LEPT_FREE(histo);
- LEPT_FREE(gray2bin);
- LEPT_FREE(bin2gray);
- return 0;
-}
-
-
-/*!
- * \brief pixGetColumnStats()
- *
- * \param[in] pixs 8 bpp; not cmapped
- * \param[in] type L_MEAN_ABSVAL, L_MEDIAN_VAL, L_MODE_VAL, L_MODE_COUNT
- * \param[in] nbins of histogram for median and mode; ignored for mean
- * \param[in] thresh on histogram for mode val; ignored for all other types
- * \param[in] rowvect vector of results gathered down the columns of pixs
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This computes a row vector of statistics using each
- * column of a Pix. The result is put in %rowvect.
- * (2) The %thresh parameter works with L_MODE_VAL only, and
- * sets a minimum occupancy of the mode bin.
- * If the occupancy of the mode bin is less than %thresh, the
- * mode value is returned as 0. To always return the actual
- * mode value, set %thresh = 0.
- * (3) What is the meaning of this %thresh parameter?
- * For each column, the total count in the histogram is h, the
- * image height. So %thresh, relative to h, gives a measure
- * of the ratio of the bin width to the width of the distribution.
- * The larger %thresh, the narrower the distribution must be
- * for the mode value to be returned (instead of returning 0).
- *
- */
-l_ok
-pixGetColumnStats(PIX *pixs,
- l_int32 type,
- l_int32 nbins,
- l_int32 thresh,
- l_float32 *rowvect)
-{
-l_int32 i, j, k, w, h, val, wpls, sum, target, max, modeval;
-l_int32 *histo, *gray2bin, *bin2gray;
-l_uint32 *datas;
-
- PROCNAME("pixGetColumnStats");
-
- if (!pixs || pixGetDepth(pixs) != 8)
- return ERROR_INT("pixs not defined or not 8 bpp", procName, 1);
- if (!rowvect)
- return ERROR_INT("rowvect not defined", procName, 1);
- if (type != L_MEAN_ABSVAL && type != L_MEDIAN_VAL &&
- type != L_MODE_VAL && type != L_MODE_COUNT)
- return ERROR_INT("invalid type", procName, 1);
- if (type != L_MEAN_ABSVAL && (nbins < 1 || nbins > 256))
- return ERROR_INT("invalid nbins", procName, 1);
- pixGetDimensions(pixs, &w, &h, NULL);
-
- datas = pixGetData(pixs);
- wpls = pixGetWpl(pixs);
- if (type == L_MEAN_ABSVAL) {
- for (j = 0; j < w; j++) {
- sum = 0;
- for (i = 0; i < h; i++)
- sum += GET_DATA_BYTE(datas + i * wpls, j);
- rowvect[j] = (l_float32)sum / (l_float32)h;
- }
- return 0;
- }
-
- /* We need a histogram; binwidth ~ 256 / nbins */
- histo = (l_int32 *)LEPT_CALLOC(nbins, sizeof(l_int32));
- gray2bin = (l_int32 *)LEPT_CALLOC(256, sizeof(l_int32));
- bin2gray = (l_int32 *)LEPT_CALLOC(nbins, sizeof(l_int32));
- for (i = 0; i < 256; i++) /* gray value --> histo bin */
- gray2bin[i] = (i * nbins) / 256;
- for (i = 0; i < nbins; i++) /* histo bin --> gray value */
- bin2gray[i] = (i * 256 + 128) / nbins;
-
- for (j = 0; j < w; j++) {
- for (i = 0; i < h; i++) {
- val = GET_DATA_BYTE(datas + i * wpls, j);
- histo[gray2bin[val]]++;
- }
-
- if (type == L_MEDIAN_VAL) {
- sum = 0;
- target = (h + 1) / 2;
- for (k = 0; k < nbins; k++) {
- sum += histo[k];
- if (sum >= target) {
- rowvect[j] = bin2gray[k];
- break;
- }
- }
- } else if (type == L_MODE_VAL) {
- max = 0;
- modeval = 0;
- for (k = 0; k < nbins; k++) {
- if (histo[k] > max) {
- max = histo[k];
- modeval = k;
- }
- }
- if (max < thresh)
- rowvect[j] = 0;
- else
- rowvect[j] = bin2gray[modeval];
- } else { /* type == L_MODE_COUNT */
- max = 0;
- for (k = 0; k < nbins; k++) {
- if (histo[k] > max)
- max = histo[k];
- }
- rowvect[j] = max;
- }
- for (k = 0; k < nbins; k++)
- histo[k] = 0;
- }
-
- LEPT_FREE(histo);
- LEPT_FREE(gray2bin);
- LEPT_FREE(bin2gray);
- return 0;
-}
-
-
-/*!
- * \brief pixSetPixelColumn()
- *
- * \param[in] pix 8 bpp; not cmapped
- * \param[in] col column index
- * \param[in] colvect vector of floats
- * \return 0 if OK, 1 on error
- */
-l_ok
-pixSetPixelColumn(PIX *pix,
- l_int32 col,
- l_float32 *colvect)
-{
-l_int32 i, w, h, wpl;
-l_uint32 *data;
-
- PROCNAME("pixSetCPixelColumn");
-
- if (!pix || pixGetDepth(pix) != 8)
- return ERROR_INT("pix not defined or not 8 bpp", procName, 1);
- if (!colvect)
- return ERROR_INT("colvect not defined", procName, 1);
- pixGetDimensions(pix, &w, &h, NULL);
- if (col < 0 || col > w)
- return ERROR_INT("invalid col", procName, 1);
-
- data = pixGetData(pix);
- wpl = pixGetWpl(pix);
- for (i = 0; i < h; i++)
- SET_DATA_BYTE(data + i * wpl, col, (l_int32)colvect[i]);
-
- return 0;
-}
-
-
-/*-------------------------------------------------------------*
- * Foreground/background estimation *
- *-------------------------------------------------------------*/
-/*!
- * \brief pixThresholdForFgBg()
- *
- * \param[in] pixs any depth; cmapped ok
- * \param[in] factor subsampling factor; integer >= 1
- * \param[in] thresh threshold for generating foreground mask
- * \param[out] pfgval [optional] average foreground value
- * \param[out] pbgval [optional] average background value
- * \return 0 if OK, 1 on error
- */
-l_ok
-pixThresholdForFgBg(PIX *pixs,
- l_int32 factor,
- l_int32 thresh,
- l_int32 *pfgval,
- l_int32 *pbgval)
-{
-l_float32 fval;
-PIX *pixg, *pixm;
-
- PROCNAME("pixThresholdForFgBg");
-
- if (pfgval) *pfgval = 0;
- if (pbgval) *pbgval = 0;
- if (!pfgval && !pbgval)
- return ERROR_INT("no data requested", procName, 1);
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
-
- /* Generate a subsampled 8 bpp version and a mask over the fg */
- pixg = pixConvertTo8BySampling(pixs, factor, 0);
- pixm = pixThresholdToBinary(pixg, thresh);
-
- if (pfgval) {
- pixGetAverageMasked(pixg, pixm, 0, 0, 1, L_MEAN_ABSVAL, &fval);
- *pfgval = (l_int32)(fval + 0.5);
- }
-
- if (pbgval) {
- pixInvert(pixm, pixm);
- pixGetAverageMasked(pixg, pixm, 0, 0, 1, L_MEAN_ABSVAL, &fval);
- *pbgval = (l_int32)(fval + 0.5);
- }
-
- pixDestroy(&pixg);
- pixDestroy(&pixm);
- return 0;
-}
-
-
-/*!
- * \brief pixSplitDistributionFgBg()
- *
- * \param[in] pixs any depth; cmapped ok
- * \param[in] scorefract fraction of the max score, used to determine
- * the range over which the histogram min is searched
- * \param[in] factor subsampling factor; integer >= 1
- * \param[out] pthresh [optional] best threshold for separating
- * \param[out] pfgval [optional] average foreground value
- * \param[out] pbgval [optional] average background value
- * \param[out] ppixdb [optional] plot of distribution and split point
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) See numaSplitDistribution() for details on the underlying
- * method of choosing a threshold.
- *
- */
-l_ok
-pixSplitDistributionFgBg(PIX *pixs,
- l_float32 scorefract,
- l_int32 factor,
- l_int32 *pthresh,
- l_int32 *pfgval,
- l_int32 *pbgval,
- PIX **ppixdb)
-{
-char buf[256];
-l_int32 thresh;
-l_float32 avefg, avebg, maxnum;
-GPLOT *gplot;
-NUMA *na, *nascore, *nax, *nay;
-PIX *pixg;
-
- PROCNAME("pixSplitDistributionFgBg");
-
- if (pthresh) *pthresh = 0;
- if (pfgval) *pfgval = 0;
- if (pbgval) *pbgval = 0;
- if (ppixdb) *ppixdb = NULL;
- if (!pthresh && !pfgval && !pbgval)
- return ERROR_INT("no data requested", procName, 1);
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
-
- /* Generate a subsampled 8 bpp version */
- pixg = pixConvertTo8BySampling(pixs, factor, 0);
-
- /* Make the fg/bg estimates */
- na = pixGetGrayHistogram(pixg, 1);
- if (ppixdb) {
- numaSplitDistribution(na, scorefract, &thresh, &avefg, &avebg,
- NULL, NULL, &nascore);
- numaDestroy(&nascore);
- } else {
- numaSplitDistribution(na, scorefract, &thresh, &avefg, &avebg,
- NULL, NULL, NULL);
- }
-
- if (pthresh) *pthresh = thresh;
- if (pfgval) *pfgval = (l_int32)(avefg + 0.5);
- if (pbgval) *pbgval = (l_int32)(avebg + 0.5);
-
- if (ppixdb) {
- lept_mkdir("lept/redout");
- gplot = gplotCreate("/tmp/lept/redout/histplot", GPLOT_PNG, "Histogram",
- "Grayscale value", "Number of pixels");
- gplotAddPlot(gplot, NULL, na, GPLOT_LINES, NULL);
- nax = numaMakeConstant(thresh, 2);
- numaGetMax(na, &maxnum, NULL);
- nay = numaMakeConstant(0, 2);
- numaReplaceNumber(nay, 1, (l_int32)(0.5 * maxnum));
- snprintf(buf, sizeof(buf), "score fract = %3.1f", scorefract);
- gplotAddPlot(gplot, nax, nay, GPLOT_LINES, buf);
- *ppixdb = gplotMakeOutputPix(gplot);
- gplotDestroy(&gplot);
- numaDestroy(&nax);
- numaDestroy(&nay);
- }
-
- pixDestroy(&pixg);
- numaDestroy(&na);
- return 0;
-}
diff --git a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pix5.c b/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pix5.c
deleted file mode 100644
index 7b12ead8..00000000
--- a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pix5.c
+++ /dev/null
@@ -1,3157 +0,0 @@
-/*====================================================================*
- - Copyright (C) 2001 Leptonica. All rights reserved.
- -
- - Redistribution and use in source and binary forms, with or without
- - modification, are permitted provided that the following conditions
- - are met:
- - 1. Redistributions of source code must retain the above copyright
- - notice, this list of conditions and the following disclaimer.
- - 2. Redistributions in binary form must reproduce the above
- - copyright notice, this list of conditions and the following
- - disclaimer in the documentation and/or other materials
- - provided with the distribution.
- -
- - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- - ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- - LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- - A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL ANY
- - CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
- - EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
- - PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
- - PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
- - OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
- - NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- *====================================================================*/
-
-/*!
- * \file pix5.c
- *
- *
- * This file has these operations:
- *
- * (1) Measurement of 1 bpp image properties
- * (2) Extract rectangular regions
- * (3) Clip to foreground
- * (4) Extract pixel averages, reversals and variance along lines
- * (5) Rank row and column transforms
- *
- * Measurement of properties
- * l_int32 pixaFindDimensions()
- * l_int32 pixFindAreaPerimRatio()
- * NUMA *pixaFindPerimToAreaRatio()
- * l_int32 pixFindPerimToAreaRatio()
- * NUMA *pixaFindPerimSizeRatio()
- * l_int32 pixFindPerimSizeRatio()
- * NUMA *pixaFindAreaFraction()
- * l_int32 pixFindAreaFraction()
- * NUMA *pixaFindAreaFractionMasked()
- * l_int32 pixFindAreaFractionMasked()
- * NUMA *pixaFindWidthHeightRatio()
- * NUMA *pixaFindWidthHeightProduct()
- * l_int32 pixFindOverlapFraction()
- * BOXA *pixFindRectangleComps()
- * l_int32 pixConformsToRectangle()
- *
- * Extract rectangular region
- * PIXA *pixClipRectangles()
- * PIX *pixClipRectangle()
- * PIX *pixClipMasked()
- * l_int32 pixCropToMatch()
- * PIX *pixCropToSize()
- * PIX *pixResizeToMatch()
- *
- * Select a connected component by size
- * PIX *pixSelectComponentBySize()
- * PIX *pixFilterComponentBySize()
- *
- * Make special masks
- * PIX *pixMakeSymmetricMask()
- * PIX *pixMakeFrameMask()
- *
- * Generate a covering of rectangles over connected components
- * PIX * pixMakeCoveringOfRectangles()
- *
- * Fraction of Fg pixels under a mask
- * l_int32 pixFractionFgInMask()
- *
- * Clip to foreground
- * PIX *pixClipToForeground()
- * l_int32 pixTestClipToForeground()
- * l_int32 pixClipBoxToForeground()
- * l_int32 pixScanForForeground()
- * l_int32 pixClipBoxToEdges()
- * l_int32 pixScanForEdge()
- *
- * Extract pixel averages and reversals along lines
- * NUMA *pixExtractOnLine()
- * l_float32 pixAverageOnLine()
- * NUMA *pixAverageIntensityProfile()
- * NUMA *pixReversalProfile()
- *
- * Extract windowed variance along a line
- * NUMA *pixWindowedVarianceOnLine()
- *
- * Extract min/max of pixel values near lines
- * l_int32 pixMinMaxNearLine()
- *
- * Rank row and column transforms
- * PIX *pixRankRowTransform()
- * PIX *pixRankColumnTransform()
- *
- */
-
-#ifdef HAVE_CONFIG_H
-#include
-#endif /* HAVE_CONFIG_H */
-
-#include
-#include
-#include "allheaders.h"
-
-static const l_uint32 rmask32[] = {0x0,
- 0x00000001, 0x00000003, 0x00000007, 0x0000000f,
- 0x0000001f, 0x0000003f, 0x0000007f, 0x000000ff,
- 0x000001ff, 0x000003ff, 0x000007ff, 0x00000fff,
- 0x00001fff, 0x00003fff, 0x00007fff, 0x0000ffff,
- 0x0001ffff, 0x0003ffff, 0x0007ffff, 0x000fffff,
- 0x001fffff, 0x003fffff, 0x007fffff, 0x00ffffff,
- 0x01ffffff, 0x03ffffff, 0x07ffffff, 0x0fffffff,
- 0x1fffffff, 0x3fffffff, 0x7fffffff, 0xffffffff};
-
-#ifndef NO_CONSOLE_IO
-#define DEBUG_EDGES 0
-#endif /* ~NO_CONSOLE_IO */
-
-
-/*-------------------------------------------------------------*
- * Measurement of properties *
- *-------------------------------------------------------------*/
-/*!
- * \brief pixaFindDimensions()
- *
- * \param[in] pixa
- * \param[out] pnaw [optional] numa of pix widths
- * \param[out] pnah [optional] numa of pix heights
- * \return 0 if OK, 1 on error
- */
-l_ok
-pixaFindDimensions(PIXA *pixa,
- NUMA **pnaw,
- NUMA **pnah)
-{
-l_int32 i, n, w, h;
-PIX *pixt;
-
- PROCNAME("pixaFindDimensions");
-
- if (pnaw) *pnaw = NULL;
- if (pnah) *pnah = NULL;
- if (!pnaw && !pnah)
- return ERROR_INT("no output requested", procName, 1);
- if (!pixa)
- return ERROR_INT("pixa not defined", procName, 1);
-
- n = pixaGetCount(pixa);
- if (pnaw) *pnaw = numaCreate(n);
- if (pnah) *pnah = numaCreate(n);
- for (i = 0; i < n; i++) {
- pixt = pixaGetPix(pixa, i, L_CLONE);
- pixGetDimensions(pixt, &w, &h, NULL);
- if (pnaw)
- numaAddNumber(*pnaw, w);
- if (pnah)
- numaAddNumber(*pnah, h);
- pixDestroy(&pixt);
- }
- return 0;
-}
-
-
-/*!
- * \brief pixFindAreaPerimRatio()
- *
- * \param[in] pixs 1 bpp
- * \param[in] tab [optional] pixel sum table, can be NULL
- * \param[out] pfract area/perimeter ratio
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) The area is the number of fg pixels that are not on the
- * boundary (i.e., are not 8-connected to a bg pixel), and the
- * perimeter is the number of fg boundary pixels. Returns
- * 0.0 if there are no fg pixels.
- * (2) This function is retained because clients are using it.
- *
- */
-l_ok
-pixFindAreaPerimRatio(PIX *pixs,
- l_int32 *tab,
- l_float32 *pfract)
-{
-l_int32 *tab8;
-l_int32 nfg, nbound;
-PIX *pixt;
-
- PROCNAME("pixFindAreaPerimRatio");
-
- if (!pfract)
- return ERROR_INT("&fract not defined", procName, 1);
- *pfract = 0.0;
- if (!pixs || pixGetDepth(pixs) != 1)
- return ERROR_INT("pixs not defined or not 1 bpp", procName, 1);
-
- if (!tab)
- tab8 = makePixelSumTab8();
- else
- tab8 = tab;
-
- pixt = pixErodeBrick(NULL, pixs, 3, 3);
- pixCountPixels(pixt, &nfg, tab8);
- if (nfg == 0) {
- pixDestroy(&pixt);
- if (!tab) LEPT_FREE(tab8);
- return 0;
- }
- pixXor(pixt, pixt, pixs);
- pixCountPixels(pixt, &nbound, tab8);
- *pfract = (l_float32)nfg / (l_float32)nbound;
- pixDestroy(&pixt);
-
- if (!tab) LEPT_FREE(tab8);
- return 0;
-}
-
-
-/*!
- * \brief pixaFindPerimToAreaRatio()
- *
- * \param[in] pixa of 1 bpp pix
- * \return na of perimeter/arear ratio for each pix, or NULL on error
- *
- *
- * Notes:
- * (1) This is typically used for a pixa consisting of
- * 1 bpp connected components.
- *
- */
-NUMA *
-pixaFindPerimToAreaRatio(PIXA *pixa)
-{
-l_int32 i, n;
-l_int32 *tab;
-l_float32 fract;
-NUMA *na;
-PIX *pixt;
-
- PROCNAME("pixaFindPerimToAreaRatio");
-
- if (!pixa)
- return (NUMA *)ERROR_PTR("pixa not defined", procName, NULL);
-
- n = pixaGetCount(pixa);
- na = numaCreate(n);
- tab = makePixelSumTab8();
- for (i = 0; i < n; i++) {
- pixt = pixaGetPix(pixa, i, L_CLONE);
- pixFindPerimToAreaRatio(pixt, tab, &fract);
- numaAddNumber(na, fract);
- pixDestroy(&pixt);
- }
- LEPT_FREE(tab);
- return na;
-}
-
-
-/*!
- * \brief pixFindPerimToAreaRatio()
- *
- * \param[in] pixs 1 bpp
- * \param[in] tab [optional] pixel sum table, can be NULL
- * \param[out] pfract perimeter/area ratio
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) The perimeter is the number of fg boundary pixels, and the
- * area is the number of fg pixels. This returns 0.0 if
- * there are no fg pixels.
- * (2) Unlike pixFindAreaPerimRatio(), this uses the full set of
- * fg pixels for the area, and the ratio is taken in the opposite
- * order.
- * (3) This is typically used for a single connected component.
- * This always has a value <= 1.0, and if the average distance
- * of a fg pixel from the nearest bg pixel is d, this has
- * a value ~1/d.
- *
- */
-l_ok
-pixFindPerimToAreaRatio(PIX *pixs,
- l_int32 *tab,
- l_float32 *pfract)
-{
-l_int32 *tab8;
-l_int32 nfg, nbound;
-PIX *pixt;
-
- PROCNAME("pixFindPerimToAreaRatio");
-
- if (!pfract)
- return ERROR_INT("&fract not defined", procName, 1);
- *pfract = 0.0;
- if (!pixs || pixGetDepth(pixs) != 1)
- return ERROR_INT("pixs not defined or not 1 bpp", procName, 1);
-
- if (!tab)
- tab8 = makePixelSumTab8();
- else
- tab8 = tab;
-
- pixCountPixels(pixs, &nfg, tab8);
- if (nfg == 0) {
- if (!tab) LEPT_FREE(tab8);
- return 0;
- }
- pixt = pixErodeBrick(NULL, pixs, 3, 3);
- pixXor(pixt, pixt, pixs);
- pixCountPixels(pixt, &nbound, tab8);
- *pfract = (l_float32)nbound / (l_float32)nfg;
- pixDestroy(&pixt);
-
- if (!tab) LEPT_FREE(tab8);
- return 0;
-}
-
-
-/*!
- * \brief pixaFindPerimSizeRatio()
- *
- * \param[in] pixa of 1 bpp pix
- * \return na of fg perimeter/(2*(w+h)) ratio for each pix,
- * or NULL on error
- *
- *
- * Notes:
- * (1) This is typically used for a pixa consisting of
- * 1 bpp connected components.
- * (2) This has a minimum value for a circle of pi/4; a value for
- * a rectangle component of approx. 1.0; and a value much larger
- * than 1.0 for a component with a highly irregular boundary.
- *
- */
-NUMA *
-pixaFindPerimSizeRatio(PIXA *pixa)
-{
-l_int32 i, n;
-l_int32 *tab;
-l_float32 ratio;
-NUMA *na;
-PIX *pixt;
-
- PROCNAME("pixaFindPerimSizeRatio");
-
- if (!pixa)
- return (NUMA *)ERROR_PTR("pixa not defined", procName, NULL);
-
- n = pixaGetCount(pixa);
- na = numaCreate(n);
- tab = makePixelSumTab8();
- for (i = 0; i < n; i++) {
- pixt = pixaGetPix(pixa, i, L_CLONE);
- pixFindPerimSizeRatio(pixt, tab, &ratio);
- numaAddNumber(na, ratio);
- pixDestroy(&pixt);
- }
- LEPT_FREE(tab);
- return na;
-}
-
-
-/*!
- * \brief pixFindPerimSizeRatio()
- *
- * \param[in] pixs 1 bpp
- * \param[in] tab [optional] pixel sum table, can be NULL
- * \param[out] pratio perimeter/size ratio
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) We take the 'size' as twice the sum of the width and
- * height of pixs, and the perimeter is the number of fg
- * boundary pixels. We use the fg pixels of the boundary
- * because the pix may be clipped to the boundary, so an
- * erosion is required to count all boundary pixels.
- * (2) This has a large value for dendritic, fractal-like components
- * with highly irregular boundaries.
- * (3) This is typically used for a single connected component.
- * It has a value of about 1.0 for rectangular components with
- * relatively smooth boundaries.
- *
- */
-l_ok
-pixFindPerimSizeRatio(PIX *pixs,
- l_int32 *tab,
- l_float32 *pratio)
-{
-l_int32 *tab8;
-l_int32 w, h, nbound;
-PIX *pixt;
-
- PROCNAME("pixFindPerimSizeRatio");
-
- if (!pratio)
- return ERROR_INT("&ratio not defined", procName, 1);
- *pratio = 0.0;
- if (!pixs || pixGetDepth(pixs) != 1)
- return ERROR_INT("pixs not defined or not 1 bpp", procName, 1);
-
- if (!tab)
- tab8 = makePixelSumTab8();
- else
- tab8 = tab;
-
- pixt = pixErodeBrick(NULL, pixs, 3, 3);
- pixXor(pixt, pixt, pixs);
- pixCountPixels(pixt, &nbound, tab8);
- pixGetDimensions(pixs, &w, &h, NULL);
- *pratio = (0.5 * nbound) / (l_float32)(w + h);
- pixDestroy(&pixt);
-
- if (!tab) LEPT_FREE(tab8);
- return 0;
-}
-
-
-/*!
- * \brief pixaFindAreaFraction()
- *
- * \param[in] pixa of 1 bpp pix
- * \return na of area fractions for each pix, or NULL on error
- *
- *
- * Notes:
- * (1) This is typically used for a pixa consisting of
- * 1 bpp connected components.
- *
- */
-NUMA *
-pixaFindAreaFraction(PIXA *pixa)
-{
-l_int32 i, n;
-l_int32 *tab;
-l_float32 fract;
-NUMA *na;
-PIX *pixt;
-
- PROCNAME("pixaFindAreaFraction");
-
- if (!pixa)
- return (NUMA *)ERROR_PTR("pixa not defined", procName, NULL);
-
- n = pixaGetCount(pixa);
- na = numaCreate(n);
- tab = makePixelSumTab8();
- for (i = 0; i < n; i++) {
- pixt = pixaGetPix(pixa, i, L_CLONE);
- pixFindAreaFraction(pixt, tab, &fract);
- numaAddNumber(na, fract);
- pixDestroy(&pixt);
- }
- LEPT_FREE(tab);
- return na;
-}
-
-
-/*!
- * \brief pixFindAreaFraction()
- *
- * \param[in] pixs 1 bpp
- * \param[in] tab [optional] pixel sum table, can be NULL
- * \param[out] pfract fg area/size ratio
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This finds the ratio of the number of fg pixels to the
- * size of the pix (w * h). It is typically used for a
- * single connected component.
- *
- */
-l_ok
-pixFindAreaFraction(PIX *pixs,
- l_int32 *tab,
- l_float32 *pfract)
-{
-l_int32 w, h, sum;
-l_int32 *tab8;
-
- PROCNAME("pixFindAreaFraction");
-
- if (!pfract)
- return ERROR_INT("&fract not defined", procName, 1);
- *pfract = 0.0;
- if (!pixs || pixGetDepth(pixs) != 1)
- return ERROR_INT("pixs not defined or not 1 bpp", procName, 1);
-
- if (!tab)
- tab8 = makePixelSumTab8();
- else
- tab8 = tab;
- pixGetDimensions(pixs, &w, &h, NULL);
- pixCountPixels(pixs, &sum, tab8);
- *pfract = (l_float32)sum / (l_float32)(w * h);
-
- if (!tab) LEPT_FREE(tab8);
- return 0;
-}
-
-
-/*!
- * \brief pixaFindAreaFractionMasked()
- *
- * \param[in] pixa of 1 bpp pix
- * \param[in] pixm mask image
- * \param[in] debug 1 for output, 0 to suppress
- * \return na of ratio masked/total fractions for each pix,
- * or NULL on error
- *
- *
- * Notes:
- * (1) This is typically used for a pixa consisting of
- * 1 bpp connected components, which has an associated
- * boxa giving the location of the components relative
- * to the mask origin.
- * (2) The debug flag displays in green and red the masked and
- * unmasked parts of the image from which pixa was derived.
- *
- */
-NUMA *
-pixaFindAreaFractionMasked(PIXA *pixa,
- PIX *pixm,
- l_int32 debug)
-{
-l_int32 i, n, full;
-l_int32 *tab;
-l_float32 fract;
-BOX *box;
-NUMA *na;
-PIX *pix;
-
- PROCNAME("pixaFindAreaFractionMasked");
-
- if (!pixa)
- return (NUMA *)ERROR_PTR("pixa not defined", procName, NULL);
- if (!pixm || pixGetDepth(pixm) != 1)
- return (NUMA *)ERROR_PTR("pixm undefined or not 1 bpp", procName, NULL);
-
- n = pixaGetCount(pixa);
- na = numaCreate(n);
- tab = makePixelSumTab8();
- pixaIsFull(pixa, NULL, &full); /* check boxa */
- box = NULL;
- for (i = 0; i < n; i++) {
- pix = pixaGetPix(pixa, i, L_CLONE);
- if (full)
- box = pixaGetBox(pixa, i, L_CLONE);
- pixFindAreaFractionMasked(pix, box, pixm, tab, &fract);
- numaAddNumber(na, fract);
- boxDestroy(&box);
- pixDestroy(&pix);
- }
- LEPT_FREE(tab);
-
- if (debug) {
- l_int32 w, h;
- PIX *pix1, *pix2;
- pixGetDimensions(pixm, &w, &h, NULL);
- pix1 = pixaDisplay(pixa, w, h); /* recover original image */
- pix2 = pixCreate(w, h, 8); /* make an 8 bpp white image ... */
- pixSetColormap(pix2, pixcmapCreate(8)); /* that's cmapped ... */
- pixSetBlackOrWhite(pix2, L_SET_WHITE); /* and init to white */
- pixSetMaskedCmap(pix2, pix1, 0, 0, 255, 0, 0); /* color all fg red */
- pixRasterop(pix1, 0, 0, w, h, PIX_MASK, pixm, 0, 0);
- pixSetMaskedCmap(pix2, pix1, 0, 0, 0, 255, 0); /* turn masked green */
- pixDisplay(pix2, 100, 100);
- pixDestroy(&pix1);
- pixDestroy(&pix2);
- }
-
- return na;
-}
-
-
-/*!
- * \brief pixFindAreaFractionMasked()
- *
- * \param[in] pixs 1 bpp, typically a single component
- * \param[in] box [optional] for pixs relative to pixm
- * \param[in] pixm 1 bpp mask, typically over the entire image from
- * which the component pixs was extracted
- * \param[in] tab [optional] pixel sum table, can be NULL
- * \param[out] pfract fg area/size ratio
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This finds the ratio of the number of masked fg pixels
- * in pixs to the total number of fg pixels in pixs.
- * It is typically used for a single connected component.
- * If there are no fg pixels, this returns a ratio of 0.0.
- * (2) The box gives the location of the pix relative to that
- * of the UL corner of the mask. Therefore, the rasterop
- * is performed with the pix translated to its location
- * (x, y) in the mask before ANDing.
- * If box == NULL, the UL corners of pixs and pixm are aligned.
- *
- */
-l_ok
-pixFindAreaFractionMasked(PIX *pixs,
- BOX *box,
- PIX *pixm,
- l_int32 *tab,
- l_float32 *pfract)
-{
-l_int32 x, y, w, h, sum, masksum;
-l_int32 *tab8;
-PIX *pix1;
-
- PROCNAME("pixFindAreaFractionMasked");
-
- if (!pfract)
- return ERROR_INT("&fract not defined", procName, 1);
- *pfract = 0.0;
- if (!pixs || pixGetDepth(pixs) != 1)
- return ERROR_INT("pixs not defined or not 1 bpp", procName, 1);
- if (!pixm || pixGetDepth(pixm) != 1)
- return ERROR_INT("pixm not defined or not 1 bpp", procName, 1);
-
- if (!tab)
- tab8 = makePixelSumTab8();
- else
- tab8 = tab;
- x = y = 0;
- if (box)
- boxGetGeometry(box, &x, &y, NULL, NULL);
- pixGetDimensions(pixs, &w, &h, NULL);
-
- pix1 = pixCopy(NULL, pixs);
- pixRasterop(pix1, 0, 0, w, h, PIX_MASK, pixm, x, y);
- pixCountPixels(pixs, &sum, tab8);
- if (sum == 0) {
- pixDestroy(&pix1);
- if (!tab) LEPT_FREE(tab8);
- return 0;
- }
- pixCountPixels(pix1, &masksum, tab8);
- *pfract = (l_float32)masksum / (l_float32)sum;
-
- if (!tab) LEPT_FREE(tab8);
- pixDestroy(&pix1);
- return 0;
-}
-
-
-/*!
- * \brief pixaFindWidthHeightRatio()
- *
- * \param[in] pixa of 1 bpp pix
- * \return na of width/height ratios for each pix, or NULL on error
- *
- *
- * Notes:
- * (1) This is typically used for a pixa consisting of
- * 1 bpp connected components.
- *
- */
-NUMA *
-pixaFindWidthHeightRatio(PIXA *pixa)
-{
-l_int32 i, n, w, h;
-NUMA *na;
-PIX *pixt;
-
- PROCNAME("pixaFindWidthHeightRatio");
-
- if (!pixa)
- return (NUMA *)ERROR_PTR("pixa not defined", procName, NULL);
-
- n = pixaGetCount(pixa);
- na = numaCreate(n);
- for (i = 0; i < n; i++) {
- pixt = pixaGetPix(pixa, i, L_CLONE);
- pixGetDimensions(pixt, &w, &h, NULL);
- numaAddNumber(na, (l_float32)w / (l_float32)h);
- pixDestroy(&pixt);
- }
- return na;
-}
-
-
-/*!
- * \brief pixaFindWidthHeightProduct()
- *
- * \param[in] pixa of 1 bpp pix
- * \return na of width*height products for each pix, or NULL on error
- *
- *
- * Notes:
- * (1) This is typically used for a pixa consisting of
- * 1 bpp connected components.
- *
- */
-NUMA *
-pixaFindWidthHeightProduct(PIXA *pixa)
-{
-l_int32 i, n, w, h;
-NUMA *na;
-PIX *pixt;
-
- PROCNAME("pixaFindWidthHeightProduct");
-
- if (!pixa)
- return (NUMA *)ERROR_PTR("pixa not defined", procName, NULL);
-
- n = pixaGetCount(pixa);
- na = numaCreate(n);
- for (i = 0; i < n; i++) {
- pixt = pixaGetPix(pixa, i, L_CLONE);
- pixGetDimensions(pixt, &w, &h, NULL);
- numaAddNumber(na, w * h);
- pixDestroy(&pixt);
- }
- return na;
-}
-
-
-/*!
- * \brief pixFindOverlapFraction()
- *
- * \param[in] pixs1, pixs2 1 bpp
- * \param[in] x2, y2 location in pixs1 of UL corner of pixs2
- * \param[in] tab [optional] pixel sum table, can be null
- * \param[out] pratio ratio fg intersection to fg union
- * \param[out] pnoverlap [optional] number of overlapping pixels
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) The UL corner of pixs2 is placed at (x2, y2) in pixs1.
- * (2) This measure is similar to the correlation.
- *
- */
-l_ok
-pixFindOverlapFraction(PIX *pixs1,
- PIX *pixs2,
- l_int32 x2,
- l_int32 y2,
- l_int32 *tab,
- l_float32 *pratio,
- l_int32 *pnoverlap)
-{
-l_int32 *tab8;
-l_int32 w, h, nintersect, nunion;
-PIX *pixt;
-
- PROCNAME("pixFindOverlapFraction");
-
- if (pnoverlap) *pnoverlap = 0;
- if (!pratio)
- return ERROR_INT("&ratio not defined", procName, 1);
- *pratio = 0.0;
- if (!pixs1 || pixGetDepth(pixs1) != 1)
- return ERROR_INT("pixs1 not defined or not 1 bpp", procName, 1);
- if (!pixs2 || pixGetDepth(pixs2) != 1)
- return ERROR_INT("pixs2 not defined or not 1 bpp", procName, 1);
-
- if (!tab)
- tab8 = makePixelSumTab8();
- else
- tab8 = tab;
-
- pixGetDimensions(pixs2, &w, &h, NULL);
- pixt = pixCopy(NULL, pixs1);
- pixRasterop(pixt, x2, y2, w, h, PIX_MASK, pixs2, 0, 0); /* AND */
- pixCountPixels(pixt, &nintersect, tab8);
- if (pnoverlap)
- *pnoverlap = nintersect;
- pixCopy(pixt, pixs1);
- pixRasterop(pixt, x2, y2, w, h, PIX_PAINT, pixs2, 0, 0); /* OR */
- pixCountPixels(pixt, &nunion, tab8);
- if (!tab) LEPT_FREE(tab8);
- pixDestroy(&pixt);
-
- if (nunion > 0)
- *pratio = (l_float32)nintersect / (l_float32)nunion;
- return 0;
-}
-
-
-/*!
- * \brief pixFindRectangleComps()
- *
- * \param[in] pixs 1 bpp
- * \param[in] dist max distance allowed between bounding box
- * and nearest foreground pixel within it
- * \param[in] minw, minh minimum size in each direction as a requirement
- * for a conforming rectangle
- * \return boxa of components that conform, or NULL on error
- *
- *
- * Notes:
- * (1) This applies the function pixConformsToRectangle() to
- * each 8-c.c. in pixs, and returns a boxa containing the
- * regions of all components that are conforming.
- * (2) Conforming components must satisfy both the size constraint
- * given by %minsize and the slop in conforming to a rectangle
- * determined by %dist.
- *
- */
-BOXA *
-pixFindRectangleComps(PIX *pixs,
- l_int32 dist,
- l_int32 minw,
- l_int32 minh)
-{
-l_int32 w, h, i, n, conforms;
-BOX *box;
-BOXA *boxa, *boxad;
-PIX *pix;
-PIXA *pixa;
-
- PROCNAME("pixFindRectangleComps");
-
- if (!pixs || pixGetDepth(pixs) != 1)
- return (BOXA *)ERROR_PTR("pixs undefined or not 1 bpp", procName, NULL);
- if (dist < 0)
- return (BOXA *)ERROR_PTR("dist must be >= 0", procName, NULL);
- if (minw <= 2 * dist && minh <= 2 * dist)
- return (BOXA *)ERROR_PTR("invalid parameters", procName, NULL);
-
- boxa = pixConnComp(pixs, &pixa, 8);
- boxad = boxaCreate(0);
- n = pixaGetCount(pixa);
- for (i = 0; i < n; i++) {
- pix = pixaGetPix(pixa, i, L_CLONE);
- pixGetDimensions(pix, &w, &h, NULL);
- if (w < minw || h < minh) {
- pixDestroy(&pix);
- continue;
- }
- pixConformsToRectangle(pix, NULL, dist, &conforms);
- if (conforms) {
- box = boxaGetBox(boxa, i, L_COPY);
- boxaAddBox(boxad, box, L_INSERT);
- }
- pixDestroy(&pix);
- }
- boxaDestroy(&boxa);
- pixaDestroy(&pixa);
- return boxad;
-}
-
-
-/*!
- * \brief pixConformsToRectangle()
- *
- * \param[in] pixs 1 bpp
- * \param[in] box [optional] if null, use the entire pixs
- * \param[in] dist max distance allowed between bounding box and
- * nearest foreground pixel within it
- * \param[out] pconforms 0 (false) if not conforming;
- * 1 (true) if conforming
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) There are several ways to test if a connected component has
- * an essentially rectangular boundary, such as:
- * a. Fraction of fill into the bounding box
- * b. Max-min distance of fg pixel from periphery of bounding box
- * c. Max depth of bg intrusions into component within bounding box
- * The weakness of (a) is that it is highly sensitive to holes
- * within the c.c. The weakness of (b) is that it can have
- * arbitrarily large intrusions into the c.c. Method (c) tests
- * the integrity of the outer boundary of the c.c., with respect
- * to the enclosing bounding box, so we use it.
- * (2) This tests if the connected component within the box conforms
- * to the box at all points on the periphery within %dist.
- * Inside, at a distance from the box boundary that is greater
- * than %dist, we don't care about the pixels in the c.c.
- * (3) We can think of the conforming condition as follows:
- * No pixel inside a distance %dist from the boundary
- * can connect to the boundary through a path through the bg.
- * To implement this, we need to do a flood fill. We can go
- * either from inside toward the boundary, or the other direction.
- * It's easiest to fill from the boundary, and then verify that
- * there are no filled pixels farther than %dist from the boundary.
- *
- */
-l_ok
-pixConformsToRectangle(PIX *pixs,
- BOX *box,
- l_int32 dist,
- l_int32 *pconforms)
-{
-l_int32 w, h, empty;
-PIX *pix1, *pix2;
-
- PROCNAME("pixConformsToRectangle");
-
- if (!pconforms)
- return ERROR_INT("&conforms not defined", procName, 1);
- *pconforms = 0;
- if (!pixs || pixGetDepth(pixs) != 1)
- return ERROR_INT("pixs not defined or not 1 bpp", procName, 1);
- if (dist < 0)
- return ERROR_INT("dist must be >= 0", procName, 1);
- pixGetDimensions(pixs, &w, &h, NULL);
- if (w <= 2 * dist || h <= 2 * dist) {
- L_WARNING("automatic conformation: distance too large\n", procName);
- *pconforms = 1;
- return 0;
- }
-
- /* Extract the region, if necessary */
- if (box)
- pix1 = pixClipRectangle(pixs, box, NULL);
- else
- pix1 = pixCopy(NULL, pixs);
-
- /* Invert and fill from the boundary into the interior.
- * Because we're considering the connected component in an
- * 8-connected sense, we do the background filling as 4 c.c. */
- pixInvert(pix1, pix1);
- pix2 = pixExtractBorderConnComps(pix1, 4);
-
- /* Mask out all pixels within a distance %dist from the box
- * boundary. Any remaining pixels are from filling that goes
- * more than %dist from the boundary. If no pixels remain,
- * the component conforms to the bounding rectangle within
- * a distance %dist. */
- pixSetOrClearBorder(pix2, dist, dist, dist, dist, PIX_CLR);
- pixZero(pix2, &empty);
- pixDestroy(&pix1);
- pixDestroy(&pix2);
- *pconforms = (empty) ? 1 : 0;
- return 0;
-}
-
-
-/*-----------------------------------------------------------------------*
- * Extract rectangular region *
- *-----------------------------------------------------------------------*/
-/*!
- * \brief pixClipRectangles()
- *
- * \param[in] pixs
- * \param[in] boxa requested clipping regions
- * \return pixa consisting of requested regions, or NULL on error
- *
- *
- * Notes:
- * (1) The returned pixa includes the actual regions clipped out from
- * the input pixs.
- *
- */
-PIXA *
-pixClipRectangles(PIX *pixs,
- BOXA *boxa)
-{
-l_int32 i, n;
-BOX *box, *boxc;
-PIX *pix;
-PIXA *pixa;
-
- PROCNAME("pixClipRectangles");
-
- if (!pixs)
- return (PIXA *)ERROR_PTR("pixs not defined", procName, NULL);
- if (!boxa)
- return (PIXA *)ERROR_PTR("boxa not defined", procName, NULL);
-
- n = boxaGetCount(boxa);
- pixa = pixaCreate(n);
- for (i = 0; i < n; i++) {
- box = boxaGetBox(boxa, i, L_CLONE);
- pix = pixClipRectangle(pixs, box, &boxc);
- pixaAddPix(pixa, pix, L_INSERT);
- pixaAddBox(pixa, boxc, L_INSERT);
- boxDestroy(&box);
- }
-
- return pixa;
-}
-
-
-/*!
- * \brief pixClipRectangle()
- *
- * \param[in] pixs
- * \param[in] box requested clipping region; const
- * \param[out] pboxc [optional] actual box of clipped region
- * \return clipped pix, or NULL on error or if rectangle
- * doesn't intersect pixs
- *
- *
- * Notes:
- *
- * This should be simple, but there are choices to be made.
- * The box is defined relative to the pix coordinates. However,
- * if the box is not contained within the pix, we have two choices:
- *
- * (1) clip the box to the pix
- * (2) make a new pix equal to the full box dimensions,
- * but let rasterop do the clipping and positioning
- * of the src with respect to the dest
- *
- * Choice (2) immediately brings up the problem of what pixel values
- * to use that were not taken from the src. For example, on a grayscale
- * image, do you want the pixels not taken from the src to be black
- * or white or something else? To implement choice 2, one needs to
- * specify the color of these extra pixels.
- *
- * So we adopt (1), and clip the box first, if necessary,
- * before making the dest pix and doing the rasterop. But there
- * is another issue to consider. If you want to paste the
- * clipped pix back into pixs, it must be properly aligned, and
- * it is necessary to use the clipped box for alignment.
- * Accordingly, this function has a third (optional) argument, which is
- * the input box clipped to the src pix.
- *
- */
-PIX *
-pixClipRectangle(PIX *pixs,
- BOX *box,
- BOX **pboxc)
-{
-l_int32 w, h, d, bx, by, bw, bh;
-BOX *boxc;
-PIX *pixd;
-
- PROCNAME("pixClipRectangle");
-
- if (pboxc) *pboxc = NULL;
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- if (!box)
- return (PIX *)ERROR_PTR("box not defined", procName, NULL);
-
- /* Clip the input box to the pix */
- pixGetDimensions(pixs, &w, &h, &d);
- if ((boxc = boxClipToRectangle(box, w, h)) == NULL) {
- L_WARNING("box doesn't overlap pix\n", procName);
- return NULL;
- }
- boxGetGeometry(boxc, &bx, &by, &bw, &bh);
-
- /* Extract the block */
- if ((pixd = pixCreate(bw, bh, d)) == NULL) {
- boxDestroy(&boxc);
- return (PIX *)ERROR_PTR("pixd not made", procName, NULL);
- }
- pixCopyResolution(pixd, pixs);
- pixCopyColormap(pixd, pixs);
- pixCopyText(pixd, pixs);
- pixRasterop(pixd, 0, 0, bw, bh, PIX_SRC, pixs, bx, by);
-
- if (pboxc)
- *pboxc = boxc;
- else
- boxDestroy(&boxc);
-
- return pixd;
-}
-
-
-/*!
- * \brief pixClipMasked()
- *
- * \param[in] pixs 1, 2, 4, 8, 16, 32 bpp; colormap ok
- * \param[in] pixm clipping mask, 1 bpp
- * \param[in] x, y origin of clipping mask relative to pixs
- * \param[in] outval val to use for pixels that are outside the mask
- * \return pixd, clipped pix or NULL on error or if pixm doesn't
- * intersect pixs
- *
- *
- * Notes:
- * (1) If pixs has a colormap, it is preserved in pixd.
- * (2) The depth of pixd is the same as that of pixs.
- * (3) If the depth of pixs is 1, use %outval = 0 for white background
- * and 1 for black; otherwise, use the max value for white
- * and 0 for black. If pixs has a colormap, the max value for
- * %outval is 0xffffffff; otherwise, it is 2^d - 1.
- * (4) When using 1 bpp pixs, this is a simple clip and
- * blend operation. For example, if both pix1 and pix2 are
- * black text on white background, and you want to OR the
- * fg on the two images, let pixm be the inverse of pix2.
- * Then the operation takes all of pix1 that's in the bg of
- * pix2, and for the remainder (which are the pixels
- * corresponding to the fg of the pix2), paint them black
- * (1) in pix1. The function call looks like
- * pixClipMasked(pix2, pixInvert(pix1, pix1), x, y, 1);
- *
- */
-PIX *
-pixClipMasked(PIX *pixs,
- PIX *pixm,
- l_int32 x,
- l_int32 y,
- l_uint32 outval)
-{
-l_int32 wm, hm, index, rval, gval, bval;
-l_uint32 pixel;
-BOX *box;
-PIX *pixmi, *pixd;
-PIXCMAP *cmap;
-
- PROCNAME("pixClipMasked");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- if (!pixm || pixGetDepth(pixm) != 1)
- return (PIX *)ERROR_PTR("pixm undefined or not 1 bpp", procName, NULL);
-
- /* Clip out the region specified by pixm and (x,y) */
- pixGetDimensions(pixm, &wm, &hm, NULL);
- box = boxCreate(x, y, wm, hm);
- pixd = pixClipRectangle(pixs, box, NULL);
-
- /* Paint 'outval' (or something close to it if cmapped) through
- * the pixels not masked by pixm */
- cmap = pixGetColormap(pixd);
- pixmi = pixInvert(NULL, pixm);
- if (cmap) {
- extractRGBValues(outval, &rval, &gval, &bval);
- pixcmapGetNearestIndex(cmap, rval, gval, bval, &index);
- pixcmapGetColor(cmap, index, &rval, &gval, &bval);
- composeRGBPixel(rval, gval, bval, &pixel);
- pixPaintThroughMask(pixd, pixmi, 0, 0, pixel);
- } else {
- pixPaintThroughMask(pixd, pixmi, 0, 0, outval);
- }
-
- boxDestroy(&box);
- pixDestroy(&pixmi);
- return pixd;
-}
-
-
-/*!
- * \brief pixCropToMatch()
- *
- * \param[in] pixs1 any depth, colormap OK
- * \param[in] pixs2 any depth, colormap OK
- * \param[out] ppixd1 may be a clone
- * \param[out] ppixd2 may be a clone
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This resizes pixs1 and/or pixs2 by cropping at the right
- * and bottom, so that they're the same size.
- * (2) If a pix doesn't need to be cropped, a clone is returned.
- * (3) Note: the images are implicitly aligned to the UL corner.
- *
- */
-l_ok
-pixCropToMatch(PIX *pixs1,
- PIX *pixs2,
- PIX **ppixd1,
- PIX **ppixd2)
-{
-l_int32 w1, h1, w2, h2, w, h;
-
- PROCNAME("pixCropToMatch");
-
- if (!ppixd1 || !ppixd2)
- return ERROR_INT("&pixd1 and &pixd2 not both defined", procName, 1);
- *ppixd1 = *ppixd2 = NULL;
- if (!pixs1 || !pixs2)
- return ERROR_INT("pixs1 and pixs2 not defined", procName, 1);
-
- pixGetDimensions(pixs1, &w1, &h1, NULL);
- pixGetDimensions(pixs2, &w2, &h2, NULL);
- w = L_MIN(w1, w2);
- h = L_MIN(h1, h2);
-
- *ppixd1 = pixCropToSize(pixs1, w, h);
- *ppixd2 = pixCropToSize(pixs2, w, h);
- if (*ppixd1 == NULL || *ppixd2 == NULL)
- return ERROR_INT("cropped image failure", procName, 1);
- return 0;
-}
-
-
-/*!
- * \brief pixCropToSize()
- *
- * \param[in] pixs any depth, colormap OK
- * \param[in] w, h max dimensions of cropped image
- * \return pixd cropped if necessary or NULL on error.
- *
- *
- * Notes:
- * (1) If either w or h is smaller than the corresponding dimension
- * of pixs, this returns a cropped image; otherwise it returns
- * a clone of pixs.
- *
- */
-PIX *
-pixCropToSize(PIX *pixs,
- l_int32 w,
- l_int32 h)
-{
-l_int32 ws, hs, wd, hd, d;
-PIX *pixd;
-
- PROCNAME("pixCropToSize");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
-
- pixGetDimensions(pixs, &ws, &hs, &d);
- if (ws <= w && hs <= h) /* no cropping necessary */
- return pixClone(pixs);
-
- wd = L_MIN(ws, w);
- hd = L_MIN(hs, h);
- if ((pixd = pixCreate(wd, hd, d)) == NULL)
- return (PIX *)ERROR_PTR("pixd not made", procName, NULL);
- pixCopyResolution(pixd, pixs);
- pixCopyColormap(pixd, pixs);
- pixCopyText(pixd, pixs);
- pixCopyInputFormat(pixd, pixs);
- pixRasterop(pixd, 0, 0, wd, hd, PIX_SRC, pixs, 0, 0);
- return pixd;
-}
-
-
-/*!
- * \brief pixResizeToMatch()
- *
- * \param[in] pixs 1, 2, 4, 8, 16, 32 bpp; colormap ok
- * \param[in] pixt can be null; we use only the size
- * \param[in] w, h ignored if pixt is defined
- * \return pixd resized to match or NULL on error
- *
- *
- * Notes:
- * (1) This resizes pixs to make pixd, without scaling, by either
- * cropping or extending separately in both width and height.
- * Extension is done by replicating the last row or column.
- * This is useful in a situation where, due to scaling
- * operations, two images that are expected to be the
- * same size can differ slightly in each dimension.
- * (2) You can use either an existing pixt or specify
- * both %w and %h. If pixt is defined, the values
- * in %w and %h are ignored.
- * (3) If pixt is larger than pixs (or if w and/or d is larger
- * than the dimension of pixs, replicate the outer row and
- * column of pixels in pixs into pixd.
- *
- */
-PIX *
-pixResizeToMatch(PIX *pixs,
- PIX *pixt,
- l_int32 w,
- l_int32 h)
-{
-l_int32 i, j, ws, hs, d;
-PIX *pixd;
-
- PROCNAME("pixResizeToMatch");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- if (!pixt && (w <= 0 || h <= 0))
- return (PIX *)ERROR_PTR("both w and h not > 0", procName, NULL);
-
- if (pixt) /* redefine w, h */
- pixGetDimensions(pixt, &w, &h, NULL);
- pixGetDimensions(pixs, &ws, &hs, &d);
- if (ws == w && hs == h)
- return pixCopy(NULL, pixs);
-
- if ((pixd = pixCreate(w, h, d)) == NULL)
- return (PIX *)ERROR_PTR("pixd not made", procName, NULL);
- pixCopyResolution(pixd, pixs);
- pixCopyColormap(pixd, pixs);
- pixCopyText(pixd, pixs);
- pixCopyInputFormat(pixd, pixs);
- pixRasterop(pixd, 0, 0, ws, hs, PIX_SRC, pixs, 0, 0);
- if (ws >= w && hs >= h)
- return pixd;
-
- /* Replicate the last column and then the last row */
- if (ws < w) {
- for (j = ws; j < w; j++)
- pixRasterop(pixd, j, 0, 1, h, PIX_SRC, pixd, ws - 1, 0);
- }
- if (hs < h) {
- for (i = hs; i < h; i++)
- pixRasterop(pixd, 0, i, w, 1, PIX_SRC, pixd, 0, hs - 1);
- }
-
- return pixd;
-}
-
-
-/*---------------------------------------------------------------------*
- * Select a connected component by size *
- *---------------------------------------------------------------------*/
-/*!
- * \brief pixSelectComponentBySize()
- *
- * \param[in] pixs 1 bpp
- * \param[in] rankorder in decreasing size: 0 for largest.
- * \param[in] type L_SELECT_BY_WIDTH, L_SELECT_BY_HEIGHT,
- * L_SELECT_BY_MAX_DIMENSION,
- * L_SELECT_BY_AREA, L_SELECT_BY_PERIMETER
- * \param[in] connectivity 4 or 8
- * \param[out] pbox [optional] location of returned component
- * \return pix of rank order connected component, or NULL on error.
- *
- *
- * Notes:
- * (1) This selects the Nth largest connected component, based on
- * the selection type and connectivity.
- * (2) Note that %rankorder is an integer. Use %rankorder = 0 for
- * the largest component and %rankorder = -1 for the smallest.
- * If %rankorder >= number of components, select the smallest.
- */
-PIX *
-pixSelectComponentBySize(PIX *pixs,
- l_int32 rankorder,
- l_int32 type,
- l_int32 connectivity,
- BOX **pbox)
-{
-l_int32 n, empty, sorttype, index;
-BOXA *boxa1;
-NUMA *naindex;
-PIX *pixd;
-PIXA *pixa1, *pixa2;
-
- PROCNAME("pixSelectComponentBySize");
-
- if (pbox) *pbox = NULL;
- if (!pixs || pixGetDepth(pixs) != 1)
- return (PIX *)ERROR_PTR("pixs undefined or not 1 bpp", procName, NULL);
- if (type == L_SELECT_BY_WIDTH)
- sorttype = L_SORT_BY_WIDTH;
- else if (type == L_SELECT_BY_HEIGHT)
- sorttype = L_SORT_BY_HEIGHT;
- else if (type == L_SELECT_BY_MAX_DIMENSION)
- sorttype = L_SORT_BY_MAX_DIMENSION;
- else if (type == L_SELECT_BY_AREA)
- sorttype = L_SORT_BY_AREA;
- else if (type == L_SELECT_BY_PERIMETER)
- sorttype = L_SORT_BY_PERIMETER;
- else
- return (PIX *)ERROR_PTR("invalid selection type", procName, NULL);
- if (connectivity != 4 && connectivity != 8)
- return (PIX *)ERROR_PTR("connectivity not 4 or 8", procName, NULL);
- pixZero(pixs, &empty);
- if (empty)
- return (PIX *)ERROR_PTR("no foreground pixels", procName, NULL);
-
- boxa1 = pixConnComp(pixs, &pixa1, connectivity);
- n = boxaGetCount(boxa1);
- if (rankorder < 0 || rankorder >= n)
- rankorder = n - 1; /* smallest */
- pixa2 = pixaSort(pixa1, sorttype, L_SORT_DECREASING, &naindex, L_CLONE);
- pixd = pixaGetPix(pixa2, rankorder, L_COPY);
- if (pbox) {
- numaGetIValue(naindex, rankorder, &index);
- *pbox = boxaGetBox(boxa1, index, L_COPY);
- }
-
- numaDestroy(&naindex);
- boxaDestroy(&boxa1);
- pixaDestroy(&pixa1);
- pixaDestroy(&pixa2);
- return pixd;
-}
-
-
-/*!
- * \brief pixFilterComponentBySize()
- *
- * \param[in] pixs 1 bpp
- * \param[in] rankorder in decreasing size: 0 for largest.
- * \param[in] type L_SELECT_BY_WIDTH, L_SELECT_BY_HEIGHT,
- * L_SELECT_BY_MAX_DIMENSION,
- * L_SELECT_BY_AREA, L_SELECT_BY_PERIMETER
- * \param[in] connectivity 4 or 8
- * \param[out] pbox [optional] location of returned component
- * \return pix with all other components removed, or NULL on error.
- *
- *
- * Notes:
- * (1) See notes in pixSelectComponentBySize().
- * (2) This returns a copy of %pixs, with all components removed
- * except for the selected one.
- */
-PIX *
-pixFilterComponentBySize(PIX *pixs,
- l_int32 rankorder,
- l_int32 type,
- l_int32 connectivity,
- BOX **pbox)
-{
-l_int32 x, y, w, h;
-BOX *box;
-PIX *pix1, *pix2;
-
- PROCNAME("pixFilterComponentBySize");
-
- if (!pixs || pixGetDepth(pixs) != 1)
- return (PIX *)ERROR_PTR("pixs undefined or not 1 bpp", procName, NULL);
-
- pix1 = pixSelectComponentBySize(pixs, rankorder, type, connectivity, &box);
- if (!pix1) {
- boxDestroy(&box);
- return (PIX *)ERROR_PTR("pix1 not made", procName, NULL);
- }
-
- /* Put the selected component in a new pix at the same
- * location as it had in %pixs */
- boxGetGeometry(box, &x, &y, &w, &h);
- pix2 = pixCreateTemplate(pixs);
- pixRasterop(pix2, x, y, w, h, PIX_SRC, pix1, 0, 0);
- if (pbox)
- *pbox = box;
- else
- boxDestroy(&box);
- pixDestroy(&pix1);
- return pix2;
-}
-
-
-/*---------------------------------------------------------------------*
- * Make special masks *
- *---------------------------------------------------------------------*/
-/*!
- * \brief pixMakeSymmetricMask()
- *
- * \param[in] w, h dimensions of output 1 bpp pix
- * \param[in] hf horizontal fraction of half-width
- * \param[in] vf vertical fraction of half-height
- * \param[in] type L_USE_INNER, L_USE_OUTER
- * \return pixd 1 bpp, or NULL on error.
- *
- *
- * Notes:
- * (1) This is a convenience function for generating masks with
- * horizontal and vertical reflection symmetry, over either
- * the inner or outer parts of an image.
- * (2) Using L_USE_INNER to generate a mask over the inner part
- * of the image, the mask is a solid rectangle, and the fractions
- * describe the distance between the boundary of the image and
- * the rectangle boundary. For example, with hf == vf == 0.0,
- * the mask covers the full image.
- * (3) Using L_USE_OUTER to generate a mask over an outer frame
- * of the image, the mask touches the boundary of the image,
- * and the fractions describe the location of the inner
- * boundary of the frame. For example, with hf == vf == 1.0,
- * the inner boundary is at the center of the image, so the
- * mask covers the full image.
- * (4) More examples:
- * * mask covering the inner 70%: hf = vf = 0.3, type = L_USE_INNER
- * * frame covering the outer 30%: hf = vf = 0.3, type = L_USE_OUTER
- *
- */
-PIX *
-pixMakeSymmetricMask(l_int32 w,
- l_int32 h,
- l_float32 hf,
- l_float32 vf,
- l_int32 type)
-{
- PROCNAME("pixMakeSymmetricMask");
-
- if (w <= 0 || h <= 0)
- return (PIX *)ERROR_PTR("mask size 0", procName, NULL);
- if (hf < 0.0 || hf > 1.0)
- return (PIX *)ERROR_PTR("invalid horiz fractions", procName, NULL);
- if (vf < 0.0 || vf > 1.0)
- return (PIX *)ERROR_PTR("invalid vert fractions", procName, NULL);
-
- if (type == L_USE_INNER)
- return pixMakeFrameMask(w, h, hf, 1.0, vf, 1.0);
- else if (type == L_USE_OUTER)
- return pixMakeFrameMask(w, h, 0.0, hf, 0.0, vf);
- else
- return (PIX *)ERROR_PTR("invalid type", procName, NULL);
-}
-
-
-/*!
- * \brief pixMakeFrameMask()
- *
- * \param[in] w, h dimensions of output 1 bpp pix
- * \param[in] hf1 horizontal fraction of half-width at outer frame bdry
- * \param[in] hf2 horizontal fraction of half-width at inner frame bdry
- * \param[in] vf1 vertical fraction of half-width at outer frame bdry
- * \param[in] vf2 vertical fraction of half-width at inner frame bdry
- * \return pixd 1 bpp, or NULL on error.
- *
- *
- * Notes:
- * (1) This makes an arbitrary 1-component mask with a centered fg
- * frame, which can have both an inner and an outer boundary.
- * All input fractional distances are measured from the image
- * border to the frame boundary, in units of the image half-width
- * for hf1 and hf2 and the image half-height for vf1 and vf2.
- * The distances to the outer frame boundary are given by hf1
- * and vf1; to the inner frame boundary, by hf2 and vf2.
- * Input fractions are thus in [0.0 ... 1.0], with hf1 <= hf2
- * and vf1 <= vf2. Horizontal and vertical frame widths are
- * thus independently specified.
- * (2) Special cases:
- * * full fg mask: hf1 = vf1 = 0.0, hf2 = vf2 = 1.0.
- * * empty fg (zero width) mask: set hf1 = hf2 and vf1 = vf2.
- * * fg rectangle with no hole: set hf2 = vf2 = 1.0.
- * * frame touching outer boundary: set hf1 = vf1 = 0.0.
- * (3) The vertical thickness of the horizontal mask parts
- * is 0.5 * (vf2 - vf1) * h. The horizontal thickness of the
- * vertical mask parts is 0.5 * (hf2 - hf1) * w.
- *
- */
-PIX *
-pixMakeFrameMask(l_int32 w,
- l_int32 h,
- l_float32 hf1,
- l_float32 hf2,
- l_float32 vf1,
- l_float32 vf2)
-{
-l_int32 h1, h2, v1, v2;
-PIX *pixd;
-
- PROCNAME("pixMakeFrameMask");
-
- if (w <= 0 || h <= 0)
- return (PIX *)ERROR_PTR("mask size 0", procName, NULL);
- if (hf1 < 0.0 || hf1 > 1.0 || hf2 < 0.0 || hf2 > 1.0)
- return (PIX *)ERROR_PTR("invalid horiz fractions", procName, NULL);
- if (vf1 < 0.0 || vf1 > 1.0 || vf2 < 0.0 || vf2 > 1.0)
- return (PIX *)ERROR_PTR("invalid vert fractions", procName, NULL);
- if (hf1 > hf2 || vf1 > vf2)
- return (PIX *)ERROR_PTR("invalid relative sizes", procName, NULL);
-
- pixd = pixCreate(w, h, 1);
-
- /* Special cases */
- if (hf1 == 0.0 && vf1 == 0.0 && hf2 == 1.0 && vf2 == 1.0) { /* full */
- pixSetAll(pixd);
- return pixd;
- }
- if (hf1 == hf2 && vf1 == vf2) { /* empty */
- return pixd;
- }
-
- /* General case */
- h1 = 0.5 * hf1 * w;
- h2 = 0.5 * hf2 * w;
- v1 = 0.5 * vf1 * h;
- v2 = 0.5 * vf2 * h;
- pixRasterop(pixd, h1, v1, w - 2 * h1, h - 2 * v1, PIX_SET, NULL, 0, 0);
- if (hf2 < 1.0 && vf2 < 1.0)
- pixRasterop(pixd, h2, v2, w - 2 * h2, h - 2 * v2, PIX_CLR, NULL, 0, 0);
- return pixd;
-}
-
-
-/*---------------------------------------------------------------------*
- * Generate a covering of rectangles over connected components *
- *---------------------------------------------------------------------*/
-/*!
- * \brief pixMakeCoveringOfRectangles()
- *
- * \param[in] pixs 1 bpp
- * \param[in] maxiters max iterations: use 0 to iterate to completion
- * \return pixd, or NULL on error
- *
- *
- * Notes:
- * (1) This iteratively finds the bounding boxes of the connected
- * components and generates a mask from them. Two iterations
- * should suffice for most situations.
- * (2) Returns an empty pix if %pixs is empty.
- * (3) If there are many small components in proximity, it may
- * be useful to merge them with a morphological closing before
- * calling this one.
- *
- */
-PIX *
-pixMakeCoveringOfRectangles(PIX *pixs,
- l_int32 maxiters)
-{
-l_int32 empty, same, niters;
-BOXA *boxa;
-PIX *pix1, *pix2;
-
- PROCNAME("pixMakeCoveringOfRectangles");
-
- if (!pixs || pixGetDepth(pixs) != 1)
- return (PIX *)ERROR_PTR("pixs undefined or not 1 bpp", procName, NULL);
- if (maxiters < 0)
- return (PIX *)ERROR_PTR("maxiters must be >= 0", procName, NULL);
- if (maxiters == 0) maxiters = 50; /* ridiculously large number */
-
- pixZero(pixs, &empty);
- pix1 = pixCreateTemplate(pixs);
- if (empty) return pix1;
-
- /* Do first iteration */
- boxa = pixConnCompBB(pixs, 8);
- pixMaskBoxa(pix1, pix1, boxa, L_SET_PIXELS);
- boxaDestroy(&boxa);
- if (maxiters == 1) return pix1;
-
- niters = 1;
- while (niters < maxiters) { /* continue to add pixels to pix1 */
- niters++;
- boxa = pixConnCompBB(pix1, 8);
- pix2 = pixCopy(NULL, pix1);
- pixMaskBoxa(pix1, pix1, boxa, L_SET_PIXELS);
- boxaDestroy(&boxa);
- pixEqual(pix1, pix2, &same);
- pixDestroy(&pix2);
- if (same) {
- L_INFO("%d iterations\n", procName, niters - 1);
- return pix1;
- }
- }
- L_INFO("maxiters = %d reached\n", procName, niters);
- return pix1;
-}
-
-
-/*---------------------------------------------------------------------*
- * Fraction of Fg pixels under a mask *
- *---------------------------------------------------------------------*/
-/*!
- * \brief pixFractionFgInMask()
- *
- * \param[in] pix1 1 bpp
- * \param[in] pix2 1 bpp
- * \param[out] pfract fraction of fg pixels in 1 that are
- * aligned with the fg of 2
- * \return 0 if OK, 1 on error.
- *
- *
- * Notes:
- * (1) This gives the fraction of fg pixels in pix1 that are in
- * the intersection (i.e., under the fg) of pix2:
- * |1 & 2|/|1|, where |...| means the number of fg pixels.
- * Note that this is different from the situation where
- * pix1 and pix2 are reversed.
- * (2) Both pix1 and pix2 are registered to the UL corners. A warning
- * is issued if pix1 and pix2 have different sizes.
- * (3) This can also be used to find the fraction of fg pixels in pix1
- * that are NOT under the fg of pix2: 1.0 - |1 & 2|/|1|
- * (4) If pix1 or pix2 are empty, this returns %fract = 0.0.
- * (5) For example, pix2 could be a frame around the outside of the
- * image, made from pixMakeFrameMask().
- *
- */
-l_ok
-pixFractionFgInMask(PIX *pix1,
- PIX *pix2,
- l_float32 *pfract)
-{
-l_int32 w1, h1, w2, h2, empty, count1, count3;
-PIX *pix3;
-
- PROCNAME("pixFractionFgInMask");
-
- if (!pfract)
- return ERROR_INT("&fract not defined", procName, 1);
- *pfract = 0.0;
- if (!pix1 || pixGetDepth(pix1) != 1)
- return ERROR_INT("pix1 not defined or not 1 bpp", procName, 1);
- if (!pix2 || pixGetDepth(pix2) != 1)
- return ERROR_INT("pix2 not defined or not 1 bpp", procName, 1);
-
- pixGetDimensions(pix1, &w1, &h1, NULL);
- pixGetDimensions(pix2, &w2, &h2, NULL);
- if (w1 != w2 || h1 != h2) {
- L_INFO("sizes unequal: (w1,w2) = (%d,%d), (h1,h2) = (%d,%d)\n",
- procName, w1, w2, h1, h2);
- }
- pixZero(pix1, &empty);
- if (empty) return 0;
- pixZero(pix2, &empty);
- if (empty) return 0;
-
- pix3 = pixCopy(NULL, pix1);
- pixAnd(pix3, pix3, pix2);
- pixCountPixels(pix1, &count1, NULL); /* |1| */
- pixCountPixels(pix3, &count3, NULL); /* |1 & 2| */
- *pfract = (l_float32)count3 / (l_float32)count1;
- pixDestroy(&pix3);
- return 0;
-}
-
-
-/*---------------------------------------------------------------------*
- * Clip to Foreground *
- *---------------------------------------------------------------------*/
-/*!
- * \brief pixClipToForeground()
- *
- * \param[in] pixs 1 bpp
- * \param[out] ppixd [optional] clipped pix returned
- * \param[out] pbox [optional] bounding box
- * \return 0 if OK; 1 on error or if there are no fg pixels
- *
- *
- * Notes:
- * (1) At least one of {&pixd, &box} must be specified.
- * (2) If there are no fg pixels, the returned ptrs are null.
- *
- */
-l_ok
-pixClipToForeground(PIX *pixs,
- PIX **ppixd,
- BOX **pbox)
-{
-l_int32 w, h, wpl, nfullwords, extra, i, j;
-l_int32 minx, miny, maxx, maxy;
-l_uint32 result, mask;
-l_uint32 *data, *line;
-BOX *box;
-
- PROCNAME("pixClipToForeground");
-
- if (ppixd) *ppixd = NULL;
- if (pbox) *pbox = NULL;
- if (!ppixd && !pbox)
- return ERROR_INT("no output requested", procName, 1);
- if (!pixs || (pixGetDepth(pixs) != 1))
- return ERROR_INT("pixs not defined or not 1 bpp", procName, 1);
-
- pixGetDimensions(pixs, &w, &h, NULL);
- nfullwords = w / 32;
- extra = w & 31;
- mask = ~rmask32[32 - extra];
- wpl = pixGetWpl(pixs);
- data = pixGetData(pixs);
-
- result = 0;
- for (i = 0, miny = 0; i < h; i++, miny++) {
- line = data + i * wpl;
- for (j = 0; j < nfullwords; j++)
- result |= line[j];
- if (extra)
- result |= (line[j] & mask);
- if (result)
- break;
- }
- if (miny == h) /* no ON pixels */
- return 1;
-
- result = 0;
- for (i = h - 1, maxy = h - 1; i >= 0; i--, maxy--) {
- line = data + i * wpl;
- for (j = 0; j < nfullwords; j++)
- result |= line[j];
- if (extra)
- result |= (line[j] & mask);
- if (result)
- break;
- }
-
- minx = 0;
- for (j = 0, minx = 0; j < w; j++, minx++) {
- for (i = 0; i < h; i++) {
- line = data + i * wpl;
- if (GET_DATA_BIT(line, j))
- goto minx_found;
- }
- }
-
-minx_found:
- for (j = w - 1, maxx = w - 1; j >= 0; j--, maxx--) {
- for (i = 0; i < h; i++) {
- line = data + i * wpl;
- if (GET_DATA_BIT(line, j))
- goto maxx_found;
- }
- }
-
-maxx_found:
- box = boxCreate(minx, miny, maxx - minx + 1, maxy - miny + 1);
-
- if (ppixd)
- *ppixd = pixClipRectangle(pixs, box, NULL);
- if (pbox)
- *pbox = box;
- else
- boxDestroy(&box);
-
- return 0;
-}
-
-
-/*!
- * \brief pixTestClipToForeground()
- *
- * \param[in] pixs 1 bpp
- * \param[out] pcanclip 1 if fg does not extend to all four edges
- * \return 0 if OK; 1 on error
- *
- *
- * Notes:
- * (1) This is a lightweight test to determine if a 1 bpp image
- * can be further cropped without loss of fg pixels.
- * If it cannot, canclip is set to 0.
- * (2) It does not test for the existence of any fg pixels.
- * If there are no fg pixels, it will return %canclip = 1.
- * Check the output of the subsequent call to pixClipToForeground().
- *
- */
-l_ok
-pixTestClipToForeground(PIX *pixs,
- l_int32 *pcanclip)
-{
-l_int32 i, j, w, h, wpl, found;
-l_uint32 *data, *line;
-
- PROCNAME("pixTestClipToForeground");
-
- if (!pcanclip)
- return ERROR_INT("&canclip not defined", procName, 1);
- *pcanclip = 0;
- if (!pixs || (pixGetDepth(pixs) != 1))
- return ERROR_INT("pixs not defined or not 1 bpp", procName, 1);
-
- /* Check top and bottom raster lines */
- pixGetDimensions(pixs, &w, &h, NULL);
- data = pixGetData(pixs);
- wpl = pixGetWpl(pixs);
- found = FALSE;
- for (j = 0; found == FALSE && j < w; j++)
- found = GET_DATA_BIT(data, j);
- if (!found) {
- *pcanclip = 1;
- return 0;
- }
-
- line = data + (h - 1) * wpl;
- found = FALSE;
- for (j = 0; found == FALSE && j < w; j++)
- found = GET_DATA_BIT(data, j);
- if (!found) {
- *pcanclip = 1;
- return 0;
- }
-
- /* Check left and right edges */
- found = FALSE;
- for (i = 0, line = data; found == FALSE && i < h; line += wpl, i++)
- found = GET_DATA_BIT(line, 0);
- if (!found) {
- *pcanclip = 1;
- return 0;
- }
-
- found = FALSE;
- for (i = 0, line = data; found == FALSE && i < h; line += wpl, i++)
- found = GET_DATA_BIT(line, w - 1);
- if (!found)
- *pcanclip = 1;
-
- return 0; /* fg pixels found on all edges */
-}
-
-
-/*!
- * \brief pixClipBoxToForeground()
- *
- * \param[in] pixs 1 bpp
- * \param[in] boxs [optional] use full image if null
- * \param[out] ppixd [optional] clipped pix returned
- * \param[out] pboxd [optional] bounding box
- * \return 0 if OK; 1 on error or if there are no fg pixels
- *
- *
- * Notes:
- * (1) At least one of {&pixd, &boxd} must be specified.
- * (2) If there are no fg pixels, the returned ptrs are null.
- * (3) Do not use &pixs for the 3rd arg or &boxs for the 4th arg;
- * this will leak memory.
- *
- */
-l_ok
-pixClipBoxToForeground(PIX *pixs,
- BOX *boxs,
- PIX **ppixd,
- BOX **pboxd)
-{
-l_int32 w, h, bx, by, bw, bh, cbw, cbh, left, right, top, bottom;
-BOX *boxt, *boxd;
-
- PROCNAME("pixClipBoxToForeground");
-
- if (ppixd) *ppixd = NULL;
- if (pboxd) *pboxd = NULL;
- if (!ppixd && !pboxd)
- return ERROR_INT("no output requested", procName, 1);
- if (!pixs || (pixGetDepth(pixs) != 1))
- return ERROR_INT("pixs not defined or not 1 bpp", procName, 1);
-
- if (!boxs)
- return pixClipToForeground(pixs, ppixd, pboxd);
-
- pixGetDimensions(pixs, &w, &h, NULL);
- boxGetGeometry(boxs, &bx, &by, &bw, &bh);
- cbw = L_MIN(bw, w - bx);
- cbh = L_MIN(bh, h - by);
- if (cbw < 0 || cbh < 0)
- return ERROR_INT("box not within image", procName, 1);
- boxt = boxCreate(bx, by, cbw, cbh);
-
- if (pixScanForForeground(pixs, boxt, L_FROM_LEFT, &left)) {
- boxDestroy(&boxt);
- return 1;
- }
- pixScanForForeground(pixs, boxt, L_FROM_RIGHT, &right);
- pixScanForForeground(pixs, boxt, L_FROM_TOP, &top);
- pixScanForForeground(pixs, boxt, L_FROM_BOT, &bottom);
-
- boxd = boxCreate(left, top, right - left + 1, bottom - top + 1);
- if (ppixd)
- *ppixd = pixClipRectangle(pixs, boxd, NULL);
- if (pboxd)
- *pboxd = boxd;
- else
- boxDestroy(&boxd);
-
- boxDestroy(&boxt);
- return 0;
-}
-
-
-/*!
- * \brief pixScanForForeground()
- *
- * \param[in] pixs 1 bpp
- * \param[in] box [optional] within which the search is conducted
- * \param[in] scanflag direction of scan; e.g., L_FROM_LEFT
- * \param[out] ploc location in scan direction of first black pixel
- * \return 0 if OK; 1 on error or if no fg pixels are found
- *
- *
- * Notes:
- * (1) If there are no fg pixels, the position is set to 0.
- * Caller must check the return value!
- * (2) Use %box == NULL to scan from edge of pixs
- *
- */
-l_ok
-pixScanForForeground(PIX *pixs,
- BOX *box,
- l_int32 scanflag,
- l_int32 *ploc)
-{
-l_int32 bx, by, bw, bh, x, xstart, xend, y, ystart, yend, wpl;
-l_uint32 *data, *line;
-BOX *boxt;
-
- PROCNAME("pixScanForForeground");
-
- if (!ploc)
- return ERROR_INT("&loc not defined", procName, 1);
- *ploc = 0;
- if (!pixs || (pixGetDepth(pixs) != 1))
- return ERROR_INT("pixs not defined or not 1 bpp", procName, 1);
-
- /* Clip box to pixs if it exists */
- pixGetDimensions(pixs, &bw, &bh, NULL);
- if (box) {
- if ((boxt = boxClipToRectangle(box, bw, bh)) == NULL)
- return ERROR_INT("invalid box", procName, 1);
- boxGetGeometry(boxt, &bx, &by, &bw, &bh);
- boxDestroy(&boxt);
- } else {
- bx = by = 0;
- }
- xstart = bx;
- ystart = by;
- xend = bx + bw - 1;
- yend = by + bh - 1;
-
- data = pixGetData(pixs);
- wpl = pixGetWpl(pixs);
- if (scanflag == L_FROM_LEFT) {
- for (x = xstart; x <= xend; x++) {
- for (y = ystart; y <= yend; y++) {
- line = data + y * wpl;
- if (GET_DATA_BIT(line, x)) {
- *ploc = x;
- return 0;
- }
- }
- }
- } else if (scanflag == L_FROM_RIGHT) {
- for (x = xend; x >= xstart; x--) {
- for (y = ystart; y <= yend; y++) {
- line = data + y * wpl;
- if (GET_DATA_BIT(line, x)) {
- *ploc = x;
- return 0;
- }
- }
- }
- } else if (scanflag == L_FROM_TOP) {
- for (y = ystart; y <= yend; y++) {
- line = data + y * wpl;
- for (x = xstart; x <= xend; x++) {
- if (GET_DATA_BIT(line, x)) {
- *ploc = y;
- return 0;
- }
- }
- }
- } else if (scanflag == L_FROM_BOT) {
- for (y = yend; y >= ystart; y--) {
- line = data + y * wpl;
- for (x = xstart; x <= xend; x++) {
- if (GET_DATA_BIT(line, x)) {
- *ploc = y;
- return 0;
- }
- }
- }
- } else {
- return ERROR_INT("invalid scanflag", procName, 1);
- }
-
- return 1; /* no fg found */
-}
-
-
-/*!
- * \brief pixClipBoxToEdges()
- *
- * \param[in] pixs 1 bpp
- * \param[in] boxs [optional] ; use full image if null
- * \param[in] lowthresh threshold to choose clipping location
- * \param[in] highthresh threshold required to find an edge
- * \param[in] maxwidth max allowed width between low and high thresh locs
- * \param[in] factor sampling factor along pixel counting direction
- * \param[out] ppixd [optional] clipped pix returned
- * \param[out] pboxd [optional] bounding box
- * \return 0 if OK; 1 on error or if a fg edge is not found from
- * all four sides.
- *
- *
- * Notes:
- * (1) At least one of {&pixd, &boxd} must be specified.
- * (2) If there are no fg pixels, the returned ptrs are null.
- * (3) This function attempts to locate rectangular "image" regions
- * of high-density fg pixels, that have well-defined edges
- * on the four sides.
- * (4) Edges are searched for on each side, iterating in order
- * from left, right, top and bottom. As each new edge is
- * found, the search box is resized to use that location.
- * Once an edge is found, it is held. If no more edges
- * are found in one iteration, the search fails.
- * (5) See pixScanForEdge() for usage of the thresholds and %maxwidth.
- * (6) The thresholds must be at least 1, and the low threshold
- * cannot be larger than the high threshold.
- * (7) If the low and high thresholds are both 1, this is equivalent
- * to pixClipBoxToForeground().
- *
- */
-l_ok
-pixClipBoxToEdges(PIX *pixs,
- BOX *boxs,
- l_int32 lowthresh,
- l_int32 highthresh,
- l_int32 maxwidth,
- l_int32 factor,
- PIX **ppixd,
- BOX **pboxd)
-{
-l_int32 w, h, bx, by, bw, bh, cbw, cbh, left, right, top, bottom;
-l_int32 lfound, rfound, tfound, bfound, change;
-BOX *boxt, *boxd;
-
- PROCNAME("pixClipBoxToEdges");
-
- if (ppixd) *ppixd = NULL;
- if (pboxd) *pboxd = NULL;
- if (!ppixd && !pboxd)
- return ERROR_INT("no output requested", procName, 1);
- if (!pixs || (pixGetDepth(pixs) != 1))
- return ERROR_INT("pixs not defined or not 1 bpp", procName, 1);
- if (lowthresh < 1 || highthresh < 1 ||
- lowthresh > highthresh || maxwidth < 1)
- return ERROR_INT("invalid thresholds", procName, 1);
- factor = L_MIN(1, factor);
-
- if (lowthresh == 1 && highthresh == 1)
- return pixClipBoxToForeground(pixs, boxs, ppixd, pboxd);
-
- pixGetDimensions(pixs, &w, &h, NULL);
- if (boxs) {
- boxGetGeometry(boxs, &bx, &by, &bw, &bh);
- cbw = L_MIN(bw, w - bx);
- cbh = L_MIN(bh, h - by);
- if (cbw < 0 || cbh < 0)
- return ERROR_INT("box not within image", procName, 1);
- boxt = boxCreate(bx, by, cbw, cbh);
- } else {
- boxt = boxCreate(0, 0, w, h);
- }
-
- lfound = rfound = tfound = bfound = 0;
- while (!lfound || !rfound || !tfound || !bfound) {
- change = 0;
- if (!lfound) {
- if (!pixScanForEdge(pixs, boxt, lowthresh, highthresh, maxwidth,
- factor, L_FROM_LEFT, &left)) {
- lfound = 1;
- change = 1;
- boxRelocateOneSide(boxt, boxt, left, L_FROM_LEFT);
- }
- }
- if (!rfound) {
- if (!pixScanForEdge(pixs, boxt, lowthresh, highthresh, maxwidth,
- factor, L_FROM_RIGHT, &right)) {
- rfound = 1;
- change = 1;
- boxRelocateOneSide(boxt, boxt, right, L_FROM_RIGHT);
- }
- }
- if (!tfound) {
- if (!pixScanForEdge(pixs, boxt, lowthresh, highthresh, maxwidth,
- factor, L_FROM_TOP, &top)) {
- tfound = 1;
- change = 1;
- boxRelocateOneSide(boxt, boxt, top, L_FROM_TOP);
- }
- }
- if (!bfound) {
- if (!pixScanForEdge(pixs, boxt, lowthresh, highthresh, maxwidth,
- factor, L_FROM_BOT, &bottom)) {
- bfound = 1;
- change = 1;
- boxRelocateOneSide(boxt, boxt, bottom, L_FROM_BOT);
- }
- }
-
-#if DEBUG_EDGES
- lept_stderr("iter: %d %d %d %d\n", lfound, rfound, tfound, bfound);
-#endif /* DEBUG_EDGES */
-
- if (change == 0) break;
- }
- boxDestroy(&boxt);
-
- if (change == 0)
- return ERROR_INT("not all edges found", procName, 1);
-
- boxd = boxCreate(left, top, right - left + 1, bottom - top + 1);
- if (ppixd)
- *ppixd = pixClipRectangle(pixs, boxd, NULL);
- if (pboxd)
- *pboxd = boxd;
- else
- boxDestroy(&boxd);
-
- return 0;
-}
-
-
-/*!
- * \brief pixScanForEdge()
- *
- * \param[in] pixs 1 bpp
- * \param[in] box [optional] within which the search is conducted
- * \param[in] lowthresh threshold to choose clipping location
- * \param[in] highthresh threshold required to find an edge
- * \param[in] maxwidth max allowed width between low and high thresh locs
- * \param[in] factor sampling factor along pixel counting direction
- * \param[in] scanflag direction of scan; e.g., L_FROM_LEFT
- * \param[out] ploc location in scan direction of first black pixel
- * \return 0 if OK; 1 on error or if the edge is not found
- *
- *
- * Notes:
- * (1) If there are no fg pixels, the position is set to 0.
- * Caller must check the return value!
- * (2) Use %box == NULL to scan from edge of pixs
- * (3) As the scan progresses, the location where the sum of
- * pixels equals or excees %lowthresh is noted (loc). The
- * scan is stopped when the sum of pixels equals or exceeds
- * %highthresh. If the scan distance between loc and that
- * point does not exceed %maxwidth, an edge is found and
- * its position is taken to be loc. %maxwidth implicitly
- * sets a minimum on the required gradient of the edge.
- * (4) The thresholds must be at least 1, and the low threshold
- * cannot be larger than the high threshold.
- *
- */
-l_ok
-pixScanForEdge(PIX *pixs,
- BOX *box,
- l_int32 lowthresh,
- l_int32 highthresh,
- l_int32 maxwidth,
- l_int32 factor,
- l_int32 scanflag,
- l_int32 *ploc)
-{
-l_int32 bx, by, bw, bh, foundmin, loc, sum, wpl;
-l_int32 x, xstart, xend, y, ystart, yend;
-l_uint32 *data, *line;
-BOX *boxt;
-
- PROCNAME("pixScanForEdge");
-
- if (!ploc)
- return ERROR_INT("&ploc not defined", procName, 1);
- *ploc = 0;
- if (!pixs || (pixGetDepth(pixs) != 1))
- return ERROR_INT("pixs not defined or not 1 bpp", procName, 1);
- if (lowthresh < 1 || highthresh < 1 ||
- lowthresh > highthresh || maxwidth < 1)
- return ERROR_INT("invalid thresholds", procName, 1);
- factor = L_MIN(1, factor);
-
- /* Clip box to pixs if it exists */
- pixGetDimensions(pixs, &bw, &bh, NULL);
- if (box) {
- if ((boxt = boxClipToRectangle(box, bw, bh)) == NULL)
- return ERROR_INT("invalid box", procName, 1);
- boxGetGeometry(boxt, &bx, &by, &bw, &bh);
- boxDestroy(&boxt);
- } else {
- bx = by = 0;
- }
- xstart = bx;
- ystart = by;
- xend = bx + bw - 1;
- yend = by + bh - 1;
-
- data = pixGetData(pixs);
- wpl = pixGetWpl(pixs);
- foundmin = 0;
- if (scanflag == L_FROM_LEFT) {
- for (x = xstart; x <= xend; x++) {
- sum = 0;
- for (y = ystart; y <= yend; y += factor) {
- line = data + y * wpl;
- if (GET_DATA_BIT(line, x))
- sum++;
- }
- if (!foundmin && sum < lowthresh)
- continue;
- if (!foundmin) { /* save the loc of the beginning of the edge */
- foundmin = 1;
- loc = x;
- }
- if (sum >= highthresh) {
-#if DEBUG_EDGES
- lept_stderr("Left: x = %d, loc = %d\n", x, loc);
-#endif /* DEBUG_EDGES */
- if (x - loc < maxwidth) {
- *ploc = loc;
- return 0;
- } else {
- return 1;
- }
- }
- }
- } else if (scanflag == L_FROM_RIGHT) {
- for (x = xend; x >= xstart; x--) {
- sum = 0;
- for (y = ystart; y <= yend; y += factor) {
- line = data + y * wpl;
- if (GET_DATA_BIT(line, x))
- sum++;
- }
- if (!foundmin && sum < lowthresh)
- continue;
- if (!foundmin) {
- foundmin = 1;
- loc = x;
- }
- if (sum >= highthresh) {
-#if DEBUG_EDGES
- lept_stderr("Right: x = %d, loc = %d\n", x, loc);
-#endif /* DEBUG_EDGES */
- if (loc - x < maxwidth) {
- *ploc = loc;
- return 0;
- } else {
- return 1;
- }
- }
- }
- } else if (scanflag == L_FROM_TOP) {
- for (y = ystart; y <= yend; y++) {
- sum = 0;
- line = data + y * wpl;
- for (x = xstart; x <= xend; x += factor) {
- if (GET_DATA_BIT(line, x))
- sum++;
- }
- if (!foundmin && sum < lowthresh)
- continue;
- if (!foundmin) {
- foundmin = 1;
- loc = y;
- }
- if (sum >= highthresh) {
-#if DEBUG_EDGES
- lept_stderr("Top: y = %d, loc = %d\n", y, loc);
-#endif /* DEBUG_EDGES */
- if (y - loc < maxwidth) {
- *ploc = loc;
- return 0;
- } else {
- return 1;
- }
- }
- }
- } else if (scanflag == L_FROM_BOT) {
- for (y = yend; y >= ystart; y--) {
- sum = 0;
- line = data + y * wpl;
- for (x = xstart; x <= xend; x += factor) {
- if (GET_DATA_BIT(line, x))
- sum++;
- }
- if (!foundmin && sum < lowthresh)
- continue;
- if (!foundmin) {
- foundmin = 1;
- loc = y;
- }
- if (sum >= highthresh) {
-#if DEBUG_EDGES
- lept_stderr("Bottom: y = %d, loc = %d\n", y, loc);
-#endif /* DEBUG_EDGES */
- if (loc - y < maxwidth) {
- *ploc = loc;
- return 0;
- } else {
- return 1;
- }
- }
- }
- } else {
- return ERROR_INT("invalid scanflag", procName, 1);
- }
-
- return 1; /* edge not found */
-}
-
-
-/*---------------------------------------------------------------------*
- * Extract pixel averages and reversals along lines *
- *---------------------------------------------------------------------*/
-/*!
- * \brief pixExtractOnLine()
- *
- * \param[in] pixs 1 bpp or 8 bpp; no colormap
- * \param[in] x1, y1 one end point for line
- * \param[in] x2, y2 another end pt for line
- * \param[in] factor sampling; >= 1
- * \return na of pixel values along line, or NULL on error.
- *
- *
- * Notes:
- * (1) Input end points are clipped to the pix.
- * (2) If the line is either horizontal, or closer to horizontal
- * than to vertical, the points will be extracted from left
- * to right in the pix. Likewise, if the line is vertical,
- * or closer to vertical than to horizontal, the points will
- * be extracted from top to bottom.
- * (3) Can be used with numaCountReverals(), for example, to
- * characterize the intensity smoothness along a line.
- *
- */
-NUMA *
-pixExtractOnLine(PIX *pixs,
- l_int32 x1,
- l_int32 y1,
- l_int32 x2,
- l_int32 y2,
- l_int32 factor)
-{
-l_int32 i, w, h, d, xmin, ymin, xmax, ymax, npts, direction;
-l_uint32 val;
-l_float32 x, y;
-l_float64 slope;
-NUMA *na;
-PTA *pta;
-
- PROCNAME("pixExtractOnLine");
-
- if (!pixs)
- return (NUMA *)ERROR_PTR("pixs not defined", procName, NULL);
- pixGetDimensions(pixs, &w, &h, &d);
- if (d != 1 && d != 8)
- return (NUMA *)ERROR_PTR("d not 1 or 8 bpp", procName, NULL);
- if (pixGetColormap(pixs))
- return (NUMA *)ERROR_PTR("pixs has a colormap", procName, NULL);
- if (factor < 1) {
- L_WARNING("factor must be >= 1; setting to 1\n", procName);
- factor = 1;
- }
-
- /* Clip line to the image */
- x1 = L_MAX(0, L_MIN(x1, w - 1));
- x2 = L_MAX(0, L_MIN(x2, w - 1));
- y1 = L_MAX(0, L_MIN(y1, h - 1));
- y2 = L_MAX(0, L_MIN(y2, h - 1));
-
- if (x1 == x2 && y1 == y2) {
- pixGetPixel(pixs, x1, y1, &val);
- na = numaCreate(1);
- numaAddNumber(na, val);
- return na;
- }
-
- if (y1 == y2)
- direction = L_HORIZONTAL_LINE;
- else if (x1 == x2)
- direction = L_VERTICAL_LINE;
- else
- direction = L_OBLIQUE_LINE;
-
- na = numaCreate(0);
- if (direction == L_HORIZONTAL_LINE) { /* plot against x */
- xmin = L_MIN(x1, x2);
- xmax = L_MAX(x1, x2);
- numaSetParameters(na, xmin, factor);
- for (i = xmin; i <= xmax; i += factor) {
- pixGetPixel(pixs, i, y1, &val);
- numaAddNumber(na, val);
- }
- } else if (direction == L_VERTICAL_LINE) { /* plot against y */
- ymin = L_MIN(y1, y2);
- ymax = L_MAX(y1, y2);
- numaSetParameters(na, ymin, factor);
- for (i = ymin; i <= ymax; i += factor) {
- pixGetPixel(pixs, x1, i, &val);
- numaAddNumber(na, val);
- }
- } else { /* direction == L_OBLIQUE_LINE */
- slope = (l_float64)((y2 - y1) / (x2 - x1));
- if (L_ABS(slope) < 1.0) { /* quasi-horizontal */
- xmin = L_MIN(x1, x2);
- xmax = L_MAX(x1, x2);
- ymin = (xmin == x1) ? y1 : y2; /* pt that goes with xmin */
- ymax = (ymin == y1) ? y2 : y1; /* pt that goes with xmax */
- pta = generatePtaLine(xmin, ymin, xmax, ymax);
- numaSetParameters(na, xmin, (l_float32)factor);
- } else { /* quasi-vertical */
- ymin = L_MIN(y1, y2);
- ymax = L_MAX(y1, y2);
- xmin = (ymin == y1) ? x1 : x2; /* pt that goes with ymin */
- xmax = (xmin == x1) ? x2 : x1; /* pt that goes with ymax */
- pta = generatePtaLine(xmin, ymin, xmax, ymax);
- numaSetParameters(na, ymin, (l_float32)factor);
- }
- npts = ptaGetCount(pta);
- for (i = 0; i < npts; i += factor) {
- ptaGetPt(pta, i, &x, &y);
- pixGetPixel(pixs, (l_int32)x, (l_int32)y, &val);
- numaAddNumber(na, val);
- }
-
-#if 0 /* debugging */
- pixPlotAlongPta(pixs, pta, GPLOT_PNG, NULL);
-#endif
-
- ptaDestroy(&pta);
- }
-
- return na;
-}
-
-
-/*!
- * \brief pixAverageOnLine()
- *
- * \param[in] pixs 1 bpp or 8 bpp; no colormap
- * \param[in] x1, y1 starting pt for line
- * \param[in] x2, y2 end pt for line
- * \param[in] factor sampling; >= 1
- * \return average of pixel values along line, or NULL on error.
- *
- *
- * Notes:
- * (1) The line must be either horizontal or vertical, so either
- * y1 == y2 (horizontal) or x1 == x2 (vertical).
- * (2) If horizontal, x1 must be <= x2.
- * If vertical, y1 must be <= y2.
- * characterize the intensity smoothness along a line.
- * (3) Input end points are clipped to the pix.
- *
- */
-l_float32
-pixAverageOnLine(PIX *pixs,
- l_int32 x1,
- l_int32 y1,
- l_int32 x2,
- l_int32 y2,
- l_int32 factor)
-{
-l_int32 i, j, w, h, d, direction, count, wpl;
-l_uint32 *data, *line;
-l_float32 sum;
-
- PROCNAME("pixAverageOnLine");
-
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
- pixGetDimensions(pixs, &w, &h, &d);
- if (d != 1 && d != 8)
- return ERROR_INT("d not 1 or 8 bpp", procName, 1);
- if (pixGetColormap(pixs))
- return ERROR_INT("pixs has a colormap", procName, 1);
- if (x1 > x2 || y1 > y2)
- return ERROR_INT("x1 > x2 or y1 > y2", procName, 1);
-
- if (y1 == y2) {
- x1 = L_MAX(0, x1);
- x2 = L_MIN(w - 1, x2);
- y1 = L_MAX(0, L_MIN(y1, h - 1));
- direction = L_HORIZONTAL_LINE;
- } else if (x1 == x2) {
- y1 = L_MAX(0, y1);
- y2 = L_MIN(h - 1, y2);
- x1 = L_MAX(0, L_MIN(x1, w - 1));
- direction = L_VERTICAL_LINE;
- } else {
- return ERROR_INT("line neither horiz nor vert", procName, 1);
- }
-
- if (factor < 1) {
- L_WARNING("factor must be >= 1; setting to 1\n", procName);
- factor = 1;
- }
-
- data = pixGetData(pixs);
- wpl = pixGetWpl(pixs);
- sum = 0;
- count = 0;
- if (direction == L_HORIZONTAL_LINE) {
- line = data + y1 * wpl;
- for (j = x1, count = 0; j <= x2; count++, j += factor) {
- if (d == 1)
- sum += GET_DATA_BIT(line, j);
- else /* d == 8 */
- sum += GET_DATA_BYTE(line, j);
- }
- } else if (direction == L_VERTICAL_LINE) {
- for (i = y1, count = 0; i <= y2; count++, i += factor) {
- line = data + i * wpl;
- if (d == 1)
- sum += GET_DATA_BIT(line, x1);
- else /* d == 8 */
- sum += GET_DATA_BYTE(line, x1);
- }
- }
-
- return sum / (l_float32)count;
-}
-
-
-/*!
- * \brief pixAverageIntensityProfile()
- *
- * \param[in] pixs any depth; colormap OK
- * \param[in] fract fraction of image width or height to be used
- * \param[in] dir averaging direction: L_HORIZONTAL_LINE or
- * L_VERTICAL_LINE
- * \param[in] first, last span of rows or columns to measure
- * \param[in] factor1 sampling along fast scan direction; >= 1
- * \param[in] factor2 sampling along slow scan direction; >= 1
- * \return na of reversal profile, or NULL on error.
- *
- *
- * Notes:
- * (1) If d != 1 bpp, colormaps are removed and the result
- * is converted to 8 bpp.
- * (2) If %dir == L_HORIZONTAL_LINE, the intensity is averaged
- * along each horizontal raster line (sampled by %factor1),
- * and the profile is the array of these averages in the
- * vertical direction between %first and %last raster lines,
- * and sampled by %factor2.
- * (3) If %dir == L_VERTICAL_LINE, the intensity is averaged
- * along each vertical line (sampled by %factor1),
- * and the profile is the array of these averages in the
- * horizontal direction between %first and %last columns,
- * and sampled by %factor2.
- * (4) The averages are measured over the central %fract of the image.
- * Use %fract == 1.0 to average across the entire width or height.
- *
- */
-NUMA *
-pixAverageIntensityProfile(PIX *pixs,
- l_float32 fract,
- l_int32 dir,
- l_int32 first,
- l_int32 last,
- l_int32 factor1,
- l_int32 factor2)
-{
-l_int32 i, j, w, h, d, start, end;
-l_float32 ave;
-NUMA *nad;
-PIX *pixr, *pixg;
-
- PROCNAME("pixAverageIntensityProfile");
-
- if (!pixs)
- return (NUMA *)ERROR_PTR("pixs not defined", procName, NULL);
- if (fract < 0.0 || fract > 1.0)
- return (NUMA *)ERROR_PTR("fract < 0.0 or > 1.0", procName, NULL);
- if (dir != L_HORIZONTAL_LINE && dir != L_VERTICAL_LINE)
- return (NUMA *)ERROR_PTR("invalid direction", procName, NULL);
- if (first < 0) first = 0;
- if (last < first)
- return (NUMA *)ERROR_PTR("last must be >= first", procName, NULL);
- if (factor1 < 1) {
- L_WARNING("factor1 must be >= 1; setting to 1\n", procName);
- factor1 = 1;
- }
- if (factor2 < 1) {
- L_WARNING("factor2 must be >= 1; setting to 1\n", procName);
- factor2 = 1;
- }
-
- /* Use 1 or 8 bpp, without colormap */
- if (pixGetColormap(pixs))
- pixr = pixRemoveColormap(pixs, REMOVE_CMAP_TO_GRAYSCALE);
- else
- pixr = pixClone(pixs);
- pixGetDimensions(pixr, &w, &h, &d);
- if (d == 1)
- pixg = pixClone(pixr);
- else
- pixg = pixConvertTo8(pixr, 0);
-
- nad = numaCreate(0); /* output: samples in slow scan direction */
- numaSetParameters(nad, 0, factor2);
- if (dir == L_HORIZONTAL_LINE) {
- start = (l_int32)(0.5 * (1.0 - fract) * (l_float32)w);
- end = w - start;
- if (last > h - 1) {
- L_WARNING("last > h - 1; clipping\n", procName);
- last = h - 1;
- }
- for (i = first; i <= last; i += factor2) {
- ave = pixAverageOnLine(pixg, start, i, end, i, factor1);
- numaAddNumber(nad, ave);
- }
- } else if (dir == L_VERTICAL_LINE) {
- start = (l_int32)(0.5 * (1.0 - fract) * (l_float32)h);
- end = h - start;
- if (last > w - 1) {
- L_WARNING("last > w - 1; clipping\n", procName);
- last = w - 1;
- }
- for (j = first; j <= last; j += factor2) {
- ave = pixAverageOnLine(pixg, j, start, j, end, factor1);
- numaAddNumber(nad, ave);
- }
- }
-
- pixDestroy(&pixr);
- pixDestroy(&pixg);
- return nad;
-}
-
-
-/*!
- * \brief pixReversalProfile()
- *
- * \param[in] pixs any depth; colormap OK
- * \param[in] fract fraction of image width or height to be used
- * \param[in] dir profile direction: L_HORIZONTAL_LINE or
- * L_VERTICAL_LINE
- * \param[in] first, last span of rows or columns to measure
- * \param[in] minreversal minimum change in intensity to trigger a reversal
- * \param[in] factor1 sampling along raster line (fast scan); >= 1
- * \param[in] factor2 sampling of raster lines (slow scan); >= 1
- * \return na of reversal profile, or NULL on error.
- *
- *
- * Notes:
- * (1) If d != 1 bpp, colormaps are removed and the result
- * is converted to 8 bpp.
- * (2) If %dir == L_HORIZONTAL_LINE, the the reversals are counted
- * along each horizontal raster line (sampled by %factor1),
- * and the profile is the array of these sums in the
- * vertical direction between %first and %last raster lines,
- * and sampled by %factor2.
- * (3) If %dir == L_VERTICAL_LINE, the the reversals are counted
- * along each vertical column (sampled by %factor1),
- * and the profile is the array of these sums in the
- * horizontal direction between %first and %last columns,
- * and sampled by %factor2.
- * (4) For each row or column, the reversals are summed over the
- * central %fract of the image. Use %fract == 1.0 to sum
- * across the entire width (of row) or height (of column).
- * (5) %minreversal is the relative change in intensity that is
- * required to resolve peaks and valleys. A typical number for
- * locating text in 8 bpp might be 50. For 1 bpp, minreversal
- * must be 1.
- * (6) The reversal profile is simply the number of reversals
- * in a row or column, vs the row or column index.
- *
- */
-NUMA *
-pixReversalProfile(PIX *pixs,
- l_float32 fract,
- l_int32 dir,
- l_int32 first,
- l_int32 last,
- l_int32 minreversal,
- l_int32 factor1,
- l_int32 factor2)
-{
-l_int32 i, j, w, h, d, start, end, nr;
-NUMA *naline, *nad;
-PIX *pixr, *pixg;
-
- PROCNAME("pixReversalProfile");
-
- if (!pixs)
- return (NUMA *)ERROR_PTR("pixs not defined", procName, NULL);
- if (fract < 0.0 || fract > 1.0)
- return (NUMA *)ERROR_PTR("fract < 0.0 or > 1.0", procName, NULL);
- if (dir != L_HORIZONTAL_LINE && dir != L_VERTICAL_LINE)
- return (NUMA *)ERROR_PTR("invalid direction", procName, NULL);
- if (first < 0) first = 0;
- if (last < first)
- return (NUMA *)ERROR_PTR("last must be >= first", procName, NULL);
- if (factor1 < 1) {
- L_WARNING("factor1 must be >= 1; setting to 1\n", procName);
- factor1 = 1;
- }
- if (factor2 < 1) {
- L_WARNING("factor2 must be >= 1; setting to 1\n", procName);
- factor2 = 1;
- }
-
- /* Use 1 or 8 bpp, without colormap */
- if (pixGetColormap(pixs))
- pixr = pixRemoveColormap(pixs, REMOVE_CMAP_TO_GRAYSCALE);
- else
- pixr = pixClone(pixs);
- pixGetDimensions(pixr, &w, &h, &d);
- if (d == 1) {
- pixg = pixClone(pixr);
- minreversal = 1; /* enforce this */
- } else {
- pixg = pixConvertTo8(pixr, 0);
- }
-
- nad = numaCreate(0); /* output: samples in slow scan direction */
- numaSetParameters(nad, 0, factor2);
- if (dir == L_HORIZONTAL_LINE) {
- start = (l_int32)(0.5 * (1.0 - fract) * (l_float32)w);
- end = w - start;
- if (last > h - 1) {
- L_WARNING("last > h - 1; clipping\n", procName);
- last = h - 1;
- }
- for (i = first; i <= last; i += factor2) {
- naline = pixExtractOnLine(pixg, start, i, end, i, factor1);
- numaCountReversals(naline, minreversal, &nr, NULL);
- numaAddNumber(nad, nr);
- numaDestroy(&naline);
- }
- } else if (dir == L_VERTICAL_LINE) {
- start = (l_int32)(0.5 * (1.0 - fract) * (l_float32)h);
- end = h - start;
- if (last > w - 1) {
- L_WARNING("last > w - 1; clipping\n", procName);
- last = w - 1;
- }
- for (j = first; j <= last; j += factor2) {
- naline = pixExtractOnLine(pixg, j, start, j, end, factor1);
- numaCountReversals(naline, minreversal, &nr, NULL);
- numaAddNumber(nad, nr);
- numaDestroy(&naline);
- }
- }
-
- pixDestroy(&pixr);
- pixDestroy(&pixg);
- return nad;
-}
-
-
-/*---------------------------------------------------------------------*
- * Extract windowed variance along a line *
- *---------------------------------------------------------------------*/
-/*!
- * \brief pixWindowedVarianceOnLine()
- *
- * \param[in] pixs 8 bpp; no colormap
- * \param[in] dir L_HORIZONTAL_LINE or L_VERTICAL_LINE
- * \param[in] loc location of the constant coordinate for the line
- * \param[in] c1, c2 end point coordinates for the line
- * \param[in] size window size; must be > 1
- * \param[out] pnad windowed square root of variance
- * \return 0 if OK; 1 on error
- *
- *
- * Notes:
- * (1) The returned variance array traverses the line starting
- * from the smallest coordinate, min(c1,c2).
- * (2) Line end points are clipped to pixs.
- * (3) The reference point for the variance calculation is the center of
- * the window. Therefore, the numa start parameter from
- * pixExtractOnLine() is incremented by %size/2,
- * to align the variance values with the pixel coordinate.
- * (4) The square root of the variance is the RMS deviation from the mean.
- *
- */
-l_ok
-pixWindowedVarianceOnLine(PIX *pixs,
- l_int32 dir,
- l_int32 loc,
- l_int32 c1,
- l_int32 c2,
- l_int32 size,
- NUMA **pnad)
-{
-l_int32 i, j, w, h, cmin, cmax, maxloc, n, x, y;
-l_uint32 val;
-l_float32 norm, rootvar;
-l_float32 *array;
-l_float64 sum1, sum2, ave, var;
-NUMA *na1, *nad;
-PTA *pta;
-
- PROCNAME("pixWindowedVarianceOnLine");
-
- if (!pnad)
- return ERROR_INT("&nad not defined", procName, 1);
- *pnad = NULL;
- if (!pixs || pixGetDepth(pixs) != 8)
- return ERROR_INT("pixs not defined or not 8bpp", procName, 1);
- if (size < 2)
- return ERROR_INT("window size must be > 1", procName, 1);
- if (dir != L_HORIZONTAL_LINE && dir != L_VERTICAL_LINE)
- return ERROR_INT("invalid direction", procName, 1);
- pixGetDimensions(pixs, &w, &h, NULL);
- maxloc = (dir == L_HORIZONTAL_LINE) ? h - 1 : w - 1;
- if (loc < 0 || loc > maxloc)
- return ERROR_INT("invalid line position", procName, 1);
-
- /* Clip line to the image */
- cmin = L_MIN(c1, c2);
- cmax = L_MAX(c1, c2);
- maxloc = (dir == L_HORIZONTAL_LINE) ? w - 1 : h - 1;
- cmin = L_MAX(0, L_MIN(cmin, maxloc));
- cmax = L_MAX(0, L_MIN(cmax, maxloc));
- n = cmax - cmin + 1;
-
- /* Generate pta along the line */
- pta = ptaCreate(n);
- if (dir == L_HORIZONTAL_LINE) {
- for (i = cmin; i <= cmax; i++)
- ptaAddPt(pta, i, loc);
- } else { /* vertical line */
- for (i = cmin; i <= cmax; i++)
- ptaAddPt(pta, loc, i);
- }
-
- /* Get numa of pixel values on the line */
- na1 = numaCreate(n);
- numaSetParameters(na1, cmin, 1);
- for (i = 0; i < n; i++) {
- ptaGetIPt(pta, i, &x, &y);
- pixGetPixel(pixs, x, y, &val);
- numaAddNumber(na1, val);
- }
- array = numaGetFArray(na1, L_NOCOPY);
- ptaDestroy(&pta);
-
- /* Compute root variance on overlapping windows */
- nad = numaCreate(n);
- *pnad = nad;
- numaSetParameters(nad, cmin + size / 2, 1);
- norm = 1.0 / (l_float32)size;
- for (i = 0; i < n - size; i++) { /* along the line */
- sum1 = sum2 = 0;
- for (j = 0; j < size; j++) { /* over the window */
- val = array[i + j];
- sum1 += val;
- sum2 += (l_float64)(val) * val;
- }
- ave = norm * sum1;
- var = norm * sum2 - ave * ave;
- rootvar = (l_float32)sqrt(var);
- numaAddNumber(nad, rootvar);
- }
-
- numaDestroy(&na1);
- return 0;
-}
-
-
-/*---------------------------------------------------------------------*
- * Extract min/max of pixel values near lines *
- *---------------------------------------------------------------------*/
-/*!
- * \brief pixMinMaxNearLine()
- *
- * \param[in] pixs 8 bpp; no colormap
- * \param[in] x1, y1 starting pt for line
- * \param[in] x2, y2 end pt for line
- * \param[in] dist distance to search from line in each direction
- * \param[in] direction L_SCAN_NEGATIVE, L_SCAN_POSITIVE, L_SCAN_BOTH
- * \param[out] pnamin [optional] minimum values
- * \param[out] pnamax [optional] maximum values
- * \param[out] pminave [optional] average of minimum values
- * \param[out] pmaxave [optional] average of maximum values
- * \return 0 if OK; 1 on error or if there are no sampled points
- * within the image.
- *
- *
- * Notes:
- * (1) If the line is more horizontal than vertical, the values
- * are computed for [x1, x2], and the pixels are taken
- * below and/or above the local y-value. Otherwise, the
- * values are computed for [y1, y2] and the pixels are taken
- * to the left and/or right of the local x value.
- * (2) %direction specifies which side (or both sides) of the
- * line are scanned for min and max values.
- * (3) There are two ways to tell if the returned values of min
- * and max averages are valid: the returned values cannot be
- * negative and the function must return 0.
- * (4) All accessed pixels are clipped to the pix.
- *
- */
-l_ok
-pixMinMaxNearLine(PIX *pixs,
- l_int32 x1,
- l_int32 y1,
- l_int32 x2,
- l_int32 y2,
- l_int32 dist,
- l_int32 direction,
- NUMA **pnamin,
- NUMA **pnamax,
- l_float32 *pminave,
- l_float32 *pmaxave)
-{
-l_int32 i, j, w, h, d, x, y, n, dir, found, minval, maxval, negloc, posloc;
-l_uint32 val;
-l_float32 sum;
-NUMA *namin, *namax;
-PTA *pta;
-
- PROCNAME("pixMinMaxNearLine");
-
- if (pnamin) *pnamin = NULL;
- if (pnamax) *pnamax = NULL;
- if (pminave) *pminave = UNDEF;
- if (pmaxave) *pmaxave = UNDEF;
- if (!pnamin && !pnamax && !pminave && !pmaxave)
- return ERROR_INT("no output requested", procName, 1);
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
- pixGetDimensions(pixs, &w, &h, &d);
- if (d != 8 || pixGetColormap(pixs))
- return ERROR_INT("pixs not 8 bpp or has colormap", procName, 1);
- dist = L_ABS(dist);
- if (direction != L_SCAN_NEGATIVE && direction != L_SCAN_POSITIVE &&
- direction != L_SCAN_BOTH)
- return ERROR_INT("invalid direction", procName, 1);
-
- pta = generatePtaLine(x1, y1, x2, y2);
- n = ptaGetCount(pta);
- dir = (L_ABS(x1 - x2) == n - 1) ? L_HORIZ : L_VERT;
- namin = numaCreate(n);
- namax = numaCreate(n);
- negloc = -dist;
- posloc = dist;
- if (direction == L_SCAN_NEGATIVE)
- posloc = 0;
- else if (direction == L_SCAN_POSITIVE)
- negloc = 0;
- for (i = 0; i < n; i++) {
- ptaGetIPt(pta, i, &x, &y);
- minval = 255;
- maxval = 0;
- found = FALSE;
- if (dir == L_HORIZ) {
- if (x < 0 || x >= w) continue;
- for (j = negloc; j <= posloc; j++) {
- if (y + j < 0 || y + j >= h) continue;
- pixGetPixel(pixs, x, y + j, &val);
- found = TRUE;
- if (val < minval) minval = val;
- if (val > maxval) maxval = val;
- }
- } else { /* dir == L_VERT */
- if (y < 0 || y >= h) continue;
- for (j = negloc; j <= posloc; j++) {
- if (x + j < 0 || x + j >= w) continue;
- pixGetPixel(pixs, x + j, y, &val);
- found = TRUE;
- if (val < minval) minval = val;
- if (val > maxval) maxval = val;
- }
- }
- if (found) {
- numaAddNumber(namin, minval);
- numaAddNumber(namax, maxval);
- }
- }
-
- n = numaGetCount(namin);
- if (n == 0) {
- numaDestroy(&namin);
- numaDestroy(&namax);
- ptaDestroy(&pta);
- return ERROR_INT("no output from this line", procName, 1);
- }
-
- if (pminave) {
- numaGetSum(namin, &sum);
- *pminave = sum / n;
- }
- if (pmaxave) {
- numaGetSum(namax, &sum);
- *pmaxave = sum / n;
- }
- if (pnamin)
- *pnamin = namin;
- else
- numaDestroy(&namin);
- if (pnamax)
- *pnamax = namax;
- else
- numaDestroy(&namax);
- ptaDestroy(&pta);
- return 0;
-}
-
-
-/*---------------------------------------------------------------------*
- * Rank row and column transforms *
- *---------------------------------------------------------------------*/
-/*!
- * \brief pixRankRowTransform()
- *
- * \param[in] pixs 8 bpp; no colormap
- * \return pixd with pixels sorted in each row, from
- * min to max value
- *
- *
- * Notes:
- * (1) The time is O(n) in the number of pixels and runs about
- * 100 Mpixels/sec on a 3 GHz machine.
- *
- */
-PIX *
-pixRankRowTransform(PIX *pixs)
-{
-l_int32 i, j, k, m, w, h, wpl, val;
-l_int32 histo[256];
-l_uint32 *datas, *datad, *lines, *lined;
-PIX *pixd;
-
- PROCNAME("pixRankRowTransform");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- if (pixGetDepth(pixs) != 8)
- return (PIX *)ERROR_PTR("pixs not 8 bpp", procName, NULL);
- if (pixGetColormap(pixs))
- return (PIX *)ERROR_PTR("pixs has a colormap", procName, NULL);
-
- pixGetDimensions(pixs, &w, &h, NULL);
- pixd = pixCreateTemplate(pixs);
- datas = pixGetData(pixs);
- datad = pixGetData(pixd);
- wpl = pixGetWpl(pixs);
- for (i = 0; i < h; i++) {
- memset(histo, 0, 1024);
- lines = datas + i * wpl;
- lined = datad + i * wpl;
- for (j = 0; j < w; j++) {
- val = GET_DATA_BYTE(lines, j);
- histo[val]++;
- }
- for (m = 0, j = 0; m < 256; m++) {
- for (k = 0; k < histo[m]; k++, j++)
- SET_DATA_BYTE(lined, j, m);
- }
- }
-
- return pixd;
-}
-
-
-/*!
- * \brief pixRankColumnTransform()
- *
- * \param[in] pixs 8 bpp; no colormap
- * \return pixd with pixels sorted in each column, from
- * min to max value
- *
- *
- * Notes:
- * (1) The time is O(n) in the number of pixels and runs about
- * 50 Mpixels/sec on a 3 GHz machine.
- *
- */
-PIX *
-pixRankColumnTransform(PIX *pixs)
-{
-l_int32 i, j, k, m, w, h, val;
-l_int32 histo[256];
-void **lines8, **lined8;
-PIX *pixd;
-
- PROCNAME("pixRankColumnTransform");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- if (pixGetDepth(pixs) != 8)
- return (PIX *)ERROR_PTR("pixs not 8 bpp", procName, NULL);
- if (pixGetColormap(pixs))
- return (PIX *)ERROR_PTR("pixs has a colormap", procName, NULL);
-
- pixGetDimensions(pixs, &w, &h, NULL);
- pixd = pixCreateTemplate(pixs);
- lines8 = pixGetLinePtrs(pixs, NULL);
- lined8 = pixGetLinePtrs(pixd, NULL);
- for (j = 0; j < w; j++) {
- memset(histo, 0, 1024);
- for (i = 0; i < h; i++) {
- val = GET_DATA_BYTE(lines8[i], j);
- histo[val]++;
- }
- for (m = 0, i = 0; m < 256; m++) {
- for (k = 0; k < histo[m]; k++, i++)
- SET_DATA_BYTE(lined8[i], j, m);
- }
- }
-
- LEPT_FREE(lines8);
- LEPT_FREE(lined8);
- return pixd;
-}
diff --git a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pixabasic.c b/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pixabasic.c
deleted file mode 100644
index 68123337..00000000
--- a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pixabasic.c
+++ /dev/null
@@ -1,3233 +0,0 @@
-/*====================================================================*
- - Copyright (C) 2001 Leptonica. All rights reserved.
- -
- - Redistribution and use in source and binary forms, with or without
- - modification, are permitted provided that the following conditions
- - are met:
- - 1. Redistributions of source code must retain the above copyright
- - notice, this list of conditions and the following disclaimer.
- - 2. Redistributions in binary form must reproduce the above
- - copyright notice, this list of conditions and the following
- - disclaimer in the documentation and/or other materials
- - provided with the distribution.
- -
- - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- - ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- - LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- - A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL ANY
- - CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
- - EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
- - PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
- - PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
- - OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
- - NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- *====================================================================*/
-
-/*!
- * \file pixabasic.c
- *
- *
- * Pixa creation, destruction, copying
- * PIXA *pixaCreate()
- * PIXA *pixaCreateFromPix()
- * PIXA *pixaCreateFromBoxa()
- * PIXA *pixaSplitPix()
- * void pixaDestroy()
- * PIXA *pixaCopy()
- *
- * Pixa addition
- * l_int32 pixaAddPix()
- * l_int32 pixaAddBox()
- * static l_int32 pixaExtendArray()
- * l_int32 pixaExtendArrayToSize()
- *
- * Pixa accessors
- * l_int32 pixaGetCount()
- * l_int32 pixaChangeRefcount()
- * PIX *pixaGetPix()
- * l_int32 pixaGetPixDimensions()
- * BOXA *pixaGetBoxa()
- * l_int32 pixaGetBoxaCount()
- * BOX *pixaGetBox()
- * l_int32 pixaGetBoxGeometry()
- * l_int32 pixaSetBoxa()
- * PIX **pixaGetPixArray()
- * l_int32 pixaVerifyDepth()
- * l_int32 pixaVerifyDimensions()
- * l_int32 pixaIsFull()
- * l_int32 pixaCountText()
- * l_int32 pixaSetText()
- * void ***pixaGetLinePtrs()
- *
- * Pixa output info
- * l_int32 pixaWriteStreamInfo()
- *
- * Pixa array modifiers
- * l_int32 pixaReplacePix()
- * l_int32 pixaInsertPix()
- * l_int32 pixaRemovePix()
- * l_int32 pixaRemovePixAndSave()
- * l_int32 pixaRemoveSelected()
- * l_int32 pixaInitFull()
- * l_int32 pixaClear()
- *
- * Pixa and Pixaa combination
- * l_int32 pixaJoin()
- * PIXA *pixaInterleave()
- * l_int32 pixaaJoin()
- *
- * Pixaa creation, destruction
- * PIXAA *pixaaCreate()
- * PIXAA *pixaaCreateFromPixa()
- * void pixaaDestroy()
- *
- * Pixaa addition
- * l_int32 pixaaAddPixa()
- * l_int32 pixaaExtendArray()
- * l_int32 pixaaAddPix()
- * l_int32 pixaaAddBox()
- *
- * Pixaa accessors
- * l_int32 pixaaGetCount()
- * PIXA *pixaaGetPixa()
- * BOXA *pixaaGetBoxa()
- * PIX *pixaaGetPix()
- * l_int32 pixaaVerifyDepth()
- * l_int32 pixaaVerifyDimensions()
- * l_int32 pixaaIsFull()
- *
- * Pixaa array modifiers
- * l_int32 pixaaInitFull()
- * l_int32 pixaaReplacePixa()
- * l_int32 pixaaClear()
- * l_int32 pixaaTruncate()
- *
- * Pixa serialized I/O (requires png support)
- * PIXA *pixaRead()
- * PIXA *pixaReadStream()
- * PIXA *pixaReadMem()
- * l_int32 pixaWriteDebug()
- * l_int32 pixaWrite()
- * l_int32 pixaWriteStream()
- * l_int32 pixaWriteMem()
- * PIXA *pixaReadBoth()
- *
- * Pixaa serialized I/O (requires png support)
- * PIXAA *pixaaReadFromFiles()
- * PIXAA *pixaaRead()
- * PIXAA *pixaaReadStream()
- * PIXAA *pixaaReadMem()
- * l_int32 pixaaWrite()
- * l_int32 pixaaWriteStream()
- * l_int32 pixaaWriteMem()
- *
- *
- * Important note on reference counting:
- * Reference counting for the Pixa is analogous to that for the Boxa.
- * See pix.h for details. pixaCopy() provides three possible modes
- * of copy. The basic rule is that however a Pixa is obtained
- * (e.g., from pixaCreate*(), pixaCopy(), or a Pixaa accessor),
- * it is necessary to call pixaDestroy() on it.
- *
- */
-
-#ifdef HAVE_CONFIG_H
-#include
-#endif /* HAVE_CONFIG_H */
-
-#include
-#include "allheaders.h"
-
- /* Bounds on initial array size */
-static const l_uint32 MaxPtrArraySize = 100000;
-static const l_int32 InitialPtrArraySize = 20; /*!< n'importe quoi */
-
- /* Static functions */
-static l_int32 pixaExtendArray(PIXA *pixa);
-
-/*---------------------------------------------------------------------*
- * Pixa creation, destruction, copy *
- *---------------------------------------------------------------------*/
-/*!
- * \brief pixaCreate()
- *
- * \param[in] n initial number of ptrs
- * \return pixa, or NULL on error
- *
- *
- * Notes:
- * (1) This creates an empty boxa.
- *
- */
-PIXA *
-pixaCreate(l_int32 n)
-{
-PIXA *pixa;
-
- PROCNAME("pixaCreate");
-
- if (n <= 0 || n > MaxPtrArraySize)
- n = InitialPtrArraySize;
-
- pixa = (PIXA *)LEPT_CALLOC(1, sizeof(PIXA));
- pixa->n = 0;
- pixa->nalloc = n;
- pixa->refcount = 1;
- pixa->pix = (PIX **)LEPT_CALLOC(n, sizeof(PIX *));
- pixa->boxa = boxaCreate(n);
- if (!pixa->pix || !pixa->boxa) {
- pixaDestroy(&pixa);
- return (PIXA *)ERROR_PTR("pix or boxa not made", procName, NULL);
- }
- return pixa;
-}
-
-
-/*!
- * \brief pixaCreateFromPix()
- *
- * \param[in] pixs with individual components on a lattice
- * \param[in] n number of components
- * \param[in] cellw width of each cell
- * \param[in] cellh height of each cell
- * \return pixa, or NULL on error
- *
- *
- * Notes:
- * (1) For bpp = 1, we truncate each retrieved pix to the ON
- * pixels, which we assume for now start at (0,0)
- *
- */
-PIXA *
-pixaCreateFromPix(PIX *pixs,
- l_int32 n,
- l_int32 cellw,
- l_int32 cellh)
-{
-l_int32 w, h, d, nw, nh, i, j, index;
-PIX *pix1, *pix2;
-PIXA *pixa;
-
- PROCNAME("pixaCreateFromPix");
-
- if (!pixs)
- return (PIXA *)ERROR_PTR("pixs not defined", procName, NULL);
- if (n <= 0)
- return (PIXA *)ERROR_PTR("n must be > 0", procName, NULL);
-
- if ((pixa = pixaCreate(n)) == NULL)
- return (PIXA *)ERROR_PTR("pixa not made", procName, NULL);
- pixGetDimensions(pixs, &w, &h, &d);
- if ((pix1 = pixCreate(cellw, cellh, d)) == NULL) {
- pixaDestroy(&pixa);
- return (PIXA *)ERROR_PTR("pix1 not made", procName, NULL);
- }
-
- nw = (w + cellw - 1) / cellw;
- nh = (h + cellh - 1) / cellh;
- for (i = 0, index = 0; i < nh; i++) {
- for (j = 0; j < nw && index < n; j++, index++) {
- pixRasterop(pix1, 0, 0, cellw, cellh, PIX_SRC, pixs,
- j * cellw, i * cellh);
- if (d == 1 && !pixClipToForeground(pix1, &pix2, NULL))
- pixaAddPix(pixa, pix2, L_INSERT);
- else
- pixaAddPix(pixa, pix1, L_COPY);
- }
- }
-
- pixDestroy(&pix1);
- return pixa;
-}
-
-
-/*!
- * \brief pixaCreateFromBoxa()
- *
- * \param[in] pixs
- * \param[in] boxa
- * \param[in] start first box to use
- * \param[in] num number of boxes; use 0 to go to the end
- * \param[out] pcropwarn [optional] TRUE if the boxa extent
- * is larger than pixs.
- * \return pixad, or NULL on error
- *
- *
- * Notes:
- * (1) This simply extracts from pixs the region corresponding to each
- * box in the boxa. To extract all the regions, set both %start
- * and %num to 0.
- * (2) The 5th arg is optional. If the extent of the boxa exceeds the
- * size of the pixa, so that some boxes are either clipped
- * or entirely outside the pix, a warning is returned as TRUE.
- * (3) pixad will have only the properly clipped elements, and
- * the internal boxa will be correct.
- *
- */
-PIXA *
-pixaCreateFromBoxa(PIX *pixs,
- BOXA *boxa,
- l_int32 start,
- l_int32 num,
- l_int32 *pcropwarn)
-{
-l_int32 i, n, end, w, h, wbox, hbox, cropwarn;
-BOX *box, *boxc;
-PIX *pixd;
-PIXA *pixad;
-
- PROCNAME("pixaCreateFromBoxa");
-
- if (!pixs)
- return (PIXA *)ERROR_PTR("pixs not defined", procName, NULL);
- if (!boxa)
- return (PIXA *)ERROR_PTR("boxa not defined", procName, NULL);
- if (num < 0)
- return (PIXA *)ERROR_PTR("num must be >= 0", procName, NULL);
-
- n = boxaGetCount(boxa);
- end = (num == 0) ? n - 1 : L_MIN(start + num - 1, n - 1);
- if ((pixad = pixaCreate(end - start + 1)) == NULL)
- return (PIXA *)ERROR_PTR("pixad not made", procName, NULL);
-
- boxaGetExtent(boxa, &wbox, &hbox, NULL);
- pixGetDimensions(pixs, &w, &h, NULL);
- cropwarn = FALSE;
- if (wbox > w || hbox > h)
- cropwarn = TRUE;
- if (pcropwarn)
- *pcropwarn = cropwarn;
-
- for (i = start; i <= end; i++) {
- box = boxaGetBox(boxa, i, L_COPY);
- if (cropwarn) { /* if box is outside pixs, pixd is NULL */
- pixd = pixClipRectangle(pixs, box, &boxc); /* may be NULL */
- if (pixd) {
- pixaAddPix(pixad, pixd, L_INSERT);
- pixaAddBox(pixad, boxc, L_INSERT);
- }
- boxDestroy(&box);
- } else {
- pixd = pixClipRectangle(pixs, box, NULL);
- pixaAddPix(pixad, pixd, L_INSERT);
- pixaAddBox(pixad, box, L_INSERT);
- }
- }
-
- return pixad;
-}
-
-
-/*!
- * \brief pixaSplitPix()
- *
- * \param[in] pixs with individual components on a lattice
- * \param[in] nx number of mosaic cells horizontally
- * \param[in] ny number of mosaic cells vertically
- * \param[in] borderwidth of added border on all sides
- * \param[in] bordercolor in our RGBA format: 0xrrggbbaa
- * \return pixa, or NULL on error
- *
- *
- * Notes:
- * (1) This is a variant on pixaCreateFromPix(), where we
- * simply divide the image up into (approximately) equal
- * subunits. If you want the subimages to have essentially
- * the same aspect ratio as the input pix, use nx = ny.
- * (2) If borderwidth is 0, we ignore the input bordercolor and
- * redefine it to white.
- * (3) The bordercolor is always used to initialize each tiled pix,
- * so that if the src is clipped, the unblitted part will
- * be this color. This avoids 1 pixel wide black stripes at the
- * left and lower edges.
- *
- */
-PIXA *
-pixaSplitPix(PIX *pixs,
- l_int32 nx,
- l_int32 ny,
- l_int32 borderwidth,
- l_uint32 bordercolor)
-{
-l_int32 w, h, d, cellw, cellh, i, j;
-PIX *pix1;
-PIXA *pixa;
-
- PROCNAME("pixaSplitPix");
-
- if (!pixs)
- return (PIXA *)ERROR_PTR("pixs not defined", procName, NULL);
- if (nx <= 0 || ny <= 0)
- return (PIXA *)ERROR_PTR("nx and ny must be > 0", procName, NULL);
- borderwidth = L_MAX(0, borderwidth);
-
- if ((pixa = pixaCreate(nx * ny)) == NULL)
- return (PIXA *)ERROR_PTR("pixa not made", procName, NULL);
- pixGetDimensions(pixs, &w, &h, &d);
- cellw = (w + nx - 1) / nx; /* round up */
- cellh = (h + ny - 1) / ny;
-
- for (i = 0; i < ny; i++) {
- for (j = 0; j < nx; j++) {
- if ((pix1 = pixCreate(cellw + 2 * borderwidth,
- cellh + 2 * borderwidth, d)) == NULL) {
- pixaDestroy(&pixa);
- return (PIXA *)ERROR_PTR("pix1 not made", procName, NULL);
- }
- pixCopyColormap(pix1, pixs);
- if (borderwidth == 0) { /* initialize full image to white */
- if (d == 1)
- pixClearAll(pix1);
- else
- pixSetAll(pix1);
- } else {
- pixSetAllArbitrary(pix1, bordercolor);
- }
- pixRasterop(pix1, borderwidth, borderwidth, cellw, cellh,
- PIX_SRC, pixs, j * cellw, i * cellh);
- pixaAddPix(pixa, pix1, L_INSERT);
- }
- }
-
- return pixa;
-}
-
-
-/*!
- * \brief pixaDestroy()
- *
- * \param[in,out] ppixa use ptr address so it will be nulled
- *
- *
- * Notes:
- * (1) Decrements the ref count and, if 0, destroys the pixa.
- * (2) Always nulls the input ptr.
- *
- */
-void
-pixaDestroy(PIXA **ppixa)
-{
-l_int32 i;
-PIXA *pixa;
-
- PROCNAME("pixaDestroy");
-
- if (ppixa == NULL) {
- L_WARNING("ptr address is NULL!\n", procName);
- return;
- }
-
- if ((pixa = *ppixa) == NULL)
- return;
-
- /* Decrement the refcount. If it is 0, destroy the pixa. */
- pixaChangeRefcount(pixa, -1);
- if (pixa->refcount <= 0) {
- for (i = 0; i < pixa->n; i++)
- pixDestroy(&pixa->pix[i]);
- LEPT_FREE(pixa->pix);
- boxaDestroy(&pixa->boxa);
- LEPT_FREE(pixa);
- }
-
- *ppixa = NULL;
- return;
-}
-
-
-/*!
- * \brief pixaCopy()
- *
- * \param[in] pixa
- * \param[in] copyflag see pix.h for details:
- * L_COPY makes a new pixa and copies each pix and each box;
- * L_CLONE gives a new ref-counted handle to the input pixa;
- * L_COPY_CLONE makes a new pixa and inserts clones of
- * all pix and boxes
- * \return new pixa, or NULL on error
- */
-PIXA *
-pixaCopy(PIXA *pixa,
- l_int32 copyflag)
-{
-l_int32 i, nb;
-BOX *boxc;
-PIX *pixc;
-PIXA *pixac;
-
- PROCNAME("pixaCopy");
-
- if (!pixa)
- return (PIXA *)ERROR_PTR("pixa not defined", procName, NULL);
-
- if (copyflag == L_CLONE) {
- pixaChangeRefcount(pixa, 1);
- return pixa;
- }
-
- if (copyflag != L_COPY && copyflag != L_COPY_CLONE)
- return (PIXA *)ERROR_PTR("invalid copyflag", procName, NULL);
-
- if ((pixac = pixaCreate(pixa->n)) == NULL)
- return (PIXA *)ERROR_PTR("pixac not made", procName, NULL);
- nb = pixaGetBoxaCount(pixa);
- for (i = 0; i < pixa->n; i++) {
- if (copyflag == L_COPY) {
- pixc = pixaGetPix(pixa, i, L_COPY);
- if (i < nb) boxc = pixaGetBox(pixa, i, L_COPY);
- } else { /* copy-clone */
- pixc = pixaGetPix(pixa, i, L_CLONE);
- if (i < nb) boxc = pixaGetBox(pixa, i, L_CLONE);
- }
- pixaAddPix(pixac, pixc, L_INSERT);
- if (i < nb) pixaAddBox(pixac, boxc, L_INSERT);
- }
-
- return pixac;
-}
-
-
-
-/*---------------------------------------------------------------------*
- * Pixa addition *
- *---------------------------------------------------------------------*/
-/*!
- * \brief pixaAddPix()
- *
- * \param[in] pixa
- * \param[in] pix to be added
- * \param[in] copyflag L_INSERT, L_COPY, L_CLONE
- * \return 0 if OK; 1 on error
- */
-l_ok
-pixaAddPix(PIXA *pixa,
- PIX *pix,
- l_int32 copyflag)
-{
-l_int32 n;
-PIX *pixc;
-
- PROCNAME("pixaAddPix");
-
- if (!pixa)
- return ERROR_INT("pixa not defined", procName, 1);
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
-
- if (copyflag == L_INSERT)
- pixc = pix;
- else if (copyflag == L_COPY)
- pixc = pixCopy(NULL, pix);
- else if (copyflag == L_CLONE)
- pixc = pixClone(pix);
- else
- return ERROR_INT("invalid copyflag", procName, 1);
- if (!pixc)
- return ERROR_INT("pixc not made", procName, 1);
-
- n = pixaGetCount(pixa);
- if (n >= pixa->nalloc)
- pixaExtendArray(pixa);
- pixa->pix[n] = pixc;
- pixa->n++;
-
- return 0;
-}
-
-
-/*!
- * \brief pixaAddBox()
- *
- * \param[in] pixa
- * \param[in] box
- * \param[in] copyflag L_INSERT, L_COPY, L_CLONE
- * \return 0 if OK, 1 on error
- */
-l_ok
-pixaAddBox(PIXA *pixa,
- BOX *box,
- l_int32 copyflag)
-{
- PROCNAME("pixaAddBox");
-
- if (!pixa)
- return ERROR_INT("pixa not defined", procName, 1);
- if (!box)
- return ERROR_INT("box not defined", procName, 1);
- if (copyflag != L_INSERT && copyflag != L_COPY && copyflag != L_CLONE)
- return ERROR_INT("invalid copyflag", procName, 1);
-
- boxaAddBox(pixa->boxa, box, copyflag);
- return 0;
-}
-
-
-/*!
- * \brief pixaExtendArray()
- *
- * \param[in] pixa
- * \return 0 if OK; 1 on error
- *
- *
- * Notes:
- * (1) Doubles the size of the pixa and boxa ptr arrays.
- *
- */
-static l_int32
-pixaExtendArray(PIXA *pixa)
-{
- PROCNAME("pixaExtendArray");
-
- if (!pixa)
- return ERROR_INT("pixa not defined", procName, 1);
-
- return pixaExtendArrayToSize(pixa, 2 * pixa->nalloc);
-}
-
-
-/*!
- * \brief pixaExtendArrayToSize()
- *
- * \param[in] pixa
- * \param[in] size
- * \return 0 if OK; 1 on error
- *
- *
- * Notes:
- * (1) If necessary, reallocs new pixa and boxa ptrs arrays to %size.
- * The pixa and boxa ptr arrays must always be equal in size.
- *
- */
-l_ok
-pixaExtendArrayToSize(PIXA *pixa,
- l_int32 size)
-{
- PROCNAME("pixaExtendArrayToSize");
-
- if (!pixa)
- return ERROR_INT("pixa not defined", procName, 1);
-
- if (size > pixa->nalloc) {
- if ((pixa->pix = (PIX **)reallocNew((void **)&pixa->pix,
- sizeof(PIX *) * pixa->nalloc,
- size * sizeof(PIX *))) == NULL)
- return ERROR_INT("new ptr array not returned", procName, 1);
- pixa->nalloc = size;
- }
- return boxaExtendArrayToSize(pixa->boxa, size);
-}
-
-
-/*---------------------------------------------------------------------*
- * Pixa accessors *
- *---------------------------------------------------------------------*/
-/*!
- * \brief pixaGetCount()
- *
- * \param[in] pixa
- * \return count, or 0 if no pixa
- */
-l_int32
-pixaGetCount(PIXA *pixa)
-{
- PROCNAME("pixaGetCount");
-
- if (!pixa)
- return ERROR_INT("pixa not defined", procName, 0);
-
- return pixa->n;
-}
-
-
-/*!
- * \brief pixaChangeRefcount()
- *
- * \param[in] pixa
- * \param[in] delta
- * \return 0 if OK, 1 on error
- */
-l_ok
-pixaChangeRefcount(PIXA *pixa,
- l_int32 delta)
-{
- PROCNAME("pixaChangeRefcount");
-
- if (!pixa)
- return ERROR_INT("pixa not defined", procName, 1);
-
- pixa->refcount += delta;
- return 0;
-}
-
-
-/*!
- * \brief pixaGetPix()
- *
- * \param[in] pixa
- * \param[in] index to the index-th pix
- * \param[in] accesstype L_COPY or L_CLONE
- * \return pix, or NULL on error
- */
-PIX *
-pixaGetPix(PIXA *pixa,
- l_int32 index,
- l_int32 accesstype)
-{
-PIX *pix;
-
- PROCNAME("pixaGetPix");
-
- if (!pixa)
- return (PIX *)ERROR_PTR("pixa not defined", procName, NULL);
- if (index < 0 || index >= pixa->n)
- return (PIX *)ERROR_PTR("index not valid", procName, NULL);
- if ((pix = pixa->pix[index]) == NULL) {
- L_ERROR("no pix at pixa[%d]\n", procName, index);
- return (PIX *)ERROR_PTR("pix not found!", procName, NULL);
- }
-
- if (accesstype == L_COPY)
- return pixCopy(NULL, pix);
- else if (accesstype == L_CLONE)
- return pixClone(pix);
- else
- return (PIX *)ERROR_PTR("invalid accesstype", procName, NULL);
-}
-
-
-/*!
- * \brief pixaGetPixDimensions()
- *
- * \param[in] pixa
- * \param[in] index to the index-th box
- * \param[out] pw, ph, pd [optional] each can be null
- * \return 0 if OK, 1 on error
- */
-l_ok
-pixaGetPixDimensions(PIXA *pixa,
- l_int32 index,
- l_int32 *pw,
- l_int32 *ph,
- l_int32 *pd)
-{
-PIX *pix;
-
- PROCNAME("pixaGetPixDimensions");
-
- if (pw) *pw = 0;
- if (ph) *ph = 0;
- if (pd) *pd = 0;
- if (!pixa)
- return ERROR_INT("pixa not defined", procName, 1);
- if (index < 0 || index >= pixa->n)
- return ERROR_INT("index not valid", procName, 1);
-
- if ((pix = pixaGetPix(pixa, index, L_CLONE)) == NULL)
- return ERROR_INT("pix not found!", procName, 1);
- pixGetDimensions(pix, pw, ph, pd);
- pixDestroy(&pix);
- return 0;
-}
-
-
-/*!
- * \brief pixaGetBoxa()
- *
- * \param[in] pixa
- * \param[in] accesstype L_COPY, L_CLONE, L_COPY_CLONE
- * \return boxa, or NULL on error
- */
-BOXA *
-pixaGetBoxa(PIXA *pixa,
- l_int32 accesstype)
-{
- PROCNAME("pixaGetBoxa");
-
- if (!pixa)
- return (BOXA *)ERROR_PTR("pixa not defined", procName, NULL);
- if (!pixa->boxa)
- return (BOXA *)ERROR_PTR("boxa not defined", procName, NULL);
- if (accesstype != L_COPY && accesstype != L_CLONE &&
- accesstype != L_COPY_CLONE)
- return (BOXA *)ERROR_PTR("invalid accesstype", procName, NULL);
-
- return boxaCopy(pixa->boxa, accesstype);
-}
-
-
-/*!
- * \brief pixaGetBoxaCount()
- *
- * \param[in] pixa
- * \return count, or 0 on error
- */
-l_int32
-pixaGetBoxaCount(PIXA *pixa)
-{
- PROCNAME("pixaGetBoxaCount");
-
- if (!pixa)
- return ERROR_INT("pixa not defined", procName, 0);
-
- return boxaGetCount(pixa->boxa);
-}
-
-
-/*!
- * \brief pixaGetBox()
- *
- * \param[in] pixa
- * \param[in] index to the index-th pix
- * \param[in] accesstype L_COPY or L_CLONE
- * \return box if null, not automatically an error, or NULL on error
- *
- *
- * Notes:
- * (1) There is always a boxa with a pixa, and it is initialized so
- * that each box ptr is NULL.
- * (2) In general, we expect that there is either a box associated
- * with each pix, or no boxes at all in the boxa.
- * (3) Having no boxes is thus not an automatic error. Whether it
- * is an actual error is determined by the calling program.
- * If the caller expects to get a box, it is an error; see, e.g.,
- * pixaGetBoxGeometry().
- *
- */
-BOX *
-pixaGetBox(PIXA *pixa,
- l_int32 index,
- l_int32 accesstype)
-{
-BOX *box;
-
- PROCNAME("pixaGetBox");
-
- if (!pixa)
- return (BOX *)ERROR_PTR("pixa not defined", procName, NULL);
- if (!pixa->boxa)
- return (BOX *)ERROR_PTR("boxa not defined", procName, NULL);
- if (index < 0 || index >= pixa->boxa->n)
- return (BOX *)ERROR_PTR("index not valid", procName, NULL);
- if (accesstype != L_COPY && accesstype != L_CLONE)
- return (BOX *)ERROR_PTR("invalid accesstype", procName, NULL);
-
- box = pixa->boxa->box[index];
- if (box) {
- if (accesstype == L_COPY)
- return boxCopy(box);
- else /* accesstype == L_CLONE */
- return boxClone(box);
- } else {
- return NULL;
- }
-}
-
-
-/*!
- * \brief pixaGetBoxGeometry()
- *
- * \param[in] pixa
- * \param[in] index to the index-th box
- * \param[out] px, py, pw, ph [optional] each can be null
- * \return 0 if OK, 1 on error
- */
-l_ok
-pixaGetBoxGeometry(PIXA *pixa,
- l_int32 index,
- l_int32 *px,
- l_int32 *py,
- l_int32 *pw,
- l_int32 *ph)
-{
-BOX *box;
-
- PROCNAME("pixaGetBoxGeometry");
-
- if (px) *px = 0;
- if (py) *py = 0;
- if (pw) *pw = 0;
- if (ph) *ph = 0;
- if (!pixa)
- return ERROR_INT("pixa not defined", procName, 1);
- if (index < 0 || index >= pixa->n)
- return ERROR_INT("index not valid", procName, 1);
-
- if ((box = pixaGetBox(pixa, index, L_CLONE)) == NULL)
- return ERROR_INT("box not found!", procName, 1);
- boxGetGeometry(box, px, py, pw, ph);
- boxDestroy(&box);
- return 0;
-}
-
-
-/*!
- * \brief pixaSetBoxa()
- *
- * \param[in] pixa
- * \param[in] boxa
- * \param[in] accesstype L_INSERT, L_COPY, L_CLONE
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This destroys the existing boxa in the pixa.
- *
- */
-l_ok
-pixaSetBoxa(PIXA *pixa,
- BOXA *boxa,
- l_int32 accesstype)
-{
- PROCNAME("pixaSetBoxa");
-
- if (!pixa)
- return ERROR_INT("pixa not defined", procName, 1);
- if (!boxa)
- return ERROR_INT("boxa not defined", procName, 1);
- if (accesstype != L_INSERT && accesstype != L_COPY &&
- accesstype != L_CLONE)
- return ERROR_INT("invalid access type", procName, 1);
-
- boxaDestroy(&pixa->boxa);
- if (accesstype == L_INSERT)
- pixa->boxa = boxa;
- else
- pixa->boxa = boxaCopy(boxa, accesstype);
-
- return 0;
-}
-
-
-/*!
- * \brief pixaGetPixArray()
- *
- * \param[in] pixa
- * \return pix array, or NULL on error
- *
- *
- * Notes:
- * (1) This returns a ptr to the actual array. The array is
- * owned by the pixa, so it must not be destroyed.
- * (2) The caller should always check if the return value is NULL
- * before accessing any of the pix ptrs in this array!
- *
- */
-PIX **
-pixaGetPixArray(PIXA *pixa)
-{
- PROCNAME("pixaGetPixArray");
-
- if (!pixa)
- return (PIX **)ERROR_PTR("pixa not defined", procName, NULL);
-
- return pixa->pix;
-}
-
-
-/*!
- * \brief pixaVerifyDepth()
- *
- * \param[in] pixa
- * \param[out] psame 1 if depth is the same for all pix; 0 otherwise
- * \param[out] pmaxd [optional] max depth of all pix
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) It is considered to be an error if there are no pix.
- *
- */
-l_ok
-pixaVerifyDepth(PIXA *pixa,
- l_int32 *psame,
- l_int32 *pmaxd)
-{
-l_int32 i, n, d, maxd, same;
-
- PROCNAME("pixaVerifyDepth");
-
- if (pmaxd) *pmaxd = 0;
- if (!psame)
- return ERROR_INT("psame not defined", procName, 1);
- if (!pixa)
- return ERROR_INT("pixa not defined", procName, 1);
- if ((n = pixaGetCount(pixa)) == 0)
- return ERROR_INT("no pix in pixa", procName, 1);
-
- same = 1;
- pixaGetPixDimensions(pixa, 0, NULL, NULL, &maxd);
- for (i = 1; i < n; i++) {
- if (pixaGetPixDimensions(pixa, i, NULL, NULL, &d))
- return ERROR_INT("pix depth not found", procName, 1);
- maxd = L_MAX(maxd, d);
- if (d != maxd)
- same = 0;
- }
- *psame = same;
- if (pmaxd) *pmaxd = maxd;
- return 0;
-}
-
-
-/*!
- * \brief pixaVerifyDimensions()
- *
- * \param[in] pixa
- * \param[out] psame 1 if dimensions are the same for all pix; 0 otherwise
- * \param[out] pmaxw [optional] max width of all pix
- * \param[out] pmaxh [optional] max height of all pix
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) It is considered to be an error if there are no pix.
- *
- */
-l_ok
-pixaVerifyDimensions(PIXA *pixa,
- l_int32 *psame,
- l_int32 *pmaxw,
- l_int32 *pmaxh)
-{
-l_int32 i, n, w, h, maxw, maxh, same;
-
- PROCNAME("pixaVerifyDimensions");
-
- if (pmaxw) *pmaxw = 0;
- if (pmaxh) *pmaxh = 0;
- if (!psame)
- return ERROR_INT("psame not defined", procName, 1);
- *psame = 0;
- if (!pixa)
- return ERROR_INT("pixa not defined", procName, 1);
- if ((n = pixaGetCount(pixa)) == 0)
- return ERROR_INT("no pix in pixa", procName, 1);
-
- same = 1;
- pixaGetPixDimensions(pixa, 0, &maxw, &maxh, NULL);
- for (i = 1; i < n; i++) {
- if (pixaGetPixDimensions(pixa, i, &w, &h, NULL))
- return ERROR_INT("pix dimensions not found", procName, 1);
- maxw = L_MAX(maxw, w);
- maxh = L_MAX(maxh, h);
- if (w != maxw || h != maxh)
- same = 0;
- }
- *psame = same;
- if (pmaxw) *pmaxw = maxw;
- if (pmaxh) *pmaxh = maxh;
- return 0;
-}
-
-
-/*!
- * \brief pixaIsFull()
- *
- * \param[in] pixa
- * \param[out] pfullpa [optional] 1 if pixa is full
- * \param[out] pfullba [optional] 1 if boxa is full
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) A pixa is "full" if the array of pix is fully
- * occupied from index 0 to index (pixa->n - 1).
- *
- */
-l_ok
-pixaIsFull(PIXA *pixa,
- l_int32 *pfullpa,
- l_int32 *pfullba)
-{
-l_int32 i, n, full;
-BOXA *boxa;
-PIX *pix;
-
- PROCNAME("pixaIsFull");
-
- if (pfullpa) *pfullpa = 0;
- if (pfullba) *pfullba = 0;
- if (!pixa)
- return ERROR_INT("pixa not defined", procName, 1);
-
- n = pixaGetCount(pixa);
- if (pfullpa) {
- full = 1;
- for (i = 0; i < n; i++) {
- if ((pix = pixaGetPix(pixa, i, L_CLONE)) == NULL) {
- full = 0;
- break;
- }
- pixDestroy(&pix);
- }
- *pfullpa = full;
- }
- if (pfullba) {
- boxa = pixaGetBoxa(pixa, L_CLONE);
- boxaIsFull(boxa, pfullba);
- boxaDestroy(&boxa);
- }
- return 0;
-}
-
-
-/*!
- * \brief pixaCountText()
- *
- * \param[in] pixa
- * \param[out] pntext number of pix with non-empty text strings
- * \return 0 if OK, 1 on error.
- *
- *
- * Notes:
- * (1) All pix have non-empty text strings if the returned value %ntext
- * equals the pixa count.
- *
- */
-l_ok
-pixaCountText(PIXA *pixa,
- l_int32 *pntext)
-{
-char *text;
-l_int32 i, n;
-PIX *pix;
-
- PROCNAME("pixaCountText");
-
- if (!pntext)
- return ERROR_INT("&ntext not defined", procName, 1);
- *pntext = 0;
- if (!pixa)
- return ERROR_INT("pixa not defined", procName, 1);
-
- n = pixaGetCount(pixa);
- for (i = 0; i < n; i++) {
- if ((pix = pixaGetPix(pixa, i, L_CLONE)) == NULL)
- continue;
- text = pixGetText(pix);
- if (text && strlen(text) > 0)
- (*pntext)++;
- pixDestroy(&pix);
- }
-
- return 0;
-}
-
-
-/*!
- * \brief pixaSetText()
- *
- * \param[in] pixa
- * \param[in] text [optional] single text string, to insert in each pix
- * \param[in] sa [optional] array of text strings, to insert in each pix
- * \return 0 if OK, 1 on error.
- *
- *
- * Notes:
- * (1) To clear all the text fields, use %sa == NULL and %text == NULL.
- * (2) To set all the text fields to the same value %text, use %sa = NULL.
- * (3) If %sa is defined, we ignore %text and use it; %sa must have
- * the same count as %pixa.
- *
- */
-l_ok
-pixaSetText(PIXA *pixa,
- const char *text,
- SARRAY *sa)
-{
-char *str;
-l_int32 i, n;
-PIX *pix;
-
- PROCNAME("pixaSetText");
-
- if (!pixa)
- return ERROR_INT("pixa not defined", procName, 1);
-
- n = pixaGetCount(pixa);
- if (sa && (sarrayGetCount(sa) != n))
- return ERROR_INT("pixa and sa sizes differ", procName, 1);
-
- if (!sa) {
- for (i = 0; i < n; i++) {
- if ((pix = pixaGetPix(pixa, i, L_CLONE)) == NULL)
- continue;
- pixSetText(pix, text);
- pixDestroy(&pix);
- }
- return 0;
- }
-
- for (i = 0; i < n; i++) {
- if ((pix = pixaGetPix(pixa, i, L_CLONE)) == NULL)
- continue;
- str = sarrayGetString(sa, i, L_NOCOPY);
- pixSetText(pix, str);
- pixDestroy(&pix);
- }
-
- return 0;
-}
-
-
-/*!
- * \brief pixaGetLinePtrs()
- *
- * \param[in] pixa of pix that all have the same depth
- * \param[out] psize [optional] number of pix in the pixa
- * \return array of array of line ptrs, or NULL on error
- *
- *
- * Notes:
- * (1) See pixGetLinePtrs() for details.
- * (2) It is best if all pix in the pixa are the same size.
- * The size of each line ptr array is equal to the height
- * of the pix that it refers to.
- * (3) This is an array of arrays. To destroy it:
- * for (i = 0; i < size; i++)
- * LEPT_FREE(lineset[i]);
- * LEPT_FREE(lineset);
- *
- */
-void ***
-pixaGetLinePtrs(PIXA *pixa,
- l_int32 *psize)
-{
-l_int32 i, n, same;
-void **lineptrs;
-void ***lineset;
-PIX *pix;
-
- PROCNAME("pixaGetLinePtrs");
-
- if (psize) *psize = 0;
- if (!pixa)
- return (void ***)ERROR_PTR("pixa not defined", procName, NULL);
- pixaVerifyDepth(pixa, &same, NULL);
- if (!same)
- return (void ***)ERROR_PTR("pixa not all same depth", procName, NULL);
- n = pixaGetCount(pixa);
- if (psize) *psize = n;
- if ((lineset = (void ***)LEPT_CALLOC(n, sizeof(void **))) == NULL)
- return (void ***)ERROR_PTR("lineset not made", procName, NULL);
- for (i = 0; i < n; i++) {
- pix = pixaGetPix(pixa, i, L_CLONE);
- lineptrs = pixGetLinePtrs(pix, NULL);
- lineset[i] = lineptrs;
- pixDestroy(&pix);
- }
-
- return lineset;
-}
-
-
-/*---------------------------------------------------------------------*
- * Pixa output info *
- *---------------------------------------------------------------------*/
-/*!
- * \brief pixaWriteStreamInfo()
- *
- * \param[in] fp file stream
- * \param[in] pixa
- * \return 0 if OK, 1 on error.
- *
- *
- * Notes:
- * (1) For each pix in the pixa, write out the pix dimensions, spp,
- * text string (if it exists), and cmap info.
- *
- */
-l_ok
-pixaWriteStreamInfo(FILE *fp,
- PIXA *pixa)
-{
-char *text;
-l_int32 i, n, w, h, d, spp, count, hastext;
-PIX *pix;
-PIXCMAP *cmap;
-
- PROCNAME("pixaWriteStreamInfo");
-
- if (!fp)
- return ERROR_INT("stream not defined", procName, 1);
- if (!pixa)
- return ERROR_INT("pixa not defined", procName, 1);
-
- n = pixaGetCount(pixa);
- for (i = 0; i < n; i++) {
- if ((pix = pixaGetPix(pixa, i, L_CLONE)) == NULL) {
- fprintf(fp, "%d: no pix at this index\n", i);
- continue;
- }
- pixGetDimensions(pix, &w, &h, &d);
- spp = pixGetSpp(pix);
- text = pixGetText(pix);
- hastext = (text && strlen(text) > 0);
- if ((cmap = pixGetColormap(pix)) != NULL)
- count = pixcmapGetCount(cmap);
- fprintf(fp, "Pix %d: w = %d, h = %d, d = %d, spp = %d",
- i, w, h, d, spp);
- if (cmap) fprintf(fp, ", cmap(%d colors)", count);
- if (hastext) fprintf(fp, ", text = %s", text);
- fprintf(fp, "\n");
- pixDestroy(&pix);
- }
-
- return 0;
-}
-
-
-/*---------------------------------------------------------------------*
- * Pixa array modifiers *
- *---------------------------------------------------------------------*/
-/*!
- * \brief pixaReplacePix()
- *
- * \param[in] pixa
- * \param[in] index to the index-th pix
- * \param[in] pix insert to replace existing one
- * \param[in] box [optional] insert to replace existing
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) In-place replacement of one pix.
- * (2) The previous pix at that location is destroyed.
- *
- */
-l_ok
-pixaReplacePix(PIXA *pixa,
- l_int32 index,
- PIX *pix,
- BOX *box)
-{
-BOXA *boxa;
-
- PROCNAME("pixaReplacePix");
-
- if (!pixa)
- return ERROR_INT("pixa not defined", procName, 1);
- if (index < 0 || index >= pixa->n)
- return ERROR_INT("index not valid", procName, 1);
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
-
- pixDestroy(&(pixa->pix[index]));
- pixa->pix[index] = pix;
-
- if (box) {
- boxa = pixa->boxa;
- if (index > boxa->n)
- return ERROR_INT("boxa index not valid", procName, 1);
- boxaReplaceBox(boxa, index, box);
- }
-
- return 0;
-}
-
-
-/*!
- * \brief pixaInsertPix()
- *
- * \param[in] pixa
- * \param[in] index at which pix is to be inserted
- * \param[in] pixs new pix to be inserted
- * \param[in] box [optional] new box to be inserted
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This shifts pixa[i] --> pixa[i + 1] for all i >= index,
- * and then inserts at pixa[index].
- * (2) To insert at the beginning of the array, set index = 0.
- * (3) It should not be used repeatedly on large arrays,
- * because the function is O(n).
- * (4) To append a pix to a pixa, it's easier to use pixaAddPix().
- *
- */
-l_ok
-pixaInsertPix(PIXA *pixa,
- l_int32 index,
- PIX *pixs,
- BOX *box)
-{
-l_int32 i, n;
-
- PROCNAME("pixaInsertPix");
-
- if (!pixa)
- return ERROR_INT("pixa not defined", procName, 1);
- n = pixaGetCount(pixa);
- if (index < 0 || index > n)
- return ERROR_INT("index not in {0...n}", procName, 1);
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
-
- if (n >= pixa->nalloc) { /* extend both ptr arrays */
- pixaExtendArray(pixa);
- boxaExtendArray(pixa->boxa);
- }
- pixa->n++;
- for (i = n; i > index; i--)
- pixa->pix[i] = pixa->pix[i - 1];
- pixa->pix[index] = pixs;
-
- /* Optionally, insert the box */
- if (box)
- boxaInsertBox(pixa->boxa, index, box);
-
- return 0;
-}
-
-
-/*!
- * \brief pixaRemovePix()
- *
- * \param[in] pixa
- * \param[in] index of pix to be removed
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This shifts pixa[i] --> pixa[i - 1] for all i > index.
- * (2) It should not be used repeatedly on large arrays,
- * because the function is O(n).
- * (3) The corresponding box is removed as well, if it exists.
- *
- */
-l_ok
-pixaRemovePix(PIXA *pixa,
- l_int32 index)
-{
-l_int32 i, n, nbox;
-BOXA *boxa;
-PIX **array;
-
- PROCNAME("pixaRemovePix");
-
- if (!pixa)
- return ERROR_INT("pixa not defined", procName, 1);
- n = pixaGetCount(pixa);
- if (index < 0 || index >= n)
- return ERROR_INT("index not in {0...n - 1}", procName, 1);
-
- /* Remove the pix */
- array = pixa->pix;
- pixDestroy(&array[index]);
- for (i = index + 1; i < n; i++)
- array[i - 1] = array[i];
- array[n - 1] = NULL;
- pixa->n--;
-
- /* Remove the box if it exists */
- boxa = pixa->boxa;
- nbox = boxaGetCount(boxa);
- if (index < nbox)
- boxaRemoveBox(boxa, index);
-
- return 0;
-}
-
-
-/*!
- * \brief pixaRemovePixAndSave()
- *
- * \param[in] pixa
- * \param[in] index of pix to be removed
- * \param[out] ppix [optional] removed pix
- * \param[out] pbox [optional] removed box
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This shifts pixa[i] --> pixa[i - 1] for all i > index.
- * (2) It should not be used repeatedly on large arrays,
- * because the function is O(n).
- * (3) The corresponding box is removed as well, if it exists.
- * (4) The removed pix and box can either be retained or destroyed.
- *
- */
-l_ok
-pixaRemovePixAndSave(PIXA *pixa,
- l_int32 index,
- PIX **ppix,
- BOX **pbox)
-{
-l_int32 i, n, nbox;
-BOXA *boxa;
-PIX **array;
-
- PROCNAME("pixaRemovePixAndSave");
-
- if (ppix) *ppix = NULL;
- if (pbox) *pbox = NULL;
- if (!pixa)
- return ERROR_INT("pixa not defined", procName, 1);
- n = pixaGetCount(pixa);
- if (index < 0 || index >= n)
- return ERROR_INT("index not in {0...n - 1}", procName, 1);
-
- /* Remove the pix */
- array = pixa->pix;
- if (ppix)
- *ppix = pixaGetPix(pixa, index, L_CLONE);
- pixDestroy(&array[index]);
- for (i = index + 1; i < n; i++)
- array[i - 1] = array[i];
- array[n - 1] = NULL;
- pixa->n--;
-
- /* Remove the box if it exists */
- boxa = pixa->boxa;
- nbox = boxaGetCount(boxa);
- if (index < nbox)
- boxaRemoveBoxAndSave(boxa, index, pbox);
-
- return 0;
-}
-
-
-/*!
- * \brief pixaRemoveSelected()
- *
- * \param[in] pixa
- * \param[in] naindex numa of indices of pix to be removed
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This gives error messages for invalid indices
- *
- */
-l_ok
-pixaRemoveSelected(PIXA *pixa,
- NUMA *naindex)
-{
-l_int32 i, n, index;
-NUMA *na1;
-
- PROCNAME("pixaRemoveSelected");
-
- if (!pixa)
- return ERROR_INT("pixa not defined", procName, 1);
- if (!naindex)
- return ERROR_INT("naindex not defined", procName, 1);
- if ((n = numaGetCount(naindex)) == 0)
- return ERROR_INT("naindex is empty", procName, 1);
-
- /* Remove from highest indices first */
- na1 = numaSort(NULL, naindex, L_SORT_DECREASING);
- for (i = 0; i < n; i++) {
- numaGetIValue(na1, i, &index);
- pixaRemovePix(pixa, index);
- }
- numaDestroy(&na1);
- return 0;
-}
-
-
-/*!
- * \brief pixaInitFull()
- *
- * \param[in] pixa typically empty
- * \param[in] pix [optional] to be replicated to the entire pixa ptr array
- * \param[in] box [optional] to be replicated to the entire boxa ptr array
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This initializes a pixa by filling up the entire pix ptr array
- * with copies of %pix. If %pix == NULL, we use a tiny placeholder
- * pix (w = h = d = 1). Any existing pix are destroyed.
- * It also optionally fills the boxa with copies of %box.
- * After this operation, the numbers of pix and (optionally)
- * boxes are equal to the number of allocated ptrs.
- * (2) Note that we use pixaReplacePix() instead of pixaInsertPix().
- * They both have the same effect when inserting into a NULL ptr
- * in the pixa ptr array:
- * (3) If the boxa is not initialized (i.e., filled with boxes),
- * later insertion of boxes will cause an error, because the
- * 'n' field is 0.
- * (4) Example usage. This function is useful to prepare for a
- * random insertion (or replacement) of pix into a pixa.
- * To randomly insert pix into a pixa, without boxes, up to
- * some index "max":
- * Pixa *pixa = pixaCreate(max);
- * pixaInitFull(pixa, NULL, NULL);
- * An existing pixa with a smaller ptr array can also be reused:
- * pixaExtendArrayToSize(pixa, max);
- * pixaInitFull(pixa, NULL, NULL);
- * The initialization allows the pixa to always be properly
- * filled, even if all pix (and boxes) are not later replaced.
- *
- */
-l_ok
-pixaInitFull(PIXA *pixa,
- PIX *pix,
- BOX *box)
-{
-l_int32 i, n;
-PIX *pix1;
-
- PROCNAME("pixaInitFull");
-
- if (!pixa)
- return ERROR_INT("pixa not defined", procName, 1);
-
- n = pixa->nalloc;
- pixa->n = n;
- for (i = 0; i < n; i++) {
- if (pix)
- pix1 = pixCopy(NULL, pix);
- else
- pix1 = pixCreate(1, 1, 1);
- pixaReplacePix(pixa, i, pix1, NULL);
- }
- if (box)
- boxaInitFull(pixa->boxa, box);
-
- return 0;
-}
-
-
-/*!
- * \brief pixaClear()
- *
- * \param[in] pixa
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This destroys all pix in the pixa, as well as
- * all boxes in the boxa. The ptrs in the pix ptr array
- * are all null'd. The number of allocated pix, n, is set to 0.
- *
- */
-l_ok
-pixaClear(PIXA *pixa)
-{
-l_int32 i, n;
-
- PROCNAME("pixaClear");
-
- if (!pixa)
- return ERROR_INT("pixa not defined", procName, 1);
-
- n = pixaGetCount(pixa);
- for (i = 0; i < n; i++)
- pixDestroy(&pixa->pix[i]);
- pixa->n = 0;
- return boxaClear(pixa->boxa);
-}
-
-
-/*---------------------------------------------------------------------*
- * Pixa and Pixaa combination *
- *---------------------------------------------------------------------*/
-/*!
- * \brief pixaJoin()
- *
- * \param[in] pixad dest pixa; add to this one
- * \param[in] pixas [optional] source pixa; add from this one
- * \param[in] istart starting index in pixas
- * \param[in] iend ending index in pixas; use -1 to cat all
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This appends a clone of each indicated pix in pixas to pixad
- * (2) istart < 0 is taken to mean 'read from the start' (istart = 0)
- * (3) iend < 0 means 'read to the end'
- * (4) If pixas is NULL or contains no pix, this is a no-op.
- *
- */
-l_ok
-pixaJoin(PIXA *pixad,
- PIXA *pixas,
- l_int32 istart,
- l_int32 iend)
-{
-l_int32 i, n, nb;
-BOXA *boxas, *boxad;
-PIX *pix;
-
- PROCNAME("pixaJoin");
-
- if (!pixad)
- return ERROR_INT("pixad not defined", procName, 1);
- if (!pixas || ((n = pixaGetCount(pixas)) == 0))
- return 0;
-
- if (istart < 0)
- istart = 0;
- if (iend < 0 || iend >= n)
- iend = n - 1;
- if (istart > iend)
- return ERROR_INT("istart > iend; nothing to add", procName, 1);
-
- for (i = istart; i <= iend; i++) {
- pix = pixaGetPix(pixas, i, L_CLONE);
- pixaAddPix(pixad, pix, L_INSERT);
- }
-
- boxas = pixaGetBoxa(pixas, L_CLONE);
- boxad = pixaGetBoxa(pixad, L_CLONE);
- nb = pixaGetBoxaCount(pixas);
- iend = L_MIN(iend, nb - 1);
- boxaJoin(boxad, boxas, istart, iend);
- boxaDestroy(&boxas); /* just the clones */
- boxaDestroy(&boxad);
- return 0;
-}
-
-
-/*!
- * \brief pixaInterleave()
- *
- * \param[in] pixa1 first src pixa
- * \param[in] pixa2 second src pixa
- * \param[in] copyflag L_CLONE, L_COPY
- * \return pixa interleaved from sources, or NULL on error.
- *
- *
- * Notes:
- * (1) %copyflag determines if the pix are copied or cloned.
- * The boxes, if they exist, are copied.
- * (2) If the two pixa have different sizes, a warning is issued,
- * and the number of pairs returned is the minimum size.
- *
- */
-PIXA *
-pixaInterleave(PIXA *pixa1,
- PIXA *pixa2,
- l_int32 copyflag)
-{
-l_int32 i, n1, n2, n, nb1, nb2;
-BOX *box;
-PIX *pix;
-PIXA *pixad;
-
- PROCNAME("pixaInterleave");
-
- if (!pixa1)
- return (PIXA *)ERROR_PTR("pixa1 not defined", procName, NULL);
- if (!pixa2)
- return (PIXA *)ERROR_PTR("pixa2 not defined", procName, NULL);
- if (copyflag != L_COPY && copyflag != L_CLONE)
- return (PIXA *)ERROR_PTR("invalid copyflag", procName, NULL);
- n1 = pixaGetCount(pixa1);
- n2 = pixaGetCount(pixa2);
- n = L_MIN(n1, n2);
- if (n == 0)
- return (PIXA *)ERROR_PTR("at least one input pixa is empty",
- procName, NULL);
- if (n1 != n2)
- L_WARNING("counts differ: %d != %d\n", procName, n1, n2);
-
- pixad = pixaCreate(2 * n);
- nb1 = pixaGetBoxaCount(pixa1);
- nb2 = pixaGetBoxaCount(pixa2);
- for (i = 0; i < n; i++) {
- pix = pixaGetPix(pixa1, i, copyflag);
- pixaAddPix(pixad, pix, L_INSERT);
- if (i < nb1) {
- box = pixaGetBox(pixa1, i, L_COPY);
- pixaAddBox(pixad, box, L_INSERT);
- }
- pix = pixaGetPix(pixa2, i, copyflag);
- pixaAddPix(pixad, pix, L_INSERT);
- if (i < nb2) {
- box = pixaGetBox(pixa2, i, L_COPY);
- pixaAddBox(pixad, box, L_INSERT);
- }
- }
-
- return pixad;
-}
-
-
-/*!
- * \brief pixaaJoin()
- *
- * \param[in] paad dest pixaa; add to this one
- * \param[in] paas [optional] source pixaa; add from this one
- * \param[in] istart starting index in pixaas
- * \param[in] iend ending index in pixaas; use -1 to cat all
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This appends a clone of each indicated pixa in paas to pixaad
- * (2) istart < 0 is taken to mean 'read from the start' (istart = 0)
- * (3) iend < 0 means 'read to the end'
- *
- */
-l_ok
-pixaaJoin(PIXAA *paad,
- PIXAA *paas,
- l_int32 istart,
- l_int32 iend)
-{
-l_int32 i, n;
-PIXA *pixa;
-
- PROCNAME("pixaaJoin");
-
- if (!paad)
- return ERROR_INT("pixaad not defined", procName, 1);
- if (!paas)
- return 0;
-
- if (istart < 0)
- istart = 0;
- n = pixaaGetCount(paas, NULL);
- if (iend < 0 || iend >= n)
- iend = n - 1;
- if (istart > iend)
- return ERROR_INT("istart > iend; nothing to add", procName, 1);
-
- for (i = istart; i <= iend; i++) {
- pixa = pixaaGetPixa(paas, i, L_CLONE);
- pixaaAddPixa(paad, pixa, L_INSERT);
- }
-
- return 0;
-}
-
-
-/*---------------------------------------------------------------------*
- * Pixaa creation and destruction *
- *---------------------------------------------------------------------*/
-/*!
- * \brief pixaaCreate()
- *
- * \param[in] n initial number of pixa ptrs
- * \return paa, or NULL on error
- *
- *
- * Notes:
- * (1) A pixaa provides a 2-level hierarchy of images.
- * A common use is for segmentation masks, which are
- * inexpensive to store in png format.
- * (2) For example, suppose you want a mask for each textline
- * in a two-column page. The textline masks for each column
- * can be represented by a pixa, of which there are 2 in the pixaa.
- * The boxes for the textline mask components within a column
- * can have their origin referred to the column rather than the page.
- * Then the boxa field can be used to represent the two box (regions)
- * for the columns, and the (x,y) components of each box can
- * be used to get the absolute position of the textlines on
- * the page.
- *
- */
-PIXAA *
-pixaaCreate(l_int32 n)
-{
-PIXAA *paa;
-
- PROCNAME("pixaaCreate");
-
- if (n <= 0 || n > MaxPtrArraySize)
- n = InitialPtrArraySize;
-
- paa = (PIXAA *)LEPT_CALLOC(1, sizeof(PIXAA));
- paa->n = 0;
- paa->nalloc = n;
- if ((paa->pixa = (PIXA **)LEPT_CALLOC(n, sizeof(PIXA *))) == NULL) {
- pixaaDestroy(&paa);
- return (PIXAA *)ERROR_PTR("pixa ptrs not made", procName, NULL);
- }
- paa->boxa = boxaCreate(n);
-
- return paa;
-}
-
-
-/*!
- * \brief pixaaCreateFromPixa()
- *
- * \param[in] pixa
- * \param[in] n number specifying subdivision of pixa
- * \param[in] type L_CHOOSE_CONSECUTIVE, L_CHOOSE_SKIP_BY
- * \param[in] copyflag L_CLONE, L_COPY
- * \return paa, or NULL on error
- *
- *
- * Notes:
- * (1) This subdivides a pixa into a set of smaller pixa that
- * are accumulated into a pixaa.
- * (2) If type == L_CHOOSE_CONSECUTIVE, the first 'n' pix are
- * put in a pixa and added to pixaa, then the next 'n', etc.
- * If type == L_CHOOSE_SKIP_BY, the first pixa is made by
- * aggregating pix[0], pix[n], pix[2*n], etc.
- * (3) The copyflag specifies if each new pix is a copy or a clone.
- *
- */
-PIXAA *
-pixaaCreateFromPixa(PIXA *pixa,
- l_int32 n,
- l_int32 type,
- l_int32 copyflag)
-{
-l_int32 count, i, j, npixa;
-PIX *pix;
-PIXA *pixat;
-PIXAA *paa;
-
- PROCNAME("pixaaCreateFromPixa");
-
- if (!pixa)
- return (PIXAA *)ERROR_PTR("pixa not defined", procName, NULL);
- count = pixaGetCount(pixa);
- if (count == 0)
- return (PIXAA *)ERROR_PTR("no pix in pixa", procName, NULL);
- if (n <= 0)
- return (PIXAA *)ERROR_PTR("n must be > 0", procName, NULL);
- if (type != L_CHOOSE_CONSECUTIVE && type != L_CHOOSE_SKIP_BY)
- return (PIXAA *)ERROR_PTR("invalid type", procName, NULL);
- if (copyflag != L_CLONE && copyflag != L_COPY)
- return (PIXAA *)ERROR_PTR("invalid copyflag", procName, NULL);
-
- if (type == L_CHOOSE_CONSECUTIVE)
- npixa = (count + n - 1) / n;
- else /* L_CHOOSE_SKIP_BY */
- npixa = L_MIN(n, count);
- paa = pixaaCreate(npixa);
- if (type == L_CHOOSE_CONSECUTIVE) {
- for (i = 0; i < count; i++) {
- if (i % n == 0)
- pixat = pixaCreate(n);
- pix = pixaGetPix(pixa, i, copyflag);
- pixaAddPix(pixat, pix, L_INSERT);
- if (i % n == n - 1)
- pixaaAddPixa(paa, pixat, L_INSERT);
- }
- if (i % n != 0)
- pixaaAddPixa(paa, pixat, L_INSERT);
- } else { /* L_CHOOSE_SKIP_BY */
- for (i = 0; i < npixa; i++) {
- pixat = pixaCreate(count / npixa + 1);
- for (j = i; j < count; j += n) {
- pix = pixaGetPix(pixa, j, copyflag);
- pixaAddPix(pixat, pix, L_INSERT);
- }
- pixaaAddPixa(paa, pixat, L_INSERT);
- }
- }
-
- return paa;
-}
-
-
-/*!
- * \brief pixaaDestroy()
- *
- * \param[in,out] ppaa use ptr address so it will be nulled
- * \return void
- */
-void
-pixaaDestroy(PIXAA **ppaa)
-{
-l_int32 i;
-PIXAA *paa;
-
- PROCNAME("pixaaDestroy");
-
- if (ppaa == NULL) {
- L_WARNING("ptr address is NULL!\n", procName);
- return;
- }
-
- if ((paa = *ppaa) == NULL)
- return;
-
- for (i = 0; i < paa->n; i++)
- pixaDestroy(&paa->pixa[i]);
- LEPT_FREE(paa->pixa);
- boxaDestroy(&paa->boxa);
-
- LEPT_FREE(paa);
- *ppaa = NULL;
-
- return;
-}
-
-
-/*---------------------------------------------------------------------*
- * Pixaa addition *
- *---------------------------------------------------------------------*/
-/*!
- * \brief pixaaAddPixa()
- *
- * \param[in] paa
- * \param[in] pixa to be added
- * \param[in] copyflag:
- * L_INSERT inserts the pixa directly;
- * L_COPY makes a new pixa and copies each pix and each box;
- * L_CLONE gives a new handle to the input pixa;
- * L_COPY_CLONE makes a new pixa and inserts clones of
- * all pix and boxes
- * \return 0 if OK; 1 on error
- */
-l_ok
-pixaaAddPixa(PIXAA *paa,
- PIXA *pixa,
- l_int32 copyflag)
-{
-l_int32 n;
-PIXA *pixac;
-
- PROCNAME("pixaaAddPixa");
-
- if (!paa)
- return ERROR_INT("paa not defined", procName, 1);
- if (!pixa)
- return ERROR_INT("pixa not defined", procName, 1);
- if (copyflag != L_INSERT && copyflag != L_COPY &&
- copyflag != L_CLONE && copyflag != L_COPY_CLONE)
- return ERROR_INT("invalid copyflag", procName, 1);
-
- if (copyflag == L_INSERT) {
- pixac = pixa;
- } else {
- if ((pixac = pixaCopy(pixa, copyflag)) == NULL)
- return ERROR_INT("pixac not made", procName, 1);
- }
-
- n = pixaaGetCount(paa, NULL);
- if (n >= paa->nalloc)
- pixaaExtendArray(paa);
- paa->pixa[n] = pixac;
- paa->n++;
-
- return 0;
-}
-
-
-/*!
- * \brief pixaaExtendArray()
- *
- * \param[in] paa
- * \return 0 if OK; 1 on error
- */
-l_ok
-pixaaExtendArray(PIXAA *paa)
-{
- PROCNAME("pixaaExtendArray");
-
- if (!paa)
- return ERROR_INT("paa not defined", procName, 1);
-
- if ((paa->pixa = (PIXA **)reallocNew((void **)&paa->pixa,
- sizeof(PIXA *) * paa->nalloc,
- 2 * sizeof(PIXA *) * paa->nalloc)) == NULL)
- return ERROR_INT("new ptr array not returned", procName, 1);
-
- paa->nalloc = 2 * paa->nalloc;
- return 0;
-}
-
-
-/*!
- * \brief pixaaAddPix()
- *
- * \param[in] paa input paa
- * \param[in] index index of pixa in paa
- * \param[in] pix to be added
- * \param[in] box [optional] to be added
- * \param[in] copyflag L_INSERT, L_COPY, L_CLONE
- * \return 0 if OK; 1 on error
- */
-l_ok
-pixaaAddPix(PIXAA *paa,
- l_int32 index,
- PIX *pix,
- BOX *box,
- l_int32 copyflag)
-{
-PIXA *pixa;
-
- PROCNAME("pixaaAddPix");
-
- if (!paa)
- return ERROR_INT("paa not defined", procName, 1);
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
-
- if ((pixa = pixaaGetPixa(paa, index, L_CLONE)) == NULL)
- return ERROR_INT("pixa not found", procName, 1);
- pixaAddPix(pixa, pix, copyflag);
- if (box) pixaAddBox(pixa, box, copyflag);
- pixaDestroy(&pixa);
- return 0;
-}
-
-
-/*!
- * \brief pixaaAddBox()
- *
- * \param[in] paa
- * \param[in] box
- * \param[in] copyflag L_INSERT, L_COPY, L_CLONE
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) The box can be used, for example, to hold the support region
- * of a pixa that is being added to the pixaa.
- *
- */
-l_ok
-pixaaAddBox(PIXAA *paa,
- BOX *box,
- l_int32 copyflag)
-{
- PROCNAME("pixaaAddBox");
-
- if (!paa)
- return ERROR_INT("paa not defined", procName, 1);
- if (!box)
- return ERROR_INT("box not defined", procName, 1);
- if (copyflag != L_INSERT && copyflag != L_COPY && copyflag != L_CLONE)
- return ERROR_INT("invalid copyflag", procName, 1);
-
- boxaAddBox(paa->boxa, box, copyflag);
- return 0;
-}
-
-
-
-/*---------------------------------------------------------------------*
- * Pixaa accessors *
- *---------------------------------------------------------------------*/
-/*!
- * \brief pixaaGetCount()
- *
- * \param[in] paa
- * \param[out] pna [optional] number of pix in each pixa
- * \return count, or 0 if no pixaa
- *
- *
- * Notes:
- * (1) If paa is empty, a returned na will also be empty.
- *
- */
-l_int32
-pixaaGetCount(PIXAA *paa,
- NUMA **pna)
-{
-l_int32 i, n;
-NUMA *na;
-PIXA *pixa;
-
- PROCNAME("pixaaGetCount");
-
- if (pna) *pna = NULL;
- if (!paa)
- return ERROR_INT("paa not defined", procName, 0);
-
- n = paa->n;
- if (pna) {
- if ((na = numaCreate(n)) == NULL)
- return ERROR_INT("na not made", procName, 0);
- *pna = na;
- for (i = 0; i < n; i++) {
- pixa = pixaaGetPixa(paa, i, L_CLONE);
- numaAddNumber(na, pixaGetCount(pixa));
- pixaDestroy(&pixa);
- }
- }
- return n;
-}
-
-
-/*!
- * \brief pixaaGetPixa()
- *
- * \param[in] paa
- * \param[in] index to the index-th pixa
- * \param[in] accesstype L_COPY, L_CLONE, L_COPY_CLONE
- * \return pixa, or NULL on error
- *
- *
- * Notes:
- * (1) L_COPY makes a new pixa with a copy of every pix
- * (2) L_CLONE just makes a new reference to the pixa,
- * and bumps the counter. You would use this, for example,
- * when you need to extract some data from a pix within a
- * pixa within a pixaa.
- * (3) L_COPY_CLONE makes a new pixa with a clone of every pix
- * and box
- * (4) In all cases, you must invoke pixaDestroy() on the returned pixa
- *
- */
-PIXA *
-pixaaGetPixa(PIXAA *paa,
- l_int32 index,
- l_int32 accesstype)
-{
-PIXA *pixa;
-
- PROCNAME("pixaaGetPixa");
-
- if (!paa)
- return (PIXA *)ERROR_PTR("paa not defined", procName, NULL);
- if (index < 0 || index >= paa->n)
- return (PIXA *)ERROR_PTR("index not valid", procName, NULL);
- if (accesstype != L_COPY && accesstype != L_CLONE &&
- accesstype != L_COPY_CLONE)
- return (PIXA *)ERROR_PTR("invalid accesstype", procName, NULL);
-
- if ((pixa = paa->pixa[index]) == NULL) { /* shouldn't happen! */
- L_ERROR("missing pixa[%d]\n", procName, index);
- return (PIXA *)ERROR_PTR("pixa not found at index", procName, NULL);
- }
- return pixaCopy(pixa, accesstype);
-}
-
-
-/*!
- * \brief pixaaGetBoxa()
- *
- * \param[in] paa
- * \param[in] accesstype L_COPY, L_CLONE
- * \return boxa, or NULL on error
- *
- *
- * Notes:
- * (1) L_COPY returns a copy; L_CLONE returns a new reference to the boxa.
- * (2) In both cases, invoke boxaDestroy() on the returned boxa.
- *
- */
-BOXA *
-pixaaGetBoxa(PIXAA *paa,
- l_int32 accesstype)
-{
- PROCNAME("pixaaGetBoxa");
-
- if (!paa)
- return (BOXA *)ERROR_PTR("paa not defined", procName, NULL);
- if (accesstype != L_COPY && accesstype != L_CLONE)
- return (BOXA *)ERROR_PTR("invalid access type", procName, NULL);
-
- return boxaCopy(paa->boxa, accesstype);
-}
-
-
-/*!
- * \brief pixaaGetPix()
- *
- * \param[in] paa
- * \param[in] index index into the pixa array in the pixaa
- * \param[in] ipix index into the pix array in the pixa
- * \param[in] accessflag L_COPY or L_CLONE
- * \return pix, or NULL on error
- */
-PIX *
-pixaaGetPix(PIXAA *paa,
- l_int32 index,
- l_int32 ipix,
- l_int32 accessflag)
-{
-PIX *pix;
-PIXA *pixa;
-
- PROCNAME("pixaaGetPix");
-
- if ((pixa = pixaaGetPixa(paa, index, L_CLONE)) == NULL)
- return (PIX *)ERROR_PTR("pixa not retrieved", procName, NULL);
- if ((pix = pixaGetPix(pixa, ipix, accessflag)) == NULL)
- L_ERROR("pix not retrieved\n", procName);
- pixaDestroy(&pixa);
- return pix;
-}
-
-
-/*!
- * \brief pixaaVerifyDepth()
- *
- * \param[in] paa
- * \param[out] psame 1 if all pix have the same depth; 0 otherwise
- * \param[out] pmaxd [optional] max depth of all pix in pixaa
- * \return 0 if OK; 1 on error
- *
- *
- * Notes:
- * (1) It is considered to be an error if any pixa have no pix.
- *
- */
-l_ok
-pixaaVerifyDepth(PIXAA *paa,
- l_int32 *psame,
- l_int32 *pmaxd)
-{
-l_int32 i, n, d, maxd, same, samed;
-PIXA *pixa;
-
- PROCNAME("pixaaVerifyDepth");
-
- if (pmaxd) *pmaxd = 0;
- if (!psame)
- return ERROR_INT("psame not defined", procName, 1);
- *psame = 0;
- if (!paa)
- return ERROR_INT("paa not defined", procName, 1);
- if ((n = pixaaGetCount(paa, NULL)) == 0)
- return ERROR_INT("no pixa in paa", procName, 1);
-
- pixa = pixaaGetPixa(paa, 0, L_CLONE);
- pixaVerifyDepth(pixa, &same, &maxd); /* init same, maxd with first pixa */
- pixaDestroy(&pixa);
- for (i = 1; i < n; i++) {
- pixa = pixaaGetPixa(paa, i, L_CLONE);
- pixaVerifyDepth(pixa, &samed, &d);
- pixaDestroy(&pixa);
- maxd = L_MAX(maxd, d);
- if (!samed || maxd != d)
- same = 0;
- }
- *psame = same;
- if (pmaxd) *pmaxd = maxd;
- return 0;
-}
-
-
-/*!
- * \brief pixaaVerifyDimensions()
- *
- * \param[in] paa
- * \param[out] psame 1 if all pix have the same depth; 0 otherwise
- * \param[out] pmaxw [optional] max width of all pix in pixaa
- * \param[out] pmaxh [optional] max height of all pix in pixaa
- * \return 0 if OK; 1 on error
- *
- *
- * Notes:
- * (1) It is considered to be an error if any pixa have no pix.
- *
- */
-l_ok
-pixaaVerifyDimensions(PIXAA *paa,
- l_int32 *psame,
- l_int32 *pmaxw,
- l_int32 *pmaxh)
-{
-l_int32 i, n, w, h, maxw, maxh, same, same2;
-PIXA *pixa;
-
- PROCNAME("pixaaVerifyDimensions");
-
- if (pmaxw) *pmaxw = 0;
- if (pmaxh) *pmaxh = 0;
- if (!psame)
- return ERROR_INT("psame not defined", procName, 1);
- *psame = 0;
- if (!paa)
- return ERROR_INT("paa not defined", procName, 1);
- if ((n = pixaaGetCount(paa, NULL)) == 0)
- return ERROR_INT("no pixa in paa", procName, 1);
-
- /* Init same; init maxw and maxh from first pixa */
- pixa = pixaaGetPixa(paa, 0, L_CLONE);
- pixaVerifyDimensions(pixa, &same, &maxw, &maxh);
- pixaDestroy(&pixa);
-
- for (i = 1; i < n; i++) {
- pixa = pixaaGetPixa(paa, i, L_CLONE);
- pixaVerifyDimensions(pixa, &same2, &w, &h);
- pixaDestroy(&pixa);
- maxw = L_MAX(maxw, w);
- maxh = L_MAX(maxh, h);
- if (!same2 || maxw != w || maxh != h)
- same = 0;
- }
- *psame = same;
- if (pmaxw) *pmaxw = maxw;
- if (pmaxh) *pmaxh = maxh;
- return 0;
-}
-
-
-/*!
- * \brief pixaaIsFull()
- *
- * \param[in] paa
- * \param[out] pfull 1 if all pixa in the paa have full pix arrays
- * \return return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) Does not require boxa associated with each pixa to be full.
- *
- */
-l_int32
-pixaaIsFull(PIXAA *paa,
- l_int32 *pfull)
-{
-l_int32 i, n, full;
-PIXA *pixa;
-
- PROCNAME("pixaaIsFull");
-
- if (!pfull)
- return ERROR_INT("&full not defined", procName, 0);
- *pfull = 0;
- if (!paa)
- return ERROR_INT("paa not defined", procName, 0);
-
- n = pixaaGetCount(paa, NULL);
- full = 1;
- for (i = 0; i < n; i++) {
- pixa = pixaaGetPixa(paa, i, L_CLONE);
- pixaIsFull(pixa, &full, NULL);
- pixaDestroy(&pixa);
- if (!full) break;
- }
- *pfull = full;
- return 0;
-}
-
-
-/*---------------------------------------------------------------------*
- * Pixaa array modifiers *
- *---------------------------------------------------------------------*/
-/*!
- * \brief pixaaInitFull()
- *
- * \param[in] paa typically empty
- * \param[in] pixa to be replicated into the entire pixa ptr array
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This initializes a pixaa by filling up the entire pixa ptr array
- * with copies of %pixa. Any existing pixa are destroyed.
- * (2) Example usage. This function is useful to prepare for a
- * random insertion (or replacement) of pixa into a pixaa.
- * To randomly insert pixa into a pixaa, up to some index "max":
- * Pixaa *paa = pixaaCreate(max);
- * Pixa *pixa = pixaCreate(1); // if you want little memory
- * pixaaInitFull(paa, pixa); // copy it to entire array
- * pixaDestroy(&pixa); // no longer needed
- * The initialization allows the pixaa to always be properly filled.
- *
- */
-l_ok
-pixaaInitFull(PIXAA *paa,
- PIXA *pixa)
-{
-l_int32 i, n;
-PIXA *pixat;
-
- PROCNAME("pixaaInitFull");
-
- if (!paa)
- return ERROR_INT("paa not defined", procName, 1);
- if (!pixa)
- return ERROR_INT("pixa not defined", procName, 1);
-
- n = paa->nalloc;
- paa->n = n;
- for (i = 0; i < n; i++) {
- pixat = pixaCopy(pixa, L_COPY);
- pixaaReplacePixa(paa, i, pixat);
- }
-
- return 0;
-}
-
-
-/*!
- * \brief pixaaReplacePixa()
- *
- * \param[in] paa
- * \param[in] index to the index-th pixa
- * \param[in] pixa insert to replace existing one
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This allows random insertion of a pixa into a pixaa, with
- * destruction of any existing pixa at that location.
- * The input pixa is now owned by the pixaa.
- * (2) No other pixa in the array are affected.
- * (3) The index must be within the allowed set.
- *
- */
-l_ok
-pixaaReplacePixa(PIXAA *paa,
- l_int32 index,
- PIXA *pixa)
-{
-
- PROCNAME("pixaaReplacePixa");
-
- if (!paa)
- return ERROR_INT("paa not defined", procName, 1);
- if (index < 0 || index >= paa->n)
- return ERROR_INT("index not valid", procName, 1);
- if (!pixa)
- return ERROR_INT("pixa not defined", procName, 1);
-
- pixaDestroy(&(paa->pixa[index]));
- paa->pixa[index] = pixa;
- return 0;
-}
-
-
-/*!
- * \brief pixaaClear()
- *
- * \param[in] paa
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This destroys all pixa in the pixaa, and nulls the ptrs
- * in the pixa ptr array.
- *
- */
-l_ok
-pixaaClear(PIXAA *paa)
-{
-l_int32 i, n;
-
- PROCNAME("pixaClear");
-
- if (!paa)
- return ERROR_INT("paa not defined", procName, 1);
-
- n = pixaaGetCount(paa, NULL);
- for (i = 0; i < n; i++)
- pixaDestroy(&paa->pixa[i]);
- paa->n = 0;
- return 0;
-}
-
-
-/*!
- * \brief pixaaTruncate()
- *
- * \param[in] paa
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This identifies the largest index containing a pixa that
- * has any pix within it, destroys all pixa above that index,
- * and resets the count.
- *
- */
-l_ok
-pixaaTruncate(PIXAA *paa)
-{
-l_int32 i, n, np;
-PIXA *pixa;
-
- PROCNAME("pixaaTruncate");
-
- if (!paa)
- return ERROR_INT("paa not defined", procName, 1);
-
- n = pixaaGetCount(paa, NULL);
- for (i = n - 1; i >= 0; i--) {
- pixa = pixaaGetPixa(paa, i, L_CLONE);
- if (!pixa) {
- paa->n--;
- continue;
- }
- np = pixaGetCount(pixa);
- pixaDestroy(&pixa);
- if (np == 0) {
- pixaDestroy(&paa->pixa[i]);
- paa->n--;
- } else {
- break;
- }
- }
- return 0;
-}
-
-
-
-/*---------------------------------------------------------------------*
- * Pixa serialized I/O *
- *---------------------------------------------------------------------*/
-/*!
- * \brief pixaRead()
- *
- * \param[in] filename
- * \return pixa, or NULL on error
- *
- *
- * Notes:
- * (1) The pix are stored in the file as png.
- * If the png library is not linked, this will fail.
- *
- */
-PIXA *
-pixaRead(const char *filename)
-{
-FILE *fp;
-PIXA *pixa;
-
- PROCNAME("pixaRead");
-
-#if !HAVE_LIBPNG /* defined in environ.h and config_auto.h */
- return (PIXA *)ERROR_PTR("no libpng: can't read data", procName, NULL);
-#endif /* !HAVE_LIBPNG */
-
- if (!filename)
- return (PIXA *)ERROR_PTR("filename not defined", procName, NULL);
-
- if ((fp = fopenReadStream(filename)) == NULL)
- return (PIXA *)ERROR_PTR("stream not opened", procName, NULL);
- pixa = pixaReadStream(fp);
- fclose(fp);
- if (!pixa)
- return (PIXA *)ERROR_PTR("pixa not read", procName, NULL);
- return pixa;
-}
-
-
-/*!
- * \brief pixaReadStream()
- *
- * \param[in] fp file stream
- * \return pixa, or NULL on error
- *
- *
- * Notes:
- * (1) The pix are stored in the file as png.
- * If the png library is not linked, this will fail.
- *
- */
-PIXA *
-pixaReadStream(FILE *fp)
-{
-l_int32 n, i, xres, yres, version;
-l_int32 ignore;
-BOXA *boxa;
-PIX *pix;
-PIXA *pixa;
-
- PROCNAME("pixaReadStream");
-
-#if !HAVE_LIBPNG /* defined in environ.h and config_auto.h */
- return (PIXA *)ERROR_PTR("no libpng: can't read data", procName, NULL);
-#endif /* !HAVE_LIBPNG */
-
- if (!fp)
- return (PIXA *)ERROR_PTR("stream not defined", procName, NULL);
-
- if (fscanf(fp, "\nPixa Version %d\n", &version) != 1)
- return (PIXA *)ERROR_PTR("not a pixa file", procName, NULL);
- if (version != PIXA_VERSION_NUMBER)
- return (PIXA *)ERROR_PTR("invalid pixa version", procName, NULL);
- if (fscanf(fp, "Number of pix = %d\n", &n) != 1)
- return (PIXA *)ERROR_PTR("not a pixa file", procName, NULL);
-
- if ((boxa = boxaReadStream(fp)) == NULL)
- return (PIXA *)ERROR_PTR("boxa not made", procName, NULL);
- if ((pixa = pixaCreate(n)) == NULL) {
- boxaDestroy(&boxa);
- return (PIXA *)ERROR_PTR("pixa not made", procName, NULL);
- }
- boxaDestroy(&pixa->boxa);
- pixa->boxa = boxa;
-
- for (i = 0; i < n; i++) {
- if ((fscanf(fp, " pix[%d]: xres = %d, yres = %d\n",
- &ignore, &xres, &yres)) != 3) {
- pixaDestroy(&pixa);
- return (PIXA *)ERROR_PTR("res reading error", procName, NULL);
- }
- if ((pix = pixReadStreamPng(fp)) == NULL) {
- pixaDestroy(&pixa);
- return (PIXA *)ERROR_PTR("pix not read", procName, NULL);
- }
- pixSetXRes(pix, xres);
- pixSetYRes(pix, yres);
- pixaAddPix(pixa, pix, L_INSERT);
- }
- return pixa;
-}
-
-
-/*!
- * \brief pixaReadMem()
- *
- * \param[in] data of serialized pixa
- * \param[in] size of data in bytes
- * \return pixa, or NULL on error
- */
-PIXA *
-pixaReadMem(const l_uint8 *data,
- size_t size)
-{
-FILE *fp;
-PIXA *pixa;
-
- PROCNAME("pixaReadMem");
-
- if (!data)
- return (PIXA *)ERROR_PTR("data not defined", procName, NULL);
- if ((fp = fopenReadFromMemory(data, size)) == NULL)
- return (PIXA *)ERROR_PTR("stream not opened", procName, NULL);
-
- pixa = pixaReadStream(fp);
- fclose(fp);
- if (!pixa) L_ERROR("pixa not read\n", procName);
- return pixa;
-}
-
-
-/*!
- * \brief pixaWriteDebug()
- *
- * \param[in] fname
- * \param[in] pixa
- * \return 0 if OK; 1 on error
- *
- *
- * Notes:
- * (1) Debug version, intended for use in the library when writing
- * to files in a temp directory with names that are compiled in.
- * This is used instead of pixaWrite() for all such library calls.
- * (2) The global variable LeptDebugOK defaults to 0, and can be set
- * or cleared by the function setLeptDebugOK().
- *
- */
-l_ok
-pixaWriteDebug(const char *fname,
- PIXA *pixa)
-{
- PROCNAME("pixaWriteDebug");
-
- if (LeptDebugOK) {
- return pixaWrite(fname, pixa);
- } else {
- L_INFO("write to named temp file %s is disabled\n", procName, fname);
- return 0;
- }
-}
-
-
-/*!
- * \brief pixaWrite()
- *
- * \param[in] filename
- * \param[in] pixa
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) The pix are stored in the file as png.
- * If the png library is not linked, this will fail.
- *
- */
-l_ok
-pixaWrite(const char *filename,
- PIXA *pixa)
-{
-l_int32 ret;
-FILE *fp;
-
- PROCNAME("pixaWrite");
-
-#if !HAVE_LIBPNG /* defined in environ.h and config_auto.h */
- return ERROR_INT("no libpng: can't write data", procName, 1);
-#endif /* !HAVE_LIBPNG */
-
- if (!filename)
- return ERROR_INT("filename not defined", procName, 1);
- if (!pixa)
- return ERROR_INT("pixa not defined", procName, 1);
-
- if ((fp = fopenWriteStream(filename, "wb")) == NULL)
- return ERROR_INT("stream not opened", procName, 1);
- ret = pixaWriteStream(fp, pixa);
- fclose(fp);
- if (ret)
- return ERROR_INT("pixa not written to stream", procName, 1);
- return 0;
-}
-
-
-/*!
- * \brief pixaWriteStream()
- *
- * \param[in] fp file stream opened for "wb"
- * \param[in] pixa
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) The pix are stored in the file as png.
- * If the png library is not linked, this will fail.
- *
- */
-l_ok
-pixaWriteStream(FILE *fp,
- PIXA *pixa)
-{
-l_int32 n, i;
-PIX *pix;
-
- PROCNAME("pixaWriteStream");
-
-#if !HAVE_LIBPNG /* defined in environ.h and config_auto.h */
- return ERROR_INT("no libpng: can't write data", procName, 1);
-#endif /* !HAVE_LIBPNG */
-
- if (!fp)
- return ERROR_INT("stream not defined", procName, 1);
- if (!pixa)
- return ERROR_INT("pixa not defined", procName, 1);
-
- n = pixaGetCount(pixa);
- fprintf(fp, "\nPixa Version %d\n", PIXA_VERSION_NUMBER);
- fprintf(fp, "Number of pix = %d\n", n);
- boxaWriteStream(fp, pixa->boxa);
- for (i = 0; i < n; i++) {
- if ((pix = pixaGetPix(pixa, i, L_CLONE)) == NULL)
- return ERROR_INT("pix not found", procName, 1);
- fprintf(fp, " pix[%d]: xres = %d, yres = %d\n",
- i, pix->xres, pix->yres);
- pixWriteStreamPng(fp, pix, 0.0);
- pixDestroy(&pix);
- }
- return 0;
-}
-
-
-/*!
- * \brief pixaWriteMem()
- *
- * \param[out] pdata data of serialized pixa
- * \param[out] psize size of returned data
- * \param[in] pixa
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) Serializes a pixa in memory and puts the result in a buffer.
- *
- */
-l_ok
-pixaWriteMem(l_uint8 **pdata,
- size_t *psize,
- PIXA *pixa)
-{
-l_int32 ret;
-FILE *fp;
-
- PROCNAME("pixaWriteMem");
-
- if (pdata) *pdata = NULL;
- if (psize) *psize = 0;
- if (!pdata)
- return ERROR_INT("&data not defined", procName, 1);
- if (!psize)
- return ERROR_INT("&size not defined", procName, 1);
- if (!pixa)
- return ERROR_INT("pixa not defined", procName, 1);
-
-#if HAVE_FMEMOPEN
- if ((fp = open_memstream((char **)pdata, psize)) == NULL)
- return ERROR_INT("stream not opened", procName, 1);
- ret = pixaWriteStream(fp, pixa);
-#else
- L_INFO("work-around: writing to a temp file\n", procName);
- #ifdef _WIN32
- if ((fp = fopenWriteWinTempfile()) == NULL)
- return ERROR_INT("tmpfile stream not opened", procName, 1);
- #else
- if ((fp = tmpfile()) == NULL)
- return ERROR_INT("tmpfile stream not opened", procName, 1);
- #endif /* _WIN32 */
- ret = pixaWriteStream(fp, pixa);
- rewind(fp);
- *pdata = l_binaryReadStream(fp, psize);
-#endif /* HAVE_FMEMOPEN */
- fclose(fp);
- return ret;
-}
-
-
-/*!
- * \brief pixaReadBoth()
- *
- * \param[in] filename
- * \return pixa, or NULL on error
- *
- *
- * Notes:
- * (1) This reads serialized files of either a pixa or a pixacomp,
- * and returns a pixa in memory. It requires png and jpeg libraries.
- *
- */
-PIXA *
-pixaReadBoth(const char *filename)
-{
-char buf[32];
-char *sname;
-PIXA *pixa;
-PIXAC *pac;
-
- PROCNAME("pixaReadBoth");
-
- if (!filename)
- return (PIXA *)ERROR_PTR("filename not defined", procName, NULL);
-
- l_getStructStrFromFile(filename, L_STR_NAME, &sname);
- if (!sname)
- return (PIXA *)ERROR_PTR("struct name not found", procName, NULL);
- snprintf(buf, sizeof(buf), "%s", sname);
- LEPT_FREE(sname);
-
- if (strcmp(buf, "Pixacomp") == 0) {
- if ((pac = pixacompRead(filename)) == NULL)
- return (PIXA *)ERROR_PTR("pac not made", procName, NULL);
- pixa = pixaCreateFromPixacomp(pac, L_COPY);
- pixacompDestroy(&pac);
- } else if (strcmp(buf, "Pixa") == 0) {
- if ((pixa = pixaRead(filename)) == NULL)
- return (PIXA *)ERROR_PTR("pixa not made", procName, NULL);
- } else {
- return (PIXA *)ERROR_PTR("invalid file type", procName, NULL);
- }
- return pixa;
-}
-
-
-/*---------------------------------------------------------------------*
- * Pixaa serialized I/O *
- *---------------------------------------------------------------------*/
-/*!
- * \brief pixaaReadFromFiles()
- *
- * \param[in] dirname directory
- * \param[in] substr [optional] substring filter on filenames; can be NULL
- * \param[in] first 0-based
- * \param[in] nfiles use 0 for everything from %first to the end
- * \return paa, or NULL on error or if no pixa files are found.
- *
- *
- * Notes:
- * (1) The files must be serialized pixa files (e.g., *.pa)
- * If some files cannot be read, warnings are issued.
- * (2) Use %substr to filter filenames in the directory. If
- * %substr == NULL, this takes all files.
- * (3) After filtering, use %first and %nfiles to select
- * a contiguous set of files, that have been lexically
- * sorted in increasing order.
- *
- */
-PIXAA *
-pixaaReadFromFiles(const char *dirname,
- const char *substr,
- l_int32 first,
- l_int32 nfiles)
-{
-char *fname;
-l_int32 i, n;
-PIXA *pixa;
-PIXAA *paa;
-SARRAY *sa;
-
- PROCNAME("pixaaReadFromFiles");
-
- if (!dirname)
- return (PIXAA *)ERROR_PTR("dirname not defined", procName, NULL);
-
- sa = getSortedPathnamesInDirectory(dirname, substr, first, nfiles);
- if (!sa || ((n = sarrayGetCount(sa)) == 0)) {
- sarrayDestroy(&sa);
- return (PIXAA *)ERROR_PTR("no pixa files found", procName, NULL);
- }
-
- paa = pixaaCreate(n);
- for (i = 0; i < n; i++) {
- fname = sarrayGetString(sa, i, L_NOCOPY);
- if ((pixa = pixaRead(fname)) == NULL) {
- L_ERROR("pixa not read for %d-th file", procName, i);
- continue;
- }
- pixaaAddPixa(paa, pixa, L_INSERT);
- }
-
- sarrayDestroy(&sa);
- return paa;
-}
-
-
-/*!
- * \brief pixaaRead()
- *
- * \param[in] filename
- * \return paa, or NULL on error
- *
- *
- * Notes:
- * (1) The pix are stored in the file as png.
- * If the png library is not linked, this will fail.
- *
- */
-PIXAA *
-pixaaRead(const char *filename)
-{
-FILE *fp;
-PIXAA *paa;
-
- PROCNAME("pixaaRead");
-
-#if !HAVE_LIBPNG /* defined in environ.h and config_auto.h */
- return (PIXAA *)ERROR_PTR("no libpng: can't read data", procName, NULL);
-#endif /* !HAVE_LIBPNG */
-
- if (!filename)
- return (PIXAA *)ERROR_PTR("filename not defined", procName, NULL);
-
- if ((fp = fopenReadStream(filename)) == NULL)
- return (PIXAA *)ERROR_PTR("stream not opened", procName, NULL);
- paa = pixaaReadStream(fp);
- fclose(fp);
- if (!paa)
- return (PIXAA *)ERROR_PTR("paa not read", procName, NULL);
- return paa;
-}
-
-
-/*!
- * \brief pixaaReadStream()
- *
- * \param[in] fp file stream
- * \return paa, or NULL on error
- *
- *
- * Notes:
- * (1) The pix are stored in the file as png.
- * If the png library is not linked, this will fail.
- *
- */
-PIXAA *
-pixaaReadStream(FILE *fp)
-{
-l_int32 n, i, version;
-l_int32 ignore;
-BOXA *boxa;
-PIXA *pixa;
-PIXAA *paa;
-
- PROCNAME("pixaaReadStream");
-
-#if !HAVE_LIBPNG /* defined in environ.h and config_auto.h */
- return (PIXAA *)ERROR_PTR("no libpng: can't read data", procName, NULL);
-#endif /* !HAVE_LIBPNG */
-
- if (!fp)
- return (PIXAA *)ERROR_PTR("stream not defined", procName, NULL);
-
- if (fscanf(fp, "\nPixaa Version %d\n", &version) != 1)
- return (PIXAA *)ERROR_PTR("not a pixaa file", procName, NULL);
- if (version != PIXAA_VERSION_NUMBER)
- return (PIXAA *)ERROR_PTR("invalid pixaa version", procName, NULL);
- if (fscanf(fp, "Number of pixa = %d\n", &n) != 1)
- return (PIXAA *)ERROR_PTR("not a pixaa file", procName, NULL);
-
- if ((paa = pixaaCreate(n)) == NULL)
- return (PIXAA *)ERROR_PTR("paa not made", procName, NULL);
- if ((boxa = boxaReadStream(fp)) == NULL) {
- pixaaDestroy(&paa);
- return (PIXAA *)ERROR_PTR("boxa not made", procName, NULL);
- }
- boxaDestroy(&paa->boxa);
- paa->boxa = boxa;
-
- for (i = 0; i < n; i++) {
- if ((fscanf(fp, "\n\n --------------- pixa[%d] ---------------\n",
- &ignore)) != 1) {
- pixaaDestroy(&paa);
- return (PIXAA *)ERROR_PTR("text reading", procName, NULL);
- }
- if ((pixa = pixaReadStream(fp)) == NULL) {
- pixaaDestroy(&paa);
- return (PIXAA *)ERROR_PTR("pixa not read", procName, NULL);
- }
- pixaaAddPixa(paa, pixa, L_INSERT);
- }
-
- return paa;
-}
-
-
-/*!
- * \brief pixaaReadMem()
- *
- * \param[in] data of serialized pixaa
- * \param[in] size of data in bytes
- * \return paa, or NULL on error
- */
-PIXAA *
-pixaaReadMem(const l_uint8 *data,
- size_t size)
-{
-FILE *fp;
-PIXAA *paa;
-
- PROCNAME("paaReadMem");
-
- if (!data)
- return (PIXAA *)ERROR_PTR("data not defined", procName, NULL);
- if ((fp = fopenReadFromMemory(data, size)) == NULL)
- return (PIXAA *)ERROR_PTR("stream not opened", procName, NULL);
-
- paa = pixaaReadStream(fp);
- fclose(fp);
- if (!paa) L_ERROR("paa not read\n", procName);
- return paa;
-}
-
-
-/*!
- * \brief pixaaWrite()
- *
- * \param[in] filename
- * \param[in] paa
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) The pix are stored in the file as png.
- * If the png library is not linked, this will fail.
- *
- */
-l_ok
-pixaaWrite(const char *filename,
- PIXAA *paa)
-{
-l_int32 ret;
-FILE *fp;
-
- PROCNAME("pixaaWrite");
-
-#if !HAVE_LIBPNG /* defined in environ.h and config_auto.h */
- return ERROR_INT("no libpng: can't read data", procName, 1);
-#endif /* !HAVE_LIBPNG */
-
- if (!filename)
- return ERROR_INT("filename not defined", procName, 1);
- if (!paa)
- return ERROR_INT("paa not defined", procName, 1);
-
- if ((fp = fopenWriteStream(filename, "wb")) == NULL)
- return ERROR_INT("stream not opened", procName, 1);
- ret = pixaaWriteStream(fp, paa);
- fclose(fp);
- if (ret)
- return ERROR_INT("paa not written to stream", procName, 1);
- return 0;
-}
-
-
-/*!
- * \brief pixaaWriteStream()
- *
- * \param[in] fp file stream opened for "wb"
- * \param[in] paa
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) The pix are stored in the file as png.
- * If the png library is not linked, this will fail.
- *
- */
-l_ok
-pixaaWriteStream(FILE *fp,
- PIXAA *paa)
-{
-l_int32 n, i;
-PIXA *pixa;
-
- PROCNAME("pixaaWriteStream");
-
-#if !HAVE_LIBPNG /* defined in environ.h and config_auto.h */
- return ERROR_INT("no libpng: can't read data", procName, 1);
-#endif /* !HAVE_LIBPNG */
-
- if (!fp)
- return ERROR_INT("stream not defined", procName, 1);
- if (!paa)
- return ERROR_INT("paa not defined", procName, 1);
-
- n = pixaaGetCount(paa, NULL);
- fprintf(fp, "\nPixaa Version %d\n", PIXAA_VERSION_NUMBER);
- fprintf(fp, "Number of pixa = %d\n", n);
- boxaWriteStream(fp, paa->boxa);
- for (i = 0; i < n; i++) {
- if ((pixa = pixaaGetPixa(paa, i, L_CLONE)) == NULL)
- return ERROR_INT("pixa not found", procName, 1);
- fprintf(fp, "\n\n --------------- pixa[%d] ---------------\n", i);
- pixaWriteStream(fp, pixa);
- pixaDestroy(&pixa);
- }
- return 0;
-}
-
-
-/*!
- * \brief pixaaWriteMem()
- *
- * \param[out] pdata data of serialized pixaa
- * \param[out] psize size of returned data
- * \param[in] paa
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) Serializes a pixaa in memory and puts the result in a buffer.
- *
- */
-l_ok
-pixaaWriteMem(l_uint8 **pdata,
- size_t *psize,
- PIXAA *paa)
-{
-l_int32 ret;
-FILE *fp;
-
- PROCNAME("pixaaWriteMem");
-
- if (pdata) *pdata = NULL;
- if (psize) *psize = 0;
- if (!pdata)
- return ERROR_INT("&data not defined", procName, 1);
- if (!psize)
- return ERROR_INT("&size not defined", procName, 1);
- if (!paa)
- return ERROR_INT("paa not defined", procName, 1);
-
-#if HAVE_FMEMOPEN
- if ((fp = open_memstream((char **)pdata, psize)) == NULL)
- return ERROR_INT("stream not opened", procName, 1);
- ret = pixaaWriteStream(fp, paa);
-#else
- L_INFO("work-around: writing to a temp file\n", procName);
- #ifdef _WIN32
- if ((fp = fopenWriteWinTempfile()) == NULL)
- return ERROR_INT("tmpfile stream not opened", procName, 1);
- #else
- if ((fp = tmpfile()) == NULL)
- return ERROR_INT("tmpfile stream not opened", procName, 1);
- #endif /* _WIN32 */
- ret = pixaaWriteStream(fp, paa);
- rewind(fp);
- *pdata = l_binaryReadStream(fp, psize);
-#endif /* HAVE_FMEMOPEN */
- fclose(fp);
- return ret;
-}
-
diff --git a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pixacc.c b/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pixacc.c
deleted file mode 100644
index fbf54ba8..00000000
--- a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pixacc.c
+++ /dev/null
@@ -1,356 +0,0 @@
-/*====================================================================*
- - Copyright (C) 2001 Leptonica. All rights reserved.
- -
- - Redistribution and use in source and binary forms, with or without
- - modification, are permitted provided that the following conditions
- - are met:
- - 1. Redistributions of source code must retain the above copyright
- - notice, this list of conditions and the following disclaimer.
- - 2. Redistributions in binary form must reproduce the above
- - copyright notice, this list of conditions and the following
- - disclaimer in the documentation and/or other materials
- - provided with the distribution.
- -
- - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- - ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- - LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- - A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL ANY
- - CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
- - EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
- - PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
- - PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
- - OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
- - NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- *====================================================================*/
-
-/*!
- * \file pixacc.c
- *
- *
- * Pixacc creation, destruction
- * PIXACC *pixaccCreate()
- * PIXACC *pixaccCreateFromPix()
- * void pixaccDestroy()
- *
- * Pixacc finalization
- * PIX *pixaccFinal()
- *
- * Pixacc accessors
- * PIX *pixaccGetPix()
- * l_int32 pixaccGetOffset()
- *
- * Pixacc accumulators
- * l_int32 pixaccAdd()
- * l_int32 pixaccSubtract()
- * l_int32 pixaccMultConst()
- * l_int32 pixaccMultConstAccumulate()
- *
- * This is a simple interface for some of the pixel arithmetic operations
- * in pixarith.c. These are easy to code up, but not as fast as
- * hand-coded functions that do arithmetic on corresponding pixels.
- *
- * Suppose you want to make a linear combination of pix1 and pix2:
- * pixd = 0.4 * pix1 + 0.6 * pix2
- * where pix1 and pix2 are the same size and have depth 'd'. Then:
- * Pixacc *pacc = pixaccCreateFromPix(pix1, 0); // first; addition only
- * pixaccMultConst(pacc, 0.4);
- * pixaccMultConstAccumulate(pacc, pix2, 0.6); // Add in 0.6 of the second
- * pixd = pixaccFinal(pacc, d); // Get the result
- * pixaccDestroy(&pacc);
- *
- */
-
-#ifdef HAVE_CONFIG_H
-#include
-#endif /* HAVE_CONFIG_H */
-
-#include "allheaders.h"
-
-/*---------------------------------------------------------------------*
- * Pixacc creation, destruction *
- *---------------------------------------------------------------------*/
-/*!
- * \brief pixaccCreate()
- *
- * \param[in] w, h of 32 bpp internal Pix
- * \param[in] negflag 0 if only positive numbers are involved;
- * 1 if there will be negative numbers
- * \return pixacc, or NULL on error
- *
- *
- * Notes:
- * (1) Use %negflag = 1 for safety if any negative numbers are going
- * to be used in the chain of operations. Negative numbers
- * arise, e.g., by subtracting a pix, or by adding a pix
- * that has been pre-multiplied by a negative number.
- * (2) Initializes the internal 32 bpp pix, similarly to the
- * initialization in pixInitAccumulate().
- *
- */
-PIXACC *
-pixaccCreate(l_int32 w,
- l_int32 h,
- l_int32 negflag)
-{
-PIXACC *pixacc;
-
- PROCNAME("pixaccCreate");
-
- if ((pixacc = (PIXACC *)LEPT_CALLOC(1, sizeof(PIXACC))) == NULL)
- return (PIXACC *)ERROR_PTR("pixacc not made", procName, NULL);
- pixacc->w = w;
- pixacc->h = h;
-
- if ((pixacc->pix = pixCreate(w, h, 32)) == NULL) {
- pixaccDestroy(&pixacc);
- return (PIXACC *)ERROR_PTR("pix not made", procName, NULL);
- }
-
- if (negflag) {
- pixacc->offset = 0x40000000;
- pixSetAllArbitrary(pixacc->pix, pixacc->offset);
- }
-
- return pixacc;
-}
-
-
-/*!
- * \brief pixaccCreateFromPix()
- *
- * \param[in] pix
- * \param[in] negflag 0 if only positive numbers are involved;
- * 1 if there will be negative numbers
- * \return pixacc, or NULL on error
- *
- *
- * Notes:
- * (1) See pixaccCreate()
- *
- */
-PIXACC *
-pixaccCreateFromPix(PIX *pix,
- l_int32 negflag)
-{
-l_int32 w, h;
-PIXACC *pixacc;
-
- PROCNAME("pixaccCreateFromPix");
-
- if (!pix)
- return (PIXACC *)ERROR_PTR("pix not defined", procName, NULL);
-
- pixGetDimensions(pix, &w, &h, NULL);
- pixacc = pixaccCreate(w, h, negflag);
- pixaccAdd(pixacc, pix);
- return pixacc;
-}
-
-
-/*!
- * \brief pixaccDestroy()
- *
- * \param[in,out] ppixacc will be set to null before returning
- * \return void
- *
- *
- * Notes:
- * (1) Always nulls the input ptr.
- *
- */
-void
-pixaccDestroy(PIXACC **ppixacc)
-{
-PIXACC *pixacc;
-
- PROCNAME("pixaccDestroy");
-
- if (ppixacc == NULL) {
- L_WARNING("ptr address is NULL!", procName);
- return;
- }
-
- if ((pixacc = *ppixacc) == NULL)
- return;
-
- pixDestroy(&pixacc->pix);
- LEPT_FREE(pixacc);
- *ppixacc = NULL;
- return;
-}
-
-
-/*---------------------------------------------------------------------*
- * Pixacc finalization *
- *---------------------------------------------------------------------*/
-/*!
- * \brief pixaccFinal()
- *
- * \param[in] pixacc
- * \param[in] outdepth 8, 16 or 32 bpp
- * \return pixd 8, 16 or 32 bpp, or NULL on error
- */
-PIX *
-pixaccFinal(PIXACC *pixacc,
- l_int32 outdepth)
-{
- PROCNAME("pixaccFinal");
-
- if (!pixacc)
- return (PIX *)ERROR_PTR("pixacc not defined", procName, NULL);
-
- return pixFinalAccumulate(pixaccGetPix(pixacc), pixaccGetOffset(pixacc),
- outdepth);
-}
-
-
-/*---------------------------------------------------------------------*
- * Pixacc accessors *
- *---------------------------------------------------------------------*/
-/*!
- * \brief pixaccGetPix()
- *
- * \param[in] pixacc
- * \return pix, or NULL on error
- */
-PIX *
-pixaccGetPix(PIXACC *pixacc)
-{
- PROCNAME("pixaccGetPix");
-
- if (!pixacc)
- return (PIX *)ERROR_PTR("pixacc not defined", procName, NULL);
- return pixacc->pix;
-}
-
-
-/*!
- * \brief pixaccGetOffset()
- *
- * \param[in] pixacc
- * \return offset, or -1 on error
- */
-l_int32
-pixaccGetOffset(PIXACC *pixacc)
-{
- PROCNAME("pixaccGetOffset");
-
- if (!pixacc)
- return ERROR_INT("pixacc not defined", procName, -1);
- return pixacc->offset;
-}
-
-
-/*---------------------------------------------------------------------*
- * Pixacc accumulators *
- *---------------------------------------------------------------------*/
-/*!
- * \brief pixaccAdd()
- *
- * \param[in] pixacc
- * \param[in] pix to be added
- * \return 0 if OK, 1 on error
- */
-l_ok
-pixaccAdd(PIXACC *pixacc,
- PIX *pix)
-{
- PROCNAME("pixaccAdd");
-
- if (!pixacc)
- return ERROR_INT("pixacc not defined", procName, 1);
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
- pixAccumulate(pixaccGetPix(pixacc), pix, L_ARITH_ADD);
- return 0;
-}
-
-
-/*!
- * \brief pixaccSubtract()
- *
- * \param[in] pixacc
- * \param[in] pix to be subtracted
- * \return 0 if OK, 1 on error
- */
-l_ok
-pixaccSubtract(PIXACC *pixacc,
- PIX *pix)
-{
- PROCNAME("pixaccSubtract");
-
- if (!pixacc)
- return ERROR_INT("pixacc not defined", procName, 1);
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
- pixAccumulate(pixaccGetPix(pixacc), pix, L_ARITH_SUBTRACT);
- return 0;
-}
-
-
-/*!
- * \brief pixaccMultConst()
- *
- * \param[in] pixacc
- * \param[in] factor
- * \return 0 if OK, 1 on error
- */
-l_ok
-pixaccMultConst(PIXACC *pixacc,
- l_float32 factor)
-{
- PROCNAME("pixaccMultConst");
-
- if (!pixacc)
- return ERROR_INT("pixacc not defined", procName, 1);
- pixMultConstAccumulate(pixaccGetPix(pixacc), factor,
- pixaccGetOffset(pixacc));
- return 0;
-}
-
-
-/*!
- * \brief pixaccMultConstAccumulate()
- *
- * \param[in] pixacc
- * \param[in] pix
- * \param[in] factor
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This creates a temp pix that is %pix multiplied by the
- * constant %factor. It then adds that into %pixacc.
- *
- */
-l_ok
-pixaccMultConstAccumulate(PIXACC *pixacc,
- PIX *pix,
- l_float32 factor)
-{
-l_int32 w, h, d, negflag;
-PIX *pixt;
-PIXACC *pacct;
-
- PROCNAME("pixaccMultConstAccumulate");
-
- if (!pixacc)
- return ERROR_INT("pixacc not defined", procName, 1);
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
-
- if (factor == 0.0) return 0;
-
- pixGetDimensions(pix, &w, &h, &d);
- negflag = (factor > 0.0) ? 0 : 1;
- pacct = pixaccCreate(w, h, negflag);
- pixaccAdd(pacct, pix);
- pixaccMultConst(pacct, factor);
- pixt = pixaccFinal(pacct, d);
- pixaccAdd(pixacc, pixt);
-
- pixaccDestroy(&pacct);
- pixDestroy(&pixt);
- return 0;
-}
diff --git a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pixafunc1.c b/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pixafunc1.c
deleted file mode 100644
index 7c9547be..00000000
--- a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pixafunc1.c
+++ /dev/null
@@ -1,2975 +0,0 @@
-/*====================================================================*
- - Copyright (C) 2001 Leptonica. All rights reserved.
- -
- - Redistribution and use in source and binary forms, with or without
- - modification, are permitted provided that the following conditions
- - are met:
- - 1. Redistributions of source code must retain the above copyright
- - notice, this list of conditions and the following disclaimer.
- - 2. Redistributions in binary form must reproduce the above
- - copyright notice, this list of conditions and the following
- - disclaimer in the documentation and/or other materials
- - provided with the distribution.
- -
- - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- - ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- - LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- - A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL ANY
- - CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
- - EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
- - PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
- - PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
- - OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
- - NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- *====================================================================*/
-
-/*!
- * \file pixafunc1.c
- *
- *
- * Filters
- * PIX *pixSelectBySize()
- * PIXA *pixaSelectBySize()
- * NUMA *pixaMakeSizeIndicator()
- *
- * PIX *pixSelectByPerimToAreaRatio()
- * PIXA *pixaSelectByPerimToAreaRatio()
- * PIX *pixSelectByPerimSizeRatio()
- * PIXA *pixaSelectByPerimSizeRatio()
- * PIX *pixSelectByAreaFraction()
- * PIXA *pixaSelectByAreaFraction()
- * PIX *pixSelectByWidthHeightRatio()
- * PIXA *pixaSelectByWidthHeightRatio()
- * PIXA *pixaSelectByNumConnComp()
- *
- * PIXA *pixaSelectWithIndicator()
- * l_int32 pixRemoveWithIndicator()
- * l_int32 pixAddWithIndicator()
- * PIXA *pixaSelectWithString()
- * PIX *pixaRenderComponent()
- *
- * Sort functions
- * PIXA *pixaSort()
- * PIXA *pixaBinSort()
- * PIXA *pixaSortByIndex()
- * PIXAA *pixaSort2dByIndex()
- *
- * Pixa and Pixaa range selection
- * PIXA *pixaSelectRange()
- * PIXAA *pixaaSelectRange()
- *
- * Pixa and Pixaa scaling
- * PIXAA *pixaaScaleToSize()
- * PIXAA *pixaaScaleToSizeVar()
- * PIXA *pixaScaleToSize()
- * PIXA *pixaScaleToSizeRel()
- * PIXA *pixaScale()
- * PIXA *pixaScaleBySampling()
- *
- * Pixa rotation and translation
- * PIXA *pixaRotate()
- * PIXA *pixaRotateOrth()
- * PIXA *pixaTranslate()
- *
- * Miscellaneous
- * PIXA *pixaAddBorderGeneral()
- * PIXA *pixaaFlattenToPixa()
- * l_int32 pixaaSizeRange()
- * l_int32 pixaSizeRange()
- * PIXA *pixaClipToPix()
- * PIXA *pixaClipToForeground()
- * l_int32 pixaGetRenderingDepth()
- * l_int32 pixaHasColor()
- * l_int32 pixaAnyColormaps()
- * l_int32 pixaGetDepthInfo()
- * PIXA *pixaConvertToSameDepth()
- * l_int32 pixaEqual()
- * l_int32 pixaSetFullSizeBoxa()
- *
- */
-
-#ifdef HAVE_CONFIG_H
-#include
-#endif /* HAVE_CONFIG_H */
-
-#include
-#include "allheaders.h"
-
- /* For more than this number of c.c. in a binarized image of
- * semi-perimeter (w + h) about 5000 or less, the O(n) binsort
- * is faster than the O(nlogn) shellsort. */
-static const l_int32 MinCompsForBinSort = 200;
-
- /* Don't rotate any angle smaller than this */
-static const l_float32 MinAngleToRotate = 0.001; /* radians; ~0.06 deg */
-
-/*---------------------------------------------------------------------*
- * Filters *
- *---------------------------------------------------------------------*/
-/*
- * These filters work on the connected components of 1 bpp images.
- * They are typically used on pixa that have been generated from a Pix
- * using pixConnComp(), so that the corresponding Boxa is available.
- *
- * The filters remove or retain c.c. based on these properties:
- * (a) size [pixaFindDimensions()]
- * (b) area-to-perimeter ratio [pixaFindAreaPerimRatio()]
- * (c) foreground area as a fraction of bounding box area (w * h)
- * [pixaFindForegroundArea()]
- * (d) number of foreground pixels [pixaCountPixels()]
- * (e) width/height aspect ratio [pixFindWidthHeightRatio()]
- *
- * We provide two different high-level interfaces:
- * (1) Functions that use one of the filters on either
- * a pix or the pixa of components.
- * (2) A general method that generates numas of indicator functions,
- * logically combines them, and efficiently removes or adds
- * the selected components.
- *
- * For interface (1), the filtering is performed with a single function call.
- * This is the easiest way to do simple filtering. These functions
- * are named pixSelectBy*() and pixaSelectBy*(), where the '*' is one of:
- * Size
- * PerimToAreaRatio
- * PerimSizeRatio
- * AreaFraction
- * WidthHeightRatio
- *
- * For more complicated filtering, use the general method (2).
- * The numa indicator functions for a pixa are generated by these functions:
- * pixaFindDimensions()
- * pixaFindPerimToAreaRatio()
- * pixaFindPerimSizeRatio()
- * pixaFindAreaFraction()
- * pixaCountPixels()
- * pixaFindWidthHeightRatio()
- * pixaFindWidthHeightProduct()
- *
- * Here is an illustration using the general method. Suppose you want
- * all 8-connected components that have a height greater than 40 pixels,
- * a width not more than 30 pixels, between 150 and 300 fg pixels,
- * and a perimeter-to-size ratio between 1.2 and 2.0.
- *
- * // Generate the pixa of 8 cc pieces.
- * boxa = pixConnComp(pixs, &pixa, 8);
- *
- * // Extract the data we need about each component.
- * pixaFindDimensions(pixa, &naw, &nah);
- * nas = pixaCountPixels(pixa);
- * nar = pixaFindPerimSizeRatio(pixa);
- *
- * // Build the indicator arrays for the set of components,
- * // based on thresholds and selection criteria.
- * na1 = numaMakeThresholdIndicator(nah, 40, L_SELECT_IF_GT);
- * na2 = numaMakeThresholdIndicator(naw, 30, L_SELECT_IF_LTE);
- * na3 = numaMakeThresholdIndicator(nas, 150, L_SELECT_IF_GTE);
- * na4 = numaMakeThresholdIndicator(nas, 300, L_SELECT_IF_LTE);
- * na5 = numaMakeThresholdIndicator(nar, 1.2, L_SELECT_IF_GTE);
- * na6 = numaMakeThresholdIndicator(nar, 2.0, L_SELECT_IF_LTE);
- *
- * // Combine the indicator arrays logically to find
- * // the components that will be retained.
- * nad = numaLogicalOp(NULL, na1, na2, L_INTERSECTION);
- * numaLogicalOp(nad, nad, na3, L_INTERSECTION);
- * numaLogicalOp(nad, nad, na4, L_INTERSECTION);
- * numaLogicalOp(nad, nad, na5, L_INTERSECTION);
- * numaLogicalOp(nad, nad, na6, L_INTERSECTION);
- *
- * // Invert to get the components that will be removed.
- * numaInvert(nad, nad);
- *
- * // Remove the components, in-place.
- * pixRemoveWithIndicator(pixs, pixa, nad);
- */
-
-
-/*!
- * \brief pixSelectBySize()
- *
- * \param[in] pixs 1 bpp
- * \param[in] width, height threshold dimensions
- * \param[in] connectivity 4 or 8
- * \param[in] type L_SELECT_WIDTH, L_SELECT_HEIGHT,
- * L_SELECT_IF_EITHER, L_SELECT_IF_BOTH
- * \param[in] relation L_SELECT_IF_LT, L_SELECT_IF_GT,
- * L_SELECT_IF_LTE, L_SELECT_IF_GTE
- * \param[out] pchanged [optional] 1 if changed; 0 otherwise
- * \return filtered pixd, or NULL on error
- *
- *
- * Notes:
- * (1) The args specify constraints on the size of the
- * components that are kept.
- * (2) If unchanged, returns a copy of pixs. Otherwise,
- * returns a new pix with the filtered components.
- * (3) If the selection type is L_SELECT_WIDTH, the input
- * height is ignored, and v.v.
- * (4) To keep small components, use relation = L_SELECT_IF_LT or
- * L_SELECT_IF_LTE.
- * To keep large components, use relation = L_SELECT_IF_GT or
- * L_SELECT_IF_GTE.
- *
- */
-PIX *
-pixSelectBySize(PIX *pixs,
- l_int32 width,
- l_int32 height,
- l_int32 connectivity,
- l_int32 type,
- l_int32 relation,
- l_int32 *pchanged)
-{
-l_int32 w, h, empty, changed, count;
-BOXA *boxa;
-PIX *pixd;
-PIXA *pixas, *pixad;
-
- PROCNAME("pixSelectBySize");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- if (connectivity != 4 && connectivity != 8)
- return (PIX *)ERROR_PTR("connectivity not 4 or 8", procName, NULL);
- if (type != L_SELECT_WIDTH && type != L_SELECT_HEIGHT &&
- type != L_SELECT_IF_EITHER && type != L_SELECT_IF_BOTH)
- return (PIX *)ERROR_PTR("invalid type", procName, NULL);
- if (relation != L_SELECT_IF_LT && relation != L_SELECT_IF_GT &&
- relation != L_SELECT_IF_LTE && relation != L_SELECT_IF_GTE)
- return (PIX *)ERROR_PTR("invalid relation", procName, NULL);
- if (pchanged) *pchanged = FALSE;
-
- /* Check if any components exist */
- pixZero(pixs, &empty);
- if (empty)
- return pixCopy(NULL, pixs);
-
- /* Identify and select the components */
- boxa = pixConnComp(pixs, &pixas, connectivity);
- pixad = pixaSelectBySize(pixas, width, height, type, relation, &changed);
- boxaDestroy(&boxa);
- pixaDestroy(&pixas);
-
- if (!changed) {
- pixaDestroy(&pixad);
- return pixCopy(NULL, pixs);
- }
-
- /* Render the result */
- if (pchanged) *pchanged = TRUE;
- pixGetDimensions(pixs, &w, &h, NULL);
- count = pixaGetCount(pixad);
- if (count == 0) { /* return empty pix */
- pixd = pixCreateTemplate(pixs);
- } else {
- pixd = pixaDisplay(pixad, w, h);
- pixCopyResolution(pixd, pixs);
- pixCopyColormap(pixd, pixs);
- pixCopyText(pixd, pixs);
- pixCopyInputFormat(pixd, pixs);
- }
- pixaDestroy(&pixad);
- return pixd;
-}
-
-
-/*!
- * \brief pixaSelectBySize()
- *
- * \param[in] pixas
- * \param[in] width, height threshold dimensions
- * \param[in] type L_SELECT_WIDTH, L_SELECT_HEIGHT,
- * L_SELECT_IF_EITHER, L_SELECT_IF_BOTH
- * \param[in] relation L_SELECT_IF_LT, L_SELECT_IF_GT,
- * L_SELECT_IF_LTE, L_SELECT_IF_GTE
- * \param[out] pchanged [optional] 1 if changed; 0 otherwise
- * \return pixad, or NULL on error
- *
- *
- * Notes:
- * (1) The args specify constraints on the size of the
- * components that are kept.
- * (2) Uses pix and box clones in the new pixa.
- * (3) If the selection type is L_SELECT_WIDTH, the input
- * height is ignored, and v.v.
- * (4) To keep small components, use relation = L_SELECT_IF_LT or
- * L_SELECT_IF_LTE.
- * To keep large components, use relation = L_SELECT_IF_GT or
- * L_SELECT_IF_GTE.
- *
- */
-PIXA *
-pixaSelectBySize(PIXA *pixas,
- l_int32 width,
- l_int32 height,
- l_int32 type,
- l_int32 relation,
- l_int32 *pchanged)
-{
-NUMA *na;
-PIXA *pixad;
-
- PROCNAME("pixaSelectBySize");
-
- if (!pixas)
- return (PIXA *)ERROR_PTR("pixas not defined", procName, NULL);
- if (type != L_SELECT_WIDTH && type != L_SELECT_HEIGHT &&
- type != L_SELECT_IF_EITHER && type != L_SELECT_IF_BOTH)
- return (PIXA *)ERROR_PTR("invalid type", procName, NULL);
- if (relation != L_SELECT_IF_LT && relation != L_SELECT_IF_GT &&
- relation != L_SELECT_IF_LTE && relation != L_SELECT_IF_GTE)
- return (PIXA *)ERROR_PTR("invalid relation", procName, NULL);
-
- /* Compute the indicator array for saving components */
- na = pixaMakeSizeIndicator(pixas, width, height, type, relation);
-
- /* Filter to get output */
- pixad = pixaSelectWithIndicator(pixas, na, pchanged);
-
- numaDestroy(&na);
- return pixad;
-}
-
-
-/*!
- * \brief pixaMakeSizeIndicator()
- *
- * \param[in] pixa
- * \param[in] width, height threshold dimensions
- * \param[in] type L_SELECT_WIDTH, L_SELECT_HEIGHT,
- * L_SELECT_IF_EITHER, L_SELECT_IF_BOTH
- * \param[in] relation L_SELECT_IF_LT, L_SELECT_IF_GT,
- * L_SELECT_IF_LTE, L_SELECT_IF_GTE
- * \return na indicator array, or NULL on error
- *
- *
- * Notes:
- * (1) The args specify constraints on the size of the
- * components that are kept.
- * (2) If the selection type is L_SELECT_WIDTH, the input
- * height is ignored, and v.v.
- * (3) To keep small components, use relation = L_SELECT_IF_LT or
- * L_SELECT_IF_LTE.
- * To keep large components, use relation = L_SELECT_IF_GT or
- * L_SELECT_IF_GTE.
- *
- */
-NUMA *
-pixaMakeSizeIndicator(PIXA *pixa,
- l_int32 width,
- l_int32 height,
- l_int32 type,
- l_int32 relation)
-{
-l_int32 i, n, w, h, ival;
-NUMA *na;
-
- PROCNAME("pixaMakeSizeIndicator");
-
- if (!pixa)
- return (NUMA *)ERROR_PTR("pixa not defined", procName, NULL);
- if (type != L_SELECT_WIDTH && type != L_SELECT_HEIGHT &&
- type != L_SELECT_IF_EITHER && type != L_SELECT_IF_BOTH)
- return (NUMA *)ERROR_PTR("invalid type", procName, NULL);
- if (relation != L_SELECT_IF_LT && relation != L_SELECT_IF_GT &&
- relation != L_SELECT_IF_LTE && relation != L_SELECT_IF_GTE)
- return (NUMA *)ERROR_PTR("invalid relation", procName, NULL);
-
- n = pixaGetCount(pixa);
- na = numaCreate(n);
- for (i = 0; i < n; i++) {
- ival = 0;
- pixaGetPixDimensions(pixa, i, &w, &h, NULL);
- switch (type)
- {
- case L_SELECT_WIDTH:
- if ((relation == L_SELECT_IF_LT && w < width) ||
- (relation == L_SELECT_IF_GT && w > width) ||
- (relation == L_SELECT_IF_LTE && w <= width) ||
- (relation == L_SELECT_IF_GTE && w >= width))
- ival = 1;
- break;
- case L_SELECT_HEIGHT:
- if ((relation == L_SELECT_IF_LT && h < height) ||
- (relation == L_SELECT_IF_GT && h > height) ||
- (relation == L_SELECT_IF_LTE && h <= height) ||
- (relation == L_SELECT_IF_GTE && h >= height))
- ival = 1;
- break;
- case L_SELECT_IF_EITHER:
- if (((relation == L_SELECT_IF_LT) && (w < width || h < height)) ||
- ((relation == L_SELECT_IF_GT) && (w > width || h > height)) ||
- ((relation == L_SELECT_IF_LTE) && (w <= width || h <= height)) ||
- ((relation == L_SELECT_IF_GTE) && (w >= width || h >= height)))
- ival = 1;
- break;
- case L_SELECT_IF_BOTH:
- if (((relation == L_SELECT_IF_LT) && (w < width && h < height)) ||
- ((relation == L_SELECT_IF_GT) && (w > width && h > height)) ||
- ((relation == L_SELECT_IF_LTE) && (w <= width && h <= height)) ||
- ((relation == L_SELECT_IF_GTE) && (w >= width && h >= height)))
- ival = 1;
- break;
- default:
- L_WARNING("can't get here!\n", procName);
- break;
- }
- numaAddNumber(na, ival);
- }
-
- return na;
-}
-
-
-/*!
- * \brief pixSelectByPerimToAreaRatio()
- *
- * \param[in] pixs 1 bpp
- * \param[in] thresh threshold ratio of fg boundary to fg pixels
- * \param[in] connectivity 4 or 8
- * \param[in] type L_SELECT_IF_LT, L_SELECT_IF_GT,
- * L_SELECT_IF_LTE, L_SELECT_IF_GTE
- * \param[out] pchanged [optional] 1 if changed; 0 if clone returned
- * \return pixd, or NULL on error
- *
- *
- * Notes:
- * (1) The args specify constraints on the size of the
- * components that are kept.
- * (2) If unchanged, returns a copy of pixs. Otherwise,
- * returns a new pix with the filtered components.
- * (3) This filters "thick" components, where a thick component
- * is defined to have a ratio of boundary to interior pixels
- * that is smaller than a given threshold value.
- * (4) Use L_SELECT_IF_LT or L_SELECT_IF_LTE to save the thicker
- * components, and L_SELECT_IF_GT or L_SELECT_IF_GTE to remove them.
- *
- */
-PIX *
-pixSelectByPerimToAreaRatio(PIX *pixs,
- l_float32 thresh,
- l_int32 connectivity,
- l_int32 type,
- l_int32 *pchanged)
-{
-l_int32 w, h, empty, changed, count;
-BOXA *boxa;
-PIX *pixd;
-PIXA *pixas, *pixad;
-
- PROCNAME("pixSelectByPerimToAreaRatio");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- if (connectivity != 4 && connectivity != 8)
- return (PIX *)ERROR_PTR("connectivity not 4 or 8", procName, NULL);
- if (type != L_SELECT_IF_LT && type != L_SELECT_IF_GT &&
- type != L_SELECT_IF_LTE && type != L_SELECT_IF_GTE)
- return (PIX *)ERROR_PTR("invalid type", procName, NULL);
- if (pchanged) *pchanged = FALSE;
-
- /* Check if any components exist */
- pixZero(pixs, &empty);
- if (empty)
- return pixCopy(NULL, pixs);
-
- /* Filter thin components */
- boxa = pixConnComp(pixs, &pixas, connectivity);
- pixad = pixaSelectByPerimToAreaRatio(pixas, thresh, type, &changed);
- boxaDestroy(&boxa);
- pixaDestroy(&pixas);
-
- if (!changed) {
- pixaDestroy(&pixad);
- return pixCopy(NULL, pixs);
- }
-
- /* Render the result */
- if (pchanged) *pchanged = TRUE;
- pixGetDimensions(pixs, &w, &h, NULL);
- count = pixaGetCount(pixad);
- if (count == 0) { /* return empty pix */
- pixd = pixCreateTemplate(pixs);
- } else {
- pixd = pixaDisplay(pixad, w, h);
- pixCopyResolution(pixd, pixs);
- pixCopyColormap(pixd, pixs);
- pixCopyText(pixd, pixs);
- pixCopyInputFormat(pixd, pixs);
- }
- pixaDestroy(&pixad);
- return pixd;
-}
-
-
-/*!
- * \brief pixaSelectByPerimToAreaRatio()
- *
- * \param[in] pixas
- * \param[in] thresh threshold ratio of fg boundary to fg pixels
- * \param[in] type L_SELECT_IF_LT, L_SELECT_IF_GT,
- * L_SELECT_IF_LTE, L_SELECT_IF_GTE
- * \param[out] pchanged [optional] 1 if changed; 0 if clone returned
- * \return pixad, or NULL on error
- *
- *
- * Notes:
- * (1) Returns a pixa clone if no components are removed.
- * (2) Uses pix and box clones in the new pixa.
- * (3) See pixSelectByPerimToAreaRatio().
- *
- */
-PIXA *
-pixaSelectByPerimToAreaRatio(PIXA *pixas,
- l_float32 thresh,
- l_int32 type,
- l_int32 *pchanged)
-{
-NUMA *na, *nai;
-PIXA *pixad;
-
- PROCNAME("pixaSelectByPerimToAreaRatio");
-
- if (!pixas)
- return (PIXA *)ERROR_PTR("pixas not defined", procName, NULL);
- if (type != L_SELECT_IF_LT && type != L_SELECT_IF_GT &&
- type != L_SELECT_IF_LTE && type != L_SELECT_IF_GTE)
- return (PIXA *)ERROR_PTR("invalid type", procName, NULL);
-
- /* Compute component ratios. */
- na = pixaFindPerimToAreaRatio(pixas);
-
- /* Generate indicator array for elements to be saved. */
- nai = numaMakeThresholdIndicator(na, thresh, type);
- numaDestroy(&na);
-
- /* Filter to get output */
- pixad = pixaSelectWithIndicator(pixas, nai, pchanged);
-
- numaDestroy(&nai);
- return pixad;
-}
-
-
-/*!
- * \brief pixSelectByPerimSizeRatio()
- *
- * \param[in] pixs 1 bpp
- * \param[in] thresh threshold ratio of fg boundary to fg pixels
- * \param[in] connectivity 4 or 8
- * \param[in] type L_SELECT_IF_LT, L_SELECT_IF_GT,
- * L_SELECT_IF_LTE, L_SELECT_IF_GTE
- * \param[out] pchanged [optional] 1 if changed; 0 if clone returned
- * \return pixd, or NULL on error
- *
- *
- * Notes:
- * (1) The args specify constraints on the size of the
- * components that are kept.
- * (2) If unchanged, returns a copy of pixs. Otherwise,
- * returns a new pix with the filtered components.
- * (3) This filters components with smooth vs. dendritic shape, using
- * the ratio of the fg boundary pixels to the circumference of
- * the bounding box, and comparing it to a threshold value.
- * (4) Use L_SELECT_IF_LT or L_SELECT_IF_LTE to save the smooth
- * boundary components, and L_SELECT_IF_GT or L_SELECT_IF_GTE
- * to remove them.
- *
- */
-PIX *
-pixSelectByPerimSizeRatio(PIX *pixs,
- l_float32 thresh,
- l_int32 connectivity,
- l_int32 type,
- l_int32 *pchanged)
-{
-l_int32 w, h, empty, changed, count;
-BOXA *boxa;
-PIX *pixd;
-PIXA *pixas, *pixad;
-
- PROCNAME("pixSelectByPerimSizeRatio");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- if (connectivity != 4 && connectivity != 8)
- return (PIX *)ERROR_PTR("connectivity not 4 or 8", procName, NULL);
- if (type != L_SELECT_IF_LT && type != L_SELECT_IF_GT &&
- type != L_SELECT_IF_LTE && type != L_SELECT_IF_GTE)
- return (PIX *)ERROR_PTR("invalid type", procName, NULL);
- if (pchanged) *pchanged = FALSE;
-
- /* Check if any components exist */
- pixZero(pixs, &empty);
- if (empty)
- return pixCopy(NULL, pixs);
-
- /* Filter thin components */
- boxa = pixConnComp(pixs, &pixas, connectivity);
- pixad = pixaSelectByPerimSizeRatio(pixas, thresh, type, &changed);
- boxaDestroy(&boxa);
- pixaDestroy(&pixas);
-
- if (!changed) {
- pixaDestroy(&pixad);
- return pixCopy(NULL, pixs);
- }
-
- /* Render the result */
- if (pchanged) *pchanged = TRUE;
- pixGetDimensions(pixs, &w, &h, NULL);
- count = pixaGetCount(pixad);
- if (count == 0) { /* return empty pix */
- pixd = pixCreateTemplate(pixs);
- } else {
- pixd = pixaDisplay(pixad, w, h);
- pixCopyResolution(pixd, pixs);
- pixCopyColormap(pixd, pixs);
- pixCopyText(pixd, pixs);
- pixCopyInputFormat(pixd, pixs);
- }
- pixaDestroy(&pixad);
- return pixd;
-}
-
-
-/*!
- * \brief pixaSelectByPerimSizeRatio()
- *
- * \param[in] pixas
- * \param[in] thresh threshold ratio of fg boundary to b.b. circumference
- * \param[in] type L_SELECT_IF_LT, L_SELECT_IF_GT,
- * L_SELECT_IF_LTE, L_SELECT_IF_GTE
- * \param[out] pchanged [optional] 1 if changed; 0 if clone returned
- * \return pixad, or NULL on error
- *
- *
- * Notes:
- * (1) Returns a pixa clone if no components are removed.
- * (2) Uses pix and box clones in the new pixa.
- * (3) See pixSelectByPerimSizeRatio().
- *
- */
-PIXA *
-pixaSelectByPerimSizeRatio(PIXA *pixas,
- l_float32 thresh,
- l_int32 type,
- l_int32 *pchanged)
-{
-NUMA *na, *nai;
-PIXA *pixad;
-
- PROCNAME("pixaSelectByPerimSizeRatio");
-
- if (!pixas)
- return (PIXA *)ERROR_PTR("pixas not defined", procName, NULL);
- if (type != L_SELECT_IF_LT && type != L_SELECT_IF_GT &&
- type != L_SELECT_IF_LTE && type != L_SELECT_IF_GTE)
- return (PIXA *)ERROR_PTR("invalid type", procName, NULL);
-
- /* Compute component ratios. */
- na = pixaFindPerimSizeRatio(pixas);
-
- /* Generate indicator array for elements to be saved. */
- nai = numaMakeThresholdIndicator(na, thresh, type);
- numaDestroy(&na);
-
- /* Filter to get output */
- pixad = pixaSelectWithIndicator(pixas, nai, pchanged);
-
- numaDestroy(&nai);
- return pixad;
-}
-
-
-/*!
- * \brief pixSelectByAreaFraction()
- *
- * \param[in] pixs 1 bpp
- * \param[in] thresh threshold ratio of fg pixels to (w * h)
- * \param[in] connectivity 4 or 8
- * \param[in] type L_SELECT_IF_LT, L_SELECT_IF_GT,
- * L_SELECT_IF_LTE, L_SELECT_IF_GTE
- * \param[out] pchanged [optional] 1 if changed; 0 if clone returned
- * \return pixd, or NULL on error
- *
- *
- * Notes:
- * (1) The args specify constraints on the amount of foreground
- * coverage of the components that are kept.
- * (2) If unchanged, returns a copy of pixs. Otherwise,
- * returns a new pix with the filtered components.
- * (3) This filters components based on the fraction of fg pixels
- * of the component in its bounding box.
- * (4) Use L_SELECT_IF_LT or L_SELECT_IF_LTE to save components
- * with less than the threshold fraction of foreground, and
- * L_SELECT_IF_GT or L_SELECT_IF_GTE to remove them.
- *
- */
-PIX *
-pixSelectByAreaFraction(PIX *pixs,
- l_float32 thresh,
- l_int32 connectivity,
- l_int32 type,
- l_int32 *pchanged)
-{
-l_int32 w, h, empty, changed, count;
-BOXA *boxa;
-PIX *pixd;
-PIXA *pixas, *pixad;
-
- PROCNAME("pixSelectByAreaFraction");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- if (connectivity != 4 && connectivity != 8)
- return (PIX *)ERROR_PTR("connectivity not 4 or 8", procName, NULL);
- if (type != L_SELECT_IF_LT && type != L_SELECT_IF_GT &&
- type != L_SELECT_IF_LTE && type != L_SELECT_IF_GTE)
- return (PIX *)ERROR_PTR("invalid type", procName, NULL);
- if (pchanged) *pchanged = FALSE;
-
- /* Check if any components exist */
- pixZero(pixs, &empty);
- if (empty)
- return pixCopy(NULL, pixs);
-
- /* Filter components */
- boxa = pixConnComp(pixs, &pixas, connectivity);
- pixad = pixaSelectByAreaFraction(pixas, thresh, type, &changed);
- boxaDestroy(&boxa);
- pixaDestroy(&pixas);
-
- if (!changed) {
- pixaDestroy(&pixad);
- return pixCopy(NULL, pixs);
- }
-
- /* Render the result */
- if (pchanged) *pchanged = TRUE;
- pixGetDimensions(pixs, &w, &h, NULL);
- count = pixaGetCount(pixad);
- if (count == 0) { /* return empty pix */
- pixd = pixCreateTemplate(pixs);
- } else {
- pixd = pixaDisplay(pixad, w, h);
- pixCopyResolution(pixd, pixs);
- pixCopyColormap(pixd, pixs);
- pixCopyText(pixd, pixs);
- pixCopyInputFormat(pixd, pixs);
- }
- pixaDestroy(&pixad);
- return pixd;
-}
-
-
-/*!
- * \brief pixaSelectByAreaFraction()
- *
- * \param[in] pixas
- * \param[in] thresh threshold ratio of fg pixels to (w * h)
- * \param[in] type L_SELECT_IF_LT, L_SELECT_IF_GT,
- * L_SELECT_IF_LTE, L_SELECT_IF_GTE
- * \param[out] pchanged [optional] 1 if changed; 0 if clone returned
- * \return pixad, or NULL on error
- *
- *
- * Notes:
- * (1) Returns a pixa clone if no components are removed.
- * (2) Uses pix and box clones in the new pixa.
- * (3) This filters components based on the fraction of fg pixels
- * of the component in its bounding box.
- * (4) Use L_SELECT_IF_LT or L_SELECT_IF_LTE to save components
- * with less than the threshold fraction of foreground, and
- * L_SELECT_IF_GT or L_SELECT_IF_GTE to remove them.
- *
- */
-PIXA *
-pixaSelectByAreaFraction(PIXA *pixas,
- l_float32 thresh,
- l_int32 type,
- l_int32 *pchanged)
-{
-NUMA *na, *nai;
-PIXA *pixad;
-
- PROCNAME("pixaSelectByAreaFraction");
-
- if (!pixas)
- return (PIXA *)ERROR_PTR("pixas not defined", procName, NULL);
- if (type != L_SELECT_IF_LT && type != L_SELECT_IF_GT &&
- type != L_SELECT_IF_LTE && type != L_SELECT_IF_GTE)
- return (PIXA *)ERROR_PTR("invalid type", procName, NULL);
-
- /* Compute component ratios. */
- na = pixaFindAreaFraction(pixas);
-
- /* Generate indicator array for elements to be saved. */
- nai = numaMakeThresholdIndicator(na, thresh, type);
- numaDestroy(&na);
-
- /* Filter to get output */
- pixad = pixaSelectWithIndicator(pixas, nai, pchanged);
-
- numaDestroy(&nai);
- return pixad;
-}
-
-
-/*!
- * \brief pixSelectByWidthHeightRatio()
- *
- * \param[in] pixs 1 bpp
- * \param[in] thresh threshold ratio of width/height
- * \param[in] connectivity 4 or 8
- * \param[in] type L_SELECT_IF_LT, L_SELECT_IF_GT,
- * L_SELECT_IF_LTE, L_SELECT_IF_GTE
- * \param[out] pchanged [optional] 1 if changed; 0 if clone returned
- * \return pixd, or NULL on error
- *
- *
- * Notes:
- * (1) The args specify constraints on the width-to-height ratio
- * for components that are kept.
- * (2) If unchanged, returns a copy of pixs. Otherwise,
- * returns a new pix with the filtered components.
- * (3) This filters components based on the width-to-height ratios.
- * (4) Use L_SELECT_IF_LT or L_SELECT_IF_LTE to save components
- * with less than the threshold ratio, and
- * L_SELECT_IF_GT or L_SELECT_IF_GTE to remove them.
- *
- */
-PIX *
-pixSelectByWidthHeightRatio(PIX *pixs,
- l_float32 thresh,
- l_int32 connectivity,
- l_int32 type,
- l_int32 *pchanged)
-{
-l_int32 w, h, empty, changed, count;
-BOXA *boxa;
-PIX *pixd;
-PIXA *pixas, *pixad;
-
- PROCNAME("pixSelectByWidthHeightRatio");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- if (connectivity != 4 && connectivity != 8)
- return (PIX *)ERROR_PTR("connectivity not 4 or 8", procName, NULL);
- if (type != L_SELECT_IF_LT && type != L_SELECT_IF_GT &&
- type != L_SELECT_IF_LTE && type != L_SELECT_IF_GTE)
- return (PIX *)ERROR_PTR("invalid type", procName, NULL);
- if (pchanged) *pchanged = FALSE;
-
- /* Check if any components exist */
- pixZero(pixs, &empty);
- if (empty)
- return pixCopy(NULL, pixs);
-
- /* Filter components */
- boxa = pixConnComp(pixs, &pixas, connectivity);
- pixad = pixaSelectByWidthHeightRatio(pixas, thresh, type, &changed);
- boxaDestroy(&boxa);
- pixaDestroy(&pixas);
-
- if (!changed) {
- pixaDestroy(&pixad);
- return pixCopy(NULL, pixs);
- }
-
- /* Render the result */
- if (pchanged) *pchanged = TRUE;
- pixGetDimensions(pixs, &w, &h, NULL);
- count = pixaGetCount(pixad);
- if (count == 0) { /* return empty pix */
- pixd = pixCreateTemplate(pixs);
- } else {
- pixd = pixaDisplay(pixad, w, h);
- pixCopyResolution(pixd, pixs);
- pixCopyColormap(pixd, pixs);
- pixCopyText(pixd, pixs);
- pixCopyInputFormat(pixd, pixs);
- }
- pixaDestroy(&pixad);
- return pixd;
-}
-
-
-/*!
- * \brief pixaSelectByWidthHeightRatio()
- *
- * \param[in] pixas
- * \param[in] thresh threshold ratio of width/height
- * \param[in] type L_SELECT_IF_LT, L_SELECT_IF_GT,
- * L_SELECT_IF_LTE, L_SELECT_IF_GTE
- * \param[out] pchanged [optional] 1 if changed; 0 if clone returned
- * \return pixad, or NULL on error
- *
- *
- * Notes:
- * (1) Returns a pixa clone if no components are removed.
- * (2) Uses pix and box clones in the new pixa.
- * (3) This filters components based on the width-to-height ratio
- * of each pix.
- * (4) Use L_SELECT_IF_LT or L_SELECT_IF_LTE to save components
- * with less than the threshold ratio, and
- * L_SELECT_IF_GT or L_SELECT_IF_GTE to remove them.
- *
- */
-PIXA *
-pixaSelectByWidthHeightRatio(PIXA *pixas,
- l_float32 thresh,
- l_int32 type,
- l_int32 *pchanged)
-{
-NUMA *na, *nai;
-PIXA *pixad;
-
- PROCNAME("pixaSelectByWidthHeightRatio");
-
- if (!pixas)
- return (PIXA *)ERROR_PTR("pixas not defined", procName, NULL);
- if (type != L_SELECT_IF_LT && type != L_SELECT_IF_GT &&
- type != L_SELECT_IF_LTE && type != L_SELECT_IF_GTE)
- return (PIXA *)ERROR_PTR("invalid type", procName, NULL);
-
- /* Compute component ratios. */
- na = pixaFindWidthHeightRatio(pixas);
-
- /* Generate indicator array for elements to be saved. */
- nai = numaMakeThresholdIndicator(na, thresh, type);
- numaDestroy(&na);
-
- /* Filter to get output */
- pixad = pixaSelectWithIndicator(pixas, nai, pchanged);
-
- numaDestroy(&nai);
- return pixad;
-}
-
-
-/*!
- * \brief pixaSelectByNumConnComp()
- *
- * \param[in] pixas
- * \param[in] nmin minimum number of components
- * \param[in] nmax maximum number of components
- * \param[in] connectivity 4 or 8
- * \param[out] pchanged [optional] 1 if changed; 0 if clone returned
- * \return pixad, or NULL on error
- *
- *
- * Notes:
- * (1) Returns a pixa clone if no components are removed.
- * (2) Uses pix and box clones in the new pixa.
- * (3) This filters by the number of connected components in
- * a given range.
- *
- */
-PIXA *
-pixaSelectByNumConnComp(PIXA *pixas,
- l_int32 nmin,
- l_int32 nmax,
- l_int32 connectivity,
- l_int32 *pchanged)
-{
-l_int32 n, i, count;
-NUMA *na;
-PIX *pix;
-PIXA *pixad;
-
- PROCNAME("pixaSelectByNumConnComp");
-
- if (pchanged) *pchanged = 0;
- if (!pixas)
- return (PIXA *)ERROR_PTR("pixas not defined", procName, NULL);
- if (nmin > nmax)
- return (PIXA *)ERROR_PTR("nmin > nmax", procName, NULL);
- if (connectivity != 4 && connectivity != 8)
- return (PIXA *)ERROR_PTR("connectivity not 4 or 8", procName, NULL);
-
- /* Get indicator array based on number of c.c. */
- n = pixaGetCount(pixas);
- na = numaCreate(n);
- for (i = 0; i < n; i++) {
- pix = pixaGetPix(pixas, i, L_CLONE);
- pixCountConnComp(pix, connectivity, &count);
- if (count >= nmin && count <= nmax)
- numaAddNumber(na, 1);
- else
- numaAddNumber(na, 0);
- pixDestroy(&pix);
- }
-
- /* Filter to get output */
- pixad = pixaSelectWithIndicator(pixas, na, pchanged);
- numaDestroy(&na);
- return pixad;
-}
-
-
-/*!
- * \brief pixaSelectWithIndicator()
- *
- * \param[in] pixas
- * \param[in] na indicator numa
- * \param[out] pchanged [optional] 1 if changed; 0 if clone returned
- * \return pixad, or NULL on error
- *
- *
- * Notes:
- * (1) Returns a pixa clone if no components are removed.
- * (2) Uses pix and box clones in the new pixa.
- * (3) The indicator numa has values 0 (ignore) and 1 (accept).
- * (4) If the source boxa is not fully populated, it is left
- * empty in the dest pixa.
- *
- */
-PIXA *
-pixaSelectWithIndicator(PIXA *pixas,
- NUMA *na,
- l_int32 *pchanged)
-{
-l_int32 i, n, nbox, ival, nsave;
-BOX *box;
-PIX *pix1;
-PIXA *pixad;
-
- PROCNAME("pixaSelectWithIndicator");
-
- if (!pixas)
- return (PIXA *)ERROR_PTR("pixas not defined", procName, NULL);
- if (!na)
- return (PIXA *)ERROR_PTR("na not defined", procName, NULL);
-
- nsave = 0;
- n = numaGetCount(na);
- for (i = 0; i < n; i++) {
- numaGetIValue(na, i, &ival);
- if (ival == 1) nsave++;
- }
-
- if (nsave == n) {
- if (pchanged) *pchanged = FALSE;
- return pixaCopy(pixas, L_CLONE);
- }
- if (pchanged) *pchanged = TRUE;
- pixad = pixaCreate(nsave);
- nbox = pixaGetBoxaCount(pixas);
- for (i = 0; i < n; i++) {
- numaGetIValue(na, i, &ival);
- if (ival == 0) continue;
- pix1 = pixaGetPix(pixas, i, L_CLONE);
- pixaAddPix(pixad, pix1, L_INSERT);
- if (nbox == n) { /* fully populated boxa */
- box = pixaGetBox(pixas, i, L_CLONE);
- pixaAddBox(pixad, box, L_INSERT);
- }
- }
-
- return pixad;
-}
-
-
-/*!
- * \brief pixRemoveWithIndicator()
- *
- * \param[in] pixs 1 bpp pix from which components are removed; in-place
- * \param[in] pixa of connected components in pixs
- * \param[in] na numa indicator: remove components corresponding to 1s
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This complements pixAddWithIndicator(). Here, the selected
- * components are set subtracted from pixs.
- *
- */
-l_ok
-pixRemoveWithIndicator(PIX *pixs,
- PIXA *pixa,
- NUMA *na)
-{
-l_int32 i, n, ival, x, y, w, h;
-BOX *box;
-PIX *pix;
-
- PROCNAME("pixRemoveWithIndicator");
-
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
- if (!pixa)
- return ERROR_INT("pixa not defined", procName, 1);
- if (!na)
- return ERROR_INT("na not defined", procName, 1);
- n = pixaGetCount(pixa);
- if (n != numaGetCount(na))
- return ERROR_INT("pixa and na sizes not equal", procName, 1);
-
- for (i = 0; i < n; i++) {
- numaGetIValue(na, i, &ival);
- if (ival == 1) {
- pix = pixaGetPix(pixa, i, L_CLONE);
- box = pixaGetBox(pixa, i, L_CLONE);
- boxGetGeometry(box, &x, &y, &w, &h);
- pixRasterop(pixs, x, y, w, h, PIX_DST & PIX_NOT(PIX_SRC),
- pix, 0, 0);
- boxDestroy(&box);
- pixDestroy(&pix);
- }
- }
-
- return 0;
-}
-
-
-/*!
- * \brief pixAddWithIndicator()
- *
- * \param[in] pixs 1 bpp pix from which components are added; in-place
- * \param[in] pixa of connected components, some of which will be put
- * into pixs
- * \param[in] na numa indicator: add components corresponding to 1s
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This complements pixRemoveWithIndicator(). Here, the selected
- * components are added to pixs.
- *
- */
-l_ok
-pixAddWithIndicator(PIX *pixs,
- PIXA *pixa,
- NUMA *na)
-{
-l_int32 i, n, ival, x, y, w, h;
-BOX *box;
-PIX *pix;
-
- PROCNAME("pixAddWithIndicator");
-
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
- if (!pixa)
- return ERROR_INT("pixa not defined", procName, 1);
- if (!na)
- return ERROR_INT("na not defined", procName, 1);
- n = pixaGetCount(pixa);
- if (n != numaGetCount(na))
- return ERROR_INT("pixa and na sizes not equal", procName, 1);
-
- for (i = 0; i < n; i++) {
- numaGetIValue(na, i, &ival);
- if (ival == 1) {
- pix = pixaGetPix(pixa, i, L_CLONE);
- box = pixaGetBox(pixa, i, L_CLONE);
- boxGetGeometry(box, &x, &y, &w, &h);
- pixRasterop(pixs, x, y, w, h, PIX_SRC | PIX_DST, pix, 0, 0);
- boxDestroy(&box);
- pixDestroy(&pix);
- }
- }
-
- return 0;
-}
-
-
-/*!
- * \brief pixaSelectWithString()
- *
- * \param[in] pixas
- * \param[in] str string of indices into pixa, giving the pix to
- * be selected
- * \param[out] perror [optional] 1 if any indices are invalid;
- * 0 if all indices are valid
- * \return pixad, or NULL on error
- *
- *
- * Notes:
- * (1) Returns a pixa with copies of selected pix.
- * (2) Associated boxes are also copied, if fully populated.
- *
- */
-PIXA *
-pixaSelectWithString(PIXA *pixas,
- const char *str,
- l_int32 *perror)
-{
-l_int32 i, nval, npix, nbox, val, imaxval;
-l_float32 maxval;
-BOX *box;
-NUMA *na;
-PIX *pix1;
-PIXA *pixad;
-
- PROCNAME("pixaSelectWithString");
-
- if (perror) *perror = 0;
- if (!pixas)
- return (PIXA *)ERROR_PTR("pixas not defined", procName, NULL);
- if (!str)
- return (PIXA *)ERROR_PTR("str not defined", procName, NULL);
-
- if ((na = numaCreateFromString(str)) == NULL)
- return (PIXA *)ERROR_PTR("na not made", procName, NULL);
- if ((nval = numaGetCount(na)) == 0) {
- numaDestroy(&na);
- return (PIXA *)ERROR_PTR("no indices found", procName, NULL);
- }
- numaGetMax(na, &maxval, NULL);
- imaxval = (l_int32)(maxval + 0.1);
- nbox = pixaGetBoxaCount(pixas);
- npix = pixaGetCount(pixas);
- if (imaxval >= npix) {
- if (perror) *perror = 1;
- L_ERROR("max index = %d, size of pixa = %d\n", procName, imaxval, npix);
- }
-
- pixad = pixaCreate(nval);
- for (i = 0; i < nval; i++) {
- numaGetIValue(na, i, &val);
- if (val < 0 || val >= npix) {
- L_ERROR("index %d out of range of pix\n", procName, val);
- continue;
- }
- pix1 = pixaGetPix(pixas, val, L_COPY);
- pixaAddPix(pixad, pix1, L_INSERT);
- if (nbox == npix) { /* fully populated boxa */
- box = pixaGetBox(pixas, val, L_COPY);
- pixaAddBox(pixad, box, L_INSERT);
- }
- }
- numaDestroy(&na);
- return pixad;
-}
-
-
-/*!
- * \brief pixaRenderComponent()
- *
- * \param[in] pixs [optional] 1 bpp pix
- * \param[in] pixa of 1 bpp connected components, one of which will
- * be rendered in pixs, with its origin determined
- * by the associated box.
- * \param[in] index of component to be rendered
- * \return pixd, or NULL on error
- *
- *
- * Notes:
- * (1) If pixs is null, this generates an empty pix of a size determined
- * by union of the component bounding boxes, and including the origin.
- * (2) The selected component is blitted into pixs.
- *
- */
-PIX *
-pixaRenderComponent(PIX *pixs,
- PIXA *pixa,
- l_int32 index)
-{
-l_int32 n, x, y, w, h, same, maxd;
-BOX *box;
-BOXA *boxa;
-PIX *pix;
-
- PROCNAME("pixaRenderComponent");
-
- if (!pixa)
- return (PIX *)ERROR_PTR("pixa not defined", procName, pixs);
- n = pixaGetCount(pixa);
- if (index < 0 || index >= n)
- return (PIX *)ERROR_PTR("invalid index", procName, pixs);
- if (pixs && (pixGetDepth(pixs) != 1))
- return (PIX *)ERROR_PTR("pixs not 1 bpp", procName, pixs);
- pixaVerifyDepth(pixa, &same, &maxd);
- if (maxd > 1)
- return (PIX *)ERROR_PTR("not all pix with d == 1", procName, pixs);
-
- boxa = pixaGetBoxa(pixa, L_CLONE);
- if (!pixs) {
- boxaGetExtent(boxa, &w, &h, NULL);
- pixs = pixCreate(w, h, 1);
- }
-
- pix = pixaGetPix(pixa, index, L_CLONE);
- box = boxaGetBox(boxa, index, L_CLONE);
- boxGetGeometry(box, &x, &y, &w, &h);
- pixRasterop(pixs, x, y, w, h, PIX_SRC | PIX_DST, pix, 0, 0);
- boxDestroy(&box);
- pixDestroy(&pix);
- boxaDestroy(&boxa);
-
- return pixs;
-}
-
-
-/*---------------------------------------------------------------------*
- * Sort functions *
- *---------------------------------------------------------------------*/
-/*!
- * \brief pixaSort()
- *
- * \param[in] pixas
- * \param[in] sorttype L_SORT_BY_X, L_SORT_BY_Y, L_SORT_BY_WIDTH,
- * L_SORT_BY_HEIGHT, L_SORT_BY_MIN_DIMENSION,
- * L_SORT_BY_MAX_DIMENSION, L_SORT_BY_PERIMETER,
- * L_SORT_BY_AREA, L_SORT_BY_ASPECT_RATIO
- * \param[in] sortorder L_SORT_INCREASING, L_SORT_DECREASING
- * \param[out] pnaindex [optional] index of sorted order into
- * original array
- * \param[in] copyflag L_COPY, L_CLONE
- * \return pixad sorted version of pixas, or NULL on error
- *
- *
- * Notes:
- * (1) This sorts based on the data in the boxa. If the boxa
- * count is not the same as the pixa count, this returns an error.
- * (2) If the boxa is empty, it makes one corresponding to the
- * dimensions of each pix, which allows meaningful sorting on
- * all types except x and y.
- * (3) The copyflag refers to the pix and box copies that are
- * inserted into the sorted pixa. These are either L_COPY
- * or L_CLONE.
- *
- */
-PIXA *
-pixaSort(PIXA *pixas,
- l_int32 sorttype,
- l_int32 sortorder,
- NUMA **pnaindex,
- l_int32 copyflag)
-{
-l_int32 i, n, nb, x, y, w, h;
-BOXA *boxa;
-NUMA *na, *naindex;
-PIXA *pixad;
-
- PROCNAME("pixaSort");
-
- if (pnaindex) *pnaindex = NULL;
- if (!pixas)
- return (PIXA *)ERROR_PTR("pixas not defined", procName, NULL);
- if (sorttype != L_SORT_BY_X && sorttype != L_SORT_BY_Y &&
- sorttype != L_SORT_BY_WIDTH && sorttype != L_SORT_BY_HEIGHT &&
- sorttype != L_SORT_BY_MIN_DIMENSION &&
- sorttype != L_SORT_BY_MAX_DIMENSION &&
- sorttype != L_SORT_BY_PERIMETER &&
- sorttype != L_SORT_BY_AREA &&
- sorttype != L_SORT_BY_ASPECT_RATIO)
- return (PIXA *)ERROR_PTR("invalid sort type", procName, NULL);
- if (sortorder != L_SORT_INCREASING && sortorder != L_SORT_DECREASING)
- return (PIXA *)ERROR_PTR("invalid sort order", procName, NULL);
- if (copyflag != L_COPY && copyflag != L_CLONE)
- return (PIXA *)ERROR_PTR("invalid copy flag", procName, NULL);
-
- /* Check the pixa and boxa counts. Make a boxa if required. */
- if ((n = pixaGetCount(pixas)) == 0) {
- L_INFO("no pix in pixa\n", procName);
- return pixaCopy(pixas, copyflag);
- }
- if ((boxa = pixas->boxa) == NULL) /* not owned; do not destroy */
- return (PIXA *)ERROR_PTR("boxa not found!", procName, NULL);
- nb = boxaGetCount(boxa);
- if (nb == 0) {
- pixaSetFullSizeBoxa(pixas);
- nb = n;
- boxa = pixas->boxa; /* not owned */
- if (sorttype == L_SORT_BY_X || sorttype == L_SORT_BY_Y)
- L_WARNING("sort by x or y where all values are 0\n", procName);
- }
- if (nb != n)
- return (PIXA *)ERROR_PTR("boxa and pixa counts differ", procName, NULL);
-
- /* Use O(n) binsort if possible */
- if (n > MinCompsForBinSort &&
- ((sorttype == L_SORT_BY_X) || (sorttype == L_SORT_BY_Y) ||
- (sorttype == L_SORT_BY_WIDTH) || (sorttype == L_SORT_BY_HEIGHT) ||
- (sorttype == L_SORT_BY_PERIMETER)))
- return pixaBinSort(pixas, sorttype, sortorder, pnaindex, copyflag);
-
- /* Build up numa of specific data */
- if ((na = numaCreate(n)) == NULL)
- return (PIXA *)ERROR_PTR("na not made", procName, NULL);
- for (i = 0; i < n; i++) {
- boxaGetBoxGeometry(boxa, i, &x, &y, &w, &h);
- switch (sorttype)
- {
- case L_SORT_BY_X:
- numaAddNumber(na, x);
- break;
- case L_SORT_BY_Y:
- numaAddNumber(na, y);
- break;
- case L_SORT_BY_WIDTH:
- numaAddNumber(na, w);
- break;
- case L_SORT_BY_HEIGHT:
- numaAddNumber(na, h);
- break;
- case L_SORT_BY_MIN_DIMENSION:
- numaAddNumber(na, L_MIN(w, h));
- break;
- case L_SORT_BY_MAX_DIMENSION:
- numaAddNumber(na, L_MAX(w, h));
- break;
- case L_SORT_BY_PERIMETER:
- numaAddNumber(na, w + h);
- break;
- case L_SORT_BY_AREA:
- numaAddNumber(na, w * h);
- break;
- case L_SORT_BY_ASPECT_RATIO:
- numaAddNumber(na, (l_float32)w / (l_float32)h);
- break;
- default:
- L_WARNING("invalid sort type\n", procName);
- }
- }
-
- /* Get the sort index for data array */
- naindex = numaGetSortIndex(na, sortorder);
- numaDestroy(&na);
- if (!naindex)
- return (PIXA *)ERROR_PTR("naindex not made", procName, NULL);
-
- /* Build up sorted pixa using sort index */
- if ((pixad = pixaSortByIndex(pixas, naindex, copyflag)) == NULL) {
- numaDestroy(&naindex);
- return (PIXA *)ERROR_PTR("pixad not made", procName, NULL);
- }
-
- if (pnaindex)
- *pnaindex = naindex;
- else
- numaDestroy(&naindex);
- return pixad;
-}
-
-
-/*!
- * \brief pixaBinSort()
- *
- * \param[in] pixas
- * \param[in] sorttype L_SORT_BY_X, L_SORT_BY_Y, L_SORT_BY_WIDTH,
- * L_SORT_BY_HEIGHT, L_SORT_BY_PERIMETER
- * \param[in] sortorder L_SORT_INCREASING, L_SORT_DECREASING
- * \param[out] pnaindex [optional] index of sorted order into
- * original array
- * \param[in] copyflag L_COPY, L_CLONE
- * \return pixad sorted version of pixas, or NULL on error
- *
- *
- * Notes:
- * (1) This sorts based on the data in the boxa. If the boxa
- * count is not the same as the pixa count, this returns an error.
- * (2) The copyflag refers to the pix and box copies that are
- * inserted into the sorted pixa. These are either L_COPY
- * or L_CLONE.
- * (3) For a large number of boxes (say, greater than 1000), this
- * O(n) binsort is much faster than the O(nlogn) shellsort.
- * For 5000 components, this is over 20x faster than boxaSort().
- * (4) Consequently, pixaSort() calls this function if it will
- * likely go much faster.
- *
- */
-PIXA *
-pixaBinSort(PIXA *pixas,
- l_int32 sorttype,
- l_int32 sortorder,
- NUMA **pnaindex,
- l_int32 copyflag)
-{
-l_int32 i, n, x, y, w, h;
-BOXA *boxa;
-NUMA *na, *naindex;
-PIXA *pixad;
-
- PROCNAME("pixaBinSort");
-
- if (pnaindex) *pnaindex = NULL;
- if (!pixas)
- return (PIXA *)ERROR_PTR("pixas not defined", procName, NULL);
- if (sorttype != L_SORT_BY_X && sorttype != L_SORT_BY_Y &&
- sorttype != L_SORT_BY_WIDTH && sorttype != L_SORT_BY_HEIGHT &&
- sorttype != L_SORT_BY_PERIMETER)
- return (PIXA *)ERROR_PTR("invalid sort type", procName, NULL);
- if (sortorder != L_SORT_INCREASING && sortorder != L_SORT_DECREASING)
- return (PIXA *)ERROR_PTR("invalid sort order", procName, NULL);
- if (copyflag != L_COPY && copyflag != L_CLONE)
- return (PIXA *)ERROR_PTR("invalid copy flag", procName, NULL);
-
- /* Verify that the pixa and its boxa have the same count */
- if ((boxa = pixas->boxa) == NULL) /* not owned; do not destroy */
- return (PIXA *)ERROR_PTR("boxa not found", procName, NULL);
- n = pixaGetCount(pixas);
- if (boxaGetCount(boxa) != n)
- return (PIXA *)ERROR_PTR("boxa and pixa counts differ", procName, NULL);
-
- /* Generate Numa of appropriate box dimensions */
- if ((na = numaCreate(n)) == NULL)
- return (PIXA *)ERROR_PTR("na not made", procName, NULL);
- for (i = 0; i < n; i++) {
- boxaGetBoxGeometry(boxa, i, &x, &y, &w, &h);
- switch (sorttype)
- {
- case L_SORT_BY_X:
- numaAddNumber(na, x);
- break;
- case L_SORT_BY_Y:
- numaAddNumber(na, y);
- break;
- case L_SORT_BY_WIDTH:
- numaAddNumber(na, w);
- break;
- case L_SORT_BY_HEIGHT:
- numaAddNumber(na, h);
- break;
- case L_SORT_BY_PERIMETER:
- numaAddNumber(na, w + h);
- break;
- default:
- L_WARNING("invalid sort type\n", procName);
- }
- }
-
- /* Get the sort index for data array */
- naindex = numaGetBinSortIndex(na, sortorder);
- numaDestroy(&na);
- if (!naindex)
- return (PIXA *)ERROR_PTR("naindex not made", procName, NULL);
-
- /* Build up sorted pixa using sort index */
- if ((pixad = pixaSortByIndex(pixas, naindex, copyflag)) == NULL) {
- numaDestroy(&naindex);
- return (PIXA *)ERROR_PTR("pixad not made", procName, NULL);
- }
-
- if (pnaindex)
- *pnaindex = naindex;
- else
- numaDestroy(&naindex);
- return pixad;
-}
-
-
-/*!
- * \brief pixaSortByIndex()
- *
- * \param[in] pixas
- * \param[in] naindex na that maps from the new pixa to the input pixa
- * \param[in] copyflag L_COPY, L_CLONE
- * \return pixad sorted, or NULL on error
- */
-PIXA *
-pixaSortByIndex(PIXA *pixas,
- NUMA *naindex,
- l_int32 copyflag)
-{
-l_int32 i, n, index;
-BOX *box;
-PIX *pix;
-PIXA *pixad;
-
- PROCNAME("pixaSortByIndex");
-
- if (!pixas)
- return (PIXA *)ERROR_PTR("pixas not defined", procName, NULL);
- if (!naindex)
- return (PIXA *)ERROR_PTR("naindex not defined", procName, NULL);
- if (copyflag != L_CLONE && copyflag != L_COPY)
- return (PIXA *)ERROR_PTR("invalid copyflag", procName, NULL);
-
- n = pixaGetCount(pixas);
- pixad = pixaCreate(n);
- for (i = 0; i < n; i++) {
- numaGetIValue(naindex, i, &index);
- pix = pixaGetPix(pixas, index, copyflag);
- box = pixaGetBox(pixas, index, copyflag);
- pixaAddPix(pixad, pix, L_INSERT);
- pixaAddBox(pixad, box, L_INSERT);
- }
-
- return pixad;
-}
-
-
-/*!
- * \brief pixaSort2dByIndex()
- *
- * \param[in] pixas
- * \param[in] naa numaa that maps from the new pixaa to the input pixas
- * \param[in] copyflag L_CLONE or L_COPY
- * \return paa sorted, or NULL on error
- */
-PIXAA *
-pixaSort2dByIndex(PIXA *pixas,
- NUMAA *naa,
- l_int32 copyflag)
-{
-l_int32 pixtot, ntot, i, j, n, nn, index;
-BOX *box;
-NUMA *na;
-PIX *pix;
-PIXA *pixa;
-PIXAA *paa;
-
- PROCNAME("pixaSort2dByIndex");
-
- if (!pixas)
- return (PIXAA *)ERROR_PTR("pixas not defined", procName, NULL);
- if (!naa)
- return (PIXAA *)ERROR_PTR("naindex not defined", procName, NULL);
-
- /* Check counts */
- ntot = numaaGetNumberCount(naa);
- pixtot = pixaGetCount(pixas);
- if (ntot != pixtot)
- return (PIXAA *)ERROR_PTR("element count mismatch", procName, NULL);
-
- n = numaaGetCount(naa);
- paa = pixaaCreate(n);
- for (i = 0; i < n; i++) {
- na = numaaGetNuma(naa, i, L_CLONE);
- nn = numaGetCount(na);
- pixa = pixaCreate(nn);
- for (j = 0; j < nn; j++) {
- numaGetIValue(na, j, &index);
- pix = pixaGetPix(pixas, index, copyflag);
- box = pixaGetBox(pixas, index, copyflag);
- pixaAddPix(pixa, pix, L_INSERT);
- pixaAddBox(pixa, box, L_INSERT);
- }
- pixaaAddPixa(paa, pixa, L_INSERT);
- numaDestroy(&na);
- }
-
- return paa;
-}
-
-
-/*---------------------------------------------------------------------*
- * Pixa and Pixaa range selection *
- *---------------------------------------------------------------------*/
-/*!
- * \brief pixaSelectRange()
- *
- * \param[in] pixas
- * \param[in] first use 0 to select from the beginning
- * \param[in] last use -1 to select to the end
- * \param[in] copyflag L_COPY, L_CLONE
- * \return pixad, or NULL on error
- *
- *
- * Notes:
- * (1) The copyflag specifies what we do with each pix from pixas.
- * Specifically, L_CLONE inserts a clone into pixad of each
- * selected pix from pixas.
- *
- */
-PIXA *
-pixaSelectRange(PIXA *pixas,
- l_int32 first,
- l_int32 last,
- l_int32 copyflag)
-{
-l_int32 n, npix, i;
-PIX *pix;
-PIXA *pixad;
-
- PROCNAME("pixaSelectRange");
-
- if (!pixas)
- return (PIXA *)ERROR_PTR("pixas not defined", procName, NULL);
- if (copyflag != L_COPY && copyflag != L_CLONE)
- return (PIXA *)ERROR_PTR("invalid copyflag", procName, NULL);
- n = pixaGetCount(pixas);
- first = L_MAX(0, first);
- if (last < 0) last = n - 1;
- if (first >= n)
- return (PIXA *)ERROR_PTR("invalid first", procName, NULL);
- if (last >= n) {
- L_WARNING("last = %d is beyond max index = %d; adjusting\n",
- procName, last, n - 1);
- last = n - 1;
- }
- if (first > last)
- return (PIXA *)ERROR_PTR("first > last", procName, NULL);
-
- npix = last - first + 1;
- pixad = pixaCreate(npix);
- for (i = first; i <= last; i++) {
- pix = pixaGetPix(pixas, i, copyflag);
- pixaAddPix(pixad, pix, L_INSERT);
- }
- return pixad;
-}
-
-
-/*!
- * \brief pixaaSelectRange()
- *
- * \param[in] paas
- * \param[in] first use 0 to select from the beginning
- * \param[in] last use -1 to select to the end
- * \param[in] copyflag L_COPY, L_CLONE
- * \return paad, or NULL on error
- *
- *
- * Notes:
- * (1) The copyflag specifies what we do with each pixa from paas.
- * Specifically, L_CLONE inserts a clone into paad of each
- * selected pixa from paas.
- *
- */
-PIXAA *
-pixaaSelectRange(PIXAA *paas,
- l_int32 first,
- l_int32 last,
- l_int32 copyflag)
-{
-l_int32 n, npixa, i;
-PIXA *pixa;
-PIXAA *paad;
-
- PROCNAME("pixaaSelectRange");
-
- if (!paas)
- return (PIXAA *)ERROR_PTR("paas not defined", procName, NULL);
- if (copyflag != L_COPY && copyflag != L_CLONE)
- return (PIXAA *)ERROR_PTR("invalid copyflag", procName, NULL);
- n = pixaaGetCount(paas, NULL);
- first = L_MAX(0, first);
- if (last < 0) last = n - 1;
- if (first >= n)
- return (PIXAA *)ERROR_PTR("invalid first", procName, NULL);
- if (last >= n) {
- L_WARNING("last = %d is beyond max index = %d; adjusting\n",
- procName, last, n - 1);
- last = n - 1;
- }
- if (first > last)
- return (PIXAA *)ERROR_PTR("first > last", procName, NULL);
-
- npixa = last - first + 1;
- paad = pixaaCreate(npixa);
- for (i = first; i <= last; i++) {
- pixa = pixaaGetPixa(paas, i, copyflag);
- pixaaAddPixa(paad, pixa, L_INSERT);
- }
- return paad;
-}
-
-
-/*---------------------------------------------------------------------*
- * Pixa and Pixaa scaling *
- *---------------------------------------------------------------------*/
-/*!
- * \brief pixaaScaleToSize()
- *
- * \param[in] paas
- * \param[in] wd target width; use 0 if using height as target
- * \param[in] hd target height; use 0 if using width as target
- * \return paad, or NULL on error
- *
- *
- * Notes:
- * (1) This guarantees that each output scaled image has the
- * dimension(s) you specify.
- * ~ To specify the width with isotropic scaling, set %hd = 0.
- * ~ To specify the height with isotropic scaling, set %wd = 0.
- * ~ If both %wd and %hd are specified, the image is scaled
- * (in general, anisotropically) to that size.
- * ~ It is an error to set both %wd and %hd to 0.
- *
- */
-PIXAA *
-pixaaScaleToSize(PIXAA *paas,
- l_int32 wd,
- l_int32 hd)
-{
-l_int32 n, i;
-PIXA *pixa1, *pixa2;
-PIXAA *paad;
-
- PROCNAME("pixaaScaleToSize");
-
- if (!paas)
- return (PIXAA *)ERROR_PTR("paas not defined", procName, NULL);
- if (wd <= 0 && hd <= 0)
- return (PIXAA *)ERROR_PTR("neither wd nor hd > 0", procName, NULL);
-
- n = pixaaGetCount(paas, NULL);
- paad = pixaaCreate(n);
- for (i = 0; i < n; i++) {
- pixa1 = pixaaGetPixa(paas, i, L_CLONE);
- pixa2 = pixaScaleToSize(pixa1, wd, hd);
- pixaaAddPixa(paad, pixa2, L_INSERT);
- pixaDestroy(&pixa1);
- }
- return paad;
-}
-
-
-/*!
- * \brief pixaaScaleToSizeVar()
- *
- * \param[in] paas
- * \param[in] nawd [optional] target widths; use NULL if using height
- * \param[in] nahd [optional] target height; use NULL if using width
- * \return paad, or NULL on error
- *
- *
- * Notes:
- * (1) This guarantees that the scaled images in each pixa have the
- * dimension(s) you specify in the numas.
- * ~ To specify the width with isotropic scaling, set %nahd = NULL.
- * ~ To specify the height with isotropic scaling, set %nawd = NULL.
- * ~ If both %nawd and %nahd are specified, the image is scaled
- * (in general, anisotropically) to that size.
- * ~ It is an error to set both %nawd and %nahd to NULL.
- * (2) If either nawd and/or nahd is defined, it must have the same
- * count as the number of pixa in paas.
- *
- */
-PIXAA *
-pixaaScaleToSizeVar(PIXAA *paas,
- NUMA *nawd,
- NUMA *nahd)
-{
-l_int32 n, i, wd, hd;
-PIXA *pixa1, *pixa2;
-PIXAA *paad;
-
- PROCNAME("pixaaScaleToSizeVar");
-
- if (!paas)
- return (PIXAA *)ERROR_PTR("paas not defined", procName, NULL);
- if (!nawd && !nahd)
- return (PIXAA *)ERROR_PTR("!nawd && !nahd", procName, NULL);
-
- n = pixaaGetCount(paas, NULL);
- if (nawd && (n != numaGetCount(nawd)))
- return (PIXAA *)ERROR_PTR("nawd wrong size", procName, NULL);
- if (nahd && (n != numaGetCount(nahd)))
- return (PIXAA *)ERROR_PTR("nahd wrong size", procName, NULL);
- paad = pixaaCreate(n);
- for (i = 0; i < n; i++) {
- wd = hd = 0;
- if (nawd) numaGetIValue(nawd, i, &wd);
- if (nahd) numaGetIValue(nahd, i, &hd);
- pixa1 = pixaaGetPixa(paas, i, L_CLONE);
- pixa2 = pixaScaleToSize(pixa1, wd, hd);
- pixaaAddPixa(paad, pixa2, L_INSERT);
- pixaDestroy(&pixa1);
- }
- return paad;
-}
-
-
-/*!
- * \brief pixaScaleToSize()
- *
- * \param[in] pixas
- * \param[in] wd target width; use 0 if using height as target
- * \param[in] hd target height; use 0 if using width as target
- * \return pixad, or NULL on error
- *
- *
- * Notes:
- * (1) See pixaaScaleToSize()
- *
- */
-PIXA *
-pixaScaleToSize(PIXA *pixas,
- l_int32 wd,
- l_int32 hd)
-{
-l_int32 n, i;
-PIX *pix1, *pix2;
-PIXA *pixad;
-
- PROCNAME("pixaScaleToSize");
-
- if (!pixas)
- return (PIXA *)ERROR_PTR("pixas not defined", procName, NULL);
-
- if (wd <= 0 && hd <= 0) /* no scaling requested */
- return pixaCopy(pixas, L_CLONE);
-
- n = pixaGetCount(pixas);
- pixad = pixaCreate(n);
- for (i = 0; i < n; i++) {
- pix1 = pixaGetPix(pixas, i, L_CLONE);
- pix2 = pixScaleToSize(pix1, wd, hd);
- pixCopyText(pix2, pix1);
- pixaAddPix(pixad, pix2, L_INSERT);
- pixDestroy(&pix1);
- }
- return pixad;
-}
-
-
-/*!
- * \brief pixaScaleToSizeRel()
- *
- * \param[in] pixas
- * \param[in] delw change in width, in pixels; 0 means no change
- * \param[in] delh change in height, in pixels; 0 means no change
- * return pixad, or NULL on error
- *
- *
- * Notes:
- * (1) If a requested change in a pix is not possible because
- * either the requested width or height is <= 0, issue a
- * warning and return a copy.
- *
- */
-PIXA *
-pixaScaleToSizeRel(PIXA *pixas,
- l_int32 delw,
- l_int32 delh)
-{
-l_int32 n, i;
-PIX *pix1, *pix2;
-PIXA *pixad;
-
- PROCNAME("pixaScaleToSizeRel");
-
- if (!pixas)
- return (PIXA *)ERROR_PTR("pixas not defined", procName, NULL);
-
- n = pixaGetCount(pixas);
- pixad = pixaCreate(n);
- for (i = 0; i < n; i++) {
- pix1 = pixaGetPix(pixas, i, L_CLONE);
- pix2 = pixScaleToSizeRel(pix1, delw, delh);
- if (pix2) {
- pixaAddPix(pixad, pix2, L_INSERT);
- } else {
- L_WARNING("relative scale to size failed; use a copy\n", procName);
- pixaAddPix(pixad, pix1, L_COPY);
- }
- pixDestroy(&pix1);
- }
- return pixad;
-}
-
-
-/*!
- * \brief pixaScale()
- *
- * \param[in] pixas
- * \param[in] scalex
- * \param[in] scaley
- * \return pixad, or NULL on error
- *
- *
- * Notes:
- * (1) If pixas has a full boxes, it is scaled as well.
- *
- */
-PIXA *
-pixaScale(PIXA *pixas,
- l_float32 scalex,
- l_float32 scaley)
-{
-l_int32 i, n, nb;
-BOXA *boxa1, *boxa2;
-PIX *pix1, *pix2;
-PIXA *pixad;
-
- PROCNAME("pixaScale");
-
- if (!pixas)
- return (PIXA *)ERROR_PTR("pixas not defined", procName, NULL);
- if (scalex <= 0.0 || scaley <= 0.0)
- return (PIXA *)ERROR_PTR("invalid scaling parameters", procName, NULL);
-
- n = pixaGetCount(pixas);
- pixad = pixaCreate(n);
- for (i = 0; i < n; i++) {
- pix1 = pixaGetPix(pixas, i, L_CLONE);
- pix2 = pixScale(pix1, scalex, scaley);
- pixCopyText(pix2, pix1);
- pixaAddPix(pixad, pix2, L_INSERT);
- pixDestroy(&pix1);
- }
-
- boxa1 = pixaGetBoxa(pixas, L_CLONE);
- nb = boxaGetCount(boxa1);
- if (nb == n) {
- boxa2 = boxaTransform(boxa1, 0, 0, scalex, scaley);
- pixaSetBoxa(pixad, boxa2, L_INSERT);
- }
- boxaDestroy(&boxa1);
- return pixad;
-}
-
-
-/*!
- * \brief pixaScaleBySampling()
- *
- * \param[in] pixas
- * \param[in] scalex
- * \param[in] scaley
- * \return pixad, or NULL on error
- *
- *
- * Notes:
- * (1) If pixas has a full boxes, it is scaled as well.
- *
- */
-PIXA *
-pixaScaleBySampling(PIXA *pixas,
- l_float32 scalex,
- l_float32 scaley)
-{
-l_int32 i, n, nb;
-BOXA *boxa1, *boxa2;
-PIX *pix1, *pix2;
-PIXA *pixad;
-
- PROCNAME("pixaScaleBySampling");
-
- if (!pixas)
- return (PIXA *)ERROR_PTR("pixas not defined", procName, NULL);
- if (scalex <= 0.0 || scaley <= 0.0)
- return (PIXA *)ERROR_PTR("invalid scaling parameters", procName, NULL);
-
- n = pixaGetCount(pixas);
- pixad = pixaCreate(n);
- for (i = 0; i < n; i++) {
- pix1 = pixaGetPix(pixas, i, L_CLONE);
- pix2 = pixScaleBySampling(pix1, scalex, scaley);
- pixCopyText(pix2, pix1);
- pixaAddPix(pixad, pix2, L_INSERT);
- pixDestroy(&pix1);
- }
-
- boxa1 = pixaGetBoxa(pixas, L_CLONE);
- nb = boxaGetCount(boxa1);
- if (nb == n) {
- boxa2 = boxaTransform(boxa1, 0, 0, scalex, scaley);
- pixaSetBoxa(pixad, boxa2, L_INSERT);
- }
- boxaDestroy(&boxa1);
- return pixad;
-}
-
-
-/*---------------------------------------------------------------------*
- * Pixa rotation and translation *
- *---------------------------------------------------------------------*/
-/*!
- * \brief pixaRotate()
- *
- * \param[in] pixas 1, 2, 4, 8, 32 bpp rgb
- * \param[in] angle rotation angle in radians; clockwise is positive
- * \param[in] type L_ROTATE_AREA_MAP, L_ROTATE_SHEAR, L_ROTATE_SAMPLING
- * \param[in] incolor L_BRING_IN_WHITE, L_BRING_IN_BLACK
- * \param[in] width original width; use 0 to avoid embedding
- * \param[in] height original height; use 0 to avoid embedding
- * \return pixad, or NULL on error
- *
- *
- * Notes:
- * (1) Each pix is rotated about its center. See pixRotate() for details.
- * (2) The boxa array is copied. Why is it not rotated?
- * If a boxa exists, the array of boxes is in 1-to-1
- * correspondence with the array of pix, and each box typically
- * represents the location of the pix relative to an image from
- * which it has been extracted. Like the pix, we could rotate
- * each box around its center, and then generate a box that
- * contains all four corners, as is done in boxaRotate(), but
- * this seems unnecessary.
- *
- */
-PIXA *
-pixaRotate(PIXA *pixas,
- l_float32 angle,
- l_int32 type,
- l_int32 incolor,
- l_int32 width,
- l_int32 height)
-{
-l_int32 i, n;
-BOXA *boxa;
-PIX *pixs, *pixd;
-PIXA *pixad;
-
- PROCNAME("pixaRotate");
-
- if (!pixas)
- return (PIXA *)ERROR_PTR("pixas not defined", procName, NULL);
- if (type != L_ROTATE_SHEAR && type != L_ROTATE_AREA_MAP &&
- type != L_ROTATE_SAMPLING)
- return (PIXA *)ERROR_PTR("invalid type", procName, NULL);
- if (incolor != L_BRING_IN_WHITE && incolor != L_BRING_IN_BLACK)
- return (PIXA *)ERROR_PTR("invalid incolor", procName, NULL);
- if (L_ABS(angle) < MinAngleToRotate)
- return pixaCopy(pixas, L_COPY);
-
- n = pixaGetCount(pixas);
- if ((pixad = pixaCreate(n)) == NULL)
- return (PIXA *)ERROR_PTR("pixad not made", procName, NULL);
- boxa = pixaGetBoxa(pixad, L_COPY);
- pixaSetBoxa(pixad, boxa, L_INSERT);
- for (i = 0; i < n; i++) {
- if ((pixs = pixaGetPix(pixas, i, L_CLONE)) == NULL) {
- pixaDestroy(&pixad);
- return (PIXA *)ERROR_PTR("pixs not found", procName, NULL);
- }
- pixd = pixRotate(pixs, angle, type, incolor, width, height);
- pixaAddPix(pixad, pixd, L_INSERT);
- pixDestroy(&pixs);
- }
-
- return pixad;
-}
-
-
-/*!
- * \brief pixaRotateOrth()
- *
- * \param[in] pixas
- * \param[in] rotation 0 = noop, 1 = 90 deg, 2 = 180 deg, 3 = 270 deg;
- * all rotations are clockwise
- * \return pixad, or NULL on error
- *
- *
- * Notes:
- * (1) Rotates each pix in the pixa. Rotates and saves the boxes in
- * the boxa if the boxa is full.
- *
- */
-PIXA *
-pixaRotateOrth(PIXA *pixas,
- l_int32 rotation)
-{
-l_int32 i, n, nb, w, h;
-BOX *boxs, *boxd;
-PIX *pixs, *pixd;
-PIXA *pixad;
-
- PROCNAME("pixaRotateOrth");
-
- if (!pixas)
- return (PIXA *)ERROR_PTR("pixas not defined", procName, NULL);
- if (rotation < 0 || rotation > 3)
- return (PIXA *)ERROR_PTR("rotation not in {0,1,2,3}", procName, NULL);
- if (rotation == 0)
- return pixaCopy(pixas, L_COPY);
-
- n = pixaGetCount(pixas);
- nb = pixaGetBoxaCount(pixas);
- if ((pixad = pixaCreate(n)) == NULL)
- return (PIXA *)ERROR_PTR("pixad not made", procName, NULL);
- for (i = 0; i < n; i++) {
- if ((pixs = pixaGetPix(pixas, i, L_CLONE)) == NULL) {
- pixaDestroy(&pixad);
- return (PIXA *)ERROR_PTR("pixs not found", procName, NULL);
- }
- pixd = pixRotateOrth(pixs, rotation);
- pixaAddPix(pixad, pixd, L_INSERT);
- if (n == nb) {
- boxs = pixaGetBox(pixas, i, L_COPY);
- pixGetDimensions(pixs, &w, &h, NULL);
- boxd = boxRotateOrth(boxs, w, h, rotation);
- pixaAddBox(pixad, boxd, L_INSERT);
- boxDestroy(&boxs);
- }
- pixDestroy(&pixs);
- }
-
- return pixad;
-}
-
-
-/*!
- * \brief pixaTranslate()
- *
- * \param[in] pixas
- * \param[in] hshift horizontal shift; hshift > 0 is to right
- * \param[in] vshift vertical shift; vshift > 0 is down
- * \param[in] incolor L_BRING_IN_WHITE, L_BRING_IN_BLACK
- * \return pixad, or NULL on error.
- */
-PIXA *
-pixaTranslate(PIXA *pixas,
- l_int32 hshift,
- l_int32 vshift,
- l_int32 incolor)
-{
-l_int32 i, n, nb;
-BOXA *boxas, *boxad;
-PIX *pixs, *pixd;
-PIXA *pixad;
-
- PROCNAME("pixaTranslate");
-
- if (!pixas)
- return (PIXA *)ERROR_PTR("pixas not defined", procName, NULL);
- if (hshift == 0 && vshift == 0)
- return pixaCopy(pixas, L_COPY);
-
- n = pixaGetCount(pixas);
- nb = pixaGetBoxaCount(pixas);
- if ((pixad = pixaCreate(n)) == NULL)
- return (PIXA *)ERROR_PTR("pixad not made", procName, NULL);
- for (i = 0; i < n; i++) {
- if ((pixs = pixaGetPix(pixas, i, L_CLONE)) == NULL) {
- pixaDestroy(&pixad);
- return (PIXA *)ERROR_PTR("pixs not found", procName, NULL);
- }
- pixd = pixTranslate(NULL, pixs, hshift, vshift, incolor);
- pixaAddPix(pixad, pixd, L_INSERT);
- pixDestroy(&pixs);
- }
- if (n == nb) {
- boxas = pixaGetBoxa(pixas, L_CLONE);
- boxad = boxaTransform(boxas, hshift, vshift, 1.0, 1.0);
- pixaSetBoxa(pixad, boxad, L_INSERT);
- boxaDestroy(&boxas);
- }
-
- return pixad;
-}
-
-
-/*---------------------------------------------------------------------*
- * Miscellaneous functions *
- *---------------------------------------------------------------------*/
-/*!
- * \brief pixaAddBorderGeneral()
- *
- * \param[in] pixad can be null or equal to pixas
- * \param[in] pixas containing pix of all depths; colormap ok
- * \param[in] left, right, top, bot number of pixels added
- * \param[in] val value of added border pixels
- * \return pixad with border added to each pix, including on error
- *
- *
- * Notes:
- * (1) For binary images:
- * white: val = 0
- * black: val = 1
- * For grayscale images:
- * white: val = 2 ** d - 1
- * black: val = 0
- * For rgb color images:
- * white: val = 0xffffff00
- * black: val = 0
- * For colormapped images, use 'index' found this way:
- * white: pixcmapGetRankIntensity(cmap, 1.0, &index);
- * black: pixcmapGetRankIntensity(cmap, 0.0, &index);
- * (2) For in-place replacement of each pix with a bordered version,
- * use %pixad = %pixas. To make a new pixa, use %pixad = NULL.
- * (3) In both cases, the boxa has sides adjusted as if it were
- * expanded by the border.
- *
- */
-PIXA *
-pixaAddBorderGeneral(PIXA *pixad,
- PIXA *pixas,
- l_int32 left,
- l_int32 right,
- l_int32 top,
- l_int32 bot,
- l_uint32 val)
-{
-l_int32 i, n, nbox;
-BOX *box;
-BOXA *boxad;
-PIX *pixs, *pixd;
-
- PROCNAME("pixaAddBorderGeneral");
-
- if (!pixas)
- return (PIXA *)ERROR_PTR("pixas not defined", procName, pixad);
- if (left < 0 || right < 0 || top < 0 || bot < 0)
- return (PIXA *)ERROR_PTR("negative border added!", procName, pixad);
- if (pixad && (pixad != pixas))
- return (PIXA *)ERROR_PTR("pixad defined but != pixas", procName, pixad);
-
- n = pixaGetCount(pixas);
- if (!pixad)
- pixad = pixaCreate(n);
- for (i = 0; i < n; i++) {
- pixs = pixaGetPix(pixas, i, L_CLONE);
- pixd = pixAddBorderGeneral(pixs, left, right, top, bot, val);
- if (pixad == pixas) /* replace */
- pixaReplacePix(pixad, i, pixd, NULL);
- else
- pixaAddPix(pixad, pixd, L_INSERT);
- pixDestroy(&pixs);
- }
-
- nbox = pixaGetBoxaCount(pixas);
- boxad = pixaGetBoxa(pixad, L_CLONE);
- for (i = 0; i < nbox; i++) {
- if ((box = pixaGetBox(pixas, i, L_COPY)) == NULL) {
- L_WARNING("box %d not found\n", procName, i);
- break;
- }
- boxAdjustSides(box, box, -left, right, -top, bot);
- if (pixad == pixas) /* replace */
- boxaReplaceBox(boxad, i, box);
- else
- boxaAddBox(boxad, box, L_INSERT);
- }
- boxaDestroy(&boxad);
-
- return pixad;
-}
-
-
-/*!
- * \brief pixaaFlattenToPixa()
- *
- * \param[in] paa
- * \param[out] pnaindex [optional] the pixa index in the pixaa
- * \param[in] copyflag L_COPY or L_CLONE
- * \return pixa, or NULL on error
- *
- *
- * Notes:
- * (1) This 'flattens' the pixaa to a pixa, taking the pix in
- * order in the first pixa, then the second, etc.
- * (2) If &naindex is defined, we generate a Numa that gives, for
- * each pix in the pixaa, the index of the pixa to which it belongs.
- *
- */
-PIXA *
-pixaaFlattenToPixa(PIXAA *paa,
- NUMA **pnaindex,
- l_int32 copyflag)
-{
-l_int32 i, j, m, mb, n;
-BOX *box;
-NUMA *naindex;
-PIX *pix;
-PIXA *pixa, *pixat;
-
- PROCNAME("pixaaFlattenToPixa");
-
- if (pnaindex) *pnaindex = NULL;
- if (!paa)
- return (PIXA *)ERROR_PTR("paa not defined", procName, NULL);
- if (copyflag != L_COPY && copyflag != L_CLONE)
- return (PIXA *)ERROR_PTR("invalid copyflag", procName, NULL);
-
- if (pnaindex) {
- naindex = numaCreate(0);
- *pnaindex = naindex;
- }
-
- n = pixaaGetCount(paa, NULL);
- pixa = pixaCreate(n);
- for (i = 0; i < n; i++) {
- pixat = pixaaGetPixa(paa, i, L_CLONE);
- m = pixaGetCount(pixat);
- mb = pixaGetBoxaCount(pixat);
- for (j = 0; j < m; j++) {
- pix = pixaGetPix(pixat, j, copyflag);
- pixaAddPix(pixa, pix, L_INSERT);
- if (j < mb) {
- box = pixaGetBox(pixat, j, copyflag);
- pixaAddBox(pixa, box, L_INSERT);
- }
- if (pnaindex)
- numaAddNumber(naindex, i); /* save 'row' number */
- }
- pixaDestroy(&pixat);
- }
-
- return pixa;
-}
-
-
-/*!
- * \brief pixaaSizeRange()
- *
- * \param[in] paa
- * \param[out] pminw, pminh, pmaxw, pmaxh [optional] range of
- * dimensions of all boxes
- * \return 0 if OK, 1 on error
- */
-l_ok
-pixaaSizeRange(PIXAA *paa,
- l_int32 *pminw,
- l_int32 *pminh,
- l_int32 *pmaxw,
- l_int32 *pmaxh)
-{
-l_int32 minw, minh, maxw, maxh, minpw, minph, maxpw, maxph, i, n;
-PIXA *pixa;
-
- PROCNAME("pixaaSizeRange");
-
- if (pminw) *pminw = 0;
- if (pminh) *pminh = 0;
- if (pmaxw) *pmaxw = 0;
- if (pmaxh) *pmaxh = 0;
- if (!paa)
- return ERROR_INT("paa not defined", procName, 1);
- if (!pminw && !pmaxw && !pminh && !pmaxh)
- return ERROR_INT("no data can be returned", procName, 1);
-
- minw = minh = 100000000;
- maxw = maxh = 0;
- n = pixaaGetCount(paa, NULL);
- for (i = 0; i < n; i++) {
- pixa = pixaaGetPixa(paa, i, L_CLONE);
- pixaSizeRange(pixa, &minpw, &minph, &maxpw, &maxph);
- if (minpw < minw)
- minw = minpw;
- if (minph < minh)
- minh = minph;
- if (maxpw > maxw)
- maxw = maxpw;
- if (maxph > maxh)
- maxh = maxph;
- pixaDestroy(&pixa);
- }
-
- if (pminw) *pminw = minw;
- if (pminh) *pminh = minh;
- if (pmaxw) *pmaxw = maxw;
- if (pmaxh) *pmaxh = maxh;
- return 0;
-}
-
-
-/*!
- * \brief pixaSizeRange()
- *
- * \param[in] pixa
- * \param[out] pminw, pminh, pmaxw, pmaxh [optional] range of
- * dimensions of pix in the array
- * \return 0 if OK, 1 on error
- */
-l_ok
-pixaSizeRange(PIXA *pixa,
- l_int32 *pminw,
- l_int32 *pminh,
- l_int32 *pmaxw,
- l_int32 *pmaxh)
-{
-l_int32 minw, minh, maxw, maxh, i, n, w, h;
-PIX *pix;
-
- PROCNAME("pixaSizeRange");
-
- if (pminw) *pminw = 0;
- if (pminh) *pminh = 0;
- if (pmaxw) *pmaxw = 0;
- if (pmaxh) *pmaxh = 0;
- if (!pixa)
- return ERROR_INT("pixa not defined", procName, 1);
- if (!pminw && !pmaxw && !pminh && !pmaxh)
- return ERROR_INT("no data can be returned", procName, 1);
-
- minw = minh = 1000000;
- maxw = maxh = 0;
- n = pixaGetCount(pixa);
- for (i = 0; i < n; i++) {
- pix = pixaGetPix(pixa, i, L_CLONE);
- w = pixGetWidth(pix);
- h = pixGetHeight(pix);
- if (w < minw)
- minw = w;
- if (h < minh)
- minh = h;
- if (w > maxw)
- maxw = w;
- if (h > maxh)
- maxh = h;
- pixDestroy(&pix);
- }
-
- if (pminw) *pminw = minw;
- if (pminh) *pminh = minh;
- if (pmaxw) *pmaxw = maxw;
- if (pmaxh) *pmaxh = maxh;
-
- return 0;
-}
-
-
-/*!
- * \brief pixaClipToPix()
- *
- * \param[in] pixas
- * \param[in] pixs
- * \return pixad, or NULL on error
- *
- *
- * Notes:
- * (1) This is intended for use in situations where pixas
- * was originally generated from the input pixs.
- * (2) Returns a pixad where each pix in pixas is ANDed
- * with its associated region of the input pixs. This
- * region is specified by the the box that is associated
- * with the pix.
- * (3) In a typical application of this function, pixas has
- * a set of region masks, so this generates a pixa of
- * the parts of pixs that correspond to each region
- * mask component, along with the bounding box for
- * the region.
- *
- */
-PIXA *
-pixaClipToPix(PIXA *pixas,
- PIX *pixs)
-{
-l_int32 i, n;
-BOX *box;
-PIX *pix, *pixc;
-PIXA *pixad;
-
- PROCNAME("pixaClipToPix");
-
- if (!pixas)
- return (PIXA *)ERROR_PTR("pixas not defined", procName, NULL);
- if (!pixs)
- return (PIXA *)ERROR_PTR("pixs not defined", procName, NULL);
-
- n = pixaGetCount(pixas);
- if ((pixad = pixaCreate(n)) == NULL)
- return (PIXA *)ERROR_PTR("pixad not made", procName, NULL);
-
- for (i = 0; i < n; i++) {
- pix = pixaGetPix(pixas, i, L_CLONE);
- box = pixaGetBox(pixas, i, L_COPY);
- pixc = pixClipRectangle(pixs, box, NULL);
- pixAnd(pixc, pixc, pix);
- pixaAddPix(pixad, pixc, L_INSERT);
- pixaAddBox(pixad, box, L_INSERT);
- pixDestroy(&pix);
- }
-
- return pixad;
-}
-
-
-/*!
- * \brief pixaClipToForeground()
- *
- * \param[in] pixas
- * \param[out] ppixad [optional] pixa of clipped pix returned
- * \param[out] pboxa [optional] clipping boxes returned
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) At least one of [&pixd, &boxa] must be specified.
- * (2) Any pix with no fg pixels is skipped.
- * (3) See pixClipToForeground().
- *
- */
-l_ok
-pixaClipToForeground(PIXA *pixas,
- PIXA **ppixad,
- BOXA **pboxa)
-{
-l_int32 i, n;
-BOX *box1;
-PIX *pix1, *pix2;
-
- PROCNAME("pixaClipToForeground");
-
- if (ppixad) *ppixad = NULL;
- if (pboxa) *pboxa = NULL;
- if (!pixas)
- return ERROR_INT("pixas not defined", procName, 1);
- if (!ppixad && !pboxa)
- return ERROR_INT("no output requested", procName, 1);
-
- n = pixaGetCount(pixas);
- if (ppixad) *ppixad = pixaCreate(n);
- if (pboxa) *pboxa = boxaCreate(n);
- for (i = 0; i < n; i++) {
- pix1 = pixaGetPix(pixas, i, L_CLONE);
- pixClipToForeground(pix1, &pix2, &box1);
- pixDestroy(&pix1);
- if (ppixad)
- pixaAddPix(*ppixad, pix2, L_INSERT);
- else
- pixDestroy(&pix2);
- if (pboxa)
- boxaAddBox(*pboxa, box1, L_INSERT);
- else
- boxDestroy(&box1);
- }
-
- return 0;
-}
-
-
-/*!
- * \brief pixaGetRenderingDepth()
- *
- * \param[in] pixa
- * \param[out] pdepth depth required to render if all colormaps are removed
- * \return 0 if OK; 1 on error
- */
-l_ok
-pixaGetRenderingDepth(PIXA *pixa,
- l_int32 *pdepth)
-{
-l_int32 hascolor, maxdepth;
-
- PROCNAME("pixaGetRenderingDepth");
-
- if (!pdepth)
- return ERROR_INT("&depth not defined", procName, 1);
- *pdepth = 0;
- if (!pixa)
- return ERROR_INT("pixa not defined", procName, 1);
-
- pixaHasColor(pixa, &hascolor);
- if (hascolor) {
- *pdepth = 32;
- return 0;
- }
-
- pixaGetDepthInfo(pixa, &maxdepth, NULL);
- if (maxdepth == 1)
- *pdepth = 1;
- else /* 2, 4, 8 or 16 */
- *pdepth = 8;
- return 0;
-}
-
-
-/*!
- * \brief pixaHasColor()
- *
- * \param[in] pixa
- * \param[out] phascolor 1 if any pix is rgb or has a colormap with color;
- * 0 otherwise
- * \return 0 if OK; 1 on error
- */
-l_ok
-pixaHasColor(PIXA *pixa,
- l_int32 *phascolor)
-{
-l_int32 i, n, hascolor, d;
-PIX *pix;
-PIXCMAP *cmap;
-
- PROCNAME("pixaHasColor");
-
- if (!phascolor)
- return ERROR_INT("&hascolor not defined", procName, 1);
- *phascolor = 0;
- if (!pixa)
- return ERROR_INT("pixa not defined", procName, 1);
-
- n = pixaGetCount(pixa);
- hascolor = 0;
- for (i = 0; i < n; i++) {
- pix = pixaGetPix(pixa, i, L_CLONE);
- if ((cmap = pixGetColormap(pix)) != NULL)
- pixcmapHasColor(cmap, &hascolor);
- d = pixGetDepth(pix);
- pixDestroy(&pix);
- if (d == 32 || hascolor == 1) {
- *phascolor = 1;
- break;
- }
- }
-
- return 0;
-}
-
-
-/*!
- * \brief pixaAnyColormaps()
- *
- * \param[in] pixa
- * \param[out] phascmap 1 if any pix has a colormap; 0 otherwise
- * \return 0 if OK; 1 on error
- */
-l_ok
-pixaAnyColormaps(PIXA *pixa,
- l_int32 *phascmap)
-{
-l_int32 i, n;
-PIX *pix;
-PIXCMAP *cmap;
-
- PROCNAME("pixaAnyColormaps");
-
- if (!phascmap)
- return ERROR_INT("&hascmap not defined", procName, 1);
- *phascmap = 0;
- if (!pixa)
- return ERROR_INT("pixa not defined", procName, 1);
-
- n = pixaGetCount(pixa);
- for (i = 0; i < n; i++) {
- pix = pixaGetPix(pixa, i, L_CLONE);
- cmap = pixGetColormap(pix);
- pixDestroy(&pix);
- if (cmap) {
- *phascmap = 1;
- return 0;
- }
- }
-
- return 0;
-}
-
-
-/*!
- * \brief pixaGetDepthInfo()
- *
- * \param[in] pixa
- * \param[out] pmaxdepth [optional] max pixel depth of pix in pixa
- * \param[out] psame [optional] true if all depths are equal
- * \return 0 if OK; 1 on error
- */
-l_ok
-pixaGetDepthInfo(PIXA *pixa,
- l_int32 *pmaxdepth,
- l_int32 *psame)
-{
-l_int32 i, n, d, d0;
-l_int32 maxd, same; /* depth info */
-
- PROCNAME("pixaGetDepthInfo");
-
- if (pmaxdepth) *pmaxdepth = 0;
- if (psame) *psame = TRUE;
- if (!pmaxdepth && !psame) return 0;
- if (!pixa)
- return ERROR_INT("pixa not defined", procName, 1);
- if ((n = pixaGetCount(pixa)) == 0)
- return ERROR_INT("pixa is empty", procName, 1);
-
- same = TRUE;
- maxd = 0;
- for (i = 0; i < n; i++) {
- pixaGetPixDimensions(pixa, i, NULL, NULL, &d);
- if (i == 0)
- d0 = d;
- else if (d != d0)
- same = FALSE;
- if (d > maxd) maxd = d;
- }
-
- if (pmaxdepth) *pmaxdepth = maxd;
- if (psame) *psame = same;
- return 0;
-}
-
-
-/*!
- * \brief pixaConvertToSameDepth()
- *
- * \param[in] pixas
- * \return pixad, or NULL on error
- *
- *
- * Notes:
- * (1) If any pix has a colormap, they are all converted to rgb.
- * Otherwise, they are all converted to the maximum depth of
- * all the pix.
- * (2) This can be used to allow lossless rendering onto a single pix.
- *
- */
-PIXA *
-pixaConvertToSameDepth(PIXA *pixas)
-{
-l_int32 i, n, same, hascmap, maxdepth;
-BOXA *boxa;
-PIX *pix1, *pix2;
-PIXA *pixa1, *pixad;
-
- PROCNAME("pixaConvertToSameDepth");
-
- if (!pixas)
- return (PIXA *)ERROR_PTR("pixas not defined", procName, NULL);
-
- /* Remove colormaps to rgb */
- if ((n = pixaGetCount(pixas)) == 0)
- return (PIXA *)ERROR_PTR("no components", procName, NULL);
- pixaAnyColormaps(pixas, &hascmap);
- if (hascmap) {
- pixa1 = pixaCreate(n);
- for (i = 0; i < n; i++) {
- pix1 = pixaGetPix(pixas, i, L_CLONE);
- pix2 = pixConvertTo32(pix1);
- pixaAddPix(pixa1, pix2, L_INSERT);
- pixDestroy(&pix1);
- }
- } else {
- pixa1 = pixaCopy(pixas, L_CLONE);
- }
-
- pixaGetDepthInfo(pixa1, &maxdepth, &same);
- if (!same) { /* at least one pix has depth < maxdepth */
- pixad = pixaCreate(n);
- for (i = 0; i < n; i++) {
- pix1 = pixaGetPix(pixa1, i, L_CLONE);
- if (maxdepth <= 8)
- pix2 = pixConvertTo8(pix1, 0);
- else
- pix2 = pixConvertTo32(pix1);
- pixaAddPix(pixad, pix2, L_INSERT);
- pixDestroy(&pix1);
- }
- } else {
- pixad = pixaCopy(pixa1, L_CLONE);
- }
-
- boxa = pixaGetBoxa(pixas, L_COPY);
- pixaSetBoxa(pixad, boxa, L_INSERT);
- pixaDestroy(&pixa1);
- return pixad;
-}
-
-
-/*!
- * \brief pixaEqual()
- *
- * \param[in] pixa1
- * \param[in] pixa2
- * \param[in] maxdist
- * \param[out] pnaindex [optional] index array of correspondences
- * \param[out] psame 1 if equal; 0 otherwise
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) The two pixa are the "same" if they contain the same
- * boxa and the same ordered set of pix. However, if they
- * have boxa, the pix in each pixa can differ in ordering
- * by an amount given by the parameter %maxdist. If they
- * don't have a boxa, the %maxdist parameter is ignored,
- * and the ordering of the pix must be identical.
- * (2) This applies only to boxa geometry, pixels and ordering;
- * other fields in the pix are ignored.
- * (3) naindex[i] gives the position of the box in pixa2 that
- * corresponds to box i in pixa1. It is only returned if the
- * pixa have boxa and the boxa are equal.
- * (4) In situations where the ordering is very different, so that
- * a large %maxdist is required for "equality", this should be
- * implemented with a hash function for efficiency.
- *
- */
-l_ok
-pixaEqual(PIXA *pixa1,
- PIXA *pixa2,
- l_int32 maxdist,
- NUMA **pnaindex,
- l_int32 *psame)
-{
-l_int32 i, j, n, empty1, empty2, same, sameboxa;
-BOXA *boxa1, *boxa2;
-NUMA *na;
-PIX *pix1, *pix2;
-
- PROCNAME("pixaEqual");
-
- if (pnaindex) *pnaindex = NULL;
- if (!psame)
- return ERROR_INT("&same not defined", procName, 1);
- *psame = 0;
- sameboxa = 0;
- na = NULL;
- if (!pixa1 || !pixa2)
- return ERROR_INT("pixa1 and pixa2 not both defined", procName, 1);
- n = pixaGetCount(pixa1);
- if (n != pixaGetCount(pixa2))
- return 0;
-
- /* If there are no boxes, strict ordering of the pix in each
- * pixa is required. */
- boxa1 = pixaGetBoxa(pixa1, L_CLONE);
- boxa2 = pixaGetBoxa(pixa2, L_CLONE);
- empty1 = (boxaGetCount(boxa1) == 0) ? 1 : 0;
- empty2 = (boxaGetCount(boxa2) == 0) ? 1 : 0;
- if (!empty1 && !empty2) {
- boxaEqual(boxa1, boxa2, maxdist, &na, &sameboxa);
- if (!sameboxa) {
- boxaDestroy(&boxa1);
- boxaDestroy(&boxa2);
- numaDestroy(&na);
- return 0;
- }
- }
- boxaDestroy(&boxa1);
- boxaDestroy(&boxa2);
- if ((!empty1 && empty2) || (empty1 && !empty2))
- return 0;
-
- for (i = 0; i < n; i++) {
- pix1 = pixaGetPix(pixa1, i, L_CLONE);
- if (na)
- numaGetIValue(na, i, &j);
- else
- j = i;
- pix2 = pixaGetPix(pixa2, j, L_CLONE);
- pixEqual(pix1, pix2, &same);
- pixDestroy(&pix1);
- pixDestroy(&pix2);
- if (!same) {
- numaDestroy(&na);
- return 0;
- }
- }
-
- *psame = 1;
- if (pnaindex)
- *pnaindex = na;
- else
- numaDestroy(&na);
- return 0;
-}
-
-
-/*!
- * \brief pixaSetFullSizeBoxa()
- *
- * \param[in] pixa
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) Replaces the existing boxa. Each box gives the dimensions
- * of the corresponding pix. This is needed for functions
- * like pixaSort() that sort based on the boxes.
- *
- */
-l_ok
-pixaSetFullSizeBoxa(PIXA *pixa)
-{
-l_int32 i, n, w, h;
-BOX *box;
-BOXA *boxa;
-PIX *pix;
-
- PROCNAME("pixaSetFullSizeBoxa");
-
- if (!pixa)
- return ERROR_INT("pixa not defined", procName, 1);
- if ((n = pixaGetCount(pixa)) == 0) {
- L_INFO("pixa contains no pix\n", procName);
- return 0;
- }
-
- boxa = boxaCreate(n);
- pixaSetBoxa(pixa, boxa, L_INSERT);
- for (i = 0; i < n; i++) {
- pix = pixaGetPix(pixa, i, L_CLONE);
- pixGetDimensions(pix, &w, &h, NULL);
- box = boxCreate(0, 0, w, h);
- boxaAddBox(boxa, box, L_INSERT);
- pixDestroy(&pix);
- }
- return 0;
-}
-
diff --git a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pixafunc2.c b/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pixafunc2.c
deleted file mode 100644
index a362cfe5..00000000
--- a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pixafunc2.c
+++ /dev/null
@@ -1,2610 +0,0 @@
-/*====================================================================*
- - Copyright (C) 2001 Leptonica. All rights reserved.
- -
- - Redistribution and use in source and binary forms, with or without
- - modification, are permitted provided that the following conditions
- - are met:
- - 1. Redistributions of source code must retain the above copyright
- - notice, this list of conditions and the following disclaimer.
- - 2. Redistributions in binary form must reproduce the above
- - copyright notice, this list of conditions and the following
- - disclaimer in the documentation and/or other materials
- - provided with the distribution.
- -
- - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- - ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- - LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- - A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL ANY
- - CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
- - EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
- - PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
- - PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
- - OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
- - NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- *====================================================================*/
-
-/*!
- * \file pixafunc2.c
- *
- *
- * Pixa display (render into a pix)
- * PIX *pixaDisplay()
- * PIX *pixaDisplayRandomCmap()
- * PIX *pixaDisplayLinearly()
- * PIX *pixaDisplayOnLattice()
- * PIX *pixaDisplayUnsplit()
- * PIX *pixaDisplayTiled()
- * PIX *pixaDisplayTiledInRows()
- * PIX *pixaDisplayTiledInColumns()
- * PIX *pixaDisplayTiledAndScaled()
- * PIX *pixaDisplayTiledWithText()
- * PIX *pixaDisplayTiledByIndex()
- *
- * Pixaa display (render into a pix)
- * PIX *pixaaDisplay()
- * PIX *pixaaDisplayByPixa()
- * PIXA *pixaaDisplayTiledAndScaled()
- *
- * Conversion of all pix to specified type (e.g., depth)
- * PIXA *pixaConvertTo1()
- * PIXA *pixaConvertTo8()
- * PIXA *pixaConvertTo8Colormap()
- * PIXA *pixaConvertTo32()
- *
- * Pixa constrained selection and pdf generation
- * PIXA *pixaConstrainedSelect()
- * l_int32 pixaSelectToPdf()
- *
- * Generate pixa from tiled images
- * PIXA *pixaMakeFromTiledPixa()
- * PIXA *pixaMakeFromTiledPix()
- * l_int32 pixGetTileCount()
- *
- * Pixa display into multiple tiles
- * PIXA *pixaDisplayMultiTiled()
- *
- * Split pixa into files
- * l_int32 pixaSplitIntoFiles()
- *
- * Tile N-Up
- * l_int32 convertToNUpFiles()
- * PIXA *convertToNUpPixa()
- * PIXA *pixaConvertToNUpPixa()
- *
- * Render two pixa side-by-side for comparison *
- * l_int32 pixaCompareInPdf()
- *
- * We give twelve pixaDisplay*() methods for tiling a pixa in a pix.
- * Some work for 1 bpp input; others for any input depth.
- * Some give an output depth that depends on the input depth;
- * others give a different output depth or allow you to choose it.
- * Some use a boxes to determine where each pix goes; others tile
- * onto a regular lattice; others tile onto an irregular lattice;
- * one uses an associated index array to determine which column
- * each pix goes into.
- *
- * Here is a brief description of what the pixa display functions do.
- *
- * pixaDisplay()
- * This uses the boxes in the pixa to lay out each pix. This
- * can be used to reconstruct a pix that has been broken into
- * components, if the boxes represents the positions of the
- * components in the original image.
- * pixaDisplayRandomCmap()
- * This also uses the boxes to lay out each pix. However, it creates
- * a colormapped dest, where each 1 bpp pix is given a randomly
- * generated color (up to 256 are used).
- * pixaDisplayLinearly()
- * This puts each pix, sequentially, in a line, either horizontally
- * or vertically.
- * pixaDisplayOnLattice()
- * This puts each pix, sequentially, onto a regular lattice,
- * omitting any pix that are too big for the lattice size.
- * This is useful, for example, to store bitmapped fonts,
- * where all the characters are stored in a single image.
- * pixaDisplayUnsplit()
- * This lays out a mosaic of tiles (the pix in the pixa) that
- * are all of equal size. (Don't use this for unequal sized pix!)
- * For example, it can be used to invert the action of
- * pixaSplitPix().
- * pixaDisplayTiled()
- * Like pixaDisplayOnLattice(), this places each pix on a regular
- * lattice, but here the lattice size is determined by the
- * largest component, and no components are omitted. This is
- * dangerous if there are thousands of small components and
- * one or more very large one, because the size of the resulting
- * pix can be huge!
- * pixaDisplayTiledInRows()
- * This puts each pix down in a series of rows, where the upper
- * edges of each pix in a row are aligned and there is a uniform
- * spacing between the pix. The height of each row is determined
- * by the tallest pix that was put in the row. This function
- * is a reasonably efficient way to pack the subimages.
- * A boxa of the locations of each input pix is stored in the output.
- * pixaDisplayTiledInColumns()
- * This puts each pix down in a series of rows, each row having
- * a specified number of pix. The upper edges of each pix in a
- * row are aligned and there is a uniform spacing between the pix.
- * The height of each row is determined by the tallest pix that
- * was put in the row. A boxa of the locations of each input
- * pix is stored in the output.
- * pixaDisplayTiledAndScaled()
- * This scales each pix to a given width and output depth, and then
- * tiles them in rows with a given number placed in each row.
- * This is useful for presenting a sequence of images that can be
- * at different resolutions, but which are derived from the same
- * initial image.
- * pixaDisplayTiledWithText()
- * This is a version of pixaDisplayTiledInRows() that prints, below
- * each pix, the text in the pix text field. It renders a pixa
- * to an image with white background that does not exceed a
- * given value in width.
- * pixaDisplayTiledByIndex()
- * This scales each pix to a given width and output depth,
- * and then tiles them in columns corresponding to the value
- * in an associated numa. All pix with the same index value are
- * rendered in the same column. Text in the pix text field are
- * rendered below the pix.
- *
- * To render mosaics of images in a pixaa, display functions are
- * provided that handle situations where the images are all scaled to
- * the same size, or the number of images on each row needs to vary.
- *
- */
-
-#ifdef HAVE_CONFIG_H
-#include
-#endif /* HAVE_CONFIG_H */
-
-#include
-#include /* for sqrt() */
-#include "allheaders.h"
-
-/*---------------------------------------------------------------------*
- * Pixa Display *
- *---------------------------------------------------------------------*/
-/*!
- * \brief pixaDisplay()
- *
- * \param[in] pixa
- * \param[in] w, h if set to 0, the size is determined from the
- * bounding box of the components in pixa
- * \return pix, or NULL on error
- *
- *
- * Notes:
- * (1) This uses the boxes to place each pix in the rendered composite.
- * (2) Set w = h = 0 to use the b.b. of the components to determine
- * the size of the returned pix.
- * (3) Uses the first pix in pixa to determine the depth.
- * (4) The background is written "white". On 1 bpp, each successive
- * pix is "painted" (adding foreground), whereas for grayscale
- * or color each successive pix is blitted with just the src.
- * (5) If the pixa is empty, returns an empty 1 bpp pix.
- *
- */
-PIX *
-pixaDisplay(PIXA *pixa,
- l_int32 w,
- l_int32 h)
-{
-l_int32 i, n, d, xb, yb, wb, hb, res;
-BOXA *boxa;
-PIX *pix1, *pixd;
-
- PROCNAME("pixaDisplay");
-
- if (!pixa)
- return (PIX *)ERROR_PTR("pixa not defined", procName, NULL);
-
- n = pixaGetCount(pixa);
- if (n == 0 && w == 0 && h == 0)
- return (PIX *)ERROR_PTR("no components; no size", procName, NULL);
- if (n == 0) {
- L_WARNING("no components; returning empty 1 bpp pix\n", procName);
- return pixCreate(w, h, 1);
- }
-
- /* If w and h not input, determine the minimum size required
- * to contain the origin and all c.c. */
- if (w == 0 || h == 0) {
- boxa = pixaGetBoxa(pixa, L_CLONE);
- boxaGetExtent(boxa, &w, &h, NULL);
- boxaDestroy(&boxa);
- if (w == 0 || h == 0)
- return (PIX *)ERROR_PTR("no associated boxa", procName, NULL);
- }
-
- /* Use the first pix in pixa to determine depth and resolution */
- pix1 = pixaGetPix(pixa, 0, L_CLONE);
- d = pixGetDepth(pix1);
- res = pixGetXRes(pix1);
- pixDestroy(&pix1);
-
- if ((pixd = pixCreate(w, h, d)) == NULL)
- return (PIX *)ERROR_PTR("pixd not made", procName, NULL);
- pixSetResolution(pixd, res, res);
- if (d > 1)
- pixSetAll(pixd);
- for (i = 0; i < n; i++) {
- if (pixaGetBoxGeometry(pixa, i, &xb, &yb, &wb, &hb)) {
- L_WARNING("no box found!\n", procName);
- continue;
- }
- pix1 = pixaGetPix(pixa, i, L_CLONE);
- if (d == 1)
- pixRasterop(pixd, xb, yb, wb, hb, PIX_PAINT, pix1, 0, 0);
- else
- pixRasterop(pixd, xb, yb, wb, hb, PIX_SRC, pix1, 0, 0);
- pixDestroy(&pix1);
- }
-
- return pixd;
-}
-
-
-/*!
- * \brief pixaDisplayRandomCmap()
- *
- * \param[in] pixa 1 bpp regions, with boxa delineating those regions
- * \param[in] w, h if set to 0, the size is determined from the
- * bounding box of the components in pixa
- * \return pix 8 bpp, cmapped, with random colors assigned to each region,
- * or NULL on error.
- *
- *
- * Notes:
- * (1) This uses the boxes to place each pix in the rendered composite.
- * The fg of each pix in %pixa, such as a single connected
- * component or a line of text, is given a random color.
- * (2) By default, the background color is black (cmap index 0).
- * This can be changed by pixcmapResetColor()
- *
- */
-PIX *
-pixaDisplayRandomCmap(PIXA *pixa,
- l_int32 w,
- l_int32 h)
-{
-l_int32 i, n, same, maxd, index, xb, yb, wb, hb, res;
-BOXA *boxa;
-PIX *pixs, *pix1, *pixd;
-PIXCMAP *cmap;
-
- PROCNAME("pixaDisplayRandomCmap");
-
- if (!pixa)
- return (PIX *)ERROR_PTR("pixa not defined", procName, NULL);
-
- if ((n = pixaGetCount(pixa)) == 0)
- return (PIX *)ERROR_PTR("no components", procName, NULL);
- pixaVerifyDepth(pixa, &same, &maxd);
- if (maxd > 1)
- return (PIX *)ERROR_PTR("not all components are 1 bpp", procName, NULL);
-
- /* If w and h are not input, determine the minimum size required
- * to contain the origin and all c.c. */
- if (w == 0 || h == 0) {
- boxa = pixaGetBoxa(pixa, L_CLONE);
- boxaGetExtent(boxa, &w, &h, NULL);
- boxaDestroy(&boxa);
- }
-
- /* Set up an 8 bpp dest pix, with a colormap with 254 random colors */
- if ((pixd = pixCreate(w, h, 8)) == NULL)
- return (PIX *)ERROR_PTR("pixd not made", procName, NULL);
- cmap = pixcmapCreateRandom(8, 1, 1);
- pixSetColormap(pixd, cmap);
-
- /* Color each component and blit it in */
- for (i = 0; i < n; i++) {
- index = 1 + (i % 254);
- pixaGetBoxGeometry(pixa, i, &xb, &yb, &wb, &hb);
- pixs = pixaGetPix(pixa, i, L_CLONE);
- if (i == 0) res = pixGetXRes(pixs);
- pix1 = pixConvert1To8(NULL, pixs, 0, index);
- pixRasterop(pixd, xb, yb, wb, hb, PIX_PAINT, pix1, 0, 0);
- pixDestroy(&pixs);
- pixDestroy(&pix1);
- }
-
- pixSetResolution(pixd, res, res);
- return pixd;
-}
-
-
-/*!
- * \brief pixaDisplayLinearly()
- *
- * \param[in] pixas
- * \param[in] direction L_HORIZ or L_VERT
- * \param[in] scalefactor applied to every pix; use 1.0 for no scaling
- * \param[in] background 0 for white, 1 for black; this is the color
- * of the spacing between the images
- * \param[in] spacing between images, and on outside
- * \param[in] border width of black border added to each image;
- * use 0 for no border
- * \param[out] pboxa [optional] location of images in output pix
- * \return pix of composite images, or NULL on error
- *
- *
- * Notes:
- * (1) This puts each pix, sequentially, in a line, either horizontally
- * or vertically.
- * (2) If any pix has a colormap, all pix are rendered in rgb.
- * (3) The boxa gives the location of each image.
- *
- */
-PIX *
-pixaDisplayLinearly(PIXA *pixas,
- l_int32 direction,
- l_float32 scalefactor,
- l_int32 background, /* not used */
- l_int32 spacing,
- l_int32 border,
- BOXA **pboxa)
-{
-l_int32 i, n, x, y, w, h, size, depth, bordval;
-BOX *box;
-PIX *pix1, *pix2, *pix3, *pixd;
-PIXA *pixa1, *pixa2;
-
- PROCNAME("pixaDisplayLinearly");
-
- if (pboxa) *pboxa = NULL;
- if (!pixas)
- return (PIX *)ERROR_PTR("pixas not defined", procName, NULL);
- if (direction != L_HORIZ && direction != L_VERT)
- return (PIX *)ERROR_PTR("invalid direction", procName, NULL);
-
- /* Make sure all pix are at the same depth */
- pixa1 = pixaConvertToSameDepth(pixas);
- pixaGetDepthInfo(pixa1, &depth, NULL);
-
- /* Scale and add border if requested */
- n = pixaGetCount(pixa1);
- pixa2 = pixaCreate(n);
- bordval = (depth == 1) ? 1 : 0;
- size = (n - 1) * spacing;
- x = y = 0;
- for (i = 0; i < n; i++) {
- if ((pix1 = pixaGetPix(pixa1, i, L_CLONE)) == NULL) {
- L_WARNING("missing pix at index %d\n", procName, i);
- continue;
- }
-
- if (scalefactor != 1.0)
- pix2 = pixScale(pix1, scalefactor, scalefactor);
- else
- pix2 = pixClone(pix1);
- if (border)
- pix3 = pixAddBorder(pix2, border, bordval);
- else
- pix3 = pixClone(pix2);
-
- pixGetDimensions(pix3, &w, &h, NULL);
- box = boxCreate(x, y, w, h);
- if (direction == L_HORIZ) {
- size += w;
- x += w + spacing;
- } else { /* vertical */
- size += h;
- y += h + spacing;
- }
- pixaAddPix(pixa2, pix3, L_INSERT);
- pixaAddBox(pixa2, box, L_INSERT);
- pixDestroy(&pix1);
- pixDestroy(&pix2);
- }
- pixd = pixaDisplay(pixa2, 0, 0);
-
- if (pboxa)
- *pboxa = pixaGetBoxa(pixa2, L_COPY);
- pixaDestroy(&pixa1);
- pixaDestroy(&pixa2);
- return pixd;
-}
-
-
-/*!
- * \brief pixaDisplayOnLattice()
- *
- * \param[in] pixa
- * \param[in] cellw lattice cell width
- * \param[in] cellh lattice cell height
- * \param[out] pncols [optional] number of columns in output lattice
- * \param[out] pboxa [optional] location of images in lattice
- * \return pix of composite images, or NULL on error
- *
- *
- * Notes:
- * (1) This places each pix on sequentially on a regular lattice
- * in the rendered composite. If a pix is too large to fit in the
- * allocated lattice space, it is not rendered.
- * (2) If any pix has a colormap, all pix are rendered in rgb.
- * (3) This is useful when putting bitmaps of components,
- * such as characters, into a single image.
- * (4) Save the number of tiled images in the text field of the pix,
- * in the format: n = %d. This survives write/read into png files,
- * for example.
- * (5) The boxa gives the location of each image. The UL corner
- * of each image is on a lattice cell corner. Omitted images
- * (due to size) are assigned an invalid width and height of 0.
- *
- */
-PIX *
-pixaDisplayOnLattice(PIXA *pixa,
- l_int32 cellw,
- l_int32 cellh,
- l_int32 *pncols,
- BOXA **pboxa)
-{
-char buf[16];
-l_int32 n, nw, nh, w, h, d, wt, ht, res, samedepth;
-l_int32 index, i, j, hascmap;
-BOX *box;
-BOXA *boxa;
-PIX *pix1, *pix2, *pixd;
-PIXA *pixa1;
-
- PROCNAME("pixaDisplayOnLattice");
-
- if (pncols) *pncols = 0;
- if (pboxa) *pboxa = NULL;
- if (!pixa)
- return (PIX *)ERROR_PTR("pixa not defined", procName, NULL);
-
- /* If any pix have colormaps, or if the depths differ, generate rgb */
- if ((n = pixaGetCount(pixa)) == 0)
- return (PIX *)ERROR_PTR("no components", procName, NULL);
- pixaAnyColormaps(pixa, &hascmap);
- pixaVerifyDepth(pixa, &samedepth, NULL);
- if (hascmap || !samedepth) {
- pixa1 = pixaCreate(n);
- for (i = 0; i < n; i++) {
- pix1 = pixaGetPix(pixa, i, L_CLONE);
- pix2 = pixConvertTo32(pix1);
- pixaAddPix(pixa1, pix2, L_INSERT);
- pixDestroy(&pix1);
- }
- } else {
- pixa1 = pixaCopy(pixa, L_CLONE);
- }
-
- /* Have number of rows and columns approximately equal */
- nw = (l_int32)sqrt((l_float64)n);
- nh = (n + nw - 1) / nw;
- w = cellw * nw;
- h = cellh * nh;
-
- /* Use the first pix to determine output depth and resolution */
- pix1 = pixaGetPix(pixa1, 0, L_CLONE);
- d = pixGetDepth(pix1);
- res = pixGetXRes(pix1);
- pixDestroy(&pix1);
- if ((pixd = pixCreate(w, h, d)) == NULL) {
- pixaDestroy(&pixa1);
- return (PIX *)ERROR_PTR("pixd not made", procName, NULL);
- }
- pixSetBlackOrWhite(pixd, L_SET_WHITE);
- pixSetResolution(pixd, res, res);
- boxa = boxaCreate(n);
-
- /* Tile the output */
- index = 0;
- for (i = 0; i < nh; i++) {
- for (j = 0; j < nw && index < n; j++, index++) {
- pix1 = pixaGetPix(pixa1, index, L_CLONE);
- pixGetDimensions(pix1, &wt, &ht, NULL);
- if (wt > cellw || ht > cellh) {
- L_INFO("pix(%d) omitted; size %dx%x\n", procName, index,
- wt, ht);
- box = boxCreate(0, 0, 0, 0);
- boxaAddBox(boxa, box, L_INSERT);
- pixDestroy(&pix1);
- continue;
- }
- pixRasterop(pixd, j * cellw, i * cellh, wt, ht,
- PIX_SRC, pix1, 0, 0);
- box = boxCreate(j * cellw, i * cellh, wt, ht);
- boxaAddBox(boxa, box, L_INSERT);
- pixDestroy(&pix1);
- }
- }
-
- /* Save the number of tiles in the text field */
- snprintf(buf, sizeof(buf), "n = %d", boxaGetCount(boxa));
- pixSetText(pixd, buf);
-
- if (pncols) *pncols = nw;
- if (pboxa)
- *pboxa = boxa;
- else
- boxaDestroy(&boxa);
- pixaDestroy(&pixa1);
- return pixd;
-}
-
-
-/*!
- * \brief pixaDisplayUnsplit()
- *
- * \param[in] pixa
- * \param[in] nx number of mosaic cells horizontally
- * \param[in] ny number of mosaic cells vertically
- * \param[in] borderwidth of added border on all sides
- * \param[in] bordercolor in our RGBA format: 0xrrggbbaa
- * \return pix of tiled images, or NULL on error
- *
- *
- * Notes:
- * (1) This is a logical inverse of pixaSplitPix(). It
- * constructs a pix from a mosaic of tiles, all of equal size.
- * (2) For added generality, a border of arbitrary color can
- * be added to each of the tiles.
- * (3) In use, pixa will typically have either been generated
- * from pixaSplitPix() or will derived from a pixa that
- * was so generated.
- * (4) All pix in the pixa must be of equal depth, and, if
- * colormapped, have the same colormap.
- *
- */
-PIX *
-pixaDisplayUnsplit(PIXA *pixa,
- l_int32 nx,
- l_int32 ny,
- l_int32 borderwidth,
- l_uint32 bordercolor)
-{
-l_int32 w, h, d, wt, ht;
-l_int32 i, j, k, x, y, n;
-PIX *pix1, *pixd;
-
- PROCNAME("pixaDisplayUnsplit");
-
- if (!pixa)
- return (PIX *)ERROR_PTR("pixa not defined", procName, NULL);
- if (nx <= 0 || ny <= 0)
- return (PIX *)ERROR_PTR("nx and ny must be > 0", procName, NULL);
- if ((n = pixaGetCount(pixa)) == 0)
- return (PIX *)ERROR_PTR("no components", procName, NULL);
- if (n != nx * ny)
- return (PIX *)ERROR_PTR("n != nx * ny", procName, NULL);
- borderwidth = L_MAX(0, borderwidth);
-
- pixaGetPixDimensions(pixa, 0, &wt, &ht, &d);
- w = nx * (wt + 2 * borderwidth);
- h = ny * (ht + 2 * borderwidth);
-
- if ((pixd = pixCreate(w, h, d)) == NULL)
- return (PIX *)ERROR_PTR("pixd not made", procName, NULL);
- pix1 = pixaGetPix(pixa, 0, L_CLONE);
- pixCopyColormap(pixd, pix1);
- pixDestroy(&pix1);
- if (borderwidth > 0)
- pixSetAllArbitrary(pixd, bordercolor);
-
- y = borderwidth;
- for (i = 0, k = 0; i < ny; i++) {
- x = borderwidth;
- for (j = 0; j < nx; j++, k++) {
- pix1 = pixaGetPix(pixa, k, L_CLONE);
- pixRasterop(pixd, x, y, wt, ht, PIX_SRC, pix1, 0, 0);
- pixDestroy(&pix1);
- x += wt + 2 * borderwidth;
- }
- y += ht + 2 * borderwidth;
- }
-
- return pixd;
-}
-
-
-/*!
- * \brief pixaDisplayTiled()
- *
- * \param[in] pixa
- * \param[in] maxwidth of output image
- * \param[in] background 0 for white, 1 for black
- * \param[in] spacing
- * \return pix of tiled images, or NULL on error
- *
- *
- * Notes:
- * (1) This renders a pixa to a single image of width not to
- * exceed maxwidth, with background color either white or black,
- * and with each subimage spaced on a regular lattice.
- * (2) The lattice size is determined from the largest width and height,
- * separately, of all pix in the pixa.
- * (3) All pix in the pixa must be of equal depth.
- * (4) If any pix has a colormap, all pix are rendered in rgb.
- * (5) Careful: because no components are omitted, this is
- * dangerous if there are thousands of small components and
- * one or more very large one, because the size of the
- * resulting pix can be huge!
- *
- */
-PIX *
-pixaDisplayTiled(PIXA *pixa,
- l_int32 maxwidth,
- l_int32 background,
- l_int32 spacing)
-{
-l_int32 wmax, hmax, wd, hd, d, hascmap, res, same;
-l_int32 i, j, n, ni, ncols, nrows;
-l_int32 ystart, xstart, wt, ht;
-PIX *pix1, *pix2, *pixd;
-PIXA *pixa1;
-
- PROCNAME("pixaDisplayTiled");
-
- if (!pixa)
- return (PIX *)ERROR_PTR("pixa not defined", procName, NULL);
-
- /* If any pix have colormaps, generate rgb */
- if ((n = pixaGetCount(pixa)) == 0)
- return (PIX *)ERROR_PTR("no components", procName, NULL);
- pixaAnyColormaps(pixa, &hascmap);
- if (hascmap) {
- pixa1 = pixaCreate(n);
- for (i = 0; i < n; i++) {
- pix1 = pixaGetPix(pixa, i, L_CLONE);
- pix2 = pixConvertTo32(pix1);
- pixaAddPix(pixa1, pix2, L_INSERT);
- pixDestroy(&pix1);
- }
- } else {
- pixa1 = pixaCopy(pixa, L_CLONE);
- }
-
- /* Find the max dimensions and depth subimages */
- pixaGetDepthInfo(pixa1, &d, &same);
- if (!same) {
- pixaDestroy(&pixa1);
- return (PIX *)ERROR_PTR("depths not equal", procName, NULL);
- }
- pixaSizeRange(pixa1, NULL, NULL, &wmax, &hmax);
-
- /* Get the number of rows and columns and the output image size */
- spacing = L_MAX(spacing, 0);
- ncols = (l_int32)((l_float32)(maxwidth - spacing) /
- (l_float32)(wmax + spacing));
- ncols = L_MAX(ncols, 1);
- nrows = (n + ncols - 1) / ncols;
- wd = wmax * ncols + spacing * (ncols + 1);
- hd = hmax * nrows + spacing * (nrows + 1);
- if ((pixd = pixCreate(wd, hd, d)) == NULL) {
- pixaDestroy(&pixa1);
- return (PIX *)ERROR_PTR("pixd not made", procName, NULL);
- }
-
- /* Reset the background color if necessary */
- if ((background == 1 && d == 1) || (background == 0 && d != 1))
- pixSetAll(pixd);
-
- /* Blit the images to the dest */
- for (i = 0, ni = 0; i < nrows; i++) {
- ystart = spacing + i * (hmax + spacing);
- for (j = 0; j < ncols && ni < n; j++, ni++) {
- xstart = spacing + j * (wmax + spacing);
- pix1 = pixaGetPix(pixa1, ni, L_CLONE);
- if (ni == 0) res = pixGetXRes(pix1);
- pixGetDimensions(pix1, &wt, &ht, NULL);
- pixRasterop(pixd, xstart, ystart, wt, ht, PIX_SRC, pix1, 0, 0);
- pixDestroy(&pix1);
- }
- }
- pixSetResolution(pixd, res, res);
-
- pixaDestroy(&pixa1);
- return pixd;
-}
-
-
-/*!
- * \brief pixaDisplayTiledInRows()
- *
- * \param[in] pixa
- * \param[in] outdepth output depth: 1, 8 or 32 bpp
- * \param[in] maxwidth of output image
- * \param[in] scalefactor applied to every pix; use 1.0 for no scaling
- * \param[in] background 0 for white, 1 for black; this is the color
- * of the spacing between the images
- * \param[in] spacing between images, and on outside
- * \param[in] border width of black border added to each image;
- * use 0 for no border
- * \return pixd of tiled images, or NULL on error
- *
- *
- * Notes:
- * (1) This renders a pixa to a single image of width not to
- * exceed maxwidth, with background color either white or black,
- * and with each row tiled such that the top of each pix is
- * aligned and separated by 'spacing' from the next one.
- * A black border can be added to each pix.
- * (2) All pix are converted to outdepth; existing colormaps are removed.
- * (3) This does a reasonably spacewise-efficient job of laying
- * out the individual pix images into a tiled composite.
- * (4) A serialized boxa giving the location in pixd of each input
- * pix (without added border) is stored in the text string of pixd.
- * This allows, e.g., regeneration of a pixa from pixd, using
- * pixaCreateFromBoxa(). If there is no scaling and the depth of
- * each input pix in the pixa is the same, this tiling operation
- * can be inverted using the boxa (except for loss of text in
- * each of the input pix):
- * pix1 = pixaDisplayTiledInRows(pixa1, 1, 1500, 1.0, 0, 30, 0);
- * char *boxatxt = pixGetText(pix1);
- * boxa1 = boxaReadMem((l_uint8 *)boxatxt, strlen(boxatxt));
- * pixa2 = pixaCreateFromBoxa(pix1, boxa1, 0, 0, NULL);
- *
- */
-PIX *
-pixaDisplayTiledInRows(PIXA *pixa,
- l_int32 outdepth,
- l_int32 maxwidth,
- l_float32 scalefactor,
- l_int32 background,
- l_int32 spacing,
- l_int32 border)
-{
-l_int32 h; /* cumulative height over all the rows */
-l_int32 w; /* cumulative height in the current row */
-l_int32 bordval, wtry, wt, ht;
-l_int32 irow; /* index of current pix in current row */
-l_int32 wmaxrow; /* width of the largest row */
-l_int32 maxh; /* max height in row */
-l_int32 i, j, index, n, x, y, nrows, ninrow, res;
-size_t size;
-l_uint8 *data;
-BOXA *boxa;
-NUMA *nainrow; /* number of pix in the row */
-NUMA *namaxh; /* height of max pix in the row */
-PIX *pix, *pixn, *pix1, *pixd;
-PIXA *pixan;
-
- PROCNAME("pixaDisplayTiledInRows");
-
- if (!pixa)
- return (PIX *)ERROR_PTR("pixa not defined", procName, NULL);
- if (outdepth != 1 && outdepth != 8 && outdepth != 32)
- return (PIX *)ERROR_PTR("outdepth not in {1, 8, 32}", procName, NULL);
- if (border < 0)
- border = 0;
- if (scalefactor <= 0.0) scalefactor = 1.0;
-
- if ((n = pixaGetCount(pixa)) == 0)
- return (PIX *)ERROR_PTR("no components", procName, NULL);
-
- /* Normalize depths, scale, remove colormaps; optionally add border */
- pixan = pixaCreate(n);
- bordval = (outdepth == 1) ? 1 : 0;
- for (i = 0; i < n; i++) {
- if ((pix = pixaGetPix(pixa, i, L_CLONE)) == NULL)
- continue;
-
- if (outdepth == 1)
- pixn = pixConvertTo1(pix, 128);
- else if (outdepth == 8)
- pixn = pixConvertTo8(pix, FALSE);
- else /* outdepth == 32 */
- pixn = pixConvertTo32(pix);
- pixDestroy(&pix);
-
- if (scalefactor != 1.0)
- pix1 = pixScale(pixn, scalefactor, scalefactor);
- else
- pix1 = pixClone(pixn);
- if (border)
- pixd = pixAddBorder(pix1, border, bordval);
- else
- pixd = pixClone(pix1);
- pixDestroy(&pixn);
- pixDestroy(&pix1);
-
- pixaAddPix(pixan, pixd, L_INSERT);
- }
- if (pixaGetCount(pixan) != n) {
- n = pixaGetCount(pixan);
- L_WARNING("only got %d components\n", procName, n);
- if (n == 0) {
- pixaDestroy(&pixan);
- return (PIX *)ERROR_PTR("no components", procName, NULL);
- }
- }
-
- /* Compute parameters for layout */
- nainrow = numaCreate(0);
- namaxh = numaCreate(0);
- wmaxrow = 0;
- w = h = spacing;
- maxh = 0; /* max height in row */
- for (i = 0, irow = 0; i < n; i++, irow++) {
- pixaGetPixDimensions(pixan, i, &wt, &ht, NULL);
- wtry = w + wt + spacing;
- if (wtry > maxwidth) { /* end the current row and start next one */
- numaAddNumber(nainrow, irow);
- numaAddNumber(namaxh, maxh);
- wmaxrow = L_MAX(wmaxrow, w);
- h += maxh + spacing;
- irow = 0;
- w = wt + 2 * spacing;
- maxh = ht;
- } else {
- w = wtry;
- maxh = L_MAX(maxh, ht);
- }
- }
-
- /* Enter the parameters for the last row */
- numaAddNumber(nainrow, irow);
- numaAddNumber(namaxh, maxh);
- wmaxrow = L_MAX(wmaxrow, w);
- h += maxh + spacing;
-
- if ((pixd = pixCreate(wmaxrow, h, outdepth)) == NULL) {
- numaDestroy(&nainrow);
- numaDestroy(&namaxh);
- pixaDestroy(&pixan);
- return (PIX *)ERROR_PTR("pixd not made", procName, NULL);
- }
-
- /* Reset the background color if necessary */
- if ((background == 1 && outdepth == 1) ||
- (background == 0 && outdepth != 1))
- pixSetAll(pixd);
-
- /* Blit the images to the dest, and save the boxa identifying
- * the image regions that do not include the borders. */
- nrows = numaGetCount(nainrow);
- y = spacing;
- boxa = boxaCreate(n);
- for (i = 0, index = 0; i < nrows; i++) { /* over rows */
- numaGetIValue(nainrow, i, &ninrow);
- numaGetIValue(namaxh, i, &maxh);
- x = spacing;
- for (j = 0; j < ninrow; j++, index++) { /* over pix in row */
- pix = pixaGetPix(pixan, index, L_CLONE);
- if (index == 0) {
- res = pixGetXRes(pix);
- pixSetResolution(pixd, res, res);
- }
- pixGetDimensions(pix, &wt, &ht, NULL);
- boxaAddBox(boxa, boxCreate(x + border, y + border,
- wt - 2 * border, ht - 2 *border), L_INSERT);
- pixRasterop(pixd, x, y, wt, ht, PIX_SRC, pix, 0, 0);
- pixDestroy(&pix);
- x += wt + spacing;
- }
- y += maxh + spacing;
- }
- boxaWriteMem(&data, &size, boxa);
- pixSetText(pixd, (char *)data); /* data is ascii */
- LEPT_FREE(data);
- boxaDestroy(&boxa);
-
- numaDestroy(&nainrow);
- numaDestroy(&namaxh);
- pixaDestroy(&pixan);
- return pixd;
-}
-
-
-/*!
- * \brief pixaDisplayTiledInColumns()
- *
- * \param[in] pixas
- * \param[in] nx number of columns in output image
- * \param[in] scalefactor applied to every pix; use 1.0 for no scaling
- * \param[in] spacing between images, and on outside
- * \param[in] border width of black border added to each image;
- * use 0 for no border
- * \return pixd of tiled images, or NULL on error
- *
- *
- * Notes:
- * (1) This renders a pixa to a single image with &nx columns of
- * subimages. The background color is white, and each row
- * is tiled such that the top of each pix is aligned and
- * each pix is separated by 'spacing' from the next one.
- * A black border can be added to each pix.
- * (2) The output depth is determined by the largest depth
- * required by the pix in the pixa. Colormaps are removed.
- * (3) A serialized boxa giving the location in pixd of each input
- * pix (without added border) is stored in the text string of pixd.
- * This allows, e.g., regeneration of a pixa from pixd, using
- * pixaCreateFromBoxa(). If there is no scaling and the depth of
- * each input pix in the pixa is the same, this tiling operation
- * can be inverted using the boxa (except for loss of text in
- * each of the input pix):
- * pix1 = pixaDisplayTiledInColumns(pixa1, 3, 1.0, 0, 30, 2);
- * char *boxatxt = pixGetText(pix1);
- * boxa1 = boxaReadMem((l_uint8 *)boxatxt, strlen(boxatxt));
- * pixa2 = pixaCreateFromBoxa(pix1, boxa1, NULL);
- *
- */
-PIX *
-pixaDisplayTiledInColumns(PIXA *pixas,
- l_int32 nx,
- l_float32 scalefactor,
- l_int32 spacing,
- l_int32 border)
-{
-l_int32 i, j, index, n, x, y, nrows, wb, hb, w, h, maxd, maxh, bordval, res;
-size_t size;
-l_uint8 *data;
-BOX *box;
-BOXA *boxa;
-PIX *pix1, *pix2, *pix3, *pixd;
-PIXA *pixa1, *pixa2;
-
- PROCNAME("pixaDisplayTiledInColumns");
-
- if (!pixas)
- return (PIX *)ERROR_PTR("pixas not defined", procName, NULL);
- if (border < 0)
- border = 0;
- if (scalefactor <= 0.0) scalefactor = 1.0;
-
- if ((n = pixaGetCount(pixas)) == 0)
- return (PIX *)ERROR_PTR("no components", procName, NULL);
-
- /* Convert to same depth, if necessary */
- pixa1 = pixaConvertToSameDepth(pixas);
- pixaGetDepthInfo(pixa1, &maxd, NULL);
-
- /* Scale and optionally add border */
- pixa2 = pixaCreate(n);
- bordval = (maxd == 1) ? 1 : 0;
- for (i = 0; i < n; i++) {
- if ((pix1 = pixaGetPix(pixa1, i, L_CLONE)) == NULL)
- continue;
- if (scalefactor != 1.0)
- pix2 = pixScale(pix1, scalefactor, scalefactor);
- else
- pix2 = pixClone(pix1);
- if (border)
- pix3 = pixAddBorder(pix2, border, bordval);
- else
- pix3 = pixClone(pix2);
- if (i == 0) res = pixGetXRes(pix3);
- pixaAddPix(pixa2, pix3, L_INSERT);
- pixDestroy(&pix1);
- pixDestroy(&pix2);
- }
- pixaDestroy(&pixa1);
- if (pixaGetCount(pixa2) != n) {
- n = pixaGetCount(pixa2);
- L_WARNING("only got %d components\n", procName, n);
- if (n == 0) {
- pixaDestroy(&pixa2);
- return (PIX *)ERROR_PTR("no components", procName, NULL);
- }
- }
-
- /* Compute layout parameters and save as a boxa */
- boxa = boxaCreate(n);
- nrows = (n + nx - 1) / nx;
- y = spacing;
- for (i = 0, index = 0; i < nrows; i++) {
- x = spacing;
- maxh = 0;
- for (j = 0; j < nx && index < n; j++) {
- pixaGetPixDimensions(pixa2, index, &wb, &hb, NULL);
- box = boxCreate(x, y, wb, hb);
- boxaAddBox(boxa, box, L_INSERT);
- maxh = L_MAX(maxh, hb + spacing);
- x += wb + spacing;
- index++;
- }
- y += maxh;
- }
- pixaSetBoxa(pixa2, boxa, L_INSERT);
-
- /* Render the output pix */
- boxaGetExtent(boxa, &w, &h, NULL);
- pixd = pixaDisplay(pixa2, w + spacing, h + spacing);
- pixSetResolution(pixd, res, res);
-
- /* Save the boxa in the text field of the output pix */
- boxaWriteMem(&data, &size, boxa);
- pixSetText(pixd, (char *)data); /* data is ascii */
- LEPT_FREE(data);
-
- pixaDestroy(&pixa2);
- return pixd;
-}
-
-
-/*!
- * \brief pixaDisplayTiledAndScaled()
- *
- * \param[in] pixa
- * \param[in] outdepth output depth: 1, 8 or 32 bpp
- * \param[in] tilewidth each pix is scaled to this width
- * \param[in] ncols number of tiles in each row
- * \param[in] background 0 for white, 1 for black; this is the color
- * of the spacing between the images
- * \param[in] spacing between images, and on outside
- * \param[in] border width of additional black border on each image;
- * use 0 for no border
- * \return pix of tiled images, or NULL on error
- *
- *
- * Notes:
- * (1) This can be used to tile a number of renderings of
- * an image that are at different scales and depths.
- * (2) Each image, after scaling and optionally adding the
- * black border, has width 'tilewidth'. Thus, the border does
- * not affect the spacing between the image tiles. The
- * maximum allowed border width is tilewidth / 5.
- *
- */
-PIX *
-pixaDisplayTiledAndScaled(PIXA *pixa,
- l_int32 outdepth,
- l_int32 tilewidth,
- l_int32 ncols,
- l_int32 background,
- l_int32 spacing,
- l_int32 border)
-{
-l_int32 x, y, w, h, wd, hd, d, res;
-l_int32 i, n, nrows, maxht, ninrow, irow, bordval;
-l_int32 *rowht;
-l_float32 scalefact;
-PIX *pix, *pixn, *pix1, *pixb, *pixd;
-PIXA *pixan;
-
- PROCNAME("pixaDisplayTiledAndScaled");
-
- if (!pixa)
- return (PIX *)ERROR_PTR("pixa not defined", procName, NULL);
- if (outdepth != 1 && outdepth != 8 && outdepth != 32)
- return (PIX *)ERROR_PTR("outdepth not in {1, 8, 32}", procName, NULL);
- if (ncols <= 0)
- return (PIX *)ERROR_PTR("ncols must be > 0", procName, NULL);
- if (border < 0 || border > tilewidth / 5)
- border = 0;
-
- if ((n = pixaGetCount(pixa)) == 0)
- return (PIX *)ERROR_PTR("no components", procName, NULL);
-
- /* Normalize scale and depth for each pix; optionally add border */
- pixan = pixaCreate(n);
- bordval = (outdepth == 1) ? 1 : 0;
- for (i = 0; i < n; i++) {
- if ((pix = pixaGetPix(pixa, i, L_CLONE)) == NULL)
- continue;
-
- pixGetDimensions(pix, &w, &h, &d);
- scalefact = (l_float32)(tilewidth - 2 * border) / (l_float32)w;
- if (d == 1 && outdepth > 1 && scalefact < 1.0)
- pix1 = pixScaleToGray(pix, scalefact);
- else
- pix1 = pixScale(pix, scalefact, scalefact);
-
- if (outdepth == 1)
- pixn = pixConvertTo1(pix1, 128);
- else if (outdepth == 8)
- pixn = pixConvertTo8(pix1, FALSE);
- else /* outdepth == 32 */
- pixn = pixConvertTo32(pix1);
- pixDestroy(&pix1);
-
- if (border)
- pixb = pixAddBorder(pixn, border, bordval);
- else
- pixb = pixClone(pixn);
-
- pixaAddPix(pixan, pixb, L_INSERT);
- pixDestroy(&pix);
- pixDestroy(&pixn);
- }
- if ((n = pixaGetCount(pixan)) == 0) { /* should not have changed! */
- pixaDestroy(&pixan);
- return (PIX *)ERROR_PTR("no components", procName, NULL);
- }
-
- /* Determine the size of each row and of pixd */
- wd = tilewidth * ncols + spacing * (ncols + 1);
- nrows = (n + ncols - 1) / ncols;
- if ((rowht = (l_int32 *)LEPT_CALLOC(nrows, sizeof(l_int32))) == NULL) {
- pixaDestroy(&pixan);
- return (PIX *)ERROR_PTR("rowht array not made", procName, NULL);
- }
- maxht = 0;
- ninrow = 0;
- irow = 0;
- for (i = 0; i < n; i++) {
- pix = pixaGetPix(pixan, i, L_CLONE);
- ninrow++;
- pixGetDimensions(pix, &w, &h, NULL);
- maxht = L_MAX(h, maxht);
- if (ninrow == ncols) {
- rowht[irow] = maxht;
- maxht = ninrow = 0; /* reset */
- irow++;
- }
- pixDestroy(&pix);
- }
- if (ninrow > 0) { /* last fencepost */
- rowht[irow] = maxht;
- irow++; /* total number of rows */
- }
- nrows = irow;
- hd = spacing * (nrows + 1);
- for (i = 0; i < nrows; i++)
- hd += rowht[i];
-
- pixd = pixCreate(wd, hd, outdepth);
- if ((background == 1 && outdepth == 1) ||
- (background == 0 && outdepth != 1))
- pixSetAll(pixd);
-
- /* Now blit images to pixd */
- x = y = spacing;
- irow = 0;
- for (i = 0; i < n; i++) {
- pix = pixaGetPix(pixan, i, L_CLONE);
- if (i == 0) {
- res = pixGetXRes(pix);
- pixSetResolution(pixd, res, res);
- }
- pixGetDimensions(pix, &w, &h, NULL);
- if (i && ((i % ncols) == 0)) { /* start new row */
- x = spacing;
- y += spacing + rowht[irow];
- irow++;
- }
- pixRasterop(pixd, x, y, w, h, PIX_SRC, pix, 0, 0);
- x += tilewidth + spacing;
- pixDestroy(&pix);
- }
-
- pixaDestroy(&pixan);
- LEPT_FREE(rowht);
- return pixd;
-}
-
-
-/*!
- * \brief pixaDisplayTiledWithText()
- *
- * \param[in] pixa
- * \param[in] maxwidth of output image
- * \param[in] scalefactor applied to every pix; use 1.0 for no scaling
- * \param[in] spacing between images, and on outside
- * \param[in] border width of black border added to each image;
- * use 0 for no border
- * \param[in] fontsize 4, 6, ... 20
- * \param[in] textcolor 0xrrggbb00
- * \return pixd of tiled images, or NULL on error
- *
- *
- * Notes:
- * (1) This is a version of pixaDisplayTiledInRows() that prints, below
- * each pix, the text in the pix text field. Up to 127 chars
- * of text in the pix text field are rendered below each pix.
- * (2) It renders a pixa to a single image of width not to
- * exceed %maxwidth, with white background color, with each row
- * tiled such that the top of each pix is aligned and separated
- * by %spacing from the next one.
- * (3) All pix are converted to 32 bpp.
- * (4) This does a reasonably spacewise-efficient job of laying
- * out the individual pix images into a tiled composite.
- *
- */
-PIX *
-pixaDisplayTiledWithText(PIXA *pixa,
- l_int32 maxwidth,
- l_float32 scalefactor,
- l_int32 spacing,
- l_int32 border,
- l_int32 fontsize,
- l_uint32 textcolor)
-{
-char buf[128];
-char *textstr;
-l_int32 i, n, maxw;
-L_BMF *bmf;
-PIX *pix1, *pix2, *pix3, *pix4, *pixd;
-PIXA *pixad;
-
- PROCNAME("pixaDisplayTiledWithText");
-
- if (!pixa)
- return (PIX *)ERROR_PTR("pixa not defined", procName, NULL);
- if ((n = pixaGetCount(pixa)) == 0)
- return (PIX *)ERROR_PTR("no components", procName, NULL);
- if (maxwidth <= 0)
- return (PIX *)ERROR_PTR("invalid maxwidth", procName, NULL);
- if (border < 0)
- border = 0;
- if (scalefactor <= 0.0) {
- L_WARNING("invalid scalefactor; setting to 1.0\n", procName);
- scalefactor = 1.0;
- }
- if (fontsize < 4 || fontsize > 20 || (fontsize & 1)) {
- l_int32 fsize = L_MAX(L_MIN(fontsize, 20), 4);
- if (fsize & 1) fsize--;
- L_WARNING("changed fontsize from %d to %d\n", procName,
- fontsize, fsize);
- fontsize = fsize;
- }
-
- /* Be sure the width can accommodate a single column of images */
- pixaSizeRange(pixa, NULL, NULL, &maxw, NULL);
- maxwidth = L_MAX(maxwidth, scalefactor * (maxw + 2 * spacing + 2 * border));
-
- bmf = bmfCreate(NULL, fontsize);
- pixad = pixaCreate(n);
- for (i = 0; i < n; i++) {
- pix1 = pixaGetPix(pixa, i, L_CLONE);
- pix2 = pixConvertTo32(pix1);
- pix3 = pixAddBorderGeneral(pix2, spacing, spacing, spacing,
- spacing, 0xffffff00);
- textstr = pixGetText(pix1);
- if (textstr && strlen(textstr) > 0) {
- snprintf(buf, sizeof(buf), "%s", textstr);
- pix4 = pixAddSingleTextblock(pix3, bmf, buf, textcolor,
- L_ADD_BELOW, NULL);
- } else {
- pix4 = pixClone(pix3);
- }
- pixaAddPix(pixad, pix4, L_INSERT);
- pixDestroy(&pix1);
- pixDestroy(&pix2);
- pixDestroy(&pix3);
- }
- bmfDestroy(&bmf);
-
- pixd = pixaDisplayTiledInRows(pixad, 32, maxwidth, scalefactor,
- 0, 10, border);
- pixaDestroy(&pixad);
- return pixd;
-}
-
-
-/*!
- * \brief pixaDisplayTiledByIndex()
- *
- * \param[in] pixa
- * \param[in] na numa with indices corresponding to the pix in pixa
- * \param[in] width each pix is scaled to this width
- * \param[in] spacing between images, and on outside
- * \param[in] border width of black border added to each image;
- * use 0 for no border
- * \param[in] fontsize 4, 6, ... 20
- * \param[in] textcolor 0xrrggbb00
- * \return pixd of tiled images, or NULL on error
- *
- *
- * Notes:
- * (1) This renders a pixa to a single image with white
- * background color, where the pix are placed in columns
- * given by the index value in the numa. Each pix
- * is separated by %spacing from the adjacent ones, and
- * an optional border is placed around them.
- * (2) Up to 127 chars of text in the pix text field are rendered
- * below each pix. Use newlines in the text field to write
- * the text in multiple lines that fit within the pix width.
- * (3) To avoid having empty columns, if there are N different
- * index values, they should be in [0 ... N-1].
- * (4) All pix are converted to 32 bpp.
- *
- */
-PIX *
-pixaDisplayTiledByIndex(PIXA *pixa,
- NUMA *na,
- l_int32 width,
- l_int32 spacing,
- l_int32 border,
- l_int32 fontsize,
- l_uint32 textcolor)
-{
-char buf[128];
-char *textstr;
-l_int32 i, n, x, y, w, h, yval, index;
-l_float32 maxindex;
-L_BMF *bmf;
-BOX *box;
-NUMA *nay; /* top of the next pix to add in that column */
-PIX *pix1, *pix2, *pix3, *pix4, *pix5, *pixd;
-PIXA *pixad;
-
- PROCNAME("pixaDisplayTiledByIndex");
-
- if (!pixa)
- return (PIX *)ERROR_PTR("pixa not defined", procName, NULL);
- if (!na)
- return (PIX *)ERROR_PTR("na not defined", procName, NULL);
- if ((n = pixaGetCount(pixa)) == 0)
- return (PIX *)ERROR_PTR("no pixa components", procName, NULL);
- if (n != numaGetCount(na))
- return (PIX *)ERROR_PTR("pixa and na counts differ", procName, NULL);
- if (width <= 0)
- return (PIX *)ERROR_PTR("invalid width", procName, NULL);
- if (width < 20)
- L_WARNING("very small width: %d\n", procName, width);
- if (border < 0)
- border = 0;
- if (fontsize < 4 || fontsize > 20 || (fontsize & 1)) {
- l_int32 fsize = L_MAX(L_MIN(fontsize, 20), 4);
- if (fsize & 1) fsize--;
- L_WARNING("changed fontsize from %d to %d\n", procName,
- fontsize, fsize);
- fontsize = fsize;
- }
-
- /* The pix will be rendered in the order they occupy in pixa. */
- bmf = bmfCreate(NULL, fontsize);
- pixad = pixaCreate(n);
- numaGetMax(na, &maxindex, NULL);
- nay = numaMakeConstant(spacing, lept_roundftoi(maxindex) + 1);
- for (i = 0; i < n; i++) {
- numaGetIValue(na, i, &index);
- numaGetIValue(nay, index, &yval);
- pix1 = pixaGetPix(pixa, i, L_CLONE);
- pix2 = pixConvertTo32(pix1);
- pix3 = pixScaleToSize(pix2, width, 0);
- pix4 = pixAddBorderGeneral(pix3, border, border, border, border, 0);
- textstr = pixGetText(pix1);
- if (textstr && strlen(textstr) > 0) {
- snprintf(buf, sizeof(buf), "%s", textstr);
- pix5 = pixAddTextlines(pix4, bmf, textstr, textcolor, L_ADD_BELOW);
- } else {
- pix5 = pixClone(pix4);
- }
- pixaAddPix(pixad, pix5, L_INSERT);
- x = spacing + border + index * (2 * border + width + spacing);
- y = yval;
- pixGetDimensions(pix5, &w, &h, NULL);
- yval += h + spacing;
- numaSetValue(nay, index, yval);
- box = boxCreate(x, y, w, h);
- pixaAddBox(pixad, box, L_INSERT);
- pixDestroy(&pix1);
- pixDestroy(&pix2);
- pixDestroy(&pix3);
- pixDestroy(&pix4);
- }
- numaDestroy(&nay);
- bmfDestroy(&bmf);
-
- pixd = pixaDisplay(pixad, 0, 0);
- pixaDestroy(&pixad);
- return pixd;
-}
-
-
-
-/*---------------------------------------------------------------------*
- * Pixaa Display *
- *---------------------------------------------------------------------*/
-/*!
- * \brief pixaaDisplay()
- *
- * \param[in] paa
- * \param[in] w, h if set to 0, the size is determined from the
- * bounding box of the components in pixa
- * \return pix, or NULL on error
- *
- *
- * Notes:
- * (1) Each pix of the paa is displayed at the location given by
- * its box, translated by the box of the containing pixa
- * if it exists.
- *
- */
-PIX *
-pixaaDisplay(PIXAA *paa,
- l_int32 w,
- l_int32 h)
-{
-l_int32 i, j, n, nbox, na, d, wmax, hmax, x, y, xb, yb, wb, hb;
-BOXA *boxa1; /* top-level boxa */
-BOXA *boxa;
-PIX *pix1, *pixd;
-PIXA *pixa;
-
- PROCNAME("pixaaDisplay");
-
- if (!paa)
- return (PIX *)ERROR_PTR("paa not defined", procName, NULL);
-
- n = pixaaGetCount(paa, NULL);
- if (n == 0)
- return (PIX *)ERROR_PTR("no components", procName, NULL);
-
- /* If w and h not input, determine the minimum size required
- * to contain the origin and all c.c. */
- boxa1 = pixaaGetBoxa(paa, L_CLONE);
- nbox = boxaGetCount(boxa1);
- if (w == 0 || h == 0) {
- if (nbox == n) {
- boxaGetExtent(boxa1, &w, &h, NULL);
- } else { /* have to use the lower-level boxa for each pixa */
- wmax = hmax = 0;
- for (i = 0; i < n; i++) {
- pixa = pixaaGetPixa(paa, i, L_CLONE);
- boxa = pixaGetBoxa(pixa, L_CLONE);
- boxaGetExtent(boxa, &w, &h, NULL);
- wmax = L_MAX(wmax, w);
- hmax = L_MAX(hmax, h);
- pixaDestroy(&pixa);
- boxaDestroy(&boxa);
- }
- w = wmax;
- h = hmax;
- }
- }
-
- /* Get depth from first pix */
- pixa = pixaaGetPixa(paa, 0, L_CLONE);
- pix1 = pixaGetPix(pixa, 0, L_CLONE);
- d = pixGetDepth(pix1);
- pixaDestroy(&pixa);
- pixDestroy(&pix1);
-
- if ((pixd = pixCreate(w, h, d)) == NULL) {
- boxaDestroy(&boxa1);
- return (PIX *)ERROR_PTR("pixd not made", procName, NULL);
- }
-
- x = y = 0;
- for (i = 0; i < n; i++) {
- pixa = pixaaGetPixa(paa, i, L_CLONE);
- if (nbox == n)
- boxaGetBoxGeometry(boxa1, i, &x, &y, NULL, NULL);
- na = pixaGetCount(pixa);
- for (j = 0; j < na; j++) {
- pixaGetBoxGeometry(pixa, j, &xb, &yb, &wb, &hb);
- pix1 = pixaGetPix(pixa, j, L_CLONE);
- pixRasterop(pixd, x + xb, y + yb, wb, hb, PIX_PAINT, pix1, 0, 0);
- pixDestroy(&pix1);
- }
- pixaDestroy(&pixa);
- }
- boxaDestroy(&boxa1);
-
- return pixd;
-}
-
-
-/*!
- * \brief pixaaDisplayByPixa()
- *
- * \param[in] paa
- * \param[in] maxnx maximum number of columns for rendering each pixa
- * \param[in] scalefactor applied to every pix; use 1.0 for no scaling
- * \param[in] hspacing between images on a row (in the pixa)
- * \param[in] vspacing between tiles rows, each corresponding to a pixa
- * \param[in] border width of black border added to each image;
- * use 0 for no border
- * \return pixd of images in %paa, tiled by pixa in row-major order
- *
- *
- * Notes:
- * (1) This renders a pixaa into a single image. The pix from each pixa
- * are rendered on a row. If the number of pix in the pixa is
- * larger than %maxnx, the pix will be rendered into more than 1 row.
- * To insure that each pixa is rendered into one row, use %maxnx
- * at least as large as the max number of pix in the pixa.
- * (2) Each row is tiled such that the top of each pix is aligned and
- * each pix is separated by %hspacing from the next one.
- * A black border can be added to each pix.
- * (3) The resulting pix from each row are then rendered vertically,
- * separated by %vspacing from each other.
- * (4) The output depth is determined by the largest depth of all
- * the pix in %paa. Colormaps are removed.
- *
- */
-PIX *
-pixaaDisplayByPixa(PIXAA *paa,
- l_int32 maxnx,
- l_float32 scalefactor,
- l_int32 hspacing,
- l_int32 vspacing,
- l_int32 border)
-{
-l_int32 i, n, vs;
-PIX *pix1, *pix2;
-PIXA *pixa1, *pixa2;
-
- PROCNAME("pixaaDisplayByPixa");
-
- if (!paa)
- return (PIX *)ERROR_PTR("paa not defined", procName, NULL);
- if (scalefactor <= 0.0) scalefactor = 1.0;
- if (hspacing < 0) hspacing = 0;
- if (vspacing < 0) vspacing = 0;
- if (border < 0) border = 0;
-
- if ((n = pixaaGetCount(paa, NULL)) == 0)
- return (PIX *)ERROR_PTR("no components", procName, NULL);
-
- /* Vertical spacing of amount %hspacing is also added at this step */
- pixa2 = pixaCreate(0);
- for (i = 0; i < n; i++) {
- pixa1 = pixaaGetPixa(paa, i, L_CLONE);
- pix1 = pixaDisplayTiledInColumns(pixa1, maxnx, scalefactor,
- hspacing, border);
- pixaAddPix(pixa2, pix1, L_INSERT);
- pixaDestroy(&pixa1);
- }
-
- vs = vspacing - 2 * hspacing;
- pix2 = pixaDisplayTiledInColumns(pixa2, 1, scalefactor, vs, 0);
- pixaDestroy(&pixa2);
- return pix2;
-}
-
-
-/*!
- * \brief pixaaDisplayTiledAndScaled()
- *
- * \param[in] paa
- * \param[in] outdepth output depth: 1, 8 or 32 bpp
- * \param[in] tilewidth each pix is scaled to this width
- * \param[in] ncols number of tiles in each row
- * \param[in] background 0 for white, 1 for black; this is the color
- * of the spacing between the images
- * \param[in] spacing between images, and on outside
- * \param[in] border width of additional black border on each image;
- * use 0 for no border
- * \return pixa of tiled images, one image for each pixa in
- * the paa, or NULL on error
- *
- *
- * Notes:
- * (1) For each pixa, this generates from all the pix a
- * tiled/scaled output pix, and puts it in the output pixa.
- * (2) See comments in pixaDisplayTiledAndScaled().
- *
- */
-PIXA *
-pixaaDisplayTiledAndScaled(PIXAA *paa,
- l_int32 outdepth,
- l_int32 tilewidth,
- l_int32 ncols,
- l_int32 background,
- l_int32 spacing,
- l_int32 border)
-{
-l_int32 i, n;
-PIX *pix;
-PIXA *pixa, *pixad;
-
- PROCNAME("pixaaDisplayTiledAndScaled");
-
- if (!paa)
- return (PIXA *)ERROR_PTR("paa not defined", procName, NULL);
- if (outdepth != 1 && outdepth != 8 && outdepth != 32)
- return (PIXA *)ERROR_PTR("outdepth not in {1, 8, 32}", procName, NULL);
- if (ncols <= 0)
- return (PIXA *)ERROR_PTR("ncols must be > 0", procName, NULL);
- if (border < 0 || border > tilewidth / 5)
- border = 0;
-
- if ((n = pixaaGetCount(paa, NULL)) == 0)
- return (PIXA *)ERROR_PTR("no components", procName, NULL);
-
- pixad = pixaCreate(n);
- for (i = 0; i < n; i++) {
- pixa = pixaaGetPixa(paa, i, L_CLONE);
- pix = pixaDisplayTiledAndScaled(pixa, outdepth, tilewidth, ncols,
- background, spacing, border);
- pixaAddPix(pixad, pix, L_INSERT);
- pixaDestroy(&pixa);
- }
-
- return pixad;
-}
-
-
-/*---------------------------------------------------------------------*
- * Conversion of all pix to specified type (e.g., depth) *
- *---------------------------------------------------------------------*/
-/*!
- * \brief pixaConvertTo1()
- *
- * \param[in] pixas
- * \param[in] thresh threshold for final binarization from 8 bpp gray
- * \return pixad, or NULL on error
- */
-PIXA *
-pixaConvertTo1(PIXA *pixas,
- l_int32 thresh)
-{
-l_int32 i, n;
-BOXA *boxa;
-PIX *pix1, *pix2;
-PIXA *pixad;
-
- PROCNAME("pixaConvertTo1");
-
- if (!pixas)
- return (PIXA *)ERROR_PTR("pixas not defined", procName, NULL);
-
- n = pixaGetCount(pixas);
- pixad = pixaCreate(n);
- for (i = 0; i < n; i++) {
- pix1 = pixaGetPix(pixas, i, L_CLONE);
- pix2 = pixConvertTo1(pix1, thresh);
- pixaAddPix(pixad, pix2, L_INSERT);
- pixDestroy(&pix1);
- }
-
- boxa = pixaGetBoxa(pixas, L_COPY);
- pixaSetBoxa(pixad, boxa, L_INSERT);
- return pixad;
-}
-
-
-/*!
- * \brief pixaConvertTo8()
- *
- * \param[in] pixas
- * \param[in] cmapflag 1 to give pixd a colormap; 0 otherwise
- * \return pixad each pix is 8 bpp, or NULL on error
- *
- *
- * Notes:
- * (1) See notes for pixConvertTo8(), applied to each pix in pixas.
- *
- */
-PIXA *
-pixaConvertTo8(PIXA *pixas,
- l_int32 cmapflag)
-{
-l_int32 i, n;
-BOXA *boxa;
-PIX *pix1, *pix2;
-PIXA *pixad;
-
- PROCNAME("pixaConvertTo8");
-
- if (!pixas)
- return (PIXA *)ERROR_PTR("pixas not defined", procName, NULL);
-
- n = pixaGetCount(pixas);
- pixad = pixaCreate(n);
- for (i = 0; i < n; i++) {
- pix1 = pixaGetPix(pixas, i, L_CLONE);
- pix2 = pixConvertTo8(pix1, cmapflag);
- pixaAddPix(pixad, pix2, L_INSERT);
- pixDestroy(&pix1);
- }
-
- boxa = pixaGetBoxa(pixas, L_COPY);
- pixaSetBoxa(pixad, boxa, L_INSERT);
- return pixad;
-}
-
-
-/*!
- * \brief pixaConvertTo8Colormap()
- *
- * \param[in] pixas
- * \param[in] dither 1 to dither if necessary; 0 otherwise
- * \return pixad each pix is 8 bpp, or NULL on error
- *
- *
- * Notes:
- * (1) See notes for pixConvertTo8Colormap(), applied to each pix in pixas.
- *
- */
-PIXA *
-pixaConvertTo8Colormap(PIXA *pixas,
- l_int32 dither)
-{
-l_int32 i, n;
-BOXA *boxa;
-PIX *pix1, *pix2;
-PIXA *pixad;
-
- PROCNAME("pixaConvertTo8Colormap");
-
- if (!pixas)
- return (PIXA *)ERROR_PTR("pixas not defined", procName, NULL);
-
- n = pixaGetCount(pixas);
- pixad = pixaCreate(n);
- for (i = 0; i < n; i++) {
- pix1 = pixaGetPix(pixas, i, L_CLONE);
- pix2 = pixConvertTo8Colormap(pix1, dither);
- pixaAddPix(pixad, pix2, L_INSERT);
- pixDestroy(&pix1);
- }
-
- boxa = pixaGetBoxa(pixas, L_COPY);
- pixaSetBoxa(pixad, boxa, L_INSERT);
- return pixad;
-}
-
-
-/*!
- * \brief pixaConvertTo32()
- *
- * \param[in] pixas
- * \return pixad 32 bpp rgb, or NULL on error
- *
- *
- * Notes:
- * (1) See notes for pixConvertTo32(), applied to each pix in pixas.
- * (2) This can be used to allow 1 bpp pix in a pixa to be displayed
- * with color.
- *
- */
-PIXA *
-pixaConvertTo32(PIXA *pixas)
-{
-l_int32 i, n;
-BOXA *boxa;
-PIX *pix1, *pix2;
-PIXA *pixad;
-
- PROCNAME("pixaConvertTo32");
-
- if (!pixas)
- return (PIXA *)ERROR_PTR("pixas not defined", procName, NULL);
-
- n = pixaGetCount(pixas);
- pixad = pixaCreate(n);
- for (i = 0; i < n; i++) {
- pix1 = pixaGetPix(pixas, i, L_CLONE);
- pix2 = pixConvertTo32(pix1);
- pixaAddPix(pixad, pix2, L_INSERT);
- pixDestroy(&pix1);
- }
-
- boxa = pixaGetBoxa(pixas, L_COPY);
- pixaSetBoxa(pixad, boxa, L_INSERT);
- return pixad;
-}
-
-
-/*---------------------------------------------------------------------*
- * Pixa constrained selection *
- *---------------------------------------------------------------------*/
-/*!
- * \brief pixaConstrainedSelect()
- *
- * \param[in] pixas
- * \param[in] first first index to choose; >= 0
- * \param[in] last biggest possible index to reach;
- * use -1 to go to the end; otherwise, last >= first
- * \param[in] nmax maximum number of pix to select; > 0
- * \param[in] use_pairs 1 = select pairs of adjacent pix;
- * 0 = select individual pix
- * \param[in] copyflag L_COPY, L_CLONE
- * \return pixad if OK, NULL on error
- *
- *
- * Notes:
- * (1) See notes in genConstrainedNumaInRange() for how selection
- * is made.
- * (2) This returns a selection of the pix in the input pixa.
- * (3) Use copyflag == L_COPY if you don't want changes in the pix
- * in the returned pixa to affect those in the input pixa.
- *
- */
-PIXA *
-pixaConstrainedSelect(PIXA *pixas,
- l_int32 first,
- l_int32 last,
- l_int32 nmax,
- l_int32 use_pairs,
- l_int32 copyflag)
-{
-l_int32 i, n, nselect, index;
-NUMA *na;
-PIX *pix1;
-PIXA *pixad;
-
- PROCNAME("pixaConstrainedSelect");
-
- if (!pixas)
- return (PIXA *)ERROR_PTR("pixas not defined", procName, NULL);
- n = pixaGetCount(pixas);
- first = L_MAX(0, first);
- last = (last < 0) ? n - 1 : L_MIN(n - 1, last);
- if (last < first)
- return (PIXA *)ERROR_PTR("last < first!", procName, NULL);
- if (nmax < 1)
- return (PIXA *)ERROR_PTR("nmax < 1!", procName, NULL);
-
- na = genConstrainedNumaInRange(first, last, nmax, use_pairs);
- nselect = numaGetCount(na);
- pixad = pixaCreate(nselect);
- for (i = 0; i < nselect; i++) {
- numaGetIValue(na, i, &index);
- pix1 = pixaGetPix(pixas, index, copyflag);
- pixaAddPix(pixad, pix1, L_INSERT);
- }
- numaDestroy(&na);
- return pixad;
-}
-
-
-/*!
- * \brief pixaSelectToPdf()
- *
- * \param[in] pixas
- * \param[in] first first index to choose; >= 0
- * \param[in] last biggest possible index to reach;
- * use -1 to go to the end; otherwise, last >= first
- * \param[in] res override the resolution of each input image, in ppi;
- * use 0 to respect the resolution embedded in the input
- * \param[in] scalefactor scaling factor applied to each image; > 0.0
- * \param[in] type encoding type (L_JPEG_ENCODE, L_G4_ENCODE,
- * L_FLATE_ENCODE, or 0 for default
- * \param[in] quality used for JPEG only; 0 for default (75)
- * \param[in] color of numbers added to each image (e.g., 0xff000000)
- * \param[in] fontsize to print number below each image. The valid set
- * is {4,6,8,10,12,14,16,18,20}. Use 0 to disable.
- * \param[in] fileout pdf file of all images
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This writes a pdf of the selected images from %pixas, one to
- * a page. They are optionally scaled and annotated with the
- * index printed to the left of the image.
- * (2) If the input images are 1 bpp and you want the numbers to be
- * in color, first promote each pix to 8 bpp with a colormap:
- * pixa1 = pixaConvertTo8(pixas, 1);
- * and then call this function with the specified color
- *
- */
-l_ok
-pixaSelectToPdf(PIXA *pixas,
- l_int32 first,
- l_int32 last,
- l_int32 res,
- l_float32 scalefactor,
- l_int32 type,
- l_int32 quality,
- l_uint32 color,
- l_int32 fontsize,
- const char *fileout)
-{
-l_int32 n;
-L_BMF *bmf;
-NUMA *na;
-PIXA *pixa1, *pixa2;
-
- PROCNAME("pixaSelectToPdf");
-
- if (!pixas)
- return ERROR_INT("pixas not defined", procName, 1);
- if (type < 0 || type > L_FLATE_ENCODE) {
- L_WARNING("invalid compression type; using default\n", procName);
- type = 0;
- }
- if (!fileout)
- return ERROR_INT("fileout not defined", procName, 1);
-
- /* Select from given range */
- n = pixaGetCount(pixas);
- first = L_MAX(0, first);
- last = (last < 0) ? n - 1 : L_MIN(n - 1, last);
- if (first > last) {
- L_ERROR("first = %d > last = %d\n", procName, first, last);
- return 1;
- }
- pixa1 = pixaSelectRange(pixas, first, last, L_CLONE);
-
- /* Optionally add index numbers */
- bmf = (fontsize <= 0) ? NULL : bmfCreate(NULL, fontsize);
- if (bmf) {
- na = numaMakeSequence(first, 1.0, last - first + 1);
- pixa2 = pixaAddTextNumber(pixa1, bmf, na, color, L_ADD_LEFT);
- numaDestroy(&na);
- } else {
- pixa2 = pixaCopy(pixa1, L_CLONE);
- }
- pixaDestroy(&pixa1);
- bmfDestroy(&bmf);
-
- pixaConvertToPdf(pixa2, res, scalefactor, type, quality, NULL, fileout);
- pixaDestroy(&pixa2);
- return 0;
-}
-
-
-/*---------------------------------------------------------------------*
- * Generate pixa from tiled images *
- *---------------------------------------------------------------------*/
-/*!
- * \brief pixaMakeFromTiledPixa()
- *
- * \param[in] pixas of mosaiced templates, one for each digit
- * \param[in] w width of samples (use 0 for default = 20)
- * \param[in] h height of samples (use 0 for default = 30)
- * \param[in] nsamp number of requested samples (use 0 for default = 100)
- * \return pixa of individual, scaled templates, or NULL on error
- *
- *
- * Notes:
- * (1) This converts from a compressed representation of 1 bpp digit
- * templates to a pixa where each pix has a single labeled template.
- * (2) The mosaics hold 100 templates each, and the number of templates
- * %nsamp selected for each digit can be between 1 and 100.
- * (3) Each mosaic has the number of images written in the text field,
- * and the i-th pix contains samples of the i-th digit. That value
- * is written into the text field of each template in the output.
- *
- */
-PIXA *
-pixaMakeFromTiledPixa(PIXA *pixas,
- l_int32 w,
- l_int32 h,
- l_int32 nsamp)
-{
-char buf[8];
-l_int32 ntiles, i;
-PIX *pix1;
-PIXA *pixad, *pixa1;
-
- PROCNAME("pixaMakeFromTiledPixa");
-
- if (!pixas)
- return (PIXA *)ERROR_PTR("pixas not defined", procName, NULL);
- if (nsamp > 1000)
- return (PIXA *)ERROR_PTR("nsamp too large; typ. 100", procName, NULL);
-
- if (w <= 0) w = 20;
- if (h <= 0) h = 30;
- if (nsamp <= 0) nsamp = 100;
-
- /* pixas has 10 pix of mosaic'd digits. Each of these images
- * must be extracted into a pixa of templates, where each template
- * is labeled with the digit value, and then selectively
- * concatenated into an output pixa. */
- pixad = pixaCreate(10 * nsamp);
- for (i = 0; i < 10; i++) {
- pix1 = pixaGetPix(pixas, i, L_CLONE);
- pixGetTileCount(pix1, &ntiles);
- if (nsamp > ntiles)
- L_WARNING("requested %d; only %d tiles\n", procName, nsamp, ntiles);
- pixa1 = pixaMakeFromTiledPix(pix1, w, h, 0, nsamp, NULL);
- snprintf(buf, sizeof(buf), "%d", i);
- pixaSetText(pixa1, buf, NULL);
- pixaJoin(pixad, pixa1, 0, -1);
- pixaDestroy(&pixa1);
- pixDestroy(&pix1);
- }
- return pixad;
-}
-
-
-/*!
- * \brief pixaMakeFromTiledPix()
- *
- * \param[in] pixs any depth; colormap OK
- * \param[in] w width of each tile
- * \param[in] h height of each tile
- * \param[in] start first tile to use
- * \param[in] num number of tiles; use 0 to go to the end
- * \param[in] boxa [optional] location of rectangular regions
- * to be extracted
- * \return pixa if OK, NULL on error
- *
- *
- * Notes:
- * (1) Operations that generate a pix by tiling from a pixa, and
- * the inverse that generate a pixa from tiles of a pix,
- * are useful. One such pair is pixaDisplayUnsplit() and
- * pixaSplitPix(). This function is a very simple one that
- * generates a pixa from tiles of a pix. There are two cases:
- * - the tiles can all be the same size (the inverse of
- * pixaDisplayOnLattice(), or
- * - the tiles can differ in size, where there is an
- * associated boxa (the inverse of pixaCreateFromBoxa().
- * (2) If all tiles are the same size, %w by %h, use %boxa = NULL.
- * If the tiles differ in size, use %boxa to extract the
- * individual images (%w and %h are then ignored).
- * (3) If the pix was made by pixaDisplayOnLattice(), the number
- * of tiled images is written into the text field, in the format
- * n = .
- * (4) Typical usage: a set of character templates all scaled to
- * the same size can be stored on a lattice of that size in
- * a pix, and this function can regenerate the pixa. If the
- * templates differ in size, a boxa generated when the tiled
- * pix was made can be used to indicate the location of
- * the templates.
- *
- */
-PIXA *
-pixaMakeFromTiledPix(PIX *pixs,
- l_int32 w,
- l_int32 h,
- l_int32 start,
- l_int32 num,
- BOXA *boxa)
-{
-l_int32 i, j, k, ws, hs, d, nx, ny, n, n_isvalid, ntiles, nmax;
-PIX *pix1;
-PIXA *pixa1;
-PIXCMAP *cmap;
-
- PROCNAME("pixaMakeFromTiledPix");
-
- if (!pixs)
- return (PIXA *)ERROR_PTR("pixs not defined", procName, NULL);
- if (!boxa && (w <= 0 || h <= 0))
- return (PIXA *)ERROR_PTR("w and h must be > 0", procName, NULL);
-
- if (boxa) /* general case */
- return pixaCreateFromBoxa(pixs, boxa, start, num, NULL);
-
- /* All tiles are the same size */
- pixGetDimensions(pixs, &ws, &hs, &d);
- nx = ws / w;
- ny = hs / h;
- if (nx < 1 || ny < 1)
- return (PIXA *)ERROR_PTR("invalid dimensions", procName, NULL);
- if (nx * w != ws || ny * h != hs)
- L_WARNING("some tiles will be clipped\n", procName);
-
- /* Check the text field of the pix. It may tell how many
- * tiles hold valid data. If a valid value is not found,
- * assume all (nx * ny) tiles are valid. */
- pixGetTileCount(pixs, &n);
- n_isvalid = (n <= nx * ny && n > nx * (ny - 1)) ? TRUE : FALSE;
- ntiles = (n_isvalid) ? n : nx * ny;
- nmax = ntiles - start; /* max available from start */
- num = (num == 0) ? nmax : L_MIN(num, nmax);
-
- /* Extract the tiles */
- if ((pixa1 = pixaCreate(num)) == NULL) {
- return (PIXA *)ERROR_PTR("pixa1 not made", procName, NULL);
- }
- cmap = pixGetColormap(pixs);
- for (i = 0, k = 0; i < ny; i++) {
- for (j = 0; j < nx; j++, k++) {
- if (k < start) continue;
- if (k >= start + num) break;
- pix1 = pixCreate(w, h, d);
- if (cmap) pixSetColormap(pix1, pixcmapCopy(cmap));
- pixRasterop(pix1, 0, 0, w, h, PIX_SRC, pixs, j * w, i * h);
- pixaAddPix(pixa1, pix1, L_INSERT);
- }
- }
- return pixa1;
-}
-
-
-/*!
- * \brief pixGetTileCount()
- *
- * \param[in] pix
- * \param[out] *pn number embedded in pix text field
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) If the pix was made by pixaDisplayOnLattice(), the number
- * of tiled images is written into the text field, in the format
- * n = .
- * (2) This returns 0 if the data is not in the text field, or on error.
- *
- */
-l_ok
-pixGetTileCount(PIX *pix,
- l_int32 *pn)
-{
-char *text;
-l_int32 n;
-
- PROCNAME("pixGetTileCount");
-
- if (!pn)
- return ERROR_INT("&n not defined", procName, 1);
- *pn = 0;
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
-
- text = pixGetText(pix);
- if (text && strlen(text) > 4) {
- if (sscanf(text, "n = %d", &n) == 1)
- *pn = n;
- }
- return 0;
-}
-
-
-/*---------------------------------------------------------------------*
- * Pixa display into multiple tiles *
- *---------------------------------------------------------------------*/
-/*!
- * \brief pixaDisplayMultiTiled()
- *
- * \param[in] pixas
- * \param[in] nx, ny in [1, ... 50], tiling factors in each direction
- * \param[in] maxw, maxh max sizes to keep
- * \param[in] scalefactor scale each image by this
- * \param[in] spacing between images, and on outside
- * \param[in] border width of additional black border on each image;
- * use 0 for no border
- * \return pixad if OK, NULL on error
- *
- *
- * Notes:
- * (1) Each set of %nx * %ny images is optionally scaled and saved
- * into a new pix, and then aggregated.
- * (2) Set %maxw = %maxh = 0 if you want to include all pix from %pixs.
- * (3) This is useful for generating a pdf from the output pixa, where
- * each page is a tile of (%nx * %ny) images from the input pixa.
- *
- */
-PIXA *
-pixaDisplayMultiTiled(PIXA *pixas,
- l_int32 nx,
- l_int32 ny,
- l_int32 maxw,
- l_int32 maxh,
- l_float32 scalefactor,
- l_int32 spacing,
- l_int32 border)
-{
-l_int32 n, i, j, ntile, nout, index;
-PIX *pix1, *pix2;
-PIXA *pixa1, *pixa2, *pixad;
-
- PROCNAME("pixaDisplayMultiTiled");
-
- if (!pixas)
- return (PIXA *)ERROR_PTR("pixas not defined", procName, NULL);
- if (nx < 1 || ny < 1 || nx > 50 || ny > 50)
- return (PIXA *)ERROR_PTR("invalid tiling factor(s)", procName, NULL);
- if ((n = pixaGetCount(pixas)) == 0)
- return (PIXA *)ERROR_PTR("pixas is empty", procName, NULL);
-
- /* Filter out large ones if requested */
- if (maxw == 0 && maxh == 0) {
- pixa1 = pixaCopy(pixas, L_CLONE);
- } else {
- maxw = (maxw == 0) ? 1000000 : maxw;
- maxh = (maxh == 0) ? 1000000 : maxh;
- pixa1 = pixaSelectBySize(pixas, maxw, maxh, L_SELECT_IF_BOTH,
- L_SELECT_IF_LTE, NULL);
- n = pixaGetCount(pixa1);
- }
-
- ntile = nx * ny;
- nout = L_MAX(1, (n + ntile - 1) / ntile);
- pixad = pixaCreate(nout);
- for (i = 0, index = 0; i < nout; i++) { /* over tiles */
- pixa2 = pixaCreate(ntile);
- for (j = 0; j < ntile && index < n; j++, index++) {
- pix1 = pixaGetPix(pixa1, index, L_COPY);
- pixaAddPix(pixa2, pix1, L_INSERT);
- }
- pix2 = pixaDisplayTiledInColumns(pixa2, nx, scalefactor, spacing,
- border);
- pixaAddPix(pixad, pix2, L_INSERT);
- pixaDestroy(&pixa2);
- }
- pixaDestroy(&pixa1);
-
- return pixad;
-}
-
-
-/*---------------------------------------------------------------------*
- * Split pixa into files *
- *---------------------------------------------------------------------*/
-/*!
- * \brief pixaSplitIntoFiles()
- *
- * \param[in] pixas
- * \param[in] nsplit split pixas into this number of pixa; >= 2
- * \param[in] scale scalefactor applied to each pix
- * \param[in] outwidth the maxwidth parameter of tiled images
- * for write_pix
- * \param[in] write_pixa 1 to write the split pixa as separate files
- * \param[in] write_pix 1 to write tiled images of the split pixa
- * \param[in] write_pdf 1 to write pdfs of the split pixa
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) For each requested output, %nsplit files are written into
- * directory /tmp/lept/split/.
- * (2) This is useful when a pixa is so large that the images
- * are not conveniently displayed as a single tiled image at
- * full resolution.
- *
- */
-l_ok
-pixaSplitIntoFiles(PIXA *pixas,
- l_int32 nsplit,
- l_float32 scale,
- l_int32 outwidth,
- l_int32 write_pixa,
- l_int32 write_pix,
- l_int32 write_pdf)
-{
-char buf[64];
-l_int32 i, j, index, n, nt;
-PIX *pix1, *pix2;
-PIXA *pixa1;
-
- PROCNAME("pixaSplitIntoFiles");
-
- if (!pixas)
- return ERROR_INT("pixas not defined", procName, 1);
- if (nsplit <= 1)
- return ERROR_INT("nsplit must be >= 2", procName, 1);
- if ((nt = pixaGetCount(pixas)) == 0)
- return ERROR_INT("pixas is empty", procName, 1);
- if (!write_pixa && !write_pix && !write_pdf)
- return ERROR_INT("no output is requested", procName, 1);
-
- lept_mkdir("lept/split");
- n = (nt + nsplit - 1) / nsplit;
- lept_stderr("nt = %d, n = %d, nsplit = %d\n", nt, n, nsplit);
- for (i = 0, index = 0; i < nsplit; i++) {
- pixa1 = pixaCreate(n);
- for (j = 0; j < n && index < nt; j++, index++) {
- pix1 = pixaGetPix(pixas, index, L_CLONE);
- pix2 = pixScale(pix1, scale, scale);
- pixaAddPix(pixa1, pix2, L_INSERT);
- pixDestroy(&pix1);
- }
- if (write_pixa) {
- snprintf(buf, sizeof(buf), "/tmp/lept/split/split%d.pa", i + 1);
- pixaWriteDebug(buf, pixa1);
- }
- if (write_pix) {
- snprintf(buf, sizeof(buf), "/tmp/lept/split/split%d.tif", i + 1);
- pix1 = pixaDisplayTiledInRows(pixa1, 1, outwidth, 1.0, 0, 20, 2);
- pixWriteDebug(buf, pix1, IFF_TIFF_G4);
- pixDestroy(&pix1);
- }
- if (write_pdf) {
- snprintf(buf, sizeof(buf), "/tmp/lept/split/split%d.pdf", i + 1);
- pixaConvertToPdf(pixa1, 0, 1.0, L_G4_ENCODE, 0, buf, buf);
- }
- pixaDestroy(&pixa1);
- }
-
- return 0;
-}
-
-
-/*---------------------------------------------------------------------*
- * Tile N-Up *
- *---------------------------------------------------------------------*/
-/*!
- * \brief convertToNUpFiles()
- *
- * \param[in] dir full path to directory of images
- * \param[in] substr [optional] can be null
- * \param[in] nx, ny in [1, ... 50], tiling factors in each direction
- * \param[in] tw target width, in pixels; must be >= 20
- * \param[in] spacing between images, and on outside
- * \param[in] border width of additional black border on each image;
- * use 0 for no border
- * \param[in] fontsize to print tail of filename with image. Valid set is
- * {4,6,8,10,12,14,16,18,20}. Use 0 to disable.
- * \param[in] outdir subdirectory of /tmp to put N-up tiled images
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) Each set of %nx * %ny images is scaled and tiled into a single
- * image, that is written out to %outdir.
- * (2) All images in each %nx * %ny set are scaled to the same
- * width, %tw. This is typically used when all images are
- * roughly the same size.
- * (3) This is useful for generating a pdf from the set of input
- * files, where each page is a tile of (%nx * %ny) input images.
- * Typical values for %nx and %ny are in the range [2 ... 5].
- * (4) If %fontsize != 0, each image has the tail of its filename
- * rendered below it.
- *
- */
-l_ok
-convertToNUpFiles(const char *dir,
- const char *substr,
- l_int32 nx,
- l_int32 ny,
- l_int32 tw,
- l_int32 spacing,
- l_int32 border,
- l_int32 fontsize,
- const char *outdir)
-{
-l_int32 d, format;
-char rootpath[256];
-PIXA *pixa;
-
- PROCNAME("convertToNUpFiles");
-
- if (!dir)
- return ERROR_INT("dir not defined", procName, 1);
- if (nx < 1 || ny < 1 || nx > 50 || ny > 50)
- return ERROR_INT("invalid tiling N-factor", procName, 1);
- if (fontsize < 0 || fontsize > 20 || fontsize & 1 || fontsize == 2)
- return ERROR_INT("invalid fontsize", procName, 1);
- if (!outdir)
- return ERROR_INT("outdir not defined", procName, 1);
-
- pixa = convertToNUpPixa(dir, substr, nx, ny, tw, spacing, border,
- fontsize);
- if (!pixa)
- return ERROR_INT("pixa not made", procName, 1);
-
- lept_rmdir(outdir);
- lept_mkdir(outdir);
- pixaGetRenderingDepth(pixa, &d);
- format = (d == 1) ? IFF_TIFF_G4 : IFF_JFIF_JPEG;
- makeTempDirname(rootpath, 256, outdir);
- modifyTrailingSlash(rootpath, 256, L_ADD_TRAIL_SLASH);
- pixaWriteFiles(rootpath, pixa, format);
- pixaDestroy(&pixa);
- return 0;
-}
-
-
-/*!
- * \brief convertToNUpPixa()
- *
- * \param[in] dir full path to directory of images
- * \param[in] substr [optional] can be null
- * \param[in] nx, ny in [1, ... 50], tiling factors in each direction
- * \param[in] tw target width, in pixels; must be >= 20
- * \param[in] spacing between images, and on outside
- * \param[in] border width of additional black border on each image;
- * use 0 for no border
- * \param[in] fontsize to print tail of filename with image. Valid set is
- * {4,6,8,10,12,14,16,18,20}. Use 0 to disable.
- * \return pixad, or NULL on error
- *
- *
- * Notes:
- * (1) See notes for convertToNUpFiles()
- *
- */
-PIXA *
-convertToNUpPixa(const char *dir,
- const char *substr,
- l_int32 nx,
- l_int32 ny,
- l_int32 tw,
- l_int32 spacing,
- l_int32 border,
- l_int32 fontsize)
-{
-l_int32 i, n;
-char *fname, *tail;
-PIXA *pixa1, *pixa2;
-SARRAY *sa1, *sa2;
-
- PROCNAME("convertToNUpPixa");
-
- if (!dir)
- return (PIXA *)ERROR_PTR("dir not defined", procName, NULL);
- if (nx < 1 || ny < 1 || nx > 50 || ny > 50)
- return (PIXA *)ERROR_PTR("invalid tiling N-factor", procName, NULL);
- if (tw < 20)
- return (PIXA *)ERROR_PTR("tw must be >= 20", procName, NULL);
- if (fontsize < 0 || fontsize > 20 || fontsize & 1 || fontsize == 2)
- return (PIXA *)ERROR_PTR("invalid fontsize", procName, NULL);
-
- sa1 = getSortedPathnamesInDirectory(dir, substr, 0, 0);
- pixa1 = pixaReadFilesSA(sa1);
- n = sarrayGetCount(sa1);
- sa2 = sarrayCreate(n);
- for (i = 0; i < n; i++) {
- fname = sarrayGetString(sa1, i, L_NOCOPY);
- splitPathAtDirectory(fname, NULL, &tail);
- sarrayAddString(sa2, tail, L_INSERT);
- }
- sarrayDestroy(&sa1);
- pixa2 = pixaConvertToNUpPixa(pixa1, sa2, nx, ny, tw, spacing,
- border, fontsize);
- pixaDestroy(&pixa1);
- sarrayDestroy(&sa2);
- return pixa2;
-}
-
-
-/*!
- * \brief pixaConvertToNUpPixa()
- *
- * \param[in] pixas
- * \param[in] sa [optional] array of strings associated with each pix
- * \param[in] nx, ny in [1, ... 50], tiling factors in each direction
- * \param[in] tw target width, in pixels; must be >= 20
- * \param[in] spacing between images, and on outside
- * \param[in] border width of additional black border on each image;
- * use 0 for no border
- * \param[in] fontsize to print string with each image. Valid set is
- * {4,6,8,10,12,14,16,18,20}. Use 0 to disable.
- * \return pixad, or NULL on error
- *
- *
- * Notes:
- * (1) This takes an input pixa and an optional array of strings, and
- * generates a pixa of NUp tiles from the input, labeled with
- * the strings if they exist and %fontsize != 0.
- * (2) See notes for convertToNUpFiles()
- *
- */
-PIXA *
-pixaConvertToNUpPixa(PIXA *pixas,
- SARRAY *sa,
- l_int32 nx,
- l_int32 ny,
- l_int32 tw,
- l_int32 spacing,
- l_int32 border,
- l_int32 fontsize)
-{
-l_int32 i, j, k, nt, n2, nout, d;
-char *str;
-L_BMF *bmf;
-PIX *pix1, *pix2, *pix3, *pix4;
-PIXA *pixa1, *pixad;
-
- PROCNAME("pixaConvertToNUpPixa");
-
- if (!pixas)
- return (PIXA *)ERROR_PTR("pixas not defined", procName, NULL);
- if (nx < 1 || ny < 1 || nx > 50 || ny > 50)
- return (PIXA *)ERROR_PTR("invalid tiling N-factor", procName, NULL);
- if (tw < 20)
- return (PIXA *)ERROR_PTR("tw must be >= 20", procName, NULL);
- if (fontsize < 0 || fontsize > 20 || fontsize & 1 || fontsize == 2)
- return (PIXA *)ERROR_PTR("invalid fontsize", procName, NULL);
-
- nt = pixaGetCount(pixas);
- if (sa && (sarrayGetCount(sa) != nt)) {
- L_WARNING("pixa size %d not equal to sarray size %d\n", procName,
- nt, sarrayGetCount(sa));
- }
-
- n2 = nx * ny;
- nout = (nt + n2 - 1) / n2;
- pixad = pixaCreate(nout);
- bmf = (fontsize == 0) ? NULL : bmfCreate(NULL, fontsize);
- for (i = 0, j = 0; i < nout; i++) {
- pixa1 = pixaCreate(n2);
- for (k = 0; k < n2 && j < nt; j++, k++) {
- pix1 = pixaGetPix(pixas, j, L_CLONE);
- pix2 = pixScaleToSize(pix1, tw, 0); /* all images have width tw */
- if (bmf && sa) {
- str = sarrayGetString(sa, j, L_NOCOPY);
- pix3 = pixAddTextlines(pix2, bmf, str, 0xff000000,
- L_ADD_BELOW);
- } else {
- pix3 = pixClone(pix2);
- }
- pixaAddPix(pixa1, pix3, L_INSERT);
- pixDestroy(&pix1);
- pixDestroy(&pix2);
- }
- if (pixaGetCount(pixa1) == 0) { /* probably won't happen */
- pixaDestroy(&pixa1);
- continue;
- }
-
- /* Add 2 * border to image width to prevent scaling */
- pixaGetRenderingDepth(pixa1, &d);
- pix4 = pixaDisplayTiledAndScaled(pixa1, d, tw + 2 * border, nx, 0,
- spacing, border);
- pixaAddPix(pixad, pix4, L_INSERT);
- pixaDestroy(&pixa1);
- }
-
- bmfDestroy(&bmf);
- return pixad;
-}
-
-
-/*---------------------------------------------------------------------*
- * Render two pixa side-by-side for comparison *
- *---------------------------------------------------------------------*/
-/*!
- * \brief pixaCompareInPdf()
- *
- * \param[in] pixa1
- * \param[in] pixa2
- * \param[in] nx, ny in [1, ... 20], tiling factors in each direction
- * \param[in] tw target width, in pixels; must be >= 20
- * \param[in] spacing between images, and on outside
- * \param[in] border width of additional black border on each image
- * and on each pair; use 0 for no border
- * \param[in] fontsize to print index of each pair of images. Valid set
- * is {4,6,8,10,12,14,16,18,20}. Use 0 to disable.
- * \param[in] fileout output pdf file
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This takes two pixa and renders them interleaved, side-by-side
- * in a pdf. A warning is issued if the input pixa arrays
- * have different lengths.
- * (2) %nx and %ny specify how many side-by-side pairs are displayed
- * on each pdf page. For example, if %nx = 1 and %ny = 2, then
- * two pairs are shown, one above the other, on each page.
- * (3) The input pix are scaled to a target width of %tw, and
- * then paired with optional %spacing between and optional
- * black border of width %border.
- * (4) After a pixa is generated of these tiled images, it is
- * written to %fileout as a pdf.
- * (5) Typical numbers for the input parameters are:
- * %nx = small integer (1 - 4)
- * %ny = 2 * %nx
- * %tw = 200 - 500 pixels
- * %spacing = 10
- * %border = 2
- * %fontsize = 10
- * (6) If %fontsize != 0, the index of the pix pair in their pixa
- * is printed out below each pair.
- *
- */
-l_ok
-pixaCompareInPdf(PIXA *pixa1,
- PIXA *pixa2,
- l_int32 nx,
- l_int32 ny,
- l_int32 tw,
- l_int32 spacing,
- l_int32 border,
- l_int32 fontsize,
- const char *fileout)
-{
-l_int32 n1, n2, npairs;
-PIXA *pixa3, *pixa4, *pixa5;
-SARRAY *sa;
-
- PROCNAME("pixaCompareInPdf");
-
- if (!pixa1 || !pixa2)
- return ERROR_INT("pixa1 and pixa2 not both defined", procName, 1);
- if (nx < 1 || ny < 1 || nx > 20 || ny > 20)
- return ERROR_INT("invalid tiling factors", procName, 1);
- if (tw < 20)
- return ERROR_INT("invalid tw; tw must be >= 20", procName, 1);
- if (fontsize < 0 || fontsize > 20 || fontsize & 1 || fontsize == 2)
- return ERROR_INT("invalid fontsize", procName, 1);
- if (!fileout)
- return ERROR_INT("fileout not defined", procName, 1);
- n1 = pixaGetCount(pixa1);
- n2 = pixaGetCount(pixa2);
- if (n1 == 0 || n2 == 0)
- return ERROR_INT("at least one pixa is empty", procName, 1);
- if (n1 != n2)
- L_WARNING("sizes (%d, %d) differ; using the minimum in interleave\n",
- procName, n1, n2);
-
- /* Interleave the input pixa */
- if ((pixa3 = pixaInterleave(pixa1, pixa2, L_CLONE)) == NULL)
- return ERROR_INT("pixa3 not made", procName, 1);
-
- /* Scale the images if necessary and pair them up side/by/side */
- pixa4 = pixaConvertToNUpPixa(pixa3, NULL, 2, 1, tw, spacing, border, 0);
- pixaDestroy(&pixa3);
-
- /* Label the pairs and mosaic into pages without further scaling */
- npairs = pixaGetCount(pixa4);
- sa = (fontsize > 0) ? sarrayGenerateIntegers(npairs) : NULL;
- pixa5 = pixaConvertToNUpPixa(pixa4, sa, nx, ny,
- 2 * tw + 4 * border + spacing,
- spacing, border, fontsize);
- pixaDestroy(&pixa4);
- sarrayDestroy(&sa);
-
- /* Output as pdf without scaling */
- pixaConvertToPdf(pixa5, 0, 1.0, 0, 0, NULL, fileout);
- pixaDestroy(&pixa5);
- return 0;
-}
-
-
diff --git a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pixalloc.c b/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pixalloc.c
deleted file mode 100644
index 72e86ce6..00000000
--- a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pixalloc.c
+++ /dev/null
@@ -1,536 +0,0 @@
-/*====================================================================*
- - Copyright (C) 2001 Leptonica. All rights reserved.
- -
- - Redistribution and use in source and binary forms, with or without
- - modification, are permitted provided that the following conditions
- - are met:
- - 1. Redistributions of source code must retain the above copyright
- - notice, this list of conditions and the following disclaimer.
- - 2. Redistributions in binary form must reproduce the above
- - copyright notice, this list of conditions and the following
- - disclaimer in the documentation and/or other materials
- - provided with the distribution.
- -
- - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- - ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- - LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- - A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL ANY
- - CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
- - EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
- - PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
- - PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
- - OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
- - NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- *====================================================================*/
-
-/*!
- * \file pixalloc.c
- *
- *
- * Custom memory storage with allocator and deallocator
- *
- * l_int32 pmsCreate()
- * void pmsDestroy()
- * void *pmsCustomAlloc()
- * void pmsCustomDealloc()
- * void *pmsGetAlloc()
- * l_int32 pmsGetLevelForAlloc()
- * l_int32 pmsGetLevelForDealloc()
- * void pmsLogInfo()
- *
- */
-
-#ifdef HAVE_CONFIG_H
-#include
-#endif /* HAVE_CONFIG_H */
-
-#include "allheaders.h"
-
-/*-------------------------------------------------------------------------*
- * Pix Memory Storage *
- * *
- * This is a simple utility for handling pix memory storage. It is *
- * enabled by setting the PixMemoryManager allocators to the functions *
- * that are defined here *
- * pmsCustomAlloc() *
- * pmsCustomDealloc() *
- * Use pmsCreate() at the beginning to do the pre-allocation, and *
- * pmsDestroy() at the end to clean it up. *
- *-------------------------------------------------------------------------*/
-/*
- * In the following, the "memory" refers to the image data
- * field that is used within the pix. The memory store is a
- * continuous block of memory, that is logically divided into
- * smaller "chunks" starting with a set at a minimum size, and
- * followed by sets of increasing size that are a power of 2 larger
- * than the minimum size. You must specify the number of chunks
- * of each size.
- *
- * A requested data chunk, if it exists, is borrowed from the memory
- * storage, and returned after use. If the chunk is too small, or
- * too large, or if all chunks in the appropriate size range are
- * in use, the memory is allocated dynamically and freed after use.
- *
- * There are four parameters that determine the use of pre-allocated memory:
- *
- * minsize: any requested chunk smaller than this is allocated
- * dynamically and destroyed after use. No preallocated
- * memory is used.
- * smallest: the size of the smallest pre-allocated memory chunk.
- * nlevels: the number of different sizes of data chunks, each a
- * power of 2 larger than 'smallest'.
- * numalloc: a Numa of size 'nlevels' containing the number of data
- * chunks for each size that are in the memory store.
- *
- * As an example, suppose:
- * minsize = 0.5MB
- * smallest = 1.0MB
- * nlevels = 4
- * numalloc = {10, 5, 5, 5}
- * Then the total amount of allocated memory (in MB) is
- * 10 * 1 + 5 * 2 + 5 * 4 + 5 * 8 = 80 MB
- * Any pix requiring less than 0.5 MB or more than 8 MB of memory will
- * not come from the memory store. Instead, it will be dynamically
- * allocated and freed after use.
- *
- * How is this implemented?
- *
- * At setup, the full data block size is computed and allocated.
- * The addresses of the individual chunks are found, and the pointers
- * are stored in a set of Ptra (generic pointer arrays), using one Ptra
- * for each of the sizes of the chunks. When returning a chunk after
- * use, it is necessary to determine from the address which size level
- * (ptra) the chunk belongs to. This is done by comparing the address
- * of the associated chunk.
- *
- * In the event that memory chunks need to be dynamically allocated,
- * either (1) because they are too small or too large for the memory
- * store or (2) because all the pix of that size (i.e., in the
- * appropriate level) in the memory store are in use, the
- * addresses generated will be outside the pre-allocated block.
- * After use they won't be returned to a ptra; instead the deallocator
- * will free them.
- */
-
-/*! Pix memory storage */
-struct PixMemoryStore
-{
- struct L_Ptraa *paa; /*!< Holds ptrs to allocated memory */
- size_t minsize; /*!< Pix smaller than this (in bytes) */
- /*!< are allocated dynamically */
- size_t smallest; /*!< Smallest mem (in bytes) alloc'd */
- size_t largest; /*!< Larest mem (in bytes) alloc'd */
- size_t nbytes; /*!< Size of allocated block w/ all chunks */
- l_int32 nlevels; /*!< Num of power-of-2 sizes pre-alloc'd */
- size_t *sizes; /*!< Mem sizes at each power-of-2 level */
- l_int32 *allocarray; /*!< Number of mem alloc'd at each size */
- l_uint32 *baseptr; /*!< ptr to allocated array */
- l_uint32 *maxptr; /*!< ptr just beyond allocated memory */
- l_uint32 **firstptr; /*!< array of ptrs to first chunk in size */
- l_int32 *memused; /*!< log: total # of pix used (by level) */
- l_int32 *meminuse; /*!< log: # of pix in use (by level) */
- l_int32 *memmax; /*!< log: max # of pix in use (by level) */
- l_int32 *memempty; /*!< log: # of pix alloc'd because */
- /*!< the store was empty (by level) */
- char *logfile; /*!< log: set to null if no logging */
-};
-typedef struct PixMemoryStore L_PIX_MEM_STORE;
-
-static L_PIX_MEM_STORE *CustomPMS = NULL;
-
-
-/*!
- * \brief pmsCreate()
- *
- * \param[in] minsize of data chunk that can be supplied by pms
- * \param[in] smallest bytes of the smallest pre-allocated data chunk.
- * \param[in] numalloc array with the number of data chunks for each
- * size that are in the memory store
- * \param[in] logfile use for debugging; null otherwise
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This computes the size of the block of memory required
- * and allocates it. Each chunk starts on a 32-bit word boundary.
- * The chunk sizes are in powers of 2, starting at %smallest,
- * and the number of levels and chunks at each level is
- * specified by %numalloc.
- * (2) This is intended to manage the image data for a small number
- * of relatively large pix. The system malloc is expected to
- * handle very large numbers of small chunks efficiently.
- * (3) Important: set the allocators and call this function
- * before any pix have been allocated. Destroy all the pix
- * in the normal way before calling pmsDestroy().
- * (4) The pms struct is stored in a static global, so this function
- * is not thread-safe. When used, there must be only one thread
- * per process.
- *
- */
-l_ok
-pmsCreate(size_t minsize,
- size_t smallest,
- NUMA *numalloc,
- const char *logfile)
-{
-l_int32 nlevels, i, j, nbytes;
-l_int32 *alloca;
-l_float32 nchunks;
-l_uint32 *baseptr, *data;
-l_uint32 **firstptr;
-size_t *sizes;
-L_PIX_MEM_STORE *pms;
-L_PTRA *pa;
-L_PTRAA *paa;
-
- PROCNAME("createPMS");
-
- if (!numalloc)
- return ERROR_INT("numalloc not defined", procName, 1);
- numaGetSum(numalloc, &nchunks);
- if (nchunks > 1000.0)
- L_WARNING("There are %.0f chunks\n", procName, nchunks);
-
- pms = (L_PIX_MEM_STORE *)LEPT_CALLOC(1, sizeof(L_PIX_MEM_STORE));
- CustomPMS = pms;
-
- /* Make sure that minsize and smallest are multiples of 32 bit words */
- if (minsize % 4 != 0)
- minsize -= minsize % 4;
- pms->minsize = minsize;
- nlevels = numaGetCount(numalloc);
- pms->nlevels = nlevels;
-
- if ((sizes = (size_t *)LEPT_CALLOC(nlevels, sizeof(size_t))) == NULL)
- return ERROR_INT("sizes not made", procName, 1);
- pms->sizes = sizes;
- if (smallest % 4 != 0)
- smallest += 4 - (smallest % 4);
- pms->smallest = smallest;
- for (i = 0; i < nlevels; i++)
- sizes[i] = smallest * (1 << i);
- pms->largest = sizes[nlevels - 1];
-
- alloca = numaGetIArray(numalloc);
- pms->allocarray = alloca;
- if ((paa = ptraaCreate(nlevels)) == NULL)
- return ERROR_INT("paa not made", procName, 1);
- pms->paa = paa;
-
- for (i = 0, nbytes = 0; i < nlevels; i++)
- nbytes += alloca[i] * sizes[i];
- pms->nbytes = nbytes;
-
- if ((baseptr = (l_uint32 *)LEPT_CALLOC(nbytes / 4, sizeof(l_uint32)))
- == NULL)
- return ERROR_INT("calloc fail for baseptr", procName, 1);
- pms->baseptr = baseptr;
- pms->maxptr = baseptr + nbytes / 4; /* just beyond the memory store */
- if ((firstptr = (l_uint32 **)LEPT_CALLOC(nlevels, sizeof(l_uint32 *)))
- == NULL)
- return ERROR_INT("calloc fail for firstptr", procName, 1);
- pms->firstptr = firstptr;
-
- data = baseptr;
- for (i = 0; i < nlevels; i++) {
- if ((pa = ptraCreate(alloca[i])) == NULL)
- return ERROR_INT("pa not made", procName, 1);
- ptraaInsertPtra(paa, i, pa);
- firstptr[i] = data;
- for (j = 0; j < alloca[i]; j++) {
- ptraAdd(pa, data);
- data += sizes[i] / 4;
- }
- }
-
- if (logfile) {
- pms->memused = (l_int32 *)LEPT_CALLOC(nlevels, sizeof(l_int32));
- pms->meminuse = (l_int32 *)LEPT_CALLOC(nlevels, sizeof(l_int32));
- pms->memmax = (l_int32 *)LEPT_CALLOC(nlevels, sizeof(l_int32));
- pms->memempty = (l_int32 *)LEPT_CALLOC(nlevels, sizeof(l_int32));
- pms->logfile = stringNew(logfile);
- }
-
- return 0;
-}
-
-
-/*!
- * \brief pmsDestroy()
- *
- *
- * Notes:
- * (1) Important: call this function at the end of the program, after
- * the last pix has been destroyed.
- *
- */
-void
-pmsDestroy(void)
-{
-L_PIX_MEM_STORE *pms;
-
- if ((pms = CustomPMS) == NULL)
- return;
-
- ptraaDestroy(&pms->paa, FALSE, FALSE); /* don't touch the ptrs */
- LEPT_FREE(pms->baseptr); /* free the memory */
-
- if (pms->logfile) {
- pmsLogInfo();
- LEPT_FREE(pms->logfile);
- LEPT_FREE(pms->memused);
- LEPT_FREE(pms->meminuse);
- LEPT_FREE(pms->memmax);
- LEPT_FREE(pms->memempty);
- }
-
- LEPT_FREE(pms->sizes);
- LEPT_FREE(pms->allocarray);
- LEPT_FREE(pms->firstptr);
- LEPT_FREE(pms);
- CustomPMS = NULL;
- return;
-}
-
-
-/*!
- * \brief pmsCustomAlloc()
- *
- * \param[in] nbytes min number of bytes in the chunk to be retrieved
- * \return data ptr to chunk
- *
- *
- * Notes:
- * (1) This attempts to find a suitable pre-allocated chunk.
- * If not found, it dynamically allocates the chunk.
- * (2) If logging is turned on, the allocations that are not taken
- * from the memory store, and are at least as large as the
- * minimum size the store can handle, are logged to file.
- *
- */
-void *
-pmsCustomAlloc(size_t nbytes)
-{
-l_int32 level;
-void *data;
-L_PIX_MEM_STORE *pms;
-L_PTRA *pa;
-
- PROCNAME("pmsCustomAlloc");
-
- if ((pms = CustomPMS) == NULL)
- return (void *)ERROR_PTR("pms not defined", procName, NULL);
-
- pmsGetLevelForAlloc(nbytes, &level);
-
- if (level < 0) { /* size range invalid; must alloc */
- if ((data = pmsGetAlloc(nbytes)) == NULL)
- return (void *)ERROR_PTR("data not made", procName, NULL);
- } else { /* get from store */
- pa = ptraaGetPtra(pms->paa, level, L_HANDLE_ONLY);
- data = ptraRemoveLast(pa);
- if (data && pms->logfile) {
- pms->memused[level]++;
- pms->meminuse[level]++;
- if (pms->meminuse[level] > pms->memmax[level])
- pms->memmax[level]++;
- }
- if (!data) { /* none left at this level */
- data = pmsGetAlloc(nbytes);
- if (pms->logfile)
- pms->memempty[level]++;
- }
- }
-
- return data;
-}
-
-
-/*!
- * \brief pmsCustomDealloc()
- *
- * \param[in] data to be freed or returned to the storage
- * \return void
- */
-void
-pmsCustomDealloc(void *data)
-{
-l_int32 level;
-L_PIX_MEM_STORE *pms;
-L_PTRA *pa;
-
- PROCNAME("pmsCustomDealloc");
-
- if ((pms = CustomPMS) == NULL) {
- L_ERROR("pms not defined\n", procName);
- return;
- }
-
- if (pmsGetLevelForDealloc(data, &level) == 1) {
- L_ERROR("level not found\n", procName);
- return;
- }
-
- if (level < 0) { /* no logging; just free the data */
- LEPT_FREE(data);
- } else { /* return the data to the store */
- pa = ptraaGetPtra(pms->paa, level, L_HANDLE_ONLY);
- ptraAdd(pa, data);
- if (pms->logfile)
- pms->meminuse[level]--;
- }
-
- return;
-}
-
-
-/*!
- * \brief pmsGetAlloc()
- *
- * \param[in] nbytes
- * \return data
- *
- *
- * Notes:
- * (1) This is called when a request for pix data cannot be
- * obtained from the preallocated memory store. After use it
- * is freed like normal memory.
- * (2) If logging is on, only write out allocs that are as large as
- * the minimum size handled by the memory store.
- * (3) size_t is %lu on 64 bit platforms and %u on 32 bit platforms.
- * The C99 platform-independent format specifier for size_t is %zu.
- * Windows since at least VC-2015 is conforming; we can now use %zu.
- *
- */
-void *
-pmsGetAlloc(size_t nbytes)
-{
-void *data;
-FILE *fp;
-L_PIX_MEM_STORE *pms;
-
- PROCNAME("pmsGetAlloc");
-
- if ((pms = CustomPMS) == NULL)
- return (void *)ERROR_PTR("pms not defined", procName, NULL);
-
- if ((data = (void *)LEPT_CALLOC(nbytes, sizeof(char))) == NULL)
- return (void *)ERROR_PTR("data not made", procName, NULL);
- if (pms->logfile && nbytes >= pms->smallest) {
- fp = fopenWriteStream(pms->logfile, "a");
- fprintf(fp, "Alloc %zu bytes at %p\n", nbytes, data);
- fclose(fp);
- }
-
- return data;
-}
-
-
-/*!
- * \brief pmsGetLevelForAlloc()
- *
- * \param[in] nbytes min number of bytes in the chunk to be retrieved
- * \param[out] plevel -1 if either too small or too large
- * \return 0 if OK, 1 on error
- */
-l_ok
-pmsGetLevelForAlloc(size_t nbytes,
- l_int32 *plevel)
-{
-l_int32 i;
-l_float64 ratio;
-L_PIX_MEM_STORE *pms;
-
- PROCNAME("pmsGetLevelForAlloc");
-
- if (!plevel)
- return ERROR_INT("&level not defined", procName, 1);
- *plevel = -1;
- if ((pms = CustomPMS) == NULL)
- return ERROR_INT("pms not defined", procName, 1);
-
- if (nbytes < pms->minsize || nbytes > pms->largest)
- return 0; /* -1 */
-
- ratio = (l_float64)nbytes / (l_float64)(pms->smallest);
- for (i = 0; i < pms->nlevels; i++) {
- if (ratio <= 1.0)
- break;
- ratio /= 2.0;
- }
- *plevel = i;
-
- return 0;
-}
-
-
-/*!
- * \brief pmsGetLevelForDealloc()
- *
- * \param[in] data ptr to memory chunk
- * \param[out] plevel level in memory store; -1 if allocated
- * outside the store
- * \return 0 if OK, 1 on error
- */
-l_ok
-pmsGetLevelForDealloc(void *data,
- l_int32 *plevel)
-{
-l_int32 i;
-l_uint32 *first;
-L_PIX_MEM_STORE *pms;
-
- PROCNAME("pmsGetLevelForDealloc");
-
- if (!plevel)
- return ERROR_INT("&level not defined", procName, 1);
- *plevel = -1;
- if (!data)
- return ERROR_INT("data not defined", procName, 1);
- if ((pms = CustomPMS) == NULL)
- return ERROR_INT("pms not defined", procName, 1);
-
- if (data < (void *)pms->baseptr || data >= (void *)pms->maxptr)
- return 0; /* -1 */
-
- for (i = 1; i < pms->nlevels; i++) {
- first = pms->firstptr[i];
- if (data < (void *)first)
- break;
- }
- *plevel = i - 1;
-
- return 0;
-}
-
-
-/*!
- * \brief pmsLogInfo()
- */
-void
-pmsLogInfo(void)
-{
-l_int32 i;
-L_PIX_MEM_STORE *pms;
-
- if ((pms = CustomPMS) == NULL)
- return;
-
- lept_stderr("Total number of pix used at each level\n");
- for (i = 0; i < pms->nlevels; i++)
- lept_stderr(" Level %d (%zu bytes): %d\n", i,
- pms->sizes[i], pms->memused[i]);
-
- lept_stderr("Max number of pix in use at any time in each level\n");
- for (i = 0; i < pms->nlevels; i++)
- lept_stderr(" Level %d (%zu bytes): %d\n", i,
- pms->sizes[i], pms->memmax[i]);
-
- lept_stderr("Number of pix alloc'd because none were available\n");
- for (i = 0; i < pms->nlevels; i++)
- lept_stderr(" Level %d (%zu bytes): %d\n", i,
- pms->sizes[i], pms->memempty[i]);
-
- return;
-}
diff --git a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pixarith.c b/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pixarith.c
deleted file mode 100644
index df75e6a6..00000000
--- a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pixarith.c
+++ /dev/null
@@ -1,1629 +0,0 @@
-/*====================================================================*
- - Copyright (C) 2001 Leptonica. All rights reserved.
- -
- - Redistribution and use in source and binary forms, with or without
- - modification, are permitted provided that the following conditions
- - are met:
- - 1. Redistributions of source code must retain the above copyright
- - notice, this list of conditions and the following disclaimer.
- - 2. Redistributions in binary form must reproduce the above
- - copyright notice, this list of conditions and the following
- - disclaimer in the documentation and/or other materials
- - provided with the distribution.
- -
- - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- - ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- - LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- - A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL ANY
- - CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
- - EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
- - PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
- - PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
- - OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
- - NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- *====================================================================*/
-
-/*!
- * \file pixarith.c
- *
- *
- * One-image grayscale arithmetic operations (8, 16, 32 bpp)
- * l_int32 pixAddConstantGray()
- * l_int32 pixMultConstantGray()
- *
- * Two-image grayscale arithmetic operations (8, 16, 32 bpp)
- * PIX *pixAddGray()
- * PIX *pixSubtractGray()
- * PIX *pixMultiplyGray()
- *
- * Grayscale threshold operation (8, 16, 32 bpp)
- * PIX *pixThresholdToValue()
- *
- * Image accumulator arithmetic operations
- * PIX *pixInitAccumulate()
- * PIX *pixFinalAccumulate()
- * PIX *pixFinalAccumulateThreshold()
- * l_int32 pixAccumulate()
- * l_int32 pixMultConstAccumulate()
- *
- * Absolute value of difference
- * PIX *pixAbsDifference()
- *
- * Sum of color images
- * PIX *pixAddRGB()
- *
- * Two-image min and max operations (8 and 16 bpp)
- * PIX *pixMinOrMax()
- *
- * Scale pix for maximum dynamic range
- * PIX *pixMaxDynamicRange()
- * PIX *pixMaxDynamicRangeRGB()
- *
- * RGB pixel value scaling
- * l_uint32 linearScaleRGBVal()
- * l_uint32 logScaleRGBVal()
- *
- * Log base2 lookup
- * l_float32 *makeLogBase2Tab()
- * l_float32 getLogBase2()
- *
- * The image accumulator operations are used when you expect
- * overflow from 8 bits on intermediate results. For example,
- * you might want a tophat contrast operator which is
- * 3*I - opening(I,S) - closing(I,S)
- * To use these operations, first use the init to generate
- * a 16 bpp image, use the accumulate to add or subtract 8 bpp
- * images from that, or the multiply constant to multiply
- * by a small constant (much less than 256 -- we don't want
- * overflow from the 16 bit images!), and when you're finished
- * use final to bring the result back to 8 bpp, clipped
- * if necessary. There is also a divide function, which
- * can be used to divide one image by another, scaling the
- * result for maximum dynamic range, and giving back the
- * 8 bpp result.
- *
- * A simpler interface to the arithmetic operations is
- * provided in pixacc.c.
- *
- */
-
-#ifdef HAVE_CONFIG_H
-#include
-#endif /* HAVE_CONFIG_H */
-
-#include
-#include
-#include "allheaders.h"
-
-/*-------------------------------------------------------------*
- * One-image grayscale arithmetic operations *
- *-------------------------------------------------------------*/
-/*!
- * \brief pixAddConstantGray()
- *
- * \param[in] pixs 8, 16 or 32 bpp
- * \param[in] val amount to add to each pixel
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) In-place operation.
- * (2) No clipping for 32 bpp.
- * (3) For 8 and 16 bpp, if val > 0 the result is clipped
- * to 0xff and 0xffff, rsp.
- * (4) For 8 and 16 bpp, if val < 0 the result is clipped to 0.
- *
- */
-l_ok
-pixAddConstantGray(PIX *pixs,
- l_int32 val)
-{
-l_int32 i, j, w, h, d, wpl, pval;
-l_uint32 *data, *line;
-
- PROCNAME("pixAddConstantGray");
-
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
- pixGetDimensions(pixs, &w, &h, &d);
- if (d != 8 && d != 16 && d != 32)
- return ERROR_INT("pixs not 8, 16 or 32 bpp", procName, 1);
-
- data = pixGetData(pixs);
- wpl = pixGetWpl(pixs);
- for (i = 0; i < h; i++) {
- line = data + i * wpl;
- if (d == 8) {
- if (val < 0) {
- for (j = 0; j < w; j++) {
- pval = GET_DATA_BYTE(line, j);
- pval = L_MAX(0, pval + val);
- SET_DATA_BYTE(line, j, pval);
- }
- } else { /* val >= 0 */
- for (j = 0; j < w; j++) {
- pval = GET_DATA_BYTE(line, j);
- pval = L_MIN(255, pval + val);
- SET_DATA_BYTE(line, j, pval);
- }
- }
- } else if (d == 16) {
- if (val < 0) {
- for (j = 0; j < w; j++) {
- pval = GET_DATA_TWO_BYTES(line, j);
- pval = L_MAX(0, pval + val);
- SET_DATA_TWO_BYTES(line, j, pval);
- }
- } else { /* val >= 0 */
- for (j = 0; j < w; j++) {
- pval = GET_DATA_TWO_BYTES(line, j);
- pval = L_MIN(0xffff, pval + val);
- SET_DATA_TWO_BYTES(line, j, pval);
- }
- }
- } else { /* d == 32; no check for overflow (< 0 or > 0xffffffff) */
- for (j = 0; j < w; j++)
- *(line + j) += val;
- }
- }
-
- return 0;
-}
-
-
-/*!
- * \brief pixMultConstantGray()
- *
- * \param[in] pixs 8, 16 or 32 bpp
- * \param[in] val >= 0.0; amount to multiply by each pixel
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) In-place operation; val must be >= 0.
- * (2) No clipping for 32 bpp.
- * (3) For 8 and 16 bpp, the result is clipped to 0xff and 0xffff, rsp.
- *
- */
-l_ok
-pixMultConstantGray(PIX *pixs,
- l_float32 val)
-{
-l_int32 i, j, w, h, d, wpl, pval;
-l_uint32 upval;
-l_uint32 *data, *line;
-
- PROCNAME("pixMultConstantGray");
-
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
- pixGetDimensions(pixs, &w, &h, &d);
- if (d != 8 && d != 16 && d != 32)
- return ERROR_INT("pixs not 8, 16 or 32 bpp", procName, 1);
- if (val < 0.0)
- return ERROR_INT("val < 0.0", procName, 1);
-
- data = pixGetData(pixs);
- wpl = pixGetWpl(pixs);
- for (i = 0; i < h; i++) {
- line = data + i * wpl;
- if (d == 8) {
- for (j = 0; j < w; j++) {
- pval = GET_DATA_BYTE(line, j);
- pval = (l_int32)(val * pval);
- pval = L_MIN(255, pval);
- SET_DATA_BYTE(line, j, pval);
- }
- } else if (d == 16) {
- for (j = 0; j < w; j++) {
- pval = GET_DATA_TWO_BYTES(line, j);
- pval = (l_int32)(val * pval);
- pval = L_MIN(0xffff, pval);
- SET_DATA_TWO_BYTES(line, j, pval);
- }
- } else { /* d == 32; no clipping */
- for (j = 0; j < w; j++) {
- upval = *(line + j);
- upval = (l_uint32)(val * upval);
- *(line + j) = upval;
- }
- }
- }
-
- return 0;
-}
-
-
-/*-------------------------------------------------------------*
- * Two-image grayscale arithmetic ops *
- *-------------------------------------------------------------*/
-/*!
- * \brief pixAddGray()
- *
- * \param[in] pixd [optional]; this can be null, equal to pixs1, or
- * different from pixs1
- * \param[in] pixs1 can be equal to pixd
- * \param[in] pixs2
- * \return pixd always
- *
- *
- * Notes:
- * (1) Arithmetic addition of two 8, 16 or 32 bpp images.
- * (2) For 8 and 16 bpp, we do explicit clipping to 0xff and 0xffff,
- * respectively.
- * (3) Alignment is to UL corner.
- * (4) There are 3 cases. The result can go to a new dest,
- * in-place to pixs1, or to an existing input dest:
- * * pixd == null: (src1 + src2) --> new pixd
- * * pixd == pixs1: (src1 + src2) --> src1 (in-place)
- * * pixd != pixs1: (src1 + src2) --> input pixd
- * (5) pixs2 must be different from both pixd and pixs1.
- *
- */
-PIX *
-pixAddGray(PIX *pixd,
- PIX *pixs1,
- PIX *pixs2)
-{
-l_int32 i, j, d, ws, hs, w, h, wpls, wpld, val, sum;
-l_uint32 *datas, *datad, *lines, *lined;
-
- PROCNAME("pixAddGray");
-
- if (!pixs1)
- return (PIX *)ERROR_PTR("pixs1 not defined", procName, pixd);
- if (!pixs2)
- return (PIX *)ERROR_PTR("pixs2 not defined", procName, pixd);
- if (pixs2 == pixs1)
- return (PIX *)ERROR_PTR("pixs2 and pixs1 must differ", procName, pixd);
- if (pixs2 == pixd)
- return (PIX *)ERROR_PTR("pixs2 and pixd must differ", procName, pixd);
- d = pixGetDepth(pixs1);
- if (d != 8 && d != 16 && d != 32)
- return (PIX *)ERROR_PTR("pix are not 8, 16 or 32 bpp", procName, pixd);
- if (pixGetDepth(pixs2) != d)
- return (PIX *)ERROR_PTR("depths differ (pixs1, pixs2)", procName, pixd);
- if (pixd && (pixGetDepth(pixd) != d))
- return (PIX *)ERROR_PTR("depths differ (pixs1, pixd)", procName, pixd);
-
- if (!pixSizesEqual(pixs1, pixs2))
- L_WARNING("pixs1 and pixs2 not equal in size\n", procName);
- if (pixd && !pixSizesEqual(pixs1, pixd))
- L_WARNING("pixs1 and pixd not equal in size\n", procName);
-
- if (pixs1 != pixd)
- pixd = pixCopy(pixd, pixs1);
-
- /* pixd + pixs2 ==> pixd */
- datas = pixGetData(pixs2);
- datad = pixGetData(pixd);
- wpls = pixGetWpl(pixs2);
- wpld = pixGetWpl(pixd);
- pixGetDimensions(pixs2, &ws, &hs, NULL);
- pixGetDimensions(pixd, &w, &h, NULL);
- w = L_MIN(ws, w);
- h = L_MIN(hs, h);
- for (i = 0; i < h; i++) {
- lined = datad + i * wpld;
- lines = datas + i * wpls;
- if (d == 8) {
- for (j = 0; j < w; j++) {
- sum = GET_DATA_BYTE(lines, j) + GET_DATA_BYTE(lined, j);
- val = L_MIN(sum, 255);
- SET_DATA_BYTE(lined, j, val);
- }
- } else if (d == 16) {
- for (j = 0; j < w; j++) {
- sum = GET_DATA_TWO_BYTES(lines, j)
- + GET_DATA_TWO_BYTES(lined, j);
- val = L_MIN(sum, 0xffff);
- SET_DATA_TWO_BYTES(lined, j, val);
- }
- } else { /* d == 32; no clipping */
- for (j = 0; j < w; j++)
- *(lined + j) += *(lines + j);
- }
- }
-
- return pixd;
-}
-
-
-/*!
- * \brief pixSubtractGray()
- *
- * \param[in] pixd [optional]; this can be null, equal to pixs1, or
- * different from pixs1
- * \param[in] pixs1 can be equal to pixd
- * \param[in] pixs2
- * \return pixd always
- *
- *
- * Notes:
- * (1) Arithmetic subtraction of two 8, 16 or 32 bpp images.
- * (2) Source pixs2 is always subtracted from source pixs1.
- * (3) Do explicit clipping to 0.
- * (4) Alignment is to UL corner.
- * (5) There are 3 cases. The result can go to a new dest,
- * in-place to pixs1, or to an existing input dest:
- * (a) pixd == null (src1 - src2) --> new pixd
- * (b) pixd == pixs1 (src1 - src2) --> src1 (in-place)
- * (d) pixd != pixs1 (src1 - src2) --> input pixd
- * (6) pixs2 must be different from both pixd and pixs1.
- *
- */
-PIX *
-pixSubtractGray(PIX *pixd,
- PIX *pixs1,
- PIX *pixs2)
-{
-l_int32 i, j, w, h, ws, hs, d, wpls, wpld, val, diff;
-l_uint32 *datas, *datad, *lines, *lined;
-
- PROCNAME("pixSubtractGray");
-
- if (!pixs1)
- return (PIX *)ERROR_PTR("pixs1 not defined", procName, pixd);
- if (!pixs2)
- return (PIX *)ERROR_PTR("pixs2 not defined", procName, pixd);
- if (pixs2 == pixs1)
- return (PIX *)ERROR_PTR("pixs2 and pixs1 must differ", procName, pixd);
- if (pixs2 == pixd)
- return (PIX *)ERROR_PTR("pixs2 and pixd must differ", procName, pixd);
- d = pixGetDepth(pixs1);
- if (d != 8 && d != 16 && d != 32)
- return (PIX *)ERROR_PTR("pix are not 8, 16 or 32 bpp", procName, pixd);
- if (pixGetDepth(pixs2) != d)
- return (PIX *)ERROR_PTR("depths differ (pixs1, pixs2)", procName, pixd);
- if (pixd && (pixGetDepth(pixd) != d))
- return (PIX *)ERROR_PTR("depths differ (pixs1, pixd)", procName, pixd);
-
- if (!pixSizesEqual(pixs1, pixs2))
- L_WARNING("pixs1 and pixs2 not equal in size\n", procName);
- if (pixd && !pixSizesEqual(pixs1, pixd))
- L_WARNING("pixs1 and pixd not equal in size\n", procName);
-
- if (pixs1 != pixd)
- pixd = pixCopy(pixd, pixs1);
-
- /* pixd - pixs2 ==> pixd */
- datas = pixGetData(pixs2);
- datad = pixGetData(pixd);
- wpls = pixGetWpl(pixs2);
- wpld = pixGetWpl(pixd);
- pixGetDimensions(pixs2, &ws, &hs, NULL);
- pixGetDimensions(pixd, &w, &h, NULL);
- w = L_MIN(ws, w);
- h = L_MIN(hs, h);
- for (i = 0; i < h; i++) {
- lined = datad + i * wpld;
- lines = datas + i * wpls;
- if (d == 8) {
- for (j = 0; j < w; j++) {
- diff = GET_DATA_BYTE(lined, j) - GET_DATA_BYTE(lines, j);
- val = L_MAX(diff, 0);
- SET_DATA_BYTE(lined, j, val);
- }
- } else if (d == 16) {
- for (j = 0; j < w; j++) {
- diff = GET_DATA_TWO_BYTES(lined, j)
- - GET_DATA_TWO_BYTES(lines, j);
- val = L_MAX(diff, 0);
- SET_DATA_TWO_BYTES(lined, j, val);
- }
- } else { /* d == 32; no clipping */
- for (j = 0; j < w; j++)
- *(lined + j) -= *(lines + j);
- }
- }
-
- return pixd;
-}
-
-
-/*!
- * \brief pixMultiplyGray()
- *
- * \param[in] pixs 32 bpp rgb or 8 bpp gray
- * \param[in] pixg 8 bpp gray
- * \param[in] norm multiplicative factor to avoid overflow; 0 for default
- * \return pixd, or null on error
- *
- *
- * Notes:
- * (1) This function can be used for correcting a scanned image
- * under non-uniform illumination. For that application,
- * %pixs is the scanned image, %pixg is an image whose values
- * are inversely related to light from a uniform (say, white)
- * target, and %norm is typically the inverse of the maximum
- * pixel value in %pixg.
- * (2) Set norm = 0 to get the default value, which is the inverse
- * of the max value in %pixg. This avoids overflow in the product.
- * (3) For 32 bpp %pixs, all 3 components are multiplied by the
- * same number.
- * (4) Alignment is to UL corner.
- *
- */
-PIX *
-pixMultiplyGray(PIX *pixs,
- PIX *pixg,
- l_float32 norm)
-{
-l_int32 i, j, w, h, d, ws, hs, ds, wpls, wplg, wpld;
-l_int32 rval, gval, bval, rval2, gval2, bval2, vals, valg, val, maxgray;
-l_uint32 val32;
-l_uint32 *datas, *datag, *datad, *lines, *lineg, *lined;
-PIX *pixd;
-
- PROCNAME("pixMultiplyGray");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- pixGetDimensions(pixs, &ws, &hs, &ds);
- if (ds != 8 && ds != 32)
- return (PIX *)ERROR_PTR("pixs not 8 or 32 bpp", procName, NULL);
- if (!pixg)
- return (PIX *)ERROR_PTR("pixg not defined", procName, NULL);
- pixGetDimensions(pixg, &w, &h, &d);
- if (d != 8)
- return (PIX *)ERROR_PTR("pixg not 8 bpp", procName, NULL);
-
- if (norm <= 0.0) {
- pixGetExtremeValue(pixg, 1, L_SELECT_MAX, NULL, NULL, NULL, &maxgray);
- norm = (maxgray > 0) ? 1.0 / (l_float32)maxgray : 1.0;
- }
-
- if ((pixd = pixCreateTemplate(pixs)) == NULL)
- return (PIX *)ERROR_PTR("pixd not made", procName, NULL);
- datas = pixGetData(pixs);
- datag = pixGetData(pixg);
- datad = pixGetData(pixd);
- wpls = pixGetWpl(pixs);
- wplg = pixGetWpl(pixg);
- wpld = pixGetWpl(pixd);
- w = L_MIN(ws, w);
- h = L_MIN(hs, h);
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- lineg = datag + i * wplg;
- lined = datad + i * wpld;
- if (ds == 8) {
- for (j = 0; j < w; j++) {
- vals = GET_DATA_BYTE(lines, j);
- valg = GET_DATA_BYTE(lineg, j);
- val = (l_int32)(vals * valg * norm + 0.5);
- val = L_MIN(255, val);
- SET_DATA_BYTE(lined, j, val);
- }
- } else { /* ds == 32 */
- for (j = 0; j < w; j++) {
- val32 = *(lines + j);
- extractRGBValues(val32, &rval, &gval, &bval);
- valg = GET_DATA_BYTE(lineg, j);
- rval2 = (l_int32)(rval * valg * norm + 0.5);
- rval2 = L_MIN(255, rval2);
- gval2 = (l_int32)(gval * valg * norm + 0.5);
- gval2 = L_MIN(255, gval2);
- bval2 = (l_int32)(bval * valg * norm + 0.5);
- bval2 = L_MIN(255, bval2);
- composeRGBPixel(rval2, gval2, bval2, lined + j);
- }
- }
- }
-
- return pixd;
-}
-
-
-/*-------------------------------------------------------------*
- * Grayscale threshold operation *
- *-------------------------------------------------------------*/
-/*!
- * \brief pixThresholdToValue()
- *
- * \param[in] pixd [optional]; if not null, must be equal to pixs
- * \param[in] pixs 8, 16, 32 bpp
- * \param[in] threshval
- * \param[in] setval
- * \return pixd always
- *
- *
- * Notes:
- * ~ operation can be in-place (pixs == pixd) or to a new pixd
- * ~ if %setval > %threshval, sets pixels with a value >= threshval to setval
- * ~ if %setval < %threshval, sets pixels with a value <= threshval to setval
- * ~ if %setval == %threshval, no-op
- *
- */
-PIX *
-pixThresholdToValue(PIX *pixd,
- PIX *pixs,
- l_int32 threshval,
- l_int32 setval)
-{
-l_int32 i, j, w, h, d, wpld, setabove;
-l_uint32 *datad, *lined;
-
- PROCNAME("pixThresholdToValue");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, pixd);
- d = pixGetDepth(pixs);
- if (d != 8 && d != 16 && d != 32)
- return (PIX *)ERROR_PTR("pixs not 8, 16 or 32 bpp", procName, pixd);
- if (pixd && (pixs != pixd))
- return (PIX *)ERROR_PTR("pixd exists and is not pixs", procName, pixd);
- if (threshval < 0 || setval < 0)
- return (PIX *)ERROR_PTR("threshval & setval not < 0", procName, pixd);
- if (d == 8 && setval > 255)
- return (PIX *)ERROR_PTR("setval > 255 for 8 bpp", procName, pixd);
- if (d == 16 && setval > 0xffff)
- return (PIX *)ERROR_PTR("setval > 0xffff for 16 bpp", procName, pixd);
-
- if (!pixd)
- pixd = pixCopy(NULL, pixs);
- if (setval == threshval) {
- L_WARNING("setval == threshval; no operation\n", procName);
- return pixd;
- }
-
- datad = pixGetData(pixd);
- pixGetDimensions(pixd, &w, &h, NULL);
- wpld = pixGetWpl(pixd);
- if (setval > threshval)
- setabove = TRUE;
- else
- setabove = FALSE;
-
- for (i = 0; i < h; i++) {
- lined = datad + i * wpld;
- if (setabove == TRUE) {
- if (d == 8) {
- for (j = 0; j < w; j++) {
- if (GET_DATA_BYTE(lined, j) - threshval >= 0)
- SET_DATA_BYTE(lined, j, setval);
- }
- } else if (d == 16) {
- for (j = 0; j < w; j++) {
- if (GET_DATA_TWO_BYTES(lined, j) - threshval >= 0)
- SET_DATA_TWO_BYTES(lined, j, setval);
- }
- } else { /* d == 32 */
- for (j = 0; j < w; j++) {
- if (*(lined + j) >= threshval)
- *(lined + j) = setval;
- }
- }
- } else { /* set if below or at threshold */
- if (d == 8) {
- for (j = 0; j < w; j++) {
- if (GET_DATA_BYTE(lined, j) - threshval <= 0)
- SET_DATA_BYTE(lined, j, setval);
- }
- } else if (d == 16) {
- for (j = 0; j < w; j++) {
- if (GET_DATA_TWO_BYTES(lined, j) - threshval <= 0)
- SET_DATA_TWO_BYTES(lined, j, setval);
- }
- } else { /* d == 32 */
- for (j = 0; j < w; j++) {
- if (*(lined + j) <= threshval)
- *(lined + j) = setval;
- }
- }
- }
- }
-
- return pixd;
-}
-
-
-/*-------------------------------------------------------------*
- * Image accumulator arithmetic operations *
- *-------------------------------------------------------------*/
-/*!
- * \brief pixInitAccumulate()
- *
- * \param[in] w, h of accumulate array
- * \param[in] offset initialize the 32 bpp to have this
- * value; not more than 0x40000000
- * \return pixd 32 bpp, or NULL on error
- *
- *
- * Notes:
- * (1) %offset must be >= 0.
- * (2) %offset is used so that we can do arithmetic
- * with negative number results on l_uint32 data; it
- * prevents the l_uint32 data from going negative.
- * (3) Because we use l_int32 intermediate data results,
- * these should never exceed the max of l_int32 (0x7fffffff).
- * We do not permit the offset to be above 0x40000000,
- * which is half way between 0 and the max of l_int32.
- * (4) The same offset should be used for initialization,
- * multiplication by a constant, and final extraction!
- * (5) If you're only adding positive values, %offset can be 0.
- *
- */
-PIX *
-pixInitAccumulate(l_int32 w,
- l_int32 h,
- l_uint32 offset)
-{
-PIX *pixd;
-
- PROCNAME("pixInitAccumulate");
-
- if ((pixd = pixCreate(w, h, 32)) == NULL)
- return (PIX *)ERROR_PTR("pixd not made", procName, NULL);
- if (offset > 0x40000000)
- offset = 0x40000000;
- pixSetAllArbitrary(pixd, offset);
- return pixd;
-}
-
-
-/*!
- * \brief pixFinalAccumulate()
- *
- * \param[in] pixs 32 bpp
- * \param[in] offset same as used for initialization
- * \param[in] depth 8, 16 or 32 bpp, of destination
- * \return pixd 8, 16 or 32 bpp, or NULL on error
- *
- *
- * Notes:
- * (1) %offset must be >= 0 and should not exceed 0x40000000.
- * (2) %offset is subtracted from the src 32 bpp image
- * (3) For 8 bpp dest, the result is clipped to [0, 0xff]
- * (4) For 16 bpp dest, the result is clipped to [0, 0xffff]
- *
- */
-PIX *
-pixFinalAccumulate(PIX *pixs,
- l_uint32 offset,
- l_int32 depth)
-{
-l_int32 i, j, w, h, wpls, wpld, val;
-l_uint32 *datas, *datad, *lines, *lined;
-PIX *pixd;
-
- PROCNAME("pixFinalAccumulate");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- if (pixGetDepth(pixs) != 32)
- return (PIX *)ERROR_PTR("pixs not 32 bpp", procName, NULL);
- if (depth != 8 && depth != 16 && depth != 32)
- return (PIX *)ERROR_PTR("dest depth not 8, 16, 32 bpp", procName, NULL);
- if (offset > 0x40000000)
- offset = 0x40000000;
-
- pixGetDimensions(pixs, &w, &h, NULL);
- if ((pixd = pixCreate(w, h, depth)) == NULL)
- return (PIX *)ERROR_PTR("pixd not made", procName, NULL);
- pixCopyResolution(pixd, pixs); /* but how did pixs get it initially? */
- datas = pixGetData(pixs);
- datad = pixGetData(pixd);
- wpls = pixGetWpl(pixs);
- wpld = pixGetWpl(pixd);
- if (depth == 8) {
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- lined = datad + i * wpld;
- for (j = 0; j < w; j++) {
- val = lines[j] - offset;
- val = L_MAX(0, val);
- val = L_MIN(255, val);
- SET_DATA_BYTE(lined, j, (l_uint8)val);
- }
- }
- } else if (depth == 16) {
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- lined = datad + i * wpld;
- for (j = 0; j < w; j++) {
- val = lines[j] - offset;
- val = L_MAX(0, val);
- val = L_MIN(0xffff, val);
- SET_DATA_TWO_BYTES(lined, j, (l_uint16)val);
- }
- }
- } else { /* depth == 32 */
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- lined = datad + i * wpld;
- for (j = 0; j < w; j++)
- lined[j] = lines[j] - offset;
- }
- }
-
- return pixd;
-}
-
-
-/*!
- * \brief pixFinalAccumulateThreshold()
- *
- * \param[in] pixs 32 bpp
- * \param[in] offset same as used for initialization
- * \param[in] threshold values less than this are set in the destination
- * \return pixd 1 bpp, or NULL on error
- *
- *
- * Notes:
- * (1) %offset must be >= 0 and should not exceed 0x40000000.
- * (2) %offset is subtracted from the src 32 bpp image
- *
- */
-PIX *
-pixFinalAccumulateThreshold(PIX *pixs,
- l_uint32 offset,
- l_uint32 threshold)
-{
-l_int32 i, j, w, h, wpls, wpld, val;
-l_uint32 *datas, *datad, *lines, *lined;
-PIX *pixd;
-
- PROCNAME("pixFinalAccumulateThreshold");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- if (pixGetDepth(pixs) != 32)
- return (PIX *)ERROR_PTR("pixs not 32 bpp", procName, NULL);
- if (offset > 0x40000000)
- offset = 0x40000000;
-
- pixGetDimensions(pixs, &w, &h, NULL);
- if ((pixd = pixCreate(w, h, 1)) == NULL)
- return (PIX *)ERROR_PTR("pixd not made", procName, NULL);
- pixCopyResolution(pixd, pixs); /* but how did pixs get it initially? */
- datas = pixGetData(pixs);
- datad = pixGetData(pixd);
- wpls = pixGetWpl(pixs);
- wpld = pixGetWpl(pixd);
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- lined = datad + i * wpld;
- for (j = 0; j < w; j++) {
- val = lines[j] - offset;
- if (val >= threshold) {
- SET_DATA_BIT(lined, j);
- }
- }
- }
-
- return pixd;
-}
-
-
-/*!
- * \brief pixAccumulate()
- *
- * \param[in] pixd 32 bpp
- * \param[in] pixs 1, 8, 16 or 32 bpp
- * \param[in] op L_ARITH_ADD or L_ARITH_SUBTRACT
- * \return 0 if OK; 1 on error
- *
- *
- * Notes:
- * (1) This adds or subtracts each pixs value from pixd.
- * (2) This clips to the minimum of pixs and pixd, so they
- * do not need to be the same size.
- * (3) The alignment is to the origin [UL corner] of pixs & pixd.
- *
- */
-l_ok
-pixAccumulate(PIX *pixd,
- PIX *pixs,
- l_int32 op)
-{
-l_int32 i, j, w, h, d, wd, hd, wpls, wpld;
-l_uint32 *datas, *datad, *lines, *lined;
-
-
- PROCNAME("pixAccumulate");
-
- if (!pixd || (pixGetDepth(pixd) != 32))
- return ERROR_INT("pixd not defined or not 32 bpp", procName, 1);
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
- d = pixGetDepth(pixs);
- if (d != 1 && d != 8 && d != 16 && d != 32)
- return ERROR_INT("pixs not 1, 8, 16 or 32 bpp", procName, 1);
- if (op != L_ARITH_ADD && op != L_ARITH_SUBTRACT)
- return ERROR_INT("op must be in {L_ARITH_ADD, L_ARITH_SUBTRACT}",
- procName, 1);
-
- datas = pixGetData(pixs);
- datad = pixGetData(pixd);
- wpls = pixGetWpl(pixs);
- wpld = pixGetWpl(pixd);
- pixGetDimensions(pixs, &w, &h, NULL);
- pixGetDimensions(pixd, &wd, &hd, NULL);
- w = L_MIN(w, wd);
- h = L_MIN(h, hd);
- if (d == 1) {
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- lined = datad + i * wpld;
- if (op == L_ARITH_ADD) {
- for (j = 0; j < w; j++)
- lined[j] += GET_DATA_BIT(lines, j);
- } else { /* op == L_ARITH_SUBTRACT */
- for (j = 0; j < w; j++)
- lined[j] -= GET_DATA_BIT(lines, j);
- }
- }
- } else if (d == 8) {
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- lined = datad + i * wpld;
- if (op == L_ARITH_ADD) {
- for (j = 0; j < w; j++)
- lined[j] += GET_DATA_BYTE(lines, j);
- } else { /* op == L_ARITH_SUBTRACT */
- for (j = 0; j < w; j++)
- lined[j] -= GET_DATA_BYTE(lines, j);
- }
- }
- } else if (d == 16) {
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- lined = datad + i * wpld;
- if (op == L_ARITH_ADD) {
- for (j = 0; j < w; j++)
- lined[j] += GET_DATA_TWO_BYTES(lines, j);
- } else { /* op == L_ARITH_SUBTRACT */
- for (j = 0; j < w; j++)
- lined[j] -= GET_DATA_TWO_BYTES(lines, j);
- }
- }
- } else { /* d == 32 */
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- lined = datad + i * wpld;
- if (op == L_ARITH_ADD) {
- for (j = 0; j < w; j++)
- lined[j] += lines[j];
- } else { /* op == L_ARITH_SUBTRACT */
- for (j = 0; j < w; j++)
- lined[j] -= lines[j];
- }
- }
- }
-
- return 0;
-}
-
-
-/*!
- * \brief pixMultConstAccumulate()
- *
- * \param[in] pixs 32 bpp
- * \param[in] factor
- * \param[in] offset same as used for initialization
- * \return 0 if OK; 1 on error
- *
- *
- * Notes:
- * (1) %offset must be >= 0 and should not exceed 0x40000000.
- * (2) This multiplies each pixel, relative to offset, by %factor.
- * (3) The result is returned with %offset back in place.
- *
- */
-l_ok
-pixMultConstAccumulate(PIX *pixs,
- l_float32 factor,
- l_uint32 offset)
-{
-l_int32 i, j, w, h, wpl, val;
-l_uint32 *data, *line;
-
- PROCNAME("pixMultConstAccumulate");
-
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
- if (pixGetDepth(pixs) != 32)
- return ERROR_INT("pixs not 32 bpp", procName, 1);
- if (offset > 0x40000000)
- offset = 0x40000000;
-
- pixGetDimensions(pixs, &w, &h, NULL);
- data = pixGetData(pixs);
- wpl = pixGetWpl(pixs);
- for (i = 0; i < h; i++) {
- line = data + i * wpl;
- for (j = 0; j < w; j++) {
- val = line[j] - offset;
- val = (l_int32)(val * factor);
- val += offset;
- line[j] = (l_uint32)val;
- }
- }
-
- return 0;
-}
-
-
-/*-----------------------------------------------------------------------*
- * Absolute value of difference *
- *-----------------------------------------------------------------------*/
-/*!
- * \brief pixAbsDifference()
- *
- * \param[in] pixs1, pixs2 both either 8 or 16 bpp gray, or 32 bpp RGB
- * \return pixd, or NULL on error
- *
- *
- * Notes:
- * (1) The depth of pixs1 and pixs2 must be equal.
- * (2) Clips computation to the min size, aligning the UL corners
- * (3) For 8 and 16 bpp, assumes one gray component.
- * (4) For 32 bpp, assumes 3 color components, and ignores the
- * LSB of each word (the alpha channel)
- * (5) Computes the absolute value of the difference between
- * each component value.
- *
- */
-PIX *
-pixAbsDifference(PIX *pixs1,
- PIX *pixs2)
-{
-l_int32 i, j, w, h, w2, h2, d, wpls1, wpls2, wpld, val1, val2, diff;
-l_int32 rval1, gval1, bval1, rval2, gval2, bval2, rdiff, gdiff, bdiff;
-l_uint32 *datas1, *datas2, *datad, *lines1, *lines2, *lined;
-PIX *pixd;
-
- PROCNAME("pixAbsDifference");
-
- if (!pixs1)
- return (PIX *)ERROR_PTR("pixs1 not defined", procName, NULL);
- if (!pixs2)
- return (PIX *)ERROR_PTR("pixs2 not defined", procName, NULL);
- d = pixGetDepth(pixs1);
- if (d != pixGetDepth(pixs2))
- return (PIX *)ERROR_PTR("src1 and src2 depths unequal", procName, NULL);
- if (d != 8 && d != 16 && d != 32)
- return (PIX *)ERROR_PTR("depths not in {8, 16, 32}", procName, NULL);
-
- pixGetDimensions(pixs1, &w, &h, NULL);
- pixGetDimensions(pixs2, &w2, &h2, NULL);
- w = L_MIN(w, w2);
- h = L_MIN(h, h2);
- if ((pixd = pixCreate(w, h, d)) == NULL)
- return (PIX *)ERROR_PTR("pixd not made", procName, NULL);
- pixCopyResolution(pixd, pixs1);
- datas1 = pixGetData(pixs1);
- datas2 = pixGetData(pixs2);
- datad = pixGetData(pixd);
- wpls1 = pixGetWpl(pixs1);
- wpls2 = pixGetWpl(pixs2);
- wpld = pixGetWpl(pixd);
- if (d == 8) {
- for (i = 0; i < h; i++) {
- lines1 = datas1 + i * wpls1;
- lines2 = datas2 + i * wpls2;
- lined = datad + i * wpld;
- for (j = 0; j < w; j++) {
- val1 = GET_DATA_BYTE(lines1, j);
- val2 = GET_DATA_BYTE(lines2, j);
- diff = L_ABS(val1 - val2);
- SET_DATA_BYTE(lined, j, diff);
- }
- }
- } else if (d == 16) {
- for (i = 0; i < h; i++) {
- lines1 = datas1 + i * wpls1;
- lines2 = datas2 + i * wpls2;
- lined = datad + i * wpld;
- for (j = 0; j < w; j++) {
- val1 = GET_DATA_TWO_BYTES(lines1, j);
- val2 = GET_DATA_TWO_BYTES(lines2, j);
- diff = L_ABS(val1 - val2);
- SET_DATA_TWO_BYTES(lined, j, diff);
- }
- }
- } else { /* d == 32 */
- for (i = 0; i < h; i++) {
- lines1 = datas1 + i * wpls1;
- lines2 = datas2 + i * wpls2;
- lined = datad + i * wpld;
- for (j = 0; j < w; j++) {
- extractRGBValues(lines1[j], &rval1, &gval1, &bval1);
- extractRGBValues(lines2[j], &rval2, &gval2, &bval2);
- rdiff = L_ABS(rval1 - rval2);
- gdiff = L_ABS(gval1 - gval2);
- bdiff = L_ABS(bval1 - bval2);
- composeRGBPixel(rdiff, gdiff, bdiff, lined + j);
- }
- }
- }
-
- return pixd;
-}
-
-
-/*-----------------------------------------------------------------------*
- * Sum of color images *
- *-----------------------------------------------------------------------*/
-/*!
- * \brief pixAddRGB()
- *
- * \param[in] pixs1, pixs2 32 bpp RGB, or colormapped
- * \return pixd, or NULL on error
- *
- *
- * Notes:
- * (1) Clips computation to the minimum size, aligning the UL corners.
- * (2) Removes any colormap to RGB, and ignores the LSB of each
- * pixel word (the alpha channel).
- * (3) Adds each component value, pixelwise, clipping to 255.
- * (4) This is useful to combine two images where most of the
- * pixels are essentially black, such as in pixPerceptualDiff().
- *
- */
-PIX *
-pixAddRGB(PIX *pixs1,
- PIX *pixs2)
-{
-l_int32 i, j, w, h, d, w2, h2, d2, wplc1, wplc2, wpld;
-l_int32 rval1, gval1, bval1, rval2, gval2, bval2, rval, gval, bval;
-l_uint32 *datac1, *datac2, *datad, *linec1, *linec2, *lined;
-PIX *pixc1, *pixc2, *pixd;
-
- PROCNAME("pixAddRGB");
-
- if (!pixs1)
- return (PIX *)ERROR_PTR("pixs1 not defined", procName, NULL);
- if (!pixs2)
- return (PIX *)ERROR_PTR("pixs2 not defined", procName, NULL);
- pixGetDimensions(pixs1, &w, &h, &d);
- pixGetDimensions(pixs2, &w2, &h2, &d2);
- if (!pixGetColormap(pixs1) && d != 32)
- return (PIX *)ERROR_PTR("pixs1 not cmapped or rgb", procName, NULL);
- if (!pixGetColormap(pixs2) && d2 != 32)
- return (PIX *)ERROR_PTR("pixs2 not cmapped or rgb", procName, NULL);
- if (pixGetColormap(pixs1))
- pixc1 = pixRemoveColormap(pixs1, REMOVE_CMAP_TO_FULL_COLOR);
- else
- pixc1 = pixClone(pixs1);
- if (pixGetColormap(pixs2))
- pixc2 = pixRemoveColormap(pixs2, REMOVE_CMAP_TO_FULL_COLOR);
- else
- pixc2 = pixClone(pixs2);
-
- w = L_MIN(w, w2);
- h = L_MIN(h, h2);
- pixd = pixCreate(w, h, 32);
- pixCopyResolution(pixd, pixs1);
- datac1 = pixGetData(pixc1);
- datac2 = pixGetData(pixc2);
- datad = pixGetData(pixd);
- wplc1 = pixGetWpl(pixc1);
- wplc2 = pixGetWpl(pixc2);
- wpld = pixGetWpl(pixd);
- for (i = 0; i < h; i++) {
- linec1 = datac1 + i * wplc1;
- linec2 = datac2 + i * wplc2;
- lined = datad + i * wpld;
- for (j = 0; j < w; j++) {
- extractRGBValues(linec1[j], &rval1, &gval1, &bval1);
- extractRGBValues(linec2[j], &rval2, &gval2, &bval2);
- rval = L_MIN(255, rval1 + rval2);
- gval = L_MIN(255, gval1 + gval2);
- bval = L_MIN(255, bval1 + bval2);
- composeRGBPixel(rval, gval, bval, lined + j);
- }
- }
-
- pixDestroy(&pixc1);
- pixDestroy(&pixc2);
- return pixd;
-}
-
-
-/*-----------------------------------------------------------------------*
- * Two-image min and max operations (8 and 16 bpp) *
- *-----------------------------------------------------------------------*/
-/*!
- * \brief pixMinOrMax()
- *
- * \param[in] pixd [optional] destination: this can be null,
- * equal to pixs1, or different from pixs1
- * \param[in] pixs1 can be equal to pixd
- * \param[in] pixs2
- * \param[in] type L_CHOOSE_MIN, L_CHOOSE_MAX
- * \return pixd always
- *
- *
- * Notes:
- * (1) This gives the min or max of two images, component-wise.
- * (2) The depth can be 8 or 16 bpp for 1 component, and 32 bpp
- * for a 3 component image. For 32 bpp, ignore the LSB
- * of each word (the alpha channel)
- * (3) There are 3 cases:
- * ~ if pixd == null, Min(src1, src2) --> new pixd
- * ~ if pixd == pixs1, Min(src1, src2) --> src1 (in-place)
- * ~ if pixd != pixs1, Min(src1, src2) --> input pixd
- *
- */
-PIX *
-pixMinOrMax(PIX *pixd,
- PIX *pixs1,
- PIX *pixs2,
- l_int32 type)
-{
-l_int32 d, ws, hs, w, h, wpls, wpld, i, j, vals, vald, val;
-l_int32 rval1, gval1, bval1, rval2, gval2, bval2, rval, gval, bval;
-l_uint32 *datas, *datad, *lines, *lined;
-
- PROCNAME("pixMinOrMax");
-
- if (!pixs1)
- return (PIX *)ERROR_PTR("pixs1 not defined", procName, pixd);
- if (!pixs2)
- return (PIX *)ERROR_PTR("pixs2 not defined", procName, pixd);
- if (pixs1 == pixs2)
- return (PIX *)ERROR_PTR("pixs1 and pixs2 must differ", procName, pixd);
- if (type != L_CHOOSE_MIN && type != L_CHOOSE_MAX)
- return (PIX *)ERROR_PTR("invalid type", procName, pixd);
- d = pixGetDepth(pixs1);
- if (pixGetDepth(pixs2) != d)
- return (PIX *)ERROR_PTR("depths unequal", procName, pixd);
- if (d != 8 && d != 16 && d != 32)
- return (PIX *)ERROR_PTR("depth not 8, 16 or 32 bpp", procName, pixd);
-
- if (pixs1 != pixd)
- pixd = pixCopy(pixd, pixs1);
-
- pixGetDimensions(pixs2, &ws, &hs, NULL);
- pixGetDimensions(pixd, &w, &h, NULL);
- w = L_MIN(w, ws);
- h = L_MIN(h, hs);
- datas = pixGetData(pixs2);
- datad = pixGetData(pixd);
- wpls = pixGetWpl(pixs2);
- wpld = pixGetWpl(pixd);
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- lined = datad + i * wpld;
- if (d == 8) {
- for (j = 0; j < w; j++) {
- vals = GET_DATA_BYTE(lines, j);
- vald = GET_DATA_BYTE(lined, j);
- if (type == L_CHOOSE_MIN)
- val = L_MIN(vals, vald);
- else /* type == L_CHOOSE_MAX */
- val = L_MAX(vals, vald);
- SET_DATA_BYTE(lined, j, val);
- }
- } else if (d == 16) {
- for (j = 0; j < w; j++) {
- vals = GET_DATA_TWO_BYTES(lines, j);
- vald = GET_DATA_TWO_BYTES(lined, j);
- if (type == L_CHOOSE_MIN)
- val = L_MIN(vals, vald);
- else /* type == L_CHOOSE_MAX */
- val = L_MAX(vals, vald);
- SET_DATA_TWO_BYTES(lined, j, val);
- }
- } else { /* d == 32 */
- for (j = 0; j < w; j++) {
- extractRGBValues(lines[j], &rval1, &gval1, &bval1);
- extractRGBValues(lined[j], &rval2, &gval2, &bval2);
- if (type == L_CHOOSE_MIN) {
- rval = L_MIN(rval1, rval2);
- gval = L_MIN(gval1, gval2);
- bval = L_MIN(bval1, bval2);
- } else { /* type == L_CHOOSE_MAX */
- rval = L_MAX(rval1, rval2);
- gval = L_MAX(gval1, gval2);
- bval = L_MAX(bval1, bval2);
- }
- composeRGBPixel(rval, gval, bval, lined + j);
- }
- }
- }
-
- return pixd;
-}
-
-
-/*-----------------------------------------------------------------------*
- * Scale for maximum dynamic range *
- *-----------------------------------------------------------------------*/
-/*!
- * \brief pixMaxDynamicRange()
- *
- * \param[in] pixs 4, 8, 16 or 32 bpp source
- * \param[in] type L_LINEAR_SCALE or L_LOG_SCALE
- * \return pixd 8 bpp, or NULL on error
- *
- *
- * Notes:
- * (1) Scales pixel values to fit maximally within the dest 8 bpp pixd
- * (2) Assumes the source 'pixels' are a 1-component scalar. For
- * a 32 bpp source, each pixel is treated as a single number --
- * not as a 3-component rgb pixel value.
- * (3) Uses a LUT for log scaling.
- *
- */
-PIX *
-pixMaxDynamicRange(PIX *pixs,
- l_int32 type)
-{
-l_uint8 dval;
-l_int32 i, j, w, h, d, wpls, wpld, max;
-l_uint32 *datas, *datad;
-l_uint32 word, sval;
-l_uint32 *lines, *lined;
-l_float32 factor;
-l_float32 *tab;
-PIX *pixd;
-
- PROCNAME("pixMaxDynamicRange");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- pixGetDimensions(pixs, &w, &h, &d);
- if (d != 4 && d != 8 && d != 16 && d != 32)
- return (PIX *)ERROR_PTR("pixs not in {4,8,16,32} bpp", procName, NULL);
- if (type != L_LINEAR_SCALE && type != L_LOG_SCALE)
- return (PIX *)ERROR_PTR("invalid type", procName, NULL);
-
- if ((pixd = pixCreate(w, h, 8)) == NULL)
- return (PIX *)ERROR_PTR("pixd not made", procName, NULL);
- pixCopyResolution(pixd, pixs);
- datas = pixGetData(pixs);
- datad = pixGetData(pixd);
- wpls = pixGetWpl(pixs);
- wpld = pixGetWpl(pixd);
-
- /* Get max */
- max = 0;
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- for (j = 0; j < wpls; j++) {
- word = *(lines + j);
- if (d == 4) {
- max = L_MAX(max, word >> 28);
- max = L_MAX(max, (word >> 24) & 0xf);
- max = L_MAX(max, (word >> 20) & 0xf);
- max = L_MAX(max, (word >> 16) & 0xf);
- max = L_MAX(max, (word >> 12) & 0xf);
- max = L_MAX(max, (word >> 8) & 0xf);
- max = L_MAX(max, (word >> 4) & 0xf);
- max = L_MAX(max, word & 0xf);
- } else if (d == 8) {
- max = L_MAX(max, word >> 24);
- max = L_MAX(max, (word >> 16) & 0xff);
- max = L_MAX(max, (word >> 8) & 0xff);
- max = L_MAX(max, word & 0xff);
- } else if (d == 16) {
- max = L_MAX(max, word >> 16);
- max = L_MAX(max, word & 0xffff);
- } else { /* d == 32 (rgb) */
- max = L_MAX(max, word);
- }
- }
- }
-
- /* Map to the full dynamic range */
- if (d == 4) {
- if (type == L_LINEAR_SCALE) {
- factor = 255. / (l_float32)max;
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- lined = datad + i * wpld;
- for (j = 0; j < w; j++) {
- sval = GET_DATA_QBIT(lines, j);
- dval = (l_uint8)(factor * (l_float32)sval + 0.5);
- SET_DATA_QBIT(lined, j, dval);
- }
- }
- } else { /* type == L_LOG_SCALE) */
- tab = makeLogBase2Tab();
- factor = 255. / getLogBase2(max, tab);
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- lined = datad + i * wpld;
- for (j = 0; j < w; j++) {
- sval = GET_DATA_QBIT(lines, j);
- dval = (l_uint8)(factor * getLogBase2(sval, tab) + 0.5);
- SET_DATA_BYTE(lined, j, dval);
- }
- }
- LEPT_FREE(tab);
- }
- } else if (d == 8) {
- if (type == L_LINEAR_SCALE) {
- factor = 255. / (l_float32)max;
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- lined = datad + i * wpld;
- for (j = 0; j < w; j++) {
- sval = GET_DATA_BYTE(lines, j);
- dval = (l_uint8)(factor * (l_float32)sval + 0.5);
- SET_DATA_BYTE(lined, j, dval);
- }
- }
- } else { /* type == L_LOG_SCALE) */
- tab = makeLogBase2Tab();
- factor = 255. / getLogBase2(max, tab);
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- lined = datad + i * wpld;
- for (j = 0; j < w; j++) {
- sval = GET_DATA_BYTE(lines, j);
- dval = (l_uint8)(factor * getLogBase2(sval, tab) + 0.5);
- SET_DATA_BYTE(lined, j, dval);
- }
- }
- LEPT_FREE(tab);
- }
- } else if (d == 16) {
- if (type == L_LINEAR_SCALE) {
- factor = 255. / (l_float32)max;
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- lined = datad + i * wpld;
- for (j = 0; j < w; j++) {
- sval = GET_DATA_TWO_BYTES(lines, j);
- dval = (l_uint8)(factor * (l_float32)sval + 0.5);
- SET_DATA_BYTE(lined, j, dval);
- }
- }
- } else { /* type == L_LOG_SCALE) */
- tab = makeLogBase2Tab();
- factor = 255. / getLogBase2(max, tab);
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- lined = datad + i * wpld;
- for (j = 0; j < w; j++) {
- sval = GET_DATA_TWO_BYTES(lines, j);
- dval = (l_uint8)(factor * getLogBase2(sval, tab) + 0.5);
- SET_DATA_BYTE(lined, j, dval);
- }
- }
- LEPT_FREE(tab);
- }
- } else { /* d == 32 */
- if (type == L_LINEAR_SCALE) {
- factor = 255. / (l_float32)max;
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- lined = datad + i * wpld;
- for (j = 0; j < w; j++) {
- sval = lines[j];
- dval = (l_uint8)(factor * (l_float32)sval + 0.5);
- SET_DATA_BYTE(lined, j, dval);
- }
- }
- } else { /* type == L_LOG_SCALE) */
- tab = makeLogBase2Tab();
- factor = 255. / getLogBase2(max, tab);
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- lined = datad + i * wpld;
- for (j = 0; j < w; j++) {
- sval = lines[j];
- dval = (l_uint8)(factor * getLogBase2(sval, tab) + 0.5);
- SET_DATA_BYTE(lined, j, dval);
- }
- }
- LEPT_FREE(tab);
- }
- }
-
- return pixd;
-}
-
-
-/*!
- * \brief pixMaxDynamicRangeRGB()
- *
- * \param[in] pixs 32 bpp rgb source
- * \param[in] type L_LINEAR_SCALE or L_LOG_SCALE
- * \return pixd 32 bpp, or NULL on error
- *
- *
- * Notes:
- * (1) Scales pixel values to fit maximally within a 32 bpp dest pixd
- * (2) All color components are scaled with the same factor, based
- * on the maximum r,g or b component in the image. This should
- * not be used if the 32-bit value is a single number (e.g., a
- * count in a histogram generated by pixMakeHistoHS()).
- * (3) Uses a LUT for log scaling.
- *
- */
-PIX *
-pixMaxDynamicRangeRGB(PIX *pixs,
- l_int32 type)
-{
-l_int32 i, j, w, h, wpls, wpld, max;
-l_uint32 sval, dval, word;
-l_uint32 *datas, *datad;
-l_uint32 *lines, *lined;
-l_float32 factor;
-l_float32 *tab;
-PIX *pixd;
-
- PROCNAME("pixMaxDynamicRangeRGB");
-
- if (!pixs || pixGetDepth(pixs) != 32)
- return (PIX *)ERROR_PTR("pixs undefined or not 32 bpp", procName, NULL);
- if (type != L_LINEAR_SCALE && type != L_LOG_SCALE)
- return (PIX *)ERROR_PTR("invalid type", procName, NULL);
-
- /* Get max */
- pixd = pixCreateTemplate(pixs);
- datas = pixGetData(pixs);
- datad = pixGetData(pixd);
- wpls = pixGetWpl(pixs);
- wpld = pixGetWpl(pixd);
- pixGetDimensions(pixs, &w, &h, NULL);
- max = 0;
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- for (j = 0; j < wpls; j++) {
- word = lines[j];
- max = L_MAX(max, word >> 24);
- max = L_MAX(max, (word >> 16) & 0xff);
- max = L_MAX(max, (word >> 8) & 0xff);
- }
- }
-
- /* Map to the full dynamic range */
- if (type == L_LINEAR_SCALE) {
- factor = 255. / (l_float32)max;
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- lined = datad + i * wpld;
- for (j = 0; j < w; j++) {
- sval = lines[j];
- dval = linearScaleRGBVal(sval, factor);
- lined[j] = dval;
- }
- }
- } else { /* type == L_LOG_SCALE) */
- tab = makeLogBase2Tab();
- factor = 255. / getLogBase2(max, tab);
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- lined = datad + i * wpld;
- for (j = 0; j < w; j++) {
- sval = lines[j];
- dval = logScaleRGBVal(sval, tab, factor);
- lined[j] = dval;
- }
- }
- LEPT_FREE(tab);
- }
-
- return pixd;
-}
-
-
-/*-----------------------------------------------------------------------*
- * RGB pixel value scaling *
- *-----------------------------------------------------------------------*/
-/*!
- * \brief linearScaleRGBVal()
- *
- * \param[in] sval 32-bit rgb pixel value
- * \param[in] factor multiplication factor on each component
- * \return dval linearly scaled version of %sval
- *
- *
- * Notes:
- * (1) %factor must be chosen to be not greater than (255 / maxcomp),
- * where maxcomp is the maximum value of the pixel components.
- * Otherwise, the product will overflow a uint8. In use, factor
- * is the same for all pixels in a pix.
- * (2) No scaling is performed on the transparency ("A") component.
- *
- */
-l_uint32
-linearScaleRGBVal(l_uint32 sval,
- l_float32 factor)
-{
-l_uint32 dval;
-
- dval = ((l_uint8)(factor * (sval >> 24) + 0.5) << 24) |
- ((l_uint8)(factor * ((sval >> 16) & 0xff) + 0.5) << 16) |
- ((l_uint8)(factor * ((sval >> 8) & 0xff) + 0.5) << 8) |
- (sval & 0xff);
- return dval;
-}
-
-
-/*!
- * \brief logScaleRGBVal()
- *
- * \param[in] sval 32-bit rgb pixel value
- * \param[in] tab 256 entry log-base-2 table
- * \param[in] factor multiplication factor on each component
- * \return dval log scaled version of %sval
- *
- *
- * Notes:
- * (1) %tab is made with makeLogBase2Tab().
- * (2) %factor must be chosen to be not greater than
- * 255.0 / log[base2](maxcomp), where maxcomp is the maximum
- * value of the pixel components. Otherwise, the product
- * will overflow a uint8. In use, factor is the same for
- * all pixels in a pix.
- * (3) No scaling is performed on the transparency ("A") component.
- *
- */
-l_uint32
-logScaleRGBVal(l_uint32 sval,
- l_float32 *tab,
- l_float32 factor)
-{
-l_uint32 dval;
-
- dval = ((l_uint8)(factor * getLogBase2(sval >> 24, tab) + 0.5) << 24) |
- ((l_uint8)(factor * getLogBase2(((sval >> 16) & 0xff), tab) + 0.5)
- << 16) |
- ((l_uint8)(factor * getLogBase2(((sval >> 8) & 0xff), tab) + 0.5)
- << 8) |
- (sval & 0xff);
- return dval;
-}
-
-
-/*-----------------------------------------------------------------------*
- * Log base2 lookup *
- *-----------------------------------------------------------------------*/
-/*
- * \brief makeLogBase2Tab()
- *
- * \return tab table giving the log[base2] of values from 1 to 255
- */
-l_float32 *
-makeLogBase2Tab(void)
-{
-l_int32 i;
-l_float32 log2;
-l_float32 *tab;
-
- PROCNAME("makeLogBase2Tab");
-
- if ((tab = (l_float32 *)LEPT_CALLOC(256, sizeof(l_float32))) == NULL)
- return (l_float32 *)ERROR_PTR("tab not made", procName, NULL);
-
- log2 = (l_float32)log((l_float32)2);
- for (i = 0; i < 256; i++)
- tab[i] = (l_float32)log((l_float32)i) / log2;
-
- return tab;
-}
-
-
-/*
- * \brief getLogBase2()
- *
- * \param[in] val in range [0 ... 255]
- * \param[in] logtab 256-entry table of logs
- * \return logval log[base2] of %val, or 0 on error
- */
-l_float32
-getLogBase2(l_int32 val,
- l_float32 *logtab)
-{
- PROCNAME("getLogBase2");
-
- if (!logtab)
- return ERROR_INT("logtab not defined", procName, 0);
-
- if (val < 0x100)
- return logtab[val];
- else if (val < 0x10000)
- return 8.0 + logtab[val >> 8];
- else if (val < 0x1000000)
- return 16.0 + logtab[val >> 16];
- else
- return 24.0 + logtab[val >> 24];
-}
diff --git a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pixcomp.c b/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pixcomp.c
deleted file mode 100644
index c1f3384e..00000000
--- a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pixcomp.c
+++ /dev/null
@@ -1,2456 +0,0 @@
-/*====================================================================*
- - Copyright (C) 2001 Leptonica. All rights reserved.
- -
- - Redistribution and use in source and binary forms, with or without
- - modification, are permitted provided that the following conditions
- - are met:
- - 1. Redistributions of source code must retain the above copyright
- - notice, this list of conditions and the following disclaimer.
- - 2. Redistributions in binary form must reproduce the above
- - copyright notice, this list of conditions and the following
- - disclaimer in the documentation and/or other materials
- - provided with the distribution.
- -
- - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- - ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- - LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- - A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL ANY
- - CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
- - EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
- - PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
- - PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
- - OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
- - NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- *====================================================================*/
-
-/*!
- * \file pixcomp.c
- *
- *
- * Pixcomp creation and destruction
- * PIXC *pixcompCreateFromPix()
- * PIXC *pixcompCreateFromString()
- * PIXC *pixcompCreateFromFile()
- * void pixcompDestroy()
- * PIXC *pixcompCopy()
-
- * Pixcomp accessors
- * l_int32 pixcompGetDimensions()
- * l_int32 pixcompGetParameters()
- *
- * Pixcomp compression selection
- * l_int32 pixcompDetermineFormat()
- *
- * Pixcomp conversion to Pix
- * PIX *pixCreateFromPixcomp()
- *
- * Pixacomp creation and destruction
- * PIXAC *pixacompCreate()
- * PIXAC *pixacompCreateWithInit()
- * PIXAC *pixacompCreateFromPixa()
- * PIXAC *pixacompCreateFromFiles()
- * PIXAC *pixacompCreateFromSA()
- * void pixacompDestroy()
- *
- * Pixacomp addition/replacement
- * l_int32 pixacompAddPix()
- * l_int32 pixacompAddPixcomp()
- * static l_int32 pixacompExtendArray()
- * l_int32 pixacompReplacePix()
- * l_int32 pixacompReplacePixcomp()
- * l_int32 pixacompAddBox()
- *
- * Pixacomp accessors
- * l_int32 pixacompGetCount()
- * PIXC *pixacompGetPixcomp()
- * PIX *pixacompGetPix()
- * l_int32 pixacompGetPixDimensions()
- * BOXA *pixacompGetBoxa()
- * l_int32 pixacompGetBoxaCount()
- * BOX *pixacompGetBox()
- * l_int32 pixacompGetBoxGeometry()
- * l_int32 pixacompGetOffset()
- * l_int32 pixacompSetOffset()
- *
- * Pixacomp conversion to Pixa
- * PIXA *pixaCreateFromPixacomp()
- *
- * Combining pixacomp
- * l_int32 pixacompJoin()
- * PIXAC *pixacompInterleave()
- *
- * Pixacomp serialized I/O
- * PIXAC *pixacompRead()
- * PIXAC *pixacompReadStream()
- * PIXAC *pixacompReadMem()
- * l_int32 pixacompWrite()
- * l_int32 pixacompWriteStream()
- * l_int32 pixacompWriteMem()
- *
- * Conversion to pdf
- * l_int32 pixacompConvertToPdf()
- * l_int32 pixacompConvertToPdfData()
- * l_int32 pixacompFastConvertToPdfData()
- *
- * Output for debugging
- * l_int32 pixacompWriteStreamInfo()
- * l_int32 pixcompWriteStreamInfo()
- * PIX *pixacompDisplayTiledAndScaled()
- * l_int32 pixacompWriteFiles()
- * l_int32 pixcompWriteFile()
- *
- * The Pixacomp is an array of Pixcomp, where each Pixcomp is a compressed
- * string of the image. We don't use reference counting here.
- * The basic application is to allow a large array of highly
- * compressible images to reside in memory. We purposely don't
- * reuse the Pixa for this, to avoid confusion and programming errors.
- *
- * Three compression formats are used: g4, png and jpeg.
- * The compression type can be either specified or defaulted.
- * If specified and it is not possible to compress (for example,
- * you specify a jpeg on a 1 bpp image or one with a colormap),
- * the compression type defaults to png. The jpeg compression quality
- * can be specified using l_setJpegQuality(); otherwise the default is 75.
- *
- * The serialized version of the Pixacomp is similar to that for
- * a Pixa, except that each Pixcomp can be compressed by one of
- * tiffg4, png, or jpeg. Unlike serialization of the Pixa,
- * serialization of the Pixacomp does not require any imaging
- * libraries because it simply reads and writes the compressed data.
- *
- * There are two modes of use in accumulating images:
- * (1) addition to the end of the array
- * (2) random insertion (replacement) into the array
- *
- * In use, we assume that the array is fully populated up to the
- * index value (n - 1), where n is the value of the pixcomp field n.
- * Addition can only be made to the end of the fully populated array,
- * at the index value n. Insertion can be made randomly, but again
- * only within the array of pixcomps; i.e., within the set of
- * indices {0 .... n-1}. The functions are pixacompReplacePix()
- * and pixacompReplacePixcomp(), and they destroy the existing pixcomp.
- *
- * For addition to the end of the array, initialize the pixacomp with
- * pixacompCreate(), which generates an empty array of pixcomps ptrs.
- * For random insertion and replacement of pixcomp into a pixacomp,
- * initialize a fully populated array using pixacompCreateWithInit().
- *
- * The offset field allows you to use an offset-based index to
- * access the 0-based ptr array in the pixacomp. This would typically
- * be used to map the pixacomp array index to a page number, or v.v.
- * By default, the offset is 0. For example, suppose you have 50 images,
- * corresponding to page numbers 10 - 59. Then you could use
- * pixac = pixacompCreateWithInit(50, 10, ...);
- * This would allocate an array of 50 pixcomps, but if you asked for
- * the pix at index 10, using pixacompGetPix(pixac, 10), it would
- * apply the offset internally, returning the pix at index 0 in the array.
- *
- */
-
-#ifdef HAVE_CONFIG_H
-#include
-#endif /* HAVE_CONFIG_H */
-
-#include
-#include "allheaders.h"
-
- /* Bounds on initial array size */
-static const l_uint32 MaxPtrArraySize = 1000000;
-static const l_int32 InitialPtrArraySize = 20; /*!< n'importe quoi */
-
- /* Bound on data size */
-static const size_t MaxDataSize = 1000000000;
-
- /* These two globals are defined in writefile.c */
-extern l_int32 NumImageFileFormatExtensions;
-extern const char *ImageFileFormatExtensions[];
-
- /* Static functions */
-static l_int32 pixacompExtendArray(PIXAC *pixac);
-static l_int32 pixcompFastConvertToPdfData(PIXC *pixc, const char *title,
- l_uint8 **pdata, size_t *pnbytes);
-
-
-/*---------------------------------------------------------------------*
- * Pixcomp creation and destruction *
- *---------------------------------------------------------------------*/
-/*!
- * \brief pixcompCreateFromPix()
- *
- * \param[in] pix
- * \param[in] comptype IFF_DEFAULT, IFF_TIFF_G4, IFF_PNG, IFF_JFIF_JPEG
- * \return pixc, or NULL on error
- *
- *
- * Notes:
- * (1) Use %comptype == IFF_DEFAULT to have the compression
- * type automatically determined.
- * (2) To compress jpeg with a quality other than the default (75), use
- * l_jpegSetQuality()
- *
- */
-PIXC *
-pixcompCreateFromPix(PIX *pix,
- l_int32 comptype)
-{
-size_t size;
-char *text;
-l_int32 ret, format;
-l_uint8 *data;
-PIXC *pixc;
-
- PROCNAME("pixcompCreateFromPix");
-
- if (!pix)
- return (PIXC *)ERROR_PTR("pix not defined", procName, NULL);
- if (comptype != IFF_DEFAULT && comptype != IFF_TIFF_G4 &&
- comptype != IFF_PNG && comptype != IFF_JFIF_JPEG)
- return (PIXC *)ERROR_PTR("invalid comptype", procName, NULL);
-
- pixc = (PIXC *)LEPT_CALLOC(1, sizeof(PIXC));
- pixGetDimensions(pix, &pixc->w, &pixc->h, &pixc->d);
- pixGetResolution(pix, &pixc->xres, &pixc->yres);
- if (pixGetColormap(pix))
- pixc->cmapflag = 1;
- if ((text = pixGetText(pix)) != NULL)
- pixc->text = stringNew(text);
-
- pixcompDetermineFormat(comptype, pixc->d, pixc->cmapflag, &format);
- pixc->comptype = format;
- ret = pixWriteMem(&data, &size, pix, format);
- if (ret) {
- L_ERROR("write to memory failed\n", procName);
- pixcompDestroy(&pixc);
- return NULL;
- }
- pixc->data = data;
- pixc->size = size;
-
- return pixc;
-}
-
-
-/*!
- * \brief pixcompCreateFromString()
- *
- * \param[in] data compressed string
- * \param[in] size number of bytes
- * \param[in] copyflag L_INSERT or L_COPY
- * \return pixc, or NULL on error
- *
- *
- * Notes:
- * (1) This works when the compressed string is png, jpeg or tiffg4.
- * (2) The copyflag determines if the data in the new Pixcomp is
- * a copy of the input data.
- *
- */
-PIXC *
-pixcompCreateFromString(l_uint8 *data,
- size_t size,
- l_int32 copyflag)
-{
-l_int32 format, w, h, d, bps, spp, iscmap;
-PIXC *pixc;
-
- PROCNAME("pixcompCreateFromString");
-
- if (!data)
- return (PIXC *)ERROR_PTR("data not defined", procName, NULL);
- if (copyflag != L_INSERT && copyflag != L_COPY)
- return (PIXC *)ERROR_PTR("invalid copyflag", procName, NULL);
-
- if (pixReadHeaderMem(data, size, &format, &w, &h, &bps, &spp, &iscmap) == 1)
- return (PIXC *)ERROR_PTR("header data not read", procName, NULL);
- pixc = (PIXC *)LEPT_CALLOC(1, sizeof(PIXC));
- d = (spp == 3) ? 32 : bps * spp;
- pixc->w = w;
- pixc->h = h;
- pixc->d = d;
- pixc->comptype = format;
- pixc->cmapflag = iscmap;
- if (copyflag == L_INSERT)
- pixc->data = data;
- else
- pixc->data = l_binaryCopy(data, size);
- pixc->size = size;
- return pixc;
-}
-
-
-/*!
- * \brief pixcompCreateFromFile()
- *
- * \param[in] filename
- * \param[in] comptype IFF_DEFAULT, IFF_TIFF_G4, IFF_PNG, IFF_JFIF_JPEG
- * \return pixc, or NULL on error
- *
- *
- * Notes:
- * (1) Use %comptype == IFF_DEFAULT to have the compression
- * type automatically determined.
- * (2) If the comptype is invalid for this file, the default will
- * be substituted.
- *
- */
-PIXC *
-pixcompCreateFromFile(const char *filename,
- l_int32 comptype)
-{
-l_int32 format;
-size_t nbytes;
-l_uint8 *data;
-PIX *pix;
-PIXC *pixc;
-
- PROCNAME("pixcompCreateFromFile");
-
- if (!filename)
- return (PIXC *)ERROR_PTR("filename not defined", procName, NULL);
- if (comptype != IFF_DEFAULT && comptype != IFF_TIFF_G4 &&
- comptype != IFF_PNG && comptype != IFF_JFIF_JPEG)
- return (PIXC *)ERROR_PTR("invalid comptype", procName, NULL);
-
- findFileFormat(filename, &format);
- if (format == IFF_UNKNOWN) {
- L_ERROR("unreadable file: %s\n", procName, filename);
- return NULL;
- }
-
- /* Can we accept the encoded file directly? Remember that
- * png is the "universal" compression type, so if requested
- * it takes precedence. Otherwise, if the file is already
- * compressed in g4 or jpeg, just accept the string. */
- if ((format == IFF_TIFF_G4 && comptype != IFF_PNG) ||
- (format == IFF_JFIF_JPEG && comptype != IFF_PNG))
- comptype = format;
- if (comptype != IFF_DEFAULT && comptype == format) {
- data = l_binaryRead(filename, &nbytes);
- if ((pixc = pixcompCreateFromString(data, nbytes, L_INSERT)) == NULL) {
- LEPT_FREE(data);
- return (PIXC *)ERROR_PTR("pixc not made (string)", procName, NULL);
- }
- return pixc;
- }
-
- /* Need to recompress in the default format */
- if ((pix = pixRead(filename)) == NULL)
- return (PIXC *)ERROR_PTR("pix not read", procName, NULL);
- if ((pixc = pixcompCreateFromPix(pix, comptype)) == NULL) {
- pixDestroy(&pix);
- return (PIXC *)ERROR_PTR("pixc not made", procName, NULL);
- }
- pixDestroy(&pix);
- return pixc;
-}
-
-
-/*!
- * \brief pixcompDestroy()
- *
- * \param[in,out] ppixc use ptr address so it will be nulled
- * \return void
- *
- *
- * Notes:
- * (1) Always nulls the input ptr.
- *
- */
-void
-pixcompDestroy(PIXC **ppixc)
-{
-PIXC *pixc;
-
- PROCNAME("pixcompDestroy");
-
- if (!ppixc) {
- L_WARNING("ptr address is null!\n", procName);
- return;
- }
-
- if ((pixc = *ppixc) == NULL)
- return;
-
- LEPT_FREE(pixc->data);
- if (pixc->text)
- LEPT_FREE(pixc->text);
- LEPT_FREE(pixc);
- *ppixc = NULL;
- return;
-}
-
-
-/*!
- * \brief pixcompCopy()
- *
- * \param[in] pixcs
- * \return pixcd, or NULL on error
- */
-PIXC *
-pixcompCopy(PIXC *pixcs)
-{
-size_t size;
-l_uint8 *datas, *datad;
-PIXC *pixcd;
-
- PROCNAME("pixcompCopy");
-
- if (!pixcs)
- return (PIXC *)ERROR_PTR("pixcs not defined", procName, NULL);
-
- pixcd = (PIXC *)LEPT_CALLOC(1, sizeof(PIXC));
- pixcd->w = pixcs->w;
- pixcd->h = pixcs->h;
- pixcd->d = pixcs->d;
- pixcd->xres = pixcs->xres;
- pixcd->yres = pixcs->yres;
- pixcd->comptype = pixcs->comptype;
- if (pixcs->text != NULL)
- pixcd->text = stringNew(pixcs->text);
- pixcd->cmapflag = pixcs->cmapflag;
-
- /* Copy image data */
- size = pixcs->size;
- datas = pixcs->data;
- if ((datad = (l_uint8 *)LEPT_CALLOC(size, sizeof(l_int8))) == NULL) {
- pixcompDestroy(&pixcd);
- return (PIXC *)ERROR_PTR("pixcd not made", procName, NULL);
- }
- memcpy(datad, datas, size);
- pixcd->data = datad;
- pixcd->size = size;
- return pixcd;
-}
-
-
-/*---------------------------------------------------------------------*
- * Pixcomp accessors *
- *---------------------------------------------------------------------*/
-/*!
- * \brief pixcompGetDimensions()
- *
- * \param[in] pixc
- * \param[out] pw, ph, pd [optional]
- * \return 0 if OK, 1 on error
- */
-l_ok
-pixcompGetDimensions(PIXC *pixc,
- l_int32 *pw,
- l_int32 *ph,
- l_int32 *pd)
-{
- PROCNAME("pixcompGetDimensions");
-
- if (!pixc)
- return ERROR_INT("pixc not defined", procName, 1);
- if (pw) *pw = pixc->w;
- if (ph) *ph = pixc->h;
- if (pd) *pd = pixc->d;
- return 0;
-}
-
-
-/*!
- * \brief pixcompGetParameters()
- *
- * \param[in] pixc
- * \param[out] pxres, pyres, pcomptype, pcmapflag [optional]
- * \return 0 if OK, 1 on error
- */
-l_ok
-pixcompGetParameters(PIXC *pixc,
- l_int32 *pxres,
- l_int32 *pyres,
- l_int32 *pcomptype,
- l_int32 *pcmapflag)
-{
- PROCNAME("pixcompGetParameters");
-
- if (!pixc)
- return ERROR_INT("pixc not defined", procName, 1);
- if (pxres) *pxres = pixc->xres;
- if (pyres) *pyres = pixc->yres;
- if (pcomptype) *pcomptype = pixc->comptype;
- if (pcmapflag) *pcmapflag = pixc->cmapflag;
- return 0;
-}
-
-
-/*---------------------------------------------------------------------*
- * Pixcomp compression selection *
- *---------------------------------------------------------------------*/
-/*!
- * \brief pixcompDetermineFormat()
- *
- * \param[in] comptype IFF_DEFAULT, IFF_TIFF_G4, IFF_PNG, IFF_JFIF_JPEG
- * \param[in] d pix depth
- * \param[in] cmapflag 1 if pix to be compressed as a colormap; 0 otherwise
- * \param[out] pformat IFF_TIFF, IFF_PNG or IFF_JFIF_JPEG
- * \return 0 if OK; 1 on error
- *
- *
- * Notes:
- * (1) This determines the best format for a pix, given both
- * the request (%comptype) and the image characteristics.
- * (2) If %comptype == IFF_DEFAULT, this does not necessarily result
- * in png encoding. Instead, it returns one of the three formats
- * that is both valid and most likely to give best compression.
- * (3) If %d == 8 with no colormap and:
- * * you wish to compress with png, use %comptype == IFF_PNG
- * * you wish to compress with jpeg, use either
- * %comptype == IFF_JFIF_JPEG or %comptype == IFF_DEFAULT.
- * (4) If the pix cannot be compressed by the input value of
- * %comptype, this selects IFF_PNG, which can compress all pix.
- *
- */
-l_ok
-pixcompDetermineFormat(l_int32 comptype,
- l_int32 d,
- l_int32 cmapflag,
- l_int32 *pformat)
-{
-
- PROCNAME("pixcompDetermineFormat");
-
- if (!pformat)
- return ERROR_INT("&format not defined", procName, 1);
- *pformat = IFF_PNG; /* init value and default */
- if (comptype != IFF_DEFAULT && comptype != IFF_TIFF_G4 &&
- comptype != IFF_PNG && comptype != IFF_JFIF_JPEG)
- return ERROR_INT("invalid comptype", procName, 1);
-
- if (comptype == IFF_DEFAULT) {
- if (d == 1)
- *pformat = IFF_TIFF_G4;
- else if (d == 16)
- *pformat = IFF_PNG;
- else if (d >= 8 && !cmapflag)
- *pformat = IFF_JFIF_JPEG;
- } else if (comptype == IFF_TIFF_G4 && d == 1) {
- *pformat = IFF_TIFF_G4;
- } else if (comptype == IFF_JFIF_JPEG && d >= 8 && !cmapflag) {
- *pformat = IFF_JFIF_JPEG;
- }
-
- return 0;
-}
-
-
-/*---------------------------------------------------------------------*
- * Pixcomp conversion to Pix *
- *---------------------------------------------------------------------*/
-/*!
- * \brief pixCreateFromPixcomp()
- *
- * \param[in] pixc
- * \return pix, or NULL on error
- */
-PIX *
-pixCreateFromPixcomp(PIXC *pixc)
-{
-l_int32 w, h, d, cmapinpix, format;
-PIX *pix;
-
- PROCNAME("pixCreateFromPixcomp");
-
- if (!pixc)
- return (PIX *)ERROR_PTR("pixc not defined", procName, NULL);
-
- if ((pix = pixReadMem(pixc->data, pixc->size)) == NULL)
- return (PIX *)ERROR_PTR("pix not read", procName, NULL);
- pixSetResolution(pix, pixc->xres, pixc->yres);
- if (pixc->text)
- pixSetText(pix, pixc->text);
-
- /* Check fields for consistency */
- pixGetDimensions(pix, &w, &h, &d);
- if (pixc->w != w) {
- L_INFO("pix width %d != pixc width %d\n", procName, w, pixc->w);
- L_ERROR("pix width %d != pixc width\n", procName, w);
- }
- if (pixc->h != h)
- L_ERROR("pix height %d != pixc height\n", procName, h);
- if (pixc->d != d) {
- if (pixc->d == 16) /* we strip 16 --> 8 bpp by default */
- L_WARNING("pix depth %d != pixc depth 16\n", procName, d);
- else
- L_ERROR("pix depth %d != pixc depth\n", procName, d);
- }
- cmapinpix = (pixGetColormap(pix) != NULL);
- if ((cmapinpix && !pixc->cmapflag) || (!cmapinpix && pixc->cmapflag))
- L_ERROR("pix cmap flag inconsistent\n", procName);
- format = pixGetInputFormat(pix);
- if (format != pixc->comptype) {
- L_ERROR("pix comptype %d not equal to pixc comptype\n",
- procName, format);
- }
-
- return pix;
-}
-
-
-/*---------------------------------------------------------------------*
- * Pixacomp creation and destruction *
- *---------------------------------------------------------------------*/
-/*!
- * \brief pixacompCreate()
- *
- * \param[in] n initial number of ptrs
- * \return pixac, or NULL on error
- */
-PIXAC *
-pixacompCreate(l_int32 n)
-{
-PIXAC *pixac;
-
- PROCNAME("pixacompCreate");
-
- if (n <= 0 || n > MaxPtrArraySize)
- n = InitialPtrArraySize;
-
- pixac = (PIXAC *)LEPT_CALLOC(1, sizeof(PIXAC));
- pixac->n = 0;
- pixac->nalloc = n;
- pixac->offset = 0;
- if ((pixac->pixc = (PIXC **)LEPT_CALLOC(n, sizeof(PIXC *))) == NULL) {
- pixacompDestroy(&pixac);
- return (PIXAC *)ERROR_PTR("pixc ptrs not made", procName, NULL);
- }
- if ((pixac->boxa = boxaCreate(n)) == NULL) {
- pixacompDestroy(&pixac);
- return (PIXAC *)ERROR_PTR("boxa not made", procName, NULL);
- }
-
- return pixac;
-}
-
-
-/*!
- * \brief pixacompCreateWithInit()
- *
- * \param[in] n initial number of ptrs
- * \param[in] offset difference: accessor index - pixacomp array index
- * \param[in] pix [optional] initialize each ptr in pixacomp
- * to this pix; can be NULL
- * \param[in] comptype IFF_DEFAULT, IFF_TIFF_G4, IFF_PNG, IFF_JFIF_JPEG
- * \return pixac, or NULL on error
- *
- *
- * Notes:
- * (1) Initializes a pixacomp to be fully populated with %pix,
- * compressed using %comptype. If %pix == NULL, %comptype
- * is ignored.
- * (2) Typically, the array is initialized with a tiny pix.
- * This is most easily done by setting %pix == NULL, causing
- * initialization of each array element with a tiny placeholder
- * pix (w = h = d = 1), using comptype = IFF_TIFF_G4 .
- * (3) Example usage:
- * // Generate pixacomp for pages 30 - 49. This has an array
- * // size of 20 and the page number offset is 30.
- * PixaComp *pixac = pixacompCreateWithInit(20, 30, NULL,
- * IFF_TIFF_G4);
- * // Now insert png-compressed images into the initialized array
- * for (pageno = 30; pageno < 50; pageno++) {
- * Pix *pixt = ... // derived from image[pageno]
- * if (pixt)
- * pixacompReplacePix(pixac, pageno, pixt, IFF_PNG);
- * pixDestroy(&pixt);
- * }
- * The result is a pixac with 20 compressed strings, and with
- * selected pixt replacing the placeholders.
- * To extract the image for page 38, which is decompressed
- * from element 8 in the array, use:
- * pixt = pixacompGetPix(pixac, 38);
- *
- */
-PIXAC *
-pixacompCreateWithInit(l_int32 n,
- l_int32 offset,
- PIX *pix,
- l_int32 comptype)
-{
-l_int32 i;
-PIX *pixt;
-PIXC *pixc;
-PIXAC *pixac;
-
- PROCNAME("pixacompCreateWithInit");
-
- if (n <= 0 || n > MaxPtrArraySize)
- return (PIXAC *)ERROR_PTR("n out of valid bounds", procName, NULL);
- if (pix) {
- if (comptype != IFF_DEFAULT && comptype != IFF_TIFF_G4 &&
- comptype != IFF_PNG && comptype != IFF_JFIF_JPEG)
- return (PIXAC *)ERROR_PTR("invalid comptype", procName, NULL);
- } else {
- comptype = IFF_TIFF_G4;
- }
- if (offset < 0) {
- L_WARNING("offset < 0; setting to 0\n", procName);
- offset = 0;
- }
-
- if ((pixac = pixacompCreate(n)) == NULL)
- return (PIXAC *)ERROR_PTR("pixac not made", procName, NULL);
- pixacompSetOffset(pixac, offset);
- if (pix)
- pixt = pixClone(pix);
- else
- pixt = pixCreate(1, 1, 1);
- for (i = 0; i < n; i++) {
- pixc = pixcompCreateFromPix(pixt, comptype);
- pixacompAddPixcomp(pixac, pixc, L_INSERT);
- }
- pixDestroy(&pixt);
-
- return pixac;
-}
-
-
-/*!
- * \brief pixacompCreateFromPixa()
- *
- * \param[in] pixa
- * \param[in] comptype IFF_DEFAULT, IFF_TIFF_G4, IFF_PNG, IFF_JFIF_JPEG
- * \param[in] accesstype L_COPY, L_CLONE, L_COPY_CLONE
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) If %format == IFF_DEFAULT, the conversion format for each
- * image is chosen automatically. Otherwise, we use the
- * specified format unless it can't be done (e.g., jpeg
- * for a 1, 2 or 4 bpp pix, or a pix with a colormap),
- * in which case we use the default (assumed best) compression.
- * (2) %accesstype is used to extract a boxa from %pixa.
- * (3) To compress jpeg with a quality other than the default (75), use
- * l_jpegSetQuality()
- *
- */
-PIXAC *
-pixacompCreateFromPixa(PIXA *pixa,
- l_int32 comptype,
- l_int32 accesstype)
-{
-l_int32 i, n;
-BOXA *boxa;
-PIX *pix;
-PIXAC *pixac;
-
- PROCNAME("pixacompCreateFromPixa");
-
- if (!pixa)
- return (PIXAC *)ERROR_PTR("pixa not defined", procName, NULL);
- if (comptype != IFF_DEFAULT && comptype != IFF_TIFF_G4 &&
- comptype != IFF_PNG && comptype != IFF_JFIF_JPEG)
- return (PIXAC *)ERROR_PTR("invalid comptype", procName, NULL);
- if (accesstype != L_COPY && accesstype != L_CLONE &&
- accesstype != L_COPY_CLONE)
- return (PIXAC *)ERROR_PTR("invalid accesstype", procName, NULL);
-
- n = pixaGetCount(pixa);
- if ((pixac = pixacompCreate(n)) == NULL)
- return (PIXAC *)ERROR_PTR("pixac not made", procName, NULL);
- for (i = 0; i < n; i++) {
- pix = pixaGetPix(pixa, i, L_CLONE);
- pixacompAddPix(pixac, pix, comptype);
- pixDestroy(&pix);
- }
- if ((boxa = pixaGetBoxa(pixa, accesstype)) != NULL) {
- boxaDestroy(&pixac->boxa);
- pixac->boxa = boxa;
- }
-
- return pixac;
-}
-
-
-/*!
- * \brief pixacompCreateFromFiles()
- *
- * \param[in] dirname
- * \param[in] substr [optional] substring filter on filenames; can be null
- * \param[in] comptype IFF_DEFAULT, IFF_TIFF_G4, IFF_PNG, IFF_JFIF_JPEG
- * \return pixac, or NULL on error
- *
- *
- * Notes:
- * (1) %dirname is the full path for the directory.
- * (2) %substr is the part of the file name (excluding
- * the directory) that is to be matched. All matching
- * filenames are read into the Pixa. If substr is NULL,
- * all filenames are read into the Pixa.
- * (3) Use %comptype == IFF_DEFAULT to have the compression
- * type automatically determined for each file.
- * (4) If the comptype is invalid for a file, the default will
- * be substituted.
- *
- */
-PIXAC *
-pixacompCreateFromFiles(const char *dirname,
- const char *substr,
- l_int32 comptype)
-{
-PIXAC *pixac;
-SARRAY *sa;
-
- PROCNAME("pixacompCreateFromFiles");
-
- if (!dirname)
- return (PIXAC *)ERROR_PTR("dirname not defined", procName, NULL);
- if (comptype != IFF_DEFAULT && comptype != IFF_TIFF_G4 &&
- comptype != IFF_PNG && comptype != IFF_JFIF_JPEG)
- return (PIXAC *)ERROR_PTR("invalid comptype", procName, NULL);
-
- if ((sa = getSortedPathnamesInDirectory(dirname, substr, 0, 0)) == NULL)
- return (PIXAC *)ERROR_PTR("sa not made", procName, NULL);
- pixac = pixacompCreateFromSA(sa, comptype);
- sarrayDestroy(&sa);
- return pixac;
-}
-
-
-/*!
- * \brief pixacompCreateFromSA()
- *
- * \param[in] sa full pathnames for all files
- * \param[in] comptype IFF_DEFAULT, IFF_TIFF_G4, IFF_PNG, IFF_JFIF_JPEG
- * \return pixac, or NULL on error
- *
- *
- * Notes:
- * (1) Use %comptype == IFF_DEFAULT to have the compression
- * type automatically determined for each file.
- * (2) If the comptype is invalid for a file, the default will
- * be substituted.
- *
- */
-PIXAC *
-pixacompCreateFromSA(SARRAY *sa,
- l_int32 comptype)
-{
-char *str;
-l_int32 i, n;
-PIXC *pixc;
-PIXAC *pixac;
-
- PROCNAME("pixacompCreateFromSA");
-
- if (!sa)
- return (PIXAC *)ERROR_PTR("sarray not defined", procName, NULL);
- if (comptype != IFF_DEFAULT && comptype != IFF_TIFF_G4 &&
- comptype != IFF_PNG && comptype != IFF_JFIF_JPEG)
- return (PIXAC *)ERROR_PTR("invalid comptype", procName, NULL);
-
- n = sarrayGetCount(sa);
- pixac = pixacompCreate(n);
- for (i = 0; i < n; i++) {
- str = sarrayGetString(sa, i, L_NOCOPY);
- if ((pixc = pixcompCreateFromFile(str, comptype)) == NULL) {
- L_ERROR("pixc not read from file: %s\n", procName, str);
- continue;
- }
- pixacompAddPixcomp(pixac, pixc, L_INSERT);
- }
- return pixac;
-}
-
-
-/*!
- * \brief pixacompDestroy()
- *
- * \param[in,out] ppixac use ptr address so it will be nulled
- * \return void
- *
- *
- * Notes:
- * (1) Always nulls the input ptr.
- *
- */
-void
-pixacompDestroy(PIXAC **ppixac)
-{
-l_int32 i;
-PIXAC *pixac;
-
- PROCNAME("pixacompDestroy");
-
- if (ppixac == NULL) {
- L_WARNING("ptr address is NULL!\n", procName);
- return;
- }
-
- if ((pixac = *ppixac) == NULL)
- return;
-
- for (i = 0; i < pixac->n; i++)
- pixcompDestroy(&pixac->pixc[i]);
- LEPT_FREE(pixac->pixc);
- boxaDestroy(&pixac->boxa);
- LEPT_FREE(pixac);
-
- *ppixac = NULL;
- return;
-}
-
-
-/*---------------------------------------------------------------------*
- * Pixacomp addition *
- *---------------------------------------------------------------------*/
-/*!
- * \brief pixacompAddPix()
- *
- * \param[in] pixac
- * \param[in] pix to be added
- * \param[in] comptype IFF_DEFAULT, IFF_TIFF_G4, IFF_PNG, IFF_JFIF_JPEG
- * \return 0 if OK; 1 on error
- *
- *
- * Notes:
- * (1) The array is filled up to the (n-1)-th element, and this
- * converts the input pix to a pixc and adds it at
- * the n-th position.
- * (2) The pixc produced from the pix is owned by the pixac.
- * The input pix is not affected.
- *
- */
-l_ok
-pixacompAddPix(PIXAC *pixac,
- PIX *pix,
- l_int32 comptype)
-{
-l_int32 cmapflag, format;
-PIXC *pixc;
-
- PROCNAME("pixacompAddPix");
-
- if (!pixac)
- return ERROR_INT("pixac not defined", procName, 1);
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
- if (comptype != IFF_DEFAULT && comptype != IFF_TIFF_G4 &&
- comptype != IFF_PNG && comptype != IFF_JFIF_JPEG)
- return ERROR_INT("invalid format", procName, 1);
-
- cmapflag = pixGetColormap(pix) ? 1 : 0;
- pixcompDetermineFormat(comptype, pixGetDepth(pix), cmapflag, &format);
- if ((pixc = pixcompCreateFromPix(pix, format)) == NULL)
- return ERROR_INT("pixc not made", procName, 1);
- pixacompAddPixcomp(pixac, pixc, L_INSERT);
- return 0;
-}
-
-
-/*!
- * \brief pixacompAddPixcomp()
- *
- * \param[in] pixac
- * \param[in] pixc to be added by insertion
- * \param[in] copyflag L_INSERT, L_COPY
- * \return 0 if OK; 1 on error
- *
- *
- * Notes:
- * (1) Anything added to a pixac is owned by the pixac.
- * So do not L_INSERT a pixc that is owned by another pixac,
- * or destroy a pixc that has been L_INSERTed.
- *
- */
-l_ok
-pixacompAddPixcomp(PIXAC *pixac,
- PIXC *pixc,
- l_int32 copyflag)
-{
-l_int32 n;
-
- PROCNAME("pixacompAddPixcomp");
-
- if (!pixac)
- return ERROR_INT("pixac not defined", procName, 1);
- if (!pixc)
- return ERROR_INT("pixc not defined", procName, 1);
- if (copyflag != L_INSERT && copyflag != L_COPY)
- return ERROR_INT("invalid copyflag", procName, 1);
-
- n = pixac->n;
- if (n >= pixac->nalloc)
- pixacompExtendArray(pixac);
- if (copyflag == L_INSERT)
- pixac->pixc[n] = pixc;
- else /* L_COPY */
- pixac->pixc[n] = pixcompCopy(pixc);
- pixac->n++;
-
- return 0;
-}
-
-
-/*!
- * \brief pixacompExtendArray()
- *
- * \param[in] pixac
- * \return 0 if OK; 1 on error
- *
- *
- * Notes:
- * (1) We extend the boxa array simultaneously. This is
- * necessary in case we are NOT adding boxes simultaneously
- * with adding pixc. We always want the sizes of the
- * pixac and boxa ptr arrays to be equal.
- *
- */
-static l_int32
-pixacompExtendArray(PIXAC *pixac)
-{
- PROCNAME("pixacompExtendArray");
-
- if (!pixac)
- return ERROR_INT("pixac not defined", procName, 1);
-
- if ((pixac->pixc = (PIXC **)reallocNew((void **)&pixac->pixc,
- sizeof(PIXC *) * pixac->nalloc,
- 2 * sizeof(PIXC *) * pixac->nalloc)) == NULL)
- return ERROR_INT("new ptr array not returned", procName, 1);
- pixac->nalloc = 2 * pixac->nalloc;
- boxaExtendArray(pixac->boxa);
- return 0;
-}
-
-
-/*!
- * \brief pixacompReplacePix()
- *
- * \param[in] pixac
- * \param[in] index caller's view of index within pixac; includes offset
- * \param[in] pix owned by the caller
- * \param[in] comptype IFF_DEFAULT, IFF_TIFF_G4, IFF_PNG, IFF_JFIF_JPEG
- * \return 0 if OK; 1 on error
- *
- *
- * Notes:
- * (1) The %index includes the offset, which must be subtracted
- * to get the actual index into the ptr array.
- * (2) The input %pix is converted to a pixc, which is then inserted
- * into the pixac.
- *
- */
-l_ok
-pixacompReplacePix(PIXAC *pixac,
- l_int32 index,
- PIX *pix,
- l_int32 comptype)
-{
-l_int32 n, aindex;
-PIXC *pixc;
-
- PROCNAME("pixacompReplacePix");
-
- if (!pixac)
- return ERROR_INT("pixac not defined", procName, 1);
- n = pixacompGetCount(pixac);
- aindex = index - pixac->offset;
- if (aindex < 0 || aindex >= n)
- return ERROR_INT("array index out of bounds", procName, 1);
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
- if (comptype != IFF_DEFAULT && comptype != IFF_TIFF_G4 &&
- comptype != IFF_PNG && comptype != IFF_JFIF_JPEG)
- return ERROR_INT("invalid format", procName, 1);
-
- pixc = pixcompCreateFromPix(pix, comptype);
- pixacompReplacePixcomp(pixac, index, pixc);
- return 0;
-}
-
-
-/*!
- * \brief pixacompReplacePixcomp()
- *
- * \param[in] pixac
- * \param[in] index caller's view of index within pixac; includes offset
- * \param[in] pixc to replace existing one, which is destroyed
- * \return 0 if OK; 1 on error
- *
- *
- * Notes:
- * (1) The %index includes the offset, which must be subtracted
- * to get the actual index into the ptr array.
- * (2) The inserted %pixc is now owned by the pixac. The caller
- * must not destroy it.
- *
- */
-l_ok
-pixacompReplacePixcomp(PIXAC *pixac,
- l_int32 index,
- PIXC *pixc)
-{
-l_int32 n, aindex;
-PIXC *pixct;
-
- PROCNAME("pixacompReplacePixcomp");
-
- if (!pixac)
- return ERROR_INT("pixac not defined", procName, 1);
- n = pixacompGetCount(pixac);
- aindex = index - pixac->offset;
- if (aindex < 0 || aindex >= n)
- return ERROR_INT("array index out of bounds", procName, 1);
- if (!pixc)
- return ERROR_INT("pixc not defined", procName, 1);
-
- pixct = pixacompGetPixcomp(pixac, index, L_NOCOPY); /* use %index */
- pixcompDestroy(&pixct);
- pixac->pixc[aindex] = pixc; /* replace; use array index */
-
- return 0;
-}
-
-
-/*!
- * \brief pixacompAddBox()
- *
- * \param[in] pixac
- * \param[in] box
- * \param[in] copyflag L_INSERT, L_COPY
- * \return 0 if OK, 1 on error
- */
-l_ok
-pixacompAddBox(PIXAC *pixac,
- BOX *box,
- l_int32 copyflag)
-{
- PROCNAME("pixacompAddBox");
-
- if (!pixac)
- return ERROR_INT("pixac not defined", procName, 1);
- if (!box)
- return ERROR_INT("box not defined", procName, 1);
- if (copyflag != L_INSERT && copyflag != L_COPY)
- return ERROR_INT("invalid copyflag", procName, 1);
-
- boxaAddBox(pixac->boxa, box, copyflag);
- return 0;
-}
-
-
-/*---------------------------------------------------------------------*
- * Pixacomp accessors *
- *---------------------------------------------------------------------*/
-/*!
- * \brief pixacompGetCount()
- *
- * \param[in] pixac
- * \return count, or 0 if no pixa
- */
-l_int32
-pixacompGetCount(PIXAC *pixac)
-{
- PROCNAME("pixacompGetCount");
-
- if (!pixac)
- return ERROR_INT("pixac not defined", procName, 0);
-
- return pixac->n;
-}
-
-
-/*!
- * \brief pixacompGetPixcomp()
- *
- * \param[in] pixac
- * \param[in] index caller's view of index within pixac; includes offset
- * \param[in] copyflag L_NOCOPY, L_COPY
- * \return pixc, or NULL on error
- *
- *
- * Notes:
- * (1) The %index includes the offset, which must be subtracted
- * to get the actual index into the ptr array.
- * (2) If copyflag == L_NOCOPY, the pixc is owned by %pixac; do
- * not destroy.
- *
- */
-PIXC *
-pixacompGetPixcomp(PIXAC *pixac,
- l_int32 index,
- l_int32 copyflag)
-{
-l_int32 aindex;
-
- PROCNAME("pixacompGetPixcomp");
-
- if (!pixac)
- return (PIXC *)ERROR_PTR("pixac not defined", procName, NULL);
- if (copyflag != L_NOCOPY && copyflag != L_COPY)
- return (PIXC *)ERROR_PTR("invalid copyflag", procName, NULL);
- aindex = index - pixac->offset;
- if (aindex < 0 || aindex >= pixac->n)
- return (PIXC *)ERROR_PTR("array index not valid", procName, NULL);
-
- if (copyflag == L_NOCOPY)
- return pixac->pixc[aindex];
- else /* L_COPY */
- return pixcompCopy(pixac->pixc[aindex]);
-}
-
-
-/*!
- * \brief pixacompGetPix()
- *
- * \param[in] pixac
- * \param[in] index caller's view of index within pixac; includes offset
- * \return pix, or NULL on error
- *
- *
- * Notes:
- * (1) The %index includes the offset, which must be subtracted
- * to get the actual index into the ptr array.
- *
- */
-PIX *
-pixacompGetPix(PIXAC *pixac,
- l_int32 index)
-{
-l_int32 aindex;
-PIXC *pixc;
-
- PROCNAME("pixacompGetPix");
-
- if (!pixac)
- return (PIX *)ERROR_PTR("pixac not defined", procName, NULL);
- aindex = index - pixac->offset;
- if (aindex < 0 || aindex >= pixac->n)
- return (PIX *)ERROR_PTR("array index not valid", procName, NULL);
-
- pixc = pixacompGetPixcomp(pixac, index, L_NOCOPY);
- return pixCreateFromPixcomp(pixc);
-}
-
-
-/*!
- * \brief pixacompGetPixDimensions()
- *
- * \param[in] pixac
- * \param[in] index caller's view of index within pixac;
- * includes offset
- * \param[out] pw, ph, pd [optional] each can be null
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) The %index includes the offset, which must be subtracted
- * to get the actual index into the ptr array.
- *
- */
-l_ok
-pixacompGetPixDimensions(PIXAC *pixac,
- l_int32 index,
- l_int32 *pw,
- l_int32 *ph,
- l_int32 *pd)
-{
-l_int32 aindex;
-PIXC *pixc;
-
- PROCNAME("pixacompGetPixDimensions");
-
- if (!pixac)
- return ERROR_INT("pixac not defined", procName, 1);
- aindex = index - pixac->offset;
- if (aindex < 0 || aindex >= pixac->n)
- return ERROR_INT("array index not valid", procName, 1);
-
- if ((pixc = pixac->pixc[aindex]) == NULL)
- return ERROR_INT("pixc not found!", procName, 1);
- pixcompGetDimensions(pixc, pw, ph, pd);
- return 0;
-}
-
-
-/*!
- * \brief pixacompGetBoxa()
- *
- * \param[in] pixac
- * \param[in] accesstype L_COPY, L_CLONE, L_COPY_CLONE
- * \return boxa, or NULL on error
- */
-BOXA *
-pixacompGetBoxa(PIXAC *pixac,
- l_int32 accesstype)
-{
- PROCNAME("pixacompGetBoxa");
-
- if (!pixac)
- return (BOXA *)ERROR_PTR("pixac not defined", procName, NULL);
- if (!pixac->boxa)
- return (BOXA *)ERROR_PTR("boxa not defined", procName, NULL);
- if (accesstype != L_COPY && accesstype != L_CLONE &&
- accesstype != L_COPY_CLONE)
- return (BOXA *)ERROR_PTR("invalid accesstype", procName, NULL);
-
- return boxaCopy(pixac->boxa, accesstype);
-}
-
-
-/*!
- * \brief pixacompGetBoxaCount()
- *
- * \param[in] pixac
- * \return count, or 0 on error
- */
-l_int32
-pixacompGetBoxaCount(PIXAC *pixac)
-{
- PROCNAME("pixacompGetBoxaCount");
-
- if (!pixac)
- return ERROR_INT("pixac not defined", procName, 0);
-
- return boxaGetCount(pixac->boxa);
-}
-
-
-/*!
- * \brief pixacompGetBox()
- *
- * \param[in] pixac
- * \param[in] index caller's view of index within pixac;
- * includes offset
- * \param[in] accesstype L_COPY or L_CLONE
- * \return box if null, not automatically an error, or NULL on error
- *
- *
- * Notes:
- * (1) The %index includes the offset, which must be subtracted
- * to get the actual index into the ptr array.
- * (2) There is always a boxa with a pixac, and it is initialized so
- * that each box ptr is NULL.
- * (3) In general, we expect that there is either a box associated
- * with each pixc, or no boxes at all in the boxa.
- * (4) Having no boxes is thus not an automatic error. Whether it
- * is an actual error is determined by the calling program.
- * If the caller expects to get a box, it is an error; see, e.g.,
- * pixacGetBoxGeometry().
- *
- */
-BOX *
-pixacompGetBox(PIXAC *pixac,
- l_int32 index,
- l_int32 accesstype)
-{
-l_int32 aindex;
-BOX *box;
-
- PROCNAME("pixacompGetBox");
-
- if (!pixac)
- return (BOX *)ERROR_PTR("pixac not defined", procName, NULL);
- if (!pixac->boxa)
- return (BOX *)ERROR_PTR("boxa not defined", procName, NULL);
- aindex = index - pixac->offset;
- if (aindex < 0 || aindex >= pixac->boxa->n)
- return (BOX *)ERROR_PTR("array index not valid", procName, NULL);
- if (accesstype != L_COPY && accesstype != L_CLONE)
- return (BOX *)ERROR_PTR("invalid accesstype", procName, NULL);
-
- box = pixac->boxa->box[aindex];
- if (box) {
- if (accesstype == L_COPY)
- return boxCopy(box);
- else /* accesstype == L_CLONE */
- return boxClone(box);
- } else {
- return NULL;
- }
-}
-
-
-/*!
- * \brief pixacompGetBoxGeometry()
- *
- * \param[in] pixac
- * \param[in] index caller's view of index within pixac;
- * includes offset
- * \param[out] px, py, pw, ph [optional] each can be null
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) The %index includes the offset, which must be subtracted
- * to get the actual index into the ptr array.
- *
- */
-l_ok
-pixacompGetBoxGeometry(PIXAC *pixac,
- l_int32 index,
- l_int32 *px,
- l_int32 *py,
- l_int32 *pw,
- l_int32 *ph)
-{
-l_int32 aindex;
-BOX *box;
-
- PROCNAME("pixacompGetBoxGeometry");
-
- if (!pixac)
- return ERROR_INT("pixac not defined", procName, 1);
- aindex = index - pixac->offset;
- if (aindex < 0 || aindex >= pixac->n)
- return ERROR_INT("array index not valid", procName, 1);
-
- if ((box = pixacompGetBox(pixac, aindex, L_CLONE)) == NULL)
- return ERROR_INT("box not found!", procName, 1);
- boxGetGeometry(box, px, py, pw, ph);
- boxDestroy(&box);
- return 0;
-}
-
-
-/*!
- * \brief pixacompGetOffset()
- *
- * \param[in] pixac
- * \return offset, or 0 on error
- *
- *
- * Notes:
- * (1) The offset is the difference between the caller's view of
- * the index into the array and the actual array index.
- * By default it is 0.
- *
- */
-l_int32
-pixacompGetOffset(PIXAC *pixac)
-{
- PROCNAME("pixacompGetOffset");
-
- if (!pixac)
- return ERROR_INT("pixac not defined", procName, 0);
- return pixac->offset;
-}
-
-
-/*!
- * \brief pixacompSetOffset()
- *
- * \param[in] pixac
- * \param[in] offset non-negative
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) The offset is the difference between the caller's view of
- * the index into the array and the actual array index.
- * By default it is 0.
- *
- */
-l_ok
-pixacompSetOffset(PIXAC *pixac,
- l_int32 offset)
-{
- PROCNAME("pixacompSetOffset");
-
- if (!pixac)
- return ERROR_INT("pixac not defined", procName, 1);
- pixac->offset = L_MAX(0, offset);
- return 0;
-}
-
-
-/*---------------------------------------------------------------------*
- * Pixacomp conversion to Pixa *
- *---------------------------------------------------------------------*/
-/*!
- * \brief pixaCreateFromPixacomp()
- *
- * \param[in] pixac
- * \param[in] accesstype L_COPY, L_CLONE, L_COPY_CLONE; for boxa
- * \return pixa if OK, or NULL on error
- *
- *
- * Notes:
- * (1) Because the pixa has no notion of offset, the offset must
- * be set to 0 before the conversion, so that pixacompGetPix()
- * fetches all the pixcomps. It is reset at the end.
- *
- */
-PIXA *
-pixaCreateFromPixacomp(PIXAC *pixac,
- l_int32 accesstype)
-{
-l_int32 i, n, offset;
-PIX *pix;
-PIXA *pixa;
-
- PROCNAME("pixaCreateFromPixacomp");
-
- if (!pixac)
- return (PIXA *)ERROR_PTR("pixac not defined", procName, NULL);
- if (accesstype != L_COPY && accesstype != L_CLONE &&
- accesstype != L_COPY_CLONE)
- return (PIXA *)ERROR_PTR("invalid accesstype", procName, NULL);
-
- n = pixacompGetCount(pixac);
- offset = pixacompGetOffset(pixac);
- pixacompSetOffset(pixac, 0);
- if ((pixa = pixaCreate(n)) == NULL)
- return (PIXA *)ERROR_PTR("pixa not made", procName, NULL);
- for (i = 0; i < n; i++) {
- if ((pix = pixacompGetPix(pixac, i)) == NULL) {
- L_WARNING("pix %d not made\n", procName, i);
- continue;
- }
- pixaAddPix(pixa, pix, L_INSERT);
- }
- if (pixa->boxa) {
- boxaDestroy(&pixa->boxa);
- pixa->boxa = pixacompGetBoxa(pixac, accesstype);
- }
- pixacompSetOffset(pixac, offset);
-
- return pixa;
-}
-
-
-/*---------------------------------------------------------------------*
- * Combining pixacomp
- *---------------------------------------------------------------------*/
-/*!
- * \brief pixacompJoin()
- *
- * \param[in] pixacd dest pixac; add to this one
- * \param[in] pixacs [optional] source pixac; add from this one
- * \param[in] istart starting index in pixacs
- * \param[in] iend ending index in pixacs; use -1 to cat all
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This appends a clone of each indicated pixc in pixcas to pixcad
- * (2) istart < 0 is taken to mean 'read from the start' (istart = 0)
- * (3) iend < 0 means 'read to the end'
- * (4) If pixacs is NULL or contains no pixc, this is a no-op.
- *
- */
-l_ok
-pixacompJoin(PIXAC *pixacd,
- PIXAC *pixacs,
- l_int32 istart,
- l_int32 iend)
-{
-l_int32 i, n, nb;
-BOXA *boxas, *boxad;
-PIXC *pixc;
-
- PROCNAME("pixacompJoin");
-
- if (!pixacd)
- return ERROR_INT("pixacd not defined", procName, 1);
- if (!pixacs || ((n = pixacompGetCount(pixacs)) == 0))
- return 0;
-
- if (istart < 0)
- istart = 0;
- if (iend < 0 || iend >= n)
- iend = n - 1;
- if (istart > iend)
- return ERROR_INT("istart > iend; nothing to add", procName, 1);
-
- for (i = istart; i <= iend; i++) {
- pixc = pixacompGetPixcomp(pixacs, i, L_NOCOPY);
- pixacompAddPixcomp(pixacd, pixc, L_COPY);
- }
-
- boxas = pixacompGetBoxa(pixacs, L_CLONE);
- boxad = pixacompGetBoxa(pixacd, L_CLONE);
- nb = pixacompGetBoxaCount(pixacs);
- iend = L_MIN(iend, nb - 1);
- boxaJoin(boxad, boxas, istart, iend);
- boxaDestroy(&boxas); /* just the clones */
- boxaDestroy(&boxad); /* ditto */
- return 0;
-}
-
-
-/*!
- * \brief pixacompInterleave()
- *
- * \param[in] pixac1 first src pixac
- * \param[in] pixac2 second src pixac
- * \return pixacd interleaved from sources, or NULL on error.
- *
- *
- * Notes:
- * (1) If the two pixac have different sizes, a warning is issued,
- * and the number of pairs returned is the minimum size.
- *
- */
-PIXAC *
-pixacompInterleave(PIXAC *pixac1,
- PIXAC *pixac2)
-{
-l_int32 i, n1, n2, n, nb1, nb2;
-BOX *box;
-PIXC *pixc1, *pixc2;
-PIXAC *pixacd;
-
- PROCNAME("pixacompInterleave");
-
- if (!pixac1)
- return (PIXAC *)ERROR_PTR("pixac1 not defined", procName, NULL);
- if (!pixac2)
- return (PIXAC *)ERROR_PTR("pixac2 not defined", procName, NULL);
- n1 = pixacompGetCount(pixac1);
- n2 = pixacompGetCount(pixac2);
- n = L_MIN(n1, n2);
- if (n == 0)
- return (PIXAC *)ERROR_PTR("at least one input pixac is empty",
- procName, NULL);
- if (n1 != n2)
- L_WARNING("counts differ: %d != %d\n", procName, n1, n2);
-
- pixacd = pixacompCreate(2 * n);
- nb1 = pixacompGetBoxaCount(pixac1);
- nb2 = pixacompGetBoxaCount(pixac2);
- for (i = 0; i < n; i++) {
- pixc1 = pixacompGetPixcomp(pixac1, i, L_COPY);
- pixacompAddPixcomp(pixacd, pixc1, L_INSERT);
- if (i < nb1) {
- box = pixacompGetBox(pixac1, i, L_COPY);
- pixacompAddBox(pixacd, box, L_INSERT);
- }
- pixc2 = pixacompGetPixcomp(pixac2, i, L_COPY);
- pixacompAddPixcomp(pixacd, pixc2, L_INSERT);
- if (i < nb2) {
- box = pixacompGetBox(pixac2, i, L_COPY);
- pixacompAddBox(pixacd, box, L_INSERT);
- }
- }
-
- return pixacd;
-}
-
-
-/*---------------------------------------------------------------------*
- * Pixacomp serialized I/O *
- *---------------------------------------------------------------------*/
-/*!
- * \brief pixacompRead()
- *
- * \param[in] filename
- * \return pixac, or NULL on error
- *
- *
- * Notes:
- * (1) Unlike the situation with serialized Pixa, where the image
- * data is stored in png format, the Pixacomp image data
- * can be stored in tiffg4, png and jpg formats.
- *
- */
-PIXAC *
-pixacompRead(const char *filename)
-{
-FILE *fp;
-PIXAC *pixac;
-
- PROCNAME("pixacompRead");
-
- if (!filename)
- return (PIXAC *)ERROR_PTR("filename not defined", procName, NULL);
-
- if ((fp = fopenReadStream(filename)) == NULL)
- return (PIXAC *)ERROR_PTR("stream not opened", procName, NULL);
- pixac = pixacompReadStream(fp);
- fclose(fp);
- if (!pixac)
- return (PIXAC *)ERROR_PTR("pixac not read", procName, NULL);
- return pixac;
-}
-
-
-/*!
- * \brief pixacompReadStream()
- *
- * \param[in] fp file stream
- * \return pixac, or NULL on error
- */
-PIXAC *
-pixacompReadStream(FILE *fp)
-{
-char buf[256];
-l_uint8 *data;
-l_int32 n, offset, i, w, h, d, ignore;
-l_int32 comptype, cmapflag, version, xres, yres;
-size_t size;
-BOXA *boxa;
-PIXC *pixc;
-PIXAC *pixac;
-
- PROCNAME("pixacompReadStream");
-
- if (!fp)
- return (PIXAC *)ERROR_PTR("stream not defined", procName, NULL);
-
- if (fscanf(fp, "\nPixacomp Version %d\n", &version) != 1)
- return (PIXAC *)ERROR_PTR("not a pixacomp file", procName, NULL);
- if (version != PIXACOMP_VERSION_NUMBER)
- return (PIXAC *)ERROR_PTR("invalid pixacomp version", procName, NULL);
- if (fscanf(fp, "Number of pixcomp = %d\n", &n) != 1)
- return (PIXAC *)ERROR_PTR("not a pixacomp file", procName, NULL);
- if (fscanf(fp, "Offset of index into array = %d", &offset) != 1)
- return (PIXAC *)ERROR_PTR("offset not read", procName, NULL);
-
- if ((pixac = pixacompCreate(n)) == NULL)
- return (PIXAC *)ERROR_PTR("pixac not made", procName, NULL);
- if ((boxa = boxaReadStream(fp)) == NULL) {
- pixacompDestroy(&pixac);
- return (PIXAC *)ERROR_PTR("boxa not made", procName, NULL);
- }
- boxaDestroy(&pixac->boxa); /* empty */
- pixac->boxa = boxa;
- pixacompSetOffset(pixac, offset);
-
- for (i = 0; i < n; i++) {
- if (fscanf(fp, "\nPixcomp[%d]: w = %d, h = %d, d = %d\n",
- &ignore, &w, &h, &d) != 4) {
- pixacompDestroy(&pixac);
- return (PIXAC *)ERROR_PTR("dimension reading", procName, NULL);
- }
- if (fscanf(fp, " comptype = %d, size = %zu, cmapflag = %d\n",
- &comptype, &size, &cmapflag) != 3) {
- pixacompDestroy(&pixac);
- return (PIXAC *)ERROR_PTR("comptype/size reading", procName, NULL);
- }
- if (size > MaxDataSize) {
- pixacompDestroy(&pixac);
- L_ERROR("data size = %zu is too big", procName, size);
- return NULL;
- }
-
- /* Use fgets() and sscanf(); not fscanf(), for the last
- * bit of header data before the binary data. The reason is
- * that fscanf throws away white space, and if the binary data
- * happens to begin with ascii character(s) that are white
- * space, it will swallow them and all will be lost! */
- if (fgets(buf, sizeof(buf), fp) == NULL) {
- pixacompDestroy(&pixac);
- return (PIXAC *)ERROR_PTR("fgets read fail", procName, NULL);
- }
- if (sscanf(buf, " xres = %d, yres = %d\n", &xres, &yres) != 2) {
- pixacompDestroy(&pixac);
- return (PIXAC *)ERROR_PTR("read fail for res", procName, NULL);
- }
- if ((data = (l_uint8 *)LEPT_CALLOC(1, size)) == NULL) {
- pixacompDestroy(&pixac);
- return (PIXAC *)ERROR_PTR("calloc fail for data", procName, NULL);
- }
- if (fread(data, 1, size, fp) != size) {
- pixacompDestroy(&pixac);
- LEPT_FREE(data);
- return (PIXAC *)ERROR_PTR("error reading data", procName, NULL);
- }
- fgetc(fp); /* swallow the ending nl */
- pixc = (PIXC *)LEPT_CALLOC(1, sizeof(PIXC));
- pixc->w = w;
- pixc->h = h;
- pixc->d = d;
- pixc->xres = xres;
- pixc->yres = yres;
- pixc->comptype = comptype;
- pixc->cmapflag = cmapflag;
- pixc->data = data;
- pixc->size = size;
- pixacompAddPixcomp(pixac, pixc, L_INSERT);
- }
- return pixac;
-}
-
-
-/*!
- * \brief pixacompReadMem()
- *
- * \param[in] data in pixacomp format
- * \param[in] size of data
- * \return pixac, or NULL on error
- *
- *
- * Notes:
- * (1) Deseralizes a buffer of pixacomp data into a pixac in memory.
- *
- */
-PIXAC *
-pixacompReadMem(const l_uint8 *data,
- size_t size)
-{
-FILE *fp;
-PIXAC *pixac;
-
- PROCNAME("pixacompReadMem");
-
- if (!data)
- return (PIXAC *)ERROR_PTR("data not defined", procName, NULL);
- if ((fp = fopenReadFromMemory(data, size)) == NULL)
- return (PIXAC *)ERROR_PTR("stream not opened", procName, NULL);
-
- pixac = pixacompReadStream(fp);
- fclose(fp);
- if (!pixac) L_ERROR("pixac not read\n", procName);
- return pixac;
-}
-
-
-/*!
- * \brief pixacompWrite()
- *
- * \param[in] filename
- * \param[in] pixac
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) Unlike the situation with serialized Pixa, where the image
- * data is stored in png format, the Pixacomp image data
- * can be stored in tiffg4, png and jpg formats.
- *
- */
-l_ok
-pixacompWrite(const char *filename,
- PIXAC *pixac)
-{
-l_int32 ret;
-FILE *fp;
-
- PROCNAME("pixacompWrite");
-
- if (!filename)
- return ERROR_INT("filename not defined", procName, 1);
- if (!pixac)
- return ERROR_INT("pixacomp not defined", procName, 1);
-
- if ((fp = fopenWriteStream(filename, "wb")) == NULL)
- return ERROR_INT("stream not opened", procName, 1);
- ret = pixacompWriteStream(fp, pixac);
- fclose(fp);
- if (ret)
- return ERROR_INT("pixacomp not written to stream", procName, 1);
- return 0;
-}
-
-
-/*!
- * \brief pixacompWriteStream()
- *
- * \param[in] fp file stream
- * \param[in] pixac
- * \return 0 if OK, 1 on error
- */
-l_ok
-pixacompWriteStream(FILE *fp,
- PIXAC *pixac)
-{
-l_int32 n, i;
-PIXC *pixc;
-
- PROCNAME("pixacompWriteStream");
-
- if (!fp)
- return ERROR_INT("stream not defined", procName, 1);
- if (!pixac)
- return ERROR_INT("pixac not defined", procName, 1);
-
- n = pixacompGetCount(pixac);
- fprintf(fp, "\nPixacomp Version %d\n", PIXACOMP_VERSION_NUMBER);
- fprintf(fp, "Number of pixcomp = %d\n", n);
- fprintf(fp, "Offset of index into array = %d", pixac->offset);
- boxaWriteStream(fp, pixac->boxa);
- for (i = 0; i < n; i++) {
- if ((pixc = pixacompGetPixcomp(pixac, pixac->offset + i, L_NOCOPY))
- == NULL)
- return ERROR_INT("pixc not found", procName, 1);
- fprintf(fp, "\nPixcomp[%d]: w = %d, h = %d, d = %d\n",
- i, pixc->w, pixc->h, pixc->d);
- fprintf(fp, " comptype = %d, size = %zu, cmapflag = %d\n",
- pixc->comptype, pixc->size, pixc->cmapflag);
- fprintf(fp, " xres = %d, yres = %d\n", pixc->xres, pixc->yres);
- fwrite(pixc->data, 1, pixc->size, fp);
- fprintf(fp, "\n");
- }
- return 0;
-}
-
-
-/*!
- * \brief pixacompWriteMem()
- *
- * \param[out] pdata serialized data of pixac
- * \param[out] psize size of serialized data
- * \param[in] pixac
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) Serializes a pixac in memory and puts the result in a buffer.
- *
- */
-l_ok
-pixacompWriteMem(l_uint8 **pdata,
- size_t *psize,
- PIXAC *pixac)
-{
-l_int32 ret;
-FILE *fp;
-
- PROCNAME("pixacompWriteMem");
-
- if (pdata) *pdata = NULL;
- if (psize) *psize = 0;
- if (!pdata)
- return ERROR_INT("&data not defined", procName, 1);
- if (!psize)
- return ERROR_INT("&size not defined", procName, 1);
- if (!pixac)
- return ERROR_INT("&pixac not defined", procName, 1);
-
-#if HAVE_FMEMOPEN
- if ((fp = open_memstream((char **)pdata, psize)) == NULL)
- return ERROR_INT("stream not opened", procName, 1);
- ret = pixacompWriteStream(fp, pixac);
-#else
- L_INFO("work-around: writing to a temp file\n", procName);
- #ifdef _WIN32
- if ((fp = fopenWriteWinTempfile()) == NULL)
- return ERROR_INT("tmpfile stream not opened", procName, 1);
- #else
- if ((fp = tmpfile()) == NULL)
- return ERROR_INT("tmpfile stream not opened", procName, 1);
- #endif /* _WIN32 */
- ret = pixacompWriteStream(fp, pixac);
- rewind(fp);
- *pdata = l_binaryReadStream(fp, psize);
-#endif /* HAVE_FMEMOPEN */
- fclose(fp);
- return ret;
-}
-
-
-/*--------------------------------------------------------------------*
- * Conversion to pdf *
- *--------------------------------------------------------------------*/
-/*!
- * \brief pixacompConvertToPdf()
- *
- * \param[in] pixac containing images all at the same resolution
- * \param[in] res override the resolution of each input image,
- * in ppi; 0 to respect the resolution embedded
- * in the input
- * \param[in] scalefactor scaling factor applied to each image; > 0.0
- * \param[in] type encoding type (L_JPEG_ENCODE, L_G4_ENCODE,
- * L_FLATE_ENCODE, L_JP2K_ENCODE, or
- * L_DEFAULT_ENCODE for default)
- * \param[in] quality used for JPEG only; 0 for default (75)
- * \param[in] title [optional] pdf title
- * \param[in] fileout pdf file of all images
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This follows closely the function pixaConvertToPdf() in pdfio.c.
- * (2) The images are encoded with G4 if 1 bpp; JPEG if 8 bpp without
- * colormap and many colors, or 32 bpp; FLATE for anything else.
- * (3) The scalefactor must be > 0.0; otherwise it is set to 1.0.
- * (4) Specifying one of the three encoding types for %type forces
- * all images to be compressed with that type. Use 0 to have
- * the type determined for each image based on depth and whether
- * or not it has a colormap.
- * (5) If all images are jpeg compressed, don't require scaling
- * and have the same resolution, it is much faster to skip
- * transcoding with pixacompFastConvertToPdfData(), and then
- * write the data out to file.
- *
- */
-l_ok
-pixacompConvertToPdf(PIXAC *pixac,
- l_int32 res,
- l_float32 scalefactor,
- l_int32 type,
- l_int32 quality,
- const char *title,
- const char *fileout)
-{
-l_uint8 *data;
-l_int32 ret;
-size_t nbytes;
-
- PROCNAME("pixacompConvertToPdf");
-
- if (!pixac)
- return ERROR_INT("pixac not defined", procName, 1);
-
- ret = pixacompConvertToPdfData(pixac, res, scalefactor, type, quality,
- title, &data, &nbytes);
- if (ret) {
- LEPT_FREE(data);
- return ERROR_INT("conversion to pdf failed", procName, 1);
- }
-
- ret = l_binaryWrite(fileout, "w", data, nbytes);
- LEPT_FREE(data);
- if (ret)
- L_ERROR("pdf data not written to file\n", procName);
- return ret;
-}
-
-
-/*!
- * \brief pixacompConvertToPdfData()
- *
- * \param[in] pixac containing images all at the same resolution
- * \param[in] res input resolution of all images
- * \param[in] scalefactor scaling factor applied to each image; > 0.0
- * \param[in] type encoding type (L_JPEG_ENCODE, L_G4_ENCODE,
- * L_FLATE_ENCODE, L_JP2K_ENCODE, or
- * L_DEFAULT_ENCODE for default)
- * \param[in] quality used for JPEG only; 0 for default (75)
- * \param[in] title [optional] pdf title
- * \param[out] pdata output pdf data (of all images
- * \param[out] pnbytes size of output pdf data
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) See pixacompConvertToPdf().
- *
- */
-l_ok
-pixacompConvertToPdfData(PIXAC *pixac,
- l_int32 res,
- l_float32 scalefactor,
- l_int32 type,
- l_int32 quality,
- const char *title,
- l_uint8 **pdata,
- size_t *pnbytes)
-{
-l_uint8 *imdata;
-l_int32 i, n, ret, scaledres, pagetype;
-size_t imbytes;
-L_BYTEA *ba;
-PIX *pixs, *pix;
-L_PTRA *pa_data;
-
- PROCNAME("pixacompConvertToPdfData");
-
- if (!pdata)
- return ERROR_INT("&data not defined", procName, 1);
- *pdata = NULL;
- if (!pnbytes)
- return ERROR_INT("&nbytes not defined", procName, 1);
- *pnbytes = 0;
- if (!pixac)
- return ERROR_INT("pixac not defined", procName, 1);
- if (scalefactor <= 0.0) scalefactor = 1.0;
- if (type != L_DEFAULT_ENCODE && type != L_JPEG_ENCODE &&
- type != L_G4_ENCODE && type != L_FLATE_ENCODE &&
- type != L_JP2K_ENCODE) {
- L_WARNING("invalid compression type; using per-page default\n",
- procName);
- type = L_DEFAULT_ENCODE;
- }
-
- /* Generate all the encoded pdf strings */
- n = pixacompGetCount(pixac);
- pa_data = ptraCreate(n);
- for (i = 0; i < n; i++) {
- if ((pixs =
- pixacompGetPix(pixac, pixacompGetOffset(pixac) + i)) == NULL) {
- L_ERROR("pix[%d] not retrieved\n", procName, i);
- continue;
- }
- if (pixGetWidth(pixs) == 1) { /* used sometimes as placeholders */
- L_INFO("placeholder image[%d] has w = 1\n", procName, i);
- pixDestroy(&pixs);
- continue;
- }
- if (scalefactor != 1.0)
- pix = pixScale(pixs, scalefactor, scalefactor);
- else
- pix = pixClone(pixs);
- pixDestroy(&pixs);
- scaledres = (l_int32)(res * scalefactor);
-
- /* Select the encoding type */
- if (type != L_DEFAULT_ENCODE) {
- pagetype = type;
- } else if (selectDefaultPdfEncoding(pix, &pagetype) != 0) {
- L_ERROR("encoding type selection failed for pix[%d]\n",
- procName, i);
- pixDestroy(&pix);
- continue;
- }
-
- ret = pixConvertToPdfData(pix, pagetype, quality, &imdata, &imbytes,
- 0, 0, scaledres, title, NULL, 0);
- pixDestroy(&pix);
- if (ret) {
- L_ERROR("pdf encoding failed for pix[%d]\n", procName, i);
- continue;
- }
- ba = l_byteaInitFromMem(imdata, imbytes);
- LEPT_FREE(imdata);
- ptraAdd(pa_data, ba);
- }
- ptraGetActualCount(pa_data, &n);
- if (n == 0) {
- L_ERROR("no pdf files made\n", procName);
- ptraDestroy(&pa_data, FALSE, FALSE);
- return 1;
- }
-
- /* Concatenate them */
- ret = ptraConcatenatePdfToData(pa_data, NULL, pdata, pnbytes);
-
- ptraGetActualCount(pa_data, &n); /* recalculate in case it changes */
- for (i = 0; i < n; i++) {
- ba = (L_BYTEA *)ptraRemove(pa_data, i, L_NO_COMPACTION);
- l_byteaDestroy(&ba);
- }
- ptraDestroy(&pa_data, FALSE, FALSE);
- return ret;
-}
-
-
-/*!
- * \brief pixacompFastConvertToPdfData()
- *
- * \param[in] pixac containing images all at the same resolution
- * \param[in] title [optional] pdf title
- * \param[out] pdata output pdf data (of all images
- * \param[out] pnbytes size of output pdf data
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This generates the pdf without transcoding if all the
- * images in %pixac are compressed with jpeg.
- * Images not jpeg compressed are skipped.
- * (2) It assumes all images have the same resolution, and that
- * the resolution embedded in each jpeg file is correct.
- *
- */
-l_ok
-pixacompFastConvertToPdfData(PIXAC *pixac,
- const char *title,
- l_uint8 **pdata,
- size_t *pnbytes)
-{
-l_uint8 *imdata;
-l_int32 i, n, ret, comptype;
-size_t imbytes;
-L_BYTEA *ba;
-PIXC *pixc;
-L_PTRA *pa_data;
-
- PROCNAME("pixacompFastConvertToPdfData");
-
- if (!pdata)
- return ERROR_INT("&data not defined", procName, 1);
- *pdata = NULL;
- if (!pnbytes)
- return ERROR_INT("&nbytes not defined", procName, 1);
- *pnbytes = 0;
- if (!pixac)
- return ERROR_INT("pixac not defined", procName, 1);
-
- /* Generate all the encoded pdf strings */
- n = pixacompGetCount(pixac);
- pa_data = ptraCreate(n);
- for (i = 0; i < n; i++) {
- if ((pixc = pixacompGetPixcomp(pixac, i, L_NOCOPY)) == NULL) {
- L_ERROR("pixc[%d] not retrieved\n", procName, i);
- continue;
- }
- pixcompGetParameters(pixc, NULL, NULL, &comptype, NULL);
- if (comptype != IFF_JFIF_JPEG) {
- L_ERROR("pixc[%d] not jpeg compressed\n", procName, i);
- continue;
- }
- ret = pixcompFastConvertToPdfData(pixc, title, &imdata, &imbytes);
- if (ret) {
- L_ERROR("pdf encoding failed for pixc[%d]\n", procName, i);
- continue;
- }
- ba = l_byteaInitFromMem(imdata, imbytes);
- LEPT_FREE(imdata);
- ptraAdd(pa_data, ba);
- }
- ptraGetActualCount(pa_data, &n);
- if (n == 0) {
- L_ERROR("no pdf files made\n", procName);
- ptraDestroy(&pa_data, FALSE, FALSE);
- return 1;
- }
-
- /* Concatenate them */
- ret = ptraConcatenatePdfToData(pa_data, NULL, pdata, pnbytes);
-
- /* Clean up */
- ptraGetActualCount(pa_data, &n); /* recalculate in case it changes */
- for (i = 0; i < n; i++) {
- ba = (L_BYTEA *)ptraRemove(pa_data, i, L_NO_COMPACTION);
- l_byteaDestroy(&ba);
- }
- ptraDestroy(&pa_data, FALSE, FALSE);
- return ret;
-}
-
-
-/*!
- * \brief pixcompFastConvertToPdfData()
- *
- * \param[in] pixc containing images all at the same resolution
- * \param[in] title [optional] pdf title
- * \param[out] pdata output pdf data (of all images
- * \param[out] pnbytes size of output pdf data
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This generates the pdf without transcoding.
- * (2) It assumes all images are jpeg encoded, have the same
- * resolution, and that the resolution embedded in each
- * jpeg file is correct. (It is transferred to the pdf
- * via the cid.)
- *
- */
-static l_int32
-pixcompFastConvertToPdfData(PIXC *pixc,
- const char *title,
- l_uint8 **pdata,
- size_t *pnbytes)
-{
-l_uint8 *data;
-L_COMP_DATA *cid;
-
- PROCNAME("pixacompFastConvertToPdfData");
-
- if (!pdata)
- return ERROR_INT("&data not defined", procName, 1);
- *pdata = NULL;
- if (!pnbytes)
- return ERROR_INT("&nbytes not defined", procName, 1);
- *pnbytes = 0;
- if (!pixc)
- return ERROR_INT("pixc not defined", procName, 1);
-
- /* Make a copy of the data */
- data = l_binaryCopy(pixc->data, pixc->size);
- cid = l_generateJpegDataMem(data, pixc->size, 0);
-
- /* Note: cid is destroyed, along with data, by this function */
- return cidConvertToPdfData(cid, title, pdata, pnbytes);
-}
-
-
-/*--------------------------------------------------------------------*
- * Output for debugging *
- *--------------------------------------------------------------------*/
-/*!
- * \brief pixacompWriteStreamInfo()
- *
- * \param[in] fp file stream
- * \param[in] pixac
- * \param[in] text [optional] identifying string; can be null
- * \return 0 if OK, 1 on error
- */
-l_ok
-pixacompWriteStreamInfo(FILE *fp,
- PIXAC *pixac,
- const char *text)
-{
-l_int32 i, n, nboxes;
-PIXC *pixc;
-
- PROCNAME("pixacompWriteStreamInfo");
-
- if (!fp)
- return ERROR_INT("fp not defined", procName, 1);
- if (!pixac)
- return ERROR_INT("pixac not defined", procName, 1);
-
- if (text)
- fprintf(fp, "Pixacomp Info for %s:\n", text);
- else
- fprintf(fp, "Pixacomp Info:\n");
- n = pixacompGetCount(pixac);
- nboxes = pixacompGetBoxaCount(pixac);
- fprintf(fp, "Number of pixcomp: %d\n", n);
- fprintf(fp, "Size of pixcomp array alloc: %d\n", pixac->nalloc);
- fprintf(fp, "Offset of index into array: %d\n", pixac->offset);
- if (nboxes > 0)
- fprintf(fp, "Boxa has %d boxes\n", nboxes);
- else
- fprintf(fp, "Boxa is empty\n");
- for (i = 0; i < n; i++) {
- pixc = pixacompGetPixcomp(pixac, pixac->offset + i, L_NOCOPY);
- pixcompWriteStreamInfo(fp, pixc, NULL);
- }
- return 0;
-}
-
-
-/*!
- * \brief pixcompWriteStreamInfo()
- *
- * \param[in] fp file stream
- * \param[in] pixc
- * \param[in] text [optional] identifying string; can be null
- * \return 0 if OK, 1 on error
- */
-l_ok
-pixcompWriteStreamInfo(FILE *fp,
- PIXC *pixc,
- const char *text)
-{
- PROCNAME("pixcompWriteStreamInfo");
-
- if (!fp)
- return ERROR_INT("fp not defined", procName, 1);
- if (!pixc)
- return ERROR_INT("pixc not defined", procName, 1);
-
- if (text)
- fprintf(fp, " Pixcomp Info for %s:", text);
- else
- fprintf(fp, " Pixcomp Info:");
- fprintf(fp, " width = %d, height = %d, depth = %d\n",
- pixc->w, pixc->h, pixc->d);
- fprintf(fp, " xres = %d, yres = %d, size in bytes = %zu\n",
- pixc->xres, pixc->yres, pixc->size);
- if (pixc->cmapflag)
- fprintf(fp, " has colormap\n");
- else
- fprintf(fp, " no colormap\n");
- if (pixc->comptype < NumImageFileFormatExtensions) {
- fprintf(fp, " comptype = %s (%d)\n",
- ImageFileFormatExtensions[pixc->comptype], pixc->comptype);
- } else {
- fprintf(fp, " Error!! Invalid comptype index: %d\n", pixc->comptype);
- }
- return 0;
-}
-
-
-/*!
- * \brief pixacompDisplayTiledAndScaled()
- *
- * \param[in] pixac
- * \param[in] outdepth output depth: 1, 8 or 32 bpp
- * \param[in] tilewidth each pix is scaled to this width
- * \param[in] ncols number of tiles in each row
- * \param[in] background 0 for white, 1 for black; this is the color
- * of the spacing between the images
- * \param[in] spacing between images, and on outside
- * \param[in] border width of additional black border on each image;
- * use 0 for no border
- * \return pix of tiled images, or NULL on error
- *
- *
- * Notes:
- * (1) This is the same function as pixaDisplayTiledAndScaled(),
- * except it works on a Pixacomp instead of a Pix. It is particularly
- * useful for showing the images in a Pixacomp at reduced resolution.
- * (2) See pixaDisplayTiledAndScaled() for details.
- *
- */
-PIX *
-pixacompDisplayTiledAndScaled(PIXAC *pixac,
- l_int32 outdepth,
- l_int32 tilewidth,
- l_int32 ncols,
- l_int32 background,
- l_int32 spacing,
- l_int32 border)
-{
-PIX *pixd;
-PIXA *pixa;
-
- PROCNAME("pixacompDisplayTiledAndScaled");
-
- if (!pixac)
- return (PIX *)ERROR_PTR("pixac not defined", procName, NULL);
-
- if ((pixa = pixaCreateFromPixacomp(pixac, L_COPY)) == NULL)
- return (PIX *)ERROR_PTR("pixa not made", procName, NULL);
-
- pixd = pixaDisplayTiledAndScaled(pixa, outdepth, tilewidth, ncols,
- background, spacing, border);
- pixaDestroy(&pixa);
- return pixd;
-}
-
-
-/*!
- * \brief pixacompWriteFiles()
- *
- * \param[in] pixac
- * \param[in] subdir subdirectory of /tmp
- * \return 0 if OK, 1 on error
- */
-l_ok
-pixacompWriteFiles(PIXAC *pixac,
- const char *subdir)
-{
-char buf[128];
-l_int32 i, n;
-PIXC *pixc;
-
- PROCNAME("pixacompWriteFiles");
-
- if (!pixac)
- return ERROR_INT("pixac not defined", procName, 1);
-
- if (lept_mkdir(subdir) > 0)
- return ERROR_INT("invalid subdir", procName, 1);
-
- n = pixacompGetCount(pixac);
- for (i = 0; i < n; i++) {
- pixc = pixacompGetPixcomp(pixac, i, L_NOCOPY);
- snprintf(buf, sizeof(buf), "/tmp/%s/%03d", subdir, i);
- pixcompWriteFile(buf, pixc);
- }
- return 0;
-}
-
-extern const char *ImageFileFormatExtensions[];
-
-/*!
- * \brief pixcompWriteFile()
- *
- * \param[in] rootname
- * \param[in] pixc
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) The compressed data is written to file, and the filename is
- * generated by appending the format extension to %rootname.
- *
- */
-l_ok
-pixcompWriteFile(const char *rootname,
- PIXC *pixc)
-{
-char buf[128];
-
- PROCNAME("pixcompWriteFile");
-
- if (!pixc)
- return ERROR_INT("pixc not defined", procName, 1);
-
- snprintf(buf, sizeof(buf), "%s.%s", rootname,
- ImageFileFormatExtensions[pixc->comptype]);
- l_binaryWrite(buf, "w", pixc->data, pixc->size);
- return 0;
-}
diff --git a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pixconv.c b/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pixconv.c
deleted file mode 100644
index c827aaa6..00000000
--- a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pixconv.c
+++ /dev/null
@@ -1,4266 +0,0 @@
-/*====================================================================*
- - Copyright (C) 2001 Leptonica. All rights reserved.
- -
- - Redistribution and use in source and binary forms, with or without
- - modification, are permitted provided that the following conditions
- - are met:
- - 1. Redistributions of source code must retain the above copyright
- - notice, this list of conditions and the following disclaimer.
- - 2. Redistributions in binary form must reproduce the above
- - copyright notice, this list of conditions and the following
- - disclaimer in the documentation and/or other materials
- - provided with the distribution.
- -
- - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- - ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- - LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- - A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL ANY
- - CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
- - EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
- - PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
- - PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
- - OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
- - NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- *====================================================================*/
-
-/*!
- * \file pixconv.c
- *
- *
- * These functions convert between images of different types
- * without scaling.
- *
- * Conversion from 8 bpp grayscale to 1, 2, 4 and 8 bpp
- * PIX *pixThreshold8()
- *
- * Conversion from colormap to full color or grayscale
- * PIX *pixRemoveColormapGeneral()
- * PIX *pixRemoveColormap()
- *
- * Add colormap losslessly (8 to 8)
- * l_int32 pixAddGrayColormap8()
- * PIX *pixAddMinimalGrayColormap8()
- *
- * Conversion from RGB color to grayscale
- * PIX *pixConvertRGBToLuminance()
- * PIX *pixConvertRGBToGray()
- * PIX *pixConvertRGBToGrayFast()
- * PIX *pixConvertRGBToGrayMinMax()
- * PIX *pixConvertRGBToGraySatBoost()
- * PIX *pixConvertRGBToGrayArb()
- * PIX *pixConvertRGBToBinaryArb()
- *
- * Conversion from grayscale to colormap
- * PIX *pixConvertGrayToColormap() -- 2, 4, 8 bpp
- * PIX *pixConvertGrayToColormap8() -- 8 bpp only
- *
- * Colorizing conversion from grayscale to color
- * PIX *pixColorizeGray() -- 8 bpp or cmapped
- *
- * Conversion from RGB color to colormap
- * PIX *pixConvertRGBToColormap()
- *
- * Conversion from colormap to 1 bpp
- * PIX *pixConvertCmapTo1()
- *
- * Quantization for relatively small number of colors in source
- * l_int32 pixQuantizeIfFewColors()
- *
- * Conversion from 16 bpp to 8 bpp
- * PIX *pixConvert16To8()
- *
- * Conversion from grayscale to false color
- * PIX *pixConvertGrayToFalseColor()
- *
- * Unpacking conversion from 1 bpp to 2, 4, 8, 16 and 32 bpp
- * PIX *pixUnpackBinary()
- * PIX *pixConvert1To16()
- * PIX *pixConvert1To32()
- *
- * Unpacking conversion from 1 bpp to 2 bpp
- * PIX *pixConvert1To2Cmap()
- * PIX *pixConvert1To2()
- *
- * Unpacking conversion from 1 bpp to 4 bpp
- * PIX *pixConvert1To4Cmap()
- * PIX *pixConvert1To4()
- *
- * Unpacking conversion from 1, 2 and 4 bpp to 8 bpp
- * PIX *pixConvert1To8()
- * PIX *pixConvert2To8()
- * PIX *pixConvert4To8()
- *
- * Unpacking conversion from 8 bpp to 16 bpp
- * PIX *pixConvert8To16()
- *
- * Top-level conversion to 1 bpp
- * PIX *pixConvertTo1Adaptive()
- * PIX *pixConvertTo1()
- * PIX *pixConvertTo1BySampling()
- *
- * Top-level conversion to 2 bpp
- * PIX *pixConvertTo2()
- * PIX *pixConvert8To2()
- *
- * Top-level conversion to 4 bpp
- * PIX *pixConvertTo4()
- * PIX *pixConvert8To4()
- *
- * Top-level conversion to 8 bpp
- * PIX *pixConvertTo8()
- * PIX *pixConvertTo8BySampling()
- * PIX *pixConvertTo8Colormap()
- *
- * Top-level conversion to 16 bpp
- * PIX *pixConvertTo16()
- *
- * Top-level conversion to 32 bpp (RGB)
- * PIX *pixConvertTo32() ***
- * PIX *pixConvertTo32BySampling() ***
- * PIX *pixConvert8To32() ***
- *
- * Top-level conversion to 8 or 32 bpp, without colormap
- * PIX *pixConvertTo8Or32
- *
- * Conversion between 24 bpp and 32 bpp rgb
- * PIX *pixConvert24To32()
- * PIX *pixConvert32To24()
- *
- * Conversion between 32 bpp (1 spp) and 16 or 8 bpp
- * PIX *pixConvert32To16()
- * PIX *pixConvert32To8()
- *
- * Removal of alpha component by blending with white background
- * PIX *pixRemoveAlpha()
- *
- * Addition of alpha component to 1 bpp
- * PIX *pixAddAlphaTo1bpp()
- *
- * Lossless depth conversion (unpacking)
- * PIX *pixConvertLossless()
- *
- * Conversion for printing in PostScript
- * PIX *pixConvertForPSWrap()
- *
- * Scaling conversion to subpixel RGB
- * PIX *pixConvertToSubpixelRGB()
- * PIX *pixConvertGrayToSubpixelRGB()
- * PIX *pixConvertColorToSubpixelRGB()
- *
- * Setting neutral point for min/max boost conversion to gray
- * void l_setNeutralBoostVal()
- *
- */
-
-#ifdef HAVE_CONFIG_H
-#include
-#endif /* HAVE_CONFIG_H */
-
-#include
-#include
-#include "allheaders.h"
-
-/* ------- Set neutral point for min/max boost conversion to gray ------ */
- /* Call l_setNeutralBoostVal() to change this */
-static l_int32 var_NEUTRAL_BOOST_VAL = 180;
-
-
-#ifndef NO_CONSOLE_IO
-#define DEBUG_CONVERT_TO_COLORMAP 0
-#define DEBUG_UNROLLING 0
-#endif /* ~NO_CONSOLE_IO */
-
-
-/*-------------------------------------------------------------*
- * Conversion from 8 bpp grayscale to 1, 2 4 and 8 bpp *
- *-------------------------------------------------------------*/
-/*!
- * \brief pixThreshold8()
- *
- * \param[in] pixs 8 bpp grayscale
- * \param[in] d destination depth: 1, 2, 4 or 8
- * \param[in] nlevels number of levels to be used for colormap
- * \param[in] cmapflag 1 if makes colormap; 0 otherwise
- * \return pixd thresholded with standard dest thresholds,
- * or NULL on error
- *
- *
- * Notes:
- * (1) This uses, by default, equally spaced "target" values
- * that depend on the number of levels, with thresholds
- * halfway between. For N levels, with separation (N-1)/255,
- * there are N-1 fixed thresholds.
- * (2) For 1 bpp destination, the number of levels can only be 2
- * and if a cmap is made, black is (0,0,0) and white
- * is (255,255,255), which is opposite to the convention
- * without a colormap.
- * (3) For 1, 2 and 4 bpp, the nlevels arg is used if a colormap
- * is made; otherwise, we take the most significant bits
- * from the src that will fit in the dest.
- * (4) For 8 bpp, the input pixs is quantized to nlevels. The
- * dest quantized with that mapping, either through a colormap
- * table or directly with 8 bit values.
- * (5) Typically you should not use make a colormap for 1 bpp dest.
- * (6) This is not dithering. Each pixel is treated independently.
- *
- */
-PIX *
-pixThreshold8(PIX *pixs,
- l_int32 d,
- l_int32 nlevels,
- l_int32 cmapflag)
-{
-PIX *pixd;
-PIXCMAP *cmap;
-
- PROCNAME("pixThreshold8");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- if (pixGetDepth(pixs) != 8)
- return (PIX *)ERROR_PTR("pixs not 8 bpp", procName, NULL);
- if (cmapflag && nlevels < 2)
- return (PIX *)ERROR_PTR("nlevels must be at least 2", procName, NULL);
-
- switch (d) {
- case 1:
- pixd = pixThresholdToBinary(pixs, 128);
- if (cmapflag) {
- cmap = pixcmapCreateLinear(1, 2);
- pixSetColormap(pixd, cmap);
- }
- break;
- case 2:
- pixd = pixThresholdTo2bpp(pixs, nlevels, cmapflag);
- break;
- case 4:
- pixd = pixThresholdTo4bpp(pixs, nlevels, cmapflag);
- break;
- case 8:
- pixd = pixThresholdOn8bpp(pixs, nlevels, cmapflag);
- break;
- default:
- return (PIX *)ERROR_PTR("d must be in {1,2,4,8}", procName, NULL);
- }
-
- if (!pixd)
- return (PIX *)ERROR_PTR("pixd not made", procName, NULL);
- pixCopyInputFormat(pixd, pixs);
- return pixd;
-}
-
-
-/*-------------------------------------------------------------*
- * Conversion from colormapped pix *
- *-------------------------------------------------------------*/
-/*!
- * \brief pixRemoveColormapGeneral()
- *
- * \param[in] pixs any depth, with or without colormap
- * \param[in] type REMOVE_CMAP_TO_BINARY,
- * REMOVE_CMAP_TO_GRAYSCALE,
- * REMOVE_CMAP_TO_FULL_COLOR,
- * REMOVE_CMAP_WITH_ALPHA,
- * REMOVE_CMAP_BASED_ON_SRC
- * \param[in] ifnocmap L_CLONE, L_COPY
- * \return pixd always a new pix; without colormap, or NULL on error
- *
- *
- * Notes:
- * (1) Convenience function that allows choice between returning
- * a clone or a copy if pixs does not have a colormap.
- * (2) See pixRemoveColormap().
- *
- */
-PIX *
-pixRemoveColormapGeneral(PIX *pixs,
- l_int32 type,
- l_int32 ifnocmap)
-{
- PROCNAME("pixRemoveColormapGeneral");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- if (ifnocmap != L_CLONE && ifnocmap != L_COPY)
- return (PIX *)ERROR_PTR("invalid value for ifnocmap", procName, NULL);
-
- if (pixGetColormap(pixs))
- return pixRemoveColormap(pixs, type);
-
- if (ifnocmap == L_CLONE)
- return pixClone(pixs);
- else
- return pixCopy(NULL, pixs);
-}
-
-
-/*!
- * \brief pixRemoveColormap()
- *
- * \param[in] pixs see restrictions below
- * \param[in] type REMOVE_CMAP_TO_BINARY,
- * REMOVE_CMAP_TO_GRAYSCALE,
- * REMOVE_CMAP_TO_FULL_COLOR,
- * REMOVE_CMAP_WITH_ALPHA,
- * REMOVE_CMAP_BASED_ON_SRC
- * \return pixd without colormap, or NULL on error
- *
- *
- * Notes:
- * (1) If pixs does not have a colormap, a clone is returned.
- * (2) Otherwise, the input pixs is restricted to 1, 2, 4 or 8 bpp.
- * (3) Use REMOVE_CMAP_TO_BINARY only on 1 bpp pix.
- * (4) For grayscale conversion from RGB, use a weighted average
- * of RGB values, and always return an 8 bpp pix, regardless
- * of whether the input pixs depth is 2, 4 or 8 bpp.
- * (5) REMOVE_CMAP_TO_FULL_COLOR ignores the alpha component and
- * returns a 32 bpp pix with spp == 3 and the alpha bytes are 0.
- * (6) For REMOVE_CMAP_BASED_ON_SRC, if there is no color, this
- * returns either a 1 bpp or 8 bpp grayscale pix.
- * If there is color, this returns a 32 bpp pix, with either:
- * * 3 spp, if the alpha values are all 255 (opaque), or
- * * 4 spp (preserving the alpha), if any alpha values are not 255.
- *
- */
-PIX *
-pixRemoveColormap(PIX *pixs,
- l_int32 type)
-{
-l_int32 sval, rval, gval, bval, val0, val1;
-l_int32 i, j, k, w, h, d, wpls, wpld, ncolors, nalloc, count;
-l_int32 opaque, colorfound, blackwhite;
-l_int32 *rmap, *gmap, *bmap, *amap;
-l_uint32 *datas, *lines, *datad, *lined, *lut, *graymap;
-l_uint32 sword, dword;
-PIXCMAP *cmap;
-PIX *pixd;
-
- PROCNAME("pixRemoveColormap");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- if ((cmap = pixGetColormap(pixs)) == NULL)
- return pixClone(pixs);
- if (type != REMOVE_CMAP_TO_BINARY &&
- type != REMOVE_CMAP_TO_GRAYSCALE &&
- type != REMOVE_CMAP_TO_FULL_COLOR &&
- type != REMOVE_CMAP_WITH_ALPHA &&
- type != REMOVE_CMAP_BASED_ON_SRC) {
- L_WARNING("Invalid type; converting based on src\n", procName);
- type = REMOVE_CMAP_BASED_ON_SRC;
- }
- pixGetDimensions(pixs, &w, &h, &d);
- if (d != 1 && d != 2 && d != 4 && d != 8)
- return (PIX *)ERROR_PTR("pixs must be {1,2,4,8} bpp", procName, NULL);
-
- ncolors = pixcmapGetCount(cmap);
- nalloc = 1 << d; /* allocate for max size in case of pixel corruption */
- if (ncolors > nalloc)
- return (PIX *)ERROR_PTR("too many colors for pixel depth",
- procName, NULL);
-
- if (pixcmapToArrays(cmap, &rmap, &gmap, &bmap, &amap))
- return (PIX *)ERROR_PTR("colormap arrays not made", procName, NULL);
-
- if (d != 1 && type == REMOVE_CMAP_TO_BINARY) {
- L_WARNING("not 1 bpp; can't remove cmap to binary\n", procName);
- type = REMOVE_CMAP_BASED_ON_SRC;
- }
-
- /* Select output type depending on colormap content */
- if (type == REMOVE_CMAP_BASED_ON_SRC) {
- pixcmapIsOpaque(cmap, &opaque);
- pixcmapHasColor(cmap, &colorfound);
- pixcmapIsBlackAndWhite(cmap, &blackwhite);
- if (!opaque) { /* save the alpha */
- type = REMOVE_CMAP_WITH_ALPHA;
- } else if (colorfound) {
- type = REMOVE_CMAP_TO_FULL_COLOR;
- } else { /* opaque and no color */
- if (d == 1 && blackwhite) /* can binarize without loss */
- type = REMOVE_CMAP_TO_BINARY;
- else
- type = REMOVE_CMAP_TO_GRAYSCALE;
- }
- }
-
- datas = pixGetData(pixs);
- wpls = pixGetWpl(pixs);
- if (type == REMOVE_CMAP_TO_BINARY) {
- if ((pixd = pixCopy(NULL, pixs)) == NULL) {
- L_ERROR("pixd not made\n", procName);
- goto cleanup_arrays;
- }
- pixcmapGetColor(cmap, 0, &rval, &gval, &bval);
- val0 = rval + gval + bval;
- pixcmapGetColor(cmap, 1, &rval, &gval, &bval);
- val1 = rval + gval + bval;
- if (val0 < val1) /* photometrically inverted from standard */
- pixInvert(pixd, pixd);
- pixDestroyColormap(pixd);
- } else if (type == REMOVE_CMAP_TO_GRAYSCALE) {
- if ((pixd = pixCreate(w, h, 8)) == NULL) {
- L_ERROR("pixd not made\n", procName);
- goto cleanup_arrays;
- }
- pixCopyResolution(pixd, pixs);
- pixCopyInputFormat(pixd, pixs);
- datad = pixGetData(pixd);
- wpld = pixGetWpl(pixd);
- graymap = (l_uint32 *)LEPT_CALLOC(nalloc, sizeof(l_uint32));
- for (i = 0; i < ncolors; i++) {
- graymap[i] = (l_uint32)(L_RED_WEIGHT * rmap[i] +
- L_GREEN_WEIGHT * gmap[i] +
- L_BLUE_WEIGHT * bmap[i] + 0.5);
- }
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- lined = datad + i * wpld;
- switch (d) /* depth test above; no default permitted */
- {
- case 8:
- /* Unrolled 4x */
- for (j = 0, count = 0; j + 3 < w; j += 4, count++) {
- sword = lines[count];
- dword = (graymap[(sword >> 24) & 0xff] << 24) |
- (graymap[(sword >> 16) & 0xff] << 16) |
- (graymap[(sword >> 8) & 0xff] << 8) |
- graymap[sword & 0xff];
- lined[count] = dword;
- }
- /* Cleanup partial word */
- for (; j < w; j++) {
- sval = GET_DATA_BYTE(lines, j);
- gval = graymap[sval];
- SET_DATA_BYTE(lined, j, gval);
- }
-#if DEBUG_UNROLLING
-#define CHECK_VALUE(a, b, c) if (GET_DATA_BYTE(a, b) != c) { \
- lept_stderr("Error: mismatch at %d, %d vs %d\n", \
- j, GET_DATA_BYTE(a, b), c); }
- for (j = 0; j < w; j++) {
- sval = GET_DATA_BYTE(lines, j);
- gval = graymap[sval];
- CHECK_VALUE(lined, j, gval);
- }
-#endif
- break;
- case 4:
- /* Unrolled 8x */
- for (j = 0, count = 0; j + 7 < w; j += 8, count++) {
- sword = lines[count];
- dword = (graymap[(sword >> 28) & 0xf] << 24) |
- (graymap[(sword >> 24) & 0xf] << 16) |
- (graymap[(sword >> 20) & 0xf] << 8) |
- graymap[(sword >> 16) & 0xf];
- lined[2 * count] = dword;
- dword = (graymap[(sword >> 12) & 0xf] << 24) |
- (graymap[(sword >> 8) & 0xf] << 16) |
- (graymap[(sword >> 4) & 0xf] << 8) |
- graymap[sword & 0xf];
- lined[2 * count + 1] = dword;
- }
- /* Cleanup partial word */
- for (; j < w; j++) {
- sval = GET_DATA_QBIT(lines, j);
- gval = graymap[sval];
- SET_DATA_BYTE(lined, j, gval);
- }
-#if DEBUG_UNROLLING
- for (j = 0; j < w; j++) {
- sval = GET_DATA_QBIT(lines, j);
- gval = graymap[sval];
- CHECK_VALUE(lined, j, gval);
- }
-#endif
- break;
- case 2:
- /* Unrolled 16x */
- for (j = 0, count = 0; j + 15 < w; j += 16, count++) {
- sword = lines[count];
- dword = (graymap[(sword >> 30) & 0x3] << 24) |
- (graymap[(sword >> 28) & 0x3] << 16) |
- (graymap[(sword >> 26) & 0x3] << 8) |
- graymap[(sword >> 24) & 0x3];
- lined[4 * count] = dword;
- dword = (graymap[(sword >> 22) & 0x3] << 24) |
- (graymap[(sword >> 20) & 0x3] << 16) |
- (graymap[(sword >> 18) & 0x3] << 8) |
- graymap[(sword >> 16) & 0x3];
- lined[4 * count + 1] = dword;
- dword = (graymap[(sword >> 14) & 0x3] << 24) |
- (graymap[(sword >> 12) & 0x3] << 16) |
- (graymap[(sword >> 10) & 0x3] << 8) |
- graymap[(sword >> 8) & 0x3];
- lined[4 * count + 2] = dword;
- dword = (graymap[(sword >> 6) & 0x3] << 24) |
- (graymap[(sword >> 4) & 0x3] << 16) |
- (graymap[(sword >> 2) & 0x3] << 8) |
- graymap[sword & 0x3];
- lined[4 * count + 3] = dword;
- }
- /* Cleanup partial word */
- for (; j < w; j++) {
- sval = GET_DATA_DIBIT(lines, j);
- gval = graymap[sval];
- SET_DATA_BYTE(lined, j, gval);
- }
-#if DEBUG_UNROLLING
- for (j = 0; j < w; j++) {
- sval = GET_DATA_DIBIT(lines, j);
- gval = graymap[sval];
- CHECK_VALUE(lined, j, gval);
- }
-#endif
- break;
- case 1:
- /* Unrolled 8x */
- for (j = 0, count = 0; j + 31 < w; j += 32, count++) {
- sword = lines[count];
- for (k = 0; k < 4; k++) {
- /* The top byte is always the relevant one */
- dword = (graymap[(sword >> 31) & 0x1] << 24) |
- (graymap[(sword >> 30) & 0x1] << 16) |
- (graymap[(sword >> 29) & 0x1] << 8) |
- graymap[(sword >> 28) & 0x1];
- lined[8 * count + 2 * k] = dword;
- dword = (graymap[(sword >> 27) & 0x1] << 24) |
- (graymap[(sword >> 26) & 0x1] << 16) |
- (graymap[(sword >> 25) & 0x1] << 8) |
- graymap[(sword >> 24) & 0x1];
- lined[8 * count + 2 * k + 1] = dword;
- sword <<= 8; /* Move up the next byte */
- }
- }
- /* Cleanup partial word */
- for (; j < w; j++) {
- sval = GET_DATA_BIT(lines, j);
- gval = graymap[sval];
- SET_DATA_BYTE(lined, j, gval);
- }
-#if DEBUG_UNROLLING
- for (j = 0; j < w; j++) {
- sval = GET_DATA_BIT(lines, j);
- gval = graymap[sval];
- CHECK_VALUE(lined, j, gval);
- }
-#undef CHECK_VALUE
-#endif
- break;
- default:
- return NULL;
- }
- }
- if (graymap)
- LEPT_FREE(graymap);
- } else { /* type == REMOVE_CMAP_TO_FULL_COLOR or REMOVE_CMAP_WITH_ALPHA */
- if ((pixd = pixCreate(w, h, 32)) == NULL) {
- L_ERROR("pixd not made\n", procName);
- goto cleanup_arrays;
- }
- pixCopyInputFormat(pixd, pixs);
- pixCopyResolution(pixd, pixs);
- if (type == REMOVE_CMAP_WITH_ALPHA)
- pixSetSpp(pixd, 4);
- datad = pixGetData(pixd);
- wpld = pixGetWpl(pixd);
- lut = (l_uint32 *)LEPT_CALLOC(nalloc, sizeof(l_uint32));
- for (i = 0; i < ncolors; i++) {
- if (type == REMOVE_CMAP_TO_FULL_COLOR)
- composeRGBPixel(rmap[i], gmap[i], bmap[i], lut + i);
- else /* full color plus alpha */
- composeRGBAPixel(rmap[i], gmap[i], bmap[i], amap[i], lut + i);
- }
-
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- lined = datad + i * wpld;
- for (j = 0; j < w; j++) {
- if (d == 8)
- sval = GET_DATA_BYTE(lines, j);
- else if (d == 4)
- sval = GET_DATA_QBIT(lines, j);
- else if (d == 2)
- sval = GET_DATA_DIBIT(lines, j);
- else /* (d == 1) */
- sval = GET_DATA_BIT(lines, j);
- if (sval >= ncolors)
- L_WARNING("pixel value out of bounds\n", procName);
- else
- lined[j] = lut[sval];
- }
- }
- LEPT_FREE(lut);
- }
-
-cleanup_arrays:
- LEPT_FREE(rmap);
- LEPT_FREE(gmap);
- LEPT_FREE(bmap);
- LEPT_FREE(amap);
- return pixd;
-}
-
-
-/*-------------------------------------------------------------*
- * Add colormap losslessly (8 to 8) *
- *-------------------------------------------------------------*/
-/*!
- * \brief pixAddGrayColormap8()
- *
- * \param[in] pixs 8 bpp
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) If pixs has a colormap, this is a no-op.
- *
- */
-l_ok
-pixAddGrayColormap8(PIX *pixs)
-{
-PIXCMAP *cmap;
-
- PROCNAME("pixAddGrayColormap8");
-
- if (!pixs || pixGetDepth(pixs) != 8)
- return ERROR_INT("pixs not defined or not 8 bpp", procName, 1);
- if (pixGetColormap(pixs))
- return 0;
-
- cmap = pixcmapCreateLinear(8, 256);
- pixSetColormap(pixs, cmap);
- return 0;
-}
-
-
-/*!
- * \brief pixAddMinimalGrayColormap8()
- *
- * \param[in] pixs 8 bpp
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This generates a colormapped version of the input image
- * that has the same number of colormap entries as the
- * input image has unique gray levels.
- *
- */
-PIX *
-pixAddMinimalGrayColormap8(PIX *pixs)
-{
-l_int32 ncolors, w, h, i, j, wpl1, wpld, index, val;
-l_int32 *inta, *revmap;
-l_uint32 *data1, *datad, *line1, *lined;
-PIX *pix1, *pixd;
-PIXCMAP *cmap;
-
- PROCNAME("pixAddMinimalGrayColormap8");
-
- if (!pixs || pixGetDepth(pixs) != 8)
- return (PIX *)ERROR_PTR("pixs undefined or not 8 bpp", procName, NULL);
-
- /* Eliminate the easy cases */
- pixNumColors(pixs, 1, &ncolors);
- cmap = pixGetColormap(pixs);
- if (cmap) {
- if (pixcmapGetCount(cmap) == ncolors) /* irreducible */
- return pixCopy(NULL, pixs);
- else
- pix1 = pixRemoveColormap(pixs, REMOVE_CMAP_TO_GRAYSCALE);
- } else {
- if (ncolors == 256) {
- pix1 = pixCopy(NULL, pixs);
- pixAddGrayColormap8(pix1);
- return pix1;
- }
- pix1 = pixClone(pixs);
- }
-
- /* Find the gray levels and make a reverse map */
- pixGetDimensions(pix1, &w, &h, NULL);
- data1 = pixGetData(pix1);
- wpl1 = pixGetWpl(pix1);
- inta = (l_int32 *)LEPT_CALLOC(256, sizeof(l_int32));
- for (i = 0; i < h; i++) {
- line1 = data1 + i * wpl1;
- for (j = 0; j < w; j++) {
- val = GET_DATA_BYTE(line1, j);
- inta[val] = 1;
- }
- }
- cmap = pixcmapCreate(8);
- revmap = (l_int32 *)LEPT_CALLOC(256, sizeof(l_int32));
- for (i = 0, index = 0; i < 256; i++) {
- if (inta[i]) {
- pixcmapAddColor(cmap, i, i, i);
- revmap[i] = index++;
- }
- }
-
- /* Set all pixels in pixd to the colormap index */
- pixd = pixCreateTemplate(pix1);
- pixSetColormap(pixd, cmap);
- pixCopyInputFormat(pixd, pixs);
- pixCopyResolution(pixd, pixs);
- datad = pixGetData(pixd);
- wpld = pixGetWpl(pixd);
- for (i = 0; i < h; i++) {
- line1 = data1 + i * wpl1;
- lined = datad + i * wpld;
- for (j = 0; j < w; j++) {
- val = GET_DATA_BYTE(line1, j);
- SET_DATA_BYTE(lined, j, revmap[val]);
- }
- }
-
- pixDestroy(&pix1);
- LEPT_FREE(inta);
- LEPT_FREE(revmap);
- return pixd;
-}
-
-
-/*-------------------------------------------------------------*
- * Conversion from RGB color to grayscale *
- *-------------------------------------------------------------*/
-/*!
- * \brief pixConvertRGBToLuminance()
- *
- * \param[in] pixs 32 bpp RGB
- * \return 8 bpp pix, or NULL on error
- *
- *
- * Notes:
- * (1) Use a standard luminance conversion.
- *
- */
-PIX *
-pixConvertRGBToLuminance(PIX *pixs)
-{
- return pixConvertRGBToGray(pixs, 0.0, 0.0, 0.0);
-}
-
-
-/*!
- * \brief pixConvertRGBToGray()
- *
- * \param[in] pixs 32 bpp RGB
- * \param[in] rwt, gwt, bwt non-negative; these should add to 1.0,
- * or use 0.0 for default
- * \return 8 bpp pix, or NULL on error
- *
- *
- * Notes:
- * (1) Use a weighted average of the RGB values.
- *
- */
-PIX *
-pixConvertRGBToGray(PIX *pixs,
- l_float32 rwt,
- l_float32 gwt,
- l_float32 bwt)
-{
-l_int32 i, j, w, h, wpls, wpld, val;
-l_uint32 word;
-l_uint32 *datas, *lines, *datad, *lined;
-l_float32 sum;
-PIX *pixd;
-
- PROCNAME("pixConvertRGBToGray");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- if (pixGetDepth(pixs) != 32)
- return (PIX *)ERROR_PTR("pixs not 32 bpp", procName, NULL);
- if (rwt < 0.0 || gwt < 0.0 || bwt < 0.0)
- return (PIX *)ERROR_PTR("weights not all >= 0.0", procName, NULL);
-
- /* Make sure the sum of weights is 1.0; otherwise, you can get
- * overflow in the gray value. */
- if (rwt == 0.0 && gwt == 0.0 && bwt == 0.0) {
- rwt = L_RED_WEIGHT;
- gwt = L_GREEN_WEIGHT;
- bwt = L_BLUE_WEIGHT;
- }
- sum = rwt + gwt + bwt;
- if (L_ABS(sum - 1.0) > 0.0001) { /* maintain ratios with sum == 1.0 */
- L_WARNING("weights don't sum to 1; maintaining ratios\n", procName);
- rwt = rwt / sum;
- gwt = gwt / sum;
- bwt = bwt / sum;
- }
-
- pixGetDimensions(pixs, &w, &h, NULL);
- datas = pixGetData(pixs);
- wpls = pixGetWpl(pixs);
- if ((pixd = pixCreate(w, h, 8)) == NULL)
- return (PIX *)ERROR_PTR("pixd not made", procName, NULL);
- pixCopyResolution(pixd, pixs);
- pixCopyInputFormat(pixd, pixs);
- datad = pixGetData(pixd);
- wpld = pixGetWpl(pixd);
-
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- lined = datad + i * wpld;
- for (j = 0; j < w; j++) {
- word = *(lines + j);
- val = (l_int32)(rwt * ((word >> L_RED_SHIFT) & 0xff) +
- gwt * ((word >> L_GREEN_SHIFT) & 0xff) +
- bwt * ((word >> L_BLUE_SHIFT) & 0xff) + 0.5);
- SET_DATA_BYTE(lined, j, val);
- }
- }
-
- return pixd;
-}
-
-
-/*!
- * \brief pixConvertRGBToGrayFast()
- *
- * \param[in] pixs 32 bpp RGB
- * \return 8 bpp pix, or NULL on error
- *
- *
- * Notes:
- * (1) This function should be used if speed of conversion
- * is paramount, and the green channel can be used as
- * a fair representative of the RGB intensity. It is
- * several times faster than pixConvertRGBToGray().
- * (2) To combine RGB to gray conversion with subsampling,
- * use pixScaleRGBToGrayFast() instead.
- *
- */
-PIX *
-pixConvertRGBToGrayFast(PIX *pixs)
-{
-l_int32 i, j, w, h, wpls, wpld, val;
-l_uint32 *datas, *lines, *datad, *lined;
-PIX *pixd;
-
- PROCNAME("pixConvertRGBToGrayFast");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- if (pixGetDepth(pixs) != 32)
- return (PIX *)ERROR_PTR("pixs not 32 bpp", procName, NULL);
-
- pixGetDimensions(pixs, &w, &h, NULL);
- datas = pixGetData(pixs);
- wpls = pixGetWpl(pixs);
- if ((pixd = pixCreate(w, h, 8)) == NULL)
- return (PIX *)ERROR_PTR("pixd not made", procName, NULL);
- pixCopyResolution(pixd, pixs);
- pixCopyInputFormat(pixd, pixs);
- datad = pixGetData(pixd);
- wpld = pixGetWpl(pixd);
-
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- lined = datad + i * wpld;
- for (j = 0; j < w; j++, lines++) {
- val = ((*lines) >> L_GREEN_SHIFT) & 0xff;
- SET_DATA_BYTE(lined, j, val);
- }
- }
-
- return pixd;
-}
-
-
-/*!
- * \brief pixConvertRGBToGrayMinMax()
- *
- * \param[in] pixs 32 bpp RGB
- * \param[in] type L_CHOOSE_MIN, L_CHOOSE_MAX, L_CHOOSE_MAXDIFF,
- * L_CHOOSE_MIN_BOOST, L_CHOOSE_MAX_BOOST
- * \return 8 bpp pix, or NULL on error
- *
- *
- * Notes:
- * (1) This chooses various components or combinations of them,
- * from the three RGB sample values. In addition to choosing
- * the min, max, and maxdiff (difference between max and min),
- * this also allows boosting the min and max about a reference
- * value.
- * (2) The default reference value for boosting the min and max
- * is 200. This can be changed with l_setNeutralBoostVal()
- * (3) The result with L_CHOOSE_MAXDIFF is surprisingly sensitive
- * to a jpeg compression/decompression cycle with quality = 75.
- *
- */
-PIX *
-pixConvertRGBToGrayMinMax(PIX *pixs,
- l_int32 type)
-{
-l_int32 i, j, w, h, wpls, wpld, rval, gval, bval, val, minval, maxval;
-l_uint32 *datas, *lines, *datad, *lined;
-PIX *pixd;
-
- PROCNAME("pixConvertRGBToGrayMinMax");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- if (pixGetDepth(pixs) != 32)
- return (PIX *)ERROR_PTR("pixs not 32 bpp", procName, NULL);
- if (type != L_CHOOSE_MIN && type != L_CHOOSE_MAX &&
- type != L_CHOOSE_MAXDIFF && type != L_CHOOSE_MIN_BOOST &&
- type != L_CHOOSE_MAX_BOOST)
- return (PIX *)ERROR_PTR("invalid type", procName, NULL);
-
- pixGetDimensions(pixs, &w, &h, NULL);
- datas = pixGetData(pixs);
- wpls = pixGetWpl(pixs);
- if ((pixd = pixCreate(w, h, 8)) == NULL)
- return (PIX *)ERROR_PTR("pixd not made", procName, NULL);
- pixCopyResolution(pixd, pixs);
- pixCopyInputFormat(pixd, pixs);
- datad = pixGetData(pixd);
- wpld = pixGetWpl(pixd);
-
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- lined = datad + i * wpld;
- for (j = 0; j < w; j++) {
- extractRGBValues(lines[j], &rval, &gval, &bval);
- if (type == L_CHOOSE_MIN || type == L_CHOOSE_MIN_BOOST) {
- val = L_MIN(rval, gval);
- val = L_MIN(val, bval);
- if (type == L_CHOOSE_MIN_BOOST)
- val = L_MIN(255, (val * val) / var_NEUTRAL_BOOST_VAL);
- } else if (type == L_CHOOSE_MAX || type == L_CHOOSE_MAX_BOOST) {
- val = L_MAX(rval, gval);
- val = L_MAX(val, bval);
- if (type == L_CHOOSE_MAX_BOOST)
- val = L_MIN(255, (val * val) / var_NEUTRAL_BOOST_VAL);
- } else { /* L_CHOOSE_MAXDIFF */
- minval = L_MIN(rval, gval);
- minval = L_MIN(minval, bval);
- maxval = L_MAX(rval, gval);
- maxval = L_MAX(maxval, bval);
- val = maxval - minval;
- }
- SET_DATA_BYTE(lined, j, val);
- }
- }
-
- return pixd;
-}
-
-
-/*!
- * \brief pixConvertRGBToGraySatBoost()
- *
- * \param[in] pixs 32 bpp rgb
- * \param[in] refval between 1 and 255; typ. less than 128
- * \return pixd 8 bpp, or NULL on error
- *
- *
- * Notes:
- * (1) This returns the max component value, boosted by
- * the saturation. The maximum boost occurs where
- * the maximum component value is equal to some reference value.
- * This particular weighting is due to Dany Qumsiyeh.
- * (2) For gray pixels (zero saturation), this returns
- * the intensity of any component.
- * (3) For fully saturated pixels ('fullsat'), this rises linearly
- * with the max value and has a slope equal to 255 divided
- * by the reference value; for a max value greater than
- * the reference value, it is clipped to 255.
- * (4) For saturation values in between, the output is a linear
- * combination of (2) and (3), weighted by saturation.
- * It falls between these two curves, and does not exceed 255.
- * (5) This can be useful for distinguishing an object that has nonzero
- * saturation from a gray background. For this, the refval
- * should be chosen near the expected value of the background,
- * to achieve maximum saturation boost there.
- *
- */
-PIX *
-pixConvertRGBToGraySatBoost(PIX *pixs,
- l_int32 refval)
-{
-l_int32 w, h, d, i, j, wplt, wpld;
-l_int32 rval, gval, bval, sval, minrg, maxrg, min, max, delta;
-l_int32 fullsat, newval;
-l_float32 *invmax, *ratio;
-l_uint32 *linet, *lined, *datat, *datad;
-PIX *pixt, *pixd;
-
- PROCNAME("pixConvertRGBToGraySatBoost");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- pixGetDimensions(pixs, &w, &h, &d);
- if (d != 32 && !pixGetColormap(pixs))
- return (PIX *)ERROR_PTR("pixs not cmapped or rgb", procName, NULL);
- if (refval < 1 || refval > 255)
- return (PIX *)ERROR_PTR("refval not in [1 ... 255]", procName, NULL);
-
- pixt = pixRemoveColormap(pixs, REMOVE_CMAP_TO_FULL_COLOR);
- pixd = pixCreate(w, h, 8);
- pixCopyResolution(pixd, pixs);
- pixCopyInputFormat(pixd, pixs);
- wplt = pixGetWpl(pixt);
- datat = pixGetData(pixt);
- wpld = pixGetWpl(pixd);
- datad = pixGetData(pixd);
- invmax = (l_float32 *)LEPT_CALLOC(256, sizeof(l_float32));
- ratio = (l_float32 *)LEPT_CALLOC(256, sizeof(l_float32));
- for (i = 1; i < 256; i++) { /* i == 0 --> delta = sval = newval = 0 */
- invmax[i] = 1.0 / (l_float32)i;
- ratio[i] = (l_float32)i / (l_float32)refval;
- }
- for (i = 0; i < h; i++) {
- linet = datat + i * wplt;
- lined = datad + i * wpld;
- for (j = 0; j < w; j++) {
- extractRGBValues(linet[j], &rval, &gval, &bval);
- minrg = L_MIN(rval, gval);
- min = L_MIN(minrg, bval);
- maxrg = L_MAX(rval, gval);
- max = L_MAX(maxrg, bval);
- delta = max - min;
- if (delta == 0) /* gray; no chroma */
- sval = 0;
- else
- sval = (l_int32)(255. * (l_float32)delta * invmax[max] + 0.5);
-
- fullsat = L_MIN(255, 255 * ratio[max]);
- newval = (sval * fullsat + (255 - sval) * max) / 255;
- SET_DATA_BYTE(lined, j, newval);
- }
- }
-
- pixDestroy(&pixt);
- LEPT_FREE(invmax);
- LEPT_FREE(ratio);
- return pixd;
-}
-
-
-/*!
- * \brief pixConvertRGBToGrayArb()
- *
- * \param[in] pixs 32 bpp RGB
- * \param[in] rc, gc, bc arithmetic factors; can be negative
- * \return 8 bpp pix, or NULL on error
- *
- *
- * Notes:
- * (1) This converts to gray using an arbitrary linear combination
- * of the rgb color components. It differs from pixConvertToGray(),
- * which uses only positive coefficients that sum to 1.
- * (2) The gray output values are clipped to 0 and 255.
- *
- */
-PIX *
-pixConvertRGBToGrayArb(PIX *pixs,
- l_float32 rc,
- l_float32 gc,
- l_float32 bc)
-{
-l_int32 i, j, w, h, wpls, wpld, rval, gval, bval, val;
-l_uint32 *datas, *lines, *datad, *lined;
-PIX *pixd;
-
- PROCNAME("pixConvertRGBToGrayArb");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- if (pixGetDepth(pixs) != 32)
- return (PIX *)ERROR_PTR("pixs not 32 bpp", procName, NULL);
- if (rc <= 0 && gc <= 0 && bc <= 0)
- return (PIX *)ERROR_PTR("all coefficients <= 0", procName, NULL);
-
- pixGetDimensions(pixs, &w, &h, NULL);
- datas = pixGetData(pixs);
- wpls = pixGetWpl(pixs);
- if ((pixd = pixCreate(w, h, 8)) == NULL)
- return (PIX *)ERROR_PTR("pixd not made", procName, NULL);
- pixCopyResolution(pixd, pixs);
- pixCopyInputFormat(pixd, pixs);
- datad = pixGetData(pixd);
- wpld = pixGetWpl(pixd);
-
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- lined = datad + i * wpld;
- for (j = 0; j < w; j++) {
- extractRGBValues(lines[j], &rval, &gval, &bval);
- val = (l_int32)(rc * rval + gc * gval + bc * bval);
- val = L_MIN(255, L_MAX(0, val));
- SET_DATA_BYTE(lined, j, val);
- }
- }
-
- return pixd;
-}
-
-
-/*!
- * \brief pixConvertRGBToBinaryArb()
- *
- * \param[in] pixs 32 bpp RGB
- * \param[in] rc, gc, bc arithmetic factors; can be negative
- * \param[in] thresh binarization threshold
- * \param[in] relation L_SELECT_IF_LT, L_SELECT_IF_GT
- * L_SELECT_IF_LTE, L_SELECT_IF_GTE
- * \return 1 bpp pix, or NULL on error
- *
- *
- * Notes:
- * (1) This makes a 1 bpp mask from an RGB image, using an arbitrary
- * linear combination of the rgb color components, along with
- * a threshold and a selection choice of the gray value relative
- * to %thresh.
- *
- */
-PIX *
-pixConvertRGBToBinaryArb(PIX *pixs,
- l_float32 rc,
- l_float32 gc,
- l_float32 bc,
- l_int32 thresh,
- l_int32 relation)
-{
-l_int32 threshold;
-PIX *pix1, *pix2;
-
- PROCNAME("pixConvertRGBToBinaryArb");
-
- if (!pixs || pixGetDepth(pixs) != 32)
- return (PIX *)ERROR_PTR("pixs undefined or not 32 bpp", procName, NULL);
- if (rc <= 0 && gc <= 0 && bc <= 0)
- return (PIX *)ERROR_PTR("all coefficients <= 0", procName, NULL);
- if (relation != L_SELECT_IF_LT && relation != L_SELECT_IF_GT &&
- relation != L_SELECT_IF_LTE && relation != L_SELECT_IF_GTE)
- return (PIX *)ERROR_PTR("invalid relation", procName, NULL);
-
- pix1 = pixConvertRGBToGrayArb(pixs, rc, gc, bc);
- threshold = (relation == L_SELECT_IF_LTE || relation == L_SELECT_IF_GT) ?
- thresh : thresh + 1;
- pix2 = pixThresholdToBinary(pix1, threshold);
- if (relation == L_SELECT_IF_GT || relation == L_SELECT_IF_GTE)
- pixInvert(pix2, pix2);
- pixDestroy(&pix1);
- return pix2;
-}
-
-
-/*---------------------------------------------------------------------------*
- * Conversion from grayscale to colormap *
- *---------------------------------------------------------------------------*/
-/*!
- * \brief pixConvertGrayToColormap()
- *
- * \param[in] pixs 2, 4 or 8 bpp grayscale
- * \return pixd 2, 4 or 8 bpp with colormap, or NULL on error
- *
- *
- * Notes:
- * (1) This is a simple interface for adding a colormap to a
- * 2, 4 or 8 bpp grayscale image without causing any
- * quantization. There is some similarity to operations
- * in grayquant.c, such as pixThresholdOn8bpp(), where
- * the emphasis is on quantization with an arbitrary number
- * of levels, and a colormap is an option.
- * (2) Returns a copy if pixs already has a colormap.
- * (3) For 8 bpp src, this is a lossless transformation.
- * (4) For 2 and 4 bpp src, this generates a colormap that
- * assumes full coverage of the gray space, with equally spaced
- * levels: 4 levels for d = 2 and 16 levels for d = 4.
- * (5) In all cases, the depth of the dest is the same as the src.
- *
- */
-PIX *
-pixConvertGrayToColormap(PIX *pixs)
-{
-l_int32 d;
-PIX *pixd;
-PIXCMAP *cmap;
-
- PROCNAME("pixConvertGrayToColormap");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- d = pixGetDepth(pixs);
- if (d != 2 && d != 4 && d != 8)
- return (PIX *)ERROR_PTR("pixs not 2, 4 or 8 bpp", procName, NULL);
-
- if (pixGetColormap(pixs)) {
- L_INFO("pixs already has a colormap\n", procName);
- return pixCopy(NULL, pixs);
- }
-
- if (d == 8) /* lossless conversion */
- return pixConvertGrayToColormap8(pixs, 2);
-
- /* Build a cmap with equally spaced target values over the
- * full 8 bpp range. */
- pixd = pixCopy(NULL, pixs);
- cmap = pixcmapCreateLinear(d, 1 << d);
- pixSetColormap(pixd, cmap);
- pixCopyInputFormat(pixd, pixs);
- return pixd;
-}
-
-
-/*!
- * \brief pixConvertGrayToColormap8()
- *
- * \param[in] pixs 8 bpp grayscale
- * \param[in] mindepth of pixd; valid values are 2, 4 and 8
- * \return pixd 2, 4 or 8 bpp with colormap, or NULL on error
- *
- *
- * Notes:
- * (1) Returns a copy if pixs already has a colormap.
- * (2) This is a lossless transformation; there is no quantization.
- * We compute the number of different gray values in pixs,
- * and construct a colormap that has exactly these values.
- * (3) 'mindepth' is the minimum depth of pixd. If mindepth == 8,
- * pixd will always be 8 bpp. Let the number of different
- * gray values in pixs be ngray. If mindepth == 4, we attempt
- * to save pixd as a 4 bpp image, but if ngray > 16,
- * pixd must be 8 bpp. Likewise, if mindepth == 2,
- * the depth of pixd will be 2 if ngray <= 4 and 4 if ngray > 4
- * but <= 16.
- *
- */
-PIX *
-pixConvertGrayToColormap8(PIX *pixs,
- l_int32 mindepth)
-{
-l_int32 ncolors, w, h, depth, i, j, wpls, wpld;
-l_int32 index, num, val, newval;
-l_int32 array[256];
-l_uint32 *lines, *lined, *datas, *datad;
-NUMA *na;
-PIX *pixd;
-PIXCMAP *cmap;
-
- PROCNAME("pixConvertGrayToColormap8");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- if (pixGetDepth(pixs) != 8)
- return (PIX *)ERROR_PTR("pixs not 8 bpp", procName, NULL);
- if (mindepth != 2 && mindepth != 4 && mindepth != 8) {
- L_WARNING("invalid value of mindepth; setting to 8\n", procName);
- mindepth = 8;
- }
-
- if (pixGetColormap(pixs)) {
- L_INFO("pixs already has a colormap\n", procName);
- return pixCopy(NULL, pixs);
- }
-
- na = pixGetGrayHistogram(pixs, 1);
- numaGetCountRelativeToZero(na, L_GREATER_THAN_ZERO, &ncolors);
- if (mindepth == 8 || ncolors > 16)
- depth = 8;
- else if (mindepth == 4 || ncolors > 4)
- depth = 4;
- else
- depth = 2;
-
- pixGetDimensions(pixs, &w, &h, NULL);
- pixd = pixCreate(w, h, depth);
- cmap = pixcmapCreate(depth);
- pixSetColormap(pixd, cmap);
- pixCopyInputFormat(pixd, pixs);
- pixCopyResolution(pixd, pixs);
-
- index = 0;
- for (i = 0; i < 256; i++) {
- array[i] = 0; /* only to quiet the static checker */
- numaGetIValue(na, i, &num);
- if (num > 0) {
- pixcmapAddColor(cmap, i, i, i);
- array[i] = index;
- index++;
- }
- }
-
- datas = pixGetData(pixs);
- wpls = pixGetWpl(pixs);
- datad = pixGetData(pixd);
- wpld = pixGetWpl(pixd);
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- lined = datad + i * wpld;
- for (j = 0; j < w; j++) {
- val = GET_DATA_BYTE(lines, j);
- newval = array[val];
- if (depth == 2)
- SET_DATA_DIBIT(lined, j, newval);
- else if (depth == 4)
- SET_DATA_QBIT(lined, j, newval);
- else /* depth == 8 */
- SET_DATA_BYTE(lined, j, newval);
- }
- }
-
- numaDestroy(&na);
- return pixd;
-}
-
-
-/*---------------------------------------------------------------------------*
- * Colorizing conversion from grayscale to color *
- *---------------------------------------------------------------------------*/
-/*!
- * \brief pixColorizeGray()
- *
- * \param[in] pixs 8 bpp gray; 2, 4 or 8 bpp colormapped
- * \param[in] color 32 bit rgba pixel
- * \param[in] cmapflag 1 for result to have colormap; 0 for RGB
- * \return pixd 8 bpp colormapped or 32 bpp rgb, or NULL on error
- *
- *
- * Notes:
- * (1) This applies the specific color to the grayscale image.
- * (2) If pixs already has a colormap, it is removed to gray
- * before colorizing.
- *
- */
-PIX *
-pixColorizeGray(PIX *pixs,
- l_uint32 color,
- l_int32 cmapflag)
-{
-l_int32 i, j, w, h, wplt, wpld, val8;
-l_uint32 *datad, *datat, *lined, *linet, *tab;
-PIX *pixt, *pixd;
-PIXCMAP *cmap;
-
- PROCNAME("pixColorizeGray");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- if (pixGetDepth(pixs) != 8 && !pixGetColormap(pixs))
- return (PIX *)ERROR_PTR("pixs not 8 bpp or cmapped", procName, NULL);
-
- if (pixGetColormap(pixs))
- pixt = pixRemoveColormap(pixs, REMOVE_CMAP_TO_GRAYSCALE);
- else
- pixt = pixClone(pixs);
-
- cmap = pixcmapGrayToColor(color);
- if (cmapflag) {
- pixd = pixCopy(NULL, pixt);
- pixSetColormap(pixd, cmap);
- pixDestroy(&pixt);
- return pixd;
- }
-
- /* Make an RGB pix */
- pixcmapToRGBTable(cmap, &tab, NULL);
- pixGetDimensions(pixt, &w, &h, NULL);
- pixd = pixCreate(w, h, 32);
- pixCopyResolution(pixd, pixs);
- pixCopyInputFormat(pixd, pixs);
- datad = pixGetData(pixd);
- wpld = pixGetWpl(pixd);
- datat = pixGetData(pixt);
- wplt = pixGetWpl(pixt);
- for (i = 0; i < h; i++) {
- lined = datad + i * wpld;
- linet = datat + i * wplt;
- for (j = 0; j < w; j++) {
- val8 = GET_DATA_BYTE(linet, j);
- lined[j] = tab[val8];
- }
- }
-
- pixDestroy(&pixt);
- pixcmapDestroy(&cmap);
- LEPT_FREE(tab);
- return pixd;
-}
-
-
-/*---------------------------------------------------------------------------*
- * Conversion from RGB color to colormap *
- *---------------------------------------------------------------------------*/
-/*!
- * \brief pixConvertRGBToColormap()
- *
- * \param[in] pixs 32 bpp rgb
- * \param[in] ditherflag 1 to dither, 0 otherwise
- * \return pixd 2, 4 or 8 bpp with colormap, or NULL on error
- *
- *
- * Notes:
- * (1) This function has two relatively simple modes of color
- * quantization:
- * (a) If the image is made orthographically and has not more
- * than 256 'colors' at the level 4 octcube leaves,
- * it is quantized nearly exactly. The ditherflag
- * is ignored.
- * (b) Most natural images have more than 256 different colors;
- * in that case we use adaptive octree quantization,
- * with dithering if requested.
- * (2) If there are not more than 256 occupied level 4 octcubes,
- * the color in the colormap that represents all pixels in
- * one of those octcubes is given by the first pixel that
- * falls into that octcube.
- * (3) If there are more than 256 colors, we use adaptive octree
- * color quantization.
- * (4) Dithering gives better visual results on images where
- * there is a color wash (a slow variation of color), but it
- * is about twice as slow and results in significantly larger
- * files when losslessly compressed (e.g., into png).
- *
- */
-PIX *
-pixConvertRGBToColormap(PIX *pixs,
- l_int32 ditherflag)
-{
-l_int32 ncolors;
-NUMA *na;
-PIX *pixd;
-
- PROCNAME("pixConvertRGBToColormap");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- if (pixGetDepth(pixs) != 32)
- return (PIX *)ERROR_PTR("pixs not 32 bpp", procName, NULL);
- if (pixGetSpp(pixs) == 4)
- L_WARNING("pixs has alpha; removing\n", procName);
-
- /* Get the histogram and count the number of occupied level 4
- * leaf octcubes. We don't yet know if this is the number of
- * actual colors, but if it's not, all pixels falling into
- * the same leaf octcube will be assigned to the color of the
- * first pixel that lands there. */
- na = pixOctcubeHistogram(pixs, 4, &ncolors);
-
- /* If there are too many occupied leaf octcubes to be
- * represented directly in a colormap, fall back to octree
- * quantization, optionally with dithering. */
- if (ncolors > 256) {
- numaDestroy(&na);
- if (ditherflag)
- L_INFO("More than 256 colors; using octree quant with dithering\n",
- procName);
- else
- L_INFO("More than 256 colors; using octree quant; no dithering\n",
- procName);
- return pixOctreeColorQuant(pixs, 240, ditherflag);
- }
-
- /* There are not more than 256 occupied leaf octcubes.
- * Quantize to those octcubes. */
- pixd = pixFewColorsOctcubeQuant2(pixs, 4, na, ncolors, NULL);
- pixCopyInputFormat(pixd, pixs);
- numaDestroy(&na);
- return pixd;
-}
-
-
-/*---------------------------------------------------------------------------*
- * Conversion from colormap to 1 bpp *
- *---------------------------------------------------------------------------*/
-/*!
- * \brief pixConvertCmapTo1()
- *
- * \param[in] pixs cmapped
- * \return pixd 1 bpp, or NULL on error
- *
- *
- * Notes:
- * (1) This is an extreme color quantizer. It decides which
- * colors map to FG (black) and which to BG (white).
- * (2) This uses two heuristics to make the decision:
- * (a) colors similar to each other are likely to be in the same class
- * (b) there is usually much less FG than BG.
- *
- */
-PIX *
-pixConvertCmapTo1(PIX *pixs)
-{
-l_int32 i, j, nc, w, h, imin, imax, factor, wpl1, wpld;
-l_int32 index, rmin, gmin, bmin, rmax, gmax, bmax, dmin, dmax;
-l_float32 minfract, ifract;
-l_int32 *lut;
-l_uint32 *line1, *lined, *data1, *datad;
-NUMA *na1, *na2; /* histograms */
-PIX *pix1, *pixd;
-PIXCMAP *cmap;
-
- PROCNAME("pixConvertCmapTo1");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- if ((cmap = pixGetColormap(pixs)) == NULL)
- return (PIX *)ERROR_PTR("no colormap", procName, NULL);
-
- /* Select target colors for the two classes. Find the
- * colors with smallest and largest average component values.
- * The smallest is class 0 and the largest is class 1. */
- pixcmapGetRangeValues(cmap, L_SELECT_AVERAGE, NULL, NULL, &imin, &imax);
- pixcmapGetColor(cmap, imin, &rmin, &gmin, &bmin);
- pixcmapGetColor(cmap, imax, &rmax, &gmax, &bmax);
- nc = pixcmapGetCount(cmap);
-
- /* Assign colors to the two classes. The histogram is
- * initialized to 0, so any colors not found when computing
- * the sampled histogram will get zero weight in minfract. */
- if ((lut = (l_int32 *)LEPT_CALLOC(nc, sizeof(l_int32))) == NULL)
- return (PIX *)ERROR_PTR("calloc fail for lut", procName, NULL);
- pixGetDimensions(pixs, &w, &h, NULL);
- factor = L_MAX(1, (l_int32)sqrt((l_float64)(w * h) / 50000. + 0.5));
- na1 = pixGetCmapHistogram(pixs, factor);
- na2 = numaNormalizeHistogram(na1, 1.0);
- minfract = 0.0;
- for (i = 0; i < nc; i++) {
- numaGetFValue(na2, i, &ifract);
- pixcmapGetDistanceToColor(cmap, i, rmin, gmin, bmin, &dmin);
- pixcmapGetDistanceToColor(cmap, i, rmax, gmax, bmax, &dmax);
- if (dmin < dmax) { /* closer to dark extreme value */
- lut[i] = 1; /* black pixel in 1 bpp image */
- minfract += ifract;
- }
- }
- numaDestroy(&na1);
- numaDestroy(&na2);
-
- /* Generate the output binarized image */
- pix1 = pixConvertTo8(pixs, 1);
- pixd = pixCreate(w, h, 1);
- data1 = pixGetData(pix1);
- datad = pixGetData(pixd);
- wpl1 = pixGetWpl(pix1);
- wpld = pixGetWpl(pixd);
- for (i = 0; i < h; i++) {
- line1 = data1 + i * wpl1;
- lined = datad + i * wpld;
- for (j = 0; j < w; j++) {
- index = GET_DATA_BYTE(line1, j);
- if (lut[index] == 1) SET_DATA_BIT(lined, j);
- }
- }
- pixDestroy(&pix1);
- LEPT_FREE(lut);
-
- /* We expect minfract (the dark colors) to be less than 0.5.
- * If that is not the case, invert pixd. */
- if (minfract > 0.5) {
- L_INFO("minfract = %5.3f; inverting\n", procName, minfract);
- pixInvert(pixd, pixd);
- }
-
- return pixd;
-}
-
-
-/*---------------------------------------------------------------------------*
- * Quantization for relatively small number of colors in source *
- *---------------------------------------------------------------------------*/
-/*!
- * \brief pixQuantizeIfFewColors()
- *
- * \param[in] pixs 8 bpp gray or 32 bpp rgb
- * \param[in] maxcolors max number of colors allowed to be returned
- * from pixColorsForQuantization();
- * use 0 for default
- * \param[in] mingraycolors min number of gray levels that a grayscale
- * image is quantized to; use 0 for default
- * \param[in] octlevel for octcube quantization: 3 or 4
- * \param[out] ppixd 2,4 or 8 bpp quantized; null if too many colors
- * \return 0 if OK, 1 on error or if pixs can't be quantized into
- * a small number of colors.
- *
- *
- * Notes:
- * (1) This is a wrapper that tests if the pix can be quantized
- * with good quality using a small number of colors. If so,
- * it does the quantization, defining a colormap and using
- * pixels whose value is an index into the colormap.
- * (2) If the image has color, it is quantized with 8 bpp pixels.
- * If the image is essentially grayscale, the pixels are
- * either 4 or 8 bpp, depending on the size of the required
- * colormap.
- * (3) %octlevel = 4 generates a larger colormap and larger
- * compressed image than %octlevel = 3. If image quality is
- * important, you should use %octlevel = 4.
- * (4) If the image already has a colormap, it returns a clone.
- *
- */
-l_ok
-pixQuantizeIfFewColors(PIX *pixs,
- l_int32 maxcolors,
- l_int32 mingraycolors,
- l_int32 octlevel,
- PIX **ppixd)
-{
-l_int32 d, ncolors, iscolor, graycolors;
-PIX *pixg, *pixd;
-
- PROCNAME("pixQuantizeIfFewColors");
-
- if (!ppixd)
- return ERROR_INT("&pixd not defined", procName, 1);
- *ppixd = NULL;
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
- d = pixGetDepth(pixs);
- if (d != 8 && d != 32)
- return ERROR_INT("pixs not defined", procName, 1);
- if (pixGetColormap(pixs) != NULL) {
- *ppixd = pixClone(pixs);
- return 0;
- }
- if (maxcolors <= 0)
- maxcolors = 15; /* default */
- if (maxcolors > 50)
- L_WARNING("maxcolors > 50; very large!\n", procName);
- if (mingraycolors <= 0)
- mingraycolors = 10; /* default */
- if (mingraycolors > 30)
- L_WARNING("mingraycolors > 30; very large!\n", procName);
- if (octlevel != 3 && octlevel != 4) {
- L_WARNING("invalid octlevel; setting to 3\n", procName);
- octlevel = 3;
- }
-
- /* Test the number of colors. For color, the octcube leaves
- * are at level 4. */
- pixColorsForQuantization(pixs, 0, &ncolors, &iscolor, 0);
- if (ncolors > maxcolors)
- return ERROR_INT("too many colors", procName, 1);
-
- /* Quantize!
- * (1) For color:
- * If octlevel == 4, try to quantize to an octree where
- * the octcube leaves are at level 4. If that fails,
- * back off to level 3.
- * If octlevel == 3, quantize to level 3 directly.
- * For level 3, the quality is usually good enough and there
- * is negligible chance of getting more than 256 colors.
- * (2) For grayscale, multiply ncolors by 1.5 for extra quality,
- * but use at least mingraycolors and not more than 256. */
- if (iscolor) {
- pixd = pixFewColorsOctcubeQuant1(pixs, octlevel);
- if (!pixd) { /* backoff */
- pixd = pixFewColorsOctcubeQuant1(pixs, octlevel - 1);
- if (octlevel == 3) /* shouldn't happen */
- L_WARNING("quantized at level 2; low quality\n", procName);
- }
- } else { /* image is really grayscale */
- if (d == 32)
- pixg = pixConvertRGBToLuminance(pixs);
- else
- pixg = pixClone(pixs);
- graycolors = L_MAX(mingraycolors, (l_int32)(1.5 * ncolors));
- graycolors = L_MIN(graycolors, 256);
- if (graycolors < 16)
- pixd = pixThresholdTo4bpp(pixg, graycolors, 1);
- else
- pixd = pixThresholdOn8bpp(pixg, graycolors, 1);
- pixDestroy(&pixg);
- }
- *ppixd = pixd;
-
- if (!pixd)
- return ERROR_INT("pixd not made", procName, 1);
- pixCopyInputFormat(pixd, pixs);
- return 0;
-}
-
-
-
-/*---------------------------------------------------------------------------*
- * Conversion from 16 bpp to 8 bpp *
- *---------------------------------------------------------------------------*/
-/*!
- * \brief pixConvert16To8()
- *
- * \param[in] pixs 16 bpp
- * \param[in] type L_LS_BYTE, L_MS_BYTE, L_AUTO_BYTE, L_CLIP_TO_FF
- * \return pixd 8 bpp, or NULL on error
- *
- *
- * Notes:
- * (1) With L_AUTO_BYTE, if the max pixel value is greater than 255,
- * use the MSB; otherwise, use the LSB.
- * (2) With L_CLIP_TO_FF, use min(pixel-value, 0xff) for each
- * 16-bit src pixel.
- *
- */
-PIX *
-pixConvert16To8(PIX *pixs,
- l_int32 type)
-{
-l_uint16 dword;
-l_int32 w, h, wpls, wpld, i, j, val, use_lsb;
-l_uint32 sword, first, second;
-l_uint32 *datas, *datad, *lines, *lined;
-PIX *pixd;
-
- PROCNAME("pixConvert16To8");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- if (pixGetDepth(pixs) != 16)
- return (PIX *)ERROR_PTR("pixs not 16 bpp", procName, NULL);
- if (type != L_LS_BYTE && type != L_MS_BYTE &&
- type != L_AUTO_BYTE && type != L_CLIP_TO_FF)
- return (PIX *)ERROR_PTR("invalid type", procName, NULL);
-
- pixGetDimensions(pixs, &w, &h, NULL);
- if ((pixd = pixCreate(w, h, 8)) == NULL)
- return (PIX *)ERROR_PTR("pixd not made", procName, NULL);
- pixCopyInputFormat(pixd, pixs);
- pixCopyResolution(pixd, pixs);
- wpls = pixGetWpl(pixs);
- datas = pixGetData(pixs);
- wpld = pixGetWpl(pixd);
- datad = pixGetData(pixd);
-
- if (type == L_AUTO_BYTE) {
- use_lsb = TRUE;
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- for (j = 0; j < wpls; j++) {
- val = GET_DATA_TWO_BYTES(lines, j);
- if (val > 255) {
- use_lsb = FALSE;
- break;
- }
- }
- if (!use_lsb) break;
- }
- type = (use_lsb) ? L_LS_BYTE : L_MS_BYTE;
- }
-
- /* Convert 2 pixels at a time */
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- lined = datad + i * wpld;
- if (type == L_LS_BYTE) {
- for (j = 0; j < wpls; j++) {
- sword = *(lines + j);
- dword = ((sword >> 8) & 0xff00) | (sword & 0xff);
- SET_DATA_TWO_BYTES(lined, j, dword);
- }
- } else if (type == L_MS_BYTE) {
- for (j = 0; j < wpls; j++) {
- sword = *(lines + j);
- dword = ((sword >> 16) & 0xff00) | ((sword >> 8) & 0xff);
- SET_DATA_TWO_BYTES(lined, j, dword);
- }
- } else { /* type == L_CLIP_TO_FF */
- for (j = 0; j < wpls; j++) {
- sword = *(lines + j);
- first = (sword >> 24) ? 255 : ((sword >> 16) & 0xff);
- second = ((sword >> 8) & 0xff) ? 255 : (sword & 0xff);
- dword = (first << 8) | second;
- SET_DATA_TWO_BYTES(lined, j, dword);
- }
- }
- }
-
- return pixd;
-}
-
-
-
-/*---------------------------------------------------------------------------*
- * Conversion from grayscale to false color
- *---------------------------------------------------------------------------*/
-/*!
- * \brief pixConvertGrayToFalseColor()
- *
- * \param[in] pixs 8 or 16 bpp grayscale
- * \param[in] gamma (factor) 0.0 or 1.0 for default; > 1.0 for brighter;
- * 2.0 is quite nice
- * \return pixd 8 bpp with colormap, or NULL on error
- *
- *
- * Notes:
- * (1) For 8 bpp input, this simply adds a colormap to the input image.
- * (2) For 16 bpp input, it first converts to 8 bpp, using the MSB,
- * and then adds the colormap.
- * (3) The colormap is modeled after the Matlab "jet" configuration.
- *
- */
-PIX *
-pixConvertGrayToFalseColor(PIX *pixs,
- l_float32 gamma)
-{
-l_int32 d, i, rval, bval, gval;
-l_int32 *curve;
-l_float32 invgamma, x;
-PIX *pixd;
-PIXCMAP *cmap;
-
- PROCNAME("pixConvertGrayToFalseColor");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- d = pixGetDepth(pixs);
- if (d != 8 && d != 16)
- return (PIX *)ERROR_PTR("pixs not 8 or 16 bpp", procName, NULL);
-
- if (d == 16) {
- pixd = pixConvert16To8(pixs, L_MS_BYTE);
- } else { /* d == 8 */
- if (pixGetColormap(pixs))
- pixd = pixRemoveColormap(pixs, REMOVE_CMAP_TO_GRAYSCALE);
- else
- pixd = pixCopy(NULL, pixs);
- }
- if (!pixd)
- return (PIX *)ERROR_PTR("pixd not made", procName, NULL);
- cmap = pixcmapCreate(8);
- pixSetColormap(pixd, cmap);
- pixCopyResolution(pixd, pixs);
- pixCopyInputFormat(pixd, pixs);
-
- /* Generate curve for transition part of color map */
- curve = (l_int32 *)LEPT_CALLOC(64, sizeof(l_int32));
- if (gamma == 0.0) gamma = 1.0;
- invgamma = 1. / gamma;
- for (i = 0; i < 64; i++) {
- x = (l_float32)i / 64.;
- curve[i] = (l_int32)(255. * powf(x, invgamma) + 0.5);
- }
-
- for (i = 0; i < 256; i++) {
- if (i < 32) {
- rval = 0;
- gval = 0;
- bval = curve[i + 32];
- } else if (i < 96) { /* 32 - 95 */
- rval = 0;
- gval = curve[i - 32];
- bval = 255;
- } else if (i < 160) { /* 96 - 159 */
- rval = curve[i - 96];
- gval = 255;
- bval = curve[159 - i];
- } else if (i < 224) { /* 160 - 223 */
- rval = 255;
- gval = curve[223 - i];
- bval = 0;
- } else { /* 224 - 255 */
- rval = curve[287 - i];
- gval = 0;
- bval = 0;
- }
- pixcmapAddColor(cmap, rval, gval, bval);
- }
-
- LEPT_FREE(curve);
- return pixd;
-}
-
-
-/*---------------------------------------------------------------------------*
- * Unpacking conversion from 1 bpp to 2, 4, 8, 16 and 32 bpp *
- *---------------------------------------------------------------------------*/
-/*!
- * \brief pixUnpackBinary()
- *
- * \param[in] pixs 1 bpp
- * \param[in] depth of destination: 2, 4, 8, 16 or 32 bpp
- * \param[in] invert 0: binary 0 --> grayscale 0
- * binary 1 --> grayscale 0xff...
- * 1: binary 0 --> grayscale 0xff...
- * binary 1 --> grayscale 0
- * \return pixd 2, 4, 8, 16 or 32 bpp, or NULL on error
- *
- *
- * Notes:
- * (1) This function calls special cases of pixConvert1To*(),
- * for 2, 4, 8, 16 and 32 bpp destinations.
- *
- */
-PIX *
-pixUnpackBinary(PIX *pixs,
- l_int32 depth,
- l_int32 invert)
-{
-PIX *pixd;
-
- PROCNAME("pixUnpackBinary");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- if (pixGetDepth(pixs) != 1)
- return (PIX *)ERROR_PTR("pixs not 1 bpp", procName, NULL);
- if (depth != 2 && depth != 4 && depth != 8 && depth != 16 && depth != 32)
- return (PIX *)ERROR_PTR("depth not 2, 4, 8, 16 or 32 bpp",
- procName, NULL);
-
- if (depth == 2) {
- if (invert == 0)
- pixd = pixConvert1To2(NULL, pixs, 0, 3);
- else /* invert bits */
- pixd = pixConvert1To2(NULL, pixs, 3, 0);
- } else if (depth == 4) {
- if (invert == 0)
- pixd = pixConvert1To4(NULL, pixs, 0, 15);
- else /* invert bits */
- pixd = pixConvert1To4(NULL, pixs, 15, 0);
- } else if (depth == 8) {
- if (invert == 0)
- pixd = pixConvert1To8(NULL, pixs, 0, 255);
- else /* invert bits */
- pixd = pixConvert1To8(NULL, pixs, 255, 0);
- } else if (depth == 16) {
- if (invert == 0)
- pixd = pixConvert1To16(NULL, pixs, 0, 0xffff);
- else /* invert bits */
- pixd = pixConvert1To16(NULL, pixs, 0xffff, 0);
- } else {
- if (invert == 0)
- pixd = pixConvert1To32(NULL, pixs, 0, 0xffffffff);
- else /* invert bits */
- pixd = pixConvert1To32(NULL, pixs, 0xffffffff, 0);
- }
-
- pixCopyInputFormat(pixd, pixs);
- return pixd;
-}
-
-
-/*!
- * \brief pixConvert1To16()
- *
- * \param[in] pixd [optional] 16 bpp, can be null
- * \param[in] pixs 1 bpp
- * \param[in] val0 16 bit value to be used for 0s in pixs
- * \param[in] val1 16 bit value to be used for 1s in pixs
- * \return pixd 16 bpp
- *
- *
- * Notes:
- * (1) If pixd is null, a new pix is made.
- * (2) If pixd is not null, it must be of equal width and height
- * as pixs. It is always returned.
- *
- */
-PIX *
-pixConvert1To16(PIX *pixd,
- PIX *pixs,
- l_uint16 val0,
- l_uint16 val1)
-{
-l_int32 w, h, i, j, dibit, ndibits, wpls, wpld;
-l_uint16 val[2];
-l_uint32 index;
-l_uint32 *tab, *datas, *datad, *lines, *lined;
-
- PROCNAME("pixConvert1To16");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- if (pixGetDepth(pixs) != 1)
- return (PIX *)ERROR_PTR("pixs not 1 bpp", procName, NULL);
-
- pixGetDimensions(pixs, &w, &h, NULL);
- if (pixd) {
- if (w != pixGetWidth(pixd) || h != pixGetHeight(pixd))
- return (PIX *)ERROR_PTR("pix sizes unequal", procName, pixd);
- if (pixGetDepth(pixd) != 16)
- return (PIX *)ERROR_PTR("pixd not 16 bpp", procName, pixd);
- } else {
- if ((pixd = pixCreate(w, h, 16)) == NULL)
- return (PIX *)ERROR_PTR("pixd not made", procName, NULL);
- }
- pixCopyResolution(pixd, pixs);
- pixCopyInputFormat(pixd, pixs);
-
- /* Use a table to convert 2 src bits at a time */
- tab = (l_uint32 *)LEPT_CALLOC(4, sizeof(l_uint32));
- val[0] = val0;
- val[1] = val1;
- for (index = 0; index < 4; index++) {
- tab[index] = (val[(index >> 1) & 1] << 16) | val[index & 1];
- }
-
- datas = pixGetData(pixs);
- wpls = pixGetWpl(pixs);
- datad = pixGetData(pixd);
- wpld = pixGetWpl(pixd);
- ndibits = (w + 1) / 2;
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- lined = datad + i * wpld;
- for (j = 0; j < ndibits; j++) {
- dibit = GET_DATA_DIBIT(lines, j);
- lined[j] = tab[dibit];
- }
- }
-
- LEPT_FREE(tab);
- return pixd;
-}
-
-
-/*!
- * \brief pixConvert1To32()
- *
- * \param[in] pixd [optional] 32 bpp, can be null
- * \param[in] pixs 1 bpp
- * \param[in] val0 32 bit value to be used for 0s in pixs
- * \param[in] val1 32 bit value to be used for 1s in pixs
- * \return pixd 32 bpp
- *
- *
- * Notes:
- * (1) If pixd is null, a new pix is made.
- * (2) If pixd is not null, it must be of equal width and height
- * as pixs. It is always returned.
- *
- */
-PIX *
-pixConvert1To32(PIX *pixd,
- PIX *pixs,
- l_uint32 val0,
- l_uint32 val1)
-{
-l_int32 w, h, i, j, wpls, wpld, bit;
-l_uint32 val[2];
-l_uint32 *datas, *datad, *lines, *lined;
-
- PROCNAME("pixConvert1To32");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- if (pixGetDepth(pixs) != 1)
- return (PIX *)ERROR_PTR("pixs not 1 bpp", procName, NULL);
-
- pixGetDimensions(pixs, &w, &h, NULL);
- if (pixd) {
- if (w != pixGetWidth(pixd) || h != pixGetHeight(pixd))
- return (PIX *)ERROR_PTR("pix sizes unequal", procName, pixd);
- if (pixGetDepth(pixd) != 32)
- return (PIX *)ERROR_PTR("pixd not 32 bpp", procName, pixd);
- } else {
- if ((pixd = pixCreate(w, h, 32)) == NULL)
- return (PIX *)ERROR_PTR("pixd not made", procName, NULL);
- }
- pixCopyResolution(pixd, pixs);
- pixCopyInputFormat(pixd, pixs);
-
- val[0] = val0;
- val[1] = val1;
- datas = pixGetData(pixs);
- wpls = pixGetWpl(pixs);
- datad = pixGetData(pixd);
- wpld = pixGetWpl(pixd);
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- lined = datad + i * wpld;
- for (j = 0; j
- * Notes:
- * (1) Input 0 is mapped to (255, 255, 255); 1 is mapped to (0, 0, 0)
- *
- */
-PIX *
-pixConvert1To2Cmap(PIX *pixs)
-{
-PIX *pixd;
-PIXCMAP *cmap;
-
- PROCNAME("pixConvert1To2Cmap");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- if (pixGetDepth(pixs) != 1)
- return (PIX *)ERROR_PTR("pixs not 1 bpp", procName, NULL);
-
- if ((pixd = pixConvert1To2(NULL, pixs, 0, 1)) == NULL)
- return (PIX *)ERROR_PTR("pixd not made", procName, NULL);
- cmap = pixcmapCreate(2);
- pixcmapAddColor(cmap, 255, 255, 255);
- pixcmapAddColor(cmap, 0, 0, 0);
- pixSetColormap(pixd, cmap);
- pixCopyInputFormat(pixd, pixs);
-
- return pixd;
-}
-
-
-/*!
- * \brief pixConvert1To2()
- *
- * \param[in] pixd [optional] 2 bpp, can be null
- * \param[in] pixs 1 bpp
- * \param[in] val0 2 bit value to be used for 0s in pixs
- * \param[in] val1 2 bit value to be used for 1s in pixs
- * \return pixd 2 bpp
- *
- *
- * Notes:
- * (1) If pixd is null, a new pix is made.
- * (2) If pixd is not null, it must be of equal width and height
- * as pixs. It is always returned.
- * (3) A simple unpacking might use val0 = 0 and val1 = 3.
- * (4) If you want a colormapped pixd, use pixConvert1To2Cmap().
- *
- */
-PIX *
-pixConvert1To2(PIX *pixd,
- PIX *pixs,
- l_int32 val0,
- l_int32 val1)
-{
-l_int32 w, h, i, j, byteval, nbytes, wpls, wpld;
-l_uint8 val[2];
-l_uint32 index;
-l_uint16 *tab;
-l_uint32 *datas, *datad, *lines, *lined;
-
- PROCNAME("pixConvert1To2");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, pixd);
- if (pixGetDepth(pixs) != 1)
- return (PIX *)ERROR_PTR("pixs not 1 bpp", procName, pixd);
-
- pixGetDimensions(pixs, &w, &h, NULL);
- if (pixd) {
- if (w != pixGetWidth(pixd) || h != pixGetHeight(pixd))
- return (PIX *)ERROR_PTR("pix sizes unequal", procName, pixd);
- if (pixGetDepth(pixd) != 2)
- return (PIX *)ERROR_PTR("pixd not 2 bpp", procName, pixd);
- } else {
- if ((pixd = pixCreate(w, h, 2)) == NULL)
- return (PIX *)ERROR_PTR("pixd not made", procName, NULL);
- }
- pixCopyResolution(pixd, pixs);
- pixCopyInputFormat(pixd, pixs);
-
- /* Use a table to convert 8 src bits to 16 dest bits */
- tab = (l_uint16 *)LEPT_CALLOC(256, sizeof(l_uint16));
- val[0] = val0;
- val[1] = val1;
- for (index = 0; index < 256; index++) {
- tab[index] = (val[(index >> 7) & 1] << 14) |
- (val[(index >> 6) & 1] << 12) |
- (val[(index >> 5) & 1] << 10) |
- (val[(index >> 4) & 1] << 8) |
- (val[(index >> 3) & 1] << 6) |
- (val[(index >> 2) & 1] << 4) |
- (val[(index >> 1) & 1] << 2) | val[index & 1];
- }
-
- datas = pixGetData(pixs);
- wpls = pixGetWpl(pixs);
- datad = pixGetData(pixd);
- wpld = pixGetWpl(pixd);
- nbytes = (w + 7) / 8;
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- lined = datad + i * wpld;
- for (j = 0; j < nbytes; j++) {
- byteval = GET_DATA_BYTE(lines, j);
- SET_DATA_TWO_BYTES(lined, j, tab[byteval]);
- }
- }
-
- LEPT_FREE(tab);
- return pixd;
-}
-
-
-/*---------------------------------------------------------------------------*
- * Conversion from 1 bpp to 4 bpp *
- *---------------------------------------------------------------------------*/
-/*!
- * \brief pixConvert1To4Cmap()
- *
- * \param[in] pixs 1 bpp
- * \return pixd 4 bpp, cmapped
- *
- *
- * Notes:
- * (1) Input 0 is mapped to (255, 255, 255); 1 is mapped to (0, 0, 0)
- *
- */
-PIX *
-pixConvert1To4Cmap(PIX *pixs)
-{
-PIX *pixd;
-PIXCMAP *cmap;
-
- PROCNAME("pixConvert1To4Cmap");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- if (pixGetDepth(pixs) != 1)
- return (PIX *)ERROR_PTR("pixs not 1 bpp", procName, NULL);
-
- if ((pixd = pixConvert1To4(NULL, pixs, 0, 1)) == NULL)
- return (PIX *)ERROR_PTR("pixd not made", procName, NULL);
- cmap = pixcmapCreate(4);
- pixcmapAddColor(cmap, 255, 255, 255);
- pixcmapAddColor(cmap, 0, 0, 0);
- pixSetColormap(pixd, cmap);
- pixCopyInputFormat(pixd, pixs);
-
- return pixd;
-}
-
-
-/*!
- * \brief pixConvert1To4()
- *
- * \param[in] pixd [optional] 4 bpp, can be null
- * \param[in] pixs 1 bpp
- * \param[in] val0 4 bit value to be used for 0s in pixs
- * \param[in] val1 4 bit value to be used for 1s in pixs
- * \return pixd 4 bpp
- *
- *
- * Notes:
- * (1) If pixd is null, a new pix is made.
- * (2) If pixd is not null, it must be of equal width and height
- * as pixs. It is always returned.
- * (3) A simple unpacking might use val0 = 0 and val1 = 15, or v.v.
- * (4) If you want a colormapped pixd, use pixConvert1To4Cmap().
- *
- */
-PIX *
-pixConvert1To4(PIX *pixd,
- PIX *pixs,
- l_int32 val0,
- l_int32 val1)
-{
-l_int32 w, h, i, j, byteval, nbytes, wpls, wpld;
-l_uint8 val[2];
-l_uint32 index;
-l_uint32 *tab, *datas, *datad, *lines, *lined;
-
- PROCNAME("pixConvert1To4");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, pixd);
- if (pixGetDepth(pixs) != 1)
- return (PIX *)ERROR_PTR("pixs not 1 bpp", procName, pixd);
-
- pixGetDimensions(pixs, &w, &h, NULL);
- if (pixd) {
- if (w != pixGetWidth(pixd) || h != pixGetHeight(pixd))
- return (PIX *)ERROR_PTR("pix sizes unequal", procName, pixd);
- if (pixGetDepth(pixd) != 4)
- return (PIX *)ERROR_PTR("pixd not 4 bpp", procName, pixd);
- } else {
- if ((pixd = pixCreate(w, h, 4)) == NULL)
- return (PIX *)ERROR_PTR("pixd not made", procName, NULL);
- }
- pixCopyResolution(pixd, pixs);
- pixCopyInputFormat(pixd, pixs);
-
- /* Use a table to convert 8 src bits to 32 bit dest word */
- tab = (l_uint32 *)LEPT_CALLOC(256, sizeof(l_uint32));
- val[0] = val0;
- val[1] = val1;
- for (index = 0; index < 256; index++) {
- tab[index] = (val[(index >> 7) & 1] << 28) |
- (val[(index >> 6) & 1] << 24) |
- (val[(index >> 5) & 1] << 20) |
- (val[(index >> 4) & 1] << 16) |
- (val[(index >> 3) & 1] << 12) |
- (val[(index >> 2) & 1] << 8) |
- (val[(index >> 1) & 1] << 4) | val[index & 1];
- }
-
- datas = pixGetData(pixs);
- wpls = pixGetWpl(pixs);
- datad = pixGetData(pixd);
- wpld = pixGetWpl(pixd);
- nbytes = (w + 7) / 8;
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- lined = datad + i * wpld;
- for (j = 0; j < nbytes; j++) {
- byteval = GET_DATA_BYTE(lines, j);
- lined[j] = tab[byteval];
- }
- }
-
- LEPT_FREE(tab);
- return pixd;
-}
-
-
-/*---------------------------------------------------------------------------*
- * Conversion from 1, 2 and 4 bpp to 8 bpp *
- *---------------------------------------------------------------------------*/
-/*!
- * \brief pixConvert1To8Cmap()
- *
- * \param[in] pixs 1 bpp
- * \return pixd 8 bpp, cmapped
- *
- *
- * Notes:
- * (1) Input 0 is mapped to (255, 255, 255); 1 is mapped to (0, 0, 0)
- *
- */
-PIX *
-pixConvert1To8Cmap(PIX *pixs)
-{
-PIX *pixd;
-PIXCMAP *cmap;
-
- PROCNAME("pixConvert1To8Cmap");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- if (pixGetDepth(pixs) != 1)
- return (PIX *)ERROR_PTR("pixs not 1 bpp", procName, NULL);
-
- if ((pixd = pixConvert1To8(NULL, pixs, 0, 1)) == NULL)
- return (PIX *)ERROR_PTR("pixd not made", procName, NULL);
- cmap = pixcmapCreate(8);
- pixcmapAddColor(cmap, 255, 255, 255);
- pixcmapAddColor(cmap, 0, 0, 0);
- pixSetColormap(pixd, cmap);
- pixCopyInputFormat(pixd, pixs);
- return pixd;
-}
-
-
-/*!
- * \brief pixConvert1To8()
- *
- * \param[in] pixd [optional] 8 bpp, can be null
- * \param[in] pixs 1 bpp
- * \param[in] val0 8 bit value to be used for 0s in pixs
- * \param[in] val1 8 bit value to be used for 1s in pixs
- * \return pixd 8 bpp
- *
- *
- * Notes:
- * (1) If pixd is null, a new pix is made.
- * (2) If pixd is not null, it must be of equal width and height
- * as pixs. It is always returned.
- * (3) A simple unpacking might use val0 = 0 and val1 = 255, or v.v.
- * (4) To have a colormap associated with the 8 bpp pixd,
- * use pixConvert1To8Cmap().
- *
- */
-PIX *
-pixConvert1To8(PIX *pixd,
- PIX *pixs,
- l_uint8 val0,
- l_uint8 val1)
-{
-l_int32 w, h, i, j, qbit, nqbits, wpls, wpld;
-l_uint8 val[2];
-l_uint32 index;
-l_uint32 *tab, *datas, *datad, *lines, *lined;
-
- PROCNAME("pixConvert1To8");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, pixd);
- if (pixGetDepth(pixs) != 1)
- return (PIX *)ERROR_PTR("pixs not 1 bpp", procName, pixd);
-
- pixGetDimensions(pixs, &w, &h, NULL);
- if (pixd) {
- if (w != pixGetWidth(pixd) || h != pixGetHeight(pixd))
- return (PIX *)ERROR_PTR("pix sizes unequal", procName, pixd);
- if (pixGetDepth(pixd) != 8)
- return (PIX *)ERROR_PTR("pixd not 8 bpp", procName, pixd);
- } else {
- if ((pixd = pixCreate(w, h, 8)) == NULL)
- return (PIX *)ERROR_PTR("pixd not made", procName, NULL);
- }
- pixCopyResolution(pixd, pixs);
- pixCopyInputFormat(pixd, pixs);
- pixSetPadBits(pixs, 0);
-
- /* Use a table to convert 4 src bits at a time */
- tab = (l_uint32 *)LEPT_CALLOC(16, sizeof(l_uint32));
- val[0] = val0;
- val[1] = val1;
- for (index = 0; index < 16; index++) {
- tab[index] = ((l_uint32)val[(index >> 3) & 1] << 24) |
- (val[(index >> 2) & 1] << 16) |
- (val[(index >> 1) & 1] << 8) | val[index & 1];
- }
-
- datas = pixGetData(pixs);
- wpls = pixGetWpl(pixs);
- datad = pixGetData(pixd);
- wpld = pixGetWpl(pixd);
- nqbits = (w + 3) / 4;
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- lined = datad + i * wpld;
- for (j = 0; j < nqbits; j++) {
- qbit = GET_DATA_QBIT(lines, j);
- lined[j] = tab[qbit];
- }
- }
-
- LEPT_FREE(tab);
- return pixd;
-}
-
-
-/*!
- * \brief pixConvert2To8()
- *
- * \param[in] pixs 2 bpp
- * \param[in] val0 8 bit value to be used for 00 in pixs
- * \param[in] val1 8 bit value to be used for 01 in pixs
- * \param[in] val2 8 bit value to be used for 10 in pixs
- * \param[in] val3 8 bit value to be used for 11 in pixs
- * \param[in] cmapflag TRUE if pixd is to have a colormap; FALSE otherwise
- * \return pixd 8 bpp, or NULL on error
- *
- *
- * Notes:
- * ~ A simple unpacking might use val0 = 0,
- * val1 = 85 (0x55), val2 = 170 (0xaa), val3 = 255.
- * ~ If cmapflag is TRUE:
- * ~ The 8 bpp image is made with a colormap.
- * ~ If pixs has a colormap, the input values are ignored and
- * the 8 bpp image is made using the colormap
- * ~ If pixs does not have a colormap, the input values are
- * used to build the colormap.
- * ~ If cmapflag is FALSE:
- * ~ The 8 bpp image is made without a colormap.
- * ~ If pixs has a colormap, the input values are ignored,
- * the colormap is removed, and the values stored in the 8 bpp
- * image are from the colormap.
- * ~ If pixs does not have a colormap, the input values are
- * used to populate the 8 bpp image.
- *
- */
-PIX *
-pixConvert2To8(PIX *pixs,
- l_uint8 val0,
- l_uint8 val1,
- l_uint8 val2,
- l_uint8 val3,
- l_int32 cmapflag)
-{
-l_int32 w, h, i, j, nbytes, wpls, wpld, dibit, byte;
-l_uint8 val[4];
-l_uint32 index;
-l_uint32 *tab, *datas, *datad, *lines, *lined;
-PIX *pixd;
-PIXCMAP *cmaps, *cmapd;
-
- PROCNAME("pixConvert2To8");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- if (pixGetDepth(pixs) != 2)
- return (PIX *)ERROR_PTR("pixs not 2 bpp", procName, NULL);
-
- cmaps = pixGetColormap(pixs);
- if (cmaps && cmapflag == FALSE)
- return pixRemoveColormap(pixs, REMOVE_CMAP_TO_GRAYSCALE);
-
- pixGetDimensions(pixs, &w, &h, NULL);
- if ((pixd = pixCreate(w, h, 8)) == NULL)
- return (PIX *)ERROR_PTR("pixd not made", procName, NULL);
- pixSetPadBits(pixs, 0);
- pixCopyResolution(pixd, pixs);
- pixCopyInputFormat(pixd, pixs);
- datas = pixGetData(pixs);
- wpls = pixGetWpl(pixs);
- datad = pixGetData(pixd);
- wpld = pixGetWpl(pixd);
-
- if (cmapflag == TRUE) { /* pixd will have a colormap */
- if (cmaps) { /* use the existing colormap from pixs */
- cmapd = pixcmapConvertTo8(cmaps);
- } else { /* make a colormap from the input values */
- cmapd = pixcmapCreate(8);
- pixcmapAddColor(cmapd, val0, val0, val0);
- pixcmapAddColor(cmapd, val1, val1, val1);
- pixcmapAddColor(cmapd, val2, val2, val2);
- pixcmapAddColor(cmapd, val3, val3, val3);
- }
- pixSetColormap(pixd, cmapd);
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- lined = datad + i * wpld;
- for (j = 0; j < w; j++) {
- dibit = GET_DATA_DIBIT(lines, j);
- SET_DATA_BYTE(lined, j, dibit);
- }
- }
- return pixd;
- }
-
- /* Last case: no colormap in either pixs or pixd.
- * Use input values and build a table to convert 1 src byte
- * (4 src pixels) at a time */
- tab = (l_uint32 *)LEPT_CALLOC(256, sizeof(l_uint32));
- val[0] = val0;
- val[1] = val1;
- val[2] = val2;
- val[3] = val3;
- for (index = 0; index < 256; index++) {
- tab[index] = (val[(index >> 6) & 3] << 24) |
- (val[(index >> 4) & 3] << 16) |
- (val[(index >> 2) & 3] << 8) | val[index & 3];
- }
-
- nbytes = (w + 3) / 4;
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- lined = datad + i * wpld;
- for (j = 0; j < nbytes; j++) {
- byte = GET_DATA_BYTE(lines, j);
- lined[j] = tab[byte];
- }
- }
-
- LEPT_FREE(tab);
- return pixd;
-}
-
-
-/*!
- * \brief pixConvert4To8()
- *
- * \param[in] pixs 4 bpp
- * \param[in] cmapflag TRUE if pixd is to have a colormap; FALSE otherwise
- * \return pixd 8 bpp, or NULL on error
- *
- *
- * Notes:
- * ~ If cmapflag is TRUE:
- * ~ pixd is made with a colormap.
- * ~ If pixs has a colormap, it is copied and the colormap
- * index values are placed in pixd.
- * ~ If pixs does not have a colormap, a colormap with linear
- * trc is built and the pixel values in pixs are placed in
- * pixd as colormap index values.
- * ~ If cmapflag is FALSE:
- * ~ pixd is made without a colormap.
- * ~ If pixs has a colormap, it is removed and the values stored
- * in pixd are from the colormap (converted to gray).
- * ~ If pixs does not have a colormap, the pixel values in pixs
- * are used, with shift replication, to populate pixd.
- *
- */
-PIX *
-pixConvert4To8(PIX *pixs,
- l_int32 cmapflag)
-{
-l_int32 w, h, i, j, wpls, wpld, byte, qbit;
-l_uint32 *datas, *datad, *lines, *lined;
-PIX *pixd;
-PIXCMAP *cmaps, *cmapd;
-
- PROCNAME("pixConvert4To8");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- if (pixGetDepth(pixs) != 4)
- return (PIX *)ERROR_PTR("pixs not 4 bpp", procName, NULL);
-
- cmaps = pixGetColormap(pixs);
- if (cmaps && cmapflag == FALSE)
- return pixRemoveColormap(pixs, REMOVE_CMAP_TO_GRAYSCALE);
-
- pixGetDimensions(pixs, &w, &h, NULL);
- if ((pixd = pixCreate(w, h, 8)) == NULL)
- return (PIX *)ERROR_PTR("pixd not made", procName, NULL);
- pixCopyResolution(pixd, pixs);
- pixCopyInputFormat(pixd, pixs);
- datas = pixGetData(pixs);
- wpls = pixGetWpl(pixs);
- datad = pixGetData(pixd);
- wpld = pixGetWpl(pixd);
-
- if (cmapflag == TRUE) { /* pixd will have a colormap */
- if (cmaps) { /* use the existing colormap from pixs */
- cmapd = pixcmapConvertTo8(cmaps);
- } else { /* make a colormap with a linear trc */
- cmapd = pixcmapCreate(8);
- for (i = 0; i < 16; i++)
- pixcmapAddColor(cmapd, 17 * i, 17 * i, 17 * i);
- }
- pixSetColormap(pixd, cmapd);
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- lined = datad + i * wpld;
- for (j = 0; j < w; j++) {
- qbit = GET_DATA_QBIT(lines, j);
- SET_DATA_BYTE(lined, j, qbit);
- }
- }
- return pixd;
- }
-
- /* Last case: no colormap in either pixs or pixd.
- * Replicate the qbit value into 8 bits. */
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- lined = datad + i * wpld;
- for (j = 0; j < w; j++) {
- qbit = GET_DATA_QBIT(lines, j);
- byte = (qbit << 4) | qbit;
- SET_DATA_BYTE(lined, j, byte);
- }
- }
- return pixd;
-}
-
-
-
-/*---------------------------------------------------------------------------*
- * Unpacking conversion from 8 bpp to 16 bpp *
- *---------------------------------------------------------------------------*/
-/*!
- * \brief pixConvert8To16()
- *
- * \param[in] pixs 8 bpp; colormap removed to gray
- * \param[in] leftshift number of bits: 0 is no shift;
- * 8 replicates in MSB and LSB of dest
- * \return pixd 16 bpp, or NULL on error
- *
- *
- * Notes:
- * (1) For left shift of 8, the 8 bit value is replicated in both
- * the MSB and the LSB of the pixels in pixd. That way, we get
- * proportional mapping, with a correct map from 8 bpp white
- * (0xff) to 16 bpp white (0xffff).
- *
- */
-PIX *
-pixConvert8To16(PIX *pixs,
- l_int32 leftshift)
-{
-l_int32 i, j, w, h, d, wplt, wpld, val;
-l_uint32 *datat, *datad, *linet, *lined;
-PIX *pixt, *pixd;
-
- PROCNAME("pixConvert8To16");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- pixGetDimensions(pixs, &w, &h, &d);
- if (d != 8)
- return (PIX *)ERROR_PTR("pixs not 8 bpp", procName, NULL);
- if (leftshift < 0 || leftshift > 8)
- return (PIX *)ERROR_PTR("leftshift not in [0 ... 8]", procName, NULL);
-
- if (pixGetColormap(pixs) != NULL)
- pixt = pixRemoveColormap(pixs, REMOVE_CMAP_TO_GRAYSCALE);
- else
- pixt = pixClone(pixs);
-
- pixd = pixCreate(w, h, 16);
- pixCopyResolution(pixd, pixs);
- pixCopyInputFormat(pixd, pixs);
- datat = pixGetData(pixt);
- datad = pixGetData(pixd);
- wplt = pixGetWpl(pixt);
- wpld = pixGetWpl(pixd);
- for (i = 0; i < h; i++) {
- linet = datat + i * wplt;
- lined = datad + i * wpld;
- for (j = 0; j < w; j++) {
- val = GET_DATA_BYTE(linet, j);
- if (leftshift == 8)
- val = val | (val << leftshift);
- else
- val <<= leftshift;
- SET_DATA_TWO_BYTES(lined, j, val);
- }
- }
-
- pixDestroy(&pixt);
- return pixd;
-}
-
-
-/*---------------------------------------------------------------------------*
- * Top-level conversion to 2 bpp *
- *---------------------------------------------------------------------------*/
-/*!
- * \brief pixConvertTo2()
- *
- * \param[in] pixs 1, 2, 4, 8, 32 bpp; colormap OK but will be removed
- * \return pixd 2 bpp, or NULL on error
- *
- *
- * Notes:
- * (1) This is a top-level function, with simple default values
- * used in pixConvertTo8() if unpacking is necessary.
- * (2) Any existing colormap is removed; the result is always gray.
- * (3) If the input image has 2 bpp and no colormap, the operation is
- * lossless and a copy is returned.
- *
- */
-PIX *
-pixConvertTo2(PIX *pixs)
-{
-l_int32 d;
-PIX *pix1, *pix2, *pix3, *pixd;
-
- PROCNAME("pixConvertTo2");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- d = pixGetDepth(pixs);
- if (d != 1 && d != 2 && d != 4 && d != 8 && d != 32)
- return (PIX *)ERROR_PTR("depth not {1,2,4,8,32}", procName, NULL);
-
- if (pixGetColormap(pixs) != NULL) {
- pix1 = pixRemoveColormap(pixs, REMOVE_CMAP_TO_GRAYSCALE);
- d = pixGetDepth(pix1);
- } else {
- pix1 = pixCopy(NULL, pixs);
- }
- if (d == 32)
- pix2 = pixConvertTo8(pix1, FALSE);
- else
- pix2 = pixClone(pix1);
- pixDestroy(&pix1);
- if (d == 1) {
- pixd = pixConvert1To2(NULL, pix2, 3, 0);
- } else if (d == 2) {
- pixd = pixClone(pix2);
- } else if (d == 4) {
- pix3 = pixConvert4To8(pix2, FALSE); /* unpack to 8 */
- pixd = pixConvert8To2(pix3);
- pixDestroy(&pix3);
- } else { /* d == 8 */
- pixd = pixConvert8To2(pix2);
- }
- pixDestroy(&pix2);
- return pixd;
-}
-
-
-/*!
- * \brief pixConvert8To2()
- *
- * \param[in] pix 8 bpp; colormap OK
- * \return pixd 2 bpp, or NULL on error
- *
- *
- * Notes:
- * (1) Any existing colormap is removed to gray.
- *
- */
-PIX *
-pixConvert8To2(PIX *pix)
-{
-l_int32 i, j, w, h, wpls, wpld;
-l_uint32 word;
-l_uint32 *datas, *lines, *datad, *lined;
-PIX *pixs, *pixd;
-
- PROCNAME("pixConvert8To2");
-
- if (!pix || pixGetDepth(pix) != 8)
- return (PIX *)ERROR_PTR("pix undefined or not 8 bpp", procName, NULL);
-
- if (pixGetColormap(pix) != NULL)
- pixs = pixRemoveColormap(pix, REMOVE_CMAP_TO_GRAYSCALE);
- else
- pixs = pixClone(pix);
- pixGetDimensions(pixs, &w, &h, NULL);
- datas = pixGetData(pixs);
- wpls = pixGetWpl(pixs);
- pixd = pixCreate(w, h, 2);
- datad = pixGetData(pixd);
- wpld = pixGetWpl(pixd);
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- lined = datad + i * wpld;
- for (j = 0; j < wpls; j++) { /* march through 4 pixels at a time */
- word = lines[j] & 0xc0c0c0c0; /* top 2 bits of each byte */
- word = (word >> 24) | ((word & 0xff0000) >> 18) |
- ((word & 0xff00) >> 12) | ((word & 0xff) >> 6);
- SET_DATA_BYTE(lined, j, word); /* only LS byte is filled */
- }
- }
- pixDestroy(&pixs);
- return pixd;
-}
-
-
-/*---------------------------------------------------------------------------*
- * Top-level conversion to 4 bpp *
- *---------------------------------------------------------------------------*/
-/*!
- * \brief pixConvertTo4()
- *
- * \param[in] pixs 1, 2, 4, 8, 32 bpp; colormap OK but will be removed
- * \return pixd 4 bpp, or NULL on error
- *
- *
- * Notes:
- * (1) This is a top-level function, with simple default values
- * used in pixConvertTo8() if unpacking is necessary.
- * (2) Any existing colormap is removed; the result is always gray.
- * (3) If the input image has 4 bpp and no colormap, the operation is
- * lossless and a copy is returned.
- *
- */
-PIX *
-pixConvertTo4(PIX *pixs)
-{
-l_int32 d;
-PIX *pix1, *pix2, *pix3, *pixd;
-
- PROCNAME("pixConvertTo4");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- d = pixGetDepth(pixs);
- if (d != 1 && d != 2 && d != 4 && d != 8 && d != 32)
- return (PIX *)ERROR_PTR("depth not {1,2,4,8,32}", procName, NULL);
-
- if (pixGetColormap(pixs) != NULL) {
- pix1 = pixRemoveColormap(pixs, REMOVE_CMAP_TO_GRAYSCALE);
- d = pixGetDepth(pix1);
- } else {
- pix1 = pixCopy(NULL, pixs);
- }
- if (d == 32)
- pix2 = pixConvertTo8(pix1, FALSE);
- else
- pix2 = pixClone(pix1);
- pixDestroy(&pix1);
- if (d == 1) {
- pixd = pixConvert1To4(NULL, pix2, 15, 0);
- } else if (d == 2) {
- pix3 = pixConvert2To8(pix2, 0, 0x55, 0xaa, 0xff, FALSE);
- pixd = pixConvert8To4(pix3);
- pixDestroy(&pix3);
- } else if (d == 4) {
- pixd = pixClone(pix2);
- } else { /* d == 8 */
- pixd = pixConvert8To4(pix2);
- }
- pixDestroy(&pix2);
- return pixd;
-}
-
-
-/*!
- * \brief pixConvert8To4()
- *
- * \param[in] pix 8 bpp; colormap OK
- * \return pixd 4 bpp, or NULL on error
- *
- *
- * Notes:
- * (1) Any existing colormap is removed to gray.
- *
- */
-PIX *
-pixConvert8To4(PIX *pix)
-{
-l_int32 i, j, w, h, wpls, wpld, val;
-l_uint32 *datas, *lines, *datad, *lined;
-PIX *pixs, *pixd;
-
- PROCNAME("pixConvert8To4");
-
- if (!pix || pixGetDepth(pix) != 8)
- return (PIX *)ERROR_PTR("pix undefined or not 8 bpp", procName, NULL);
-
- if (pixGetColormap(pix) != NULL)
- pixs = pixRemoveColormap(pix, REMOVE_CMAP_TO_GRAYSCALE);
- else
- pixs = pixClone(pix);
- pixGetDimensions(pixs, &w, &h, NULL);
- datas = pixGetData(pixs);
- wpls = pixGetWpl(pixs);
- pixd = pixCreate(w, h, 4);
- datad = pixGetData(pixd);
- wpld = pixGetWpl(pixd);
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- lined = datad + i * wpld;
- for (j = 0; j < w; j++) {
- val = GET_DATA_BYTE(lines, j);
- val = val >> 4; /* take top 4 bits */
- SET_DATA_QBIT(lined, j, val);
- }
- }
- pixDestroy(&pixs);
- return pixd;
-}
-
-
-/*---------------------------------------------------------------------------*
- * Top-level conversion to 1 bpp *
- *---------------------------------------------------------------------------*/
-/*!
- * \brief pixConvertTo1Adaptive()
- *
- * \param[in] pixs 1, 2, 4, 8, 16 or 32 bpp
- * \return pixd 1 bpp, or NULL on error
- *
- *
- * Notes:
- * (1) This is a top-level function, that uses default values for
- * adaptive thresholding, if necessary. Otherwise, it is the same as
- * pixConvertTo1(), which uses a global threshold for binarization.
- *
- */
-PIX *
-pixConvertTo1Adaptive(PIX *pixs)
-{
-l_int32 d, color0, color1, rval, gval, bval;
-PIX *pix1, *pix2, *pixd;
-PIXCMAP *cmap;
-
- PROCNAME("pixConvertTo1Adaptive");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- d = pixGetDepth(pixs);
- if (d != 1 && d != 2 && d != 4 && d != 8 && d != 16 && d != 32)
- return (PIX *)ERROR_PTR("depth not {1,2,4,8,16,32}", procName, NULL);
-
- cmap = pixGetColormap(pixs);
- if (d == 1) {
- if (!cmap) {
- return pixCopy(NULL, pixs);
- } else { /* strip the colormap off, and invert if reasonable
- for standard binary photometry. */
- pixcmapGetColor(cmap, 0, &rval, &gval, &bval);
- color0 = rval + gval + bval;
- pixcmapGetColor(cmap, 1, &rval, &gval, &bval);
- color1 = rval + gval + bval;
- pixd = pixCopy(NULL, pixs);
- pixDestroyColormap(pixd);
- if (color1 > color0)
- pixInvert(pixd, pixd);
- return pixd;
- }
- }
-
- /* For all other depths, use 8 bpp as an intermediary */
- pix1 = pixConvertTo8(pixs, FALSE);
- pix2 = pixBackgroundNormSimple(pix1, NULL, NULL);
- pixd = pixThresholdToBinary(pix2, 180);
- pixDestroy(&pix1);
- pixDestroy(&pix2);
- return pixd;
-}
-
-
-/*!
- * \brief pixConvertTo1()
- *
- * \param[in] pixs 1, 2, 4, 8, 16 or 32 bpp
- * \param[in] threshold for final binarization, relative to 8 bpp
- * \return pixd 1 bpp, or NULL on error
- *
- *
- * Notes:
- * (1) This is a top-level function, with simple default values
- * used in pixConvertTo8() if unpacking is necessary.
- * (2) Any existing colormap is removed.
- * (3) If the input image has 1 bpp and no colormap, the operation is
- * lossless and a copy is returned.
- *
- */
-PIX *
-pixConvertTo1(PIX *pixs,
- l_int32 threshold)
-{
-l_int32 d, color0, color1, rval, gval, bval;
-PIX *pixg, *pixd;
-PIXCMAP *cmap;
-
- PROCNAME("pixConvertTo1");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- d = pixGetDepth(pixs);
- if (d != 1 && d != 2 && d != 4 && d != 8 && d != 16 && d != 32)
- return (PIX *)ERROR_PTR("depth not {1,2,4,8,16,32}", procName, NULL);
-
- cmap = pixGetColormap(pixs);
- if (d == 1) {
- if (!cmap) {
- return pixCopy(NULL, pixs);
- } else { /* strip the colormap off, and invert if reasonable
- for standard binary photometry. */
- pixcmapGetColor(cmap, 0, &rval, &gval, &bval);
- color0 = rval + gval + bval;
- pixcmapGetColor(cmap, 1, &rval, &gval, &bval);
- color1 = rval + gval + bval;
- pixd = pixCopy(NULL, pixs);
- pixDestroyColormap(pixd);
- if (color1 > color0)
- pixInvert(pixd, pixd);
- return pixd;
- }
- }
-
- /* For all other depths, use 8 bpp as an intermediary */
- pixg = pixConvertTo8(pixs, FALSE);
- pixd = pixThresholdToBinary(pixg, threshold);
- pixDestroy(&pixg);
- return pixd;
-}
-
-
-/*!
- * \brief pixConvertTo1BySampling()
- *
- * \param[in] pixs 1, 2, 4, 8, 16 or 32 bpp
- * \param[in] factor submsampling factor; integer >= 1
- * \param[in] threshold for final binarization, relative to 8 bpp
- * \return pixd 1 bpp, or NULL on error
- *
- *
- * Notes:
- * (1) This is a quick and dirty, top-level converter.
- * (2) See pixConvertTo1() for default values.
- *
- */
-PIX *
-pixConvertTo1BySampling(PIX *pixs,
- l_int32 factor,
- l_int32 threshold)
-{
-l_float32 scalefactor;
-PIX *pixt, *pixd;
-
- PROCNAME("pixConvertTo1BySampling");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- if (factor < 1)
- return (PIX *)ERROR_PTR("factor must be >= 1", procName, NULL);
-
- scalefactor = 1. / (l_float32)factor;
- pixt = pixScaleBySampling(pixs, scalefactor, scalefactor);
- pixd = pixConvertTo1(pixt, threshold);
-
- pixDestroy(&pixt);
- return pixd;
-}
-
-
-/*---------------------------------------------------------------------------*
- * Top-level conversion to 8 bpp *
- *---------------------------------------------------------------------------*/
-/*!
- * \brief pixConvertTo8()
- *
- * \param[in] pixs 1, 2, 4, 8, 16 or 32 bpp
- * \param[in] cmapflag TRUE if pixd is to have a colormap; FALSE otherwise
- * \return pixd 8 bpp, or NULL on error
- *
- *
- * Notes:
- * (1) This is a top-level function, with simple default values
- * for unpacking.
- * (2) The result, pixd, is made with a colormap if specified.
- * It is always a new image -- never a clone. For example,
- * if d == 8, and cmapflag matches the existence of a cmap
- * in pixs, the operation is lossless and it returns a copy.
- * (3) The default values used are:
- * ~ 1 bpp: val0 = 255, val1 = 0
- * ~ 2 bpp: 4 bpp: even increments over dynamic range
- * ~ 8 bpp: lossless if cmap matches cmapflag
- * ~ 16 bpp: use most significant byte
- * (4) If 32 bpp RGB, this is converted to gray. If you want
- * to do color quantization, you must specify the type
- * explicitly, using the color quantization code.
- *
- */
-PIX *
-pixConvertTo8(PIX *pixs,
- l_int32 cmapflag)
-{
-l_int32 d;
-PIX *pixd;
-PIXCMAP *cmap;
-
- PROCNAME("pixConvertTo8");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- d = pixGetDepth(pixs);
- if (d != 1 && d != 2 && d != 4 && d != 8 && d != 16 && d != 32)
- return (PIX *)ERROR_PTR("depth not {1,2,4,8,16,32}", procName, NULL);
-
- if (d == 1) {
- if (cmapflag)
- return pixConvert1To8Cmap(pixs);
- else
- return pixConvert1To8(NULL, pixs, 255, 0);
- } else if (d == 2) {
- return pixConvert2To8(pixs, 0, 85, 170, 255, cmapflag);
- } else if (d == 4) {
- return pixConvert4To8(pixs, cmapflag);
- } else if (d == 8) {
- cmap = pixGetColormap(pixs);
- if ((cmap && cmapflag) || (!cmap && !cmapflag)) {
- return pixCopy(NULL, pixs);
- } else if (cmap) { /* !cmapflag */
- return pixRemoveColormap(pixs, REMOVE_CMAP_TO_GRAYSCALE);
- } else { /* !cmap && cmapflag; add colormap to pixd */
- pixd = pixCopy(NULL, pixs);
- pixAddGrayColormap8(pixd);
- return pixd;
- }
- } else if (d == 16) {
- pixd = pixConvert16To8(pixs, L_MS_BYTE);
- if (cmapflag)
- pixAddGrayColormap8(pixd);
- return pixd;
- } else { /* d == 32 */
- pixd = pixConvertRGBToLuminance(pixs);
- if (cmapflag)
- pixAddGrayColormap8(pixd);
- return pixd;
- }
-}
-
-
-/*!
- * \brief pixConvertTo8BySampling()
- *
- * \param[in] pixs 1, 2, 4, 8, 16 or 32 bpp
- * \param[in] factor submsampling factor; integer >= 1
- * \param[in] cmapflag TRUE if pixd is to have a colormap; FALSE otherwise
- * \return pixd 8 bpp, or NULL on error
- *
- *
- * Notes:
- * (1) This is a fast, quick/dirty, top-level converter.
- * (2) See pixConvertTo8() for default values.
- *
- */
-PIX *
-pixConvertTo8BySampling(PIX *pixs,
- l_int32 factor,
- l_int32 cmapflag)
-{
-l_float32 scalefactor;
-PIX *pixt, *pixd;
-
- PROCNAME("pixConvertTo8BySampling");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- if (factor < 1)
- return (PIX *)ERROR_PTR("factor must be >= 1", procName, NULL);
-
- scalefactor = 1. / (l_float32)factor;
- pixt = pixScaleBySampling(pixs, scalefactor, scalefactor);
- pixd = pixConvertTo8(pixt, cmapflag);
-
- pixDestroy(&pixt);
- return pixd;
-}
-
-
-/*!
- * \brief pixConvertTo8Colormap()
- *
- * \param[in] pixs 1, 2, 4, 8, 16 or 32 bpp
- * \param[in] dither 1 to dither if necessary; 0 otherwise
- * \return pixd 8 bpp, cmapped, or NULL on error
- *
- *
- * Notes:
- * (1) This is a top-level function, with simple default values
- * for unpacking.
- * (2) The result, pixd, is always made with a colormap.
- * (3) If d == 8, the operation is lossless and it returns a copy.
- * (4) The default values used for increasing depth are:
- * ~ 1 bpp: val0 = 255, val1 = 0
- * ~ 2 bpp: 4 bpp: even increments over dynamic range
- * (5) For 16 bpp, use the most significant byte.
- * (6) For 32 bpp RGB, use octcube quantization with optional dithering.
- *
- */
-PIX *
-pixConvertTo8Colormap(PIX *pixs,
- l_int32 dither)
-{
-l_int32 d;
-
- PROCNAME("pixConvertTo8Colormap");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- d = pixGetDepth(pixs);
- if (d != 1 && d != 2 && d != 4 && d != 8 && d != 16 && d != 32)
- return (PIX *)ERROR_PTR("depth not {1,2,4,8,16,32}", procName, NULL);
-
- if (d != 32)
- return pixConvertTo8(pixs, 1);
-
- return pixConvertRGBToColormap(pixs, dither);
-}
-
-
-/*---------------------------------------------------------------------------*
- * Top-level conversion to 16 bpp *
- *---------------------------------------------------------------------------*/
-/*!
- * \brief pixConvertTo16()
- *
- * \param[in] pixs 1, 8 bpp
- * \return pixd 16 bpp, or NULL on error
- *
- * Usage: Top-level function, with simple default values for unpacking.
- * 1 bpp: val0 = 0xffff, val1 = 0
- * 8 bpp: replicates the 8 bit value in both the MSB and LSB
- * of the 16 bit pixel.
- */
-PIX *
-pixConvertTo16(PIX *pixs)
-{
-l_int32 d;
-
- PROCNAME("pixConvertTo16");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
-
- d = pixGetDepth(pixs);
- if (d == 1)
- return pixConvert1To16(NULL, pixs, 0xffff, 0);
- else if (d == 8)
- return pixConvert8To16(pixs, 8);
- else
- return (PIX *)ERROR_PTR("src depth not 1 or 8 bpp", procName, NULL);
-}
-
-
-
-/*---------------------------------------------------------------------------*
- * Top-level conversion to 32 bpp *
- *---------------------------------------------------------------------------*/
-/*!
- * \brief pixConvertTo32()
- *
- * \param[in] pixs 1, 2, 4, 8, 16, 24 or 32 bpp
- * \return pixd 32 bpp, or NULL on error
- *
- * Usage: Top-level function, with simple default values for unpacking.
- * 1 bpp: val0 = 255, val1 = 0
- * and then replication into R, G and B components
- * 2 bpp: if colormapped, use the colormap values; otherwise,
- * use val0 = 0, val1 = 0x55, val2 = 0xaa, val3 = 255
- * and replicate gray into R, G and B components
- * 4 bpp: if colormapped, use the colormap values; otherwise,
- * replicate 2 nybs into a byte, and then into R,G,B components
- * 8 bpp: if colormapped, use the colormap values; otherwise,
- * replicate gray values into R, G and B components
- * 16 bpp: replicate MSB into R, G and B components
- * 24 bpp: unpack the pixels, maintaining word alignment on each scanline
- * 32 bpp: makes a copy
- *
- *
- * Notes:
- * (1) Never returns a clone of pixs.
- *
- */
-PIX *
-pixConvertTo32(PIX *pixs)
-{
-l_int32 d;
-PIX *pix1, *pixd;
-
- PROCNAME("pixConvertTo32");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
-
- d = pixGetDepth(pixs);
- if (d == 1) {
- return pixConvert1To32(NULL, pixs, 0xffffffff, 0);
- } else if (d == 2) {
- pix1 = pixConvert2To8(pixs, 0, 85, 170, 255, TRUE);
- pixd = pixConvert8To32(pix1);
- pixDestroy(&pix1);
- return pixd;
- } else if (d == 4) {
- pix1 = pixConvert4To8(pixs, TRUE);
- pixd = pixConvert8To32(pix1);
- pixDestroy(&pix1);
- return pixd;
- } else if (d == 8) {
- return pixConvert8To32(pixs);
- } else if (d == 16) {
- pix1 = pixConvert16To8(pixs, L_MS_BYTE);
- pixd = pixConvert8To32(pix1);
- pixDestroy(&pix1);
- return pixd;
- } else if (d == 24) {
- return pixConvert24To32(pixs);
- } else if (d == 32) {
- return pixCopy(NULL, pixs);
- } else {
- return (PIX *)ERROR_PTR("depth not 1, 2, 4, 8, 16, 32 bpp",
- procName, NULL);
- }
-}
-
-
-/*!
- * \brief pixConvertTo32BySampling()
- *
- * \param[in] pixs 1, 2, 4, 8, 16, 24 or 32 bpp
- * \param[in] factor submsampling factor; integer >= 1
- * \return pixd 32 bpp, or NULL on error
- *
- *
- * Notes:
- * (1) This is a fast, quick/dirty, top-level converter.
- * (2) See pixConvertTo32() for default values.
- *
- */
-PIX *
-pixConvertTo32BySampling(PIX *pixs,
- l_int32 factor)
-{
-l_float32 scalefactor;
-PIX *pix1, *pixd;
-
- PROCNAME("pixConvertTo32BySampling");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- if (factor < 1)
- return (PIX *)ERROR_PTR("factor must be >= 1", procName, NULL);
-
- scalefactor = 1. / (l_float32)factor;
- pix1 = pixScaleBySampling(pixs, scalefactor, scalefactor);
- pixd = pixConvertTo32(pix1);
-
- pixDestroy(&pix1);
- return pixd;
-}
-
-
-/*!
- * \brief pixConvert8To32()
- *
- * \param[in] pixs 8 bpp
- * \return 32 bpp rgb pix, or NULL on error
- *
- *
- * Notes:
- * (1) If there is no colormap, replicates the gray value
- * into the 3 MSB of the dest pixel.
- *
- */
-PIX *
-pixConvert8To32(PIX *pixs)
-{
-l_int32 i, j, w, h, wpls, wpld, val;
-l_uint32 *datas, *datad, *lines, *lined;
-l_uint32 *tab;
-PIX *pixd;
-
- PROCNAME("pixConvert8To32");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- if (pixGetDepth(pixs) != 8)
- return (PIX *)ERROR_PTR("pixs not 8 bpp", procName, NULL);
-
- if (pixGetColormap(pixs))
- return pixRemoveColormap(pixs, REMOVE_CMAP_TO_FULL_COLOR);
-
- pixGetDimensions(pixs, &w, &h, NULL);
- datas = pixGetData(pixs);
- wpls = pixGetWpl(pixs);
- if ((pixd = pixCreate(w, h, 32)) == NULL)
- return (PIX *)ERROR_PTR("pixd not made", procName, NULL);
- pixCopyResolution(pixd, pixs);
- pixCopyInputFormat(pixd, pixs);
- datad = pixGetData(pixd);
- wpld = pixGetWpl(pixd);
-
- /* Replication table gray --> rgb */
- tab = (l_uint32 *)LEPT_CALLOC(256, sizeof(l_uint32));
- for (i = 0; i < 256; i++)
- tab[i] = (i << 24) | (i << 16) | (i << 8);
-
- /* Replicate 1 --> 4 bytes (alpha byte not set) */
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- lined = datad + i * wpld;
- for (j = 0; j < w; j++) {
- val = GET_DATA_BYTE(lines, j);
- lined[j] = tab[val];
- }
- }
-
- LEPT_FREE(tab);
- return pixd;
-}
-
-
-/*---------------------------------------------------------------------------*
- * Top-level conversion to 8 or 32 bpp, without colormap *
- *---------------------------------------------------------------------------*/
-/*!
- * \brief pixConvertTo8Or32()
- *
- * \param[in] pixs 1, 2, 4, 8, 16, with or without colormap;
- * or 32 bpp rgb
- * \param[in] copyflag L_CLONE or L_COPY
- * \param[in] warnflag 1 to issue warning if colormap is removed; else 0
- * \return pixd 8 bpp grayscale or 32 bpp rgb, or NULL on error
- *
- *
- * Notes:
- * (1) If there is a colormap, the colormap is removed to 8 or 32 bpp,
- * depending on whether the colors in the colormap are all gray.
- * (2) If the input is either rgb or 8 bpp without a colormap,
- * this returns either a clone or a copy, depending on %copyflag.
- * (3) Otherwise, the pix is converted to 8 bpp grayscale.
- * In all cases, pixd does not have a colormap.
- *
- */
-PIX *
-pixConvertTo8Or32(PIX *pixs,
- l_int32 copyflag,
- l_int32 warnflag)
-{
-l_int32 d;
-PIX *pixd;
-
- PROCNAME("pixConvertTo8Or32");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- if (copyflag != L_CLONE && copyflag != L_COPY)
- return (PIX *)ERROR_PTR("invalid copyflag", procName, NULL);
-
- d = pixGetDepth(pixs);
- if (pixGetColormap(pixs)) {
- if (warnflag) L_WARNING("pix has colormap; removing\n", procName);
- pixd = pixRemoveColormap(pixs, REMOVE_CMAP_BASED_ON_SRC);
- } else if (d == 8 || d == 32) {
- if (copyflag == L_CLONE)
- pixd = pixClone(pixs);
- else /* copyflag == L_COPY */
- pixd = pixCopy(NULL, pixs);
- } else {
- pixd = pixConvertTo8(pixs, 0);
- }
-
- /* Sanity check on result */
- d = pixGetDepth(pixd);
- if (d != 8 && d != 32) {
- pixDestroy(&pixd);
- return (PIX *)ERROR_PTR("depth not 8 or 32 bpp", procName, NULL);
- }
-
- return pixd;
-}
-
-
-/*---------------------------------------------------------------------------*
- * Conversion between 24 bpp and 32 bpp rgb *
- *---------------------------------------------------------------------------*/
-/*!
- * \brief pixConvert24To32()
- *
- * \param[in] pixs 24 bpp rgb
- * \return pixd 32 bpp rgb, or NULL on error
- *
- *
- * Notes:
- * (1) 24 bpp rgb pix are not supported in leptonica, except for a small
- * number of formatted write operations. The data is a byte array,
- * with pixels in order r,g,b, and padded to 32 bit boundaries
- * in each line.
- * (2) Because 24 bpp rgb pix are conveniently generated by programs
- * such as xpdf (which has SplashBitmaps that store the raster
- * data in consecutive 24-bit rgb pixels), it is useful to provide
- * 24 bpp pix that simply incorporate that data. The only things
- * we can do with these are:
- * (a) write them to file in png, jpeg, tiff and pnm
- * (b) interconvert between 24 and 32 bpp in memory (for testing).
- *
- */
-PIX *
-pixConvert24To32(PIX *pixs)
-{
-l_uint8 *lines;
-l_int32 w, h, d, i, j, wpls, wpld, rval, gval, bval;
-l_uint32 pixel;
-l_uint32 *datas, *datad, *lined;
-PIX *pixd;
-
- PROCNAME("pixConvert24to32");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- pixGetDimensions(pixs, &w, &h, &d);
- if (d != 24)
- return (PIX *)ERROR_PTR("pixs not 24 bpp", procName, NULL);
-
- pixd = pixCreateNoInit(w, h, 32);
- datas = pixGetData(pixs);
- datad = pixGetData(pixd);
- wpls = pixGetWpl(pixs);
- wpld = pixGetWpl(pixd);
- for (i = 0; i < h; i++) {
- lines = (l_uint8 *)(datas + i * wpls);
- lined = datad + i * wpld;
- for (j = 0; j < w; j++) {
- rval = *lines++;
- gval = *lines++;
- bval = *lines++;
- composeRGBPixel(rval, gval, bval, &pixel);
- lined[j] = pixel;
- }
- }
- pixCopyResolution(pixd, pixs);
- pixCopyInputFormat(pixd, pixs);
- return pixd;
-}
-
-
-/*!
- * \brief pixConvert32To24()
- *
- * \param[in] pixs 32 bpp rgb
- * \return pixd 24 bpp rgb, or NULL on error
- *
- *
- * Notes:
- * (1) See pixconvert24To32().
- *
- */
-PIX *
-pixConvert32To24(PIX *pixs)
-{
-l_uint8 *rgbdata8;
-l_int32 w, h, d, i, j, wpls, wpld, rval, gval, bval;
-l_uint32 *datas, *lines, *rgbdata;
-PIX *pixd;
-
- PROCNAME("pixConvert32to24");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- pixGetDimensions(pixs, &w, &h, &d);
- if (d != 32)
- return (PIX *)ERROR_PTR("pixs not 32 bpp", procName, NULL);
-
- datas = pixGetData(pixs);
- wpls = pixGetWpl(pixs);
- pixd = pixCreateNoInit(w, h, 24);
- rgbdata = pixGetData(pixd);
- wpld = pixGetWpl(pixd);
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- rgbdata8 = (l_uint8 *)(rgbdata + i * wpld);
- for (j = 0; j < w; j++) {
- extractRGBValues(lines[j], &rval, &gval, &bval);
- *rgbdata8++ = rval;
- *rgbdata8++ = gval;
- *rgbdata8++ = bval;
- }
- }
- pixCopyResolution(pixd, pixs);
- pixCopyInputFormat(pixd, pixs);
- return pixd;
-}
-
-
-/*---------------------------------------------------------------------------*
- * Conversion between 32 bpp (1 spp) and 16 or 8 bpp *
- *---------------------------------------------------------------------------*/
-/*!
- * \brief pixConvert32To16()
- *
- * \param[in] pixs 32 bpp, single component
- * \param[in] type L_LS_TWO_BYTES, L_MS_TWO_BYTES, L_CLIP_TO_FFFF
- * \return pixd 16 bpp , or NULL on error
- *
- *
- * Notes:
- * (1) The data in pixs is typically used for labelling.
- * It is an array of l_uint32 values, not rgb or rgba.
- *
- */
-PIX *
-pixConvert32To16(PIX *pixs,
- l_int32 type)
-{
-l_uint16 dword;
-l_int32 w, h, i, j, wpls, wpld;
-l_uint32 sword;
-l_uint32 *datas, *lines, *datad, *lined;
-PIX *pixd;
-
- PROCNAME("pixConvert32to16");
-
- if (!pixs || pixGetDepth(pixs) != 32)
- return (PIX *)ERROR_PTR("pixs undefined or not 32 bpp", procName, NULL);
- if (type != L_LS_TWO_BYTES && type != L_MS_TWO_BYTES &&
- type != L_CLIP_TO_FFFF)
- return (PIX *)ERROR_PTR("invalid type", procName, NULL);
-
- pixGetDimensions(pixs, &w, &h, NULL);
- if ((pixd = pixCreate(w, h, 16)) == NULL)
- return (PIX *)ERROR_PTR("pixd not made", procName, NULL);
- pixCopyResolution(pixd, pixs);
- pixCopyInputFormat(pixd, pixs);
- wpls = pixGetWpl(pixs);
- datas = pixGetData(pixs);
- wpld = pixGetWpl(pixd);
- datad = pixGetData(pixd);
-
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- lined = datad + i * wpld;
- if (type == L_LS_TWO_BYTES) {
- for (j = 0; j < wpls; j++) {
- sword = *(lines + j);
- dword = sword & 0xffff;
- SET_DATA_TWO_BYTES(lined, j, dword);
- }
- } else if (type == L_MS_TWO_BYTES) {
- for (j = 0; j < wpls; j++) {
- sword = *(lines + j);
- dword = sword >> 16;
- SET_DATA_TWO_BYTES(lined, j, dword);
- }
- } else { /* type == L_CLIP_TO_FFFF */
- for (j = 0; j < wpls; j++) {
- sword = *(lines + j);
- dword = (sword >> 16) ? 0xffff : (sword & 0xffff);
- SET_DATA_TWO_BYTES(lined, j, dword);
- }
- }
- }
-
- return pixd;
-}
-
-
-/*!
- * \brief pixConvert32To8()
- *
- * \param[in] pixs 32 bpp, single component
- * \param[in] type16 L_LS_TWO_BYTES, L_MS_TWO_BYTES, L_CLIP_TO_FFFF
- * \param[in] type8 L_LS_BYTE, L_MS_BYTE, L_CLIP_TO_FF
- * \return pixd 8 bpp, or NULL on error
- */
-PIX *
-pixConvert32To8(PIX *pixs,
- l_int32 type16,
- l_int32 type8)
-{
-PIX *pix1, *pixd;
-
- PROCNAME("pixConvert32to8");
-
- if (!pixs || pixGetDepth(pixs) != 32)
- return (PIX *)ERROR_PTR("pixs undefined or not 32 bpp", procName, NULL);
- if (type16 != L_LS_TWO_BYTES && type16 != L_MS_TWO_BYTES &&
- type16 != L_CLIP_TO_FFFF)
- return (PIX *)ERROR_PTR("invalid type16", procName, NULL);
- if (type8 != L_LS_BYTE && type8 != L_MS_BYTE && type8 != L_CLIP_TO_FF)
- return (PIX *)ERROR_PTR("invalid type8", procName, NULL);
-
- pix1 = pixConvert32To16(pixs, type16);
- pixd = pixConvert16To8(pix1, type8);
- pixDestroy(&pix1);
- return pixd;
-}
-
-
-/*---------------------------------------------------------------------------*
- * Removal of alpha component by blending with white background *
- *---------------------------------------------------------------------------*/
-/*!
- * \brief pixRemoveAlpha()
- *
- * \param[in] pixs any depth
- * \return pixd if 32 bpp rgba, pixs blended over a white background;
- * a clone of pixs otherwise, and NULL on error
- *
- *
- * Notes:
- * (1) This is a wrapper on pixAlphaBlendUniform()
- *
- */
-PIX *
-pixRemoveAlpha(PIX *pixs)
-{
- PROCNAME("pixRemoveAlpha");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
-
- if (pixGetDepth(pixs) == 32 && pixGetSpp(pixs) == 4)
- return pixAlphaBlendUniform(pixs, 0xffffff00);
- else
- return pixClone(pixs);
-}
-
-
-/*---------------------------------------------------------------------------*
- * Addition of alpha component to 1 bpp *
- *---------------------------------------------------------------------------*/
-/*!
- * \brief pixAddAlphaTo1bpp()
- *
- * \param[in] pixd [optional] 1 bpp, can be null or equal to pixs
- * \param[in] pixs 1 bpp
- * \return pixd 1 bpp with colormap and non-opaque alpha,
- * or NULL on error
- *
- *
- * Notes:
- * (1) We don't use 1 bpp colormapped images with alpha in leptonica,
- * but we support generating them (here), writing to png, and reading
- * the png. On reading, they are converted to 32 bpp RGBA.
- * (2) The background (0) pixels in pixs become fully transparent, and the
- * foreground (1) pixels are fully opaque. Thus, pixd is a 1 bpp
- * representation of a stencil, that can be used to paint over pixels
- * of a backing image that are masked by the foreground in pixs.
- *
- */
-PIX *
-pixAddAlphaTo1bpp(PIX *pixd,
- PIX *pixs)
-{
-PIXCMAP *cmap;
-
- PROCNAME("pixAddAlphaTo1bpp");
-
- if (!pixs || (pixGetDepth(pixs) != 1))
- return (PIX *)ERROR_PTR("pixs undefined or not 1 bpp", procName, NULL);
- if (pixd && (pixd != pixs))
- return (PIX *)ERROR_PTR("pixd defined but != pixs", procName, NULL);
-
- pixd = pixCopy(pixd, pixs);
- cmap = pixcmapCreate(1);
- pixSetColormap(pixd, cmap);
- pixcmapAddRGBA(cmap, 255, 255, 255, 0); /* 0 ==> white + transparent */
- pixcmapAddRGBA(cmap, 0, 0, 0, 255); /* 1 ==> black + opaque */
- return pixd;
-}
-
-
-/*---------------------------------------------------------------------------*
- * Lossless depth conversion (unpacking) *
- *---------------------------------------------------------------------------*/
-/*!
- * \brief pixConvertLossless()
- *
- * \param[in] pixs 1, 2, 4, 8 bpp, not cmapped
- * \param[in] d destination depth: 2, 4 or 8
- * \return pixd 2, 4 or 8 bpp, or NULL on error
- *
- *
- * Notes:
- * (1) This is a lossless unpacking (depth-increasing)
- * conversion. If ds is the depth of pixs, then
- * ~ if d < ds, returns NULL
- * ~ if d == ds, returns a copy
- * ~ if d > ds, does the unpacking conversion
- * (2) If pixs has a colormap, this is an error.
- *
- */
-PIX *
-pixConvertLossless(PIX *pixs,
- l_int32 d)
-{
-l_int32 w, h, ds, wpls, wpld, i, j, val;
-l_uint32 *datas, *datad, *lines, *lined;
-PIX *pixd;
-
- PROCNAME("pixConvertLossless");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- if (pixGetColormap(pixs))
- return (PIX *)ERROR_PTR("pixs has colormap", procName, NULL);
- if (d != 2 && d != 4 && d != 8)
- return (PIX *)ERROR_PTR("invalid dest depth", procName, NULL);
-
- pixGetDimensions(pixs, &w, &h, &ds);
- if (d < ds)
- return (PIX *)ERROR_PTR("depth > d", procName, NULL);
- else if (d == ds)
- return pixCopy(NULL, pixs);
-
- if ((pixd = pixCreate(w, h, d)) == NULL)
- return (PIX *)ERROR_PTR("pixd not made", procName, NULL);
- pixCopyResolution(pixd, pixs);
- pixCopyInputFormat(pixd, pixs);
-
- /* Unpack the bits */
- datas = pixGetData(pixs);
- wpls = pixGetWpl(pixs);
- datad = pixGetData(pixd);
- wpld = pixGetWpl(pixd);
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- lined = datad + i * wpld;
- switch (ds)
- {
- case 1:
- for (j = 0; j < w; j++) {
- val = GET_DATA_BIT(lines, j);
- if (d == 8)
- SET_DATA_BYTE(lined, j, val);
- else if (d == 4)
- SET_DATA_QBIT(lined, j, val);
- else /* d == 2 */
- SET_DATA_DIBIT(lined, j, val);
- }
- break;
- case 2:
- for (j = 0; j < w; j++) {
- val = GET_DATA_DIBIT(lines, j);
- if (d == 8)
- SET_DATA_BYTE(lined, j, val);
- else /* d == 4 */
- SET_DATA_QBIT(lined, j, val);
- }
- break;
- case 4:
- for (j = 0; j < w; j++) {
- val = GET_DATA_DIBIT(lines, j);
- SET_DATA_BYTE(lined, j, val);
- }
- break;
- }
- }
-
- return pixd;
-}
-
-
-/*---------------------------------------------------------------------------*
- * Conversion for printing in PostScript *
- *---------------------------------------------------------------------------*/
-/*!
- * \brief pixConvertForPSWrap()
- *
- * \param[in] pixs 1, 2, 4, 8, 16, 32 bpp
- * \return pixd 1, 8, or 32 bpp, or NULL on error
- *
- *
- * Notes:
- * (1) For wrapping in PostScript, we convert pixs to
- * 1 bpp, 8 bpp (gray) and 32 bpp (RGB color).
- * (2) Colormaps are removed. For pixs with colormaps, the
- * images are converted to either 8 bpp gray or 32 bpp
- * RGB, depending on whether the colormap has color content.
- * (3) Images without colormaps, that are not 1 bpp or 32 bpp,
- * are converted to 8 bpp gray.
- *
- */
-PIX *
-pixConvertForPSWrap(PIX *pixs)
-{
-l_int32 d;
-PIX *pixd;
-PIXCMAP *cmap;
-
- PROCNAME("pixConvertForPSWrap");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
-
- cmap = pixGetColormap(pixs);
- d = pixGetDepth(pixs);
- switch (d)
- {
- case 1:
- case 32:
- pixd = pixClone(pixs);
- break;
- case 2:
- if (cmap)
- pixd = pixRemoveColormap(pixs, REMOVE_CMAP_BASED_ON_SRC);
- else
- pixd = pixConvert2To8(pixs, 0, 0x55, 0xaa, 0xff, FALSE);
- break;
- case 4:
- if (cmap)
- pixd = pixRemoveColormap(pixs, REMOVE_CMAP_BASED_ON_SRC);
- else
- pixd = pixConvert4To8(pixs, FALSE);
- break;
- case 8:
- pixd = pixRemoveColormap(pixs, REMOVE_CMAP_BASED_ON_SRC);
- break;
- case 16:
- pixd = pixConvert16To8(pixs, L_MS_BYTE);
- break;
- default:
- lept_stderr("depth not in {1, 2, 4, 8, 16, 32}");
- return NULL;
- }
-
- return pixd;
-}
-
-
-/*---------------------------------------------------------------------------*
- * Scaling conversion to subpixel RGB *
- *---------------------------------------------------------------------------*/
-/*!
- * \brief pixConvertToSubpixelRGB()
- *
- * \param[in] pixs 8 bpp grayscale, 32 bpp rgb, or colormapped
- * \param[in] scalex, scaley anisotropic scaling permitted between
- * source and destination
- * \param[in] order of subpixel rgb color components in
- * composition of pixd:
- * L_SUBPIXEL_ORDER_RGB, L_SUBPIXEL_ORDER_BGR,
- * L_SUBPIXEL_ORDER_VRGB, L_SUBPIXEL_ORDER_VBGR
- * \return pixd 32 bpp, or NULL on error
- *
- *
- * Notes:
- * (1) If pixs has a colormap, it is removed based on its contents
- * to either 8 bpp gray or rgb.
- * (2) For horizontal subpixel splitting, the input image
- * is rescaled by %scaley vertically and by 3.0 times
- * %scalex horizontally. Then each horizontal triplet
- * of pixels is mapped back to a single rgb pixel, with the
- * r, g and b values being assigned based on the pixel triplet.
- * For gray triplets, the r, g, and b values are set equal to
- * the three gray values. For color triplets, the r, g and b
- * values are set equal to the components from the appropriate
- * subpixel. Vertical subpixel splitting is handled similarly.
- * (3) See pixConvertGrayToSubpixelRGB() and
- * pixConvertColorToSubpixelRGB() for further details.
- *
- */
-PIX *
-pixConvertToSubpixelRGB(PIX *pixs,
- l_float32 scalex,
- l_float32 scaley,
- l_int32 order)
-{
-l_int32 d;
-PIX *pix1, *pixd;
-PIXCMAP *cmap;
-
- PROCNAME("pixConvertToSubpixelRGB");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- d = pixGetDepth(pixs);
- cmap = pixGetColormap(pixs);
- if (d != 8 && d != 32 && !cmap)
- return (PIX *)ERROR_PTR("pix not 8 or 32 bpp and not cmapped",
- procName, NULL);
- if (scalex <= 0.0 || scaley <= 0.0)
- return (PIX *)ERROR_PTR("scale factors must be > 0", procName, NULL);
- if (order != L_SUBPIXEL_ORDER_RGB && order != L_SUBPIXEL_ORDER_BGR &&
- order != L_SUBPIXEL_ORDER_VRGB && order != L_SUBPIXEL_ORDER_VBGR)
- return (PIX *)ERROR_PTR("invalid subpixel order", procName, NULL);
- if ((pix1 = pixRemoveColormap(pixs, REMOVE_CMAP_BASED_ON_SRC)) == NULL)
- return (PIX *)ERROR_PTR("pix1 not made", procName, NULL);
-
- d = pixGetDepth(pix1);
- pixd = NULL;
- if (d == 8)
- pixd = pixConvertGrayToSubpixelRGB(pix1, scalex, scaley, order);
- else if (d == 32)
- pixd = pixConvertColorToSubpixelRGB(pix1, scalex, scaley, order);
- else
- L_ERROR("invalid depth %d\n", procName, d);
-
- pixDestroy(&pix1);
- return pixd;
-}
-
-
-/*!
- * \brief pixConvertGrayToSubpixelRGB()
- *
- * \param[in] pixs 8 bpp or colormapped
- * \param[in] scalex, scaley
- * \param[in] order of subpixel rgb color components in
- * composition of pixd:
- * L_SUBPIXEL_ORDER_RGB, L_SUBPIXEL_ORDER_BGR,
- * L_SUBPIXEL_ORDER_VRGB, L_SUBPIXEL_ORDER_VBGR
- * \return pixd 32 bpp, or NULL on error
- *
- *
- * Notes:
- * (1) If pixs has a colormap, it is removed to 8 bpp.
- * (2) For horizontal subpixel splitting, the input gray image
- * is rescaled by %scaley vertically and by 3.0 times
- * %scalex horizontally. Then each horizontal triplet
- * of pixels is mapped back to a single rgb pixel, with the
- * r, g and b values being assigned from the triplet of gray values.
- * Similar operations are used for vertical subpixel splitting.
- * (3) This is a form of subpixel rendering that tends to give the
- * resulting text a sharper and somewhat chromatic display.
- * For horizontal subpixel splitting, the observable difference
- * between %order=L_SUBPIXEL_ORDER_RGB and
- * %order=L_SUBPIXEL_ORDER_BGR is reduced by optical diffusers
- * in the display that make the pixel color appear to emerge
- * from the entire pixel.
- *
- */
-PIX *
-pixConvertGrayToSubpixelRGB(PIX *pixs,
- l_float32 scalex,
- l_float32 scaley,
- l_int32 order)
-{
-l_int32 w, h, d, wd, hd, wplt, wpld, i, j, rval, gval, bval, direction;
-l_uint32 *datat, *datad, *linet, *lined;
-PIX *pix1, *pix2, *pixd;
-PIXCMAP *cmap;
-
- PROCNAME("pixConvertGrayToSubpixelRGB");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- d = pixGetDepth(pixs);
- cmap = pixGetColormap(pixs);
- if (d != 8 && !cmap)
- return (PIX *)ERROR_PTR("pix not 8 bpp & not cmapped", procName, NULL);
- if (scalex <= 0.0 || scaley <= 0.0)
- return (PIX *)ERROR_PTR("scale factors must be > 0", procName, NULL);
- if (order != L_SUBPIXEL_ORDER_RGB && order != L_SUBPIXEL_ORDER_BGR &&
- order != L_SUBPIXEL_ORDER_VRGB && order != L_SUBPIXEL_ORDER_VBGR)
- return (PIX *)ERROR_PTR("invalid subpixel order", procName, NULL);
-
- direction =
- (order == L_SUBPIXEL_ORDER_RGB || order == L_SUBPIXEL_ORDER_BGR)
- ? L_HORIZ : L_VERT;
- pix1 = pixRemoveColormap(pixs, REMOVE_CMAP_TO_GRAYSCALE);
- if (direction == L_HORIZ)
- pix2 = pixScale(pix1, 3.0 * scalex, scaley);
- else /* L_VERT */
- pix2 = pixScale(pix1, scalex, 3.0 * scaley);
-
- pixGetDimensions(pix2, &w, &h, NULL);
- wd = (direction == L_HORIZ) ? w / 3 : w;
- hd = (direction == L_VERT) ? h / 3 : h;
- pixd = pixCreate(wd, hd, 32);
- datad = pixGetData(pixd);
- wpld = pixGetWpl(pixd);
- datat = pixGetData(pix2);
- wplt = pixGetWpl(pix2);
- if (direction == L_HORIZ) {
- for (i = 0; i < hd; i++) {
- linet = datat + i * wplt;
- lined = datad + i * wpld;
- for (j = 0; j < wd; j++) {
- rval = GET_DATA_BYTE(linet, 3 * j);
- gval = GET_DATA_BYTE(linet, 3 * j + 1);
- bval = GET_DATA_BYTE(linet, 3 * j + 2);
- if (order == L_SUBPIXEL_ORDER_RGB)
- composeRGBPixel(rval, gval, bval, &lined[j]);
- else /* order BGR */
- composeRGBPixel(bval, gval, rval, &lined[j]);
- }
- }
- } else { /* L_VERT */
- for (i = 0; i < hd; i++) {
- linet = datat + 3 * i * wplt;
- lined = datad + i * wpld;
- for (j = 0; j < wd; j++) {
- rval = GET_DATA_BYTE(linet, j);
- gval = GET_DATA_BYTE(linet + wplt, j);
- bval = GET_DATA_BYTE(linet + 2 * wplt, j);
- if (order == L_SUBPIXEL_ORDER_VRGB)
- composeRGBPixel(rval, gval, bval, &lined[j]);
- else /* order VBGR */
- composeRGBPixel(bval, gval, rval, &lined[j]);
- }
- }
- }
-
- pixDestroy(&pix1);
- pixDestroy(&pix2);
- return pixd;
-}
-
-
-/*!
- * \brief pixConvertColorToSubpixelRGB()
- *
- * \param[in] pixs 32 bpp or colormapped
- * \param[in] scalex, scaley
- * \param[in] order of subpixel rgb color components in
- * composition of pixd:
- * L_SUBPIXEL_ORDER_RGB, L_SUBPIXEL_ORDER_BGR,
- * L_SUBPIXEL_ORDER_VRGB, L_SUBPIXEL_ORDER_VBGR
- * \return pixd 32 bpp, or NULL on error
- *
- *
- * Notes:
- * (1) If pixs has a colormap, it is removed to 32 bpp rgb.
- * If the colormap has no color, pixConvertGrayToSubpixelRGB()
- * should be called instead, because it will give the same result
- * more efficiently. The function pixConvertToSubpixelRGB()
- * will do the best thing for all cases.
- * (2) For horizontal subpixel splitting, the input rgb image
- * is rescaled by %scaley vertically and by 3.0 times
- * %scalex horizontally. Then for each horizontal triplet
- * of pixels, the r component of the final pixel is selected
- * from the r component of the appropriate pixel in the triplet,
- * and likewise for g and b. Vertical subpixel splitting is
- * handled similarly.
- *
- */
-PIX *
-pixConvertColorToSubpixelRGB(PIX *pixs,
- l_float32 scalex,
- l_float32 scaley,
- l_int32 order)
-{
-l_int32 w, h, d, wd, hd, wplt, wpld, i, j, rval, gval, bval, direction;
-l_uint32 *datat, *datad, *linet, *lined;
-PIX *pix1, *pix2, *pixd;
-PIXCMAP *cmap;
-
- PROCNAME("pixConvertColorToSubpixelRGB");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- d = pixGetDepth(pixs);
- cmap = pixGetColormap(pixs);
- if (d != 32 && !cmap)
- return (PIX *)ERROR_PTR("pix not 32 bpp & not cmapped", procName, NULL);
- if (scalex <= 0.0 || scaley <= 0.0)
- return (PIX *)ERROR_PTR("scale factors must be > 0", procName, NULL);
- if (order != L_SUBPIXEL_ORDER_RGB && order != L_SUBPIXEL_ORDER_BGR &&
- order != L_SUBPIXEL_ORDER_VRGB && order != L_SUBPIXEL_ORDER_VBGR)
- return (PIX *)ERROR_PTR("invalid subpixel order", procName, NULL);
-
- direction =
- (order == L_SUBPIXEL_ORDER_RGB || order == L_SUBPIXEL_ORDER_BGR)
- ? L_HORIZ : L_VERT;
- pix1 = pixRemoveColormap(pixs, REMOVE_CMAP_TO_FULL_COLOR);
- if (direction == L_HORIZ)
- pix2 = pixScale(pix1, 3.0 * scalex, scaley);
- else /* L_VERT */
- pix2 = pixScale(pix1, scalex, 3.0 * scaley);
-
- pixGetDimensions(pix2, &w, &h, NULL);
- wd = (direction == L_HORIZ) ? w / 3 : w;
- hd = (direction == L_VERT) ? h / 3 : h;
- pixd = pixCreate(wd, hd, 32);
- pixCopyInputFormat(pixd, pixs);
- datad = pixGetData(pixd);
- wpld = pixGetWpl(pixd);
- datat = pixGetData(pix2);
- wplt = pixGetWpl(pix2);
- if (direction == L_HORIZ) {
- for (i = 0; i < hd; i++) {
- linet = datat + i * wplt;
- lined = datad + i * wpld;
- for (j = 0; j < wd; j++) {
- if (order == L_SUBPIXEL_ORDER_RGB) {
- extractRGBValues(linet[3 * j], &rval, NULL, NULL);
- extractRGBValues(linet[3 * j + 1], NULL, &gval, NULL);
- extractRGBValues(linet[3 * j + 2], NULL, NULL, &bval);
- } else { /* order BGR */
- extractRGBValues(linet[3 * j], NULL, NULL, &bval);
- extractRGBValues(linet[3 * j + 1], NULL, &gval, NULL);
- extractRGBValues(linet[3 * j + 2], &rval, NULL, NULL);
- }
- composeRGBPixel(rval, gval, bval, &lined[j]);
- }
- }
- } else { /* L_VERT */
- for (i = 0; i < hd; i++) {
- linet = datat + 3 * i * wplt;
- lined = datad + i * wpld;
- for (j = 0; j < wd; j++) {
- if (order == L_SUBPIXEL_ORDER_VRGB) {
- extractRGBValues(linet[j], &rval, NULL, NULL);
- extractRGBValues((linet + wplt)[j], NULL, &gval, NULL);
- extractRGBValues((linet + 2 * wplt)[j], NULL, NULL, &bval);
- } else { /* order VBGR */
- extractRGBValues(linet[j], NULL, NULL, &bval);
- extractRGBValues((linet + wplt)[j], NULL, &gval, NULL);
- extractRGBValues((linet + 2 * wplt)[j], &rval, NULL, NULL);
- }
- composeRGBPixel(rval, gval, bval, &lined[j]);
- }
- }
- }
-
- if (pixGetSpp(pixs) == 4)
- pixScaleAndTransferAlpha(pixd, pixs, scalex, scaley);
-
- pixDestroy(&pix1);
- pixDestroy(&pix2);
- return pixd;
-}
-
-
-/*---------------------------------------------------------------------*
- * Setting neutral point for min/max boost conversion to gray *
- *---------------------------------------------------------------------*/
-/*!
- * \brief l_setNeutralBoostVal()
- *
- * \param[in] val between 1 and 255; typical value is 180
- * \return void
- *
- *
- * Notes:
- * (1) This raises or lowers the selected min or max RGB component value,
- * depending on if that component is above or below this value.
- *
- */
-void
-l_setNeutralBoostVal(l_int32 val)
-{
- PROCNAME("l_setNeutralBoostVal");
-
- if (val <= 0) {
- L_ERROR("invalid reference value for neutral boost\n", procName);
- return;
- }
- var_NEUTRAL_BOOST_VAL = val;
-}
diff --git a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pixlabel.c b/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pixlabel.c
deleted file mode 100644
index 576ea55a..00000000
--- a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pixlabel.c
+++ /dev/null
@@ -1,637 +0,0 @@
-/*====================================================================*
- - Copyright (C) 2001 Leptonica. All rights reserved.
- -
- - Redistribution and use in source and binary forms, with or without
- - modification, are permitted provided that the following conditions
- - are met:
- - 1. Redistributions of source code must retain the above copyright
- - notice, this list of conditions and the following disclaimer.
- - 2. Redistributions in binary form must reproduce the above
- - copyright notice, this list of conditions and the following
- - disclaimer in the documentation and/or other materials
- - provided with the distribution.
- -
- - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- - ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- - LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- - A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL ANY
- - CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
- - EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
- - PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
- - PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
- - OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
- - NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- *====================================================================*/
-
-/*!
- * \file pixlabel.c
- *
- *
- * Label pixels by an index for connected component membership
- * PIX *pixConnCompTransform()
- *
- * Label pixels by the area of their connected component
- * PIX *pixConnCompAreaTransform()
- *
- * Label pixels to allow incremental computation of connected components
- * l_int32 pixConnCompIncrInit()
- * l_int32 pixConnCompIncrAdd()
- * l_int32 pixGetSortedNeighborValues()
- *
- * Label pixels with spatially-dependent color coding
- * PIX *pixLocToColorTransform()
- *
- * Pixels get labelled in various ways throughout the leptonica library,
- * but most of the labelling is implicit, where the new value isn't
- * even considered to be a label -- it is just a transformed pixel value
- * that may be transformed again by another operation. Quantization
- * by thresholding, and dilation by a structuring element, are examples
- * of these typical image processing operations.
- *
- * However, there are some explicit labelling procedures that are useful
- * as end-points of analysis, where it typically would not make sense
- * to do further image processing on the result. Assigning false color
- * based on pixel properties is an example of such labelling operations.
- * Such operations typically have 1 bpp input images, and result
- * in grayscale or color images.
- *
- * The procedures in this file are concerned with such explicit labelling.
- * Some of these labelling procedures are also in other places in leptonica:
- *
- * runlength.c:
- * This file has two labelling transforms based on runlengths:
- * pixStrokeWidthTransform() and pixvRunlengthTransform().
- * The pixels are labelled based on the width of the "stroke" to
- * which they belong, or on the length of the horizontal or
- * vertical run in which they are a member. Runlengths can easily
- * be filtered using a threshold.
- *
- * pixafunc2.c:
- * This file has an operation, pixaDisplayRandomCmap(), that
- * randomly labels pix in a pixa (that are typically found using
- * pixConnComp) with up to 256 values, and assigns each value to
- * a random colormap color.
- *
- * seedfill.c:
- * This file has pixDistanceFunction(), that labels each pixel with
- * its distance from either the foreground or the background.
- *
- */
-
-#ifdef HAVE_CONFIG_H
-#include
-#endif /* HAVE_CONFIG_H */
-
-#include
-#include
-#include "allheaders.h"
-
-/*-----------------------------------------------------------------------*
- * Label pixels by an index for connected component membership *
- *-----------------------------------------------------------------------*/
-/*!
- * \brief pixConnCompTransform()
- *
- * \param[in] pixs 1 bpp
- * \param[in] connect connectivity: 4 or 8
- * \param[in] depth of pixd: 8 or 16 bpp; use 0 for auto determination
- * \return pixd 8, 16 or 32 bpp, or NULL on error
- *
- *
- * Notes:
- * (1) pixd is 8, 16 or 32 bpp, and the pixel values label the
- * fg component, starting with 1. Pixels in the bg are labelled 0.
- * (2) If %depth = 0, the depth of pixd is 8 if the number of c.c.
- * is less than 254, 16 if the number of c.c is less than 0xfffe,
- * and 32 otherwise.
- * (3) If %depth = 8, the assigned label for the n-th component is
- * 1 + n % 254. We use mod 254 because 0 is uniquely assigned
- * to black: e.g., see pixcmapCreateRandom(). Likewise,
- * if %depth = 16, the assigned label uses mod(2^16 - 2), and
- * if %depth = 32, no mod is taken.
- *
- */
-PIX *
-pixConnCompTransform(PIX *pixs,
- l_int32 connect,
- l_int32 depth)
-{
-l_int32 i, n, index, w, h, xb, yb, wb, hb;
-BOXA *boxa;
-PIX *pix1, *pix2, *pixd;
-PIXA *pixa;
-
- PROCNAME("pixConnCompTransform");
-
- if (!pixs || pixGetDepth(pixs) != 1)
- return (PIX *)ERROR_PTR("pixs undefined or not 1 bpp", procName, NULL);
- if (connect != 4 && connect != 8)
- return (PIX *)ERROR_PTR("connectivity must be 4 or 8", procName, NULL);
- if (depth != 0 && depth != 8 && depth != 16 && depth != 32)
- return (PIX *)ERROR_PTR("depth must be 0, 8, 16 or 32", procName, NULL);
-
- boxa = pixConnComp(pixs, &pixa, connect);
- n = pixaGetCount(pixa);
- boxaDestroy(&boxa);
- pixGetDimensions(pixs, &w, &h, NULL);
- if (depth == 0) {
- if (n < 254)
- depth = 8;
- else if (n < 0xfffe)
- depth = 16;
- else
- depth = 32;
- }
- pixd = pixCreate(w, h, depth);
- pixSetSpp(pixd, 1);
- if (n == 0) { /* no fg */
- pixaDestroy(&pixa);
- return pixd;
- }
-
- /* Label each component and blit it in */
- for (i = 0; i < n; i++) {
- pixaGetBoxGeometry(pixa, i, &xb, &yb, &wb, &hb);
- pix1 = pixaGetPix(pixa, i, L_CLONE);
- if (depth == 8) {
- index = 1 + (i % 254);
- pix2 = pixConvert1To8(NULL, pix1, 0, index);
- } else if (depth == 16) {
- index = 1 + (i % 0xfffe);
- pix2 = pixConvert1To16(NULL, pix1, 0, index);
- } else { /* depth == 32 */
- index = 1 + i;
- pix2 = pixConvert1To32(NULL, pix1, 0, index);
- }
- pixRasterop(pixd, xb, yb, wb, hb, PIX_PAINT, pix2, 0, 0);
- pixDestroy(&pix1);
- pixDestroy(&pix2);
- }
-
- pixaDestroy(&pixa);
- return pixd;
-}
-
-
-/*-----------------------------------------------------------------------*
- * Label pixels by the area of their connected component *
- *-----------------------------------------------------------------------*/
-/*!
- * \brief pixConnCompAreaTransform()
- *
- * \param[in] pixs 1 bpp
- * \param[in] connect connectivity: 4 or 8
- * \return pixd 32 bpp, 1 spp, or NULL on error
- *
- *
- * Notes:
- * (1) The pixel values in pixd label the area of the fg component
- * to which the pixel belongs. Pixels in the bg are labelled 0.
- * (2) For purposes of visualization, the output can be converted
- * to 8 bpp, using pixConvert32To8() or pixMaxDynamicRange().
- *
- */
-PIX *
-pixConnCompAreaTransform(PIX *pixs,
- l_int32 connect)
-{
-l_int32 i, n, npix, w, h, xb, yb, wb, hb;
-l_int32 *tab8;
-BOXA *boxa;
-PIX *pix1, *pix2, *pixd;
-PIXA *pixa;
-
- PROCNAME("pixConnCompAreaTransform");
-
- if (!pixs || pixGetDepth(pixs) != 1)
- return (PIX *)ERROR_PTR("pixs undefined or not 1 bpp", procName, NULL);
- if (connect != 4 && connect != 8)
- return (PIX *)ERROR_PTR("connectivity must be 4 or 8", procName, NULL);
-
- boxa = pixConnComp(pixs, &pixa, connect);
- n = pixaGetCount(pixa);
- boxaDestroy(&boxa);
- pixGetDimensions(pixs, &w, &h, NULL);
- pixd = pixCreate(w, h, 32);
- pixSetSpp(pixd, 1);
- if (n == 0) { /* no fg */
- pixaDestroy(&pixa);
- return pixd;
- }
-
- /* Label each component and blit it in */
- tab8 = makePixelSumTab8();
- for (i = 0; i < n; i++) {
- pixaGetBoxGeometry(pixa, i, &xb, &yb, &wb, &hb);
- pix1 = pixaGetPix(pixa, i, L_CLONE);
- pixCountPixels(pix1, &npix, tab8);
- pix2 = pixConvert1To32(NULL, pix1, 0, npix);
- pixRasterop(pixd, xb, yb, wb, hb, PIX_PAINT, pix2, 0, 0);
- pixDestroy(&pix1);
- pixDestroy(&pix2);
- }
-
- pixaDestroy(&pixa);
- LEPT_FREE(tab8);
- return pixd;
-}
-
-
-/*-------------------------------------------------------------------------*
- * Label pixels to allow incremental computation of connected components *
- *-------------------------------------------------------------------------*/
-/*!
- * \brief pixConnCompIncrInit()
- *
- * \param[in] pixs 1 bpp
- * \param[in] conn connectivity: 4 or 8
- * \param[out] ppixd 32 bpp, with c.c. labelled
- * \param[out] pptaa with pixel locations indexed by c.c.
- * \param[out] pncc initial number of c.c.
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This labels the connected components in a 1 bpp pix, and
- * additionally sets up a ptaa that lists the locations of pixels
- * in each of the components.
- * (2) It can be used to initialize the output image and arrays for
- * an application that maintains information about connected
- * components incrementally as pixels are added.
- * (3) pixs can be empty or have some foreground pixels.
- * (4) The connectivity is stored in pixd->special.
- * (5) Always initialize with the first pta in ptaa being empty
- * and representing the background value (index 0) in the pix.
- *
- */
-l_ok
-pixConnCompIncrInit(PIX *pixs,
- l_int32 conn,
- PIX **ppixd,
- PTAA **pptaa,
- l_int32 *pncc)
-{
-l_int32 empty, w, h, ncc;
-PIX *pixd;
-PTA *pta;
-PTAA *ptaa;
-
- PROCNAME("pixConnCompIncrInit");
-
- if (ppixd) *ppixd = NULL;
- if (pptaa) *pptaa = NULL;
- if (pncc) *pncc = 0;
- if (!ppixd || !pptaa || !pncc)
- return ERROR_INT("&pixd, &ptaa, &ncc not all defined", procName, 1);
- if (!pixs || pixGetDepth(pixs) != 1)
- return ERROR_INT("pixs undefined or not 1 bpp", procName, 1);
- if (conn != 4 && conn != 8)
- return ERROR_INT("connectivity must be 4 or 8", procName, 1);
-
- pixGetDimensions(pixs, &w, &h, NULL);
- pixZero(pixs, &empty);
- if (empty) {
- *ppixd = pixCreate(w, h, 32);
- pixSetSpp(*ppixd, 1);
- pixSetSpecial(*ppixd, conn);
- *pptaa = ptaaCreate(0);
- pta = ptaCreate(1);
- ptaaAddPta(*pptaa, pta, L_INSERT); /* reserve index 0 for background */
- return 0;
- }
-
- /* Set up the initial labeled image and indexed pixel arrays */
- if ((pixd = pixConnCompTransform(pixs, conn, 32)) == NULL)
- return ERROR_INT("pixd not made", procName, 1);
- pixSetSpecial(pixd, conn);
- *ppixd = pixd;
- if ((ptaa = ptaaIndexLabeledPixels(pixd, &ncc)) == NULL)
- return ERROR_INT("ptaa not made", procName, 1);
- *pptaa = ptaa;
- *pncc = ncc;
- return 0;
-}
-
-
-/*!
- * \brief pixConnCompIncrAdd()
- *
- * \param[in] pixs 32 bpp, with pixels labeled by c.c.
- * \param[in] ptaa with each pta of pixel locations indexed by c.c.
- * \param[out] pncc number of c.c
- * \param[in] x,y location of added pixel
- * \param[in] debug 0 for no output; otherwise output whenever
- * debug <= nvals, up to debug == 3
- * \return -1 if nothing happens; 0 if a pixel is added; 1 on error
- *
- *
- * Notes:
- * (1) This adds a pixel and updates the labeled connected components.
- * Before calling this function, initialize the process using
- * pixConnCompIncrInit().
- * (2) As a result of adding a pixel, one of the following can happen,
- * depending on the number of neighbors with non-zero value:
- * (a) nothing: the pixel is already a member of a c.c.
- * (b) no neighbors: a new component is added, increasing the
- * number of c.c.
- * (c) one neighbor: the pixel is added to an existing c.c.
- * (d) more than one neighbor: the added pixel causes joining of
- * two or more c.c., reducing the number of c.c. A maximum
- * of 4 c.c. can be joined.
- * (3) When two c.c. are joined, the pixels in the larger index are
- * relabeled to those of the smaller in pixs, and their locations
- * are transferred to the pta with the smaller index in the ptaa.
- * The pta corresponding to the larger index is then deleted.
- * (4) This is an efficient implementation of a "union-find" operation,
- * which supports the generation and merging of disjoint sets
- * of pixels. This function can be called about 1.3 million times
- * per second.
- *
- */
-l_int32
-pixConnCompIncrAdd(PIX *pixs,
- PTAA *ptaa,
- l_int32 *pncc,
- l_float32 x,
- l_float32 y,
- l_int32 debug)
-{
-l_int32 conn, i, j, w, h, count, nvals, ns, firstindex;
-l_uint32 val;
-l_int32 *neigh;
-PTA *ptas, *ptad;
-
- PROCNAME("pixConnCompIncrAdd");
-
- if (!pixs || pixGetDepth(pixs) != 32)
- return ERROR_INT("pixs not defined or not 32 bpp", procName, 1);
- if (!ptaa)
- return ERROR_INT("ptaa not defined", procName, 1);
- if (!pncc)
- return ERROR_INT("&ncc not defined", procName, 1);
- conn = pixs->special;
- if (conn != 4 && conn != 8)
- return ERROR_INT("connectivity must be 4 or 8", procName, 1);
- pixGetDimensions(pixs, &w, &h, NULL);
- if (x < 0 || x >= w)
- return ERROR_INT("invalid x pixel location", procName, 1);
- if (y < 0 || y >= h)
- return ERROR_INT("invalid y pixel location", procName, 1);
-
- pixGetPixel(pixs, x, y, &val);
- if (val > 0) /* already belongs to a set */
- return -1;
-
- /* Find unique neighbor pixel values in increasing order of value.
- * If %nvals > 0, these are returned in the %neigh array, which
- * is of size %nvals. Note that the pixel values in each
- * connected component are used as the index into the pta
- * array of the ptaa, giving the pixel locations. */
- pixGetSortedNeighborValues(pixs, x, y, conn, &neigh, &nvals);
-
- /* If there are no neighbors, just add a new component */
- if (nvals == 0) {
- count = ptaaGetCount(ptaa);
- pixSetPixel(pixs, x, y, count);
- ptas = ptaCreate(1);
- ptaAddPt(ptas, x, y);
- ptaaAddPta(ptaa, ptas, L_INSERT);
- *pncc += 1;
- LEPT_FREE(neigh);
- return 0;
- }
-
- /* Otherwise, there is at least one neighbor. Add the pixel
- * to the first neighbor c.c. */
- firstindex = neigh[0];
- pixSetPixel(pixs, x, y, firstindex);
- ptaaAddPt(ptaa, neigh[0], x, y);
- if (nvals == 1) {
- if (debug == 1)
- lept_stderr("nvals = %d: neigh = (%d)\n", nvals, neigh[0]);
- LEPT_FREE(neigh);
- return 0;
- }
-
- /* If nvals > 1, there are at least 2 neighbors, so this pixel
- * joins at least one pair of existing c.c. Join each component
- * to the first component in the list, which is the one with
- * the smallest integer label. This is done in two steps:
- * (a) re-label the pixels in the component to the label of the
- * first component, and
- * (b) save the pixel locations in the pta for the first component. */
- if (nvals == 2) {
- if (debug >= 1 && debug <= 2) {
- lept_stderr("nvals = %d: neigh = (%d,%d)\n", nvals,
- neigh[0], neigh[1]);
- }
- } else if (nvals == 3) {
- if (debug >= 1 && debug <= 3) {
- lept_stderr("nvals = %d: neigh = (%d,%d,%d)\n", nvals,
- neigh[0], neigh[1], neigh[2]);
- }
- } else { /* nvals == 4 */
- if (debug >= 1 && debug <= 4) {
- lept_stderr("nvals = %d: neigh = (%d,%d,%d,%d)\n", nvals,
- neigh[0], neigh[1], neigh[2], neigh[3]);
- }
- }
- ptad = ptaaGetPta(ptaa, firstindex, L_CLONE);
- for (i = 1; i < nvals; i++) {
- ptas = ptaaGetPta(ptaa, neigh[i], L_CLONE);
- ns = ptaGetCount(ptas);
- for (j = 0; j < ns; j++) { /* relabel pixels */
- ptaGetPt(ptas, j, &x, &y);
- pixSetPixel(pixs, x, y, firstindex);
- }
- ptaJoin(ptad, ptas, 0, -1); /* add relabeled pixel locations */
- *pncc -= 1;
- ptaDestroy(&ptaa->pta[neigh[i]]);
- ptaDestroy(&ptas); /* the clone */
- }
- ptaDestroy(&ptad); /* the clone */
- LEPT_FREE(neigh);
- return 0;
-}
-
-
-/*!
- * \brief pixGetSortedNeighborValues()
- *
- * \param[in] pixs 8, 16 or 32 bpp, with pixels labeled by c.c.
- * \param[in] x, y location of pixel
- * \param[in] conn 4 or 8 connected neighbors
- * \param[out] pneigh array of integers, to be filled with
- * the values of the neighbors, if any
- * \param[out] pnvals the number of unique neighbor values found
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) The returned %neigh array is the unique set of neighboring
- * pixel values, of size nvals, sorted from smallest to largest.
- * The value 0, which represents background pixels that do
- * not belong to any set of connected components, is discarded.
- * (2) If there are no neighbors, this returns %neigh = NULL; otherwise,
- * the caller must free the array.
- * (3) For either 4 or 8 connectivity, the maximum number of unique
- * neighbor values is 4.
- *
- */
-l_ok
-pixGetSortedNeighborValues(PIX *pixs,
- l_int32 x,
- l_int32 y,
- l_int32 conn,
- l_int32 **pneigh,
- l_int32 *pnvals)
-{
-l_int32 i, npt, index;
-l_int32 neigh[4];
-l_uint32 val;
-l_float32 fx, fy;
-L_ASET *aset;
-L_ASET_NODE *node;
-PTA *pta;
-RB_TYPE key;
-
- PROCNAME("pixGetSortedNeighborValues");
-
- if (pneigh) *pneigh = NULL;
- if (pnvals) *pnvals = 0;
- if (!pneigh || !pnvals)
- return ERROR_INT("&neigh and &nvals not both defined", procName, 1);
- if (!pixs || pixGetDepth(pixs) < 8)
- return ERROR_INT("pixs not defined or depth < 8", procName, 1);
-
- /* Identify the locations of nearest neighbor pixels */
- if ((pta = ptaGetNeighborPixLocs(pixs, x, y, conn)) == NULL)
- return ERROR_INT("pta of neighbors not made", procName, 1);
-
- /* Find the pixel values and insert into a set as keys */
- aset = l_asetCreate(L_UINT_TYPE);
- npt = ptaGetCount(pta);
- for (i = 0; i < npt; i++) {
- ptaGetPt(pta, i, &fx, &fy);
- pixGetPixel(pixs, (l_int32)fx, (l_int32)fy, &val);
- key.utype = val;
- l_asetInsert(aset, key);
- }
-
- /* Extract the set keys and put them into the %neigh array.
- * Omit the value 0, which indicates the pixel doesn't
- * belong to one of the sets of connected components. */
- node = l_asetGetFirst(aset);
- index = 0;
- while (node) {
- val = node->key.utype;
- if (val > 0)
- neigh[index++] = (l_int32)val;
- node = l_asetGetNext(node);
- }
- *pnvals = index;
- if (index > 0) {
- *pneigh = (l_int32 *)LEPT_CALLOC(index, sizeof(l_int32));
- for (i = 0; i < index; i++)
- (*pneigh)[i] = neigh[i];
- }
-
- ptaDestroy(&pta);
- l_asetDestroy(&aset);
- return 0;
-}
-
-
-/*-----------------------------------------------------------------------*
- * Label pixels with spatially-dependent color coding *
- *-----------------------------------------------------------------------*/
-/*!
- * \brief pixLocToColorTransform()
- *
- * \param[in] pixs 1 bpp
- * \return pixd 32 bpp rgb, or NULL on error
- *
- *
- * Notes:
- * (1) This generates an RGB image where each component value
- * is coded depending on the (x.y) location and the size
- * of the fg connected component that the pixel in pixs belongs to.
- * It is independent of the 4-fold orthogonal orientation, and
- * only weakly depends on translations and small angle rotations.
- * Background pixels are black.
- * (2) Such encodings can be compared between two 1 bpp images
- * by performing this transform and calculating the
- * "earth-mover" distance on the resulting R,G,B histograms.
- *
- */
-PIX *
-pixLocToColorTransform(PIX *pixs)
-{
-l_int32 w, h, w2, h2, wpls, wplr, wplg, wplb, wplcc, i, j, rval, gval, bval;
-l_float32 invw2, invh2;
-l_uint32 *datas, *datar, *datag, *datab, *datacc;
-l_uint32 *lines, *liner, *lineg, *lineb, *linecc;
-PIX *pix1, *pixcc, *pixr, *pixg, *pixb, *pixd;
-
- PROCNAME("pixLocToColorTransform");
-
- if (!pixs || pixGetDepth(pixs) != 1)
- return (PIX *)ERROR_PTR("pixs undefined or not 1 bpp", procName, NULL);
-
- /* Label each pixel with the area of the c.c. to which it belongs.
- * Clip the result to 255 in an 8 bpp pix. This is used for
- * the blue component of pixd. */
- pixGetDimensions(pixs, &w, &h, NULL);
- w2 = w / 2;
- h2 = h / 2;
- invw2 = 255.0 / (l_float32)w2;
- invh2 = 255.0 / (l_float32)h2;
- pix1 = pixConnCompAreaTransform(pixs, 8);
- pixcc = pixConvert32To8(pix1, L_LS_TWO_BYTES, L_CLIP_TO_FF);
- pixDestroy(&pix1);
-
- /* Label the red and green components depending on the location
- * of the fg pixels, in a way that is 4-fold rotationally invariant. */
- pixr = pixCreate(w, h, 8);
- pixg = pixCreate(w, h, 8);
- pixb = pixCreate(w, h, 8);
- wpls = pixGetWpl(pixs);
- wplr = pixGetWpl(pixr);
- wplg = pixGetWpl(pixg);
- wplb = pixGetWpl(pixb);
- wplcc = pixGetWpl(pixcc);
- datas = pixGetData(pixs);
- datar = pixGetData(pixr);
- datag = pixGetData(pixg);
- datab = pixGetData(pixb);
- datacc = pixGetData(pixcc);
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- liner = datar + i * wplr;
- lineg = datag + i * wplg;
- lineb = datab + i * wplb;
- linecc = datacc+ i * wplcc;
- for (j = 0; j < w; j++) {
- if (GET_DATA_BIT(lines, j) == 0) continue;
- if (w < h) {
- rval = invh2 * L_ABS((l_float32)(i - h2));
- gval = invw2 * L_ABS((l_float32)(j - w2));
- } else {
- rval = invw2 * L_ABS((l_float32)(j - w2));
- gval = invh2 * L_ABS((l_float32)(i - h2));
- }
- bval = GET_DATA_BYTE(linecc, j);
- SET_DATA_BYTE(liner, j, rval);
- SET_DATA_BYTE(lineg, j, gval);
- SET_DATA_BYTE(lineb, j, bval);
- }
- }
- pixd = pixCreateRGBImage(pixr, pixg, pixb);
-
- pixDestroy(&pixcc);
- pixDestroy(&pixr);
- pixDestroy(&pixg);
- pixDestroy(&pixb);
- return pixd;
-}
diff --git a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pixtiling.c b/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pixtiling.c
deleted file mode 100644
index 480a3d1d..00000000
--- a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pixtiling.c
+++ /dev/null
@@ -1,423 +0,0 @@
-/*====================================================================*
- - Copyright (C) 2001 Leptonica. All rights reserved.
- -
- - Redistribution and use in source and binary forms, with or without
- - modification, are permitted provided that the following conditions
- - are met:
- - 1. Redistributions of source code must retain the above copyright
- - notice, this list of conditions and the following disclaimer.
- - 2. Redistributions in binary form must reproduce the above
- - copyright notice, this list of conditions and the following
- - disclaimer in the documentation and/or other materials
- - provided with the distribution.
- -
- - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- - ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- - LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- - A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL ANY
- - CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
- - EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
- - PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
- - PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
- - OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
- - NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- *====================================================================*/
-
-/*!
- * \file pixtiling.c
- *
- *
- * PIXTILING *pixTilingCreate()
- * void *pixTilingDestroy()
- * l_int32 pixTilingGetCount()
- * l_int32 pixTilingGetSize()
- * PIX *pixTilingGetTile()
- * l_int32 pixTilingNoStripOnPaint()
- * l_int32 pixTilingPaintTile()
- *
- * This provides a simple way to split an image into tiles
- * and to perform operations independently on each tile.
- *
- * The tile created with pixTilingGetTile() can have pixels in
- * adjacent tiles for computation. The number of extra pixels
- * on each side of the tile is given by an 'overlap' parameter
- * to pixTilingCreate(). For tiles at the boundary of
- * the input image, quasi-overlap pixels are created by reflection
- * symmetry into the tile.
- *
- * Here's a typical intended usage. Suppose you want to parallelize
- * the operation on an image, by operating on tiles. For each
- * tile, you want to generate an in-place image result at the same
- * resolution. Suppose you choose a one-dimensional vertical tiling,
- * where the desired tile width is 256 pixels and the overlap is
- * 30 pixels on left and right sides:
- *
- * PIX *pixd = pixCreateTemplate(pixs); // output
- * PIXTILING *pt = pixTilingCreate(pixs, 0, 1, 256, 30, 0);
- * pixTilingGetCount(pt, &nx, NULL);
- * for (j = 0; j < nx; j++) {
- * PIX *pixt = pixTilingGetTile(pt, 0, j);
- * SomeInPlaceOperation(pixt, 30, 0, ...);
- * pixTilingPaintTile(pixd, 0, j, pixt, pt);
- * pixDestroy(&pixt);
- * }
- *
- * In this example, note the following:
- * ~ The unspecfified in-place operation could instead generate
- * a new pix. If this is done, the resulting pix must be the
- * same size as pixt, because pixTilingPaintTile() makes that
- * assumption, removing the overlap pixels before painting
- * into the destination.
- * ~ The 'overlap' parameters have been included in your function,
- * to indicate which pixels are not in the exterior overlap region.
- * You will need to change only pixels that are not in the overlap
- * region, because those are the pixels that will be painted
- * into the destination.
- * ~ For tiles on the outside of the image, mirrored pixels are
- * added to substitute for the overlap that is added to interior
- * tiles. This allows you to implement your function without
- * reference to which tile it is; no special coding is necessary
- * for pixels that are near the image boundary.
- * ~ The tiles are labeled by (i, j) = (row, column),
- * and in this example there is one row and nx columns.
- *
- */
-
-#ifdef HAVE_CONFIG_H
-#include
-#endif /* HAVE_CONFIG_H */
-
-#include "allheaders.h"
-
-/*!
- * \brief pixTilingCreate()
- *
- * \param[in] pixs pix to be tiled; any depth; colormap OK
- * \param[in] nx number of tiles across image
- * \param[in] ny number of tiles down image
- * \param[in] w desired width of each tile
- * \param[in] h desired height of each tile
- * \param[in] xoverlap overlap into neighboring tiles on each side
- * \param[in] yoverlap overlap into neighboring tiles above and below
- * \return pixtiling, or NULL on error
- *
- *
- * Notes:
- * (1) We put a clone of pixs in the PixTiling.
- * (2) The input to pixTilingCreate() for horizontal tiling can be
- * either the number of tiles across the image or the approximate
- * width of the tiles. If the latter, the actual width will be
- * determined by making all tiles but the last of equal width, and
- * making the last as close to the others as possible. The same
- * consideration is applied independently to the vertical tiling.
- * To specify tile width, set nx = 0; to specify the number of
- * tiles horizontally across the image, set w = 0.
- * (3) If pixs is to be tiled in one-dimensional strips, use ny = 1 for
- * vertical strips and nx = 1 for horizontal strips.
- * (4) The overlap must not be larger than the width or height of
- * the leftmost or topmost tile(s).
- *
- */
-PIXTILING *
-pixTilingCreate(PIX *pixs,
- l_int32 nx,
- l_int32 ny,
- l_int32 w,
- l_int32 h,
- l_int32 xoverlap,
- l_int32 yoverlap)
-{
-l_int32 width, height;
-PIXTILING *pt;
-
- PROCNAME("pixTilingCreate");
-
- if (!pixs)
- return (PIXTILING *)ERROR_PTR("pixs not defined", procName, NULL);
- if (nx < 1 && w < 1)
- return (PIXTILING *)ERROR_PTR("invalid width spec", procName, NULL);
- if (ny < 1 && h < 1)
- return (PIXTILING *)ERROR_PTR("invalid height spec", procName, NULL);
-
- /* Find the tile width and number of tiles. All tiles except the
- * rightmost ones have the same width. The width of the
- * rightmost ones are at least the width of the others and
- * less than twice that width. Ditto for tile height. */
- pixGetDimensions(pixs, &width, &height, NULL);
- if (nx == 0)
- nx = L_MAX(1, width / w);
- w = width / nx; /* possibly reset */
- if (ny == 0)
- ny = L_MAX(1, height / h);
- h = height / ny; /* possibly reset */
- if (xoverlap > w || yoverlap > h) {
- L_INFO("tile width = %d, tile height = %d\n", procName, w, h);
- return (PIXTILING *)ERROR_PTR("overlap too large", procName, NULL);
- }
-
- pt = (PIXTILING *)LEPT_CALLOC(1, sizeof(PIXTILING));
- pt->pix = pixClone(pixs);
- pt->xoverlap = xoverlap;
- pt->yoverlap = yoverlap;
- pt->nx = nx;
- pt->ny = ny;
- pt->w = w;
- pt->h = h;
- pt->strip = TRUE;
- return pt;
-}
-
-
-/*!
- * \brief pixTilingDestroy()
- *
- * \param[in,out] ppt will be set to null before returning
- * \return void
- */
-void
-pixTilingDestroy(PIXTILING **ppt)
-{
-PIXTILING *pt;
-
- PROCNAME("pixTilingDestroy");
-
- if (ppt == NULL) {
- L_WARNING("ptr address is null!\n", procName);
- return;
- }
-
- if ((pt = *ppt) == NULL)
- return;
-
- pixDestroy(&pt->pix);
- LEPT_FREE(pt);
- *ppt = NULL;
- return;
-}
-
-
-/*!
- * \brief pixTilingGetCount()
- *
- * \param[in] pt pixtiling
- * \param[out] pnx [optional] nx; can be null
- * \param[out] pny [optional] ny; can be null
- * \return 0 if OK, 1 on error
- */
-l_ok
-pixTilingGetCount(PIXTILING *pt,
- l_int32 *pnx,
- l_int32 *pny)
-{
- PROCNAME("pixTilingGetCount");
-
- if (!pt)
- return ERROR_INT("pt not defined", procName, 1);
- if (pnx) *pnx = pt->nx;
- if (pny) *pny = pt->ny;
- return 0;
-}
-
-
-/*!
- * \brief pixTilingGetSize()
- *
- * \param[in] pt pixtiling
- * \param[out] pw [optional] tile width; can be null
- * \param[out] ph [optional] tile height; can be null
- * \return 0 if OK, 1 on error
- */
-l_ok
-pixTilingGetSize(PIXTILING *pt,
- l_int32 *pw,
- l_int32 *ph)
-{
- PROCNAME("pixTilingGetSize");
-
- if (!pt)
- return ERROR_INT("pt not defined", procName, 1);
- if (pw) *pw = pt->w;
- if (ph) *ph = pt->h;
- return 0;
-}
-
-
-/*!
- * \brief pixTilingGetTile()
- *
- * \param[in] pt pixtiling
- * \param[in] i tile row index
- * \param[in] j tile column index
- * \return pixd tile with appropriate boundary (overlap) pixels added,
- * or NULL on error
- */
-PIX *
-pixTilingGetTile(PIXTILING *pt,
- l_int32 i,
- l_int32 j)
-{
-l_int32 wpix, hpix, wt, ht, nx, ny;
-l_int32 xoverlap, yoverlap, wtlast, htlast;
-l_int32 left, top, xtraleft, xtraright, xtratop, xtrabot, width, height;
-BOX *box;
-PIX *pixs, *pixt, *pixd;
-
- PROCNAME("pixTilingGetTile");
-
- if (!pt)
- return (PIX *)ERROR_PTR("pt not defined", procName, NULL);
- if ((pixs = pt->pix) == NULL)
- return (PIX *)ERROR_PTR("pix not found", procName, NULL);
- pixTilingGetCount(pt, &nx, &ny);
- if (i < 0 || i >= ny)
- return (PIX *)ERROR_PTR("invalid row index i", procName, NULL);
- if (j < 0 || j >= nx)
- return (PIX *)ERROR_PTR("invalid column index j", procName, NULL);
-
- /* Grab the tile with as much overlap as exists within the
- * input pix. First, compute the (left, top) coordinates. */
- pixGetDimensions(pixs, &wpix, &hpix, NULL);
- pixTilingGetSize(pt, &wt, &ht);
- xoverlap = pt->xoverlap;
- yoverlap = pt->yoverlap;
- wtlast = wpix - wt * (nx - 1);
- htlast = hpix - ht * (ny - 1);
- left = L_MAX(0, j * wt - xoverlap);
- top = L_MAX(0, i * ht - yoverlap);
-
- /* Get the width and height of the tile, including whatever
- * overlap is available. */
- if (nx == 1)
- width = wpix;
- else if (j == 0)
- width = wt + xoverlap;
- else if (j == nx - 1)
- width = wtlast + xoverlap;
- else
- width = wt + 2 * xoverlap;
-
- if (ny == 1)
- height = hpix;
- else if (i == 0)
- height = ht + yoverlap;
- else if (i == ny - 1)
- height = htlast + yoverlap;
- else
- height = ht + 2 * yoverlap;
- box = boxCreate(left, top, width, height);
- pixt = pixClipRectangle(pixs, box, NULL);
- boxDestroy(&box);
-
- /* If no overlap, do not add any special case borders */
- if (xoverlap == 0 && yoverlap == 0)
- return pixt;
-
- /* Add overlap as a mirrored border, in the 8 special cases where
- * the tile touches the border of the input pix. The xtratop (etc)
- * parameters are required where the tile is either full width
- * or full height. */
- xtratop = xtrabot = xtraleft = xtraright = 0;
- if (nx == 1)
- xtraleft = xtraright = xoverlap;
- if (ny == 1)
- xtratop = xtrabot = yoverlap;
- if (i == 0 && j == 0)
- pixd = pixAddMirroredBorder(pixt, xoverlap, xtraright,
- yoverlap, xtrabot);
- else if (i == 0 && j == nx - 1)
- pixd = pixAddMirroredBorder(pixt, xtraleft, xoverlap,
- yoverlap, xtrabot);
- else if (i == ny - 1 && j == 0)
- pixd = pixAddMirroredBorder(pixt, xoverlap, xtraright,
- xtratop, yoverlap);
- else if (i == ny - 1 && j == nx - 1)
- pixd = pixAddMirroredBorder(pixt, xtraleft, xoverlap,
- xtratop, yoverlap);
- else if (i == 0)
- pixd = pixAddMirroredBorder(pixt, 0, 0, yoverlap, xtrabot);
- else if (i == ny - 1)
- pixd = pixAddMirroredBorder(pixt, 0, 0, xtratop, yoverlap);
- else if (j == 0)
- pixd = pixAddMirroredBorder(pixt, xoverlap, xtraright, 0, 0);
- else if (j == nx - 1)
- pixd = pixAddMirroredBorder(pixt, xtraleft, xoverlap, 0, 0);
- else
- pixd = pixClone(pixt);
- pixDestroy(&pixt);
-
- return pixd;
-}
-
-
-/*!
- * \brief pixTilingNoStripOnPaint()
- *
- * \param[in] pt pixtiling
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) The default for paint is to strip out the overlap pixels
- * that are added by pixTilingGetTile(). However, some
- * operations will generate an image with these pixels
- * stripped off. This tells the paint operation not
- * to strip the added boundary pixels when painting.
- *
- */
-l_ok
-pixTilingNoStripOnPaint(PIXTILING *pt)
-{
- PROCNAME("pixTilingNoStripOnPaint");
-
- if (!pt)
- return ERROR_INT("pt not defined", procName, 1);
- pt->strip = FALSE;
- return 0;
-}
-
-
-/*!
- * \brief pixTilingPaintTile()
- *
- * \param[in] pixd dest: paint tile onto this, without overlap
- * \param[in] i tile row index
- * \param[in] j tile column index
- * \param[in] pixs source: tile to be painted from
- * \param[in] pt pixtiling struct
- * \return 0 if OK, 1 on error
- */
-l_ok
-pixTilingPaintTile(PIX *pixd,
- l_int32 i,
- l_int32 j,
- PIX *pixs,
- PIXTILING *pt)
-{
-l_int32 w, h;
-
- PROCNAME("pixTilingPaintTile");
-
- if (!pixd)
- return ERROR_INT("pixd not defined", procName, 1);
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
- if (!pt)
- return ERROR_INT("pt not defined", procName, 1);
- if (i < 0 || i >= pt->ny)
- return ERROR_INT("invalid row index i", procName, 1);
- if (j < 0 || j >= pt->nx)
- return ERROR_INT("invalid column index j", procName, 1);
-
- /* Strip added border pixels off if requested */
- pixGetDimensions(pixs, &w, &h, NULL);
- if (pt->strip == TRUE) {
- pixRasterop(pixd, j * pt->w, i * pt->h,
- w - 2 * pt->xoverlap, h - 2 * pt->yoverlap, PIX_SRC,
- pixs, pt->xoverlap, pt->yoverlap);
- } else {
- pixRasterop(pixd, j * pt->w, i * pt->h, w, h, PIX_SRC, pixs, 0, 0);
- }
-
- return 0;
-}
diff --git a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pngio.c b/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pngio.c
deleted file mode 100644
index ff602a29..00000000
--- a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pngio.c
+++ /dev/null
@@ -1,2117 +0,0 @@
-/*====================================================================*
- - Copyright (C) 2001 Leptonica. All rights reserved.
- - Copyright (C) 2017 Milner Technologies, Inc.
- -
- - Redistribution and use in source and binary forms, with or without
- - modification, are permitted provided that the following conditions
- - are met:
- - 1. Redistributions of source code must retain the above copyright
- - notice, this list of conditions and the following disclaimer.
- - 2. Redistributions in binary form must reproduce the above
- - copyright notice, this list of conditions and the following
- - disclaimer in the documentation and/or other materials
- - provided with the distribution.
- -
- - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- - ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- - LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- - A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL ANY
- - CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
- - EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
- - PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
- - PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
- - OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
- - NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- *====================================================================*/
-
-/*!
- * \file pngio.c
- *
- *
- * Reading png through stream
- * PIX *pixReadStreamPng()
- *
- * Reading png header
- * l_int32 readHeaderPng()
- * l_int32 freadHeaderPng()
- * l_int32 readHeaderMemPng()
- *
- * Reading png metadata
- * l_int32 fgetPngResolution()
- * l_int32 isPngInterlaced()
- * l_int32 fgetPngColormapInfo()
- *
- * Writing png through stream
- * l_int32 pixWritePng() [ special top level ]
- * l_int32 pixWriteStreamPng()
- * l_int32 pixSetZlibCompression()
- *
- * Set flag for special read mode
- * void l_pngSetReadStrip16To8()
- *
- * Low-level memio utility (thanks to T. D. Hintz)
- * static void memio_png_write_data()
- * static void memio_png_flush()
- * static void memio_png_read_data()
- * static void memio_free()
- *
- * Reading png from memory
- * PIX *pixReadMemPng()
- *
- * Writing png to memory
- * l_int32 pixWriteMemPng()
- *
- * Documentation: libpng.txt and example.c
- *
- * On input (decompression from file), palette color images
- * are read into an 8 bpp Pix with a colormap, and 24 bpp
- * 3 component color images are read into a 32 bpp Pix with
- * rgb samples. On output (compression to file), palette color
- * images are written as 8 bpp with the colormap, and 32 bpp
- * full color images are written compressed as a 24 bpp,
- * 3 component color image.
- *
- * In the following, we use these abbreviations:
- * bps == bit/sample
- * spp == samples/pixel
- * bpp == bits/pixel of image in Pix (memory)
- * where each component is referred to as a "sample".
- *
- * For reading and writing rgb and rgba images, we read and write
- * alpha if it exists (spp == 4) and do not read or write if
- * it doesn't (spp == 3). The alpha component can be 'removed'
- * simply by setting spp to 3. In leptonica, we make relatively
- * little explicit use of the alpha sample. Note that the alpha
- * sample in the image is also called "alpha transparency",
- * "alpha component" and "alpha layer."
- *
- * To change the zlib compression level, use pixSetZlibCompression()
- * before writing the file. The default is for standard png compression.
- * The zlib compression value can be set [0 ... 9], with
- * 0 no compression (huge files)
- * 1 fastest compression
- * -1 default compression (equivalent to 6 in latest version)
- * 9 best compression
- * Note that if you are using the defined constants in zlib instead
- * of the compression integers given above, you must include zlib.h.
- *
- * There is global for determining the size of retained samples:
- * var_PNG_STRIP_16_to_8
- * and a function l_pngSetReadStrip16To8() for setting it.
- * The default is TRUE, which causes pixRead() to strip each 16 bit
- * sample down to 8 bps:
- * ~ For 16 bps rgb (16 bps, 3 spp) --> 32 bpp rgb Pix
- * ~ For 16 bps gray (16 bps, 1 spp) --> 8 bpp grayscale Pix
- * If the variable is set to FALSE, the 16 bit gray samples
- * are saved when read; the 16 bit rgb samples return an error.
- * Note: results can be non-deterministic if used with
- * multi-threaded applications.
- *
- * Thanks to a memory buffering utility contributed by T. D. Hintz,
- * encoding png directly into memory (and decoding from memory)
- * is now enabled without the use of any temp files. Unlike with webp,
- * it is necessary to preserve the stream interface to enable writing
- * pixa to memory. So there are two independent but very similar
- * implementations of png reading and writing.
- *
- */
-
-#ifdef HAVE_CONFIG_H
-#include
-#endif /* HAVE_CONFIG_H */
-
-#include
-#include "allheaders.h"
-
-/* --------------------------------------------*/
-#if HAVE_LIBPNG /* defined in environ.h */
-/* --------------------------------------------*/
-
-#include "png.h"
-
-#if HAVE_LIBZ
-#include "zlib.h"
-#else
-#define Z_DEFAULT_COMPRESSION (-1)
-#endif /* HAVE_LIBZ */
-
-/* ------------------ Set default for read option -------------------- */
- /* Strip 16 bpp --> 8 bpp on reading png; default is for stripping.
- * If you don't strip, you can't read the gray-alpha spp = 2 images. */
-static l_int32 var_PNG_STRIP_16_TO_8 = 1;
-
-#ifndef NO_CONSOLE_IO
-#define DEBUG_READ 0
-#define DEBUG_WRITE 0
-#endif /* ~NO_CONSOLE_IO */
-
-
-/*---------------------------------------------------------------------*
- * Reading png through stream *
- *---------------------------------------------------------------------*/
-/*!
- * \brief pixReadStreamPng()
- *
- * \param[in] fp file stream
- * \return pix, or NULL on error
- *
- *
- * Notes:
- * (1) If called from pixReadStream(), the stream is positioned
- * at the beginning of the file.
- * (2) To do sequential reads of png format images from a stream,
- * use pixReadStreamPng()
- * (3) Any image with alpha is converted to RGBA (spp = 4, with
- * equal red, green and blue channels) on reading.
- * There are three important cases with alpha:
- * (a) grayscale-with-alpha (spp = 2), where bpp = 8, and each
- * pixel has an associated alpha (transparency) value
- * in the second component of the image data.
- * (b) spp = 1, d = 1 with colormap and alpha in the trans array.
- * Transparency is usually associated with the white background.
- * (c) spp = 1, d = 8 with colormap and alpha in the trans array.
- * Each color in the colormap has a separate transparency value.
- * (4) We use the high level png interface, where the transforms are set
- * up in advance and the header and image are read with a single
- * call. The more complicated interface, where the header is
- * read first and the buffers for the raster image are user-
- * allocated before reading the image, works for single images,
- * but I could not get it to work properly for the successive
- * png reads that are required by pixaReadStream().
- *
- */
-PIX *
-pixReadStreamPng(FILE *fp)
-{
-l_uint8 byte;
-l_int32 rval, gval, bval;
-l_int32 i, j, k, index, ncolors, bitval;
-l_int32 wpl, d, spp, cindex, tRNS;
-l_uint32 png_transforms;
-l_uint32 *data, *line, *ppixel;
-int num_palette, num_text, num_trans;
-png_byte bit_depth, color_type, channels;
-png_uint_32 w, h, rowbytes;
-png_uint_32 xres, yres;
-png_bytep rowptr, trans;
-png_bytep *row_pointers;
-png_structp png_ptr;
-png_infop info_ptr, end_info;
-png_colorp palette;
-png_textp text_ptr; /* ptr to text_chunk */
-PIX *pix, *pix1;
-PIXCMAP *cmap;
-
- PROCNAME("pixReadStreamPng");
-
- if (!fp)
- return (PIX *)ERROR_PTR("fp not defined", procName, NULL);
- pix = NULL;
-
- /* Allocate the 3 data structures */
- if ((png_ptr = png_create_read_struct(PNG_LIBPNG_VER_STRING,
- (png_voidp)NULL, NULL, NULL)) == NULL)
- return (PIX *)ERROR_PTR("png_ptr not made", procName, NULL);
-
- if ((info_ptr = png_create_info_struct(png_ptr)) == NULL) {
- png_destroy_read_struct(&png_ptr, (png_infopp)NULL, (png_infopp)NULL);
- return (PIX *)ERROR_PTR("info_ptr not made", procName, NULL);
- }
-
- if ((end_info = png_create_info_struct(png_ptr)) == NULL) {
- png_destroy_read_struct(&png_ptr, &info_ptr, (png_infopp)NULL);
- return (PIX *)ERROR_PTR("end_info not made", procName, NULL);
- }
-
- /* Set up png setjmp error handling */
- if (setjmp(png_jmpbuf(png_ptr))) {
- png_destroy_read_struct(&png_ptr, &info_ptr, &end_info);
- return (PIX *)ERROR_PTR("internal png error", procName, NULL);
- }
-
- png_init_io(png_ptr, fp);
-
- /* ---------------------------------------------------------- *
- * - Set the transforms flags. Whatever happens here,
- * NEVER invert 1 bpp using PNG_TRANSFORM_INVERT_MONO.
- * - Do not use PNG_TRANSFORM_EXPAND, which would
- * expand all images with bpp < 8 to 8 bpp.
- * - Strip 16 --> 8 if reading 16-bit gray+alpha
- * ---------------------------------------------------------- */
- /* To strip 16 --> 8 bit depth, use PNG_TRANSFORM_STRIP_16 */
- if (var_PNG_STRIP_16_TO_8 == 1) { /* our default */
- png_transforms = PNG_TRANSFORM_STRIP_16;
- } else {
- png_transforms = PNG_TRANSFORM_IDENTITY;
- L_INFO("not stripping 16 --> 8 in png reading\n", procName);
- }
-
- /* Read it */
- png_read_png(png_ptr, info_ptr, png_transforms, NULL);
-
- row_pointers = png_get_rows(png_ptr, info_ptr);
- w = png_get_image_width(png_ptr, info_ptr);
- h = png_get_image_height(png_ptr, info_ptr);
- bit_depth = png_get_bit_depth(png_ptr, info_ptr);
- rowbytes = png_get_rowbytes(png_ptr, info_ptr);
- color_type = png_get_color_type(png_ptr, info_ptr);
- channels = png_get_channels(png_ptr, info_ptr);
- spp = channels;
- tRNS = png_get_valid(png_ptr, info_ptr, PNG_INFO_tRNS) ? 1 : 0;
-
- if (spp == 1) {
- d = bit_depth;
- } else { /* spp == 2 (gray + alpha), spp == 3 (rgb), spp == 4 (rgba) */
- d = 4 * bit_depth;
- }
-
- /* Remove if/when this is implemented for all bit_depths */
- if (spp != 1 && bit_depth != 8) {
- L_ERROR("spp = %d and bps = %d != 8\n"
- "turn on 16 --> 8 stripping\n", procName, spp, bit_depth);
- png_destroy_read_struct(&png_ptr, &info_ptr, &end_info);
- return (PIX *)ERROR_PTR("not implemented for this image",
- procName, NULL);
- }
-
- cmap = NULL;
- if (color_type == PNG_COLOR_TYPE_PALETTE ||
- color_type == PNG_COLOR_MASK_PALETTE) { /* generate a colormap */
- png_get_PLTE(png_ptr, info_ptr, &palette, &num_palette);
- cmap = pixcmapCreate(d); /* spp == 1 */
- for (cindex = 0; cindex < num_palette; cindex++) {
- rval = palette[cindex].red;
- gval = palette[cindex].green;
- bval = palette[cindex].blue;
- pixcmapAddColor(cmap, rval, gval, bval);
- }
- }
-
- if ((pix = pixCreate(w, h, d)) == NULL) {
- pixcmapDestroy(&cmap);
- png_destroy_read_struct(&png_ptr, &info_ptr, &end_info);
- return (PIX *)ERROR_PTR("pix not made", procName, NULL);
- }
- pixSetInputFormat(pix, IFF_PNG);
- wpl = pixGetWpl(pix);
- data = pixGetData(pix);
- pixSetColormap(pix, cmap);
- pixSetSpp(pix, spp);
-
- if (spp == 1 && !tRNS) { /* copy straight from buffer to pix */
- for (i = 0; i < h; i++) {
- line = data + i * wpl;
- rowptr = row_pointers[i];
- for (j = 0; j < rowbytes; j++) {
- SET_DATA_BYTE(line, j, rowptr[j]);
- }
- }
- } else if (spp == 2) { /* grayscale + alpha; convert to RGBA */
- L_INFO("converting (gray + alpha) ==> RGBA\n", procName);
- for (i = 0; i < h; i++) {
- ppixel = data + i * wpl;
- rowptr = row_pointers[i];
- for (j = k = 0; j < w; j++) {
- /* Copy gray value into r, g and b */
- SET_DATA_BYTE(ppixel, COLOR_RED, rowptr[k]);
- SET_DATA_BYTE(ppixel, COLOR_GREEN, rowptr[k]);
- SET_DATA_BYTE(ppixel, COLOR_BLUE, rowptr[k++]);
- SET_DATA_BYTE(ppixel, L_ALPHA_CHANNEL, rowptr[k++]);
- ppixel++;
- }
- }
- pixSetSpp(pix, 4); /* we do not support 2 spp pix */
- } else if (spp == 3 || spp == 4) {
- for (i = 0; i < h; i++) {
- ppixel = data + i * wpl;
- rowptr = row_pointers[i];
- for (j = k = 0; j < w; j++) {
- SET_DATA_BYTE(ppixel, COLOR_RED, rowptr[k++]);
- SET_DATA_BYTE(ppixel, COLOR_GREEN, rowptr[k++]);
- SET_DATA_BYTE(ppixel, COLOR_BLUE, rowptr[k++]);
- if (spp == 3) /* set to opaque; some readers are buggy */
- SET_DATA_BYTE(ppixel, L_ALPHA_CHANNEL, 255);
- else /* spp == 4 */
- SET_DATA_BYTE(ppixel, L_ALPHA_CHANNEL, rowptr[k++]);
- ppixel++;
- }
- }
- }
-
- /* Special spp == 1 cases with transparency:
- * (1) 8 bpp without colormap; assume full transparency
- * (2) 1 bpp with colormap + trans array (for alpha)
- * (3) 8 bpp with colormap + trans array (for alpha)
- * These all require converting to RGBA */
- if (spp == 1 && tRNS) {
- if (!cmap) {
- /* Case 1: make fully transparent RGBA image */
- L_INFO("transparency, 1 spp, no colormap, no transparency array: "
- "convention is fully transparent image\n", procName);
- L_INFO("converting (fully transparent 1 spp) ==> RGBA\n", procName);
- pixDestroy(&pix);
- pix = pixCreate(w, h, 32); /* init to alpha = 0 (transparent) */
- pixSetSpp(pix, 4);
- } else {
- L_INFO("converting (cmap + alpha) ==> RGBA\n", procName);
-
- /* Grab the transparency array */
- png_get_tRNS(png_ptr, info_ptr, &trans, &num_trans, NULL);
- if (!trans) { /* invalid png file */
- pixDestroy(&pix);
- png_destroy_read_struct(&png_ptr, &info_ptr, &end_info);
- return (PIX *)ERROR_PTR("cmap, tRNS, but no transparency array",
- procName, NULL);
- }
-
- /* Save the cmap and destroy the pix */
- cmap = pixcmapCopy(pixGetColormap(pix));
- ncolors = pixcmapGetCount(cmap);
- pixDestroy(&pix);
-
- /* Start over with 32 bit RGBA */
- pix = pixCreate(w, h, 32);
- wpl = pixGetWpl(pix);
- data = pixGetData(pix);
- pixSetSpp(pix, 4);
-
-#if DEBUG_READ
- lept_stderr("ncolors = %d, num_trans = %d\n",
- ncolors, num_trans);
- for (i = 0; i < ncolors; i++) {
- pixcmapGetColor(cmap, i, &rval, &gval, &bval);
- if (i < num_trans) {
- lept_stderr("(r,g,b,a) = (%d,%d,%d,%d)\n",
- rval, gval, bval, trans[i]);
- } else {
- lept_stderr("(r,g,b,a) = (%d,%d,%d,<<255>>)\n",
- rval, gval, bval);
- }
- }
-#endif /* DEBUG_READ */
-
- /* Extract the data and convert to RGBA */
- if (d == 1) {
- /* Case 2: 1 bpp with transparency (usually) behind white */
- L_INFO("converting 1 bpp cmap with alpha ==> RGBA\n", procName);
- if (num_trans == 1)
- L_INFO("num_trans = 1; second color opaque by default\n",
- procName);
- for (i = 0; i < h; i++) {
- ppixel = data + i * wpl;
- rowptr = row_pointers[i];
- for (j = 0, index = 0; j < rowbytes; j++) {
- byte = rowptr[j];
- for (k = 0; k < 8 && index < w; k++, index++) {
- bitval = (byte >> (7 - k)) & 1;
- pixcmapGetColor(cmap, bitval, &rval, &gval, &bval);
- composeRGBPixel(rval, gval, bval, ppixel);
- SET_DATA_BYTE(ppixel, L_ALPHA_CHANNEL,
- bitval < num_trans ? trans[bitval] : 255);
- ppixel++;
- }
- }
- }
- } else if (d == 8) {
- /* Case 3: 8 bpp with cmap and associated transparency */
- L_INFO("converting 8 bpp cmap with alpha ==> RGBA\n", procName);
- for (i = 0; i < h; i++) {
- ppixel = data + i * wpl;
- rowptr = row_pointers[i];
- for (j = 0; j < w; j++) {
- index = rowptr[j];
- pixcmapGetColor(cmap, index, &rval, &gval, &bval);
- composeRGBPixel(rval, gval, bval, ppixel);
- /* Assume missing entries to be 255 (opaque)
- * according to the spec:
- * http://www.w3.org/TR/PNG/#11tRNS */
- SET_DATA_BYTE(ppixel, L_ALPHA_CHANNEL,
- index < num_trans ? trans[index] : 255);
- ppixel++;
- }
- }
- } else {
- L_ERROR("spp == 1, cmap, trans array, invalid depth: %d\n",
- procName, d);
- }
- pixcmapDestroy(&cmap);
- }
- }
-
-#if DEBUG_READ
- if (cmap) {
- for (i = 0; i < 16; i++) {
- lept_stderr("[%d] = %d\n", i, ((l_uint8 *)(cmap->array))[i]);
- }
- }
-#endif /* DEBUG_READ */
-
- /* Final adjustments for bpp = 1.
- * + If there is no colormap, the image must be inverted because
- * png stores black pixels as 0.
- * + We have already handled the case of cmapped, 1 bpp pix
- * with transparency, where the output pix is 32 bpp RGBA.
- * If there is no transparency but the pix has a colormap,
- * we remove the colormap, because functions operating on
- * 1 bpp images in leptonica assume no colormap.
- * + The colormap must be removed in such a way that the pixel
- * values are not changed. If the values are only black and
- * white, we return a 1 bpp image; if gray, return an 8 bpp pix;
- * otherwise, return a 32 bpp rgb pix.
- *
- * Note that we cannot use the PNG_TRANSFORM_INVERT_MONO flag
- * to do the inversion, because that flag (since version 1.0.9)
- * inverts 8 bpp grayscale as well, which we don't want to do.
- * (It also doesn't work if there is a colormap.)
- *
- * Note that if the input png is a 1-bit with colormap and
- * transparency, it has already been rendered as a 32 bpp,
- * spp = 4 rgba pix.
- */
- if (pixGetDepth(pix) == 1) {
- if (!cmap) {
- pixInvert(pix, pix);
- } else {
- L_INFO("removing opaque cmap from 1 bpp\n", procName);
- pix1 = pixRemoveColormap(pix, REMOVE_CMAP_BASED_ON_SRC);
- pixDestroy(&pix);
- pix = pix1;
- }
- }
-
- xres = png_get_x_pixels_per_meter(png_ptr, info_ptr);
- yres = png_get_y_pixels_per_meter(png_ptr, info_ptr);
- pixSetXRes(pix, (l_int32)((l_float32)xres / 39.37 + 0.5)); /* to ppi */
- pixSetYRes(pix, (l_int32)((l_float32)yres / 39.37 + 0.5)); /* to ppi */
-
- /* Get the text if there is any */
- png_get_text(png_ptr, info_ptr, &text_ptr, &num_text);
- if (num_text && text_ptr)
- pixSetText(pix, text_ptr->text);
-
- png_destroy_read_struct(&png_ptr, &info_ptr, &end_info);
- return pix;
-}
-
-
-/*---------------------------------------------------------------------*
- * Reading png header *
- *---------------------------------------------------------------------*/
-/*!
- * \brief readHeaderPng()
- *
- * \param[in] filename
- * \param[out] pw [optional]
- * \param[out] ph [optional]
- * \param[out] pbps [optional] bits/sample
- * \param[out] pspp [optional] samples/pixel
- * \param[out] piscmap [optional]
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) If there is a colormap, iscmap is returned as 1; else 0.
- * (2) For gray+alpha, although the png records bps = 16, we
- * consider this as two 8 bpp samples (gray and alpha).
- * When a gray+alpha is read, it is converted to 32 bpp RGBA.
- *
- */
-l_ok
-readHeaderPng(const char *filename,
- l_int32 *pw,
- l_int32 *ph,
- l_int32 *pbps,
- l_int32 *pspp,
- l_int32 *piscmap)
-{
-l_int32 ret;
-FILE *fp;
-
- PROCNAME("readHeaderPng");
-
- if (pw) *pw = 0;
- if (ph) *ph = 0;
- if (pbps) *pbps = 0;
- if (pspp) *pspp = 0;
- if (piscmap) *piscmap = 0;
- if (!filename)
- return ERROR_INT("filename not defined", procName, 1);
- if ((fp = fopenReadStream(filename)) == NULL)
- return ERROR_INT("image file not found", procName, 1);
- ret = freadHeaderPng(fp, pw, ph, pbps, pspp, piscmap);
- fclose(fp);
- return ret;
-}
-
-
-/*!
- * \brief freadHeaderPng()
- *
- * \param[in] fp file stream
- * \param[out] pw [optional]
- * \param[out] ph [optional]
- * \param[out] pbps [optional] bits/sample
- * \param[out] pspp [optional] samples/pixel
- * \param[out] piscmap [optional]
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) See readHeaderPng(). We only need the first 40 bytes in the file.
- *
- */
-l_ok
-freadHeaderPng(FILE *fp,
- l_int32 *pw,
- l_int32 *ph,
- l_int32 *pbps,
- l_int32 *pspp,
- l_int32 *piscmap)
-{
-l_int32 nbytes, ret;
-l_uint8 data[40];
-
- PROCNAME("freadHeaderPng");
-
- if (pw) *pw = 0;
- if (ph) *ph = 0;
- if (pbps) *pbps = 0;
- if (pspp) *pspp = 0;
- if (piscmap) *piscmap = 0;
- if (!fp)
- return ERROR_INT("stream not defined", procName, 1);
-
- nbytes = fnbytesInFile(fp);
- if (nbytes < 40)
- return ERROR_INT("file too small to be png", procName, 1);
- if (fread(data, 1, 40, fp) != 40)
- return ERROR_INT("error reading data", procName, 1);
- ret = readHeaderMemPng(data, 40, pw, ph, pbps, pspp, piscmap);
- return ret;
-}
-
-
-/*!
- * \brief readHeaderMemPng()
- *
- * \param[in] data
- * \param[in] size 40 bytes is sufficient
- * \param[out] pw [optional]
- * \param[out] ph [optional]
- * \param[out] pbps [optional] bits/sample
- * \param[out] pspp [optional] samples/pixel
- * \param[out] piscmap [optional] input NULL to ignore
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) See readHeaderPng().
- * (2) png colortypes (see png.h: PNG_COLOR_TYPE_*):
- * 0: gray; fully transparent (with tRNS) (1 spp)
- * 2: RGB (3 spp)
- * 3: colormap; colormap+alpha (with tRNS) (1 spp)
- * 4: gray + alpha (2 spp)
- * 6: RGBA (4 spp)
- * Note:
- * 0 and 3 have the alpha information in a tRNS chunk
- * 4 and 6 have separate alpha samples with each pixel.
- *
- */
-l_ok
-readHeaderMemPng(const l_uint8 *data,
- size_t size,
- l_int32 *pw,
- l_int32 *ph,
- l_int32 *pbps,
- l_int32 *pspp,
- l_int32 *piscmap)
-{
-l_uint16 twobytes;
-l_uint16 *pshort;
-l_int32 colortype, w, h, bps, spp;
-l_uint32 *pword;
-
- PROCNAME("readHeaderMemPng");
-
- if (pw) *pw = 0;
- if (ph) *ph = 0;
- if (pbps) *pbps = 0;
- if (pspp) *pspp = 0;
- if (piscmap) *piscmap = 0;
- if (!data)
- return ERROR_INT("data not defined", procName, 1);
- if (size < 40)
- return ERROR_INT("size < 40", procName, 1);
-
- /* Check password */
- if (data[0] != 137 || data[1] != 80 || data[2] != 78 ||
- data[3] != 71 || data[4] != 13 || data[5] != 10 ||
- data[6] != 26 || data[7] != 10)
- return ERROR_INT("not a valid png file", procName, 1);
-
- pword = (l_uint32 *)data;
- pshort = (l_uint16 *)data;
- w = convertOnLittleEnd32(pword[4]);
- h = convertOnLittleEnd32(pword[5]);
- if (w < 1 || h < 1)
- return ERROR_INT("invalid w or h", procName, 1);
- twobytes = convertOnLittleEnd16(pshort[12]); /* contains depth/sample */
- /* and the color type */
- colortype = twobytes & 0xff; /* color type */
- bps = twobytes >> 8; /* bits/sample */
-
- /* Special case with alpha that is extracted as RGBA.
- * Note that the cmap+alpha is also extracted as RGBA,
- * but only if the tRNS chunk exists, which we can't tell
- * by this simple parser.*/
- if (colortype == 4)
- L_INFO("gray + alpha: will extract as RGBA (spp = 4)\n", procName);
-
- if (colortype == 2) { /* RGB */
- spp = 3;
- } else if (colortype == 6) { /* RGBA */
- spp = 4;
- } else if (colortype == 4) { /* gray + alpha */
- spp = 2;
- bps = 8; /* both the gray and alpha are 8-bit samples */
- } else { /* gray (0) or cmap (3) or cmap+alpha (3) */
- spp = 1;
- }
- if (bps < 1 || bps > 16) {
- L_ERROR("invalid bps = %d\n", procName, bps);
- return 1;
- }
- if (pw) *pw = w;
- if (ph) *ph = h;
- if (pbps) *pbps = bps;
- if (pspp) *pspp = spp;
- if (piscmap) {
- if (colortype & 1) /* palette */
- *piscmap = 1;
- else
- *piscmap = 0;
- }
-
- return 0;
-}
-
-
-/*---------------------------------------------------------------------*
- * Reading png metadata *
- *---------------------------------------------------------------------*/
-/*
- * fgetPngResolution()
- *
- * Input: fp (file stream opened for read)
- * &xres, &yres ( resolution in ppi)
- * Return: 0 if OK; 1 on error
- *
- * Notes:
- * (1) If neither resolution field is set, this is not an error;
- * the returned resolution values are 0 (designating 'unknown').
- * (2) Side-effect: this rewinds the stream.
- */
-l_int32
-fgetPngResolution(FILE *fp,
- l_int32 *pxres,
- l_int32 *pyres)
-{
-png_uint_32 xres, yres;
-png_structp png_ptr;
-png_infop info_ptr;
-
- PROCNAME("fgetPngResolution");
-
- if (pxres) *pxres = 0;
- if (pyres) *pyres = 0;
- if (!fp)
- return ERROR_INT("stream not opened", procName, 1);
- if (!pxres || !pyres)
- return ERROR_INT("&xres and &yres not both defined", procName, 1);
-
- /* Make the two required structs */
- if ((png_ptr = png_create_read_struct(PNG_LIBPNG_VER_STRING,
- (png_voidp)NULL, NULL, NULL)) == NULL)
- return ERROR_INT("png_ptr not made", procName, 1);
- if ((info_ptr = png_create_info_struct(png_ptr)) == NULL) {
- png_destroy_read_struct(&png_ptr, (png_infopp)NULL, (png_infopp)NULL);
- return ERROR_INT("info_ptr not made", procName, 1);
- }
-
- /* Set up png setjmp error handling.
- * Without this, an error calls exit. */
- if (setjmp(png_jmpbuf(png_ptr))) {
- png_destroy_read_struct(&png_ptr, &info_ptr, (png_infopp)NULL);
- return ERROR_INT("internal png error", procName, 1);
- }
-
- /* Read the metadata */
- rewind(fp);
- png_init_io(png_ptr, fp);
- png_read_info(png_ptr, info_ptr);
-
- xres = png_get_x_pixels_per_meter(png_ptr, info_ptr);
- yres = png_get_y_pixels_per_meter(png_ptr, info_ptr);
- *pxres = (l_int32)((l_float32)xres / 39.37 + 0.5); /* to ppi */
- *pyres = (l_int32)((l_float32)yres / 39.37 + 0.5);
-
- png_destroy_read_struct(&png_ptr, &info_ptr, NULL);
- rewind(fp);
- return 0;
-}
-
-
-/*!
- * \brief isPngInterlaced()
- *
- * \param[in] filename
- * \param[out] pinterlaced 1 if interlaced png; 0 otherwise
- * \return 0 if OK, 1 on error
- */
-l_ok
-isPngInterlaced(const char *filename,
- l_int32 *pinterlaced)
-{
-l_uint8 buf[32];
-FILE *fp;
-
- PROCNAME("isPngInterlaced");
-
- if (!pinterlaced)
- return ERROR_INT("&interlaced not defined", procName, 1);
- *pinterlaced = 0;
- if (!filename)
- return ERROR_INT("filename not defined", procName, 1);
-
- if ((fp = fopenReadStream(filename)) == NULL)
- return ERROR_INT("stream not opened", procName, 1);
- if (fread(buf, 1, 32, fp) != 32) {
- fclose(fp);
- return ERROR_INT("data not read", procName, 1);
- }
- fclose(fp);
-
- *pinterlaced = (buf[28] == 0) ? 0 : 1;
- return 0;
-}
-
-
-/*
- * \brief fgetPngColormapInfo()
- *
- * \param[in] fp file stream opened for read
- * \param[out] pcmap optional; use NULL to skip
- * \param[out] ptransparency optional; 1 if colormapped with
- * transparency, 0 otherwise; use NULL to skip
- * \return 0 if OK, 1 on error
- *
- * Notes:
- * (1) The transparency information in a png is in the tRNA array,
- * which is separate from the colormap. If this array exists
- * and if any element is less than 255, there exists some
- * transparency.
- * (2) Side-effect: this rewinds the stream.
- */
-l_ok
-fgetPngColormapInfo(FILE *fp,
- PIXCMAP **pcmap,
- l_int32 *ptransparency)
-{
-l_int32 i, cindex, rval, gval, bval, num_palette, num_trans;
-png_byte bit_depth, color_type;
-png_bytep trans;
-png_colorp palette;
-png_structp png_ptr;
-png_infop info_ptr;
-
- PROCNAME("fgetPngColormapInfo");
-
- if (pcmap) *pcmap = NULL;
- if (ptransparency) *ptransparency = 0;
- if (!pcmap && !ptransparency)
- return ERROR_INT("no output defined", procName, 1);
- if (!fp)
- return ERROR_INT("stream not opened", procName, 1);
-
- /* Make the two required structs */
- if ((png_ptr = png_create_read_struct(PNG_LIBPNG_VER_STRING,
- (png_voidp)NULL, NULL, NULL)) == NULL)
- return ERROR_INT("png_ptr not made", procName, 1);
- if ((info_ptr = png_create_info_struct(png_ptr)) == NULL) {
- png_destroy_read_struct(&png_ptr, (png_infopp)NULL, (png_infopp)NULL);
- return ERROR_INT("info_ptr not made", procName, 1);
- }
-
- /* Set up png setjmp error handling.
- * Without this, an error calls exit. */
- if (setjmp(png_jmpbuf(png_ptr))) {
- png_destroy_read_struct(&png_ptr, &info_ptr, NULL);
- if (pcmap && *pcmap) pixcmapDestroy(pcmap);
- return ERROR_INT("internal png error", procName, 1);
- }
-
- /* Read the metadata and check if there is a colormap */
- rewind(fp);
- png_init_io(png_ptr, fp);
- png_read_info(png_ptr, info_ptr);
- color_type = png_get_color_type(png_ptr, info_ptr);
- if (color_type != PNG_COLOR_TYPE_PALETTE &&
- color_type != PNG_COLOR_MASK_PALETTE) {
- png_destroy_read_struct(&png_ptr, &info_ptr, NULL);
- return 0;
- }
-
- /* Optionally, read the colormap */
- if (pcmap) {
- bit_depth = png_get_bit_depth(png_ptr, info_ptr);
- png_get_PLTE(png_ptr, info_ptr, &palette, &num_palette);
- *pcmap = pixcmapCreate(bit_depth); /* spp == 1 */
- for (cindex = 0; cindex < num_palette; cindex++) {
- rval = palette[cindex].red;
- gval = palette[cindex].green;
- bval = palette[cindex].blue;
- pixcmapAddColor(*pcmap, rval, gval, bval);
- }
- }
-
- /* Optionally, look for transparency. Note that the colormap
- * has been initialized to fully opaque. */
- if (ptransparency && png_get_valid(png_ptr, info_ptr, PNG_INFO_tRNS)) {
- png_get_tRNS(png_ptr, info_ptr, &trans, &num_trans, NULL);
- if (trans) {
- for (i = 0; i < num_trans; i++) {
- if (trans[i] < 255) { /* not fully opaque */
- *ptransparency = 1;
- if (pcmap) pixcmapSetAlpha(*pcmap, i, trans[i]);
- }
- }
- } else {
- L_ERROR("transparency array not returned\n", procName);
- }
- }
-
- png_destroy_read_struct(&png_ptr, &info_ptr, NULL);
- rewind(fp);
- return 0;
-}
-
-
-/*---------------------------------------------------------------------*
- * Writing png through stream *
- *---------------------------------------------------------------------*/
-/*!
- * \brief pixWritePng()
- *
- * \param[in] filename
- * \param[in] pix
- * \param[in] gamma
- * \return 0 if OK; 1 on error
- *
- *
- * Notes:
- * (1) Special version for writing png with a specified gamma.
- * When using pixWrite(), no field is given for gamma.
- *
- */
-l_ok
-pixWritePng(const char *filename,
- PIX *pix,
- l_float32 gamma)
-{
-FILE *fp;
-
- PROCNAME("pixWritePng");
-
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
- if (!filename)
- return ERROR_INT("filename not defined", procName, 1);
-
- if ((fp = fopenWriteStream(filename, "wb+")) == NULL)
- return ERROR_INT("stream not opened", procName, 1);
-
- if (pixWriteStreamPng(fp, pix, gamma)) {
- fclose(fp);
- return ERROR_INT("pix not written to stream", procName, 1);
- }
-
- fclose(fp);
- return 0;
-}
-
-
-/*!
- * \brief pixWriteStreamPng()
- *
- * \param[in] fp file stream
- * \param[in] pix
- * \param[in] gamma use 0.0 if gamma is not defined
- * \return 0 if OK; 1 on error
- *
- *
- * Notes:
- * (1) If called from pixWriteStream(), the stream is positioned
- * at the beginning of the file.
- * (2) To do sequential writes of png format images to a stream,
- * use pixWriteStreamPng() directly.
- * (3) gamma is an optional png chunk. If no gamma value is to be
- * placed into the file, use gamma = 0.0. Otherwise, if
- * gamma > 0.0, its value is written into the header.
- * (4) The use of gamma in png is highly problematic. For an illuminating
- * discussion, see: http://hsivonen.iki.fi/png-gamma/
- * (5) What is the effect/meaning of gamma in the png file? This
- * gamma, which we can call the 'source' gamma, is the
- * inverse of the gamma that was used in enhance.c to brighten
- * or darken images. The 'source' gamma is supposed to indicate
- * the intensity mapping that was done at the time the
- * image was captured. Display programs typically apply a
- * 'display' gamma of 2.2 to the output, which is intended
- * to linearize the intensity based on the response of
- * thermionic tubes (CRTs). Flat panel LCDs have typically
- * been designed to give a similar response as CRTs (call it
- * "backward compatibility"). The 'display' gamma is
- * in some sense the inverse of the 'source' gamma.
- * jpeg encoders attached to scanners and cameras will lighten
- * the pixels, applying a gamma corresponding to approximately
- * a square-root relation of output vs input:
- * output = input^(gamma)
- * where gamma is often set near 0.4545 (1/gamma is 2.2).
- * This is stored in the image file. Then if the display
- * program reads the gamma, it will apply a display gamma,
- * typically about 2.2; the product is 1.0, and the
- * display program produces a linear output. This works because
- * the dark colors were appropriately boosted by the scanner,
- * as described by the 'source' gamma, so they should not
- * be further boosted by the display program.
- * (6) As an example, with xv and display, if no gamma is stored,
- * the program acts as if gamma were 0.4545, multiplies this by 2.2,
- * and does a linear rendering. Taking this as a baseline
- * brightness, if the stored gamma is:
- * > 0.4545, the image is rendered lighter than baseline
- * < 0.4545, the image is rendered darker than baseline
- * In contrast, gqview seems to ignore the gamma chunk in png.
- * (7) The only valid pixel depths in leptonica are 1, 2, 4, 8, 16
- * and 32. However, it is possible, and in some cases desirable,
- * to write out a png file using an rgb pix that has 24 bpp.
- * For example, the open source xpdf SplashBitmap class generates
- * 24 bpp rgb images. Consequently, we enable writing 24 bpp pix.
- * To generate such a pix, you can make a 24 bpp pix without data
- * and assign the data array to the pix; e.g.,
- * pix = pixCreateHeader(w, h, 24);
- * pixSetData(pix, rgbdata);
- * See pixConvert32To24() for an example, where we get rgbdata
- * from the 32 bpp pix. Caution: do not call pixSetPadBits(),
- * because the alignment is wrong and you may erase part of the
- * last pixel on each line.
- * (8) If the pix has a colormap, it is written to file. In most
- * situations, the alpha component is 255 for each colormap entry,
- * which is opaque and indicates that it should be ignored.
- * However, if any alpha component is not 255, it is assumed that
- * the alpha values are valid, and they are written to the png
- * file in a tRNS segment. On readback, the tRNS segment is
- * identified, and the colormapped image with alpha is converted
- * to a 4 spp rgba image.
- *
- */
-l_ok
-pixWriteStreamPng(FILE *fp,
- PIX *pix,
- l_float32 gamma)
-{
-char commentstring[] = "Comment";
-l_int32 i, j, k;
-l_int32 wpl, d, spp, cmflag, opaque;
-l_int32 ncolors, compval;
-l_int32 *rmap, *gmap, *bmap, *amap;
-l_uint32 *data, *ppixel;
-png_byte bit_depth, color_type;
-png_byte alpha[256];
-png_uint_32 w, h;
-png_uint_32 xres, yres;
-png_bytep *row_pointers;
-png_bytep rowbuffer;
-png_structp png_ptr;
-png_infop info_ptr;
-png_colorp palette;
-PIX *pix1;
-PIXCMAP *cmap;
-char *text;
-
- PROCNAME("pixWriteStreamPng");
-
- if (!fp)
- return ERROR_INT("stream not open", procName, 1);
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
-
- /* Allocate the 2 data structures */
- if ((png_ptr = png_create_write_struct(PNG_LIBPNG_VER_STRING,
- (png_voidp)NULL, NULL, NULL)) == NULL)
- return ERROR_INT("png_ptr not made", procName, 1);
-
- if ((info_ptr = png_create_info_struct(png_ptr)) == NULL) {
- png_destroy_write_struct(&png_ptr, (png_infopp)NULL);
- return ERROR_INT("info_ptr not made", procName, 1);
- }
-
- /* Set up png setjmp error handling */
- if (setjmp(png_jmpbuf(png_ptr))) {
- png_destroy_write_struct(&png_ptr, &info_ptr);
- return ERROR_INT("internal png error", procName, 1);
- }
-
- png_init_io(png_ptr, fp);
-
- /* With best zlib compression (9), get between 1 and 10% improvement
- * over default (6), but the compression is 3 to 10 times slower.
- * Use the zlib default (6) as our default compression unless
- * pix->special falls in the range [10 ... 19]; then subtract 10
- * to get the compression value. */
- compval = Z_DEFAULT_COMPRESSION;
- if (pix->special >= 10 && pix->special < 20)
- compval = pix->special - 10;
- png_set_compression_level(png_ptr, compval);
-
- w = pixGetWidth(pix);
- h = pixGetHeight(pix);
- d = pixGetDepth(pix);
- spp = pixGetSpp(pix);
- if ((cmap = pixGetColormap(pix)))
- cmflag = 1;
- else
- cmflag = 0;
- pixSetPadBits(pix, 0);
-
- /* Set the color type and bit depth. */
- if (d == 32 && spp == 4) {
- bit_depth = 8;
- color_type = PNG_COLOR_TYPE_RGBA; /* 6 */
- cmflag = 0; /* ignore if it exists */
- } else if (d == 24 || d == 32) {
- bit_depth = 8;
- color_type = PNG_COLOR_TYPE_RGB; /* 2 */
- cmflag = 0; /* ignore if it exists */
- } else {
- bit_depth = d;
- color_type = PNG_COLOR_TYPE_GRAY; /* 0 */
- }
- if (cmflag)
- color_type = PNG_COLOR_TYPE_PALETTE; /* 3 */
-
-#if DEBUG_WRITE
- lept_stderr("cmflag = %d, bit_depth = %d, color_type = %d\n",
- cmflag, bit_depth, color_type);
-#endif /* DEBUG_WRITE */
-
- png_set_IHDR(png_ptr, info_ptr, w, h, bit_depth, color_type,
- PNG_INTERLACE_NONE, PNG_COMPRESSION_TYPE_BASE,
- PNG_FILTER_TYPE_BASE);
-
- /* Store resolution in ppm, if known */
- xres = (png_uint_32)(39.37 * (l_float32)pixGetXRes(pix) + 0.5);
- yres = (png_uint_32)(39.37 * (l_float32)pixGetYRes(pix) + 0.5);
- if ((xres == 0) || (yres == 0))
- png_set_pHYs(png_ptr, info_ptr, 0, 0, PNG_RESOLUTION_UNKNOWN);
- else
- png_set_pHYs(png_ptr, info_ptr, xres, yres, PNG_RESOLUTION_METER);
-
- if (cmflag) {
- pixcmapToArrays(cmap, &rmap, &gmap, &bmap, &amap);
- ncolors = pixcmapGetCount(cmap);
- pixcmapIsOpaque(cmap, &opaque);
-
- /* Make and save the palette */
- palette = (png_colorp)LEPT_CALLOC(ncolors, sizeof(png_color));
- for (i = 0; i < ncolors; i++) {
- palette[i].red = (png_byte)rmap[i];
- palette[i].green = (png_byte)gmap[i];
- palette[i].blue = (png_byte)bmap[i];
- alpha[i] = (png_byte)amap[i];
- }
-
- png_set_PLTE(png_ptr, info_ptr, palette, (int)ncolors);
- if (!opaque) /* alpha channel has some transparency; assume valid */
- png_set_tRNS(png_ptr, info_ptr, (png_bytep)alpha,
- (int)ncolors, NULL);
- LEPT_FREE(rmap);
- LEPT_FREE(gmap);
- LEPT_FREE(bmap);
- LEPT_FREE(amap);
- }
-
- /* 0.4545 is treated as the default by some image
- * display programs (not gqview). A value > 0.4545 will
- * lighten an image as displayed by xv, display, etc. */
- if (gamma > 0.0)
- png_set_gAMA(png_ptr, info_ptr, (l_float64)gamma);
-
- if ((text = pixGetText(pix))) {
- png_text text_chunk;
- text_chunk.compression = PNG_TEXT_COMPRESSION_NONE;
- text_chunk.key = commentstring;
- text_chunk.text = text;
- text_chunk.text_length = strlen(text);
-#ifdef PNG_ITXT_SUPPORTED
- text_chunk.itxt_length = 0;
- text_chunk.lang = NULL;
- text_chunk.lang_key = NULL;
-#endif
- png_set_text(png_ptr, info_ptr, &text_chunk, 1);
- }
-
- /* Write header and palette info */
- png_write_info(png_ptr, info_ptr);
-
- if ((d != 32) && (d != 24)) { /* not rgb color */
- /* Generate a temporary pix with bytes swapped.
- * For writing a 1 bpp image as png:
- * ~ if no colormap, invert the data, because png writes
- * black as 0
- * ~ if colormapped, do not invert the data; the two RGBA
- * colors can have any value. */
- if (d == 1 && !cmap) {
- pix1 = pixInvert(NULL, pix);
- pixEndianByteSwap(pix1);
- } else {
- pix1 = pixEndianByteSwapNew(pix);
- }
- if (!pix1) {
- png_destroy_write_struct(&png_ptr, &info_ptr);
- if (cmflag) LEPT_FREE(palette);
- return ERROR_INT("pix1 not made", procName, 1);
- }
-
- /* Make and assign array of image row pointers */
- row_pointers = (png_bytep *)LEPT_CALLOC(h, sizeof(png_bytep));
- wpl = pixGetWpl(pix1);
- data = pixGetData(pix1);
- for (i = 0; i < h; i++)
- row_pointers[i] = (png_bytep)(data + i * wpl);
- png_set_rows(png_ptr, info_ptr, row_pointers);
-
- /* Transfer the data */
- png_write_image(png_ptr, row_pointers);
- png_write_end(png_ptr, info_ptr);
-
- if (cmflag) LEPT_FREE(palette);
- LEPT_FREE(row_pointers);
- pixDestroy(&pix1);
- png_destroy_write_struct(&png_ptr, &info_ptr);
- return 0;
- }
-
- /* For rgb, compose and write a row at a time */
- data = pixGetData(pix);
- wpl = pixGetWpl(pix);
- if (d == 24) { /* See note 7 above: special case of 24 bpp rgb */
- for (i = 0; i < h; i++) {
- ppixel = data + i * wpl;
- png_write_rows(png_ptr, (png_bytepp)&ppixel, 1);
- }
- } else { /* 32 bpp rgb and rgba. Write out the alpha channel if either
- * the pix has 4 spp or writing it is requested anyway */
- rowbuffer = (png_bytep)LEPT_CALLOC(w, 4);
- for (i = 0; i < h; i++) {
- ppixel = data + i * wpl;
- for (j = k = 0; j < w; j++) {
- rowbuffer[k++] = GET_DATA_BYTE(ppixel, COLOR_RED);
- rowbuffer[k++] = GET_DATA_BYTE(ppixel, COLOR_GREEN);
- rowbuffer[k++] = GET_DATA_BYTE(ppixel, COLOR_BLUE);
- if (spp == 4)
- rowbuffer[k++] = GET_DATA_BYTE(ppixel, L_ALPHA_CHANNEL);
- ppixel++;
- }
-
- png_write_rows(png_ptr, &rowbuffer, 1);
- }
- LEPT_FREE(rowbuffer);
- }
-
- png_write_end(png_ptr, info_ptr);
-
- if (cmflag)
- LEPT_FREE(palette);
- png_destroy_write_struct(&png_ptr, &info_ptr);
- return 0;
-}
-
-
-/*!
- * \brief pixSetZlibCompression()
- *
- * \param[in] pix
- * \param[in] compval zlib compression value
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) Valid zlib compression values are in the interval [0 ... 9],
- * where, as defined in zlib.h:
- * 0 Z_NO_COMPRESSION
- * 1 Z_BEST_SPEED (poorest compression)
- * 9 Z_BEST_COMPRESSION
- * For the default value, use either of these:
- * 6 Z_DEFAULT_COMPRESSION
- * -1 (resolves to Z_DEFAULT_COMPRESSION)
- * (2) If you use the defined constants in zlib.h instead of the
- * compression integers given above, you must include zlib.h.
- *
- */
-l_ok
-pixSetZlibCompression(PIX *pix,
- l_int32 compval)
-{
- PROCNAME("pixSetZlibCompression");
-
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
- if (compval < 0 || compval > 9) {
- L_ERROR("Invalid zlib comp val; using default\n", procName);
- compval = Z_DEFAULT_COMPRESSION;
- }
- pixSetSpecial(pix, 10 + compval); /* valid range [10 ... 19] */
- return 0;
-}
-
-
-/*---------------------------------------------------------------------*
- * Set flag for stripping 16 bits on reading *
- *---------------------------------------------------------------------*/
-/*!
- * \brief l_pngSetReadStrip16To8()
- *
- * \param[in] flag 1 for stripping 16 bpp to 8 bpp on reading;
- * 0 for leaving 16 bpp
- * \return void
- */
-void
-l_pngSetReadStrip16To8(l_int32 flag)
-{
- var_PNG_STRIP_16_TO_8 = flag;
-}
-
-
-/*-------------------------------------------------------------------------*
- * Memio utility *
- * libpng read/write callback replacements for performing memory I/O *
- * *
- * Copyright (C) 2017 Milner Technologies, Inc. This content is a *
- * component of leptonica and is provided under the terms of the *
- * Leptonica license. *
- *-------------------------------------------------------------------------*/
-
- /*! A node in a linked list of memory buffers that hold I/O content */
-struct MemIOData
-{
- char* m_Buffer; /*!< pointer to this node's I/O content */
- l_int32 m_Count; /*!< number of I/O content bytes read or written */
- l_int32 m_Size; /*!< allocated size of m_buffer */
- struct MemIOData *m_Next; /*!< pointer to the next node in the list; */
- /*!< zero if this is the last node */
- struct MemIOData *m_Last; /*!< pointer to the last node in the linked */
- /*!< list. The last node is where new */
- /*!< content is written. */
-};
-typedef struct MemIOData MEMIODATA;
-
-static void memio_png_write_data(png_structp png_ptr, png_bytep data,
- png_size_t length);
-static void memio_png_flush(MEMIODATA* pthing);
-static void memio_png_read_data(png_structp png_ptr, png_bytep outBytes,
- png_size_t byteCountToRead);
-static void memio_free(MEMIODATA* pthing);
-
-static const l_int32 MEMIO_BUFFER_SIZE = 8192; /*! buffer alloc size */
-
-/*
- * \brief memio_png_write_data()
- *
- * \param[in] png_ptr
- * \param[in] data
- * \param[in] len size of array data in bytes
- *
- *
- * Notes:
- * (1) This is a libpng callback for writing an image into a
- * linked list of memory buffers.
- *
- */
-static void
-memio_png_write_data(png_structp png_ptr,
- png_bytep data,
- png_size_t len)
-{
-MEMIODATA *thing, *last;
-l_int32 written = 0;
-l_int32 remainingSpace, remainingToWrite;
-
- thing = (struct MemIOData*)png_get_io_ptr(png_ptr);
- last = (struct MemIOData*)thing->m_Last;
- if (last->m_Buffer == NULL) {
- if (len > MEMIO_BUFFER_SIZE) {
- last->m_Buffer = (char *)LEPT_MALLOC(len);
- memcpy(last->m_Buffer, data, len);
- last->m_Size = last->m_Count = len;
- return;
- }
-
- last->m_Buffer = (char *)LEPT_MALLOC(MEMIO_BUFFER_SIZE);
- last->m_Size = MEMIO_BUFFER_SIZE;
- }
-
- while (written < len) {
- if (last->m_Count == last->m_Size) {
- MEMIODATA* next = (MEMIODATA *)LEPT_MALLOC(sizeof(MEMIODATA));
- next->m_Next = NULL;
- next->m_Count = 0;
- next->m_Last = next;
-
- last->m_Next = next;
- last = thing->m_Last = next;
-
- last->m_Buffer = (char *)LEPT_MALLOC(MEMIO_BUFFER_SIZE);
- last->m_Size = MEMIO_BUFFER_SIZE;
- }
-
- remainingSpace = last->m_Size - last->m_Count;
- remainingToWrite = len - written;
- if (remainingSpace < remainingToWrite) {
- memcpy(last->m_Buffer + last->m_Count, data + written,
- remainingSpace);
- written += remainingSpace;
- last->m_Count += remainingSpace;
- } else {
- memcpy(last->m_Buffer + last->m_Count, data + written,
- remainingToWrite);
- written += remainingToWrite;
- last->m_Count += remainingToWrite;
- }
- }
-}
-
-
-/*
- * \brief memio_png_flush()
- *
- * \param[in] pthing
- *
- *
- * Notes:
- * (1) This consolidates write buffers into a single buffer at the
- * haed of the link list of buffers.
- *
- */
-static void
-memio_png_flush(MEMIODATA *pthing)
-{
-l_int32 amount = 0;
-l_int32 copied = 0;
-MEMIODATA *buffer = 0;
-char *data = 0;
-
- /* If the data is in one buffer, give the buffer to the user. */
- if (pthing->m_Next == NULL) return;
-
- /* Consolidate multiple buffers into one new one; add the buffer
- * sizes together. */
- amount = pthing->m_Count;
- buffer = pthing->m_Next;
- while (buffer != NULL) {
- amount += buffer->m_Count;
- buffer = buffer->m_Next;
- }
-
- /* Copy data to a new buffer. */
- data = (char *)LEPT_MALLOC(amount);
- memcpy(data, pthing->m_Buffer, pthing->m_Count);
- copied = pthing->m_Count;
-
- LEPT_FREE(pthing->m_Buffer);
- pthing->m_Buffer = NULL;
-
- /* Don't delete original "thing" because we don't control it. */
- buffer = pthing->m_Next;
- pthing->m_Next = NULL;
- while (buffer != NULL && copied < amount) {
- MEMIODATA* old;
- memcpy(data + copied, buffer->m_Buffer, buffer->m_Count);
- copied += buffer->m_Count;
-
- old = buffer;
- buffer = buffer->m_Next;
-
- LEPT_FREE(old->m_Buffer);
- LEPT_FREE(old);
- }
-
- pthing->m_Buffer = data;
- pthing->m_Count = copied;
- pthing->m_Size = amount;
- return;
-}
-
-
-/*
- * \brief memio_png_read_data()
- *
- * \param[in] png_ptr
- * \param[in] outBytes
- * \param[in] byteCountToRead
- *
- *
- * Notes:
- * (1) This is a libpng callback that reads an image from a single
- * memory buffer.
- *
- */
-static void
-memio_png_read_data(png_structp png_ptr,
- png_bytep outBytes,
- png_size_t byteCountToRead)
-{
-MEMIODATA *thing;
-
- thing = (MEMIODATA *)png_get_io_ptr(png_ptr);
- if (byteCountToRead > (thing->m_Size - thing->m_Count)) {
- png_error(png_ptr, "read error in memio_png_read_data");
- }
- memcpy(outBytes, thing->m_Buffer + thing->m_Count, byteCountToRead);
- thing->m_Count += byteCountToRead;
-}
-
-
-/*
- * \brief memio_free()
- *
- * \param[in] pthing
- *
- *
- * Notes:
- * (1) This frees all the write buffers in the linked list. It must
- * be done before exiting the pixWriteMemPng().
- *
- */
-static void
-memio_free(MEMIODATA* pthing)
-{
-MEMIODATA *buffer, *old;
-
- if (pthing->m_Buffer != NULL)
- LEPT_FREE(pthing->m_Buffer);
-
- pthing->m_Buffer = NULL;
- buffer = pthing->m_Next;
- while (buffer != NULL) {
- old = buffer;
- buffer = buffer->m_Next;
-
- if (old->m_Buffer != NULL)
- LEPT_FREE(old->m_Buffer);
- LEPT_FREE(old);
- }
-}
-
-
-/*---------------------------------------------------------------------*
- * Reading png from memory *
- *---------------------------------------------------------------------*/
-/*!
- * \brief pixReadMemPng()
- *
- * \param[in] filedata png compressed data in memory
- * \param[in] filesize number of bytes in data
- * \return pix, or NULL on error
- *
- *
- * Notes:
- * (1) See pixReastreamPng().
- *
- */
-PIX *
-pixReadMemPng(const l_uint8 *filedata,
- size_t filesize)
-{
-l_uint8 byte;
-l_int32 rval, gval, bval;
-l_int32 i, j, k, index, ncolors, bitval;
-l_int32 wpl, d, spp, cindex, tRNS;
-l_uint32 png_transforms;
-l_uint32 *data, *line, *ppixel;
-int num_palette, num_text, num_trans;
-png_byte bit_depth, color_type, channels;
-png_uint_32 w, h, rowbytes;
-png_uint_32 xres, yres;
-png_bytep rowptr, trans;
-png_bytep *row_pointers;
-png_structp png_ptr;
-png_infop info_ptr, end_info;
-png_colorp palette;
-png_textp text_ptr; /* ptr to text_chunk */
-PIX *pix, *pix1;
-PIXCMAP *cmap;
-MEMIODATA state;
-
- PROCNAME("pixReadMemPng");
-
- if (!filedata)
- return (PIX *)ERROR_PTR("filedata not defined", procName, NULL);
- if (filesize < 1)
- return (PIX *)ERROR_PTR("invalid filesize", procName, NULL);
-
- state.m_Next = 0;
- state.m_Count = 0;
- state.m_Last = &state;
- state.m_Buffer = (char*)filedata;
- state.m_Size = filesize;
- pix = NULL;
-
- /* Allocate the 3 data structures */
- if ((png_ptr = png_create_read_struct(PNG_LIBPNG_VER_STRING,
- (png_voidp)NULL, NULL, NULL)) == NULL)
- return (PIX *)ERROR_PTR("png_ptr not made", procName, NULL);
-
- if ((info_ptr = png_create_info_struct(png_ptr)) == NULL) {
- png_destroy_read_struct(&png_ptr, (png_infopp)NULL, (png_infopp)NULL);
- return (PIX *)ERROR_PTR("info_ptr not made", procName, NULL);
- }
-
- if ((end_info = png_create_info_struct(png_ptr)) == NULL) {
- png_destroy_read_struct(&png_ptr, &info_ptr, (png_infopp)NULL);
- return (PIX *)ERROR_PTR("end_info not made", procName, NULL);
- }
-
- /* Set up png setjmp error handling */
- if (setjmp(png_jmpbuf(png_ptr))) {
- png_destroy_read_struct(&png_ptr, &info_ptr, &end_info);
- return (PIX *)ERROR_PTR("internal png error", procName, NULL);
- }
-
- png_set_read_fn(png_ptr, &state, memio_png_read_data);
-
- /* ---------------------------------------------------------- *
- * Set the transforms flags. Whatever happens here,
- * NEVER invert 1 bpp using PNG_TRANSFORM_INVERT_MONO.
- * Also, do not use PNG_TRANSFORM_EXPAND, which would
- * expand all images with bpp < 8 to 8 bpp.
- * ---------------------------------------------------------- */
- /* To strip 16 --> 8 bit depth, use PNG_TRANSFORM_STRIP_16 */
- if (var_PNG_STRIP_16_TO_8 == 1) { /* our default */
- png_transforms = PNG_TRANSFORM_STRIP_16;
- } else {
- png_transforms = PNG_TRANSFORM_IDENTITY;
- L_INFO("not stripping 16 --> 8 in png reading\n", procName);
- }
-
- /* Read it */
- png_read_png(png_ptr, info_ptr, png_transforms, NULL);
-
- row_pointers = png_get_rows(png_ptr, info_ptr);
- w = png_get_image_width(png_ptr, info_ptr);
- h = png_get_image_height(png_ptr, info_ptr);
- bit_depth = png_get_bit_depth(png_ptr, info_ptr);
- rowbytes = png_get_rowbytes(png_ptr, info_ptr);
- color_type = png_get_color_type(png_ptr, info_ptr);
- channels = png_get_channels(png_ptr, info_ptr);
- spp = channels;
- tRNS = png_get_valid(png_ptr, info_ptr, PNG_INFO_tRNS) ? 1 : 0;
-
- if (spp == 1) {
- d = bit_depth;
- } else { /* spp == 2 (gray + alpha), spp == 3 (rgb), spp == 4 (rgba) */
- d = 4 * bit_depth;
- }
-
- /* Remove if/when this is implemented for all bit_depths */
- if (spp == 3 && bit_depth != 8) {
- lept_stderr("Help: spp = 3 and depth = %d != 8\n!!", bit_depth);
- png_destroy_read_struct(&png_ptr, &info_ptr, &end_info);
- return (PIX *)ERROR_PTR("not implemented for this depth",
- procName, NULL);
- }
-
- cmap = NULL;
- if (color_type == PNG_COLOR_TYPE_PALETTE ||
- color_type == PNG_COLOR_MASK_PALETTE) { /* generate a colormap */
- png_get_PLTE(png_ptr, info_ptr, &palette, &num_palette);
- cmap = pixcmapCreate(d); /* spp == 1 */
- for (cindex = 0; cindex < num_palette; cindex++) {
- rval = palette[cindex].red;
- gval = palette[cindex].green;
- bval = palette[cindex].blue;
- pixcmapAddColor(cmap, rval, gval, bval);
- }
- }
-
- if ((pix = pixCreate(w, h, d)) == NULL) {
- pixcmapDestroy(&cmap);
- png_destroy_read_struct(&png_ptr, &info_ptr, &end_info);
- pixcmapDestroy(&cmap);
- return (PIX *)ERROR_PTR("pix not made", procName, NULL);
- }
- pixSetInputFormat(pix, IFF_PNG);
- wpl = pixGetWpl(pix);
- data = pixGetData(pix);
- pixSetColormap(pix, cmap);
- pixSetSpp(pix, spp);
-
- if (spp == 1 && !tRNS) { /* copy straight from buffer to pix */
- for (i = 0; i < h; i++) {
- line = data + i * wpl;
- rowptr = row_pointers[i];
- for (j = 0; j < rowbytes; j++) {
- SET_DATA_BYTE(line, j, rowptr[j]);
- }
- }
- } else if (spp == 2) { /* grayscale + alpha; convert to RGBA */
- L_INFO("converting (gray + alpha) ==> RGBA\n", procName);
- for (i = 0; i < h; i++) {
- ppixel = data + i * wpl;
- rowptr = row_pointers[i];
- for (j = k = 0; j < w; j++) {
- /* Copy gray value into r, g and b */
- SET_DATA_BYTE(ppixel, COLOR_RED, rowptr[k]);
- SET_DATA_BYTE(ppixel, COLOR_GREEN, rowptr[k]);
- SET_DATA_BYTE(ppixel, COLOR_BLUE, rowptr[k++]);
- SET_DATA_BYTE(ppixel, L_ALPHA_CHANNEL, rowptr[k++]);
- ppixel++;
- }
- }
- pixSetSpp(pix, 4); /* we do not support 2 spp pix */
- } else if (spp == 3 || spp == 4) {
- for (i = 0; i < h; i++) {
- ppixel = data + i * wpl;
- rowptr = row_pointers[i];
- for (j = k = 0; j < w; j++) {
- SET_DATA_BYTE(ppixel, COLOR_RED, rowptr[k++]);
- SET_DATA_BYTE(ppixel, COLOR_GREEN, rowptr[k++]);
- SET_DATA_BYTE(ppixel, COLOR_BLUE, rowptr[k++]);
- if (spp == 4)
- SET_DATA_BYTE(ppixel, L_ALPHA_CHANNEL, rowptr[k++]);
- ppixel++;
- }
- }
- }
-
- /* Special spp == 1 cases with transparency:
- * (1) 8 bpp without colormap; assume full transparency
- * (2) 1 bpp with colormap + trans array (for alpha)
- * (3) 8 bpp with colormap + trans array (for alpha)
- * These all require converting to RGBA */
- if (spp == 1 && tRNS) {
- if (!cmap) {
- /* Case 1: make fully transparent RGBA image */
- L_INFO("transparency, 1 spp, no colormap, no transparency array: "
- "convention is fully transparent image\n", procName);
- L_INFO("converting (fully transparent 1 spp) ==> RGBA\n", procName);
- pixDestroy(&pix);
- pix = pixCreate(w, h, 32); /* init to alpha = 0 (transparent) */
- pixSetSpp(pix, 4);
- } else {
- L_INFO("converting (cmap + alpha) ==> RGBA\n", procName);
-
- /* Grab the transparency array */
- png_get_tRNS(png_ptr, info_ptr, &trans, &num_trans, NULL);
- if (!trans) { /* invalid png file */
- pixDestroy(&pix);
- png_destroy_read_struct(&png_ptr, &info_ptr, &end_info);
- return (PIX *)ERROR_PTR("cmap, tRNS, but no transparency array",
- procName, NULL);
- }
-
- /* Save the cmap and destroy the pix */
- cmap = pixcmapCopy(pixGetColormap(pix));
- ncolors = pixcmapGetCount(cmap);
- pixDestroy(&pix);
-
- /* Start over with 32 bit RGBA */
- pix = pixCreate(w, h, 32);
- wpl = pixGetWpl(pix);
- data = pixGetData(pix);
- pixSetSpp(pix, 4);
-
-#if DEBUG_READ
- lept_stderr("ncolors = %d, num_trans = %d\n",
- ncolors, num_trans);
- for (i = 0; i < ncolors; i++) {
- pixcmapGetColor(cmap, i, &rval, &gval, &bval);
- if (i < num_trans) {
- lept_stderr("(r,g,b,a) = (%d,%d,%d,%d)\n",
- rval, gval, bval, trans[i]);
- } else {
- lept_stderr("(r,g,b,a) = (%d,%d,%d,<<255>>)\n",
- rval, gval, bval);
- }
- }
-#endif /* DEBUG_READ */
-
- /* Extract the data and convert to RGBA */
- if (d == 1) {
- /* Case 2: 1 bpp with transparency (usually) behind white */
- L_INFO("converting 1 bpp cmap with alpha ==> RGBA\n", procName);
- if (num_trans == 1)
- L_INFO("num_trans = 1; second color opaque by default\n",
- procName);
- for (i = 0; i < h; i++) {
- ppixel = data + i * wpl;
- rowptr = row_pointers[i];
- for (j = 0, index = 0; j < rowbytes; j++) {
- byte = rowptr[j];
- for (k = 0; k < 8 && index < w; k++, index++) {
- bitval = (byte >> (7 - k)) & 1;
- pixcmapGetColor(cmap, bitval, &rval, &gval, &bval);
- composeRGBPixel(rval, gval, bval, ppixel);
- SET_DATA_BYTE(ppixel, L_ALPHA_CHANNEL,
- bitval < num_trans ? trans[bitval] : 255);
- ppixel++;
- }
- }
- }
- } else if (d == 8) {
- /* Case 3: 8 bpp with cmap and associated transparency */
- L_INFO("converting 8 bpp cmap with alpha ==> RGBA\n", procName);
- for (i = 0; i < h; i++) {
- ppixel = data + i * wpl;
- rowptr = row_pointers[i];
- for (j = 0; j < w; j++) {
- index = rowptr[j];
- pixcmapGetColor(cmap, index, &rval, &gval, &bval);
- composeRGBPixel(rval, gval, bval, ppixel);
- /* Assume missing entries to be 255 (opaque)
- * according to the spec:
- * http://www.w3.org/TR/PNG/#11tRNS */
- SET_DATA_BYTE(ppixel, L_ALPHA_CHANNEL,
- index < num_trans ? trans[index] : 255);
- ppixel++;
- }
- }
- } else {
- L_ERROR("spp == 1, cmap, trans array, invalid depth: %d\n",
- procName, d);
- }
- pixcmapDestroy(&cmap);
- }
- }
-
-#if DEBUG_READ
- if (cmap) {
- for (i = 0; i < 16; i++) {
- lept_stderr("[%d] = %d\n", i, ((l_uint8 *)(cmap->array))[i]);
- }
- }
-#endif /* DEBUG_READ */
-
- /* Final adjustments for bpp = 1.
- * + If there is no colormap, the image must be inverted because
- * png stores black pixels as 0.
- * + We have already handled the case of cmapped, 1 bpp pix
- * with transparency, where the output pix is 32 bpp RGBA.
- * If there is no transparency but the pix has a colormap,
- * we remove the colormap, because functions operating on
- * 1 bpp images in leptonica assume no colormap.
- * + The colormap must be removed in such a way that the pixel
- * values are not changed. If the values are only black and
- * white, we return a 1 bpp image; if gray, return an 8 bpp pix;
- * otherwise, return a 32 bpp rgb pix.
- *
- * Note that we cannot use the PNG_TRANSFORM_INVERT_MONO flag
- * to do the inversion, because that flag (since version 1.0.9)
- * inverts 8 bpp grayscale as well, which we don't want to do.
- * (It also doesn't work if there is a colormap.)
- *
- * Note that if the input png is a 1-bit with colormap and
- * transparency, it has already been rendered as a 32 bpp,
- * spp = 4 rgba pix.
- */
- if (pixGetDepth(pix) == 1) {
- if (!cmap) {
- pixInvert(pix, pix);
- } else {
- pix1 = pixRemoveColormap(pix, REMOVE_CMAP_BASED_ON_SRC);
- pixDestroy(&pix);
- pix = pix1;
- }
- }
-
- xres = png_get_x_pixels_per_meter(png_ptr, info_ptr);
- yres = png_get_y_pixels_per_meter(png_ptr, info_ptr);
- pixSetXRes(pix, (l_int32)((l_float32)xres / 39.37 + 0.5)); /* to ppi */
- pixSetYRes(pix, (l_int32)((l_float32)yres / 39.37 + 0.5)); /* to ppi */
-
- /* Get the text if there is any */
- png_get_text(png_ptr, info_ptr, &text_ptr, &num_text);
- if (num_text && text_ptr)
- pixSetText(pix, text_ptr->text);
-
- png_destroy_read_struct(&png_ptr, &info_ptr, &end_info);
- return pix;
-}
-
-
-/*---------------------------------------------------------------------*
- * Writing png to memory *
- *---------------------------------------------------------------------*/
-/*!
- * \brief pixWriteMemPng()
- *
- * \param[out] pfiledata png encoded data of pix
- * \param[out] pfilesize size of png encoded data
- * \param[in] pix
- * \param[in] gamma use 0.0 if gamma is not defined
- * \return 0 if OK; 1 on error
- *
- *
- * Notes:
- * (1) See pixWriteStreamPng()
- *
- */
-l_ok
-pixWriteMemPng(l_uint8 **pfiledata,
- size_t *pfilesize,
- PIX *pix,
- l_float32 gamma)
-{
-char commentstring[] = "Comment";
-l_int32 i, j, k;
-l_int32 wpl, d, spp, cmflag, opaque;
-l_int32 ncolors, compval;
-l_int32 *rmap, *gmap, *bmap, *amap;
-l_uint32 *data, *ppixel;
-png_byte bit_depth, color_type;
-png_byte alpha[256];
-png_uint_32 w, h;
-png_uint_32 xres, yres;
-png_bytep *row_pointers;
-png_bytep rowbuffer;
-png_structp png_ptr;
-png_infop info_ptr;
-png_colorp palette;
-PIX *pix1;
-PIXCMAP *cmap;
-char *text;
-MEMIODATA state;
-
- PROCNAME("pixWriteMemPng");
-
- if (pfiledata) *pfiledata = NULL;
- if (pfilesize) *pfilesize = 0;
- if (!pfiledata)
- return ERROR_INT("&filedata not defined", procName, 1);
- if (!pfilesize)
- return ERROR_INT("&filesize not defined", procName, 1);
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
-
- state.m_Buffer = 0;
- state.m_Size = 0;
- state.m_Next = 0;
- state.m_Count = 0;
- state.m_Last = &state;
-
- /* Allocate the 2 data structures */
- if ((png_ptr = png_create_write_struct(PNG_LIBPNG_VER_STRING,
- (png_voidp)NULL, NULL, NULL)) == NULL)
- return ERROR_INT("png_ptr not made", procName, 1);
-
- if ((info_ptr = png_create_info_struct(png_ptr)) == NULL) {
- png_destroy_write_struct(&png_ptr, (png_infopp)NULL);
- return ERROR_INT("info_ptr not made", procName, 1);
- }
-
- /* Set up png setjmp error handling */
- if (setjmp(png_jmpbuf(png_ptr))) {
- png_destroy_write_struct(&png_ptr, &info_ptr);
- return ERROR_INT("internal png error", procName, 1);
- }
-
- png_set_write_fn(png_ptr, &state, memio_png_write_data,
- (png_flush_ptr)NULL);
-
- /* With best zlib compression (9), get between 1 and 10% improvement
- * over default (6), but the compression is 3 to 10 times slower.
- * Use the zlib default (6) as our default compression unless
- * pix->special falls in the range [10 ... 19]; then subtract 10
- * to get the compression value. */
- compval = Z_DEFAULT_COMPRESSION;
- if (pix->special >= 10 && pix->special < 20)
- compval = pix->special - 10;
- png_set_compression_level(png_ptr, compval);
-
- w = pixGetWidth(pix);
- h = pixGetHeight(pix);
- d = pixGetDepth(pix);
- spp = pixGetSpp(pix);
- if ((cmap = pixGetColormap(pix)))
- cmflag = 1;
- else
- cmflag = 0;
-
- /* Set the color type and bit depth. */
- if (d == 32 && spp == 4) {
- bit_depth = 8;
- color_type = PNG_COLOR_TYPE_RGBA; /* 6 */
- cmflag = 0; /* ignore if it exists */
- } else if (d == 24 || d == 32) {
- bit_depth = 8;
- color_type = PNG_COLOR_TYPE_RGB; /* 2 */
- cmflag = 0; /* ignore if it exists */
- } else {
- bit_depth = d;
- color_type = PNG_COLOR_TYPE_GRAY; /* 0 */
- }
- if (cmflag)
- color_type = PNG_COLOR_TYPE_PALETTE; /* 3 */
-
-#if DEBUG_WRITE
- lept_stderr("cmflag = %d, bit_depth = %d, color_type = %d\n",
- cmflag, bit_depth, color_type);
-#endif /* DEBUG_WRITE */
-
- png_set_IHDR(png_ptr, info_ptr, w, h, bit_depth, color_type,
- PNG_INTERLACE_NONE, PNG_COMPRESSION_TYPE_BASE,
- PNG_FILTER_TYPE_BASE);
-
- /* Store resolution in ppm, if known */
- xres = (png_uint_32)(39.37 * (l_float32)pixGetXRes(pix) + 0.5);
- yres = (png_uint_32)(39.37 * (l_float32)pixGetYRes(pix) + 0.5);
- if ((xres == 0) || (yres == 0))
- png_set_pHYs(png_ptr, info_ptr, 0, 0, PNG_RESOLUTION_UNKNOWN);
- else
- png_set_pHYs(png_ptr, info_ptr, xres, yres, PNG_RESOLUTION_METER);
-
- if (cmflag) {
- pixcmapToArrays(cmap, &rmap, &gmap, &bmap, &amap);
- ncolors = pixcmapGetCount(cmap);
- pixcmapIsOpaque(cmap, &opaque);
-
- /* Make and save the palette */
- palette = (png_colorp)LEPT_CALLOC(ncolors, sizeof(png_color));
- for (i = 0; i < ncolors; i++) {
- palette[i].red = (png_byte)rmap[i];
- palette[i].green = (png_byte)gmap[i];
- palette[i].blue = (png_byte)bmap[i];
- alpha[i] = (png_byte)amap[i];
- }
-
- png_set_PLTE(png_ptr, info_ptr, palette, (int)ncolors);
- if (!opaque) /* alpha channel has some transparency; assume valid */
- png_set_tRNS(png_ptr, info_ptr, (png_bytep)alpha,
- (int)ncolors, NULL);
- LEPT_FREE(rmap);
- LEPT_FREE(gmap);
- LEPT_FREE(bmap);
- LEPT_FREE(amap);
- }
-
- /* 0.4545 is treated as the default by some image
- * display programs (not gqview). A value > 0.4545 will
- * lighten an image as displayed by xv, display, etc. */
- if (gamma > 0.0)
- png_set_gAMA(png_ptr, info_ptr, (l_float64)gamma);
-
- if ((text = pixGetText(pix))) {
- png_text text_chunk;
- text_chunk.compression = PNG_TEXT_COMPRESSION_NONE;
- text_chunk.key = commentstring;
- text_chunk.text = text;
- text_chunk.text_length = strlen(text);
-#ifdef PNG_ITXT_SUPPORTED
- text_chunk.itxt_length = 0;
- text_chunk.lang = NULL;
- text_chunk.lang_key = NULL;
-#endif
- png_set_text(png_ptr, info_ptr, &text_chunk, 1);
- }
-
- /* Write header and palette info */
- png_write_info(png_ptr, info_ptr);
-
- if ((d != 32) && (d != 24)) { /* not rgb color */
- /* Generate a temporary pix with bytes swapped.
- * For writing a 1 bpp image as png:
- * ~ if no colormap, invert the data, because png writes
- * black as 0
- * ~ if colormapped, do not invert the data; the two RGBA
- * colors can have any value. */
- if (d == 1 && !cmap) {
- pix1 = pixInvert(NULL, pix);
- pixEndianByteSwap(pix1);
- } else {
- pix1 = pixEndianByteSwapNew(pix);
- }
- if (!pix1) {
- png_destroy_write_struct(&png_ptr, &info_ptr);
- if (cmflag) LEPT_FREE(palette);
- memio_free(&state);
- return ERROR_INT("pix1 not made", procName, 1);
- }
-
- /* Make and assign array of image row pointers */
- row_pointers = (png_bytep *)LEPT_CALLOC(h, sizeof(png_bytep));
- wpl = pixGetWpl(pix1);
- data = pixGetData(pix1);
- for (i = 0; i < h; i++)
- row_pointers[i] = (png_bytep)(data + i * wpl);
- png_set_rows(png_ptr, info_ptr, row_pointers);
-
- /* Transfer the data */
- png_write_image(png_ptr, row_pointers);
- png_write_end(png_ptr, info_ptr);
-
- if (cmflag) LEPT_FREE(palette);
- LEPT_FREE(row_pointers);
- pixDestroy(&pix1);
- png_destroy_write_struct(&png_ptr, &info_ptr);
-
- memio_png_flush(&state);
- *pfiledata = (l_uint8 *)state.m_Buffer;
- state.m_Buffer = 0;
- *pfilesize = state.m_Count;
- memio_free(&state);
- return 0;
- }
-
- /* For rgb, compose and write a row at a time */
- data = pixGetData(pix);
- wpl = pixGetWpl(pix);
- if (d == 24) { /* See note 7 above: special case of 24 bpp rgb */
- for (i = 0; i < h; i++) {
- ppixel = data + i * wpl;
- png_write_rows(png_ptr, (png_bytepp)&ppixel, 1);
- }
- } else { /* 32 bpp rgb and rgba. Write out the alpha channel if either
- * the pix has 4 spp or writing it is requested anyway */
- rowbuffer = (png_bytep)LEPT_CALLOC(w, 4);
- for (i = 0; i < h; i++) {
- ppixel = data + i * wpl;
- for (j = k = 0; j < w; j++) {
- rowbuffer[k++] = GET_DATA_BYTE(ppixel, COLOR_RED);
- rowbuffer[k++] = GET_DATA_BYTE(ppixel, COLOR_GREEN);
- rowbuffer[k++] = GET_DATA_BYTE(ppixel, COLOR_BLUE);
- if (spp == 4)
- rowbuffer[k++] = GET_DATA_BYTE(ppixel, L_ALPHA_CHANNEL);
- ppixel++;
- }
-
- png_write_rows(png_ptr, &rowbuffer, 1);
- }
- LEPT_FREE(rowbuffer);
- }
-
- png_write_end(png_ptr, info_ptr);
-
- if (cmflag)
- LEPT_FREE(palette);
- png_destroy_write_struct(&png_ptr, &info_ptr);
-
- memio_png_flush(&state);
- *pfiledata = (l_uint8 *)state.m_Buffer;
- state.m_Buffer = 0;
- *pfilesize = state.m_Count;
- memio_free(&state);
- return 0;
-}
-
-/* --------------------------------------------*/
-#endif /* HAVE_LIBPNG */
-/* --------------------------------------------*/
diff --git a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pngiostub.c b/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pngiostub.c
deleted file mode 100644
index f3c8bed9..00000000
--- a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pngiostub.c
+++ /dev/null
@@ -1,143 +0,0 @@
-/*====================================================================*
- - Copyright (C) 2001 Leptonica. All rights reserved.
- -
- - Redistribution and use in source and binary forms, with or without
- - modification, are permitted provided that the following conditions
- - are met:
- - 1. Redistributions of source code must retain the above copyright
- - notice, this list of conditions and the following disclaimer.
- - 2. Redistributions in binary form must reproduce the above
- - copyright notice, this list of conditions and the following
- - disclaimer in the documentation and/or other materials
- - provided with the distribution.
- -
- - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- - ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- - LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- - A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL ANY
- - CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
- - EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
- - PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
- - PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
- - OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
- - NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- *====================================================================*/
-
-/*!
- * \file pngiostub.c
- *
- *
- * Stubs for pngio.c functions
- *
- */
-
-#ifdef HAVE_CONFIG_H
-#include
-#endif /* HAVE_CONFIG_H */
-
-#include "allheaders.h"
-
-/* --------------------------------------------*/
-#if !HAVE_LIBPNG /* defined in environ.h */
-/* --------------------------------------------*/
-
-PIX * pixReadStreamPng(FILE *fp)
-{
- return (PIX * )ERROR_PTR("function not present", "pixReadStreamPng", NULL);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok readHeaderPng(const char *filename, l_int32 *pwidth, l_int32 *pheight,
- l_int32 *pbps, l_int32 *pspp, l_int32 *piscmap)
-{
- return ERROR_INT("function not present", "readHeaderPng", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok freadHeaderPng(FILE *fp, l_int32 *pwidth, l_int32 *pheight,
- l_int32 *pbps, l_int32 *pspp, l_int32 *piscmap)
-{
- return ERROR_INT("function not present", "freadHeaderPng", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok readHeaderMemPng(const l_uint8 *data, size_t size, l_int32 *pwidth,
- l_int32 *pheight, l_int32 *pbps, l_int32 *pspp,
- l_int32 *piscmap)
-{
- return ERROR_INT("function not present", "readHeaderMemPng", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_int32 fgetPngResolution(FILE *fp, l_int32 *pxres, l_int32 *pyres)
-{
- return ERROR_INT("function not present", "fgetPngResolution", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok isPngInterlaced(const char *filename, l_int32 *pinterlaced)
-{
- return ERROR_INT("function not present", "isPngInterlaced", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok fgetPngColormapInfo(FILE *fp, PIXCMAP **pcmap, l_int32 *ptransparency)
-{
- return ERROR_INT("function not present", "fgetPngColormapInfo", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok pixWritePng(const char *filename, PIX *pix, l_float32 gamma)
-{
- return ERROR_INT("function not present", "pixWritePng", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok pixWriteStreamPng(FILE *fp, PIX *pix, l_float32 gamma)
-{
- return ERROR_INT("function not present", "pixWriteStreamPng", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok pixSetZlibCompression(PIX *pix, l_int32 compval)
-
-{
- return ERROR_INT("function not present", "pixSetZlibCompression", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-void l_pngSetReadStrip16To8(l_int32 flag)
-{
- L_ERROR("function not present\n", "l_pngSetReadStrip16To8");
- return;
-}
-
-/* ----------------------------------------------------------------------*/
-
-PIX * pixReadMemPng(const l_uint8 *filedata, size_t filesize)
-{
- return (PIX * )ERROR_PTR("function not present", "pixReadMemPng", NULL);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok pixWriteMemPng(l_uint8 **pfiledata, size_t *pfilesize, PIX *pix,
- l_float32 gamma)
-{
- return ERROR_INT("function not present", "pixWriteMemPng", 1);
-}
-
-/* --------------------------------------------*/
-#endif /* !HAVE_LIBPNG */
-/* --------------------------------------------*/
diff --git a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pnmio.c b/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pnmio.c
deleted file mode 100644
index e9cfad57..00000000
--- a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pnmio.c
+++ /dev/null
@@ -1,1534 +0,0 @@
-/*====================================================================*
- - Copyright (C) 2001 Leptonica. All rights reserved.
- -
- - Redistribution and use in source and binary forms, with or without
- - modification, are permitted provided that the following conditions
- - are met:
- - 1. Redistributions of source code must retain the above copyright
- - notice, this list of conditions and the following disclaimer.
- - 2. Redistributions in binary form must reproduce the above
- - copyright notice, this list of conditions and the following
- - disclaimer in the documentation and/or other materials
- - provided with the distribution.
- -
- - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- - ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- - LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- - A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL ANY
- - CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
- - EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
- - PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
- - PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
- - OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
- - NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- *====================================================================*/
-
-/*!
- * \file pnmio.c
- *
- *
- * Stream interface
- * PIX *pixReadStreamPnm()
- * l_int32 readHeaderPnm()
- * l_int32 freadHeaderPnm()
- * l_int32 pixWriteStreamPnm()
- * l_int32 pixWriteStreamAsciiPnm()
- * l_int32 pixWriteStreamPam()
- *
- * Read/write to memory
- * PIX *pixReadMemPnm()
- * l_int32 readHeaderMemPnm()
- * l_int32 pixWriteMemPnm()
- * l_int32 pixWriteMemPam()
- *
- * Local helpers
- * static l_int32 pnmReadNextAsciiValue();
- * static l_int32 pnmReadNextNumber();
- * static l_int32 pnmReadNextString();
- * static l_int32 pnmSkipCommentLines();
- *
- * These are here by popular demand, with the help of Mattias
- * Kregert (mattias@kregert.se), who provided the first implementation.
- *
- * The pnm formats are exceedingly simple, because they have
- * no compression and no colormaps. They support images that
- * are 1 bpp; 2, 4, 8 and 16 bpp grayscale; and rgb.
- *
- * The original pnm formats ("ASCII") are included for completeness,
- * but their use is deprecated for all but tiny iconic images.
- * They are extremely wasteful of memory; for example, the P1 binary
- * ASCII format is 16 times as big as the packed uncompressed
- * format, because 2 characters are used to represent every bit
- * (pixel) in the image. Reading is slow because we check for extra
- * white space and EOL at every sample value.
- *
- * The packed pnm formats ("raw") give file sizes similar to
- * bmp files, which are uncompressed packed. However, bmp
- * are more flexible, because they can support colormaps.
- *
- * We don't differentiate between the different types ("pbm",
- * "pgm", "ppm") at the interface level, because this is really a
- * "distinction without a difference." You read a file, you get
- * the appropriate Pix. You write a file from a Pix, you get the
- * appropriate type of file. If there is a colormap on the Pix,
- * and the Pix is more than 1 bpp, you get either an 8 bpp pgm
- * or a 24 bpp RGB pnm, depending on whether the colormap colors
- * are gray or rgb, respectively.
- *
- * This follows the general policy that the I/O routines don't
- * make decisions about the content of the image -- you do that
- * with image processing before you write it out to file.
- * The I/O routines just try to make the closest connection
- * possible between the file and the Pix in memory.
- *
- * On systems like windows without fmemopen() and open_memstream(),
- * we write data to a temp file and read it back for operations
- * between pix and compressed-data, such as pixReadMemPnm() and
- * pixWriteMemPnm().
- *
- * The P7 format is new. It introduced a header with multiple
- * lines containing distinct tags for the various fields.
- * See: http://netpbm.sourceforge.net/doc/pam.html
- *
- * WIDTH ; mandatory, exactly once
- * HEIGHT ; mandatory, exactly once
- * DEPTH ; mandatory, exactly once,
- * ; its meaning is equivalent to spp
- * MAXVAL ; mandatory, one of 1, 3, 15, 255 or 65535
- * TUPLTYPE ; optional; BLACKANDWHITE, GRAYSCALE, RGB
- * ; and optional suffix _ALPHA, e.g. RGB_ALPHA
- * ENDHDR ; mandatory, last header line
- *
- * Reading BLACKANDWHITE_ALPHA and GRAYSCALE_ALPHA, which have a DEPTH
- * value of 2, is supported. The original image is converted to a Pix
- * with 32-bpp and alpha channel (spp == 4).
- *
- * Writing P7 format is currently selected for 32-bpp with alpha
- * channel, i.e. for Pix which have spp == 4, using pixWriteStreamPam().
- * Jürgen Buchmüller provided the implementation for the P7 (pam) format.
- *
- */
-
-#ifdef HAVE_CONFIG_H
-#include
-#endif /* HAVE_CONFIG_H */
-
-#include
-#include
-#include "allheaders.h"
-
-/* --------------------------------------------*/
-#if USE_PNMIO /* defined in environ.h */
-/* --------------------------------------------*/
-
-static l_int32 pnmReadNextAsciiValue(FILE *fp, l_int32 *pval);
-static l_int32 pnmReadNextNumber(FILE *fp, l_int32 *pval);
-static l_int32 pnmReadNextString(FILE *fp, char *buff, l_int32 size);
-static l_int32 pnmSkipCommentLines(FILE *fp);
-
- /* a sanity check on the size read from file */
-static const l_int32 MAX_PNM_WIDTH = 100000;
-static const l_int32 MAX_PNM_HEIGHT = 100000;
-
-
-/*--------------------------------------------------------------------*
- * Stream interface *
- *--------------------------------------------------------------------*/
-/*!
- * \brief pixReadStreamPnm()
- *
- * \param[in] fp file stream opened for read
- * \return pix, or NULL on error
- */
-PIX *
-pixReadStreamPnm(FILE *fp)
-{
-l_uint8 val8, rval8, gval8, bval8, aval8, mask8;
-l_uint16 val16, rval16, gval16, bval16, aval16;
-l_int32 w, h, d, bps, spp, bpl, wpl, i, j, type;
-l_int32 val, rval, gval, bval;
-l_uint32 rgbval;
-l_uint32 *line, *data;
-PIX *pix;
-
- PROCNAME("pixReadStreamPnm");
-
- if (!fp)
- return (PIX *)ERROR_PTR("fp not defined", procName, NULL);
-
- if (freadHeaderPnm(fp, &w, &h, &d, &type, &bps, &spp))
- return (PIX *)ERROR_PTR("header read failed", procName, NULL);
- if (bps < 1 || bps > 16)
- return (PIX *)ERROR_PTR("invalid bps", procName, NULL);
- if (spp < 1 || spp > 4)
- return (PIX *)ERROR_PTR("invalid spp", procName, NULL);
- if ((pix = pixCreate(w, h, d)) == NULL)
- return (PIX *)ERROR_PTR("pix not made", procName, NULL);
- pixSetInputFormat(pix, IFF_PNM);
- data = pixGetData(pix);
- wpl = pixGetWpl(pix);
-
- /* If type == 6 and bps == 16, we use the code in type 7
- * to read 6 bytes/pixel from the input file. */
- if (type == 6 && bps == 16)
- type = 7;
-
- switch (type) {
- case 1:
- case 2:
- /* Old "ASCII" binary or gray format */
- for (i = 0; i < h; i++) {
- for (j = 0; j < w; j++) {
- if (pnmReadNextAsciiValue(fp, &val)) {
- pixDestroy(&pix);
- return (PIX *)ERROR_PTR("read abend", procName, NULL);
- }
- pixSetPixel(pix, j, i, val);
- }
- }
- break;
-
- case 3:
- /* Old "ASCII" rgb format */
- for (i = 0; i < h; i++) {
- for (j = 0; j < w; j++) {
- if (pnmReadNextAsciiValue(fp, &rval)) {
- pixDestroy(&pix);
- return (PIX *)ERROR_PTR("read abend", procName, NULL);
- }
- if (pnmReadNextAsciiValue(fp, &gval)) {
- pixDestroy(&pix);
- return (PIX *)ERROR_PTR("read abend", procName, NULL);
- }
- if (pnmReadNextAsciiValue(fp, &bval)) {
- pixDestroy(&pix);
- return (PIX *)ERROR_PTR("read abend", procName, NULL);
- }
- composeRGBPixel(rval, gval, bval, &rgbval);
- pixSetPixel(pix, j, i, rgbval);
- }
- }
- break;
-
- case 4:
- /* "raw" format for 1 bpp */
- bpl = (d * w + 7) / 8;
- for (i = 0; i < h; i++) {
- line = data + i * wpl;
- for (j = 0; j < bpl; j++) {
- if (fread(&val8, 1, 1, fp) != 1) {
- pixDestroy(&pix);
- return (PIX *)ERROR_PTR("read error in 4", procName, NULL);
- }
- SET_DATA_BYTE(line, j, val8);
- }
- }
- break;
-
- case 5:
- /* "raw" format for grayscale */
- for (i = 0; i < h; i++) {
- line = data + i * wpl;
- if (d != 16) {
- for (j = 0; j < w; j++) {
- if (fread(&val8, 1, 1, fp) != 1) {
- pixDestroy(&pix);
- return (PIX *)ERROR_PTR("error in 5", procName, NULL);
- }
- if (d == 2)
- SET_DATA_DIBIT(line, j, val8);
- else if (d == 4)
- SET_DATA_QBIT(line, j, val8);
- else /* d == 8 */
- SET_DATA_BYTE(line, j, val8);
- }
- } else { /* d == 16 */
- for (j = 0; j < w; j++) {
- if (fread(&val16, 2, 1, fp) != 1) {
- pixDestroy(&pix);
- return (PIX *)ERROR_PTR("16 bpp error", procName, NULL);
- }
- SET_DATA_TWO_BYTES(line, j, val16);
- }
- }
- }
- break;
-
- case 6:
- /* "raw" format, type == 6; 8 bps, rgb */
- for (i = 0; i < h; i++) {
- line = data + i * wpl;
- for (j = 0; j < wpl; j++) {
- if (fread(&rval8, 1, 1, fp) != 1) {
- pixDestroy(&pix);
- return (PIX *)ERROR_PTR("read error type 6",
- procName, NULL);
- }
- if (fread(&gval8, 1, 1, fp) != 1) {
- pixDestroy(&pix);
- return (PIX *)ERROR_PTR("read error type 6",
- procName, NULL);
- }
- if (fread(&bval8, 1, 1, fp) != 1) {
- pixDestroy(&pix);
- return (PIX *)ERROR_PTR("read error type 6",
- procName, NULL);
- }
- composeRGBPixel(rval8, gval8, bval8, &rgbval);
- line[j] = rgbval;
- }
- }
- break;
-
- case 7:
- /* "arbitrary" format; type == 7; */
- if (bps != 16) {
- mask8 = (1 << bps) - 1;
- switch (spp) {
- case 1: /* 1, 2, 4, 8 bpp grayscale */
- for (i = 0; i < h; i++) {
- for (j = 0; j < w; j++) {
- if (fread(&val8, 1, 1, fp) != 1) {
- pixDestroy(&pix);
- return (PIX *)ERROR_PTR("read error type 7",
- procName, NULL);
- }
- val8 = val8 & mask8;
- if (bps == 1) val8 ^= 1; /* white-is-1 photometry */
- pixSetPixel(pix, j, i, val8);
- }
- }
- break;
-
- case 2: /* 1, 2, 4, 8 bpp grayscale + alpha */
- for (i = 0; i < h; i++) {
- for (j = 0; j < w; j++) {
- if (fread(&val8, 1, 1, fp) != 1) {
- pixDestroy(&pix);
- return (PIX *)ERROR_PTR("read error type 7",
- procName, NULL);
- }
- if (fread(&aval8, 1, 1, fp) != 1) {
- pixDestroy(&pix);
- return (PIX *)ERROR_PTR("read error type 7",
- procName, NULL);
- }
- val8 = val8 & mask8;
- aval8 = aval8 & mask8;
- composeRGBAPixel(val8, val8, val8, aval8, &rgbval);
- pixSetPixel(pix, j, i, rgbval);
- }
- }
- pixSetSpp(pix, 4);
- break;
-
- case 3: /* rgb */
- for (i = 0; i < h; i++) {
- line = data + i * wpl;
- for (j = 0; j < wpl; j++) {
- if (fread(&rval8, 1, 1, fp) != 1) {
- pixDestroy(&pix);
- return (PIX *)ERROR_PTR("read error type 7",
- procName, NULL);
- }
- if (fread(&gval8, 1, 1, fp) != 1) {
- pixDestroy(&pix);
- return (PIX *)ERROR_PTR("read error type 7",
- procName, NULL);
- }
- if (fread(&bval8, 1, 1, fp) != 1) {
- pixDestroy(&pix);
- return (PIX *)ERROR_PTR("read error type 7",
- procName, NULL);
- }
- rval8 = rval8 & mask8;
- gval8 = gval8 & mask8;
- bval8 = bval8 & mask8;
- composeRGBPixel(rval8, gval8, bval8, &rgbval);
- line[j] = rgbval;
- }
- }
- break;
-
- case 4: /* rgba */
- for (i = 0; i < h; i++) {
- line = data + i * wpl;
- for (j = 0; j < wpl; j++) {
- if (fread(&rval8, 1, 1, fp) != 1) {
- pixDestroy(&pix);
- return (PIX *)ERROR_PTR("read error type 7",
- procName, NULL);
- }
- if (fread(&gval8, 1, 1, fp) != 1) {
- pixDestroy(&pix);
- return (PIX *)ERROR_PTR("read error type 7",
- procName, NULL);
- }
- if (fread(&bval8, 1, 1, fp) != 1) {
- pixDestroy(&pix);
- return (PIX *)ERROR_PTR("read error type 7",
- procName, NULL);
- }
- if (fread(&aval8, 1, 1, fp) != 1) {
- pixDestroy(&pix);
- return (PIX *)ERROR_PTR("read error type 7",
- procName, NULL);
- }
- rval8 = rval8 & mask8;
- gval8 = gval8 & mask8;
- bval8 = bval8 & mask8;
- aval8 = aval8 & mask8;
- composeRGBAPixel(rval8, gval8, bval8, aval8, &rgbval);
- line[j] = rgbval;
- }
- }
- pixSetSpp(pix, 4);
- break;
- }
- } else { /* bps == 16 */
- /* I have only seen one example that is type 6, 16 bps.
- * It was 3 spp (rgb), and the 8 bps of real data was stored
- * in the second byte. In the following, I make the wild
- * assumption that for all 16 bpp pnm/pam files, we can
- * take the second byte. */
- switch (spp) {
- case 1: /* 16 bps grayscale */
- for (i = 0; i < h; i++) {
- for (j = 0; j < w; j++) {
- if (fread(&val16, 2, 1, fp) != 1) {
- pixDestroy(&pix);
- return (PIX *)ERROR_PTR("read error type 7",
- procName, NULL);
- }
- val8 = val16 & 0xff;
- pixSetPixel(pix, j, i, val8);
- }
- }
- break;
-
- case 2: /* 16 bps grayscale + alpha */
- for (i = 0; i < h; i++) {
- for (j = 0; j < w; j++) {
- if (fread(&val16, 2, 1, fp) != 1) {
- pixDestroy(&pix);
- return (PIX *)ERROR_PTR("read error type 7",
- procName, NULL);
- }
- if (fread(&aval16, 2, 1, fp) != 1) {
- pixDestroy(&pix);
- return (PIX *)ERROR_PTR("read error type 7",
- procName, NULL);
- }
- val8 = val16 & 0xff;
- aval8 = aval16 & 0xff;
- composeRGBAPixel(val8, val8, val8, aval8, &rgbval);
- pixSetPixel(pix, j, i, rgbval);
- }
- }
- pixSetSpp(pix, 4);
- break;
-
- case 3: /* 16bps rgb */
- for (i = 0; i < h; i++) {
- line = data + i * wpl;
- for (j = 0; j < wpl; j++) {
- if (fread(&rval16, 2, 1, fp) != 1) {
- pixDestroy(&pix);
- return (PIX *)ERROR_PTR("read error type 7",
- procName, NULL);
- }
- if (fread(&gval16, 2, 1, fp) != 1) {
- pixDestroy(&pix);
- return (PIX *)ERROR_PTR("read error type 7",
- procName, NULL);
- }
- if (fread(&bval16, 2, 1, fp) != 1) {
- pixDestroy(&pix);
- return (PIX *)ERROR_PTR("read error type 7",
- procName, NULL);
- }
- rval8 = rval16 & 0xff;
- gval8 = gval16 & 0xff;
- bval8 = bval16 & 0xff;
- composeRGBPixel(rval8, gval8, bval8, &rgbval);
- line[j] = rgbval;
- }
- }
- break;
-
- case 4: /* 16bps rgba */
- for (i = 0; i < h; i++) {
- line = data + i * wpl;
- for (j = 0; j < wpl; j++) {
- if (fread(&rval16, 2, 1, fp) != 1) {
- pixDestroy(&pix);
- return (PIX *)ERROR_PTR("read error type 7",
- procName, NULL);
- }
- if (fread(&gval16, 2, 1, fp) != 1) {
- pixDestroy(&pix);
- return (PIX *)ERROR_PTR("read error type 7",
- procName, NULL);
- }
- if (fread(&bval16, 2, 1, fp) != 1) {
- pixDestroy(&pix);
- return (PIX *)ERROR_PTR("read error type 7",
- procName, NULL);
- }
- if (fread(&aval16, 2, 1, fp) != 1) {
- pixDestroy(&pix);
- return (PIX *)ERROR_PTR("read error type 7",
- procName, NULL);
- }
- rval8 = rval16 & 0xff;
- gval8 = gval16 & 0xff;
- bval8 = bval16 & 0xff;
- aval8 = aval16 & 0xff;
- composeRGBAPixel(rval8, gval8, bval8, aval8, &rgbval);
- line[j] = rgbval;
- }
- }
- pixSetSpp(pix, 4);
- break;
- }
- }
- break;
- }
- return pix;
-}
-
-
-/*!
- * \brief readHeaderPnm()
- *
- * \param[in] filename
- * \param[out] pw [optional]
- * \param[out] ph [optional]
- * \param[out] pd [optional]
- * \param[out] ptype [optional] pnm type
- * \param[out] pbps [optional] bits/sample
- * \param[out] pspp [optional] samples/pixel
- * \return 0 if OK, 1 on error
- */
-l_ok
-readHeaderPnm(const char *filename,
- l_int32 *pw,
- l_int32 *ph,
- l_int32 *pd,
- l_int32 *ptype,
- l_int32 *pbps,
- l_int32 *pspp)
-{
-l_int32 ret;
-FILE *fp;
-
- PROCNAME("readHeaderPnm");
-
- if (pw) *pw = 0;
- if (ph) *ph = 0;
- if (pd) *pd = 0;
- if (ptype) *ptype = 0;
- if (pbps) *pbps = 0;
- if (pspp) *pspp = 0;
- if (!filename)
- return ERROR_INT("filename not defined", procName, 1);
-
- if ((fp = fopenReadStream(filename)) == NULL)
- return ERROR_INT("image file not found", procName, 1);
- ret = freadHeaderPnm(fp, pw, ph, pd, ptype, pbps, pspp);
- fclose(fp);
- return ret;
-}
-
-
-/*!
- * \brief freadHeaderPnm()
- *
- * \param[in] fp file stream opened for read
- * \param[out] pw [optional]
- * \param[out] ph [optional]
- * \param[out] pd [optional]
- * \param[out] ptype [optional] pnm type
- * \param[out] pbps [optional] bits/sample
- * \param[out] pspp [optional] samples/pixel
- * \return 0 if OK, 1 on error
- */
-l_ok
-freadHeaderPnm(FILE *fp,
- l_int32 *pw,
- l_int32 *ph,
- l_int32 *pd,
- l_int32 *ptype,
- l_int32 *pbps,
- l_int32 *pspp)
-{
-char tag[16], tupltype[32];
-l_int32 i, w, h, d, bps, spp, type;
-l_int32 maxval;
-l_int32 ch;
-
- PROCNAME("freadHeaderPnm");
-
- if (pw) *pw = 0;
- if (ph) *ph = 0;
- if (pd) *pd = 0;
- if (ptype) *ptype = 0;
- if (pbps) *pbps = 0;
- if (pspp) *pspp = 0;
- if (!fp)
- return ERROR_INT("fp not defined", procName, 1);
-
- if (fscanf(fp, "P%d\n", &type) != 1)
- return ERROR_INT("invalid read for type", procName, 1);
- if (type < 1 || type > 7)
- return ERROR_INT("invalid pnm file", procName, 1);
-
- if (pnmSkipCommentLines(fp))
- return ERROR_INT("no data in file", procName, 1);
-
- if (type == 7) {
- w = h = d = bps = spp = maxval = 0;
- for (i = 0; i < 10; i++) { /* limit to 10 lines of this header */
- if (pnmReadNextString(fp, tag, sizeof(tag)))
- return ERROR_INT("found no next tag", procName, 1);
- if (!strcmp(tag, "WIDTH")) {
- if (pnmReadNextNumber(fp, &w))
- return ERROR_INT("failed reading width", procName, 1);
- continue;
- }
- if (!strcmp(tag, "HEIGHT")) {
- if (pnmReadNextNumber(fp, &h))
- return ERROR_INT("failed reading height", procName, 1);
- continue;
- }
- if (!strcmp(tag, "DEPTH")) {
- if (pnmReadNextNumber(fp, &spp))
- return ERROR_INT("failed reading depth", procName, 1);
- continue;
- }
- if (!strcmp(tag, "MAXVAL")) {
- if (pnmReadNextNumber(fp, &maxval))
- return ERROR_INT("failed reading maxval", procName, 1);
- continue;
- }
- if (!strcmp(tag, "TUPLTYPE")) {
- if (pnmReadNextString(fp, tupltype, sizeof(tupltype)))
- return ERROR_INT("failed reading tuple type", procName, 1);
- continue;
- }
- if (!strcmp(tag, "ENDHDR")) {
- if ('\n' != (ch = fgetc(fp)))
- return ERROR_INT("missing LF after ENDHDR", procName, 1);
- break;
- }
- }
- if (w <= 0 || h <= 0 || w > MAX_PNM_WIDTH || h > MAX_PNM_HEIGHT) {
- L_INFO("invalid size: w = %d, h = %d\n", procName, w, h);
- return 1;
- }
- if (maxval == 1) {
- d = bps = 1;
- } else if (maxval == 3) {
- d = bps = 2;
- } else if (maxval == 15) {
- d = bps = 4;
- } else if (maxval == 255) {
- d = bps = 8;
- } else if (maxval == 0xffff) {
- d = bps = 16;
- } else {
- L_INFO("invalid maxval = %d\n", procName, maxval);
- return 1;
- }
- switch (spp) {
- case 1:
- /* d and bps are already set */
- break;
- case 2:
- case 3:
- case 4:
- /* create a 32 bpp Pix */
- d = 32;
- break;
- default:
- L_INFO("invalid depth = %d\n", procName, spp);
- return 1;
- }
- } else {
-
- if (fscanf(fp, "%d %d\n", &w, &h) != 2)
- return ERROR_INT("invalid read for w,h", procName, 1);
- if (w <= 0 || h <= 0 || w > MAX_PNM_WIDTH || h > MAX_PNM_HEIGHT) {
- L_INFO("invalid size: w = %d, h = %d\n", procName, w, h);
- return 1;
- }
-
- /* Get depth of pix. For types 2 and 5, we use the maxval.
- * Important implementation note:
- * - You can't use fscanf(), which throws away whitespace,
- * and will discard binary data if it starts with whitespace(s).
- * - You can't use fgets(), which stops at newlines, but this
- * dumb format doesn't require a newline after the maxval
- * number -- it just requires one whitespace character.
- * - Which leaves repeated calls to fgetc, including swallowing
- * the single whitespace character. */
- if (type == 1 || type == 4) {
- d = 1;
- spp = 1;
- bps = 1;
- } else if (type == 2 || type == 5) {
- if (pnmReadNextNumber(fp, &maxval))
- return ERROR_INT("invalid read for maxval (2,5)", procName, 1);
- if (maxval == 3) {
- d = 2;
- } else if (maxval == 15) {
- d = 4;
- } else if (maxval == 255) {
- d = 8;
- } else if (maxval == 0xffff) {
- d = 16;
- } else {
- lept_stderr("maxval = %d\n", maxval);
- return ERROR_INT("invalid maxval", procName, 1);
- }
- bps = d;
- spp = 1;
- } else { /* type == 3 || type == 6; this is rgb */
- if (pnmReadNextNumber(fp, &maxval))
- return ERROR_INT("invalid read for maxval (3,6)", procName, 1);
- if (maxval != 255 && maxval != 0xffff) {
- L_ERROR("unexpected maxval = %d\n", procName, maxval);
- return 1;
- }
- bps = (maxval == 255) ? 8 : 16;
- d = 32;
- spp = 3;
- }
- }
- if (pw) *pw = w;
- if (ph) *ph = h;
- if (pd) *pd = d;
- if (ptype) *ptype = type;
- if (pbps) *pbps = bps;
- if (pspp) *pspp = spp;
- return 0;
-}
-
-
-/*!
- * \brief pixWriteStreamPnm()
- *
- * \param[in] fp file stream opened for write
- * \param[in] pix
- * \return 0 if OK; 1 on error
- *
- *
- * Notes:
- * (1) This writes "raw" packed format only:
- * 1 bpp --> pbm (P4)
- * 2, 4, 8, 16 bpp, no colormap or grayscale colormap --> pgm (P5)
- * 2, 4, 8 bpp with color-valued colormap, or rgb --> rgb ppm (P6)
- * (2) 24 bpp rgb are not supported in leptonica, but this will
- * write them out as a packed array of bytes (3 to a pixel).
- *
- */
-l_ok
-pixWriteStreamPnm(FILE *fp,
- PIX *pix)
-{
-l_uint8 val8;
-l_uint8 pel[4];
-l_uint16 val16;
-l_int32 h, w, d, ds, i, j, wpls, bpl, filebpl, writeerror, maxval;
-l_uint32 *pword, *datas, *lines;
-PIX *pixs;
-
- PROCNAME("pixWriteStreamPnm");
-
- if (!fp)
- return ERROR_INT("fp not defined", procName, 1);
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
-
- pixGetDimensions(pix, &w, &h, &d);
- if (d != 1 && d != 2 && d != 4 && d != 8 && d != 16 && d != 24 && d != 32)
- return ERROR_INT("d not in {1,2,4,8,16,24,32}", procName, 1);
- if (d == 32 && pixGetSpp(pix) == 4)
- return pixWriteStreamPam(fp, pix);
-
- /* If a colormap exists, remove and convert to grayscale or rgb */
- if (pixGetColormap(pix) != NULL)
- pixs = pixRemoveColormap(pix, REMOVE_CMAP_BASED_ON_SRC);
- else
- pixs = pixClone(pix);
- ds = pixGetDepth(pixs);
- datas = pixGetData(pixs);
- wpls = pixGetWpl(pixs);
-
- writeerror = 0;
-
- if (ds == 1) { /* binary */
- fprintf(fp, "P4\n# Raw PBM file written by leptonica "
- "(www.leptonica.com)\n%d %d\n", w, h);
-
- bpl = (w + 7) / 8;
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- for (j = 0; j < bpl; j++) {
- val8 = GET_DATA_BYTE(lines, j);
- fwrite(&val8, 1, 1, fp);
- }
- }
- } else if (ds == 2 || ds == 4 || ds == 8 || ds == 16) { /* grayscale */
- maxval = (1 << ds) - 1;
- fprintf(fp, "P5\n# Raw PGM file written by leptonica "
- "(www.leptonica.com)\n%d %d\n%d\n", w, h, maxval);
-
- if (ds != 16) {
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- for (j = 0; j < w; j++) {
- if (ds == 2)
- val8 = GET_DATA_DIBIT(lines, j);
- else if (ds == 4)
- val8 = GET_DATA_QBIT(lines, j);
- else /* ds == 8 */
- val8 = GET_DATA_BYTE(lines, j);
- fwrite(&val8, 1, 1, fp);
- }
- }
- } else { /* ds == 16 */
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- for (j = 0; j < w; j++) {
- val16 = GET_DATA_TWO_BYTES(lines, j);
- fwrite(&val16, 2, 1, fp);
- }
- }
- }
- } else { /* rgb color */
- fprintf(fp, "P6\n# Raw PPM file written by leptonica "
- "(www.leptonica.com)\n%d %d\n255\n", w, h);
-
- if (d == 24) { /* packed, 3 bytes to a pixel */
- filebpl = 3 * w;
- for (i = 0; i < h; i++) { /* write out each raster line */
- lines = datas + i * wpls;
- if (fwrite(lines, 1, filebpl, fp) != filebpl)
- writeerror = 1;
- }
- } else { /* 32 bpp rgb */
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- for (j = 0; j < wpls; j++) {
- pword = lines + j;
- pel[0] = GET_DATA_BYTE(pword, COLOR_RED);
- pel[1] = GET_DATA_BYTE(pword, COLOR_GREEN);
- pel[2] = GET_DATA_BYTE(pword, COLOR_BLUE);
- if (fwrite(pel, 1, 3, fp) != 3)
- writeerror = 1;
- }
- }
- }
- }
-
- pixDestroy(&pixs);
- if (writeerror)
- return ERROR_INT("image write fail", procName, 1);
- return 0;
-}
-
-
-/*!
- * \brief pixWriteStreamAsciiPnm()
- *
- * \param[in] fp file stream opened for write
- * \param[in] pix
- * \return 0 if OK; 1 on error
- *
- * Writes "ASCII" format only:
- * 1 bpp --> pbm P1
- * 2, 4, 8, 16 bpp, no colormap or grayscale colormap --> pgm P2
- * 2, 4, 8 bpp with color-valued colormap, or rgb --> rgb ppm P3
- */
-l_ok
-pixWriteStreamAsciiPnm(FILE *fp,
- PIX *pix)
-{
-char buffer[256];
-l_uint8 cval[3];
-l_int32 h, w, d, ds, i, j, k, maxval, count;
-l_uint32 val;
-PIX *pixs;
-
- PROCNAME("pixWriteStreamAsciiPnm");
-
- if (!fp)
- return ERROR_INT("fp not defined", procName, 1);
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
-
- pixGetDimensions(pix, &w, &h, &d);
- if (d != 1 && d != 2 && d != 4 && d != 8 && d != 16 && d != 32)
- return ERROR_INT("d not in {1,2,4,8,16,32}", procName, 1);
-
- /* If a colormap exists, remove and convert to grayscale or rgb */
- if (pixGetColormap(pix) != NULL)
- pixs = pixRemoveColormap(pix, REMOVE_CMAP_BASED_ON_SRC);
- else
- pixs = pixClone(pix);
- ds = pixGetDepth(pixs);
-
- if (ds == 1) { /* binary */
- fprintf(fp, "P1\n# Ascii PBM file written by leptonica "
- "(www.leptonica.com)\n%d %d\n", w, h);
-
- count = 0;
- for (i = 0; i < h; i++) {
- for (j = 0; j < w; j++) {
- pixGetPixel(pixs, j, i, &val);
- if (val == 0)
- fputc('0', fp);
- else /* val == 1 */
- fputc('1', fp);
- fputc(' ', fp);
- count += 2;
- if (count >= 70) {
- fputc('\n', fp);
- count = 0;
- }
- }
- }
- } else if (ds == 2 || ds == 4 || ds == 8 || ds == 16) { /* grayscale */
- maxval = (1 << ds) - 1;
- fprintf(fp, "P2\n# Ascii PGM file written by leptonica "
- "(www.leptonica.com)\n%d %d\n%d\n", w, h, maxval);
-
- count = 0;
- for (i = 0; i < h; i++) {
- for (j = 0; j < w; j++) {
- pixGetPixel(pixs, j, i, &val);
- if (ds == 2) {
- snprintf(buffer, sizeof(buffer), "%1d ", val);
- fwrite(buffer, 1, 2, fp);
- count += 2;
- } else if (ds == 4) {
- snprintf(buffer, sizeof(buffer), "%2d ", val);
- fwrite(buffer, 1, 3, fp);
- count += 3;
- } else if (ds == 8) {
- snprintf(buffer, sizeof(buffer), "%3d ", val);
- fwrite(buffer, 1, 4, fp);
- count += 4;
- } else { /* ds == 16 */
- snprintf(buffer, sizeof(buffer), "%5d ", val);
- fwrite(buffer, 1, 6, fp);
- count += 6;
- }
- if (count >= 60) {
- fputc('\n', fp);
- count = 0;
- }
- }
- }
- } else { /* rgb color */
- fprintf(fp, "P3\n# Ascii PPM file written by leptonica "
- "(www.leptonica.com)\n%d %d\n255\n", w, h);
- count = 0;
- for (i = 0; i < h; i++) {
- for (j = 0; j < w; j++) {
- pixGetPixel(pixs, j, i, &val);
- cval[0] = GET_DATA_BYTE(&val, COLOR_RED);
- cval[1] = GET_DATA_BYTE(&val, COLOR_GREEN);
- cval[2] = GET_DATA_BYTE(&val, COLOR_BLUE);
- for (k = 0; k < 3; k++) {
- snprintf(buffer, sizeof(buffer), "%3d ", cval[k]);
- fwrite(buffer, 1, 4, fp);
- count += 4;
- if (count >= 60) {
- fputc('\n', fp);
- count = 0;
- }
- }
- }
- }
- }
-
- pixDestroy(&pixs);
- return 0;
-}
-
-
-/*!
- * \brief pixWriteStreamPam()
- *
- * \param[in] fp file stream opened for write
- * \param[in] pix
- * \return 0 if OK; 1 on error
- *
- *
- * Notes:
- * (1) This writes arbitrary PAM (P7) packed format.
- * (2) 24 bpp rgb are not supported in leptonica, but this will
- * write them out as a packed array of bytes (3 to a pixel).
- *
- */
-l_ok
-pixWriteStreamPam(FILE *fp,
- PIX *pix)
-{
-l_uint8 val8;
-l_uint8 pel[8];
-l_uint16 val16;
-l_int32 h, w, d, ds, i, j;
-l_int32 wpls, spps, filebpl, writeerror, maxval;
-l_uint32 *pword, *datas, *lines;
-PIX *pixs;
-
- PROCNAME("pixWriteStreamPam");
-
- if (!fp)
- return ERROR_INT("fp not defined", procName, 1);
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
-
- pixGetDimensions(pix, &w, &h, &d);
- if (d != 1 && d != 2 && d != 4 && d != 8 && d != 16 && d != 24 && d != 32)
- return ERROR_INT("d not in {1,2,4,8,16,24,32}", procName, 1);
-
- /* If a colormap exists, remove and convert to grayscale or rgb */
- if (pixGetColormap(pix) != NULL)
- pixs = pixRemoveColormap(pix, REMOVE_CMAP_BASED_ON_SRC);
- else
- pixs = pixClone(pix);
- ds = pixGetDepth(pixs);
- datas = pixGetData(pixs);
- wpls = pixGetWpl(pixs);
- spps = pixGetSpp(pixs);
- if (ds < 24)
- maxval = (1 << ds) - 1;
- else
- maxval = 255;
-
- writeerror = 0;
- fprintf(fp, "P7\n# Arbitrary PAM file written by leptonica "
- "(www.leptonica.com)\n");
- fprintf(fp, "WIDTH %d\n", w);
- fprintf(fp, "HEIGHT %d\n", h);
- fprintf(fp, "DEPTH %d\n", spps);
- fprintf(fp, "MAXVAL %d\n", maxval);
- if (spps == 1 && ds == 1)
- fprintf(fp, "TUPLTYPE BLACKANDWHITE\n");
- else if (spps == 1)
- fprintf(fp, "TUPLTYPE GRAYSCALE\n");
- else if (spps == 3)
- fprintf(fp, "TUPLTYPE RGB\n");
- else if (spps == 4)
- fprintf(fp, "TUPLTYPE RGB_ALPHA\n");
- fprintf(fp, "ENDHDR\n");
-
- switch (d) {
- case 1:
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- for (j = 0; j < w; j++) {
- val8 = GET_DATA_BIT(lines, j);
- val8 ^= 1; /* pam apparently uses white-is-1 photometry */
- if (fwrite(&val8, 1, 1, fp) != 1)
- writeerror = 1;
- }
- }
- break;
-
- case 2:
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- for (j = 0; j < w; j++) {
- val8 = GET_DATA_DIBIT(lines, j);
- if (fwrite(&val8, 1, 1, fp) != 1)
- writeerror = 1;
- }
- }
- break;
-
- case 4:
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- for (j = 0; j < w; j++) {
- val8 = GET_DATA_QBIT(lines, j);
- if (fwrite(&val8, 1, 1, fp) != 1)
- writeerror = 1;
- }
- }
- break;
-
- case 8:
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- for (j = 0; j < w; j++) {
- val8 = GET_DATA_BYTE(lines, j);
- if (fwrite(&val8, 1, 1, fp) != 1)
- writeerror = 1;
- }
- }
- break;
-
- case 16:
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- for (j = 0; j < w; j++) {
- val16 = GET_DATA_TWO_BYTES(lines, j);
- if (fwrite(&val16, 2, 1, fp) != 1)
- writeerror = 1;
- }
- }
- break;
-
- case 24:
- filebpl = 3 * w;
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- if (fwrite(lines, 1, filebpl, fp) != filebpl)
- writeerror = 1;
- }
- break;
-
- case 32:
- switch (spps) {
- case 3:
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- for (j = 0; j < wpls; j++) {
- pword = lines + j;
- pel[0] = GET_DATA_BYTE(pword, COLOR_RED);
- pel[1] = GET_DATA_BYTE(pword, COLOR_GREEN);
- pel[2] = GET_DATA_BYTE(pword, COLOR_BLUE);
- if (fwrite(pel, 1, 3, fp) != 3)
- writeerror = 1;
- }
- }
- break;
- case 4:
- for (i = 0; i < h; i++) {
- lines = datas + i * wpls;
- for (j = 0; j < wpls; j++) {
- pword = lines + j;
- pel[0] = GET_DATA_BYTE(pword, COLOR_RED);
- pel[1] = GET_DATA_BYTE(pword, COLOR_GREEN);
- pel[2] = GET_DATA_BYTE(pword, COLOR_BLUE);
- pel[3] = GET_DATA_BYTE(pword, L_ALPHA_CHANNEL);
- if (fwrite(pel, 1, 4, fp) != 4)
- writeerror = 1;
- }
- }
- break;
- }
- break;
- }
-
- pixDestroy(&pixs);
- if (writeerror)
- return ERROR_INT("image write fail", procName, 1);
- return 0;
-}
-
-
-/*---------------------------------------------------------------------*
- * Read/write to memory *
- *---------------------------------------------------------------------*/
-
-/*!
- * \brief pixReadMemPnm()
- *
- * \param[in] data const; pnm-encoded
- * \param[in] size of data
- * \return pix, or NULL on error
- *
- *
- * Notes:
- * (1) The %size byte of %data must be a null character.
- *
- */
-PIX *
-pixReadMemPnm(const l_uint8 *data,
- size_t size)
-{
-FILE *fp;
-PIX *pix;
-
- PROCNAME("pixReadMemPnm");
-
- if (!data)
- return (PIX *)ERROR_PTR("data not defined", procName, NULL);
- if ((fp = fopenReadFromMemory(data, size)) == NULL)
- return (PIX *)ERROR_PTR("stream not opened", procName, NULL);
- pix = pixReadStreamPnm(fp);
- fclose(fp);
- if (!pix) L_ERROR("pix not read\n", procName);
- return pix;
-}
-
-
-/*!
- * \brief readHeaderMemPnm()
- *
- * \param[in] data const; pnm-encoded
- * \param[in] size of data
- * \param[out] pw [optional]
- * \param[out] ph [optional]
- * \param[out] pd [optional]
- * \param[out] ptype [optional] pnm type
- * \param[out] pbps [optional] bits/sample
- * \param[out] pspp [optional] samples/pixel
- * \return 0 if OK, 1 on error
- */
-l_ok
-readHeaderMemPnm(const l_uint8 *data,
- size_t size,
- l_int32 *pw,
- l_int32 *ph,
- l_int32 *pd,
- l_int32 *ptype,
- l_int32 *pbps,
- l_int32 *pspp)
-{
-l_int32 ret;
-FILE *fp;
-
- PROCNAME("readHeaderMemPnm");
-
- if (!data)
- return ERROR_INT("data not defined", procName, 1);
-
- if ((fp = fopenReadFromMemory(data, size)) == NULL)
- return ERROR_INT("stream not opened", procName, 1);
- ret = freadHeaderPnm(fp, pw, ph, pd, ptype, pbps, pspp);
- fclose(fp);
- if (ret)
- return ERROR_INT("header data read failed", procName, 1);
- return 0;
-}
-
-
-/*!
- * \brief pixWriteMemPnm()
- *
- * \param[out] pdata data of PNM image
- * \param[out] psize size of returned data
- * \param[in] pix
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) See pixWriteStreamPnm() for usage. This version writes to
- * memory instead of to a file stream.
- *
- */
-l_ok
-pixWriteMemPnm(l_uint8 **pdata,
- size_t *psize,
- PIX *pix)
-{
-l_int32 ret;
-FILE *fp;
-
- PROCNAME("pixWriteMemPnm");
-
- if (pdata) *pdata = NULL;
- if (psize) *psize = 0;
- if (!pdata)
- return ERROR_INT("&data not defined", procName, 1 );
- if (!psize)
- return ERROR_INT("&size not defined", procName, 1 );
- if (!pix)
- return ERROR_INT("&pix not defined", procName, 1 );
-
-#if HAVE_FMEMOPEN
- if ((fp = open_memstream((char **)pdata, psize)) == NULL)
- return ERROR_INT("stream not opened", procName, 1);
- ret = pixWriteStreamPnm(fp, pix);
-#else
- L_INFO("work-around: writing to a temp file\n", procName);
- #ifdef _WIN32
- if ((fp = fopenWriteWinTempfile()) == NULL)
- return ERROR_INT("tmpfile stream not opened", procName, 1);
- #else
- if ((fp = tmpfile()) == NULL)
- return ERROR_INT("tmpfile stream not opened", procName, 1);
- #endif /* _WIN32 */
- ret = pixWriteStreamPnm(fp, pix);
- rewind(fp);
- *pdata = l_binaryReadStream(fp, psize);
-#endif /* HAVE_FMEMOPEN */
- fclose(fp);
- return ret;
-}
-
-
-/*!
- * \brief pixWriteMemPam()
- *
- * \param[out] pdata data of PAM image
- * \param[out] psize size of returned data
- * \param[in] pix
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) See pixWriteStreamPnm() for usage. This version writes to
- * memory instead of to a file stream.
- *
- */
-l_ok
-pixWriteMemPam(l_uint8 **pdata,
- size_t *psize,
- PIX *pix)
-{
-l_int32 ret;
-FILE *fp;
-
- PROCNAME("pixWriteMemPam");
-
- if (pdata) *pdata = NULL;
- if (psize) *psize = 0;
- if (!pdata)
- return ERROR_INT("&data not defined", procName, 1 );
- if (!psize)
- return ERROR_INT("&size not defined", procName, 1 );
- if (!pix)
- return ERROR_INT("&pix not defined", procName, 1 );
-
-#if HAVE_FMEMOPEN
- if ((fp = open_memstream((char **)pdata, psize)) == NULL)
- return ERROR_INT("stream not opened", procName, 1);
- ret = pixWriteStreamPam(fp, pix);
-#else
- L_INFO("work-around: writing to a temp file\n", procName);
- #ifdef _WIN32
- if ((fp = fopenWriteWinTempfile()) == NULL)
- return ERROR_INT("tmpfile stream not opened", procName, 1);
- #else
- if ((fp = tmpfile()) == NULL)
- return ERROR_INT("tmpfile stream not opened", procName, 1);
- #endif /* _WIN32 */
- ret = pixWriteStreamPam(fp, pix);
- rewind(fp);
- *pdata = l_binaryReadStream(fp, psize);
-#endif /* HAVE_FMEMOPEN */
- fclose(fp);
- return ret;
-}
-
-
-
-/*--------------------------------------------------------------------*
- * Static helpers *
- *--------------------------------------------------------------------*/
-/*!
- * \brief pnmReadNextAsciiValue()
- *
- * Return: 0 if OK, 1 on error or EOF.
- *
- * Notes:
- * (1) This reads the next sample value in ASCII from the file.
- */
-static l_int32
-pnmReadNextAsciiValue(FILE *fp,
- l_int32 *pval)
-{
-l_int32 c, ignore;
-
- PROCNAME("pnmReadNextAsciiValue");
-
- if (!pval)
- return ERROR_INT("&val not defined", procName, 1);
- *pval = 0;
- if (!fp)
- return ERROR_INT("stream not open", procName, 1);
- do { /* skip whitespace */
- if ((c = fgetc(fp)) == EOF)
- return 1;
- } while (c == ' ' || c == '\t' || c == '\n' || c == '\r');
-
- fseek(fp, -1L, SEEK_CUR); /* back up one byte */
- ignore = fscanf(fp, "%d", pval);
- return 0;
-}
-
-
-/*!
- * \brief pnmReadNextNumber()
- *
- * \param[in] fp file stream
- * \param[out] pval value as an integer
- * \return 0 if OK, 1 on error or EOF.
- *
- *
- * Notes:
- * (1) This reads the next set of numeric chars, returning
- * the value and swallowing the trailing whitespace character.
- * This is needed to read the maxval in the header, which
- * precedes the binary data.
- *
- */
-static l_int32
-pnmReadNextNumber(FILE *fp,
- l_int32 *pval)
-{
-char buf[8];
-l_int32 i, c, foundws;
-
- PROCNAME("pnmReadNextNumber");
-
- if (!pval)
- return ERROR_INT("&val not defined", procName, 1);
- *pval = 0;
- if (!fp)
- return ERROR_INT("stream not open", procName, 1);
-
- /* The ASCII characters for the number are followed by exactly
- * one whitespace character. */
- foundws = FALSE;
- for (i = 0; i < 8; i++)
- buf[i] = '\0';
- for (i = 0; i < 8; i++) {
- if ((c = fgetc(fp)) == EOF)
- return ERROR_INT("end of file reached", procName, 1);
- if (c == ' ' || c == '\t' || c == '\n' || c == '\r') {
- foundws = TRUE;
- buf[i] = '\n';
- break;
- }
- if (!isdigit(c))
- return ERROR_INT("char read is not a digit", procName, 1);
- buf[i] = c;
- }
- if (!foundws)
- return ERROR_INT("no whitespace found", procName, 1);
- if (sscanf(buf, "%d", pval) != 1)
- return ERROR_INT("invalid read", procName, 1);
- return 0;
-}
-
-/*!
- * \brief pnmReadNextString()
- *
- * \param[in] fp file stream
- * \param[out] buff pointer to the string buffer
- * \param[in] size max. number of charactes in buffer
- * \return 0 if OK, 1 on error or EOF.
- *
- *
- * Notes:
- * (1) This reads the next set of alphanumeric chars,
- * returning the string and swallowing the trailing
- * whitespace characters.
- * This is needed to read header lines, which precede
- * the P7 format binary data.
- *
- */
-static l_int32
-pnmReadNextString(FILE *fp,
- char *buff,
- l_int32 size)
-{
-l_int32 i, c;
-
- PROCNAME("pnmReadNextString");
-
- if (!buff)
- return ERROR_INT("buff not defined", procName, 1);
- *buff = '\0';
- if (!fp)
- return ERROR_INT("stream not open", procName, 1);
- if (size <= 0)
- return ERROR_INT("size is too small", procName, 1);
-
- do { /* skip whitespace */
- if ((c = fgetc(fp)) == EOF)
- return ERROR_INT("end of file reached", procName, 1);
- } while (c == ' ' || c == '\t' || c == '\n' || c == '\r');
-
- /* Comment lines are allowed to appear
- * anywhere in the header lines */
- if (c == '#') {
- do { /* each line starting with '#' */
- do { /* this entire line */
- if ((c = fgetc(fp)) == EOF)
- return ERROR_INT("end of file reached", procName, 1);
- } while (c != '\n');
- if ((c = fgetc(fp)) == EOF)
- return ERROR_INT("end of file reached", procName, 1);
- } while (c == '#');
- }
-
- /* The next string ends when there is
- * a whitespace character following. */
- for (i = 0; i < size - 1; i++) {
- if (c == ' ' || c == '\t' || c == '\n' || c == '\r')
- break;
- buff[i] = c;
- if ((c = fgetc(fp)) == EOF)
- return ERROR_INT("end of file reached", procName, 1);
- }
- buff[i] = '\0';
-
- /* Back up one byte */
- fseek(fp, -1L, SEEK_CUR);
- if (i >= size - 1)
- return ERROR_INT("buff size too small", procName, 1);
-
- /* Skip over trailing spaces and tabs */
- for (;;) {
- if ((c = fgetc(fp)) == EOF)
- return ERROR_INT("end of file reached", procName, 1);
- if (c != ' ' && c != '\t')
- break;
- }
-
- /* Back up one byte */
- fseek(fp, -1L, SEEK_CUR);
- return 0;
-}
-
-
-/*!
- * \brief pnmSkipCommentLines()
- *
- * Return: 0 if OK, 1 on error or EOF
- *
- * Notes:
- * (1) Comment lines begin with '#'
- * (2) Usage: caller should check return value for EOF
- */
-static l_int32
-pnmSkipCommentLines(FILE *fp)
-{
-l_int32 c;
-
- PROCNAME("pnmSkipCommentLines");
-
- if (!fp)
- return ERROR_INT("stream not open", procName, 1);
- if ((c = fgetc(fp)) == EOF)
- return 1;
- if (c == '#') {
- do { /* each line starting with '#' */
- do { /* this entire line */
- if ((c = fgetc(fp)) == EOF)
- return 1;
- } while (c != '\n');
- if ((c = fgetc(fp)) == EOF)
- return 1;
- } while (c == '#');
- }
-
- /* Back up one byte */
- fseek(fp, -1L, SEEK_CUR);
- return 0;
-}
-
-/* --------------------------------------------*/
-#endif /* USE_PNMIO */
-/* --------------------------------------------*/
diff --git a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pnmiostub.c b/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pnmiostub.c
deleted file mode 100644
index 2238755c..00000000
--- a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/pnmiostub.c
+++ /dev/null
@@ -1,120 +0,0 @@
-/*====================================================================*
- - Copyright (C) 2001 Leptonica. All rights reserved.
- -
- - Redistribution and use in source and binary forms, with or without
- - modification, are permitted provided that the following conditions
- - are met:
- - 1. Redistributions of source code must retain the above copyright
- - notice, this list of conditions and the following disclaimer.
- - 2. Redistributions in binary form must reproduce the above
- - copyright notice, this list of conditions and the following
- - disclaimer in the documentation and/or other materials
- - provided with the distribution.
- -
- - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- - ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- - LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- - A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL ANY
- - CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
- - EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
- - PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
- - PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
- - OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
- - NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- *====================================================================*/
-
-/*!
- * \file pnmiostub.c
- *
- *
- * Stubs for pnmio.c functions
- *
- */
-
-#ifdef HAVE_CONFIG_H
-#include
-#endif /* HAVE_CONFIG_H */
-
-#include "allheaders.h"
-
-/* --------------------------------------------*/
-#if !USE_PNMIO /* defined in environ.h */
-/* --------------------------------------------*/
-
-PIX * pixReadStreamPnm(FILE *fp)
-{
- return (PIX * )ERROR_PTR("function not present", "pixReadStreamPnm", NULL);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok readHeaderPnm(const char *filename, l_int32 *pw, l_int32 *ph,
- l_int32 *pd, l_int32 *ptype, l_int32 *pbps,
- l_int32 *pspp)
-{
- return ERROR_INT("function not present", "readHeaderPnm", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok freadHeaderPnm(FILE *fp, l_int32 *pw, l_int32 *ph, l_int32 *pd,
- l_int32 *ptype, l_int32 *pbps, l_int32 *pspp)
-{
- return ERROR_INT("function not present", "freadHeaderPnm", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok pixWriteStreamPnm(FILE *fp, PIX *pix)
-{
- return ERROR_INT("function not present", "pixWriteStreamPnm", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok pixWriteStreamAsciiPnm(FILE *fp, PIX *pix)
-{
- return ERROR_INT("function not present", "pixWriteStreamAsciiPnm", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok pixWriteStreamPam(FILE *fp, PIX *pix)
-{
- return ERROR_INT("function not present", "pixWriteStreamPam", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-PIX * pixReadMemPnm(const l_uint8 *cdata, size_t size)
-{
- return (PIX * )ERROR_PTR("function not present", "pixReadMemPnm", NULL);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok readHeaderMemPnm(const l_uint8 *cdata, size_t size, l_int32 *pw,
- l_int32 *ph, l_int32 *pd, l_int32 *ptype,
- l_int32 *pbps, l_int32 *pspp)
-{
- return ERROR_INT("function not present", "readHeaderMemPnm", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok pixWriteMemPnm(l_uint8 **pdata, size_t *psize, PIX *pix)
-{
- return ERROR_INT("function not present", "pixWriteMemPnm", 1);
-}
-/* ----------------------------------------------------------------------*/
-
-l_ok pixWriteMemPam(l_uint8 **pdata, size_t *psize, PIX *pix)
-{
- return ERROR_INT("function not present", "pixWriteMemPam", 1);
-}
-
-
-/* --------------------------------------------*/
-#endif /* !USE_PNMIO */
-/* --------------------------------------------*/
diff --git a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/projective.c b/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/projective.c
deleted file mode 100644
index 527b80c0..00000000
--- a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/projective.c
+++ /dev/null
@@ -1,926 +0,0 @@
-/*====================================================================*
- - Copyright (C) 2001 Leptonica. All rights reserved.
- -
- - Redistribution and use in source and binary forms, with or without
- - modification, are permitted provided that the following conditions
- - are met:
- - 1. Redistributions of source code must retain the above copyright
- - notice, this list of conditions and the following disclaimer.
- - 2. Redistributions in binary form must reproduce the above
- - copyright notice, this list of conditions and the following
- - disclaimer in the documentation and/or other materials
- - provided with the distribution.
- -
- - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- - ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- - LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- - A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL ANY
- - CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
- - EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
- - PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
- - PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
- - OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
- - NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- *====================================================================*/
-
-/*!
- * \file projective.c
- *
- *
- * Projective (4 pt) image transformation using a sampled
- * (to nearest integer) transform on each dest point
- * PIX *pixProjectiveSampledPta()
- * PIX *pixProjectiveSampled()
- *
- * Projective (4 pt) image transformation using interpolation
- * (or area mapping) for anti-aliasing images that are
- * 2, 4, or 8 bpp gray, or colormapped, or 32 bpp RGB
- * PIX *pixProjectivePta()
- * PIX *pixProjective()
- * PIX *pixProjectivePtaColor()
- * PIX *pixProjectiveColor()
- * PIX *pixProjectivePtaGray()
- * PIX *pixProjectiveGray()
- *
- * Projective transform including alpha (blend) component
- * PIX *pixProjectivePtaWithAlpha()
- *
- * Projective coordinate transformation
- * l_int32 getProjectiveXformCoeffs()
- * l_int32 projectiveXformSampledPt()
- * l_int32 projectiveXformPt()
- *
- * A projective transform can be specified as a specific functional
- * mapping between 4 points in the source and 4 points in the dest.
- * It preserves straight lines, but is less stable than a bilinear
- * transform, because it contains a division by a quantity that
- * can get arbitrarily small.)
- *
- * We give both a projective coordinate transformation and
- * two projective image transformations.
- *
- * For the former, we ask for the coordinate value (x',y')
- * in the transformed space for any point (x,y) in the original
- * space. The coefficients of the transformation are found by
- * solving 8 simultaneous equations for the 8 coordinates of
- * the 4 points in src and dest. The transformation can then
- * be used to compute the associated image transform, by
- * computing, for each dest pixel, the relevant pixel(s) in
- * the source. This can be done either by taking the closest
- * src pixel to each transformed dest pixel ("sampling") or
- * by doing an interpolation and averaging over 4 source
- * pixels with appropriate weightings ("interpolated").
- *
- * A typical application would be to remove keystoning
- * due to a projective transform in the imaging system.
- *
- * The projective transform is given by specifying two equations:
- *
- * x' = (ax + by + c) / (gx + hy + 1)
- * y' = (dx + ey + f) / (gx + hy + 1)
- *
- * where the eight coefficients have been computed from four
- * sets of these equations, each for two corresponding data pts.
- * In practice, once the coefficients are known, we use the
- * equations "backwards": for each point (x,y) in the dest image,
- * these two equations are used to compute the corresponding point
- * (x',y') in the src. That computed point in the src is then used
- * to determine the corresponding dest pixel value in one of two ways:
- *
- * ~ sampling: simply take the value of the src pixel in which this
- * point falls
- * ~ interpolation: take appropriate linear combinations of the
- * four src pixels that this dest pixel would
- * overlap, with the coefficients proportional
- * to the amount of overlap
- *
- * For small warp where there is little scale change, (e.g.,
- * for rotation) area mapping is nearly equivalent to interpolation.
- *
- * Typical relative timing of pointwise transforms (sampled = 1.0):
- * 8 bpp: sampled 1.0
- * interpolated 1.5
- * 32 bpp: sampled 1.0
- * interpolated 1.6
- * Additionally, the computation time/pixel is nearly the same
- * for 8 bpp and 32 bpp, for both sampled and interpolated.
- *
- */
-
-#ifdef HAVE_CONFIG_H
-#include
-#endif /* HAVE_CONFIG_H */
-
-#include
-#include
-#include "allheaders.h"
-
-extern l_float32 AlphaMaskBorderVals[2];
-
-/*------------------------------------------------------------n
- * Sampled projective image transformation *
- *-------------------------------------------------------------*/
-/*!
- * \brief pixProjectiveSampledPta()
- *
- * \param[in] pixs all depths
- * \param[in] ptad 4 pts of final coordinate space
- * \param[in] ptas 4 pts of initial coordinate space
- * \param[in] incolor L_BRING_IN_WHITE, L_BRING_IN_BLACK
- * \return pixd, or NULL on error
- *
- *
- * Notes:
- * (1) Brings in either black or white pixels from the boundary.
- * (2) Retains colormap, which you can do for a sampled transform..
- * (3) No 3 of the 4 points may be collinear.
- * (4) For 8 and 32 bpp pix, better quality is obtained by the
- * somewhat slower pixProjectivePta(). See that
- * function for relative timings between sampled and interpolated.
- *
- */
-PIX *
-pixProjectiveSampledPta(PIX *pixs,
- PTA *ptad,
- PTA *ptas,
- l_int32 incolor)
-{
-l_float32 *vc;
-PIX *pixd;
-
- PROCNAME("pixProjectiveSampledPta");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- if (!ptas)
- return (PIX *)ERROR_PTR("ptas not defined", procName, NULL);
- if (!ptad)
- return (PIX *)ERROR_PTR("ptad not defined", procName, NULL);
- if (incolor != L_BRING_IN_WHITE && incolor != L_BRING_IN_BLACK)
- return (PIX *)ERROR_PTR("invalid incolor", procName, NULL);
- if (ptaGetCount(ptas) != 4)
- return (PIX *)ERROR_PTR("ptas count not 4", procName, NULL);
- if (ptaGetCount(ptad) != 4)
- return (PIX *)ERROR_PTR("ptad count not 4", procName, NULL);
-
- /* Get backwards transform from dest to src, and apply it */
- getProjectiveXformCoeffs(ptad, ptas, &vc);
- pixd = pixProjectiveSampled(pixs, vc, incolor);
- LEPT_FREE(vc);
-
- return pixd;
-}
-
-
-/*!
- * \brief pixProjectiveSampled()
- *
- * \param[in] pixs all depths
- * \param[in] vc vector of 8 coefficients for projective transform
- * \param[in] incolor L_BRING_IN_WHITE, L_BRING_IN_BLACK
- * \return pixd, or NULL on error
- *
- *
- * Notes:
- * (1) Brings in either black or white pixels from the boundary.
- * (2) Retains colormap, which you can do for a sampled transform..
- * (3) For 8 or 32 bpp, much better quality is obtained by the
- * somewhat slower pixProjective(). See that function
- * for relative timings between sampled and interpolated.
- *
- */
-PIX *
-pixProjectiveSampled(PIX *pixs,
- l_float32 *vc,
- l_int32 incolor)
-{
-l_int32 i, j, w, h, d, x, y, wpls, wpld, color, cmapindex;
-l_uint32 val;
-l_uint32 *datas, *datad, *lines, *lined;
-PIX *pixd;
-PIXCMAP *cmap;
-
- PROCNAME("pixProjectiveSampled");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- if (!vc)
- return (PIX *)ERROR_PTR("vc not defined", procName, NULL);
- if (incolor != L_BRING_IN_WHITE && incolor != L_BRING_IN_BLACK)
- return (PIX *)ERROR_PTR("invalid incolor", procName, NULL);
- pixGetDimensions(pixs, &w, &h, &d);
- if (d != 1 && d != 2 && d != 4 && d != 8 && d != 32)
- return (PIX *)ERROR_PTR("depth not 1, 2, 4, 8 or 16", procName, NULL);
-
- /* Init all dest pixels to color to be brought in from outside */
- pixd = pixCreateTemplate(pixs);
- if ((cmap = pixGetColormap(pixs)) != NULL) {
- if (incolor == L_BRING_IN_WHITE)
- color = 1;
- else
- color = 0;
- pixcmapAddBlackOrWhite(cmap, color, &cmapindex);
- pixSetAllArbitrary(pixd, cmapindex);
- } else {
- if ((d == 1 && incolor == L_BRING_IN_WHITE) ||
- (d > 1 && incolor == L_BRING_IN_BLACK)) {
- pixClearAll(pixd);
- } else {
- pixSetAll(pixd);
- }
- }
-
- /* Scan over the dest pixels */
- datas = pixGetData(pixs);
- wpls = pixGetWpl(pixs);
- datad = pixGetData(pixd);
- wpld = pixGetWpl(pixd);
- for (i = 0; i < h; i++) {
- lined = datad + i * wpld;
- for (j = 0; j < w; j++) {
- projectiveXformSampledPt(vc, j, i, &x, &y);
- if (x < 0 || y < 0 || x >=w || y >= h)
- continue;
- lines = datas + y * wpls;
- if (d == 1) {
- val = GET_DATA_BIT(lines, x);
- SET_DATA_BIT_VAL(lined, j, val);
- } else if (d == 8) {
- val = GET_DATA_BYTE(lines, x);
- SET_DATA_BYTE(lined, j, val);
- } else if (d == 32) {
- lined[j] = lines[x];
- } else if (d == 2) {
- val = GET_DATA_DIBIT(lines, x);
- SET_DATA_DIBIT(lined, j, val);
- } else if (d == 4) {
- val = GET_DATA_QBIT(lines, x);
- SET_DATA_QBIT(lined, j, val);
- }
- }
- }
-
- return pixd;
-}
-
-
-/*---------------------------------------------------------------------*
- * Interpolated projective image transformation *
- *---------------------------------------------------------------------*/
-/*!
- * \brief pixProjectivePta()
- *
- * \param[in] pixs all depths; colormap ok
- * \param[in] ptad 4 pts of final coordinate space
- * \param[in] ptas 4 pts of initial coordinate space
- * \param[in] incolor L_BRING_IN_WHITE, L_BRING_IN_BLACK
- * \return pixd, or NULL on error
- *
- *
- * Notes:
- * (1) Brings in either black or white pixels from the boundary
- * (2) Removes any existing colormap, if necessary, before transforming
- *
- */
-PIX *
-pixProjectivePta(PIX *pixs,
- PTA *ptad,
- PTA *ptas,
- l_int32 incolor)
-{
-l_int32 d;
-l_uint32 colorval;
-PIX *pixt1, *pixt2, *pixd;
-
- PROCNAME("pixProjectivePta");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- if (!ptas)
- return (PIX *)ERROR_PTR("ptas not defined", procName, NULL);
- if (!ptad)
- return (PIX *)ERROR_PTR("ptad not defined", procName, NULL);
- if (incolor != L_BRING_IN_WHITE && incolor != L_BRING_IN_BLACK)
- return (PIX *)ERROR_PTR("invalid incolor", procName, NULL);
- if (ptaGetCount(ptas) != 4)
- return (PIX *)ERROR_PTR("ptas count not 4", procName, NULL);
- if (ptaGetCount(ptad) != 4)
- return (PIX *)ERROR_PTR("ptad count not 4", procName, NULL);
-
- if (pixGetDepth(pixs) == 1)
- return pixProjectiveSampledPta(pixs, ptad, ptas, incolor);
-
- /* Remove cmap if it exists, and unpack to 8 bpp if necessary */
- pixt1 = pixRemoveColormap(pixs, REMOVE_CMAP_BASED_ON_SRC);
- d = pixGetDepth(pixt1);
- if (d < 8)
- pixt2 = pixConvertTo8(pixt1, FALSE);
- else
- pixt2 = pixClone(pixt1);
- d = pixGetDepth(pixt2);
-
- /* Compute actual color to bring in from edges */
- colorval = 0;
- if (incolor == L_BRING_IN_WHITE) {
- if (d == 8)
- colorval = 255;
- else /* d == 32 */
- colorval = 0xffffff00;
- }
-
- if (d == 8)
- pixd = pixProjectivePtaGray(pixt2, ptad, ptas, colorval);
- else /* d == 32 */
- pixd = pixProjectivePtaColor(pixt2, ptad, ptas, colorval);
- pixDestroy(&pixt1);
- pixDestroy(&pixt2);
- return pixd;
-}
-
-
-/*!
- * \brief pixProjective()
- *
- * \param[in] pixs all depths; colormap ok
- * \param[in] vc vector of 8 coefficients for projective transform
- * \param[in] incolor L_BRING_IN_WHITE, L_BRING_IN_BLACK
- * \return pixd, or NULL on error
- *
- *
- * Notes:
- * (1) Brings in either black or white pixels from the boundary
- * (2) Removes any existing colormap, if necessary, before transforming
- *
- */
-PIX *
-pixProjective(PIX *pixs,
- l_float32 *vc,
- l_int32 incolor)
-{
-l_int32 d;
-l_uint32 colorval;
-PIX *pixt1, *pixt2, *pixd;
-
- PROCNAME("pixProjective");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- if (!vc)
- return (PIX *)ERROR_PTR("vc not defined", procName, NULL);
-
- if (pixGetDepth(pixs) == 1)
- return pixProjectiveSampled(pixs, vc, incolor);
-
- /* Remove cmap if it exists, and unpack to 8 bpp if necessary */
- pixt1 = pixRemoveColormap(pixs, REMOVE_CMAP_BASED_ON_SRC);
- d = pixGetDepth(pixt1);
- if (d < 8)
- pixt2 = pixConvertTo8(pixt1, FALSE);
- else
- pixt2 = pixClone(pixt1);
- d = pixGetDepth(pixt2);
-
- /* Compute actual color to bring in from edges */
- colorval = 0;
- if (incolor == L_BRING_IN_WHITE) {
- if (d == 8)
- colorval = 255;
- else /* d == 32 */
- colorval = 0xffffff00;
- }
-
- if (d == 8)
- pixd = pixProjectiveGray(pixt2, vc, colorval);
- else /* d == 32 */
- pixd = pixProjectiveColor(pixt2, vc, colorval);
- pixDestroy(&pixt1);
- pixDestroy(&pixt2);
- return pixd;
-}
-
-
-/*!
- * \brief pixProjectivePtaColor()
- *
- * \param[in] pixs 32 bpp
- * \param[in] ptad 4 pts of final coordinate space
- * \param[in] ptas 4 pts of initial coordinate space
- * \param[in] colorval e.g., 0 to bring in BLACK, 0xffffff00 for WHITE
- * \return pixd, or NULL on error
- */
-PIX *
-pixProjectivePtaColor(PIX *pixs,
- PTA *ptad,
- PTA *ptas,
- l_uint32 colorval)
-{
-l_float32 *vc;
-PIX *pixd;
-
- PROCNAME("pixProjectivePtaColor");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- if (!ptas)
- return (PIX *)ERROR_PTR("ptas not defined", procName, NULL);
- if (!ptad)
- return (PIX *)ERROR_PTR("ptad not defined", procName, NULL);
- if (pixGetDepth(pixs) != 32)
- return (PIX *)ERROR_PTR("pixs must be 32 bpp", procName, NULL);
- if (ptaGetCount(ptas) != 4)
- return (PIX *)ERROR_PTR("ptas count not 4", procName, NULL);
- if (ptaGetCount(ptad) != 4)
- return (PIX *)ERROR_PTR("ptad count not 4", procName, NULL);
-
- /* Get backwards transform from dest to src, and apply it */
- getProjectiveXformCoeffs(ptad, ptas, &vc);
- pixd = pixProjectiveColor(pixs, vc, colorval);
- LEPT_FREE(vc);
-
- return pixd;
-}
-
-
-/*!
- * \brief pixProjectiveColor()
- *
- * \param[in] pixs 32 bpp
- * \param[in] vc vector of 8 coefficients for projective transform
- * \param[in] colorval e.g., 0 to bring in BLACK, 0xffffff00 for WHITE
- * \return pixd, or NULL on error
- */
-PIX *
-pixProjectiveColor(PIX *pixs,
- l_float32 *vc,
- l_uint32 colorval)
-{
-l_int32 i, j, w, h, d, wpls, wpld;
-l_uint32 val;
-l_uint32 *datas, *datad, *lined;
-l_float32 x, y;
-PIX *pix1, *pix2, *pixd;
-
- PROCNAME("pixProjectiveColor");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- pixGetDimensions(pixs, &w, &h, &d);
- if (d != 32)
- return (PIX *)ERROR_PTR("pixs must be 32 bpp", procName, NULL);
- if (!vc)
- return (PIX *)ERROR_PTR("vc not defined", procName, NULL);
-
- datas = pixGetData(pixs);
- wpls = pixGetWpl(pixs);
- pixd = pixCreateTemplate(pixs);
- pixSetAllArbitrary(pixd, colorval);
- datad = pixGetData(pixd);
- wpld = pixGetWpl(pixd);
-
- /* Iterate over destination pixels */
- for (i = 0; i < h; i++) {
- lined = datad + i * wpld;
- for (j = 0; j < w; j++) {
- /* Compute float src pixel location corresponding to (i,j) */
- projectiveXformPt(vc, j, i, &x, &y);
- linearInterpolatePixelColor(datas, wpls, w, h, x, y, colorval,
- &val);
- *(lined + j) = val;
- }
- }
-
- /* If rgba, transform the pixs alpha channel and insert in pixd */
- if (pixGetSpp(pixs) == 4) {
- pix1 = pixGetRGBComponent(pixs, L_ALPHA_CHANNEL);
- pix2 = pixProjectiveGray(pix1, vc, 255); /* bring in opaque */
- pixSetRGBComponent(pixd, pix2, L_ALPHA_CHANNEL);
- pixDestroy(&pix1);
- pixDestroy(&pix2);
- }
-
- return pixd;
-}
-
-
-/*!
- * \brief pixProjectivePtaGray()
- *
- * \param[in] pixs 8 bpp
- * \param[in] ptad 4 pts of final coordinate space
- * \param[in] ptas 4 pts of initial coordinate space
- * \param[in] grayval 0 to bring in BLACK, 255 for WHITE
- * \return pixd, or NULL on error
- */
-PIX *
-pixProjectivePtaGray(PIX *pixs,
- PTA *ptad,
- PTA *ptas,
- l_uint8 grayval)
-{
-l_float32 *vc;
-PIX *pixd;
-
- PROCNAME("pixProjectivePtaGray");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- if (!ptas)
- return (PIX *)ERROR_PTR("ptas not defined", procName, NULL);
- if (!ptad)
- return (PIX *)ERROR_PTR("ptad not defined", procName, NULL);
- if (pixGetDepth(pixs) != 8)
- return (PIX *)ERROR_PTR("pixs must be 8 bpp", procName, NULL);
- if (ptaGetCount(ptas) != 4)
- return (PIX *)ERROR_PTR("ptas count not 4", procName, NULL);
- if (ptaGetCount(ptad) != 4)
- return (PIX *)ERROR_PTR("ptad count not 4", procName, NULL);
-
- /* Get backwards transform from dest to src, and apply it */
- getProjectiveXformCoeffs(ptad, ptas, &vc);
- pixd = pixProjectiveGray(pixs, vc, grayval);
- LEPT_FREE(vc);
-
- return pixd;
-}
-
-
-
-/*!
- * \brief pixProjectiveGray()
- *
- * \param[in] pixs 8 bpp
- * \param[in] vc vector of 8 coefficients for projective transform
- * \param[in] grayval 0 to bring in BLACK, 255 for WHITE
- * \return pixd, or NULL on error
- */
-PIX *
-pixProjectiveGray(PIX *pixs,
- l_float32 *vc,
- l_uint8 grayval)
-{
-l_int32 i, j, w, h, wpls, wpld, val;
-l_uint32 *datas, *datad, *lined;
-l_float32 x, y;
-PIX *pixd;
-
- PROCNAME("pixProjectiveGray");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- pixGetDimensions(pixs, &w, &h, NULL);
- if (pixGetDepth(pixs) != 8)
- return (PIX *)ERROR_PTR("pixs must be 8 bpp", procName, NULL);
- if (!vc)
- return (PIX *)ERROR_PTR("vc not defined", procName, NULL);
-
- datas = pixGetData(pixs);
- wpls = pixGetWpl(pixs);
- pixd = pixCreateTemplate(pixs);
- pixSetAllArbitrary(pixd, grayval);
- datad = pixGetData(pixd);
- wpld = pixGetWpl(pixd);
-
- /* Iterate over destination pixels */
- for (i = 0; i < h; i++) {
- lined = datad + i * wpld;
- for (j = 0; j < w; j++) {
- /* Compute float src pixel location corresponding to (i,j) */
- projectiveXformPt(vc, j, i, &x, &y);
- linearInterpolatePixelGray(datas, wpls, w, h, x, y, grayval, &val);
- SET_DATA_BYTE(lined, j, val);
- }
- }
-
- return pixd;
-}
-
-
-/*---------------------------------------------------------------------------*
- * Projective transform including alpha (blend) component *
- *---------------------------------------------------------------------------*/
-/*!
- * \brief pixProjectivePtaWithAlpha()
- *
- * \param[in] pixs 32 bpp rgb
- * \param[in] ptad 4 pts of final coordinate space
- * \param[in] ptas 4 pts of initial coordinate space
- * \param[in] pixg [optional] 8 bpp, for alpha channel, can be null
- * \param[in] fract between 0.0 and 1.0, with 0.0 fully transparent
- * and 1.0 fully opaque
- * \param[in] border of pixels added to capture transformed source pixels
- * \return pixd, or NULL on error
- *
- *
- * Notes:
- * (1) The alpha channel is transformed separately from pixs,
- * and aligns with it, being fully transparent outside the
- * boundary of the transformed pixs. For pixels that are fully
- * transparent, a blending function like pixBlendWithGrayMask()
- * will give zero weight to corresponding pixels in pixs.
- * (2) If pixg is NULL, it is generated as an alpha layer that is
- * partially opaque, using %fract. Otherwise, it is cropped
- * to pixs if required and %fract is ignored. The alpha channel
- * in pixs is never used.
- * (3) Colormaps are removed.
- * (4) When pixs is transformed, it doesn't matter what color is brought
- * in because the alpha channel will be transparent (0) there.
- * (5) To avoid losing source pixels in the destination, it may be
- * necessary to add a border to the source pix before doing
- * the projective transformation. This can be any non-negative
- * number.
- * (6) The input %ptad and %ptas are in a coordinate space before
- * the border is added. Internally, we compensate for this
- * before doing the projective transform on the image after
- * the border is added.
- * (7) The default setting for the border values in the alpha channel
- * is 0 (transparent) for the outermost ring of pixels and
- * (0.5 * fract * 255) for the second ring. When blended over
- * a second image, this
- * (a) shrinks the visible image to make a clean overlap edge
- * with an image below, and
- * (b) softens the edges by weakening the aliasing there.
- * Use l_setAlphaMaskBorder() to change these values.
- *
- */
-PIX *
-pixProjectivePtaWithAlpha(PIX *pixs,
- PTA *ptad,
- PTA *ptas,
- PIX *pixg,
- l_float32 fract,
- l_int32 border)
-{
-l_int32 ws, hs, d;
-PIX *pixd, *pixb1, *pixb2, *pixg2, *pixga;
-PTA *ptad2, *ptas2;
-
- PROCNAME("pixProjectivePtaWithAlpha");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- pixGetDimensions(pixs, &ws, &hs, &d);
- if (d != 32 && pixGetColormap(pixs) == NULL)
- return (PIX *)ERROR_PTR("pixs not cmapped or 32 bpp", procName, NULL);
- if (pixg && pixGetDepth(pixg) != 8) {
- L_WARNING("pixg not 8 bpp; using 'fract' transparent alpha\n",
- procName);
- pixg = NULL;
- }
- if (!pixg && (fract < 0.0 || fract > 1.0)) {
- L_WARNING("invalid fract; using 1.0 (fully transparent)\n", procName);
- fract = 1.0;
- }
- if (!pixg && fract == 0.0)
- L_WARNING("fully opaque alpha; image will not be blended\n", procName);
- if (!ptad)
- return (PIX *)ERROR_PTR("ptad not defined", procName, NULL);
- if (!ptas)
- return (PIX *)ERROR_PTR("ptas not defined", procName, NULL);
-
- /* Add border; the color doesn't matter */
- pixb1 = pixAddBorder(pixs, border, 0);
-
- /* Transform the ptr arrays to work on the bordered image */
- ptad2 = ptaTransform(ptad, border, border, 1.0, 1.0);
- ptas2 = ptaTransform(ptas, border, border, 1.0, 1.0);
-
- /* Do separate projective transform of rgb channels of pixs
- * and of pixg */
- pixd = pixProjectivePtaColor(pixb1, ptad2, ptas2, 0);
- if (!pixg) {
- pixg2 = pixCreate(ws, hs, 8);
- if (fract == 1.0)
- pixSetAll(pixg2);
- else
- pixSetAllArbitrary(pixg2, (l_int32)(255.0 * fract));
- } else {
- pixg2 = pixResizeToMatch(pixg, NULL, ws, hs);
- }
- if (ws > 10 && hs > 10) { /* see note 7 */
- pixSetBorderRingVal(pixg2, 1,
- (l_int32)(255.0 * fract * AlphaMaskBorderVals[0]));
- pixSetBorderRingVal(pixg2, 2,
- (l_int32)(255.0 * fract * AlphaMaskBorderVals[1]));
-
- }
- pixb2 = pixAddBorder(pixg2, border, 0); /* must be black border */
- pixga = pixProjectivePtaGray(pixb2, ptad2, ptas2, 0);
- pixSetRGBComponent(pixd, pixga, L_ALPHA_CHANNEL);
- pixSetSpp(pixd, 4);
-
- pixDestroy(&pixg2);
- pixDestroy(&pixb1);
- pixDestroy(&pixb2);
- pixDestroy(&pixga);
- ptaDestroy(&ptad2);
- ptaDestroy(&ptas2);
- return pixd;
-}
-
-
-/*-------------------------------------------------------------*
- * Projective coordinate transformation *
- *-------------------------------------------------------------*/
-/*!
- * \brief getProjectiveXformCoeffs()
- *
- * \param[in] ptas source 4 points; unprimed
- * \param[in] ptad transformed 4 points; primed
- * \param[out] pvc vector of coefficients of transform
- * \return 0 if OK; 1 on error
- *
- * We have a set of 8 equations, describing the projective
- * transformation that takes 4 points ptas into 4 other
- * points ptad. These equations are:
- *
- * x1' = c[0]*x1 + c[1]*y1 + c[2]) / (c[6]*x1 + c[7]*y1 + 1
- * y1' = c[3]*x1 + c[4]*y1 + c[5]) / (c[6]*x1 + c[7]*y1 + 1
- * x2' = c[0]*x2 + c[1]*y2 + c[2]) / (c[6]*x2 + c[7]*y2 + 1
- * y2' = c[3]*x2 + c[4]*y2 + c[5]) / (c[6]*x2 + c[7]*y2 + 1
- * x3' = c[0]*x3 + c[1]*y3 + c[2]) / (c[6]*x3 + c[7]*y3 + 1
- * y3' = c[3]*x3 + c[4]*y3 + c[5]) / (c[6]*x3 + c[7]*y3 + 1
- * x4' = c[0]*x4 + c[1]*y4 + c[2]) / (c[6]*x4 + c[7]*y4 + 1
- * y4' = c[3]*x4 + c[4]*y4 + c[5]) / (c[6]*x4 + c[7]*y4 + 1
- *
- * Multiplying both sides of each eqn by the denominator, we get
- *
- * AC = B
- *
- * where B and C are column vectors
- *
- * B = [ x1' y1' x2' y2' x3' y3' x4' y4' ]
- * C = [ c[0] c[1] c[2] c[3] c[4] c[5] c[6] c[7] ]
- *
- * and A is the 8x8 matrix
- *
- * x1 y1 1 0 0 0 -x1*x1' -y1*x1'
- * 0 0 0 x1 y1 1 -x1*y1' -y1*y1'
- * x2 y2 1 0 0 0 -x2*x2' -y2*x2'
- * 0 0 0 x2 y2 1 -x2*y2' -y2*y2'
- * x3 y3 1 0 0 0 -x3*x3' -y3*x3'
- * 0 0 0 x3 y3 1 -x3*y3' -y3*y3'
- * x4 y4 1 0 0 0 -x4*x4' -y4*x4'
- * 0 0 0 x4 y4 1 -x4*y4' -y4*y4'
- *
- * These eight equations are solved here for the coefficients C.
- *
- * These eight coefficients can then be used to find the mapping
- * x,y) --> (x',y':
- *
- * x' = c[0]x + c[1]y + c[2]) / (c[6]x + c[7]y + 1
- * y' = c[3]x + c[4]y + c[5]) / (c[6]x + c[7]y + 1
- *
- * that is implemented in projectiveXformSampled and
- * projectiveXFormInterpolated.
- */
-l_ok
-getProjectiveXformCoeffs(PTA *ptas,
- PTA *ptad,
- l_float32 **pvc)
-{
-l_int32 i;
-l_float32 x1, y1, x2, y2, x3, y3, x4, y4;
-l_float32 *b; /* rhs vector of primed coords X'; coeffs returned in *pvc */
-l_float32 *a[8]; /* 8x8 matrix A */
-
- PROCNAME("getProjectiveXformCoeffs");
-
- if (!ptas)
- return ERROR_INT("ptas not defined", procName, 1);
- if (!ptad)
- return ERROR_INT("ptad not defined", procName, 1);
- if (!pvc)
- return ERROR_INT("&vc not defined", procName, 1);
-
- b = (l_float32 *)LEPT_CALLOC(8, sizeof(l_float32));
- *pvc = b;
- ptaGetPt(ptas, 0, &x1, &y1);
- ptaGetPt(ptas, 1, &x2, &y2);
- ptaGetPt(ptas, 2, &x3, &y3);
- ptaGetPt(ptas, 3, &x4, &y4);
- ptaGetPt(ptad, 0, &b[0], &b[1]);
- ptaGetPt(ptad, 1, &b[2], &b[3]);
- ptaGetPt(ptad, 2, &b[4], &b[5]);
- ptaGetPt(ptad, 3, &b[6], &b[7]);
-
- for (i = 0; i < 8; i++)
- a[i] = (l_float32 *)LEPT_CALLOC(8, sizeof(l_float32));
- a[0][0] = x1;
- a[0][1] = y1;
- a[0][2] = 1.;
- a[0][6] = -x1 * b[0];
- a[0][7] = -y1 * b[0];
- a[1][3] = x1;
- a[1][4] = y1;
- a[1][5] = 1;
- a[1][6] = -x1 * b[1];
- a[1][7] = -y1 * b[1];
- a[2][0] = x2;
- a[2][1] = y2;
- a[2][2] = 1.;
- a[2][6] = -x2 * b[2];
- a[2][7] = -y2 * b[2];
- a[3][3] = x2;
- a[3][4] = y2;
- a[3][5] = 1;
- a[3][6] = -x2 * b[3];
- a[3][7] = -y2 * b[3];
- a[4][0] = x3;
- a[4][1] = y3;
- a[4][2] = 1.;
- a[4][6] = -x3 * b[4];
- a[4][7] = -y3 * b[4];
- a[5][3] = x3;
- a[5][4] = y3;
- a[5][5] = 1;
- a[5][6] = -x3 * b[5];
- a[5][7] = -y3 * b[5];
- a[6][0] = x4;
- a[6][1] = y4;
- a[6][2] = 1.;
- a[6][6] = -x4 * b[6];
- a[6][7] = -y4 * b[6];
- a[7][3] = x4;
- a[7][4] = y4;
- a[7][5] = 1;
- a[7][6] = -x4 * b[7];
- a[7][7] = -y4 * b[7];
-
- gaussjordan(a, b, 8);
-
- for (i = 0; i < 8; i++)
- LEPT_FREE(a[i]);
-
- return 0;
-}
-
-
-/*!
- * \brief projectiveXformSampledPt()
- *
- * \param[in] vc vector of 8 coefficients
- * \param[in] x, y initial point
- * \param[out] pxp, pyp transformed point
- * \return 0 if OK; 1 on error
- *
- *
- * Notes:
- * (1) This finds the nearest pixel coordinates of the transformed point.
- * (2) It does not check ptrs for returned data!
- *
- */
-l_ok
-projectiveXformSampledPt(l_float32 *vc,
- l_int32 x,
- l_int32 y,
- l_int32 *pxp,
- l_int32 *pyp)
-{
-l_float32 factor;
-
- PROCNAME("projectiveXformSampledPt");
-
- if (!vc)
- return ERROR_INT("vc not defined", procName, 1);
-
- factor = 1. / (vc[6] * x + vc[7] * y + 1.);
- *pxp = (l_int32)(factor * (vc[0] * x + vc[1] * y + vc[2]) + 0.5);
- *pyp = (l_int32)(factor * (vc[3] * x + vc[4] * y + vc[5]) + 0.5);
- return 0;
-}
-
-
-/*!
- * \brief projectiveXformPt()
- *
- * \param[in] vc vector of 8 coefficients
- * \param[in] x, y initial point
- * \param[out] pxp, pyp transformed point
- * \return 0 if OK; 1 on error
- *
- *
- * Notes:
- * (1) This computes the floating point location of the transformed point.
- * (2) It does not check ptrs for returned data!
- *
- */
-l_ok
-projectiveXformPt(l_float32 *vc,
- l_int32 x,
- l_int32 y,
- l_float32 *pxp,
- l_float32 *pyp)
-{
-l_float32 factor;
-
- PROCNAME("projectiveXformPt");
-
- if (!vc)
- return ERROR_INT("vc not defined", procName, 1);
-
- factor = 1. / (vc[6] * x + vc[7] * y + 1.);
- *pxp = factor * (vc[0] * x + vc[1] * y + vc[2]);
- *pyp = factor * (vc[3] * x + vc[4] * y + vc[5]);
- return 0;
-}
diff --git a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/psio1.c b/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/psio1.c
deleted file mode 100644
index bf825a97..00000000
--- a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/psio1.c
+++ /dev/null
@@ -1,1077 +0,0 @@
-/*====================================================================*
- - Copyright (C) 2001 Leptonica. All rights reserved.
- -
- - Redistribution and use in source and binary forms, with or without
- - modification, are permitted provided that the following conditions
- - are met:
- - 1. Redistributions of source code must retain the above copyright
- - notice, this list of conditions and the following disclaimer.
- - 2. Redistributions in binary form must reproduce the above
- - copyright notice, this list of conditions and the following
- - disclaimer in the documentation and/or other materials
- - provided with the distribution.
- -
- - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- - ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- - LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- - A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL ANY
- - CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
- - EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
- - PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
- - PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
- - OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
- - NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- *====================================================================*/
-
-/*!
- * \file psio1.c
- *
- *
- * |=============================================================|
- * | Important note |
- * |=============================================================|
- * | Some of these functions require I/O libraries such as |
- * | libtiff, libjpeg, and libz. If you do not have these |
- * | libraries, some calls will fail. |
- * | |
- * | You can manually deactivate all PostScript writing by |
- * | setting this in environ.h: |
- * | \code |
- * | #define USE_PSIO 0 |
- * | \endcode |
- * | in environ.h. This will link psio1stub.c |
- * |=============================================================|
- *
- * This is a PostScript "device driver" for wrapping images
- * in PostScript. The images can be rendered by a PostScript
- * interpreter for viewing, using evince or gv. They can also be
- * rasterized for printing, using gs or an embedded interpreter
- * in a PostScript printer. And they can be converted to a pdf
- * using gs (ps2pdf).
- *
- * Convert specified files to PS
- * l_int32 convertFilesToPS()
- * l_int32 sarrayConvertFilesToPS()
- * l_int32 convertFilesFittedToPS()
- * l_int32 sarrayConvertFilesFittedToPS()
- * l_int32 writeImageCompressedToPSFile()
- *
- * Convert mixed text/image files to PS
- * l_int32 convertSegmentedPagesToPS()
- * l_int32 pixWriteSegmentedPageToPS()
- * l_int32 pixWriteMixedToPS()
- *
- * Convert any image file to PS for embedding
- * l_int32 convertToPSEmbed()
- *
- * Write all images in a pixa out to PS
- * l_int32 pixaWriteCompressedToPS()
- * l_int32 pixWriteCompressedToPS()
- *
- * These PostScript converters are used in three different ways.
- *
- * (1) For embedding a PS file in a program like TeX.
- * convertToPSEmbed() handles this for levels 1, 2 and 3 output,
- * and prog/converttops wraps this in an executable.
- * converttops is a generalization of Thomas Merz's jpeg2ps wrapper,
- * in that it works for all types (formats, depth, colormap)
- * of input images and gives PS output in one of these formats
- * * level 1 (uncompressed)
- * * level 2 (compressed ccittg4 or dct)
- * * level 3 (compressed flate)
- *
- * (2) For composing a set of pages with any number of images
- * painted on them, in either level 2 or level 3 formats.
- *
- * (3) For printing a page image or a set of page images, at a
- * resolution that optimally fills the page, using
- * convertFilesFittedToPS().
- *
- * The top-level calls of utilities in category 2, which can compose
- * multiple images on a page, and which generate a PostScript file for
- * printing or display (e.g., conversion to pdf), are:
- * convertFilesToPS()
- * convertFilesFittedToPS()
- * convertSegmentedPagesToPS()
- *
- * All images are output with page numbers. Bounding box hints are
- * more subtle. They must be included for embeding images in
- * TeX, for example, and the low-level writers include bounding
- * box hints by default. However, these hints should not be included for
- * multi-page PostScript that is composed of a sequence of images;
- * consequently, they are not written when calling higher level
- * functions such as convertFilesToPS(), convertFilesFittedToPS()
- * and convertSegmentedPagesToPS(). The function l_psWriteBoundingBox()
- * sets a flag to give low-level control over this.
- *
- */
-
-#ifdef HAVE_CONFIG_H
-#include
-#endif /* HAVE_CONFIG_H */
-
-#include
-#include "allheaders.h"
-
-/* --------------------------------------------*/
-#if USE_PSIO /* defined in environ.h */
- /* --------------------------------------------*/
-
-/*-------------------------------------------------------------*
- * Convert files in a directory to PS *
- *-------------------------------------------------------------*/
-/*
- * \brief convertFilesToPS()
- *
- * \param[in] dirin input directory
- * \param[in] substr [optional] substring filter on filenames; can be NULL
- * \param[in] res typ. 300 or 600 ppi
- * \param[in] fileout output ps file
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This generates a PS file for all image files in a specified
- * directory that contain the substr pattern to be matched.
- * (2) Each image is written to a separate page in the output PS file.
- * (3) All images are written compressed:
- * * if tiffg4 --> use ccittg4
- * * if jpeg --> use dct
- * * all others --> use flate
- * If the image is jpeg or tiffg4, we use the existing compressed
- * strings for the encoding; otherwise, we read the image into
- * a pix and flate-encode the pieces.
- * (4) The resolution is often confusing. It is interpreted
- * as the resolution of the output display device: "If the
- * input image were digitized at 300 ppi, what would it
- * look like when displayed at res ppi." So, for example,
- * if res = 100 ppi, then the display pixels are 3x larger
- * than the 300 ppi pixels, and the image will be rendered
- * 3x larger.
- * (5) The size of the PostScript file is independent of the resolution,
- * because the entire file is encoded. The res parameter just
- * tells the PS decomposer how to render the page. Therefore,
- * for minimum file size without loss of visual information,
- * if the output res is less than 300, you should downscale
- * the image to the output resolution before wrapping in PS.
- * (6) The "canvas" on which the image is rendered, at the given
- * output resolution, is a standard page size (8.5 x 11 in).
- *
- */
-l_ok
-convertFilesToPS(const char *dirin,
- const char *substr,
- l_int32 res,
- const char *fileout)
-{
-SARRAY *sa;
-
- PROCNAME("convertFilesToPS");
-
- if (!dirin)
- return ERROR_INT("dirin not defined", procName, 1);
- if (!fileout)
- return ERROR_INT("fileout not defined", procName, 1);
- if (res <= 0) {
- L_INFO("setting res to 300 ppi\n", procName);
- res = 300;
- }
- if (res < 10 || res > 4000)
- L_WARNING("res is typically in the range 300-600 ppi\n", procName);
-
- /* Get all filtered and sorted full pathnames. */
- sa = getSortedPathnamesInDirectory(dirin, substr, 0, 0);
-
- /* Generate the PS file. Don't use bounding boxes. */
- l_psWriteBoundingBox(FALSE);
- sarrayConvertFilesToPS(sa, res, fileout);
- l_psWriteBoundingBox(TRUE);
- sarrayDestroy(&sa);
- return 0;
-}
-
-
-/*
-
- * \brief sarrayConvertFilesToPS()
- *
- * \param[in] sarray of full path names
- * \param[in] res typ. 300 or 600 ppi
- * \param[in] fileout output ps file
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) See convertFilesToPS()
- *
- */
-l_ok
-sarrayConvertFilesToPS(SARRAY *sa,
- l_int32 res,
- const char *fileout)
-{
-char *fname;
-l_int32 i, nfiles, index, ret, format;
-
- PROCNAME("sarrayConvertFilesToPS");
-
- if (!sa)
- return ERROR_INT("sa not defined", procName, 1);
- if (!fileout)
- return ERROR_INT("fileout not defined", procName, 1);
- if (res <= 0) {
- L_INFO("setting res to 300 ppi\n", procName);
- res = 300;
- }
- if (res < 10 || res > 4000)
- L_WARNING("res is typically in the range 300-600 ppi\n", procName);
-
- nfiles = sarrayGetCount(sa);
- for (i = 0, index = 0; i < nfiles; i++) {
- fname = sarrayGetString(sa, i, L_NOCOPY);
- ret = pixReadHeader(fname, &format, NULL, NULL, NULL, NULL, NULL);
- if (ret) continue;
- if (format == IFF_UNKNOWN)
- continue;
-
- writeImageCompressedToPSFile(fname, fileout, res, &index);
- }
-
- return 0;
-}
-
-
-/*
- * \brief convertFilesFittedToPS()
- *
- * \param[in] dirin input directory
- * \param[in] substr [optional] substring filter on filenames; can be NULL)
- * \param[in] xpts desired size in printer points; use 0 for default
- * \param[in] ypts desired size in printer points; use 0 for default
- * \param[in] fileout output ps file
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This generates a PS file for all files in a specified directory
- * that contain the substr pattern to be matched.
- * (2) Each image is written to a separate page in the output PS file.
- * (3) All images are written compressed:
- * * if tiffg4 --> use ccittg4
- * * if jpeg --> use dct
- * * all others --> use flate
- * If the image is jpeg or tiffg4, we use the existing compressed
- * strings for the encoding; otherwise, we read the image into
- * a pix and flate-encode the pieces.
- * (4) The resolution is internally determined such that the images
- * are rendered, in at least one direction, at 100% of the given
- * size in printer points. Use 0.0 for xpts or ypts to get
- * the default value, which is 612.0 or 792.0, rsp.
- * (5) The size of the PostScript file is independent of the resolution,
- * because the entire file is encoded. The %xpts and %ypts
- * parameter tells the PS decomposer how to render the page.
- *
- */
-l_ok
-convertFilesFittedToPS(const char *dirin,
- const char *substr,
- l_float32 xpts,
- l_float32 ypts,
- const char *fileout)
-{
-SARRAY *sa;
-
- PROCNAME("convertFilesFittedToPS");
-
- if (!dirin)
- return ERROR_INT("dirin not defined", procName, 1);
- if (!fileout)
- return ERROR_INT("fileout not defined", procName, 1);
- if (xpts <= 0.0) {
- L_INFO("setting xpts to 612.0 ppi\n", procName);
- xpts = 612.0;
- }
- if (ypts <= 0.0) {
- L_INFO("setting ypts to 792.0 ppi\n", procName);
- ypts = 792.0;
- }
- if (xpts < 100.0 || xpts > 2000.0 || ypts < 100.0 || ypts > 2000.0)
- L_WARNING("xpts,ypts are typically in the range 500-800\n", procName);
-
- /* Get all filtered and sorted full pathnames. */
- sa = getSortedPathnamesInDirectory(dirin, substr, 0, 0);
-
- /* Generate the PS file. Don't use bounding boxes. */
- l_psWriteBoundingBox(FALSE);
- sarrayConvertFilesFittedToPS(sa, xpts, ypts, fileout);
- l_psWriteBoundingBox(TRUE);
- sarrayDestroy(&sa);
- return 0;
-}
-
-
-/*
- * \brief sarrayConvertFilesFittedToPS()
- *
- * \param[in] sarray of full path names
- * \param[in] xpts desired size in printer points; use 0 for default
- * \param[in] ypts desired size in printer points; use 0 for default
- * \param[in] fileout output ps file
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) See convertFilesFittedToPS()
- *
- */
-l_ok
-sarrayConvertFilesFittedToPS(SARRAY *sa,
- l_float32 xpts,
- l_float32 ypts,
- const char *fileout)
-{
-char *fname;
-l_int32 ret, i, w, h, nfiles, index, format, res;
-
- PROCNAME("sarrayConvertFilesFittedToPS");
-
- if (!sa)
- return ERROR_INT("sa not defined", procName, 1);
- if (!fileout)
- return ERROR_INT("fileout not defined", procName, 1);
- if (xpts <= 0.0) {
- L_INFO("setting xpts to 612.0\n", procName);
- xpts = 612.0;
- }
- if (ypts <= 0.0) {
- L_INFO("setting ypts to 792.0\n", procName);
- ypts = 792.0;
- }
- if (xpts < 100.0 || xpts > 2000.0 || ypts < 100.0 || ypts > 2000.0)
- L_WARNING("xpts,ypts are typically in the range 500-800\n", procName);
-
- nfiles = sarrayGetCount(sa);
- for (i = 0, index = 0; i < nfiles; i++) {
- fname = sarrayGetString(sa, i, L_NOCOPY);
- ret = pixReadHeader(fname, &format, &w, &h, NULL, NULL, NULL);
- if (ret) continue;
- if (format == IFF_UNKNOWN)
- continue;
-
- /* Be sure the entire image is wrapped */
- if (xpts * h < ypts * w)
- res = (l_int32)((l_float32)w * 72.0 / xpts);
- else
- res = (l_int32)((l_float32)h * 72.0 / ypts);
-
- writeImageCompressedToPSFile(fname, fileout, res, &index);
- }
-
- return 0;
-}
-
-
-/*
- * \brief writeImageCompressedToPSFile()
- *
- * \param[in] filein input image file
- * \param[in] fileout output ps file
- * \param[in] res output printer resolution
- * \param[in,out] pindex index of image in output ps file
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This wraps a single page image in PS.
- * (2) The input file can be in any format. It is compressed as follows:
- * * if in tiffg4 --> use ccittg4
- * * if in jpeg --> use dct
- * * all others --> use flate
- * (3) Before the first call, set %index = 0. %index is incremented
- * if the page is successfully written. It is used to decide
- * whether to write (index == 0) or append (index > 0) to the file.
- *
- */
-l_ok
-writeImageCompressedToPSFile(const char *filein,
- const char *fileout,
- l_int32 res,
- l_int32 *pindex)
-{
-const char *op;
-l_int32 format, retval;
-
- PROCNAME("writeImageCompressedToPSFile");
-
- if (!pindex)
- return ERROR_INT("&index not defined", procName, 1);
-
- findFileFormat(filein, &format);
- if (format == IFF_UNKNOWN) {
- L_ERROR("format of %s not known\n", procName, filein);
- return 1;
- }
-
- op = (*pindex == 0) ? "w" : "a";
- if (format == IFF_JFIF_JPEG) {
- retval = convertJpegToPS(filein, fileout, op, 0, 0,
- res, 1.0, *pindex + 1, TRUE);
- } else if (format == IFF_TIFF_G4) {
- retval = convertG4ToPS(filein, fileout, op, 0, 0,
- res, 1.0, *pindex + 1, FALSE, TRUE);
- } else { /* all other image formats */
- retval = convertFlateToPS(filein, fileout, op, 0, 0,
- res, 1.0, *pindex + 1, TRUE);
- }
- if (retval == 0) (*pindex)++;
-
- return retval;
-}
-
-
-/*-------------------------------------------------------------*
- * Convert mixed text/image files to PS *
- *-------------------------------------------------------------*/
-/*
- * \brief convertSegmentedPagesToPS()
- *
- * \param[in] pagedir input page image directory
- * \param[in] pagestr [optional] substring filter on page filenames;
- * can be NULL
- * \param[in] page_numpre number of characters in page name before number
- * \param[in] maskdir input mask image directory
- * \param[in] maskstr [optional] substring filter on mask filenames;
- * can be NULL
- * \param[in] mask_numpre number of characters in mask name before number
- * \param[in] numpost number of characters in names after number
- * \param[in] maxnum only consider page numbers up to this value
- * \param[in] textscale scale of text output relative to pixs
- * \param[in] imagescale scale of image output relative to pixs
- * \param[in] threshold for binarization; typ. about 190; 0 for default
- * \param[in] fileout output ps file
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This generates a PS file for all page image and mask files in two
- * specified directories and that contain the page numbers as
- * specified below. The two directories can be the same, in which
- * case the page and mask files are differentiated by the two
- * substrings for string matches.
- * (2) The page images are taken in lexicographic order.
- * Mask images whose numbers match the page images are used to
- * segment the page images. Page images without a matching
- * mask image are scaled, thresholded and rendered entirely as text.
- * (3) Each PS page is generated as a compressed representation of
- * the page image, where the part of the image under the mask
- * is suitably scaled and compressed as DCT (i.e., jpeg), and
- * the remaining part of the page is suitably scaled, thresholded,
- * compressed as G4 (i.e., tiff g4), and rendered by painting
- * black through the resulting text mask.
- * (4) The scaling is typically 2x down for the DCT component
- * (%imagescale = 0.5) and 2x up for the G4 component
- * (%textscale = 2.0).
- * (5) The resolution is automatically set to fit to a
- * letter-size (8.5 x 11 inch) page.
- * (6) Both the DCT and the G4 encoding are PostScript level 2.
- * (7) It is assumed that the page number is contained within
- * the basename (the filename without directory or extension).
- * %page_numpre is the number of characters in the page basename
- * preceding the actual page number; %mask_numpre is likewise for
- * the mask basename; %numpost is the number of characters
- * following the page number. For example, for mask name
- * mask_006.tif, mask_numpre = 5 ("mask_).
- * (8) To render a page as is -- that is, with no thresholding
- * of any pixels -- use a mask in the mask directory that is
- * full size with all pixels set to 1. If the page is 1 bpp,
- * it is not necessary to have a mask.
- *
- */
-l_ok
-convertSegmentedPagesToPS(const char *pagedir,
- const char *pagestr,
- l_int32 page_numpre,
- const char *maskdir,
- const char *maskstr,
- l_int32 mask_numpre,
- l_int32 numpost,
- l_int32 maxnum,
- l_float32 textscale,
- l_float32 imagescale,
- l_int32 threshold,
- const char *fileout)
-{
-l_int32 pageno, i, npages;
-PIX *pixs, *pixm;
-SARRAY *sapage, *samask;
-
- PROCNAME("convertSegmentedPagesToPS");
-
- if (!pagedir)
- return ERROR_INT("pagedir not defined", procName, 1);
- if (!maskdir)
- return ERROR_INT("maskdir not defined", procName, 1);
- if (!fileout)
- return ERROR_INT("fileout not defined", procName, 1);
- if (threshold <= 0) {
- L_INFO("setting threshold to 190\n", procName);
- threshold = 190;
- }
-
- /* Get numbered full pathnames; max size of sarray is maxnum */
- sapage = getNumberedPathnamesInDirectory(pagedir, pagestr,
- page_numpre, numpost, maxnum);
- samask = getNumberedPathnamesInDirectory(maskdir, maskstr,
- mask_numpre, numpost, maxnum);
- sarrayPadToSameSize(sapage, samask, "");
- if ((npages = sarrayGetCount(sapage)) == 0) {
- sarrayDestroy(&sapage);
- sarrayDestroy(&samask);
- return ERROR_INT("no matching pages found", procName, 1);
- }
-
- /* Generate the PS file */
- pageno = 1;
- for (i = 0; i < npages; i++) {
- if ((pixs = pixReadIndexed(sapage, i)) == NULL)
- continue;
- pixm = pixReadIndexed(samask, i);
- pixWriteSegmentedPageToPS(pixs, pixm, textscale, imagescale,
- threshold, pageno, fileout);
- pixDestroy(&pixs);
- pixDestroy(&pixm);
- pageno++;
- }
-
- sarrayDestroy(&sapage);
- sarrayDestroy(&samask);
- return 0;
-}
-
-
-/*
- * \brief pixWriteSegmentedPageToPS()
- *
- * \param[in] pixs all depths; colormap ok
- * \param[in] pixm [optional] 1 bpp segmentation mask over image region
- * \param[in] textscale scale of text output relative to pixs
- * \param[in] imagescale scale of image output relative to pixs
- * \param[in] threshold for binarization; typ. about 190; 0 for default
- * \param[in] pageno page number in set; use 1 for new output file
- * \param[in] fileout output ps file
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This generates the PS string for a mixed text/image page,
- * and adds it to an existing file if %pageno > 1.
- * The PS output is determined by fitting the result to
- * a letter-size (8.5 x 11 inch) page.
- * (2) The two images (pixs and pixm) are at the same resolution
- * (typically 300 ppi). They are used to generate two compressed
- * images, pixb and pixc, that are put directly into the output
- * PS file.
- * (3) pixb is the text component. In the PostScript world, we think of
- * it as a mask through which we paint black. It is produced by
- * scaling pixs by %textscale, and thresholding to 1 bpp.
- * (4) pixc is the image component, which is that part of pixs under
- * the mask pixm. It is scaled from pixs by %imagescale.
- * (5) Typical values are textscale = 2.0 and imagescale = 0.5.
- * (6) If pixm == NULL, the page has only text. If it is all black,
- * the page is all image and has no text.
- * (7) This can be used to write a multi-page PS file, by using
- * sequential page numbers with the same output file. It can
- * also be used to write separate PS files for each page,
- * by using different output files with %pageno = 0 or 1.
- *
- */
-l_ok
-pixWriteSegmentedPageToPS(PIX *pixs,
- PIX *pixm,
- l_float32 textscale,
- l_float32 imagescale,
- l_int32 threshold,
- l_int32 pageno,
- const char *fileout)
-{
-l_int32 alltext, notext, d, ret;
-l_uint32 val;
-l_float32 scaleratio;
-PIX *pixmi, *pixmis, *pixt, *pixg, *pixsc, *pixb, *pixc;
-
- PROCNAME("pixWriteSegmentedPageToPS");
-
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
- if (!fileout)
- return ERROR_INT("fileout not defined", procName, 1);
- if (imagescale <= 0.0 || textscale <= 0.0)
- return ERROR_INT("relative scales must be > 0.0", procName, 1);
-
- /* Analyze the page. Determine the ratio by which the
- * binary text mask is scaled relative to the image part.
- * If there is no image region (alltext == TRUE), the
- * text mask will be rendered directly to fit the page,
- * and scaleratio = 1.0. */
- alltext = TRUE;
- notext = FALSE;
- scaleratio = 1.0;
- if (pixm) {
- pixZero(pixm, &alltext); /* pixm empty: all text */
- if (alltext) {
- pixm = NULL; /* treat it as not existing here */
- } else {
- pixmi = pixInvert(NULL, pixm);
- pixZero(pixmi, ¬ext); /* pixm full; no text */
- pixDestroy(&pixmi);
- scaleratio = textscale / imagescale;
- }
- }
-
- if (pixGetDepth(pixs) == 1) { /* render tiff g4 */
- pixb = pixClone(pixs);
- pixc = NULL;
- } else {
- pixt = pixConvertTo8Or32(pixs, L_CLONE, 0); /* clone if possible */
-
- /* Get the binary text mask. Note that pixg cannot be a
- * clone of pixs, because it may be altered by pixSetMasked(). */
- pixb = NULL;
- if (notext == FALSE) {
- d = pixGetDepth(pixt);
- if (d == 8)
- pixg = pixCopy(NULL, pixt);
- else /* d == 32 */
- pixg = pixConvertRGBToLuminance(pixt);
- if (pixm) /* clear out the image parts */
- pixSetMasked(pixg, pixm, 255);
- if (textscale == 1.0)
- pixsc = pixClone(pixg);
- else if (textscale >= 0.7)
- pixsc = pixScaleGrayLI(pixg, textscale, textscale);
- else
- pixsc = pixScaleAreaMap(pixg, textscale, textscale);
- pixb = pixThresholdToBinary(pixsc, threshold);
- pixDestroy(&pixg);
- pixDestroy(&pixsc);
- }
-
- /* Get the scaled image region */
- pixc = NULL;
- if (pixm) {
- if (imagescale == 1.0)
- pixsc = pixClone(pixt); /* can possibly be a clone of pixs */
- else
- pixsc = pixScale(pixt, imagescale, imagescale);
-
- /* If pixm is not full, clear the pixels in pixsc
- * corresponding to bg in pixm, where there can be text
- * that is written through the mask pixb. Note that
- * we could skip this and use pixsc directly in
- * pixWriteMixedToPS(); however, clearing these
- * non-image regions to a white background will reduce
- * the size of pixc (relative to pixsc), and hence
- * reduce the size of the PS file that is generated.
- * Use a copy so that we don't accidentally alter pixs. */
- if (notext == FALSE) {
- pixmis = pixScale(pixm, imagescale, imagescale);
- pixmi = pixInvert(NULL, pixmis);
- val = (d == 8) ? 0xff : 0xffffff00;
- pixc = pixCopy(NULL, pixsc);
- pixSetMasked(pixc, pixmi, val); /* clear non-image part */
- pixDestroy(&pixmis);
- pixDestroy(&pixmi);
- } else {
- pixc = pixClone(pixsc);
- }
- pixDestroy(&pixsc);
- }
- pixDestroy(&pixt);
- }
-
- /* Generate the PS file. Don't use bounding boxes. */
- l_psWriteBoundingBox(FALSE);
- ret = pixWriteMixedToPS(pixb, pixc, scaleratio, pageno, fileout);
- l_psWriteBoundingBox(TRUE);
- pixDestroy(&pixb);
- pixDestroy(&pixc);
- return ret;
-}
-
-
-/*
- * \brief pixWriteMixedToPS()
- *
- * \param[in] pixb [optional] 1 bpp mask; typically for text
- * \param[in] pixc [optional] 8 or 32 bpp image regions
- * \param[in] scale scale factor for rendering pixb, relative to pixc;
- * typ. 4.0
- * \param[in] pageno page number in set; use 1 for new output file
- * \param[in] fileout output ps file
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This low level function generates the PS string for a mixed
- * text/image page, and adds it to an existing file if
- * %pageno > 1.
- * (2) The two images (pixb and pixc) are typically generated at the
- * resolution that they will be rendered in the PS file.
- * (3) pixb is the text component. In the PostScript world, we think of
- * it as a mask through which we paint black.
- * (4) pixc is the (typically halftone) image component. It is
- * white in the rest of the page. To minimize the size of the
- * PS file, it should be rendered at a resolution that is at
- * least equal to its actual resolution.
- * (5) %scale gives the ratio of resolution of pixb to pixc.
- * Typical resolutions are: 600 ppi for pixb, 150 ppi for pixc;
- * so %scale = 4.0. If one of the images is not defined,
- * the value of %scale is ignored.
- * (6) We write pixc with DCT compression (jpeg). This is followed
- * by painting the text as black through the mask pixb. If
- * pixc doesn't exist (alltext), we write the text with the
- * PS "image" operator instead of the "imagemask" operator,
- * because ghostscript's ps2pdf is flaky when the latter is used.
- * (7) The actual output resolution is determined by fitting the
- * result to a letter-size (8.5 x 11 inch) page.
- *
- */
-l_ok
-pixWriteMixedToPS(PIX *pixb,
- PIX *pixc,
- l_float32 scale,
- l_int32 pageno,
- const char *fileout)
-{
-char *tname;
-const char *op;
-l_int32 resb, resc, endpage, maskop, ret;
-
- PROCNAME("pixWriteMixedToPS");
-
- if (!pixb && !pixc)
- return ERROR_INT("pixb and pixc both undefined", procName, 1);
- if (!fileout)
- return ERROR_INT("fileout not defined", procName, 1);
-
- /* Compute the resolution that fills a letter-size page. */
- if (!pixc) {
- resb = getResLetterPage(pixGetWidth(pixb), pixGetHeight(pixb), 0);
- } else {
- resc = getResLetterPage(pixGetWidth(pixc), pixGetHeight(pixc), 0);
- if (pixb)
- resb = (l_int32)(scale * resc);
- }
-
- /* Write the jpeg image first */
- if (pixc) {
- tname = l_makeTempFilename();
- pixWrite(tname, pixc, IFF_JFIF_JPEG);
- endpage = (pixb) ? FALSE : TRUE;
- op = (pageno <= 1) ? "w" : "a";
- ret = convertJpegToPS(tname, fileout, op, 0, 0, resc, 1.0,
- pageno, endpage);
- lept_rmfile(tname);
- LEPT_FREE(tname);
- if (ret)
- return ERROR_INT("jpeg data not written", procName, 1);
- }
-
- /* Write the binary data, either directly or, if there is
- * a jpeg image on the page, through the mask. */
- if (pixb) {
- tname = l_makeTempFilename();
- pixWrite(tname, pixb, IFF_TIFF_G4);
- op = (pageno <= 1 && !pixc) ? "w" : "a";
- maskop = (pixc) ? 1 : 0;
- ret = convertG4ToPS(tname, fileout, op, 0, 0, resb, 1.0,
- pageno, maskop, 1);
- lept_rmfile(tname);
- LEPT_FREE(tname);
- if (ret)
- return ERROR_INT("tiff data not written", procName, 1);
- }
-
- return 0;
-}
-
-
-/*-------------------------------------------------------------*
- * Convert any image file to PS for embedding *
- *-------------------------------------------------------------*/
-/*
- * \brief convertToPSEmbed()
- *
- * \param[in] filein input image file, any format
- * \param[in] fileout output ps file
- * \param[in] level PostScript compression: 1 (uncompressed), 2 or 3
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This is a wrapper function that generates a PS file with
- * a bounding box, from any input image file.
- * (2) Do the best job of compression given the specified level.
- * %level=3 does flate compression on anything that is not
- * tiffg4 (1 bpp) or jpeg (8 bpp or rgb).
- * (3) If %level=2 and the file is not tiffg4 or jpeg, it will
- * first be written to file as jpeg with quality = 75.
- * This will remove the colormap and cause some degradation
- * in the image.
- * (4) The bounding box is required when a program such as TeX
- * (through epsf) places and rescales the image. It is
- * sized for fitting the image to an 8.5 x 11.0 inch page.
- *
- */
-l_ok
-convertToPSEmbed(const char *filein,
- const char *fileout,
- l_int32 level)
-{
-char *tname;
-l_int32 d, format;
-PIX *pix, *pixs;
-
- PROCNAME("convertToPSEmbed");
-
- if (!filein)
- return ERROR_INT("filein not defined", procName, 1);
- if (!fileout)
- return ERROR_INT("fileout not defined", procName, 1);
- if (level != 1 && level != 2 && level != 3) {
- L_ERROR("invalid level specified; using level 2\n", procName);
- level = 2;
- }
-
- if (level == 1) { /* no compression */
- pixWritePSEmbed(filein, fileout);
- return 0;
- }
-
- /* Find the format and write out directly if in jpeg or tiff g4 */
- findFileFormat(filein, &format);
- if (format == IFF_JFIF_JPEG) {
- convertJpegToPSEmbed(filein, fileout);
- return 0;
- } else if (format == IFF_TIFF_G4) {
- convertG4ToPSEmbed(filein, fileout);
- return 0;
- } else if (format == IFF_UNKNOWN) {
- L_ERROR("format of %s not known\n", procName, filein);
- return 1;
- }
-
- /* If level 3, flate encode. */
- if (level == 3) {
- convertFlateToPSEmbed(filein, fileout);
- return 0;
- }
-
- /* OK, it's level 2, so we must convert to jpeg or tiff g4 */
- if ((pixs = pixRead(filein)) == NULL)
- return ERROR_INT("image not read from file", procName, 1);
- d = pixGetDepth(pixs);
- if ((d == 2 || d == 4) && !pixGetColormap(pixs))
- pix = pixConvertTo8(pixs, 0);
- else if (d == 16)
- pix = pixConvert16To8(pixs, L_MS_BYTE);
- else
- pix = pixRemoveColormap(pixs, REMOVE_CMAP_BASED_ON_SRC);
- pixDestroy(&pixs);
- if (!pix)
- return ERROR_INT("converted pix not made", procName, 1);
-
- d = pixGetDepth(pix);
- tname = l_makeTempFilename();
- if (d == 1) {
- if (pixWrite(tname, pix, IFF_TIFF_G4)) {
- LEPT_FREE(tname);
- pixDestroy(&pix);
- return ERROR_INT("g4 tiff not written", procName, 1);
- }
- convertG4ToPSEmbed(tname, fileout);
- } else {
- if (pixWrite(tname, pix, IFF_JFIF_JPEG)) {
- LEPT_FREE(tname);
- pixDestroy(&pix);
- return ERROR_INT("jpeg not written", procName, 1);
- }
- convertJpegToPSEmbed(tname, fileout);
- }
-
- lept_rmfile(tname);
- LEPT_FREE(tname);
- pixDestroy(&pix);
- return 0;
-}
-
-
-/*-------------------------------------------------------------*
- * Write all images in a pixa out to PS *
- *-------------------------------------------------------------*/
-/*
- * \brief pixaWriteCompressedToPS()
- *
- * \param[in] pixa any set of images
- * \param[in] fileout output ps file
- * \param[in] res resolution for the set of input images
- * \param[in] level PostScript compression capability: 2 or 3
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This generates a PostScript file of multiple page images,
- * all with bounding boxes.
- * (2) See pixWriteCompressedToPS() for details.
- * (3) To generate a pdf from %fileout, use:
- * ps2pdf
- *
- */
-l_ok
-pixaWriteCompressedToPS(PIXA *pixa,
- const char *fileout,
- l_int32 res,
- l_int32 level)
-{
-l_int32 i, n, index, ret;
-PIX *pix;
-
- PROCNAME("pixaWriteCompressedToPS");
-
- if (!pixa)
- return ERROR_INT("pixa not defined", procName, 1);
- if (!fileout)
- return ERROR_INT("fileout not defined", procName, 1);
- if (level != 2 && level != 3) {
- L_ERROR("only levels 2 and 3 permitted; using level 2\n", procName);
- level = 2;
- }
-
- index = 0;
- n = pixaGetCount(pixa);
- for (i = 0; i < n; i++) {
- pix = pixaGetPix(pixa, i, L_CLONE);
- ret = pixWriteCompressedToPS(pix, fileout, res, level, &index);
- if (ret) L_ERROR("PS string not written for image %d\n", procName, i);
- pixDestroy(&pix);
- }
- return 0;
-}
-
-
-/*
- * \brief pixWriteCompressedToPS()
- *
- * \param[in] pix any depth; colormap OK
- * \param[in] fileout output ps file
- * \param[in] res of input image
- * \param[in] level PostScript compression capability: 2 or 3
- * \param[in,out] pindex index of image in output ps file
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This generates a PostScript string for %pix, and writes it
- * to a file, with a bounding box.
- * (2) *pindex keeps track of the number of images that have been
- * written to %fileout. If this is the first image to be
- * converted, set *pindex == 0 before passing it in. If the
- * PostScript string is successfully generated, this will increment
- * *pindex. If *pindex > 0, the PostScript string will be
- * appended to %fileout.
- * (3) PostScript level 2 enables lossless tiffg4 and lossy jpeg
- * compression. Level 3 adds lossless flate (essentially gzip)
- * compression.
- * * For images with a colormap, lossless flate is often better in
- * both quality and size than jpeg.
- * * The decision for images without a colormap affects compression
- * efficiency: %level2 (jpeg) is usually better than %level3 (flate)
- * * Because jpeg does not handle 16 bpp, if %level == 2, the image
- * is converted to 8 bpp (using MSB) and compressed with jpeg,
- * cmap + level2: jpeg
- * cmap + level3: flate
- * 1 bpp: tiffg4
- * 2 or 4 bpp + level2: jpeg
- * 2 or 4 bpp + level3: flate
- * 8 bpp + level2: jpeg
- * 8 bpp + level3: flate
- * 16 bpp + level2: jpeg [converted to 8 bpp, with warning]
- * 16 bpp + level3: flate
- * 32 bpp + level2: jpeg
- * 32 bpp + level3: flate
- *
- */
-l_ok
-pixWriteCompressedToPS(PIX *pix,
- const char *fileout,
- l_int32 res,
- l_int32 level,
- l_int32 *pindex)
-{
-char *tname;
-l_int32 writeout, d;
-PIX *pixt;
-PIXCMAP *cmap;
-
- PROCNAME("pixWriteCompressedToPS");
-
- if (!pix)
- return ERROR_INT("pix not defined", procName, 1);
- if (!fileout)
- return ERROR_INT("fileout not defined", procName, 1);
- if (level != 2 && level != 3) {
- L_ERROR("only levels 2 and 3 permitted; using level 2\n", procName);
- level = 2;
- }
- if (!pindex)
- return ERROR_INT("&index not defined", procName, 1);
-
- tname = l_makeTempFilename();
- writeout = TRUE;
- d = pixGetDepth(pix);
- cmap = pixGetColormap(pix);
- if (d == 1) {
- if (pixWrite(tname, pix, IFF_TIFF_G4))
- writeout = FALSE;
- } else if (level == 3) {
- if (pixWrite(tname, pix, IFF_PNG))
- writeout = FALSE;
- } else { /* level == 2 */
- if (cmap) {
- pixt = pixConvertForPSWrap(pix);
- if (pixWrite(tname, pixt, IFF_JFIF_JPEG))
- writeout = FALSE;
- pixDestroy(&pixt);
- } else if (d == 16) {
- L_WARNING("d = 16; converting to 8 bpp for jpeg\n", procName);
- pixt = pixConvert16To8(pix, L_MS_BYTE);
- if (pixWrite(tname, pixt, IFF_JFIF_JPEG))
- writeout = FALSE;
- pixDestroy(&pixt);
- } else if (d == 2 || d == 4) {
- pixt = pixConvertTo8(pix, 0);
- if (pixWrite(tname, pixt, IFF_JFIF_JPEG))
- writeout = FALSE;
- pixDestroy(&pixt);
- } else if (d == 8 || d == 32) {
- if (pixWrite(tname, pix, IFF_JFIF_JPEG))
- writeout = FALSE;
- } else { /* shouldn't happen */
- L_ERROR("invalid depth with level 2: %d\n", procName, d);
- writeout = FALSE;
- }
- }
-
- if (writeout)
- writeImageCompressedToPSFile(tname, fileout, res, pindex);
-
- if (lept_rmfile(tname) != 0)
- L_ERROR("temp file %s was not deleted\n", procName, tname);
- LEPT_FREE(tname);
- return (writeout) ? 0 : 1;
-}
-
-/* --------------------------------------------*/
-#endif /* USE_PSIO */
-/* --------------------------------------------*/
diff --git a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/psio1stub.c b/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/psio1stub.c
deleted file mode 100644
index f36b5e0d..00000000
--- a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/psio1stub.c
+++ /dev/null
@@ -1,137 +0,0 @@
-/*====================================================================*
- - Copyright (C) 2001 Leptonica. All rights reserved.
- -
- - Redistribution and use in source and binary forms, with or without
- - modification, are permitted provided that the following conditions
- - are met:
- - 1. Redistributions of source code must retain the above copyright
- - notice, this list of conditions and the following disclaimer.
- - 2. Redistributions in binary form must reproduce the above
- - copyright notice, this list of conditions and the following
- - disclaimer in the documentation and/or other materials
- - provided with the distribution.
- -
- - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- - ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- - LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- - A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL ANY
- - CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
- - EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
- - PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
- - PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
- - OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
- - NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- *====================================================================*/
-
-/*!
- * \file psio1stub.c
- *
- *
- * Stubs for psio1.c functions
- *
- */
-
-#ifdef HAVE_CONFIG_H
-#include
-#endif /* HAVE_CONFIG_H */
-
-#include "allheaders.h"
-
-/* --------------------------------------------*/
-#if !USE_PSIO /* defined in environ.h */
-/* --------------------------------------------*/
-
-l_ok convertFilesToPS(const char *dirin, const char *substr,
- l_int32 res, const char *fileout)
-{
- return ERROR_INT("function not present", "convertFilesToPS", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok sarrayConvertFilesToPS(SARRAY *sa, l_int32 res, const char *fileout)
-{
- return ERROR_INT("function not present", "sarrayConvertFilesToPS", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok convertFilesFittedToPS(const char *dirin, const char *substr,
- l_float32 xpts, l_float32 ypts,
- const char *fileout)
-{
- return ERROR_INT("function not present", "convertFilesFittedToPS", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok sarrayConvertFilesFittedToPS(SARRAY *sa, l_float32 xpts,
- l_float32 ypts, const char *fileout)
-{
- return ERROR_INT("function not present", "sarrayConvertFilesFittedToPS", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok writeImageCompressedToPSFile(const char *filein, const char *fileout,
- l_int32 res, l_int32 *pindex)
-{
- return ERROR_INT("function not present", "writeImageCompressedToPSFile", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok convertSegmentedPagesToPS(const char *pagedir, const char *pagestr,
- l_int32 page_numpre, const char *maskdir,
- const char *maskstr, l_int32 mask_numpre,
- l_int32 numpost, l_int32 maxnum,
- l_float32 textscale, l_float32 imagescale,
- l_int32 threshold, const char *fileout)
-{
- return ERROR_INT("function not present", "convertSegmentedPagesToPS", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok pixWriteSegmentedPageToPS(PIX *pixs, PIX *pixm, l_float32 textscale,
- l_float32 imagescale, l_int32 threshold,
- l_int32 pageno, const char *fileout)
-{
- return ERROR_INT("function not present", "pixWriteSegmentedPagesToPS", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok pixWriteMixedToPS(PIX *pixb, PIX *pixc, l_float32 scale,
- l_int32 pageno, const char *fileout)
-{
- return ERROR_INT("function not present", "pixWriteMixedToPS", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok convertToPSEmbed(const char *filein, const char *fileout, l_int32 level)
-{
- return ERROR_INT("function not present", "convertToPSEmbed", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok pixaWriteCompressedToPS(PIXA *pixa, const char *fileout,
- l_int32 res, l_int32 level)
-{
- return ERROR_INT("function not present", "pixaWriteCompressedtoPS", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok pixWriteCompressedToPS(PIX *pix, const char *fileout, l_int32 res,
- l_int32 level, l_int32 *pindex)
-{
- return ERROR_INT("function not present", "pixWriteCompressedtoPS", 1);
-}
-
-/* --------------------------------------------*/
-#endif /* !USE_PSIO */
-/* --------------------------------------------*/
diff --git a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/psio2.c b/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/psio2.c
deleted file mode 100644
index ea7cede1..00000000
--- a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/psio2.c
+++ /dev/null
@@ -1,2044 +0,0 @@
-/*====================================================================*
- - Copyright (C) 2001 Leptonica. All rights reserved.
- -
- - Redistribution and use in source and binary forms, with or without
- - modification, are permitted provided that the following conditions
- - are met:
- - 1. Redistributions of source code must retain the above copyright
- - notice, this list of conditions and the following disclaimer.
- - 2. Redistributions in binary form must reproduce the above
- - copyright notice, this list of conditions and the following
- - disclaimer in the documentation and/or other materials
- - provided with the distribution.
- -
- - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- - ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- - LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- - A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL ANY
- - CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
- - EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
- - PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
- - PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
- - OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
- - NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- *====================================================================*/
-
-/*!
- * \file psio2.c
- *
- *
- * |=============================================================|
- * | Important note |
- * |=============================================================|
- * | Some of these functions require I/O libraries such as |
- * | libtiff, libjpeg, and libz. If you do not have these |
- * | libraries, some calls will fail. |
- * | |
- * | You can manually deactivate all PostScript writing by |
- * | setting this in environ.h: |
- * | \code |
- * | #define USE_PSIO 0 |
- * | \endcode |
- * | in environ.h. This will link psio2stub.c |
- * |=============================================================|
- *
- * These are lower-level functions that implement a PostScript
- * "device driver" for wrapping images in PostScript. The images
- * can be rendered by a PostScript interpreter for viewing,
- * using evince or gv. They can also be rasterized for printing,
- * using gs or an embedded interpreter in a PostScript printer.
- * And they can be converted to a pdf using gs (ps2pdf).
- *
- * For uncompressed images
- * l_int32 pixWritePSEmbed()
- * l_int32 pixWriteStreamPS()
- * char *pixWriteStringPS()
- * char *generateUncompressedPS()
- * static void getScaledParametersPS()
- * static l_int32 convertByteToHexAscii()
- *
- * For jpeg compressed images (use dct compression)
- * l_int32 convertJpegToPSEmbed()
- * l_int32 convertJpegToPS()
- * static l_int32 convertJpegToPSString()
- * static char *generateJpegPS()
- *
- * For g4 fax compressed images (use ccitt g4 compression)
- * l_int32 convertG4ToPSEmbed()
- * l_int32 convertG4ToPS()
- * static l_int32 convertG4ToPSString()
- * static char *generateG4PS()
- *
- * For multipage tiff images
- * l_int32 convertTiffMultipageToPS()
- *
- * For flate (gzip) compressed images (e.g., png)
- * l_int32 convertFlateToPSEmbed()
- * l_int32 convertFlateToPS()
- * static l_int32 convertFlateToPSString()
- * static char *generateFlatePS()
- *
- * Write to memory
- * l_int32 pixWriteMemPS()
- *
- * Converting resolution
- * l_int32 getResLetterPage()
- * static l_int32 getResA4Page()
- *
- * Setting flag for writing bounding box hint
- * void l_psWriteBoundingBox()
- *
- * See psio1.c for higher-level functions and their usage.
- *
- */
-
-#ifdef HAVE_CONFIG_H
-#include
-#endif /* HAVE_CONFIG_H */
-
-#include
-#include "allheaders.h"
-
-/* --------------------------------------------*/
-#if USE_PSIO /* defined in environ.h */
- /* --------------------------------------------*/
-
- /* Set default for writing bounding box hint */
-static l_int32 var_PS_WRITE_BOUNDING_BOX = 1;
-
-static const l_int32 Bufsize = 512;
-static const l_int32 DefaultInputRes = 300; /* typical scan res, ppi */
-static const l_int32 MinRes = 5;
-static const l_int32 MaxRes = 3000;
-
- /* For computing resolution that fills page to desired amount */
-static const l_int32 LetterWidth = 612; /* points */
-static const l_int32 LetterHeight = 792; /* points */
-static const l_int32 A4Width = 595; /* points */
-static const l_int32 A4Height = 842; /* points */
-static const l_float32 DefaultFillFraction = 0.95;
-
-#ifndef NO_CONSOLE_IO
-#define DEBUG_JPEG 0
-#define DEBUG_G4 0
-#define DEBUG_FLATE 0
-#endif /* ~NO_CONSOLE_IO */
-
-/* Note that the bounding box hint at the top of the generated PostScript
- * file is required for the "*Embed" functions. These generate a
- * PostScript file for an individual image that can be translated and
- * scaled by an application that embeds the image in its output
- * (e.g., in the PS output from a TeX file).
- * However, bounding box hints should not be embedded in any
- * PostScript image that will be composited with other images,
- * where more than one image may be placed in an arbitrary location
- * on a page. */
-
- /* Static helper functions */
-static void getScaledParametersPS(BOX *box, l_int32 wpix, l_int32 hpix,
- l_int32 res, l_float32 scale,
- l_float32 *pxpt, l_float32 *pypt,
- l_float32 *pwpt, l_float32 *phpt);
-static void convertByteToHexAscii(l_uint8 byteval, char *pnib1, char *pnib2);
-static l_ok convertJpegToPSString(const char *filein, char **poutstr,
- l_int32 *pnbytes, l_int32 x, l_int32 y,
- l_int32 res, l_float32 scale,
- l_int32 pageno, l_int32 endpage);
-static char *generateJpegPS(const char *filein, L_COMP_DATA *cid,
- l_float32 xpt, l_float32 ypt, l_float32 wpt,
- l_float32 hpt, l_int32 pageno, l_int32 endpage);
-static l_ok convertG4ToPSString(const char *filein, char **poutstr,
- l_int32 *pnbytes, l_int32 x, l_int32 y,
- l_int32 res, l_float32 scale, l_int32 pageno,
- l_int32 maskflag, l_int32 endpage);
-static char *generateG4PS(const char *filein, L_COMP_DATA *cid, l_float32 xpt,
- l_float32 ypt, l_float32 wpt, l_float32 hpt,
- l_int32 maskflag, l_int32 pageno, l_int32 endpage);
-static l_ok convertFlateToPSString(const char *filein, char **poutstr,
- l_int32 *pnbytes, l_int32 x, l_int32 y,
- l_int32 res, l_float32 scale,
- l_int32 pageno, l_int32 endpage);
-static char *generateFlatePS(const char *filein, L_COMP_DATA *cid,
- l_float32 xpt, l_float32 ypt, l_float32 wpt,
- l_float32 hpt, l_int32 pageno, l_int32 endpage);
-
-
-/*-------------------------------------------------------------*
- * For uncompressed images *
- *-------------------------------------------------------------*/
-/*!
- * \brief pixWritePSEmbed()
- *
- * \param[in] filein input file, all depths, colormap OK
- * \param[in] fileout output ps file
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This is a simple wrapper function that generates an
- * uncompressed PS file, with a bounding box.
- * (2) The bounding box is required when a program such as TeX
- * (through epsf) places and rescales the image.
- * (3) The bounding box is sized for fitting the image to an
- * 8.5 x 11.0 inch page.
- *
- */
-l_ok
-pixWritePSEmbed(const char *filein,
- const char *fileout)
-{
-l_int32 w, h, ret;
-l_float32 scale;
-FILE *fp;
-PIX *pix;
-
- PROCNAME("pixWritePSEmbed");
-
- if (!filein)
- return ERROR_INT("filein not defined", procName, 1);
- if (!fileout)
- return ERROR_INT("fileout not defined", procName, 1);
-
- if ((pix = pixRead(filein)) == NULL)
- return ERROR_INT("image not read from file", procName, 1);
- w = pixGetWidth(pix);
- h = pixGetHeight(pix);
- if (w * 11.0 > h * 8.5)
- scale = 8.5 * 300. / (l_float32)w;
- else
- scale = 11.0 * 300. / (l_float32)h;
-
- if ((fp = fopenWriteStream(fileout, "wb")) == NULL)
- return ERROR_INT("file not opened for write", procName, 1);
- ret = pixWriteStreamPS(fp, pix, NULL, 0, scale);
- fclose(fp);
-
- pixDestroy(&pix);
- return ret;
-}
-
-
-/*!
- * \brief pixWriteStreamPS()
- *
- * \param[in] fp file stream
- * \param[in] pix
- * \param[in] box [optional]
- * \param[in] res can use 0 for default of 300 ppi
- * \param[in] scale to prevent scaling, use either 1.0 or 0.0
- * \return 0 if OK; 1 on error
- *
- *
- * Notes:
- * (1) This writes image in PS format, optionally scaled,
- * adjusted for the printer resolution, and with
- * a bounding box.
- * (2) For details on use of parameters, see pixWriteStringPS().
- *
- */
-l_ok
-pixWriteStreamPS(FILE *fp,
- PIX *pix,
- BOX *box,
- l_int32 res,
- l_float32 scale)
-{
-char *outstr;
-l_int32 length;
-PIX *pixc;
-
- PROCNAME("pixWriteStreamPS");
-
- if (!fp)
- return (l_int32)ERROR_INT("stream not open", procName, 1);
- if (!pix)
- return (l_int32)ERROR_INT("pix not defined", procName, 1);
-
- if ((pixc = pixConvertForPSWrap(pix)) == NULL)
- return (l_int32)ERROR_INT("pixc not made", procName, 1);
-
- if ((outstr = pixWriteStringPS(pixc, box, res, scale)) == NULL) {
- pixDestroy(&pixc);
- return (l_int32)ERROR_INT("outstr not made", procName, 1);
- }
- length = strlen(outstr);
- fwrite(outstr, 1, length, fp);
- LEPT_FREE(outstr);
- pixDestroy(&pixc);
- return 0;
-}
-
-
-/*!
- * \brief pixWriteStringPS()
- *
- * \param[in] pixs all depths, colormap OK
- * \param[in] box bounding box; can be NULL
- * \param[in] res resolution, in printer ppi. Use 0 for default 300 ppi.
- * \param[in] scale scale factor. If no scaling is desired, use
- * either 1.0 or 0.0. Scaling just resets the resolution
- * parameter; the actual scaling is done in the
- * interpreter at rendering time. This is important:
- * it allows you to scale the image up without
- * increasing the file size.
- * \return ps string if OK, or NULL on error
- *
- *
- * a) If %box == NULL, image is placed, optionally scaled,
- * in a standard b.b. at the center of the page.
- * This is to be used when another program like
- * TeX through epsf places the image.
- * b) If %box != NULL, image is placed without a
- * b.b. at the specified page location and with
- * optional scaling. This is to be used when
- * you want to specify exactly where and optionally
- * how big you want the image to be.
- * Note that all coordinates are in PS convention,
- * with 0,0 at LL corner of the page:
- * x,y location of LL corner of image, in mils.
- * w,h scaled size, in mils. Use 0 to
- * scale with "scale" and "res" input.
- *
- * %scale: If no scaling is desired, use either 1.0 or 0.0.
- * Scaling just resets the resolution parameter; the actual
- * scaling is done in the interpreter at rendering time.
- * This is important: * it allows you to scale the image up
- * without increasing the file size.
- *
- * Notes:
- * (1) OK, this seems a bit complicated, because there are various
- * ways to scale and not to scale. Here's a summary:
- * (2) If you don't want any scaling at all:
- * * if you are using a box:
- * set w = 0, h = 0, and use scale = 1.0; it will print
- * each pixel unscaled at printer resolution
- * * if you are not using a box:
- * set scale = 1.0; it will print at printer resolution
- * (3) If you want the image to be a certain size in inches:
- * * you must use a box and set the box (w,h) in mils
- * (4) If you want the image to be scaled by a scale factor != 1.0:
- * * if you are using a box:
- * set w = 0, h = 0, and use the desired scale factor;
- * the higher the printer resolution, the smaller the
- * image will actually appear.
- * * if you are not using a box:
- * set the desired scale factor; the higher the printer
- * resolution, the smaller the image will actually appear.
- * (5) Another complication is the proliferation of distance units:
- * * The interface distances are in milli-inches.
- * * Three different units are used internally:
- * ~ pixels (units of 1/res inch)
- * ~ printer pts (units of 1/72 inch)
- * ~ inches
- * * Here is a quiz on volume units from a reviewer:
- * How many UK milli-cups in a US kilo-teaspoon?
- * (Hint: 1.0 US cup = 0.75 UK cup + 0.2 US gill;
- * 1.0 US gill = 24.0 US teaspoons)
- *
- */
-char *
-pixWriteStringPS(PIX *pixs,
- BOX *box,
- l_int32 res,
- l_float32 scale)
-{
-char nib1, nib2;
-char *hexdata, *outstr;
-l_uint8 byteval;
-l_int32 i, j, k, w, h, d;
-l_float32 wpt, hpt, xpt, ypt;
-l_int32 wpl, psbpl, hexbytes, boxflag, bps;
-l_uint32 *line, *data;
-PIX *pix;
-
- PROCNAME("pixWriteStringPS");
-
- if (!pixs)
- return (char *)ERROR_PTR("pixs not defined", procName, NULL);
-
- if ((pix = pixConvertForPSWrap(pixs)) == NULL)
- return (char *)ERROR_PTR("pix not made", procName, NULL);
- pixGetDimensions(pix, &w, &h, &d);
-
- /* Get the factors by which PS scales and translates, in pts */
- if (!box)
- boxflag = 0; /* no scaling; b.b. at center */
- else
- boxflag = 1; /* no b.b., specify placement and optional scaling */
- getScaledParametersPS(box, w, h, res, scale, &xpt, &ypt, &wpt, &hpt);
-
- if (d == 1)
- bps = 1; /* bits/sample */
- else /* d == 8 || d == 32 */
- bps = 8;
-
- /* Convert image data to hex string. psbpl is the number of
- * bytes in each raster line when it is packed to the byte
- * boundary (not the 32 bit word boundary, as with the pix).
- * When converted to hex, the hex string has 2 bytes for
- * every byte of raster data. */
- wpl = pixGetWpl(pix);
- if (d == 1 || d == 8)
- psbpl = (w * d + 7) / 8;
- else /* d == 32 */
- psbpl = 3 * w;
- data = pixGetData(pix);
- hexbytes = 2 * psbpl * h; /* size of ps hex array */
- if ((hexdata = (char *)LEPT_CALLOC(hexbytes + 1, sizeof(char))) == NULL)
- return (char *)ERROR_PTR("hexdata not made", procName, NULL);
- if (d == 1 || d == 8) {
- for (i = 0, k = 0; i < h; i++) {
- line = data + i * wpl;
- for (j = 0; j < psbpl; j++) {
- byteval = GET_DATA_BYTE(line, j);
- convertByteToHexAscii(byteval, &nib1, &nib2);
- hexdata[k++] = nib1;
- hexdata[k++] = nib2;
- }
- }
- } else { /* d == 32; hexdata bytes packed RGBRGB..., 2 per sample */
- for (i = 0, k = 0; i < h; i++) {
- line = data + i * wpl;
- for (j = 0; j < w; j++) {
- byteval = GET_DATA_BYTE(line + j, 0); /* red */
- convertByteToHexAscii(byteval, &nib1, &nib2);
- hexdata[k++] = nib1;
- hexdata[k++] = nib2;
- byteval = GET_DATA_BYTE(line + j, 1); /* green */
- convertByteToHexAscii(byteval, &nib1, &nib2);
- hexdata[k++] = nib1;
- hexdata[k++] = nib2;
- byteval = GET_DATA_BYTE(line + j, 2); /* blue */
- convertByteToHexAscii(byteval, &nib1, &nib2);
- hexdata[k++] = nib1;
- hexdata[k++] = nib2;
- }
- }
- }
- hexdata[k] = '\0';
-
- outstr = generateUncompressedPS(hexdata, w, h, d, psbpl, bps,
- xpt, ypt, wpt, hpt, boxflag);
- pixDestroy(&pix);
- if (!outstr)
- return (char *)ERROR_PTR("outstr not made", procName, NULL);
- return outstr;
-}
-
-
-/*!
- * \brief generateUncompressedPS()
- *
- * \param[in] hexdata
- * \param[in] w, h raster image size in pixels
- * \param[in] d image depth in bpp; rgb is 32
- * \param[in] psbpl raster bytes/line, when packed to the byte boundary
- * \param[in] bps bits/sample: either 1 or 8
- * \param[in] xpt, ypt location of LL corner of image, in pts, relative
- * to the PostScript origin (0,0) at the LL corner
- * of the page
- * \param[in] wpt, hpt rendered image size in pts
- * \param[in] boxflag 1 to print out bounding box hint; 0 to skip
- * \return PS string, or NULL on error
- *
- *
- * Notes:
- * (1) Low-level function.
- *
- */
-char *
-generateUncompressedPS(char *hexdata,
- l_int32 w,
- l_int32 h,
- l_int32 d,
- l_int32 psbpl,
- l_int32 bps,
- l_float32 xpt,
- l_float32 ypt,
- l_float32 wpt,
- l_float32 hpt,
- l_int32 boxflag)
-{
-char *outstr;
-char bigbuf[Bufsize];
-SARRAY *sa;
-
- PROCNAME("generateUncompressedPS");
-
- if (!hexdata)
- return (char *)ERROR_PTR("hexdata not defined", procName, NULL);
-
- sa = sarrayCreate(0);
- sarrayAddString(sa, "%!Adobe-PS", L_COPY);
- if (boxflag == 0) {
- snprintf(bigbuf, sizeof(bigbuf),
- "%%%%BoundingBox: %7.2f %7.2f %7.2f %7.2f",
- xpt, ypt, xpt + wpt, ypt + hpt);
- sarrayAddString(sa, bigbuf, L_COPY);
- } else { /* boxflag == 1 */
- sarrayAddString(sa, "gsave", L_COPY);
- }
-
- if (d == 1)
- sarrayAddString(sa,
- "{1 exch sub} settransfer %invert binary", L_COPY);
-
- snprintf(bigbuf, sizeof(bigbuf),
- "/bpl %d string def %%bpl as a string", psbpl);
- sarrayAddString(sa, bigbuf, L_COPY);
- snprintf(bigbuf, sizeof(bigbuf),
- "%7.2f %7.2f translate %%set image origin in pts", xpt, ypt);
- sarrayAddString(sa, bigbuf, L_COPY);
- snprintf(bigbuf, sizeof(bigbuf),
- "%7.2f %7.2f scale %%set image size in pts", wpt, hpt);
- sarrayAddString(sa, bigbuf, L_COPY);
- snprintf(bigbuf, sizeof(bigbuf),
- "%d %d %d %%image dimensions in pixels", w, h, bps);
- sarrayAddString(sa, bigbuf, L_COPY);
- snprintf(bigbuf, sizeof(bigbuf),
- "[%d %d %d %d %d %d] %%mapping matrix: [w 0 0 -h 0 h]",
- w, 0, 0, -h, 0, h);
- sarrayAddString(sa, bigbuf, L_COPY);
-
- if (boxflag == 0) {
- if (d == 1 || d == 8)
- sarrayAddString(sa,
- "{currentfile bpl readhexstring pop} image", L_COPY);
- else /* d == 32 */
- sarrayAddString(sa,
- "{currentfile bpl readhexstring pop} false 3 colorimage",
- L_COPY);
- } else { /* boxflag == 1 */
- if (d == 1 || d == 8)
- sarrayAddString(sa,
- "{currentfile bpl readhexstring pop} bind image", L_COPY);
- else /* d == 32 */
- sarrayAddString(sa,
- "{currentfile bpl readhexstring pop} bind false 3 colorimage",
- L_COPY);
- }
-
- sarrayAddString(sa, hexdata, L_INSERT);
-
- if (boxflag == 0)
- sarrayAddString(sa, "\nshowpage", L_COPY);
- else /* boxflag == 1 */
- sarrayAddString(sa, "\ngrestore", L_COPY);
-
- outstr = sarrayToString(sa, 1);
- sarrayDestroy(&sa);
- if (!outstr) L_ERROR("outstr not made\n", procName);
- return outstr;
-}
-
-
-/*!
- * \brief getScaledParametersPS()
- *
- * \param[in] box [optional] location of image in mils; x,y is LL corner
- * \param[in] wpix pix width in pixels
- * \param[in] hpix pix height in pixels
- * \param[in] res of printer; use 0 for default
- * \param[in] scale use 1.0 or 0.0 for no scaling
- * \param[out] pxpt location of llx in pts
- * \param[out] pypt location of lly in pts
- * \param[out] pwpt image width in pts
- * \param[out] phpt image height in pts
- * \return void no arg checking
- *
- *
- * Notes:
- * (1) The image is always scaled, depending on res and scale.
- * (2) If no box, the image is centered on the page.
- * (3) If there is a box, the image is placed within it.
- *
- */
-static void
-getScaledParametersPS(BOX *box,
- l_int32 wpix,
- l_int32 hpix,
- l_int32 res,
- l_float32 scale,
- l_float32 *pxpt,
- l_float32 *pypt,
- l_float32 *pwpt,
- l_float32 *phpt)
-{
-l_int32 bx, by, bw, bh;
-l_float32 winch, hinch, xinch, yinch, fres;
-
- PROCNAME("getScaledParametersPS");
-
- if (res == 0)
- res = DefaultInputRes;
- fres = (l_float32)res;
-
- /* Allow the PS interpreter to scale the resolution */
- if (scale == 0.0)
- scale = 1.0;
- if (scale != 1.0) {
- fres = (l_float32)res / scale;
- res = (l_int32)fres;
- }
-
- /* Limit valid resolution interval */
- if (res < MinRes || res > MaxRes) {
- L_WARNING("res %d out of bounds; using default res; no scaling\n",
- procName, res);
- res = DefaultInputRes;
- fres = (l_float32)res;
- }
-
- if (!box) { /* center on page */
- winch = (l_float32)wpix / fres;
- hinch = (l_float32)hpix / fres;
- xinch = (8.5 - winch) / 2.;
- yinch = (11.0 - hinch) / 2.;
- } else {
- boxGetGeometry(box, &bx, &by, &bw, &bh);
- if (bw == 0)
- winch = (l_float32)wpix / fres;
- else
- winch = (l_float32)bw / 1000.;
- if (bh == 0)
- hinch = (l_float32)hpix / fres;
- else
- hinch = (l_float32)bh / 1000.;
- xinch = (l_float32)bx / 1000.;
- yinch = (l_float32)by / 1000.;
- }
-
- if (xinch < 0)
- L_WARNING("left edge < 0.0 inch\n", procName);
- if (xinch + winch > 8.5)
- L_WARNING("right edge > 8.5 inch\n", procName);
- if (yinch < 0.0)
- L_WARNING("bottom edge < 0.0 inch\n", procName);
- if (yinch + hinch > 11.0)
- L_WARNING("top edge > 11.0 inch\n", procName);
-
- *pwpt = 72. * winch;
- *phpt = 72. * hinch;
- *pxpt = 72. * xinch;
- *pypt = 72. * yinch;
- return;
-}
-
-
-/*!
- * \brief convertByteToHexAscii()
- *
- * \param[in] byteval input byte
- * \param[out] pnib1, pnib2 two hex ascii characters
- * \return void
- */
-static void
-convertByteToHexAscii(l_uint8 byteval,
- char *pnib1,
- char *pnib2)
-{
-l_uint8 nib;
-
- nib = byteval >> 4;
- if (nib < 10)
- *pnib1 = '0' + nib;
- else
- *pnib1 = 'a' + (nib - 10);
- nib = byteval & 0xf;
- if (nib < 10)
- *pnib2 = '0' + nib;
- else
- *pnib2 = 'a' + (nib - 10);
- return;
-}
-
-
-/*-------------------------------------------------------------*
- * For jpeg compressed images *
- *-------------------------------------------------------------*/
-/*!
- * \brief convertJpegToPSEmbed()
- *
- * \param[in] filein input jpeg file
- * \param[in] fileout output ps file
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This function takes a jpeg file as input and generates a DCT
- * compressed, ascii85 encoded PS file, with a bounding box.
- * (2) The bounding box is required when a program such as TeX
- * (through epsf) places and rescales the image.
- * (3) The bounding box is sized for fitting the image to an
- * 8.5 x 11.0 inch page.
- *
- */
-l_ok
-convertJpegToPSEmbed(const char *filein,
- const char *fileout)
-{
-char *outstr;
-l_int32 w, h, nbytes, ret;
-l_float32 xpt, ypt, wpt, hpt;
-L_COMP_DATA *cid;
-
- PROCNAME("convertJpegToPSEmbed");
-
- if (!filein)
- return ERROR_INT("filein not defined", procName, 1);
- if (!fileout)
- return ERROR_INT("fileout not defined", procName, 1);
-
- /* Generate the ascii encoded jpeg data */
- if ((cid = l_generateJpegData(filein, 1)) == NULL)
- return ERROR_INT("jpeg data not made", procName, 1);
- w = cid->w;
- h = cid->h;
-
- /* Scale for 20 pt boundary and otherwise full filling
- * in one direction on 8.5 x 11 inch device */
- xpt = 20.0;
- ypt = 20.0;
- if (w * 11.0 > h * 8.5) {
- wpt = 572.0; /* 612 - 2 * 20 */
- hpt = wpt * (l_float32)h / (l_float32)w;
- } else {
- hpt = 752.0; /* 792 - 2 * 20 */
- wpt = hpt * (l_float32)w / (l_float32)h;
- }
-
- /* Generate the PS.
- * The bounding box information should be inserted (default). */
- outstr = generateJpegPS(NULL, cid, xpt, ypt, wpt, hpt, 1, 1);
- l_CIDataDestroy(&cid);
- if (!outstr)
- return ERROR_INT("outstr not made", procName, 1);
- nbytes = strlen(outstr);
-
- ret = l_binaryWrite(fileout, "w", outstr, nbytes);
- LEPT_FREE(outstr);
- if (ret) L_ERROR("ps string not written to file\n", procName);
- return ret;
-}
-
-
-/*!
- * \brief convertJpegToPS()
- *
- * \param[in] filein input jpeg file
- * \param[in] fileout output ps file
- * \param[in] operation "w" for write; "a" for append
- * \param[in] x, y location of LL corner of image, in pixels, relative
- * to the PostScript origin (0,0) at the LL corner
- * of the page
- * \param[in] res resolution of the input image, in ppi;
- * use 0 for default
- * \param[in] scale scaling by printer; use 0.0 or 1.0 for no scaling
- * \param[in] pageno page number; must start with 1; you can use 0
- * if there is only one page
- * \param[in] endpage boolean: use TRUE if this is the last image to be
- * added to the page; FALSE otherwise
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This is simpler to use than pixWriteStringPS(), and
- * it outputs in level 2 PS as compressed DCT (overlaid
- * with ascii85 encoding).
- * (2) An output file can contain multiple pages, each with
- * multiple images. The arguments to convertJpegToPS()
- * allow you to control placement of jpeg images on multiple
- * pages within a PostScript file.
- * (3) For the first image written to a file, use "w", which
- * opens for write and clears the file. For all subsequent
- * images written to that file, use "a".
- * (4) The (x, y) parameters give the LL corner of the image
- * relative to the LL corner of the page. They are in
- * units of pixels if scale = 1.0. If you use (e.g.)
- * scale = 2.0, the image is placed at (2x, 2y) on the page,
- * and the image dimensions are also doubled.
- * (5) Display vs printed resolution:
- * * If your display is 75 ppi and your image was created
- * at a resolution of 300 ppi, you can get the image
- * to print at the same size as it appears on your display
- * by either setting scale = 4.0 or by setting res = 75.
- * Both tell the printer to make a 4x enlarged image.
- * * If your image is generated at 150 ppi and you use scale = 1,
- * it will be rendered such that 150 pixels correspond
- * to 72 pts (1 inch on the printer). This function does
- * the conversion from pixels (with or without scaling) to
- * pts, which are the units that the printer uses.
- * * The printer will choose its own resolution to use
- * in rendering the image, which will not affect the size
- * of the rendered image. That is because the output
- * PostScript file describes the geometry in terms of pts,
- * which are defined to be 1/72 inch. The printer will
- * only see the size of the image in pts, through the
- * scale and translate parameters and the affine
- * transform (the ImageMatrix) of the image.
- * (6) To render multiple images on the same page, set
- * endpage = FALSE for each image until you get to the
- * last, for which you set endpage = TRUE. This causes the
- * "showpage" command to be invoked. Showpage outputs
- * the entire page and clears the raster buffer for the
- * next page to be added. Without a "showpage",
- * subsequent images from the next page will overlay those
- * previously put down.
- * (7) For multiple pages, increment the page number, starting
- * with page 1. This allows PostScript (and PDF) to build
- * a page directory, which viewers use for navigation.
- *
- */
-l_ok
-convertJpegToPS(const char *filein,
- const char *fileout,
- const char *operation,
- l_int32 x,
- l_int32 y,
- l_int32 res,
- l_float32 scale,
- l_int32 pageno,
- l_int32 endpage)
-{
-char *outstr;
-l_int32 nbytes;
-
- PROCNAME("convertJpegToPS");
-
- if (!filein)
- return ERROR_INT("filein not defined", procName, 1);
- if (!fileout)
- return ERROR_INT("fileout not defined", procName, 1);
- if (strcmp(operation, "w") && strcmp(operation, "a"))
- return ERROR_INT("operation must be \"w\" or \"a\"", procName, 1);
-
- if (convertJpegToPSString(filein, &outstr, &nbytes, x, y, res, scale,
- pageno, endpage))
- return ERROR_INT("ps string not made", procName, 1);
-
- if (l_binaryWrite(fileout, operation, outstr, nbytes)) {
- LEPT_FREE(outstr);
- return ERROR_INT("ps string not written to file", procName, 1);
- }
-
- LEPT_FREE(outstr);
- return 0;
-}
-
-
-/*!
- * \brief convertJpegToPSString()
- *
- * Generates PS string in jpeg format from jpeg file
- *
- * \param[in] filein input jpeg file
- * \param[out] poutstr PS string
- * \param[out] pnbytes number of bytes in PS string
- * \param[in] x, y location of LL corner of image, in pixels, relative
- * to the PostScript origin (0,0) at the LL corner
- * of the page
- * \param[in] res resolution of the input image, in ppi;
- * use 0 for default
- * \param[in] scale scaling by printer; use 0.0 or 1.0 for no scaling
- * \param[in] pageno page number; must start with 1; you can use 0
- * if there is only one page
- * \param[in] endpage boolean: use TRUE if this is the last image to be
- * added to the page; FALSE otherwise
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) For usage, see convertJpegToPS()
- *
- */
-static l_ok
-convertJpegToPSString(const char *filein,
- char **poutstr,
- l_int32 *pnbytes,
- l_int32 x,
- l_int32 y,
- l_int32 res,
- l_float32 scale,
- l_int32 pageno,
- l_int32 endpage)
-{
-char *outstr;
-l_float32 xpt, ypt, wpt, hpt;
-L_COMP_DATA *cid;
-
- PROCNAME("convertJpegToPSString");
-
- if (!poutstr)
- return ERROR_INT("&outstr not defined", procName, 1);
- if (!pnbytes)
- return ERROR_INT("&nbytes not defined", procName, 1);
- *poutstr = NULL;
- *pnbytes = 0;
- if (!filein)
- return ERROR_INT("filein not defined", procName, 1);
-
- /* Generate the ascii encoded jpeg data */
- if ((cid = l_generateJpegData(filein, 1)) == NULL)
- return ERROR_INT("jpeg data not made", procName, 1);
-
- /* Get scaled location in pts. Guess the input scan resolution
- * based on the input parameter %res, the resolution data in
- * the pix, and the size of the image. */
- if (scale == 0.0)
- scale = 1.0;
- if (res <= 0) {
- if (cid->res > 0)
- res = cid->res;
- else
- res = DefaultInputRes;
- }
-
- /* Get scaled location in pts */
- if (scale == 0.0)
- scale = 1.0;
- xpt = scale * x * 72. / res;
- ypt = scale * y * 72. / res;
- wpt = scale * cid->w * 72. / res;
- hpt = scale * cid->h * 72. / res;
-
- if (pageno == 0)
- pageno = 1;
-
-#if DEBUG_JPEG
- lept_stderr("w = %d, h = %d, bps = %d, spp = %d\n",
- cid->w, cid->h, cid->bps, cid->spp);
- lept_stderr("comp bytes = %ld, nbytes85 = %ld, ratio = %5.3f\n",
- (unsigned long)cid->nbytescomp, (unsigned long)cid->nbytes85,
- (l_float32)cid->nbytes85 / (l_float32)cid->nbytescomp);
- lept_stderr("xpt = %7.2f, ypt = %7.2f, wpt = %7.2f, hpt = %7.2f\n",
- xpt, ypt, wpt, hpt);
-#endif /* DEBUG_JPEG */
-
- /* Generate the PS */
- outstr = generateJpegPS(NULL, cid, xpt, ypt, wpt, hpt, pageno, endpage);
- l_CIDataDestroy(&cid);
- if (!outstr)
- return ERROR_INT("outstr not made", procName, 1);
- *poutstr = outstr;
- *pnbytes = strlen(outstr);
- return 0;
-}
-
-
-/*!
- * \brief generateJpegPS()
- *
- * \param[in] filein [optional] input jpeg filename; can be null
- * \param[in] cid jpeg compressed image data
- * \param[in] xpt, ypt location of LL corner of image, in pts, relative
- * to the PostScript origin (0,0) at the LL corner
- * of the page
- * \param[in] wpt, hpt rendered image size in pts
- * \param[in] pageno page number; must start with 1; you can use 0
- * if there is only one page.
- * \param[in] endpage boolean: use TRUE if this is the last image to be
- * added to the page; FALSE otherwise
- * \return PS string, or NULL on error
- *
- *
- * Notes:
- * (1) Low-level function.
- *
- */
-static char *
-generateJpegPS(const char *filein,
- L_COMP_DATA *cid,
- l_float32 xpt,
- l_float32 ypt,
- l_float32 wpt,
- l_float32 hpt,
- l_int32 pageno,
- l_int32 endpage)
-{
-l_int32 w, h, bps, spp;
-char *outstr;
-char bigbuf[Bufsize];
-SARRAY *sa;
-
- PROCNAME("generateJpegPS");
-
- if (!cid)
- return (char *)ERROR_PTR("jpeg data not defined", procName, NULL);
- w = cid->w;
- h = cid->h;
- bps = cid->bps;
- spp = cid->spp;
-
- sa = sarrayCreate(50);
- sarrayAddString(sa, "%!PS-Adobe-3.0", L_COPY);
- sarrayAddString(sa, "%%Creator: leptonica", L_COPY);
- if (filein)
- snprintf(bigbuf, sizeof(bigbuf), "%%%%Title: %s", filein);
- else
- snprintf(bigbuf, sizeof(bigbuf), "%%%%Title: Jpeg compressed PS");
- sarrayAddString(sa, bigbuf, L_COPY);
- sarrayAddString(sa, "%%DocumentData: Clean7Bit", L_COPY);
-
- if (var_PS_WRITE_BOUNDING_BOX == 1) {
- snprintf(bigbuf, sizeof(bigbuf),
- "%%%%BoundingBox: %7.2f %7.2f %7.2f %7.2f",
- xpt, ypt, xpt + wpt, ypt + hpt);
- sarrayAddString(sa, bigbuf, L_COPY);
- }
-
- sarrayAddString(sa, "%%LanguageLevel: 2", L_COPY);
- sarrayAddString(sa, "%%EndComments", L_COPY);
- snprintf(bigbuf, sizeof(bigbuf), "%%%%Page: %d %d", pageno, pageno);
- sarrayAddString(sa, bigbuf, L_COPY);
-
- sarrayAddString(sa, "save", L_COPY);
- sarrayAddString(sa,
- "/RawData currentfile /ASCII85Decode filter def", L_COPY);
- sarrayAddString(sa, "/Data RawData << >> /DCTDecode filter def", L_COPY);
-
- snprintf(bigbuf, sizeof(bigbuf),
- "%7.2f %7.2f translate %%set image origin in pts", xpt, ypt);
- sarrayAddString(sa, bigbuf, L_COPY);
-
- snprintf(bigbuf, sizeof(bigbuf),
- "%7.2f %7.2f scale %%set image size in pts", wpt, hpt);
- sarrayAddString(sa, bigbuf, L_COPY);
-
- if (spp == 1)
- sarrayAddString(sa, "/DeviceGray setcolorspace", L_COPY);
- else if (spp == 3)
- sarrayAddString(sa, "/DeviceRGB setcolorspace", L_COPY);
- else /*spp == 4 */
- sarrayAddString(sa, "/DeviceCMYK setcolorspace", L_COPY);
-
- sarrayAddString(sa, "{ << /ImageType 1", L_COPY);
- snprintf(bigbuf, sizeof(bigbuf), " /Width %d", w);
- sarrayAddString(sa, bigbuf, L_COPY);
- snprintf(bigbuf, sizeof(bigbuf), " /Height %d", h);
- sarrayAddString(sa, bigbuf, L_COPY);
- snprintf(bigbuf, sizeof(bigbuf),
- " /ImageMatrix [ %d 0 0 %d 0 %d ]", w, -h, h);
- sarrayAddString(sa, bigbuf, L_COPY);
- sarrayAddString(sa, " /DataSource Data", L_COPY);
- snprintf(bigbuf, sizeof(bigbuf), " /BitsPerComponent %d", bps);
- sarrayAddString(sa, bigbuf, L_COPY);
-
- if (spp == 1)
- sarrayAddString(sa, " /Decode [0 1]", L_COPY);
- else if (spp == 3)
- sarrayAddString(sa, " /Decode [0 1 0 1 0 1]", L_COPY);
- else /* spp == 4 */
- sarrayAddString(sa, " /Decode [0 1 0 1 0 1 0 1]", L_COPY);
-
- sarrayAddString(sa, " >> image", L_COPY);
- sarrayAddString(sa, " Data closefile", L_COPY);
- sarrayAddString(sa, " RawData flushfile", L_COPY);
- if (endpage == TRUE)
- sarrayAddString(sa, " showpage", L_COPY);
- sarrayAddString(sa, " restore", L_COPY);
- sarrayAddString(sa, "} exec", L_COPY);
-
- /* Insert the ascii85 jpeg data; this is now owned by sa */
- sarrayAddString(sa, cid->data85, L_INSERT);
- cid->data85 = NULL; /* it has been transferred and destroyed */
-
- /* Generate and return the output string */
- outstr = sarrayToString(sa, 1);
- sarrayDestroy(&sa);
- return outstr;
-}
-
-
-/*-------------------------------------------------------------*
- * For ccitt g4 compressed images *
- *-------------------------------------------------------------*/
-/*!
- * \brief convertG4ToPSEmbed()
- *
- * \param[in] filein input tiff file
- * \param[in] fileout output ps file
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This function takes a g4 compressed tif file as input and
- * generates a g4 compressed, ascii85 encoded PS file, with
- * a bounding box.
- * (2) The bounding box is required when a program such as TeX
- * (through epsf) places and rescales the image.
- * (3) The bounding box is sized for fitting the image to an
- * 8.5 x 11.0 inch page.
- * (4) We paint this through a mask, over whatever is below.
- *
- */
-l_ok
-convertG4ToPSEmbed(const char *filein,
- const char *fileout)
-{
-char *outstr;
-l_int32 w, h, nbytes, ret;
-l_float32 xpt, ypt, wpt, hpt;
-L_COMP_DATA *cid;
-
- PROCNAME("convertG4ToPSEmbed");
-
- if (!filein)
- return ERROR_INT("filein not defined", procName, 1);
- if (!fileout)
- return ERROR_INT("fileout not defined", procName, 1);
-
- if ((cid = l_generateG4Data(filein, 1)) == NULL)
- return ERROR_INT("g4 data not made", procName, 1);
- w = cid->w;
- h = cid->h;
-
- /* Scale for 20 pt boundary and otherwise full filling
- * in one direction on 8.5 x 11 inch device */
- xpt = 20.0;
- ypt = 20.0;
- if (w * 11.0 > h * 8.5) {
- wpt = 572.0; /* 612 - 2 * 20 */
- hpt = wpt * (l_float32)h / (l_float32)w;
- } else {
- hpt = 752.0; /* 792 - 2 * 20 */
- wpt = hpt * (l_float32)w / (l_float32)h;
- }
-
- /* Generate the PS, painting through the image mask.
- * The bounding box information should be inserted (default). */
- outstr = generateG4PS(NULL, cid, xpt, ypt, wpt, hpt, 1, 1, 1);
- l_CIDataDestroy(&cid);
- if (!outstr)
- return ERROR_INT("outstr not made", procName, 1);
- nbytes = strlen(outstr);
-
- ret = l_binaryWrite(fileout, "w", outstr, nbytes);
- LEPT_FREE(outstr);
- if (ret) L_ERROR("ps string not written to file\n", procName);
- return ret;
-}
-
-
-/*!
- * \brief convertG4ToPS()
- *
- * \param[in] filein input tiff g4 file
- * \param[in] fileout output ps file
- * \param[in] operation "w" for write; "a" for append
- * \param[in] x, y location of LL corner of image, in pixels, relative
- * to the PostScript origin (0,0) at the LL corner
- * of the page
- * \param[in] res resolution of the input image, in ppi; typ. values
- * are 300 and 600; use 0 for automatic determination
- * based on image size
- * \param[in] scale scaling by printer; use 0.0 or 1.0 for no scaling
- * \param[in] pageno page number; must start with 1; you can use 0
- * if there is only one page.
- * \param[in] maskflag boolean: use TRUE if just painting through fg;
- * FALSE if painting both fg and bg.
- * \param[in] endpage boolean: use TRUE if this is the last image to be
- * added to the page; FALSE otherwise
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) See the usage comments in convertJpegToPS(), some of
- * which are repeated here.
- * (2) This is a wrapper for tiff g4. The PostScript that
- * is generated is expanded by about 5/4 (due to the
- * ascii85 encoding. If you convert to pdf (ps2pdf), the
- * ascii85 decoder is automatically invoked, so that the
- * pdf wrapped g4 file is essentially the same size as
- * the original g4 file. It's useful to have the PS
- * file ascii85 encoded, because many printers will not
- * print binary PS files.
- * (3) For the first image written to a file, use "w", which
- * opens for write and clears the file. For all subsequent
- * images written to that file, use "a".
- * (4) To render multiple images on the same page, set
- * endpage = FALSE for each image until you get to the
- * last, for which you set endpage = TRUE. This causes the
- * "showpage" command to be invoked. Showpage outputs
- * the entire page and clears the raster buffer for the
- * next page to be added. Without a "showpage",
- * subsequent images from the next page will overlay those
- * previously put down.
- * (5) For multiple images to the same page, where you are writing
- * both jpeg and tiff-g4, you have two options:
- * (a) write the g4 first, as either image (maskflag == FALSE)
- * or imagemask (maskflag == TRUE), and then write the
- * jpeg over it.
- * (b) write the jpeg first and as the last item, write
- * the g4 as an imagemask (maskflag == TRUE), to paint
- * through the foreground only.
- * We have this flexibility with the tiff-g4 because it is 1 bpp.
- * (6) For multiple pages, increment the page number, starting
- * with page 1. This allows PostScript (and PDF) to build
- * a page directory, which viewers use for navigation.
- *
- */
-l_ok
-convertG4ToPS(const char *filein,
- const char *fileout,
- const char *operation,
- l_int32 x,
- l_int32 y,
- l_int32 res,
- l_float32 scale,
- l_int32 pageno,
- l_int32 maskflag,
- l_int32 endpage)
-{
-char *outstr;
-l_int32 nbytes, ret;
-
- PROCNAME("convertG4ToPS");
-
- if (!filein)
- return ERROR_INT("filein not defined", procName, 1);
- if (!fileout)
- return ERROR_INT("fileout not defined", procName, 1);
- if (strcmp(operation, "w") && strcmp(operation, "a"))
- return ERROR_INT("operation must be \"w\" or \"a\"", procName, 1);
-
- if (convertG4ToPSString(filein, &outstr, &nbytes, x, y, res, scale,
- pageno, maskflag, endpage))
- return ERROR_INT("ps string not made", procName, 1);
-
- ret = l_binaryWrite(fileout, operation, outstr, nbytes);
- LEPT_FREE(outstr);
- if (ret)
- return ERROR_INT("ps string not written to file", procName, 1);
- return 0;
-}
-
-
-/*!
- * \brief convertG4ToPSString()
- *
- * \param[in] filein input tiff g4 file
- * \param[out] poutstr PS string
- * \param[out] pnbytes number of bytes in PS string
- * \param[in] x, y location of LL corner of image, in pixels, relative
- * to the PostScript origin (0,0) at the LL corner
- * of the page
- * \param[in] res resolution of the input image, in ppi; typ. values
- * are 300 and 600; use 0 for automatic determination
- * based on image size
- * \param[in] scale scaling by printer; use 0.0 or 1.0 for no scaling
- * \param[in] pageno page number; must start with 1; you can use 0
- * if there is only one page.
- * \param[in] maskflag boolean: use TRUE if just painting through fg;
- * FALSE if painting both fg and bg.
- * \param[in] endpage boolean: use TRUE if this is the last image to be
- * added to the page; FALSE otherwise
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) Generates PS string in G4 compressed tiff format from G4 tiff file.
- * (2) For usage, see convertG4ToPS().
- *
- */
-static l_ok
-convertG4ToPSString(const char *filein,
- char **poutstr,
- l_int32 *pnbytes,
- l_int32 x,
- l_int32 y,
- l_int32 res,
- l_float32 scale,
- l_int32 pageno,
- l_int32 maskflag,
- l_int32 endpage)
-{
-char *outstr;
-l_float32 xpt, ypt, wpt, hpt;
-L_COMP_DATA *cid;
-
- PROCNAME("convertG4ToPSString");
-
- if (!poutstr)
- return ERROR_INT("&outstr not defined", procName, 1);
- if (!pnbytes)
- return ERROR_INT("&nbytes not defined", procName, 1);
- *poutstr = NULL;
- *pnbytes = 0;
- if (!filein)
- return ERROR_INT("filein not defined", procName, 1);
-
- if ((cid = l_generateG4Data(filein, 1)) == NULL)
- return ERROR_INT("g4 data not made", procName, 1);
-
- /* Get scaled location in pts. Guess the input scan resolution
- * based on the input parameter %res, the resolution data in
- * the pix, and the size of the image. */
- if (scale == 0.0)
- scale = 1.0;
- if (res <= 0) {
- if (cid->res > 0) {
- res = cid->res;
- } else {
- if (cid->h <= 3509) /* A4 height at 300 ppi */
- res = 300;
- else
- res = 600;
- }
- }
- xpt = scale * x * 72. / res;
- ypt = scale * y * 72. / res;
- wpt = scale * cid->w * 72. / res;
- hpt = scale * cid->h * 72. / res;
-
- if (pageno == 0)
- pageno = 1;
-
-#if DEBUG_G4
- lept_stderr("w = %d, h = %d, minisblack = %d\n",
- cid->w, cid->h, cid->minisblack);
- lept_stderr("comp bytes = %ld, nbytes85 = %ld\n",
- (unsigned long)cid->nbytescomp, (unsigned long)cid->nbytes85);
- lept_stderr("xpt = %7.2f, ypt = %7.2f, wpt = %7.2f, hpt = %7.2f\n",
- xpt, ypt, wpt, hpt);
-#endif /* DEBUG_G4 */
-
- /* Generate the PS */
- outstr = generateG4PS(NULL, cid, xpt, ypt, wpt, hpt,
- maskflag, pageno, endpage);
- l_CIDataDestroy(&cid);
- if (!outstr)
- return ERROR_INT("outstr not made", procName, 1);
- *poutstr = outstr;
- *pnbytes = strlen(outstr);
- return 0;
-}
-
-
-/*!
- * \brief generateG4PS()
- *
- * \param[in] filein [optional] input tiff g4 file; can be null
- * \param[in] cid g4 compressed image data
- * \param[in] xpt, ypt location of LL corner of image, in pts, relative
- * to the PostScript origin (0,0) at the LL corner
- * of the page
- * \param[in] wpt, hpt rendered image size in pts
- * \param[in] maskflag boolean: use TRUE if just painting through fg;
- * FALSE if painting both fg and bg.
- * \param[in] pageno page number; must start with 1; you can use 0
- * if there is only one page.
- * \param[in] endpage boolean: use TRUE if this is the last image to be
- * added to the page; FALSE otherwise
- * \return PS string, or NULL on error
- *
- *
- * Notes:
- * (1) Low-level function.
- *
- */
-static char *
-generateG4PS(const char *filein,
- L_COMP_DATA *cid,
- l_float32 xpt,
- l_float32 ypt,
- l_float32 wpt,
- l_float32 hpt,
- l_int32 maskflag,
- l_int32 pageno,
- l_int32 endpage)
-{
-l_int32 w, h;
-char *outstr;
-char bigbuf[Bufsize];
-SARRAY *sa;
-
- PROCNAME("generateG4PS");
-
- if (!cid)
- return (char *)ERROR_PTR("g4 data not defined", procName, NULL);
- w = cid->w;
- h = cid->h;
-
- sa = sarrayCreate(50);
- sarrayAddString(sa, "%!PS-Adobe-3.0", L_COPY);
- sarrayAddString(sa, "%%Creator: leptonica", L_COPY);
- if (filein)
- snprintf(bigbuf, sizeof(bigbuf), "%%%%Title: %s", filein);
- else
- snprintf(bigbuf, sizeof(bigbuf), "%%%%Title: G4 compressed PS");
- sarrayAddString(sa, bigbuf, L_COPY);
- sarrayAddString(sa, "%%DocumentData: Clean7Bit", L_COPY);
-
- if (var_PS_WRITE_BOUNDING_BOX == 1) {
- snprintf(bigbuf, sizeof(bigbuf),
- "%%%%BoundingBox: %7.2f %7.2f %7.2f %7.2f",
- xpt, ypt, xpt + wpt, ypt + hpt);
- sarrayAddString(sa, bigbuf, L_COPY);
- }
-
- sarrayAddString(sa, "%%LanguageLevel: 2", L_COPY);
- sarrayAddString(sa, "%%EndComments", L_COPY);
- snprintf(bigbuf, sizeof(bigbuf), "%%%%Page: %d %d", pageno, pageno);
- sarrayAddString(sa, bigbuf, L_COPY);
-
- sarrayAddString(sa, "save", L_COPY);
- sarrayAddString(sa, "100 dict begin", L_COPY);
-
- snprintf(bigbuf, sizeof(bigbuf),
- "%7.2f %7.2f translate %%set image origin in pts", xpt, ypt);
- sarrayAddString(sa, bigbuf, L_COPY);
-
- snprintf(bigbuf, sizeof(bigbuf),
- "%7.2f %7.2f scale %%set image size in pts", wpt, hpt);
- sarrayAddString(sa, bigbuf, L_COPY);
-
- sarrayAddString(sa, "/DeviceGray setcolorspace", L_COPY);
-
- sarrayAddString(sa, "{", L_COPY);
- sarrayAddString(sa,
- " /RawData currentfile /ASCII85Decode filter def", L_COPY);
- sarrayAddString(sa, " << ", L_COPY);
- sarrayAddString(sa, " /ImageType 1", L_COPY);
- snprintf(bigbuf, sizeof(bigbuf), " /Width %d", w);
- sarrayAddString(sa, bigbuf, L_COPY);
- snprintf(bigbuf, sizeof(bigbuf), " /Height %d", h);
- sarrayAddString(sa, bigbuf, L_COPY);
- snprintf(bigbuf, sizeof(bigbuf),
- " /ImageMatrix [ %d 0 0 %d 0 %d ]", w, -h, h);
- sarrayAddString(sa, bigbuf, L_COPY);
- sarrayAddString(sa, " /BitsPerComponent 1", L_COPY);
- sarrayAddString(sa, " /Interpolate true", L_COPY);
- if (cid->minisblack)
- sarrayAddString(sa, " /Decode [1 0]", L_COPY);
- else /* miniswhite; typical for 1 bpp */
- sarrayAddString(sa, " /Decode [0 1]", L_COPY);
- sarrayAddString(sa, " /DataSource RawData", L_COPY);
- sarrayAddString(sa, " <<", L_COPY);
- sarrayAddString(sa, " /K -1", L_COPY);
- snprintf(bigbuf, sizeof(bigbuf), " /Columns %d", w);
- sarrayAddString(sa, bigbuf, L_COPY);
- snprintf(bigbuf, sizeof(bigbuf), " /Rows %d", h);
- sarrayAddString(sa, bigbuf, L_COPY);
- sarrayAddString(sa, " >> /CCITTFaxDecode filter", L_COPY);
- if (maskflag == TRUE) /* just paint through the fg */
- sarrayAddString(sa, " >> imagemask", L_COPY);
- else /* Paint full image */
- sarrayAddString(sa, " >> image", L_COPY);
- sarrayAddString(sa, " RawData flushfile", L_COPY);
- if (endpage == TRUE)
- sarrayAddString(sa, " showpage", L_COPY);
- sarrayAddString(sa, "}", L_COPY);
-
- sarrayAddString(sa, "%%BeginData:", L_COPY);
- sarrayAddString(sa, "exec", L_COPY);
-
- /* Insert the ascii85 ccittg4 data; this is now owned by sa */
- sarrayAddString(sa, cid->data85, L_INSERT);
-
- /* Concat the trailing data */
- sarrayAddString(sa, "%%EndData", L_COPY);
- sarrayAddString(sa, "end", L_COPY);
- sarrayAddString(sa, "restore", L_COPY);
-
- outstr = sarrayToString(sa, 1);
- sarrayDestroy(&sa);
- cid->data85 = NULL; /* it has been transferred and destroyed */
- return outstr;
-}
-
-
-/*-------------------------------------------------------------*
- * For tiff multipage files *
- *-------------------------------------------------------------*/
-/*!
- * \brief convertTiffMultipageToPS()
- *
- * \param[in] filein input tiff multipage file
- * \param[in] fileout output ps file
- * \param[in] fillfract factor for filling 8.5 x 11 inch page;
- * use 0.0 for DefaultFillFraction
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This converts a multipage tiff file of binary page images
- * into a ccitt g4 compressed PS file.
- * (2) If the images are generated from a standard resolution fax,
- * the vertical resolution is doubled to give a normal-looking
- * aspect ratio.
- *
- */
-l_ok
-convertTiffMultipageToPS(const char *filein,
- const char *fileout,
- l_float32 fillfract)
-{
-char *tempfile;
-l_int32 i, npages, w, h, istiff;
-l_float32 scale;
-PIX *pix, *pixs;
-FILE *fp;
-
- PROCNAME("convertTiffMultipageToPS");
-
- if (!filein)
- return ERROR_INT("filein not defined", procName, 1);
- if (!fileout)
- return ERROR_INT("fileout not defined", procName, 1);
-
- if ((fp = fopenReadStream(filein)) == NULL)
- return ERROR_INT("file not found", procName, 1);
- istiff = fileFormatIsTiff(fp);
- if (!istiff) {
- fclose(fp);
- return ERROR_INT("file not tiff format", procName, 1);
- }
- tiffGetCount(fp, &npages);
- fclose(fp);
-
- if (fillfract == 0.0)
- fillfract = DefaultFillFraction;
-
- for (i = 0; i < npages; i++) {
- if ((pix = pixReadTiff(filein, i)) == NULL)
- return ERROR_INT("pix not made", procName, 1);
-
- pixGetDimensions(pix, &w, &h, NULL);
- if (w == 1728 && h < w) /* it's a std res fax */
- pixs = pixScale(pix, 1.0, 2.0);
- else
- pixs = pixClone(pix);
-
- tempfile = l_makeTempFilename();
- pixWrite(tempfile, pixs, IFF_TIFF_G4);
- scale = L_MIN(fillfract * 2550 / w, fillfract * 3300 / h);
- if (i == 0)
- convertG4ToPS(tempfile, fileout, "w", 0, 0, 300, scale,
- i + 1, FALSE, TRUE);
- else
- convertG4ToPS(tempfile, fileout, "a", 0, 0, 300, scale,
- i + 1, FALSE, TRUE);
- lept_rmfile(tempfile);
- LEPT_FREE(tempfile);
- pixDestroy(&pix);
- pixDestroy(&pixs);
- }
-
- return 0;
-}
-
-
-/*---------------------------------------------------------------------*
- * For flate (gzip) compressed images (e.g., png) *
- *---------------------------------------------------------------------*/
-/*!
- * \brief convertFlateToPSEmbed()
- *
- * \param[in] filein input file -- any format
- * \param[in] fileout output ps file
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This function takes any image file as input and generates a
- * flate-compressed, ascii85 encoded PS file, with a bounding box.
- * (2) The bounding box is required when a program such as TeX
- * (through epsf) places and rescales the image.
- * (3) The bounding box is sized for fitting the image to an
- * 8.5 x 11.0 inch page.
- *
- */
-l_ok
-convertFlateToPSEmbed(const char *filein,
- const char *fileout)
-{
-char *outstr;
-l_int32 w, h, nbytes, ret;
-l_float32 xpt, ypt, wpt, hpt;
-L_COMP_DATA *cid;
-
- PROCNAME("convertFlateToPSEmbed");
-
- if (!filein)
- return ERROR_INT("filein not defined", procName, 1);
- if (!fileout)
- return ERROR_INT("fileout not defined", procName, 1);
-
- if ((cid = l_generateFlateData(filein, 1)) == NULL)
- return ERROR_INT("flate data not made", procName, 1);
- w = cid->w;
- h = cid->h;
-
- /* Scale for 20 pt boundary and otherwise full filling
- * in one direction on 8.5 x 11 inch device */
- xpt = 20.0;
- ypt = 20.0;
- if (w * 11.0 > h * 8.5) {
- wpt = 572.0; /* 612 - 2 * 20 */
- hpt = wpt * (l_float32)h / (l_float32)w;
- } else {
- hpt = 752.0; /* 792 - 2 * 20 */
- wpt = hpt * (l_float32)w / (l_float32)h;
- }
-
- /* Generate the PS.
- * The bounding box information should be inserted (default). */
- outstr = generateFlatePS(NULL, cid, xpt, ypt, wpt, hpt, 1, 1);
- l_CIDataDestroy(&cid);
- if (!outstr)
- return ERROR_INT("outstr not made", procName, 1);
- nbytes = strlen(outstr);
-
- ret = l_binaryWrite(fileout, "w", outstr, nbytes);
- LEPT_FREE(outstr);
- if (ret) L_ERROR("ps string not written to file\n", procName);
- return ret;
-}
-
-
-/*!
- * \brief convertFlateToPS()
- *
- * \param[in] filein input file -- any format
- * \param[in] fileout output ps file
- * \param[in] operation "w" for write; "a" for append
- * \param[in] x, y location of LL corner of image, in pixels, relative
- * to the PostScript origin (0,0) at the LL corner
- * of the page
- * \param[in] res resolution of the input image, in ppi;
- * use 0 for default
- * \param[in] scale scaling by printer; use 0.0 or 1.0 for no scaling
- * \param[in] pageno page number; must start with 1; you can use 0
- * if there is only one page.
- * \param[in] endpage boolean: use TRUE if this is the last image to be
- * added to the page; FALSE otherwise
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This outputs level 3 PS as flate compressed (overlaid
- * with ascii85 encoding).
- * (2) An output file can contain multiple pages, each with
- * multiple images. The arguments to convertFlateToPS()
- * allow you to control placement of png images on multiple
- * pages within a PostScript file.
- * (3) For the first image written to a file, use "w", which
- * opens for write and clears the file. For all subsequent
- * images written to that file, use "a".
- * (4) The (x, y) parameters give the LL corner of the image
- * relative to the LL corner of the page. They are in
- * units of pixels if scale = 1.0. If you use (e.g.)
- * scale = 2.0, the image is placed at (2x, 2y) on the page,
- * and the image dimensions are also doubled.
- * (5) Display vs printed resolution:
- * * If your display is 75 ppi and your image was created
- * at a resolution of 300 ppi, you can get the image
- * to print at the same size as it appears on your display
- * by either setting scale = 4.0 or by setting res = 75.
- * Both tell the printer to make a 4x enlarged image.
- * * If your image is generated at 150 ppi and you use scale = 1,
- * it will be rendered such that 150 pixels correspond
- * to 72 pts (1 inch on the printer). This function does
- * the conversion from pixels (with or without scaling) to
- * pts, which are the units that the printer uses.
- * * The printer will choose its own resolution to use
- * in rendering the image, which will not affect the size
- * of the rendered image. That is because the output
- * PostScript file describes the geometry in terms of pts,
- * which are defined to be 1/72 inch. The printer will
- * only see the size of the image in pts, through the
- * scale and translate parameters and the affine
- * transform (the ImageMatrix) of the image.
- * (6) To render multiple images on the same page, set
- * endpage = FALSE for each image until you get to the
- * last, for which you set endpage = TRUE. This causes the
- * "showpage" command to be invoked. Showpage outputs
- * the entire page and clears the raster buffer for the
- * next page to be added. Without a "showpage",
- * subsequent images from the next page will overlay those
- * previously put down.
- * (7) For multiple pages, increment the page number, starting
- * with page 1. This allows PostScript (and PDF) to build
- * a page directory, which viewers use for navigation.
- *
- */
-l_ok
-convertFlateToPS(const char *filein,
- const char *fileout,
- const char *operation,
- l_int32 x,
- l_int32 y,
- l_int32 res,
- l_float32 scale,
- l_int32 pageno,
- l_int32 endpage)
-{
-char *outstr;
-l_int32 nbytes, ret;
-
- PROCNAME("convertFlateToPS");
-
- if (!filein)
- return ERROR_INT("filein not defined", procName, 1);
- if (!fileout)
- return ERROR_INT("fileout not defined", procName, 1);
- if (strcmp(operation, "w") && strcmp(operation, "a"))
- return ERROR_INT("operation must be \"w\" or \"a\"", procName, 1);
-
- if (convertFlateToPSString(filein, &outstr, &nbytes, x, y, res, scale,
- pageno, endpage))
- return ERROR_INT("ps string not made", procName, 1);
-
- ret = l_binaryWrite(fileout, operation, outstr, nbytes);
- LEPT_FREE(outstr);
- if (ret) L_ERROR("ps string not written to file\n", procName);
- return ret;
-}
-
-
-/*!
- * \brief convertFlateToPSString()
- *
- * Generates level 3 PS string in flate compressed format.
- *
- * \param[in] filein input image file
- * \param[out] poutstr PS string
- * \param[out] pnbytes number of bytes in PS string
- * \param[in] x, y location of LL corner of image, in pixels, relative
- * to the PostScript origin (0,0) at the LL corner
- * of the page
- * \param[in] res resolution of the input image, in ppi;
- * use 0 for default
- * \param[in] scale scaling by printer; use 0.0 or 1.0 for no scaling
- * \param[in] pageno page number; must start with 1; you can use 0
- * if there is only one page.
- * \param[in] endpage boolean: use TRUE if this is the last image to be
- * added to the page; FALSE otherwise
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) The returned PS character array is a null-terminated
- * ascii string. All the raster data is ascii85 encoded, so
- * there are no null bytes embedded in it.
- * (2) The raster encoding is made with gzip, the same as that
- * in a png file that is compressed without prediction.
- * The raster data itself is 25% larger than that in the
- * binary form, due to the ascii85 encoding.
- *
- * Usage: See convertFlateToPS()
- *
- */
-static l_ok
-convertFlateToPSString(const char *filein,
- char **poutstr,
- l_int32 *pnbytes,
- l_int32 x,
- l_int32 y,
- l_int32 res,
- l_float32 scale,
- l_int32 pageno,
- l_int32 endpage)
-{
-char *outstr;
-l_float32 xpt, ypt, wpt, hpt;
-L_COMP_DATA *cid;
-
- PROCNAME("convertFlateToPSString");
-
- if (!poutstr)
- return ERROR_INT("&outstr not defined", procName, 1);
- if (!pnbytes)
- return ERROR_INT("&nbytes not defined", procName, 1);
- *pnbytes = 0;
- *poutstr = NULL;
- if (!filein)
- return ERROR_INT("filein not defined", procName, 1);
-
- if ((cid = l_generateFlateData(filein, 1)) == NULL)
- return ERROR_INT("flate data not made", procName, 1);
-
- /* Get scaled location in pts. Guess the input scan resolution
- * based on the input parameter %res, the resolution data in
- * the pix, and the size of the image. */
- if (scale == 0.0)
- scale = 1.0;
- if (res <= 0) {
- if (cid->res > 0)
- res = cid->res;
- else
- res = DefaultInputRes;
- }
- xpt = scale * x * 72. / res;
- ypt = scale * y * 72. / res;
- wpt = scale * cid->w * 72. / res;
- hpt = scale * cid->h * 72. / res;
-
- if (pageno == 0)
- pageno = 1;
-
-#if DEBUG_FLATE
- lept_stderr("w = %d, h = %d, bps = %d, spp = %d\n",
- cid->w, cid->h, cid->bps, cid->spp);
- lept_stderr("uncomp bytes = %ld, comp bytes = %ld, nbytes85 = %ld\n",
- (unsigned long)cid->nbytes, (unsigned long)cid->nbytescomp,
- (unsigned long)cid->nbytes85);
- lept_stderr("xpt = %7.2f, ypt = %7.2f, wpt = %7.2f, hpt = %7.2f\n",
- xpt, ypt, wpt, hpt);
-#endif /* DEBUG_FLATE */
-
- /* Generate the PS */
- outstr = generateFlatePS(NULL, cid, xpt, ypt, wpt, hpt, pageno, endpage);
- l_CIDataDestroy(&cid);
- if (!outstr)
- return ERROR_INT("outstr not made", procName, 1);
- *poutstr = outstr;
- *pnbytes = strlen(outstr);
- return 0;
-}
-
-
-/*!
- * \brief generateFlatePS()
- *
- * \param[in] filein [optional] input filename; can be null
- * \param[in] cid flate compressed image data
- * \param[in] xpt, ypt location of LL corner of image, in pts, relative
- * to the PostScript origin (0,0) at the LL corner
- * of the page
- * \param[in] wpt, hpt rendered image size in pts
- * \param[in] pageno page number; must start with 1; you can use 0
- * if there is only one page
- * \param[in] endpage boolean: use TRUE if this is the last image to be
- * added to the page; FALSE otherwise
- * \return PS string, or NULL on error
- */
-static char *
-generateFlatePS(const char *filein,
- L_COMP_DATA *cid,
- l_float32 xpt,
- l_float32 ypt,
- l_float32 wpt,
- l_float32 hpt,
- l_int32 pageno,
- l_int32 endpage)
-{
-l_int32 w, h, bps, spp;
-char *outstr;
-char bigbuf[Bufsize];
-SARRAY *sa;
-
- PROCNAME("generateFlatePS");
-
- if (!cid)
- return (char *)ERROR_PTR("flate data not defined", procName, NULL);
- w = cid->w;
- h = cid->h;
- bps = cid->bps;
- spp = cid->spp;
-
- sa = sarrayCreate(50);
- sarrayAddString(sa, "%!PS-Adobe-3.0 EPSF-3.0", L_COPY);
- sarrayAddString(sa, "%%Creator: leptonica", L_COPY);
- if (filein)
- snprintf(bigbuf, sizeof(bigbuf), "%%%%Title: %s", filein);
- else
- snprintf(bigbuf, sizeof(bigbuf), "%%%%Title: Flate compressed PS");
- sarrayAddString(sa, bigbuf, L_COPY);
- sarrayAddString(sa, "%%DocumentData: Clean7Bit", L_COPY);
-
- if (var_PS_WRITE_BOUNDING_BOX == 1) {
- snprintf(bigbuf, sizeof(bigbuf),
- "%%%%BoundingBox: %7.2f %7.2f %7.2f %7.2f",
- xpt, ypt, xpt + wpt, ypt + hpt);
- sarrayAddString(sa, bigbuf, L_COPY);
- }
-
- sarrayAddString(sa, "%%LanguageLevel: 3", L_COPY);
- sarrayAddString(sa, "%%EndComments", L_COPY);
- snprintf(bigbuf, sizeof(bigbuf), "%%%%Page: %d %d", pageno, pageno);
- sarrayAddString(sa, bigbuf, L_COPY);
-
- sarrayAddString(sa, "save", L_COPY);
- snprintf(bigbuf, sizeof(bigbuf),
- "%7.2f %7.2f translate %%set image origin in pts", xpt, ypt);
- sarrayAddString(sa, bigbuf, L_COPY);
-
- snprintf(bigbuf, sizeof(bigbuf),
- "%7.2f %7.2f scale %%set image size in pts", wpt, hpt);
- sarrayAddString(sa, bigbuf, L_COPY);
-
- /* If there is a colormap, add the data; it is now owned by sa */
- if (cid->cmapdata85) {
- snprintf(bigbuf, sizeof(bigbuf),
- "[ /Indexed /DeviceRGB %d %%set colormap type/size",
- cid->ncolors - 1);
- sarrayAddString(sa, bigbuf, L_COPY);
- sarrayAddString(sa, " <~", L_COPY);
- sarrayAddString(sa, cid->cmapdata85, L_INSERT);
- sarrayAddString(sa, " ] setcolorspace", L_COPY);
- } else if (spp == 1) {
- sarrayAddString(sa, "/DeviceGray setcolorspace", L_COPY);
- } else { /* spp == 3 */
- sarrayAddString(sa, "/DeviceRGB setcolorspace", L_COPY);
- }
-
- sarrayAddString(sa,
- "/RawData currentfile /ASCII85Decode filter def", L_COPY);
- sarrayAddString(sa,
- "/Data RawData << >> /FlateDecode filter def", L_COPY);
-
- sarrayAddString(sa, "{ << /ImageType 1", L_COPY);
- snprintf(bigbuf, sizeof(bigbuf), " /Width %d", w);
- sarrayAddString(sa, bigbuf, L_COPY);
- snprintf(bigbuf, sizeof(bigbuf), " /Height %d", h);
- sarrayAddString(sa, bigbuf, L_COPY);
- snprintf(bigbuf, sizeof(bigbuf), " /BitsPerComponent %d", bps);
- sarrayAddString(sa, bigbuf, L_COPY);
- snprintf(bigbuf, sizeof(bigbuf),
- " /ImageMatrix [ %d 0 0 %d 0 %d ]", w, -h, h);
- sarrayAddString(sa, bigbuf, L_COPY);
-
- if (cid->cmapdata85) {
- sarrayAddString(sa, " /Decode [0 255]", L_COPY);
- } else if (spp == 1) {
- if (bps == 1) /* miniswhite photometry */
- sarrayAddString(sa, " /Decode [1 0]", L_COPY);
- else /* bps > 1 */
- sarrayAddString(sa, " /Decode [0 1]", L_COPY);
- } else { /* spp == 3 */
- sarrayAddString(sa, " /Decode [0 1 0 1 0 1]", L_COPY);
- }
-
- sarrayAddString(sa, " /DataSource Data", L_COPY);
- sarrayAddString(sa, " >> image", L_COPY);
- sarrayAddString(sa, " Data closefile", L_COPY);
- sarrayAddString(sa, " RawData flushfile", L_COPY);
- if (endpage == TRUE)
- sarrayAddString(sa, " showpage", L_COPY);
- sarrayAddString(sa, " restore", L_COPY);
- sarrayAddString(sa, "} exec", L_COPY);
-
- /* Insert the ascii85 gzipped data; this is now owned by sa */
- sarrayAddString(sa, cid->data85, L_INSERT);
-
- /* Generate and return the output string */
- outstr = sarrayToString(sa, 1);
- sarrayDestroy(&sa);
- cid->cmapdata85 = NULL; /* it has been transferred to sa and destroyed */
- cid->data85 = NULL; /* it has been transferred to sa and destroyed */
- return outstr;
-}
-
-
-/*---------------------------------------------------------------------*
- * Write to memory *
- *---------------------------------------------------------------------*/
-/*!
- * \brief pixWriteMemPS()
- *
- * \param[out] pdata data of tiff compressed image
- * \param[out] psize size of returned data
- * \param[in] pix
- * \param[in] box [optional]
- * \param[in] res can use 0 for default of 300 ppi
- * \param[in] scale to prevent scaling, use either 1.0 or 0.0
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) See pixWriteStringPS() for usage.
- * (2) This is just a wrapper for pixWriteStringPS(), which
- * writes uncompressed image data to memory.
- *
- */
-l_ok
-pixWriteMemPS(l_uint8 **pdata,
- size_t *psize,
- PIX *pix,
- BOX *box,
- l_int32 res,
- l_float32 scale)
-{
- PROCNAME("pixWriteMemPS");
-
- if (!pdata)
- return ERROR_INT("&data not defined", procName, 1 );
- if (!psize)
- return ERROR_INT("&size not defined", procName, 1 );
- if (!pix)
- return ERROR_INT("&pix not defined", procName, 1 );
-
- *pdata = (l_uint8 *)pixWriteStringPS(pix, box, res, scale);
- *psize = strlen((char *)(*pdata));
- return 0;
-}
-
-
-/*-------------------------------------------------------------*
- * Converting resolution *
- *-------------------------------------------------------------*/
-/*!
- * \brief getResLetterPage()
- *
- * \param[in] w image width, pixels
- * \param[in] h image height, pixels
- * \param[in] fillfract fraction in linear dimension of full page,
- * not to be exceeded; use 0 for default
- * \return resolution
- */
-l_int32
-getResLetterPage(l_int32 w,
- l_int32 h,
- l_float32 fillfract)
-{
-l_int32 resw, resh, res;
-
- if (fillfract == 0.0)
- fillfract = DefaultFillFraction;
- resw = (l_int32)((w * 72.) / (LetterWidth * fillfract));
- resh = (l_int32)((h * 72.) / (LetterHeight * fillfract));
- res = L_MAX(resw, resh);
- return res;
-}
-
-
-/*!
- * \brief getResA4Page()
- *
- * \param[in] w image width, pixels
- * \param[in] h image height, pixels
- * \param[in] fillfract fraction in linear dimension of full page,
- * not to be exceeded; use 0 for default
- * \return resolution
- */
-l_int32
-getResA4Page(l_int32 w,
- l_int32 h,
- l_float32 fillfract)
-{
-l_int32 resw, resh, res;
-
- if (fillfract == 0.0)
- fillfract = DefaultFillFraction;
- resw = (l_int32)((w * 72.) / (A4Width * fillfract));
- resh = (l_int32)((h * 72.) / (A4Height * fillfract));
- res = L_MAX(resw, resh);
- return res;
-}
-
-
-/*-------------------------------------------------------------*
- * Setting flag for writing bounding box hint *
- *-------------------------------------------------------------*/
-void
-l_psWriteBoundingBox(l_int32 flag)
-{
- var_PS_WRITE_BOUNDING_BOX = flag;
-}
-
-
-/* --------------------------------------------*/
-#endif /* USE_PSIO */
-/* --------------------------------------------*/
diff --git a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/psio2stub.c b/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/psio2stub.c
deleted file mode 100644
index 8c96777e..00000000
--- a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/psio2stub.c
+++ /dev/null
@@ -1,160 +0,0 @@
-/*====================================================================*
- - Copyright (C) 2001 Leptonica. All rights reserved.
- -
- - Redistribution and use in source and binary forms, with or without
- - modification, are permitted provided that the following conditions
- - are met:
- - 1. Redistributions of source code must retain the above copyright
- - notice, this list of conditions and the following disclaimer.
- - 2. Redistributions in binary form must reproduce the above
- - copyright notice, this list of conditions and the following
- - disclaimer in the documentation and/or other materials
- - provided with the distribution.
- -
- - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- - ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- - LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- - A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL ANY
- - CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
- - EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
- - PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
- - PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
- - OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
- - NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- *====================================================================*/
-
-/*!
- * \file psio2stub.c
- *
- *
- * Stubs for psio2.c functions
- *
- */
-
-#ifdef HAVE_CONFIG_H
-#include
-#endif /* HAVE_CONFIG_H */
-
-#include "allheaders.h"
-
-/* --------------------------------------------*/
-#if !USE_PSIO /* defined in environ.h */
-/* --------------------------------------------*/
-
-l_ok pixWritePSEmbed(const char *filein, const char *fileout)
-{
- return ERROR_INT("function not present", "pixWritePSEmbed", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok pixWriteStreamPS(FILE *fp, PIX *pix, BOX *box, l_int32 res,
- l_float32 scale)
-{
- return ERROR_INT("function not present", "pixWriteStreamPS", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-char * pixWriteStringPS(PIX *pixs, BOX *box, l_int32 res, l_float32 scale)
-{
- return (char *)ERROR_PTR("function not present", "pixWriteStringPS", NULL);
-}
-
-/* ----------------------------------------------------------------------*/
-
-char * generateUncompressedPS(char *hexdata, l_int32 w, l_int32 h, l_int32 d,
- l_int32 psbpl, l_int32 bps, l_float32 xpt,
- l_float32 ypt, l_float32 wpt, l_float32 hpt,
- l_int32 boxflag)
-{
- return (char *)ERROR_PTR("function not present",
- "generateUncompressedPS", NULL);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok convertJpegToPSEmbed(const char *filein, const char *fileout)
-{
- return ERROR_INT("function not present", "convertJpegToPSEmbed", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok convertJpegToPS(const char *filein, const char *fileout,
- const char *operation, l_int32 x, l_int32 y,
- l_int32 res, l_float32 scale, l_int32 pageno,
- l_int32 endpage)
-{
- return ERROR_INT("function not present", "convertJpegToPS", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok convertG4ToPSEmbed(const char *filein, const char *fileout)
-{
- return ERROR_INT("function not present", "convertG4ToPSEmbed", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok convertG4ToPS(const char *filein, const char *fileout,
- const char *operation, l_int32 x, l_int32 y,
- l_int32 res, l_float32 scale, l_int32 pageno,
- l_int32 maskflag, l_int32 endpage)
-{
- return ERROR_INT("function not present", "convertG4ToPS", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok convertTiffMultipageToPS(const char *filein, const char *fileout,
- l_float32 fillfract)
-{
- return ERROR_INT("function not present", "convertTiffMultipageToPS", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok convertFlateToPSEmbed(const char *filein, const char *fileout)
-{
- return ERROR_INT("function not present", "convertFlateToPSEmbed", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok convertFlateToPS(const char *filein, const char *fileout,
- const char *operation, l_int32 x, l_int32 y,
- l_int32 res, l_float32 scale, l_int32 pageno,
- l_int32 endpage)
-{
- return ERROR_INT("function not present", "convertFlateToPS", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_ok pixWriteMemPS(l_uint8 **pdata, size_t *psize, PIX *pix, BOX *box,
- l_int32 res, l_float32 scale)
-{
- return ERROR_INT("function not present", "pixWriteMemPS", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-l_int32 getResLetterPage(l_int32 w, l_int32 h, l_float32 fillfract)
-{
- return ERROR_INT("function not present", "getResLetterPage", 1);
-}
-
-/* ----------------------------------------------------------------------*/
-
-void l_psWriteBoundingBox(l_int32 flag)
-{
- L_ERROR("function not present\n", "l_psWriteBoundingBox");
- return;
-}
-
-/* --------------------------------------------*/
-#endif /* !USE_PSIO */
-/* --------------------------------------------*/
diff --git a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/ptabasic.c b/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/ptabasic.c
deleted file mode 100644
index 62bad820..00000000
--- a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/ptabasic.c
+++ /dev/null
@@ -1,1553 +0,0 @@
-/*====================================================================*
- - Copyright (C) 2001 Leptonica. All rights reserved.
- -
- - Redistribution and use in source and binary forms, with or without
- - modification, are permitted provided that the following conditions
- - are met:
- - 1. Redistributions of source code must retain the above copyright
- - notice, this list of conditions and the following disclaimer.
- - 2. Redistributions in binary form must reproduce the above
- - copyright notice, this list of conditions and the following
- - disclaimer in the documentation and/or other materials
- - provided with the distribution.
- -
- - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- - ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- - LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- - A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL ANY
- - CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
- - EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
- - PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
- - PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
- - OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
- - NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- *====================================================================*/
-
-/*!
- * \file ptabasic.c
- *
- *
- * Pta creation, destruction, copy, clone, empty
- * PTA *ptaCreate()
- * PTA *ptaCreateFromNuma()
- * void ptaDestroy()
- * PTA *ptaCopy()
- * PTA *ptaCopyRange()
- * PTA *ptaClone()
- * l_int32 ptaEmpty()
- *
- * Pta array extension
- * l_int32 ptaAddPt()
- * static l_int32 ptaExtendArrays()
- *
- * Pta insertion and removal
- * l_int32 ptaInsertPt()
- * l_int32 ptaRemovePt()
- *
- * Pta accessors
- * l_int32 ptaGetRefcount()
- * l_int32 ptaChangeRefcount()
- * l_int32 ptaGetCount()
- * l_int32 ptaGetPt()
- * l_int32 ptaGetIPt()
- * l_int32 ptaSetPt()
- * l_int32 ptaGetArrays()
- *
- * Pta serialized for I/O
- * PTA *ptaRead()
- * PTA *ptaReadStream()
- * PTA *ptaReadMem()
- * l_int32 ptaWriteDebug()
- * l_int32 ptaWrite()
- * l_int32 ptaWriteStream()
- * l_int32 ptaWriteMem()
- *
- * Ptaa creation, destruction
- * PTAA *ptaaCreate()
- * void ptaaDestroy()
- *
- * Ptaa array extension
- * l_int32 ptaaAddPta()
- * static l_int32 ptaaExtendArray()
- *
- * Ptaa accessors
- * l_int32 ptaaGetCount()
- * l_int32 ptaaGetPta()
- * l_int32 ptaaGetPt()
- *
- * Ptaa array modifiers
- * l_int32 ptaaInitFull()
- * l_int32 ptaaReplacePta()
- * l_int32 ptaaAddPt()
- * l_int32 ptaaTruncate()
- *
- * Ptaa serialized for I/O
- * PTAA *ptaaRead()
- * PTAA *ptaaReadStream()
- * PTAA *ptaaReadMem()
- * l_int32 ptaaWrite()
- * l_int32 ptaaWriteStream()
- * l_int32 ptaaWriteMem()
- *
- */
-
-#ifdef HAVE_CONFIG_H
-#include
-#endif /* HAVE_CONFIG_H */
-
-#include
-#include "allheaders.h"
-
-static const l_uint32 MaxPtrArraySize = 10000000;
-static const l_int32 InitialPtrArraySize = 50; /*!< n'importe quoi */
-
- /* Static functions */
-static l_int32 ptaExtendArrays(PTA *pta);
-static l_int32 ptaaExtendArray(PTAA *ptaa);
-
-/*---------------------------------------------------------------------*
- * Pta creation, destruction, copy, clone *
- *---------------------------------------------------------------------*/
-/*!
- * \brief ptaCreate()
- *
- * \param[in] n initial array sizes
- * \return pta, or NULL on error.
- */
-PTA *
-ptaCreate(l_int32 n)
-{
-PTA *pta;
-
- PROCNAME("ptaCreate");
-
- if (n <= 0 || n > MaxPtrArraySize)
- n = InitialPtrArraySize;
-
- pta = (PTA *)LEPT_CALLOC(1, sizeof(PTA));
- pta->n = 0;
- pta->nalloc = n;
- ptaChangeRefcount(pta, 1); /* sets to 1 */
- pta->x = (l_float32 *)LEPT_CALLOC(n, sizeof(l_float32));
- pta->y = (l_float32 *)LEPT_CALLOC(n, sizeof(l_float32));
- if (!pta->x || !pta->y) {
- ptaDestroy(&pta);
- return (PTA *)ERROR_PTR("x and y arrays not both made", procName, NULL);
- }
-
- return pta;
-}
-
-
-/*!
- * \brief ptaCreateFromNuma()
- *
- * \param[in] nax [optional] can be null
- * \param[in] nay
- * \return pta, or NULL on error.
- */
-PTA *
-ptaCreateFromNuma(NUMA *nax,
- NUMA *nay)
-{
-l_int32 i, n;
-l_float32 startx, delx, xval, yval;
-PTA *pta;
-
- PROCNAME("ptaCreateFromNuma");
-
- if (!nay)
- return (PTA *)ERROR_PTR("nay not defined", procName, NULL);
- n = numaGetCount(nay);
- if (nax && numaGetCount(nax) != n)
- return (PTA *)ERROR_PTR("nax and nay sizes differ", procName, NULL);
-
- pta = ptaCreate(n);
- numaGetParameters(nay, &startx, &delx);
- for (i = 0; i < n; i++) {
- if (nax)
- numaGetFValue(nax, i, &xval);
- else /* use implicit x values from nay */
- xval = startx + i * delx;
- numaGetFValue(nay, i, &yval);
- ptaAddPt(pta, xval, yval);
- }
-
- return pta;
-}
-
-
-/*!
- * \brief ptaDestroy()
- *
- * \param[in,out] ppta will be set to null before returning
- * \return void
- *
- *
- * Notes:
- * (1) Decrements the ref count and, if 0, destroys the pta.
- * (2) Always nulls the input ptr.
- *
- */
-void
-ptaDestroy(PTA **ppta)
-{
-PTA *pta;
-
- PROCNAME("ptaDestroy");
-
- if (ppta == NULL) {
- L_WARNING("ptr address is NULL!\n", procName);
- return;
- }
-
- if ((pta = *ppta) == NULL)
- return;
-
- ptaChangeRefcount(pta, -1);
- if (ptaGetRefcount(pta) <= 0) {
- LEPT_FREE(pta->x);
- LEPT_FREE(pta->y);
- LEPT_FREE(pta);
- }
-
- *ppta = NULL;
- return;
-}
-
-
-/*!
- * \brief ptaCopy()
- *
- * \param[in] pta
- * \return copy of pta, or NULL on error
- */
-PTA *
-ptaCopy(PTA *pta)
-{
-l_int32 i;
-l_float32 x, y;
-PTA *npta;
-
- PROCNAME("ptaCopy");
-
- if (!pta)
- return (PTA *)ERROR_PTR("pta not defined", procName, NULL);
-
- if ((npta = ptaCreate(pta->nalloc)) == NULL)
- return (PTA *)ERROR_PTR("npta not made", procName, NULL);
-
- for (i = 0; i < pta->n; i++) {
- ptaGetPt(pta, i, &x, &y);
- ptaAddPt(npta, x, y);
- }
-
- return npta;
-}
-
-
-/*!
- * \brief ptaCopyRange()
- *
- * \param[in] ptas
- * \param[in] istart starting index in ptas
- * \param[in] iend ending index in ptas; use 0 to copy to end
- * \return 0 if OK, 1 on error
- */
-PTA *
-ptaCopyRange(PTA *ptas,
- l_int32 istart,
- l_int32 iend)
-{
-l_int32 n, i, x, y;
-PTA *ptad;
-
- PROCNAME("ptaCopyRange");
-
- if (!ptas)
- return (PTA *)ERROR_PTR("ptas not defined", procName, NULL);
- n = ptaGetCount(ptas);
- if (istart < 0)
- istart = 0;
- if (istart >= n)
- return (PTA *)ERROR_PTR("istart out of bounds", procName, NULL);
- if (iend <= 0 || iend >= n)
- iend = n - 1;
- if (istart > iend)
- return (PTA *)ERROR_PTR("istart > iend; no pts", procName, NULL);
-
- if ((ptad = ptaCreate(iend - istart + 1)) == NULL)
- return (PTA *)ERROR_PTR("ptad not made", procName, NULL);
- for (i = istart; i <= iend; i++) {
- ptaGetIPt(ptas, i, &x, &y);
- ptaAddPt(ptad, x, y);
- }
-
- return ptad;
-}
-
-
-/*!
- * \brief ptaClone()
- *
- * \param[in] pta
- * \return ptr to same pta, or NULL on error
- */
-PTA *
-ptaClone(PTA *pta)
-{
- PROCNAME("ptaClone");
-
- if (!pta)
- return (PTA *)ERROR_PTR("pta not defined", procName, NULL);
-
- ptaChangeRefcount(pta, 1);
- return pta;
-}
-
-
-/*!
- * \brief ptaEmpty()
- *
- * \param[in] pta
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * This only resets the Pta::n field, for reuse
- *
- */
-l_ok
-ptaEmpty(PTA *pta)
-{
- PROCNAME("ptaEmpty");
-
- if (!pta)
- return ERROR_INT("ptad not defined", procName, 1);
- pta->n = 0;
- return 0;
-}
-
-
-/*---------------------------------------------------------------------*
- * Pta array extension *
- *---------------------------------------------------------------------*/
-/*!
- * \brief ptaAddPt()
- *
- * \param[in] pta
- * \param[in] x, y
- * \return 0 if OK, 1 on error
- */
-l_ok
-ptaAddPt(PTA *pta,
- l_float32 x,
- l_float32 y)
-{
-l_int32 n;
-
- PROCNAME("ptaAddPt");
-
- if (!pta)
- return ERROR_INT("pta not defined", procName, 1);
-
- n = pta->n;
- if (n >= pta->nalloc)
- ptaExtendArrays(pta);
- pta->x[n] = x;
- pta->y[n] = y;
- pta->n++;
-
- return 0;
-}
-
-
-/*!
- * \brief ptaExtendArrays()
- *
- * \param[in] pta
- * \return 0 if OK; 1 on error
- */
-static l_int32
-ptaExtendArrays(PTA *pta)
-{
- PROCNAME("ptaExtendArrays");
-
- if (!pta)
- return ERROR_INT("pta not defined", procName, 1);
-
- if ((pta->x = (l_float32 *)reallocNew((void **)&pta->x,
- sizeof(l_float32) * pta->nalloc,
- 2 * sizeof(l_float32) * pta->nalloc)) == NULL)
- return ERROR_INT("new x array not returned", procName, 1);
- if ((pta->y = (l_float32 *)reallocNew((void **)&pta->y,
- sizeof(l_float32) * pta->nalloc,
- 2 * sizeof(l_float32) * pta->nalloc)) == NULL)
- return ERROR_INT("new y array not returned", procName, 1);
-
- pta->nalloc = 2 * pta->nalloc;
- return 0;
-}
-
-
-/*---------------------------------------------------------------------*
- * Pta insertion and removal *
- *---------------------------------------------------------------------*/
-/*!
- * \brief ptaInsertPt()
- *
- * \param[in] pta
- * \param[in] index at which pt is to be inserted
- * \param[in] x, y point values
- * \return 0 if OK; 1 on error
- */
-l_ok
-ptaInsertPt(PTA *pta,
- l_int32 index,
- l_int32 x,
- l_int32 y)
-{
-l_int32 i, n;
-
- PROCNAME("ptaInsertPt");
-
- if (!pta)
- return ERROR_INT("pta not defined", procName, 1);
- n = ptaGetCount(pta);
- if (index < 0 || index > n)
- return ERROR_INT("index not in {0...n}", procName, 1);
-
- if (n > pta->nalloc)
- ptaExtendArrays(pta);
- pta->n++;
- for (i = n; i > index; i--) {
- pta->x[i] = pta->x[i - 1];
- pta->y[i] = pta->y[i - 1];
- }
- pta->x[index] = x;
- pta->y[index] = y;
- return 0;
-}
-
-
-/*!
- * \brief ptaRemovePt()
- *
- * \param[in] pta
- * \param[in] index of point to be removed
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This shifts pta[i] --> pta[i - 1] for all i > index.
- * (2) It should not be used repeatedly on large arrays,
- * because the function is O(n).
- *
- */
-l_ok
-ptaRemovePt(PTA *pta,
- l_int32 index)
-{
-l_int32 i, n;
-
- PROCNAME("ptaRemovePt");
-
- if (!pta)
- return ERROR_INT("pta not defined", procName, 1);
- n = ptaGetCount(pta);
- if (index < 0 || index >= n)
- return ERROR_INT("index not in {0...n - 1}", procName, 1);
-
- /* Remove the point */
- for (i = index + 1; i < n; i++) {
- pta->x[i - 1] = pta->x[i];
- pta->y[i - 1] = pta->y[i];
- }
- pta->n--;
- return 0;
-}
-
-
-/*---------------------------------------------------------------------*
- * Pta accessors *
- *---------------------------------------------------------------------*/
-l_int32
-ptaGetRefcount(PTA *pta)
-{
- PROCNAME("ptaGetRefcount");
-
- if (!pta)
- return ERROR_INT("pta not defined", procName, 1);
- return pta->refcount;
-}
-
-
-l_int32
-ptaChangeRefcount(PTA *pta,
- l_int32 delta)
-{
- PROCNAME("ptaChangeRefcount");
-
- if (!pta)
- return ERROR_INT("pta not defined", procName, 1);
- pta->refcount += delta;
- return 0;
-}
-
-
-/*!
- * \brief ptaGetCount()
- *
- * \param[in] pta
- * \return count, or 0 if no pta
- */
-l_int32
-ptaGetCount(PTA *pta)
-{
- PROCNAME("ptaGetCount");
-
- if (!pta)
- return ERROR_INT("pta not defined", procName, 0);
-
- return pta->n;
-}
-
-
-/*!
- * \brief ptaGetPt()
- *
- * \param[in] pta
- * \param[in] index into arrays
- * \param[out] px [optional] float x value
- * \param[out] py [optional] float y value
- * \return 0 if OK; 1 on error
- */
-l_ok
-ptaGetPt(PTA *pta,
- l_int32 index,
- l_float32 *px,
- l_float32 *py)
-{
- PROCNAME("ptaGetPt");
-
- if (px) *px = 0;
- if (py) *py = 0;
- if (!pta)
- return ERROR_INT("pta not defined", procName, 1);
- if (index < 0 || index >= pta->n)
- return ERROR_INT("invalid index", procName, 1);
-
- if (px) *px = pta->x[index];
- if (py) *py = pta->y[index];
- return 0;
-}
-
-
-/*!
- * \brief ptaGetIPt()
- *
- * \param[in] pta
- * \param[in] index into arrays
- * \param[out] px [optional] integer x value
- * \param[out] py [optional] integer y value
- * \return 0 if OK; 1 on error
- */
-l_ok
-ptaGetIPt(PTA *pta,
- l_int32 index,
- l_int32 *px,
- l_int32 *py)
-{
- PROCNAME("ptaGetIPt");
-
- if (px) *px = 0;
- if (py) *py = 0;
- if (!pta)
- return ERROR_INT("pta not defined", procName, 1);
- if (index < 0 || index >= pta->n)
- return ERROR_INT("invalid index", procName, 1);
-
- if (px) *px = (l_int32)(pta->x[index] + 0.5);
- if (py) *py = (l_int32)(pta->y[index] + 0.5);
- return 0;
-}
-
-
-/*!
- * \brief ptaSetPt()
- *
- * \param[in] pta
- * \param[in] index into arrays
- * \param[in] x, y
- * \return 0 if OK; 1 on error
- */
-l_ok
-ptaSetPt(PTA *pta,
- l_int32 index,
- l_float32 x,
- l_float32 y)
-{
- PROCNAME("ptaSetPt");
-
- if (!pta)
- return ERROR_INT("pta not defined", procName, 1);
- if (index < 0 || index >= pta->n)
- return ERROR_INT("invalid index", procName, 1);
-
- pta->x[index] = x;
- pta->y[index] = y;
- return 0;
-}
-
-
-/*!
- * \brief ptaGetArrays()
- *
- * \param[in] pta
- * \param[out] pnax [optional] numa of x array
- * \param[out] pnay [optional] numa of y array
- * \return 0 if OK; 1 on error or if pta is empty
- *
- *
- * Notes:
- * (1) This copies the internal arrays into new Numas.
- *
- */
-l_ok
-ptaGetArrays(PTA *pta,
- NUMA **pnax,
- NUMA **pnay)
-{
-l_int32 i, n;
-NUMA *nax, *nay;
-
- PROCNAME("ptaGetArrays");
-
- if (!pnax && !pnay)
- return ERROR_INT("no output requested", procName, 1);
- if (pnax) *pnax = NULL;
- if (pnay) *pnay = NULL;
- if (!pta)
- return ERROR_INT("pta not defined", procName, 1);
- if ((n = ptaGetCount(pta)) == 0)
- return ERROR_INT("pta is empty", procName, 1);
-
- if (pnax) {
- if ((nax = numaCreate(n)) == NULL)
- return ERROR_INT("nax not made", procName, 1);
- *pnax = nax;
- for (i = 0; i < n; i++)
- nax->array[i] = pta->x[i];
- nax->n = n;
- }
- if (pnay) {
- if ((nay = numaCreate(n)) == NULL)
- return ERROR_INT("nay not made", procName, 1);
- *pnay = nay;
- for (i = 0; i < n; i++)
- nay->array[i] = pta->y[i];
- nay->n = n;
- }
- return 0;
-}
-
-
-/*---------------------------------------------------------------------*
- * Pta serialized for I/O *
- *---------------------------------------------------------------------*/
-/*!
- * \brief ptaRead()
- *
- * \param[in] filename
- * \return pta, or NULL on error
- */
-PTA *
-ptaRead(const char *filename)
-{
-FILE *fp;
-PTA *pta;
-
- PROCNAME("ptaRead");
-
- if (!filename)
- return (PTA *)ERROR_PTR("filename not defined", procName, NULL);
-
- if ((fp = fopenReadStream(filename)) == NULL)
- return (PTA *)ERROR_PTR("stream not opened", procName, NULL);
- pta = ptaReadStream(fp);
- fclose(fp);
- if (!pta)
- return (PTA *)ERROR_PTR("pta not read", procName, NULL);
- return pta;
-}
-
-
-/*!
- * \brief ptaReadStream()
- *
- * \param[in] fp file stream
- * \return pta, or NULL on error
- */
-PTA *
-ptaReadStream(FILE *fp)
-{
-char typestr[128]; /* hardcoded below in fscanf */
-l_int32 i, n, ix, iy, type, version;
-l_float32 x, y;
-PTA *pta;
-
- PROCNAME("ptaReadStream");
-
- if (!fp)
- return (PTA *)ERROR_PTR("stream not defined", procName, NULL);
-
- if (fscanf(fp, "\n Pta Version %d\n", &version) != 1)
- return (PTA *)ERROR_PTR("not a pta file", procName, NULL);
- if (version != PTA_VERSION_NUMBER)
- return (PTA *)ERROR_PTR("invalid pta version", procName, NULL);
- if (fscanf(fp, " Number of pts = %d; format = %127s\n", &n, typestr) != 2)
- return (PTA *)ERROR_PTR("not a pta file", procName, NULL);
- if (!strcmp(typestr, "float"))
- type = 0;
- else /* typestr is "integer" */
- type = 1;
-
- if ((pta = ptaCreate(n)) == NULL)
- return (PTA *)ERROR_PTR("pta not made", procName, NULL);
- for (i = 0; i < n; i++) {
- if (type == 0) { /* data is float */
- if (fscanf(fp, " (%f, %f)\n", &x, &y) != 2) {
- ptaDestroy(&pta);
- return (PTA *)ERROR_PTR("error reading floats", procName, NULL);
- }
- ptaAddPt(pta, x, y);
- } else { /* data is integer */
- if (fscanf(fp, " (%d, %d)\n", &ix, &iy) != 2) {
- ptaDestroy(&pta);
- return (PTA *)ERROR_PTR("error reading ints", procName, NULL);
- }
- ptaAddPt(pta, ix, iy);
- }
- }
-
- return pta;
-}
-
-
-/*!
- * \brief ptaReadMem()
- *
- * \param[in] data serialization in ascii
- * \param[in] size of data in bytes; can use strlen to get it
- * \return pta, or NULL on error
- */
-PTA *
-ptaReadMem(const l_uint8 *data,
- size_t size)
-{
-FILE *fp;
-PTA *pta;
-
- PROCNAME("ptaReadMem");
-
- if (!data)
- return (PTA *)ERROR_PTR("data not defined", procName, NULL);
- if ((fp = fopenReadFromMemory(data, size)) == NULL)
- return (PTA *)ERROR_PTR("stream not opened", procName, NULL);
-
- pta = ptaReadStream(fp);
- fclose(fp);
- if (!pta) L_ERROR("pta not read\n", procName);
- return pta;
-}
-
-
-/*!
- * \brief ptaWriteDebug()
- *
- * \param[in] filename
- * \param[in] pta
- * \param[in] type 0 for float values; 1 for integer values
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) Debug version, intended for use in the library when writing
- * to files in a temp directory with names that are compiled in.
- * This is used instead of ptaWrite() for all such library calls.
- * (2) The global variable LeptDebugOK defaults to 0, and can be set
- * or cleared by the function setLeptDebugOK().
- *
- */
-l_ok
-ptaWriteDebug(const char *filename,
- PTA *pta,
- l_int32 type)
-{
- PROCNAME("ptaWriteDebug");
-
- if (LeptDebugOK) {
- return ptaWrite(filename, pta, type);
- } else {
- L_INFO("write to named temp file %s is disabled\n", procName, filename);
- return 0;
- }
-}
-
-
-/*!
- * \brief ptaWrite()
- *
- * \param[in] filename
- * \param[in] pta
- * \param[in] type 0 for float values; 1 for integer values
- * \return 0 if OK, 1 on error
- */
-l_ok
-ptaWrite(const char *filename,
- PTA *pta,
- l_int32 type)
-{
-l_int32 ret;
-FILE *fp;
-
- PROCNAME("ptaWrite");
-
- if (!filename)
- return ERROR_INT("filename not defined", procName, 1);
- if (!pta)
- return ERROR_INT("pta not defined", procName, 1);
-
- if ((fp = fopenWriteStream(filename, "w")) == NULL)
- return ERROR_INT("stream not opened", procName, 1);
- ret = ptaWriteStream(fp, pta, type);
- fclose(fp);
- if (ret)
- return ERROR_INT("pta not written to stream", procName, 1);
- return 0;
-}
-
-
-/*!
- * \brief ptaWriteStream()
- *
- * \param[in] fp file stream
- * \param[in] pta
- * \param[in] type 0 for float values; 1 for integer values
- * \return 0 if OK; 1 on error
- */
-l_ok
-ptaWriteStream(FILE *fp,
- PTA *pta,
- l_int32 type)
-{
-l_int32 i, n, ix, iy;
-l_float32 x, y;
-
- PROCNAME("ptaWriteStream");
-
- if (!fp)
- return ERROR_INT("stream not defined", procName, 1);
- if (!pta)
- return ERROR_INT("pta not defined", procName, 1);
-
- n = ptaGetCount(pta);
- fprintf(fp, "\n Pta Version %d\n", PTA_VERSION_NUMBER);
- if (type == 0)
- fprintf(fp, " Number of pts = %d; format = float\n", n);
- else /* type == 1 */
- fprintf(fp, " Number of pts = %d; format = integer\n", n);
- for (i = 0; i < n; i++) {
- if (type == 0) { /* data is float */
- ptaGetPt(pta, i, &x, &y);
- fprintf(fp, " (%f, %f)\n", x, y);
- } else { /* data is integer */
- ptaGetIPt(pta, i, &ix, &iy);
- fprintf(fp, " (%d, %d)\n", ix, iy);
- }
- }
-
- return 0;
-}
-
-
-/*!
- * \brief ptaWriteMem()
- *
- * \param[out] pdata data of serialized pta; ascii
- * \param[out] psize size of returned data
- * \param[in] pta
- * \param[in] type 0 for float values; 1 for integer values
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) Serializes a pta in memory and puts the result in a buffer.
- *
- */
-l_ok
-ptaWriteMem(l_uint8 **pdata,
- size_t *psize,
- PTA *pta,
- l_int32 type)
-{
-l_int32 ret;
-FILE *fp;
-
- PROCNAME("ptaWriteMem");
-
- if (pdata) *pdata = NULL;
- if (psize) *psize = 0;
- if (!pdata)
- return ERROR_INT("&data not defined", procName, 1);
- if (!psize)
- return ERROR_INT("&size not defined", procName, 1);
- if (!pta)
- return ERROR_INT("pta not defined", procName, 1);
-
-#if HAVE_FMEMOPEN
- if ((fp = open_memstream((char **)pdata, psize)) == NULL)
- return ERROR_INT("stream not opened", procName, 1);
- ret = ptaWriteStream(fp, pta, type);
-#else
- L_INFO("work-around: writing to a temp file\n", procName);
- #ifdef _WIN32
- if ((fp = fopenWriteWinTempfile()) == NULL)
- return ERROR_INT("tmpfile stream not opened", procName, 1);
- #else
- if ((fp = tmpfile()) == NULL)
- return ERROR_INT("tmpfile stream not opened", procName, 1);
- #endif /* _WIN32 */
- ret = ptaWriteStream(fp, pta, type);
- rewind(fp);
- *pdata = l_binaryReadStream(fp, psize);
-#endif /* HAVE_FMEMOPEN */
- fclose(fp);
- return ret;
-}
-
-
-/*---------------------------------------------------------------------*
- * PTAA creation, destruction *
- *---------------------------------------------------------------------*/
-/*!
- * \brief ptaaCreate()
- *
- * \param[in] n initial number of ptrs
- * \return ptaa, or NULL on error
- */
-PTAA *
-ptaaCreate(l_int32 n)
-{
-PTAA *ptaa;
-
- PROCNAME("ptaaCreate");
-
- if (n <= 0 || n > MaxPtrArraySize)
- n = InitialPtrArraySize;
-
- ptaa = (PTAA *)LEPT_CALLOC(1, sizeof(PTAA));
- ptaa->n = 0;
- ptaa->nalloc = n;
- if ((ptaa->pta = (PTA **)LEPT_CALLOC(n, sizeof(PTA *))) == NULL) {
- ptaaDestroy(&ptaa);
- return (PTAA *)ERROR_PTR("pta ptrs not made", procName, NULL);
- }
- return ptaa;
-}
-
-
-/*!
- * \brief ptaaDestroy()
- *
- * \param[in,out] pptaa will be set to null before returning
- * \return void
- */
-void
-ptaaDestroy(PTAA **pptaa)
-{
-l_int32 i;
-PTAA *ptaa;
-
- PROCNAME("ptaaDestroy");
-
- if (pptaa == NULL) {
- L_WARNING("ptr address is NULL!\n", procName);
- return;
- }
-
- if ((ptaa = *pptaa) == NULL)
- return;
-
- for (i = 0; i < ptaa->n; i++)
- ptaDestroy(&ptaa->pta[i]);
- LEPT_FREE(ptaa->pta);
-
- LEPT_FREE(ptaa);
- *pptaa = NULL;
- return;
-}
-
-
-/*---------------------------------------------------------------------*
- * PTAA array extension *
- *---------------------------------------------------------------------*/
-/*!
- * \brief ptaaAddPta()
- *
- * \param[in] ptaa
- * \param[in] pta to be added
- * \param[in] copyflag L_INSERT, L_COPY, L_CLONE
- * \return 0 if OK, 1 on error
- */
-l_ok
-ptaaAddPta(PTAA *ptaa,
- PTA *pta,
- l_int32 copyflag)
-{
-l_int32 n;
-PTA *ptac;
-
- PROCNAME("ptaaAddPta");
-
- if (!ptaa)
- return ERROR_INT("ptaa not defined", procName, 1);
- if (!pta)
- return ERROR_INT("pta not defined", procName, 1);
-
- if (copyflag == L_INSERT) {
- ptac = pta;
- } else if (copyflag == L_COPY) {
- if ((ptac = ptaCopy(pta)) == NULL)
- return ERROR_INT("ptac not made", procName, 1);
- } else if (copyflag == L_CLONE) {
- if ((ptac = ptaClone(pta)) == NULL)
- return ERROR_INT("pta clone not made", procName, 1);
- } else {
- return ERROR_INT("invalid copyflag", procName, 1);
- }
-
- n = ptaaGetCount(ptaa);
- if (n >= ptaa->nalloc)
- ptaaExtendArray(ptaa);
- ptaa->pta[n] = ptac;
- ptaa->n++;
-
- return 0;
-}
-
-
-/*!
- * \brief ptaaExtendArray()
- *
- * \param[in] ptaa
- * \return 0 if OK, 1 on error
- */
-static l_int32
-ptaaExtendArray(PTAA *ptaa)
-{
- PROCNAME("ptaaExtendArray");
-
- if (!ptaa)
- return ERROR_INT("ptaa not defined", procName, 1);
-
- if ((ptaa->pta = (PTA **)reallocNew((void **)&ptaa->pta,
- sizeof(PTA *) * ptaa->nalloc,
- 2 * sizeof(PTA *) * ptaa->nalloc)) == NULL)
- return ERROR_INT("new ptr array not returned", procName, 1);
-
- ptaa->nalloc = 2 * ptaa->nalloc;
- return 0;
-}
-
-
-/*---------------------------------------------------------------------*
- * Ptaa accessors *
- *---------------------------------------------------------------------*/
-/*!
- * \brief ptaaGetCount()
- *
- * \param[in] ptaa
- * \return count, or 0 if no ptaa
- */
-l_int32
-ptaaGetCount(PTAA *ptaa)
-{
- PROCNAME("ptaaGetCount");
-
- if (!ptaa)
- return ERROR_INT("ptaa not defined", procName, 0);
-
- return ptaa->n;
-}
-
-
-/*!
- * \brief ptaaGetPta()
- *
- * \param[in] ptaa
- * \param[in] index to the i-th pta
- * \param[in] accessflag L_COPY or L_CLONE
- * \return pta, or NULL on error
- */
-PTA *
-ptaaGetPta(PTAA *ptaa,
- l_int32 index,
- l_int32 accessflag)
-{
- PROCNAME("ptaaGetPta");
-
- if (!ptaa)
- return (PTA *)ERROR_PTR("ptaa not defined", procName, NULL);
- if (index < 0 || index >= ptaa->n)
- return (PTA *)ERROR_PTR("index not valid", procName, NULL);
-
- if (accessflag == L_COPY)
- return ptaCopy(ptaa->pta[index]);
- else if (accessflag == L_CLONE)
- return ptaClone(ptaa->pta[index]);
- else
- return (PTA *)ERROR_PTR("invalid accessflag", procName, NULL);
-}
-
-
-/*!
- * \brief ptaaGetPt()
- *
- * \param[in] ptaa
- * \param[in] ipta to the i-th pta
- * \param[in] jpt index to the j-th pt in the pta
- * \param[out] px [optional] float x value
- * \param[out] py [optional] float y value
- * \return 0 if OK; 1 on error
- */
-l_ok
-ptaaGetPt(PTAA *ptaa,
- l_int32 ipta,
- l_int32 jpt,
- l_float32 *px,
- l_float32 *py)
-{
-PTA *pta;
-
- PROCNAME("ptaaGetPt");
-
- if (px) *px = 0;
- if (py) *py = 0;
- if (!ptaa)
- return ERROR_INT("ptaa not defined", procName, 1);
- if (ipta < 0 || ipta >= ptaa->n)
- return ERROR_INT("index ipta not valid", procName, 1);
-
- pta = ptaaGetPta(ptaa, ipta, L_CLONE);
- if (jpt < 0 || jpt >= pta->n) {
- ptaDestroy(&pta);
- return ERROR_INT("index jpt not valid", procName, 1);
- }
-
- ptaGetPt(pta, jpt, px, py);
- ptaDestroy(&pta);
- return 0;
-}
-
-
-/*---------------------------------------------------------------------*
- * Ptaa array modifiers *
- *---------------------------------------------------------------------*/
-/*!
- * \brief ptaaInitFull()
- *
- * \param[in] ptaa can have non-null ptrs in the ptr array
- * \param[in] pta to be replicated into the entire ptr array
- * \return 0 if OK; 1 on error
- */
-l_ok
-ptaaInitFull(PTAA *ptaa,
- PTA *pta)
-{
-l_int32 n, i;
-PTA *ptat;
-
- PROCNAME("ptaaInitFull");
-
- if (!ptaa)
- return ERROR_INT("ptaa not defined", procName, 1);
- if (!pta)
- return ERROR_INT("pta not defined", procName, 1);
-
- n = ptaa->nalloc;
- ptaa->n = n;
- for (i = 0; i < n; i++) {
- ptat = ptaCopy(pta);
- ptaaReplacePta(ptaa, i, ptat);
- }
- return 0;
-}
-
-
-/*!
- * \brief ptaaReplacePta()
- *
- * \param[in] ptaa
- * \param[in] index to the index-th pta
- * \param[in] pta insert and replace any existing one
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) Any existing pta is destroyed, and the input one
- * is inserted in its place.
- * (2) If %index is invalid, return 1 (error)
- *
- */
-l_ok
-ptaaReplacePta(PTAA *ptaa,
- l_int32 index,
- PTA *pta)
-{
-l_int32 n;
-
- PROCNAME("ptaaReplacePta");
-
- if (!ptaa)
- return ERROR_INT("ptaa not defined", procName, 1);
- if (!pta)
- return ERROR_INT("pta not defined", procName, 1);
- n = ptaaGetCount(ptaa);
- if (index < 0 || index >= n)
- return ERROR_INT("index not valid", procName, 1);
-
- ptaDestroy(&ptaa->pta[index]);
- ptaa->pta[index] = pta;
- return 0;
-}
-
-
-/*!
- * \brief ptaaAddPt()
- *
- * \param[in] ptaa
- * \param[in] ipta to the i-th pta
- * \param[in] x,y point coordinates
- * \return 0 if OK; 1 on error
- */
-l_ok
-ptaaAddPt(PTAA *ptaa,
- l_int32 ipta,
- l_float32 x,
- l_float32 y)
-{
-PTA *pta;
-
- PROCNAME("ptaaAddPt");
-
- if (!ptaa)
- return ERROR_INT("ptaa not defined", procName, 1);
- if (ipta < 0 || ipta >= ptaa->n)
- return ERROR_INT("index ipta not valid", procName, 1);
-
- pta = ptaaGetPta(ptaa, ipta, L_CLONE);
- ptaAddPt(pta, x, y);
- ptaDestroy(&pta);
- return 0;
-}
-
-
-/*!
- * \brief ptaaTruncate()
- *
- * \param[in] ptaa
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This identifies the largest index containing a pta that
- * has any points within it, destroys all pta above that index,
- * and resets the count.
- *
- */
-l_ok
-ptaaTruncate(PTAA *ptaa)
-{
-l_int32 i, n, np;
-PTA *pta;
-
- PROCNAME("ptaaTruncate");
-
- if (!ptaa)
- return ERROR_INT("ptaa not defined", procName, 1);
-
- n = ptaaGetCount(ptaa);
- for (i = n - 1; i >= 0; i--) {
- pta = ptaaGetPta(ptaa, i, L_CLONE);
- if (!pta) {
- ptaa->n--;
- continue;
- }
- np = ptaGetCount(pta);
- ptaDestroy(&pta);
- if (np == 0) {
- ptaDestroy(&ptaa->pta[i]);
- ptaa->n--;
- } else {
- break;
- }
- }
- return 0;
-}
-
-
-/*---------------------------------------------------------------------*
- * Ptaa serialized for I/O *
- *---------------------------------------------------------------------*/
-/*!
- * \brief ptaaRead()
- *
- * \param[in] filename
- * \return ptaa, or NULL on error
- */
-PTAA *
-ptaaRead(const char *filename)
-{
-FILE *fp;
-PTAA *ptaa;
-
- PROCNAME("ptaaRead");
-
- if (!filename)
- return (PTAA *)ERROR_PTR("filename not defined", procName, NULL);
-
- if ((fp = fopenReadStream(filename)) == NULL)
- return (PTAA *)ERROR_PTR("stream not opened", procName, NULL);
- ptaa = ptaaReadStream(fp);
- fclose(fp);
- if (!ptaa)
- return (PTAA *)ERROR_PTR("ptaa not read", procName, NULL);
- return ptaa;
-}
-
-
-/*!
- * \brief ptaaReadStream()
- *
- * \param[in] fp file stream
- * \return ptaa, or NULL on error
- */
-PTAA *
-ptaaReadStream(FILE *fp)
-{
-l_int32 i, n, version;
-PTA *pta;
-PTAA *ptaa;
-
- PROCNAME("ptaaReadStream");
-
- if (!fp)
- return (PTAA *)ERROR_PTR("stream not defined", procName, NULL);
-
- if (fscanf(fp, "\nPtaa Version %d\n", &version) != 1)
- return (PTAA *)ERROR_PTR("not a ptaa file", procName, NULL);
- if (version != PTA_VERSION_NUMBER)
- return (PTAA *)ERROR_PTR("invalid ptaa version", procName, NULL);
- if (fscanf(fp, "Number of Pta = %d\n", &n) != 1)
- return (PTAA *)ERROR_PTR("not a ptaa file", procName, NULL);
-
- if ((ptaa = ptaaCreate(n)) == NULL)
- return (PTAA *)ERROR_PTR("ptaa not made", procName, NULL);
- for (i = 0; i < n; i++) {
- if ((pta = ptaReadStream(fp)) == NULL) {
- ptaaDestroy(&ptaa);
- return (PTAA *)ERROR_PTR("error reading pta", procName, NULL);
- }
- ptaaAddPta(ptaa, pta, L_INSERT);
- }
-
- return ptaa;
-}
-
-
-/*!
- * \brief ptaaReadMem()
- *
- * \param[in] data serialization in ascii
- * \param[in] size of data in bytes; can use strlen to get it
- * \return ptaa, or NULL on error
- */
-PTAA *
-ptaaReadMem(const l_uint8 *data,
- size_t size)
-{
-FILE *fp;
-PTAA *ptaa;
-
- PROCNAME("ptaaReadMem");
-
- if (!data)
- return (PTAA *)ERROR_PTR("data not defined", procName, NULL);
- if ((fp = fopenReadFromMemory(data, size)) == NULL)
- return (PTAA *)ERROR_PTR("stream not opened", procName, NULL);
-
- ptaa = ptaaReadStream(fp);
- fclose(fp);
- if (!ptaa) L_ERROR("ptaa not read\n", procName);
- return ptaa;
-}
-
-
-/*!
- * \brief ptaaWriteDebug()
- *
- * \param[in] filename
- * \param[in] ptaa
- * \param[in] type 0 for float values; 1 for integer values
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) Debug version, intended for use in the library when writing
- * to files in a temp directory with names that are compiled in.
- * This is used instead of ptaaWrite() for all such library calls.
- * (2) The global variable LeptDebugOK defaults to 0, and can be set
- * or cleared by the function setLeptDebugOK().
- *
- */
-l_ok
-ptaaWriteDebug(const char *filename,
- PTAA *ptaa,
- l_int32 type)
-{
- PROCNAME("ptaaWriteDebug");
-
- if (LeptDebugOK) {
- return ptaaWrite(filename, ptaa, type);
- } else {
- L_INFO("write to named temp file %s is disabled\n", procName, filename);
- return 0;
- }
-}
-
-
-/*!
- * \brief ptaaWrite()
- *
- * \param[in] filename
- * \param[in] ptaa
- * \param[in] type 0 for float values; 1 for integer values
- * \return 0 if OK, 1 on error
- */
-l_ok
-ptaaWrite(const char *filename,
- PTAA *ptaa,
- l_int32 type)
-{
-l_int32 ret;
-FILE *fp;
-
- PROCNAME("ptaaWrite");
-
- if (!filename)
- return ERROR_INT("filename not defined", procName, 1);
- if (!ptaa)
- return ERROR_INT("ptaa not defined", procName, 1);
-
- if ((fp = fopenWriteStream(filename, "w")) == NULL)
- return ERROR_INT("stream not opened", procName, 1);
- ret = ptaaWriteStream(fp, ptaa, type);
- fclose(fp);
- if (ret)
- return ERROR_INT("ptaa not written to stream", procName, 1);
- return 0;
-}
-
-
-/*!
- * \brief ptaaWriteStream()
- *
- * \param[in] fp file stream
- * \param[in] ptaa
- * \param[in] type 0 for float values; 1 for integer values
- * \return 0 if OK; 1 on error
- */
-l_ok
-ptaaWriteStream(FILE *fp,
- PTAA *ptaa,
- l_int32 type)
-{
-l_int32 i, n;
-PTA *pta;
-
- PROCNAME("ptaaWriteStream");
-
- if (!fp)
- return ERROR_INT("stream not defined", procName, 1);
- if (!ptaa)
- return ERROR_INT("ptaa not defined", procName, 1);
-
- n = ptaaGetCount(ptaa);
- fprintf(fp, "\nPtaa Version %d\n", PTA_VERSION_NUMBER);
- fprintf(fp, "Number of Pta = %d\n", n);
- for (i = 0; i < n; i++) {
- pta = ptaaGetPta(ptaa, i, L_CLONE);
- ptaWriteStream(fp, pta, type);
- ptaDestroy(&pta);
- }
-
- return 0;
-}
-
-
-/*!
- * \brief ptaaWriteMem()
- *
- * \param[out] pdata data of serialized ptaa; ascii
- * \param[out] psize size of returned data
- * \param[in] ptaa
- * \param[in] type 0 for float values; 1 for integer values
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) Serializes %ptaa in memory and puts the result in a buffer.
- *
- */
-l_ok
-ptaaWriteMem(l_uint8 **pdata,
- size_t *psize,
- PTAA *ptaa,
- l_int32 type)
-{
-l_int32 ret;
-FILE *fp;
-
- PROCNAME("ptaaWriteMem");
-
- if (pdata) *pdata = NULL;
- if (psize) *psize = 0;
- if (!pdata)
- return ERROR_INT("&data not defined", procName, 1);
- if (!psize)
- return ERROR_INT("&size not defined", procName, 1);
- if (!ptaa)
- return ERROR_INT("ptaa not defined", procName, 1);
-
-#if HAVE_FMEMOPEN
- if ((fp = open_memstream((char **)pdata, psize)) == NULL)
- return ERROR_INT("stream not opened", procName, 1);
- ret = ptaaWriteStream(fp, ptaa, type);
-#else
- L_INFO("work-around: writing to a temp file\n", procName);
- #ifdef _WIN32
- if ((fp = fopenWriteWinTempfile()) == NULL)
- return ERROR_INT("tmpfile stream not opened", procName, 1);
- #else
- if ((fp = tmpfile()) == NULL)
- return ERROR_INT("tmpfile stream not opened", procName, 1);
- #endif /* _WIN32 */
- ret = ptaaWriteStream(fp, ptaa, type);
- rewind(fp);
- *pdata = l_binaryReadStream(fp, psize);
-#endif /* HAVE_FMEMOPEN */
- fclose(fp);
- return ret;
-}
diff --git a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/ptafunc1.c b/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/ptafunc1.c
deleted file mode 100644
index 8dfcd8a1..00000000
--- a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/ptafunc1.c
+++ /dev/null
@@ -1,2667 +0,0 @@
-/*====================================================================*
- - Copyright (C) 2001 Leptonica. All rights reserved.
- -
- - Redistribution and use in source and binary forms, with or without
- - modification, are permitted provided that the following conditions
- - are met:
- - 1. Redistributions of source code must retain the above copyright
- - notice, this list of conditions and the following disclaimer.
- - 2. Redistributions in binary form must reproduce the above
- - copyright notice, this list of conditions and the following
- - disclaimer in the documentation and/or other materials
- - provided with the distribution.
- -
- - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- - ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- - LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- - A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL ANY
- - CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
- - EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
- - PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
- - PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
- - OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
- - NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- *====================================================================*/
-
-/*!
- * \file ptafunc1.c
- *
- *
- * --------------------------------------
- * This file has these Pta utilities:
- * - simple rearrangements
- * - geometric analysis
- * - min/max and filtering
- * - least squares fitting
- * - interconversions with Pix and Numa
- * - display into a pix
- * --------------------------------------
- *
- * Simple rearrangements
- * PTA *ptaSubsample()
- * l_int32 ptaJoin()
- * l_int32 ptaaJoin()
- * PTA *ptaReverse()
- * PTA *ptaTranspose()
- * PTA *ptaCyclicPerm()
- * PTA *ptaSelectRange()
- *
- * Geometric
- * BOX *ptaGetBoundingRegion()
- * l_int32 *ptaGetRange()
- * PTA *ptaGetInsideBox()
- * PTA *pixFindCornerPixels()
- * l_int32 ptaContainsPt()
- * l_int32 ptaTestIntersection()
- * PTA *ptaTransform()
- * l_int32 ptaPtInsidePolygon()
- * l_float32 l_angleBetweenVectors()
- *
- * Min/max and filtering
- * l_int32 ptaGetMinMax()
- * PTA *ptaSelectByValue()
- * PTA *ptaCropToMask()
- *
- * Least Squares Fit
- * l_int32 ptaGetLinearLSF()
- * l_int32 ptaGetQuadraticLSF()
- * l_int32 ptaGetCubicLSF()
- * l_int32 ptaGetQuarticLSF()
- * l_int32 ptaNoisyLinearLSF()
- * l_int32 ptaNoisyQuadraticLSF()
- * l_int32 applyLinearFit()
- * l_int32 applyQuadraticFit()
- * l_int32 applyCubicFit()
- * l_int32 applyQuarticFit()
- *
- * Interconversions with Pix
- * l_int32 pixPlotAlongPta()
- * PTA *ptaGetPixelsFromPix()
- * PIX *pixGenerateFromPta()
- * PTA *ptaGetBoundaryPixels()
- * PTAA *ptaaGetBoundaryPixels()
- * PTAA *ptaaIndexLabeledPixels()
- * PTA *ptaGetNeighborPixLocs()
- *
- * Interconversion with Numa
- * PTA *numaConvertToPta1()
- * PTA *numaConvertToPta2()
- * l_int32 ptaConvertToNuma()
- *
- * Display Pta and Ptaa
- * PIX *pixDisplayPta()
- * PIX *pixDisplayPtaaPattern()
- * PIX *pixDisplayPtaPattern()
- * PTA *ptaReplicatePattern()
- * PIX *pixDisplayPtaa()
- *
- */
-
-#ifdef HAVE_CONFIG_H
-#include
-#endif /* HAVE_CONFIG_H */
-
-#include
-#include "allheaders.h"
-
-#ifndef M_PI
-#define M_PI 3.14159265358979323846
-#endif /* M_PI */
-
-/*---------------------------------------------------------------------*
- * Simple rearrangements *
- *---------------------------------------------------------------------*/
-/*!
- * \brief ptaSubsample()
- *
- * \param[in] ptas
- * \param[in] subfactor subsample factor, >= 1
- * \return ptad evenly sampled pt values from ptas, or NULL on error
- */
-PTA *
-ptaSubsample(PTA *ptas,
- l_int32 subfactor)
-{
-l_int32 n, i;
-l_float32 x, y;
-PTA *ptad;
-
- PROCNAME("pixSubsample");
-
- if (!ptas)
- return (PTA *)ERROR_PTR("ptas not defined", procName, NULL);
- if (subfactor < 1)
- return (PTA *)ERROR_PTR("subfactor < 1", procName, NULL);
-
- ptad = ptaCreate(0);
- n = ptaGetCount(ptas);
- for (i = 0; i < n; i++) {
- if (i % subfactor != 0) continue;
- ptaGetPt(ptas, i, &x, &y);
- ptaAddPt(ptad, x, y);
- }
-
- return ptad;
-}
-
-
-/*!
- * \brief ptaJoin()
- *
- * \param[in] ptad dest pta; add to this one
- * \param[in] ptas source pta; add from this one
- * \param[in] istart starting index in ptas
- * \param[in] iend ending index in ptas; use -1 to cat all
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) istart < 0 is taken to mean 'read from the start' (istart = 0)
- * (2) iend < 0 means 'read to the end'
- * (3) if ptas == NULL, this is a no-op
- *
- */
-l_ok
-ptaJoin(PTA *ptad,
- PTA *ptas,
- l_int32 istart,
- l_int32 iend)
-{
-l_int32 n, i, x, y;
-
- PROCNAME("ptaJoin");
-
- if (!ptad)
- return ERROR_INT("ptad not defined", procName, 1);
- if (!ptas)
- return 0;
-
- if (istart < 0)
- istart = 0;
- n = ptaGetCount(ptas);
- if (iend < 0 || iend >= n)
- iend = n - 1;
- if (istart > iend)
- return ERROR_INT("istart > iend; no pts", procName, 1);
-
- for (i = istart; i <= iend; i++) {
- ptaGetIPt(ptas, i, &x, &y);
- ptaAddPt(ptad, x, y);
- }
-
- return 0;
-}
-
-
-/*!
- * \brief ptaaJoin()
- *
- * \param[in] ptaad dest ptaa; add to this one
- * \param[in] ptaas source ptaa; add from this one
- * \param[in] istart starting index in ptaas
- * \param[in] iend ending index in ptaas; use -1 to cat all
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) istart < 0 is taken to mean 'read from the start' (istart = 0)
- * (2) iend < 0 means 'read to the end'
- * (3) if ptas == NULL, this is a no-op
- *
- */
-l_ok
-ptaaJoin(PTAA *ptaad,
- PTAA *ptaas,
- l_int32 istart,
- l_int32 iend)
-{
-l_int32 n, i;
-PTA *pta;
-
- PROCNAME("ptaaJoin");
-
- if (!ptaad)
- return ERROR_INT("ptaad not defined", procName, 1);
- if (!ptaas)
- return 0;
-
- if (istart < 0)
- istart = 0;
- n = ptaaGetCount(ptaas);
- if (iend < 0 || iend >= n)
- iend = n - 1;
- if (istart > iend)
- return ERROR_INT("istart > iend; no pts", procName, 1);
-
- for (i = istart; i <= iend; i++) {
- pta = ptaaGetPta(ptaas, i, L_CLONE);
- ptaaAddPta(ptaad, pta, L_INSERT);
- }
-
- return 0;
-}
-
-
-/*!
- * \brief ptaReverse()
- *
- * \param[in] ptas
- * \param[in] type 0 for float values; 1 for integer values
- * \return ptad reversed pta, or NULL on error
- */
-PTA *
-ptaReverse(PTA *ptas,
- l_int32 type)
-{
-l_int32 n, i, ix, iy;
-l_float32 x, y;
-PTA *ptad;
-
- PROCNAME("ptaReverse");
-
- if (!ptas)
- return (PTA *)ERROR_PTR("ptas not defined", procName, NULL);
-
- n = ptaGetCount(ptas);
- if ((ptad = ptaCreate(n)) == NULL)
- return (PTA *)ERROR_PTR("ptad not made", procName, NULL);
- for (i = n - 1; i >= 0; i--) {
- if (type == 0) {
- ptaGetPt(ptas, i, &x, &y);
- ptaAddPt(ptad, x, y);
- } else { /* type == 1 */
- ptaGetIPt(ptas, i, &ix, &iy);
- ptaAddPt(ptad, ix, iy);
- }
- }
-
- return ptad;
-}
-
-
-/*!
- * \brief ptaTranspose()
- *
- * \param[in] ptas
- * \return ptad with x and y values swapped, or NULL on error
- */
-PTA *
-ptaTranspose(PTA *ptas)
-{
-l_int32 n, i;
-l_float32 x, y;
-PTA *ptad;
-
- PROCNAME("ptaTranspose");
-
- if (!ptas)
- return (PTA *)ERROR_PTR("ptas not defined", procName, NULL);
-
- n = ptaGetCount(ptas);
- if ((ptad = ptaCreate(n)) == NULL)
- return (PTA *)ERROR_PTR("ptad not made", procName, NULL);
- for (i = 0; i < n; i++) {
- ptaGetPt(ptas, i, &x, &y);
- ptaAddPt(ptad, y, x);
- }
-
- return ptad;
-}
-
-
-/*!
- * \brief ptaCyclicPerm()
- *
- * \param[in] ptas
- * \param[in] xs, ys start point; must be in ptas
- * \return ptad cyclic permutation, starting and ending at (xs, ys,
- * or NULL on error
- *
- *
- * Notes:
- * (1) Check to insure that (a) ptas is a closed path where
- * the first and last points are identical, and (b) the
- * resulting pta also starts and ends on the same point
- * (which in this case is (xs, ys).
- *
- */
-PTA *
-ptaCyclicPerm(PTA *ptas,
- l_int32 xs,
- l_int32 ys)
-{
-l_int32 n, i, x, y, j, index, state;
-l_int32 x1, y1, x2, y2;
-PTA *ptad;
-
- PROCNAME("ptaCyclicPerm");
-
- if (!ptas)
- return (PTA *)ERROR_PTR("ptas not defined", procName, NULL);
-
- n = ptaGetCount(ptas);
-
- /* Verify input data */
- ptaGetIPt(ptas, 0, &x1, &y1);
- ptaGetIPt(ptas, n - 1, &x2, &y2);
- if (x1 != x2 || y1 != y2)
- return (PTA *)ERROR_PTR("start and end pts not same", procName, NULL);
- state = L_NOT_FOUND;
- for (i = 0; i < n; i++) {
- ptaGetIPt(ptas, i, &x, &y);
- if (x == xs && y == ys) {
- state = L_FOUND;
- break;
- }
- }
- if (state == L_NOT_FOUND)
- return (PTA *)ERROR_PTR("start pt not in ptas", procName, NULL);
-
- if ((ptad = ptaCreate(n)) == NULL)
- return (PTA *)ERROR_PTR("ptad not made", procName, NULL);
- for (j = 0; j < n - 1; j++) {
- if (i + j < n - 1)
- index = i + j;
- else
- index = (i + j + 1) % n;
- ptaGetIPt(ptas, index, &x, &y);
- ptaAddPt(ptad, x, y);
- }
- ptaAddPt(ptad, xs, ys);
-
- return ptad;
-}
-
-
-/*!
- * \brief ptaSelectRange()
- *
- * \param[in] ptas
- * \param[in] first use 0 to select from the beginning
- * \param[in] last use -1 to select to the end
- * \return ptad, or NULL on error
- */
-PTA *
-ptaSelectRange(PTA *ptas,
- l_int32 first,
- l_int32 last)
-{
-l_int32 n, npt, i;
-l_float32 x, y;
-PTA *ptad;
-
- PROCNAME("ptaSelectRange");
-
- if (!ptas)
- return (PTA *)ERROR_PTR("ptas not defined", procName, NULL);
- if ((n = ptaGetCount(ptas)) == 0) {
- L_WARNING("ptas is empty\n", procName);
- return ptaCopy(ptas);
- }
- first = L_MAX(0, first);
- if (last < 0) last = n - 1;
- if (first >= n)
- return (PTA *)ERROR_PTR("invalid first", procName, NULL);
- if (last >= n) {
- L_WARNING("last = %d is beyond max index = %d; adjusting\n",
- procName, last, n - 1);
- last = n - 1;
- }
- if (first > last)
- return (PTA *)ERROR_PTR("first > last", procName, NULL);
-
- npt = last - first + 1;
- ptad = ptaCreate(npt);
- for (i = first; i <= last; i++) {
- ptaGetPt(ptas, i, &x, &y);
- ptaAddPt(ptad, x, y);
- }
- return ptad;
-}
-
-
-/*---------------------------------------------------------------------*
- * Geometric *
- *---------------------------------------------------------------------*/
-/*!
- * \brief ptaGetBoundingRegion()
- *
- * \param[in] pta
- * \return box, or NULL on error
- *
- *
- * Notes:
- * (1) This is used when the pta represents a set of points in
- * a two-dimensional image. It returns the box of minimum
- * size containing the pts in the pta.
- *
- */
-BOX *
-ptaGetBoundingRegion(PTA *pta)
-{
-l_int32 n, i, x, y, minx, maxx, miny, maxy;
-
- PROCNAME("ptaGetBoundingRegion");
-
- if (!pta)
- return (BOX *)ERROR_PTR("pta not defined", procName, NULL);
-
- minx = 10000000;
- miny = 10000000;
- maxx = -10000000;
- maxy = -10000000;
- n = ptaGetCount(pta);
- for (i = 0; i < n; i++) {
- ptaGetIPt(pta, i, &x, &y);
- if (x < minx) minx = x;
- if (x > maxx) maxx = x;
- if (y < miny) miny = y;
- if (y > maxy) maxy = y;
- }
-
- return boxCreate(minx, miny, maxx - minx + 1, maxy - miny + 1);
-}
-
-
-/*!
- * \brief ptaGetRange()
- *
- * \param[in] pta
- * \param[out] pminx [optional] min value of x
- * \param[out] pmaxx [optional] max value of x
- * \param[out] pminy [optional] min value of y
- * \param[out] pmaxy [optional] max value of y
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) We can use pts to represent pairs of floating values, that
- * are not necessarily tied to a two-dimension region. For
- * example, the pts can represent a general function y(x).
- *
- */
-l_ok
-ptaGetRange(PTA *pta,
- l_float32 *pminx,
- l_float32 *pmaxx,
- l_float32 *pminy,
- l_float32 *pmaxy)
-{
-l_int32 n, i;
-l_float32 x, y, minx, maxx, miny, maxy;
-
- PROCNAME("ptaGetRange");
-
- if (!pminx && !pmaxx && !pminy && !pmaxy)
- return ERROR_INT("no output requested", procName, 1);
- if (pminx) *pminx = 0;
- if (pmaxx) *pmaxx = 0;
- if (pminy) *pminy = 0;
- if (pmaxy) *pmaxy = 0;
- if (!pta)
- return ERROR_INT("pta not defined", procName, 1);
- if ((n = ptaGetCount(pta)) == 0)
- return ERROR_INT("no points in pta", procName, 1);
-
- ptaGetPt(pta, 0, &x, &y);
- minx = x;
- maxx = x;
- miny = y;
- maxy = y;
- for (i = 1; i < n; i++) {
- ptaGetPt(pta, i, &x, &y);
- if (x < minx) minx = x;
- if (x > maxx) maxx = x;
- if (y < miny) miny = y;
- if (y > maxy) maxy = y;
- }
- if (pminx) *pminx = minx;
- if (pmaxx) *pmaxx = maxx;
- if (pminy) *pminy = miny;
- if (pmaxy) *pmaxy = maxy;
- return 0;
-}
-
-
-/*!
- * \brief ptaGetInsideBox()
- *
- * \param[in] ptas input pts
- * \param[in] box
- * \return ptad of pts in ptas that are inside the box, or NULL on error
- */
-PTA *
-ptaGetInsideBox(PTA *ptas,
- BOX *box)
-{
-PTA *ptad;
-l_int32 n, i, contains;
-l_float32 x, y;
-
- PROCNAME("ptaGetInsideBox");
-
- if (!ptas)
- return (PTA *)ERROR_PTR("ptas not defined", procName, NULL);
- if (!box)
- return (PTA *)ERROR_PTR("box not defined", procName, NULL);
-
- n = ptaGetCount(ptas);
- ptad = ptaCreate(0);
- for (i = 0; i < n; i++) {
- ptaGetPt(ptas, i, &x, &y);
- boxContainsPt(box, x, y, &contains);
- if (contains)
- ptaAddPt(ptad, x, y);
- }
-
- return ptad;
-}
-
-
-/*!
- * \brief pixFindCornerPixels()
- *
- * \param[in] pixs 1 bpp
- * \return pta, or NULL on error
- *
- *
- * Notes:
- * (1) Finds the 4 corner-most pixels, as defined by a search
- * inward from each corner, using a 45 degree line.
- *
- */
-PTA *
-pixFindCornerPixels(PIX *pixs)
-{
-l_int32 i, j, x, y, w, h, wpl, mindim, found;
-l_uint32 *data, *line;
-PTA *pta;
-
- PROCNAME("pixFindCornerPixels");
-
- if (!pixs)
- return (PTA *)ERROR_PTR("pixs not defined", procName, NULL);
- if (pixGetDepth(pixs) != 1)
- return (PTA *)ERROR_PTR("pixs not 1 bpp", procName, NULL);
-
- w = pixGetWidth(pixs);
- h = pixGetHeight(pixs);
- mindim = L_MIN(w, h);
- data = pixGetData(pixs);
- wpl = pixGetWpl(pixs);
-
- if ((pta = ptaCreate(4)) == NULL)
- return (PTA *)ERROR_PTR("pta not made", procName, NULL);
-
- for (found = FALSE, i = 0; i < mindim; i++) {
- for (j = 0; j <= i; j++) {
- y = i - j;
- line = data + y * wpl;
- if (GET_DATA_BIT(line, j)) {
- ptaAddPt(pta, j, y);
- found = TRUE;
- break;
- }
- }
- if (found == TRUE)
- break;
- }
-
- for (found = FALSE, i = 0; i < mindim; i++) {
- for (j = 0; j <= i; j++) {
- y = i - j;
- line = data + y * wpl;
- x = w - 1 - j;
- if (GET_DATA_BIT(line, x)) {
- ptaAddPt(pta, x, y);
- found = TRUE;
- break;
- }
- }
- if (found == TRUE)
- break;
- }
-
- for (found = FALSE, i = 0; i < mindim; i++) {
- for (j = 0; j <= i; j++) {
- y = h - 1 - i + j;
- line = data + y * wpl;
- if (GET_DATA_BIT(line, j)) {
- ptaAddPt(pta, j, y);
- found = TRUE;
- break;
- }
- }
- if (found == TRUE)
- break;
- }
-
- for (found = FALSE, i = 0; i < mindim; i++) {
- for (j = 0; j <= i; j++) {
- y = h - 1 - i + j;
- line = data + y * wpl;
- x = w - 1 - j;
- if (GET_DATA_BIT(line, x)) {
- ptaAddPt(pta, x, y);
- found = TRUE;
- break;
- }
- }
- if (found == TRUE)
- break;
- }
-
- return pta;
-}
-
-
-/*!
- * \brief ptaContainsPt()
- *
- * \param[in] pta
- * \param[in] x, y point
- * \return 1 if contained, 0 otherwise or on error
- */
-l_int32
-ptaContainsPt(PTA *pta,
- l_int32 x,
- l_int32 y)
-{
-l_int32 i, n, ix, iy;
-
- PROCNAME("ptaContainsPt");
-
- if (!pta)
- return ERROR_INT("pta not defined", procName, 0);
-
- n = ptaGetCount(pta);
- for (i = 0; i < n; i++) {
- ptaGetIPt(pta, i, &ix, &iy);
- if (x == ix && y == iy)
- return 1;
- }
- return 0;
-}
-
-
-/*!
- * \brief ptaTestIntersection()
- *
- * \param[in] pta1, pta2
- * \return bval which is 1 if they have any elements in common;
- * 0 otherwise or on error.
- */
-l_int32
-ptaTestIntersection(PTA *pta1,
- PTA *pta2)
-{
-l_int32 i, j, n1, n2, x1, y1, x2, y2;
-
- PROCNAME("ptaTestIntersection");
-
- if (!pta1)
- return ERROR_INT("pta1 not defined", procName, 0);
- if (!pta2)
- return ERROR_INT("pta2 not defined", procName, 0);
-
- n1 = ptaGetCount(pta1);
- n2 = ptaGetCount(pta2);
- for (i = 0; i < n1; i++) {
- ptaGetIPt(pta1, i, &x1, &y1);
- for (j = 0; j < n2; j++) {
- ptaGetIPt(pta2, i, &x2, &y2);
- if (x1 == x2 && y1 == y2)
- return 1;
- }
- }
-
- return 0;
-}
-
-
-/*!
- * \brief ptaTransform()
- *
- * \param[in] ptas
- * \param[in] shiftx, shifty
- * \param[in] scalex, scaley
- * \return pta, or NULL on error
- *
- *
- * Notes:
- * (1) Shift first, then scale.
- *
- */
-PTA *
-ptaTransform(PTA *ptas,
- l_int32 shiftx,
- l_int32 shifty,
- l_float32 scalex,
- l_float32 scaley)
-{
-l_int32 n, i, x, y;
-PTA *ptad;
-
- PROCNAME("ptaTransform");
-
- if (!ptas)
- return (PTA *)ERROR_PTR("ptas not defined", procName, NULL);
- n = ptaGetCount(ptas);
- ptad = ptaCreate(n);
- for (i = 0; i < n; i++) {
- ptaGetIPt(ptas, i, &x, &y);
- x = (l_int32)(scalex * (x + shiftx) + 0.5);
- y = (l_int32)(scaley * (y + shifty) + 0.5);
- ptaAddPt(ptad, x, y);
- }
-
- return ptad;
-}
-
-
-/*!
- * \brief ptaPtInsidePolygon()
- *
- * \param[in] pta vertices of a polygon
- * \param[in] x, y point to be tested
- * \param[out] pinside 1 if inside; 0 if outside or on boundary
- * \return 1 if OK, 0 on error
- *
- * The abs value of the sum of the angles subtended from a point by
- * the sides of a polygon, when taken in order traversing the polygon,
- * is 0 if the point is outside the polygon and 2*pi if inside.
- * The sign will be positive if traversed cw and negative if ccw.
- */
-l_int32
-ptaPtInsidePolygon(PTA *pta,
- l_float32 x,
- l_float32 y,
- l_int32 *pinside)
-{
-l_int32 i, n;
-l_float32 sum, x1, y1, x2, y2, xp1, yp1, xp2, yp2;
-
- PROCNAME("ptaPtInsidePolygon");
-
- if (!pinside)
- return ERROR_INT("&inside not defined", procName, 1);
- *pinside = 0;
- if (!pta)
- return ERROR_INT("pta not defined", procName, 1);
-
- /* Think of (x1,y1) as the end point of a vector that starts
- * from the origin (0,0), and ditto for (x2,y2). */
- n = ptaGetCount(pta);
- sum = 0.0;
- for (i = 0; i < n; i++) {
- ptaGetPt(pta, i, &xp1, &yp1);
- ptaGetPt(pta, (i + 1) % n, &xp2, &yp2);
- x1 = xp1 - x;
- y1 = yp1 - y;
- x2 = xp2 - x;
- y2 = yp2 - y;
- sum += l_angleBetweenVectors(x1, y1, x2, y2);
- }
-
- if (L_ABS(sum) > M_PI)
- *pinside = 1;
- return 0;
-}
-
-
-/*!
- * \brief l_angleBetweenVectors()
- *
- * \param[in] x1, y1 end point of first vector
- * \param[in] x2, y2 end point of second vector
- * \return angle radians, or 0.0 on error
- *
- *
- * Notes:
- * (1) This gives the angle between two vectors, going between
- * vector1 (x1,y1) and vector2 (x2,y2). The angle is swept
- * out from 1 --> 2. If this is clockwise, the angle is
- * positive, but the result is folded into the interval [-pi, pi].
- *
- */
-l_float32
-l_angleBetweenVectors(l_float32 x1,
- l_float32 y1,
- l_float32 x2,
- l_float32 y2)
-{
-l_float64 ang;
-
- ang = atan2(y2, x2) - atan2(y1, x1);
- if (ang > M_PI) ang -= 2.0 * M_PI;
- if (ang < -M_PI) ang += 2.0 * M_PI;
- return ang;
-}
-
-
-/*---------------------------------------------------------------------*
- * Min/max and filtering *
- *---------------------------------------------------------------------*/
-/*!
- * \brief ptaGetMinMax()
- *
- * \param[in] pta
- * \param[out] pxmin [optional] min of x
- * \param[out] pymin [optional] min of y
- * \param[out] pxmax [optional] max of x
- * \param[out] pymax [optional] max of y
- * \return 0 if OK, 1 on error. If pta is empty, requested
- * values are returned as -1.0.
- */
-l_ok
-ptaGetMinMax(PTA *pta,
- l_float32 *pxmin,
- l_float32 *pymin,
- l_float32 *pxmax,
- l_float32 *pymax)
-{
-l_int32 i, n;
-l_float32 x, y, xmin, ymin, xmax, ymax;
-
- PROCNAME("ptaGetMinMax");
-
- if (pxmin) *pxmin = -1.0;
- if (pymin) *pymin = -1.0;
- if (pxmax) *pxmax = -1.0;
- if (pymax) *pymax = -1.0;
- if (!pta)
- return ERROR_INT("pta not defined", procName, 1);
- if (!pxmin && !pxmax && !pymin && !pymax)
- return ERROR_INT("no output requested", procName, 1);
- if ((n = ptaGetCount(pta)) == 0) {
- L_WARNING("pta is empty\n", procName);
- return 0;
- }
-
- xmin = ymin = 1.0e20;
- xmax = ymax = -1.0e20;
- for (i = 0; i < n; i++) {
- ptaGetPt(pta, i, &x, &y);
- if (x < xmin) xmin = x;
- if (y < ymin) ymin = y;
- if (x > xmax) xmax = x;
- if (y > ymax) ymax = y;
- }
- if (pxmin) *pxmin = xmin;
- if (pymin) *pymin = ymin;
- if (pxmax) *pxmax = xmax;
- if (pymax) *pymax = ymax;
- return 0;
-}
-
-
-/*!
- * \brief ptaSelectByValue()
- *
- * \param[in] ptas
- * \param[in] xth, yth threshold values
- * \param[in] type L_SELECT_XVAL, L_SELECT_YVAL,
- * L_SELECT_IF_EITHER, L_SELECT_IF_BOTH
- * \param[in] relation L_SELECT_IF_LT, L_SELECT_IF_GT,
- * L_SELECT_IF_LTE, L_SELECT_IF_GTE
- * \return ptad filtered set, or NULL on error
- */
-PTA *
-ptaSelectByValue(PTA *ptas,
- l_float32 xth,
- l_float32 yth,
- l_int32 type,
- l_int32 relation)
-{
-l_int32 i, n;
-l_float32 x, y;
-PTA *ptad;
-
- PROCNAME("ptaSelectByValue");
-
- if (!ptas)
- return (PTA *)ERROR_PTR("ptas not defined", procName, NULL);
- if (ptaGetCount(ptas) == 0) {
- L_WARNING("ptas is empty\n", procName);
- return ptaCopy(ptas);
- }
- if (type != L_SELECT_XVAL && type != L_SELECT_YVAL &&
- type != L_SELECT_IF_EITHER && type != L_SELECT_IF_BOTH)
- return (PTA *)ERROR_PTR("invalid type", procName, NULL);
- if (relation != L_SELECT_IF_LT && relation != L_SELECT_IF_GT &&
- relation != L_SELECT_IF_LTE && relation != L_SELECT_IF_GTE)
- return (PTA *)ERROR_PTR("invalid relation", procName, NULL);
-
- n = ptaGetCount(ptas);
- ptad = ptaCreate(n);
- for (i = 0; i < n; i++) {
- ptaGetPt(ptas, i, &x, &y);
- if (type == L_SELECT_XVAL) {
- if ((relation == L_SELECT_IF_LT && x < xth) ||
- (relation == L_SELECT_IF_GT && x > xth) ||
- (relation == L_SELECT_IF_LTE && x <= xth) ||
- (relation == L_SELECT_IF_GTE && x >= xth))
- ptaAddPt(ptad, x, y);
- } else if (type == L_SELECT_YVAL) {
- if ((relation == L_SELECT_IF_LT && y < yth) ||
- (relation == L_SELECT_IF_GT && y > yth) ||
- (relation == L_SELECT_IF_LTE && y <= yth) ||
- (relation == L_SELECT_IF_GTE && y >= yth))
- ptaAddPt(ptad, x, y);
- } else if (type == L_SELECT_IF_EITHER) {
- if (((relation == L_SELECT_IF_LT) && (x < xth || y < yth)) ||
- ((relation == L_SELECT_IF_GT) && (x > xth || y > yth)) ||
- ((relation == L_SELECT_IF_LTE) && (x <= xth || y <= yth)) ||
- ((relation == L_SELECT_IF_GTE) && (x >= xth || y >= yth)))
- ptaAddPt(ptad, x, y);
- } else { /* L_SELECT_IF_BOTH */
- if (((relation == L_SELECT_IF_LT) && (x < xth && y < yth)) ||
- ((relation == L_SELECT_IF_GT) && (x > xth && y > yth)) ||
- ((relation == L_SELECT_IF_LTE) && (x <= xth && y <= yth)) ||
- ((relation == L_SELECT_IF_GTE) && (x >= xth && y >= yth)))
- ptaAddPt(ptad, x, y);
- }
- }
-
- return ptad;
-}
-
-
-/*!
- * \brief ptaCropToMask()
- *
- * \param[in] ptas input pta
- * \param[in] pixm 1 bpp mask
- * \return ptad with only pts under the mask fg, or NULL on error
- */
-PTA *
-ptaCropToMask(PTA *ptas,
- PIX *pixm)
-{
-l_int32 i, n, x, y;
-l_uint32 val;
-PTA *ptad;
-
- PROCNAME("ptaCropToMask");
-
- if (!ptas)
- return (PTA *)ERROR_PTR("ptas not defined", procName, NULL);
- if (!pixm || pixGetDepth(pixm) != 1)
- return (PTA *)ERROR_PTR("pixm undefined or not 1 bpp", procName, NULL);
- if (ptaGetCount(ptas) == 0) {
- L_INFO("ptas is empty\n", procName);
- return ptaCopy(ptas);
- }
-
- n = ptaGetCount(ptas);
- ptad = ptaCreate(n);
- for (i = 0; i < n; i++) {
- ptaGetIPt(ptas, i, &x, &y);
- pixGetPixel(pixm, x, y, &val);
- if (val == 1)
- ptaAddPt(ptad, x, y);
- }
- return ptad;
-}
-
-
-/*---------------------------------------------------------------------*
- * Least Squares Fit *
- *---------------------------------------------------------------------*/
-/*!
- * \brief ptaGetLinearLSF()
- *
- * \param[in] pta
- * \param[out] pa [optional] slope a of least square fit: y = ax + b
- * \param[out] pb [optional] intercept b of least square fit
- * \param[out] pnafit [optional] numa of least square fit
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) Either or both &a and &b must be input. They determine the
- * type of line that is fit.
- * (2) If both &a and &b are defined, this returns a and b that minimize:
- *
- * sum (yi - axi -b)^2
- * i
- *
- * The method is simple: differentiate this expression w/rt a and b,
- * and solve the resulting two equations for a and b in terms of
- * various sums over the input data (xi, yi).
- * (3) We also allow two special cases, where either a = 0 or b = 0:
- * (a) If &a is given and &b = null, find the linear LSF that
- * goes through the origin (b = 0).
- * (b) If &b is given and &a = null, find the linear LSF with
- * zero slope (a = 0).
- * (4) If &nafit is defined, this returns an array of fitted values,
- * corresponding to the two implicit Numa arrays (nax and nay) in pta.
- * Thus, just as you can plot the data in pta as nay vs. nax,
- * you can plot the linear least square fit as nafit vs. nax.
- * Get the nax array using ptaGetArrays(pta, &nax, NULL);
- *
- */
-l_ok
-ptaGetLinearLSF(PTA *pta,
- l_float32 *pa,
- l_float32 *pb,
- NUMA **pnafit)
-{
-l_int32 n, i;
-l_float32 a, b, factor, sx, sy, sxx, sxy, val;
-l_float32 *xa, *ya;
-
- PROCNAME("ptaGetLinearLSF");
-
- if (pa) *pa = 0.0;
- if (pb) *pb = 0.0;
- if (pnafit) *pnafit = NULL;
- if (!pa && !pb && !pnafit)
- return ERROR_INT("no output requested", procName, 1);
- if (!pta)
- return ERROR_INT("pta not defined", procName, 1);
- if ((n = ptaGetCount(pta)) < 2)
- return ERROR_INT("less than 2 pts found", procName, 1);
-
- xa = pta->x; /* not a copy */
- ya = pta->y; /* not a copy */
- sx = sy = sxx = sxy = 0.;
- if (pa && pb) { /* general line */
- for (i = 0; i < n; i++) {
- sx += xa[i];
- sy += ya[i];
- sxx += xa[i] * xa[i];
- sxy += xa[i] * ya[i];
- }
- factor = n * sxx - sx * sx;
- if (factor == 0.0)
- return ERROR_INT("no solution found", procName, 1);
- factor = 1. / factor;
-
- a = factor * ((l_float32)n * sxy - sx * sy);
- b = factor * (sxx * sy - sx * sxy);
- } else if (pa) { /* b = 0; line through origin */
- for (i = 0; i < n; i++) {
- sxx += xa[i] * xa[i];
- sxy += xa[i] * ya[i];
- }
- if (sxx == 0.0)
- return ERROR_INT("no solution found", procName, 1);
- a = sxy / sxx;
- b = 0.0;
- } else { /* a = 0; horizontal line */
- for (i = 0; i < n; i++)
- sy += ya[i];
- a = 0.0;
- b = sy / (l_float32)n;
- }
-
- if (pnafit) {
- *pnafit = numaCreate(n);
- for (i = 0; i < n; i++) {
- val = a * xa[i] + b;
- numaAddNumber(*pnafit, val);
- }
- }
-
- if (pa) *pa = a;
- if (pb) *pb = b;
- return 0;
-}
-
-
-/*!
- * \brief ptaGetQuadraticLSF()
- *
- * \param[in] pta
- * \param[out] pa [optional] coeff a of LSF: y = ax^2 + bx + c
- * \param[out] pb [optional] coeff b of LSF: y = ax^2 + bx + c
- * \param[out] pc [optional] coeff c of LSF: y = ax^2 + bx + c
- * \param[out] pnafit [optional] numa of least square fit
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This does a quadratic least square fit to the set of points
- * in %pta. That is, it finds coefficients a, b and c that minimize:
- *
- * sum (yi - a*xi*xi -b*xi -c)^2
- * i
- *
- * The method is simple: differentiate this expression w/rt
- * a, b and c, and solve the resulting three equations for these
- * coefficients in terms of various sums over the input data (xi, yi).
- * The three equations are in the form:
- * f[0][0]a + f[0][1]b + f[0][2]c = g[0]
- * f[1][0]a + f[1][1]b + f[1][2]c = g[1]
- * f[2][0]a + f[2][1]b + f[2][2]c = g[2]
- * (2) If &nafit is defined, this returns an array of fitted values,
- * corresponding to the two implicit Numa arrays (nax and nay) in pta.
- * Thus, just as you can plot the data in pta as nay vs. nax,
- * you can plot the linear least square fit as nafit vs. nax.
- * Get the nax array using ptaGetArrays(pta, &nax, NULL);
- *
- */
-l_ok
-ptaGetQuadraticLSF(PTA *pta,
- l_float32 *pa,
- l_float32 *pb,
- l_float32 *pc,
- NUMA **pnafit)
-{
-l_int32 n, i, ret;
-l_float32 x, y, sx, sy, sx2, sx3, sx4, sxy, sx2y;
-l_float32 *xa, *ya;
-l_float32 *f[3];
-l_float32 g[3];
-
- PROCNAME("ptaGetQuadraticLSF");
-
- if (pa) *pa = 0.0;
- if (pb) *pb = 0.0;
- if (pc) *pc = 0.0;
- if (pnafit) *pnafit = NULL;
- if (!pa && !pb && !pc && !pnafit)
- return ERROR_INT("no output requested", procName, 1);
- if (!pta)
- return ERROR_INT("pta not defined", procName, 1);
- if ((n = ptaGetCount(pta)) < 3)
- return ERROR_INT("less than 3 pts found", procName, 1);
-
- xa = pta->x; /* not a copy */
- ya = pta->y; /* not a copy */
- sx = sy = sx2 = sx3 = sx4 = sxy = sx2y = 0.;
- for (i = 0; i < n; i++) {
- x = xa[i];
- y = ya[i];
- sx += x;
- sy += y;
- sx2 += x * x;
- sx3 += x * x * x;
- sx4 += x * x * x * x;
- sxy += x * y;
- sx2y += x * x * y;
- }
-
- for (i = 0; i < 3; i++)
- f[i] = (l_float32 *)LEPT_CALLOC(3, sizeof(l_float32));
- f[0][0] = sx4;
- f[0][1] = sx3;
- f[0][2] = sx2;
- f[1][0] = sx3;
- f[1][1] = sx2;
- f[1][2] = sx;
- f[2][0] = sx2;
- f[2][1] = sx;
- f[2][2] = n;
- g[0] = sx2y;
- g[1] = sxy;
- g[2] = sy;
-
- /* Solve for the unknowns, also putting f-inverse into f */
- ret = gaussjordan(f, g, 3);
- for (i = 0; i < 3; i++)
- LEPT_FREE(f[i]);
- if (ret)
- return ERROR_INT("quadratic solution failed", procName, 1);
-
- if (pa) *pa = g[0];
- if (pb) *pb = g[1];
- if (pc) *pc = g[2];
- if (pnafit) {
- *pnafit = numaCreate(n);
- for (i = 0; i < n; i++) {
- x = xa[i];
- y = g[0] * x * x + g[1] * x + g[2];
- numaAddNumber(*pnafit, y);
- }
- }
- return 0;
-}
-
-
-/*!
- * \brief ptaGetCubicLSF()
- *
- * \param[in] pta
- * \param[out] pa [optional] coeff a of LSF: y = ax^3 + bx^2 + cx + d
- * \param[out] pb [optional] coeff b of LSF
- * \param[out] pc [optional] coeff c of LSF
- * \param[out] pd [optional] coeff d of LSF
- * \param[out] pnafit [optional] numa of least square fit
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This does a cubic least square fit to the set of points
- * in %pta. That is, it finds coefficients a, b, c and d
- * that minimize:
- *
- * sum (yi - a*xi*xi*xi -b*xi*xi -c*xi - d)^2
- * i
- *
- * Differentiate this expression w/rt a, b, c and d, and solve
- * the resulting four equations for these coefficients in
- * terms of various sums over the input data (xi, yi).
- * The four equations are in the form:
- * f[0][0]a + f[0][1]b + f[0][2]c + f[0][3] = g[0]
- * f[1][0]a + f[1][1]b + f[1][2]c + f[1][3] = g[1]
- * f[2][0]a + f[2][1]b + f[2][2]c + f[2][3] = g[2]
- * f[3][0]a + f[3][1]b + f[3][2]c + f[3][3] = g[3]
- * (2) If &nafit is defined, this returns an array of fitted values,
- * corresponding to the two implicit Numa arrays (nax and nay) in pta.
- * Thus, just as you can plot the data in pta as nay vs. nax,
- * you can plot the linear least square fit as nafit vs. nax.
- * Get the nax array using ptaGetArrays(pta, &nax, NULL);
- *
- */
-l_ok
-ptaGetCubicLSF(PTA *pta,
- l_float32 *pa,
- l_float32 *pb,
- l_float32 *pc,
- l_float32 *pd,
- NUMA **pnafit)
-{
-l_int32 n, i, ret;
-l_float32 x, y, sx, sy, sx2, sx3, sx4, sx5, sx6, sxy, sx2y, sx3y;
-l_float32 *xa, *ya;
-l_float32 *f[4];
-l_float32 g[4];
-
- PROCNAME("ptaGetCubicLSF");
-
- if (pa) *pa = 0.0;
- if (pb) *pb = 0.0;
- if (pc) *pc = 0.0;
- if (pd) *pd = 0.0;
- if (pnafit) *pnafit = NULL;
- if (!pa && !pb && !pc && !pd && !pnafit)
- return ERROR_INT("no output requested", procName, 1);
- if (!pta)
- return ERROR_INT("pta not defined", procName, 1);
- if ((n = ptaGetCount(pta)) < 4)
- return ERROR_INT("less than 4 pts found", procName, 1);
-
- xa = pta->x; /* not a copy */
- ya = pta->y; /* not a copy */
- sx = sy = sx2 = sx3 = sx4 = sx5 = sx6 = sxy = sx2y = sx3y = 0.;
- for (i = 0; i < n; i++) {
- x = xa[i];
- y = ya[i];
- sx += x;
- sy += y;
- sx2 += x * x;
- sx3 += x * x * x;
- sx4 += x * x * x * x;
- sx5 += x * x * x * x * x;
- sx6 += x * x * x * x * x * x;
- sxy += x * y;
- sx2y += x * x * y;
- sx3y += x * x * x * y;
- }
-
- for (i = 0; i < 4; i++)
- f[i] = (l_float32 *)LEPT_CALLOC(4, sizeof(l_float32));
- f[0][0] = sx6;
- f[0][1] = sx5;
- f[0][2] = sx4;
- f[0][3] = sx3;
- f[1][0] = sx5;
- f[1][1] = sx4;
- f[1][2] = sx3;
- f[1][3] = sx2;
- f[2][0] = sx4;
- f[2][1] = sx3;
- f[2][2] = sx2;
- f[2][3] = sx;
- f[3][0] = sx3;
- f[3][1] = sx2;
- f[3][2] = sx;
- f[3][3] = n;
- g[0] = sx3y;
- g[1] = sx2y;
- g[2] = sxy;
- g[3] = sy;
-
- /* Solve for the unknowns, also putting f-inverse into f */
- ret = gaussjordan(f, g, 4);
- for (i = 0; i < 4; i++)
- LEPT_FREE(f[i]);
- if (ret)
- return ERROR_INT("cubic solution failed", procName, 1);
-
- if (pa) *pa = g[0];
- if (pb) *pb = g[1];
- if (pc) *pc = g[2];
- if (pd) *pd = g[3];
- if (pnafit) {
- *pnafit = numaCreate(n);
- for (i = 0; i < n; i++) {
- x = xa[i];
- y = g[0] * x * x * x + g[1] * x * x + g[2] * x + g[3];
- numaAddNumber(*pnafit, y);
- }
- }
- return 0;
-}
-
-
-/*!
- * \brief ptaGetQuarticLSF()
- *
- * \param[in] pta
- * \param[out] pa [optional] coeff a of LSF:
- * y = ax^4 + bx^3 + cx^2 + dx + e
- * \param[out] pb [optional] coeff b of LSF
- * \param[out] pc [optional] coeff c of LSF
- * \param[out] pd [optional] coeff d of LSF
- * \param[out] pe [optional] coeff e of LSF
- * \param[out] pnafit [optional] numa of least square fit
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This does a quartic least square fit to the set of points
- * in %pta. That is, it finds coefficients a, b, c, d and 3
- * that minimize:
- *
- * sum (yi - a*xi*xi*xi*xi -b*xi*xi*xi -c*xi*xi - d*xi - e)^2
- * i
- *
- * Differentiate this expression w/rt a, b, c, d and e, and solve
- * the resulting five equations for these coefficients in
- * terms of various sums over the input data (xi, yi).
- * The five equations are in the form:
- * f[0][0]a + f[0][1]b + f[0][2]c + f[0][3] + f[0][4] = g[0]
- * f[1][0]a + f[1][1]b + f[1][2]c + f[1][3] + f[1][4] = g[1]
- * f[2][0]a + f[2][1]b + f[2][2]c + f[2][3] + f[2][4] = g[2]
- * f[3][0]a + f[3][1]b + f[3][2]c + f[3][3] + f[3][4] = g[3]
- * f[4][0]a + f[4][1]b + f[4][2]c + f[4][3] + f[4][4] = g[4]
- * (2) If &nafit is defined, this returns an array of fitted values,
- * corresponding to the two implicit Numa arrays (nax and nay) in pta.
- * Thus, just as you can plot the data in pta as nay vs. nax,
- * you can plot the linear least square fit as nafit vs. nax.
- * Get the nax array using ptaGetArrays(pta, &nax, NULL);
- *
- */
-l_ok
-ptaGetQuarticLSF(PTA *pta,
- l_float32 *pa,
- l_float32 *pb,
- l_float32 *pc,
- l_float32 *pd,
- l_float32 *pe,
- NUMA **pnafit)
-{
-l_int32 n, i, ret;
-l_float32 x, y, sx, sy, sx2, sx3, sx4, sx5, sx6, sx7, sx8;
-l_float32 sxy, sx2y, sx3y, sx4y;
-l_float32 *xa, *ya;
-l_float32 *f[5];
-l_float32 g[5];
-
- PROCNAME("ptaGetQuarticLSF");
-
- if (pa) *pa = 0.0;
- if (pb) *pb = 0.0;
- if (pc) *pc = 0.0;
- if (pd) *pd = 0.0;
- if (pe) *pe = 0.0;
- if (pnafit) *pnafit = NULL;
- if (!pa && !pb && !pc && !pd && !pe && !pnafit)
- return ERROR_INT("no output requested", procName, 1);
- if (!pta)
- return ERROR_INT("pta not defined", procName, 1);
- if ((n = ptaGetCount(pta)) < 5)
- return ERROR_INT("less than 5 pts found", procName, 1);
-
- xa = pta->x; /* not a copy */
- ya = pta->y; /* not a copy */
- sx = sy = sx2 = sx3 = sx4 = sx5 = sx6 = sx7 = sx8 = 0;
- sxy = sx2y = sx3y = sx4y = 0.;
- for (i = 0; i < n; i++) {
- x = xa[i];
- y = ya[i];
- sx += x;
- sy += y;
- sx2 += x * x;
- sx3 += x * x * x;
- sx4 += x * x * x * x;
- sx5 += x * x * x * x * x;
- sx6 += x * x * x * x * x * x;
- sx7 += x * x * x * x * x * x * x;
- sx8 += x * x * x * x * x * x * x * x;
- sxy += x * y;
- sx2y += x * x * y;
- sx3y += x * x * x * y;
- sx4y += x * x * x * x * y;
- }
-
- for (i = 0; i < 5; i++)
- f[i] = (l_float32 *)LEPT_CALLOC(5, sizeof(l_float32));
- f[0][0] = sx8;
- f[0][1] = sx7;
- f[0][2] = sx6;
- f[0][3] = sx5;
- f[0][4] = sx4;
- f[1][0] = sx7;
- f[1][1] = sx6;
- f[1][2] = sx5;
- f[1][3] = sx4;
- f[1][4] = sx3;
- f[2][0] = sx6;
- f[2][1] = sx5;
- f[2][2] = sx4;
- f[2][3] = sx3;
- f[2][4] = sx2;
- f[3][0] = sx5;
- f[3][1] = sx4;
- f[3][2] = sx3;
- f[3][3] = sx2;
- f[3][4] = sx;
- f[4][0] = sx4;
- f[4][1] = sx3;
- f[4][2] = sx2;
- f[4][3] = sx;
- f[4][4] = n;
- g[0] = sx4y;
- g[1] = sx3y;
- g[2] = sx2y;
- g[3] = sxy;
- g[4] = sy;
-
- /* Solve for the unknowns, also putting f-inverse into f */
- ret = gaussjordan(f, g, 5);
- for (i = 0; i < 5; i++)
- LEPT_FREE(f[i]);
- if (ret)
- return ERROR_INT("quartic solution failed", procName, 1);
-
- if (pa) *pa = g[0];
- if (pb) *pb = g[1];
- if (pc) *pc = g[2];
- if (pd) *pd = g[3];
- if (pe) *pe = g[4];
- if (pnafit) {
- *pnafit = numaCreate(n);
- for (i = 0; i < n; i++) {
- x = xa[i];
- y = g[0] * x * x * x * x + g[1] * x * x * x + g[2] * x * x
- + g[3] * x + g[4];
- numaAddNumber(*pnafit, y);
- }
- }
- return 0;
-}
-
-
-/*!
- * \brief ptaNoisyLinearLSF()
- *
- * \param[in] pta
- * \param[in] factor reject outliers with error greater than this
- * number of medians; typically ~ 3
- * \param[out] pptad [optional] with outliers removed
- * \param[out] pa [optional] slope a of least square fit: y = ax + b
- * \param[out] pb [optional] intercept b of least square fit
- * \param[out] pmederr [optional] median error
- * \param[out] pnafit [optional] numa of least square fit to ptad
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This does a linear least square fit to the set of points
- * in %pta. It then evaluates the errors and removes points
- * whose error is >= factor * median_error. It then re-runs
- * the linear LSF on the resulting points.
- * (2) Either or both &a and &b must be input. They determine the
- * type of line that is fit.
- * (3) The median error can give an indication of how good the fit
- * is likely to be.
- *
- */
-l_ok
-ptaNoisyLinearLSF(PTA *pta,
- l_float32 factor,
- PTA **pptad,
- l_float32 *pa,
- l_float32 *pb,
- l_float32 *pmederr,
- NUMA **pnafit)
-{
-l_int32 n, i, ret;
-l_float32 x, y, yf, val, mederr;
-NUMA *nafit, *naerror;
-PTA *ptad;
-
- PROCNAME("ptaNoisyLinearLSF");
-
- if (pptad) *pptad = NULL;
- if (pa) *pa = 0.0;
- if (pb) *pb = 0.0;
- if (pmederr) *pmederr = 0.0;
- if (pnafit) *pnafit = NULL;
- if (!pptad && !pa && !pb && !pnafit)
- return ERROR_INT("no output requested", procName, 1);
- if (!pta)
- return ERROR_INT("pta not defined", procName, 1);
- if (factor <= 0.0)
- return ERROR_INT("factor must be > 0.0", procName, 1);
- if ((n = ptaGetCount(pta)) < 3)
- return ERROR_INT("less than 2 pts found", procName, 1);
-
- if (ptaGetLinearLSF(pta, pa, pb, &nafit) != 0)
- return ERROR_INT("error in linear LSF", procName, 1);
-
- /* Get the median error */
- naerror = numaCreate(n);
- for (i = 0; i < n; i++) {
- ptaGetPt(pta, i, &x, &y);
- numaGetFValue(nafit, i, &yf);
- numaAddNumber(naerror, L_ABS(y - yf));
- }
- numaGetMedian(naerror, &mederr);
- if (pmederr) *pmederr = mederr;
- numaDestroy(&nafit);
-
- /* Remove outliers */
- ptad = ptaCreate(n);
- for (i = 0; i < n; i++) {
- ptaGetPt(pta, i, &x, &y);
- numaGetFValue(naerror, i, &val);
- if (val <= factor * mederr) /* <= in case mederr = 0 */
- ptaAddPt(ptad, x, y);
- }
- numaDestroy(&naerror);
-
- /* Do LSF again */
- ret = ptaGetLinearLSF(ptad, pa, pb, pnafit);
- if (pptad)
- *pptad = ptad;
- else
- ptaDestroy(&ptad);
-
- return ret;
-}
-
-
-/*!
- * \brief ptaNoisyQuadraticLSF()
- *
- * \param[in] pta
- * \param[in] factor reject outliers with error greater than this
- * number of medians; typically ~ 3
- * \param[out] pptad [optional] with outliers removed
- * \param[out] pa [optional] coeff a of LSF: y = ax^2 + bx + c
- * \param[out] pb [optional] coeff b of LSF: y = ax^2 + bx + c
- * \param[out] pc [optional] coeff c of LSF: y = ax^2 + bx + c
- * \param[out] pmederr [optional] median error
- * \param[out] pnafit [optional] numa of least square fit to ptad
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This does a quadratic least square fit to the set of points
- * in %pta. It then evaluates the errors and removes points
- * whose error is >= factor * median_error. It then re-runs
- * a quadratic LSF on the resulting points.
- *
- */
-l_ok
-ptaNoisyQuadraticLSF(PTA *pta,
- l_float32 factor,
- PTA **pptad,
- l_float32 *pa,
- l_float32 *pb,
- l_float32 *pc,
- l_float32 *pmederr,
- NUMA **pnafit)
-{
-l_int32 n, i, ret;
-l_float32 x, y, yf, val, mederr;
-NUMA *nafit, *naerror;
-PTA *ptad;
-
- PROCNAME("ptaNoisyQuadraticLSF");
-
- if (pptad) *pptad = NULL;
- if (pa) *pa = 0.0;
- if (pb) *pb = 0.0;
- if (pc) *pc = 0.0;
- if (pmederr) *pmederr = 0.0;
- if (pnafit) *pnafit = NULL;
- if (!pptad && !pa && !pb && !pc && !pnafit)
- return ERROR_INT("no output requested", procName, 1);
- if (factor <= 0.0)
- return ERROR_INT("factor must be > 0.0", procName, 1);
- if (!pta)
- return ERROR_INT("pta not defined", procName, 1);
- if ((n = ptaGetCount(pta)) < 3)
- return ERROR_INT("less than 3 pts found", procName, 1);
-
- if (ptaGetQuadraticLSF(pta, NULL, NULL, NULL, &nafit) != 0)
- return ERROR_INT("error in quadratic LSF", procName, 1);
-
- /* Get the median error */
- naerror = numaCreate(n);
- for (i = 0; i < n; i++) {
- ptaGetPt(pta, i, &x, &y);
- numaGetFValue(nafit, i, &yf);
- numaAddNumber(naerror, L_ABS(y - yf));
- }
- numaGetMedian(naerror, &mederr);
- if (pmederr) *pmederr = mederr;
- numaDestroy(&nafit);
-
- /* Remove outliers */
- ptad = ptaCreate(n);
- for (i = 0; i < n; i++) {
- ptaGetPt(pta, i, &x, &y);
- numaGetFValue(naerror, i, &val);
- if (val <= factor * mederr) /* <= in case mederr = 0 */
- ptaAddPt(ptad, x, y);
- }
- numaDestroy(&naerror);
- n = ptaGetCount(ptad);
- if ((n = ptaGetCount(ptad)) < 3) {
- ptaDestroy(&ptad);
- return ERROR_INT("less than 3 pts found", procName, 1);
- }
-
- /* Do LSF again */
- ret = ptaGetQuadraticLSF(ptad, pa, pb, pc, pnafit);
- if (pptad)
- *pptad = ptad;
- else
- ptaDestroy(&ptad);
-
- return ret;
-}
-
-
-/*!
- * \brief applyLinearFit()
- *
- * \param[in] a, b linear fit coefficients
- * \param[in] x
- * \param[out] py y = a * x + b
- * \return 0 if OK, 1 on error
- */
-l_ok
-applyLinearFit(l_float32 a,
- l_float32 b,
- l_float32 x,
- l_float32 *py)
-{
- PROCNAME("applyLinearFit");
-
- if (!py)
- return ERROR_INT("&y not defined", procName, 1);
-
- *py = a * x + b;
- return 0;
-}
-
-
-/*!
- * \brief applyQuadraticFit()
- *
- * \param[in] a, b, c quadratic fit coefficients
- * \param[in] x
- * \param[out] py y = a * x^2 + b * x + c
- * \return 0 if OK, 1 on error
- */
-l_ok
-applyQuadraticFit(l_float32 a,
- l_float32 b,
- l_float32 c,
- l_float32 x,
- l_float32 *py)
-{
- PROCNAME("applyQuadraticFit");
-
- if (!py)
- return ERROR_INT("&y not defined", procName, 1);
-
- *py = a * x * x + b * x + c;
- return 0;
-}
-
-
-/*!
- * \brief applyCubicFit()
- *
- * \param[in] a, b, c, d cubic fit coefficients
- * \param[in] x
- * \param[out] py y = a * x^3 + b * x^2 + c * x + d
- * \return 0 if OK, 1 on error
- */
-l_ok
-applyCubicFit(l_float32 a,
- l_float32 b,
- l_float32 c,
- l_float32 d,
- l_float32 x,
- l_float32 *py)
-{
- PROCNAME("applyCubicFit");
-
- if (!py)
- return ERROR_INT("&y not defined", procName, 1);
-
- *py = a * x * x * x + b * x * x + c * x + d;
- return 0;
-}
-
-
-/*!
- * \brief applyQuarticFit()
- *
- * \param[in] a, b, c, d, e quartic fit coefficients
- * \param[in] x
- * \param[out] py y = a * x^4 + b * x^3 + c * x^2 + d * x + e
- * \return 0 if OK, 1 on error
- */
-l_ok
-applyQuarticFit(l_float32 a,
- l_float32 b,
- l_float32 c,
- l_float32 d,
- l_float32 e,
- l_float32 x,
- l_float32 *py)
-{
-l_float32 x2;
-
- PROCNAME("applyQuarticFit");
-
- if (!py)
- return ERROR_INT("&y not defined", procName, 1);
-
- x2 = x * x;
- *py = a * x2 * x2 + b * x2 * x + c * x2 + d * x + e;
- return 0;
-}
-
-
-/*---------------------------------------------------------------------*
- * Interconversions with Pix *
- *---------------------------------------------------------------------*/
-/*!
- * \brief pixPlotAlongPta()
- *
- * \param[in] pixs any depth
- * \param[in] pta set of points on which to plot
- * \param[in] outformat GPLOT_PNG, GPLOT_PS, GPLOT_EPS, GPLOT_LATEX
- * \param[in] title [optional] for plot; can be null
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This is a debugging function.
- * (2) Removes existing colormaps and clips the pta to the input %pixs.
- * (3) If the image is RGB, three separate plots are generated.
- *
- */
-l_ok
-pixPlotAlongPta(PIX *pixs,
- PTA *pta,
- l_int32 outformat,
- const char *title)
-{
-char buffer[128];
-char *rtitle, *gtitle, *btitle;
-static l_int32 count = 0; /* require separate temp files for each call */
-l_int32 i, x, y, d, w, h, npts, rval, gval, bval;
-l_uint32 val;
-NUMA *na, *nar, *nag, *nab;
-PIX *pixt;
-
- PROCNAME("pixPlotAlongPta");
-
- lept_mkdir("lept/plot");
-
- if (!pixs)
- return ERROR_INT("pixs not defined", procName, 1);
- if (!pta)
- return ERROR_INT("pta not defined", procName, 1);
- if (outformat != GPLOT_PNG && outformat != GPLOT_PS &&
- outformat != GPLOT_EPS && outformat != GPLOT_LATEX) {
- L_WARNING("outformat invalid; using GPLOT_PNG\n", procName);
- outformat = GPLOT_PNG;
- }
-
- pixt = pixRemoveColormap(pixs, REMOVE_CMAP_BASED_ON_SRC);
- d = pixGetDepth(pixt);
- w = pixGetWidth(pixt);
- h = pixGetHeight(pixt);
- npts = ptaGetCount(pta);
- if (d == 32) {
- nar = numaCreate(npts);
- nag = numaCreate(npts);
- nab = numaCreate(npts);
- for (i = 0; i < npts; i++) {
- ptaGetIPt(pta, i, &x, &y);
- if (x < 0 || x >= w)
- continue;
- if (y < 0 || y >= h)
- continue;
- pixGetPixel(pixt, x, y, &val);
- rval = GET_DATA_BYTE(&val, COLOR_RED);
- gval = GET_DATA_BYTE(&val, COLOR_GREEN);
- bval = GET_DATA_BYTE(&val, COLOR_BLUE);
- numaAddNumber(nar, rval);
- numaAddNumber(nag, gval);
- numaAddNumber(nab, bval);
- }
-
- snprintf(buffer, sizeof(buffer), "/tmp/lept/plot/%03d", count++);
- rtitle = stringJoin("Red: ", title);
- gplotSimple1(nar, outformat, buffer, rtitle);
- snprintf(buffer, sizeof(buffer), "/tmp/lept/plot/%03d", count++);
- gtitle = stringJoin("Green: ", title);
- gplotSimple1(nag, outformat, buffer, gtitle);
- snprintf(buffer, sizeof(buffer), "/tmp/lept/plot/%03d", count++);
- btitle = stringJoin("Blue: ", title);
- gplotSimple1(nab, outformat, buffer, btitle);
- numaDestroy(&nar);
- numaDestroy(&nag);
- numaDestroy(&nab);
- LEPT_FREE(rtitle);
- LEPT_FREE(gtitle);
- LEPT_FREE(btitle);
- } else {
- na = numaCreate(npts);
- for (i = 0; i < npts; i++) {
- ptaGetIPt(pta, i, &x, &y);
- if (x < 0 || x >= w)
- continue;
- if (y < 0 || y >= h)
- continue;
- pixGetPixel(pixt, x, y, &val);
- numaAddNumber(na, (l_float32)val);
- }
-
- snprintf(buffer, sizeof(buffer), "/tmp/lept/plot/%03d", count++);
- gplotSimple1(na, outformat, buffer, title);
- numaDestroy(&na);
- }
- pixDestroy(&pixt);
- return 0;
-}
-
-
-/*!
- * \brief ptaGetPixelsFromPix()
- *
- * \param[in] pixs 1 bpp
- * \param[in] box [optional] can be null
- * \return pta, or NULL on error
- *
- *
- * Notes:
- * (1) Generates a pta of fg pixels in the pix, within the box.
- * If box == NULL, it uses the entire pix.
- *
- */
-PTA *
-ptaGetPixelsFromPix(PIX *pixs,
- BOX *box)
-{
-l_int32 i, j, w, h, wpl, xstart, xend, ystart, yend, bw, bh;
-l_uint32 *data, *line;
-PTA *pta;
-
- PROCNAME("ptaGetPixelsFromPix");
-
- if (!pixs || (pixGetDepth(pixs) != 1))
- return (PTA *)ERROR_PTR("pixs undefined or not 1 bpp", procName, NULL);
-
- pixGetDimensions(pixs, &w, &h, NULL);
- data = pixGetData(pixs);
- wpl = pixGetWpl(pixs);
- xstart = ystart = 0;
- xend = w - 1;
- yend = h - 1;
- if (box) {
- boxGetGeometry(box, &xstart, &ystart, &bw, &bh);
- xend = xstart + bw - 1;
- yend = ystart + bh - 1;
- }
-
- if ((pta = ptaCreate(0)) == NULL)
- return (PTA *)ERROR_PTR("pta not made", procName, NULL);
- for (i = ystart; i <= yend; i++) {
- line = data + i * wpl;
- for (j = xstart; j <= xend; j++) {
- if (GET_DATA_BIT(line, j))
- ptaAddPt(pta, j, i);
- }
- }
-
- return pta;
-}
-
-
-/*!
- * \brief pixGenerateFromPta()
- *
- * \param[in] pta
- * \param[in] w, h of pix
- * \return pix 1 bpp, or NULL on error
- *
- *
- * Notes:
- * (1) Points are rounded to nearest ints.
- * (2) Any points outside (w,h) are silently discarded.
- * (3) Output 1 bpp pix has values 1 for each point in the pta.
- *
- */
-PIX *
-pixGenerateFromPta(PTA *pta,
- l_int32 w,
- l_int32 h)
-{
-l_int32 n, i, x, y;
-PIX *pix;
-
- PROCNAME("pixGenerateFromPta");
-
- if (!pta)
- return (PIX *)ERROR_PTR("pta not defined", procName, NULL);
-
- if ((pix = pixCreate(w, h, 1)) == NULL)
- return (PIX *)ERROR_PTR("pix not made", procName, NULL);
- n = ptaGetCount(pta);
- for (i = 0; i < n; i++) {
- ptaGetIPt(pta, i, &x, &y);
- if (x < 0 || x >= w || y < 0 || y >= h)
- continue;
- pixSetPixel(pix, x, y, 1);
- }
-
- return pix;
-}
-
-
-/*!
- * \brief ptaGetBoundaryPixels()
- *
- * \param[in] pixs 1 bpp
- * \param[in] type L_BOUNDARY_FG, L_BOUNDARY_BG
- * \return pta, or NULL on error
- *
- *
- * Notes:
- * (1) This generates a pta of either fg or bg boundary pixels.
- * (2) See also pixGeneratePtaBoundary() for rendering of
- * fg boundary pixels.
- *
- */
-PTA *
-ptaGetBoundaryPixels(PIX *pixs,
- l_int32 type)
-{
-PIX *pixt;
-PTA *pta;
-
- PROCNAME("ptaGetBoundaryPixels");
-
- if (!pixs || (pixGetDepth(pixs) != 1))
- return (PTA *)ERROR_PTR("pixs undefined or not 1 bpp", procName, NULL);
- if (type != L_BOUNDARY_FG && type != L_BOUNDARY_BG)
- return (PTA *)ERROR_PTR("invalid type", procName, NULL);
-
- if (type == L_BOUNDARY_FG)
- pixt = pixMorphSequence(pixs, "e3.3", 0);
- else
- pixt = pixMorphSequence(pixs, "d3.3", 0);
- pixXor(pixt, pixt, pixs);
- pta = ptaGetPixelsFromPix(pixt, NULL);
-
- pixDestroy(&pixt);
- return pta;
-}
-
-
-/*!
- * \brief ptaaGetBoundaryPixels()
- *
- * \param[in] pixs 1 bpp
- * \param[in] type L_BOUNDARY_FG, L_BOUNDARY_BG
- * \param[in] connectivity 4 or 8
- * \param[out] pboxa [optional] bounding boxes of the c.c.
- * \param[out] ppixa [optional] pixa of the c.c.
- * \return ptaa, or NULL on error
- *
- *
- * Notes:
- * (1) This generates a ptaa of either fg or bg boundary pixels,
- * where each pta has the boundary pixels for a connected
- * component.
- * (2) We can't simply find all the boundary pixels and then select
- * those within the bounding box of each component, because
- * bounding boxes can overlap. It is necessary to extract and
- * dilate or erode each component separately. Note also that
- * special handling is required for bg pixels when the
- * component touches the pix boundary.
- *
- */
-PTAA *
-ptaaGetBoundaryPixels(PIX *pixs,
- l_int32 type,
- l_int32 connectivity,
- BOXA **pboxa,
- PIXA **ppixa)
-{
-l_int32 i, n, w, h, x, y, bw, bh, left, right, top, bot;
-BOXA *boxa;
-PIX *pixt1, *pixt2;
-PIXA *pixa;
-PTA *pta1, *pta2;
-PTAA *ptaa;
-
- PROCNAME("ptaaGetBoundaryPixels");
-
- if (pboxa) *pboxa = NULL;
- if (ppixa) *ppixa = NULL;
- if (!pixs || (pixGetDepth(pixs) != 1))
- return (PTAA *)ERROR_PTR("pixs undefined or not 1 bpp", procName, NULL);
- if (type != L_BOUNDARY_FG && type != L_BOUNDARY_BG)
- return (PTAA *)ERROR_PTR("invalid type", procName, NULL);
- if (connectivity != 4 && connectivity != 8)
- return (PTAA *)ERROR_PTR("connectivity not 4 or 8", procName, NULL);
-
- pixGetDimensions(pixs, &w, &h, NULL);
- boxa = pixConnComp(pixs, &pixa, connectivity);
- n = boxaGetCount(boxa);
- ptaa = ptaaCreate(0);
- for (i = 0; i < n; i++) {
- pixt1 = pixaGetPix(pixa, i, L_CLONE);
- boxaGetBoxGeometry(boxa, i, &x, &y, &bw, &bh);
- left = right = top = bot = 0;
- if (type == L_BOUNDARY_BG) {
- if (x > 0) left = 1;
- if (y > 0) top = 1;
- if (x + bw < w) right = 1;
- if (y + bh < h) bot = 1;
- pixt2 = pixAddBorderGeneral(pixt1, left, right, top, bot, 0);
- } else {
- pixt2 = pixClone(pixt1);
- }
- pta1 = ptaGetBoundaryPixels(pixt2, type);
- pta2 = ptaTransform(pta1, x - left, y - top, 1.0, 1.0);
- ptaaAddPta(ptaa, pta2, L_INSERT);
- ptaDestroy(&pta1);
- pixDestroy(&pixt1);
- pixDestroy(&pixt2);
- }
-
- if (pboxa)
- *pboxa = boxa;
- else
- boxaDestroy(&boxa);
- if (ppixa)
- *ppixa = pixa;
- else
- pixaDestroy(&pixa);
- return ptaa;
-}
-
-
-/*!
- * \brief ptaaIndexLabeledPixels()
- *
- * \param[in] pixs 32 bpp, of indices of c.c.
- * \param[out] pncc [optional] number of connected components
- * \return ptaa, or NULL on error
- *
- *
- * Notes:
- * (1) The pixel values in %pixs are the index of the connected component
- * to which the pixel belongs; %pixs is typically generated from
- * a 1 bpp pix by pixConnCompTransform(). Background pixels in
- * the generating 1 bpp pix are represented in %pixs by 0.
- * We do not check that the pixel values are correctly labelled.
- * (2) Each pta in the returned ptaa gives the pixel locations
- * correspnding to a connected component, with the label of each
- * given by the index of the pta into the ptaa.
- * (3) Initialize with the first pta in ptaa being empty and
- * representing the background value (index 0) in the pix.
- *
- */
-PTAA *
-ptaaIndexLabeledPixels(PIX *pixs,
- l_int32 *pncc)
-{
-l_int32 wpl, index, i, j, w, h;
-l_uint32 maxval;
-l_uint32 *data, *line;
-PTA *pta;
-PTAA *ptaa;
-
- PROCNAME("ptaaIndexLabeledPixels");
-
- if (pncc) *pncc = 0;
- if (!pixs || (pixGetDepth(pixs) != 32))
- return (PTAA *)ERROR_PTR("pixs undef or not 32 bpp", procName, NULL);
-
- /* The number of c.c. is the maximum pixel value. Use this to
- * initialize ptaa with sufficient pta arrays */
- pixGetMaxValueInRect(pixs, NULL, &maxval, NULL, NULL);
- if (pncc) *pncc = maxval;
- pta = ptaCreate(1);
- ptaa = ptaaCreate(maxval + 1);
- ptaaInitFull(ptaa, pta);
- ptaDestroy(&pta);
-
- /* Sweep over %pixs, saving the pixel coordinates of each pixel
- * with nonzero value in the appropriate pta, indexed by that value. */
- pixGetDimensions(pixs, &w, &h, NULL);
- data = pixGetData(pixs);
- wpl = pixGetWpl(pixs);
- for (i = 0; i < h; i++) {
- line = data + wpl * i;
- for (j = 0; j < w; j++) {
- index = line[j];
- if (index > 0)
- ptaaAddPt(ptaa, index, j, i);
- }
- }
-
- return ptaa;
-}
-
-
-/*!
- * \brief ptaGetNeighborPixLocs()
- *
- * \param[in] pixs any depth
- * \param[in] x, y pixel from which we search for nearest neighbors
- * \param[in] conn 4 or 8 connectivity
- * \return pta, or NULL on error
- *
- *
- * Notes:
- * (1) Generates a pta of all valid neighbor pixel locations,
- * or NULL on error.
- *
- */
-PTA *
-ptaGetNeighborPixLocs(PIX *pixs,
- l_int32 x,
- l_int32 y,
- l_int32 conn)
-{
-l_int32 w, h;
-PTA *pta;
-
- PROCNAME("ptaGetNeighborPixLocs");
-
- if (!pixs)
- return (PTA *)ERROR_PTR("pixs not defined", procName, NULL);
- pixGetDimensions(pixs, &w, &h, NULL);
- if (x < 0 || x >= w || y < 0 || y >= h)
- return (PTA *)ERROR_PTR("(x,y) not in pixs", procName, NULL);
- if (conn != 4 && conn != 8)
- return (PTA *)ERROR_PTR("conn not 4 or 8", procName, NULL);
-
- pta = ptaCreate(conn);
- if (x > 0)
- ptaAddPt(pta, x - 1, y);
- if (x < w - 1)
- ptaAddPt(pta, x + 1, y);
- if (y > 0)
- ptaAddPt(pta, x, y - 1);
- if (y < h - 1)
- ptaAddPt(pta, x, y + 1);
- if (conn == 8) {
- if (x > 0) {
- if (y > 0)
- ptaAddPt(pta, x - 1, y - 1);
- if (y < h - 1)
- ptaAddPt(pta, x - 1, y + 1);
- }
- if (x < w - 1) {
- if (y > 0)
- ptaAddPt(pta, x + 1, y - 1);
- if (y < h - 1)
- ptaAddPt(pta, x + 1, y + 1);
- }
- }
-
- return pta;
-}
-
-
-/*---------------------------------------------------------------------*
- * Interconversion with Numa *
- *---------------------------------------------------------------------*/
-/*!
- * \brief numaConvertToPta1()
- *
- * \param[in] na numa with implicit y(x)
- * \return pta if OK; null on error
- */
-PTA *
-numaConvertToPta1(NUMA *na)
-{
-l_int32 i, n;
-l_float32 startx, delx, val;
-PTA *pta;
-
- PROCNAME("numaConvertToPta1");
-
- if (!na)
- return (PTA *)ERROR_PTR("na not defined", procName, NULL);
-
- n = numaGetCount(na);
- pta = ptaCreate(n);
- numaGetParameters(na, &startx, &delx);
- for (i = 0; i < n; i++) {
- numaGetFValue(na, i, &val);
- ptaAddPt(pta, startx + i * delx, val);
- }
- return pta;
-}
-
-
-/*!
- * \brief numaConvertToPta2()
- *
- * \param[in] nax
- * \param[in] nay
- * \return pta if OK; null on error
- */
-PTA *
-numaConvertToPta2(NUMA *nax,
- NUMA *nay)
-{
-l_int32 i, n, nx, ny;
-l_float32 valx, valy;
-PTA *pta;
-
- PROCNAME("numaConvertToPta2");
-
- if (!nax || !nay)
- return (PTA *)ERROR_PTR("nax and nay not both defined", procName, NULL);
-
- nx = numaGetCount(nax);
- ny = numaGetCount(nay);
- n = L_MIN(nx, ny);
- if (nx != ny)
- L_WARNING("nx = %d does not equal ny = %d\n", procName, nx, ny);
- pta = ptaCreate(n);
- for (i = 0; i < n; i++) {
- numaGetFValue(nax, i, &valx);
- numaGetFValue(nay, i, &valy);
- ptaAddPt(pta, valx, valy);
- }
- return pta;
-}
-
-
-/*!
- * \brief ptaConvertToNuma()
- *
- * \param[in] pta
- * \param[out] pnax addr of nax
- * \param[out] pnay addr of nay
- * \return 0 if OK, 1 on error
- */
-l_ok
-ptaConvertToNuma(PTA *pta,
- NUMA **pnax,
- NUMA **pnay)
-{
-l_int32 i, n;
-l_float32 valx, valy;
-
- PROCNAME("ptaConvertToNuma");
-
- if (pnax) *pnax = NULL;
- if (pnay) *pnay = NULL;
- if (!pnax || !pnay)
- return ERROR_INT("&nax and &nay not both defined", procName, 1);
- if (!pta)
- return ERROR_INT("pta not defined", procName, 1);
-
- n = ptaGetCount(pta);
- *pnax = numaCreate(n);
- *pnay = numaCreate(n);
- for (i = 0; i < n; i++) {
- ptaGetPt(pta, i, &valx, &valy);
- numaAddNumber(*pnax, valx);
- numaAddNumber(*pnay, valy);
- }
- return 0;
-}
-
-
-/*---------------------------------------------------------------------*
- * Display Pta and Ptaa *
- *---------------------------------------------------------------------*/
-/*!
- * \brief pixDisplayPta()
- *
- * \param[in] pixd can be same as pixs or NULL; 32 bpp if in-place
- * \param[in] pixs 1, 2, 4, 8, 16 or 32 bpp
- * \param[in] pta of path to be plotted
- * \return pixd 32 bpp RGB version of pixs, with path in green.
- *
- *
- * Notes:
- * (1) To write on an existing pixs, pixs must be 32 bpp and
- * call with pixd == pixs:
- * pixDisplayPta(pixs, pixs, pta);
- * To write to a new pix, use pixd == NULL and call:
- * pixd = pixDisplayPta(NULL, pixs, pta);
- * (2) On error, returns pixd to avoid losing pixs if called as
- * pixs = pixDisplayPta(pixs, pixs, pta);
- *
- */
-PIX *
-pixDisplayPta(PIX *pixd,
- PIX *pixs,
- PTA *pta)
-{
-l_int32 i, n, w, h, x, y;
-l_uint32 rpixel, gpixel, bpixel;
-
- PROCNAME("pixDisplayPta");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, pixd);
- if (!pta)
- return (PIX *)ERROR_PTR("pta not defined", procName, pixd);
- if (pixd && (pixd != pixs || pixGetDepth(pixd) != 32))
- return (PIX *)ERROR_PTR("invalid pixd", procName, pixd);
-
- if (!pixd)
- pixd = pixConvertTo32(pixs);
- pixGetDimensions(pixd, &w, &h, NULL);
- composeRGBPixel(255, 0, 0, &rpixel); /* start point */
- composeRGBPixel(0, 255, 0, &gpixel);
- composeRGBPixel(0, 0, 255, &bpixel); /* end point */
-
- n = ptaGetCount(pta);
- for (i = 0; i < n; i++) {
- ptaGetIPt(pta, i, &x, &y);
- if (x < 0 || x >= w || y < 0 || y >= h)
- continue;
- if (i == 0)
- pixSetPixel(pixd, x, y, rpixel);
- else if (i < n - 1)
- pixSetPixel(pixd, x, y, gpixel);
- else
- pixSetPixel(pixd, x, y, bpixel);
- }
-
- return pixd;
-}
-
-
-/*!
- * \brief pixDisplayPtaaPattern()
- *
- * \param[in] pixd 32 bpp
- * \param[in] pixs 1, 2, 4, 8, 16 or 32 bpp; 32 bpp if in place
- * \param[in] ptaa giving locations at which the pattern is displayed
- * \param[in] pixp 1 bpp pattern to be placed such that its reference
- * point co-locates with each point in pta
- * \param[in] cx, cy reference point in pattern
- * \return pixd 32 bpp RGB version of pixs.
- *
- *
- * Notes:
- * (1) To write on an existing pixs, pixs must be 32 bpp and
- * call with pixd == pixs:
- * pixDisplayPtaPattern(pixs, pixs, pta, ...);
- * To write to a new pix, use pixd == NULL and call:
- * pixd = pixDisplayPtaPattern(NULL, pixs, pta, ...);
- * (2) Puts a random color on each pattern associated with a pta.
- * (3) On error, returns pixd to avoid losing pixs if called as
- * pixs = pixDisplayPtaPattern(pixs, pixs, pta, ...);
- * (4) A typical pattern to be used is a circle, generated with
- * generatePtaFilledCircle()
- *
- */
-PIX *
-pixDisplayPtaaPattern(PIX *pixd,
- PIX *pixs,
- PTAA *ptaa,
- PIX *pixp,
- l_int32 cx,
- l_int32 cy)
-{
-l_int32 i, n;
-l_uint32 color;
-PIXCMAP *cmap;
-PTA *pta;
-
- PROCNAME("pixDisplayPtaaPattern");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, pixd);
- if (!ptaa)
- return (PIX *)ERROR_PTR("ptaa not defined", procName, pixd);
- if (pixd && (pixd != pixs || pixGetDepth(pixd) != 32))
- return (PIX *)ERROR_PTR("invalid pixd", procName, pixd);
- if (!pixp)
- return (PIX *)ERROR_PTR("pixp not defined", procName, pixd);
-
- if (!pixd)
- pixd = pixConvertTo32(pixs);
-
- /* Use 256 random colors */
- cmap = pixcmapCreateRandom(8, 0, 0);
- n = ptaaGetCount(ptaa);
- for (i = 0; i < n; i++) {
- pixcmapGetColor32(cmap, i % 256, &color);
- pta = ptaaGetPta(ptaa, i, L_CLONE);
- pixDisplayPtaPattern(pixd, pixd, pta, pixp, cx, cy, color);
- ptaDestroy(&pta);
- }
-
- pixcmapDestroy(&cmap);
- return pixd;
-}
-
-
-/*!
- * \brief pixDisplayPtaPattern()
- *
- * \param[in] pixd can be same as pixs or NULL; 32 bpp if in-place
- * \param[in] pixs 1, 2, 4, 8, 16 or 32 bpp
- * \param[in] pta giving locations at which the pattern is displayed
- * \param[in] pixp 1 bpp pattern to be placed such that its reference
- * point co-locates with each point in pta
- * \param[in] cx, cy reference point in pattern
- * \param[in] color in 0xrrggbb00 format
- * \return pixd 32 bpp RGB version of pixs.
- *
- *
- * Notes:
- * (1) To write on an existing pixs, pixs must be 32 bpp and
- * call with pixd == pixs:
- * pixDisplayPtaPattern(pixs, pixs, pta, ...);
- * To write to a new pix, use pixd == NULL and call:
- * pixd = pixDisplayPtaPattern(NULL, pixs, pta, ...);
- * (2) On error, returns pixd to avoid losing pixs if called as
- * pixs = pixDisplayPtaPattern(pixs, pixs, pta, ...);
- * (3) A typical pattern to be used is a circle, generated with
- * generatePtaFilledCircle()
- *
- */
-PIX *
-pixDisplayPtaPattern(PIX *pixd,
- PIX *pixs,
- PTA *pta,
- PIX *pixp,
- l_int32 cx,
- l_int32 cy,
- l_uint32 color)
-{
-l_int32 i, n, w, h, x, y;
-PTA *ptat;
-
- PROCNAME("pixDisplayPtaPattern");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, pixd);
- if (!pta)
- return (PIX *)ERROR_PTR("pta not defined", procName, pixd);
- if (pixd && (pixd != pixs || pixGetDepth(pixd) != 32))
- return (PIX *)ERROR_PTR("invalid pixd", procName, pixd);
- if (!pixp)
- return (PIX *)ERROR_PTR("pixp not defined", procName, pixd);
-
- if (!pixd)
- pixd = pixConvertTo32(pixs);
- pixGetDimensions(pixs, &w, &h, NULL);
- ptat = ptaReplicatePattern(pta, pixp, NULL, cx, cy, w, h);
-
- n = ptaGetCount(ptat);
- for (i = 0; i < n; i++) {
- ptaGetIPt(ptat, i, &x, &y);
- if (x < 0 || x >= w || y < 0 || y >= h)
- continue;
- pixSetPixel(pixd, x, y, color);
- }
-
- ptaDestroy(&ptat);
- return pixd;
-}
-
-
-/*!
- * \brief ptaReplicatePattern()
- *
- * \param[in] ptas "sparse" input pta
- * \param[in] pixp [optional] 1 bpp pattern, to be replicated
- * in output pta
- * \param[in] ptap [optional] set of pts, to be replicated in output pta
- * \param[in] cx, cy reference point in pattern
- * \param[in] w, h clipping sizes for output pta
- * \return ptad with all points of replicated pattern, or NULL on error
- *
- *
- * Notes:
- * (1) You can use either the image %pixp or the set of pts %ptap.
- * (2) The pattern is placed with its reference point at each point
- * in ptas, and all the fg pixels are colleced into ptad.
- * For %pixp, this is equivalent to blitting pixp at each point
- * in ptas, and then converting the resulting pix to a pta.
- *
- */
-PTA *
-ptaReplicatePattern(PTA *ptas,
- PIX *pixp,
- PTA *ptap,
- l_int32 cx,
- l_int32 cy,
- l_int32 w,
- l_int32 h)
-{
-l_int32 i, j, n, np, x, y, xp, yp, xf, yf;
-PTA *ptat, *ptad;
-
- PROCNAME("ptaReplicatePattern");
-
- if (!ptas)
- return (PTA *)ERROR_PTR("ptas not defined", procName, NULL);
- if (!pixp && !ptap)
- return (PTA *)ERROR_PTR("no pattern is defined", procName, NULL);
- if (pixp && ptap)
- L_WARNING("pixp and ptap defined; using ptap\n", procName);
-
- n = ptaGetCount(ptas);
- ptad = ptaCreate(n);
- if (ptap)
- ptat = ptaClone(ptap);
- else
- ptat = ptaGetPixelsFromPix(pixp, NULL);
- np = ptaGetCount(ptat);
- for (i = 0; i < n; i++) {
- ptaGetIPt(ptas, i, &x, &y);
- for (j = 0; j < np; j++) {
- ptaGetIPt(ptat, j, &xp, &yp);
- xf = x - cx + xp;
- yf = y - cy + yp;
- if (xf >= 0 && xf < w && yf >= 0 && yf < h)
- ptaAddPt(ptad, xf, yf);
- }
- }
-
- ptaDestroy(&ptat);
- return ptad;
-}
-
-
-/*!
- * \brief pixDisplayPtaa()
- *
- * \param[in] pixs 1, 2, 4, 8, 16 or 32 bpp
- * \param[in] ptaa array of paths to be plotted
- * \return pixd 32 bpp RGB version of pixs, with paths plotted
- * in different colors, or NULL on error
- */
-PIX *
-pixDisplayPtaa(PIX *pixs,
- PTAA *ptaa)
-{
-l_int32 i, j, w, h, npta, npt, x, y, rv, gv, bv;
-l_uint32 *pixela;
-NUMA *na1, *na2, *na3;
-PIX *pixd;
-PTA *pta;
-
- PROCNAME("pixDisplayPtaa");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- if (!ptaa)
- return (PIX *)ERROR_PTR("ptaa not defined", procName, NULL);
- npta = ptaaGetCount(ptaa);
- if (npta == 0)
- return (PIX *)ERROR_PTR("no pta", procName, NULL);
-
- if ((pixd = pixConvertTo32(pixs)) == NULL)
- return (PIX *)ERROR_PTR("pixd not made", procName, NULL);
- pixGetDimensions(pixd, &w, &h, NULL);
-
- /* Make a colormap for the paths */
- if ((pixela = (l_uint32 *)LEPT_CALLOC(npta, sizeof(l_uint32))) == NULL) {
- pixDestroy(&pixd);
- return (PIX *)ERROR_PTR("calloc fail for pixela", procName, NULL);
- }
- na1 = numaPseudorandomSequence(256, 14657);
- na2 = numaPseudorandomSequence(256, 34631);
- na3 = numaPseudorandomSequence(256, 54617);
- for (i = 0; i < npta; i++) {
- numaGetIValue(na1, i % 256, &rv);
- numaGetIValue(na2, i % 256, &gv);
- numaGetIValue(na3, i % 256, &bv);
- composeRGBPixel(rv, gv, bv, &pixela[i]);
- }
- numaDestroy(&na1);
- numaDestroy(&na2);
- numaDestroy(&na3);
-
- for (i = 0; i < npta; i++) {
- pta = ptaaGetPta(ptaa, i, L_CLONE);
- npt = ptaGetCount(pta);
- for (j = 0; j < npt; j++) {
- ptaGetIPt(pta, j, &x, &y);
- if (x < 0 || x >= w || y < 0 || y >= h)
- continue;
- pixSetPixel(pixd, x, y, pixela[i]);
- }
- ptaDestroy(&pta);
- }
-
- LEPT_FREE(pixela);
- return pixd;
-}
diff --git a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/ptafunc2.c b/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/ptafunc2.c
deleted file mode 100644
index 1949a6cf..00000000
--- a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/ptafunc2.c
+++ /dev/null
@@ -1,899 +0,0 @@
-/*====================================================================*
- - Copyright (C) 2001 Leptonica. All rights reserved.
- -
- - Redistribution and use in source and binary forms, with or without
- - modification, are permitted provided that the following conditions
- - are met:
- - 1. Redistributions of source code must retain the above copyright
- - notice, this list of conditions and the following disclaimer.
- - 2. Redistributions in binary form must reproduce the above
- - copyright notice, this list of conditions and the following
- - disclaimer in the documentation and/or other materials
- - provided with the distribution.
- -
- - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- - ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- - LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- - A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL ANY
- - CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
- - EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
- - PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
- - PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
- - OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
- - NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- *====================================================================*/
-
-/*!
- * \file ptafunc2.c
- *
- *
- * --------------------------------------
- * This file has these Pta utilities:
- * - sorting
- * - ordered set operations
- * - hash map operations
- * --------------------------------------
- *
- * Sorting
- * PTA *ptaSort()
- * l_int32 ptaGetSortIndex()
- * PTA *ptaSortByIndex()
- * PTAA *ptaaSortByIndex()
- * l_int32 ptaGetRankValue()
- * PTA *ptaSort2d()
- * l_int32 ptaEqual()
- *
- * Set operations using aset (rbtree)
- * PTA *ptaUnionByAset()
- * PTA *ptaRemoveDupsByAset()
- * PTA *ptaIntersectionByAset()
- * L_ASET *l_asetCreateFromPta()
- *
- * Set operations using hashing (dnahash)
- * PTA *ptaUnionByHash()
- * l_int32 ptaRemoveDupsByHash()
- * PTA *ptaIntersectionByHash();
- * l_int32 ptaFindPtByHash()
- * L_DNAHASH *l_dnaHashCreateFromPta()
- *
- *
- * We have two implementations of set operations on an array of points:
- *
- * (1) Using an underlying tree (rbtree)
- * This uses a good 64 bit hashing function for the key,
- * that is not expected to have hash collisions (and we do
- * not test for them). The tree is built up of the hash
- * values, and if the hash is found in the tree, it is
- * assumed that the point has already been found.
- *
- * (2) Using an underlying hashing of the keys (dnahash)
- * This uses a fast 64 bit hashing function for the key,
- * which is then hashed into a bucket (a dna in a dnaHash).
- * Because hash collisions can occur, the index into the
- * pta for the point that gave rise to that key is stored,
- * and the dna (bucket) is traversed, using the stored indices
- * to determine if that point had already been seen.
- *
- *
- */
-
-#ifdef HAVE_CONFIG_H
-#include
-#endif /* HAVE_CONFIG_H */
-
-#include "allheaders.h"
-
-/*---------------------------------------------------------------------*
- * Sorting *
- *---------------------------------------------------------------------*/
-/*!
- * \brief ptaSort()
- *
- * \param[in] ptas
- * \param[in] sorttype L_SORT_BY_X, L_SORT_BY_Y
- * \param[in] sortorder L_SORT_INCREASING, L_SORT_DECREASING
- * \param[out] pnaindex [optional] index of sorted order into
- * original array
- * \return ptad sorted version of ptas, or NULL on error
- */
-PTA *
-ptaSort(PTA *ptas,
- l_int32 sorttype,
- l_int32 sortorder,
- NUMA **pnaindex)
-{
-PTA *ptad;
-NUMA *naindex;
-
- PROCNAME("ptaSort");
-
- if (pnaindex) *pnaindex = NULL;
- if (!ptas)
- return (PTA *)ERROR_PTR("ptas not defined", procName, NULL);
- if (sorttype != L_SORT_BY_X && sorttype != L_SORT_BY_Y)
- return (PTA *)ERROR_PTR("invalid sort type", procName, NULL);
- if (sortorder != L_SORT_INCREASING && sortorder != L_SORT_DECREASING)
- return (PTA *)ERROR_PTR("invalid sort order", procName, NULL);
-
- if (ptaGetSortIndex(ptas, sorttype, sortorder, &naindex) != 0)
- return (PTA *)ERROR_PTR("naindex not made", procName, NULL);
-
- ptad = ptaSortByIndex(ptas, naindex);
- if (pnaindex)
- *pnaindex = naindex;
- else
- numaDestroy(&naindex);
- if (!ptad)
- return (PTA *)ERROR_PTR("ptad not made", procName, NULL);
- return ptad;
-}
-
-
-/*!
- * \brief ptaGetSortIndex()
- *
- * \param[in] ptas
- * \param[in] sorttype L_SORT_BY_X, L_SORT_BY_Y
- * \param[in] sortorder L_SORT_INCREASING, L_SORT_DECREASING
- * \param[out] pnaindex index of sorted order into original array
- * \return 0 if OK, 1 on error
- */
-l_ok
-ptaGetSortIndex(PTA *ptas,
- l_int32 sorttype,
- l_int32 sortorder,
- NUMA **pnaindex)
-{
-l_int32 i, n;
-l_float32 x, y;
-NUMA *na, *nai;
-
- PROCNAME("ptaGetSortIndex");
-
- if (!pnaindex)
- return ERROR_INT("&naindex not defined", procName, 1);
- *pnaindex = NULL;
- if (!ptas)
- return ERROR_INT("ptas not defined", procName, 1);
- if (sorttype != L_SORT_BY_X && sorttype != L_SORT_BY_Y)
- return ERROR_INT("invalid sort type", procName, 1);
- if (sortorder != L_SORT_INCREASING && sortorder != L_SORT_DECREASING)
- return ERROR_INT("invalid sort order", procName, 1);
-
- /* Build up numa of specific data */
- n = ptaGetCount(ptas);
- if ((na = numaCreate(n)) == NULL)
- return ERROR_INT("na not made", procName, 1);
- for (i = 0; i < n; i++) {
- ptaGetPt(ptas, i, &x, &y);
- if (sorttype == L_SORT_BY_X)
- numaAddNumber(na, x);
- else
- numaAddNumber(na, y);
- }
-
- /* Get the sort index for data array */
- nai = numaGetSortIndex(na, sortorder);
- numaDestroy(&na);
- if (!nai)
- return ERROR_INT("naindex not made", procName, 1);
- *pnaindex = nai;
- return 0;
-}
-
-
-/*!
- * \brief ptaSortByIndex()
- *
- * \param[in] ptas
- * \param[in] naindex na that maps from the new pta to the input pta
- * \return ptad sorted, or NULL on error
- */
-PTA *
-ptaSortByIndex(PTA *ptas,
- NUMA *naindex)
-{
-l_int32 i, index, n;
-l_float32 x, y;
-PTA *ptad;
-
- PROCNAME("ptaSortByIndex");
-
- if (!ptas)
- return (PTA *)ERROR_PTR("ptas not defined", procName, NULL);
- if (!naindex)
- return (PTA *)ERROR_PTR("naindex not defined", procName, NULL);
-
- /* Build up sorted pta using sort index */
- n = numaGetCount(naindex);
- if ((ptad = ptaCreate(n)) == NULL)
- return (PTA *)ERROR_PTR("ptad not made", procName, NULL);
- for (i = 0; i < n; i++) {
- numaGetIValue(naindex, i, &index);
- ptaGetPt(ptas, index, &x, &y);
- ptaAddPt(ptad, x, y);
- }
-
- return ptad;
-}
-
-
-/*!
- * \brief ptaaSortByIndex()
- *
- * \param[in] ptaas
- * \param[in] naindex na that maps from the new ptaa to the input ptaa
- * \return ptaad sorted, or NULL on error
- */
-PTAA *
-ptaaSortByIndex(PTAA *ptaas,
- NUMA *naindex)
-{
-l_int32 i, n, index;
-PTA *pta;
-PTAA *ptaad;
-
- PROCNAME("ptaaSortByIndex");
-
- if (!ptaas)
- return (PTAA *)ERROR_PTR("ptaas not defined", procName, NULL);
- if (!naindex)
- return (PTAA *)ERROR_PTR("naindex not defined", procName, NULL);
-
- n = ptaaGetCount(ptaas);
- if (numaGetCount(naindex) != n)
- return (PTAA *)ERROR_PTR("numa and ptaa sizes differ", procName, NULL);
- ptaad = ptaaCreate(n);
- for (i = 0; i < n; i++) {
- numaGetIValue(naindex, i, &index);
- pta = ptaaGetPta(ptaas, index, L_COPY);
- ptaaAddPta(ptaad, pta, L_INSERT);
- }
-
- return ptaad;
-}
-
-
-/*!
- * \brief ptaGetRankValue()
- *
- * \param[in] pta
- * \param[in] fract use 0.0 for smallest, 1.0 for largest
- * \param[in] ptasort [optional] version of %pta sorted by %sorttype
- * \param[in] sorttype L_SORT_BY_X, L_SORT_BY_Y
- * \param[out] pval rankval: the x or y value at %fract
- * \return 0 if OK, 1 on error
- */
-l_ok
-ptaGetRankValue(PTA *pta,
- l_float32 fract,
- PTA *ptasort,
- l_int32 sorttype,
- l_float32 *pval)
-{
-l_int32 index, n;
-PTA *ptas;
-
- PROCNAME("ptaGetRankValue");
-
- if (!pval)
- return ERROR_INT("&val not defined", procName, 1);
- *pval = 0.0;
- if (!pta)
- return ERROR_INT("pta not defined", procName, 1);
- if (sorttype != L_SORT_BY_X && sorttype != L_SORT_BY_Y)
- return ERROR_INT("invalid sort type", procName, 1);
- if (fract < 0.0 || fract > 1.0)
- return ERROR_INT("fract not in [0.0 ... 1.0]", procName, 1);
- if ((n = ptaGetCount(pta)) == 0)
- return ERROR_INT("pta empty", procName, 1);
-
- if (ptasort)
- ptas = ptasort;
- else
- ptas = ptaSort(pta, sorttype, L_SORT_INCREASING, NULL);
-
- index = (l_int32)(fract * (l_float32)(n - 1) + 0.5);
- if (sorttype == L_SORT_BY_X)
- ptaGetPt(ptas, index, pval, NULL);
- else /* sort by y */
- ptaGetPt(ptas, index, NULL, pval);
-
- if (!ptasort) ptaDestroy(&ptas);
- return 0;
-}
-
-
-/*!
- * \brief ptaSort2d()
- *
- * \param[in] ptas
- * \return ptad, or NULL on error
- *
- *
- * Notes:
- * (1) Sort increasing by row-major, scanning down from the UL corner,
- * where for each value of y, order the pts from left to right.
- *
- */
-PTA *
-ptaSort2d(PTA *pta)
-{
-l_int32 index, i, j, n, nx, ny, start, end;
-l_float32 x, y, yp, val;
-NUMA *na1, *na2, *nas, *nax;
-PTA *pta1, *ptad;
-
- PROCNAME("ptaSort2d");
-
- if (!pta)
- return (PTA *)ERROR_PTR("pta not defined", procName, NULL);
-
- /* Sort by row-major (y first, then x). After sort by y,
- * the x values at the same y are not sorted. */
- pta1 = ptaSort(pta, L_SORT_BY_Y, L_SORT_INCREASING, NULL);
-
- /* Find start and ending indices with the same y value */
- n = ptaGetCount(pta1);
- na1 = numaCreate(0); /* holds start index of sequence with same y */
- na2 = numaCreate(0); /* holds end index of sequence with same y */
- numaAddNumber(na1, 0);
- ptaGetPt(pta1, 0, &x, &yp);
- for (i = 1; i < n; i++) {
- ptaGetPt(pta1, i, &x, &y);
- if (y != yp) {
- numaAddNumber(na1, i);
- numaAddNumber(na2, i - 1);
- }
- yp = y;
- }
- numaAddNumber(na2, n - 1);
-
- /* Sort by increasing x each set with the same y value */
- ptad = ptaCreate(n);
- ny = numaGetCount(na1); /* number of distinct y values */
- for (i = 0, index = 0; i < ny; i++) {
- numaGetIValue(na1, i, &start);
- numaGetIValue(na2, i, &end);
- nx = end - start + 1; /* number of points with current y value */
- if (nx == 1) {
- ptaGetPt(pta1, index++, &x, &y);
- ptaAddPt(ptad, x, y);
- } else {
- /* More than 1 point; extract and sort the x values */
- nax = numaCreate(nx);
- for (j = 0; j < nx; j++) {
- ptaGetPt(pta1, index + j, &x, &y);
- numaAddNumber(nax, x);
- }
- nas = numaSort(NULL, nax, L_SORT_INCREASING);
- /* Add the points with x sorted */
- for (j = 0; j < nx; j++) {
- numaGetFValue(nas, j, &val);
- ptaAddPt(ptad, val, y);
- }
- index += nx;
- numaDestroy(&nax);
- numaDestroy(&nas);
- }
- }
- numaDestroy(&na1);
- numaDestroy(&na2);
- ptaDestroy(&pta1);
- return ptad;
-}
-
-
-/*!
- * \brief ptaEqual()
- *
- * \param[in] pta1
- * \param[in] pta2
- * \param[out] psame 1 if same; 0 if different
- * \return 0 if OK; 1 on error
- *
- *
- * Notes:
- * (1) Equality is defined as having the same set of points,
- * independent of the order in which they are presented.
- *
- */
-l_ok
-ptaEqual(PTA *pta1,
- PTA *pta2,
- l_int32 *psame)
-{
-l_int32 i, n1, n2;
-l_float32 x1, y1, x2, y2;
-PTA *ptas1, *ptas2;
-
- PROCNAME("ptaEqual");
-
- if (!psame)
- return ERROR_INT("&same not defined", procName, 1);
- *psame = 0.0;
- if (!pta1 || !pta2)
- return ERROR_INT("pta1 and pta2 not both defined", procName, 1);
-
- n1 = ptaGetCount(pta1);
- n2 = ptaGetCount(pta2);
- if (n1 != n2) return 0;
-
- /* 2d sort each and compare */
- ptas1 = ptaSort2d(pta1);
- ptas2 = ptaSort2d(pta2);
- for (i = 0; i < n1; i++) {
- ptaGetPt(ptas1, i, &x1, &y1);
- ptaGetPt(ptas2, i, &x2, &y2);
- if (x1 != x2 || y1 != y2) {
- ptaDestroy(&ptas1);
- ptaDestroy(&ptas2);
- return 0;
- }
- }
-
- *psame = 1;
- ptaDestroy(&ptas1);
- ptaDestroy(&ptas2);
- return 0;
-}
-
-
-
-
-/*---------------------------------------------------------------------*
- * Set operations using aset (rbtree) *
- *---------------------------------------------------------------------*/
-/*!
- * \brief ptaUnionByAset()
- *
- * \param[in] pta1, pta2
- * \return ptad with the union of the set of points, or NULL on error
- *
- *
- * Notes:
- * (1) See sarrayRemoveDupsByAset() for the approach.
- * (2) The key is a 64-bit hash from the (x,y) pair.
- * (3) This is slower than ptaUnionByHash(), mostly because of the
- * nlogn sort to build up the rbtree. Do not use for large
- * numbers of points (say, > 1M).
- * (4) The *Aset() functions use the sorted l_Aset, which is just
- * an rbtree in disguise.
- *
- */
-PTA *
-ptaUnionByAset(PTA *pta1,
- PTA *pta2)
-{
-PTA *pta3, *ptad;
-
- PROCNAME("ptaUnionByAset");
-
- if (!pta1)
- return (PTA *)ERROR_PTR("pta1 not defined", procName, NULL);
- if (!pta2)
- return (PTA *)ERROR_PTR("pta2 not defined", procName, NULL);
-
- /* Join */
- pta3 = ptaCopy(pta1);
- ptaJoin(pta3, pta2, 0, -1);
-
- /* Eliminate duplicates */
- ptad = ptaRemoveDupsByAset(pta3);
- ptaDestroy(&pta3);
- return ptad;
-}
-
-
-/*!
- * \brief ptaRemoveDupsByAset()
- *
- * \param[in] ptas assumed to be integer values
- * \return ptad with duplicates removed, or NULL on error
- *
- *
- * Notes:
- * (1) This is slower than ptaRemoveDupsByHash(), mostly because
- * of the nlogn sort to build up the rbtree. Do not use for
- * large numbers of points (say, > 1M).
- *
- */
-PTA *
-ptaRemoveDupsByAset(PTA *ptas)
-{
-l_int32 i, n, x, y;
-PTA *ptad;
-l_uint64 hash;
-L_ASET *set;
-RB_TYPE key;
-
- PROCNAME("ptaRemoveDupsByAset");
-
- if (!ptas)
- return (PTA *)ERROR_PTR("ptas not defined", procName, NULL);
-
- set = l_asetCreate(L_UINT_TYPE);
- n = ptaGetCount(ptas);
- ptad = ptaCreate(n);
- for (i = 0; i < n; i++) {
- ptaGetIPt(ptas, i, &x, &y);
- l_hashPtToUint64(x, y, &hash);
- key.utype = hash;
- if (!l_asetFind(set, key)) {
- ptaAddPt(ptad, x, y);
- l_asetInsert(set, key);
- }
- }
-
- l_asetDestroy(&set);
- return ptad;
-}
-
-
-/*!
- * \brief ptaIntersectionByAset()
- *
- * \param[in] pta1, pta2
- * \return ptad intersection of the point sets, or NULL on error
- *
- *
- * Notes:
- * (1) See sarrayIntersectionByAset() for the approach.
- * (2) The key is a 64-bit hash from the (x,y) pair.
- * (3) This is slower than ptaIntersectionByHash(), mostly because
- * of the nlogn sort to build up the rbtree. Do not use for
- * large numbers of points (say, > 1M).
- *
- */
-PTA *
-ptaIntersectionByAset(PTA *pta1,
- PTA *pta2)
-{
-l_int32 n1, n2, i, n, x, y;
-l_uint64 hash;
-L_ASET *set1, *set2;
-RB_TYPE key;
-PTA *pta_small, *pta_big, *ptad;
-
- PROCNAME("ptaIntersectionByAset");
-
- if (!pta1)
- return (PTA *)ERROR_PTR("pta1 not defined", procName, NULL);
- if (!pta2)
- return (PTA *)ERROR_PTR("pta2 not defined", procName, NULL);
-
- /* Put the elements of the biggest array into a set */
- n1 = ptaGetCount(pta1);
- n2 = ptaGetCount(pta2);
- pta_small = (n1 < n2) ? pta1 : pta2; /* do not destroy pta_small */
- pta_big = (n1 < n2) ? pta2 : pta1; /* do not destroy pta_big */
- set1 = l_asetCreateFromPta(pta_big);
-
- /* Build up the intersection of points */
- ptad = ptaCreate(0);
- n = ptaGetCount(pta_small);
- set2 = l_asetCreate(L_UINT_TYPE);
- for (i = 0; i < n; i++) {
- ptaGetIPt(pta_small, i, &x, &y);
- l_hashPtToUint64(x, y, &hash);
- key.utype = hash;
- if (l_asetFind(set1, key) && !l_asetFind(set2, key)) {
- ptaAddPt(ptad, x, y);
- l_asetInsert(set2, key);
- }
- }
-
- l_asetDestroy(&set1);
- l_asetDestroy(&set2);
- return ptad;
-}
-
-
-/*!
- * \brief l_asetCreateFromPta()
- *
- * \param[in] pta
- * \return set using a 64-bit hash of (x,y) as the key
- */
-L_ASET *
-l_asetCreateFromPta(PTA *pta)
-{
-l_int32 i, n, x, y;
-l_uint64 hash;
-L_ASET *set;
-RB_TYPE key;
-
- PROCNAME("l_asetCreateFromPta");
-
- if (!pta)
- return (L_ASET *)ERROR_PTR("pta not defined", procName, NULL);
-
- set = l_asetCreate(L_UINT_TYPE);
- n = ptaGetCount(pta);
- for (i = 0; i < n; i++) {
- ptaGetIPt(pta, i, &x, &y);
- l_hashPtToUint64(x, y, &hash);
- key.utype = hash;
- l_asetInsert(set, key);
- }
-
- return set;
-}
-
-
-/*---------------------------------------------------------------------*
- * Set operations using hashing (rbtree) *
- *---------------------------------------------------------------------*/
-/*!
- * \brief ptaUnionByHash()
- *
- * \param[in] pta1, pta2
- * \return ptad with the union of the set of points, or NULL on error
- *
- *
- * Notes:
- * (1) This is faster than ptaUnionByAset(), because the
- * bucket lookup is O(n). It should be used if the pts are
- * integers (e.g., representing pixel positions).
- *
- */
-PTA *
-ptaUnionByHash(PTA *pta1,
- PTA *pta2)
-{
-PTA *pta3, *ptad;
-
- PROCNAME("ptaUnionByHash");
-
- if (!pta1)
- return (PTA *)ERROR_PTR("pta1 not defined", procName, NULL);
- if (!pta2)
- return (PTA *)ERROR_PTR("pta2 not defined", procName, NULL);
-
- /* Join */
- pta3 = ptaCopy(pta1);
- ptaJoin(pta3, pta2, 0, -1);
-
- /* Eliminate duplicates */
- ptaRemoveDupsByHash(pta3, &ptad, NULL);
- ptaDestroy(&pta3);
- return ptad;
-}
-
-
-/*!
- * \brief ptaRemoveDupsByHash()
- *
- * \param[in] ptas assumed to be integer values
- * \param[out] pptad unique set of pts; duplicates removed
- * \param[out] pdahash [optional] dnahash used for lookup
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) Generates a pta with unique values.
- * (2) The dnahash is built up with ptad to assure uniqueness.
- * It can be used to find if a point is in the set:
- * ptaFindPtByHash(ptad, dahash, x, y, &index)
- * (3) The hash of the (x,y) location is simple and fast. It scales
- * up with the number of buckets to insure a fairly random
- * bucket selection for adjacent points.
- * (4) A Dna is used rather than a Numa because we need accurate
- * representation of 32-bit integers that are indices into ptas.
- * Integer --> float --> integer conversion makes errors for
- * integers larger than 10M.
- * (5) This is faster than ptaRemoveDupsByAset(), because the
- * bucket lookup is O(n), although there is a double-loop
- * lookup within the dna in each bucket.
- *
- */
-l_ok
-ptaRemoveDupsByHash(PTA *ptas,
- PTA **pptad,
- L_DNAHASH **pdahash)
-{
-l_int32 i, n, index, items, x, y;
-l_uint32 nsize;
-l_uint64 key;
-PTA *ptad;
-L_DNAHASH *dahash;
-
- PROCNAME("ptaRemoveDupsByHash");
-
- if (pdahash) *pdahash = NULL;
- if (!pptad)
- return ERROR_INT("&ptad not defined", procName, 1);
- *pptad = NULL;
- if (!ptas)
- return ERROR_INT("ptas not defined", procName, 1);
-
- n = ptaGetCount(ptas);
- findNextLargerPrime(n / 20, &nsize); /* buckets in hash table */
- dahash = l_dnaHashCreate(nsize, 8);
- ptad = ptaCreate(n);
- *pptad = ptad;
- for (i = 0, items = 0; i < n; i++) {
- ptaGetIPt(ptas, i, &x, &y);
- ptaFindPtByHash(ptad, dahash, x, y, &index);
- if (index < 0) { /* not found */
- l_hashPtToUint64(x, y, &key);
- l_dnaHashAdd(dahash, key, (l_float64)items);
- ptaAddPt(ptad, x, y);
- items++;
- }
- }
-
- if (pdahash)
- *pdahash = dahash;
- else
- l_dnaHashDestroy(&dahash);
- return 0;
-}
-
-
-/*!
- * \brief ptaIntersectionByHash()
- *
- * \param[in] pta1, pta2
- * \return ptad intersection of the point sets, or NULL on error
- *
- *
- * Notes:
- * (1) This is faster than ptaIntersectionByAset(), because the
- * bucket lookup is O(n). It should be used if the pts are
- * integers (e.g., representing pixel positions).
- *
- */
-PTA *
-ptaIntersectionByHash(PTA *pta1,
- PTA *pta2)
-{
-l_int32 n1, n2, nsmall, i, x, y, index1, index2;
-l_uint32 nsize2;
-l_uint64 key;
-L_DNAHASH *dahash1, *dahash2;
-PTA *pta_small, *pta_big, *ptad;
-
- PROCNAME("ptaIntersectionByHash");
-
- if (!pta1)
- return (PTA *)ERROR_PTR("pta1 not defined", procName, NULL);
- if (!pta2)
- return (PTA *)ERROR_PTR("pta2 not defined", procName, NULL);
-
- /* Put the elements of the biggest pta into a dnahash */
- n1 = ptaGetCount(pta1);
- n2 = ptaGetCount(pta2);
- pta_small = (n1 < n2) ? pta1 : pta2; /* do not destroy pta_small */
- pta_big = (n1 < n2) ? pta2 : pta1; /* do not destroy pta_big */
- dahash1 = l_dnaHashCreateFromPta(pta_big);
-
- /* Build up the intersection of points. Add to ptad
- * if the point is in pta_big (using dahash1) but hasn't
- * yet been seen in the traversal of pta_small (using dahash2). */
- ptad = ptaCreate(0);
- nsmall = ptaGetCount(pta_small);
- findNextLargerPrime(nsmall / 20, &nsize2); /* buckets in hash table */
- dahash2 = l_dnaHashCreate(nsize2, 0);
- for (i = 0; i < nsmall; i++) {
- ptaGetIPt(pta_small, i, &x, &y);
- ptaFindPtByHash(pta_big, dahash1, x, y, &index1);
- if (index1 >= 0) { /* found */
- ptaFindPtByHash(pta_small, dahash2, x, y, &index2);
- if (index2 == -1) { /* not found */
- ptaAddPt(ptad, x, y);
- l_hashPtToUint64(x, y, &key);
- l_dnaHashAdd(dahash2, key, (l_float64)i);
- }
- }
- }
-
- l_dnaHashDestroy(&dahash1);
- l_dnaHashDestroy(&dahash2);
- return ptad;
-}
-
-
-/*!
- * \brief ptaFindPtByHash()
- *
- * \param[in] pta
- * \param[in] dahash built from pta
- * \param[in] x, y arbitrary points
- * \param[out] pindex index into pta if (x,y) is in pta; -1 otherwise
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) Fast lookup in dnaHash associated with a pta, to see if a
- * random point (x,y) is already stored in the hash table.
- * (2) We use a strong hash function to minimize the chance that
- * two different points hash to the same key value.
- * (3) We select the number of buckets to be about 5% of the size
- * of the input %pta, so that when fully populated, each
- * bucket (dna) will have about 20 entries, each being an index
- * into %pta. In lookup, after hashing to the key, and then
- * again to the bucket, we traverse the bucket (dna), using the
- * index into %pta to check if the point (x,y) has been found before.
- *
- */
-l_ok
-ptaFindPtByHash(PTA *pta,
- L_DNAHASH *dahash,
- l_int32 x,
- l_int32 y,
- l_int32 *pindex)
-{
-l_int32 i, nvals, index, xi, yi;
-l_uint64 key;
-L_DNA *da;
-
- PROCNAME("ptaFindPtByHash");
-
- if (!pindex)
- return ERROR_INT("&index not defined", procName, 1);
- *pindex = -1;
- if (!pta)
- return ERROR_INT("pta not defined", procName, 1);
- if (!dahash)
- return ERROR_INT("dahash not defined", procName, 1);
-
- l_hashPtToUint64(x, y, &key);
- da = l_dnaHashGetDna(dahash, key, L_NOCOPY);
- if (!da) return 0;
-
- /* Run through the da, looking for this point */
- nvals = l_dnaGetCount(da);
- for (i = 0; i < nvals; i++) {
- l_dnaGetIValue(da, i, &index);
- ptaGetIPt(pta, index, &xi, &yi);
- if (x == xi && y == yi) {
- *pindex = index;
- return 0;
- }
- }
-
- return 0;
-}
-
-
-/*!
- * \brief l_dnaHashCreateFromPta()
- *
- * \param[in] pta
- * \return dahash, or NULL on error
- */
-L_DNAHASH *
-l_dnaHashCreateFromPta(PTA *pta)
-{
-l_int32 i, n, x, y;
-l_uint32 nsize;
-l_uint64 key;
-L_DNAHASH *dahash;
-
- PROCNAME("l_dnaHashCreateFromPta");
-
- if (!pta)
- return (L_DNAHASH *)ERROR_PTR("pta not defined", procName, NULL);
-
- /* Build up dnaHash of indices, hashed by a key that is
- * a large linear combination of x and y values designed to
- * randomize the key. Having about 20 pts in each bucket is
- * roughly optimal for speed for large sets. */
- n = ptaGetCount(pta);
- findNextLargerPrime(n / 20, &nsize); /* buckets in hash table */
-/* lept_stderr("Prime used: %d\n", nsize); */
-
- /* Add each point, using the hash as key and the index into
- * %ptas as the value. Storing the index enables operations
- * that check for duplicates. */
- dahash = l_dnaHashCreate(nsize, 8);
- for (i = 0; i < n; i++) {
- ptaGetIPt(pta, i, &x, &y);
- l_hashPtToUint64(x, y, &key);
- l_dnaHashAdd(dahash, key, (l_float64)i);
- }
-
- return dahash;
-}
diff --git a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/ptra.c b/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/ptra.c
deleted file mode 100644
index 5a04631e..00000000
--- a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/ptra.c
+++ /dev/null
@@ -1,1009 +0,0 @@
-/*====================================================================*
- - Copyright (C) 2001 Leptonica. All rights reserved.
- -
- - Redistribution and use in source and binary forms, with or without
- - modification, are permitted provided that the following conditions
- - are met:
- - 1. Redistributions of source code must retain the above copyright
- - notice, this list of conditions and the following disclaimer.
- - 2. Redistributions in binary form must reproduce the above
- - copyright notice, this list of conditions and the following
- - disclaimer in the documentation and/or other materials
- - provided with the distribution.
- -
- - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- - ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- - LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- - A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL ANY
- - CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
- - EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
- - PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
- - PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
- - OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
- - NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- *====================================================================*/
-
-/*!
- * \file ptra.c
- *
- *
- * Ptra creation and destruction
- * L_PTRA *ptraCreate()
- * void *ptraDestroy()
- *
- * Add/insert/remove/replace generic ptr object
- * l_int32 ptraAdd()
- * static l_int32 ptraExtendArray()
- * l_int32 ptraInsert()
- * void *ptraRemove()
- * void *ptraRemoveLast()
- * void *ptraReplace()
- * l_int32 ptraSwap()
- * l_int32 ptraCompactArray()
- *
- * Other array operations
- * l_int32 ptraReverse()
- * l_int32 ptraJoin()
- *
- * Simple Ptra accessors
- * l_int32 ptraGetMaxIndex()
- * l_int32 ptraGetActualCount()
- * void *ptraGetPtrToItem()
- *
- * Ptraa creation and destruction
- * L_PTRAA *ptraaCreate()
- * void *ptraaDestroy()
- *
- * Ptraa accessors
- * l_int32 ptraaGetSize()
- * l_int32 ptraaInsertPtra()
- * L_PTRA *ptraaGetPtra()
- *
- * Ptraa conversion
- * L_PTRA *ptraaFlattenToPtra()
- *
- * Notes on the Ptra:
- *
- * (1) The Ptra is a struct, not an array. Always use the accessors
- * in this file, never the fields directly.
- * (2) Items can be placed anywhere in the allocated ptr array,
- * including one index beyond the last ptr (in which case the
- * ptr array is realloc'd).
- * (3) Thus, the items on the ptr array need not be compacted. In
- * general there will be null pointers in the ptr array.
- * (4) A compacted array will remain compacted on removal if
- * arbitrary items are removed with compaction, or if items
- * are removed from the end of the array.
- * (5) For addition to and removal from the end of the array, this
- * functions exactly like a stack, and with the same O(1) cost.
- * (6) This differs from the generic stack in that we allow
- * random access for insertion, removal and replacement.
- * Removal can be done without compacting the array.
- * Insertion into a null ptr in the array has no effect on
- * the other pointers, but insertion into a location already
- * occupied by an item has a cost proportional to the
- * distance to the next null ptr in the array.
- * (7) Null ptrs are valid input args for both insertion and
- * replacement; this allows arbitrary swapping.
- * (8) The item in the array with the largest index is at pa->imax.
- * This can be any value from -1 (initialized; all array ptrs
- * are null) up to pa->nalloc - 1 (the last ptr in the array).
- * (9) In referring to the array: the first ptr is the "top" or
- * "beginning"; the last pointer is the "bottom" or "end";
- * items are shifted "up" towards the top when compaction occurs;
- * and items are shifted "down" towards the bottom when forced to
- * move due to an insertion.
- * (10) It should be emphasized that insertion, removal and replacement
- * are general:
- * * You can insert an item into any ptr location in the
- * allocated ptr array, as well as into the next ptr address
- * beyond the allocated array (in which case a realloc will occur).
- * * You can remove or replace an item from any ptr location
- * in the allocated ptr array.
- * * When inserting into an occupied location, you have
- * three options for downshifting.
- * * When removing, you can either leave the ptr null or
- * compact the array.
- *
- * Notes on the Ptraa:
- *
- * (1) The Ptraa is a fixed size ptr array for holding Ptra.
- * In that respect, it is different from other pointer arrays, which
- * are extensible and grow using the *Add*() functions.
- * (2) In general, the Ptra ptrs in the Ptraa can be randomly occupied.
- * A typical usage is to allow an O(n) horizontal sort of Pix,
- * where the size of the Ptra array is the width of the image,
- * and each Ptra is an array of all the Pix at a specific x location.
- *
- */
-
-#ifdef HAVE_CONFIG_H
-#include
-#endif /* HAVE_CONFIG_H */
-
-#include "allheaders.h"
-
- /* Bounds on initial array size */
-static const l_uint32 MaxPtrArraySize = 100000;
-static const l_int32 InitialPtrArraySize = 20; /*!< n'importe quoi */
-
- /* Static function */
-static l_int32 ptraExtendArray(L_PTRA *pa);
-
-/*--------------------------------------------------------------------------*
- * Ptra creation and destruction *
- *--------------------------------------------------------------------------*/
-/*!
- * \brief ptraCreate()
- *
- * \param[in] n size of ptr array to be alloc'd; use 0 for default
- * \return pa, or NULL on error
- */
-L_PTRA *
-ptraCreate(l_int32 n)
-{
-L_PTRA *pa;
-
- PROCNAME("ptraCreate");
-
- if (n <= 0 || n > MaxPtrArraySize)
- n = InitialPtrArraySize;
-
- pa = (L_PTRA *)LEPT_CALLOC(1, sizeof(L_PTRA));
- if ((pa->array = (void **)LEPT_CALLOC(n, sizeof(void *))) == NULL) {
- ptraDestroy(&pa, 0, 0);
- return (L_PTRA *)ERROR_PTR("ptr array not made", procName, NULL);
- }
- pa->nalloc = n;
- pa->imax = -1;
- pa->nactual = 0;
- return pa;
-}
-
-
-/*!
- * \brief ptraDestroy()
- *
- * \param[in,out] ppa will be set to null before returning
- * \param[in] freeflag TRUE to free each remaining item in the array
- * \param[in] warnflag TRUE to warn if any remaining items
- * are not destroyed
- * \return void
- *
- *
- * Notes:
- * (1) If %freeflag == TRUE, frees each item in the array.
- * (2) If %freeflag == FALSE and %warnflag == TRUE, and there are
- * items on the array, this gives a warning and destroys the array.
- * If these items are not owned elsewhere, this will cause
- * a memory leak of all the items that were on the array.
- * So if the items are not owned elsewhere and require their
- * own destroy function, they must be destroyed before the ptra.
- * (3) If %warnflag == FALSE, no warnings will be issued. This is
- * useful if the items are owned elsewhere, such as a
- * PixMemoryStore().
- * (4) To destroy the ptra, we destroy the ptr array, then
- * the ptra, and then null the contents of the input ptr.
- *
- */
-void
-ptraDestroy(L_PTRA **ppa,
- l_int32 freeflag,
- l_int32 warnflag)
-{
-l_int32 i, nactual;
-void *item;
-L_PTRA *pa;
-
- PROCNAME("ptraDestroy");
-
- if (ppa == NULL) {
- L_WARNING("ptr address is NULL\n", procName);
- return;
- }
- if ((pa = *ppa) == NULL)
- return;
-
- ptraGetActualCount(pa, &nactual);
- if (nactual > 0) {
- if (freeflag) {
- for (i = 0; i <= pa->imax; i++) {
- if ((item = ptraRemove(pa, i, L_NO_COMPACTION)) != NULL)
- LEPT_FREE(item);
- }
- } else if (warnflag) {
- L_WARNING("potential memory leak of %d items in ptra\n",
- procName, nactual);
- }
- }
-
- LEPT_FREE(pa->array);
- LEPT_FREE(pa);
- *ppa = NULL;
- return;
-}
-
-
-/*--------------------------------------------------------------------------*
- * Add/insert/remove/replace generic ptr object *
- *--------------------------------------------------------------------------*/
-/*!
- * \brief ptraAdd()
- *
- * \param[in] pa ptra
- * \param[in] item generic ptr to a struct
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This adds the element to the next location beyond imax,
- * which is the largest occupied ptr in the array. This is
- * what you expect from a stack, where all ptrs up to and
- * including imax are occupied, but here the occuption of
- * items in the array is entirely arbitrary.
- *
- */
-l_ok
-ptraAdd(L_PTRA *pa,
- void *item)
-{
-l_int32 imax;
-
- PROCNAME("ptraAdd");
-
- if (!pa)
- return ERROR_INT("pa not defined", procName, 1);
- if (!item)
- return ERROR_INT("item not defined", procName, 1);
-
- ptraGetMaxIndex(pa, &imax);
- if (imax >= pa->nalloc - 1 && ptraExtendArray(pa))
- return ERROR_INT("extension failure", procName, 1);
- pa->array[imax + 1] = (void *)item;
- pa->imax++;
- pa->nactual++;
- return 0;
-}
-
-
-/*!
- * \brief ptraExtendArray()
- *
- * \param[in] pa
- * \return 0 if OK, 1 on error
- */
-static l_int32
-ptraExtendArray(L_PTRA *pa)
-{
- PROCNAME("ptraExtendArray");
-
- if (!pa)
- return ERROR_INT("pa not defined", procName, 1);
-
- if ((pa->array = (void **)reallocNew((void **)&pa->array,
- sizeof(void *) * pa->nalloc,
- 2 * sizeof(void *) * pa->nalloc)) == NULL)
- return ERROR_INT("new ptr array not returned", procName, 1);
-
- pa->nalloc *= 2;
- return 0;
-}
-
-
-/*!
- * \brief ptraInsert()
- *
- * \param[in] pa ptra
- * \param[in] index location in ptra to insert new value
- * \param[in] item generic ptr to a struct; can be null
- * \param[in] shiftflag L_AUTO_DOWNSHIFT, L_MIN_DOWNSHIFT, L_FULL_DOWNSHIFT
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This checks first to see if the location is valid, and
- * then if there is presently an item there. If there is not,
- * it is simply inserted into that location.
- * (2) If there is an item at the insert location, items must be
- * moved down to make room for the insert. In the downward
- * shift there are three options, given by %shiftflag.
- * ~ If %shiftflag == L_AUTO_DOWNSHIFT, a decision is made
- * whether, in a cascade of items, to downshift a minimum
- * amount or for all items above %index. The decision is
- * based on the expectation of finding holes (null ptrs)
- * between %index and the bottom of the array.
- * Assuming the holes are distributed uniformly, if 2 or more
- * holes are expected, we do a minimum shift.
- * ~ If %shiftflag == L_MIN_DOWNSHIFT, the downward shifting
- * cascade of items progresses a minimum amount, until
- * the first empty slot is reached. This mode requires
- * some computation before the actual shifting is done.
- * ~ If %shiftflag == L_FULL_DOWNSHIFT, a shifting cascade is
- * performed where pa[i] --> pa[i + 1] for all i >= index.
- * Then, the item is inserted at pa[index].
- * (3) If you are not using L_AUTO_DOWNSHIFT, the rule of thumb is
- * to use L_FULL_DOWNSHIFT if the array is compacted (each
- * element points to an item), and to use L_MIN_DOWNSHIFT
- * if there are a significant number of null pointers.
- * There is no penalty to using L_MIN_DOWNSHIFT for a
- * compacted array, however, because the full shift is required
- * and we don't do the O(n) computation to look for holes.
- * (4) This should not be used repeatedly on large arrays,
- * because the function is generally O(n).
- * (5) However, it can be used repeatedly if we start with an empty
- * ptr array and insert only once at each location. For example,
- * you can support an array of Numa, where at each ptr location
- * you store either 0 or 1 Numa, and the Numa can be added
- * randomly to the ptr array.
- *
- */
-l_ok
-ptraInsert(L_PTRA *pa,
- l_int32 index,
- void *item,
- l_int32 shiftflag)
-{
-l_int32 i, ihole, imax;
-l_float32 nexpected;
-
- PROCNAME("ptraInsert");
-
- if (!pa)
- return ERROR_INT("pa not defined", procName, 1);
- if (index < 0 || index > pa->nalloc)
- return ERROR_INT("index not in [0 ... nalloc]", procName, 1);
- if (shiftflag != L_AUTO_DOWNSHIFT && shiftflag != L_MIN_DOWNSHIFT &&
- shiftflag != L_FULL_DOWNSHIFT)
- return ERROR_INT("invalid shiftflag", procName, 1);
-
- if (item) pa->nactual++;
- if (index == pa->nalloc) { /* can happen when index == n */
- if (ptraExtendArray(pa))
- return ERROR_INT("extension failure", procName, 1);
- }
-
- /* We are inserting into a hole or adding to the end of the array.
- * No existing items are moved. */
- ptraGetMaxIndex(pa, &imax);
- if (pa->array[index] == NULL) {
- pa->array[index] = item;
- if (item && index > imax) /* new item put beyond max so far */
- pa->imax = index;
- return 0;
- }
-
- /* We are inserting at the location of an existing item,
- * forcing the existing item and those below to shift down.
- * First, extend the array automatically if the last element
- * (nalloc - 1) is occupied (imax). This may not be necessary
- * in every situation, but only an anomalous sequence of insertions
- * into the array would cause extra ptr allocation. */
- if (imax >= pa->nalloc - 1 && ptraExtendArray(pa))
- return ERROR_INT("extension failure", procName, 1);
-
- /* If there are no holes, do a full downshift.
- * Otherwise, if L_AUTO_DOWNSHIFT, use the expected number
- * of holes between index and n to determine the shift mode */
- if (imax + 1 == pa->nactual) {
- shiftflag = L_FULL_DOWNSHIFT;
- } else if (shiftflag == L_AUTO_DOWNSHIFT) {
- if (imax < 10) {
- shiftflag = L_FULL_DOWNSHIFT; /* no big deal */
- } else {
- nexpected = (l_float32)(imax - pa->nactual) *
- (l_float32)((imax - index) / imax);
- shiftflag = (nexpected > 2.0) ? L_MIN_DOWNSHIFT : L_FULL_DOWNSHIFT;
- }
- }
-
- if (shiftflag == L_MIN_DOWNSHIFT) { /* run down looking for a hole */
- for (ihole = index + 1; ihole <= imax; ihole++) {
- if (pa->array[ihole] == NULL)
- break;
- }
- } else { /* L_FULL_DOWNSHIFT */
- ihole = imax + 1;
- }
-
- for (i = ihole; i > index; i--)
- pa->array[i] = pa->array[i - 1];
- pa->array[index] = (void *)item;
- if (ihole == imax + 1) /* the last item was shifted down */
- pa->imax++;
-
- return 0;
-}
-
-
-/*!
- * \brief ptraRemove()
- *
- * \param[in] pa ptra
- * \param[in] index element to be removed
- * \param[in] flag L_NO_COMPACTION, L_COMPACTION
- * \return item, or NULL on error
- *
- *
- * Notes:
- * (1) If flag == L_NO_COMPACTION, this removes the item and
- * nulls the ptr on the array. If it takes the last item
- * in the array, pa->n is reduced to the next item.
- * (2) If flag == L_COMPACTION, this compacts the array for
- * for all i >= index. It should not be used repeatedly on
- * large arrays, because compaction is O(n).
- * (3) The ability to remove without automatic compaction allows
- * removal with cost O(1).
- *
- */
-void *
-ptraRemove(L_PTRA *pa,
- l_int32 index,
- l_int32 flag)
-{
-l_int32 i, imax, fromend, icurrent;
-void *item;
-
- PROCNAME("ptraRemove");
-
- if (!pa)
- return (void *)ERROR_PTR("pa not defined", procName, NULL);
- ptraGetMaxIndex(pa, &imax);
- if (index < 0 || index > imax)
- return (void *)ERROR_PTR("index not in [0 ... imax]", procName, NULL);
-
- item = pa->array[index];
- if (item)
- pa->nactual--;
- pa->array[index] = NULL;
-
- /* If we took the last item, need to reduce pa->n */
- fromend = (index == imax);
- if (fromend) {
- for (i = index - 1; i >= 0; i--) {
- if (pa->array[i])
- break;
- }
- pa->imax = i;
- }
-
- /* Compact from index to the end of the array */
- if (!fromend && flag == L_COMPACTION) {
- for (icurrent = index, i = index + 1; i <= imax; i++) {
- if (pa->array[i])
- pa->array[icurrent++] = pa->array[i];
- }
- pa->imax = icurrent - 1;
- }
- return item;
-}
-
-
-/*!
- * \brief ptraRemoveLast()
- *
- * \param[in] pa ptra
- * \return item, or NULL on error or if the array is empty
- */
-void *
-ptraRemoveLast(L_PTRA *pa)
-{
-l_int32 imax;
-
- PROCNAME("ptraRemoveLast");
-
- if (!pa)
- return (void *)ERROR_PTR("pa not defined", procName, NULL);
-
- /* Remove the last item in the array. No compaction is required. */
- ptraGetMaxIndex(pa, &imax);
- if (imax >= 0)
- return ptraRemove(pa, imax, L_NO_COMPACTION);
- else /* empty */
- return NULL;
-}
-
-
-/*!
- * \brief ptraReplace()
- *
- * \param[in] pa ptra
- * \param[in] index element to be replaced
- * \param[in] item new generic ptr to a struct; can be null
- * \param[in] freeflag TRUE to free old item; FALSE to return it
- * \return item old item, if it exists and is not freed,
- * or NULL on error
- */
-void *
-ptraReplace(L_PTRA *pa,
- l_int32 index,
- void *item,
- l_int32 freeflag)
-{
-l_int32 imax;
-void *olditem;
-
- PROCNAME("ptraReplace");
-
- if (!pa)
- return (void *)ERROR_PTR("pa not defined", procName, NULL);
- ptraGetMaxIndex(pa, &imax);
- if (index < 0 || index > imax)
- return (void *)ERROR_PTR("index not in [0 ... imax]", procName, NULL);
-
- olditem = pa->array[index];
- pa->array[index] = item;
- if (!item && olditem)
- pa->nactual--;
- else if (item && !olditem)
- pa->nactual++;
-
- if (freeflag == FALSE)
- return olditem;
-
- if (olditem)
- LEPT_FREE(olditem);
- return NULL;
-}
-
-
-/*!
- * \brief ptraSwap()
- *
- * \param[in] pa ptra
- * \param[in] index1
- * \param[in] index2
- * \return 0 if OK, 1 on error
- */
-l_ok
-ptraSwap(L_PTRA *pa,
- l_int32 index1,
- l_int32 index2)
-{
-l_int32 imax;
-void *item;
-
- PROCNAME("ptraSwap");
-
- if (!pa)
- return ERROR_INT("pa not defined", procName, 1);
- if (index1 == index2)
- return 0;
- ptraGetMaxIndex(pa, &imax);
- if (index1 < 0 || index1 > imax || index2 < 0 || index2 > imax)
- return ERROR_INT("invalid index: not in [0 ... imax]", procName, 1);
-
- item = ptraRemove(pa, index1, L_NO_COMPACTION);
- item = ptraReplace(pa, index2, item, FALSE);
- ptraInsert(pa, index1, item, L_MIN_DOWNSHIFT);
- return 0;
-}
-
-
-/*!
- * \brief ptraCompactArray()
- *
- * \param[in] pa
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This compacts the items on the array, filling any empty ptrs.
- * (2) This does not change the size of the array of ptrs.
- *
- */
-l_ok
-ptraCompactArray(L_PTRA *pa)
-{
-l_int32 i, imax, nactual, index;
-
- PROCNAME("ptraCompactArray");
-
- if (!pa)
- return ERROR_INT("pa not defined", procName, 1);
- ptraGetMaxIndex(pa, &imax);
- ptraGetActualCount(pa, &nactual);
- if (imax + 1 == nactual) return 0;
-
- /* Compact the array */
- for (i = 0, index = 0; i <= imax; i++) {
- if (pa->array[i])
- pa->array[index++] = pa->array[i];
- }
- pa->imax = index - 1;
- if (nactual != index)
- L_ERROR("index = %d; != nactual\n", procName, index);
-
- return 0;
-}
-
-
-/*----------------------------------------------------------------------*
- * Other array operations *
- *----------------------------------------------------------------------*/
-/*!
- * \brief ptraReverse()
- *
- * \param[in] pa ptra
- * \return 0 if OK, 1 on error
- */
-l_ok
-ptraReverse(L_PTRA *pa)
-{
-l_int32 i, imax;
-
- PROCNAME("ptraReverse");
-
- if (!pa)
- return ERROR_INT("pa not defined", procName, 1);
- ptraGetMaxIndex(pa, &imax);
-
- for (i = 0; i < (imax + 1) / 2; i++)
- ptraSwap(pa, i, imax - i);
- return 0;
-}
-
-
-/*!
- * \brief ptraJoin()
- *
- * \param[in] pa1 add to this one
- * \param[in] pa2 appended to pa1, and emptied of items; can be null
- * \return 0 if OK, 1 on error
- */
-l_ok
-ptraJoin(L_PTRA *pa1,
- L_PTRA *pa2)
-{
-l_int32 i, imax;
-void *item;
-
- PROCNAME("ptraJoin");
-
- if (!pa1)
- return ERROR_INT("pa1 not defined", procName, 1);
- if (!pa2)
- return 0;
-
- ptraGetMaxIndex(pa2, &imax);
- for (i = 0; i <= imax; i++) {
- item = ptraRemove(pa2, i, L_NO_COMPACTION);
- ptraAdd(pa1, item);
- }
-
- return 0;
-}
-
-
-
-/*----------------------------------------------------------------------*
- * Simple ptra accessors *
- *----------------------------------------------------------------------*/
-/*!
- * \brief ptraGetMaxIndex()
- *
- * \param[in] pa ptra
- * \param[out] pmaxindex index of last item in the array;
- * \return 0 if OK; 1 on error
- *
- *
- * Notes:
- * (1) The largest index to an item in the array is %maxindex.
- * %maxindex is one less than the number of items that would be
- * in the array if there were no null pointers between 0
- * and %maxindex - 1. However, because the internal ptr array
- * need not be compacted, there may be NULL pointers at
- * indices below %maxindex; for example, if items have
- * been removed.
- * (2) When an item is added to the end of the array, it goes
- * into pa->array[maxindex + 1], and maxindex is then
- * incremented by 1.
- * (3) If there are no items in the array, this returns %maxindex = -1.
- *
- */
-l_ok
-ptraGetMaxIndex(L_PTRA *pa,
- l_int32 *pmaxindex)
-{
- PROCNAME("ptraGetMaxIndex");
-
- if (!pa)
- return ERROR_INT("pa not defined", procName, 1);
- if (!pmaxindex)
- return ERROR_INT("&maxindex not defined", procName, 1);
- *pmaxindex = pa->imax;
- return 0;
-}
-
-
-/*!
- * \brief ptraGetActualCount()
- *
- * \param[in] pa ptra
- * \param[out] pcount actual number of items on the ptr array
- * \return 0 if OK; 1 on error
- *
- *
- * Notes:
- * (1) The actual number of items on the ptr array, pa->nactual,
- * will be smaller than pa->n if the array is not compacted.
- *
- */
-l_ok
-ptraGetActualCount(L_PTRA *pa,
- l_int32 *pcount)
-{
- PROCNAME("ptraGetActualCount");
-
- if (!pa)
- return ERROR_INT("pa not defined", procName, 1);
- if (!pcount)
- return ERROR_INT("&count not defined", procName, 1);
- *pcount = pa->nactual;
-
- return 0;
-}
-
-
-/*!
- * \brief ptraGetPtrToItem()
- *
- * \param[in] pa ptra
- * \param[in] index of element to be retrieved
- * \return a ptr to the element, or NULL on error
- *
- *
- * Notes:
- * (1) This returns a ptr to the item. You must cast it to
- * the type of item. Do not destroy it; the item belongs
- * to the Ptra.
- * (2) This can access all possible items on the ptr array.
- * If an item doesn't exist, it returns null.
- *
- */
-void *
-ptraGetPtrToItem(L_PTRA *pa,
- l_int32 index)
-{
- PROCNAME("ptraGetPtrToItem");
-
- if (!pa)
- return (void *)ERROR_PTR("pa not defined", procName, NULL);
- if (index < 0 || index >= pa->nalloc)
- return (void *)ERROR_PTR("index not in [0 ... nalloc-1]",
- procName, NULL);
-
- return pa->array[index];
-}
-
-
-/*--------------------------------------------------------------------------*
- * Ptraa creation and destruction *
- *--------------------------------------------------------------------------*/
-/*!
- * \brief ptraaCreate()
- *
- * \param[in] n size of ptr array to be alloc'd
- * \return paa, or NULL on error
- *
- *
- * Notes:
- * (1) The ptraa is generated with a fixed size, that can not change.
- * The ptra can be generated and inserted randomly into this array.
- *
- */
-L_PTRAA *
-ptraaCreate(l_int32 n)
-{
-L_PTRAA *paa;
-
- PROCNAME("ptraaCreate");
-
- if (n <= 0)
- return (L_PTRAA *)ERROR_PTR("n must be > 0", procName, NULL);
-
- paa = (L_PTRAA *)LEPT_CALLOC(1, sizeof(L_PTRAA));
- if ((paa->ptra = (L_PTRA **)LEPT_CALLOC(n, sizeof(L_PTRA *))) == NULL) {
- ptraaDestroy(&paa, 0, 0);
- return (L_PTRAA *)ERROR_PTR("ptr array not made", procName, NULL);
- }
- paa->nalloc = n;
- return paa;
-}
-
-
-/*!
- * \brief ptraaDestroy()
- *
- * \param[in,out] ppaa will be set to null before returning
- * \param[in] freeflag TRUE to free each remaining item in each ptra
- * \param[in] warnflag TRUE to warn if any remaining items
- * are not destroyed
- * \return void
- *
- *
- * Notes:
- * (1) See ptraDestroy() for use of %freeflag and %warnflag.
- * (2) To destroy the ptraa, we destroy each ptra, then the ptr array,
- * then the ptraa, and then null the contents of the input ptr.
- *
- */
-void
-ptraaDestroy(L_PTRAA **ppaa,
- l_int32 freeflag,
- l_int32 warnflag)
-{
-l_int32 i, n;
-L_PTRA *pa;
-L_PTRAA *paa;
-
- PROCNAME("ptraaDestroy");
-
- if (ppaa == NULL) {
- L_WARNING("ptr address is NULL\n", procName);
- return;
- }
- if ((paa = *ppaa) == NULL)
- return;
-
- ptraaGetSize(paa, &n);
- for (i = 0; i < n; i++) {
- pa = ptraaGetPtra(paa, i, L_REMOVE);
- ptraDestroy(&pa, freeflag, warnflag);
- }
-
- LEPT_FREE(paa->ptra);
- LEPT_FREE(paa);
- *ppaa = NULL;
- return;
-}
-
-
-/*--------------------------------------------------------------------------*
- * Ptraa accessors *
- *--------------------------------------------------------------------------*/
-/*!
- * \brief ptraaGetSize()
- *
- * \param[in] paa
- * \param[out] psize size of ptr array
- * \return 0 if OK; 1 on error
- */
-l_ok
-ptraaGetSize(L_PTRAA *paa,
- l_int32 *psize)
-{
- PROCNAME("ptraaGetSize");
-
- if (!paa)
- return ERROR_INT("paa not defined", procName, 1);
- if (!psize)
- return ERROR_INT("&size not defined", procName, 1);
- *psize = paa->nalloc;
-
- return 0;
-}
-
-
-/*!
- * \brief ptraaInsertPtra()
- *
- * \param[in] paa ptraa
- * \param[in] index location in array for insertion
- * \param[in] pa to be inserted
- * \return 0 if OK; 1 on error
- *
- *
- * Notes:
- * (1) Caller should check return value. On success, the Ptra
- * is inserted in the Ptraa and is owned by it. However,
- * on error, the Ptra remains owned by the caller.
- *
- */
-l_ok
-ptraaInsertPtra(L_PTRAA *paa,
- l_int32 index,
- L_PTRA *pa)
-{
-l_int32 n;
-
- PROCNAME("ptraaInsertPtra");
-
- if (!paa)
- return ERROR_INT("paa not defined", procName, 1);
- if (!pa)
- return ERROR_INT("pa not defined", procName, 1);
- ptraaGetSize(paa, &n);
- if (index < 0 || index >= n)
- return ERROR_INT("invalid index", procName, 1);
- if (paa->ptra[index] != NULL)
- return ERROR_INT("ptra already stored at index", procName, 1);
-
- paa->ptra[index] = pa;
- return 0;
-}
-
-
-/*!
- * \brief ptraaGetPtra()
- *
- * \param[in] paa ptraa
- * \param[in] index location in array
- * \param[in] accessflag L_HANDLE_ONLY, L_REMOVE
- * \return ptra at index location, or NULL on error or if there
- * is no ptra there.
- *
- *
- * Notes:
- * (1) This returns the ptra ptr. If %accessflag == L_HANDLE_ONLY,
- * the ptra is left on the ptraa. If %accessflag == L_REMOVE,
- * the ptr in the ptraa is set to NULL, and the caller
- * is responsible for disposing of the ptra (either putting it
- * back on the ptraa, or destroying it).
- * (2) This returns NULL if there is no Ptra at the index location.
- *
- */
-L_PTRA *
-ptraaGetPtra(L_PTRAA *paa,
- l_int32 index,
- l_int32 accessflag)
-{
-l_int32 n;
-L_PTRA *pa;
-
- PROCNAME("ptraaGetPtra");
-
- if (!paa)
- return (L_PTRA *)ERROR_PTR("paa not defined", procName, NULL);
- ptraaGetSize(paa, &n);
- if (index < 0 || index >= n)
- return (L_PTRA *)ERROR_PTR("invalid index", procName, NULL);
- if (accessflag != L_HANDLE_ONLY && accessflag != L_REMOVE)
- return (L_PTRA *)ERROR_PTR("invalid accessflag", procName, NULL);
-
- pa = paa->ptra[index];
- if (accessflag == L_REMOVE)
- paa->ptra[index] = NULL;
- return pa;
-}
-
-
-/*--------------------------------------------------------------------------*
- * Ptraa conversion *
- *--------------------------------------------------------------------------*/
-/*!
- * \brief ptraaFlattenToPtra()
- *
- * \param[in] paa ptraa
- * \return ptra, or NULL on error
- *
- *
- * Notes:
- * (1) This 'flattens' the ptraa to a ptra, taking the items in
- * each ptra, in order, starting with the first ptra, etc.
- * (2) As a side-effect, the ptra are all removed from the ptraa
- * and destroyed, leaving an empty ptraa.
- *
- */
-L_PTRA *
-ptraaFlattenToPtra(L_PTRAA *paa)
-{
-l_int32 i, n;
-L_PTRA *pat, *pad;
-
- PROCNAME("ptraaFlattenToPtra");
-
- if (!paa)
- return (L_PTRA *)ERROR_PTR("paa not defined", procName, NULL);
-
- pad = ptraCreate(0);
- ptraaGetSize(paa, &n);
- for (i = 0; i < n; i++) {
- pat = ptraaGetPtra(paa, i, L_REMOVE);
- if (!pat) continue;
- ptraJoin(pad, pat);
- ptraDestroy(&pat, FALSE, FALSE); /* they're all empty */
- }
-
- return pad;
-}
diff --git a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/ptra.h b/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/ptra.h
deleted file mode 100644
index dc5216cd..00000000
--- a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/ptra.h
+++ /dev/null
@@ -1,95 +0,0 @@
-/*====================================================================*
- - Copyright (C) 2001 Leptonica. All rights reserved.
- -
- - Redistribution and use in source and binary forms, with or without
- - modification, are permitted provided that the following conditions
- - are met:
- - 1. Redistributions of source code must retain the above copyright
- - notice, this list of conditions and the following disclaimer.
- - 2. Redistributions in binary form must reproduce the above
- - copyright notice, this list of conditions and the following
- - disclaimer in the documentation and/or other materials
- - provided with the distribution.
- -
- - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- - ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- - LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- - A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL ANY
- - CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
- - EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
- - PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
- - PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
- - OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
- - NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- *====================================================================*/
-
-#ifndef LEPTONICA_PTRA_H
-#define LEPTONICA_PTRA_H
-
-/*!
- * \file ptra.h
- *
- *
- * Contains the following structs:
- * struct L_Ptra
- * struct L_Ptraa
- *
- * Contains definitions for:
- * L_Ptra compaction flags for removal
- * L_Ptra shifting flags for insert
- * L_Ptraa accessor flags
- *
- */
-
-
-/*------------------------------------------------------------------------*
- * Generic Ptr Array Structs *
- *------------------------------------------------------------------------*/
-
- /*! Generic pointer array */
-struct L_Ptra
-{
- l_int32 nalloc; /*!< size of allocated ptr array */
- l_int32 imax; /*!< greatest valid index */
- l_int32 nactual; /*!< actual number of stored elements */
- void **array; /*!< ptr array */
-};
-typedef struct L_Ptra L_PTRA;
-
-
- /*! Array of generic pointer arrays */
-struct L_Ptraa
-{
- l_int32 nalloc; /*!< size of allocated ptr array */
- struct L_Ptra **ptra; /*!< array of ptra */
-};
-typedef struct L_Ptraa L_PTRAA;
-
-
-
-/*------------------------------------------------------------------------*
- * Accessor and modifier flags for L_Ptra and L_Ptraa *
- *------------------------------------------------------------------------*/
-
-/*! Ptra Removal */
-enum {
- L_NO_COMPACTION = 1, /*!< null the pointer only */
- L_COMPACTION = 2 /*!< compact the array */
-};
-
-/*! Ptra Insertion */
-enum {
- L_AUTO_DOWNSHIFT = 0, /*!< choose based on number of holes */
- L_MIN_DOWNSHIFT = 1, /*!< downshifts min # of ptrs below insert */
- L_FULL_DOWNSHIFT = 2 /*!< downshifts all ptrs below insert */
-};
-
-/*! Ptraa Accessor */
-enum {
- L_HANDLE_ONLY = 0, /*!< ptr to L_Ptra; caller can inspect only */
- L_REMOVE = 1 /*!< caller owns; destroy or save in L_Ptraa */
-};
-
-
-#endif /* LEPTONICA_PTRA_H */
diff --git a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/quadtree.c b/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/quadtree.c
deleted file mode 100644
index 6c10232a..00000000
--- a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/quadtree.c
+++ /dev/null
@@ -1,701 +0,0 @@
-/*====================================================================*
- - Copyright (C) 2001 Leptonica. All rights reserved.
- -
- - Redistribution and use in source and binary forms, with or without
- - modification, are permitted provided that the following conditions
- - are met:
- - 1. Redistributions of source code must retain the above copyright
- - notice, this list of conditions and the following disclaimer.
- - 2. Redistributions in binary form must reproduce the above
- - copyright notice, this list of conditions and the following
- - disclaimer in the documentation and/or other materials
- - provided with the distribution.
- -
- - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- - ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- - LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- - A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL ANY
- - CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
- - EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
- - PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
- - PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
- - OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
- - NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- *====================================================================*/
-
-/*!
- * \file quadtree.c
- *
- *
- * Top level quadtree linear statistics
- * l_int32 pixQuadtreeMean()
- * l_int32 pixQuadtreeVariance()
- *
- * Statistics in an arbitrary rectangle
- * l_int32 pixMeanInRectangle()
- * l_int32 pixVarianceInRectangle()
- *
- * Quadtree regions
- * BOXAA *boxaaQuadtreeRegions()
- *
- * Quadtree access
- * l_int32 quadtreeGetParent()
- * l_int32 quadtreeGetChildren()
- * l_int32 quadtreeMaxLevels()
- *
- * Display quadtree
- * PIX *fpixaDisplayQuadtree()
- *
- *
- * There are many other statistical quantities that can be computed
- * in a quadtree, such as rank values, and these can be added as
- * the need arises.
- *
- * Similar results that can approximate a single level of the quadtree
- * can be generated by pixGetAverageTiled(). There we specify the
- * tile size over which the mean, mean square, and root variance
- * are generated; the results are saved in a (reduced size) pix.
- * Because the tile dimensions are integers, it is usually not possible
- * to obtain tilings that are a power of 2, as required for quadtrees.
- *
- */
-
-#ifdef HAVE_CONFIG_H
-#include
-#endif /* HAVE_CONFIG_H */
-
-#include
-#include "allheaders.h"
-
-#ifndef NO_CONSOLE_IO
-#define DEBUG_BOXES 0
-#endif /* !NO_CONSOLE_IO */
-
-
-/*----------------------------------------------------------------------*
- * Top-level quadtree linear statistics *
- *----------------------------------------------------------------------*/
-/*!
- * \brief pixQuadtreeMean()
- *
- * \param[in] pixs 8 bpp, no colormap
- * \param[in] nlevels in quadtree; max allowed depends on image size
- * \param[in] pix_ma input mean accumulator; can be null
- * \param[out] pfpixa mean values in quadtree
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) The returned fpixa has %nlevels of fpix, each containing
- * the mean values at its level. Level 0 has a
- * single value; level 1 has 4 values; level 2 has 16; etc.
- *
- */
-l_ok
-pixQuadtreeMean(PIX *pixs,
- l_int32 nlevels,
- PIX *pix_ma,
- FPIXA **pfpixa)
-{
-l_int32 i, j, w, h, size, n;
-l_float32 val;
-BOX *box;
-BOXA *boxa;
-BOXAA *baa;
-FPIX *fpix;
-PIX *pix_mac;
-
- PROCNAME("pixQuadtreeMean");
-
- if (!pfpixa)
- return ERROR_INT("&fpixa not defined", procName, 1);
- *pfpixa = NULL;
- if (!pixs || pixGetDepth(pixs) != 8)
- return ERROR_INT("pixs not defined or not 8 bpp", procName, 1);
- pixGetDimensions(pixs, &w, &h, NULL);
- if (nlevels > quadtreeMaxLevels(w, h))
- return ERROR_INT("nlevels too large for image", procName, 1);
-
- if (!pix_ma)
- pix_mac = pixBlockconvAccum(pixs);
- else
- pix_mac = pixClone(pix_ma);
- if (!pix_mac)
- return ERROR_INT("pix_mac not made", procName, 1);
-
- if ((baa = boxaaQuadtreeRegions(w, h, nlevels)) == NULL) {
- pixDestroy(&pix_mac);
- return ERROR_INT("baa not made", procName, 1);
- }
-
- *pfpixa = fpixaCreate(nlevels);
- for (i = 0; i < nlevels; i++) {
- boxa = boxaaGetBoxa(baa, i, L_CLONE);
- size = 1 << i;
- n = boxaGetCount(boxa); /* n == size * size */
- fpix = fpixCreate(size, size);
- for (j = 0; j < n; j++) {
- box = boxaGetBox(boxa, j, L_CLONE);
- pixMeanInRectangle(pixs, box, pix_mac, &val);
- fpixSetPixel(fpix, j % size, j / size, val);
- boxDestroy(&box);
- }
- fpixaAddFPix(*pfpixa, fpix, L_INSERT);
- boxaDestroy(&boxa);
- }
-
- pixDestroy(&pix_mac);
- boxaaDestroy(&baa);
- return 0;
-}
-
-
-/*!
- * \brief pixQuadtreeVariance()
- *
- * \param[in] pixs 8 bpp, no colormap
- * \param[in] nlevels in quadtree
- * \param[in] pix_ma input mean accumulator; can be null
- * \param[in] dpix_msa input mean square accumulator; can be null
- * \param[out] pfpixa_v [optional] variance values in quadtree
- * \param[out] pfpixa_rv [optional] root variance values in quadtree
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) The returned fpixav and fpixarv have %nlevels of fpix,
- * each containing at the respective levels the variance
- * and root variance values.
- *
- */
-l_ok
-pixQuadtreeVariance(PIX *pixs,
- l_int32 nlevels,
- PIX *pix_ma,
- DPIX *dpix_msa,
- FPIXA **pfpixa_v,
- FPIXA **pfpixa_rv)
-{
-l_int32 i, j, w, h, size, n;
-l_float32 var, rvar;
-BOX *box;
-BOXA *boxa;
-BOXAA *baa;
-FPIX *fpixv, *fpixrv;
-PIX *pix_mac; /* copy of mean accumulator */
-DPIX *dpix_msac; /* msa clone */
-
- PROCNAME("pixQuadtreeVariance");
-
- if (!pfpixa_v && !pfpixa_rv)
- return ERROR_INT("neither &fpixav nor &fpixarv defined", procName, 1);
- if (pfpixa_v) *pfpixa_v = NULL;
- if (pfpixa_rv) *pfpixa_rv = NULL;
- if (!pixs || pixGetDepth(pixs) != 8)
- return ERROR_INT("pixs not defined or not 8 bpp", procName, 1);
- pixGetDimensions(pixs, &w, &h, NULL);
- if (nlevels > quadtreeMaxLevels(w, h))
- return ERROR_INT("nlevels too large for image", procName, 1);
-
- if (!pix_ma)
- pix_mac = pixBlockconvAccum(pixs);
- else
- pix_mac = pixClone(pix_ma);
- if (!pix_mac)
- return ERROR_INT("pix_mac not made", procName, 1);
- if (!dpix_msa)
- dpix_msac = pixMeanSquareAccum(pixs);
- else
- dpix_msac = dpixClone(dpix_msa);
- if (!dpix_msac) {
- pixDestroy(&pix_mac);
- return ERROR_INT("dpix_msac not made", procName, 1);
- }
-
- if ((baa = boxaaQuadtreeRegions(w, h, nlevels)) == NULL) {
- pixDestroy(&pix_mac);
- dpixDestroy(&dpix_msac);
- return ERROR_INT("baa not made", procName, 1);
- }
-
- if (pfpixa_v) *pfpixa_v = fpixaCreate(nlevels);
- if (pfpixa_rv) *pfpixa_rv = fpixaCreate(nlevels);
- for (i = 0; i < nlevels; i++) {
- boxa = boxaaGetBoxa(baa, i, L_CLONE);
- size = 1 << i;
- n = boxaGetCount(boxa); /* n == size * size */
- if (pfpixa_v) fpixv = fpixCreate(size, size);
- if (pfpixa_rv) fpixrv = fpixCreate(size, size);
- for (j = 0; j < n; j++) {
- box = boxaGetBox(boxa, j, L_CLONE);
- pixVarianceInRectangle(pixs, box, pix_mac, dpix_msac, &var, &rvar);
- if (pfpixa_v) fpixSetPixel(fpixv, j % size, j / size, var);
- if (pfpixa_rv) fpixSetPixel(fpixrv, j % size, j / size, rvar);
- boxDestroy(&box);
- }
- if (pfpixa_v) fpixaAddFPix(*pfpixa_v, fpixv, L_INSERT);
- if (pfpixa_rv) fpixaAddFPix(*pfpixa_rv, fpixrv, L_INSERT);
- boxaDestroy(&boxa);
- }
-
- pixDestroy(&pix_mac);
- dpixDestroy(&dpix_msac);
- boxaaDestroy(&baa);
- return 0;
-}
-
-
-/*----------------------------------------------------------------------*
- * Statistics in an arbitrary rectangle *
- *----------------------------------------------------------------------*/
-/*!
- * \brief pixMeanInRectangle()
- *
- * \param[in] pixs 8 bpp
- * \param[in] box region to compute mean value
- * \param[in] pixma mean accumulator
- * \param[out] pval mean value
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This function is intended to be used for many rectangles
- * on the same image. It can find the mean within a
- * rectangle in O(1), independent of the size of the rectangle.
- *
- */
-l_ok
-pixMeanInRectangle(PIX *pixs,
- BOX *box,
- PIX *pixma,
- l_float32 *pval)
-{
-l_int32 w, h, bx, by, bw, bh;
-l_uint32 val00, val01, val10, val11;
-l_float32 norm;
-BOX *boxc;
-
- PROCNAME("pixMeanInRectangle");
-
- if (!pval)
- return ERROR_INT("&val not defined", procName, 1);
- *pval = 0.0;
- if (!pixs || pixGetDepth(pixs) != 8)
- return ERROR_INT("pixs not defined", procName, 1);
- if (!box)
- return ERROR_INT("box not defined", procName, 1);
- if (!pixma)
- return ERROR_INT("pixma not defined", procName, 1);
-
- /* Clip rectangle to image */
- pixGetDimensions(pixs, &w, &h, NULL);
- boxc = boxClipToRectangle(box, w, h);
- boxGetGeometry(boxc, &bx, &by, &bw, &bh);
- boxDestroy(&boxc);
-
- if (bw == 0 || bh == 0)
- return ERROR_INT("no pixels in box", procName, 1);
-
- /* Use up to 4 points in the accumulator */
- norm = 1.0 / ((l_float32)(bw) * bh);
- if (bx > 0 && by > 0) {
- pixGetPixel(pixma, bx + bw - 1, by + bh - 1, &val11);
- pixGetPixel(pixma, bx + bw - 1, by - 1, &val10);
- pixGetPixel(pixma, bx - 1, by + bh - 1, &val01);
- pixGetPixel(pixma, bx - 1, by - 1, &val00);
- *pval = norm * (val11 - val01 + val00 - val10);
- } else if (by > 0) { /* bx == 0 */
- pixGetPixel(pixma, bw - 1, by + bh - 1, &val11);
- pixGetPixel(pixma, bw - 1, by - 1, &val10);
- *pval = norm * (val11 - val10);
- } else if (bx > 0) { /* by == 0 */
- pixGetPixel(pixma, bx + bw - 1, bh - 1, &val11);
- pixGetPixel(pixma, bx - 1, bh - 1, &val01);
- *pval = norm * (val11 - val01);
- } else { /* bx == 0 && by == 0 */
- pixGetPixel(pixma, bw - 1, bh - 1, &val11);
- *pval = norm * val11;
- }
-
- return 0;
-}
-
-
-/*!
- * \brief pixVarianceInRectangle()
- *
- * \param[in] pixs 8 bpp
- * \param[in] box region to compute variance and/or root variance
- * \param[in] pix_ma mean accumulator
- * \param[in] dpix_msa mean square accumulator
- * \param[out] pvar [optional] variance
- * \param[out] prvar [optional] root variance
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) This function is intended to be used for many rectangles
- * on the same image. It can find the variance and/or the
- * square root of the variance within a rectangle in O(1),
- * independent of the size of the rectangle.
- *
- */
-l_ok
-pixVarianceInRectangle(PIX *pixs,
- BOX *box,
- PIX *pix_ma,
- DPIX *dpix_msa,
- l_float32 *pvar,
- l_float32 *prvar)
-{
-l_int32 w, h, bx, by, bw, bh;
-l_uint32 val00, val01, val10, val11;
-l_float64 dval00, dval01, dval10, dval11, mval, msval, var, norm;
-BOX *boxc;
-
- PROCNAME("pixVarianceInRectangle");
-
- if (!pvar && !prvar)
- return ERROR_INT("neither &var nor &rvar defined", procName, 1);
- if (pvar) *pvar = 0.0;
- if (prvar) *prvar = 0.0;
- if (!pixs || pixGetDepth(pixs) != 8)
- return ERROR_INT("pixs not defined", procName, 1);
- if (!box)
- return ERROR_INT("box not defined", procName, 1);
- if (!pix_ma)
- return ERROR_INT("pix_ma not defined", procName, 1);
- if (!dpix_msa)
- return ERROR_INT("dpix_msa not defined", procName, 1);
-
- /* Clip rectangle to image */
- pixGetDimensions(pixs, &w, &h, NULL);
- boxc = boxClipToRectangle(box, w, h);
- boxGetGeometry(boxc, &bx, &by, &bw, &bh);
- boxDestroy(&boxc);
-
- if (bw == 0 || bh == 0)
- return ERROR_INT("no pixels in box", procName, 1);
-
- /* Use up to 4 points in the accumulators */
- norm = 1.0 / ((l_float32)(bw) * bh);
- if (bx > 0 && by > 0) {
- pixGetPixel(pix_ma, bx + bw - 1, by + bh - 1, &val11);
- pixGetPixel(pix_ma, bx + bw - 1, by - 1, &val10);
- pixGetPixel(pix_ma, bx - 1, by + bh - 1, &val01);
- pixGetPixel(pix_ma, bx - 1, by - 1, &val00);
- dpixGetPixel(dpix_msa, bx + bw - 1, by + bh - 1, &dval11);
- dpixGetPixel(dpix_msa, bx + bw - 1, by - 1, &dval10);
- dpixGetPixel(dpix_msa, bx - 1, by + bh - 1, &dval01);
- dpixGetPixel(dpix_msa, bx - 1, by - 1, &dval00);
- mval = norm * (val11 - val01 + val00 - val10);
- msval = norm * (dval11 - dval01 + dval00 - dval10);
- var = (msval - mval * mval);
- if (pvar) *pvar = (l_float32)var;
- if (prvar) *prvar = (l_float32)(sqrt(var));
- } else if (by > 0) { /* bx == 0 */
- pixGetPixel(pix_ma, bw - 1, by + bh - 1, &val11);
- pixGetPixel(pix_ma, bw - 1, by - 1, &val10);
- dpixGetPixel(dpix_msa, bw - 1, by + bh - 1, &dval11);
- dpixGetPixel(dpix_msa, bw - 1, by - 1, &dval10);
- mval = norm * (val11 - val10);
- msval = norm * (dval11 - dval10);
- var = (msval - mval * mval);
- if (pvar) *pvar = (l_float32)var;
- if (prvar) *prvar = (l_float32)(sqrt(var));
- } else if (bx > 0) { /* by == 0 */
- pixGetPixel(pix_ma, bx + bw - 1, bh - 1, &val11);
- pixGetPixel(pix_ma, bx - 1, bh - 1, &val01);
- dpixGetPixel(dpix_msa, bx + bw - 1, bh - 1, &dval11);
- dpixGetPixel(dpix_msa, bx - 1, bh - 1, &dval01);
- mval = norm * (val11 - val01);
- msval = norm * (dval11 - dval01);
- var = (msval - mval * mval);
- if (pvar) *pvar = (l_float32)var;
- if (prvar) *prvar = (l_float32)(sqrt(var));
- } else { /* bx == 0 && by == 0 */
- pixGetPixel(pix_ma, bw - 1, bh - 1, &val11);
- dpixGetPixel(dpix_msa, bw - 1, bh - 1, &dval11);
- mval = norm * val11;
- msval = norm * dval11;
- var = (msval - mval * mval);
- if (pvar) *pvar = (l_float32)var;
- if (prvar) *prvar = (l_float32)(sqrt(var));
- }
-
- return 0;
-}
-
-
-/*----------------------------------------------------------------------*
- * Quadtree regions *
- *----------------------------------------------------------------------*/
-/*!
- * \brief boxaaQuadtreeRegions()
- *
- * \param[in] w, h size of pix that is being quadtree-ized
- * \param[in] nlevels number of levels in quadtree
- * \return baa for quadtree regions at each level, or NULL on error
- *
- *
- * Notes:
- * (1) The returned boxaa has %nlevels of boxa, each containing
- * the set of rectangles at that level. The rectangle at
- * level 0 is the entire region; at level 1 the region is
- * divided into 4 rectangles, and at level n there are n^4
- * rectangles.
- * (2) At each level, the rectangles in the boxa are in "raster"
- * order, with LR (fast scan) and TB (slow scan).
- *
- */
-BOXAA *
-boxaaQuadtreeRegions(l_int32 w,
- l_int32 h,
- l_int32 nlevels)
-{
-l_int32 i, j, k, maxpts, nside, nbox, bw, bh;
-l_int32 *xstart, *xend, *ystart, *yend;
-BOX *box;
-BOXA *boxa;
-BOXAA *baa;
-
- PROCNAME("boxaaQuadtreeRegions");
-
- if (nlevels < 1)
- return (BOXAA *)ERROR_PTR("nlevels must be >= 1", procName, NULL);
- if (w < (1 << (nlevels - 1)))
- return (BOXAA *)ERROR_PTR("w doesn't support nlevels", procName, NULL);
- if (h < (1 << (nlevels - 1)))
- return (BOXAA *)ERROR_PTR("h doesn't support nlevels", procName, NULL);
-
- baa = boxaaCreate(nlevels);
- maxpts = 1 << (nlevels - 1);
- xstart = (l_int32 *)LEPT_CALLOC(maxpts, sizeof(l_int32));
- xend = (l_int32 *)LEPT_CALLOC(maxpts, sizeof(l_int32));
- ystart = (l_int32 *)LEPT_CALLOC(maxpts, sizeof(l_int32));
- yend = (l_int32 *)LEPT_CALLOC(maxpts, sizeof(l_int32));
- for (k = 0; k < nlevels; k++) {
- nside = 1 << k; /* number of boxes in each direction */
- for (i = 0; i < nside; i++) {
- xstart[i] = (w - 1) * i / nside;
- if (i > 0) xstart[i]++;
- xend[i] = (w - 1) * (i + 1) / nside;
- ystart[i] = (h - 1) * i / nside;
- if (i > 0) ystart[i]++;
- yend[i] = (h - 1) * (i + 1) / nside;
-#if DEBUG_BOXES
- lept_stderr(
- "k = %d, xs[%d] = %d, xe[%d] = %d, ys[%d] = %d, ye[%d] = %d\n",
- k, i, xstart[i], i, xend[i], i, ystart[i], i, yend[i]);
-#endif /* DEBUG_BOXES */
- }
- nbox = 1 << (2 * k);
- boxa = boxaCreate(nbox);
- for (i = 0; i < nside; i++) {
- bh = yend[i] - ystart[i] + 1;
- for (j = 0; j < nside; j++) {
- bw = xend[j] - xstart[j] + 1;
- box = boxCreate(xstart[j], ystart[i], bw, bh);
- boxaAddBox(boxa, box, L_INSERT);
- }
- }
- boxaaAddBoxa(baa, boxa, L_INSERT);
- }
-
- LEPT_FREE(xstart);
- LEPT_FREE(xend);
- LEPT_FREE(ystart);
- LEPT_FREE(yend);
- return baa;
-}
-
-
-/*----------------------------------------------------------------------*
- * Quadtree access *
- *----------------------------------------------------------------------*/
-/*!
- * \brief quadtreeGetParent()
- *
- * \param[in] fpixa mean, variance or root variance
- * \param[in] level, x, y of current pixel
- * \param[out] pval parent pixel value, or 0.0 on error
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) Check return value for error. On error, val is returned as 0.0.
- * (2) The parent is located at:
- * level - 1
- * (x/2, y/2)
- *
- */
-l_ok
-quadtreeGetParent(FPIXA *fpixa,
- l_int32 level,
- l_int32 x,
- l_int32 y,
- l_float32 *pval)
-{
-l_int32 n;
-
- PROCNAME("quadtreeGetParent");
-
- if (!pval)
- return ERROR_INT("&val not defined", procName, 1);
- *pval = 0.0;
- if (!fpixa)
- return ERROR_INT("fpixa not defined", procName, 1);
- n = fpixaGetCount(fpixa);
- if (level < 1 || level >= n)
- return ERROR_INT("invalid level", procName, 1);
-
- if (fpixaGetPixel(fpixa, level - 1, x / 2, y / 2, pval) != 0)
- return ERROR_INT("invalid coordinates", procName, 1);
- return 0;
-}
-
-
-/*!
- * \brief quadtreeGetChildren()
- *
- * \param[in] fpixa mean, variance or root variance
- * \param[in] level, x, y of current pixel
- * \param[out] pval00, pval01,
- * pval10, pval11 four child pixel values
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) Check return value for error. On error, all return vals are 0.0.
- * (2) The returned child pixels are located at:
- * level + 1
- * (2x, 2y), (2x+1, 2y), (2x, 2y+1), (2x+1, 2y+1)
- *
- */
-l_ok
-quadtreeGetChildren(FPIXA *fpixa,
- l_int32 level,
- l_int32 x,
- l_int32 y,
- l_float32 *pval00,
- l_float32 *pval10,
- l_float32 *pval01,
- l_float32 *pval11)
-{
-l_int32 n;
-
- PROCNAME("quadtreeGetChildren");
-
- if (!pval00 || !pval01 || !pval10 || !pval11)
- return ERROR_INT("&val* not all defined", procName, 1);
- *pval00 = *pval10 = *pval01 = *pval11 = 0.0;
- if (!fpixa)
- return ERROR_INT("fpixa not defined", procName, 1);
- n = fpixaGetCount(fpixa);
- if (level < 0 || level >= n - 1)
- return ERROR_INT("invalid level", procName, 1);
-
- if (fpixaGetPixel(fpixa, level + 1, 2 * x, 2 * y, pval00) != 0)
- return ERROR_INT("invalid coordinates", procName, 1);
- fpixaGetPixel(fpixa, level + 1, 2 * x + 1, 2 * y, pval10);
- fpixaGetPixel(fpixa, level + 1, 2 * x, 2 * y + 1, pval01);
- fpixaGetPixel(fpixa, level + 1, 2 * x + 1, 2 * y + 1, pval11);
- return 0;
-}
-
-
-/*!
- * \brief quadtreeMaxLevels()
- *
- * \param[in] w, h dimensions of image
- * \return maxlevels maximum number of levels allowed, or -1 on error
- *
- *
- * Notes:
- * (1) The criterion for maxlevels is that the subdivision not
- * go down below the single pixel level. The 1.5 factor
- * is intended to keep any rectangle from accidentally
- * having zero dimension due to integer truncation.
- *
- */
-l_int32
-quadtreeMaxLevels(l_int32 w,
- l_int32 h)
-{
-l_int32 i, minside;
-
- minside = L_MIN(w, h);
- for (i = 0; i < 20; i++) { /* 2^10 = one million */
- if (minside < (1.5 * (1 << i)))
- return i - 1;
- }
-
- return -1; /* fail if the image has over a trillion pixels! */
-}
-
-
-/*----------------------------------------------------------------------*
- * Display quadtree *
- *----------------------------------------------------------------------*/
-/*!
- * \brief fpixaDisplayQuadtree()
- *
- * \param[in] fpixa mean, variance or root variance
- * \param[in] factor replication factor at lowest level
- * \param[in] fontsize 4, ... 20
- * \return pixd 8 bpp, mosaic of quadtree images, or NULL on error
- *
- *
- * Notes:
- * (1) The mean and root variance fall naturally in the 8 bpp range,
- * but the variance is typically outside the range. This
- * function displays 8 bpp pix clipped to 255, so the image
- * pixels will mostly be 255 (white).
- *
- */
-PIX *
-fpixaDisplayQuadtree(FPIXA *fpixa,
- l_int32 factor,
- l_int32 fontsize)
-{
-char buf[256];
-l_int32 nlevels, i, mag, w;
-L_BMF *bmf;
-FPIX *fpix;
-PIX *pixt1, *pixt2, *pixt3, *pixt4, *pixd;
-PIXA *pixat;
-
- PROCNAME("fpixaDisplayQuadtree");
-
- if (!fpixa)
- return (PIX *)ERROR_PTR("fpixa not defined", procName, NULL);
-
- if ((nlevels = fpixaGetCount(fpixa)) == 0)
- return (PIX *)ERROR_PTR("pixas empty", procName, NULL);
-
- if ((bmf = bmfCreate(NULL, fontsize)) == NULL)
- L_ERROR("bmf not made; text will not be added", procName);
- pixat = pixaCreate(nlevels);
- for (i = 0; i < nlevels; i++) {
- fpix = fpixaGetFPix(fpixa, i, L_CLONE);
- pixt1 = fpixConvertToPix(fpix, 8, L_CLIP_TO_ZERO, 0);
- mag = factor * (1 << (nlevels - i - 1));
- pixt2 = pixExpandReplicate(pixt1, mag);
- pixt3 = pixConvertTo32(pixt2);
- snprintf(buf, sizeof(buf), "Level %d\n", i);
- pixt4 = pixAddSingleTextblock(pixt3, bmf, buf, 0xff000000,
- L_ADD_BELOW, NULL);
- pixaAddPix(pixat, pixt4, L_INSERT);
- fpixDestroy(&fpix);
- pixDestroy(&pixt1);
- pixDestroy(&pixt2);
- pixDestroy(&pixt3);
- }
- w = pixGetWidth(pixt4);
- pixd = pixaDisplayTiledInRows(pixat, 32, nlevels * (w + 80), 1.0, 0, 30, 2);
-
- pixaDestroy(&pixat);
- bmfDestroy(&bmf);
- return pixd;
-}
diff --git a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/queue.c b/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/queue.c
deleted file mode 100644
index e0397bcc..00000000
--- a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/queue.c
+++ /dev/null
@@ -1,326 +0,0 @@
-/*====================================================================*
- - Copyright (C) 2001 Leptonica. All rights reserved.
- -
- - Redistribution and use in source and binary forms, with or without
- - modification, are permitted provided that the following conditions
- - are met:
- - 1. Redistributions of source code must retain the above copyright
- - notice, this list of conditions and the following disclaimer.
- - 2. Redistributions in binary form must reproduce the above
- - copyright notice, this list of conditions and the following
- - disclaimer in the documentation and/or other materials
- - provided with the distribution.
- -
- - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- - ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- - LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- - A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL ANY
- - CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
- - EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
- - PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
- - PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
- - OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
- - NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- *====================================================================*/
-
-/*!
- * \file queue.c
- *
- *
- * Create/Destroy L_Queue
- * L_QUEUE *lqueueCreate()
- * void *lqueueDestroy()
- *
- * Operations to add/remove to/from a L_Queue
- * l_int32 lqueueAdd()
- * static l_int32 lqueueExtendArray()
- * void *lqueueRemove()
- *
- * Accessors
- * l_int32 lqueueGetCount()
- *
- * Debug output
- * l_int32 lqueuePrint()
- *
- * The lqueue is a fifo that implements a queue of void* pointers.
- * It can be used to hold a queue of any type of struct.
- * Internally, it maintains two counters:
- * nhead: location of head (in ptrs) from the beginning
- * of the buffer
- * nelem: number of ptr elements stored in the queue
- * As items are added to the queue, nelem increases.
- * As items are removed, nhead increases and nelem decreases.
- * Any time the tail reaches the end of the allocated buffer,
- * all the pointers are shifted to the left, so that the head
- * is at the beginning of the array.
- * If the buffer becomes more than 3/4 full, it doubles in size.
- *
- * [A circular queue would allow us to skip the shifting and
- * to resize only when the buffer is full. For most applications,
- * the extra work we do for a linear queue is not significant.]
- *
- */
-
-#ifdef HAVE_CONFIG_H
-#include
-#endif /* HAVE_CONFIG_H */
-
-#include
-#include "allheaders.h"
-
-static const l_int32 MIN_BUFFER_SIZE = 20; /* n'importe quoi */
-static const l_int32 INITIAL_BUFFER_ARRAYSIZE = 1024; /* n'importe quoi */
-
- /* Static function */
-static l_int32 lqueueExtendArray(L_QUEUE *lq);
-
-/*--------------------------------------------------------------------------*
- * L_Queue create/destroy *
- *--------------------------------------------------------------------------*/
-/*!
- * \brief lqueueCreate()
- *
- * \param[in] nalloc size of ptr array to be alloc'd; 0 for default
- * \return lqueue, or NULL on error
- *
- *
- * Notes:
- * (1) Allocates a ptr array of given size, and initializes counters.
- *
- */
-L_QUEUE *
-lqueueCreate(l_int32 nalloc)
-{
-L_QUEUE *lq;
-
- PROCNAME("lqueueCreate");
-
- if (nalloc < MIN_BUFFER_SIZE)
- nalloc = INITIAL_BUFFER_ARRAYSIZE;
-
- lq = (L_QUEUE *)LEPT_CALLOC(1, sizeof(L_QUEUE));
- if ((lq->array = (void **)LEPT_CALLOC(nalloc, sizeof(void *))) == NULL) {
- lqueueDestroy(&lq, 0);
- return (L_QUEUE *)ERROR_PTR("ptr array not made", procName, NULL);
- }
- lq->nalloc = nalloc;
- lq->nhead = lq->nelem = 0;
- return lq;
-}
-
-
-/*!
- * \brief lqueueDestroy()
- *
- * \param[in,out] plq will be set to null before returning
- * \param[in] freeflag TRUE to free each remaining struct in the array
- * \return void
- *
- *
- * Notes:
- * (1) If freeflag is TRUE, frees each struct in the array.
- * (2) If freeflag is FALSE but there are elements on the array,
- * gives a warning and destroys the array. This will
- * cause a memory leak of all the items that were on the queue.
- * So if the items require their own destroy function, they
- * must be destroyed before the queue. The same applies to the
- * auxiliary stack, if it is used.
- * (3) To destroy the L_Queue, we destroy the ptr array, then
- * the lqueue, and then null the contents of the input ptr.
- *
- */
-void
-lqueueDestroy(L_QUEUE **plq,
- l_int32 freeflag)
-{
-void *item;
-L_QUEUE *lq;
-
- PROCNAME("lqueueDestroy");
-
- if (plq == NULL) {
- L_WARNING("ptr address is NULL\n", procName);
- return;
- }
- if ((lq = *plq) == NULL)
- return;
-
- if (freeflag) {
- while(lq->nelem > 0) {
- item = lqueueRemove(lq);
- LEPT_FREE(item);
- }
- } else if (lq->nelem > 0) {
- L_WARNING("memory leak of %d items in lqueue!\n", procName, lq->nelem);
- }
-
- if (lq->array)
- LEPT_FREE(lq->array);
- if (lq->stack)
- lstackDestroy(&lq->stack, freeflag);
- LEPT_FREE(lq);
- *plq = NULL;
-
- return;
-}
-
-
-/*--------------------------------------------------------------------------*
- * Accessors *
- *--------------------------------------------------------------------------*/
-/*!
- * \brief lqueueAdd()
- *
- * \param[in] lq lqueue
- * \param[in] item to be added to the tail of the queue
- * \return 0 if OK, 1 on error
- *
- *
- * Notes:
- * (1) The algorithm is as follows. If the queue is populated
- * to the end of the allocated array, shift all ptrs toward
- * the beginning of the array, so that the head of the queue
- * is at the beginning of the array. Then, if the array is
- * more than 0.75 full, realloc with double the array size.
- * Finally, add the item to the tail of the queue.
- *
- */
-l_ok
-lqueueAdd(L_QUEUE *lq,
- void *item)
-{
- PROCNAME("lqueueAdd");
-
- if (!lq)
- return ERROR_INT("lq not defined", procName, 1);
- if (!item)
- return ERROR_INT("item not defined", procName, 1);
-
- /* If filled to the end and the ptrs can be shifted to the left,
- * shift them. */
- if ((lq->nhead + lq->nelem >= lq->nalloc) && (lq->nhead != 0)) {
- memmove(lq->array, lq->array + lq->nhead, sizeof(void *) * lq->nelem);
- lq->nhead = 0;
- }
-
- /* If necessary, expand the allocated array by a factor of 2 */
- if (lq->nelem > 0.75 * lq->nalloc)
- lqueueExtendArray(lq);
-
- /* Now add the item */
- lq->array[lq->nhead + lq->nelem] = (void *)item;
- lq->nelem++;
-
- return 0;
-}
-
-
-/*!
- * \brief lqueueExtendArray()
- *
- * \param[in] lq lqueue
- * \return 0 if OK, 1 on error
- */
-static l_int32
-lqueueExtendArray(L_QUEUE *lq)
-{
- PROCNAME("lqueueExtendArray");
-
- if (!lq)
- return ERROR_INT("lq not defined", procName, 1);
-
- if ((lq->array = (void **)reallocNew((void **)&lq->array,
- sizeof(void *) * lq->nalloc,
- 2 * sizeof(void *) * lq->nalloc)) == NULL)
- return ERROR_INT("new ptr array not returned", procName, 1);
-
- lq->nalloc = 2 * lq->nalloc;
- return 0;
-}
-
-
-/*!
- * \brief lqueueRemove()
- *
- * \param[in] lq lqueue
- * \return ptr to item popped from the head of the queue,
- * or NULL if the queue is empty or on error
- *
- *
- * Notes:
- * (1) If this is the last item on the queue, so that the queue
- * becomes empty, nhead is reset to the beginning of the array.
- *
- */
-void *
-lqueueRemove(L_QUEUE *lq)
-{
-void *item;
-
- PROCNAME("lqueueRemove");
-
- if (!lq)
- return (void *)ERROR_PTR("lq not defined", procName, NULL);
-
- if (lq->nelem == 0)
- return NULL;
- item = lq->array[lq->nhead];
- lq->array[lq->nhead] = NULL;
- if (lq->nelem == 1)
- lq->nhead = 0; /* reset head ptr */
- else
- (lq->nhead)++; /* can't go off end of array because nelem > 1 */
- lq->nelem--;
- return item;
-}
-
-
-/*!
- * \brief lqueueGetCount()
- *
- * \param[in] lq lqueue
- * \return count, or 0 on error
- */
-l_int32
-lqueueGetCount(L_QUEUE *lq)
-{
- PROCNAME("lqueueGetCount");
-
- if (!lq)
- return ERROR_INT("lq not defined", procName, 0);
-
- return lq->nelem;
-}
-
-
-/*---------------------------------------------------------------------*
- * Debug output *
- *---------------------------------------------------------------------*/
-/*!
- * \brief lqueuePrint()
- *
- * \param[in] fp file stream
- * \param[in] lq lqueue
- * \return 0 if OK; 1 on error
- */
-l_ok
-lqueuePrint(FILE *fp,
- L_QUEUE *lq)
-{
-l_int32 i;
-
- PROCNAME("lqueuePrint");
-
- if (!fp)
- return ERROR_INT("stream not defined", procName, 1);
- if (!lq)
- return ERROR_INT("lq not defined", procName, 1);
-
- fprintf(fp, "\n L_Queue: nalloc = %d, nhead = %d, nelem = %d, array = %p\n",
- lq->nalloc, lq->nhead, lq->nelem, lq->array);
- for (i = lq->nhead; i < lq->nhead + lq->nelem; i++)
- fprintf(fp, "array[%d] = %p\n", i, lq->array[i]);
-
- return 0;
-}
diff --git a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/queue.h b/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/queue.h
deleted file mode 100644
index fd380e83..00000000
--- a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/queue.h
+++ /dev/null
@@ -1,77 +0,0 @@
-/*====================================================================*
- - Copyright (C) 2001 Leptonica. All rights reserved.
- -
- - Redistribution and use in source and binary forms, with or without
- - modification, are permitted provided that the following conditions
- - are met:
- - 1. Redistributions of source code must retain the above copyright
- - notice, this list of conditions and the following disclaimer.
- - 2. Redistributions in binary form must reproduce the above
- - copyright notice, this list of conditions and the following
- - disclaimer in the documentation and/or other materials
- - provided with the distribution.
- -
- - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- - ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- - LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- - A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL ANY
- - CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
- - EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
- - PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
- - PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
- - OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
- - NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- *====================================================================*/
-
-#ifndef LEPTONICA_QUEUE_H
-#define LEPTONICA_QUEUE_H
-
-/*!
- * \file queue.h
- *
- *
- * Expandable pointer queue for arbitrary void* data.
- *
- * The L_Queue is a fifo that implements a queue of void* pointers.
- * It can be used to hold a queue of any type of struct.
- *
- * Internally, it maintains two counters:
- * nhead: location of head (in ptrs) from the beginning
- * of the array.
- * nelem: number of ptr elements stored in the queue.
- *
- * The element at the head of the queue, which is the next to
- * be removed, is array[nhead]. The location at the tail of the
- * queue to which the next element will be added is
- * array[nhead + nelem].
- *
- * As items are added to the queue, nelem increases.
- * As items are removed, nhead increases and nelem decreases.
- * Any time the tail reaches the end of the allocated array,
- * all the pointers are shifted to the left, so that the head
- * is at the beginning of the array.
- * If the array becomes more than 3/4 full, it doubles in size.
- *
- * The auxiliary stack can be used in a wrapper for re-using
- * items popped from the queue. It is not made by default.
- *
- * For further implementation details, see queue.c.
- *
- */
-
-/*! Expandable pointer queue for arbitrary void* data */
-struct L_Queue
-{
- l_int32 nalloc; /*!< size of allocated ptr array */
- l_int32 nhead; /*!< location of head (in ptrs) from the */
- /*!< beginning of the array */
- l_int32 nelem; /*!< number of elements stored in the queue */
- void **array; /*!< ptr array */
- struct L_Stack *stack; /*!< auxiliary stack */
-
-};
-typedef struct L_Queue L_QUEUE;
-
-
-#endif /* LEPTONICA_QUEUE_H */
diff --git a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/rank.c b/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/rank.c
deleted file mode 100644
index ece9b717..00000000
--- a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/rank.c
+++ /dev/null
@@ -1,544 +0,0 @@
-/*====================================================================*
- - Copyright (C) 2001 Leptonica. All rights reserved.
- -
- - Redistribution and use in source and binary forms, with or without
- - modification, are permitted provided that the following conditions
- - are met:
- - 1. Redistributions of source code must retain the above copyright
- - notice, this list of conditions and the following disclaimer.
- - 2. Redistributions in binary form must reproduce the above
- - copyright notice, this list of conditions and the following
- - disclaimer in the documentation and/or other materials
- - provided with the distribution.
- -
- - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- - ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- - LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- - A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL ANY
- - CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
- - EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
- - PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
- - PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
- - OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
- - NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- *====================================================================*/
-
-/*!
- * \file rank.c
- *
- *
- * Rank filter (gray and rgb)
- * PIX *pixRankFilter()
- * PIX *pixRankFilterRGB()
- * PIX *pixRankFilterGray()
- *
- * Median filter
- * PIX *pixMedianFilter()
- *
- * Rank filter (accelerated with downscaling)
- * PIX *pixRankFilterWithScaling()
- *
- * What is a brick rank filter?
- *
- * A brick rank order filter evaluates, for every pixel in the image,
- * a rectangular set of n = wf x hf pixels in its neighborhood (where the
- * pixel in question is at the "center" of the rectangle and is
- * included in the evaluation). It determines the value of the
- * neighboring pixel that is the r-th smallest in the set,
- * where r is some integer between 1 and n. The input rank parameter
- * is a fraction between 0.0 and 1.0, where 0.0 represents the
- * smallest value (r = 1) and 1.0 represents the largest value (r = n).
- * A median filter is a rank filter where rank = 0.5.
- *
- * It is important to note that grayscale erosion is equivalent
- * to rank = 0.0, and grayscale dilation is equivalent to rank = 1.0.
- * These are much easier to calculate than the general rank value,
- * thanks to the van Herk/Gil-Werman algorithm:
- * http://www.leptonica.com/grayscale-morphology.html
- * so you should use pixErodeGray() and pixDilateGray() for
- * rank 0.0 and 1.0, rsp. See notes below in the function header.
- *
- * How is a rank filter implemented efficiently on an image?
- *
- * Sorting will not work.
- *
- * * The best sort algorithms are O(n*logn), where n is the number
- * of values to be sorted (the area of the filter). For large
- * filters this is an impractically large number.
- *
- * * Selection of the rank value is O(n). (To understand why it's not
- * O(n*logn), see Numerical Recipes in C, 2nd edition, 1992, p. 355ff).
- * This also still far too much computation for large filters.
- *
- * * Suppose we get clever. We really only need to do an incremental
- * selection or sorting, because, for example, moving the filter
- * down by one pixel causes one filter width of pixels to be added
- * and another to be removed. Can we do this incrementally in
- * an efficient way? Unfortunately, no. The sorted values will be
- * in an array. Even if the filter width is 1, we can expect to
- * have to move O(n) pixels, because insertion and deletion can happen
- * anywhere in the array. By comparison, heapsort is excellent for
- * incremental sorting, where the cost for insertion or deletion
- * is O(logn), because the array itself doesn't need to
- * be sorted into strictly increasing order. However, heapsort
- * only gives the max (or min) value, not the general rank value.
- *
- * This leaves histograms.
- *
- * * Represented as an array. The problem with an array of 256
- * bins is that, in general, a significant fraction of the
- * entire histogram must be summed to find the rank value bin.
- * Suppose the filter size is 5x5. You spend most of your time
- * adding zeroes. Ouch!
- *
- * * Represented as a linked list. This would overcome the
- * summing-over-empty-bin problem, but you lose random access
- * for insertions and deletions. No way.
- *
- * * Two histogram solution. Maintain two histograms with
- * bin sizes of 1 and 16. Proceed from coarse to fine.
- * First locate the coarse bin for the given rank, of which
- * there are only 16. Then, in the 256 entry (fine) histogram,
- * you need look at a maximum of 16 bins. For each output
- * pixel, the average number of bins summed over, both in the
- * coarse and fine histograms, is thus 16.
- *
- * If someone has a better method, please let me know!
- *
- * The rank filtering operation is relatively expensive, compared to most
- * of the other imaging operations. The speed is only weakly dependent
- * on the size of the rank filter. On standard hardware, it runs at
- * about 10 Mpix/sec for a 50 x 50 filter, and 25 Mpix/sec for
- * a 5 x 5 filter. For applications where the rank filter can be
- * performed on a downscaled image, significant speedup can be
- * achieved because the time goes as the square of the scaling factor.
- * We provide an interface that handles the details, and only
- * requires the amount of downscaling to be input.
- *
- */
-
-#ifdef HAVE_CONFIG_H
-#include
-#endif /* HAVE_CONFIG_H */
-
-#include "allheaders.h"
-
-/*----------------------------------------------------------------------*
- * Rank order filter *
- *----------------------------------------------------------------------*/
-/*!
- * \brief pixRankFilter()
- *
- * \param[in] pixs 8 or 32 bpp; no colormap
- * \param[in] wf, hf width and height of filter; each is >= 1
- * \param[in] rank in [0.0 ... 1.0]
- * \return pixd of rank values, or NULL on error
- *
- *
- * Notes:
- * (1) This defines, for each pixel in pixs, a neighborhood of
- * pixels given by a rectangle "centered" on the pixel.
- * This set of wf*hf pixels has a distribution of values.
- * For each component, if the values are sorted in increasing
- * order, we choose the component such that rank*(wf*hf-1)
- * pixels have a lower or equal value and
- * (1-rank)*(wf*hf-1) pixels have an equal or greater value.
- * (2) See notes in pixRankFilterGray() for further details.
- *
- */
-PIX *
-pixRankFilter(PIX *pixs,
- l_int32 wf,
- l_int32 hf,
- l_float32 rank)
-{
-l_int32 d;
-
- PROCNAME("pixRankFilter");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- if (pixGetColormap(pixs) != NULL)
- return (PIX *)ERROR_PTR("pixs has colormap", procName, NULL);
- d = pixGetDepth(pixs);
- if (d != 8 && d != 32)
- return (PIX *)ERROR_PTR("pixs not 8 or 32 bpp", procName, NULL);
- if (wf < 1 || hf < 1)
- return (PIX *)ERROR_PTR("wf < 1 || hf < 1", procName, NULL);
- if (rank < 0.0 || rank > 1.0)
- return (PIX *)ERROR_PTR("rank must be in [0.0, 1.0]", procName, NULL);
- if (wf == 1 && hf == 1) /* no-op */
- return pixCopy(NULL, pixs);
-
- if (d == 8)
- return pixRankFilterGray(pixs, wf, hf, rank);
- else /* d == 32 */
- return pixRankFilterRGB(pixs, wf, hf, rank);
-}
-
-
-/*!
- * \brief pixRankFilterRGB()
- *
- * \param[in] pixs 32 bpp
- * \param[in] wf, hf width and height of filter; each is >= 1
- * \param[in] rank in [0.0 ... 1.0]
- * \return pixd of rank values, or NULL on error
- *
- *
- * Notes:
- * (1) This defines, for each pixel in pixs, a neighborhood of
- * pixels given by a rectangle "centered" on the pixel.
- * This set of wf*hf pixels has a distribution of values.
- * For each component, if the values are sorted in increasing
- * order, we choose the component such that rank*(wf*hf-1)
- * pixels have a lower or equal value and
- * (1-rank)*(wf*hf-1) pixels have an equal or greater value.
- * (2) Apply gray rank filtering to each component independently.
- * (3) See notes in pixRankFilterGray() for further details.
- *
- */
-PIX *
-pixRankFilterRGB(PIX *pixs,
- l_int32 wf,
- l_int32 hf,
- l_float32 rank)
-{
-PIX *pixr, *pixg, *pixb, *pixrf, *pixgf, *pixbf, *pixd;
-
- PROCNAME("pixRankFilterRGB");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- if (pixGetDepth(pixs) != 32)
- return (PIX *)ERROR_PTR("pixs not 32 bpp", procName, NULL);
- if (wf < 1 || hf < 1)
- return (PIX *)ERROR_PTR("wf < 1 || hf < 1", procName, NULL);
- if (rank < 0.0 || rank > 1.0)
- return (PIX *)ERROR_PTR("rank must be in [0.0, 1.0]", procName, NULL);
- if (wf == 1 && hf == 1) /* no-op */
- return pixCopy(NULL, pixs);
-
- pixr = pixGetRGBComponent(pixs, COLOR_RED);
- pixg = pixGetRGBComponent(pixs, COLOR_GREEN);
- pixb = pixGetRGBComponent(pixs, COLOR_BLUE);
-
- pixrf = pixRankFilterGray(pixr, wf, hf, rank);
- pixgf = pixRankFilterGray(pixg, wf, hf, rank);
- pixbf = pixRankFilterGray(pixb, wf, hf, rank);
-
- pixd = pixCreateRGBImage(pixrf, pixgf, pixbf);
- pixDestroy(&pixr);
- pixDestroy(&pixg);
- pixDestroy(&pixb);
- pixDestroy(&pixrf);
- pixDestroy(&pixgf);
- pixDestroy(&pixbf);
- return pixd;
-}
-
-
-/*!
- * \brief pixRankFilterGray()
- *
- * \param[in] pixs 8 bpp; no colormap
- * \param[in] wf, hf width and height of filter; each is >= 1
- * \param[in] rank in [0.0 ... 1.0]
- * \return pixd of rank values, or NULL on error
- *
- *
- * Notes:
- * (1) This defines, for each pixel in pixs, a neighborhood of
- * pixels given by a rectangle "centered" on the pixel.
- * This set of wf*hf pixels has a distribution of values,
- * and if they are sorted in increasing order, we choose
- * the pixel such that rank*(wf*hf-1) pixels have a lower
- * or equal value and (1-rank)*(wf*hf-1) pixels have an equal
- * or greater value.
- * (2) By this definition, the rank = 0.0 pixel has the lowest
- * value, and the rank = 1.0 pixel has the highest value.
- * (3) We add mirrored boundary pixels to avoid boundary effects,
- * and put the filter center at (0, 0).
- * (4) This dispatches to grayscale erosion or dilation if the
- * filter dimensions are odd and the rank is 0.0 or 1.0, rsp.
- * (5) Returns a copy if both wf and hf are 1.
- * (6) Uses row-major or column-major incremental updates to the
- * histograms depending on whether hf > wf or hv <= wf, rsp.
- *
- */
-PIX *
-pixRankFilterGray(PIX *pixs,
- l_int32 wf,
- l_int32 hf,
- l_float32 rank)
-{
-l_int32 w, h, d, i, j, k, m, n, rankloc, wplt, wpld, val, sum;
-l_int32 *histo, *histo16;
-l_uint32 *datat, *linet, *datad, *lined;
-PIX *pixt, *pixd;
-
- PROCNAME("pixRankFilterGray");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- if (pixGetColormap(pixs) != NULL)
- return (PIX *)ERROR_PTR("pixs has colormap", procName, NULL);
- pixGetDimensions(pixs, &w, &h, &d);
- if (d != 8)
- return (PIX *)ERROR_PTR("pixs not 8 bpp", procName, NULL);
- if (wf < 1 || hf < 1)
- return (PIX *)ERROR_PTR("wf < 1 || hf < 1", procName, NULL);
- if (rank < 0.0 || rank > 1.0)
- return (PIX *)ERROR_PTR("rank must be in [0.0, 1.0]", procName, NULL);
- if (wf == 1 && hf == 1) /* no-op */
- return pixCopy(NULL, pixs);
-
- /* For rank = 0.0, this is a grayscale erosion, and for rank = 1.0,
- * a dilation. Grayscale morphology operations are implemented
- * for filters of odd dimension, so we dispatch to grayscale
- * morphology if both wf and hf are odd. Otherwise, we
- * slightly adjust the rank (to get the correct behavior) and
- * use the slower rank filter here. */
- if (wf % 2 && hf % 2) {
- if (rank == 0.0)
- return pixErodeGray(pixs, wf, hf);
- else if (rank == 1.0)
- return pixDilateGray(pixs, wf, hf);
- }
- if (rank == 0.0) rank = 0.0001;
- if (rank == 1.0) rank = 0.9999;
-
- /* Add wf/2 to each side, and hf/2 to top and bottom of the
- * image, mirroring for accuracy and to avoid special-casing
- * the boundary. */
- if ((pixt = pixAddMirroredBorder(pixs, wf / 2, wf / 2, hf / 2, hf / 2))
- == NULL)
- return (PIX *)ERROR_PTR("pixt not made", procName, NULL);
-
- /* Set up the two histogram arrays. */
- histo = (l_int32 *)LEPT_CALLOC(256, sizeof(l_int32));
- histo16 = (l_int32 *)LEPT_CALLOC(16, sizeof(l_int32));
- rankloc = (l_int32)(rank * wf * hf);
-
- /* Place the filter center at (0, 0). This is just a
- * convenient location, because it allows us to perform
- * the rank filter over x:(0 ... w - 1) and y:(0 ... h - 1). */
- pixd = pixCreateTemplate(pixs);
- datat = pixGetData(pixt);
- wplt = pixGetWpl(pixt);
- datad = pixGetData(pixd);
- wpld = pixGetWpl(pixd);
-
- /* If hf > wf, it's more efficient to use row-major scanning.
- * Otherwise, traverse the image in use column-major order. */
- if (hf > wf) {
- for (j = 0; j < w; j++) { /* row-major */
- /* Start each column with clean histogram arrays. */
- for (n = 0; n < 256; n++)
- histo[n] = 0;
- for (n = 0; n < 16; n++)
- histo16[n] = 0;
-
- for (i = 0; i < h; i++) { /* fast scan on columns */
- /* Update the histos for the new location */
- lined = datad + i * wpld;
- if (i == 0) { /* do full histo */
- for (k = 0; k < hf; k++) {
- linet = datat + (i + k) * wplt;
- for (m = 0; m < wf; m++) {
- val = GET_DATA_BYTE(linet, j + m);
- histo[val]++;
- histo16[val >> 4]++;
- }
- }
- } else { /* incremental update */
- linet = datat + (i - 1) * wplt;
- for (m = 0; m < wf; m++) { /* remove top line */
- val = GET_DATA_BYTE(linet, j + m);
- histo[val]--;
- histo16[val >> 4]--;
- }
- linet = datat + (i + hf - 1) * wplt;
- for (m = 0; m < wf; m++) { /* add bottom line */
- val = GET_DATA_BYTE(linet, j + m);
- histo[val]++;
- histo16[val >> 4]++;
- }
- }
-
- /* Find the rank value */
- sum = 0;
- for (n = 0; n < 16; n++) { /* search over coarse histo */
- sum += histo16[n];
- if (sum > rankloc) {
- sum -= histo16[n];
- break;
- }
- }
- if (n == 16) { /* avoid accessing out of bounds */
- L_WARNING("n = 16; reducing\n", procName);
- n = 15;
- sum -= histo16[n];
- }
- k = 16 * n; /* starting value in fine histo */
- for (m = 0; m < 16; m++) {
- sum += histo[k];
- if (sum > rankloc) {
- SET_DATA_BYTE(lined, j, k);
- break;
- }
- k++;
- }
- }
- }
- } else { /* wf >= hf */
- for (i = 0; i < h; i++) { /* column-major */
- /* Start each row with clean histogram arrays. */
- for (n = 0; n < 256; n++)
- histo[n] = 0;
- for (n = 0; n < 16; n++)
- histo16[n] = 0;
- lined = datad + i * wpld;
- for (j = 0; j < w; j++) { /* fast scan on rows */
- /* Update the histos for the new location */
- if (j == 0) { /* do full histo */
- for (k = 0; k < hf; k++) {
- linet = datat + (i + k) * wplt;
- for (m = 0; m < wf; m++) {
- val = GET_DATA_BYTE(linet, j + m);
- histo[val]++;
- histo16[val >> 4]++;
- }
- }
- } else { /* incremental update at left and right sides */
- for (k = 0; k < hf; k++) {
- linet = datat + (i + k) * wplt;
- val = GET_DATA_BYTE(linet, j - 1);
- histo[val]--;
- histo16[val >> 4]--;
- val = GET_DATA_BYTE(linet, j + wf - 1);
- histo[val]++;
- histo16[val >> 4]++;
- }
- }
-
- /* Find the rank value */
- sum = 0;
- for (n = 0; n < 16; n++) { /* search over coarse histo */
- sum += histo16[n];
- if (sum > rankloc) {
- sum -= histo16[n];
- break;
- }
- }
- if (n == 16) { /* avoid accessing out of bounds */
- L_WARNING("n = 16; reducing\n", procName);
- n = 15;
- sum -= histo16[n];
- }
- k = 16 * n; /* starting value in fine histo */
- for (m = 0; m < 16; m++) {
- sum += histo[k];
- if (sum > rankloc) {
- SET_DATA_BYTE(lined, j, k);
- break;
- }
- k++;
- }
- }
- }
- }
-
- pixDestroy(&pixt);
- LEPT_FREE(histo);
- LEPT_FREE(histo16);
- return pixd;
-}
-
-
-/*----------------------------------------------------------------------*
- * Median filter *
- *----------------------------------------------------------------------*/
-/*!
- * \brief pixMedianFilter()
- *
- * \param[in] pixs 8 or 32 bpp; no colormap
- * \param[in] wf, hf width and height of filter; each is >= 1
- * \return pixd of median values, or NULL on error
- */
-PIX *
-pixMedianFilter(PIX *pixs,
- l_int32 wf,
- l_int32 hf)
-{
- PROCNAME("pixMedianFilter");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- return pixRankFilter(pixs, wf, hf, 0.5);
-}
-
-
-/*----------------------------------------------------------------------*
- * Rank filter (accelerated with downscaling) *
- *----------------------------------------------------------------------*/
-/*!
- * \brief pixRankFilterWithScaling()
- *
- * \param[in] pixs 8 or 32 bpp; no colormap
- * \param[in] wf, hf width and height of filter; each is >= 1
- * \param[in] rank in [0.0 ... 1.0]
- * \param[in] scalefactor scale factor; must be >= 0.2 and <= 0.7
- * \return pixd of rank values, or NULL on error
- *
- *
- * Notes:
- * (1) This is a convenience function that downscales, does
- * the rank filtering, and upscales. Because the down-
- * and up-scaling functions are very fast compared to
- * rank filtering, the time it takes is reduced from that
- * for the simple rank filtering operation by approximately
- * the square of the scaling factor.
- *
- */
-PIX *
-pixRankFilterWithScaling(PIX *pixs,
- l_int32 wf,
- l_int32 hf,
- l_float32 rank,
- l_float32 scalefactor)
-{
-l_int32 w, h, d, wfs, hfs;
-PIX *pix1, *pix2, *pixd;
-
- PROCNAME("pixRankFilterWithScaling");
-
- if (!pixs)
- return (PIX *)ERROR_PTR("pixs not defined", procName, NULL);
- if (pixGetColormap(pixs) != NULL)
- return (PIX *)ERROR_PTR("pixs has colormap", procName, NULL);
- d = pixGetDepth(pixs);
- if (d != 8 && d != 32)
- return (PIX *)ERROR_PTR("pixs not 8 or 32 bpp", procName, NULL);
- if (wf < 1 || hf < 1)
- return (PIX *)ERROR_PTR("wf < 1 || hf < 1", procName, NULL);
- if (rank < 0.0 || rank > 1.0)
- return (PIX *)ERROR_PTR("rank must be in [0.0, 1.0]", procName, NULL);
- if (wf == 1 && hf == 1) /* no-op */
- return pixCopy(NULL, pixs);
- if (scalefactor < 0.2 || scalefactor > 0.7) {
- L_ERROR("invalid scale factor; no scaling used\n", procName);
- return pixRankFilter(pixs, wf, hf, rank);
- }
-
- pix1 = pixScaleAreaMap(pixs, scalefactor, scalefactor);
- wfs = L_MAX(1, (l_int32)(scalefactor * wf + 0.5));
- hfs = L_MAX(1, (l_int32)(scalefactor * hf + 0.5));
- pix2 = pixRankFilter(pix1, wfs, hfs, rank);
- pixGetDimensions(pixs, &w, &h, NULL);
- pixd = pixScaleToSize(pix2, w, h);
- pixDestroy(&pix1);
- pixDestroy(&pix2);
- return pixd;
-}
diff --git a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/rbtree.c b/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/rbtree.c
deleted file mode 100644
index 922033b2..00000000
--- a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/rbtree.c
+++ /dev/null
@@ -1,902 +0,0 @@
-/*====================================================================*
- - Copyright (C) 2001 Leptonica. All rights reserved.
- -
- - Redistribution and use in source and binary forms, with or without
- - modification, are permitted provided that the following conditions
- - are met:
- - 1. Redistributions of source code must retain the above copyright
- - notice, this list of conditions and the following disclaimer.
- - 2. Redistributions in binary form must reproduce the above
- - copyright notice, this list of conditions and the following
- - disclaimer in the documentation and/or other materials
- - provided with the distribution.
- -
- - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- - ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- - LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- - A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL ANY
- - CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
- - EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
- - PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
- - PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
- - OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
- - NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- *====================================================================*/
-
-/*
- * Modified from the excellent code here:
- * http://en.literateprograms.org/Red-black_tree_(C)?oldid=19567
- * which has been placed in the public domain under the Creative Commons
- * CC0 1.0 waiver (http://creativecommons.org/publicdomain/zero/1.0/).
- */
-
-/*!
- * \file rbtree.c
- *
- *
- * Basic functions for using red-black trees. These are "nearly" balanced
- * sorted trees with ordering by key that allows insertion, lookup and
- * deletion of key/value pairs in log(n) time.
- *
- * We use red-black trees to implement our version of:
- * * a map: a function that maps keys to values (e.g., int64 --> int64).
- * * a set: a collection that is sorted by unique keys (without
- * associated values)
- *
- * There are 5 invariant properties of RB trees:
- * (1) Each node is either red or black.
- * (2) The root node is black.
- * (3) All leaves are black and contain no data (null).
- * (4) Every red node has two children and both are black. This is
- * equivalent to requiring the parent of every red node to be black.
- * (5) All paths from any given node to its leaf nodes contain the
- * same number of black nodes.
- *
- * Interface to red-black tree
- * L_RBTREE *l_rbtreeCreate()
- * RB_TYPE *l_rbtreeLookup()
- * void l_rbtreeInsert()
- * void l_rbtreeDelete()
- * void l_rbtreeDestroy()
- * L_RBTREE_NODE *l_rbtreeGetFirst()
- * L_RBTREE_NODE *l_rbtreeGetNext()
- * L_RBTREE_NODE *l_rbtreeGetLast()
- * L_RBTREE_NODE *l_rbtreeGetPrev()
- * l_int32 l_rbtreeGetCount()
- * void l_rbtreePrint()
- *
- * General comparison function
- * static l_int32 compareKeys()
- *
- */
-
-#ifdef HAVE_CONFIG_H
-#include
-#endif /* HAVE_CONFIG_H */
-
-#include "allheaders.h"
-
- /* The node color enum is only needed in the rbtree implementation */
-enum {
- L_RED_NODE = 1,
- L_BLACK_NODE = 2
-};
-
- /* This makes it simpler to read the code */
-typedef L_RBTREE_NODE node;
-
- /* Lots of static helper functions */
-static void destroy_helper(node *n);
-static void count_helper(node *n, l_int32 *pcount);
-static void print_tree_helper(FILE *fp, node *n, l_int32 keytype,
- l_int32 indent);
-
-static l_int32 compareKeys(l_int32 keytype, RB_TYPE left, RB_TYPE right);
-
-static node *grandparent(node *n);
-static node *sibling(node *n);
-static node *uncle(node *n);
-static l_int32 node_color(node *n);
-static node *new_node(RB_TYPE key, RB_TYPE value, l_int32 node_color,
- node *left, node *right);
-static node *lookup_node(L_RBTREE *t, RB_TYPE key);
-static void rotate_left(L_RBTREE *t, node *n);
-static void rotate_right(L_RBTREE *t, node *n);
-static void replace_node(L_RBTREE *t, node *oldn, node *newn);
-static void insert_case1(L_RBTREE *t, node *n);
-static void insert_case2(L_RBTREE *t, node *n);
-static void insert_case3(L_RBTREE *t, node *n);
-static void insert_case4(L_RBTREE *t, node *n);
-static void insert_case5(L_RBTREE *t, node *n);
-static node *maximum_node(node *root);
-static void delete_case1(L_RBTREE *t, node *n);
-static void delete_case2(L_RBTREE *t, node *n);
-static void delete_case3(L_RBTREE *t, node *n);
-static void delete_case4(L_RBTREE *t, node *n);
-static void delete_case5(L_RBTREE *t, node *n);
-static void delete_case6(L_RBTREE *t, node *n);
-static void verify_properties(L_RBTREE *t);
-
-#ifndef NO_CONSOLE_IO
-#define VERIFY_RBTREE 0 /* only for debugging */
-#endif /* ~NO_CONSOLE_IO */
-
-/* ------------------------------------------------------------- *
- * Interface to Red-black Tree *
- * ------------------------------------------------------------- */
-/*!
- * \brief l_rbtreeCreate()
- *
- * \param[in] keytype defined by an enum for an RB_TYPE union
- * \return rbtree container with empty ptr to the root
- */
-L_RBTREE *
-l_rbtreeCreate(l_int32 keytype)
-{
- PROCNAME("l_rbtreeCreate");
-
- if (keytype != L_INT_TYPE && keytype != L_UINT_TYPE &&
- keytype != L_FLOAT_TYPE && keytype)
- return (L_RBTREE *)ERROR_PTR("invalid keytype", procName, NULL);
-
- L_RBTREE *t = (L_RBTREE *)LEPT_CALLOC(1, sizeof(L_RBTREE));
- t->keytype = keytype;
- verify_properties(t);
- return t;
-}
-
-/*!
- * \brief l_rbtreeLookup()
- *
- * \param[in] t rbtree, including root node
- * \param[in] key find a node with this key
- * \return &value a pointer to a union, if the node exists; else NULL
- */
-RB_TYPE *
-l_rbtreeLookup(L_RBTREE *t,
- RB_TYPE key)
-{
- PROCNAME("l_rbtreeLookup");
-
- if (!t)
- return (RB_TYPE *)ERROR_PTR("tree is null\n", procName, NULL);
-
- node *n = lookup_node(t, key);
- return n == NULL ? NULL : &n->value;
-}
-
-/*!
- * \brief l_rbtreeInsert()
- *
- * \param[in] t rbtree, including root node
- * \param[in] key insert a node with this key, if the key does not
- * already exist in the tree
- * \param[in] value typically an int, used for an index
- * \return void
- *
- *
- * Notes:
- * (1) If a node with the key already exists, this just updates the value.
- *
- */
-void
-l_rbtreeInsert(L_RBTREE *t,
- RB_TYPE key,
- RB_TYPE value)
-{
-node *n, *inserted_node;
-
- PROCNAME("l_rbtreeInsert");
-
- if (!t) {
- L_ERROR("tree is null\n", procName);
- return;
- }
-
- inserted_node = new_node(key, value, L_RED_NODE, NULL, NULL);
- if (t->root == NULL) {
- t->root = inserted_node;
- } else {
- n = t->root;
- while (1) {
- int comp_result = compareKeys(t->keytype, key, n->key);
- if (comp_result == 0) {
- n->value = value;
- LEPT_FREE(inserted_node);
- return;
- } else if (comp_result < 0) {
- if (n->left == NULL) {
- n->left = inserted_node;
- break;
- } else {
- n = n->left;
- }
- } else { /* comp_result > 0 */
- if (n->right == NULL) {
- n->right = inserted_node;
- break;
- } else {
- n = n->right;
- }
- }
- }
- inserted_node->parent = n;
- }
- insert_case1(t, inserted_node);
- verify_properties(t);
-}
-
-/*!
- * \brief l_rbtreeDelete()
- *
- * \param[in] t rbtree, including root node
- * \param[in] key delete the node with this key
- * \return void
- */
-void
-l_rbtreeDelete(L_RBTREE *t,
- RB_TYPE key)
-{
-node *n, *child;
-
- PROCNAME("l_rbtreeDelete");
-
- if (!t) {
- L_ERROR("tree is null\n", procName);
- return;
- }
-
- n = lookup_node(t, key);
- if (n == NULL) return; /* Key not found, do nothing */
- if (n->left != NULL && n->right != NULL) {
- /* Copy key/value from predecessor and then delete it instead */
- node *pred = maximum_node(n->left);
- n->key = pred->key;
- n->value = pred->value;
- n = pred;
- }
-
- /* n->left == NULL || n->right == NULL */
- child = n->right == NULL ? n->left : n->right;
- if (node_color(n) == L_BLACK_NODE) {
- n->color = node_color(child);
- delete_case1(t, n);
- }
- replace_node(t, n, child);
- if (n->parent == NULL && child != NULL) /* root should be black */
- child->color = L_BLACK_NODE;
- LEPT_FREE(n);
-
- verify_properties(t);
-}
-
-/*!
- * \brief l_rbtreeDestroy()
- *
- * \param[in] pt pointer to tree; will be wet to null before returning
- * \return void
- *
- *
- * Notes:
- * (1) Destroys the tree and nulls the input tree ptr.
- *
- */
-void
-l_rbtreeDestroy(L_RBTREE **pt)
-{
-node *n;
-
- if (!pt) return;
- if (*pt == NULL) return;
- n = (*pt)->root;
- destroy_helper(n);
- LEPT_FREE(*pt);
- *pt = NULL;
- return;
-}
-
- /* postorder DFS */
-static void
-destroy_helper(node *n)
-{
- if (!n) return;
- destroy_helper(n->left);
- destroy_helper(n->right);
- LEPT_FREE(n);
-}
-
-/*!
- * \brief l_rbtreeGetFirst()
- *
- * \param[in] t rbtree, including root node
- * \return void
- *
- *
- * Notes:
- * (1) This is the first node in an in-order traversal.
- *
- */
-L_RBTREE_NODE *
-l_rbtreeGetFirst(L_RBTREE *t)
-{
-node *n;
-
- PROCNAME("l_rbtreeGetFirst");
-
- if (!t)
- return (L_RBTREE_NODE *)ERROR_PTR("tree is null", procName, NULL);
- if (t->root == NULL) {
- L_INFO("tree is empty\n", procName);
- return NULL;
- }
-
- /* Just go down the left side as far as possible */
- n = t->root;
- while (n && n->left)
- n = n->left;
- return n;
-}
-
-/*!
- * \brief l_rbtreeGetNext()
- *
- * \param[in] n current node
- * \return next node, or NULL if it's the last node
- *
- *
- * Notes:
- * (1) This finds the next node, in an in-order traversal, from
- * the current node.
- * (2) It is useful as an iterator for a map.
- * (3) Call l_rbtreeGetFirst() to get the first node.
- *
- */
-L_RBTREE_NODE *
-l_rbtreeGetNext(L_RBTREE_NODE *n)
-{
- PROCNAME("l_rbtreeGetNext");
-
- if (!n)
- return (L_RBTREE_NODE *)ERROR_PTR("n not defined", procName, NULL);
-
- /* If there is a right child, go to it, and then go left all the
- * way to the end. Otherwise go up to the parent; continue upward
- * as long as you're on the right branch, but stop at the parent
- * when you hit it from the left branch. */
- if (n->right) {
- n = n->right;
- while (n->left)
- n = n->left;
- return n;
- } else {
- while (n->parent && n->parent->right == n)
- n = n->parent;
- return n->parent;
- }
-}
-
-/*!
- * \brief l_rbtreeGetLast()
- *
- * \param[in] t rbtree, including root node
- * \return void
- *
- *
- * Notes:
- * (1) This is the last node in an in-order traversal.
- *
- */
-L_RBTREE_NODE *
-l_rbtreeGetLast(L_RBTREE *t)
-{
-node *n;
-
- PROCNAME("l_rbtreeGetLast");
-
- if (!t)
- return (L_RBTREE_NODE *)ERROR_PTR("tree is null", procName, NULL);
- if (t->root == NULL) {
- L_INFO("tree is empty\n", procName);
- return NULL;
- }
-
- /* Just go down the right side as far as possible */
- n = t->root;
- while (n && n->right)
- n = n->right;
- return n;
-}
-
-/*!
- * \brief l_rbtreeGetPrev()
- *
- * \param[in] n current node
- * \return next node, or NULL if it's the first node
- *
- *
- * Notes:
- * (1) This finds the previous node, in an in-order traversal, from
- * the current node.
- * (2) It is useful as an iterator for a map.
- * (3) Call l_rbtreeGetLast() to get the last node.
- *
- */
-L_RBTREE_NODE *
-l_rbtreeGetPrev(L_RBTREE_NODE *n)
-{
- PROCNAME("l_rbtreeGetPrev");
-
- if (!n)
- return (L_RBTREE_NODE *)ERROR_PTR("n not defined", procName, NULL);
-
- /* If there is a left child, go to it, and then go right all the
- * way to the end. Otherwise go up to the parent; continue upward
- * as long as you're on the left branch, but stop at the parent
- * when you hit it from the right branch. */
- if (n->left) {
- n = n->left;
- while (n->right)
- n = n->right;
- return n;
- } else {
- while (n->parent && n->parent->left == n)
- n = n->parent;
- return n->parent;
- }
-}
-
-/*!
- * \brief l_rbtreeGetCount()
- *
- * \param[in] t rbtree
- * \return count the number of nodes in the tree, or 0 on error
- */
-l_int32
-l_rbtreeGetCount(L_RBTREE *t)
-{
-l_int32 count = 0;
-node *n;
-
- if (!t) return 0;
- n = t->root;
- count_helper(n, &count);
- return count;
-}
-
- /* preorder DFS */
-static void
-count_helper(node *n, l_int32 *pcount)
-{
- if (n)
- (*pcount)++;
- else
- return;
-
- count_helper(n->left, pcount);
- count_helper(n->right, pcount);
-}
-
-
-/*!
- * \brief l_rbtreePrint()
- *
- * \param[in] fp file stream
- * \param[in] t rbtree
- * \return void
- */
-void
-l_rbtreePrint(FILE *fp,
- L_RBTREE *t)
-{
- PROCNAME("l_rbtreePrint");
- if (!fp) {
- L_ERROR("stream not defined\n", procName);
- return;
- }
- if (!t) {
- L_ERROR("tree not defined\n", procName);
- return;
- }
-
- print_tree_helper(fp, t->root, t->keytype, 0);
- fprintf(fp, "\n");
-}
-
-#define INDENT_STEP 4
-
-static void
-print_tree_helper(FILE *fp,
- node *n,
- l_int32 keytype,
- l_int32 indent)
-{
-l_int32 i;
-
- if (n == NULL) {
- fprintf(fp, "");
- return;
- }
- if (n->right != NULL) {
- print_tree_helper(fp, n->right, keytype, indent + INDENT_STEP);
- }
- for (i = 0; i < indent; i++)
- fprintf(fp, " ");
- if (n->color == L_BLACK_NODE) {
- if (keytype == L_INT_TYPE)
- fprintf(fp, "%lld\n", n->key.itype);
- else if (keytype == L_UINT_TYPE)
- fprintf(fp, "%llx\n", n->key.utype);
- else if (keytype == L_FLOAT_TYPE)
- fprintf(fp, "%f\n", n->key.ftype);
- } else {
- if (keytype == L_INT_TYPE)
- fprintf(fp, "<%lld>\n", n->key.itype);
- else if (keytype == L_UINT_TYPE)
- fprintf(fp, "<%llx>\n", n->key.utype);
- else if (keytype == L_FLOAT_TYPE)
- fprintf(fp, "<%f>\n", n->key.ftype);
- }
- if (n->left != NULL) {
- print_tree_helper(fp, n->left, keytype, indent + INDENT_STEP);
- }
-}
-
-
-/* ------------------------------------------------------------- *
- * Static key comparison function *
- * ------------------------------------------------------------- */
-static l_int32
-compareKeys(l_int32 keytype,
- RB_TYPE left,
- RB_TYPE right)
-{
-static char procName[] = "compareKeys";
-
- if (keytype == L_INT_TYPE) {
- if (left.itype < right.itype)
- return -1;
- else if (left.itype > right.itype)
- return 1;
- else { /* equality */
- return 0;
- }
- } else if (keytype == L_UINT_TYPE) {
- if (left.utype < right.utype)
- return -1;
- else if (left.utype > right.utype)
- return 1;
- else { /* equality */
- return 0;
- }
- } else if (keytype == L_FLOAT_TYPE) {
- if (left.ftype < right.ftype)
- return -1;
- else if (left.ftype > right.ftype)
- return 1;
- else { /* equality */
- return 0;
- }
- } else {
- L_ERROR("unknown keytype %d\n", procName, keytype);
- return 0;
- }
-}
-
-
-/* ------------------------------------------------------------- *
- * Static red-black tree helpers *
- * ------------------------------------------------------------- */
-static node *grandparent(node *n) {
- if (!n || !n->parent || !n->parent->parent) {
- L_ERROR("root and child of root have no grandparent\n", "grandparent");
- return NULL;
- }
- return n->parent->parent;
-}
-
-static node *sibling(node *n) {
- if (!n || !n->parent) {
- L_ERROR("root has no sibling\n", "sibling");
- return NULL;
- }
- if (n == n->parent->left)
- return n->parent->right;
- else
- return n->parent->left;
-}
-
-static node *uncle(node *n) {
- if (!n || !n->parent || !n->parent->parent) {
- L_ERROR("root and child of root have no uncle\n", "uncle");
- return NULL;
- }
- return sibling(n->parent);
-}
-
-static l_int32 node_color(node *n) {
- return n == NULL ? L_BLACK_NODE : n->color;
-}
-
-
-static node *new_node(RB_TYPE key, RB_TYPE value, l_int32 node_color,
- node *left, node *right) {
- node *result = (node *)LEPT_CALLOC(1, sizeof(node));
- result->key = key;
- result->value = value;
- result->color = node_color;
- result->left = left;
- result->right = right;
- if (left != NULL) left->parent = result;
- if (right != NULL) right->parent = result;
- result->parent = NULL;
- return result;
-}
-
-static node *lookup_node(L_RBTREE *t, RB_TYPE key) {
- node *n = t->root;
- while (n != NULL) {
- int comp_result = compareKeys(t->keytype, key, n->key);
- if (comp_result == 0) {
- return n;
- } else if (comp_result < 0) {
- n = n->left;
- } else { /* comp_result > 0 */
- n = n->right;
- }
- }
- return n;
-}
-
-static void rotate_left(L_RBTREE *t, node *n) {
- node *r = n->right;
- replace_node(t, n, r);
- n->right = r->left;
- if (r->left != NULL) {
- r->left->parent = n;
- }
- r->left = n;
- n->parent = r;
-}
-
-static void rotate_right(L_RBTREE *t, node *n) {
- node *L = n->left;
- replace_node(t, n, L);
- n->left = L->right;
- if (L->right != NULL) {
- L->right->parent = n;
- }
- L->right = n;
- n->parent = L;
-}
-
-static void replace_node(L_RBTREE *t, node *oldn, node *newn) {
- if (oldn->parent == NULL) {
- t->root = newn;
- } else {
- if (oldn == oldn->parent->left)
- oldn->parent->left = newn;
- else
- oldn->parent->right = newn;
- }
- if (newn != NULL) {
- newn->parent = oldn->parent;
- }
-}
-
-static void insert_case1(L_RBTREE *t, node *n) {
- if (n->parent == NULL)
- n->color = L_BLACK_NODE;
- else
- insert_case2(t, n);
-}
-
-static void insert_case2(L_RBTREE *t, node *n) {
- if (node_color(n->parent) == L_BLACK_NODE)
- return; /* Tree is still valid */
- else
- insert_case3(t, n);
-}
-
-static void insert_case3(L_RBTREE *t, node *n) {
- if (node_color(uncle(n)) == L_RED_NODE) {
- n->parent->color = L_BLACK_NODE;
- uncle(n)->color = L_BLACK_NODE;
- grandparent(n)->color = L_RED_NODE;
- insert_case1(t, grandparent(n));
- } else {
- insert_case4(t, n);
- }
-}
-
-static void insert_case4(L_RBTREE *t, node *n) {
- if (n == n->parent->right && n->parent == grandparent(n)->left) {
- rotate_left(t, n->parent);
- n = n->left;
- } else if (n == n->parent->left && n->parent == grandparent(n)->right) {
- rotate_right(t, n->parent);
- n = n->right;
- }
- insert_case5(t, n);
-}
-
-static void insert_case5(L_RBTREE *t, node *n) {
- n->parent->color = L_BLACK_NODE;
- grandparent(n)->color = L_RED_NODE;
- if (n == n->parent->left && n->parent == grandparent(n)->left) {
- rotate_right(t, grandparent(n));
- } else if (n == n->parent->right && n->parent == grandparent(n)->right) {
- rotate_left(t, grandparent(n));
- } else {
- L_ERROR("identity confusion\n", "insert_case5");
- }
-}
-
-static node *maximum_node(node *n) {
- if (!n) {
- L_ERROR("n not defined\n", "maximum_node");
- return NULL;
- }
- while (n->right != NULL) {
- n = n->right;
- }
- return n;
-}
-
-static void delete_case1(L_RBTREE *t, node *n) {
- if (n->parent == NULL)
- return;
- else
- delete_case2(t, n);
-}
-
-static void delete_case2(L_RBTREE *t, node *n) {
- if (node_color(sibling(n)) == L_RED_NODE) {
- n->parent->color = L_RED_NODE;
- sibling(n)->color = L_BLACK_NODE;
- if (n == n->parent->left)
- rotate_left(t, n->parent);
- else
- rotate_right(t, n->parent);
- }
- delete_case3(t, n);
-}
-
-static void delete_case3(L_RBTREE *t, node *n) {
- if (node_color(n->parent) == L_BLACK_NODE &&
- node_color(sibling(n)) == L_BLACK_NODE &&
- node_color(sibling(n)->left) == L_BLACK_NODE &&
- node_color(sibling(n)->right) == L_BLACK_NODE) {
- sibling(n)->color = L_RED_NODE;
- delete_case1(t, n->parent);
- } else {
- delete_case4(t, n);
- }
-}
-
-static void delete_case4(L_RBTREE *t, node *n) {
- if (node_color(n->parent) == L_RED_NODE &&
- node_color(sibling(n)) == L_BLACK_NODE &&
- node_color(sibling(n)->left) == L_BLACK_NODE &&
- node_color(sibling(n)->right) == L_BLACK_NODE) {
- sibling(n)->color = L_RED_NODE;
- n->parent->color = L_BLACK_NODE;
- } else {
- delete_case5(t, n);
- }
-}
-
-static void delete_case5(L_RBTREE *t, node *n) {
- if (n == n->parent->left &&
- node_color(sibling(n)) == L_BLACK_NODE &&
- node_color(sibling(n)->left) == L_RED_NODE &&
- node_color(sibling(n)->right) == L_BLACK_NODE) {
- sibling(n)->color = L_RED_NODE;
- sibling(n)->left->color = L_BLACK_NODE;
- rotate_right(t, sibling(n));
- } else if (n == n->parent->right &&
- node_color(sibling(n)) == L_BLACK_NODE &&
- node_color(sibling(n)->right) == L_RED_NODE &&
- node_color(sibling(n)->left) == L_BLACK_NODE) {
- sibling(n)->color = L_RED_NODE;
- sibling(n)->right->color = L_BLACK_NODE;
- rotate_left(t, sibling(n));
- }
- delete_case6(t, n);
-}
-
-static void delete_case6(L_RBTREE *t, node *n) {
- sibling(n)->color = node_color(n->parent);
- n->parent->color = L_BLACK_NODE;
- if (n == n->parent->left) {
- if (node_color(sibling(n)->right) != L_RED_NODE) {
- L_ERROR("right sibling is not RED", "delete_case6");
- return;
- }
- sibling(n)->right->color = L_BLACK_NODE;
- rotate_left(t, n->parent);
- } else {
- if (node_color(sibling(n)->left) != L_RED_NODE) {
- L_ERROR("left sibling is not RED", "delete_case6");
- return;
- }
- sibling(n)->left->color = L_BLACK_NODE;
- rotate_right(t, n->parent);
- }
-}
-
-
-/* ------------------------------------------------------------- *
- * Debugging: verify if tree is valid *
- * ------------------------------------------------------------- */
-#if VERIFY_RBTREE
-static void verify_property_1(node *root);
-static void verify_property_2(node *root);
-static void verify_property_4(node *root);
-static void verify_property_5(node *root);
-static void verify_property_5_helper(node *n, int black_count,
- int* black_count_path);
-#endif
-
-static void verify_properties(L_RBTREE *t) {
-#if VERIFY_RBTREE
- verify_property_1(t->root);
- verify_property_2(t->root);
- /* Property 3 is implicit */
- verify_property_4(t->root);
- verify_property_5(t->root);
-#endif
-}
-
-#if VERIFY_RBTREE
-static void verify_property_1(node *n) {
- if (node_color(n) != L_RED_NODE && node_color(n) != L_BLACK_NODE) {
- L_ERROR("color neither RED nor BLACK\n", "verify_property_1");
- return;
- }
- if (n == NULL) return;
- verify_property_1(n->left);
- verify_property_1(n->right);
-}
-
-static void verify_property_2(node *root) {
- if (node_color(root) != L_BLACK_NODE)
- L_ERROR("root is not black!\n", "verify_property_2");
-}
-
-static void verify_property_4(node *n) {
- if (node_color(n) == L_RED_NODE) {
- if (node_color(n->left) != L_BLACK_NODE ||
- node_color(n->right) != L_BLACK_NODE ||
- node_color(n->parent) != L_BLACK_NODE) {
- L_ERROR("children & parent not all BLACK", "verify_property_4");
- return;
- }
- }
- if (n == NULL) return;
- verify_property_4(n->left);
- verify_property_4(n->right);
-}
-
-static void verify_property_5(node *root) {
- int black_count_path = -1;
- verify_property_5_helper(root, 0, &black_count_path);
-}
-
-static void verify_property_5_helper(node *n, int black_count,
- int* path_black_count) {
- if (node_color(n) == L_BLACK_NODE) {
- black_count++;
- }
- if (n == NULL) {
- if (*path_black_count == -1) {
- *path_black_count = black_count;
- } else if (*path_black_count != black_count) {
- L_ERROR("incorrect black count", "verify_property_5_helper");
- }
- return;
- }
- verify_property_5_helper(n->left, black_count, path_black_count);
- verify_property_5_helper(n->right, black_count, path_black_count);
-}
-#endif
diff --git a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/rbtree.h b/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/rbtree.h
deleted file mode 100644
index 6977d336..00000000
--- a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/rbtree.h
+++ /dev/null
@@ -1,91 +0,0 @@
-/*====================================================================*
- - Copyright (C) 2001 Leptonica. All rights reserved.
- -
- - Redistribution and use in source and binary forms, with or without
- - modification, are permitted provided that the following conditions
- - are met:
- - 1. Redistributions of source code must retain the above copyright
- - notice, this list of conditions and the following disclaimer.
- - 2. Redistributions in binary form must reproduce the above
- - copyright notice, this list of conditions and the following
- - disclaimer in the documentation and/or other materials
- - provided with the distribution.
- -
- - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- - ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- - LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- - A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL ANY
- - CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
- - EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
- - PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
- - PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
- - OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
- - NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- *====================================================================*/
-
-/*
- * Modified from the excellent code here:
- * http://en.literateprograms.org/Red-black_tree_(C)?oldid=19567
- * which has been placed in the public domain under the Creative Commons
- * CC0 1.0 waiver (http://creativecommons.org/publicdomain/zero/1.0/).
- *
- * When the key is generated from a hash (e.g., string --> uint64),
- * there is always the possibility of having collisions, but to make
- * the collision probability very low requires using a large hash.
- * For that reason, the key types are 64 bit quantities, which will result
- * in a negligible probabililty of collisions for millions of hashed values.
- * Using 8 byte keys instead of 4 byte keys requires a little more
- * storage, but the simplification in being able to ignore collisions
- * with the red-black trees for most applications is worth it.
- */
-
-#ifndef LEPTONICA_RBTREE_H
-#define LEPTONICA_RBTREE_H
-
- /*! The three valid key types for red-black trees, maps and sets. */
-/*! RBTree Key Type */
-enum {
- L_INT_TYPE = 1,
- L_UINT_TYPE = 2,
- L_FLOAT_TYPE = 3
-};
-
- /*!
- * Storage for keys and values for red-black trees, maps and sets.
- *
- * Note:
- * (1) Keys and values of the valid key types are all 64-bit
- * (2) (void *) can be used for values but not for keys.
- *
- */
-union Rb_Type {
- l_int64 itype;
- l_uint64 utype;
- l_float64 ftype;
- void *ptype;
-};
-typedef union Rb_Type RB_TYPE;
-
-struct L_Rbtree {
- struct L_Rbtree_Node *root;
- l_int32 keytype;
-};
-typedef struct L_Rbtree L_RBTREE;
-typedef struct L_Rbtree L_AMAP; /* hide underlying implementation for map */
-typedef struct L_Rbtree L_ASET; /* hide underlying implementation for set */
-
-struct L_Rbtree_Node {
- union Rb_Type key;
- union Rb_Type value;
- struct L_Rbtree_Node *left;
- struct L_Rbtree_Node *right;
- struct L_Rbtree_Node *parent;
- l_int32 color;
-};
-typedef struct L_Rbtree_Node L_RBTREE_NODE;
-typedef struct L_Rbtree_Node L_AMAP_NODE; /* hide tree implementation */
-typedef struct L_Rbtree_Node L_ASET_NODE; /* hide tree implementation */
-
-
-#endif /* LEPTONICA_RBTREE_H */
diff --git a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/readbarcode.c b/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/readbarcode.c
deleted file mode 100644
index 83b0cdef..00000000
--- a/3rdparty/gpdf/3rdparty/tesseract/include/leptonica/readbarcode.c
+++ /dev/null
@@ -1,1498 +0,0 @@
-/*====================================================================*
- - Copyright (C) 2001 Leptonica. All rights reserved.
- -
- - Redistribution and use in source and binary forms, with or without
- - modification, are permitted provided that the following conditions
- - are met:
- - 1. Redistributions of source code must retain the above copyright
- - notice, this list of conditions and the following disclaimer.
- - 2. Redistributions in binary form must reproduce the above
- - copyright notice, this list of conditions and the following
- - disclaimer in the documentation and/or other materials
- - provided with the distribution.
- -
- - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- - ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- - LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- - A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL ANY
- - CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
- - EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
- - PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
- - PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
- - OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
- - NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- *====================================================================*/
-
-
-/*!
- * \file readbarcode.c
- *
- *
- * Basic operations to locate and identify the line widths
- * in 1D barcodes.
- *
- * Top level
- * SARRAY *pixProcessBarcodes()
- *
- * Next levels
- * PIXA *pixExtractBarcodes()
- * SARRAY *pixReadBarcodes()
- * l_int32 pixReadBarcodeWidths()
- *
- * Location
- * BOXA *pixLocateBarcodes()
- * static PIX *pixGenerateBarcodeMask()
- *
- * Extraction and deskew
- * PIXA *pixDeskewBarcodes()
- *
- * Process to get line widths
- * NUMA *pixExtractBarcodeWidths1()
- * NUMA *pixExtractBarcodeWidths2()
- * NUMA *pixExtractBarcodeCrossings()
- *
- * Average adjacent rasters
- * static NUMA *pixAverageRasterScans()
- *
- * Signal processing for barcode widths
- * NUMA *numaQuantizeCrossingsByWidth()
- * static l_int32 numaGetCrossingDistances()
- * static NUMA *numaLocatePeakRanges()
- * static NUMA *numaGetPeakCentroids()
- * static NUMA *numaGetPeakWidthLUT()
- * NUMA *numaQuantizeCrossingsByWindow()
- * static l_int32 numaEvalBestWidthAndShift()
- * static l_int32 numaEvalSyncError()
- *
- *
- * NOTE CAREFULLY: This is "early beta" code. It has not been tuned
- * to work robustly on a large database of barcode images. I'm putting
- * it out so that people can play with it, find out how it breaks, and
- * contribute decoders for other barcode formats. Both the functional
- * interfaces and ABI will almost certainly change in the coming
- * few months. The actual decoder, in bardecode.c, at present only
- * works on the following codes: Code I2of5, Code 2of5, Code 39, Code 93
- * Codabar and UPCA. To add another barcode format, it is necessary
- * to make changes in readbarcode.h and bardecode.c.
- * The program prog/barcodetest shows how to run from the top level
- * (image --> decoded data).
- *
- */
-
-#ifdef HAVE_CONFIG_H
-#include
-#endif /* HAVE_CONFIG_H */
-
-#include
-#include "allheaders.h"
-#include "readbarcode.h"
-
- /* Parameters for pixGenerateBarcodeMask() */
-static const l_int32 MAX_SPACE_WIDTH = 19; /* was 15 */
-static const l_int32 MAX_NOISE_WIDTH = 50; /* smaller than barcode width */
-static const l_int32 MAX_NOISE_HEIGHT = 30; /* smaller than barcode height */
-
- /* Static functions */
-static PIX *pixGenerateBarcodeMask(PIX *pixs, l_int32 maxspace,
- l_int32 nwidth, l_int32 nheight);
-static NUMA *pixAverageRasterScans(PIX *pixs, l_int32 nscans);
-static l_int32 numaGetCrossingDistances(NUMA *nas, NUMA **pnaedist,
- NUMA **pnaodist, l_float32 *pmindist,
- l_float32 *pmaxdist);
-static NUMA *numaLocatePeakRanges(NUMA *nas, l_float32 minfirst,
- l_float32 minsep, l_float32 maxmin);
-static NUMA *numaGetPeakCentroids(NUMA *nahist, NUMA *narange);
-static NUMA *numaGetPeakWidthLUT(NUMA *narange, NUMA *nacent);
-static l_int32 numaEvalBestWidthAndShift(NUMA *nas, l_int32 nwidth,
- l_int32 nshift, l_float32 minwidth,
- l_float32 maxwidth,
- l_float32 *pbestwidth,
- l_float32 *pbestshift,
- l_float32 *pbestscore);
-static l_int32 numaEvalSyncError(NUMA *nas, l_int32 ifirst, l_int32 ilast,
- l_float32 width, l_float32 shift,
- l_float32 *pscore, NUMA **pnad);
-
-
-#ifndef NO_CONSOLE_IO
-#define DEBUG_DESKEW 1
-#define DEBUG_WIDTHS 0
-#endif /* ~NO_CONSOLE_IO */
-
-
-/*------------------------------------------------------------------------*
- * Top level *
- *------------------------------------------------------------------------*/
-/*!
- * \brief pixProcessBarcodes()
- *
- * \param[in] pixs any depth
- * \param[in] format L_BF_ANY, L_BF_CODEI2OF5, L_BF_CODE93, ...
- * \param[in] method L_USE_WIDTHS, L_USE_WINDOWS
- * \param[out] psaw [optional] sarray of bar widths
- * \param[in] debugflag use 1 to generate debug output
- * \return sarray text of barcodes, or NULL if none found or on error
- */
-SARRAY *
-pixProcessBarcodes(PIX *pixs,
- l_int32 format,
- l_int32 method,
- SARRAY **psaw,
- l_int32 debugflag)
-{
-PIX *pixg;
-PIXA *pixa;
-SARRAY *sad;
-
- PROCNAME("pixProcessBarcodes");
-
- if (psaw) *psaw = NULL;
- if (!pixs)
- return (SARRAY *)ERROR_PTR("pixs not defined", procName, NULL);
- if (format != L_BF_ANY && !barcodeFormatIsSupported(format))
- return (SARRAY *)ERROR_PTR("unsupported format", procName, NULL);
- if (method != L_USE_WIDTHS && method != L_USE_WINDOWS)
- return (SARRAY *)ERROR_PTR("invalid method", procName, NULL);
-
- /* Get an 8 bpp image, no cmap */
- if (pixGetDepth(pixs) == 8 && !pixGetColormap(pixs))
- pixg = pixClone(pixs);
- else
- pixg = pixConvertTo8(pixs, 0);
-
- if ((pixa = pixExtractBarcodes(pixg, debugflag)) == NULL) {
- pixDestroy(&pixg);
- return (SARRAY *)ERROR_PTR("no barcode(s) found", procName, NULL);
- }
-
- sad = pixReadBarcodes(pixa, format, method, psaw, debugflag);
-
- pixDestroy(&pixg);
- pixaDestroy(&pixa);
- return sad;
-}
-
-
-/*!
- * \brief pixExtractBarcodes()
- *
- * \param[in] pixs 8 bpp, no colormap
- * \param[in] debugflag use 1 to generate debug output
- * \return pixa deskewed and cropped barcodes, or NULL if none found
- * or on error
- */
-PIXA *
-pixExtractBarcodes(PIX *pixs,
- l_int32 debugflag)
-{
-l_int32 i, n;
-l_float32 angle, conf;
-BOX *box;
-BOXA *boxa;
-PIX *pixb, *pixm, *pixt;
-PIXA *pixa;
-
- PROCNAME("pixExtractBarcodes");
-
- if (!pixs || pixGetDepth(pixs) != 8 || pixGetColormap(pixs))
- return (PIXA *)ERROR_PTR("pixs undefined or not 8 bpp", procName, NULL);
-
- /* Locate them; use small threshold for edges. */
- boxa = pixLocateBarcodes(pixs, 20, &pixb, &pixm);
- n = boxaGetCount(boxa);
- L_INFO("%d possible barcode(s) found\n", procName, n);
- if (n == 0) {
- boxaDestroy(&boxa);
- pixDestroy(&pixb);
- pixDestroy(&pixm);
- return NULL;
- }
-
- if (debugflag) {
- boxaWriteStderr(boxa);
- pixDisplay(pixb, 100, 100);
- pixDisplay(pixm, 800, 100);
- }
-
- /* Deskew each barcode individually */
- pixa = pixaCreate(n);
- for (i = 0; i < n; i++) {
- box = boxaGetBox(boxa, i, L_CLONE);
- pixt = pixDeskewBarcode(pixs, pixb, box, 15, 20, &angle, &conf);
- L_INFO("angle = %6.2f, conf = %6.2f\n", procName, angle, conf);
- if (conf > 5.0) {
- pixaAddPix(pixa, pixt, L_INSERT);
- pixaAddBox(pixa, box, L_INSERT);
- } else {
- pixDestroy(&pixt);
- boxDestroy(&box);
- }
- }
-
-#if DEBUG_DESKEW
- pixt = pixaDisplayTiledInRows(pixa, 8, 1000, 1.0, 0, 30, 2);
- pixWrite("junkpixt", pixt, IFF_PNG);
- pixDestroy(&pixt);
-#endif /* DEBUG_DESKEW */
-
- pixDestroy(&pixb);
- pixDestroy(&pixm);
- boxaDestroy(&boxa);
- return pixa;
-}
-
-
-/*!
- * \brief pixReadBarcodes()
- *
- * \param[in] pixa of 8 bpp deskewed and cropped barcodes
- * \param[in] format L_BF_ANY, L_BF_CODEI2OF5, L_BF_CODE93, ...
- * \param[in] method L_USE_WIDTHS, L_USE_WINDOWS;
- * \param[out] psaw [optional] sarray of bar widths
- * \param[in] debugflag use 1 to generate debug output
- * \return sa sarray of widths, one string for each barcode found,
- * or NULL on error
- */
-SARRAY *
-pixReadBarcodes(PIXA *pixa,
- l_int32 format,
- l_int32 method,
- SARRAY **psaw,
- l_int32 debugflag)
-{
-char *barstr, *data;
-char emptystring[] = "";
-l_int32 i, j, n, nbars, ival;
-NUMA *na;
-PIX *pixt;
-SARRAY *saw, *sad;
-
- PROCNAME("pixReadBarcodes");
-
- if (psaw) *psaw = NULL;
- if (!pixa)
- return (SARRAY *)ERROR_PTR("pixa not defined", procName, NULL);
- if (format != L_BF_ANY && !barcodeFormatIsSupported(format))
- return (SARRAY *)ERROR_PTR("unsupported format", procName, NULL);
- if (method != L_USE_WIDTHS && method != L_USE_WINDOWS)
- return (SARRAY *)ERROR_PTR("invalid method", procName, NULL);
-
- n = pixaGetCount(pixa);
- saw = sarrayCreate(n);
- sad = sarrayCreate(n);
- for (i = 0; i < n; i++) {
- /* Extract the widths of the lines in each barcode */
- pixt = pixaGetPix(pixa, i, L_CLONE);
- na = pixReadBarcodeWidths(pixt, method, debugflag);
- pixDestroy(&pixt);
- if (!na) {
- ERROR_INT("valid barcode widths not returned", procName, 1);
- continue;
- }
-
- /* Save the widths as a string */
- nbars = numaGetCount(na);
- barstr = (char *)LEPT_CALLOC(nbars + 1, sizeof(char));
- for (j = 0; j < nbars; j++) {
- numaGetIValue(na, j, &ival);
- barstr[j] = 0x30 + ival;
- }
- sarrayAddString(saw, barstr, L_INSERT);
- numaDestroy(&na);
-
- /* Decode the width strings */
- data = barcodeDispatchDecoder(barstr, format, debugflag);
- if (!data) {
- ERROR_INT("barcode not decoded", procName, 1);
- sarrayAddString(sad, emptystring, L_COPY);
- continue;
- }
- sarrayAddString(sad, data, L_INSERT);
- }
-
- /* If nothing found, clean up */
- if (sarrayGetCount(saw) == 0) {
- sarrayDestroy(&saw);
- sarrayDestroy(&sad);
- return (SARRAY *)ERROR_PTR("no valid barcode data", procName, NULL);
- }
-
- if (psaw)
- *psaw = saw;
- else
- sarrayDestroy(&saw);
-
- return sad;
-}
-
-
-/*!
- * \brief pixReadBarcodeWidths()
- *
- * \param[in] pixs of 8 bpp deskewed and cropped barcode
- * \param[in] method L_USE_WIDTHS, L_USE_WINDOWS;
- * \param[in] debugflag use 1 to generate debug output
- * \return na numa of widths (each in set {1,2,3,4}, or NULL on error
- */
-NUMA *
-pixReadBarcodeWidths(PIX *pixs,
- l_int32 method,
- l_int32 debugflag)
-{
-l_float32 winwidth;
-NUMA *na;
-
- PROCNAME("pixReadBarcodeWidths");
-
- if (!pixs)
- return (NUMA *)ERROR_PTR("pixs not defined", procName, NULL);
- if (pixGetDepth(pixs) != 8)
- return (NUMA *)ERROR_PTR("pixs not 8 bpp", procName, NULL);
- if (method != L_USE_WIDTHS && method != L_USE_WINDOWS)
- return (NUMA *)ERROR_PTR("invalid method", procName, NULL);
-
- /* Extract the widths of the lines in each barcode */
- if (method == L_USE_WIDTHS)
- na = pixExtractBarcodeWidths1(pixs, 120, 0.25, NULL, NULL,
- debugflag);
- else /* method == L_USE_WINDOWS */
- na = pixExtractBarcodeWidths2(pixs, 120, &winwidth,
- NULL, debugflag);
-#if DEBUG_WIDTHS
- if (method == L_USE_WINDOWS)
- lept_stderr("Window width for barcode: %7.3f\n", winwidth);
- numaWriteStderr(na);
-#endif /* DEBUG_WIDTHS */
-
- if (!na)
- return (NUMA *)ERROR_PTR("barcode widths invalid", procName, NULL);
-
- return na;
-}
-
-
-/*------------------------------------------------------------------------*
- * Locate barcode in image *
- *------------------------------------------------------------------------*/
-/*!
- * \brief pixLocateBarcodes()
- *
- * \param[in] pixs any depth
- * \param[in] thresh for binarization of edge filter output; typ. 20
- * \param[out] ppixb [optional] binarized edge filtered input image
- * \param[out] ppixm [optional] mask over barcodes
- * \return boxa location of barcodes, or NULL if none found or on error
- */
-BOXA *
-pixLocateBarcodes(PIX *pixs,
- l_int32 thresh,
- PIX **ppixb,
- PIX **ppixm)
-{
-BOXA *boxa;
-PIX *pix8, *pixe, *pixb, *pixm;
-
- PROCNAME("pixLocateBarcodes");
-
- if (!pixs)
- return (BOXA *)ERROR_PTR("pixs not defined", procName, NULL);
-
- /* Get an 8 bpp image, no cmap */
- if (pixGetDepth(pixs) == 8 && !pixGetColormap(pixs))
- pix8 = pixClone(pixs);
- else
- pix8 = pixConvertTo8(pixs, 0);
-
- /* Get a 1 bpp image of the edges */
- pixe = pixSobelEdgeFilter(pix8, L_ALL_EDGES);
- pixb = pixThresholdToBinary(pixe, thresh);
- pixInvert(pixb, pixb);
- pixDestroy(&pix8);
- pixDestroy(&pixe);
-
- pixm = pixGenerateBarcodeMask(pixb, MAX_SPACE_WIDTH, MAX_NOISE_WIDTH,
- MAX_NOISE_HEIGHT);
- boxa = pixConnComp(pixm, NULL, 8);
-
- if (ppixb)
- *ppixb = pixb;
- else
- pixDestroy(&pixb);
- if (ppixm)
- *ppixm = pixm;
- else
- pixDestroy(&pixm);
-
- return boxa;
-}
-
-
-/*!
- * \brief pixGenerateBarcodeMask()
- *
- * \param[in] pixs 1 bpp
- * \param[in] maxspace largest space in the barcode, in pixels
- * \param[in] nwidth opening 'width' to remove noise
- * \param[in] nheight opening 'height' to remove noise
- * \return pixm mask over barcodes, or NULL if none found or on error
- *
- *