Changeset 028192 in git for libpolys/polys/ideals.h


Ignore:
Timestamp:
Mar 31, 2011, 7:37:45 PM (13 years ago)
Author:
Oleksandr Motsak <motsak@…>
Branches:
(u'spielwiese', '4a9821a93ffdc22a6696668bd4f6b8c9de3e6c5f')
Children:
ccd3333fa9eb4f770c3cca33d5e125c9565938ec
Parents:
3f2fb2cdc5019bbfc97d4fa27121402be181a8a3
git-author:
Oleksandr Motsak <motsak@mathematik.uni-kl.de>2011-03-31 19:37:45+02:00
git-committer:
Mohamed Barakat <mohamed.barakat@rwth-aachen.de>2011-11-09 12:04:17+01:00
Message:
FIX: p_polys.cc, ring.cc (mostly NC-stuff + ideals/matrices/numbers)
File:
1 edited

Legend:

Unmodified
Added
Removed
  • libpolys/polys/ideals.h

    r3f2fb2 r028192  
    88* ABSTRACT - all basic methods to manipulate ideals
    99*/
    10 #include <kernel/structs.h>
    11 #include <kernel/ring.h>
     10// #include <kernel/structs.h>
     11
     12#include <polys/monomials/ring.h>
    1213
    1314struct sip_sideal
     
    1819  int ncols;
    1920  #define IDELEMS(i) ((i)->ncols)
     21  #define MATCOLS(i) ((i)->ncols)
     22  #define MATROWS(i) ((i)->nrows)
     23  #define MATELEM(mat,i,j) ((mat)->m)[MATCOLS((mat)) * ((i)-1) + (j)-1]
     24   
    2025};
    2126
     
    2833};
    2934
     35class ip_smatrix;
     36typedef ip_smatrix *       matrix;
     37
    3038struct sideal_list;
    3139typedef struct sideal_list *      ideal_list;
     40
    3241struct sideal_list
    3342{
     
    5160
    5261/// delete an ideal
    53 #define idDelete(h) id_Delete(h, currRing)
     62// #define idDelete(h) id_Delete(h, currRing)
    5463void id_Delete (ideal* h, ring r);
    5564void id_ShallowDelete (ideal* h, ring r);
     
    92101
    93102ideal id_Copy (ideal h1,const ring r);
    94 #define idCopy(A) id_Copy(A,currRing)
     103#ifdef PDEBUG
     104ideal idDBCopy(ideal h1,const char *f,int l,const ring r);
     105#define id_DBCopy(A,r) idDBCopy(A,__FILE__,__LINE__,r)
     106#define idCopy(A,r) id_DBCopy(A,r)
     107#else
     108#define idCopy(A,r) id_Copy(A,r)
     109#endif
     110
     111
    95112  /*adds two ideals without simplifying the result*/
    96113ideal idSimpleAdd (ideal h1,ideal h2);
     
    109126
    110127long idRankFreeModule(ideal m, ring lmRing, ring tailRing);
    111 inline long idRankFreeModule(ideal m, ring r = currRing)
    112 {return idRankFreeModule(m, r, r);}
     128
     129static inline long idRankFreeModule(ideal m, ring r){ return idRankFreeModule(m, r, r); }
     130
    113131// returns TRUE, if idRankFreeModule(m) > 0
    114 BOOLEAN idIsModule(ideal m, ring r = currRing);
     132BOOLEAN idIsModule(ideal m, const ring r);
    115133BOOLEAN idHomIdeal (ideal id, ideal Q=NULL);
    116134BOOLEAN idHomModule(ideal m, ideal Q,intvec **w);
     
    195213ideal   idTransp(ideal a);
    196214// version of "ideal idTransp(ideal)" which works within a given ring.
    197 ideal id_Transp(ideal a, const ring rRing = currRing);
     215ideal id_Transp(ideal a, const ring rRing);
    198216
    199217intvec *idQHomWeight(ideal id);
     
    209227ideal idFarey(ideal x, number N);
    210228
    211 ideal id_TensorModuleMult(const int m, const ideal M, const ring rRing = currRing); // image of certain map for BGG
     229ideal id_TensorModuleMult(const int m, const ideal M, const ring rRing); // image of certain map for BGG
    212230
    213231#ifdef PDEBUG
    214232/* Shows an ideal -- only for debugging */
    215 void idShow(const ideal id, const ring lmRing = currRing, const ring tailRing = currRing, const int debugPrint = 0);
     233void idShow(const ideal id, const ring lmRing, const ring tailRing, const int debugPrint = 0);
    216234#else
    217235#define idShow(id, lmRing, tailRing, debugPrint) ((void)0)
Note: See TracChangeset for help on using the changeset viewer.