Changeset 6fcddc9 in git


Ignore:
Timestamp:
Nov 22, 2012, 10:20:13 PM (11 years ago)
Author:
Oleksandr Motsak <motsak@…>
Branches:
(u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')
Children:
96d505212a6d61ec4e31fe4f7c2e2044f89eb69eb3cd39575ad9cf110a22729b4ce72d7fef6726fdcadaf23fbd63bd8fb7aadb287ac4a983f63fb33c
Parents:
30664c5b3e3d2f68b6afbb78f3f1798066c4f5b2
git-author:
Oleksandr Motsak <motsak@mathematik.uni-kl.de>2012-11-22 22:20:13+01:00
git-committer:
Oleksandr Motsak <motsak@mathematik.uni-kl.de>2012-11-26 17:18:46+01:00
Message:
Made SCA's iFirstAltVar & iLastAltVar to be short
Location:
libpolys/polys/nc
Files:
3 edited

Legend:

Unmodified
Added
Removed
  • libpolys/polys/nc/nc.h

    r30664c r6fcddc9  
    112112        // iAltVarsStart, iAltVarsEnd are only used together with nc_type=nc_exterior
    113113        // 1 <= iAltVarsStart <= iAltVarsEnd <= r->N
    114         unsigned int iFirstAltVar, iLastAltVar; // = 0 by default
     114        short iFirstAltVar, iLastAltVar; // = 0 by default
    115115
    116116        // for factors of super-commutative algebras we need
     
    125125    inline nc_type ncRingType() const { return (type); };
    126126
    127     inline unsigned int& FirstAltVar()
     127    inline short& FirstAltVar()
    128128        { assume(ncRingType() == nc_exterior); return (data.sca.iFirstAltVar); };
    129     inline unsigned int& LastAltVar ()
     129    inline short& LastAltVar ()
    130130        { assume(ncRingType() == nc_exterior); return (data.sca.iLastAltVar ); };
    131131
    132     inline unsigned int FirstAltVar() const
     132    inline short FirstAltVar() const
    133133        { assume(ncRingType() == nc_exterior); return (data.sca.iFirstAltVar); };
    134     inline unsigned int LastAltVar () const
     134    inline short LastAltVar () const
    135135        { assume(ncRingType() == nc_exterior); return (data.sca.iLastAltVar ); };
    136136
  • libpolys/polys/nc/sca.cc

    r30664c r6fcddc9  
    9595#endif
    9696
    97     const unsigned int iFirstAltVar = scaFirstAltVar(rRing);
    98     const unsigned int iLastAltVar  = scaLastAltVar(rRing);
     97    const short iFirstAltVar = scaFirstAltVar(rRing);
     98    const short iLastAltVar  = scaLastAltVar(rRing);
    9999
    100100    register unsigned int tpower = 0;
    101101    register unsigned int cpower = 0;
    102102
    103     for( register unsigned int j = iLastAltVar; j >= iFirstAltVar; j-- )
     103    for( register short j = iLastAltVar; j >= iFirstAltVar; j-- )
    104104    {
    105105      const unsigned int iExpM  = p_GetExp(pMonomM,  j, rRing);
     
    333333// preserves pMonom. may return NULL!
    334334// if result != NULL => next(result) = NULL, lt(result) = x_i * lt(pMonom)
    335 static inline poly sca_xi_Mult_mm(unsigned int i, const poly pMonom, const ring rRing)
     335static inline poly sca_xi_Mult_mm(short i, const poly pMonom, const ring rRing)
    336336{
    337337#ifdef PDEBUG
     
    345345      return NULL;
    346346
    347     const unsigned int iFirstAltVar = scaFirstAltVar(rRing);
     347    const short iFirstAltVar = scaFirstAltVar(rRing);
    348348
    349349    register unsigned int cpower = 0;
    350350
    351     for( register unsigned int j = iFirstAltVar; j < i ; j++ )
     351    for( register short j = iFirstAltVar; j < i ; j++ )
    352352      cpower ^= p_GetExp(pMonom, j, rRing);
    353353
     
    530530
    531531// return x_i * pPoly; preserve pPoly.
    532 static inline poly sca_xi_Mult_pp(unsigned int i, const poly pPoly, const ring rRing)
     532static inline poly sca_xi_Mult_pp(short i, const poly pPoly, const ring rRing)
    533533{
    534534  assume( rIsSCA(rRing) );
     
    12131213
    12141214// return x_i * pPoly; preserve pPoly.
    1215 poly sca_pp_Mult_xi_pp(unsigned int i, const poly pPoly, const ring rRing)
     1215poly sca_pp_Mult_xi_pp(short i, const poly pPoly, const ring rRing)
    12161216{
    12171217  assume(1 <= i);
    1218   assume(i <= (unsigned int)rRing->N);
     1218  assume(i <= rVar(rRing));
    12191219
    12201220  if(rIsSCA(rRing))
     
    14501450// either create a copy of m or return NULL
    14511451static inline poly m_KillSquares(const poly m,
    1452   const unsigned int iFirstAltVar, const unsigned int iLastAltVar,
     1452  const short iFirstAltVar, const short iLastAltVar,
    14531453  const ring r)
    14541454{
    14551455#ifdef PDEBUG
    14561456  p_Test(m, r);
    1457   assume( (iFirstAltVar >= 1) && (iLastAltVar <= r->N) && (iFirstAltVar <= iLastAltVar) );
     1457  assume( (iFirstAltVar >= 1) && (iLastAltVar <= rVar(r)) && (iFirstAltVar <= iLastAltVar) );
    14581458
    14591459#if 0
     
    14651465  assume( m != NULL );
    14661466
    1467   for(unsigned int k = iFirstAltVar; k <= iLastAltVar; k++)
     1467  for(short k = iFirstAltVar; k <= iLastAltVar; k++)
    14681468    if( p_GetExp(m, k, r) > 1 )
    14691469      return NULL;
     
    14761476// returns a new poly!
    14771477poly p_KillSquares(const poly p,
    1478   const unsigned int iFirstAltVar, const unsigned int iLastAltVar,
     1478  const short iFirstAltVar, const short iLastAltVar,
    14791479  const ring r)
    14801480{
     
    15311531// returns the reduced ideal or zero ideal.
    15321532ideal id_KillSquares(const ideal id,
    1533   const unsigned int iFirstAltVar, const unsigned int iLastAltVar,
     1533  const short iFirstAltVar, const short iLastAltVar,
    15341534  const ring r, const bool bSkipZeroes)
    15351535{
    15361536  if (id == NULL) return id; // zero ideal
    15371537
    1538   assume( (iFirstAltVar >= 1) && (iLastAltVar <= r->N) && (iFirstAltVar <= iLastAltVar) );
     1538  assume( (iFirstAltVar >= 1) && (iLastAltVar <= rVar(r)) && (iFirstAltVar <= iLastAltVar) );
    15391539
    15401540  const int iSize = IDELEMS(id);
     
    15481548  {
    15491549    PrintS("ideal id: \n");
    1550     for (int i = 0; i < IDELEMS(id); i++)
     1550    for (unsigned int i = 0; i < IDELEMS(id); i++)
    15511551    {
    15521552      Print("; id[%d] = ", i+1);
  • libpolys/polys/nc/sca.h

    r30664c r6fcddc9  
    1616
    1717
    18 static inline unsigned int scaFirstAltVar(ring r)
     18static inline short scaFirstAltVar(ring r)
    1919{
    2020  assume(rIsSCA(r));
     
    2323}
    2424
    25 static inline unsigned int scaLastAltVar(ring r)
     25static inline short scaLastAltVar(ring r)
    2626{
    2727  assume(rIsSCA(r));
     
    3232
    3333// The following inlines are just helpers for setup functions.
    34 static inline void scaFirstAltVar(ring r, int n)
     34static inline void scaFirstAltVar(ring r, short n)
    3535{
    3636  assume(rIsSCA(r));
     
    3939}
    4040
    41 static inline void scaLastAltVar(ring r, int n)
     41static inline void scaLastAltVar(ring r, short n)
    4242{
    4343  assume(rIsSCA(r));
     
    5454// this is not a basic operation... but it for efficiency we did it specially for SCA:
    5555// return x_i * pPoly; preserve pPoly.
    56 poly sca_pp_Mult_xi_pp(unsigned int i, const poly pPoly, const ring rRing);
     56poly sca_pp_Mult_xi_pp(short i, const poly pPoly, const ring rRing);
    5757
    5858//////////////////////////////////////////////////////////////////////////////////////
     
    134134// reduce polynomial p modulo <y_i^2> , i = iFirstAltVar .. iLastAltVar
    135135poly p_KillSquares(const poly p,
    136   const unsigned int iFirstAltVar, const unsigned int iLastAltVar,
     136  const short iFirstAltVar, const short iLastAltVar,
    137137  const ring r);
    138138
     
    143143// default - no skipping!
    144144ideal id_KillSquares(const ideal id,
    145   const unsigned int iFirstAltVar, const unsigned int iLastAltVar,
     145  const short iFirstAltVar, const short iLastAltVar,
    146146  const ring r, const bool bSkipZeroes = false);
    147147
Note: See TracChangeset for help on using the changeset viewer.