CGlobalMultiplier Class Reference

#include <ncSAMult.h>

Public Types
typedef CMultiplier< poly >	CBaseType
typedef poly	CExponent

Public Member Functions
	CGlobalMultiplier (ring r)
virtual	~CGlobalMultiplier ()
virtual poly	MultiplyEE (const CExponent expLeft, const CExponent expRight)
virtual poly	MultiplyME (const poly pMonom, const CExponent expRight)
virtual poly	MultiplyEM (const CExponent expLeft, const poly pMonom)
poly	MultiplyPE (const poly pPoly, const CExponent expRight)
poly	MultiplyEP (const CExponent expLeft, const poly pPoly)
poly	MultiplyPEDestroy (poly pPoly, const CExponent expRight)
poly	MultiplyEPDestroy (const CExponent expLeft, poly pPoly)
Public Member Functions inherited from CMultiplier< poly >
	CMultiplier (ring rBaseRing)
virtual	~CMultiplier ()
ring	GetBasering () const
int	NVars () const
poly	LM (const poly pTerm, const ring r, int i=1) const
poly	MultiplyTE (const poly pTerm, const poly expRight)
poly	MultiplyET (const poly expLeft, const poly pTerm)
virtual poly	MultiplyEE (const poly expLeft, const poly expRight)=0
virtual poly	MultiplyME (const poly pMonom, const poly expRight)=0
virtual poly	MultiplyEM (const poly expLeft, const poly pMonom)=0

Private Attributes
CPowerMultiplier *	m_powers
const CFormulaPowerMultiplier *	m_RingFormulaMultiplier

Additional Inherited Members
Protected Attributes inherited from CMultiplier< poly >
const ring	m_basering
const int	m_NVars

Detailed Description

Definition at line 263 of file ncSAMult.h.

Member Typedef Documentation

CBaseType

typedef CMultiplier<poly> CGlobalMultiplier::CBaseType

Definition at line 271 of file ncSAMult.h.

CExponent

typedef poly CGlobalMultiplier::CExponent

Definition at line 278 of file ncSAMult.h.

Constructor & Destructor Documentation

CGlobalMultiplier()

CGlobalMultiplier::CGlobalMultiplier

(

ring

r

)

Definition at line 293 of file ncSAMult.cc.

                                          :
    CMultiplier<poly>(r), m_RingFormulaMultiplier(GetFormulaPowerMultiplier(r))
{
#if OUTPUT
  PrintS("CGlobalMultiplier::CGlobalMultiplier(ring)!");
  PrintLn();
#endif
 
//  m_cache = new CGlobalCacheHash(r);
  m_powers = new CPowerMultiplier(r);
}

~CGlobalMultiplier()

CGlobalMultiplier::~CGlobalMultiplier ( )

virtual

Definition at line 306 of file ncSAMult.cc.

{
#if OUTPUT
  PrintS("CGlobalMultiplier::~CGlobalMultiplier()!");
  PrintLn();
#endif
 
//  delete m_cache;
  delete m_powers;
 
  // we cannot delete m_RingFormulaMultiplier as it belongs to the ring!
}

Member Function Documentation

MultiplyEE()

poly CGlobalMultiplier::MultiplyEE ( const CExponent  expLeft, const CExponent  expRight  )

virtual

Implements CMultiplier< poly >.

Definition at line 323 of file ncSAMult.cc.

