pcv.h File Reference

Go to the source code of this file.

Functions
lists	pcvLAddL (lists l1, lists l2)
lists	pcvPMulL (poly p, lists l1)
BOOLEAN	pcvLAddL (leftv res, leftv h)
BOOLEAN	pcvPMulL (leftv res, leftv h)
int	pcvDeg (poly p)
int	pcvMinDeg (poly p)
int	pcvMinDeg (matrix m)
BOOLEAN	pcvMinDeg (leftv res, leftv h)
void	pcvInit (int d)
void	pcvClean ()
int	pcvM2N (poly m)
poly	pcvN2M (int n)
poly	pcvP2CV (poly p, int d0, int d1)
poly	pcvCV2P (poly cv, int d0, int d1)
lists	pcvP2CV (lists pl, int d0, int d1)
ideal	pcvP2CV (ideal p, int d0, int d1)
lists	pcvCV2P (lists cvl, int d0, int d1)
ideal	pcvCV2P (ideal cv, int d0, int d1)
BOOLEAN	pcvP2CV (leftv res, leftv h)
BOOLEAN	pcvCV2P (leftv res, leftv h)
int	pcvDim (int d0, int d1)
BOOLEAN	pcvDim (leftv res, leftv h)
int	pcvBasis (lists b, int i, poly m, int d, int n)
lists	pcvBasis (int d0, int d1)
BOOLEAN	pcvBasis (leftv res, leftv h)

Function Documentation

pcvBasis() [1/3]

lists pcvBasis	(	int	d0,
		int	d1
	)

Definition at line 450 of file pcv.cc.

{
  if(d0<0) d0=0;
  if(d1<0) d1=0;
  lists b=(lists)omAllocBin(slists_bin);
  b->Init(pcvDim(d0,d1));
  poly m=pOne();
  for(int d=d0,i=0;d<d1;d++)
    i=pcvBasis(b,i,m,d,1);
  pLmDelete(&m);
  return b;
}

pcvBasis() [2/3]

BOOLEAN pcvBasis	(	leftv	res,
		leftv	h
	)

Definition at line 463 of file pcv.cc.

{
  if(currRing)
  {
    const short t[]={2,INT_CMD,INT_CMD};
    if (iiCheckTypes(h,t,1))
    {
      int d0=(int)(long)h->Data();
      h=h->next;
      int d1=(int)(long)h->Data();
      res->rtyp=LIST_CMD;
      res->data=(void*)pcvBasis(d0,d1);
      return FALSE;
    }
    return TRUE;
  }
  WerrorS("no ring active");
  return TRUE;
}

pcvBasis() [3/3]

int pcvBasis	(	lists	b,
		int	i,
		poly	m,
		int	d,
		int	n
	)

Definition at line 430 of file pcv.cc.

{
  if(n<currRing->N)
  {
    for(int k=0,l=d;k<=l;k++,d--)
    {
      pSetExp(m,n,k);
      i=pcvBasis(b,i,m,d,n+1);
    }
  }
  else
  {
    pSetExp(m,n,d);
    pSetm(m);
    b->m[i].rtyp=POLY_CMD;
    b->m[i++].data=pCopy(m);
  }
  return i;
}

pcvClean()

void pcvClean

(

)

Definition at line 223 of file pcv.cc.

{
  if(pcvTable)
  {
    omFreeSize(pcvTable,pcvTableSize);
    pcvTable=NULL;
  }
  if(pcvIndex)
  {
    omFreeSize(pcvIndex,pcvIndexSize);
    pcvIndex=NULL;
  }
}

pcvCV2P() [1/4]

ideal pcvCV2P	(	ideal	cv,
		int	d0,
		int	d1
	)

pcvCV2P() [2/4]

BOOLEAN pcvCV2P	(	leftv	res,
		leftv	h
	)

Definition at line 378 of file pcv.cc.

{
  if(currRing)
  {
    const short t[]={3,LIST_CMD,INT_CMD,INT_CMD};
    if (iiCheckTypes(h,t,1))
    {
      lists pl=(lists)h->Data();
      h=h->next;
      int d0=(int)(long)h->Data();
      h=h->next;
      int d1=(int)(long)h->Data();
      res->rtyp=LIST_CMD;
      res->data=(void*)pcvCV2P(pl,d0,d1);
      return FALSE;
    }
    return TRUE;
  }
  WerrorS("no ring active");
  return TRUE;
}

