1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230
|
/*=========================================================================
Program: Insight Segmentation & Registration Toolkit
Module: itkMathRoundProfileTest1.cxx
Language: C++
Date: $Date$
Version: $Revision$
Copyright (c) Insight Software Consortium. All rights reserved.
See ITKCopyright.txt or http://www.itk.org/HTML/Copyright.htm for details.
This software is distributed WITHOUT ANY WARRANTY; without even
the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
PURPOSE. See the above copyright notices for more information.
=========================================================================*/
#if defined(_MSC_VER)
#pragma warning ( disable : 4786 )
#endif
#include "itkMacro.h"
#include "itkMath.h"
#include "itkTimeProbesCollectorBase.h"
#include "itkMath.h"
#include <math.h>
int itkMathRoundTestHelperFunction( double x )
{
x+=0.5;
return static_cast<int>(x>=0.?x:(x==static_cast<int>(x)?x:x-1.));
}
#define itkRoundMacro( x, y ) \
if( x >= 0.5 ) \
{ \
y = static_cast< int >( x + 0.5 ); \
} \
else \
{ \
if( (x+0.5)==static_cast<int>(x+0.5) ) \
{ \
y = static_cast< int >( x + 0.5 ); \
} \
else \
{ \
y = static_cast< int >( x - 0.5 ); \
} \
}
int itkMathRoundProfileTest1( int, char *[] )
{
itk::TimeProbesCollectorBase chronometer;
typedef std::vector< double > ArrayType;
typedef std::vector< int > IntArrayType;
ArrayType input;
IntArrayType output1;
IntArrayType output2;
IntArrayType output3;
IntArrayType output4;
const unsigned long numberOfValues = 1000L;
const double initialValue = -10.0;
const double valueIncrement = (-initialValue-initialValue) / numberOfValues;
std::cout << "Initial Value = " << initialValue << std::endl;
std::cout << "Value Increment = " << valueIncrement << std::endl;
for( unsigned long i=0; i<numberOfValues; i++)
{
const double inputValue = initialValue + i * valueIncrement;
input.push_back( inputValue );
}
//
// Make sure that entries in the .5 locations are included
//
for( signed int k = -10; k <= 10; k++ )
{
const double value = k + 0.5;
input.push_back( value );
}
output1.resize( input.size() );
output2.resize( input.size() );
output3.resize( input.size() );
output4.resize( input.size() );
for(unsigned int tours=0; tours < 100; tours++)
{
//
// Count the time of simply assigning values in an std::vector
//
//
IntArrayType::const_iterator outItr1src = output1.begin();
IntArrayType::iterator outItr2dst = output2.begin();
IntArrayType::const_iterator outEnd1 = output1.end();
chronometer.Start("std::vector");
while( outItr1src != outEnd1 )
{
*outItr2dst++ = *outItr1src++;
}
chronometer.Stop("std::vector");
ArrayType::const_iterator inpItr = input.begin();
ArrayType::const_iterator inputEnd = input.end();
IntArrayType::iterator outItr1nc = output1.begin();
//
// Count the time of rounding plus storing in container
//
chronometer.Start("if-round");
while( inpItr != inputEnd )
{
*outItr1nc++ = itkMathRoundTestHelperFunction( *inpItr++ );
}
chronometer.Stop("if-round");
inpItr = input.begin();
inputEnd = input.end();
IntArrayType::iterator outItr3nc = output3.begin();
//
// Count the time of rounding plus storing in container
//
chronometer.Start("Functor");
while( inpItr != inputEnd )
{
const double x = (*inpItr++) + 0.5;
*outItr3nc++ = static_cast<int>(x>=0.?x:(x==static_cast<int>(x)?x:x-1.));
}
chronometer.Stop("Functor");
inpItr = input.begin();
inputEnd = input.end();
IntArrayType::iterator outItr4nc = output4.begin();
//
// Count the time of rounding plus storing in container
//
chronometer.Start("Macro");
while( inpItr != inputEnd )
{
itkRoundMacro(*inpItr, *outItr4nc );
++inpItr;
++outItr4nc;
}
chronometer.Stop("Macro");
inpItr = input.begin();
inputEnd = input.end();
IntArrayType::iterator outItr = output2.begin();
//
// Count the time of rounding plus storing in container
//
chronometer.Start("itk::Math::Round");
while( inpItr != inputEnd )
{
*outItr++ = itk::Math::Round<int>( *inpItr++ );
}
chronometer.Stop("itk::Math::Round");
}
chronometer.Report( std::cout );
//
// Now test the correctness of the output
//
ArrayType::const_iterator inpItr = input.begin();
ArrayType::const_iterator inputEnd = input.end();
IntArrayType::const_iterator outItr1 = output1.begin();
IntArrayType::const_iterator outItr2 = output2.begin();
bool roundMismatch = false;
std::cout << std::endl;
std::cout << std::endl;
while( inpItr != inputEnd )
{
if( (*outItr1) != (*outItr2) )
{
std::cout << "Warning*** For input: " << *inpItr << " if-round: " << *outItr1 << " differs from itk::Math::Round: " << *outItr2 << std::endl;
roundMismatch = true;
}
++inpItr;
++outItr1;
++outItr2;
}
std::cout << std::endl;
std::cout << "Tested " << output1.size() << " entries " << std::endl;
std::cout << std::endl;
if (roundMismatch)
{
std::cout << "******* On this platform, itk::Math::Round() does not round half integers upward ********" << std::endl;
return EXIT_FAILURE;
}
return EXIT_SUCCESS;
}
|