{
 
  const ring r = GetBasering();
 
#if OUTPUT
  PrintS("CGlobalMultiplier::MultiplyEE(expLeft, expRight)!");
  PrintLn();
  PrintS("expL: "); p_Write(expLeft, GetBasering());
  PrintS("expR: "); p_Write(expRight, GetBasering());
#endif
 
//  CCacheHash<poly>::CCacheItem* pLookup;
//
//  int b = m_cache->LookupEE(expLeft, expRight, pLookup);
//  // TODO!!!
//
//  // up to now:
//  assume( b == -1 );
 
  // TODO: use PowerMultiplier!!!!
 
  poly product = NULL;
 
  const int N = NVars();
  int j = N;
  int i = 1;
 
  int ej = p_GetExp(expLeft, j, r);
  int ei = p_GetExp(expRight, i, r);
 
  while( (i < j) && !((ej != 0) && (ei != 0)) )
  {
    if( ei == 0 )
      ei = p_GetExp(expRight, ++i, r);
 
    if( ej == 0 )
      ej = p_GetExp(expLeft, --j, r);
  }
 
 
#if OUTPUT
  PrintS("<CGlobalMultiplier::MultiplyEE>");
  PrintLn();
  Print("i: %d, j: %d", i, j);
  PrintLn();
  Print("ei: %d, ej: %d", ei, ej);
  PrintLn();
#endif
 
 
  // |  expLeft   | * |  expRight  |
  // |<<<< ej 0..0| , |0..0 ei >>>>|
  // |<<<<  j <<<N| , |1>>>  i >>>>|
 
  if( i >= j ) // BUG here!!!???
  {
    // either i == j or i = j + 1 => commutative multiple!
    // TODO: it can be done more efficiently! ()
    product = p_Head(expRight, r);
 
  // |  expLeft     | * |  expRight   |
  // |<<<< ej 0....0| , |0..00 ei >>>>|
  // |<<<<  j i <<<N| , |1>>>j  i >>>>|
 
    if(i > j)
    {
      --i;
      ei = 0;
    }
 
    if( i == j )
    {
      if( ej != 0 )
        p_SetExp(product, i, ei + ej, r);
    }
 
    --i;
 
    for(; i > 0; --i)
    {
      const int e = p_GetExp(expLeft, i, r);
 
      if( e > 0 )
        p_SetExp(product, i, e, r);
    }
 
    p_Setm(product, r);
 
  } else
  { // i < j, ei != 0, ej != 0
 
    Enum_ncSAType PairType = _ncSA_notImplemented;
 
    if( m_RingFormulaMultiplier != NULL )
      PairType = m_RingFormulaMultiplier->GetPair(i, j);
 
 
    if( PairType == _ncSA_notImplemented )
      product = m_powers->MultiplyEE( CPower(j, ej), CPower(i, ei) );
//    return ggnc_uu_Mult_ww_vert(i, a, j, b, r);
    else
 //    return m_RingFormulaMultiplier->Multiply(j, i, b, a);
      product = CFormulaPowerMultiplier::Multiply( PairType, i, j, ei, ej, GetBasering());
 
 
#if OUTPUT
    PrintS("<CGlobalMultiplier::MultiplyEE> ==> ");
    PrintLn();
    Print("i: %d, j: %d", i, j);
    PrintLn();
    Print("ei: %d, ej: %d", ei, ej);
    PrintLn();
    PrintS("<product>: "); p_Write(product, GetBasering());
#endif
 
 
    // TODO: Choose some multiplication strategy!!!
 
    while( (product != NULL) && !((i == NVars()) && (j == 1)) )
    {
 
      // make some choice here!:
 
      if( i < NVars() )
      {
        ei = p_GetExp(expRight, ++i, r);
 
        while( (ei == 0) && (i < NVars()) )
          ei = p_GetExp(expRight, ++i, r);
 
        if( ei != 0 )
          product = m_powers->MultiplyPEDestroy(product, CPower(i, ei));
      }
 
      if( j > 1 )
      {
        ej = p_GetExp(expLeft, --j, r);
 
        while( (ej == 0) && (1 < j) )
          ej = p_GetExp(expLeft, --j, r);
 
        if( ej != 0 )
          product = m_powers->MultiplyEPDestroy(CPower(j, ej), product);
      }
 
 
#if OUTPUT
      PrintS("<CGlobalMultiplier::MultiplyEE> ==> ");
      PrintLn();
      Print("i: %d, j: %d", i, j);
      PrintLn();
      Print("ei: %d, ej: %d", ei, ej);
      PrintLn();
      PrintS("<product>: "); p_Write(product, GetBasering());
#endif
 
    }
 
  }
 
//  // TODO!
//
//  m_cache->StoreEE( expLeft, expRight, product);
//  // up to now:
  return product;
}

MultiplyEM()

poly CGlobalMultiplier::MultiplyEM ( const CExponent  expLeft, const poly  pMonom  )

virtual

Implements CMultiplier< poly >.

Definition at line 505 of file ncSAMult.cc.

{
#if OUTPUT
  PrintS("CGlobalMultiplier::MultiplyEM(expL, monom)!");
  PrintLn();
  PrintS("expL: "); p_Write(expLeft, GetBasering());
  PrintS("Monom: "); p_Write(pMonom, GetBasering());
#endif
 
  return MultiplyEE(expLeft, pMonom);
}

