source: git/Singular/pInline0.h @ 8cfee1c

/****************************************
*  Computer Algebra System SINGULAR     *
****************************************/
/***************************************************************
 *  File:    pInline.cc
 *  Purpose: implementation of poly Level 0 functions
 *  Author:  obachman (Olaf Bachmann)
 *  Created: 8/00
 *  Version: $Id: pInline0.h,v 1.6 2000-12-31 15:14:37 obachman Exp $
 *******************************************************************/
#ifndef PINLINE0_H
#define PINLINE0_H

#if defined(DO_PINLINE0)
#define PINLINE0 static inline
#else
#define PINLINE0 
#endif

#include "mod2.h"
#include "p_polys.h"
#include "ring.h"
  
PINLINE0 int p_SetCompP(poly p, int i, ring r)
{
  if (p == NULL) return 0;
  
#ifdef PDEBUG
  poly q = p;
#endif
  
  int l = 0;
  
  if (rOrd_SetCompRequiresSetm(r))
  {
    do
    {
      p_SetComp(p, i, r);
      p_SetmComp(p, r);
      l++;
      pIter(p);
    }
    while (p != NULL);
  }
  else
  {
    do
    {
      p_SetComp(p, i, r);
      l++;
      pIter(p);
    }
    while(p != NULL);
  }
#ifdef PDEBUG
  p_Test(q, r);
  assume(l == pLength(q));
#endif
  return l;
}

PINLINE0 int p_SetCompP(poly p, int i, ring lmRing, ring tailRing)
{
  if (p != NULL)
  {
    p_SetComp(p, i, lmRing);
    p_SetmComp(p, lmRing);
    return p_SetCompP(pNext(p), i, tailRing) + 1;
  }
  else
    return 0;
}

// returns minimal column number in the modul element a (or 0)
PINLINE0 long p_MinComp(poly p, ring lmRing, ring tailRing)
{
  long result,i;

  if(p==NULL) return 0;
  result = p_GetComp(p,lmRing);
  if (result != 0)
  {
    while (pNext(p)!=NULL)
    {
      pIter(p);
      i = p_GetComp(p,tailRing);
      if (i<result) result = i;
    }
  }
  return result;
}

// returns maximal column number in the modul element a (or 0)
PINLINE0 long p_MaxComp(poly p, ring lmRing, ring tailRing)
{
  long result,i;

  if(p==NULL) return 0;
  result = p_GetComp(p, lmRing);
  if (result != 0) 
  {
    while (pNext(p)!=NULL)
    {
      pIter(p);
      i = p_GetComp(p, tailRing);
      if (i>result) result = i;
    }
  }
  return result;
}

BOOLEAN   p_IsConstantPoly(poly p, ring r)
{
  while(p!=NULL)
  {
    if (! p_LmIsConstantComp(p, r))
      return FALSE;
    pIter(p);
  }
  return TRUE;
}

/***************************************************************
 *
 * poly things which are independent of ring
 *
 ***************************************************************/
PINLINE0 poly pReverse(poly p)
{
  if (p == NULL || pNext(p) == NULL) return p;

  poly q = pNext(p), // == pNext(p)
    qn;
  pNext(p) = NULL;
  do
  {
    qn = pNext(q);
    pNext(q) = p;
    p = q;
    q = qn;
  }
  while (qn != NULL);
  return p;
}


/*2
* returns the length of a (numbers of monomials)
*/
PINLINE0 int pLength(poly a)
{
  int l = 0;

  while (a!=NULL)
  {
    pIter(a);
    l++;
  }
  return l;
}

/*2
* returns the length of a (numbers of monomials)
*/
PINLINE0 poly pLast(poly a, int &l)
{
  if (a == NULL) 
  {
    l = 0;
    return NULL;
  }
  l = 1;
  while (pNext(a)!=NULL)
  {
    pIter(a);
    l++;
  }
  return a;
}

#endif // PINLINE_CC