pcvCV2P() [3/4]

lists pcvCV2P	(	lists	cvl,
		int	d0,
		int	d1
	)

Definition at line 339 of file pcv.cc.

{
  lists pl=(lists)omAllocBin(slists_bin);
  pl->Init(cvl->nr+1);
  pcvInit(d1);
  for(int i=cvl->nr;i>=0;i--)
  {
    if(cvl->m[i].rtyp==VECTOR_CMD)
    {
      pl->m[i].rtyp=POLY_CMD;
      pl->m[i].data=pcvCV2P((poly)cvl->m[i].data,d0,d1);
    }
  }
  pcvClean();
  return pl;
}

pcvCV2P() [4/4]

poly pcvCV2P	(	poly	cv,
		int	d0,
		int	d1
	)

Definition at line 297 of file pcv.cc.

{
  poly p=NULL;
  while(cv)
  {
    poly m=pcvN2M(pGetComp(cv));
    if(m)
    {
      int d=pcvDeg(m);
      if(d0<=d&&d<d1)
      {
        pSetCoeff(m,nCopy(pGetCoeff(cv)));
        p=pAdd(p,m);
      }
    }
    pIter(cv);
  }
  return p;
}

pcvDeg()

int pcvDeg

(

poly

p

)

Definition at line 128 of file pcv.cc.

{
  int d=0;
  for(int i=currRing->N;i>=1;i--) d+=pGetExp(p,i);
  return d;
}

pcvDim() [1/2]

int pcvDim	(	int	d0,
		int	d1
	)

Definition at line 400 of file pcv.cc.

{
  if(d0<0) d0=0;
  if(d1<0) d1=0;
  pcvInit(d1);
  int d=pcvIndex[currRing->N-1][d1]-pcvIndex[currRing->N-1][d0];
  pcvClean();
  return d;
}

pcvDim() [2/2]

BOOLEAN pcvDim	(	leftv	res,
		leftv	h
	)

Definition at line 410 of file pcv.cc.

{
  if(currRing)
  {
    const short t[]={2,INT_CMD,INT_CMD};
    if (iiCheckTypes(h,t,1))
    {
      int d0=(int)(long)h->Data();
      h=h->next;
      int d1=(int)(long)h->Data();
      res->rtyp=INT_CMD;
      res->data=(void*)(long)pcvDim(d0,d1);
      return FALSE;
    }
    return TRUE;
  }
  WerrorS("no ring active");
  return TRUE;
}

pcvInit()

void pcvInit

(

int

d

)

Definition at line 193 of file pcv.cc.

{
  if(d<0) d=1;
  pcvMaxDegree=d+1;
  pcvTableSize=currRing->N*pcvMaxDegree*sizeof(unsigned);
  pcvTable=(unsigned*)omAlloc0(pcvTableSize);
  pcvIndexSize=currRing->N*sizeof(unsigned*);
  pcvIndex=(unsigned**)omAlloc(pcvIndexSize);
  for(int i=0;i<currRing->N;i++)
    pcvIndex[i]=pcvTable+i*pcvMaxDegree;
  for(int i=0;i<pcvMaxDegree;i++)
    pcvIndex[0][i]=i;
  unsigned k,l;
  for(int i=1;i<currRing->N;i++)
  {
    k=0;
    for(int j=0;j<pcvMaxDegree;j++)
    {
      l=pcvIndex[i-1][j];
      if(l>unsigned(~0)-k)
      {
        j=pcvMaxDegree;
        i=currRing->N;
        WerrorS("unsigned overflow");
      }
      else pcvIndex[i][j]=k+=l;
    }
  }
}

pcvLAddL() [1/2]

BOOLEAN pcvLAddL	(	leftv	res,
		leftv	h
	)

Definition at line 96 of file pcv.cc.

{
  const short t[]={2,LIST_CMD,LIST_CMD};
  if (iiCheckTypes(h,t,1))
  {
    lists l1=(lists)h->Data();
    h=h->next;
    lists l2=(lists)h->Data();
    res->rtyp=LIST_CMD;
    res->data=(void*)pcvLAddL(l1,l2);
    return FALSE;
  }
  return TRUE;
}

