Convert aRelativePath to an absolute path based on aBaseDir

find the optimal polygon. Fill in the m and po components. Return 1 * on failure with errno set, else 0. Non-cyclic version: assumes i=0 * is in t

set the excess padding to 0 */

duplicate the given bitmap. Return NULL on error with errno set. */

free a potrace bitmap */

read BMP stream after magic number. Return values as for bm_read. * We choose to be as permissive as possible, since there are many * programs out

read PNM stream after magic number. Return values as for bm_read */

Boundary Package Merge step, numpresent is the amount of leaves, and c is the current chain.*/

sort the leaves with stable mergesort*/

returns 0 on success, 1 on error with errno set */

Preparation: fill in the sum* fields of a path (used for later * rapid summing). Return 0 on success, 1 with errno set on * failure. */

clear the bm, assuming the bounding box is set correctly (faster * than clearing the whole bitmap) */

* Checks if a given string contains non-ASCII characters. * FIXME: the performance of this code is really poor, but in this case it can be * accepta

ddenom/dpara have the property that the square of radius 1 centered * at p1 intersects the line p0p2 iff |dpara(p0,p1,p2)| <= ddenom(p0,p2) */

read a PNG, the result will be in the same color type as the PNG (hence "generic")*/

Deflate for a block of type "dynamic", that is, with freely, optimally, created huffman trees*/

deterministically and efficiently hash (x,y) into a pseudo-random bit */

return a direction that is 90 degrees counterclockwise from p2-p0, * but then restricted to one of the major wind directions (n, nw, w, etc) */

Export selected layers of SVG to the file `dest`. :arg str dest: path to export SVG file. :arg list hide: layers to hi

find the next set pixel in a row <= y. Pixels are searched first * left-to-right, then top-down. In other words, (x,y)<(x',y') if y>y' * or y=y' a

compute a path in the given pixmap, separating black from white. * Start path at the point (x0,x1), which must be an upper left corner * of the pa

log2 approximation. A slight bit faster than std::log. */

* Function getCrossHairPosition * return the current cross hair position in logical (drawing) coordinates. * @param aInvertY Inverts the Y a

Returns the hot key assigned in the object definition. It may refer to a legacy hot key setting (if LEGACY_HK flag is set).

palette must have 4 * palettesize bytes allocated, and given in format RGBARGBARGBARGBA... returns 0 if the palette is opaque, returns 1 if the palett

get the tree of a deflated block with dynamic tree, the tree itself is also Huffman compressed with a known tree*/

get the tree of a deflated block with fixed tree, as specified in the deflate specification*/

Returns how many bits needed to represent given value (max 8 bit)*/

free the given greymap */

read BMP stream after magic number. Return values as for gm_read. * We choose to be as permissive as possible, since there are many * programs out

read PNM stream after magic number. Return values as for gm_read */

inflate a block with dynamic of fixed Huffman tree*/

calculate (p1-p0)*(p3-p2) */

* Function isNumber * returns true if the next sequence of text is a number: * either an integer, fixed point, or float with exponent. Stops scanni

* Function isRenderable() * Returns if the item should be drawn or not. */

Automatically chooses color type that gives smallest amount of bits in the output image, e.g. grey if there are only greyscale pixels, palette if ther

This returns the description of a numerical error code in English. This is also the documentation of all the error codes. */

profile must already have been inited with mode. It's ok to set some parameters of profile to done already.*/

read the information from the header and store it in the LodePNGInfo. return value is error*/