Slice.h

Go to the documentation of this file.

/* Frobby: Software for monomial ideal computations.
   Copyright (C) 2007 Bjarke Hammersholt Roune (www.broune.com)
 
   This program is free software; you can redistribute it and/or modify
   it under the terms of the GNU General Public License as published by
   the Free Software Foundation; either version 2 of the License, or
   (at your option) any later version.
 
   This program is distributed in the hope that it will be useful,
   but WITHOUT ANY WARRANTY; without even the implied warranty of
   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
   GNU General Public License for more details.
 
   You should have received a copy of the GNU General Public License
   along with this program.  If not, see http://www.gnu.org/licenses/.
*/
#ifndef SLICE_GUARD
#define SLICE_GUARD
 
#include "Ideal.h"
#include "Term.h"
#include "Task.h"
 
class Projection;
class SliceStrategy;
 
class Slice : public Task {
 public:
  Slice(SliceStrategy& strategy);
 
  Slice(SliceStrategy& strategy,
        const Ideal& ideal, const Ideal& subtract, const Term& multiply);
 
  virtual ~Slice();
 
 
  size_t getVarCount() const {return _varCount;}
 
  const Ideal& getIdeal() const {return _ideal;}
 
  Ideal& getSubtract() {return _subtract;}
 
  const Ideal& getSubtract() const {return _subtract;}
 
  Term& getMultiply() {return _multiply;}
 
  const Term& getMultiply() const {return _multiply;}
 
  const Term& getLcm() const;
 
  void print(FILE* file) const;
 
 
 
  virtual bool baseCase(bool simplified) = 0;
 
  virtual Slice& operator=(const Slice& slice) = 0;
 
  void resetAndSetVarCount(size_t varCount);
 
  void clearIdealAndSubtract();
 
  void singleDegreeSortIdeal(size_t var);
 
  virtual bool innerSlice(const Term& pivot);
 
  virtual void outerSlice(const Term& pivot);
 
  bool normalize();
 
  bool adjustMultiply();
 
  virtual bool simplify();
 
  virtual bool simplifyStep() = 0;
 
 
  virtual void run(TaskEngine& tasks);
  virtual void dispose();
 
 protected:
  void setToProjOf(const Slice& slice, const Projection& projection);
 
  void swap(Slice& slice);
 
  bool pruneSubtract();
 
  bool applyLowerBound();
 
  virtual bool getLowerBound(Term& bound, size_t var) const = 0;
 
  Ideal _ideal;
 
  Ideal _subtract;
 
  Term _multiply;
 
  size_t _varCount;
 
  mutable Term _lcm;
 
  mutable bool _lcmUpdated;
 
  size_t _lowerBoundHint;
 
  SliceStrategy& _strategy;
};
 
#endif