pcvLAddL() [2/2]

lists pcvLAddL	(	lists	l1,
		lists	l2
	)

Definition at line 31 of file pcv.cc.

{
  lists l0=(lists)omAllocBin(slists_bin);
  int i=l1->nr;
  if(l1->nr<l2->nr) i=l2->nr;
  l0->Init(i+1);
  for(;i>=0;i--)
  {
    if(i<=l1->nr
    &&(l1->m[i].rtyp==POLY_CMD||l1->m[i].rtyp==BUCKET_CMD||l1->m[i].rtyp==VECTOR_CMD))
    {
      if (l1->m[i].rtyp==BUCKET_CMD)
      {
        poly p=sBucketPeek((sBucket_pt)l1->m[i].data);
        l0->m[i].rtyp=POLY_CMD;
        l0->m[i].data=pCopy(p);
      }
      else
      {
        l0->m[i].rtyp=l1->m[i].rtyp;
        l0->m[i].data=pCopy((poly)l1->m[i].data);
      }
      if(i<=l2->nr&&l2->m[i].rtyp==l0->m[i].rtyp)
        l0->m[i].data=pAdd((poly)l0->m[i].data,pCopy((poly)l2->m[i].data));
    }
    else
    if(i<=l2->nr
    &&(l2->m[i].rtyp==POLY_CMD||l2->m[i].rtyp==BUCKET_CMD||l2->m[i].rtyp==VECTOR_CMD))
    {
      if (l2->m[i].rtyp==BUCKET_CMD)
      {
        poly p=sBucketPeek((sBucket_pt)l2->m[i].data);
        l0->m[i].rtyp=POLY_CMD;
        l0->m[i].data=pCopy(p);
      }
      else
      {
        l0->m[i].rtyp=l2->m[i].rtyp;
        l0->m[i].data=pCopy((poly)l2->m[i].data);
      }
    }
  }
  return(l0);
}

pcvM2N()

int pcvM2N

(

poly

m

)

Definition at line 237 of file pcv.cc.

{
  unsigned n=0,dn,d=0;
  for(int i=0;i<currRing->N;i++)
  {
    d+=pGetExp(m,i+1);
    dn=pcvIndex[i][d];
    if(dn>MAX_INT_VAL-n)
    {
      i=currRing->N;
      WerrorS("component overflow");
    }
    else n+=dn;
  }
  return n+1;
}

pcvMinDeg() [1/3]

BOOLEAN pcvMinDeg	(	leftv	res,
		leftv	h
	)

Definition at line 164 of file pcv.cc.

{
  if(h)
  {
    if(h->Typ()==BUCKET_CMD)
    {
      res->rtyp=INT_CMD;
      res->data=(void*)(long)pcvMinDeg(sBucketPeek((sBucket_pt)h->Data()));
      return FALSE;
    }
    else
    if(h->Typ()==POLY_CMD)
    {
      res->rtyp=INT_CMD;
      res->data=(void*)(long)pcvMinDeg((poly)h->Data());
      return FALSE;
    }
    else
    if(h->Typ()==MATRIX_CMD)
    {
      res->rtyp=INT_CMD;
      res->data=(void*)(long)pcvMinDeg((matrix)h->Data());
      return FALSE;
    }
  }
  WerrorS("<poly> expected");
  return TRUE;
}

pcvMinDeg() [2/3]

int pcvMinDeg

(

matrix

m

)

Definition at line 149 of file pcv.cc.

{
  int i,j,d;
  int md=-1;
  for(i=1;i<=MATROWS(m);i++)
  {
    for(j=1;j<=MATCOLS(m);j++)
    {
      d=pcvMinDeg(MATELEM(m,i,j));
      if((d>=0&&md>d)||md==-1) md=d;
    }
  }
  return(md);
}

pcvMinDeg() [3/3]

int pcvMinDeg

(

poly

p

)

Definition at line 135 of file pcv.cc.

{
  if(!p) return -1;
  int md=pcvDeg(p);
  pIter(p);
  while(p)
  {
    int d=pcvDeg(p);
    if(d<md) md=d;
    pIter(p);
  }
  return md;
}

pcvN2M()

poly pcvN2M

(

int

n

)

Definition at line 254 of file pcv.cc.

