32 extern const char *
currid;
45 int IsCmd(
const char *
n,
int & tok);
52 void list_cmd(
int typ,
const char* what,
const char * prefix,
284 const short *type_list,
BOOLEAN semicProc3(leftv, leftv, leftv, leftv)
BOOLEAN iiEStart(char *example, procinfo *pi)
void list_cmd(int typ, const char *what, const char *prefix, BOOLEAN iterate, BOOLEAN fullname=FALSE)
BOOLEAN iiTryLoadLib(leftv v, const char *id)
BOOLEAN iiBranchTo(leftv r, leftv args)
CanonicalForm map(const CanonicalForm &primElem, const Variable &alpha, const CanonicalForm &F, const Variable &beta)
map from to such that is mapped onto
BOOLEAN jjBETTI(leftv res, leftv v)
char * iiConvName(const char *libname)
BOOLEAN iiCheckTypes(leftv args, const short *type_list, int report=0)
check a list of arguemys against a given field of types return TRUE if the types match return FALSE (...
idhdl rDefault(const char *s)
const CanonicalForm int s
char * iiProcArgs(char *e, BOOLEAN withParenth)
BOOLEAN iiLocateLib(const char *lib, char *where)
unsigned char * proc[NUM_PROC]
Class used for (list of) interpreter objects.
void singular_example(char *str)
BOOLEAN jjLIST_PL(leftv res, leftv v)
BOOLEAN(* proc3)(leftv, leftv, leftv, leftv)
BOOLEAN jjBETTI2_ID(leftv res, leftv u, leftv v)
BOOLEAN jjVARIABLES_P(leftv res, leftv u)
lists rDecompose(const ring r)
const struct sConvertTypes dConvertTypes[]
BOOLEAN iiAssign(leftv left, leftv right, BOOLEAN toplevel=TRUE)
BOOLEAN iiWRITE(leftv res, leftv exprlist)
idhdl rSimpleFindHdl(ring r, idhdl root, idhdl n=NULL)
BOOLEAN iiAssignCR(leftv, leftv)
BOOLEAN iiLoadLIB(FILE *fp, const char *libnamebuf, const char *newlib, idhdl pl, BOOLEAN autoexport, BOOLEAN tellerror)
BOOLEAN nuVanderSys(leftv res, leftv arg1, leftv arg2, leftv arg3)
COMPUTE: polynomial p with values given by v at points p1,..,pN derived from p; more precisely: consi...
BOOLEAN iiExprArith1Tab(leftv res, leftv a, int op, const struct sValCmd1 *dA1, int at, const struct sConvertTypes *dConvertTypes)
apply an operation 'op' to an argument a return TRUE on failure
const CanonicalForm CFMap CFMap int &both_non_zero int n
BOOLEAN iiExprArith3Tab(leftv res, leftv a, int op, const struct sValCmd3 *dA3, int at, const struct sConvertTypes *dConvertTypes)
apply an operation 'op' to arguments a, a->next and a->next->next return TRUE on failure ...
char * iiGetLibProcBuffer(procinfov pi, int part=1)
int iiRegularity(lists L)
const char * lastreserved
struct sValCmd1 dArith1[]
syStrategy syConvList(lists li)
BOOLEAN syBetti1(leftv res, leftv u)
BOOLEAN nuUResSolve(leftv res, leftv args)
solve a multipolynomial system using the u-resultant Input ideal must be 0-dimensional and (currRing-...
BOOLEAN jjIMPORTFROM(leftv res, leftv u, leftv v)
void paPrint(const char *n, package p)
BOOLEAN iiExprArith3(leftv res, int op, leftv a, leftv b, leftv c)
lists syConvRes(syStrategy syzstr, BOOLEAN toDel=FALSE, int add_row_shift=0)
int iiAddCproc(const char *libname, const char *procname, BOOLEAN pstatic, BOOLEAN(*func)(leftv res, leftv v))
int iiOpsTwoChar(const char *s)
BOOLEAN jjBETTI2(leftv res, leftv u, leftv v)
BOOLEAN nuMPResMat(leftv res, leftv arg1, leftv arg2)
returns module representing the multipolynomial resultant matrix Arguments 2: ideal i...
BOOLEAN mpJacobi(leftv res, leftv a)
BOOLEAN jjLOAD(const char *s, BOOLEAN autoexport=FALSE)
load lib/module given in v
poly iiHighCorner(ideal i, int ak)
BOOLEAN jjLOAD_TRY(const char *s)
BOOLEAN spaddProc(leftv, leftv, leftv)
BOOLEAN kWeight(leftv res, leftv id)
BOOLEAN semicProc(leftv, leftv, leftv)
int IsCmd(const char *n, int &tok)
BOOLEAN setOption(leftv res, leftv v)
BOOLEAN iiLibCmd(char *newlib, BOOLEAN autoexport, BOOLEAN tellerror, BOOLEAN force)
The main handler for Singular numbers which are suitable for Singular polynomials.
idhdl rFindHdl(ring r, idhdl n)
BOOLEAN jjVARIABLES_ID(leftv res, leftv u)
int status int void * buf
struct sValCmd3 dArith3[]
BOOLEAN iiApply(leftv res, leftv a, int op, leftv proc)
lists scIndIndset(ideal S, BOOLEAN all, ideal Q)
void iiMakeResolv(resolvente r, int length, int rlen, char *name, int typ0, intvec **weights=NULL)
BOOLEAN rDecompose_CF(leftv res, const coeffs C)
leftv iiMap(map theMap, const char *what)
BOOLEAN nuLagSolve(leftv res, leftv arg1, leftv arg2, leftv arg3)
find the (complex) roots an univariate polynomial Determines the roots of an univariate polynomial us...
char name(const Variable &v)
BOOLEAN iiExprArith2Tab(leftv res, leftv a, int op, const struct sValCmd2 *dA2, int at, const struct sConvertTypes *dConvertTypes)
apply an operation 'op' to arguments a and a->next return TRUE on failure
BOOLEAN iiARROW(leftv, char *, char *)
BOOLEAN syBetti2(leftv res, leftv u, leftv w)
struct sValCmd2 dArith2[]
BOOLEAN loSimplex(leftv res, leftv args)
Implementation of the Simplex Algorithm.
struct sValCmdM dArithM[]
leftv singular_system(sleftv h)
char * iiGetLibName(procinfov v)
const Variable & v
< [in] a sqrfree bivariate poly
BOOLEAN iiExport(leftv v, int toLev)
BOOLEAN yyInRingConstruction
int exprlist_length(leftv v)
void iiCheckPack(package &p)
BOOLEAN iiExprArith1(leftv res, sleftv *a, int op)
BOOLEAN iiInternalExport(leftv v, int toLev, package pack)
char * iiProcName(char *buf, char &ct, char *&e)
BOOLEAN iiParameter(leftv p)
const char * iiTwoOps(int t)
syStrategy syForceMin(lists li)
BOOLEAN mpKoszul(leftv res, leftv c, leftv b, leftv id)
BOOLEAN iiExprArithM(leftv res, sleftv *a, int op)
BOOLEAN iiExprArith2(leftv res, sleftv *a, int op, sleftv *b, BOOLEAN proccall=FALSE)
BOOLEAN kQHWeight(leftv res, leftv v)
lists rDecompose_list_cf(const ring r)
BOOLEAN spectrumfProc(leftv, leftv)
BOOLEAN spectrumProc(leftv, leftv)
BOOLEAN iiPStart(idhdl pn, sleftv *sl)
BOOLEAN jjMINRES(leftv res, leftv v)
BOOLEAN jjCHARSERIES(leftv res, leftv u)
BOOLEAN jjSYSTEM(leftv res, leftv v)
const char * Tok2Cmdname(int i)
ring rInit(leftv pn, leftv rv, leftv ord)
BOOLEAN spmulProc(leftv, leftv, leftv)
BOOLEAN(* proci)(leftv, leftv, Subexpr)
BOOLEAN iiAllStart(procinfov pi, char *p, feBufferTypes t, int l)
BOOLEAN iiMake_proc(idhdl pn, package pack, sleftv *sl)
BOOLEAN(* proc2)(leftv, leftv, leftv)
BOOLEAN loNewtonP(leftv res, leftv arg1)
compute Newton Polytopes of input polynomials
BOOLEAN iiTestAssume(leftv a, leftv b)
BOOLEAN iiCheckRing(int i)
BOOLEAN jjRESULTANT(leftv res, leftv u, leftv v, leftv w)
BOOLEAN(* proc1)(leftv, leftv)
int iiDeclCommand(leftv sy, leftv name, int lev, int t, idhdl *root, BOOLEAN isring=FALSE, BOOLEAN init_b=TRUE)