Changeset 260672 in git


Ignore:
Timestamp:
Feb 22, 2012, 9:52:58 PM (12 years ago)
Author:
Oleksandr Motsak <motsak@…>
Branches:
(u'fieker-DuVal', '117eb8c30fc9e991c4decca4832b1d19036c4c65')(u'spielwiese', 'c7af8613769b29c741d6c338945669719f1fc4f8')
Children:
dd156fc3fe4ce7e785c8c6aa066f73f3c887f9bb
Parents:
7729907f549543f553ed6efd161b1abbfd835b3c
git-author:
Oleksandr Motsak <motsak@mathematik.uni-kl.de>2012-02-22 21:52:58+01:00
git-committer:
Oleksandr Motsak <motsak@mathematik.uni-kl.de>2012-02-23 20:35:09+01:00
Message:
minor cleanup

chg: better indentation
chg: converted comments into doxygen documentation for some declaration
Location:
libpolys/polys/monomials
Files:
2 edited

Legend:

Unmodified
Added
Removed
  • libpolys/polys/monomials/p_polys.h

    r772990 r260672  
    8181unsigned long p_GetShortExpVector(poly a, const ring r);
    8282
    83 /* divisibility check over ground ring (which may contain zero divisors);
     83#ifdef HAVE_RINGS
     84/*! divisibility check over ground ring (which may contain zero divisors);
    8485   TRUE iff LT(f) divides LT(g), i.e., LT(f)*c*m = LT(g), for some
    8586   coefficient c and some monomial m;
    86    does not take components into account */
    87 #ifdef HAVE_RINGS
     87   does not take components into account
     88 */
    8889BOOLEAN p_DivisibleByRingCase(poly f, poly g, const ring r);
    8990#endif
     
    101102long p_DegW(poly p, const short *w, const ring R);
    102103
    103 // return TRUE if all monoms have the same component
     104/// return TRUE if all monoms have the same component
    104105BOOLEAN   p_OneComp(poly p, const ring r);
    105106
    106 // return i, if head depends only on var(i)
     107/// return i, if head depends only on var(i)
    107108int       p_IsPurePower(const poly p, const ring r);
    108109
    109 // return i, if poly depends only on var(i)
     110/// return i, if poly depends only on var(i)
    110111int       p_IsUnivariate(poly p, const ring r);
    111112
    112 // set entry e[i] to 1 if var(i) occurs in p, ignore var(j) if e[j]>0
    113 // return #(e[i]>0)
     113/// set entry e[i] to 1 if var(i) occurs in p, ignore var(j) if e[j]>0
     114/// return #(e[i]>0)
    114115int      p_GetVariables(poly p, int * e, const ring r);
    115116
    116 // returns the poly representing the integer i
     117/// returns the poly representing the integer i
    117118poly      p_ISet(int i, const ring r);
    118119
    119 // returns the poly representing the number n, destroys n
     120/// returns the poly representing the number n, destroys n
    120121poly      p_NSet(number n, const ring r);
    121122
  • libpolys/polys/monomials/ring.cc

    r772990 r260672  
    362362      for (i = 1; i<r->N; i++)
    363363      {
    364         for (j = i+1; j<=r->N; j++)
    365         {
    366           nl = n_IsOne(p_GetCoeff(MATELEM(r->GetNC()->C,i,j),r), r->cf);
    367           if ( (MATELEM(r->GetNC()->D,i,j)!=NULL) || (!nl) )
    368           {
     364        for (j = i+1; j<=r->N; j++)
     365        {
     366          nl = n_IsOne(p_GetCoeff(MATELEM(r->GetNC()->C,i,j),r), r->cf);
     367          if ( (MATELEM(r->GetNC()->D,i,j)!=NULL) || (!nl) )
     368          {
    369369            Print("\n//    %s%s=",r->names[j-1],r->names[i-1]);
    370370            pl = MATELEM(r->GetNC()->MT[UPMATELEM(i,j,r->N)],1,1);
Note: See TracChangeset for help on using the changeset viewer.