songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Removed output from test

This commit is contained in:
Michael Kerber 2008-06-27 12:25:08 +00:00
parent cfb8106780
commit f08df0e4b7
2 changed files with 28 additions and 23 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
Algebraic_kernel_d/test/Algebraic_curve_kernel_2/Algebraic_curve_kernel_2.cpp
View File

@ -83,11 +83,11 @@ void test_algebraic_curve_kernel_2() {
Algebraic_kernel_2;
#endif
std::cout << "Non-filtered kernel..." << std::endl;
//std::cout << "Non-filtered kernel..." << std::endl;
CGAL::CGALi::test_algebraic_curve_kernel_2<Algebraic_kernel_2>();
std::cout << "Filtered kernel..." << std::endl;
//std::cout << "Filtered kernel..." << std::endl;
#if CGAL_ACK_USE_EXACUS
typedef CGAL::Filtered_algebraic_curve_kernel_2<Algebraic_curve_pair_2,
@ -106,9 +106,13 @@ int main() {
#ifdef CGAL_USE_CORE
test_algebraic_curve_kernel_2<CGAL::CORE_arithmetic_kernel>();
#else
std::cerr << "CORE tests skipped" << std::endl;
#endif
#ifdef CGAL_USE_LEDA
test_algebraic_curve_kernel_2<CGAL::LEDA_arithmetic_kernel>();
#else
std::cerr << "LEDA tests skipped" << std::endl;
#endif
return 0;

43
Algebraic_kernel_d/test/Algebraic_curve_kernel_2/include/CGAL/_test_algebraic_curve_kernel_2.h
View File

@ -84,7 +84,7 @@ void test_algebraic_curve_kernel_2() {
::CGAL::set_mode(std::cerr, ::CGAL::IO::PRETTY);
std::cerr << "constructing curves..\n";
//std::cerr << "constructing curves..\n";
for(int i = 0; i < ACK_2_n_polys; i++) {
istringstream in(ACK_2_ascii_polys[i]);
in >> polys[i];
@ -104,7 +104,7 @@ void test_algebraic_curve_kernel_2() {
c3 = kernel_2.construct_curve_2_object()(polys[3]),
c5 = kernel_2.construct_curve_2_object()(polys[5]),
c6 = kernel_2.construct_curve_2_object()(polys[6]);
std::cerr << "done..\n";
//std::cerr << "done..\n";
Status_line_1 line1, line2;
Xy_coordinate_2 xy1, xy2, xy3, xy4;
@ -118,7 +118,7 @@ void test_algebraic_curve_kernel_2() {
assert(line.number_of_events() > 0);
Xy_coordinate_2 xy = line.algebraic_real_2(0);
std::cerr << "done..1.5\n";
//std::cerr << "done..1.5\n";
assert(kernel_2.sign_at_2_object()(c7_c6, xy) == CGAL::ZERO);
}
{
@ -131,11 +131,11 @@ void test_algebraic_curve_kernel_2() {
assert(line.number_of_events() > 0);
Xy_coordinate_2 xy = line.algebraic_real_2(0);
std::cerr << "done..1.6\n";
//std::cerr << "done..1.6\n";
assert(kernel_2.sign_at_2_object()(c8_c6, xy) == CGAL::ZERO);
}
std::cerr << "done..2\n";
//std::cerr << "done..2\n";
///////// test buggy y() //////////////
@ -178,15 +178,15 @@ void test_algebraic_curve_kernel_2() {
xy3 = line2.algebraic_real_2(3);
xy4 = line2.algebraic_real_2(4);
std::cerr << "y_comp 1" << std::flush;
//std::cerr << "y_comp 1" << std::flush;
assert(kernel_2.compare_y_2_object()(xy1, xy2) == CGAL::LARGER);
std::cerr << " 2" << std::flush;
//std::cerr << " 2" << std::flush;
assert(kernel_2.compare_y_2_object()(xy1, xy3) == CGAL::SMALLER);
std::cerr << " 3" << std::flush;
//std::cerr << " 3" << std::flush;
assert(kernel_2.compare_y_2_object()(xy1, xy4) == CGAL::SMALLER);
std::cerr << " 4" << std::flush;
//std::cerr << " 4" << std::flush;
assert(kernel_2.compare_y_2_object()(xy2, xy3) == CGAL::SMALLER);
std::cerr << " done" << std::endl;
//std::cerr << " done" << std::endl;
/////// testing squarefreeness and coprimality /////////
@ -224,8 +224,8 @@ void test_algebraic_curve_kernel_2() {
typename Curves_2::const_iterator cit;
typename Int_vector::const_iterator iit;
std::cerr << "n_factors: " << kernel_2.decompose_2_object()(c1,
std::back_inserter(parts), std::back_inserter(mults));
//std::cerr << "n_factors: " << kernel_2.decompose_2_object()(c1,
// std::back_inserter(parts), std::back_inserter(mults));
for(cit = parts.begin(), iit = mults.begin(); cit != parts.end();
cit++, iit++) {
@ -235,9 +235,10 @@ void test_algebraic_curve_kernel_2() {
parts.clear();
mults.clear();
std::cerr << "n_factors :" <<
kernel_2.decompose_2_object()(c3, std::back_inserter(parts),
std::back_inserter(mults));
//std::cerr << "n_factors :" <<
// kernel_2.decompose_2_object()(c3, std::back_inserter(parts),
// std::back_inserter(mults));
for(cit = parts.begin(), iit = mults.begin(); cit != parts.end();
cit++, iit++) {
//std::cerr << "part: " << cit->f() << "; mult: " << *iit << "\n";
@ -303,20 +304,20 @@ void test_algebraic_curve_kernel_2() {
line = c0.status_line_at_event(ii);
n_events = line.number_of_events();
std::cout << ii << "pts at event: \n";
//std::cout << ii << "pts at event: \n";
for(jj = 0; jj < n_events; jj++) {
xy = line.algebraic_real_2(jj);
std::cout << "sign 2: " <<
kernel_2.sign_at_2_object()(c1, xy) << "\n\n";
//std::cout << "sign 2: " <<
// kernel_2.sign_at_2_object()(c1, xy) << "\n\n";
}
std::cout << ii << "pts over interval: \n";
//std::cout << ii << "pts over interval: \n";
line = c0.status_line_of_interval(ii);
n_events = line.number_of_events();
for(jj = 0; jj < n_events; jj++) {
xy = line.algebraic_real_2(jj);
std::cout << " sign 2: " <<
kernel_2.sign_at_2_object()(c1, xy) << "\n\n";
//std::cout << " sign 2: " <<
// kernel_2.sign_at_2_object()(c1, xy) << "\n\n";
}
}