utilities.hpp

/*
    This file is part of the FAAST library.

    Copyright (c) 2009 Luca De Feo and Éric Schost.

    The most recent version of FAAST is available at http://www.lix.polytechnique.fr/~defeo/FAAST

    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; see file COPYING. If not, write to the Free Software
    Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301, USA.
*/
#ifndef UTILITIES_H_
#define UTILITIES_H_

#include <NTL/ZZ.h>
#include <cmath>
#include <vector>
#include <algorithm>
#include "Types.hpp"
#include "Exceptions.hpp"

namespace FAAST {
    void factor(long n, vector<pair<long,int> >& factors,
    const bool trial = true, const int multiplicity = 1);
    long NumPits(const long p, const long n);
    template <class T> void expand(typename T::GFpX& res,
    const typename T::GFpX& P, const long n);
    template <class T> void contract(typename T::GFpX& res,
    const typename T::GFpX& P, const long n);
    template <class T> void compose
    (typename T::GFpX& res, const typename T::GFpX& Q,
    const typename T::GFpX& R, const typename T::BigInt& p);
    template <class T> void cyclotomic
    (typename T::GFpX& res, const long n, const typename T::BigInt& p);

}

#endif /*UTILITIES_H_*/