17 #ifndef SLICE_STRATEGY_GUARD 18 #define SLICE_STRATEGY_GUARD 38 virtual void run(
const Ideal& ideal) = 0;
57 virtual void freeSlice(auto_ptr<Slice> slice) = 0;
virtual bool getUseSimplification() const =0
This class represents a slice, which is the central data structure of the Slice Algorithm.
virtual void run(const Ideal &ideal)=0
Run the Slice algorithm.
Represents a monomial ideal with int exponents.
virtual bool processSlice(TaskEngine &tasks, auto_ptr< Slice > slice)=0
Process the parameter slice.
virtual void setUseIndependence(bool use)=0
This method should only be called before calling run().
virtual void setUseSimplification(bool use)=0
This method should only be called before calling run().
TaskEngine handles a list of tasks that are to be carried out.
virtual void freeSlice(auto_ptr< Slice > slice)=0
It is allowed to delete returned slices directly, but it is better to use freeSlice.
This class describes the interface of a strategy object for the Slice Algorithm.
Term represents a product of variables which does not include a coefficient.