int -> uint
| @@ -57,7 +57,7 @@ | ||
| 57 | 57 | { |
| 58 | 58 | std::size_t size = n/2; |
| 59 | 59 | for (std::size_t i = 0; i < size; ++i) |
| 60 | - pwcs[i] = hamigaki::decode_int<big,2>(s + i*2); | |
| 60 | + pwcs[i] = hamigaki::decode_uint<big,2>(s + i*2); | |
| 61 | 61 | return size; |
| 62 | 62 | } |
| 63 | 63 |
| @@ -80,7 +80,7 @@ | ||
| 80 | 80 | { |
| 81 | 81 | std::size_t size = n/2; |
| 82 | 82 | for (std::size_t i = 0; i < size; ++i) |
| 83 | - pwcs[i] = hamigaki::decode_int<little,2>(s + i*2); | |
| 83 | + pwcs[i] = hamigaki::decode_uint<little,2>(s + i*2); | |
| 84 | 84 | return size; |
| 85 | 85 | } |
| 86 | 86 |
| @@ -129,8 +129,8 @@ | ||
| 129 | 129 | { |
| 130 | 130 | for (std::size_t i = 0; i < n; ++i) |
| 131 | 131 | { |
| 132 | - hamigaki::encode_int<big,2>( | |
| 133 | - s + i*2, static_cast<boost::int16_t>(pwcs[i])); | |
| 132 | + hamigaki::encode_uint<big,2>( | |
| 133 | + s + i*2, static_cast<boost::uint16_t>(pwcs[i])); | |
| 134 | 134 | } |
| 135 | 135 | return n*2; |
| 136 | 136 | } |
| @@ -160,8 +160,8 @@ | ||
| 160 | 160 | { |
| 161 | 161 | for (std::size_t i = 0; i < n; ++i) |
| 162 | 162 | { |
| 163 | - hamigaki::encode_int<little,2>( | |
| 164 | - s + i*2, static_cast<boost::int16_t>(pwcs[i])); | |
| 163 | + hamigaki::encode_uint<little,2>( | |
| 164 | + s + i*2, static_cast<boost::uint16_t>(pwcs[i])); | |
| 165 | 165 | } |
| 166 | 166 | return n*2; |
| 167 | 167 | } |
hamigaki/trunk/hamigaki/archivers/detail/ucs2.hpp