─────────────────────────────────────────────────────────────────────────── Colour helpers ───────────────────────────────────────────────────────────

unary_function_ptr::unary_function_ptr(const unary_function_eval * myptr,int parser_token): _ptr(myptr){ if (parser_token) if (!lexer_functi

this version of reduce returns in rem the reduction of m*p other version of reduce do not care about m

low level subtraction (assumes |a| > |b|), HAC pp.595 Algorithm 14.9 */

int clip_ymin=0;

transposition

return true if g has some selection inside, gsel points to the selection

"unary" version

specialization

return true if *this is "strictly less complex" than other

subvecteur is different from submodpoly if a and b have != sizes because it always start substr. at the beginning of a and b

Binary addition (2 terms, cons'd preserving insertion order)

Update toolbar highlight to reflect _currentTool. */

"unary" version

Compatibility adapter for app-side access.

¿Es un entero (fracción con den=1, sin radical, sin constantes)?

** Ensures final expression result is in next available register. */

use 0 for Z, n!=0 for Z/nZ

** Reverse the stack segment from 'from' to 'to' ** (auxiliary to 'lua_rotate') ** Note that we move(copy) only the value inside the stack. ** (We do

rootof has 2 args: P(theta) and Pmin(theta)