source: git/libpolys/polys/simpleideals.h @ 76fead

spielwiese
Last change on this file since 76fead was 7829fb, checked in by Oleksandr Motsak <motsak@…>, 13 years ago
ADD: trying to solve circular dependencies due to matrix
  • Property mode set to 100644
File size: 3.5 KB
Line 
1#ifndef SIMPLEIDEALS_H
2#define SIMPLEIDEALS_H
3/****************************************
4*  Computer Algebra System SINGULAR     *
5****************************************/
6/* $Id$ */
7/*
8* ABSTRACT - all basic methods to manipulate ideals
9*/
10#include <omalloc/omalloc.h>
11#include <polys/monomials/ring.h>
12#include <polys/matpol.h>
13
14struct sip_sideal
15{
16  poly*  m;
17  long rank;
18  int nrows;
19  int ncols;
20  #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
25};
26
27struct sip_smap
28{
29  poly *m;
30  char *preimage;
31  int nrows;
32  int ncols;
33};
34
35struct sideal_list;
36typedef struct sideal_list *      ideal_list;
37
38struct sideal_list
39{
40  ideal_list next;
41  ideal      d;
42#ifndef NDEBUG
43  int nr;
44#endif
45};
46
47extern omBin sip_sideal_bin;
48
49/*- creates an ideal -*/
50ideal idInit (int size, int rank=1);
51
52/*- deletes an ideal -*/
53void id_Delete (ideal* h, ring r);
54void id_ShallowDelete (ideal* h, ring r);
55void idSkipZeroes (ideal ide);
56  /*gives an ideal the minimal possible size*/
57
58#ifdef PDEBUG
59void id_DBTest(ideal h1, int level, const char *f,const int l, const ring r);
60#define id_Test(A, r) id_DBTest(A, PDEBUG, __FILE__,__LINE__, r)
61// #define id_Print(id, r) id_Show(id, r)
62#else
63#define id_Test(A, r)  (TRUE)
64// #define id_Print(A, r) ((void)0)
65#endif
66
67ideal id_Copy (ideal h1,const ring r);
68
69  /*adds two ideals without simplifying the result*/
70ideal id_SimpleAdd (ideal h1,ideal h2, const ring r);
71  /*adds the quotient ideal*/
72ideal id_Add (ideal h1,ideal h2,const ring r);
73  /* h1 + h2 */
74
75ideal id_Power(ideal given,int exp, const ring r);
76BOOLEAN idIs0 (ideal h);
77
78long id_RankFreeModule(ideal m, ring lmRing, ring tailRing);
79static inline long id_RankFreeModule(ideal m, ring r)
80{return id_RankFreeModule(m, r, r);}
81// returns TRUE, if idRankFreeModule(m) > 0
82BOOLEAN id_IsModule(ideal m, ring r);
83ideal   id_FreeModule (int i, const ring r);
84int     idElem(const ideal F);
85int id_PosConstant(ideal id, const ring r);
86ideal id_Head(ideal h,const ring r);
87ideal id_MaxIdeal (const ring r);
88ideal id_MaxIdeal(int deg, const ring r);
89ideal id_CopyFirstK (const ideal ide, const int k,const ring r);
90void id_DelMultiples(ideal id, const ring r);
91void id_Norm(ideal id, const ring r);
92void id_DelEquals(ideal id, const ring r);
93void id_DelLmEquals(ideal id, const ring r);
94void id_DelDiv(ideal id, const ring r);
95BOOLEAN id_IsConstant(ideal id, const ring r);
96intvec *id_Sort(ideal id,BOOLEAN nolex, const ring r);
97ideal id_Transp(ideal a, const ring rRing);
98void id_Compactify(ideal id, const ring r);
99ideal  id_Mult (ideal h1,ideal  h2, const ring r);
100ideal id_Homogen(ideal h, int varnum,const ring r);
101BOOLEAN id_HomIdeal (ideal id, ideal Q, const ring r);
102BOOLEAN id_HomModule(ideal m, ideal Q, intvec **w, const ring R);
103BOOLEAN id_IsZeroDim(ideal I, const ring r);
104ideal id_Jet(ideal i,int d, const ring R);
105ideal id_JetW(ideal i,int d, intvec * iv, const ring R);
106ideal  id_Subst(ideal id, int n, poly e, const ring r);
107matrix id_Module2Matrix(ideal mod, const ring R);
108matrix id_Module2formatedMatrix(ideal mod,int rows, int cols, const ring R);
109ideal id_Matrix2Module(matrix mat, const ring R);
110ideal id_Vec2Ideal(poly vec, const ring R);
111
112
113int     binom (int n,int r);
114
115  /*- verschiebt die Indizes der Modulerzeugenden um i -*/
116void    idInitChoise (int r,int beg,int end,BOOLEAN *endch,int * choise);
117void    idGetNextChoise (int r,int end,BOOLEAN *endch,int * choise);
118int     idGetNumberOfChoise(int t, int d, int begin, int end, int * choise);
119
120#endif
Note: See TracBrowser for help on using the repository browser.