| 317 | } |
| 318 | |
| 319 | size_t |
| 320 | clsparseHostTimer::pruneOutliers( size_t id, cl_double multiple ) |
| 321 | { |
| 322 | if( clkTicks.empty( ) ) |
| 323 | return 0; |
| 324 | |
| 325 | cl_double mean = getMean( id ); |
| 326 | cl_double stdDev = getStdDev( id ); |
| 327 | |
| 328 | clkVector& clks = clkTicks.at( id ); |
| 329 | |
| 330 | // Look on p. 379, "The C++ Standard Library" |
| 331 | // std::remove_if does not actually erase, it only copies elements, it returns new 'logical' end |
| 332 | clkVector::iterator newEnd = std::remove_if( clks.begin( ), clks.end( ), PruneRange< cl_double, cl_ulong >( mean, multiple*stdDev ) ); |
| 333 | |
| 334 | clkVector::difference_type dist = std::distance( newEnd, clks.end( ) ); |
| 335 | |
| 336 | if( dist != 0 ) |
| 337 | clks.erase( newEnd, clks.end( ) ); |
| 338 | |
| 339 | assert( dist < std::numeric_limits< cl_uint >::max( ) ); |
| 340 | |
| 341 | return dist; |
| 342 | } |
| 343 | |
| 344 | size_t |
| 345 | clsparseHostTimer::pruneOutliers( cl_double multiple ) |