feedc0de/boost_algorithm
1
0
Fork 0
forked from boostorg/algorithm
Code Pull Requests Activity

Change name of (another) parameter; fixes 'shadowing' warning (Trac #12623)

Browse Source
This commit is contained in:
Marshall Clow
2016-11-25 20:50:53 -08:00
parent 42db8a4403
commit e442420d49
1 changed files with 4 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
include/boost/algorithm/searching/boyer_moore.hpp
View File

@ -152,8 +152,8 @@ Requirements:
template<typename Iter, typename Container> template<typename Iter, typename Container>
void compute_bm_prefix ( Iter pat_first, Iter pat_last, Container &prefix ) { void compute_bm_prefix ( Iter first, Iter last, Container &prefix ) {
const std::size_t count = std::distance ( pat_first, pat_last ); const std::size_t count = std::distance ( first, last );
BOOST_ASSERT ( count > 0 ); BOOST_ASSERT ( count > 0 );
BOOST_ASSERT ( prefix.size () == count ); BOOST_ASSERT ( prefix.size () == count );
@ -161,12 +161,12 @@ Requirements:
std::size_t k = 0; std::size_t k = 0;
for ( std::size_t i = 1; i < count; ++i ) { for ( std::size_t i = 1; i < count; ++i ) {
BOOST_ASSERT ( k < count ); BOOST_ASSERT ( k < count );
while ( k > 0 && ( pat_first[k] != pat_first[i] )) { while ( k > 0 && ( first[k] != first[i] )) {
BOOST_ASSERT ( k < count ); BOOST_ASSERT ( k < count );
k = prefix [ k - 1 ]; k = prefix [ k - 1 ];
} }
if ( pat_first[k] == pat_first[i] ) if ( first[k] == first[i] )
k++; k++;
prefix [ i ] = k; prefix [ i ] = k;
} }