mirror of https://github.com/CGAL/cgal
59 lines
1.5 KiB
C++
59 lines
1.5 KiB
C++
// Copyright (c) 2008 Max-Planck-Institute Saarbruecken (Germany)
|
|
//
|
|
// This file is part of CGAL (www.cgal.org)
|
|
//
|
|
// $URL$
|
|
// $Id$
|
|
// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
|
|
//
|
|
//
|
|
// Author(s) : Michael Hemmer <mhemmer@uni-mainz.de>
|
|
//
|
|
// ============================================================================
|
|
|
|
#ifndef CGAL_POLYNOMIAL_CACHED_EXTENDED_EUCLIDEAN_ALGORITHM_H
|
|
#define CGAL_POLYNOMIAL_CACHED_EXTENDED_EUCLIDEAN_ALGORITHM_H
|
|
|
|
#include <CGAL/basic.h>
|
|
#include <CGAL/Cache.h>
|
|
#include <CGAL/extended_euclidean_algorithm.h>
|
|
|
|
namespace CGAL {
|
|
namespace internal{
|
|
|
|
template <class UFD, int i = 0 >
|
|
struct Cached_extended_euclidean_algorithm{
|
|
|
|
struct Extended_euclidean_algorithm{
|
|
typedef std::pair<UFD,UFD> result_type;
|
|
typedef std::pair<UFD,UFD> first_argument_type;
|
|
result_type operator()(const first_argument_type& pq){
|
|
result_type result;
|
|
CGAL::extended_euclidean_algorithm(
|
|
pq.first, pq.second, result.first, result.second);
|
|
return result;
|
|
}
|
|
};
|
|
|
|
typedef std::pair<UFD,UFD> PAIR;
|
|
typedef Extended_euclidean_algorithm FUNC;
|
|
typedef CGAL::Cache<PAIR,PAIR,FUNC> CACHE;
|
|
static CACHE& get_cache()
|
|
{
|
|
CGAL_STATIC_THREAD_LOCAL_VARIABLE_0(CACHE,cache);
|
|
return cache;
|
|
}
|
|
|
|
void operator()(const UFD& p, const UFD& q, UFD& s, UFD& t){
|
|
PAIR pq(p,q);
|
|
PAIR result = get_cache()(pq);
|
|
s = result.first;
|
|
t = result.second;
|
|
}
|
|
};
|
|
|
|
} // namespace internal
|
|
} //namespace CGAL
|
|
|
|
#endif//CGAL_POLYNOMIAL_CACHED_EXTENDED_EUCLIDEAN_ALGORITHM_H
|