- Namespace NTS introduction.

This commit is contained in:
Sylvain Pion 2000-06-25 18:42:00 +00:00
parent 44960a4711
commit b4e7c712f0
12 changed files with 40 additions and 3 deletions

View File

@ -1,7 +1,5 @@
TODO:
----
- Use a common include files, with a macro specifying the type ?
Maybe too dirty to live...
- Add min/max wrappers depending on what is decided for CGAL.
- Should I provide operator/(cl_I, cl_I) ? Not sure.
- Is it possible to factorize more code (to_double()...) ?

View File

@ -3,7 +3,8 @@ Changes done to the CLN package.
Version 1.8 on ?? ?? 2000.
- New maintainer file.
- Removed old workaround for operator>>(Quotient<cl_I>).
So CLN version >= 1.0.2 is required now.
CLN version >= 1.0.2 is required now.
- Namespace NTS introduction.
Version 1.7 on 27 October 1999.
- Added IO include files by default.

View File

@ -35,6 +35,7 @@ CGAL_BEGIN_NAMESPACE
inline double to_double (const cl_N &I) { return cl_double_approx(I); }
// Specialized utilities.
namespace NTS {
inline bool is_negative (const cl_N &I) { return minusp(I); }
inline bool is_positive (const cl_N &I) { return plusp(I); }
@ -42,6 +43,8 @@ inline bool is_zero (const cl_N &I) { return zerop(I); }
inline Comparison_result compare (const cl_N &I, const cl_N &J)
{ return Comparison_result(cl_compare(I,J)); }
} // namespace NTS
CGAL_END_NAMESPACE
// #ifdef CGAL_INTERVAL_ARITHMETIC_H

View File

@ -35,6 +35,7 @@ CGAL_BEGIN_NAMESPACE
inline double to_double (const cl_DF &I) { return cl_double_approx(I); }
// Specialized utilities.
namespace NTS {
inline bool is_negative (const cl_DF &I) { return minusp(I); }
inline bool is_positive (const cl_DF &I) { return plusp(I); }
@ -42,6 +43,8 @@ inline bool is_zero (const cl_DF &I) { return zerop(I); }
inline Comparison_result compare (const cl_DF &I, const cl_DF &J)
{ return Comparison_result(cl_compare(I,J)); }
} // namespace NTS
CGAL_END_NAMESPACE
// #ifdef CGAL_INTERVAL_ARITHMETIC_H

View File

@ -36,12 +36,16 @@ inline double to_double (const cl_FF &I) { return cl_double_approx(I); }
// Specialized utilities.
namespace NTS {
inline bool is_negative (const cl_FF &I) { return minusp(I); }
inline bool is_positive (const cl_FF &I) { return plusp(I); }
inline bool is_zero (const cl_FF &I) { return zerop(I); }
inline Comparison_result compare (const cl_FF &I, const cl_FF &J)
{ return Comparison_result(cl_compare(I,J)); }
} // namespace NTS
CGAL_END_NAMESPACE
// #ifdef CGAL_INTERVAL_ARITHMETIC_H

View File

@ -36,12 +36,16 @@ inline double to_double (const cl_F &I) { return cl_double_approx(I); }
// Specialized utilities.
namespace NTS {
inline bool is_negative (const cl_F &I) { return minusp(I); }
inline bool is_positive (const cl_F &I) { return plusp(I); }
inline bool is_zero (const cl_F &I) { return zerop(I); }
inline Comparison_result compare (const cl_F &I, const cl_F &J)
{ return Comparison_result(cl_compare(I,J)); }
} // namespace NTS
CGAL_END_NAMESPACE
// #ifdef CGAL_INTERVAL_ARITHMETIC_H

View File

@ -41,12 +41,16 @@ inline double to_double (const cl_I &I) { return cl_double_approx(I); }
// Specialized utilities.
namespace NTS {
inline bool is_negative (const cl_I &I) { return minusp(I); }
inline bool is_positive (const cl_I &I) { return plusp(I); }
inline bool is_zero (const cl_I &I) { return zerop(I); }
inline Comparison_result compare (const cl_I &I, const cl_I &J)
{ return Comparison_result(cl_compare(I,J)); }
} // namespace NTS
CGAL_END_NAMESPACE
// #ifdef CGAL_INTERVAL_ARITHMETIC_H

View File

@ -36,12 +36,16 @@ inline double to_double (const cl_LF &I) { return cl_double_approx(I); }
// Specialized utilities.
namespace NTS {
inline bool is_negative (const cl_LF &I) { return minusp(I); }
inline bool is_positive (const cl_LF &I) { return plusp(I); }
inline bool is_zero (const cl_LF &I) { return zerop(I); }
inline Comparison_result compare (const cl_LF &I, const cl_LF &J)
{ return Comparison_result(cl_compare(I,J)); }
} // namespace NTS
CGAL_END_NAMESPACE
// #ifdef CGAL_INTERVAL_ARITHMETIC_H

View File

@ -36,12 +36,16 @@ inline double to_double (const cl_number &I) { return cl_double_approx(I); }
// Specialized utilities.
namespace NTS {
inline bool is_negative (const cl_number &I) { return minusp(I); }
inline bool is_positive (const cl_number &I) { return plusp(I); }
inline bool is_zero (const cl_number &I) { return zerop(I); }
inline Comparison_result compare (const cl_number &I, const cl_number &J)
{ return Comparison_result(cl_compare(I,J)); }
} // namespace NTS
CGAL_END_NAMESPACE
// #ifdef CGAL_INTERVAL_ARITHMETIC_H

View File

@ -36,12 +36,16 @@ inline double to_double (const cl_RA &I) { return cl_double_approx(I); }
// Specialized utilities.
namespace NTS {
inline bool is_negative (const cl_RA &I) { return minusp(I); }
inline bool is_positive (const cl_RA &I) { return plusp(I); }
inline bool is_zero (const cl_RA &I) { return zerop(I); }
inline Comparison_result compare (const cl_RA &I, const cl_RA &J)
{ return Comparison_result(cl_compare(I,J)); }
} // namespace NTS
CGAL_END_NAMESPACE
// #ifdef CGAL_INTERVAL_ARITHMETIC_H

View File

@ -36,12 +36,16 @@ inline double to_double (const cl_R &I) { return cl_double_approx(I); }
// Specialized utilities.
namespace NTS {
inline bool is_negative (const cl_R &I) { return minusp(I); }
inline bool is_positive (const cl_R &I) { return plusp(I); }
inline bool is_zero (const cl_R &I) { return zerop(I); }
inline Comparison_result compare (const cl_R &I, const cl_R &J)
{ return Comparison_result(cl_compare(I,J)); }
} // namespace NTS
CGAL_END_NAMESPACE
// #ifdef CGAL_INTERVAL_ARITHMETIC_H

View File

@ -36,12 +36,16 @@ inline double to_double (const cl_SF &I) { return cl_double_approx(I); }
// Specialized utilities.
namespace NTS {
inline bool is_negative (const cl_SF &I) { return minusp(I); }
inline bool is_positive (const cl_SF &I) { return plusp(I); }
inline bool is_zero (const cl_SF &I) { return zerop(I); }
inline Comparison_result compare (const cl_SF &I, const cl_SF &J)
{ return Comparison_result(cl_compare(I,J)); }
} // namespace NTS
CGAL_END_NAMESPACE
// #ifdef CGAL_INTERVAL_ARITHMETIC_H