Changeset 9b3700 in git for libpolys/coeffs/coeffs.h


Ignore:
Timestamp:
Jul 20, 2011, 4:46:43 PM (13 years ago)
Author:
mlee <martinlee84@…>
Branches:
(u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')
Children:
48cf05bb3d2a2234c35b5e4f732668df3b3df5c8
Parents:
2cbef915697324ddbff28f775df52a7ee954c3ad
git-author:
mlee <martinlee84@web.de>2011-07-20 16:46:43+02:00
git-committer:
Mohamed Barakat <mohamed.barakat@rwth-aachen.de>2011-11-09 12:52:44+01:00
Message:
added n_ExtGcd, n_IntMod and n_DivComp to coeffs.h
added currRing, currRing->cf at appropiate places in kutil.cc
File:
1 edited

Legend:

Unmodified
Added
Removed
  • libpolys/coeffs/coeffs.h

    r2cbef9 r9b3700  
    342342{ assume(r != NULL); assume(r->cfIsUnit!=NULL); return r->cfIsUnit(n,r); }
    343343
     344static inline number n_ExtGcd(number a, number b, number *s, number *t, const coeffs r)
     345{ assume(r != NULL); assume(r->cfExtGcd!=NULL); return r->cfExtGcd (a,b,s,t,r); }
     346
     347static inline int n_DivComp(number a, number b, const coeffs r)
     348{ assume(r != NULL); assume(r->cfDivComp!=NULL); return r->cfDivComp (a,b,r); }
     349
    344350/// in Z: 1
    345351/// in Z/kZ (where k is not a prime): largest divisor of n (taken in Z) that
     
    443449{ assume(r != NULL); assume(r->cfIntDiv!=NULL); return r->cfIntDiv(a,b,r); }
    444450
     451static inline number n_IntMod(number a, number b, const coeffs r)
     452{ assume(r != NULL); assume(r->cfIntMod!=NULL); return r->cfIntMod(a,b,r); }
    445453/// @todo: Describe me!!!
    446454///
Note: See TracChangeset for help on using the changeset viewer.