calculate best fit from i+.5 to j+.5. Assume i<j (cyclically). * Return 0 and set badness and parameters (alpha, beta), if * possible. Return 1 i

optimize the path p, replacing sequences of Bezier segments by a * single segment when possible. Return 0 on success, 1 with errno set * on failur

free a pathlist, leaving errno untouched. */

determine the center and slope of the line i..j. Assume i<j. Needs * "sum" components of p to be set. */

out must be buffer big enough to contain full image, and in must contain the full decompressed data from the IDAT chunks (with filter index bytes and

Return a fresh copy of the set of default parameters, or NULL on * failure with errno set. */

On success, returns a Potrace state st with st->status == * POTRACE_STATUS_OK. On failure, returns NULL if no Potrace state * could be created (wi

copy private to public curve structure */

return 0 on success, 1 on error with errno set. */

background color chunk (bKGD)*/

international text chunk (iTXt)*/

text chunk (tEXt)*/

compressed text chunk (zTXt)*/

* Function RefPos * Return the reference position, coming from either the mouse position * or the cursor position. * * @param useM

close path */

put a pixel, given its RGBA16 color, into image of any color 16-bitdepth type*/

put a pixel, given its RGBA color, into image of any color type*/

write given buffer to the file, overwriting the file, it doesn't append to it.*/

* Function scanList * reads a sexpr list from the input stream into a new node with key * aLexer->CurText(). */

this only works if you add friend class EVENT_LOOP to EventLoopBase */

Initialize aDst SEARCH_STACK with KIFACE (DSO) specific settings. A non-member function so it an be moved easily, plus it's nobody's business.

Find the bounding box of a given path. Path is assumed to be of * non-zero length. */

funcion that show the help information*/

Always succeeds and returns 0 */

returns 1 if success, 0 if failure ==> nothing done*/

* Function viewAssign() * Assigns the item to a given dynamic VIEW. Called internally by the VIEW. * * @param aView[]: dynamic VIEW ins

efficiently invert bits [x,infty) and [xa,infty) in line y. Here xa * must be a multiple of BM_WORDBITS. */

Virtual event handlers, overide them in your derived class

Add a branch to a node. Split the node if necessary. Returns 0 if node not split. Old node updated. Returns 1 if node split, sets *new_node to addre

* Add the string "aName" to the history list aHistoryList */

add hotkey config options submenu to aMenu */

* Function AddLineToHeader * Add a line to the list of free lines to print at the beginning of the file * @param aExtraString is the string