[Boost-commit] svn:boost r80484 - in trunk/libs/polygon: doc example test

Subject: [Boost-commit] svn:boost r80484 - in trunk/libs/polygon: doc example test
From: sydorchuk.andriy_at_[hidden]
Date: 2012-09-10 17:03:18

Author: asydorchuk
Date: 2012-09-10 17:03:17 EDT (Mon, 10 Sep 2012)
New Revision: 80484
URL: http://svn.boost.org/trac/boost/changeset/80484

Log:
Polygon: cleaning documentation links and files using Boost inspect util.
Text files modified: 
   trunk/libs/polygon/doc/voronoi_basic_tutorial.htm   |     2 +-                                      
   trunk/libs/polygon/example/voronoi_visualizer.cpp   |     2 --                                      
   trunk/libs/polygon/test/voronoi_builder_test.cpp    |     8 ++++----                                
   trunk/libs/polygon/test/voronoi_predicates_test.cpp |     8 ++++----                                
   4 files changed, 9 insertions(+), 11 deletions(-)

Modified: trunk/libs/polygon/doc/voronoi_basic_tutorial.htm
==============================================================================
--- trunk/libs/polygon/doc/voronoi_basic_tutorial.htm	(original)
+++ trunk/libs/polygon/doc/voronoi_basic_tutorial.htm	2012-09-10 17:03:17 EDT (Mon, 10 Sep 2012)
@@ -307,7 +307,7 @@
 basic tutorial to be useful (in the end it's not so basic). Worth
 to notice that construction of the Voronoi diagram takes only two lines
 of code, everything else is about initializing input data structures,
-traversing Voronoi graph, associating data with the diagram primitives. In the
+traversing Voronoi graph, associating data with the diagram primitives. In the
 default mode the Voronoi diagram operates with the signed int (32-bit) input
 coordinate type and double (64-bit) output coordinate type. In the advanced Voronoi tutorial we
 explain why this is enough for the 95% of cases and how to expand the

Modified: trunk/libs/polygon/example/voronoi_visualizer.cpp
==============================================================================
--- trunk/libs/polygon/example/voronoi_visualizer.cpp	(original)
+++ trunk/libs/polygon/example/voronoi_visualizer.cpp	2012-09-10 17:03:17 EDT (Mon, 10 Sep 2012)
@@ -7,7 +7,6 @@
 
 // See http://www.boost.org for updates, documentation, and revision history.
 
-#include <cassert>
 #include <iostream>
 #include <vector>
 
@@ -296,7 +295,6 @@
     const cell_type& cell2 = *edge.twin()->cell();
     point_type origin, direction;
     // Infinite edges could not be created by two segment sites.
-    assert(cell1.contains_point() || cell2.contains_point());
     if (cell1.contains_point() && cell2.contains_point()) {
       point_type p1 = retrieve_point(cell1);
       point_type p2 = retrieve_point(cell2);

Modified: trunk/libs/polygon/test/voronoi_builder_test.cpp
==============================================================================
--- trunk/libs/polygon/test/voronoi_builder_test.cpp	(original)
+++ trunk/libs/polygon/test/voronoi_builder_test.cpp	2012-09-10 17:03:17 EDT (Mon, 10 Sep 2012)
@@ -316,7 +316,7 @@
     test_output_large.clear();
     point_vec_small.clear();
     point_vec_large.clear();
-    int koef = std::numeric_limits<int>::max() / max_value[k];
+    int koef = (std::numeric_limits<int>::max)() / max_value[k];
     for (int i = 0; i < grid_size[k]; i++) {
       for (int j = 0; j < grid_size[k]; j++) {
         point_vec_small.push_back(point_data<T>(i, j));
@@ -347,7 +347,7 @@
   int max_value[] = {5, 50, 50, 5000};
   int array_length = sizeof(num_points) / sizeof(int);
   for (int k = 0; k < array_length; k++) {
-    int koef = std::numeric_limits<int>::max() / max_value[k];
+    int koef = (std::numeric_limits<int>::max)() / max_value[k];
     for (int i = 0; i < num_runs[k]; i++) {
       test_output_small.clear();
       test_output_large.clear();
@@ -519,7 +519,7 @@
     segments_small.clear();
     segments_large.clear();
     int cur_sz = grid_size[k];
-    int koef = std::numeric_limits<int>::max() / max_value[k];
+    int koef = (std::numeric_limits<int>::max)() / max_value[k];
     for (int i = 0; i < cur_sz + 1; i++)
       for (int j = 0; j < cur_sz; j++) {
         point_data<T> point1_1(10 * i, 10 * j);
@@ -592,7 +592,7 @@
   int max_value[] = {10, 60, 125, 200};
   int array_length = sizeof(num_segments) / sizeof(int);
   for (int k = 0; k < array_length; k++) {
-    int koef = std::numeric_limits<int>::max() / max_value[k];
+    int koef = (std::numeric_limits<int>::max)() / max_value[k];
     for (int i = 0; i < num_runs[k]; i++) {
       test_output_small.clear();
       test_output_large.clear();

Modified: trunk/libs/polygon/test/voronoi_predicates_test.cpp
==============================================================================
--- trunk/libs/polygon/test/voronoi_predicates_test.cpp	(original)
+++ trunk/libs/polygon/test/voronoi_predicates_test.cpp	2012-09-10 17:03:17 EDT (Mon, 10 Sep 2012)
@@ -81,8 +81,8 @@
     CHECK_CIRCLE(c2, c_x, c_y, l_x); }
 
 BOOST_AUTO_TEST_CASE(orientation_test) {
-  int min_int = std::numeric_limits<int>::min();
-  int max_int = std::numeric_limits<int>::max();
+  int min_int = (std::numeric_limits<int>::min)();
+  int max_int = (std::numeric_limits<int>::max)();
   point_type point1(min_int, min_int);
   point_type point2(0, 0);
   point_type point3(max_int, max_int);
@@ -383,8 +383,8 @@
 }
 
 BOOST_AUTO_TEST_CASE(circle_formation_predicate_test2) {
-  int min_int = std::numeric_limits<int>::min();
-  int max_int = std::numeric_limits<int>::max();
+  int min_int = (std::numeric_limits<int>::min)();
+  int max_int = (std::numeric_limits<int>::max)();
   site_type site1(min_int, min_int);
   site_type site2(min_int, max_int);
   site_type site3(max_int-1, max_int-1);