Commit | Line | Data |
---|---|---|
e5a5a138 RK |
1 | /* |
2 | * This file is part of DisOrde | |
3 | * Copyright (C) 2007 Richard Kettlewell | |
4 | * | |
5 | * This program is free software; you can redistribute it and/or modify | |
6 | * it under the terms of the GNU General Public License as published by | |
7 | * the Free Software Foundation; either version 2 of the License, or | |
8 | * (at your option) any later version. | |
9 | * | |
10 | * This program is distributed in the hope that it will be useful, but | |
11 | * WITHOUT ANY WARRANTY; without even the implied warranty of | |
12 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
13 | * General Public License for more details. | |
14 | * | |
15 | * You should have received a copy of the GNU General Public License | |
16 | * along with this program; if not, write to the Free Software | |
17 | * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 | |
18 | * USA | |
19 | */ | |
20 | /** @file lib/unicode.h | |
21 | * @brief Unicode support functions | |
22 | */ | |
23 | ||
24 | #ifndef UNICODE_H | |
25 | #define UNICODE_H | |
26 | ||
092f426f RK |
27 | /** @brief Smart pointer into a string |
28 | * | |
29 | * Iterators can be efficiently moved either forwards or back to the start of | |
30 | * the string. They cannot (currently) efficiently be moved backwards. Their | |
31 | * advantage is that they remember internal state to speed up boundary | |
32 | * detection. | |
33 | * | |
34 | * Iterators can point to any code point of the string, or to a hypothetical | |
35 | * post-final code point of value 0, but not outside the string. | |
36 | */ | |
37 | typedef struct utf32_iterator_data *utf32_iterator; | |
38 | ||
e5a5a138 RK |
39 | char *utf32_to_utf8(const uint32_t *s, size_t ns, size_t *nd); |
40 | uint32_t *utf8_to_utf32(const char *s, size_t ns, size_t *nd); | |
18cda350 | 41 | int utf8_valid(const char *s, size_t ns); |
e5a5a138 RK |
42 | |
43 | size_t utf32_len(const uint32_t *s); | |
44 | int utf32_cmp(const uint32_t *a, const uint32_t *b); | |
45 | ||
46 | uint32_t *utf32_decompose_canon(const uint32_t *s, size_t ns, size_t *ndp); | |
47 | char *utf8_decompose_canon(const char *s, size_t ns, size_t *ndp); | |
48 | ||
49 | uint32_t *utf32_decompose_compat(const uint32_t *s, size_t ns, size_t *ndp); | |
50 | char *utf8_decompose_compat(const char *s, size_t ns, size_t *ndp); | |
51 | ||
52 | uint32_t *utf32_casefold_canon(const uint32_t *s, size_t ns, size_t *ndp); | |
53 | char *utf8_casefold_canon(const char *s, size_t ns, size_t *ndp); | |
54 | ||
55 | uint32_t *utf32_casefold_compat(const uint32_t *s, size_t ns, size_t *ndp); | |
56 | char *utf8_casefold_compat(const char *s, size_t ns, size_t *ndp); | |
57 | ||
1625e11a | 58 | int utf32_is_grapheme_boundary(const uint32_t *s, size_t ns, size_t n); |
0b7052da | 59 | int utf32_is_word_boundary(const uint32_t *s, size_t ns, size_t n); |
e5a5a138 | 60 | |
092f426f RK |
61 | utf32_iterator utf32_iterator_new(const uint32_t *s, size_t ns); |
62 | void utf32_iterator_destroy(utf32_iterator it); | |
63 | ||
64 | size_t utf32_iterator_where(utf32_iterator it); | |
65 | int utf32_iterator_set(utf32_iterator it, size_t n); | |
66 | int utf32_iterator_advance(utf32_iterator it, size_t n); | |
67 | uint32_t utf32_iterator_code(utf32_iterator it); | |
68 | int utf32_iterator_grapheme_boundary(utf32_iterator it); | |
69 | int utf32_iterator_word_boundary(utf32_iterator it); | |
70 | ||
e5a5a138 RK |
71 | #endif /* UNICODE_H */ |
72 | ||
73 | /* | |
74 | Local Variables: | |
75 | c-basic-offset:2 | |
76 | comment-column:40 | |
77 | fill-column:79 | |
78 | indent-tabs-mode:nil | |
79 | End: | |
80 | */ |