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

fix narrowing conversions

Browse Source 
Signed-off-by: Daniela Engert <dani@ngrt.de>
This commit is contained in:
Daniela Engert
2015-02-01 07:17:45 +01:00
parent 17d4f70e97
commit 56d88410c6
2 changed files with 4 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
include/boost/algorithm/hex.hpp
View File

@ -73,7 +73,7 @@ namespace detail {
else if ( c >= 'A' && c <= 'F' ) retval = c - 'A' + 10; else if ( c >= 'A' && c <= 'F' ) retval = c - 'A' + 10;
else if ( c >= 'a' && c <= 'f' ) retval = c - 'a' + 10; else if ( c >= 'a' && c <= 'f' ) retval = c - 'a' + 10;
else BOOST_THROW_EXCEPTION (non_hex_input() << bad_char (c)); else BOOST_THROW_EXCEPTION (non_hex_input() << bad_char (c));
return retval; return static_cast<char>(retval);
} }
// My own iterator_traits class. // My own iterator_traits class.

6
include/boost/algorithm/searching/knuth_morris_pratt.hpp
View File

@ -155,9 +155,9 @@ namespace boost { namespace algorithm {
void preKmp ( patIter first, patIter last ) { void preKmp ( patIter first, patIter last ) {
const /*std::size_t*/ int count = std::distance ( first, last ); const difference_type count = std::distance ( first, last );
int i, j; difference_type i, j;
i = 0; i = 0;
j = skip_[0] = -1; j = skip_[0] = -1;
@ -177,7 +177,7 @@ namespace boost { namespace algorithm {
void init_skip_table ( patIter first, patIter last ) { void init_skip_table ( patIter first, patIter last ) {
const difference_type count = std::distance ( first, last ); const difference_type count = std::distance ( first, last );
int j; difference_type j;
skip_ [ 0 ] = -1; skip_ [ 0 ] = -1;
for ( int i = 1; i <= count; ++i ) { for ( int i = 1; i <= count; ++i ) {
j = skip_ [ i - 1 ]; j = skip_ [ i - 1 ];