MultiplyEP()

poly CGlobalMultiplier::MultiplyEP ( const CExponent  expLeft, const poly  pPoly  )

inline

Definition at line 349 of file ncSAMult.h.

    {
      assume( pPoly != NULL );      assume( expLeft != NULL );
      const int iComponentMonom = p_GetComp(expLeft, GetBasering());
 
      bool bUsePolynomial = TEST_OPT_NOT_BUCKETS || (pLength(pPoly) < MIN_LENGTH_BUCKET);
      CPolynomialSummator sum(GetBasering(), bUsePolynomial);
 
      if( iComponentMonom!=0 )
      {
        for( poly q = pPoly; q !=NULL; q = pNext(q) )
        {
#ifdef PDEBUG
          {
            const int iComponent = p_GetComp(q, GetBasering());
            assume(iComponent == 0);
            if( iComponent!=0 )
            {
              Werror("MultiplyEP: both sides have non-zero components: %d and %d!\n", iComponent, iComponentMonom);
                // what should we do further?!?
              return NULL;
            }
          }
#endif
          sum += MultiplyET(expLeft, q);
        }
        poly t = sum; p_SetCompP(t, iComponentMonom, GetBasering());
        return t;
      } // iComponentMonom != 0!
      else
      { // iComponentMonom == 0!
        for( poly q = pPoly; q !=NULL; q = pNext(q) )
        {
          const int iComponent = p_GetComp(q, GetBasering());
 
          poly t = MultiplyET(expLeft, q); // NO Component!!!
          p_SetCompP(t, iComponent, GetBasering());
          sum += t;
        }
        return sum;
      } // iComponentMonom == 0!
    }

MultiplyEPDestroy()

poly CGlobalMultiplier::MultiplyEPDestroy ( const CExponent  expLeft, poly  pPoly  )

inline

Definition at line 447 of file ncSAMult.h.

    {
 
      assume( pPoly != NULL );      assume( expLeft != NULL );
      const int iComponentMonom = p_GetComp(expLeft, GetBasering());
 
      bool bUsePolynomial = TEST_OPT_NOT_BUCKETS || (pLength(pPoly) < MIN_LENGTH_BUCKET);
      CPolynomialSummator sum(GetBasering(), bUsePolynomial);
 
      if( iComponentMonom!=0 )
      {
        for(poly q = pPoly ; q!=NULL; q = p_LmDeleteAndNext(q, GetBasering()) )
        {
#ifdef PDEBUG
          {
            const int iComponent = p_GetComp(q, GetBasering());
            assume(iComponent == 0);
            if( iComponent!=0 )
            {
              Werror("MultiplyEPDestroy: both sides have non-zero components: %d and %d!\n", iComponent, iComponentMonom);
                // what should we do further?!?
              return NULL;
            }
          }
#endif
          sum += MultiplyET(expLeft, q);
        }
        poly t = sum; p_SetCompP(t, iComponentMonom, GetBasering());
        return t;
      } // iComponentMonom != 0!
      else
      { // iComponentMonom == 0!
        for(poly q = pPoly ; q!=NULL; q = p_LmDeleteAndNext(q, GetBasering()) )
        {
          const int iComponent = p_GetComp(q, GetBasering());
 
          poly t = MultiplyET(expLeft, q); // NO Component!!!
          p_SetCompP(t, iComponent, GetBasering());
          sum += t;
        }
        return sum;
      } // iComponentMonom == 0!
 
    }

MultiplyME()

poly CGlobalMultiplier::MultiplyME ( const poly  pMonom, const CExponent  expRight  )

virtual

Implements CMultiplier< poly >.

Definition at line 492 of file ncSAMult.cc.

{
#if OUTPUT
  PrintS("CGlobalMultiplier::MultiplyME(monom, expR)!");
  PrintLn();
  PrintS("Monom: "); p_Write(pMonom, GetBasering());
  PrintS("expR: "); p_Write(expRight, GetBasering());
#endif
 
  return MultiplyEE(pMonom, expRight);
}

MultiplyPE()

poly CGlobalMultiplier::MultiplyPE ( const poly  pPoly, const CExponent  expRight  )

