source: git/kernel/ratgring.h @ fbc7cb

jengelh-datetimespielwiese
Last change on this file since fbc7cb was a9c298, checked in by Hans Schoenemann <hannes@…>, 9 years ago
format stuff
  • Property mode set to 100644
File size: 3.9 KB
Line 
1#ifndef RATGRING_H
2#define RATGRING_H
3/****************************************
4*  Computer Algebra System SINGULAR     *
5****************************************/
6/*
7* ABSTRACT additional defines etc for --with-plural
8*/
9// #define HAVE_RATGRING to activate
10
11#ifdef HAVE_RATGRING
12#include <kernel/structs.h>
13#include <polys/nc/nc.h>
14
15/* MACROS */
16
17/* the part, related to the interface */
18
19/* ring nc_rCreateNCcomm(ring r); */
20
21void pLcmRat(poly a, poly b, poly m, int rat_shift);
22
23poly p_LcmRat(const poly a, const poly b, const long lCompM, const ring r);
24
25poly p_GetCoeffRat(poly p, int ishift, ring r);
26
27poly p_HeadRat(poly p, int ishift, ring r);
28
29void p_LmDeleteAndNextRat(poly *p, int ishift, ring r);
30
31void p_ExpVectorDiffRat(poly pr, poly p1, poly p2, int ishift, ring r);
32
33ideal ncGCD2(poly p, poly q, ring r); // real nc stuff
34
35ideal ncGCD(poly p, poly q, ring r); // for p,q from a commutative ring
36
37poly nc_rat_CreateSpoly(poly p1, poly p2, int ishift, ring r);
38
39poly nc_rat_ReduceSpolyNew(poly p1, poly p2, int ishift, ring r);
40
41
42/* poly functions defined in p_Procs : */
43// poly nc_pp_Mult_mm(poly p, poly m, const ring r, poly &last);
44// poly nc_p_Mult_mm(poly p, const poly m, const ring r);
45// poly nc_p_Minus_mm_Mult_qq(poly p, const poly m, poly q, const ring r);
46// poly nc_p_Minus_mm_Mult_qq_ign(poly p, const poly m, poly q, int & d1, poly d2, const ring ri, poly &d3);
47
48/* other routines we need in addition : */
49// poly nc_p_Mult_mm_Common(poly p, const poly m, int side, const ring r);
50// poly nc_mm_Mult_p(const poly m, poly p, const ring r);
51// poly nc_mm_Mult_nn (int *F, int *G, const ring r);
52// poly nc_mm_Mult_uu (int *F,int jG,int bG, const ring r);
53
54// /* subst: */
55// poly nc_pSubst(poly p, int n, poly e);
56
57// /* copy : */
58// poly nc_p_CopyGet(poly a, const ring r);
59// poly nc_p_CopyPut(poly a, const ring r);
60
61// /* syzygies : */
62// /* former nc_spGSpolyCreate */
63// poly nc_CreateSpoly(poly p1, poly p2, poly spNoether, const ring r);
64// /* former nc_spGSpolyRed */
65// poly nc_ReduceSpoly(poly p1, poly p2, poly spNoether, const ring r);
66// /* former nc_spGSpolyRedNew */
67// poly nc_ReduceSpolyNew(poly p1, poly p2, poly spNoether, const ring r);
68// /* former nc_spGSpolyRedTail */
69// void nc_ReduceSpolyTail(poly p1, poly q, poly q2, poly spNoether, const ring r);
70// /* former nc_spShort */
71// poly nc_CreateShortSpoly(poly p1, poly p2, const ring r=currRing);
72
73// ideal gr_bba (ideal F, ideal Q,kStrategy strat);
74
75// /* brackets: */
76// poly nc_p_Bracket_qq(poly p, poly q);
77// poly nc_mm_Bracket_nn(poly m1, poly m2);
78
79// /* twostd: */
80// ideal twostd(ideal I);
81// /* Ann: */
82// ideal Approx_Step(ideal L);
83
84// /* complete reduction routines */
85
86// /* void nc_kBucketPolyRed(kBucket_pt b, poly p); */
87// void nc_kBucketPolyRed(kBucket_pt b, poly p, number *c);
88// void nc_kBucketPolyRed_Z(kBucket_pt b, poly p, number *c);
89// void nc_PolyPolyRed(poly &b, poly p, number *c);
90
91// matrix nc_PrintMat(int a, int b, ring r, int metric);
92
93// poly p_CopyEmbed(poly p, ring srcRing, int shift, int par_shift);
94// poly pOppose(ring Rop, poly p);
95// ideal idOppose(ring Rop, ideal I);
96
97// #else
98// /* dummy definition to make gcc happy */
99// #define nc_kBucketPolyRed(A,B,C) 0
100// #define nc_PolyPolyRed(A,B,C) 0
101
102// return: FALSE, if there exists i in ishift..r->N,
103//                 such that a->exp[i] > b->exp[i]
104//         TRUE, otherwise
105BOOLEAN p_DivisibleByRat(poly a, poly b, int ishift, const ring r);
106
107/*2
108*reduces h with elements from reducer choosing the best possible
109* element in t with respect to the given red_length
110* arrays reducer and red_length are [0..(rl-1)]
111*/
112int redRat (poly* h,poly *reducer, int *red_length,int rl, int ishift, ring r);
113
114// Content stuff
115
116void pContentRat(poly &ph);
117
118BOOLEAN p_LmIsConstantRat(const poly p, const ring r);
119
120BOOLEAN p_LmIsConstantCompRat(const poly p, const ring r);
121
122BOOLEAN pCompareChainPart (poly p,poly p1,poly p2,poly lcm);
123
124#endif /* HAVE_PLURAL */
125#endif
Note: See TracBrowser for help on using the repository browser.