1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
|
// Copyright 2004 Michael E. Stillman.
#ifndef _comp_gb_hpp_
#define _comp_gb_hpp_
#include "comp.hpp"
class buffer;
// The following are the return values from s_pair_step,
// These are used in GB_comp, GBinhom_comp
const int SPAIR_DONE = 0;
const int SPAIR_GB = 1;
const int SPAIR_SYZ = 2;
const int SPAIR_ZERO = 3;
const int SPAIR_MINGEN = 4;
const int SPAIR_GEN = 5;
const int SPAIR_PAIR = 6;
const int SPAIR_RING = 7;
const int SPAIR_REMOVED = 8;
const int SPAIR_DEFERRED = 9;
/**
@ingroup gb
@brief base class for Groebner basis computations.
*/
class GBComputation : public Computation
// This is the base type for all Groebner basis and syzygy computations
// Note: some abstract methods in Computation need also to be defined.
{
protected:
friend class GBProxy;
GBComputation() {}
//// bool stop_conditions_ok() override = 0;
// If the stop conditions in _Stop are inappropriate,
// return false, and use ERROR(...) to provide an error message.
public:
virtual ~GBComputation();
virtual void remove_gb() = 0; // Should free all space associated with GB
GBComputation *cast_to_GBComputation() override { return this; }
static GBComputation *choose_gb(const Matrix *m,
M2_bool collect_syz,
int n_rows_to_keep,
M2_arrayint gb_weights,
M2_bool use_max_degree,
int max_degree,
int algorithm,
int strategy,
int max_reduction_count = 10);
// Values for algorithm and strategy are documented in engine.h
// Returns NULL if an error occurs
virtual const Ring *get_ring() const = 0;
virtual Computation /* or null */ *set_hilbert_function(const RingElement *h);
// The default version returns an error saying that Hilbert functions cannot
// be used.
void start_computation() override = 0;
int complete_thru_degree() const override = 0;
// The computation is complete up through this degree.
// Recall that the status of the computation is maintained by the Computation
// class,
////////////////////////////////
// Results of the computation //
////////////////////////////////
virtual const Matrix /* or null */ *get_gb() = 0;
virtual const Matrix /* or null */ *get_mingens() = 0;
virtual const Matrix /* or null */ *get_change() = 0;
virtual const Matrix /* or null */ *get_syzygies() = 0;
virtual const Matrix /* or null */ *get_initial(int nparts) = 0;
virtual const Matrix /* or null */ *get_parallel_lead_terms(M2_arrayint w);
////////////////////////////////
// Normal forms and lifting ////
////////////////////////////////
virtual const Matrix /* or null */ *matrix_remainder(const Matrix *m) = 0;
virtual M2_bool matrix_lift(const Matrix *m,
const Matrix /* or null */ **result_remainder,
const Matrix /* or null */ **result_quotient) = 0;
virtual int contains(const Matrix *m) = 0;
//////////////////////////////////////
// Statistics and spair information //
//////////////////////////////////////
void text_out(buffer &o) const override;
// This displays statistical information, and depends on the
// M2_gbTrace value.
};
#endif
// Local Variables:
// compile-command: "make -C $M2BUILDDIR/Macaulay2/e "
// indent-tabs-mode: nil
// End:
|
