UnivariatePolynomialSet.h

Go to the documentation of this file.

/*
 * GiNaCRA - GiNaC Real Algebra package
 * Copyright (C) 2010-2012  Ulrich Loup, Joachim Redies, Sebastian Junges
 *
 * This file is part of GiNaCRA.
 *
 * GiNaCRA 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 3 of the License, or
 * (at your option) any later version.
 *
 * GiNaCRA 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 GiNaCRA.  If not, see <http://www.gnu.org/licenses/>.
 *
 */


#ifndef GINACRA_UNIVARIATEPOLYNOMIALSET_H
#define GINACRA_UNIVARIATEPOLYNOMIALSET_H

#include <unordered_set>
#include <ginac/ginac.h>
#include "UnivariatePolynomial.h"

using std::unordered_set;
using std::pair;
using std::cout;
using std::endl;

namespace GiNaCRA
{
    struct UnivariatePolynomialSetHasher
    {
        size_t operator ()( const UnivariatePolynomial& p ) const
        {
            return p.gethash();
        }
    };

    struct UnivariatePolynomialSetEquals
    {
        bool operator ()( const UnivariatePolynomial& p, const UnivariatePolynomial& q ) const
        {
            return p.isEqual( q );
        }
    };

    class UnivariatePolynomialSet:
        public std:: unordered_set<UnivariatePolynomial, UnivariatePolynomialSetHasher, UnivariatePolynomialSetEquals>
    {
        public:

            // Con- and destructors //

            UnivariatePolynomialSet(){}

            template<class InputIterator>
            UnivariatePolynomialSet( InputIterator first, InputIterator last ):
                std::unordered_set<UnivariatePolynomial, UnivariatePolynomialSetHasher, UnivariatePolynomialSetEquals>( first, last )
            {}

            // Selectors //

            const bool isConstant( symbol& x ) const;

            const symbol variable() const;

            // Modifiers //

            pair<UnivariatePolynomialSet::iterator, bool> insert( const UnivariatePolynomial& x ) throw ( invalid_argument );

            template<class InputIterator>
            void insert( InputIterator first, InputIterator last ) throw ( invalid_argument );

            void removeNumbers();

            const UnivariatePolynomialSet makePrimitive();
    };

}    // namespace GiNaC

#endif