forked from boostorg/algorithm
		
	| @@ -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 BOOST_THROW_EXCEPTION (non_hex_input() << bad_char (c)); | ||||
|         return retval; | ||||
|         return static_cast<char>(retval); | ||||
|         } | ||||
|  | ||||
| //  My own iterator_traits class. | ||||
|   | ||||
| @@ -155,9 +155,9 @@ namespace boost { namespace algorithm { | ||||
|      | ||||
|  | ||||
|         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; | ||||
|            j = skip_[0] = -1; | ||||
| @@ -177,7 +177,7 @@ namespace boost { namespace algorithm { | ||||
|         void init_skip_table ( patIter first, patIter last ) { | ||||
|             const difference_type count = std::distance ( first, last ); | ||||
|      | ||||
|             int j; | ||||
|             difference_type j; | ||||
|             skip_ [ 0 ] = -1; | ||||
|             for ( int i = 1; i <= count; ++i ) { | ||||
|                 j = skip_ [ i - 1 ]; | ||||
|   | ||||
		Reference in New Issue
	
	Block a user