/usr/include/ITK-4.12/itkThreadedIteratorRangePartitioner.hxx is in libinsighttoolkit4-dev 4.12.2-dfsg1-1ubuntu1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 | /*=========================================================================
*
* Copyright Insight Software Consortium
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0.txt
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*
*=========================================================================*/
#ifndef itkThreadedIteratorRangePartitioner_hxx
#define itkThreadedIteratorRangePartitioner_hxx
#include "itkNumericTraits.h"
#include "itkThreadedIteratorRangePartitioner.h"
#include "itkMath.h"
#include <iterator>
namespace itk
{
template< typename TIterator >
ThreadedIteratorRangePartitioner< TIterator >
::ThreadedIteratorRangePartitioner()
{
}
template< typename TIterator >
ThreadedIteratorRangePartitioner< TIterator >
::~ThreadedIteratorRangePartitioner()
{
}
template< typename TIterator >
ThreadIdType
ThreadedIteratorRangePartitioner< TIterator >
::PartitionDomain( const ThreadIdType threadId,
const ThreadIdType requestedTotal,
const DomainType& completeDomain,
DomainType& subDomain ) const
{
// overallIndexRange is expected to be inclusive
// determine the actual number of pieces that will be generated
ThreadIdType count = std::distance( completeDomain.Begin(), completeDomain.End() );
ThreadIdType valuesPerThread =
Math::Ceil<ThreadIdType>( static_cast< double >( count ) / static_cast< double >( requestedTotal ));
ThreadIdType maxThreadIdUsed =
Math::Ceil<ThreadIdType>( static_cast< double >( count ) / static_cast< double >( valuesPerThread )) - 1;
if ( threadId > maxThreadIdUsed )
{
// return before advancing Begin iterator, to prevent advancing
// past end
return maxThreadIdUsed + 1;
}
const ThreadIdType startIndexCount = threadId * valuesPerThread;
subDomain.m_Begin = completeDomain.Begin();
std::advance( subDomain.m_Begin, startIndexCount );
if (threadId < maxThreadIdUsed)
{
subDomain.m_End = subDomain.m_Begin;
std::advance( subDomain.m_End, valuesPerThread );
}
if (threadId == maxThreadIdUsed)
{
// last thread needs to process the "rest" of the range
subDomain.m_End = completeDomain.End();
}
return maxThreadIdUsed + 1;
}
} // end namespace itk
#endif
|