 |
My Project
UNKNOWN_GIT_VERSION
|
Go to the source code of this file.
|
int | lSize (lists L) |
|
lists | lCopy (lists L) |
|
lists | lInsert0 (lists ul, leftv v, int pos) |
|
BOOLEAN | lInsert (leftv res, leftv u, leftv v) |
|
BOOLEAN | lInsert3 (leftv res, leftv u, leftv v, leftv w) |
|
BOOLEAN | lAppend (leftv res, leftv u, leftv v) |
|
BOOLEAN | lDelete (leftv res, leftv u, leftv v) |
|
BOOLEAN | lAdd (leftv res, leftv u, leftv v) |
|
BOOLEAN | lRingDependend (lists L) |
|
char * | lString (lists l, BOOLEAN typed=FALSE, int dim=1) |
|
lists | liMakeResolv (resolvente r, int length, int reallen, int typ0, intvec **weights, int add_row_shift) |
|
resolvente | liFindRes (lists L, int *len, int *typ0, intvec ***weights=NULL) |
|
◆ INLINE_THIS
◆ lists
◆ lAdd()
Definition at line 51 of file lists.cc.
56 l->Init(ul->
nr+vl->
nr+2);
59 for(
i=0;
i<=ul->
nr;
i++)
65 for(
i=0;
i<=vl->
nr;
i++)
77 memset(u,0,
sizeof(*u));
78 memset(
v,0,
sizeof(*
v));
79 res->data = (
char *)
l;
◆ lAppend()
◆ lCopy()
Definition at line 32 of file lists.cc.
42 N->m[n].Copy(&L->
m[n]);
◆ lDelete()
Definition at line 161 of file lists.cc.
164 int VIndex=(int)(
long)
v->Data()-1;
165 int EndIndex=
lSize(ul);
167 if((0<=VIndex)&&(VIndex<=ul->nr))
172 l->Init(EndIndex+(VIndex>EndIndex));
174 for(
i=
j=0;
i<=EndIndex;
i++,
j++)
179 memset(&ul->
m[
i],0,
sizeof(ul->
m[
i]));
189 res->data = (
char *)
l;
192 Werror(
"wrong index %d in list(%d)",VIndex+1,ul->
nr+1);
◆ liFindRes()
Definition at line 315 of file lists.cc.
326 r=(ideal *)
omAlloc0((*len)*
sizeof(ideal));
336 Werror(
"element %d is not of type module",
i+1);
358 while ((
j<
i) && hom_complex)
360 hom_complex = hom_complex && (
w[
j]!=
NULL);
363 if ((!hom_complex) || (weights==
NULL))
◆ liMakeResolv()
lists liMakeResolv |
( |
resolvente |
r, |
|
|
int |
length, |
|
|
int |
reallen, |
|
|
int |
typ0, |
|
|
intvec ** |
weights, |
|
|
int |
add_row_shift |
|
) |
| |
Definition at line 216 of file lists.cc.
230 if (reallen<=0) reallen=
currRing->N;
243 while ((
j>0) && (r[0]->
m[
j]==
NULL))
j--;
267 if ((weights!=
NULL) && (weights[
i]!=
NULL))
270 (*w) += add_row_shift;
279 WarnS(
"internal NULL in resolvente");
296 ideal I=(ideal)L->
m[
i-1].
data;
◆ lInsert()
◆ lInsert0()
Definition at line 87 of file lists.cc.
89 if ((pos<0)||(
v->rtyp==
NONE))
100 for(
j=ul->
nr+1;
j<pos;
j++)
103 l->m[pos].rtyp=
v->Typ();
104 l->m[pos].data=
v->CopyD();
105 l->m[pos].flag=
v->flag;
106 attr *a=
v->Attribute();
109 l->m[pos].attribute=(*a)->Copy();
◆ lInsert3()
Definition at line 135 of file lists.cc.
141 Werror(
"cannot insert type `%s` at pos. %d",
◆ lRingDependend()
Definition at line 199 of file lists.cc.
206 if ((BEGIN_RING<t /*L->
m[
i].rtyp*/)
◆ lSize()
◆ lString()
Definition at line 380 of file lists.cc.
384 if (typed)
return omStrDup(
"list()");
388 char** slist = (
char**)
omAlloc((
l->nr+1) *
sizeof(
char*));
391 for (
i=0,
j = 0,
k = 0;
i<=
l->nr;
i++)
396 if (*(slist[
i]) !=
'\0')
398 j += strlen(slist[
i]);
409 for (
i=0;
i<=
l->nr;
i++)
411 if (*(slist[
i]) !=
'\0')
415 if (
dim == 2) strcat(
s,
"\n");
420 if (
k > 0)
s[strlen(
s) - (
dim == 2 ? 2 : 1)] =
'\0';
421 if (typed) strcat(
s,
")");
◆ slists_bin
ideal id_FreeModule(int i, const ring r)
the free module of rank i
#define idDelete(H)
delete an ideal
lists lInsert0(lists ul, leftv v, int pos)
void pEnlargeSet(poly **p, int l, int increment)
static BOOLEAN length(leftv result, leftv arg)
const CanonicalForm CFMap CFMap & N
BOOLEAN idIs0(ideal h)
returns true if h is the zero ideal
Class used for (list of) interpreter objects.
ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
intvec * ivCopy(const intvec *o)
long id_RankFreeModule(ideal s, ring lmRing, ring tailRing)
return the maximal component number found in any polynomial in s
#define omFreeSize(addr, size)
void idSkipZeroes(ideal ide)
gives an ideal/module the minimal possible size
BOOLEAN lRingDependend(lists L)
void atSet(idhdl root, char *name, void *data, int typ)
void CleanUp(ring r=currRing)
static int si_max(const int a, const int b)
void * atGet(idhdl root, const char *name, int t, void *defaultReturnValue)
void Werror(const char *fmt,...)
ideal idFreeModule(int i)
ideal idInit(int idsize, int rank)
initialise an ideal / module
void WerrorS(const char *s)
const Variable & v
< [in] a sqrfree bivariate poly
#define omCheckAddr(addr)
INLINE_THIS void Init(int l=0)
const CanonicalForm int s
const char * Tok2Cmdname(int tok)
#define omFreeBin(addr, bin)