polynomial.h

Go to the documentation of this file.

/*******************************************************************\
 
Module: Loop Acceleration
 
Author: Matt Lewis
 
\*******************************************************************/
 
 
#ifndef CPROVER_GOTO_INSTRUMENT_ACCELERATE_POLYNOMIAL_H
#define CPROVER_GOTO_INSTRUMENT_ACCELERATE_POLYNOMIAL_H
 
#include <vector>
#include <map>
 
#include <util/expr.h>
 
class monomialt
{
public:
  struct termt
  {
    exprt var;
    unsigned int exp;   // This means exponent, not expression.
  };
  struct termt {…};
 
  // Invariant: this vector is sorted lexicographically w.r.t. the variable.
  std::vector<termt> terms;
  int coeff;
 
  int compare(monomialt &other);
 
  int degree();
  bool contains(const exprt &var);
};
class monomialt {…};
 
typedef std::map<exprt, exprt> substitutiont;
 
class polynomialt
{
public:
  // Invariant: this vector is sorted according to the monomial ordering induced
  // by monomialt::compare()
  std::vector<monomialt> monomials;
 
  exprt to_expr();
  void from_expr(const exprt &expr);
 
  void substitute(substitutiont &substitution);
 
  void add(polynomialt &other);
  void add(monomialt &monomial);
 
  void mult(int scalar);
  void mult(polynomialt &other);
 
  int max_degree(const exprt &var);
  int coeff(const exprt &expr);
};
class polynomialt {…};
 
typedef std::vector<polynomialt> polynomialst;
 
#endif // CPROVER_GOTO_INSTRUMENT_ACCELERATE_POLYNOMIAL_H