BWAPI: SPAR/AIModule/BWTA/vendors/CGAL/CGAL/Polynomial/modular

Go to the documentation of this file.
00001 // Copyright (c) 2002-2008 Max-Planck-Institute Saarbruecken (Germany)
00002 //
00003 // This file is part of CGAL (www.cgal.org); you can redistribute it and/or
00004 // modify it under the terms of the GNU Lesser General Public License as
00005 // published by the Free Software Foundation; version 2.1 of the License.
00006 // See the file LICENSE.LGPL distributed with CGAL.
00007 //
00008 // Licensees holding a valid commercial license may use this file in
00009 // accordance with the commercial license agreement provided with the software.
00010 //
00011 // This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
00012 // WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
00013 //
00014 // $URL: svn+ssh://scm.gforge.inria.fr/svn/cgal/branches/CGAL-3.5-branch/Polynomial/include/CGAL/Polynomial/modular_gcd.h $
00015 // $Id: modular_gcd.h 47311 2008-12-09 13:28:13Z hemmer $
00016 //
00017 //
00018 //Author(s) : Michael Hemmer <mhemmer@uni-mainz.de>
00019 
00025 #ifndef CGAL_POLYNOMIAL_MODULAR_GCD_H
00026 #define CGAL_POLYNOMIAL_MODULAR_GCD_H 1
00027 
00028 #include <CGAL/basic.h>
00029 #include <CGAL/Residue.h>
00030 #include <CGAL/Polynomial.h>
00031 #include <CGAL/Scalar_factor_traits.h>
00032 #include <CGAL/Chinese_remainder_traits.h>
00033 #include <CGAL/Polynomial/modular_gcd_utcf_dfai.h>
00034 #include <CGAL/Polynomial/modular_gcd_utcf_algorithm_M.h>
00035 // #include <CGAL/Polynomial/modular_gcd_utcf_with_wang.h>
00036 // #include <CGAL/Polynomial/modular_gcd_utcf_pure_wang.h>
00037 
00038 
00039 namespace CGAL {
00040 namespace CGALi {
00041 
00042 template <class NT> 
00043 Polynomial<NT> modular_gcd_utcf(
00044         const Polynomial<NT>& FF1 ,
00045         const Polynomial<NT>& FF2 , Integral_domain_tag){
00046     return modular_gcd_utcf_dfai(FF1, FF2);
00047 }
00048 
00049 template <class NT> 
00050 Polynomial<NT> modular_gcd_utcf(
00051         const Polynomial<NT>& FF1 ,
00052         const Polynomial<NT>& FF2 , Unique_factorization_domain_tag){
00053     return modular_gcd_utcf_algorithm_M(FF1, FF2);
00054 }
00055 
00056 }// namespace CGALi
00057 }
00058 
00059 #endif //#ifndef CGAL_POLYNOMIAL_MODULAR_GCD_H 1
00060