/* Copyright (c) 1997-2010
   Ewgenij Gawrilow, Michael Joswig (Technische Universitaet Darmstadt, Germany)
   http://www.polymake.de

   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, or (at your option) any
   later version: http://www.gnu.org/licenses/gpl.txt.

   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.
--------------------------------------------------------------------------------
   $Project: polymake $$Id: Polynomial.cc 9494 2010-02-20 00:38:05Z gawrilow $
*/

#define DIMENSION_CHECKS 1

#include <polymake.h>
#include <Polynomial.h>
#include <Rational.h>
#include <Ring.h>
#include <Matrix.h>
#include <Array.h>
#include <Integer.h>

namespace polymake { namespace common {
///==== Automatically generated contents follow.    Please do not delete this line. ====
   template <typename T0, typename T1>
   FunctionInterface4perl( new_X, T0,T1 ) {
      perl::Value arg0(stack[1]);
      WrapperReturnNew(T0, (arg0.get<T1>()) );
   };

   template <typename T0>
   FunctionInterface4perl( new, T0 ) {
      WrapperReturnNew(T0, () );
   };

   template <typename T0, typename T1, typename T2, typename T3>
   FunctionInterface4perl( new_X_X_X, T0,T1,T2,T3 ) {
      perl::Value arg0(stack[1]), arg1(stack[2]), arg2(stack[3]);
      WrapperReturnNew(T0, (arg0.get<T1>(), arg1.get<T2>(), arg2.get<T3>()) );
   };

   Class4perl("Polymake::common::Polynomial_A_Rational_I_Int_Z", Polynomial< Rational, int >);
   ClassTemplate4perl("Polymake::common::Polynomial");
   FunctionInstance4perl(new_X_X_X, Polynomial< Rational, int >, perl::Canned< const Matrix< int > >, perl::TryCanned< const Array< int > >, perl::Canned< const Ring< Rational, int > >);
   OperatorInstance4perl(Binary_add, perl::Canned< const Polynomial< Rational, int > >, int);
   OperatorInstance4perl(Binary_add, perl::Canned< const Polynomial< Rational, int > >, perl::Canned< const Rational >);
   OperatorInstance4perl(Binary_sub, perl::Canned< const Polynomial< Rational, int > >, int);
   OperatorInstance4perl(Binary_add, perl::Canned< const Polynomial< Rational, int > >, perl::Canned< const Polynomial< Rational, int > >);
   OperatorInstance4perl(Binary_mul, perl::Canned< const Polynomial< Rational, int > >, perl::Canned< const Polynomial< Rational, int > >);
   FunctionInstance4perl(new, Polynomial< Rational, int >);
   OperatorInstance4perl(Binary__eq, perl::Canned< const Polynomial< Rational, int > >, perl::Canned< const Polynomial< Rational, int > >);
   Class4perl("Polymake::common::Polynomial_A_UniPolynomial_A_Rational_I_Int_Z_I_Rational_Z", Polynomial< UniPolynomial< Rational, int >, Rational >);
   FunctionInstance4perl(new, Polynomial< UniPolynomial< Rational, int >, Rational >);
   OperatorInstance4perl(Binary__eq, perl::Canned< const Polynomial< UniPolynomial< Rational, int >, Rational > >, perl::Canned< const Polynomial< UniPolynomial< Rational, int >, Rational > >);
   OperatorInstance4perl(Binary_mul, int, perl::Canned< const Polynomial< Rational, int > >);
   OperatorInstance4perl(Binary_add, perl::Canned< const Polynomial< Rational, int > >, perl::Canned< const Monomial< Rational, int > >);
   Class4perl("Polymake::common::Polynomial_A_Rational_I_Integer_Z", Polynomial< Rational, Integer >);
   DisabledFunction4perl(new_X, Polynomial< Rational, Integer >, perl::Canned< const Polynomial< Rational, int > >);
   OperatorInstance4perl(assign, Polynomial< Rational, Integer >, perl::Canned< const Polynomial< Rational, int > >);
   OperatorInstance4perl(Binary_mul, perl::Canned< const Polynomial< Rational, int > >, int);
///==== Automatically generated contents end here.  Please do not delete this line. ====
} }
