lists.cc File Reference

#include "kernel/mod2.h"
#include "Singular/tok.h"
#include "kernel/polys.h"
#include "kernel/ideals.h"
#include "Singular/attrib.h"
#include "Singular/ipshell.h"
#include "misc/intvec.h"
#include "Singular/lists.h"

Go to the source code of this file.

Macros
#define	LISTS_CC

Functions
int	lSize (lists L)
lists	lCopy (lists L)
BOOLEAN	lAdd (leftv res, leftv u, leftv v)
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	lDeleteIV (leftv res, leftv u, leftv v)
BOOLEAN	lRingDependend (lists L)
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)
char *	lString (lists l, BOOLEAN typed, int dim)

Variables
VAR omBin	slists_bin = omGetSpecBin(sizeof(slists))

Macro Definition Documentation

LISTS_CC

#define LISTS_CC

Definition at line 8 of file lists.cc.

Function Documentation

lAdd()

BOOLEAN lAdd	(	leftv	res,
		leftv	u,
		leftv	v )

Definition at line 51 of file lists.cc.

{
  lists l=(lists) omAllocBin(slists_bin);
  lists ul=(lists)u->CopyD();
  lists vl=(lists)v->CopyD();
  l->Init(ul->nr+vl->nr+2);
  int i;
 
  for(i=0;i<=ul->nr;i++)
  {
    //Print("u[%d]->r[%d]\n",i,i);
    l->m[i].rtyp=ul->m[i].rtyp;
    l->m[i].data=ul->m[i].data;
  }
  for(i=0;i<=vl->nr;i++)
  {
    //Print("v[%d]->r[%d]\n",i,i+ul->nr+1);
    l->m[i+ul->nr+1].rtyp=vl->m[i].rtyp;
    l->m[i+ul->nr+1].data=vl->m[i].data;
  }
  if (ul->m != NULL)
    omFreeSize((ADDRESS)ul->m,(ul->nr+1)*sizeof(sleftv));
  omFreeBin((ADDRESS)ul, slists_bin);
  if (vl->m != NULL)
    omFreeSize((ADDRESS)vl->m,(vl->nr+1)*sizeof(sleftv));
  omFreeBin((ADDRESS)vl, slists_bin);
  memset(u,0,sizeof(*u));
  memset(v,0,sizeof(*v));
  res->data = (char *)l;
  //res->Print();
  return FALSE;
}

lAppend()

BOOLEAN lAppend	(	leftv	res,
		leftv	u,
		leftv	v )

Definition at line 151 of file lists.cc.

{
  lists ul=(lists)u->CopyD();
  res->data=(char *)lInsert0(ul,v,ul->nr+1);
  return (res->data==NULL);
}

lCopy()

lists lCopy

(

lists

L

)

Definition at line 32 of file lists.cc.

{
  lists N=(lists)omAlloc0Bin(slists_bin);
  int n=L->nr;
  if (n>=0)
    N->Init(n+1);
  else
    N->Init();
  for(;n>=0;n--)
  {
    N->m[n].Copy(&L->m[n]);
  }
  //Print("copy list with %d -> %d elems\n",L->nr,N->nr);
  return N;
}

lDelete()

BOOLEAN lDelete	(	leftv	res,
		leftv	u,
		leftv	v )

Definition at line 161 of file lists.cc.

{
  lists ul=(lists)u->Data();
  int VIndex=(int)(long)v->Data()-1;
  int EndIndex=lSize(ul);
 
  if((0<=VIndex)&&(VIndex<=ul->nr))
  {
    ul=(lists)u->CopyD();
    int i;
    lists l=(lists) omAllocBin(slists_bin);
    l->Init(EndIndex+(VIndex>EndIndex));
 
    ul->m[VIndex].CleanUp();
    for(i=0;i<VIndex;i++)
    {
      l->m[i]=ul->m[i];
    }
    for(i=VIndex+1;i<=ul->nr;i++)
    {
      l->m[i-1]=ul->m[i];
    }
    omFreeSize((ADDRESS)ul->m,(ul->nr+1)*sizeof(sleftv));
    omFreeBin((ADDRESS)ul, slists_bin);
    res->data = (char *)l;
    return FALSE;
  }
  Werror("wrong index %d in list(%d)",VIndex+1,ul->nr+1);
  return TRUE;
}

lDeleteIV()

BOOLEAN lDeleteIV	(	leftv	res,
		leftv	u,
		leftv	v )

Definition at line 192 of file lists.cc.

{
  lists ul=(lists)u->CopyD();
  intvec* vl=(intvec*)v->Data();
  int i,j,cnt;
  cnt=0;
  for(i=vl->length()-1;i>=0;i--)
  {
    j=(*vl)[i];
    if ((j>0)&&(j<=ul->nr))
    {
      cnt++;
      ul->m[j-1].CleanUp();
      memcpy(&(ul->m[j-1]),&(ul->m[j]),(ul->nr-j+1)*sizeof(sleftv));
      ul->m[ul->nr].rtyp=DEF_CMD;
      ul->m[ul->nr].data=NULL;
    }
  }
  if ((cnt*2>=ul->nr)||(cnt*sizeof(sleftv)>=1024))
  {
    ul->m=(leftv)omReallocSize(ul->m,(ul->nr+1)*sizeof(sleftv),(ul->nr-cnt+1)*sizeof(sleftv));
    ul->nr -= cnt;
  }
  res->data = (char *)ul;
  return FALSE;
}

