HilbertSlice.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 HILBERT_SLICE_GUARD
#define HILBERT_SLICE_GUARD
 
#include "Slice.h"
#include "Term.h"
#include "Ideal.h"
 
class CoefTermConsumer;
class HilbertStrategy;
 
class HilbertSlice : public Slice {
 public:
  HilbertSlice(HilbertStrategy& strategy);
  HilbertSlice(HilbertStrategy& strategy,
               const Ideal& ideal,
               const Ideal& subtract,
               const Term& multiply,
               CoefTermConsumer* consumer);
 
  CoefTermConsumer* getConsumer() {return _consumer;}
 
  // *** Mutators
 
  virtual bool baseCase(bool simplified);
 
  virtual Slice& operator=(const Slice& slice);
 
  virtual bool simplifyStep();
 
  void setToProjOf(const Slice& slice,
                   const Projection& projection,
                   CoefTermConsumer* consumer);
 
  // Efficiently swaps the values of *this and slice while avoiding
  // copies.
  void swap(HilbertSlice& slice);
 
 private:
  // Returns a lower bound on the content of the slice. Returns false
  // if a base case is detected.
  virtual bool getLowerBound(Term& bound, size_t var) const;
 
  CoefTermConsumer* _consumer;
};
 
 
inline void swap(HilbertSlice& a, HilbertSlice& b) { a.swap(b); }
 
 
#endif