inline

Definition at line 296 of file ncSAMult.h.

    {
      assume( pPoly != NULL );      assume( expRight != NULL );
      const int iComponentMonom = p_GetComp(expRight, GetBasering());
 
      bool bUsePolynomial = TEST_OPT_NOT_BUCKETS || (pLength(pPoly) < MIN_LENGTH_BUCKET);
      CPolynomialSummator sum(GetBasering(), bUsePolynomial);
 
 
      if( iComponentMonom!=0 )
      {
        for( poly q = pPoly; q !=NULL; q = pNext(q) )
        {
#ifdef PDEBUG
          {
            const int iComponent = p_GetComp(q, GetBasering());
            assume(iComponent == 0);
            if( iComponent!=0 )
            {
              Werror("MultiplyPE: both sides have non-zero components: %d and %d!\n", iComponent, iComponentMonom);
              // what should we do further?!?
              return NULL;
            }
 
          }
#endif
          sum += MultiplyTE(q, expRight); // NO Component!!!
        }
        poly t = sum; p_SetCompP(t, iComponentMonom, GetBasering());
        return t;
      } // iComponentMonom != 0!
      else
      { // iComponentMonom == 0!
        for( poly q = pPoly; q !=NULL; q = pNext(q) )
        {
          const int iComponent = p_GetComp(q, GetBasering());
 
#ifdef PDEBUG
          if( iComponent!=0 )
          {
            Warn("MultiplyPE: Multiplication in the left module from the right by component %d!\n", iComponent);
            // what should we do further?!?
          }
#endif
          poly t = MultiplyTE(q, expRight); // NO Component!!!
          p_SetCompP(t, iComponent, GetBasering());
          sum += t;
        }
        return sum;
      } // iComponentMonom == 0!
    }

MultiplyPEDestroy()

poly CGlobalMultiplier::MultiplyPEDestroy ( poly  pPoly, const CExponent  expRight  )

inline

Definition at line 393 of file ncSAMult.h.

    {
      assume( pPoly != NULL );      assume( expRight != NULL );
      const int iComponentMonom = p_GetComp(expRight, GetBasering());
 
      bool bUsePolynomial = TEST_OPT_NOT_BUCKETS || (pLength(pPoly) < MIN_LENGTH_BUCKET);
      CPolynomialSummator sum(GetBasering(), bUsePolynomial);
 
 
      if( iComponentMonom!=0 )
      {
        for(poly q = pPoly ; q!=NULL; q = p_LmDeleteAndNext(q, GetBasering()) )
        {
#ifdef PDEBUG
          {
            const int iComponent = p_GetComp(q, GetBasering());
            assume(iComponent == 0);
            if( iComponent!=0 )
            {
              Werror("MultiplyPEDestroy: both sides have non-zero components: %d and %d!\n", iComponent, iComponentMonom);
              // what should we do further?!?
              return NULL;
            }
 
          }
#endif
          sum += MultiplyTE(q, expRight); // NO Component!!!
        }
        poly t = sum; p_SetCompP(t, iComponentMonom, GetBasering());
        return t;
      } // iComponentMonom != 0!
      else
      { // iComponentMonom == 0!
        for(poly q = pPoly ; q!=NULL; q = p_LmDeleteAndNext(q, GetBasering()) )
        {
          const int iComponent = p_GetComp(q, GetBasering());
 
#ifdef PDEBUG
          if( iComponent!=0 )
          {
            Warn("MultiplyPEDestroy: Multiplication in the left module from the right by component %d!\n", iComponent);
            // what should we do further?!?
          }
#endif
          poly t = MultiplyTE(q, expRight); // NO Component!!!
          p_SetCompP(t, iComponent, GetBasering());
          sum += t;
        }
        return sum;
      } // iComponentMonom == 0!
 
    }

Field Documentation

m_powers

CPowerMultiplier* CGlobalMultiplier::m_powers

private

Definition at line 267 of file ncSAMult.h.

m_RingFormulaMultiplier

const CFormulaPowerMultiplier* CGlobalMultiplier::m_RingFormulaMultiplier

private

Definition at line 268 of file ncSAMult.h.

---

The documentation for this class was generated from the following files:

• libpolys/polys/nc/ncSAMult.h
• libpolys/polys/nc/ncSAMult.cc