liFindRes()

resolvente liFindRes	(	lists	L,
		int *	len,
		int *	typ0,
		intvec ***	weights )

Definition at line 344 of file lists.cc.

{
  resolvente r;
  intvec ** w=NULL,*tw=NULL;
 
  *len=L->nr+1;
  if (*len<=0)
  {
    WerrorS("empty list");
    return NULL;
  }
  r=(ideal *)omAlloc0((*len)*sizeof(ideal));
  w=(intvec**)omAlloc0((*len)*sizeof(intvec*));
  int i=0;
  *typ0=MODUL_CMD;
  while (i<(*len))
  {
    if (L->m[i].rtyp != MODUL_CMD)
    {
      if (L->m[i].rtyp!=IDEAL_CMD)
      {
        Werror("element %d is not of type module",i+1);
        omFreeSize((ADDRESS)r,(*len)*sizeof(ideal));
        return NULL;
      }
      *typ0=IDEAL_CMD;
    }
    if ((i>0) && (idIs0(r[i-1])))
    {
      //*len=i-1;
      break;
    }
    r[i]=(ideal)L->m[i].data;
    tw=(intvec*)atGet(&(L->m[i]),"isHomog",INTVEC_CMD);
    if (tw!=NULL)
    {
      w[i]=ivCopy(tw);
    }
    tw = NULL;
    i++;
  }
  BOOLEAN hom_complex=TRUE;
  int j=0;
  while ((j<i) && hom_complex)
  {
    hom_complex = hom_complex && (w[j]!=NULL);
    j++;
  }
  if ((!hom_complex) || (weights==NULL))
  {
    for (j=0;j<i;j++)
    {
      if (w[j]!=NULL) delete w[j];
    }
    omFreeSize((ADDRESS)w,(*len)*sizeof(intvec*));
    if (weights!=NULL) *weights=NULL;
  }
  else
  {
    *weights = w;
  }
  //Print("find res of length %d (0..%d) L:%d\n",*len,(*len)-1,L->nr);
  return r;
}

liMakeResolv()

lists liMakeResolv	(	resolvente	r,
		int	length,
		int	reallen,
		int	typ0,
		intvec **	weights,
		int	add_row_shift )

Definition at line 239 of file lists.cc.

{
  // re-uses r, weights[i]
  lists L=(lists)omAlloc0Bin(slists_bin);
  if (length<0)
  {
    // handle "empty" resolutions
    L->Init(0);
  }
  else if (length==0)
  {
    L->Init(1);
    L->m[0].rtyp=typ0;
    L->m[0].data=(void*)idInit(1,1);
  }
  else
  {
    int oldlength=length;
    while (r[length-1]==NULL) length--;
    if (reallen<=0) reallen=currRing->N;
    reallen=si_max(reallen,length);
    L->Init(reallen);
    int i=0;
 
    while (i<length)
    {
      if (r[i]!=NULL)
      {
        if (i==0)
        {
          L->m[i].rtyp=typ0;
          int j=IDELEMS(r[0])-1;
          while ((j>0) && (r[0]->m[j]==NULL)) j--;
          j++;
          if (j!=IDELEMS(r[0]))
          {
            pEnlargeSet(&(r[0]->m),IDELEMS(r[0]),j-IDELEMS(r[0]));
            IDELEMS(r[0])=j;
          }
        }
        else
        {
          L->m[i].rtyp=MODUL_CMD;
          int rank=IDELEMS(r[i-1]);
          if (idIs0(r[i-1]))
          {
            idDelete(&(r[i]));
            r[i]=id_FreeModule(rank, currRing);
          }
          else
          {
            r[i]->rank=si_max(rank,(int)id_RankFreeModule(r[i], currRing));
          }
          idSkipZeroes(r[i]);
        }
        L->m[i].data=(void *)r[i];
        if ((weights!=NULL) && (weights[i]!=NULL))
        {
          intvec *w=weights[i];
          (*w) += add_row_shift;
          atSet((idhdl)&L->m[i],omStrDup("isHomog"),w,INTVEC_CMD);
          weights[i] = NULL;
        }
      }
      #ifdef TEST
      else
      {
        // should not happen:
        WarnS("internal NULL in resolvente");
        L->m[i].data=(void *)idInit(1,1);
      }
      #endif
      i++;
    }
    omFreeSize((ADDRESS)r,oldlength*sizeof(ideal));
    if (weights!=NULL) omFreeSize(weights,oldlength*sizeof(intvec*));
    if (i==0)
    {
      L->m[0].rtyp=typ0;
      L->m[0].data=(char *)idInit(1,1);
      i=1;
    }
    while (i<reallen)
    {
      L->m[i].rtyp=MODUL_CMD;
      ideal I=(ideal)L->m[i-1].data;
      ideal J;
      int rank=IDELEMS(I);
      if (idIs0(I))
      {
        J=idFreeModule(rank);
      }
      else
      {
        J=idInit(1,rank);
      }
      L->m[i].data=(void *)J;
      i++;
    }
    //Print("make res of length %d (0..%d) L:%d\n",length,length-1,L->nr);
  }
  return L;
}

