mirror of https://github.com/CGAL/cgal
consistent use of struct/class
This commit is contained in:
parent
26f8c79bbb
commit
f2fef56a53
|
|
@ -46,14 +46,14 @@ namespace internal{
|
|||
|
||||
// A has less variables than B
|
||||
template <typename A, typename B, bool less >
|
||||
class Coercion_traits_for_polynomial_comp_d
|
||||
struct Coercion_traits_for_polynomial_comp_d
|
||||
:public Coercion_traits_for_polynomial_comp_d< B, A , false >{};
|
||||
|
||||
// Polynomial<A> has more variables than B
|
||||
template <typename A, typename B >
|
||||
class Coercion_traits_for_polynomial_comp_d< Polynomial<A>, B , false>{
|
||||
struct Coercion_traits_for_polynomial_comp_d< Polynomial<A>, B , false>{
|
||||
typedef Coercion_traits<A,B> CT;
|
||||
public:
|
||||
|
||||
typedef CGAL::Tag_true Are_explicit_interoperable;
|
||||
typedef CGAL::Tag_false Are_implicit_interoperable;
|
||||
|
||||
|
|
@ -74,14 +74,14 @@ public:
|
|||
|
||||
// number of variables is different
|
||||
template <typename A, typename B, int a, int b>
|
||||
class Coercion_traits_for_polynomial_equal_d
|
||||
struct Coercion_traits_for_polynomial_equal_d
|
||||
:public Coercion_traits_for_polynomial_comp_d <A,B, a < b >{};
|
||||
|
||||
// number of variables is equal and at least one.
|
||||
template <class A,class B, int d>
|
||||
class Coercion_traits_for_polynomial_equal_d<Polynomial<A>, Polynomial<B>, d, d >{
|
||||
struct Coercion_traits_for_polynomial_equal_d<Polynomial<A>, Polynomial<B>, d, d >{
|
||||
typedef Coercion_traits<A,B> CT;
|
||||
public:
|
||||
|
||||
typedef CGAL::Tag_true Are_explicit_interoperable;
|
||||
typedef CGAL::Tag_false Are_implicit_interoperable;
|
||||
typedef Polynomial<typename CT::Type> Type;
|
||||
|
|
@ -102,22 +102,22 @@ public:
|
|||
|
||||
// determine number of variables in each polynomial
|
||||
template <typename A, typename B>
|
||||
class Coercion_traits_for_polynomial
|
||||
struct Coercion_traits_for_polynomial
|
||||
: public Coercion_traits_for_polynomial_equal_d
|
||||
< A , B , Dimension<A>::value, Dimension<B>::value >{};
|
||||
|
||||
}// namespace internal
|
||||
|
||||
template <class A,class B>
|
||||
class Coercion_traits_for_level< Polynomial<A> , Polynomial<B>, CTL_POLYNOMIAL >
|
||||
struct Coercion_traits_for_level< Polynomial<A> , Polynomial<B>, CTL_POLYNOMIAL >
|
||||
:public internal::Coercion_traits_for_polynomial< Polynomial<A>, Polynomial<B> >
|
||||
{};
|
||||
template <class A,class B>
|
||||
class Coercion_traits_for_level< Polynomial<A> , B , CTL_POLYNOMIAL >
|
||||
struct Coercion_traits_for_level< Polynomial<A> , B , CTL_POLYNOMIAL >
|
||||
:public internal::Coercion_traits_for_polynomial< Polynomial<A>, B >
|
||||
{};
|
||||
template <class A,class B>
|
||||
class Coercion_traits_for_level< A , Polynomial<B> , CTL_POLYNOMIAL >
|
||||
struct Coercion_traits_for_level< A , Polynomial<B> , CTL_POLYNOMIAL >
|
||||
:public internal::Coercion_traits_for_polynomial< A , Polynomial<B> >
|
||||
{};
|
||||
|
||||
|
|
@ -132,9 +132,9 @@ class Coercion_traits_for_level< A , Polynomial<B> , CTL_POLYNOMIAL >
|
|||
// class this part should be adapted, using a Polynomial_traits
|
||||
// and the nesting_depth
|
||||
template <class A,class B>
|
||||
class Coercion_traits_for_level<Polynomial<A>, Polynomial<B>, CTL_POLYNOMIAL >{
|
||||
struct Coercion_traits_for_level<Polynomial<A>, Polynomial<B>, CTL_POLYNOMIAL >{
|
||||
typedef Coercion_traits<A,B> CT;
|
||||
public:
|
||||
|
||||
typedef CGAL::Tag_true Are_explicit_interoperable;
|
||||
typedef CGAL::Tag_false Are_implicit_interoperable;
|
||||
typedef Polynomial<typename CT::Type> Type;
|
||||
|
|
@ -154,9 +154,9 @@ public:
|
|||
};
|
||||
|
||||
template <class A,class B>
|
||||
class Coercion_traits_for_level<Polynomial<A>,B ,CTL_POLYNOMIAL >{
|
||||
struct Coercion_traits_for_level<Polynomial<A>,B ,CTL_POLYNOMIAL >{
|
||||
typedef Coercion_traits<A,B> CT;
|
||||
public:
|
||||
|
||||
typedef CGAL::Tag_true Are_explicit_interoperable;
|
||||
typedef CGAL::Tag_false Are_implicit_interoperable;
|
||||
|
||||
|
|
@ -175,7 +175,7 @@ public:
|
|||
};
|
||||
};
|
||||
template <class A,class B>
|
||||
class Coercion_traits_for_level<B,Polynomial<A>,CTL_POLYNOMIAL >
|
||||
struct Coercion_traits_for_level<B,Polynomial<A>,CTL_POLYNOMIAL >
|
||||
:public Coercion_traits_for_level<Polynomial<A>,B,CTL_POLYNOMIAL >
|
||||
{};
|
||||
|
||||
|
|
|
|||
|
|
@ -111,7 +111,7 @@ public:
|
|||
} // namespace internal
|
||||
|
||||
template <typename NT>
|
||||
struct Real_embeddable_traits<Polynomial<NT> >
|
||||
class Real_embeddable_traits<Polynomial<NT> >
|
||||
:public internal::Real_embeddable_traits_poly_base<
|
||||
Polynomial<NT>,
|
||||
typename Real_embeddable_traits<typename internal::Innermost_coefficient_type<NT>::Type>::Is_real_embeddable>
|
||||
|
|
|
|||
Loading…
Reference in New Issue