{
  n--;
  poly m=pOne();
  int i,j=0,k;
  for(i=currRing->N-1;i>=0;i--)
  {
    k=j;
    for(j=0; (j<pcvMaxDegree) && (pcvIndex[i][j]<=(unsigned)n); j++);
    j--;
    n-=pcvIndex[i][j];
    if(i<currRing->N-1) pSetExp(m,i+2,k-j);
  }
  if(n==0)
  {
    pSetExp(m,1,j);
    pSetm(m);
    return m;
  }
  else
  {
    pLmDelete(&m);
    return NULL;
  }
}

pcvP2CV() [1/4]

ideal pcvP2CV	(	ideal	p,
		int	d0,
		int	d1
	)

pcvP2CV() [2/4]

BOOLEAN pcvP2CV	(	leftv	res,
		leftv	h
	)

Definition at line 356 of file pcv.cc.

{
  if(currRing)
  {
    const short t[]={3,LIST_CMD,INT_CMD,INT_CMD};
    if (iiCheckTypes(h,t,1))
    {
      lists p=(lists)h->Data();
      h=h->next;
      int d0=(int)(long)h->Data();
      h=h->next;
      int d1=(int)(long)h->Data();
      res->rtyp=LIST_CMD;
      res->data=(void*)pcvP2CV(p,d0,d1);
      return FALSE;
    }
    return TRUE;
  }
  WerrorS("no ring active");
  return TRUE;
}

pcvP2CV() [3/4]

lists pcvP2CV	(	lists	pl,
		int	d0,
		int	d1
	)

Definition at line 317 of file pcv.cc.

{
  lists cvl=(lists)omAllocBin(slists_bin);
  cvl->Init(pl->nr+1);
  pcvInit(d1);
  for(int i=pl->nr;i>=0;i--)
  {
    if(pl->m[i].rtyp==POLY_CMD)
    {
      cvl->m[i].rtyp=VECTOR_CMD;
      cvl->m[i].data=pcvP2CV((poly)pl->m[i].data,d0,d1);
    }
    else if(pl->m[i].rtyp==BUCKET_CMD)
    {
      cvl->m[i].rtyp=VECTOR_CMD;
      cvl->m[i].data=pcvP2CV(sBucketPeek((sBucket_pt)pl->m[i].data),d0,d1);
    }
  }
  pcvClean();
  return cvl;
}

pcvP2CV() [4/4]

poly pcvP2CV	(	poly	p,
		int	d0,
		int	d1
	)

Definition at line 280 of file pcv.cc.

{
  poly cv=NULL;
  while(p)
  {
    int d=pcvDeg(p);
    if(d0<=d&&d<d1)
    {
      poly c=pNSet(nCopy(pGetCoeff(p)));
      pSetComp(c,pcvM2N(p));
      cv=pAdd(cv,c);
    }
    pIter(p);
  }
  return cv;
}

pcvPMulL() [1/2]

BOOLEAN pcvPMulL	(	leftv	res,
		leftv	h
	)

Definition at line 111 of file pcv.cc.

{
  const short t1[]={2,POLY_CMD,LIST_CMD};
  const short t2[]={2,BUCKET_CMD,LIST_CMD};
  if (iiCheckTypes(h,t2,0)
  ||iiCheckTypes(h,t1,1))
  {
    poly p=(poly)h->Data();
    h=h->next;
    lists l=(lists)h->Data();
    res->rtyp=LIST_CMD;
    res->data=(void*)pcvPMulL(p,l);
    return FALSE;
  }
  return TRUE;
}

pcvPMulL() [2/2]

lists pcvPMulL	(	poly	p,
		lists	l1
	)

Definition at line 76 of file pcv.cc.

{
  lists l0=(lists)omAllocBin(slists_bin);
  l0->Init(l1->nr+1);
  for(int i=l1->nr;i>=0;i--)
  {
    if(l1->m[i].rtyp==POLY_CMD)
    {
      l0->m[i].rtyp=POLY_CMD;
      l0->m[i].data=ppMult_qq(p,(poly)l1->m[i].data);
    }
    else if(l1->m[i].rtyp==BUCKET_CMD)
    {
      l0->m[i].rtyp=POLY_CMD;
      l0->m[i].data=ppMult_qq(p,sBucketPeek((sBucket_pt)l1->m[i].data));
    }
  }
  return(l0);
}