lInsert()

BOOLEAN lInsert	(	leftv	res,
		leftv	u,
		leftv	v )

Definition at line 120 of file lists.cc.

{
  lists ul=(lists)u->CopyD();
  res->data=(char *)lInsert0(ul,v,0);
  if (res->data==NULL)
  {
    Werror("cannot insert type `%s`",Tok2Cmdname(v->Typ()));
    return TRUE;
  }
  return FALSE;
}

lInsert0()

lists lInsert0	(	lists	ul,
		leftv	v,
		int	pos )

Definition at line 87 of file lists.cc.

{
  if ((pos<0)||(v->rtyp==NONE))
    return NULL;
  lists l=(lists) omAllocBin(slists_bin);
  l->Init(si_max(ul->nr+2,pos+1));
  int i,j;
 
  for(i=j=0;i<=ul->nr;i++,j++)
  {
    if(j==pos) j++;
    l->m[j]=ul->m[i];
  }
  for(j=ul->nr+1;j<pos;j++)
    l->m[j].rtyp=DEF_CMD;
  // memset(&(l->m[pos]),0,sizeof(sleftv)); - done by Init
  l->m[pos].rtyp=v->Typ();
  l->m[pos].data=v->CopyD();
  l->m[pos].flag=v->flag;
  attr *a=v->Attribute();
  if ((a!=NULL)&&(*a!=NULL))
  {
    l->m[pos].attribute=(*a)->Copy();
  }
  if (ul->m != NULL)
    omFreeSize((ADDRESS)ul->m,(ul->nr+1)*sizeof(sleftv));
  omFreeBin((ADDRESS)ul, slists_bin);
  return l;
}

lInsert3()

BOOLEAN lInsert3	(	leftv	res,
		leftv	u,
		leftv	v,
		leftv	w )

Definition at line 135 of file lists.cc.

{
  lists ul=(lists)u->CopyD();
  res->data=(char *)lInsert0(ul,v,(int)(long)w->Data());
  if (res->data==NULL)
  {
    Werror("cannot insert type `%s` at pos. %d",
      Tok2Cmdname(v->Typ()),(int)(long)w->Data());
    return TRUE;
  }
  return FALSE;
}

lRingDependend()

BOOLEAN lRingDependend

(

lists

L

)

Definition at line 222 of file lists.cc.

{
  if (L==NULL) return FALSE;
  int i=L->nr;
  while (i>=0)
  {
    REGISTER int t=L->m[i].rtyp;
    if ((BEGIN_RING<t /*L->m[i].rtyp*/)
    && (/*L->m[i].rtyp*/ t<END_RING))
      return TRUE;
    if ((/*L->m[i].rtyp*/ t==LIST_CMD)&&lRingDependend((lists)L->m[i].data))
      return TRUE;
    i--;
  }
  return FALSE;
}

lSize()

int lSize

(

lists

L

)

Definition at line 25 of file lists.cc.

{
  int n=L->nr;
  while ((n>=0)&&((L->m[n].rtyp==DEF_CMD)||(L->m[n].rtyp==0))) n--;
  return n;
}

lString()

char * lString	(	lists	l,
		BOOLEAN	typed,
		int	dim )

Definition at line 409 of file lists.cc.

{
  if (l->nr == -1)
  {
    if (typed) return omStrDup("list()");
    return omStrDup("");
  }
 
  char** slist = (char**) omAlloc((l->nr+1) * sizeof(char*));
  int i, j, k;
  char *s;
  for (i=0, j = 0, k = 0; i<=l->nr; i++)
  {
    slist[i] = l->m[i].String(NULL, typed, dim);
    assume(slist[i] != NULL);
    omCheckAddr(slist[i]);
    if (*(slist[i]) != '\0')
    {
      j += strlen(slist[i]);
      k++;
    }
  }
  size_t len=j+k+2+(typed ? 10 : 0) + (dim == 2 ? k : 0);
  s = (char*) omAlloc(len);
 
  if (typed)
    snprintf(s, len,"list(");
  else
    *s = '\0';
 
  for (i=0; i<=l->nr; i++)
  {
    if (*(slist[i]) != '\0')
    {
      strcat(s, slist[i]);
      strcat(s, ",");
      if (dim == 2) strcat(s, "\n");
    }
    omCheckAddr(s);
    omFree(slist[i]);
  }
  if (k > 0) s[strlen(s) - (dim == 2 ? 2 : 1)] = '\0';
  if (typed) strcat(s, ")");
  omCheckAddr(s);
  omFreeSize(slist, (l->nr+1) * sizeof(char*));
  return s;
}

Variable Documentation

slists_bin

VAR omBin slists_bin = omGetSpecBin(sizeof(slists))

Definition at line 23 of file lists.cc.