Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1 | //===----------------------------------------------------------------------===// |
| 2 | // |
Howard Hinnant | f5256e1 | 2010-05-11 21:36:01 +0000 | [diff] [blame] | 3 | // The LLVM Compiler Infrastructure |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 4 | // |
Howard Hinnant | b64f8b0 | 2010-11-16 22:09:02 +0000 | [diff] [blame] | 5 | // This file is dual licensed under the MIT and the University of Illinois Open |
| 6 | // Source Licenses. See LICENSE.TXT for details. |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 7 | // |
| 8 | //===----------------------------------------------------------------------===// |
| 9 | |
| 10 | // <locale> |
| 11 | |
| 12 | // template <> class codecvt<char32_t, char, mbstate_t> |
| 13 | |
Howard Hinnant | 22a74dc | 2010-08-22 00:39:25 +0000 | [diff] [blame] | 14 | // result out(stateT& state, |
| 15 | // const internT* from, const internT* from_end, const internT*& from_next, |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 16 | // externT* to, externT* to_end, externT*& to_next) const; |
| 17 | |
| 18 | #include <locale> |
| 19 | #include <string> |
| 20 | #include <vector> |
| 21 | #include <cassert> |
| 22 | |
| 23 | #include <stdio.h> |
| 24 | |
| 25 | typedef std::codecvt<char32_t, char, std::mbstate_t> F; |
| 26 | |
| 27 | int main() |
| 28 | { |
| 29 | std::locale l = std::locale::classic(); |
| 30 | const F& f = std::use_facet<F>(l); |
| 31 | { |
| 32 | F::intern_type from[9] = {'s', 'o', 'm', 'e', ' ', 't', 'e', 'x', 't'}; |
| 33 | char to[9] = {0}; |
Dan Albert | 1d4a1ed | 2016-05-25 22:36:09 -0700 | [diff] [blame^] | 34 | std::mbstate_t mbs = {0}; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 35 | const F::intern_type* from_next = 0; |
| 36 | char* to_next = 0; |
| 37 | F::result r = f.out(mbs, from, from + 9, from_next, |
| 38 | to, to + 9, to_next); |
| 39 | assert(r == F::ok); |
| 40 | assert(from_next - from == 9); |
| 41 | assert(to_next - to == 9); |
| 42 | for (unsigned i = 0; i < 9; ++i) |
| 43 | assert(to[i] == from[i]); |
| 44 | } |
| 45 | } |