diff options
| author | Jörg Frings-Fürst <debian@jff.email> | 2018-07-08 23:15:22 +0200 |
|---|---|---|
| committer | Jörg Frings-Fürst <debian@jff.email> | 2018-07-08 23:15:22 +0200 |
| commit | 853c9cf3718db7c9f6d723e45031016231e1cbd1 (patch) | |
| tree | e6a5cafe819de3d14665da32bfd87259b089ec02 /doc | |
| parent | 7b350538dddb27a4513158cb6b6405b85f175ad1 (diff) | |
| parent | 10bd216b0099d2ae8cb22c664fb725165096f95c (diff) | |
Merge branch 'release/debian/0.9.10-1'debian/0.9.10-1
Diffstat (limited to 'doc')
37 files changed, 5061 insertions, 4438 deletions
diff --git a/doc/Makefile.am b/doc/Makefile.am index bca3aebc..de7647e8 100644 --- a/doc/Makefile.am +++ b/doc/Makefile.am @@ -1,5 +1,5 @@ ## Makefile for the doc subdirectory of GNU libunistring. -## Copyright (C) 2009, 2011 Free Software Foundation, Inc. +## Copyright (C) 2009, 2011, 2017 Free Software Foundation, Inc. ## ## This program is free software: you can redistribute it and/or modify ## it under the terms of the GNU General Public License as published by @@ -34,7 +34,7 @@ info_TEXINFOS = libunistring.texi libunistring_TEXINFOS = \ unitypes.texi unistr.texi uniconv.texi unistdio.texi uniname.texi \ unictype.texi uniwidth.texi unigbrk.texi uniwbrk.texi unilbrk.texi \ - uninorm.texi unicase.texi uniregex.texi \ + uninorm.texi unicase.texi uniregex.texi wchar_t.texi \ gpl.texi lgpl.texi fdl.texi # The dependencies of stamp-vti generated by automake are incomplete. diff --git a/doc/Makefile.in b/doc/Makefile.in index e252e9de..1568e873 100644 --- a/doc/Makefile.in +++ b/doc/Makefile.in @@ -1,7 +1,7 @@ -# Makefile.in generated by automake 1.15 from Makefile.am. +# Makefile.in generated by automake 1.15.1 from Makefile.am. # @configure_input@ -# Copyright (C) 1994-2014 Free Software Foundation, Inc. +# Copyright (C) 1994-2017 Free Software Foundation, Inc. # This Makefile.in is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, @@ -806,6 +806,7 @@ HAVE_DECL_STRTOK_R = @HAVE_DECL_STRTOK_R@ HAVE_DECL_STRTOUMAX = @HAVE_DECL_STRTOUMAX@ HAVE_DECL_TANL = @HAVE_DECL_TANL@ HAVE_DECL_TRUNC = @HAVE_DECL_TRUNC@ +HAVE_DECL_TRUNCATE = @HAVE_DECL_TRUNCATE@ HAVE_DECL_TRUNCF = @HAVE_DECL_TRUNCF@ HAVE_DECL_TRUNCL = @HAVE_DECL_TRUNCL@ HAVE_DECL_TTYNAME_R = @HAVE_DECL_TTYNAME_R@ @@ -856,6 +857,7 @@ HAVE_HYPOTL = @HAVE_HYPOTL@ HAVE_ILOGB = @HAVE_ILOGB@ HAVE_ILOGBF = @HAVE_ILOGBF@ HAVE_ILOGBL = @HAVE_ILOGBL@ +HAVE_IMAXDIV_T = @HAVE_IMAXDIV_T@ HAVE_INTTYPES_H = @HAVE_INTTYPES_H@ HAVE_ISBLANK = @HAVE_ISBLANK@ HAVE_ISNAND = @HAVE_ISNAND@ @@ -863,6 +865,7 @@ HAVE_ISNANF = @HAVE_ISNANF@ HAVE_ISNANL = @HAVE_ISNANL@ HAVE_ISWBLANK = @HAVE_ISWBLANK@ HAVE_ISWCNTRL = @HAVE_ISWCNTRL@ +HAVE_LANGINFO_ALTMON = @HAVE_LANGINFO_ALTMON@ HAVE_LANGINFO_CODESET = @HAVE_LANGINFO_CODESET@ HAVE_LANGINFO_ERA = @HAVE_LANGINFO_ERA@ HAVE_LANGINFO_H = @HAVE_LANGINFO_H@ @@ -973,7 +976,6 @@ HAVE_TANHF = @HAVE_TANHF@ HAVE_TANL = @HAVE_TANL@ HAVE_TIMEGM = @HAVE_TIMEGM@ HAVE_TIMEZONE_T = @HAVE_TIMEZONE_T@ -HAVE_TRUNCATE = @HAVE_TRUNCATE@ HAVE_TYPE_VOLATILE_SIG_ATOMIC_T = @HAVE_TYPE_VOLATILE_SIG_ATOMIC_T@ HAVE_TZSET = @HAVE_TZSET@ HAVE_UNISTD_H = @HAVE_UNISTD_H@ @@ -1465,7 +1467,7 @@ info_TEXINFOS = libunistring.texi libunistring_TEXINFOS = \ unitypes.texi unistr.texi uniconv.texi unistdio.texi uniname.texi \ unictype.texi uniwidth.texi unigbrk.texi uniwbrk.texi unilbrk.texi \ - uninorm.texi unicase.texi uniregex.texi \ + uninorm.texi unicase.texi uniregex.texi wchar_t.texi \ gpl.texi lgpl.texi fdl.texi diff --git a/doc/libunistring.info b/doc/libunistring.info index d1fdfa25..f6822abb 100644 --- a/doc/libunistring.info +++ b/doc/libunistring.info @@ -1,4 +1,4 @@ -This is libunistring.info, produced by makeinfo version 6.3 from +This is libunistring.info, produced by makeinfo version 6.4 from libunistring.texi. INFO-DIR-SECTION Software development @@ -33,6 +33,7 @@ GNU libunistring * uniregex.h:: Regular expressions * Using the library:: How to link with the library and use it? * More functionality:: More advanced functionality +* The wchar_t mess:: Why ‘wchar_t *’ strings are useless * Licenses:: Licenses * Index:: General Index @@ -46,7 +47,6 @@ Introduction * Locale encodings:: What is a locale encoding? * In-memory representation:: How to represent strings in memory? * char * strings:: What to keep in mind with ‘char *’ strings -* The wchar_t mess:: Why ‘wchar_t *’ strings are useless * Unicode strings:: How are Unicode strings represented? unistr.h @@ -57,6 +57,26 @@ unistr.h * Elementary string functions with memory allocation:: * Elementary string functions on NUL terminated strings:: +Elementary string functions + +* Iterating:: +* Creating Unicode strings:: +* Copying Unicode strings:: +* Comparing Unicode strings:: +* Searching for a character:: +* Counting characters:: + +Elementary string functions on NUL terminated strings + +* Iterating over a NUL terminated Unicode string:: +* Length:: +* Copying a NUL terminated Unicode string:: +* Comparing NUL terminated Unicode strings:: +* Duplicating a NUL terminated Unicode string:: +* Searching for a character in a NUL terminated Unicode string:: +* Searching for a substring:: +* Tokenizing:: + unictype.h * General category:: @@ -181,7 +201,6 @@ as internal in-memory representation. * Locale encodings:: What is a locale encoding? * In-memory representation:: How to represent strings in memory? * char * strings:: What to keep in mind with ‘char *’ strings -* The wchar_t mess:: Why ‘wchar_t *’ strings are useless * Unicode strings:: How are Unicode strings represented? @@ -248,7 +267,7 @@ having text in multiple languages present in the same document or even in the same line of text. But use of Unicode is not everything. Internationalization usually -consists of three features: +consists of four features: • Use of Unicode where needed for text processing. This is what this library is for. • Use of message catalogs for messages shown to the user, This is @@ -257,6 +276,9 @@ consists of three features: numeric formatting, or for sorting of text. This can be done adequately with the POSIX APIs and the implementation of locales in the GNU C library. + • In graphical user interfaces, adapting the GUI to the default text + direction of the current locale (see right-to-left languages + (https://en.wikipedia.org/wiki/Right-to-left)). File: libunistring.info, Node: Locale encodings, Next: In-memory representation, Prev: Unicode and i18n, Up: Introduction @@ -299,7 +321,7 @@ encoding that was used in this country earlier. The legacy locale encodings, ISO-8859-15 (which supplanted ISO-8859-1 in most of Europe), ISO-8859-2, KOI8-R, EUC-JP, etc., are still in use -in many places, though. +in some places, though. UTF-16 and UTF-32 are not used as locale encodings, because they are not ASCII compatible. @@ -326,8 +348,23 @@ program. • As ‘wchar_t *’, a.k.a. “wide strings”. This approach is misguided, see *note The wchar_t mess::. + Of course, a ‘char *’ string can, in some cases, be encoded in UTF-8. +You will use the data type depending on what you can guarantee about how +it’s encoded: If a string is encoded in the locale encoding, or if you +don’t know how it’s encoded, use ‘char *’. If, on the other hand, you +can _guarantee_ that it is UTF-8 encoded, then you can use the UTF-8 +string type, ‘uint8_t *’, for it. + + The five types ‘char *’, ‘uint8_t *’, ‘uint16_t *’, ‘uint32_t *’, and +‘wchar_t *’ are incompatible types at the C level. Therefore, ‘gcc +-Wall’ will produce a warning if, by mistake, your code contains a +mismatch between these types. In the context of using GNU libunistring, +even a warning about a mismatch between ‘char *’ and ‘uint8_t *’ is a +sign of a bug in your code that you should not try to silence through a +cast. + -File: libunistring.info, Node: char * strings, Next: The wchar_t mess, Prev: In-memory representation, Up: Introduction +File: libunistring.info, Node: char * strings, Next: Unicode strings, Prev: In-memory representation, Up: Introduction 1.5 ‘char *’ strings ==================== @@ -426,53 +463,9 @@ assumptions built-in that are not valid in some languages: in ‘<unicase.h>’, see *note unicase.h::. -File: libunistring.info, Node: The wchar_t mess, Next: Unicode strings, Prev: char * strings, Up: Introduction - -1.6 The ‘wchar_t’ mess -====================== - - The ISO C and POSIX standard creators made an attempt to fix the -first problem mentioned in the previous section. They introduced - • a type ‘wchar_t’, designed to encapsulate an entire character, - • a “wide string” type ‘wchar_t *’, and - • functions declared in ‘<wctype.h>’ that were meant to supplant the - ones in ‘<ctype.h>’. - - Unfortunately, this API and its implementation has numerous problems: - - • On AIX and Windows platforms, ‘wchar_t’ is a 16-bit type. This - means that it can never accommodate an entire Unicode character. - Either the ‘wchar_t *’ strings are limited to characters in UCS-2 - (the “Basic Multilingual Plane” of Unicode), or — if ‘wchar_t *’ - strings are encoded in UTF-16 — a ‘wchar_t’ represents only half of - a character in the worst case, making the ‘<wctype.h>’ functions - pointless. - - • On Solaris and FreeBSD, the ‘wchar_t’ encoding is locale dependent - and undocumented. This means, if you want to know any property of - a ‘wchar_t’ character, other than the properties defined by - ‘<wctype.h>’ — such as whether it’s a dash, currency symbol, - paragraph separator, or similar —, you have to convert it to ‘char - *’ encoding first, by use of the function ‘wctomb’. - - • When you read a stream of wide characters, through the functions - ‘fgetwc’ and ‘fgetws’, and when the input stream/file is not in the - expected encoding, you have no way to determine the invalid byte - sequence and do some corrective action. If you use these - functions, your program becomes “garbage in - more garbage out” or - “garbage in - abort”. - - As a consequence, it is better to use multibyte strings, as explained -in the previous section. Such multibyte strings can bypass limitations -of the ‘wchar_t’ type, if you use functions defined in gnulib and -libunistring for text processing. They can also faithfully transport -malformed characters that were present in the input, without requiring -the program to produce garbage or abort. - - -File: libunistring.info, Node: Unicode strings, Prev: The wchar_t mess, Up: Introduction +File: libunistring.info, Node: Unicode strings, Prev: char * strings, Up: Introduction -1.7 Unicode strings +1.6 Unicode strings =================== libunistring supports Unicode strings in three representations: @@ -572,6 +565,15 @@ File: libunistring.info, Node: unitypes.h, Next: unistr.h, Prev: Conventions, This type represents a single Unicode character, outside of an UTF-32 string. + The types ‘ucs4_t’ and ‘uint32_t’ happen to be identical. They +differ in use and intent, however: + • Use ‘uint32_t *’ to designate an UTF-32 string. Use ‘ucs4_t’ to + designate a single Unicode character, outside of an UTF-32 string. + • Conversions functions that take an UTF-32 string as input will + usually perform a range-check on the ‘uint32_t’ values. Whereas + functions that are declared to take ‘ucs4_t’ arguments will not + perform such a range-check. + File: libunistring.info, Node: unistr.h, Next: uniconv.h, Prev: unitypes.h, Up: Top @@ -618,32 +620,65 @@ forms of Unicode strings. *RESULTBUF, size_t *LENGTHP) Converts an UTF-8 string to an UTF-16 string. + The RESULTBUF and LENGTHP arguments are as described in chapter + *note Conventions::. + -- Function: uint32_t * u8_to_u32 (const uint8_t *S, size_t N, uint32_t *RESULTBUF, size_t *LENGTHP) Converts an UTF-8 string to an UTF-32 string. + The RESULTBUF and LENGTHP arguments are as described in chapter + *note Conventions::. + -- Function: uint8_t * u16_to_u8 (const uint16_t *S, size_t N, uint8_t *RESULTBUF, size_t *LENGTHP) Converts an UTF-16 string to an UTF-8 string. + The RESULTBUF and LENGTHP arguments are as described in chapter + *note Conventions::. + -- Function: uint32_t * u16_to_u32 (const uint16_t *S, size_t N, uint32_t *RESULTBUF, size_t *LENGTHP) Converts an UTF-16 string to an UTF-32 string. + The RESULTBUF and LENGTHP arguments are as described in chapter + *note Conventions::. + -- Function: uint8_t * u32_to_u8 (const uint32_t *S, size_t N, uint8_t *RESULTBUF, size_t *LENGTHP) Converts an UTF-32 string to an UTF-8 string. + The RESULTBUF and LENGTHP arguments are as described in chapter + *note Conventions::. + -- Function: uint16_t * u32_to_u16 (const uint32_t *S, size_t N, uint16_t *RESULTBUF, size_t *LENGTHP) Converts an UTF-32 string to an UTF-16 string. + The RESULTBUF and LENGTHP arguments are as described in chapter + *note Conventions::. + File: libunistring.info, Node: Elementary string functions, Next: Elementary string functions with memory allocation, Prev: Elementary string conversions, Up: unistr.h 4.3 Elementary string functions =============================== +* Menu: + +* Iterating:: +* Creating Unicode strings:: +* Copying Unicode strings:: +* Comparing Unicode strings:: +* Searching for a character:: +* Counting characters:: + + +File: libunistring.info, Node: Iterating, Next: Creating Unicode strings, Up: Elementary string functions + +4.3.1 Iterating over a Unicode string +------------------------------------- + The following functions inspect and return details about the first character in a Unicode string. @@ -657,12 +692,9 @@ character in a Unicode string. This function is similar to ‘mblen’, except that it operates on a Unicode string and that S must not be NULL. - -- Function: int u8_mbtouc_unsafe (ucs4_t *PUC, const uint8_t *S, - size_t N) - -- Function: int u16_mbtouc_unsafe (ucs4_t *PUC, const uint16_t *S, - size_t N) - -- Function: int u32_mbtouc_unsafe (ucs4_t *PUC, const uint32_t *S, - size_t N) + -- Function: int u8_mbtouc (ucs4_t *PUC, const uint8_t *S, size_t N) + -- Function: int u16_mbtouc (ucs4_t *PUC, const uint16_t *S, size_t N) + -- Function: int u32_mbtouc (ucs4_t *PUC, const uint32_t *S, size_t N) Returns the length (number of units) of the first character in S, putting its ‘ucs4_t’ representation in ‘*PUC’. Upon failure, ‘*PUC’ is set to ‘0xfffd’, and an appropriate number of units is @@ -670,16 +702,23 @@ character in a Unicode string. The number of available units, N, must be > 0. + This function fails if an invalid sequence of units is encountered + at the beginning of S, or if additional units (after the N provided + units) would be needed to form a character. + This function is similar to ‘mbtowc’, except that it operates on a Unicode string, PUC and S must not be NULL, N must be > 0, and the NUL character is not treated specially. - -- Function: int u8_mbtouc (ucs4_t *PUC, const uint8_t *S, size_t N) - -- Function: int u16_mbtouc (ucs4_t *PUC, const uint16_t *S, size_t N) - -- Function: int u32_mbtouc (ucs4_t *PUC, const uint32_t *S, size_t N) - This function is like ‘u8_mbtouc_unsafe’, except that it will - detect an invalid UTF-8 character, even if the library is compiled - without ‘--enable-safety’. + -- Function: int u8_mbtouc_unsafe (ucs4_t *PUC, const uint8_t *S, + size_t N) + -- Function: int u16_mbtouc_unsafe (ucs4_t *PUC, const uint16_t *S, + size_t N) + -- Function: int u32_mbtouc_unsafe (ucs4_t *PUC, const uint32_t *S, + size_t N) + This function is identical to + ‘u8_mbtouc’/‘u16_mbtouc’/‘u32_mbtouc’. Earlier versions of this + function performed fewer range-checks on the sequence of units. -- Function: int u8_mbtoucr (ucs4_t *PUC, const uint8_t *S, size_t N) -- Function: int u16_mbtoucr (ucs4_t *PUC, const uint16_t *S, size_t N) @@ -695,6 +734,12 @@ character in a Unicode string. This function is similar to ‘u8_mbtouc’, except that the return value gives more details about the failure, similar to ‘mbrtowc’. + +File: libunistring.info, Node: Creating Unicode strings, Next: Copying Unicode strings, Prev: Iterating, Up: Elementary string functions + +4.3.2 Creating Unicode strings one character at a time +------------------------------------------------------ + The following function stores a Unicode character as a Unicode string in memory. @@ -710,6 +755,12 @@ in memory. Unicode strings, S must not be NULL, and the argument N must be specified. + +File: libunistring.info, Node: Copying Unicode strings, Next: Comparing Unicode strings, Prev: Creating Unicode strings, Up: Elementary string functions + +4.3.3 Copying Unicode strings +----------------------------- + The following functions copy Unicode strings in memory. -- Function: uint8_t * u8_cpy (uint8_t *DEST, const uint8_t *SRC, @@ -746,6 +797,12 @@ in memory. This function is similar to ‘memset’, except that it operates on Unicode strings. + +File: libunistring.info, Node: Comparing Unicode strings, Next: Searching for a character, Prev: Copying Unicode strings, Up: Elementary string functions + +4.3.4 Comparing Unicode strings +------------------------------- + The following function compares two Unicode strings of the same length. @@ -778,6 +835,12 @@ different lengths. This function is similar to the gnulib function ‘memcmp2’, except that it operates on Unicode strings. + +File: libunistring.info, Node: Searching for a character, Next: Counting characters, Prev: Comparing Unicode strings, Up: Elementary string functions + +4.3.5 Searching for a character in a Unicode string +--------------------------------------------------- + The following function searches for a given Unicode character. -- Function: uint8_t * u8_chr (const uint8_t *S, size_t N, ucs4_t UC) @@ -791,6 +854,12 @@ different lengths. This function is similar to ‘memchr’, except that it operates on Unicode strings. + +File: libunistring.info, Node: Counting characters, Prev: Searching for a character, Up: Elementary string functions + +4.3.6 Counting the characters in a Unicode string +------------------------------------------------- + The following function counts the number of Unicode characters. -- Function: size_t u8_mbsnlen (const uint8_t *S, size_t N) @@ -821,6 +890,23 @@ File: libunistring.info, Node: Elementary string functions on NUL terminated st 4.5 Elementary string functions on NUL terminated strings ========================================================= +* Menu: + +* Iterating over a NUL terminated Unicode string:: +* Length:: +* Copying a NUL terminated Unicode string:: +* Comparing NUL terminated Unicode strings:: +* Duplicating a NUL terminated Unicode string:: +* Searching for a character in a NUL terminated Unicode string:: +* Searching for a substring:: +* Tokenizing:: + + +File: libunistring.info, Node: Iterating over a NUL terminated Unicode string, Next: Length, Up: Elementary string functions on NUL terminated strings + +4.5.1 Iterating over a NUL terminated Unicode string +---------------------------------------------------- + The following functions inspect and return details about the first character in a Unicode string. @@ -859,6 +945,12 @@ previous character in a Unicode string. reached. Puts the character’s ‘ucs4_t’ representation in ‘*PUC’. Note that this function works only on well-formed Unicode strings. + +File: libunistring.info, Node: Length, Next: Copying a NUL terminated Unicode string, Prev: Iterating over a NUL terminated Unicode string, Up: Elementary string functions on NUL terminated strings + +4.5.2 Length of a NUL terminated Unicode string +----------------------------------------------- + The following functions determine the length of a Unicode string. -- Function: size_t u8_strlen (const uint8_t *S) @@ -877,6 +969,12 @@ previous character in a Unicode string. This function is similar to ‘strnlen’ and ‘wcsnlen’, except that it operates on Unicode strings. + +File: libunistring.info, Node: Copying a NUL terminated Unicode string, Next: Comparing NUL terminated Unicode strings, Prev: Length, Up: Elementary string functions on NUL terminated strings + +4.5.3 Copying a NUL terminated Unicode string +--------------------------------------------- + The following functions copy portions of Unicode strings in memory. -- Function: uint8_t * u8_strcpy (uint8_t *DEST, const uint8_t *SRC) @@ -946,6 +1044,12 @@ previous character in a Unicode string. This function is similar to ‘strncat’ and ‘wcsncat’, except that it operates on Unicode strings. + +File: libunistring.info, Node: Comparing NUL terminated Unicode strings, Next: Duplicating a NUL terminated Unicode string, Prev: Copying a NUL terminated Unicode string, Up: Elementary string functions on NUL terminated strings + +4.5.4 Comparing NUL terminated Unicode strings +---------------------------------------------- + The following functions compare two Unicode strings. -- Function: int u8_strcmp (const uint8_t *S1, const uint8_t *S2) @@ -984,6 +1088,12 @@ previous character in a Unicode string. This function is similar to ‘strncmp’ and ‘wcsncmp’, except that it operates on Unicode strings. + +File: libunistring.info, Node: Duplicating a NUL terminated Unicode string, Next: Searching for a character in a NUL terminated Unicode string, Prev: Comparing NUL terminated Unicode strings, Up: Elementary string functions on NUL terminated strings + +4.5.5 Duplicating a NUL terminated Unicode string +------------------------------------------------- + The following function allocates a duplicate of a Unicode string. -- Function: uint8_t * u8_strdup (const uint8_t *S) @@ -994,6 +1104,12 @@ previous character in a Unicode string. This function is similar to ‘strdup’ and ‘wcsdup’, except that it operates on Unicode strings. + +File: libunistring.info, Node: Searching for a character in a NUL terminated Unicode string, Next: Searching for a substring, Prev: Duplicating a NUL terminated Unicode string, Up: Elementary string functions on NUL terminated strings + +4.5.6 Searching for a character in a NUL terminated Unicode string +------------------------------------------------------------------ + The following functions search for a given Unicode character. -- Function: uint8_t * u8_strchr (const uint8_t *STR, ucs4_t UC) @@ -1050,6 +1166,12 @@ Unicode character in or outside a given set of Unicode characters. This function is similar to ‘strpbrk’ and ‘wcspbrk’, except that it operates on Unicode strings. + +File: libunistring.info, Node: Searching for a substring, Next: Tokenizing, Prev: Searching for a character in a NUL terminated Unicode string, Up: Elementary string functions on NUL terminated strings + +4.5.7 Searching for a substring in a NUL terminated Unicode string +------------------------------------------------------------------ + The following functions search whether a given Unicode string is a substring of another Unicode string. @@ -1080,6 +1202,12 @@ substring of another Unicode string. *SUFFIX) Tests whether STR ends with SUFFIX. + +File: libunistring.info, Node: Tokenizing, Prev: Searching for a substring, Up: Elementary string functions on NUL terminated strings + +4.5.8 Tokenizing a NUL terminated Unicode string +------------------------------------------------ + The following function does one step in tokenizing a Unicode string. -- Function: uint8_t * u8_strtok (uint8_t *STR, const uint8_t *DELIM, @@ -1562,162 +1690,164 @@ File: libunistring.info, Node: Object oriented API, Next: Bit mask API, Up: G The following are the predefined general category value. Additional general categories may be added in the future. - -- Constant: uc_general_category_t UC_CATEGORY_L - -- Constant: uc_general_category_t UC_CATEGORY_LC - -- Constant: uc_general_category_t UC_CATEGORY_Lu - -- Constant: uc_general_category_t UC_CATEGORY_Ll - -- Constant: uc_general_category_t UC_CATEGORY_Lt - -- Constant: uc_general_category_t UC_CATEGORY_Lm - -- Constant: uc_general_category_t UC_CATEGORY_Lo - -- Constant: uc_general_category_t UC_CATEGORY_M - -- Constant: uc_general_category_t UC_CATEGORY_Mn - -- Constant: uc_general_category_t UC_CATEGORY_Mc - -- Constant: uc_general_category_t UC_CATEGORY_Me - -- Constant: uc_general_category_t UC_CATEGORY_N - -- Constant: uc_general_category_t UC_CATEGORY_Nd - -- Constant: uc_general_category_t UC_CATEGORY_Nl - -- Constant: uc_general_category_t UC_CATEGORY_No - -- Constant: uc_general_category_t UC_CATEGORY_P - -- Constant: uc_general_category_t UC_CATEGORY_Pc - -- Constant: uc_general_category_t UC_CATEGORY_Pd - -- Constant: uc_general_category_t UC_CATEGORY_Ps - -- Constant: uc_general_category_t UC_CATEGORY_Pe - -- Constant: uc_general_category_t UC_CATEGORY_Pi - -- Constant: uc_general_category_t UC_CATEGORY_Pf - -- Constant: uc_general_category_t UC_CATEGORY_Po - -- Constant: uc_general_category_t UC_CATEGORY_S - -- Constant: uc_general_category_t UC_CATEGORY_Sm - -- Constant: uc_general_category_t UC_CATEGORY_Sc - -- Constant: uc_general_category_t UC_CATEGORY_Sk - -- Constant: uc_general_category_t UC_CATEGORY_So - -- Constant: uc_general_category_t UC_CATEGORY_Z - -- Constant: uc_general_category_t UC_CATEGORY_Zs - -- Constant: uc_general_category_t UC_CATEGORY_Zl - -- Constant: uc_general_category_t UC_CATEGORY_Zp - -- Constant: uc_general_category_t UC_CATEGORY_C - -- Constant: uc_general_category_t UC_CATEGORY_Cc - -- Constant: uc_general_category_t UC_CATEGORY_Cf - -- Constant: uc_general_category_t UC_CATEGORY_Cs - -- Constant: uc_general_category_t UC_CATEGORY_Co - -- Constant: uc_general_category_t UC_CATEGORY_Cn - - The following are alias names for predefined General category values. + The ‘UC_CATEGORY_*’ constants reflect the systematic general category +values assigned by the Unicode Consortium. Whereas the other ‘UC_*’ +macros are aliases, for use when readable code is preferred. + -- Constant: uc_general_category_t UC_CATEGORY_L -- Macro: uc_general_category_t UC_LETTER - This is another name for ‘UC_CATEGORY_L’. + This represents the general category “Letter”. + -- Constant: uc_general_category_t UC_CATEGORY_LC -- Macro: uc_general_category_t UC_CASED_LETTER - This is another name for ‘UC_CATEGORY_LC’. + -- Constant: uc_general_category_t UC_CATEGORY_Lu -- Macro: uc_general_category_t UC_UPPERCASE_LETTER - This is another name for ‘UC_CATEGORY_Lu’. + This represents the general category “Letter, uppercase”. + -- Constant: uc_general_category_t UC_CATEGORY_Ll -- Macro: uc_general_category_t UC_LOWERCASE_LETTER - This is another name for ‘UC_CATEGORY_Ll’. + This represents the general category “Letter, lowercase”. + -- Constant: uc_general_category_t UC_CATEGORY_Lt -- Macro: uc_general_category_t UC_TITLECASE_LETTER - This is another name for ‘UC_CATEGORY_Lt’. + This represents the general category “Letter, titlecase”. + -- Constant: uc_general_category_t UC_CATEGORY_Lm -- Macro: uc_general_category_t UC_MODIFIER_LETTER - This is another name for ‘UC_CATEGORY_Lm’. + This represents the general category “Letter, modifier”. + -- Constant: uc_general_category_t UC_CATEGORY_Lo -- Macro: uc_general_category_t UC_OTHER_LETTER - This is another name for ‘UC_CATEGORY_Lo’. + This represents the general category “Letter, other”. + -- Constant: uc_general_category_t UC_CATEGORY_M -- Macro: uc_general_category_t UC_MARK - This is another name for ‘UC_CATEGORY_M’. + This represents the general category “Marker”. + -- Constant: uc_general_category_t UC_CATEGORY_Mn -- Macro: uc_general_category_t UC_NON_SPACING_MARK - This is another name for ‘UC_CATEGORY_Mn’. + This represents the general category “Marker, nonspacing”. + -- Constant: uc_general_category_t UC_CATEGORY_Mc -- Macro: uc_general_category_t UC_COMBINING_SPACING_MARK - This is another name for ‘UC_CATEGORY_Mc’. + This represents the general category “Marker, spacing combining”. + -- Constant: uc_general_category_t UC_CATEGORY_Me -- Macro: uc_general_category_t UC_ENCLOSING_MARK - This is another name for ‘UC_CATEGORY_Me’. + This represents the general category “Marker, enclosing”. + -- Constant: uc_general_category_t UC_CATEGORY_N -- Macro: uc_general_category_t UC_NUMBER - This is another name for ‘UC_CATEGORY_N’. + This represents the general category “Number”. + -- Constant: uc_general_category_t UC_CATEGORY_Nd -- Macro: uc_general_category_t UC_DECIMAL_DIGIT_NUMBER - This is another name for ‘UC_CATEGORY_Nd’. + This represents the general category “Number, decimal digit”. + -- Constant: uc_general_category_t UC_CATEGORY_Nl -- Macro: uc_general_category_t UC_LETTER_NUMBER - This is another name for ‘UC_CATEGORY_Nl’. + This represents the general category “Number, letter”. + -- Constant: uc_general_category_t UC_CATEGORY_No -- Macro: uc_general_category_t UC_OTHER_NUMBER - This is another name for ‘UC_CATEGORY_No’. + This represents the general category “Number, other”. + -- Constant: uc_general_category_t UC_CATEGORY_P -- Macro: uc_general_category_t UC_PUNCTUATION - This is another name for ‘UC_CATEGORY_P’. + This represents the general category “Punctuation”. + -- Constant: uc_general_category_t UC_CATEGORY_Pc -- Macro: uc_general_category_t UC_CONNECTOR_PUNCTUATION - This is another name for ‘UC_CATEGORY_Pc’. + This represents the general category “Punctuation, connector”. + -- Constant: uc_general_category_t UC_CATEGORY_Pd -- Macro: uc_general_category_t UC_DASH_PUNCTUATION - This is another name for ‘UC_CATEGORY_Pd’. + This represents the general category “Punctuation, dash”. + -- Constant: uc_general_category_t UC_CATEGORY_Ps -- Macro: uc_general_category_t UC_OPEN_PUNCTUATION - This is another name for ‘UC_CATEGORY_Ps’ (“start punctuation”). + This represents the general category “Punctuation, open”, a.k.a. + “start punctuation”. + -- Constant: uc_general_category_t UC_CATEGORY_Pe -- Macro: uc_general_category_t UC_CLOSE_PUNCTUATION - This is another name for ‘UC_CATEGORY_Pe’ (“end punctuation”). + This represents the general category “Punctuation, close”, a.k.a. + “end punctuation”. + -- Constant: uc_general_category_t UC_CATEGORY_Pi -- Macro: uc_general_category_t UC_INITIAL_QUOTE_PUNCTUATION - This is another name for ‘UC_CATEGORY_Pi’. + This represents the general category “Punctuation, initial quote”. + -- Constant: uc_general_category_t UC_CATEGORY_Pf -- Macro: uc_general_category_t UC_FINAL_QUOTE_PUNCTUATION - This is another name for ‘UC_CATEGORY_Pf’. + This represents the general category “Punctuation, final quote”. + -- Constant: uc_general_category_t UC_CATEGORY_Po -- Macro: uc_general_category_t UC_OTHER_PUNCTUATION - This is another name for ‘UC_CATEGORY_Po’. + This represents the general category “Punctuation, other”. + -- Constant: uc_general_category_t UC_CATEGORY_S -- Macro: uc_general_category_t UC_SYMBOL - This is another name for ‘UC_CATEGORY_S’. + This represents the general category “Symbol”. + -- Constant: uc_general_category_t UC_CATEGORY_Sm -- Macro: uc_general_category_t UC_MATH_SYMBOL - This is another name for ‘UC_CATEGORY_Sm’. + This represents the general category “Symbol, math”. + -- Constant: uc_general_category_t UC_CATEGORY_Sc -- Macro: uc_general_category_t UC_CURRENCY_SYMBOL - This is another name for ‘UC_CATEGORY_Sc’. + This represents the general category “Symbol, currency”. + -- Constant: uc_general_category_t UC_CATEGORY_Sk -- Macro: uc_general_category_t UC_MODIFIER_SYMBOL - This is another name for ‘UC_CATEGORY_Sk’. + This represents the general category “Symbol, modifier”. + -- Constant: uc_general_category_t UC_CATEGORY_So -- Macro: uc_general_category_t UC_OTHER_SYMBOL - This is another name for ‘UC_CATEGORY_So’. + This represents the general category “Symbol, other”. + -- Constant: uc_general_category_t UC_CATEGORY_Z -- Macro: uc_general_category_t UC_SEPARATOR - This is another name for ‘UC_CATEGORY_Z’. + This represents the general category “Separator”. + -- Constant: uc_general_category_t UC_CATEGORY_Zs -- Macro: uc_general_category_t UC_SPACE_SEPARATOR - This is another name for ‘UC_CATEGORY_Zs’. + This represents the general category “Separator, space”. + -- Constant: uc_general_category_t UC_CATEGORY_Zl -- Macro: uc_general_category_t UC_LINE_SEPARATOR - This is another name for ‘UC_CATEGORY_Zl’. + This represents the general category “Separator, line”. + -- Constant: uc_general_category_t UC_CATEGORY_Zp -- Macro: uc_general_category_t UC_PARAGRAPH_SEPARATOR - This is another name for ‘UC_CATEGORY_Zp’. + This represents the general category “Separator, paragraph”. + -- Constant: uc_general_category_t UC_CATEGORY_C -- Macro: uc_general_category_t UC_OTHER - This is another name for ‘UC_CATEGORY_C’. + This represents the general category “Other”. + -- Constant: uc_general_category_t UC_CATEGORY_Cc -- Macro: uc_general_category_t UC_CONTROL - This is another name for ‘UC_CATEGORY_Cc’. + This represents the general category “Other, control”. + -- Constant: uc_general_category_t UC_CATEGORY_Cf -- Macro: uc_general_category_t UC_FORMAT - This is another name for ‘UC_CATEGORY_Cf’. + This represents the general category “Other, format”. + -- Constant: uc_general_category_t UC_CATEGORY_Cs -- Macro: uc_general_category_t UC_SURROGATE - This is another name for ‘UC_CATEGORY_Cs’. All code points in this - category are invalid characters. + This represents the general category “Other, surrogate”. All code + points in this category are invalid characters. + -- Constant: uc_general_category_t UC_CATEGORY_Co -- Macro: uc_general_category_t UC_PRIVATE_USE - This is another name for ‘UC_CATEGORY_Co’. + This represents the general category “Other, private use”. + -- Constant: uc_general_category_t UC_CATEGORY_Cn -- Macro: uc_general_category_t UC_UNASSIGNED - This is another name for ‘UC_CATEGORY_Cn’. Some code points in - this category are invalid characters. + This represents the general category “Other, not assigned”. Some + code points in this category are invalid characters. The following functions combine general categories, like in a boolean algebra, except that there is no ‘not’ operation. @@ -2972,7 +3102,7 @@ the higher-level functions in the previous section are directly based. described in the Unicode standard, because the standard says that they are preferred. - Note that this function do not handle the case when three ore more + Note that this function does not handle the case when three or more consecutive characters are needed to determine the boundary. Use ‘uc_grapheme_breaks’ for such cases. @@ -3350,6 +3480,9 @@ Unicode string. size_t N, uint32_t *RESULTBUF, size_t *LENGTHP) Returns the specified normalization form of a string. + The RESULTBUF and LENGTHP arguments are as described in chapter + *note Conventions::. + File: libunistring.info, Node: Normalizing comparisons, Next: Normalization of streams, Prev: Normalization of strings, Up: uninorm.h @@ -3385,6 +3518,9 @@ in normalization. NF must be either ‘UNINORM_NFC’ or ‘UNINORM_NFKC’. + The RESULTBUF and LENGTHP arguments are as described in chapter + *note Conventions::. + -- Function: int u8_normcoll (const uint8_t *S1, size_t N1, const uint8_t *S2, size_t N2, uninorm_t NF, int *RESULTP) -- Function: int u16_normcoll (const uint16_t *S1, size_t N1, const @@ -3557,6 +3693,9 @@ locale independent case mappings. The NF argument identifies the normalization form to apply after the case-mapping. It can also be NULL, for no normalization. + The RESULTBUF and LENGTHP arguments are as described in chapter + *note Conventions::. + -- Function: uint8_t * u8_tolower (const uint8_t *S, size_t N, const char *ISO639_LANGUAGE, uninorm_t NF, uint8_t *RESULTBUF, size_t *LENGTHP) @@ -3571,6 +3710,9 @@ locale independent case mappings. The NF argument identifies the normalization form to apply after the case-mapping. It can also be NULL, for no normalization. + The RESULTBUF and LENGTHP arguments are as described in chapter + *note Conventions::. + -- Function: uint8_t * u8_totitle (const uint8_t *S, size_t N, const char *ISO639_LANGUAGE, uninorm_t NF, uint8_t *RESULTBUF, size_t *LENGTHP) @@ -3589,6 +3731,9 @@ locale independent case mappings. The NF argument identifies the normalization form to apply after the case-mapping. It can also be NULL, for no normalization. + The RESULTBUF and LENGTHP arguments are as described in chapter + *note Conventions::. + File: libunistring.info, Node: Case mappings of substrings, Next: Case insensitive comparison, Prev: Case mappings of strings, Up: unicase.h @@ -3682,6 +3827,9 @@ prefix context and the suffix context. Returns the uppercase mapping of a string that is surrounded by a prefix and a suffix. + The RESULTBUF and LENGTHP arguments are as described in chapter + *note Conventions::. + -- Function: uint8_t * u8_ct_tolower (const uint8_t *S, size_t N, casing_prefix_context_t PREFIX_CONTEXT, casing_suffix_context_t SUFFIX_CONTEXT, const char @@ -3700,6 +3848,9 @@ prefix context and the suffix context. Returns the lowercase mapping of a string that is surrounded by a prefix and a suffix. + The RESULTBUF and LENGTHP arguments are as described in chapter + *note Conventions::. + -- Function: uint8_t * u8_ct_totitle (const uint8_t *S, size_t N, casing_prefix_context_t PREFIX_CONTEXT, casing_suffix_context_t SUFFIX_CONTEXT, const char @@ -3718,6 +3869,9 @@ prefix context and the suffix context. Returns the titlecase mapping of a string that is surrounded by a prefix and a suffix. + The RESULTBUF and LENGTHP arguments are as described in chapter + *note Conventions::. + For example, to uppercase the UTF-8 substring between ‘s + start_index’ and ‘s + end_index’ of a string that extends from ‘s’ to ‘s + u8_strlen (s)’, you can use the statements @@ -3757,6 +3911,9 @@ in case and normalization. The NF argument identifies the normalization form to apply after the case-mapping. It can also be NULL, for no normalization. + The RESULTBUF and LENGTHP arguments are as described in chapter + *note Conventions::. + -- Function: uint8_t * u8_ct_casefold (const uint8_t *S, size_t N, casing_prefix_context_t PREFIX_CONTEXT, casing_suffix_context_t SUFFIX_CONTEXT, const char @@ -3775,6 +3932,9 @@ in case and normalization. Returns the case folded string. The case folding takes into account the case mapping contexts of the prefix and suffix strings. + The RESULTBUF and LENGTHP arguments are as described in chapter + *note Conventions::. + -- Function: int u8_casecmp (const uint8_t *S1, size_t N1, const uint8_t *S2, size_t N2, const char *ISO639_LANGUAGE, uninorm_t NF, int *RESULTP) @@ -3818,6 +3978,9 @@ rules of the current locale. NF must be either ‘UNINORM_NFC’, ‘UNINORM_NFKC’, or NULL for no normalization. + The RESULTBUF and LENGTHP arguments are as described in chapter + *note Conventions::. + -- Function: int u8_casecoll (const uint8_t *S1, size_t N1, const uint8_t *S2, size_t N2, const char *ISO639_LANGUAGE, uninorm_t NF, int *RESULTP) @@ -3944,7 +4107,7 @@ the file ‘DEPENDENCIES’. Then you can proceed to build and install the library, as described in the file ‘INSTALL’. For installation on Windows systems, please -refer to the file ‘README.windows’. +refer to the file ‘INSTALL.windows’. File: libunistring.info, Node: Compiler options, Next: Include files, Prev: Installation, Up: Using the library @@ -4065,7 +4228,7 @@ file, please include a description of the options that you passed to the ‘configure’ script. -File: libunistring.info, Node: More functionality, Next: Licenses, Prev: Using the library, Up: Top +File: libunistring.info, Node: More functionality, Next: The wchar_t mess, Prev: Using the library, Up: Top 17 More advanced functionality ****************************** @@ -4078,9 +4241,54 @@ given toolkit (KDE/Qt or GNOME/Gtk), we recommend the Pango library: <http://www.pango.org/>. -File: libunistring.info, Node: Licenses, Next: Index, Prev: More functionality, Up: Top +File: libunistring.info, Node: The wchar_t mess, Next: Licenses, Prev: More functionality, Up: Top + +Appendix A The ‘wchar_t’ mess +***************************** + + The ISO C and POSIX standard creators made an attempt to fix the +first problem mentioned in the section *note char * strings::. They +introduced + • a type ‘wchar_t’, designed to encapsulate an entire character, + • a “wide string” type ‘wchar_t *’, and + • functions declared in ‘<wctype.h>’ that were meant to supplant the + ones in ‘<ctype.h>’. + + Unfortunately, this API and its implementation has numerous problems: + + • On AIX and Windows platforms, ‘wchar_t’ is a 16-bit type. This + means that it can never accommodate an entire Unicode character. + Either the ‘wchar_t *’ strings are limited to characters in UCS-2 + (the “Basic Multilingual Plane” of Unicode), or — if ‘wchar_t *’ + strings are encoded in UTF-16 — a ‘wchar_t’ represents only half of + a character in the worst case, making the ‘<wctype.h>’ functions + pointless. -Appendix A Licenses + • On Solaris and FreeBSD, the ‘wchar_t’ encoding is locale dependent + and undocumented. This means, if you want to know any property of + a ‘wchar_t’ character, other than the properties defined by + ‘<wctype.h>’ — such as whether it’s a dash, currency symbol, + paragraph separator, or similar —, you have to convert it to ‘char + *’ encoding first, by use of the function ‘wctomb’. + + • When you read a stream of wide characters, through the functions + ‘fgetwc’ and ‘fgetws’, and when the input stream/file is not in the + expected encoding, you have no way to determine the invalid byte + sequence and do some corrective action. If you use these + functions, your program becomes “garbage in - more garbage out” or + “garbage in - abort”. + + As a consequence, it is better to use multibyte strings, as explained +in the section *note char * strings::. Such multibyte strings can +bypass limitations of the ‘wchar_t’ type, if you use functions defined +in gnulib and libunistring for text processing. They can also +faithfully transport malformed characters that were present in the +input, without requiring the program to produce garbage or abort. + + +File: libunistring.info, Node: Licenses, Next: Index, Prev: The wchar_t mess, Up: Top + +Appendix B Licenses ******************* The files of this package are covered by the licenses indicated in @@ -4128,7 +4336,7 @@ each particular file or directory. Here is a summary: File: libunistring.info, Node: GNU GPL, Next: GNU LGPL, Up: Licenses -A.1 GNU GENERAL PUBLIC LICENSE +B.1 GNU GENERAL PUBLIC LICENSE ============================== Version 3, 29 June 2007 @@ -4844,7 +5052,7 @@ please read <http://www.gnu.org/philosophy/why-not-lgpl.html>. File: libunistring.info, Node: GNU LGPL, Next: GNU FDL, Prev: GNU GPL, Up: Licenses -A.2 GNU LESSER GENERAL PUBLIC LICENSE +B.2 GNU LESSER GENERAL PUBLIC LICENSE ===================================== Version 3, 29 June 2007 @@ -5016,7 +5224,7 @@ supplemented by the additional permissions listed below. File: libunistring.info, Node: GNU FDL, Prev: GNU LGPL, Up: Licenses -A.3 GNU Free Documentation License +B.3 GNU Free Documentation License ================================== Version 1.3, 3 November 2008 @@ -5536,50 +5744,49 @@ Index * char, type: char * strings. (line 22) * combining, Unicode characters: Composition of characters. (line 6) -* comparing: Elementary string functions. - (line 108) -* comparing <1>: Elementary string functions on NUL terminated strings. - (line 131) +* comparing: Comparing Unicode strings. + (line 6) +* comparing <1>: Comparing NUL terminated Unicode strings. + (line 6) * comparing, ignoring case: Case insensitive comparison. (line 6) * comparing, ignoring case, with collation rules: Case insensitive comparison. - (line 65) + (line 71) * comparing, ignoring normalization: Normalizing comparisons. (line 6) * comparing, ignoring normalization and case: Case insensitive comparison. (line 6) * comparing, ignoring normalization and case, with collation rules: Case insensitive comparison. - (line 65) + (line 71) * comparing, ignoring normalization, with collation rules: Normalizing comparisons. (line 22) -* comparing, with collation rules: Elementary string functions on NUL terminated strings. - (line 143) +* comparing, with collation rules: Comparing NUL terminated Unicode strings. + (line 18) * comparing, with collation rules, ignoring case: Case insensitive comparison. - (line 65) + (line 71) * comparing, with collation rules, ignoring normalization: Normalizing comparisons. (line 22) * comparing, with collation rules, ignoring normalization and case: Case insensitive comparison. - (line 65) + (line 71) * compiler options: Compiler options. (line 24) * composing, Unicode characters: Composition of characters. (line 6) * converting: Elementary string conversions. (line 6) * converting <1>: uniconv.h. (line 45) -* copying: Elementary string functions. - (line 72) -* copying <1>: Elementary string functions on NUL terminated strings. - (line 62) -* counting: Elementary string functions. - (line 153) +* copying: Copying Unicode strings. + (line 6) +* copying <1>: Copying a NUL terminated Unicode string. + (line 6) +* counting: Counting characters. (line 6) * decomposing: Decomposition of characters. (line 6) * dependencies: Installation. (line 6) * detecting case: Case detection. (line 6) * duplicating: Elementary string functions with memory allocation. (line 6) -* duplicating <1>: Elementary string functions on NUL terminated strings. - (line 169) +* duplicating <1>: Duplicating a NUL terminated Unicode string. + (line 6) * enum iconv_ilseq_handler: uniconv.h. (line 29) * FDL, GNU Free Documentation License: GNU FDL. (line 6) * formatted output: unistdio.h. (line 6) @@ -5594,9 +5801,8 @@ Index (line 6) * installation: Installation. (line 10) * internationalization: Unicode and i18n. (line 6) -* iterating: Elementary string functions. - (line 6) -* iterating <1>: Elementary string functions on NUL terminated strings. +* iterating: Iterating. (line 6) +* iterating <1>: Iterating over a NUL terminated Unicode string. (line 15) * Java, programming language: ISO C and Java syntax. (line 6) @@ -5629,12 +5835,12 @@ Index * rendering: More functionality. (line 9) * return value conventions: Conventions. (line 47) * scripts: Scripts. (line 6) -* searching, for a character: Elementary string functions. - (line 140) -* searching, for a character <1>: Elementary string functions on NUL terminated strings. - (line 179) -* searching, for a substring: Elementary string functions on NUL terminated strings. - (line 235) +* searching, for a character: Searching for a character. + (line 6) +* searching, for a character <1>: Searching for a character in a NUL terminated Unicode string. + (line 6) +* searching, for a substring: Searching for a substring. + (line 6) * stream, normalizing a: Normalization of streams. (line 6) * struct uninorm_filter: Normalization of streams. @@ -5644,13 +5850,13 @@ Index * u16_asnprintf: unistdio.h. (line 111) * u16_asprintf: unistdio.h. (line 109) * u16_casecmp: Case insensitive comparison. - (line 48) + (line 54) * u16_casecoll: Case insensitive comparison. - (line 91) + (line 100) * u16_casefold: Case insensitive comparison. (line 12) * u16_casexfrm: Case insensitive comparison. - (line 71) + (line 77) * u16_casing_prefixes_context: Case mappings of substrings. (line 36) * u16_casing_prefix_context: Case mappings of substrings. @@ -5661,28 +5867,28 @@ Index (line 57) * u16_check: Elementary string checks. (line 10) -* u16_chr: Elementary string functions. - (line 143) -* u16_cmp: Elementary string functions. - (line 113) -* u16_cmp2: Elementary string functions. - (line 129) +* u16_chr: Searching for a character. + (line 9) +* u16_cmp: Comparing Unicode strings. + (line 11) +* u16_cmp2: Comparing Unicode strings. + (line 27) * u16_conv_from_encoding: uniconv.h. (line 51) * u16_conv_to_encoding: uniconv.h. (line 88) -* u16_cpy: Elementary string functions. - (line 76) +* u16_cpy: Copying Unicode strings. + (line 10) * u16_cpy_alloc: Elementary string functions with memory allocation. (line 9) * u16_ct_casefold: Case insensitive comparison. - (line 32) + (line 35) * u16_ct_tolower: Case mappings of substrings. - (line 98) + (line 101) * u16_ct_totitle: Case mappings of substrings. - (line 116) + (line 122) * u16_ct_toupper: Case mappings of substrings. (line 80) -* u16_endswith: Elementary string functions on NUL terminated strings. - (line 259) +* u16_endswith: Searching for a substring. + (line 30) * u16_grapheme_breaks: Grapheme cluster breaks in a string. (line 42) * u16_grapheme_next: Grapheme cluster breaks in a string. @@ -5694,94 +5900,86 @@ Index * u16_is_lowercase: Case detection. (line 22) * u16_is_titlecase: Case detection. (line 32) * u16_is_uppercase: Case detection. (line 12) -* u16_mblen: Elementary string functions. - (line 10) -* u16_mbsnlen: Elementary string functions. - (line 156) -* u16_mbtouc: Elementary string functions. - (line 37) -* u16_mbtoucr: Elementary string functions. - (line 44) -* u16_mbtouc_unsafe: Elementary string functions. +* u16_mblen: Iterating. (line 10) +* u16_mbsnlen: Counting characters. (line 9) +* u16_mbtouc: Iterating. (line 20) +* u16_mbtoucr: Iterating. (line 48) +* u16_mbtouc_unsafe: Iterating. (line 39) +* u16_move: Copying Unicode strings. (line 21) -* u16_move: Elementary string functions. - (line 87) -* u16_next: Elementary string functions on NUL terminated strings. +* u16_next: Iterating over a NUL terminated Unicode string. (line 23) * u16_normalize: Normalization of strings. (line 48) * u16_normcmp: Normalizing comparisons. (line 11) * u16_normcoll: Normalizing comparisons. - (line 37) + (line 40) * u16_normxfrm: Normalizing comparisons. (line 24) * u16_possible_linebreaks: unilbrk.h. (line 44) -* u16_prev: Elementary string functions on NUL terminated strings. +* u16_prev: Iterating over a NUL terminated Unicode string. + (line 34) +* u16_set: Copying Unicode strings. (line 34) -* u16_set: Elementary string functions. - (line 100) * u16_snprintf: unistdio.h. (line 107) * u16_sprintf: unistdio.h. (line 106) -* u16_startswith: Elementary string functions on NUL terminated strings. - (line 251) -* u16_stpcpy: Elementary string functions on NUL terminated strings. - (line 75) -* u16_stpncpy: Elementary string functions on NUL terminated strings. - (line 98) -* u16_strcat: Elementary string functions on NUL terminated strings. - (line 111) -* u16_strchr: Elementary string functions on NUL terminated strings. - (line 182) -* u16_strcmp: Elementary string functions on NUL terminated strings. - (line 134) -* u16_strcoll: Elementary string functions on NUL terminated strings. - (line 144) +* u16_startswith: Searching for a substring. + (line 22) +* u16_stpcpy: Copying a NUL terminated Unicode string. + (line 19) +* u16_stpncpy: Copying a NUL terminated Unicode string. + (line 42) +* u16_strcat: Copying a NUL terminated Unicode string. + (line 55) +* u16_strchr: Searching for a character in a NUL terminated Unicode string. + (line 9) +* u16_strcmp: Comparing NUL terminated Unicode strings. + (line 9) +* u16_strcoll: Comparing NUL terminated Unicode strings. + (line 19) * u16_strconv_from_encoding: uniconv.h. (line 127) * u16_strconv_from_locale: uniconv.h. (line 156) * u16_strconv_to_encoding: uniconv.h. (line 140) * u16_strconv_to_locale: uniconv.h. (line 166) -* u16_strcpy: Elementary string functions on NUL terminated strings. - (line 65) -* u16_strcspn: Elementary string functions on NUL terminated strings. - (line 202) -* u16_strdup: Elementary string functions on NUL terminated strings. - (line 172) -* u16_strlen: Elementary string functions on NUL terminated strings. - (line 47) -* u16_strmblen: Elementary string functions on NUL terminated strings. +* u16_strcpy: Copying a NUL terminated Unicode string. + (line 9) +* u16_strcspn: Searching for a character in a NUL terminated Unicode string. + (line 29) +* u16_strdup: Duplicating a NUL terminated Unicode string. + (line 9) +* u16_strlen: Length. (line 9) +* u16_strmblen: Iterating over a NUL terminated Unicode string. (line 10) -* u16_strmbtouc: Elementary string functions on NUL terminated strings. +* u16_strmbtouc: Iterating over a NUL terminated Unicode string. (line 16) -* u16_strncat: Elementary string functions on NUL terminated strings. - (line 122) -* u16_strncmp: Elementary string functions on NUL terminated strings. - (line 160) -* u16_strncpy: Elementary string functions on NUL terminated strings. - (line 87) -* u16_strnlen: Elementary string functions on NUL terminated strings. - (line 55) -* u16_strpbrk: Elementary string functions on NUL terminated strings. - (line 226) -* u16_strrchr: Elementary string functions on NUL terminated strings. - (line 190) -* u16_strspn: Elementary string functions on NUL terminated strings. - (line 214) -* u16_strstr: Elementary string functions on NUL terminated strings. - (line 240) -* u16_strtok: Elementary string functions on NUL terminated strings. - (line 269) +* u16_strncat: Copying a NUL terminated Unicode string. + (line 66) +* u16_strncmp: Comparing NUL terminated Unicode strings. + (line 35) +* u16_strncpy: Copying a NUL terminated Unicode string. + (line 31) +* u16_strnlen: Length. (line 17) +* u16_strpbrk: Searching for a character in a NUL terminated Unicode string. + (line 53) +* u16_strrchr: Searching for a character in a NUL terminated Unicode string. + (line 17) +* u16_strspn: Searching for a character in a NUL terminated Unicode string. + (line 41) +* u16_strstr: Searching for a substring. + (line 11) +* u16_strtok: Tokenizing. (line 10) * u16_strwidth: uniwidth.h. (line 38) * u16_tolower: Case mappings of strings. - (line 41) + (line 44) * u16_totitle: Case mappings of strings. - (line 55) + (line 61) * u16_toupper: Case mappings of strings. (line 27) * u16_to_u32: Elementary string conversions. - (line 21) + (line 30) * u16_to_u8: Elementary string conversions. - (line 17) + (line 23) * u16_u16_asnprintf: unistdio.h. (line 131) * u16_u16_asprintf: unistdio.h. (line 129) * u16_u16_snprintf: unistdio.h. (line 127) @@ -5790,8 +5988,8 @@ Index * u16_u16_vasprintf: unistdio.h. (line 137) * u16_u16_vsnprintf: unistdio.h. (line 135) * u16_u16_vsprintf: unistdio.h. (line 133) -* u16_uctomb: Elementary string functions. - (line 61) +* u16_uctomb: Creating Unicode strings. + (line 10) * u16_vasnprintf: unistdio.h. (line 119) * u16_vasprintf: unistdio.h. (line 117) * u16_vsnprintf: unistdio.h. (line 115) @@ -5803,13 +6001,13 @@ Index * u32_asnprintf: unistdio.h. (line 150) * u32_asprintf: unistdio.h. (line 148) * u32_casecmp: Case insensitive comparison. - (line 51) + (line 57) * u32_casecoll: Case insensitive comparison. - (line 94) + (line 103) * u32_casefold: Case insensitive comparison. (line 15) * u32_casexfrm: Case insensitive comparison. - (line 74) + (line 80) * u32_casing_prefixes_context: Case mappings of substrings. (line 38) * u32_casing_prefix_context: Case mappings of substrings. @@ -5820,28 +6018,28 @@ Index (line 59) * u32_check: Elementary string checks. (line 11) -* u32_chr: Elementary string functions. - (line 145) -* u32_cmp: Elementary string functions. - (line 115) -* u32_cmp2: Elementary string functions. - (line 131) +* u32_chr: Searching for a character. + (line 11) +* u32_cmp: Comparing Unicode strings. + (line 13) +* u32_cmp2: Comparing Unicode strings. + (line 29) * u32_conv_from_encoding: uniconv.h. (line 54) * u32_conv_to_encoding: uniconv.h. (line 91) -* u32_cpy: Elementary string functions. - (line 78) +* u32_cpy: Copying Unicode strings. + (line 12) * u32_cpy_alloc: Elementary string functions with memory allocation. (line 10) * u32_ct_casefold: Case insensitive comparison. - (line 37) + (line 40) * u32_ct_tolower: Case mappings of substrings. - (line 103) + (line 106) * u32_ct_totitle: Case mappings of substrings. - (line 121) + (line 127) * u32_ct_toupper: Case mappings of substrings. (line 85) -* u32_endswith: Elementary string functions on NUL terminated strings. - (line 261) +* u32_endswith: Searching for a substring. + (line 32) * u32_grapheme_breaks: Grapheme cluster breaks in a string. (line 44) * u32_grapheme_next: Grapheme cluster breaks in a string. @@ -5853,94 +6051,86 @@ Index * u32_is_lowercase: Case detection. (line 24) * u32_is_titlecase: Case detection. (line 34) * u32_is_uppercase: Case detection. (line 14) -* u32_mblen: Elementary string functions. - (line 11) -* u32_mbsnlen: Elementary string functions. - (line 157) -* u32_mbtouc: Elementary string functions. - (line 38) -* u32_mbtoucr: Elementary string functions. - (line 45) -* u32_mbtouc_unsafe: Elementary string functions. +* u32_mblen: Iterating. (line 11) +* u32_mbsnlen: Counting characters. (line 10) +* u32_mbtouc: Iterating. (line 21) +* u32_mbtoucr: Iterating. (line 49) +* u32_mbtouc_unsafe: Iterating. (line 41) +* u32_move: Copying Unicode strings. (line 23) -* u32_move: Elementary string functions. - (line 89) -* u32_next: Elementary string functions on NUL terminated strings. +* u32_next: Iterating over a NUL terminated Unicode string. (line 24) * u32_normalize: Normalization of strings. (line 50) * u32_normcmp: Normalizing comparisons. (line 13) * u32_normcoll: Normalizing comparisons. - (line 39) + (line 42) * u32_normxfrm: Normalizing comparisons. (line 26) * u32_possible_linebreaks: unilbrk.h. (line 46) -* u32_prev: Elementary string functions on NUL terminated strings. +* u32_prev: Iterating over a NUL terminated Unicode string. (line 36) -* u32_set: Elementary string functions. - (line 101) +* u32_set: Copying Unicode strings. + (line 35) * u32_snprintf: unistdio.h. (line 146) * u32_sprintf: unistdio.h. (line 145) -* u32_startswith: Elementary string functions on NUL terminated strings. - (line 253) -* u32_stpcpy: Elementary string functions on NUL terminated strings. - (line 77) -* u32_stpncpy: Elementary string functions on NUL terminated strings. - (line 100) -* u32_strcat: Elementary string functions on NUL terminated strings. - (line 113) -* u32_strchr: Elementary string functions on NUL terminated strings. - (line 183) -* u32_strcmp: Elementary string functions on NUL terminated strings. - (line 135) -* u32_strcoll: Elementary string functions on NUL terminated strings. - (line 145) +* u32_startswith: Searching for a substring. + (line 24) +* u32_stpcpy: Copying a NUL terminated Unicode string. + (line 21) +* u32_stpncpy: Copying a NUL terminated Unicode string. + (line 44) +* u32_strcat: Copying a NUL terminated Unicode string. + (line 57) +* u32_strchr: Searching for a character in a NUL terminated Unicode string. + (line 10) +* u32_strcmp: Comparing NUL terminated Unicode strings. + (line 10) +* u32_strcoll: Comparing NUL terminated Unicode strings. + (line 20) * u32_strconv_from_encoding: uniconv.h. (line 129) * u32_strconv_from_locale: uniconv.h. (line 157) * u32_strconv_to_encoding: uniconv.h. (line 142) * u32_strconv_to_locale: uniconv.h. (line 167) -* u32_strcpy: Elementary string functions on NUL terminated strings. - (line 67) -* u32_strcspn: Elementary string functions on NUL terminated strings. - (line 204) -* u32_strdup: Elementary string functions on NUL terminated strings. - (line 173) -* u32_strlen: Elementary string functions on NUL terminated strings. - (line 48) -* u32_strmblen: Elementary string functions on NUL terminated strings. +* u32_strcpy: Copying a NUL terminated Unicode string. + (line 11) +* u32_strcspn: Searching for a character in a NUL terminated Unicode string. + (line 31) +* u32_strdup: Duplicating a NUL terminated Unicode string. + (line 10) +* u32_strlen: Length. (line 10) +* u32_strmblen: Iterating over a NUL terminated Unicode string. (line 11) -* u32_strmbtouc: Elementary string functions on NUL terminated strings. +* u32_strmbtouc: Iterating over a NUL terminated Unicode string. (line 17) -* u32_strncat: Elementary string functions on NUL terminated strings. - (line 124) -* u32_strncmp: Elementary string functions on NUL terminated strings. - (line 162) -* u32_strncpy: Elementary string functions on NUL terminated strings. - (line 89) -* u32_strnlen: Elementary string functions on NUL terminated strings. - (line 56) -* u32_strpbrk: Elementary string functions on NUL terminated strings. - (line 228) -* u32_strrchr: Elementary string functions on NUL terminated strings. - (line 191) -* u32_strspn: Elementary string functions on NUL terminated strings. - (line 216) -* u32_strstr: Elementary string functions on NUL terminated strings. - (line 242) -* u32_strtok: Elementary string functions on NUL terminated strings. - (line 271) +* u32_strncat: Copying a NUL terminated Unicode string. + (line 68) +* u32_strncmp: Comparing NUL terminated Unicode strings. + (line 37) +* u32_strncpy: Copying a NUL terminated Unicode string. + (line 33) +* u32_strnlen: Length. (line 18) +* u32_strpbrk: Searching for a character in a NUL terminated Unicode string. + (line 55) +* u32_strrchr: Searching for a character in a NUL terminated Unicode string. + (line 18) +* u32_strspn: Searching for a character in a NUL terminated Unicode string. + (line 43) +* u32_strstr: Searching for a substring. + (line 13) +* u32_strtok: Tokenizing. (line 12) * u32_strwidth: uniwidth.h. (line 39) * u32_tolower: Case mappings of strings. - (line 44) + (line 47) * u32_totitle: Case mappings of strings. - (line 58) + (line 64) * u32_toupper: Case mappings of strings. (line 30) * u32_to_u16: Elementary string conversions. - (line 29) + (line 44) * u32_to_u8: Elementary string conversions. - (line 25) + (line 37) * u32_u32_asnprintf: unistdio.h. (line 170) * u32_u32_asprintf: unistdio.h. (line 168) * u32_u32_snprintf: unistdio.h. (line 166) @@ -5949,8 +6139,8 @@ Index * u32_u32_vasprintf: unistdio.h. (line 176) * u32_u32_vsnprintf: unistdio.h. (line 174) * u32_u32_vsprintf: unistdio.h. (line 172) -* u32_uctomb: Elementary string functions. - (line 62) +* u32_uctomb: Creating Unicode strings. + (line 11) * u32_vasnprintf: unistdio.h. (line 158) * u32_vasprintf: unistdio.h. (line 156) * u32_vsnprintf: unistdio.h. (line 154) @@ -5962,13 +6152,13 @@ Index * u8_asnprintf: unistdio.h. (line 72) * u8_asprintf: unistdio.h. (line 70) * u8_casecmp: Case insensitive comparison. - (line 45) + (line 51) * u8_casecoll: Case insensitive comparison. - (line 88) + (line 97) * u8_casefold: Case insensitive comparison. (line 9) * u8_casexfrm: Case insensitive comparison. - (line 68) + (line 74) * u8_casing_prefixes_context: Case mappings of substrings. (line 34) * u8_casing_prefix_context: Case mappings of substrings. @@ -5979,28 +6169,28 @@ Index (line 55) * u8_check: Elementary string checks. (line 9) -* u8_chr: Elementary string functions. - (line 142) -* u8_cmp: Elementary string functions. - (line 111) -* u8_cmp2: Elementary string functions. - (line 127) +* u8_chr: Searching for a character. + (line 8) +* u8_cmp: Comparing Unicode strings. + (line 9) +* u8_cmp2: Comparing Unicode strings. + (line 25) * u8_conv_from_encoding: uniconv.h. (line 48) * u8_conv_to_encoding: uniconv.h. (line 85) -* u8_cpy: Elementary string functions. - (line 74) +* u8_cpy: Copying Unicode strings. + (line 8) * u8_cpy_alloc: Elementary string functions with memory allocation. (line 8) * u8_ct_casefold: Case insensitive comparison. - (line 27) + (line 30) * u8_ct_tolower: Case mappings of substrings. - (line 93) + (line 96) * u8_ct_totitle: Case mappings of substrings. - (line 111) + (line 117) * u8_ct_toupper: Case mappings of substrings. (line 75) -* u8_endswith: Elementary string functions on NUL terminated strings. - (line 257) +* u8_endswith: Searching for a substring. + (line 28) * u8_grapheme_breaks: Grapheme cluster breaks in a string. (line 40) * u8_grapheme_next: Grapheme cluster breaks in a string. @@ -6012,94 +6202,86 @@ Index * u8_is_lowercase: Case detection. (line 20) * u8_is_titlecase: Case detection. (line 30) * u8_is_uppercase: Case detection. (line 10) -* u8_mblen: Elementary string functions. - (line 9) -* u8_mbsnlen: Elementary string functions. - (line 155) -* u8_mbtouc: Elementary string functions. - (line 36) -* u8_mbtoucr: Elementary string functions. - (line 43) -* u8_mbtouc_unsafe: Elementary string functions. +* u8_mblen: Iterating. (line 9) +* u8_mbsnlen: Counting characters. (line 8) +* u8_mbtouc: Iterating. (line 19) +* u8_mbtoucr: Iterating. (line 47) +* u8_mbtouc_unsafe: Iterating. (line 37) +* u8_move: Copying Unicode strings. (line 19) -* u8_move: Elementary string functions. - (line 85) -* u8_next: Elementary string functions on NUL terminated strings. +* u8_next: Iterating over a NUL terminated Unicode string. (line 22) * u8_normalize: Normalization of strings. (line 46) * u8_normcmp: Normalizing comparisons. (line 9) * u8_normcoll: Normalizing comparisons. - (line 35) + (line 38) * u8_normxfrm: Normalizing comparisons. (line 22) * u8_possible_linebreaks: unilbrk.h. (line 42) -* u8_prev: Elementary string functions on NUL terminated strings. +* u8_prev: Iterating over a NUL terminated Unicode string. (line 32) -* u8_set: Elementary string functions. - (line 99) +* u8_set: Copying Unicode strings. + (line 33) * u8_snprintf: unistdio.h. (line 68) * u8_sprintf: unistdio.h. (line 67) -* u8_startswith: Elementary string functions on NUL terminated strings. - (line 249) -* u8_stpcpy: Elementary string functions on NUL terminated strings. - (line 74) -* u8_stpncpy: Elementary string functions on NUL terminated strings. - (line 96) -* u8_strcat: Elementary string functions on NUL terminated strings. - (line 110) -* u8_strchr: Elementary string functions on NUL terminated strings. - (line 181) -* u8_strcmp: Elementary string functions on NUL terminated strings. - (line 133) -* u8_strcoll: Elementary string functions on NUL terminated strings. - (line 143) +* u8_startswith: Searching for a substring. + (line 20) +* u8_stpcpy: Copying a NUL terminated Unicode string. + (line 18) +* u8_stpncpy: Copying a NUL terminated Unicode string. + (line 40) +* u8_strcat: Copying a NUL terminated Unicode string. + (line 54) +* u8_strchr: Searching for a character in a NUL terminated Unicode string. + (line 8) +* u8_strcmp: Comparing NUL terminated Unicode strings. + (line 8) +* u8_strcoll: Comparing NUL terminated Unicode strings. + (line 18) * u8_strconv_from_encoding: uniconv.h. (line 125) * u8_strconv_from_locale: uniconv.h. (line 155) * u8_strconv_to_encoding: uniconv.h. (line 138) * u8_strconv_to_locale: uniconv.h. (line 165) -* u8_strcpy: Elementary string functions on NUL terminated strings. - (line 64) -* u8_strcspn: Elementary string functions on NUL terminated strings. - (line 200) -* u8_strdup: Elementary string functions on NUL terminated strings. - (line 171) -* u8_strlen: Elementary string functions on NUL terminated strings. - (line 46) -* u8_strmblen: Elementary string functions on NUL terminated strings. +* u8_strcpy: Copying a NUL terminated Unicode string. + (line 8) +* u8_strcspn: Searching for a character in a NUL terminated Unicode string. + (line 27) +* u8_strdup: Duplicating a NUL terminated Unicode string. + (line 8) +* u8_strlen: Length. (line 8) +* u8_strmblen: Iterating over a NUL terminated Unicode string. (line 9) -* u8_strmbtouc: Elementary string functions on NUL terminated strings. +* u8_strmbtouc: Iterating over a NUL terminated Unicode string. (line 15) -* u8_strncat: Elementary string functions on NUL terminated strings. - (line 120) -* u8_strncmp: Elementary string functions on NUL terminated strings. - (line 158) -* u8_strncpy: Elementary string functions on NUL terminated strings. - (line 85) -* u8_strnlen: Elementary string functions on NUL terminated strings. - (line 54) -* u8_strpbrk: Elementary string functions on NUL terminated strings. - (line 224) -* u8_strrchr: Elementary string functions on NUL terminated strings. - (line 189) -* u8_strspn: Elementary string functions on NUL terminated strings. - (line 212) -* u8_strstr: Elementary string functions on NUL terminated strings. - (line 238) -* u8_strtok: Elementary string functions on NUL terminated strings. - (line 267) +* u8_strncat: Copying a NUL terminated Unicode string. + (line 64) +* u8_strncmp: Comparing NUL terminated Unicode strings. + (line 33) +* u8_strncpy: Copying a NUL terminated Unicode string. + (line 29) +* u8_strnlen: Length. (line 16) +* u8_strpbrk: Searching for a character in a NUL terminated Unicode string. + (line 51) +* u8_strrchr: Searching for a character in a NUL terminated Unicode string. + (line 16) +* u8_strspn: Searching for a character in a NUL terminated Unicode string. + (line 39) +* u8_strstr: Searching for a substring. + (line 9) +* u8_strtok: Tokenizing. (line 8) * u8_strwidth: uniwidth.h. (line 37) * u8_tolower: Case mappings of strings. - (line 38) + (line 41) * u8_totitle: Case mappings of strings. - (line 52) + (line 58) * u8_toupper: Case mappings of strings. (line 24) * u8_to_u16: Elementary string conversions. (line 9) * u8_to_u32: Elementary string conversions. - (line 13) + (line 16) * u8_u8_asnprintf: unistdio.h. (line 92) * u8_u8_asprintf: unistdio.h. (line 90) * u8_u8_snprintf: unistdio.h. (line 88) @@ -6108,8 +6290,8 @@ Index * u8_u8_vasprintf: unistdio.h. (line 98) * u8_u8_vsnprintf: unistdio.h. (line 96) * u8_u8_vsprintf: unistdio.h. (line 94) -* u8_uctomb: Elementary string functions. - (line 60) +* u8_uctomb: Creating Unicode strings. + (line 9) * u8_vasnprintf: unistdio.h. (line 80) * u8_vasprintf: unistdio.h. (line 78) * u8_vsnprintf: unistdio.h. (line 76) @@ -6150,13 +6332,13 @@ Index (line 80) * uc_digit_value: Digit value. (line 10) * uc_fraction_t: Numeric value. (line 12) -* uc_general_category: Object oriented API. (line 219) -* uc_general_category_and: Object oriented API. (line 180) -* uc_general_category_and_not: Object oriented API. (line 187) -* uc_general_category_byname: Object oriented API. (line 209) -* uc_general_category_long_name: Object oriented API. (line 203) -* uc_general_category_name: Object oriented API. (line 197) -* uc_general_category_or: Object oriented API. (line 174) +* uc_general_category: Object oriented API. (line 221) +* uc_general_category_and: Object oriented API. (line 182) +* uc_general_category_and_not: Object oriented API. (line 189) +* uc_general_category_byname: Object oriented API. (line 211) +* uc_general_category_long_name: Object oriented API. (line 205) +* uc_general_category_name: Object oriented API. (line 199) +* uc_general_category_or: Object oriented API. (line 176) * uc_general_category_t: Object oriented API. (line 6) * uc_graphemeclusterbreak_property: Grapheme cluster break property. (line 37) @@ -6177,7 +6359,7 @@ Index (line 9) * uc_is_digit: Classifications like in ISO C. (line 26) -* uc_is_general_category: Object oriented API. (line 224) +* uc_is_general_category: Object oriented API. (line 226) * uc_is_general_category_withtable: Bit mask API. (line 51) * uc_is_graph: Classifications like in ISO C. (line 30) @@ -6408,11 +6590,11 @@ Index * ulc_asnprintf: unistdio.h. (line 49) * ulc_asprintf: unistdio.h. (line 47) * ulc_casecmp: Case insensitive comparison. - (line 54) + (line 60) * ulc_casecoll: Case insensitive comparison. - (line 97) + (line 106) * ulc_casexfrm: Case insensitive comparison. - (line 77) + (line 83) * ulc_fprintf: unistdio.h. (line 184) * ulc_grapheme_breaks: Grapheme cluster breaks in a string. (line 46) @@ -6498,78 +6680,92 @@ Index Tag Table: Node: Top269 -Node: Introduction3400 -Node: Unicode5493 -Node: Unicode and i18n7378 -Node: Locale encodings8848 -Node: In-memory representation11113 -Node: char * strings12239 -Node: The wchar_t mess17727 -Node: Unicode strings20035 -Node: Conventions21220 -Node: unitypes.h23512 -Node: unistr.h24096 -Node: Elementary string checks24661 -Node: Elementary string conversions25283 -Node: Elementary string functions26585 -Node: Elementary string functions with memory allocation33644 -Node: Elementary string functions on NUL terminated strings34266 -Node: uniconv.h46494 -Node: unistdio.h54447 -Node: uniname.h62700 -Node: unictype.h64106 -Node: General category65034 -Node: Object oriented API66089 -Node: Bit mask API75323 -Node: Canonical combining class77618 -Node: Bidi class81852 -Node: Decimal digit value85265 -Node: Digit value85822 -Node: Numeric value86383 -Node: Mirrored character87285 -Node: Arabic shaping87978 -Node: Joining type88451 -Node: Joining group90601 -Node: Properties94039 -Node: Properties as objects94730 -Node: Properties as functions101752 -Node: Scripts107768 -Node: Blocks109173 -Node: ISO C and Java syntax110516 -Node: Classifications like in ISO C112234 -Node: uniwidth.h115046 -Node: unigbrk.h117092 -Node: Grapheme cluster breaks in a string118586 -Node: Grapheme cluster break property121521 -Node: uniwbrk.h123765 -Node: Word breaks in a string124303 -Node: Word break property125395 -Node: unilbrk.h126722 -Node: uninorm.h131018 -Node: Decomposition of characters131655 -Node: Composition of characters135436 -Node: Normalization of strings136149 -Node: Normalizing comparisons138226 -Node: Normalization of streams140628 -Node: unicase.h142753 -Node: Case mappings of characters143442 -Node: Case mappings of strings145591 -Node: Case mappings of substrings148942 -Node: Case insensitive comparison155864 -Node: Case detection161269 -Node: uniregex.h164583 -Node: Using the library164810 -Node: Installation165221 -Node: Compiler options165708 -Node: Include files167348 -Node: Autoconf macro168601 -Node: Reporting problems170241 -Node: More functionality171059 -Node: Licenses171502 -Node: GNU GPL173933 -Node: GNU LGPL211678 -Node: GNU FDL220161 -Node: Index245470 +Node: Introduction3950 +Node: Unicode5971 +Node: Unicode and i18n7856 +Node: Locale encodings9518 +Node: In-memory representation11783 +Node: char * strings13781 +Node: Unicode strings19268 +Node: Conventions20451 +Node: unitypes.h22743 +Node: unistr.h23840 +Node: Elementary string checks24405 +Node: Elementary string conversions25027 +Node: Elementary string functions26905 +Node: Iterating27310 +Node: Creating Unicode strings30140 +Node: Copying Unicode strings31058 +Node: Comparing Unicode strings32671 +Node: Searching for a character34226 +Node: Counting characters35025 +Node: Elementary string functions with memory allocation35708 +Node: Elementary string functions on NUL terminated strings36330 +Node: Iterating over a NUL terminated Unicode string36929 +Node: Length39197 +Node: Copying a NUL terminated Unicode string40255 +Node: Comparing NUL terminated Unicode strings43359 +Node: Duplicating a NUL terminated Unicode string45455 +Node: Searching for a character in a NUL terminated Unicode string46224 +Node: Searching for a substring48988 +Node: Tokenizing50511 +Node: uniconv.h51384 +Node: unistdio.h59337 +Node: uniname.h67590 +Node: unictype.h68996 +Node: General category69924 +Node: Object oriented API70979 +Node: Bit mask API80820 +Node: Canonical combining class83115 +Node: Bidi class87349 +Node: Decimal digit value90762 +Node: Digit value91319 +Node: Numeric value91880 +Node: Mirrored character92782 +Node: Arabic shaping93475 +Node: Joining type93948 +Node: Joining group96098 +Node: Properties99536 +Node: Properties as objects100227 +Node: Properties as functions107249 +Node: Scripts113265 +Node: Blocks114670 +Node: ISO C and Java syntax116013 +Node: Classifications like in ISO C117731 +Node: uniwidth.h120543 +Node: unigbrk.h122589 +Node: Grapheme cluster breaks in a string124083 +Node: Grapheme cluster break property127018 +Node: uniwbrk.h129263 +Node: Word breaks in a string129801 +Node: Word break property130893 +Node: unilbrk.h132220 +Node: uninorm.h136516 +Node: Decomposition of characters137153 +Node: Composition of characters140934 +Node: Normalization of strings141647 +Node: Normalizing comparisons143820 +Node: Normalization of streams146318 +Node: unicase.h148443 +Node: Case mappings of characters149132 +Node: Case mappings of strings151281 +Node: Case mappings of substrings154920 +Node: Case insensitive comparison162130 +Node: Case detection167823 +Node: uniregex.h171137 +Node: Using the library171364 +Node: Installation171775 +Node: Compiler options172263 +Node: Include files173903 +Node: Autoconf macro175156 +Node: Reporting problems176796 +Node: More functionality177614 +Node: The wchar_t mess178065 +Node: Licenses180403 +Node: GNU GPL182832 +Node: GNU LGPL220577 +Node: GNU FDL229060 +Node: Index254369 End Tag Table diff --git a/doc/libunistring.texi b/doc/libunistring.texi index a9c7e0f5..cb5abddf 100644 --- a/doc/libunistring.texi +++ b/doc/libunistring.texi @@ -31,7 +31,19 @@ @include version.texi @c Location of the POSIX specification on the web. -@set POSIXURL http://www.opengroup.org/onlinepubs/9699919799 +@set POSIXURL http://pubs.opengroup.org/onlinepubs/9699919799 + +@c Macro for referencing a POSIX header. +@ifinfo +@macro posixheader{header} +@code{<\header\>} +@end macro +@end ifinfo +@ifnotinfo +@macro posixheader{header} +@uref{@value{POSIXURL}/basedefs/\header\.html,,@code{<\header\>}} +@end macro +@end ifnotinfo @c Macro for referencing a POSIX function. @c We don't write it as func(), see section "GNU Manuals" of the @@ -86,7 +98,7 @@ This manual is for GNU libunistring. @ignore @c This was: @copying but it triggers a makeinfo 4.13 bug -Copyright (C) 2001-2017 Free Software Foundation, Inc. +Copyright (C) 2001-2018 Free Software Foundation, Inc. This manual is free documentation. It is dually licensed under the GNU FDL and the GNU GPL. This means that you can redistribute this @@ -118,7 +130,7 @@ A copy of the license is included in @ref{GNU GPL}. @page @vskip 0pt plus 1filll @c @insertcopying -Copyright (C) 2001-2017 Free Software Foundation, Inc. +Copyright (C) 2001-2018 Free Software Foundation, Inc. This manual is free documentation. It is dually licensed under the GNU FDL and the GNU GPL. This means that you can redistribute this @@ -166,6 +178,7 @@ A copy of the license is included in @ref{GNU GPL}. * uniregex.h:: Regular expressions * Using the library:: How to link with the library and use it? * More functionality:: More advanced functionality +* The wchar_t mess:: Why @code{wchar_t *} strings are useless * Licenses:: Licenses * Index:: General Index @@ -180,7 +193,6 @@ Introduction * Locale encodings:: What is a locale encoding? * In-memory representation:: How to represent strings in memory? * char * strings:: What to keep in mind with @code{char *} strings -* The wchar_t mess:: Why @code{wchar_t *} strings are useless * Unicode strings:: How are Unicode strings represented? unistr.h @@ -191,6 +203,26 @@ unistr.h * Elementary string functions with memory allocation:: * Elementary string functions on NUL terminated strings:: +Elementary string functions + +* Iterating:: +* Creating Unicode strings:: +* Copying Unicode strings:: +* Comparing Unicode strings:: +* Searching for a character:: +* Counting characters:: + +Elementary string functions on NUL terminated strings + +* Iterating over a NUL terminated Unicode string:: +* Length:: +* Copying a NUL terminated Unicode string:: +* Comparing NUL terminated Unicode strings:: +* Duplicating a NUL terminated Unicode string:: +* Searching for a character in a NUL terminated Unicode string:: +* Searching for a substring:: +* Tokenizing:: + unictype.h * General category:: @@ -304,8 +336,8 @@ in general, contain characters of all kinds of scripts. The text processing functions provided by this library handle all scripts and all languages. libunistring is for you if your application already uses the ISO C / POSIX -@code{<ctype.h>}, @code{<wctype.h>} functions and the text it operates on is -provided by the user and can be in any language. +@posixheader{ctype.h}, @posixheader{wctype.h} functions and the text it +operates on is provided by the user and can be in any language. libunistring is also for you if your application uses Unicode strings as internal in-memory representation. @@ -316,7 +348,6 @@ internal in-memory representation. * Locale encodings:: What is a locale encoding? * In-memory representation:: How to represent strings in memory? * char * strings:: What to keep in mind with @code{char *} strings -* The wchar_t mess:: Why @code{wchar_t *} strings are useless * Unicode strings:: How are Unicode strings represented? @end menu @@ -390,7 +421,7 @@ in multiple languages present in the same document or even in the same line of text. But use of Unicode is not everything. Internationalization usually consists -of three features: +of four features: @itemize @bullet @item Use of Unicode where needed for text processing. This is what this library @@ -402,6 +433,10 @@ GNU gettext is about. Use of locale specific conventions for date and time formats, for numeric formatting, or for sorting of text. This can be done adequately with the POSIX APIs and the implementation of locales in the GNU C library. +@item +In graphical user interfaces, adapting the GUI to the default text direction +of the current locale (see +@url{https://en.wikipedia.org/wiki/Right-to-left,right-to-left languages}). @end itemize @node Locale encodings @@ -415,7 +450,7 @@ yet universally implemented and not widely used.) @cindex locale categories The locale is partitioned into several aspects, called the ``categories'' of the locale. The main various aspects are: -@itemize +@itemize @bullet @item The character encoding and the character properties. This is the @code{LC_CTYPE} category. @@ -453,7 +488,7 @@ this country earlier. The legacy locale encodings, ISO-8859-15 (which supplanted ISO-8859-1 in most of Europe), ISO-8859-2, KOI8-R, EUC-JP, etc., are still in use in -many places, though. +some places, though. UTF-16 and UTF-32 are not used as locale encodings, because they are not ASCII compatible. @@ -463,7 +498,7 @@ ASCII compatible. There are three ways of representing strings in memory of a running program. -@itemize +@itemize @bullet @item As @samp{char *} strings. Such strings are represented in locale encoding. This approach is employed when not much text processing is done by the @@ -480,6 +515,21 @@ As @samp{wchar_t *}, a.k.a@. ``wide strings''. This approach is misguided, see @ref{The wchar_t mess}. @end itemize +Of course, a @samp{char *} string can, in some cases, be encoded in UTF-8. +You will use the data type depending on what you can guarantee about how +it's encoded: If a string is encoded in the locale encoding, or if you +don't know how it's encoded, use @samp{char *}. If, on the other hand, +you can @emph{guarantee} that it is UTF-8 encoded, then you can use the +UTF-8 string type, @code{uint8_t *}, for it. + +The five types @code{char *}, @code{uint8_t *}, @code{uint16_t *}, +@code{uint32_t *}, and @code{wchar_t *} are incompatible types at the C +level. Therefore, @samp{gcc -Wall} will produce a warning if, by mistake, +your code contains a mismatch between these types. In the context of +using GNU libunistring, even a warning about a mismatch between +@code{char *} and @code{uint8_t *} is a sign of a bug in your code +that you should not try to silence through a cast. + @node char * strings @section @samp{char *} strings @@ -509,9 +559,9 @@ The important fact to remember is: @end cartouche As a consequence: -@itemize +@itemize @bullet @item -The @code{<ctype.h>} API is useless in this context; it does not work in +The @posixheader{ctype.h} API is useless in this context; it does not work in multibyte locales. @item The @posixfunc{strlen} function does not return the number of characters @@ -546,7 +596,7 @@ functions do not work with multibyte strings. The workarounds can be found in GNU gnulib @url{http://www.gnu.org/software/gnulib/}. -@itemize +@itemize @bullet @item gnulib has modules @samp{mbchar}, @samp{mbiter}, @samp{mbuiter} that represent multibyte characters and allow to iterate across a multibyte @@ -577,7 +627,7 @@ preferable to these functions; see below. @end itemize The second problem with the C library API is that it has some assumptions built-in that are not valid in some languages: -@itemize +@itemize @bullet @item It assumes that there are only two forms of every character: uppercase and lowercase. This is not true for Croatian, where the character @@ -611,58 +661,6 @@ rather than on characters. This is implemented in this library, through the functions declared in @code{<unicase.h>}, see @ref{unicase.h}. -@node The wchar_t mess -@section The @code{wchar_t} mess - -@cindex wchar_t, type -The ISO C and POSIX standard creators made an attempt to fix the first -problem mentioned in the previous section. They introduced -@itemize -@item -a type @samp{wchar_t}, designed to encapsulate an entire character, -@item -a ``wide string'' type @samp{wchar_t *}, and -@item -functions declared in @code{<wctype.h>} that were meant to supplant the -ones in @code{<ctype.h>}. -@end itemize - -Unfortunately, this API and its implementation has numerous problems: - -@itemize -@item -On AIX and Windows platforms, @code{wchar_t} is a 16-bit type. This -means that it can never accommodate an entire Unicode character. Either -the @code{wchar_t *} strings are limited to characters in UCS-2 (the -``Basic Multilingual Plane'' of Unicode), or --- if @code{wchar_t *} -strings are encoded in UTF-16 --- a @code{wchar_t} represents only half -of a character in the worst case, making the @code{<wctype.h>} functions -pointless. - -@item -On Solaris and FreeBSD, the @code{wchar_t} encoding is locale dependent -and undocumented. This means, if you want to know any property of a -@code{wchar_t} character, other than the properties defined by -@code{<wctype.h>} --- such as whether it's a dash, currency symbol, -paragraph separator, or similar ---, you have to convert it to -@code{char *} encoding first, by use of the function @posixfunc{wctomb}. - -@item -When you read a stream of wide characters, through the functions -@posixfunc{fgetwc} and @posixfunc{fgetws}, and when the input stream/file is -not in the expected encoding, you have no way to determine the invalid -byte sequence and do some corrective action. If you use these -functions, your program becomes ``garbage in - more garbage out'' or -``garbage in - abort''. -@end itemize - -As a consequence, it is better to use multibyte strings, as explained in -the previous section. Such multibyte strings can bypass limitations -of the @code{wchar_t} type, if you use functions defined in gnulib and -libunistring for text processing. They can also faithfully transport -malformed characters that were present in the input, without requiring -the program to produce garbage or abort. - @node Unicode strings @section Unicode strings @@ -670,7 +668,7 @@ libunistring supports Unicode strings in three representations: @cindex UTF-8, strings @cindex UTF-16, strings @cindex UTF-32, strings -@itemize +@itemize @bullet @item UTF-8 strings, through the type @samp{uint8_t *}. The units are bytes (@code{uint8_t}). @@ -683,7 +681,7 @@ memory words (@code{uint32_t}). @end itemize As with C strings, there are two variants: -@itemize +@itemize @bullet @item Unicode strings with a terminating NUL character are represented as a pointer to the first unit of the string. There is a unit containing @@ -796,7 +794,7 @@ make sure all dependencies are installed. They are listed in the file @cindex installation Then you can proceed to build and install the library, as described in the file @file{INSTALL}. For installation on Windows systems, please refer to -the file @file{README.windows}. +the file @file{INSTALL.windows}. @node Compiler options @section Compiler options @@ -928,6 +926,8 @@ For the rendering of Unicode strings outside of the context of a given toolkit (KDE/Qt or GNOME/Gtk), we recommend the Pango library: @url{http://www.pango.org/}. +@include wchar_t.texi + @node Licenses @appendix Licenses @cindex Licenses @@ -939,7 +939,7 @@ particular file or directory. Here is a summary: @item The @code{libunistring} library and its header files are dual-licensed under "the GNU LGPLv3+ or the GNU GPLv2". This means, you can use it under either -@itemize +@itemize @bullet @item @minus{} the terms of the GNU Lesser General Public License (LGPL) version 3 or (at your option) any later version, or diff --git a/doc/libunistring_1.html b/doc/libunistring_1.html index 906ce94e..02bf2672 100644 --- a/doc/libunistring_1.html +++ b/doc/libunistring_1.html @@ -1,6 +1,6 @@ <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html401/loose.dtd"> <html> -<!-- Created on November, 30 2017 by texi2html 1.78a --> +<!-- Created on May, 25 2018 by texi2html 1.78a --> <!-- Written by: Lionel Cons <Lionel.Cons@cern.ch> (original author) Karl Berry <karl@freefriends.org> @@ -43,7 +43,7 @@ ul.toc {list-style: none} <table cellpadding="1" cellspacing="1" border="0"> <tr><td valign="middle" align="left">[ << ]</td> -<td valign="middle" align="left">[<a href="libunistring_2.html#SEC9" title="Next chapter"> >> </a>]</td> +<td valign="middle" align="left">[<a href="libunistring_2.html#SEC8" title="Next chapter"> >> </a>]</td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> @@ -51,7 +51,7 @@ ul.toc {list-style: none} <td valign="middle" align="left"> </td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Top" title="Cover (top) of document">Top</a>]</td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Contents" title="Table of contents">Contents</a>]</td> -<td valign="middle" align="left">[<a href="libunistring_19.html#SEC77" title="Index">Index</a>]</td> +<td valign="middle" align="left">[<a href="libunistring_20.html#SEC91" title="Index">Index</a>]</td> <td valign="middle" align="left">[<a href="libunistring_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> @@ -113,8 +113,8 @@ in general, contain characters of all kinds of scripts. The text processing functions provided by this library handle all scripts and all languages. </p> <p>libunistring is for you if your application already uses the ISO C / POSIX -<code><ctype.h></code>, <code><wctype.h></code> functions and the text it operates on is -provided by the user and can be in any language. +<a href="http://pubs.opengroup.org/onlinepubs/9699919799/basedefs/ctype.h.html"><code><ctype.h></code></a>, <a href="http://pubs.opengroup.org/onlinepubs/9699919799/basedefs/wctype.h.html"><code><wctype.h></code></a> functions and the text it +operates on is provided by the user and can be in any language. </p> <p>libunistring is also for you if your application uses Unicode strings as internal in-memory representation. @@ -195,7 +195,7 @@ in multiple languages present in the same document or even in the same line of text. </p> <p>But use of Unicode is not everything. Internationalization usually consists -of three features: +of four features: </p><ul> <li> Use of Unicode where needed for text processing. This is what this library @@ -207,6 +207,10 @@ GNU gettext is about. Use of locale specific conventions for date and time formats, for numeric formatting, or for sorting of text. This can be done adequately with the POSIX APIs and the implementation of locales in the GNU C library. +</li><li> +In graphical user interfaces, adapting the GUI to the default text direction +of the current locale (see +<a href="https://en.wikipedia.org/wiki/Right-to-left">right-to-left languages</a>). </li></ul> <hr size="6"> @@ -221,7 +225,7 @@ yet universally implemented and not widely used.) <a name="IDX7"></a> The locale is partitioned into several aspects, called the “categories” of the locale. The main various aspects are: -</p><ul class="toc"> +</p><ul> <li> The character encoding and the character properties. This is the <code>LC_CTYPE</code> category. @@ -259,7 +263,7 @@ this country earlier. </p> <p>The legacy locale encodings, ISO-8859-15 (which supplanted ISO-8859-1 in most of Europe), ISO-8859-2, KOI8-R, EUC-JP, etc., are still in use in -many places, though. +some places, though. </p> <p>UTF-16 and UTF-32 are not used as locale encodings, because they are not ASCII compatible. @@ -271,7 +275,7 @@ ASCII compatible. <p>There are three ways of representing strings in memory of a running program. -</p><ul class="toc"> +</p><ul> <li> As ‘<samp>char *</samp>’ strings. Such strings are represented in locale encoding. This approach is employed when not much text processing is done by the @@ -285,9 +289,24 @@ a significant amount of text processing, or when the program has multiple threads operating on the same data but in different locales. </li><li> As ‘<samp>wchar_t *</samp>’, a.k.a. “wide strings”. This approach is misguided, -see <a href="#SEC7">The <code>wchar_t</code> mess</a>. +see <a href="libunistring_18.html#SEC81">The <code>wchar_t</code> mess</a>. </li></ul> +<p>Of course, a ‘<samp>char *</samp>’ string can, in some cases, be encoded in UTF-8. +You will use the data type depending on what you can guarantee about how +it's encoded: If a string is encoded in the locale encoding, or if you +don't know how it's encoded, use ‘<samp>char *</samp>’. If, on the other hand, +you can <em>guarantee</em> that it is UTF-8 encoded, then you can use the +UTF-8 string type, <code>uint8_t *</code>, for it. +</p> +<p>The five types <code>char *</code>, <code>uint8_t *</code>, <code>uint16_t *</code>, +<code>uint32_t *</code>, and <code>wchar_t *</code> are incompatible types at the C +level. Therefore, ‘<samp>gcc -Wall</samp>’ will produce a warning if, by mistake, +your code contains a mismatch between these types. In the context of +using GNU libunistring, even a warning about a mismatch between +<code>char *</code> and <code>uint8_t *</code> is a sign of a bug in your code +that you should not try to silence through a cast. +</p> <hr size="6"> <a name="char-_002a-strings"></a> <a name="SEC6"></a> @@ -318,75 +337,75 @@ using multibyte locales. </p></td></tr></table> <p>As a consequence: -</p><ul class="toc"> +</p><ul> <li> -The <code><ctype.h></code> API is useless in this context; it does not work in +The <a href="http://pubs.opengroup.org/onlinepubs/9699919799/basedefs/ctype.h.html"><code><ctype.h></code></a> API is useless in this context; it does not work in multibyte locales. </li><li> -The <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/strlen.html"><code>strlen</code></a> function does not return the number of characters +The <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/strlen.html"><code>strlen</code></a> function does not return the number of characters in a string. Nor does it return the number of screen columns occupied by a string after it is output. It merely returns the number of <em>bytes</em> occupied by a string. </li><li> -Truncating a string, for example, with <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/strncpy.html"><code>strncpy</code></a>, can have the +Truncating a string, for example, with <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/strncpy.html"><code>strncpy</code></a>, can have the effect of truncating it in the middle of a multibyte character. Such a string will, when output, have a garbled character at its end, often represented by a hollow box. </li><li> -<a href="http://www.opengroup.org/onlinepubs/9699919799/functions/strchr.html"><code>strchr</code></a> and <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/strrchr.html"><code>strrchr</code></a> do not work with multibyte strings +<a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/strchr.html"><code>strchr</code></a> and <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/strrchr.html"><code>strrchr</code></a> do not work with multibyte strings if the locale encoding is GB18030 and the character to be searched is a digit. </li><li> -<a href="http://www.opengroup.org/onlinepubs/9699919799/functions/strstr.html"><code>strstr</code></a> does not work with multibyte strings if the locale encoding +<a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/strstr.html"><code>strstr</code></a> does not work with multibyte strings if the locale encoding is different from UTF-8. </li><li> -<a href="http://www.opengroup.org/onlinepubs/9699919799/functions/strcspn.html"><code>strcspn</code></a>, <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/strpbrk.html"><code>strpbrk</code></a>, <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/strspn.html"><code>strspn</code></a> cannot work +<a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/strcspn.html"><code>strcspn</code></a>, <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/strpbrk.html"><code>strpbrk</code></a>, <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/strspn.html"><code>strspn</code></a> cannot work correctly in multibyte locales: they assume the second argument is a list of single-byte characters. Even in this simple case, they do not work with multibyte strings if the locale encoding is GB18030 and one of the characters to be searched is a digit. </li><li> -<a href="http://www.opengroup.org/onlinepubs/9699919799/functions/strsep.html"><code>strsep</code></a> and <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/strtok_r.html"><code>strtok_r</code></a> do not work with multibyte strings +<a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/strsep.html"><code>strsep</code></a> and <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/strtok_r.html"><code>strtok_r</code></a> do not work with multibyte strings unless all of the delimiter characters are ASCII characters < 0x30. </li><li> -The <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/strcasecmp.html"><code>strcasecmp</code></a>, <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/strncasecmp.html"><code>strncasecmp</code></a>, and <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/strcasestr.html"><code>strcasestr</code></a> +The <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/strcasecmp.html"><code>strcasecmp</code></a>, <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/strncasecmp.html"><code>strncasecmp</code></a>, and <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/strcasestr.html"><code>strcasestr</code></a> functions do not work with multibyte strings. </li></ul> <p>The workarounds can be found in GNU gnulib <a href="http://www.gnu.org/software/gnulib/">http://www.gnu.org/software/gnulib/</a>. -</p><ul class="toc"> +</p><ul> <li> gnulib has modules ‘<samp>mbchar</samp>’, ‘<samp>mbiter</samp>’, ‘<samp>mbuiter</samp>’ that represent multibyte characters and allow to iterate across a multibyte string with the same ease as through a unibyte string. </li><li> gnulib has functions <code>mbslen</code> and <code>mbswidth</code> that can be -used instead of <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/strlen.html"><code>strlen</code></a> when the number of characters or the +used instead of <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/strlen.html"><code>strlen</code></a> when the number of characters or the number of screen columns of a string is requested. </li><li> gnulib has functions <code>mbschr</code> and <code>mbsrrchr</code> that are -like <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/strchr.html"><code>strchr</code></a> and <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/strrchr.html"><code>strrchr</code></a>, but work in multibyte locales. +like <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/strchr.html"><code>strchr</code></a> and <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/strrchr.html"><code>strrchr</code></a>, but work in multibyte locales. </li><li> -gnulib has a function <code>mbsstr</code>, like <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/strstr.html"><code>strstr</code></a>, but works +gnulib has a function <code>mbsstr</code>, like <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/strstr.html"><code>strstr</code></a>, but works in multibyte locales. </li><li> gnulib has functions <code>mbscspn</code>, <code>mbspbrk</code>, <code>mbsspn</code> -that are like <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/strcspn.html"><code>strcspn</code></a>, <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/strpbrk.html"><code>strpbrk</code></a>, <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/strspn.html"><code>strspn</code></a>, but +that are like <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/strcspn.html"><code>strcspn</code></a>, <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/strpbrk.html"><code>strpbrk</code></a>, <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/strspn.html"><code>strspn</code></a>, but work in multibyte locales. </li><li> gnulib has functions <code>mbssep</code> and <code>mbstok_r</code> that are -like <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/strsep.html"><code>strsep</code></a> and <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/strtok_r.html"><code>strtok_r</code></a> but work in multibyte locales. +like <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/strsep.html"><code>strsep</code></a> and <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/strtok_r.html"><code>strtok_r</code></a> but work in multibyte locales. </li><li> gnulib has functions <code>mbscasecmp</code>, <code>mbsncasecmp</code>, -<code>mbspcasecmp</code>, and <code>mbscasestr</code> that are like <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/strcasecmp.html"><code>strcasecmp</code></a>, -<a href="http://www.opengroup.org/onlinepubs/9699919799/functions/strncasecmp.html"><code>strncasecmp</code></a>, and <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/strcasestr.html"><code>strcasestr</code></a>, but +<code>mbspcasecmp</code>, and <code>mbscasestr</code> that are like <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/strcasecmp.html"><code>strcasecmp</code></a>, +<a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/strncasecmp.html"><code>strncasecmp</code></a>, and <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/strcasestr.html"><code>strcasestr</code></a>, but work in multibyte locales. Still, the function <code>ulc_casecmp</code> is preferable to these functions; see below. </li></ul> <p>The second problem with the C library API is that it has some assumptions built-in that are not valid in some languages: -</p><ul class="toc"> +</p><ul> <li> It assumes that there are only two forms of every character: uppercase and lowercase. This is not true for Croatian, where the character @@ -418,71 +437,18 @@ to view case transformations as functions that operates on strings, rather than on characters. </li></ol> -<p>This is implemented in this library, through the functions declared in <code><unicase.h></code>, see <a href="libunistring_14.html#SEC54">Case mappings <code><unicase.h></code></a>. -</p> -<hr size="6"> -<a name="The-wchar_005ft-mess"></a> -<a name="SEC7"></a> -<h2 class="section"> <a href="libunistring.html#TOC7">1.6 The <code>wchar_t</code> mess</a> </h2> - -<p>The ISO C and POSIX standard creators made an attempt to fix the first -problem mentioned in the previous section. They introduced -</p><ul class="toc"> -<li> -a type ‘<samp>wchar_t</samp>’, designed to encapsulate an entire character, -</li><li> -a “wide string” type ‘<samp>wchar_t *</samp>’, and -</li><li> -functions declared in <code><wctype.h></code> that were meant to supplant the -ones in <code><ctype.h></code>. -</li></ul> - -<p>Unfortunately, this API and its implementation has numerous problems: -</p> -<ul class="toc"> -<li> -On AIX and Windows platforms, <code>wchar_t</code> is a 16-bit type. This -means that it can never accommodate an entire Unicode character. Either -the <code>wchar_t *</code> strings are limited to characters in UCS-2 (the -“Basic Multilingual Plane” of Unicode), or — if <code>wchar_t *</code> -strings are encoded in UTF-16 — a <code>wchar_t</code> represents only half -of a character in the worst case, making the <code><wctype.h></code> functions -pointless. - -</li><li> -On Solaris and FreeBSD, the <code>wchar_t</code> encoding is locale dependent -and undocumented. This means, if you want to know any property of a -<code>wchar_t</code> character, other than the properties defined by -<code><wctype.h></code> — such as whether it's a dash, currency symbol, -paragraph separator, or similar —, you have to convert it to -<code>char *</code> encoding first, by use of the function <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/wctomb.html"><code>wctomb</code></a>. - -</li><li> -When you read a stream of wide characters, through the functions -<a href="http://www.opengroup.org/onlinepubs/9699919799/functions/fgetwc.html"><code>fgetwc</code></a> and <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/fgetws.html"><code>fgetws</code></a>, and when the input stream/file is -not in the expected encoding, you have no way to determine the invalid -byte sequence and do some corrective action. If you use these -functions, your program becomes “garbage in - more garbage out” or -“garbage in - abort”. -</li></ul> - -<p>As a consequence, it is better to use multibyte strings, as explained in -the previous section. Such multibyte strings can bypass limitations -of the <code>wchar_t</code> type, if you use functions defined in gnulib and -libunistring for text processing. They can also faithfully transport -malformed characters that were present in the input, without requiring -the program to produce garbage or abort. +<p>This is implemented in this library, through the functions declared in <code><unicase.h></code>, see <a href="libunistring_14.html#SEC67">Case mappings <code><unicase.h></code></a>. </p> <hr size="6"> <a name="Unicode-strings"></a> -<a name="SEC8"></a> -<h2 class="section"> <a href="libunistring.html#TOC8">1.7 Unicode strings</a> </h2> +<a name="SEC7"></a> +<h2 class="section"> <a href="libunistring.html#TOC7">1.6 Unicode strings</a> </h2> <p>libunistring supports Unicode strings in three representations: <a name="IDX11"></a> <a name="IDX12"></a> <a name="IDX13"></a> -</p><ul class="toc"> +</p><ul> <li> UTF-8 strings, through the type ‘<samp>uint8_t *</samp>’. The units are bytes (<code>uint8_t</code>). @@ -495,7 +461,7 @@ memory words (<code>uint32_t</code>). </li></ul> <p>As with C strings, there are two variants: -</p><ul class="toc"> +</p><ul> <li> Unicode strings with a terminating NUL character are represented as a pointer to the first unit of the string. There is a unit containing @@ -512,7 +478,7 @@ zero-valued unit used as “end marker”. <hr size="6"> <table cellpadding="1" cellspacing="1" border="0"> <tr><td valign="middle" align="left">[<a href="#SEC1" title="Beginning of this chapter or previous chapter"> << </a>]</td> -<td valign="middle" align="left">[<a href="libunistring_2.html#SEC9" title="Next chapter"> >> </a>]</td> +<td valign="middle" align="left">[<a href="libunistring_2.html#SEC8" title="Next chapter"> >> </a>]</td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> @@ -520,12 +486,12 @@ zero-valued unit used as “end marker”. <td valign="middle" align="left"> </td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Top" title="Cover (top) of document">Top</a>]</td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Contents" title="Table of contents">Contents</a>]</td> -<td valign="middle" align="left">[<a href="libunistring_19.html#SEC77" title="Index">Index</a>]</td> +<td valign="middle" align="left">[<a href="libunistring_20.html#SEC91" title="Index">Index</a>]</td> <td valign="middle" align="left">[<a href="libunistring_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <p> <font size="-1"> - This document was generated by <em>Daiki Ueno</em> on <em>November, 30 2017</em> using <a href="http://www.nongnu.org/texi2html/"><em>texi2html 1.78a</em></a>. + This document was generated by <em>Daiki Ueno</em> on <em>May, 25 2018</em> using <a href="http://www.nongnu.org/texi2html/"><em>texi2html 1.78a</em></a>. </font> <br> diff --git a/doc/libunistring_10.html b/doc/libunistring_10.html index a0f8b4b2..68448fb5 100644 --- a/doc/libunistring_10.html +++ b/doc/libunistring_10.html @@ -1,6 +1,6 @@ <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html401/loose.dtd"> <html> -<!-- Created on November, 30 2017 by texi2html 1.78a --> +<!-- Created on May, 25 2018 by texi2html 1.78a --> <!-- Written by: Lionel Cons <Lionel.Cons@cern.ch> (original author) Karl Berry <karl@freefriends.org> @@ -42,8 +42,8 @@ ul.toc {list-style: none} <body lang="en" bgcolor="#FFFFFF" text="#000000" link="#0000FF" vlink="#800080" alink="#FF0000"> <table cellpadding="1" cellspacing="1" border="0"> -<tr><td valign="middle" align="left">[<a href="libunistring_9.html#SEC40" title="Beginning of this chapter or previous chapter"> << </a>]</td> -<td valign="middle" align="left">[<a href="libunistring_11.html#SEC44" title="Next chapter"> >> </a>]</td> +<tr><td valign="middle" align="left">[<a href="libunistring_9.html#SEC53" title="Beginning of this chapter or previous chapter"> << </a>]</td> +<td valign="middle" align="left">[<a href="libunistring_11.html#SEC57" title="Next chapter"> >> </a>]</td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> @@ -51,14 +51,14 @@ ul.toc {list-style: none} <td valign="middle" align="left"> </td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Top" title="Cover (top) of document">Top</a>]</td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Contents" title="Table of contents">Contents</a>]</td> -<td valign="middle" align="left">[<a href="libunistring_19.html#SEC77" title="Index">Index</a>]</td> +<td valign="middle" align="left">[<a href="libunistring_20.html#SEC91" title="Index">Index</a>]</td> <td valign="middle" align="left">[<a href="libunistring_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <hr size="2"> <a name="unigbrk_002eh"></a> -<a name="SEC41"></a> -<h1 class="chapter"> <a href="libunistring.html#TOC41">10. Grapheme cluster breaks in strings <code><unigbrk.h></code></a> </h1> +<a name="SEC54"></a> +<h1 class="chapter"> <a href="libunistring.html#TOC54">10. Grapheme cluster breaks in strings <code><unigbrk.h></code></a> </h1> <p>This include file declares functions for determining where in a string “grapheme clusters” start and end. A “grapheme cluster” is an @@ -85,21 +85,21 @@ clusters. <hr size="6"> <a name="Grapheme-cluster-breaks-in-a-string"></a> -<a name="SEC42"></a> -<h2 class="section"> <a href="libunistring.html#TOC42">10.1 Grapheme cluster breaks in a string</a> </h2> +<a name="SEC55"></a> +<h2 class="section"> <a href="libunistring.html#TOC55">10.1 Grapheme cluster breaks in a string</a> </h2> <p>The following functions find a single boundary between grapheme clusters in a string. </p> <dl> <dt><u>Function:</u> void <b>u8_grapheme_next</b><i> (const uint8_t *<var>s</var>, const uint8_t *<var>end</var>)</i> -<a name="IDX712"></a> +<a name="IDX703"></a> </dt> <dt><u>Function:</u> void <b>u16_grapheme_next</b><i> (const uint16_t *<var>s</var>, const uint16_t *<var>end</var>)</i> -<a name="IDX713"></a> +<a name="IDX704"></a> </dt> <dt><u>Function:</u> void <b>u32_grapheme_next</b><i> (const uint32_t *<var>s</var>, const uint32_t *<var>end</var>)</i> -<a name="IDX714"></a> +<a name="IDX705"></a> </dt> <dd><p>Returns the start of the next grapheme cluster following <var>s</var>, or <var>end</var> if no grapheme cluster break is encountered before it. @@ -113,13 +113,13 @@ cases. <dl> <dt><u>Function:</u> void <b>u8_grapheme_prev</b><i> (const uint8_t *<var>s</var>, const uint8_t *<var>start</var>)</i> -<a name="IDX715"></a> +<a name="IDX706"></a> </dt> <dt><u>Function:</u> void <b>u16_grapheme_prev</b><i> (const uint16_t *<var>s</var>, const uint16_t *<var>start</var>)</i> -<a name="IDX716"></a> +<a name="IDX707"></a> </dt> <dt><u>Function:</u> void <b>u32_grapheme_prev</b><i> (const uint32_t *<var>s</var>, const uint32_t *<var>start</var>)</i> -<a name="IDX717"></a> +<a name="IDX708"></a> </dt> <dd><p>Returns the start of the grapheme cluster preceding <var>s</var>, or <var>start</var> if no grapheme cluster break is encountered before it. @@ -136,19 +136,19 @@ boundaries in a string. </p> <dl> <dt><u>Function:</u> void <b>u8_grapheme_breaks</b><i> (const uint8_t *<var>s</var>, size_t <var>n</var>, char *<var>p</var>)</i> -<a name="IDX718"></a> +<a name="IDX709"></a> </dt> <dt><u>Function:</u> void <b>u16_grapheme_breaks</b><i> (const uint16_t *<var>s</var>, size_t <var>n</var>, char *<var>p</var>)</i> -<a name="IDX719"></a> +<a name="IDX710"></a> </dt> <dt><u>Function:</u> void <b>u32_grapheme_breaks</b><i> (const uint32_t *<var>s</var>, size_t <var>n</var>, char *<var>p</var>)</i> -<a name="IDX720"></a> +<a name="IDX711"></a> </dt> <dt><u>Function:</u> void <b>ulc_grapheme_breaks</b><i> (const char *<var>s</var>, size_t <var>n</var>, char *<var>p</var>)</i> -<a name="IDX721"></a> +<a name="IDX712"></a> </dt> <dt><u>Function:</u> void <b>uc_grapheme_breaks</b><i> (const ucs_t *<var>s</var>, size_t <var>n</var>, char *<var>p</var>)</i> -<a name="IDX722"></a> +<a name="IDX713"></a> </dt> <dd><p>Determines the grapheme cluster break points in <var>s</var>, an array of <var>n</var> units, and stores the result at <code><var>p</var>[0..<var>nx</var>-1]</code>. @@ -175,8 +175,8 @@ characters. <hr size="6"> <a name="Grapheme-cluster-break-property"></a> -<a name="SEC43"></a> -<h2 class="section"> <a href="libunistring.html#TOC43">10.2 Grapheme cluster break property</a> </h2> +<a name="SEC56"></a> +<h2 class="section"> <a href="libunistring.html#TOC56">10.2 Grapheme cluster break property</a> </h2> <p>This is a more low-level API. The grapheme cluster break property is a property defined in Unicode Standard Annex #29, section “Grapheme Cluster @@ -189,58 +189,58 @@ property. More values may be added in the future. </p> <dl> <dt><u>Constant:</u> int <b>GBP_OTHER</b> -<a name="IDX723"></a> +<a name="IDX714"></a> </dt> <dt><u>Constant:</u> int <b>GBP_CR</b> -<a name="IDX724"></a> +<a name="IDX715"></a> </dt> <dt><u>Constant:</u> int <b>GBP_LF</b> -<a name="IDX725"></a> +<a name="IDX716"></a> </dt> <dt><u>Constant:</u> int <b>GBP_CONTROL</b> -<a name="IDX726"></a> +<a name="IDX717"></a> </dt> <dt><u>Constant:</u> int <b>GBP_EXTEND</b> -<a name="IDX727"></a> +<a name="IDX718"></a> </dt> <dt><u>Constant:</u> int <b>GBP_PREPEND</b> -<a name="IDX728"></a> +<a name="IDX719"></a> </dt> <dt><u>Constant:</u> int <b>GBP_SPACINGMARK</b> -<a name="IDX729"></a> +<a name="IDX720"></a> </dt> <dt><u>Constant:</u> int <b>GBP_L</b> -<a name="IDX730"></a> +<a name="IDX721"></a> </dt> <dt><u>Constant:</u> int <b>GBP_V</b> -<a name="IDX731"></a> +<a name="IDX722"></a> </dt> <dt><u>Constant:</u> int <b>GBP_T</b> -<a name="IDX732"></a> +<a name="IDX723"></a> </dt> <dt><u>Constant:</u> int <b>GBP_LV</b> -<a name="IDX733"></a> +<a name="IDX724"></a> </dt> <dt><u>Constant:</u> int <b>GBP_LVT</b> -<a name="IDX734"></a> +<a name="IDX725"></a> </dt> <dt><u>Constant:</u> int <b>GBP_RI</b> -<a name="IDX735"></a> +<a name="IDX726"></a> </dt> <dt><u>Constant:</u> int <b>GBP_ZWJ</b> -<a name="IDX736"></a> +<a name="IDX727"></a> </dt> <dt><u>Constant:</u> int <b>GBP_EB</b> -<a name="IDX737"></a> +<a name="IDX728"></a> </dt> <dt><u>Constant:</u> int <b>GBP_EM</b> -<a name="IDX738"></a> +<a name="IDX729"></a> </dt> <dt><u>Constant:</u> int <b>GBP_GAZ</b> -<a name="IDX739"></a> +<a name="IDX730"></a> </dt> <dt><u>Constant:</u> int <b>GBP_EBG</b> -<a name="IDX740"></a> +<a name="IDX731"></a> </dt> </dl> @@ -249,7 +249,7 @@ character. </p> <dl> <dt><u>Function:</u> int <b>uc_graphemeclusterbreak_property</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX741"></a> +<a name="IDX732"></a> </dt> <dd><p>Returns the Grapheme_Cluster_Break property of a Unicode character. </p></dd></dl> @@ -260,7 +260,7 @@ the higher-level functions in the previous section are directly based. </p> <dl> <dt><u>Function:</u> bool <b>uc_is_grapheme_break</b><i> (ucs4_t <var>a</var>, ucs4_t <var>b</var>)</i> -<a name="IDX742"></a> +<a name="IDX733"></a> </dt> <dd><p>Returns true if there is an grapheme cluster boundary between Unicode characters <var>a</var> and <var>b</var>. @@ -273,14 +273,14 @@ of text, respectively. described in the Unicode standard, because the standard says that they are preferred. </p> -<p>Note that this function do not handle the case when three ore more +<p>Note that this function does not handle the case when three or more consecutive characters are needed to determine the boundary. Use <code>uc_grapheme_breaks</code> for such cases. </p></dd></dl> <hr size="6"> <table cellpadding="1" cellspacing="1" border="0"> -<tr><td valign="middle" align="left">[<a href="#SEC41" title="Beginning of this chapter or previous chapter"> << </a>]</td> -<td valign="middle" align="left">[<a href="libunistring_11.html#SEC44" title="Next chapter"> >> </a>]</td> +<tr><td valign="middle" align="left">[<a href="#SEC54" title="Beginning of this chapter or previous chapter"> << </a>]</td> +<td valign="middle" align="left">[<a href="libunistring_11.html#SEC57" title="Next chapter"> >> </a>]</td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> @@ -288,12 +288,12 @@ consecutive characters are needed to determine the boundary. Use <td valign="middle" align="left"> </td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Top" title="Cover (top) of document">Top</a>]</td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Contents" title="Table of contents">Contents</a>]</td> -<td valign="middle" align="left">[<a href="libunistring_19.html#SEC77" title="Index">Index</a>]</td> +<td valign="middle" align="left">[<a href="libunistring_20.html#SEC91" title="Index">Index</a>]</td> <td valign="middle" align="left">[<a href="libunistring_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <p> <font size="-1"> - This document was generated by <em>Daiki Ueno</em> on <em>November, 30 2017</em> using <a href="http://www.nongnu.org/texi2html/"><em>texi2html 1.78a</em></a>. + This document was generated by <em>Daiki Ueno</em> on <em>May, 25 2018</em> using <a href="http://www.nongnu.org/texi2html/"><em>texi2html 1.78a</em></a>. </font> <br> diff --git a/doc/libunistring_11.html b/doc/libunistring_11.html index 5677ae8c..c2d55d60 100644 --- a/doc/libunistring_11.html +++ b/doc/libunistring_11.html @@ -1,6 +1,6 @@ <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html401/loose.dtd"> <html> -<!-- Created on November, 30 2017 by texi2html 1.78a --> +<!-- Created on May, 25 2018 by texi2html 1.78a --> <!-- Written by: Lionel Cons <Lionel.Cons@cern.ch> (original author) Karl Berry <karl@freefriends.org> @@ -42,8 +42,8 @@ ul.toc {list-style: none} <body lang="en" bgcolor="#FFFFFF" text="#000000" link="#0000FF" vlink="#800080" alink="#FF0000"> <table cellpadding="1" cellspacing="1" border="0"> -<tr><td valign="middle" align="left">[<a href="libunistring_10.html#SEC41" title="Beginning of this chapter or previous chapter"> << </a>]</td> -<td valign="middle" align="left">[<a href="libunistring_12.html#SEC47" title="Next chapter"> >> </a>]</td> +<tr><td valign="middle" align="left">[<a href="libunistring_10.html#SEC54" title="Beginning of this chapter or previous chapter"> << </a>]</td> +<td valign="middle" align="left">[<a href="libunistring_12.html#SEC60" title="Next chapter"> >> </a>]</td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> @@ -51,14 +51,14 @@ ul.toc {list-style: none} <td valign="middle" align="left"> </td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Top" title="Cover (top) of document">Top</a>]</td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Contents" title="Table of contents">Contents</a>]</td> -<td valign="middle" align="left">[<a href="libunistring_19.html#SEC77" title="Index">Index</a>]</td> +<td valign="middle" align="left">[<a href="libunistring_20.html#SEC91" title="Index">Index</a>]</td> <td valign="middle" align="left">[<a href="libunistring_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <hr size="2"> <a name="uniwbrk_002eh"></a> -<a name="SEC44"></a> -<h1 class="chapter"> <a href="libunistring.html#TOC44">11. Word breaks in strings <code><uniwbrk.h></code></a> </h1> +<a name="SEC57"></a> +<h1 class="chapter"> <a href="libunistring.html#TOC57">11. Word breaks in strings <code><uniwbrk.h></code></a> </h1> <p>This include file declares functions for determining where in a string “words” start and end. Here “words” are not necessarily the same as @@ -69,23 +69,23 @@ operations. <hr size="6"> <a name="Word-breaks-in-a-string"></a> -<a name="SEC45"></a> -<h2 class="section"> <a href="libunistring.html#TOC45">11.1 Word breaks in a string</a> </h2> +<a name="SEC58"></a> +<h2 class="section"> <a href="libunistring.html#TOC58">11.1 Word breaks in a string</a> </h2> <p>The following functions determine the word breaks in a string. </p> <dl> <dt><u>Function:</u> void <b>u8_wordbreaks</b><i> (const uint8_t *<var>s</var>, size_t <var>n</var>, char *<var>p</var>)</i> -<a name="IDX743"></a> +<a name="IDX734"></a> </dt> <dt><u>Function:</u> void <b>u16_wordbreaks</b><i> (const uint16_t *<var>s</var>, size_t <var>n</var>, char *<var>p</var>)</i> -<a name="IDX744"></a> +<a name="IDX735"></a> </dt> <dt><u>Function:</u> void <b>u32_wordbreaks</b><i> (const uint32_t *<var>s</var>, size_t <var>n</var>, char *<var>p</var>)</i> -<a name="IDX745"></a> +<a name="IDX736"></a> </dt> <dt><u>Function:</u> void <b>ulc_wordbreaks</b><i> (const char *<var>s</var>, size_t <var>n</var>, char *<var>p</var>)</i> -<a name="IDX746"></a> +<a name="IDX737"></a> </dt> <dd><p>Determines the word break points in <var>s</var>, an array of <var>n</var> units, and stores the result at <code><var>p</var>[0..<var>n</var>-1]</code>. @@ -106,8 +106,8 @@ word break to be present at the beginning of the string (before <hr size="6"> <a name="Word-break-property"></a> -<a name="SEC46"></a> -<h2 class="section"> <a href="libunistring.html#TOC46">11.2 Word break property</a> </h2> +<a name="SEC59"></a> +<h2 class="section"> <a href="libunistring.html#TOC59">11.2 Word break property</a> </h2> <p>This is a more low-level API. The word break property is a property defined in Unicode Standard Annex #29, section “Word Boundaries”, see @@ -119,70 +119,70 @@ may be added in the future. </p> <dl> <dt><u>Constant:</u> int <b>WBP_OTHER</b> -<a name="IDX747"></a> +<a name="IDX738"></a> </dt> <dt><u>Constant:</u> int <b>WBP_CR</b> -<a name="IDX748"></a> +<a name="IDX739"></a> </dt> <dt><u>Constant:</u> int <b>WBP_LF</b> -<a name="IDX749"></a> +<a name="IDX740"></a> </dt> <dt><u>Constant:</u> int <b>WBP_NEWLINE</b> -<a name="IDX750"></a> +<a name="IDX741"></a> </dt> <dt><u>Constant:</u> int <b>WBP_EXTEND</b> -<a name="IDX751"></a> +<a name="IDX742"></a> </dt> <dt><u>Constant:</u> int <b>WBP_FORMAT</b> -<a name="IDX752"></a> +<a name="IDX743"></a> </dt> <dt><u>Constant:</u> int <b>WBP_KATAKANA</b> -<a name="IDX753"></a> +<a name="IDX744"></a> </dt> <dt><u>Constant:</u> int <b>WBP_ALETTER</b> -<a name="IDX754"></a> +<a name="IDX745"></a> </dt> <dt><u>Constant:</u> int <b>WBP_MIDNUMLET</b> -<a name="IDX755"></a> +<a name="IDX746"></a> </dt> <dt><u>Constant:</u> int <b>WBP_MIDLETTER</b> -<a name="IDX756"></a> +<a name="IDX747"></a> </dt> <dt><u>Constant:</u> int <b>WBP_MIDNUM</b> -<a name="IDX757"></a> +<a name="IDX748"></a> </dt> <dt><u>Constant:</u> int <b>WBP_NUMERIC</b> -<a name="IDX758"></a> +<a name="IDX749"></a> </dt> <dt><u>Constant:</u> int <b>WBP_EXTENDNUMLET</b> -<a name="IDX759"></a> +<a name="IDX750"></a> </dt> <dt><u>Constant:</u> int <b>WBP_RI</b> -<a name="IDX760"></a> +<a name="IDX751"></a> </dt> <dt><u>Constant:</u> int <b>WBP_DQ</b> -<a name="IDX761"></a> +<a name="IDX752"></a> </dt> <dt><u>Constant:</u> int <b>WBP_SQ</b> -<a name="IDX762"></a> +<a name="IDX753"></a> </dt> <dt><u>Constant:</u> int <b>WBP_HL</b> -<a name="IDX763"></a> +<a name="IDX754"></a> </dt> <dt><u>Constant:</u> int <b>WBP_ZWJ</b> -<a name="IDX764"></a> +<a name="IDX755"></a> </dt> <dt><u>Constant:</u> int <b>WBP_EB</b> -<a name="IDX765"></a> +<a name="IDX756"></a> </dt> <dt><u>Constant:</u> int <b>WBP_EM</b> -<a name="IDX766"></a> +<a name="IDX757"></a> </dt> <dt><u>Constant:</u> int <b>WBP_GAZ</b> -<a name="IDX767"></a> +<a name="IDX758"></a> </dt> <dt><u>Constant:</u> int <b>WBP_EBG</b> -<a name="IDX768"></a> +<a name="IDX759"></a> </dt> </dl> @@ -190,14 +190,14 @@ may be added in the future. </p> <dl> <dt><u>Function:</u> int <b>uc_wordbreak_property</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX769"></a> +<a name="IDX760"></a> </dt> <dd><p>Returns the Word_Break property of a Unicode character. </p></dd></dl> <hr size="6"> <table cellpadding="1" cellspacing="1" border="0"> -<tr><td valign="middle" align="left">[<a href="#SEC44" title="Beginning of this chapter or previous chapter"> << </a>]</td> -<td valign="middle" align="left">[<a href="libunistring_12.html#SEC47" title="Next chapter"> >> </a>]</td> +<tr><td valign="middle" align="left">[<a href="#SEC57" title="Beginning of this chapter or previous chapter"> << </a>]</td> +<td valign="middle" align="left">[<a href="libunistring_12.html#SEC60" title="Next chapter"> >> </a>]</td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> @@ -205,12 +205,12 @@ may be added in the future. <td valign="middle" align="left"> </td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Top" title="Cover (top) of document">Top</a>]</td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Contents" title="Table of contents">Contents</a>]</td> -<td valign="middle" align="left">[<a href="libunistring_19.html#SEC77" title="Index">Index</a>]</td> +<td valign="middle" align="left">[<a href="libunistring_20.html#SEC91" title="Index">Index</a>]</td> <td valign="middle" align="left">[<a href="libunistring_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <p> <font size="-1"> - This document was generated by <em>Daiki Ueno</em> on <em>November, 30 2017</em> using <a href="http://www.nongnu.org/texi2html/"><em>texi2html 1.78a</em></a>. + This document was generated by <em>Daiki Ueno</em> on <em>May, 25 2018</em> using <a href="http://www.nongnu.org/texi2html/"><em>texi2html 1.78a</em></a>. </font> <br> diff --git a/doc/libunistring_12.html b/doc/libunistring_12.html index 908c9dd4..3af8c37f 100644 --- a/doc/libunistring_12.html +++ b/doc/libunistring_12.html @@ -1,6 +1,6 @@ <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html401/loose.dtd"> <html> -<!-- Created on November, 30 2017 by texi2html 1.78a --> +<!-- Created on May, 25 2018 by texi2html 1.78a --> <!-- Written by: Lionel Cons <Lionel.Cons@cern.ch> (original author) Karl Berry <karl@freefriends.org> @@ -42,8 +42,8 @@ ul.toc {list-style: none} <body lang="en" bgcolor="#FFFFFF" text="#000000" link="#0000FF" vlink="#800080" alink="#FF0000"> <table cellpadding="1" cellspacing="1" border="0"> -<tr><td valign="middle" align="left">[<a href="libunistring_11.html#SEC44" title="Beginning of this chapter or previous chapter"> << </a>]</td> -<td valign="middle" align="left">[<a href="libunistring_13.html#SEC48" title="Next chapter"> >> </a>]</td> +<tr><td valign="middle" align="left">[<a href="libunistring_11.html#SEC57" title="Beginning of this chapter or previous chapter"> << </a>]</td> +<td valign="middle" align="left">[<a href="libunistring_13.html#SEC61" title="Next chapter"> >> </a>]</td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> @@ -51,14 +51,14 @@ ul.toc {list-style: none} <td valign="middle" align="left"> </td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Top" title="Cover (top) of document">Top</a>]</td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Contents" title="Table of contents">Contents</a>]</td> -<td valign="middle" align="left">[<a href="libunistring_19.html#SEC77" title="Index">Index</a>]</td> +<td valign="middle" align="left">[<a href="libunistring_20.html#SEC91" title="Index">Index</a>]</td> <td valign="middle" align="left">[<a href="libunistring_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <hr size="2"> <a name="unilbrk_002eh"></a> -<a name="SEC47"></a> -<h1 class="chapter"> <a href="libunistring.html#TOC47">12. Line breaking <code><unilbrk.h></code></a> </h1> +<a name="SEC60"></a> +<h1 class="chapter"> <a href="libunistring.html#TOC60">12. Line breaking <code><unilbrk.h></code></a> </h1> <p>This include file declares functions for determining where in a string line breaks could or should be introduced, in order to make the displayed @@ -74,14 +74,14 @@ following meanings: </p> <dl> <dt><u>Constant:</u> int <b>UC_BREAK_MANDATORY</b> -<a name="IDX770"></a> +<a name="IDX761"></a> </dt> <dd><p>This value indicates that <code><var>s</var>[<var>i</var>]</code> is a line break character. </p></dd></dl> <dl> <dt><u>Constant:</u> int <b>UC_BREAK_POSSIBLE</b> -<a name="IDX771"></a> +<a name="IDX762"></a> </dt> <dd><p>This value indicates that a line break may be inserted between <code><var>s</var>[<var>i</var>-1]</code> and <code><var>s</var>[<var>i</var>]</code>. @@ -89,7 +89,7 @@ following meanings: <dl> <dt><u>Constant:</u> int <b>UC_BREAK_HYPHENATION</b> -<a name="IDX772"></a> +<a name="IDX763"></a> </dt> <dd><p>This value indicates that a hyphen and a line break may be inserted between <code><var>s</var>[<var>i</var>-1]</code> and <code><var>s</var>[<var>i</var>]</code>. But beware of language @@ -98,7 +98,7 @@ dependent hyphenation rules. <dl> <dt><u>Constant:</u> int <b>UC_BREAK_PROHIBITED</b> -<a name="IDX773"></a> +<a name="IDX764"></a> </dt> <dd><p>This value indicates that <code><var>s</var>[<var>i</var>-1]</code> and <code><var>s</var>[<var>i</var>]</code> must not be separated. @@ -106,7 +106,7 @@ must not be separated. <dl> <dt><u>Constant:</u> int <b>UC_BREAK_UNDEFINED</b> -<a name="IDX774"></a> +<a name="IDX765"></a> </dt> <dd><p>This value is not used as a return value; rather, in the overriding argument of the <code>u*_width_linebreaks</code> functions, it indicates the absence of an @@ -118,16 +118,16 @@ possible. </p> <dl> <dt><u>Function:</u> void <b>u8_possible_linebreaks</b><i> (const uint8_t *<var>s</var>, size_t <var>n</var>, const char *<var>encoding</var>, char *<var>p</var>)</i> -<a name="IDX775"></a> +<a name="IDX766"></a> </dt> <dt><u>Function:</u> void <b>u16_possible_linebreaks</b><i> (const uint16_t *<var>s</var>, size_t <var>n</var>, const char *<var>encoding</var>, char *<var>p</var>)</i> -<a name="IDX776"></a> +<a name="IDX767"></a> </dt> <dt><u>Function:</u> void <b>u32_possible_linebreaks</b><i> (const uint32_t *<var>s</var>, size_t <var>n</var>, const char *<var>encoding</var>, char *<var>p</var>)</i> -<a name="IDX777"></a> +<a name="IDX768"></a> </dt> <dt><u>Function:</u> void <b>ulc_possible_linebreaks</b><i> (const char *<var>s</var>, size_t <var>n</var>, const char *<var>encoding</var>, char *<var>p</var>)</i> -<a name="IDX778"></a> +<a name="IDX769"></a> </dt> <dd><p>Determines the line break points in <var>s</var>, and stores the result at <code><var>p</var>[0..<var>n</var>-1]</code>. Every <code><var>p</var>[<var>i</var>]</code> is assigned one of @@ -141,19 +141,19 @@ non-proportional fonts. </p> <dl> <dt><u>Function:</u> int <b>u8_width_linebreaks</b><i> (const uint8_t *<var>s</var>, size_t <var>n</var>, int <var>width</var>, int <var>start_column</var>, int <var>at_end_columns</var>, const char *<var>override</var>, const char *<var>encoding</var>, char *<var>p</var>)</i> -<a name="IDX779"></a> +<a name="IDX770"></a> </dt> <dt><u>Function:</u> int <b>u16_width_linebreaks</b><i> (const uint16_t *<var>s</var>, size_t <var>n</var>, int <var>width</var>, int <var>start_column</var>, int <var>at_end_columns</var>, const char *<var>override</var>, const char *<var>encoding</var>, char *<var>p</var>)</i> -<a name="IDX780"></a> +<a name="IDX771"></a> </dt> <dt><u>Function:</u> int <b>u32_width_linebreaks</b><i> (const uint32_t *<var>s</var>, size_t <var>n</var>, int <var>width</var>, int <var>start_column</var>, int <var>at_end_columns</var>, const char *<var>override</var>, const char *<var>encoding</var>, char *<var>p</var>)</i> -<a name="IDX781"></a> +<a name="IDX772"></a> </dt> <dt><u>Function:</u> int <b>ulc_width_linebreaks</b><i> (const char *<var>s</var>, size_t <var>n</var>, int <var>width</var>, int <var>start_column</var>, int <var>at_end_columns</var>, const char *<var>override</var>, const char *<var>encoding</var>, char *<var>p</var>)</i> -<a name="IDX782"></a> +<a name="IDX773"></a> </dt> <dd><p>Chooses the best line breaks, assuming that every character occupies a width -given by the <code>uc_width</code> function (see <a href="libunistring_9.html#SEC40">Display width <code><uniwidth.h></code></a>). +given by the <code>uc_width</code> function (see <a href="libunistring_9.html#SEC53">Display width <code><uniwidth.h></code></a>). </p> <p>The string is <code><var>s</var>[0..<var>n</var>-1]</code>. </p> @@ -177,8 +177,8 @@ the values <code>UC_BREAK_MANDATORY</code>, <code>UC_BREAK_POSSIBLE</code>, </p></dd></dl> <hr size="6"> <table cellpadding="1" cellspacing="1" border="0"> -<tr><td valign="middle" align="left">[<a href="libunistring_11.html#SEC44" title="Beginning of this chapter or previous chapter"> << </a>]</td> -<td valign="middle" align="left">[<a href="libunistring_13.html#SEC48" title="Next chapter"> >> </a>]</td> +<tr><td valign="middle" align="left">[<a href="libunistring_11.html#SEC57" title="Beginning of this chapter or previous chapter"> << </a>]</td> +<td valign="middle" align="left">[<a href="libunistring_13.html#SEC61" title="Next chapter"> >> </a>]</td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> @@ -186,12 +186,12 @@ the values <code>UC_BREAK_MANDATORY</code>, <code>UC_BREAK_POSSIBLE</code>, <td valign="middle" align="left"> </td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Top" title="Cover (top) of document">Top</a>]</td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Contents" title="Table of contents">Contents</a>]</td> -<td valign="middle" align="left">[<a href="libunistring_19.html#SEC77" title="Index">Index</a>]</td> +<td valign="middle" align="left">[<a href="libunistring_20.html#SEC91" title="Index">Index</a>]</td> <td valign="middle" align="left">[<a href="libunistring_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <p> <font size="-1"> - This document was generated by <em>Daiki Ueno</em> on <em>November, 30 2017</em> using <a href="http://www.nongnu.org/texi2html/"><em>texi2html 1.78a</em></a>. + This document was generated by <em>Daiki Ueno</em> on <em>May, 25 2018</em> using <a href="http://www.nongnu.org/texi2html/"><em>texi2html 1.78a</em></a>. </font> <br> diff --git a/doc/libunistring_13.html b/doc/libunistring_13.html index 4edcbca1..96a9f144 100644 --- a/doc/libunistring_13.html +++ b/doc/libunistring_13.html @@ -1,6 +1,6 @@ <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html401/loose.dtd"> <html> -<!-- Created on November, 30 2017 by texi2html 1.78a --> +<!-- Created on May, 25 2018 by texi2html 1.78a --> <!-- Written by: Lionel Cons <Lionel.Cons@cern.ch> (original author) Karl Berry <karl@freefriends.org> @@ -42,8 +42,8 @@ ul.toc {list-style: none} <body lang="en" bgcolor="#FFFFFF" text="#000000" link="#0000FF" vlink="#800080" alink="#FF0000"> <table cellpadding="1" cellspacing="1" border="0"> -<tr><td valign="middle" align="left">[<a href="libunistring_12.html#SEC47" title="Beginning of this chapter or previous chapter"> << </a>]</td> -<td valign="middle" align="left">[<a href="libunistring_14.html#SEC54" title="Next chapter"> >> </a>]</td> +<tr><td valign="middle" align="left">[<a href="libunistring_12.html#SEC60" title="Beginning of this chapter or previous chapter"> << </a>]</td> +<td valign="middle" align="left">[<a href="libunistring_14.html#SEC67" title="Next chapter"> >> </a>]</td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> @@ -51,14 +51,14 @@ ul.toc {list-style: none} <td valign="middle" align="left"> </td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Top" title="Cover (top) of document">Top</a>]</td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Contents" title="Table of contents">Contents</a>]</td> -<td valign="middle" align="left">[<a href="libunistring_19.html#SEC77" title="Index">Index</a>]</td> +<td valign="middle" align="left">[<a href="libunistring_20.html#SEC91" title="Index">Index</a>]</td> <td valign="middle" align="left">[<a href="libunistring_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <hr size="2"> <a name="uninorm_002eh"></a> -<a name="SEC48"></a> -<h1 class="chapter"> <a href="libunistring.html#TOC48">13. Normalization forms (composition and decomposition) <code><uninorm.h></code></a> </h1> +<a name="SEC61"></a> +<h1 class="chapter"> <a href="libunistring.html#TOC61">13. Normalization forms (composition and decomposition) <code><uninorm.h></code></a> </h1> <p>This include file defines functions for transforming Unicode strings to one of the four normal forms, known as NFC, NFD, NKFC, NFKD. These @@ -68,29 +68,29 @@ of Unicode characters. <hr size="6"> <a name="Decomposition-of-characters"></a> -<a name="SEC49"></a> -<h2 class="section"> <a href="libunistring.html#TOC49">13.1 Decomposition of Unicode characters</a> </h2> +<a name="SEC62"></a> +<h2 class="section"> <a href="libunistring.html#TOC62">13.1 Decomposition of Unicode characters</a> </h2> <p>The following enumerated values are the possible types of decomposition of a Unicode character. </p> <dl> <dt><u>Constant:</u> int <b>UC_DECOMP_CANONICAL</b> -<a name="IDX783"></a> +<a name="IDX774"></a> </dt> <dd><p>Denotes canonical decomposition. </p></dd></dl> <dl> <dt><u>Constant:</u> int <b>UC_DECOMP_FONT</b> -<a name="IDX784"></a> +<a name="IDX775"></a> </dt> <dd><p>UCD marker: <code><font></code>. Denotes a font variant (e.g. a blackletter form). </p></dd></dl> <dl> <dt><u>Constant:</u> int <b>UC_DECOMP_NOBREAK</b> -<a name="IDX785"></a> +<a name="IDX776"></a> </dt> <dd><p>UCD marker: <code><noBreak></code>. Denotes a no-break version of a space or hyphen. @@ -98,7 +98,7 @@ Denotes a no-break version of a space or hyphen. <dl> <dt><u>Constant:</u> int <b>UC_DECOMP_INITIAL</b> -<a name="IDX786"></a> +<a name="IDX777"></a> </dt> <dd><p>UCD marker: <code><initial></code>. Denotes an initial presentation form (Arabic). @@ -106,7 +106,7 @@ Denotes an initial presentation form (Arabic). <dl> <dt><u>Constant:</u> int <b>UC_DECOMP_MEDIAL</b> -<a name="IDX787"></a> +<a name="IDX778"></a> </dt> <dd><p>UCD marker: <code><medial></code>. Denotes a medial presentation form (Arabic). @@ -114,7 +114,7 @@ Denotes a medial presentation form (Arabic). <dl> <dt><u>Constant:</u> int <b>UC_DECOMP_FINAL</b> -<a name="IDX788"></a> +<a name="IDX779"></a> </dt> <dd><p>UCD marker: <code><final></code>. Denotes a final presentation form (Arabic). @@ -122,7 +122,7 @@ Denotes a final presentation form (Arabic). <dl> <dt><u>Constant:</u> int <b>UC_DECOMP_ISOLATED</b> -<a name="IDX789"></a> +<a name="IDX780"></a> </dt> <dd><p>UCD marker: <code><isolated></code>. Denotes an isolated presentation form (Arabic). @@ -130,7 +130,7 @@ Denotes an isolated presentation form (Arabic). <dl> <dt><u>Constant:</u> int <b>UC_DECOMP_CIRCLE</b> -<a name="IDX790"></a> +<a name="IDX781"></a> </dt> <dd><p>UCD marker: <code><circle></code>. Denotes an encircled form. @@ -138,7 +138,7 @@ Denotes an encircled form. <dl> <dt><u>Constant:</u> int <b>UC_DECOMP_SUPER</b> -<a name="IDX791"></a> +<a name="IDX782"></a> </dt> <dd><p>UCD marker: <code><super></code>. Denotes a superscript form. @@ -146,7 +146,7 @@ Denotes a superscript form. <dl> <dt><u>Constant:</u> int <b>UC_DECOMP_SUB</b> -<a name="IDX792"></a> +<a name="IDX783"></a> </dt> <dd><p>UCD marker: <code><sub></code>. Denotes a subscript form. @@ -154,7 +154,7 @@ Denotes a subscript form. <dl> <dt><u>Constant:</u> int <b>UC_DECOMP_VERTICAL</b> -<a name="IDX793"></a> +<a name="IDX784"></a> </dt> <dd><p>UCD marker: <code><vertical></code>. Denotes a vertical layout presentation form. @@ -162,7 +162,7 @@ Denotes a vertical layout presentation form. <dl> <dt><u>Constant:</u> int <b>UC_DECOMP_WIDE</b> -<a name="IDX794"></a> +<a name="IDX785"></a> </dt> <dd><p>UCD marker: <code><wide></code>. Denotes a wide (or zenkaku) compatibility character. @@ -170,7 +170,7 @@ Denotes a wide (or zenkaku) compatibility character. <dl> <dt><u>Constant:</u> int <b>UC_DECOMP_NARROW</b> -<a name="IDX795"></a> +<a name="IDX786"></a> </dt> <dd><p>UCD marker: <code><narrow></code>. Denotes a narrow (or hankaku) compatibility character. @@ -178,7 +178,7 @@ Denotes a narrow (or hankaku) compatibility character. <dl> <dt><u>Constant:</u> int <b>UC_DECOMP_SMALL</b> -<a name="IDX796"></a> +<a name="IDX787"></a> </dt> <dd><p>UCD marker: <code><small></code>. Denotes a small variant form (CNS compatibility). @@ -186,7 +186,7 @@ Denotes a small variant form (CNS compatibility). <dl> <dt><u>Constant:</u> int <b>UC_DECOMP_SQUARE</b> -<a name="IDX797"></a> +<a name="IDX788"></a> </dt> <dd><p>UCD marker: <code><square></code>. Denotes a CJK squared font variant. @@ -194,7 +194,7 @@ Denotes a CJK squared font variant. <dl> <dt><u>Constant:</u> int <b>UC_DECOMP_FRACTION</b> -<a name="IDX798"></a> +<a name="IDX789"></a> </dt> <dd><p>UCD marker: <code><fraction></code>. Denotes a vulgar fraction form. @@ -202,7 +202,7 @@ Denotes a vulgar fraction form. <dl> <dt><u>Constant:</u> int <b>UC_DECOMP_COMPAT</b> -<a name="IDX799"></a> +<a name="IDX790"></a> </dt> <dd><p>UCD marker: <code><compat></code>. Denotes an otherwise unspecified compatibility character. @@ -213,7 +213,7 @@ Unicode character. </p> <dl> <dt><u>Macro:</u> unsigned int <b>UC_DECOMPOSITION_MAX_LENGTH</b> -<a name="IDX800"></a> +<a name="IDX791"></a> </dt> <dd><p>This macro expands to a constant that is the required size of buffer passed to the <code>uc_decomposition</code> and <code>uc_canonical_decomposition</code> functions. @@ -223,7 +223,7 @@ the <code>uc_decomposition</code> and <code>uc_canonical_decomposition</code> fu </p> <dl> <dt><u>Function:</u> int <b>uc_decomposition</b><i> (ucs4_t <var>uc</var>, int *<var>decomp_tag</var>, ucs4_t *<var>decomposition</var>)</i> -<a name="IDX801"></a> +<a name="IDX792"></a> </dt> <dd><p>Returns the character decomposition mapping of the Unicode character <var>uc</var>. <var>decomposition</var> must point to an array of at least @@ -236,7 +236,7 @@ returned. <dl> <dt><u>Function:</u> int <b>uc_canonical_decomposition</b><i> (ucs4_t <var>uc</var>, ucs4_t *<var>decomposition</var>)</i> -<a name="IDX802"></a> +<a name="IDX793"></a> </dt> <dd><p>Returns the canonical character decomposition mapping of the Unicode character <var>uc</var>. <var>decomposition</var> must point to an array of at least @@ -253,15 +253,15 @@ function <code>u*_normalize</code> with argument <code>UNINORM_NFD</code> instea <hr size="6"> <a name="Composition-of-characters"></a> -<a name="SEC50"></a> -<h2 class="section"> <a href="libunistring.html#TOC50">13.2 Composition of Unicode characters</a> </h2> +<a name="SEC63"></a> +<h2 class="section"> <a href="libunistring.html#TOC63">13.2 Composition of Unicode characters</a> </h2> <p>The following function composes a Unicode character from two Unicode characters. </p> <dl> <dt><u>Function:</u> ucs4_t <b>uc_composition</b><i> (ucs4_t <var>uc1</var>, ucs4_t <var>uc2</var>)</i> -<a name="IDX803"></a> +<a name="IDX794"></a> </dt> <dd><p>Attempts to combine the Unicode characters <var>uc1</var>, <var>uc2</var>. <var>uc1</var> is known to have canonical combining class 0. @@ -275,15 +275,15 @@ file ‘<tt>CompositionExclusions.txt</tt>’ for details. <hr size="6"> <a name="Normalization-of-strings"></a> -<a name="SEC51"></a> -<h2 class="section"> <a href="libunistring.html#TOC51">13.3 Normalization of strings</a> </h2> +<a name="SEC64"></a> +<h2 class="section"> <a href="libunistring.html#TOC64">13.3 Normalization of strings</a> </h2> <p>The Unicode standard defines four normalization forms for Unicode strings. The following type is used to denote a normalization form. </p> <dl> <dt><u>Type:</u> <b>uninorm_t</b> -<a name="IDX804"></a> +<a name="IDX795"></a> </dt> <dd><p>An object of type <code>uninorm_t</code> denotes a Unicode normalization form. This is a scalar type; its values can be compared with <code>==</code>. @@ -293,28 +293,28 @@ This is a scalar type; its values can be compared with <code>==</code>. </p> <dl> <dt><u>Macro:</u> uninorm_t <b>UNINORM_NFD</b> -<a name="IDX805"></a> +<a name="IDX796"></a> </dt> <dd><p>Denotes Normalization form D: canonical decomposition. </p></dd></dl> <dl> <dt><u>Macro:</u> uninorm_t <b>UNINORM_NFC</b> -<a name="IDX806"></a> +<a name="IDX797"></a> </dt> <dd><p>Normalization form C: canonical decomposition, then canonical composition. </p></dd></dl> <dl> <dt><u>Macro:</u> uninorm_t <b>UNINORM_NFKD</b> -<a name="IDX807"></a> +<a name="IDX798"></a> </dt> <dd><p>Normalization form KD: compatibility decomposition. </p></dd></dl> <dl> <dt><u>Macro:</u> uninorm_t <b>UNINORM_NFKC</b> -<a name="IDX808"></a> +<a name="IDX799"></a> </dt> <dd><p>Normalization form KC: compatibility decomposition, then canonical composition. </p></dd></dl> @@ -323,21 +323,21 @@ This is a scalar type; its values can be compared with <code>==</code>. </p> <dl> <dt><u>Function:</u> bool <b>uninorm_is_compat_decomposing</b><i> (uninorm_t <var>nf</var>)</i> -<a name="IDX809"></a> +<a name="IDX800"></a> </dt> <dd><p>Tests whether the normalization form <var>nf</var> does compatibility decomposition. </p></dd></dl> <dl> <dt><u>Function:</u> bool <b>uninorm_is_composing</b><i> (uninorm_t <var>nf</var>)</i> -<a name="IDX810"></a> +<a name="IDX801"></a> </dt> <dd><p>Tests whether the normalization form <var>nf</var> includes canonical composition. </p></dd></dl> <dl> <dt><u>Function:</u> uninorm_t <b>uninorm_decomposing_form</b><i> (uninorm_t <var>nf</var>)</i> -<a name="IDX811"></a> +<a name="IDX802"></a> </dt> <dd><p>Returns the decomposing variant of the normalization form <var>nf</var>. This maps NFC,NFD → NFD and NFKC,NFKD → NFKD. @@ -347,34 +347,37 @@ This maps NFC,NFD → NFD and NFKC,NFKD → NFKD. </p> <dl> <dt><u>Function:</u> uint8_t * <b>u8_normalize</b><i> (uninorm_t <var>nf</var>, const uint8_t *<var>s</var>, size_t <var>n</var>, uint8_t *<var>resultbuf</var>, size_t *<var>lengthp</var>)</i> -<a name="IDX812"></a> +<a name="IDX803"></a> </dt> <dt><u>Function:</u> uint16_t * <b>u16_normalize</b><i> (uninorm_t <var>nf</var>, const uint16_t *<var>s</var>, size_t <var>n</var>, uint16_t *<var>resultbuf</var>, size_t *<var>lengthp</var>)</i> -<a name="IDX813"></a> +<a name="IDX804"></a> </dt> <dt><u>Function:</u> uint32_t * <b>u32_normalize</b><i> (uninorm_t <var>nf</var>, const uint32_t *<var>s</var>, size_t <var>n</var>, uint32_t *<var>resultbuf</var>, size_t *<var>lengthp</var>)</i> -<a name="IDX814"></a> +<a name="IDX805"></a> </dt> <dd><p>Returns the specified normalization form of a string. +</p> +<p>The <var>resultbuf</var> and <var>lengthp</var> arguments are as described in +chapter <a href="libunistring_2.html#SEC8">Conventions</a>. </p></dd></dl> <hr size="6"> <a name="Normalizing-comparisons"></a> -<a name="SEC52"></a> -<h2 class="section"> <a href="libunistring.html#TOC52">13.4 Normalizing comparisons</a> </h2> +<a name="SEC65"></a> +<h2 class="section"> <a href="libunistring.html#TOC65">13.4 Normalizing comparisons</a> </h2> <p>The following functions compare Unicode string, ignoring differences in normalization. </p> <dl> <dt><u>Function:</u> int <b>u8_normcmp</b><i> (const uint8_t *<var>s1</var>, size_t <var>n1</var>, const uint8_t *<var>s2</var>, size_t <var>n2</var>, uninorm_t <var>nf</var>, int *<var>resultp</var>)</i> -<a name="IDX815"></a> +<a name="IDX806"></a> </dt> <dt><u>Function:</u> int <b>u16_normcmp</b><i> (const uint16_t *<var>s1</var>, size_t <var>n1</var>, const uint16_t *<var>s2</var>, size_t <var>n2</var>, uninorm_t <var>nf</var>, int *<var>resultp</var>)</i> -<a name="IDX816"></a> +<a name="IDX807"></a> </dt> <dt><u>Function:</u> int <b>u32_normcmp</b><i> (const uint32_t *<var>s1</var>, size_t <var>n1</var>, const uint32_t *<var>s2</var>, size_t <var>n2</var>, uninorm_t <var>nf</var>, int *<var>resultp</var>)</i> -<a name="IDX817"></a> +<a name="IDX808"></a> </dt> <dd><p>Compares <var>s1</var> and <var>s2</var>, ignoring differences in normalization. </p> @@ -385,17 +388,17 @@ normalization. Upon failure, returns -1 with <code>errno</code> set. </p></dd></dl> -<a name="IDX818"></a> -<a name="IDX819"></a> +<a name="IDX809"></a> +<a name="IDX810"></a> <dl> <dt><u>Function:</u> char * <b>u8_normxfrm</b><i> (const uint8_t *<var>s</var>, size_t <var>n</var>, uninorm_t <var>nf</var>, char *<var>resultbuf</var>, size_t *<var>lengthp</var>)</i> -<a name="IDX820"></a> +<a name="IDX811"></a> </dt> <dt><u>Function:</u> char * <b>u16_normxfrm</b><i> (const uint16_t *<var>s</var>, size_t <var>n</var>, uninorm_t <var>nf</var>, char *<var>resultbuf</var>, size_t *<var>lengthp</var>)</i> -<a name="IDX821"></a> +<a name="IDX812"></a> </dt> <dt><u>Function:</u> char * <b>u32_normxfrm</b><i> (const uint32_t *<var>s</var>, size_t <var>n</var>, uninorm_t <var>nf</var>, char *<var>resultbuf</var>, size_t *<var>lengthp</var>)</i> -<a name="IDX822"></a> +<a name="IDX813"></a> </dt> <dd><p>Converts the string <var>s</var> of length <var>n</var> to a NUL-terminated byte sequence, in such a way that comparing <code>u8_normxfrm (<var>s1</var>)</code> and @@ -403,17 +406,20 @@ sequence, in such a way that comparing <code>u8_normxfrm (<var>s1</var>)</code> comparing <var>s1</var> and <var>s2</var> with the <code>u8_normcoll</code> function. </p> <p><var>nf</var> must be either <code>UNINORM_NFC</code> or <code>UNINORM_NFKC</code>. +</p> +<p>The <var>resultbuf</var> and <var>lengthp</var> arguments are as described in +chapter <a href="libunistring_2.html#SEC8">Conventions</a>. </p></dd></dl> <dl> <dt><u>Function:</u> int <b>u8_normcoll</b><i> (const uint8_t *<var>s1</var>, size_t <var>n1</var>, const uint8_t *<var>s2</var>, size_t <var>n2</var>, uninorm_t <var>nf</var>, int *<var>resultp</var>)</i> -<a name="IDX823"></a> +<a name="IDX814"></a> </dt> <dt><u>Function:</u> int <b>u16_normcoll</b><i> (const uint16_t *<var>s1</var>, size_t <var>n1</var>, const uint16_t *<var>s2</var>, size_t <var>n2</var>, uninorm_t <var>nf</var>, int *<var>resultp</var>)</i> -<a name="IDX824"></a> +<a name="IDX815"></a> </dt> <dt><u>Function:</u> int <b>u32_normcoll</b><i> (const uint32_t *<var>s1</var>, size_t <var>n1</var>, const uint32_t *<var>s2</var>, size_t <var>n2</var>, uninorm_t <var>nf</var>, int *<var>resultp</var>)</i> -<a name="IDX825"></a> +<a name="IDX816"></a> </dt> <dd><p>Compares <var>s1</var> and <var>s2</var>, ignoring differences in normalization, using the collation rules of the current locale. @@ -427,8 +433,8 @@ Upon failure, returns -1 with <code>errno</code> set. <hr size="6"> <a name="Normalization-of-streams"></a> -<a name="SEC53"></a> -<h2 class="section"> <a href="libunistring.html#TOC53">13.5 Normalization of streams of Unicode characters</a> </h2> +<a name="SEC66"></a> +<h2 class="section"> <a href="libunistring.html#TOC66">13.5 Normalization of streams of Unicode characters</a> </h2> <p>A “stream of Unicode characters” is essentially a function that accepts an <code>ucs4_t</code> argument repeatedly, optionally combined with a function that @@ -436,7 +442,7 @@ Upon failure, returns -1 with <code>errno</code> set. </p> <dl> <dt><u>Type:</u> <b>struct uninorm_filter</b> -<a name="IDX826"></a> +<a name="IDX817"></a> </dt> <dd><p>This is the data type of a stream of Unicode characters that normalizes its input according to a given normalization form and passes the normalized @@ -445,7 +451,7 @@ character sequence to the encapsulated stream of Unicode characters. <dl> <dt><u>Function:</u> struct uninorm_filter * <b>uninorm_filter_create</b><i> (uninorm_t <var>nf</var>, int (*<var>stream_func</var>) (void *<var>stream_data</var>, ucs4_t <var>uc</var>), void *<var>stream_data</var>)</i> -<a name="IDX827"></a> +<a name="IDX818"></a> </dt> <dd><p>Creates and returns a normalization filter for Unicode characters. </p> @@ -459,7 +465,7 @@ upon failure. <dl> <dt><u>Function:</u> int <b>uninorm_filter_write</b><i> (struct uninorm_filter *<var>filter</var>, ucs4_t <var>uc</var>)</i> -<a name="IDX828"></a> +<a name="IDX819"></a> </dt> <dd><p>Stuffs a Unicode character into a normalizing filter. Returns 0 if successful, or -1 with <code>errno</code> set upon failure. @@ -467,7 +473,7 @@ Returns 0 if successful, or -1 with <code>errno</code> set upon failure. <dl> <dt><u>Function:</u> int <b>uninorm_filter_flush</b><i> (struct uninorm_filter *<var>filter</var>)</i> -<a name="IDX829"></a> +<a name="IDX820"></a> </dt> <dd><p>Brings data buffered in the filter to its destination, the encapsulated stream. </p> @@ -480,7 +486,7 @@ will not necessarily be normalized. <dl> <dt><u>Function:</u> int <b>uninorm_filter_free</b><i> (struct uninorm_filter *<var>filter</var>)</i> -<a name="IDX830"></a> +<a name="IDX821"></a> </dt> <dd><p>Brings data buffered in the filter to its destination, the encapsulated stream, then closes and frees the filter. @@ -489,8 +495,8 @@ then closes and frees the filter. </p></dd></dl> <hr size="6"> <table cellpadding="1" cellspacing="1" border="0"> -<tr><td valign="middle" align="left">[<a href="#SEC48" title="Beginning of this chapter or previous chapter"> << </a>]</td> -<td valign="middle" align="left">[<a href="libunistring_14.html#SEC54" title="Next chapter"> >> </a>]</td> +<tr><td valign="middle" align="left">[<a href="#SEC61" title="Beginning of this chapter or previous chapter"> << </a>]</td> +<td valign="middle" align="left">[<a href="libunistring_14.html#SEC67" title="Next chapter"> >> </a>]</td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> @@ -498,12 +504,12 @@ then closes and frees the filter. <td valign="middle" align="left"> </td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Top" title="Cover (top) of document">Top</a>]</td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Contents" title="Table of contents">Contents</a>]</td> -<td valign="middle" align="left">[<a href="libunistring_19.html#SEC77" title="Index">Index</a>]</td> +<td valign="middle" align="left">[<a href="libunistring_20.html#SEC91" title="Index">Index</a>]</td> <td valign="middle" align="left">[<a href="libunistring_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <p> <font size="-1"> - This document was generated by <em>Daiki Ueno</em> on <em>November, 30 2017</em> using <a href="http://www.nongnu.org/texi2html/"><em>texi2html 1.78a</em></a>. + This document was generated by <em>Daiki Ueno</em> on <em>May, 25 2018</em> using <a href="http://www.nongnu.org/texi2html/"><em>texi2html 1.78a</em></a>. </font> <br> diff --git a/doc/libunistring_14.html b/doc/libunistring_14.html index 28636a4e..aa326f68 100644 --- a/doc/libunistring_14.html +++ b/doc/libunistring_14.html @@ -1,6 +1,6 @@ <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html401/loose.dtd"> <html> -<!-- Created on November, 30 2017 by texi2html 1.78a --> +<!-- Created on May, 25 2018 by texi2html 1.78a --> <!-- Written by: Lionel Cons <Lionel.Cons@cern.ch> (original author) Karl Berry <karl@freefriends.org> @@ -42,8 +42,8 @@ ul.toc {list-style: none} <body lang="en" bgcolor="#FFFFFF" text="#000000" link="#0000FF" vlink="#800080" alink="#FF0000"> <table cellpadding="1" cellspacing="1" border="0"> -<tr><td valign="middle" align="left">[<a href="libunistring_13.html#SEC48" title="Beginning of this chapter or previous chapter"> << </a>]</td> -<td valign="middle" align="left">[<a href="libunistring_15.html#SEC60" title="Next chapter"> >> </a>]</td> +<tr><td valign="middle" align="left">[<a href="libunistring_13.html#SEC61" title="Beginning of this chapter or previous chapter"> << </a>]</td> +<td valign="middle" align="left">[<a href="libunistring_15.html#SEC73" title="Next chapter"> >> </a>]</td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> @@ -51,14 +51,14 @@ ul.toc {list-style: none} <td valign="middle" align="left"> </td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Top" title="Cover (top) of document">Top</a>]</td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Contents" title="Table of contents">Contents</a>]</td> -<td valign="middle" align="left">[<a href="libunistring_19.html#SEC77" title="Index">Index</a>]</td> +<td valign="middle" align="left">[<a href="libunistring_20.html#SEC91" title="Index">Index</a>]</td> <td valign="middle" align="left">[<a href="libunistring_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <hr size="2"> <a name="unicase_002eh"></a> -<a name="SEC54"></a> -<h1 class="chapter"> <a href="libunistring.html#TOC54">14. Case mappings <code><unicase.h></code></a> </h1> +<a name="SEC67"></a> +<h1 class="chapter"> <a href="libunistring.html#TOC67">14. Case mappings <code><unicase.h></code></a> </h1> <p>This include file defines functions for case mapping for Unicode strings and case insensitive comparison of Unicode strings and C strings. @@ -71,8 +71,8 @@ Greek sigma and the Lithuanian i correctly. <hr size="6"> <a name="Case-mappings-of-characters"></a> -<a name="SEC55"></a> -<h2 class="section"> <a href="libunistring.html#TOC55">14.1 Case mappings of characters</a> </h2> +<a name="SEC68"></a> +<h2 class="section"> <a href="libunistring.html#TOC68">14.1 Case mappings of characters</a> </h2> <p>The following functions implement case mappings on Unicode characters — for those cases only where the result of the mapping is a again a single @@ -88,21 +88,21 @@ entire string at once and are language aware. <dl> <dt><u>Function:</u> ucs4_t <b>uc_toupper</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX831"></a> +<a name="IDX822"></a> </dt> <dd><p>Returns the uppercase mapping of the Unicode character <var>uc</var>. </p></dd></dl> <dl> <dt><u>Function:</u> ucs4_t <b>uc_tolower</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX832"></a> +<a name="IDX823"></a> </dt> <dd><p>Returns the lowercase mapping of the Unicode character <var>uc</var>. </p></dd></dl> <dl> <dt><u>Function:</u> ucs4_t <b>uc_totitle</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX833"></a> +<a name="IDX824"></a> </dt> <dd><p>Returns the titlecase mapping of the Unicode character <var>uc</var>. </p> @@ -138,8 +138,8 @@ Bosnian, and Serbian languages. <hr size="6"> <a name="Case-mappings-of-strings"></a> -<a name="SEC56"></a> -<h2 class="section"> <a href="libunistring.html#TOC56">14.2 Case mappings of strings</a> </h2> +<a name="SEC69"></a> +<h2 class="section"> <a href="libunistring.html#TOC69">14.2 Case mappings of strings</a> </h2> <p>Case mapping should always be performed on entire strings, not on individual characters. The functions in this sections do so. @@ -151,14 +151,14 @@ a character, U+00C4 <small>LATIN CAPITAL LETTER A WITH DIAERESIS</small> and U+0041 <small>LATIN CAPITAL LETTER A</small> U+0308 <small>COMBINING DIAERESIS</small> the same. The <var>nf</var> argument designates the normalization. </p> -<a name="IDX834"></a> +<a name="IDX825"></a> <p>These functions are locale dependent. The <var>iso639_language</var> argument identifies the language (e.g. <code>"tr"</code> for Turkish). NULL means to use locale independent case mappings. </p> <dl> <dt><u>Function:</u> const char * <b>uc_locale_language</b><i> ()</i> -<a name="IDX835"></a> +<a name="IDX826"></a> </dt> <dd><p>Returns the ISO 639 language code of the current locale. Returns <code>""</code> if it is unknown, or in the "C" locale. @@ -166,45 +166,51 @@ Returns <code>""</code> if it is unknown, or in the "C" loca <dl> <dt><u>Function:</u> uint8_t * <b>u8_toupper</b><i> (const uint8_t *<var>s</var>, size_t <var>n</var>, const char *<var>iso639_language</var>, uninorm_t <var>nf</var>, uint8_t *<var>resultbuf</var>, size_t *<var>lengthp</var>)</i> -<a name="IDX836"></a> +<a name="IDX827"></a> </dt> <dt><u>Function:</u> uint16_t * <b>u16_toupper</b><i> (const uint16_t *<var>s</var>, size_t <var>n</var>, const char *<var>iso639_language</var>, uninorm_t <var>nf</var>, uint16_t *<var>resultbuf</var>, size_t *<var>lengthp</var>)</i> -<a name="IDX837"></a> +<a name="IDX828"></a> </dt> <dt><u>Function:</u> uint32_t * <b>u32_toupper</b><i> (const uint32_t *<var>s</var>, size_t <var>n</var>, const char *<var>iso639_language</var>, uninorm_t <var>nf</var>, uint32_t *<var>resultbuf</var>, size_t *<var>lengthp</var>)</i> -<a name="IDX838"></a> +<a name="IDX829"></a> </dt> <dd><p>Returns the uppercase mapping of a string. </p> <p>The <var>nf</var> argument identifies the normalization form to apply after the case-mapping. It can also be NULL, for no normalization. +</p> +<p>The <var>resultbuf</var> and <var>lengthp</var> arguments are as described in +chapter <a href="libunistring_2.html#SEC8">Conventions</a>. </p></dd></dl> <dl> <dt><u>Function:</u> uint8_t * <b>u8_tolower</b><i> (const uint8_t *<var>s</var>, size_t <var>n</var>, const char *<var>iso639_language</var>, uninorm_t <var>nf</var>, uint8_t *<var>resultbuf</var>, size_t *<var>lengthp</var>)</i> -<a name="IDX839"></a> +<a name="IDX830"></a> </dt> <dt><u>Function:</u> uint16_t * <b>u16_tolower</b><i> (const uint16_t *<var>s</var>, size_t <var>n</var>, const char *<var>iso639_language</var>, uninorm_t <var>nf</var>, uint16_t *<var>resultbuf</var>, size_t *<var>lengthp</var>)</i> -<a name="IDX840"></a> +<a name="IDX831"></a> </dt> <dt><u>Function:</u> uint32_t * <b>u32_tolower</b><i> (const uint32_t *<var>s</var>, size_t <var>n</var>, const char *<var>iso639_language</var>, uninorm_t <var>nf</var>, uint32_t *<var>resultbuf</var>, size_t *<var>lengthp</var>)</i> -<a name="IDX841"></a> +<a name="IDX832"></a> </dt> <dd><p>Returns the lowercase mapping of a string. </p> <p>The <var>nf</var> argument identifies the normalization form to apply after the case-mapping. It can also be NULL, for no normalization. +</p> +<p>The <var>resultbuf</var> and <var>lengthp</var> arguments are as described in +chapter <a href="libunistring_2.html#SEC8">Conventions</a>. </p></dd></dl> <dl> <dt><u>Function:</u> uint8_t * <b>u8_totitle</b><i> (const uint8_t *<var>s</var>, size_t <var>n</var>, const char *<var>iso639_language</var>, uninorm_t <var>nf</var>, uint8_t *<var>resultbuf</var>, size_t *<var>lengthp</var>)</i> -<a name="IDX842"></a> +<a name="IDX833"></a> </dt> <dt><u>Function:</u> uint16_t * <b>u16_totitle</b><i> (const uint16_t *<var>s</var>, size_t <var>n</var>, const char *<var>iso639_language</var>, uninorm_t <var>nf</var>, uint16_t *<var>resultbuf</var>, size_t *<var>lengthp</var>)</i> -<a name="IDX843"></a> +<a name="IDX834"></a> </dt> <dt><u>Function:</u> uint32_t * <b>u32_totitle</b><i> (const uint32_t *<var>s</var>, size_t <var>n</var>, const char *<var>iso639_language</var>, uninorm_t <var>nf</var>, uint32_t *<var>resultbuf</var>, size_t *<var>lengthp</var>)</i> -<a name="IDX844"></a> +<a name="IDX835"></a> </dt> <dd><p>Returns the titlecase mapping of a string. </p> @@ -214,12 +220,15 @@ are being mapped to lower case. </p> <p>The <var>nf</var> argument identifies the normalization form to apply after the case-mapping. It can also be NULL, for no normalization. +</p> +<p>The <var>resultbuf</var> and <var>lengthp</var> arguments are as described in +chapter <a href="libunistring_2.html#SEC8">Conventions</a>. </p></dd></dl> <hr size="6"> <a name="Case-mappings-of-substrings"></a> -<a name="SEC57"></a> -<h2 class="section"> <a href="libunistring.html#TOC57">14.3 Case mappings of substrings</a> </h2> +<a name="SEC70"></a> +<h2 class="section"> <a href="libunistring.html#TOC70">14.3 Case mappings of substrings</a> </h2> <p>Case mapping of a substring cannot simply be performed by extracting the substring and then applying the case mapping function to it. This does not @@ -230,7 +239,7 @@ precede it (the “prefix”) and the characters that follow it (the &ld </p> <dl> <dt><u>Type:</u> <b>casing_prefix_context_t</b> -<a name="IDX845"></a> +<a name="IDX836"></a> </dt> <dd><p>This data type denotes the case-mapping context that is given by a prefix string. It is an immediate type that can be copied by simple assignment, @@ -239,7 +248,7 @@ without involving memory allocation. It is not an array type. <dl> <dt><u>Constant:</u> casing_prefix_context_t <b>unicase_empty_prefix_context</b> -<a name="IDX846"></a> +<a name="IDX837"></a> </dt> <dd><p>This constant is the case-mapping context that corresponds to an empty prefix string. @@ -249,26 +258,26 @@ string. </p> <dl> <dt><u>Function:</u> casing_prefix_context_t <b>u8_casing_prefix_context</b><i> (const uint8_t *<var>s</var>, size_t <var>n</var>)</i> -<a name="IDX847"></a> +<a name="IDX838"></a> </dt> <dt><u>Function:</u> casing_prefix_context_t <b>u16_casing_prefix_context</b><i> (const uint16_t *<var>s</var>, size_t <var>n</var>)</i> -<a name="IDX848"></a> +<a name="IDX839"></a> </dt> <dt><u>Function:</u> casing_prefix_context_t <b>u32_casing_prefix_context</b><i> (const uint32_t *<var>s</var>, size_t <var>n</var>)</i> -<a name="IDX849"></a> +<a name="IDX840"></a> </dt> <dd><p>Returns the case-mapping context of a given prefix string. </p></dd></dl> <dl> <dt><u>Function:</u> casing_prefix_context_t <b>u8_casing_prefixes_context</b><i> (const uint8_t *<var>s</var>, size_t <var>n</var>, casing_prefix_context_t <var>a_context</var>)</i> -<a name="IDX850"></a> +<a name="IDX841"></a> </dt> <dt><u>Function:</u> casing_prefix_context_t <b>u16_casing_prefixes_context</b><i> (const uint16_t *<var>s</var>, size_t <var>n</var>, casing_prefix_context_t <var>a_context</var>)</i> -<a name="IDX851"></a> +<a name="IDX842"></a> </dt> <dt><u>Function:</u> casing_prefix_context_t <b>u32_casing_prefixes_context</b><i> (const uint32_t *<var>s</var>, size_t <var>n</var>, casing_prefix_context_t <var>a_context</var>)</i> -<a name="IDX852"></a> +<a name="IDX843"></a> </dt> <dd><p>Returns the case-mapping context of the prefix concat(<var>a</var>, <var>s</var>), given the case-mapping context of the prefix <var>a</var>. @@ -276,7 +285,7 @@ given the case-mapping context of the prefix <var>a</var>. <dl> <dt><u>Type:</u> <b>casing_suffix_context_t</b> -<a name="IDX853"></a> +<a name="IDX844"></a> </dt> <dd><p>This data type denotes the case-mapping context that is given by a suffix string. It is an immediate type that can be copied by simple assignment, @@ -285,7 +294,7 @@ without involving memory allocation. It is not an array type. <dl> <dt><u>Constant:</u> casing_suffix_context_t <b>unicase_empty_suffix_context</b> -<a name="IDX854"></a> +<a name="IDX845"></a> </dt> <dd><p>This constant is the case-mapping context that corresponds to an empty suffix string. @@ -295,26 +304,26 @@ string. </p> <dl> <dt><u>Function:</u> casing_suffix_context_t <b>u8_casing_suffix_context</b><i> (const uint8_t *<var>s</var>, size_t <var>n</var>)</i> -<a name="IDX855"></a> +<a name="IDX846"></a> </dt> <dt><u>Function:</u> casing_suffix_context_t <b>u16_casing_suffix_context</b><i> (const uint16_t *<var>s</var>, size_t <var>n</var>)</i> -<a name="IDX856"></a> +<a name="IDX847"></a> </dt> <dt><u>Function:</u> casing_suffix_context_t <b>u32_casing_suffix_context</b><i> (const uint32_t *<var>s</var>, size_t <var>n</var>)</i> -<a name="IDX857"></a> +<a name="IDX848"></a> </dt> <dd><p>Returns the case-mapping context of a given suffix string. </p></dd></dl> <dl> <dt><u>Function:</u> casing_suffix_context_t <b>u8_casing_suffixes_context</b><i> (const uint8_t *<var>s</var>, size_t <var>n</var>, casing_suffix_context_t <var>a_context</var>)</i> -<a name="IDX858"></a> +<a name="IDX849"></a> </dt> <dt><u>Function:</u> casing_suffix_context_t <b>u16_casing_suffixes_context</b><i> (const uint16_t *<var>s</var>, size_t <var>n</var>, casing_suffix_context_t <var>a_context</var>)</i> -<a name="IDX859"></a> +<a name="IDX850"></a> </dt> <dt><u>Function:</u> casing_suffix_context_t <b>u32_casing_suffixes_context</b><i> (const uint32_t *<var>s</var>, size_t <var>n</var>, casing_suffix_context_t <var>a_context</var>)</i> -<a name="IDX860"></a> +<a name="IDX851"></a> </dt> <dd><p>Returns the case-mapping context of the suffix concat(<var>s</var>, <var>a</var>), given the case-mapping context of the suffix <var>a</var>. @@ -325,44 +334,53 @@ prefix context and the suffix context. </p> <dl> <dt><u>Function:</u> uint8_t * <b>u8_ct_toupper</b><i> (const uint8_t *<var>s</var>, size_t <var>n</var>, casing_prefix_context_t <var>prefix_context</var>, casing_suffix_context_t <var>suffix_context</var>, const char *<var>iso639_language</var>, uninorm_t <var>nf</var>, uint8_t *<var>resultbuf</var>, size_t *<var>lengthp</var>)</i> -<a name="IDX861"></a> +<a name="IDX852"></a> </dt> <dt><u>Function:</u> uint16_t * <b>u16_ct_toupper</b><i> (const uint16_t *<var>s</var>, size_t <var>n</var>, casing_prefix_context_t <var>prefix_context</var>, casing_suffix_context_t <var>suffix_context</var>, const char *<var>iso639_language</var>, uninorm_t <var>nf</var>, uint16_t *<var>resultbuf</var>, size_t *<var>lengthp</var>)</i> -<a name="IDX862"></a> +<a name="IDX853"></a> </dt> <dt><u>Function:</u> uint32_t * <b>u32_ct_toupper</b><i> (const uint32_t *<var>s</var>, size_t <var>n</var>, casing_prefix_context_t <var>prefix_context</var>, casing_suffix_context_t <var>suffix_context</var>, const char *<var>iso639_language</var>, uninorm_t <var>nf</var>, uint32_t *<var>resultbuf</var>, size_t *<var>lengthp</var>)</i> -<a name="IDX863"></a> +<a name="IDX854"></a> </dt> <dd><p>Returns the uppercase mapping of a string that is surrounded by a prefix and a suffix. +</p> +<p>The <var>resultbuf</var> and <var>lengthp</var> arguments are as described in +chapter <a href="libunistring_2.html#SEC8">Conventions</a>. </p></dd></dl> <dl> <dt><u>Function:</u> uint8_t * <b>u8_ct_tolower</b><i> (const uint8_t *<var>s</var>, size_t <var>n</var>, casing_prefix_context_t <var>prefix_context</var>, casing_suffix_context_t <var>suffix_context</var>, const char *<var>iso639_language</var>, uninorm_t <var>nf</var>, uint8_t *<var>resultbuf</var>, size_t *<var>lengthp</var>)</i> -<a name="IDX864"></a> +<a name="IDX855"></a> </dt> <dt><u>Function:</u> uint16_t * <b>u16_ct_tolower</b><i> (const uint16_t *<var>s</var>, size_t <var>n</var>, casing_prefix_context_t <var>prefix_context</var>, casing_suffix_context_t <var>suffix_context</var>, const char *<var>iso639_language</var>, uninorm_t <var>nf</var>, uint16_t *<var>resultbuf</var>, size_t *<var>lengthp</var>)</i> -<a name="IDX865"></a> +<a name="IDX856"></a> </dt> <dt><u>Function:</u> uint32_t * <b>u32_ct_tolower</b><i> (const uint32_t *<var>s</var>, size_t <var>n</var>, casing_prefix_context_t <var>prefix_context</var>, casing_suffix_context_t <var>suffix_context</var>, const char *<var>iso639_language</var>, uninorm_t <var>nf</var>, uint32_t *<var>resultbuf</var>, size_t *<var>lengthp</var>)</i> -<a name="IDX866"></a> +<a name="IDX857"></a> </dt> <dd><p>Returns the lowercase mapping of a string that is surrounded by a prefix and a suffix. +</p> +<p>The <var>resultbuf</var> and <var>lengthp</var> arguments are as described in +chapter <a href="libunistring_2.html#SEC8">Conventions</a>. </p></dd></dl> <dl> <dt><u>Function:</u> uint8_t * <b>u8_ct_totitle</b><i> (const uint8_t *<var>s</var>, size_t <var>n</var>, casing_prefix_context_t <var>prefix_context</var>, casing_suffix_context_t <var>suffix_context</var>, const char *<var>iso639_language</var>, uninorm_t <var>nf</var>, uint8_t *<var>resultbuf</var>, size_t *<var>lengthp</var>)</i> -<a name="IDX867"></a> +<a name="IDX858"></a> </dt> <dt><u>Function:</u> uint16_t * <b>u16_ct_totitle</b><i> (const uint16_t *<var>s</var>, size_t <var>n</var>, casing_prefix_context_t <var>prefix_context</var>, casing_suffix_context_t <var>suffix_context</var>, const char *<var>iso639_language</var>, uninorm_t <var>nf</var>, uint16_t *<var>resultbuf</var>, size_t *<var>lengthp</var>)</i> -<a name="IDX868"></a> +<a name="IDX859"></a> </dt> <dt><u>Function:</u> uint32_t * <b>u32_ct_totitle</b><i> (const uint32_t *<var>s</var>, size_t <var>n</var>, casing_prefix_context_t <var>prefix_context</var>, casing_suffix_context_t <var>suffix_context</var>, const char *<var>iso639_language</var>, uninorm_t <var>nf</var>, uint32_t *<var>resultbuf</var>, size_t *<var>lengthp</var>)</i> -<a name="IDX869"></a> +<a name="IDX860"></a> </dt> <dd><p>Returns the titlecase mapping of a string that is surrounded by a prefix and a suffix. +</p> +<p>The <var>resultbuf</var> and <var>lengthp</var> arguments are as described in +chapter <a href="libunistring_2.html#SEC8">Conventions</a>. </p></dd></dl> <p>For example, to uppercase the UTF-8 substring between <code>s + start_index</code> @@ -380,21 +398,21 @@ uint8_t result = <hr size="6"> <a name="Case-insensitive-comparison"></a> -<a name="SEC58"></a> -<h2 class="section"> <a href="libunistring.html#TOC58">14.4 Case insensitive comparison</a> </h2> +<a name="SEC71"></a> +<h2 class="section"> <a href="libunistring.html#TOC71">14.4 Case insensitive comparison</a> </h2> <p>The following functions implement comparison that ignores differences in case and normalization. </p> <dl> <dt><u>Function:</u> uint8_t * <b>u8_casefold</b><i> (const uint8_t *<var>s</var>, size_t <var>n</var>, const char *<var>iso639_language</var>, uninorm_t <var>nf</var>, uint8_t *<var>resultbuf</var>, size_t *<var>lengthp</var>)</i> -<a name="IDX870"></a> +<a name="IDX861"></a> </dt> <dt><u>Function:</u> uint16_t * <b>u16_casefold</b><i> (const uint16_t *<var>s</var>, size_t <var>n</var>, const char *<var>iso639_language</var>, uninorm_t <var>nf</var>, uint16_t *<var>resultbuf</var>, size_t *<var>lengthp</var>)</i> -<a name="IDX871"></a> +<a name="IDX862"></a> </dt> <dt><u>Function:</u> uint32_t * <b>u32_casefold</b><i> (const uint32_t *<var>s</var>, size_t <var>n</var>, const char *<var>iso639_language</var>, uninorm_t <var>nf</var>, uint32_t *<var>resultbuf</var>, size_t *<var>lengthp</var>)</i> -<a name="IDX872"></a> +<a name="IDX863"></a> </dt> <dd><p>Returns the case folded string. </p> @@ -404,34 +422,40 @@ with the <code>u8_cmp2</code> function is equivalent to comparing <var>s1</var> </p> <p>The <var>nf</var> argument identifies the normalization form to apply after the case-mapping. It can also be NULL, for no normalization. +</p> +<p>The <var>resultbuf</var> and <var>lengthp</var> arguments are as described in +chapter <a href="libunistring_2.html#SEC8">Conventions</a>. </p></dd></dl> <dl> <dt><u>Function:</u> uint8_t * <b>u8_ct_casefold</b><i> (const uint8_t *<var>s</var>, size_t <var>n</var>, casing_prefix_context_t <var>prefix_context</var>, casing_suffix_context_t <var>suffix_context</var>, const char *<var>iso639_language</var>, uninorm_t <var>nf</var>, uint8_t *<var>resultbuf</var>, size_t *<var>lengthp</var>)</i> -<a name="IDX873"></a> +<a name="IDX864"></a> </dt> <dt><u>Function:</u> uint16_t * <b>u16_ct_casefold</b><i> (const uint16_t *<var>s</var>, size_t <var>n</var>, casing_prefix_context_t <var>prefix_context</var>, casing_suffix_context_t <var>suffix_context</var>, const char *<var>iso639_language</var>, uninorm_t <var>nf</var>, uint16_t *<var>resultbuf</var>, size_t *<var>lengthp</var>)</i> -<a name="IDX874"></a> +<a name="IDX865"></a> </dt> <dt><u>Function:</u> uint32_t * <b>u32_ct_casefold</b><i> (const uint32_t *<var>s</var>, size_t <var>n</var>, casing_prefix_context_t <var>prefix_context</var>, casing_suffix_context_t <var>suffix_context</var>, const char *<var>iso639_language</var>, uninorm_t <var>nf</var>, uint32_t *<var>resultbuf</var>, size_t *<var>lengthp</var>)</i> -<a name="IDX875"></a> +<a name="IDX866"></a> </dt> <dd><p>Returns the case folded string. The case folding takes into account the case mapping contexts of the prefix and suffix strings. +</p> +<p>The <var>resultbuf</var> and <var>lengthp</var> arguments are as described in +chapter <a href="libunistring_2.html#SEC8">Conventions</a>. </p></dd></dl> <dl> <dt><u>Function:</u> int <b>u8_casecmp</b><i> (const uint8_t *<var>s1</var>, size_t <var>n1</var>, const uint8_t *<var>s2</var>, size_t <var>n2</var>, const char *<var>iso639_language</var>, uninorm_t <var>nf</var>, int *<var>resultp</var>)</i> -<a name="IDX876"></a> +<a name="IDX867"></a> </dt> <dt><u>Function:</u> int <b>u16_casecmp</b><i> (const uint16_t *<var>s1</var>, size_t <var>n1</var>, const uint16_t *<var>s2</var>, size_t <var>n2</var>, const char *<var>iso639_language</var>, uninorm_t <var>nf</var>, int *<var>resultp</var>)</i> -<a name="IDX877"></a> +<a name="IDX868"></a> </dt> <dt><u>Function:</u> int <b>u32_casecmp</b><i> (const uint32_t *<var>s1</var>, size_t <var>n1</var>, const uint32_t *<var>s2</var>, size_t <var>n2</var>, const char *<var>iso639_language</var>, uninorm_t <var>nf</var>, int *<var>resultp</var>)</i> -<a name="IDX878"></a> +<a name="IDX869"></a> </dt> <dt><u>Function:</u> int <b>ulc_casecmp</b><i> (const char *<var>s1</var>, size_t <var>n1</var>, const char *<var>s2</var>, size_t <var>n2</var>, const char *<var>iso639_language</var>, uninorm_t <var>nf</var>, int *<var>resultp</var>)</i> -<a name="IDX879"></a> +<a name="IDX870"></a> </dt> <dd><p>Compares <var>s1</var> and <var>s2</var>, ignoring differences in case and normalization. </p> @@ -443,25 +467,25 @@ case-mapping. It can also be NULL, for no normalization. Upon failure, returns -1 with <code>errno</code> set. </p></dd></dl> -<a name="IDX880"></a> -<a name="IDX881"></a> -<a name="IDX882"></a> -<a name="IDX883"></a> +<a name="IDX871"></a> +<a name="IDX872"></a> +<a name="IDX873"></a> +<a name="IDX874"></a> <p>The following functions additionally take into account the sorting rules of the current locale. </p> <dl> <dt><u>Function:</u> char * <b>u8_casexfrm</b><i> (const uint8_t *<var>s</var>, size_t <var>n</var>, const char *<var>iso639_language</var>, uninorm_t <var>nf</var>, char *<var>resultbuf</var>, size_t *<var>lengthp</var>)</i> -<a name="IDX884"></a> +<a name="IDX875"></a> </dt> <dt><u>Function:</u> char * <b>u16_casexfrm</b><i> (const uint16_t *<var>s</var>, size_t <var>n</var>, const char *<var>iso639_language</var>, uninorm_t <var>nf</var>, char *<var>resultbuf</var>, size_t *<var>lengthp</var>)</i> -<a name="IDX885"></a> +<a name="IDX876"></a> </dt> <dt><u>Function:</u> char * <b>u32_casexfrm</b><i> (const uint32_t *<var>s</var>, size_t <var>n</var>, const char *<var>iso639_language</var>, uninorm_t <var>nf</var>, char *<var>resultbuf</var>, size_t *<var>lengthp</var>)</i> -<a name="IDX886"></a> +<a name="IDX877"></a> </dt> <dt><u>Function:</u> char * <b>ulc_casexfrm</b><i> (const char *<var>s</var>, size_t <var>n</var>, const char *<var>iso639_language</var>, uninorm_t <var>nf</var>, char *<var>resultbuf</var>, size_t *<var>lengthp</var>)</i> -<a name="IDX887"></a> +<a name="IDX878"></a> </dt> <dd><p>Converts the string <var>s</var> of length <var>n</var> to a NUL-terminated byte sequence, in such a way that comparing <code>u8_casexfrm (<var>s1</var>)</code> and @@ -470,20 +494,23 @@ equivalent to comparing <var>s1</var> and <var>s2</var> with <code>u8_casecoll</ </p> <p><var>nf</var> must be either <code>UNINORM_NFC</code>, <code>UNINORM_NFKC</code>, or NULL for no normalization. +</p> +<p>The <var>resultbuf</var> and <var>lengthp</var> arguments are as described in +chapter <a href="libunistring_2.html#SEC8">Conventions</a>. </p></dd></dl> <dl> <dt><u>Function:</u> int <b>u8_casecoll</b><i> (const uint8_t *<var>s1</var>, size_t <var>n1</var>, const uint8_t *<var>s2</var>, size_t <var>n2</var>, const char *<var>iso639_language</var>, uninorm_t <var>nf</var>, int *<var>resultp</var>)</i> -<a name="IDX888"></a> +<a name="IDX879"></a> </dt> <dt><u>Function:</u> int <b>u16_casecoll</b><i> (const uint16_t *<var>s1</var>, size_t <var>n1</var>, const uint16_t *<var>s2</var>, size_t <var>n2</var>, const char *<var>iso639_language</var>, uninorm_t <var>nf</var>, int *<var>resultp</var>)</i> -<a name="IDX889"></a> +<a name="IDX880"></a> </dt> <dt><u>Function:</u> int <b>u32_casecoll</b><i> (const uint32_t *<var>s1</var>, size_t <var>n1</var>, const uint32_t *<var>s2</var>, size_t <var>n2</var>, const char *<var>iso639_language</var>, uninorm_t <var>nf</var>, int *<var>resultp</var>)</i> -<a name="IDX890"></a> +<a name="IDX881"></a> </dt> <dt><u>Function:</u> int <b>ulc_casecoll</b><i> (const char *<var>s1</var>, size_t <var>n1</var>, const char *<var>s2</var>, size_t <var>n2</var>, const char *<var>iso639_language</var>, uninorm_t <var>nf</var>, int *<var>resultp</var>)</i> -<a name="IDX891"></a> +<a name="IDX882"></a> </dt> <dd><p>Compares <var>s1</var> and <var>s2</var>, ignoring differences in case and normalization, using the collation rules of the current locale. @@ -499,8 +526,8 @@ Upon failure, returns -1 with <code>errno</code> set. <hr size="6"> <a name="Case-detection"></a> -<a name="SEC59"></a> -<h2 class="section"> <a href="libunistring.html#TOC59">14.5 Case detection</a> </h2> +<a name="SEC72"></a> +<h2 class="section"> <a href="libunistring.html#TOC72">14.5 Case detection</a> </h2> <p>The following functions determine whether a Unicode string is entirely in upper case. or entirely in lower case, or entirely in title case, or already @@ -508,13 +535,13 @@ case-folded. </p> <dl> <dt><u>Function:</u> int <b>u8_is_uppercase</b><i> (const uint8_t *<var>s</var>, size_t <var>n</var>, const char *<var>iso639_language</var>, bool *<var>resultp</var>)</i> -<a name="IDX892"></a> +<a name="IDX883"></a> </dt> <dt><u>Function:</u> int <b>u16_is_uppercase</b><i> (const uint16_t *<var>s</var>, size_t <var>n</var>, const char *<var>iso639_language</var>, bool *<var>resultp</var>)</i> -<a name="IDX893"></a> +<a name="IDX884"></a> </dt> <dt><u>Function:</u> int <b>u32_is_uppercase</b><i> (const uint32_t *<var>s</var>, size_t <var>n</var>, const char *<var>iso639_language</var>, bool *<var>resultp</var>)</i> -<a name="IDX894"></a> +<a name="IDX885"></a> </dt> <dd><p>Sets <code>*<var>resultp</var></code> to true if mapping NFD(<var>s</var>) to upper case is a no-op, or to false otherwise, and returns 0. Upon failure, returns -1 with @@ -523,13 +550,13 @@ a no-op, or to false otherwise, and returns 0. Upon failure, returns -1 with <dl> <dt><u>Function:</u> int <b>u8_is_lowercase</b><i> (const uint8_t *<var>s</var>, size_t <var>n</var>, const char *<var>iso639_language</var>, bool *<var>resultp</var>)</i> -<a name="IDX895"></a> +<a name="IDX886"></a> </dt> <dt><u>Function:</u> int <b>u16_is_lowercase</b><i> (const uint16_t *<var>s</var>, size_t <var>n</var>, const char *<var>iso639_language</var>, bool *<var>resultp</var>)</i> -<a name="IDX896"></a> +<a name="IDX887"></a> </dt> <dt><u>Function:</u> int <b>u32_is_lowercase</b><i> (const uint32_t *<var>s</var>, size_t <var>n</var>, const char *<var>iso639_language</var>, bool *<var>resultp</var>)</i> -<a name="IDX897"></a> +<a name="IDX888"></a> </dt> <dd><p>Sets <code>*<var>resultp</var></code> to true if mapping NFD(<var>s</var>) to lower case is a no-op, or to false otherwise, and returns 0. Upon failure, returns -1 with @@ -538,13 +565,13 @@ a no-op, or to false otherwise, and returns 0. Upon failure, returns -1 with <dl> <dt><u>Function:</u> int <b>u8_is_titlecase</b><i> (const uint8_t *<var>s</var>, size_t <var>n</var>, const char *<var>iso639_language</var>, bool *<var>resultp</var>)</i> -<a name="IDX898"></a> +<a name="IDX889"></a> </dt> <dt><u>Function:</u> int <b>u16_is_titlecase</b><i> (const uint16_t *<var>s</var>, size_t <var>n</var>, const char *<var>iso639_language</var>, bool *<var>resultp</var>)</i> -<a name="IDX899"></a> +<a name="IDX890"></a> </dt> <dt><u>Function:</u> int <b>u32_is_titlecase</b><i> (const uint32_t *<var>s</var>, size_t <var>n</var>, const char *<var>iso639_language</var>, bool *<var>resultp</var>)</i> -<a name="IDX900"></a> +<a name="IDX891"></a> </dt> <dd><p>Sets <code>*<var>resultp</var></code> to true if mapping NFD(<var>s</var>) to title case is a no-op, or to false otherwise, and returns 0. Upon failure, returns -1 with @@ -553,13 +580,13 @@ a no-op, or to false otherwise, and returns 0. Upon failure, returns -1 with <dl> <dt><u>Function:</u> int <b>u8_is_casefolded</b><i> (const uint8_t *<var>s</var>, size_t <var>n</var>, const char *<var>iso639_language</var>, bool *<var>resultp</var>)</i> -<a name="IDX901"></a> +<a name="IDX892"></a> </dt> <dt><u>Function:</u> int <b>u16_is_casefolded</b><i> (const uint16_t *<var>s</var>, size_t <var>n</var>, const char *<var>iso639_language</var>, bool *<var>resultp</var>)</i> -<a name="IDX902"></a> +<a name="IDX893"></a> </dt> <dt><u>Function:</u> int <b>u32_is_casefolded</b><i> (const uint32_t *<var>s</var>, size_t <var>n</var>, const char *<var>iso639_language</var>, bool *<var>resultp</var>)</i> -<a name="IDX903"></a> +<a name="IDX894"></a> </dt> <dd><p>Sets <code>*<var>resultp</var></code> to true if applying case folding to NFD(<var>S</var>) is a no-op, or to false otherwise, and returns 0. Upon failure, returns -1 with @@ -571,13 +598,13 @@ Unicode string. </p> <dl> <dt><u>Function:</u> int <b>u8_is_cased</b><i> (const uint8_t *<var>s</var>, size_t <var>n</var>, const char *<var>iso639_language</var>, bool *<var>resultp</var>)</i> -<a name="IDX904"></a> +<a name="IDX895"></a> </dt> <dt><u>Function:</u> int <b>u16_is_cased</b><i> (const uint16_t *<var>s</var>, size_t <var>n</var>, const char *<var>iso639_language</var>, bool *<var>resultp</var>)</i> -<a name="IDX905"></a> +<a name="IDX896"></a> </dt> <dt><u>Function:</u> int <b>u32_is_cased</b><i> (const uint32_t *<var>s</var>, size_t <var>n</var>, const char *<var>iso639_language</var>, bool *<var>resultp</var>)</i> -<a name="IDX906"></a> +<a name="IDX897"></a> </dt> <dd><p>Sets <code>*<var>resultp</var></code> to true if case matters for <var>s</var>, that is, if mapping NFD(<var>s</var>) to either upper case or lower case or title case is not @@ -588,8 +615,8 @@ characters. Upon failure, returns -1 with <code>errno</code> set. </p></dd></dl> <hr size="6"> <table cellpadding="1" cellspacing="1" border="0"> -<tr><td valign="middle" align="left">[<a href="#SEC54" title="Beginning of this chapter or previous chapter"> << </a>]</td> -<td valign="middle" align="left">[<a href="libunistring_15.html#SEC60" title="Next chapter"> >> </a>]</td> +<tr><td valign="middle" align="left">[<a href="#SEC67" title="Beginning of this chapter or previous chapter"> << </a>]</td> +<td valign="middle" align="left">[<a href="libunistring_15.html#SEC73" title="Next chapter"> >> </a>]</td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> @@ -597,12 +624,12 @@ characters. Upon failure, returns -1 with <code>errno</code> set. <td valign="middle" align="left"> </td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Top" title="Cover (top) of document">Top</a>]</td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Contents" title="Table of contents">Contents</a>]</td> -<td valign="middle" align="left">[<a href="libunistring_19.html#SEC77" title="Index">Index</a>]</td> +<td valign="middle" align="left">[<a href="libunistring_20.html#SEC91" title="Index">Index</a>]</td> <td valign="middle" align="left">[<a href="libunistring_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <p> <font size="-1"> - This document was generated by <em>Daiki Ueno</em> on <em>November, 30 2017</em> using <a href="http://www.nongnu.org/texi2html/"><em>texi2html 1.78a</em></a>. + This document was generated by <em>Daiki Ueno</em> on <em>May, 25 2018</em> using <a href="http://www.nongnu.org/texi2html/"><em>texi2html 1.78a</em></a>. </font> <br> diff --git a/doc/libunistring_15.html b/doc/libunistring_15.html index 6ed441d4..90fe8782 100644 --- a/doc/libunistring_15.html +++ b/doc/libunistring_15.html @@ -1,6 +1,6 @@ <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html401/loose.dtd"> <html> -<!-- Created on November, 30 2017 by texi2html 1.78a --> +<!-- Created on May, 25 2018 by texi2html 1.78a --> <!-- Written by: Lionel Cons <Lionel.Cons@cern.ch> (original author) Karl Berry <karl@freefriends.org> @@ -42,8 +42,8 @@ ul.toc {list-style: none} <body lang="en" bgcolor="#FFFFFF" text="#000000" link="#0000FF" vlink="#800080" alink="#FF0000"> <table cellpadding="1" cellspacing="1" border="0"> -<tr><td valign="middle" align="left">[<a href="libunistring_14.html#SEC54" title="Beginning of this chapter or previous chapter"> << </a>]</td> -<td valign="middle" align="left">[<a href="libunistring_16.html#SEC61" title="Next chapter"> >> </a>]</td> +<tr><td valign="middle" align="left">[<a href="libunistring_14.html#SEC67" title="Beginning of this chapter or previous chapter"> << </a>]</td> +<td valign="middle" align="left">[<a href="libunistring_16.html#SEC74" title="Next chapter"> >> </a>]</td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> @@ -51,21 +51,21 @@ ul.toc {list-style: none} <td valign="middle" align="left"> </td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Top" title="Cover (top) of document">Top</a>]</td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Contents" title="Table of contents">Contents</a>]</td> -<td valign="middle" align="left">[<a href="libunistring_19.html#SEC77" title="Index">Index</a>]</td> +<td valign="middle" align="left">[<a href="libunistring_20.html#SEC91" title="Index">Index</a>]</td> <td valign="middle" align="left">[<a href="libunistring_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <hr size="2"> <a name="uniregex_002eh"></a> -<a name="SEC60"></a> -<h1 class="chapter"> <a href="libunistring.html#TOC60">15. Regular expressions <code><uniregex.h></code></a> </h1> +<a name="SEC73"></a> +<h1 class="chapter"> <a href="libunistring.html#TOC73">15. Regular expressions <code><uniregex.h></code></a> </h1> <p>This include file is not yet implemented. </p> <hr size="6"> <table cellpadding="1" cellspacing="1" border="0"> -<tr><td valign="middle" align="left">[<a href="libunistring_14.html#SEC54" title="Beginning of this chapter or previous chapter"> << </a>]</td> -<td valign="middle" align="left">[<a href="libunistring_16.html#SEC61" title="Next chapter"> >> </a>]</td> +<tr><td valign="middle" align="left">[<a href="libunistring_14.html#SEC67" title="Beginning of this chapter or previous chapter"> << </a>]</td> +<td valign="middle" align="left">[<a href="libunistring_16.html#SEC74" title="Next chapter"> >> </a>]</td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> @@ -73,12 +73,12 @@ ul.toc {list-style: none} <td valign="middle" align="left"> </td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Top" title="Cover (top) of document">Top</a>]</td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Contents" title="Table of contents">Contents</a>]</td> -<td valign="middle" align="left">[<a href="libunistring_19.html#SEC77" title="Index">Index</a>]</td> +<td valign="middle" align="left">[<a href="libunistring_20.html#SEC91" title="Index">Index</a>]</td> <td valign="middle" align="left">[<a href="libunistring_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <p> <font size="-1"> - This document was generated by <em>Daiki Ueno</em> on <em>November, 30 2017</em> using <a href="http://www.nongnu.org/texi2html/"><em>texi2html 1.78a</em></a>. + This document was generated by <em>Daiki Ueno</em> on <em>May, 25 2018</em> using <a href="http://www.nongnu.org/texi2html/"><em>texi2html 1.78a</em></a>. </font> <br> diff --git a/doc/libunistring_16.html b/doc/libunistring_16.html index 1cdd6bef..fc623c82 100644 --- a/doc/libunistring_16.html +++ b/doc/libunistring_16.html @@ -1,6 +1,6 @@ <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html401/loose.dtd"> <html> -<!-- Created on November, 30 2017 by texi2html 1.78a --> +<!-- Created on May, 25 2018 by texi2html 1.78a --> <!-- Written by: Lionel Cons <Lionel.Cons@cern.ch> (original author) Karl Berry <karl@freefriends.org> @@ -42,8 +42,8 @@ ul.toc {list-style: none} <body lang="en" bgcolor="#FFFFFF" text="#000000" link="#0000FF" vlink="#800080" alink="#FF0000"> <table cellpadding="1" cellspacing="1" border="0"> -<tr><td valign="middle" align="left">[<a href="libunistring_15.html#SEC60" title="Beginning of this chapter or previous chapter"> << </a>]</td> -<td valign="middle" align="left">[<a href="libunistring_17.html#SEC67" title="Next chapter"> >> </a>]</td> +<tr><td valign="middle" align="left">[<a href="libunistring_15.html#SEC73" title="Beginning of this chapter or previous chapter"> << </a>]</td> +<td valign="middle" align="left">[<a href="libunistring_17.html#SEC80" title="Next chapter"> >> </a>]</td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> @@ -51,14 +51,14 @@ ul.toc {list-style: none} <td valign="middle" align="left"> </td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Top" title="Cover (top) of document">Top</a>]</td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Contents" title="Table of contents">Contents</a>]</td> -<td valign="middle" align="left">[<a href="libunistring_19.html#SEC77" title="Index">Index</a>]</td> +<td valign="middle" align="left">[<a href="libunistring_20.html#SEC91" title="Index">Index</a>]</td> <td valign="middle" align="left">[<a href="libunistring_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <hr size="2"> <a name="Using-the-library"></a> -<a name="SEC61"></a> -<h1 class="chapter"> <a href="libunistring.html#TOC61">16. Using the library</a> </h1> +<a name="SEC74"></a> +<h1 class="chapter"> <a href="libunistring.html#TOC74">16. Using the library</a> </h1> <p>This chapter explains some practical considerations, regarding the installation and compiler options that are needed in order to use this @@ -67,22 +67,22 @@ library. <hr size="6"> <a name="Installation"></a> -<a name="SEC62"></a> -<h2 class="section"> <a href="libunistring.html#TOC62">16.1 Installation</a> </h2> +<a name="SEC75"></a> +<h2 class="section"> <a href="libunistring.html#TOC75">16.1 Installation</a> </h2> <p>Before you can use the library, it must be installed. First, you have to make sure all dependencies are installed. They are listed in the file ‘<tt>DEPENDENCIES</tt>’. </p> -<a name="IDX907"></a> +<a name="IDX898"></a> <p>Then you can proceed to build and install the library, as described in the file ‘<tt>INSTALL</tt>’. For installation on Windows systems, please refer to -the file ‘<tt>README.windows</tt>’. +the file ‘<tt>INSTALL.windows</tt>’. </p> <hr size="6"> <a name="Compiler-options"></a> -<a name="SEC63"></a> -<h2 class="section"> <a href="libunistring.html#TOC63">16.2 Compiler options</a> </h2> +<a name="SEC76"></a> +<h2 class="section"> <a href="libunistring.html#TOC76">16.2 Compiler options</a> </h2> <p>Let's denote as <code>LIBUNISTRING_PREFIX</code> the value of the ‘<samp>--prefix</samp>’ option that you passed to <code>configure</code> while installing this package. @@ -103,7 +103,7 @@ in 64-bit mode on a 64-bit GNU/Linux system that supports executables in either 64-bit mode or 32-bit mode, you should have used the option <code>--libdir=${LIBUNISTRING_PREFIX}/lib64</code>. </p> -<a name="IDX908"></a> +<a name="IDX899"></a> <p>So that the compiler finds the include files, you have to pass it the option <code>-I${LIBUNISTRING_INCLUDEDIR}</code>. </p> @@ -111,13 +111,13 @@ option <code>-I${LIBUNISTRING_INCLUDEDIR}</code>. to pass it the options <code>-L${LIBUNISTRING_LIBDIR} -lunistring</code>. On some systems, in some configurations, you also have to pass options needed for linking with <code>libiconv</code>. The autoconf macro -<code>gl_LIBUNISTRING</code> (see <a href="#SEC65">Autoconf macro</a>) deals with this +<code>gl_LIBUNISTRING</code> (see <a href="#SEC78">Autoconf macro</a>) deals with this particularity. </p> <hr size="6"> <a name="Include-files"></a> -<a name="SEC64"></a> -<h2 class="section"> <a href="libunistring.html#TOC64">16.3 Include files</a> </h2> +<a name="SEC77"></a> +<h2 class="section"> <a href="libunistring.html#TOC77">16.3 Include files</a> </h2> <p>Most of the include files have been presented in the introduction, see <a href="libunistring_1.html#SEC1">Introduction</a>, and subsequent detailed chapters. @@ -127,7 +127,7 @@ version number of the libunistring library. </p> <dl> <dt><u>Macro:</u> int <b>_LIBUNISTRING_VERSION</b> -<a name="IDX909"></a> +<a name="IDX900"></a> </dt> <dd><p>This constant contains the version of libunistring that is being used at compile time. It encodes the major and minor parts of the version @@ -136,7 +136,7 @@ number only. These parts are encoded in the form <code>(major<<8) + minor <dl> <dt><u>Constant:</u> int <b>_libunistring_version</b> -<a name="IDX910"></a> +<a name="IDX901"></a> </dt> <dd><p>This constant contains the version of libunistring that is being used at run time. It encodes the major and minor parts of the version @@ -151,15 +151,15 @@ that uses <code>libunistring</code> was installed. </p> <hr size="6"> <a name="Autoconf-macro"></a> -<a name="SEC65"></a> -<h2 class="section"> <a href="libunistring.html#TOC65">16.4 Autoconf macro</a> </h2> +<a name="SEC78"></a> +<h2 class="section"> <a href="libunistring.html#TOC78">16.4 Autoconf macro</a> </h2> <p>GNU Gnulib provides an autoconf macro that tests for the availability of <code>libunistring</code>. It is contained in the Gnulib module ‘<samp>libunistring</samp>’, see <a href="http://www.gnu.org/software/gnulib/MODULES.html#module=libunistring">http://www.gnu.org/software/gnulib/MODULES.html#module=libunistring</a>. </p> -<a name="IDX911"></a> +<a name="IDX902"></a> <p>The macro is called <code>gl_LIBUNISTRING</code>. It searches for an installed libunistring. If found, it sets and AC_SUBSTs <code>HAVE_LIBUNISTRING=yes</code> and the <code>LIBUNISTRING</code> and <code>LTLIBUNISTRING</code> variables and augments @@ -191,8 +191,8 @@ on most systems. <hr size="6"> <a name="Reporting-problems"></a> -<a name="SEC66"></a> -<h2 class="section"> <a href="libunistring.html#TOC66">16.5 Reporting problems</a> </h2> +<a name="SEC79"></a> +<h2 class="section"> <a href="libunistring.html#TOC79">16.5 Reporting problems</a> </h2> <p>If you encounter any problem, please don't hesitate to send a detailed bug report to the <code>bug-libunistring@gnu.org</code> mailing list. You can @@ -209,8 +209,8 @@ a description of the options that you passed to the ‘<samp>configure</samp </p> <hr size="6"> <table cellpadding="1" cellspacing="1" border="0"> -<tr><td valign="middle" align="left">[<a href="#SEC61" title="Beginning of this chapter or previous chapter"> << </a>]</td> -<td valign="middle" align="left">[<a href="libunistring_17.html#SEC67" title="Next chapter"> >> </a>]</td> +<tr><td valign="middle" align="left">[<a href="#SEC74" title="Beginning of this chapter or previous chapter"> << </a>]</td> +<td valign="middle" align="left">[<a href="libunistring_17.html#SEC80" title="Next chapter"> >> </a>]</td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> @@ -218,12 +218,12 @@ a description of the options that you passed to the ‘<samp>configure</samp <td valign="middle" align="left"> </td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Top" title="Cover (top) of document">Top</a>]</td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Contents" title="Table of contents">Contents</a>]</td> -<td valign="middle" align="left">[<a href="libunistring_19.html#SEC77" title="Index">Index</a>]</td> +<td valign="middle" align="left">[<a href="libunistring_20.html#SEC91" title="Index">Index</a>]</td> <td valign="middle" align="left">[<a href="libunistring_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <p> <font size="-1"> - This document was generated by <em>Daiki Ueno</em> on <em>November, 30 2017</em> using <a href="http://www.nongnu.org/texi2html/"><em>texi2html 1.78a</em></a>. + This document was generated by <em>Daiki Ueno</em> on <em>May, 25 2018</em> using <a href="http://www.nongnu.org/texi2html/"><em>texi2html 1.78a</em></a>. </font> <br> diff --git a/doc/libunistring_17.html b/doc/libunistring_17.html index 2d0ed80b..e055097e 100644 --- a/doc/libunistring_17.html +++ b/doc/libunistring_17.html @@ -1,6 +1,6 @@ <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html401/loose.dtd"> <html> -<!-- Created on November, 30 2017 by texi2html 1.78a --> +<!-- Created on May, 25 2018 by texi2html 1.78a --> <!-- Written by: Lionel Cons <Lionel.Cons@cern.ch> (original author) Karl Berry <karl@freefriends.org> @@ -42,8 +42,8 @@ ul.toc {list-style: none} <body lang="en" bgcolor="#FFFFFF" text="#000000" link="#0000FF" vlink="#800080" alink="#FF0000"> <table cellpadding="1" cellspacing="1" border="0"> -<tr><td valign="middle" align="left">[<a href="libunistring_16.html#SEC61" title="Beginning of this chapter or previous chapter"> << </a>]</td> -<td valign="middle" align="left">[<a href="libunistring_18.html#SEC68" title="Next chapter"> >> </a>]</td> +<tr><td valign="middle" align="left">[<a href="libunistring_16.html#SEC74" title="Beginning of this chapter or previous chapter"> << </a>]</td> +<td valign="middle" align="left">[<a href="libunistring_18.html#SEC81" title="Next chapter"> >> </a>]</td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> @@ -51,27 +51,27 @@ ul.toc {list-style: none} <td valign="middle" align="left"> </td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Top" title="Cover (top) of document">Top</a>]</td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Contents" title="Table of contents">Contents</a>]</td> -<td valign="middle" align="left">[<a href="libunistring_19.html#SEC77" title="Index">Index</a>]</td> +<td valign="middle" align="left">[<a href="libunistring_20.html#SEC91" title="Index">Index</a>]</td> <td valign="middle" align="left">[<a href="libunistring_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <hr size="2"> <a name="More-functionality"></a> -<a name="SEC67"></a> -<h1 class="chapter"> <a href="libunistring.html#TOC67">17. More advanced functionality</a> </h1> +<a name="SEC80"></a> +<h1 class="chapter"> <a href="libunistring.html#TOC80">17. More advanced functionality</a> </h1> <p>For bidirectional reordering of strings, we recommend the GNU FriBidi library: <a href="http://www.fribidi.org/">http://www.fribidi.org/</a>. </p> -<a name="IDX912"></a> +<a name="IDX903"></a> <p>For the rendering of Unicode strings outside of the context of a given toolkit (KDE/Qt or GNOME/Gtk), we recommend the Pango library: <a href="http://www.pango.org/">http://www.pango.org/</a>. </p> <hr size="6"> <table cellpadding="1" cellspacing="1" border="0"> -<tr><td valign="middle" align="left">[<a href="libunistring_16.html#SEC61" title="Beginning of this chapter or previous chapter"> << </a>]</td> -<td valign="middle" align="left">[<a href="libunistring_18.html#SEC68" title="Next chapter"> >> </a>]</td> +<tr><td valign="middle" align="left">[<a href="libunistring_16.html#SEC74" title="Beginning of this chapter or previous chapter"> << </a>]</td> +<td valign="middle" align="left">[<a href="libunistring_18.html#SEC81" title="Next chapter"> >> </a>]</td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> @@ -79,12 +79,12 @@ ul.toc {list-style: none} <td valign="middle" align="left"> </td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Top" title="Cover (top) of document">Top</a>]</td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Contents" title="Table of contents">Contents</a>]</td> -<td valign="middle" align="left">[<a href="libunistring_19.html#SEC77" title="Index">Index</a>]</td> +<td valign="middle" align="left">[<a href="libunistring_20.html#SEC91" title="Index">Index</a>]</td> <td valign="middle" align="left">[<a href="libunistring_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <p> <font size="-1"> - This document was generated by <em>Daiki Ueno</em> on <em>November, 30 2017</em> using <a href="http://www.nongnu.org/texi2html/"><em>texi2html 1.78a</em></a>. + This document was generated by <em>Daiki Ueno</em> on <em>May, 25 2018</em> using <a href="http://www.nongnu.org/texi2html/"><em>texi2html 1.78a</em></a>. </font> <br> diff --git a/doc/libunistring_18.html b/doc/libunistring_18.html index 92da25dd..06e2e2a9 100644 --- a/doc/libunistring_18.html +++ b/doc/libunistring_18.html @@ -1,6 +1,6 @@ <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html401/loose.dtd"> <html> -<!-- Created on November, 30 2017 by texi2html 1.78a --> +<!-- Created on May, 25 2018 by texi2html 1.78a --> <!-- Written by: Lionel Cons <Lionel.Cons@cern.ch> (original author) Karl Berry <karl@freefriends.org> @@ -11,10 +11,10 @@ Send bugs and suggestions to <texi2html-bug@nongnu.org> --> <head> -<title>GNU libunistring: A. Licenses</title> +<title>GNU libunistring: A. The wchar_t mess</title> -<meta name="description" content="GNU libunistring: A. Licenses"> -<meta name="keywords" content="GNU libunistring: A. Licenses"> +<meta name="description" content="GNU libunistring: A. The wchar_t mess"> +<meta name="keywords" content="GNU libunistring: A. The wchar_t mess"> <meta name="resource-type" content="document"> <meta name="distribution" content="global"> <meta name="Generator" content="texi2html 1.78a"> @@ -42,8 +42,8 @@ ul.toc {list-style: none} <body lang="en" bgcolor="#FFFFFF" text="#000000" link="#0000FF" vlink="#800080" alink="#FF0000"> <table cellpadding="1" cellspacing="1" border="0"> -<tr><td valign="middle" align="left">[<a href="libunistring_17.html#SEC67" title="Beginning of this chapter or previous chapter"> << </a>]</td> -<td valign="middle" align="left">[<a href="libunistring_19.html#SEC77" title="Next chapter"> >> </a>]</td> +<tr><td valign="middle" align="left">[<a href="libunistring_17.html#SEC80" title="Beginning of this chapter or previous chapter"> << </a>]</td> +<td valign="middle" align="left">[<a href="libunistring_19.html#SEC82" title="Next chapter"> >> </a>]</td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> @@ -51,1478 +51,67 @@ ul.toc {list-style: none} <td valign="middle" align="left"> </td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Top" title="Cover (top) of document">Top</a>]</td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Contents" title="Table of contents">Contents</a>]</td> -<td valign="middle" align="left">[<a href="libunistring_19.html#SEC77" title="Index">Index</a>]</td> +<td valign="middle" align="left">[<a href="libunistring_20.html#SEC91" title="Index">Index</a>]</td> <td valign="middle" align="left">[<a href="libunistring_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <hr size="2"> -<a name="Licenses"></a> -<a name="SEC68"></a> -<h1 class="appendix"> <a href="libunistring.html#TOC68">A. Licenses</a> </h1> +<a name="The-wchar_005ft-mess"></a> +<a name="SEC81"></a> +<h1 class="appendix"> <a href="libunistring.html#TOC81">A. The <code>wchar_t</code> mess</a> </h1> -<p>The files of this package are covered by the licenses indicated in each -particular file or directory. Here is a summary: -</p> -<ul> -<li> -The <code>libunistring</code> library and its header files are dual-licensed under -"the GNU LGPLv3+ or the GNU GPLv2". This means, you can use it under either -<ul class="toc"> -<li> - -the terms of the GNU Lesser General Public License (LGPL) version 3 or -(at your option) any later version, or -</li><li> - -the terms of the GNU General Public License (GPL) version 2, or -</li><li> - -the same dual license "the GNU LGPLv3+ or the GNU GPLv2". -</li></ul> -<p>You find the GNU LGPL version 3 in <a href="#SEC74">GNU LESSER GENERAL PUBLIC LICENSE</a>. This license is -based on the GNU GPL version 3, see <a href="#SEC69">GNU GENERAL PUBLIC LICENSE</a>. -<br> -You can find the GNU GPL version 2 at -<a href="https://www.gnu.org/licenses/old-licenses/gpl-2.0.html">https://www.gnu.org/licenses/old-licenses/gpl-2.0.html</a>. -<br> -Note: This dual license makes it possible for the <code>libunistring</code> library -to be used by packages under GPLv2 or GPLv2+ licenses, in particular. See -the table in <a href="https://www.gnu.org/licenses/gpl-faq.html#AllCompatibility">https://www.gnu.org/licenses/gpl-faq.html#AllCompatibility</a>. -</p> - -</li><li> -This manual is free documentation. It is dually licensed under the -GNU FDL and the GNU GPL. This means that you can redistribute this -manual under either of these two licenses, at your choice. -<br> -This manual is covered by the GNU FDL. Permission is granted to copy, -distribute and/or modify this document under the terms of the -GNU Free Documentation License (FDL), either version 1.2 of the -License, or (at your option) any later version published by the -Free Software Foundation (FSF); with no Invariant Sections, with no -Front-Cover Text, and with no Back-Cover Texts. -A copy of the license is included in <a href="#SEC75">GNU Free Documentation License</a>. -<br> -This manual is covered by the GNU GPL. You can redistribute it and/or -modify it under the terms of the GNU General Public License (GPL), either -version 3 of the License, or (at your option) any later version published -by the Free Software Foundation (FSF). -A copy of the license is included in <a href="#SEC69">GNU GENERAL PUBLIC LICENSE</a>. -</li></ul> - - - -<hr size="6"> -<a name="GNU-GPL"></a> -<a name="SEC69"></a> -<h2 class="appendixsec"> <a href="libunistring.html#TOC69">A.1 GNU GENERAL PUBLIC LICENSE</a> </h2> -<p align="center"> Version 3, 29 June 2007 -</p> - -<table><tr><td> </td><td><pre class="display">Copyright © 2007 Free Software Foundation, Inc. <a href="http://fsf.org/">http://fsf.org/</a> - -Everyone is permitted to copy and distribute verbatim copies of this -license document, but changing it is not allowed. -</pre></td></tr></table> - -<a name="SEC70"></a> -<h2 class="heading"> Preamble </h2> - -<p>The GNU General Public License is a free, copyleft license for -software and other kinds of works. -</p> -<p>The licenses for most software and other practical works are designed -to take away your freedom to share and change the works. By contrast, -the GNU General Public License is intended to guarantee your freedom -to share and change all versions of a program—to make sure it remains -free software for all its users. We, the Free Software Foundation, -use the GNU General Public License for most of our software; it -applies also to any other work released this way by its authors. You -can apply it to your programs, too. -</p> -<p>When we speak of free software, we are referring to freedom, not -price. Our General Public Licenses are designed to make sure that you -have the freedom to distribute copies of free software (and charge for -them if you wish), that you receive source code or can get it if you -want it, that you can change the software or use pieces of it in new -free programs, and that you know you can do these things. -</p> -<p>To protect your rights, we need to prevent others from denying you -these rights or asking you to surrender the rights. Therefore, you -have certain responsibilities if you distribute copies of the -software, or if you modify it: responsibilities to respect the freedom -of others. -</p> -<p>For example, if you distribute copies of such a program, whether -gratis or for a fee, you must pass on to the recipients the same -freedoms that you received. You must make sure that they, too, -receive or can get the source code. And you must show them these -terms so they know their rights. -</p> -<p>Developers that use the GNU GPL protect your rights with two steps: -(1) assert copyright on the software, and (2) offer you this License -giving you legal permission to copy, distribute and/or modify it. -</p> -<p>For the developers' and authors' protection, the GPL clearly explains -that there is no warranty for this free software. For both users' and -authors' sake, the GPL requires that modified versions be marked as -changed, so that their problems will not be attributed erroneously to -authors of previous versions. -</p> -<p>Some devices are designed to deny users access to install or run -modified versions of the software inside them, although the -manufacturer can do so. This is fundamentally incompatible with the -aim of protecting users' freedom to change the software. The -systematic pattern of such abuse occurs in the area of products for -individuals to use, which is precisely where it is most unacceptable. -Therefore, we have designed this version of the GPL to prohibit the -practice for those products. If such problems arise substantially in -other domains, we stand ready to extend this provision to those -domains in future versions of the GPL, as needed to protect the -freedom of users. -</p> -<p>Finally, every program is threatened constantly by software patents. -States should not allow patents to restrict development and use of -software on general-purpose computers, but in those that do, we wish -to avoid the special danger that patents applied to a free program -could make it effectively proprietary. To prevent this, the GPL -assures that patents cannot be used to render the program non-free. -</p> -<p>The precise terms and conditions for copying, distribution and -modification follow. -</p> -<a name="SEC71"></a> -<h2 class="heading"> TERMS AND CONDITIONS </h2> - -<ol> -<li> Definitions. - -<p>“This License” refers to version 3 of the GNU General Public License. -</p> -<p>“Copyright” also means copyright-like laws that apply to other kinds -of works, such as semiconductor masks. -</p> -<p>“The Program” refers to any copyrightable work licensed under this -License. Each licensee is addressed as “you”. “Licensees” and -“recipients” may be individuals or organizations. -</p> -<p>To “modify” a work means to copy from or adapt all or part of the work -in a fashion requiring copyright permission, other than the making of -an exact copy. The resulting work is called a “modified version” of -the earlier work or a work “based on” the earlier work. -</p> -<p>A “covered work” means either the unmodified Program or a work based -on the Program. -</p> -<p>To “propagate” a work means to do anything with it that, without -permission, would make you directly or secondarily liable for -infringement under applicable copyright law, except executing it on a -computer or modifying a private copy. Propagation includes copying, -distribution (with or without modification), making available to the -public, and in some countries other activities as well. -</p> -<p>To “convey” a work means any kind of propagation that enables other -parties to make or receive copies. Mere interaction with a user -through a computer network, with no transfer of a copy, is not -conveying. -</p> -<p>An interactive user interface displays “Appropriate Legal Notices” to -the extent that it includes a convenient and prominently visible -feature that (1) displays an appropriate copyright notice, and (2) -tells the user that there is no warranty for the work (except to the -extent that warranties are provided), that licensees may convey the -work under this License, and how to view a copy of this License. If -the interface presents a list of user commands or options, such as a -menu, a prominent item in the list meets this criterion. -</p> -</li><li> Source Code. - -<p>The “source code” for a work means the preferred form of the work for -making modifications to it. “Object code” means any non-source form -of a work. -</p> -<p>A “Standard Interface” means an interface that either is an official -standard defined by a recognized standards body, or, in the case of -interfaces specified for a particular programming language, one that -is widely used among developers working in that language. -</p> -<p>The “System Libraries” of an executable work include anything, other -than the work as a whole, that (a) is included in the normal form of -packaging a Major Component, but which is not part of that Major -Component, and (b) serves only to enable use of the work with that -Major Component, or to implement a Standard Interface for which an -implementation is available to the public in source code form. A -“Major Component”, in this context, means a major essential component -(kernel, window system, and so on) of the specific operating system -(if any) on which the executable work runs, or a compiler used to -produce the work, or an object code interpreter used to run it. -</p> -<p>The “Corresponding Source” for a work in object code form means all -the source code needed to generate, install, and (for an executable -work) run the object code and to modify the work, including scripts to -control those activities. However, it does not include the work's -System Libraries, or general-purpose tools or generally available free -programs which are used unmodified in performing those activities but -which are not part of the work. For example, Corresponding Source -includes interface definition files associated with source files for -the work, and the source code for shared libraries and dynamically -linked subprograms that the work is specifically designed to require, -such as by intimate data communication or control flow between those -subprograms and other parts of the work. -</p> -<p>The Corresponding Source need not include anything that users can -regenerate automatically from other parts of the Corresponding Source. -</p> -<p>The Corresponding Source for a work in source code form is that same -work. -</p> -</li><li> Basic Permissions. - -<p>All rights granted under this License are granted for the term of -copyright on the Program, and are irrevocable provided the stated -conditions are met. This License explicitly affirms your unlimited -permission to run the unmodified Program. The output from running a -covered work is covered by this License only if the output, given its -content, constitutes a covered work. This License acknowledges your -rights of fair use or other equivalent, as provided by copyright law. -</p> -<p>You may make, run and propagate covered works that you do not convey, -without conditions so long as your license otherwise remains in force. -You may convey covered works to others for the sole purpose of having -them make modifications exclusively for you, or provide you with -facilities for running those works, provided that you comply with the -terms of this License in conveying all material for which you do not -control copyright. Those thus making or running the covered works for -you must do so exclusively on your behalf, under your direction and -control, on terms that prohibit them from making any copies of your -copyrighted material outside their relationship with you. -</p> -<p>Conveying under any other circumstances is permitted solely under the -conditions stated below. Sublicensing is not allowed; section 10 -makes it unnecessary. -</p> -</li><li> Protecting Users' Legal Rights From Anti-Circumvention Law. - -<p>No covered work shall be deemed part of an effective technological -measure under any applicable law fulfilling obligations under article -11 of the WIPO copyright treaty adopted on 20 December 1996, or -similar laws prohibiting or restricting circumvention of such -measures. -</p> -<p>When you convey a covered work, you waive any legal power to forbid -circumvention of technological measures to the extent such -circumvention is effected by exercising rights under this License with -respect to the covered work, and you disclaim any intention to limit -operation or modification of the work as a means of enforcing, against -the work's users, your or third parties' legal rights to forbid -circumvention of technological measures. -</p> -</li><li> Conveying Verbatim Copies. - -<p>You may convey verbatim copies of the Program's source code as you -receive it, in any medium, provided that you conspicuously and -appropriately publish on each copy an appropriate copyright notice; -keep intact all notices stating that this License and any -non-permissive terms added in accord with section 7 apply to the code; -keep intact all notices of the absence of any warranty; and give all -recipients a copy of this License along with the Program. -</p> -<p>You may charge any price or no price for each copy that you convey, -and you may offer support or warranty protection for a fee. -</p> -</li><li> Conveying Modified Source Versions. - -<p>You may convey a work based on the Program, or the modifications to -produce it from the Program, in the form of source code under the -terms of section 4, provided that you also meet all of these -conditions: -</p> -<ol> -<li> -The work must carry prominent notices stating that you modified it, -and giving a relevant date. - -</li><li> -The work must carry prominent notices stating that it is released -under this License and any conditions added under section 7. This -requirement modifies the requirement in section 4 to “keep intact all -notices”. - -</li><li> -You must license the entire work, as a whole, under this License to -anyone who comes into possession of a copy. This License will -therefore apply, along with any applicable section 7 additional terms, -to the whole of the work, and all its parts, regardless of how they -are packaged. This License gives no permission to license the work in -any other way, but it does not invalidate such permission if you have -separately received it. - -</li><li> -If the work has interactive user interfaces, each must display -Appropriate Legal Notices; however, if the Program has interactive -interfaces that do not display Appropriate Legal Notices, your work -need not make them do so. -</li></ol> - -<p>A compilation of a covered work with other separate and independent -works, which are not by their nature extensions of the covered work, -and which are not combined with it such as to form a larger program, -in or on a volume of a storage or distribution medium, is called an -“aggregate” if the compilation and its resulting copyright are not -used to limit the access or legal rights of the compilation's users -beyond what the individual works permit. Inclusion of a covered work -in an aggregate does not cause this License to apply to the other -parts of the aggregate. -</p> -</li><li> Conveying Non-Source Forms. - -<p>You may convey a covered work in object code form under the terms of -sections 4 and 5, provided that you also convey the machine-readable -Corresponding Source under the terms of this License, in one of these -ways: -</p> -<ol> -<li> -Convey the object code in, or embodied in, a physical product -(including a physical distribution medium), accompanied by the -Corresponding Source fixed on a durable physical medium customarily -used for software interchange. - -</li><li> -Convey the object code in, or embodied in, a physical product -(including a physical distribution medium), accompanied by a written -offer, valid for at least three years and valid for as long as you -offer spare parts or customer support for that product model, to give -anyone who possesses the object code either (1) a copy of the -Corresponding Source for all the software in the product that is -covered by this License, on a durable physical medium customarily used -for software interchange, for a price no more than your reasonable -cost of physically performing this conveying of source, or (2) access -to copy the Corresponding Source from a network server at no charge. - -</li><li> -Convey individual copies of the object code with a copy of the written -offer to provide the Corresponding Source. This alternative is -allowed only occasionally and noncommercially, and only if you -received the object code with such an offer, in accord with subsection -6b. - -</li><li> -Convey the object code by offering access from a designated place -(gratis or for a charge), and offer equivalent access to the -Corresponding Source in the same way through the same place at no -further charge. You need not require recipients to copy the -Corresponding Source along with the object code. If the place to copy -the object code is a network server, the Corresponding Source may be -on a different server (operated by you or a third party) that supports -equivalent copying facilities, provided you maintain clear directions -next to the object code saying where to find the Corresponding Source. -Regardless of what server hosts the Corresponding Source, you remain -obligated to ensure that it is available for as long as needed to -satisfy these requirements. - -</li><li> -Convey the object code using peer-to-peer transmission, provided you -inform other peers where the object code and Corresponding Source of -the work are being offered to the general public at no charge under -subsection 6d. - -</li></ol> - -<p>A separable portion of the object code, whose source code is excluded -from the Corresponding Source as a System Library, need not be -included in conveying the object code work. -</p> -<p>A “User Product” is either (1) a “consumer product”, which means any -tangible personal property which is normally used for personal, -family, or household purposes, or (2) anything designed or sold for -incorporation into a dwelling. In determining whether a product is a -consumer product, doubtful cases shall be resolved in favor of -coverage. For a particular product received by a particular user, -“normally used” refers to a typical or common use of that class of -product, regardless of the status of the particular user or of the way -in which the particular user actually uses, or expects or is expected -to use, the product. A product is a consumer product regardless of -whether the product has substantial commercial, industrial or -non-consumer uses, unless such uses represent the only significant -mode of use of the product. -</p> -<p>“Installation Information” for a User Product means any methods, -procedures, authorization keys, or other information required to -install and execute modified versions of a covered work in that User -Product from a modified version of its Corresponding Source. The -information must suffice to ensure that the continued functioning of -the modified object code is in no case prevented or interfered with -solely because modification has been made. -</p> -<p>If you convey an object code work under this section in, or with, or -specifically for use in, a User Product, and the conveying occurs as -part of a transaction in which the right of possession and use of the -User Product is transferred to the recipient in perpetuity or for a -fixed term (regardless of how the transaction is characterized), the -Corresponding Source conveyed under this section must be accompanied -by the Installation Information. But this requirement does not apply -if neither you nor any third party retains the ability to install -modified object code on the User Product (for example, the work has -been installed in ROM). -</p> -<p>The requirement to provide Installation Information does not include a -requirement to continue to provide support service, warranty, or -updates for a work that has been modified or installed by the -recipient, or for the User Product in which it has been modified or -installed. Access to a network may be denied when the modification -itself materially and adversely affects the operation of the network -or violates the rules and protocols for communication across the -network. -</p> -<p>Corresponding Source conveyed, and Installation Information provided, -in accord with this section must be in a format that is publicly -documented (and with an implementation available to the public in -source code form), and must require no special password or key for -unpacking, reading or copying. -</p> -</li><li> Additional Terms. - -<p>“Additional permissions” are terms that supplement the terms of this -License by making exceptions from one or more of its conditions. -Additional permissions that are applicable to the entire Program shall -be treated as though they were included in this License, to the extent -that they are valid under applicable law. If additional permissions -apply only to part of the Program, that part may be used separately -under those permissions, but the entire Program remains governed by -this License without regard to the additional permissions. -</p> -<p>When you convey a copy of a covered work, you may at your option -remove any additional permissions from that copy, or from any part of -it. (Additional permissions may be written to require their own -removal in certain cases when you modify the work.) You may place -additional permissions on material, added by you to a covered work, -for which you have or can give appropriate copyright permission. -</p> -<p>Notwithstanding any other provision of this License, for material you -add to a covered work, you may (if authorized by the copyright holders -of that material) supplement the terms of this License with terms: -</p> -<ol> -<li> -Disclaiming warranty or limiting liability differently from the terms -of sections 15 and 16 of this License; or - -</li><li> -Requiring preservation of specified reasonable legal notices or author -attributions in that material or in the Appropriate Legal Notices -displayed by works containing it; or - -</li><li> -Prohibiting misrepresentation of the origin of that material, or -requiring that modified versions of such material be marked in -reasonable ways as different from the original version; or - -</li><li> -Limiting the use for publicity purposes of names of licensors or -authors of the material; or - -</li><li> -Declining to grant rights under trademark law for use of some trade -names, trademarks, or service marks; or - -</li><li> -Requiring indemnification of licensors and authors of that material by -anyone who conveys the material (or modified versions of it) with -contractual assumptions of liability to the recipient, for any -liability that these contractual assumptions directly impose on those -licensors and authors. -</li></ol> - -<p>All other non-permissive additional terms are considered “further -restrictions” within the meaning of section 10. If the Program as you -received it, or any part of it, contains a notice stating that it is -governed by this License along with a term that is a further -restriction, you may remove that term. If a license document contains -a further restriction but permits relicensing or conveying under this -License, you may add to a covered work material governed by the terms -of that license document, provided that the further restriction does -not survive such relicensing or conveying. -</p> -<p>If you add terms to a covered work in accord with this section, you -must place, in the relevant source files, a statement of the -additional terms that apply to those files, or a notice indicating -where to find the applicable terms. -</p> -<p>Additional terms, permissive or non-permissive, may be stated in the -form of a separately written license, or stated as exceptions; the -above requirements apply either way. -</p> -</li><li> Termination. - -<p>You may not propagate or modify a covered work except as expressly -provided under this License. Any attempt otherwise to propagate or -modify it is void, and will automatically terminate your rights under -this License (including any patent licenses granted under the third -paragraph of section 11). -</p> -<p>However, if you cease all violation of this License, then your license -from a particular copyright holder is reinstated (a) provisionally, -unless and until the copyright holder explicitly and finally -terminates your license, and (b) permanently, if the copyright holder -fails to notify you of the violation by some reasonable means prior to -60 days after the cessation. -</p> -<p>Moreover, your license from a particular copyright holder is -reinstated permanently if the copyright holder notifies you of the -violation by some reasonable means, this is the first time you have -received notice of violation of this License (for any work) from that -copyright holder, and you cure the violation prior to 30 days after -your receipt of the notice. -</p> -<p>Termination of your rights under this section does not terminate the -licenses of parties who have received copies or rights from you under -this License. If your rights have been terminated and not permanently -reinstated, you do not qualify to receive new licenses for the same -material under section 10. -</p> -</li><li> Acceptance Not Required for Having Copies. - -<p>You are not required to accept this License in order to receive or run -a copy of the Program. Ancillary propagation of a covered work -occurring solely as a consequence of using peer-to-peer transmission -to receive a copy likewise does not require acceptance. However, -nothing other than this License grants you permission to propagate or -modify any covered work. These actions infringe copyright if you do -not accept this License. Therefore, by modifying or propagating a -covered work, you indicate your acceptance of this License to do so. -</p> -</li><li> Automatic Licensing of Downstream Recipients. - -<p>Each time you convey a covered work, the recipient automatically -receives a license from the original licensors, to run, modify and -propagate that work, subject to this License. You are not responsible -for enforcing compliance by third parties with this License. -</p> -<p>An “entity transaction” is a transaction transferring control of an -organization, or substantially all assets of one, or subdividing an -organization, or merging organizations. If propagation of a covered -work results from an entity transaction, each party to that -transaction who receives a copy of the work also receives whatever -licenses to the work the party's predecessor in interest had or could -give under the previous paragraph, plus a right to possession of the -Corresponding Source of the work from the predecessor in interest, if -the predecessor has it or can get it with reasonable efforts. -</p> -<p>You may not impose any further restrictions on the exercise of the -rights granted or affirmed under this License. For example, you may -not impose a license fee, royalty, or other charge for exercise of -rights granted under this License, and you may not initiate litigation -(including a cross-claim or counterclaim in a lawsuit) alleging that -any patent claim is infringed by making, using, selling, offering for -sale, or importing the Program or any portion of it. -</p> -</li><li> Patents. - -<p>A “contributor” is a copyright holder who authorizes use under this -License of the Program or a work on which the Program is based. The -work thus licensed is called the contributor's “contributor version”. -</p> -<p>A contributor's “essential patent claims” are all patent claims owned -or controlled by the contributor, whether already acquired or -hereafter acquired, that would be infringed by some manner, permitted -by this License, of making, using, or selling its contributor version, -but do not include claims that would be infringed only as a -consequence of further modification of the contributor version. For -purposes of this definition, “control” includes the right to grant -patent sublicenses in a manner consistent with the requirements of -this License. -</p> -<p>Each contributor grants you a non-exclusive, worldwide, royalty-free -patent license under the contributor's essential patent claims, to -make, use, sell, offer for sale, import and otherwise run, modify and -propagate the contents of its contributor version. -</p> -<p>In the following three paragraphs, a “patent license” is any express -agreement or commitment, however denominated, not to enforce a patent -(such as an express permission to practice a patent or covenant not to -sue for patent infringement). To “grant” such a patent license to a -party means to make such an agreement or commitment not to enforce a -patent against the party. -</p> -<p>If you convey a covered work, knowingly relying on a patent license, -and the Corresponding Source of the work is not available for anyone -to copy, free of charge and under the terms of this License, through a -publicly available network server or other readily accessible means, -then you must either (1) cause the Corresponding Source to be so -available, or (2) arrange to deprive yourself of the benefit of the -patent license for this particular work, or (3) arrange, in a manner -consistent with the requirements of this License, to extend the patent -license to downstream recipients. “Knowingly relying” means you have -actual knowledge that, but for the patent license, your conveying the -covered work in a country, or your recipient's use of the covered work -in a country, would infringe one or more identifiable patents in that -country that you have reason to believe are valid. -</p> -<p>If, pursuant to or in connection with a single transaction or -arrangement, you convey, or propagate by procuring conveyance of, a -covered work, and grant a patent license to some of the parties -receiving the covered work authorizing them to use, propagate, modify -or convey a specific copy of the covered work, then the patent license -you grant is automatically extended to all recipients of the covered -work and works based on it. -</p> -<p>A patent license is “discriminatory” if it does not include within the -scope of its coverage, prohibits the exercise of, or is conditioned on -the non-exercise of one or more of the rights that are specifically -granted under this License. You may not convey a covered work if you -are a party to an arrangement with a third party that is in the -business of distributing software, under which you make payment to the -third party based on the extent of your activity of conveying the -work, and under which the third party grants, to any of the parties -who would receive the covered work from you, a discriminatory patent -license (a) in connection with copies of the covered work conveyed by -you (or copies made from those copies), or (b) primarily for and in -connection with specific products or compilations that contain the -covered work, unless you entered into that arrangement, or that patent -license was granted, prior to 28 March 2007. -</p> -<p>Nothing in this License shall be construed as excluding or limiting -any implied license or other defenses to infringement that may -otherwise be available to you under applicable patent law. -</p> -</li><li> No Surrender of Others' Freedom. - -<p>If conditions are imposed on you (whether by court order, agreement or -otherwise) that contradict the conditions of this License, they do not -excuse you from the conditions of this License. If you cannot convey -a covered work so as to satisfy simultaneously your obligations under -this License and any other pertinent obligations, then as a -consequence you may not convey it at all. For example, if you agree -to terms that obligate you to collect a royalty for further conveying -from those to whom you convey the Program, the only way you could -satisfy both those terms and this License would be to refrain entirely -from conveying the Program. -</p> -</li><li> Use with the GNU Affero General Public License. - -<p>Notwithstanding any other provision of this License, you have -permission to link or combine any covered work with a work licensed -under version 3 of the GNU Affero General Public License into a single -combined work, and to convey the resulting work. The terms of this -License will continue to apply to the part which is the covered work, -but the special requirements of the GNU Affero General Public License, -section 13, concerning interaction through a network will apply to the -combination as such. -</p> -</li><li> Revised Versions of this License. - -<p>The Free Software Foundation may publish revised and/or new versions -of the GNU General Public License from time to time. Such new -versions will be similar in spirit to the present version, but may -differ in detail to address new problems or concerns. -</p> -<p>Each version is given a distinguishing version number. If the Program -specifies that a certain numbered version of the GNU General Public -License “or any later version” applies to it, you have the option of -following the terms and conditions either of that numbered version or -of any later version published by the Free Software Foundation. If -the Program does not specify a version number of the GNU General -Public License, you may choose any version ever published by the Free -Software Foundation. -</p> -<p>If the Program specifies that a proxy can decide which future versions -of the GNU General Public License can be used, that proxy's public -statement of acceptance of a version permanently authorizes you to -choose that version for the Program. -</p> -<p>Later license versions may give you additional or different -permissions. However, no additional obligations are imposed on any -author or copyright holder as a result of your choosing to follow a -later version. -</p> -</li><li> Disclaimer of Warranty. - -<p>THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY -APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT -HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM “AS IS” WITHOUT -WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT -LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR -A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND -PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE -DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR -CORRECTION. -</p> -</li><li> Limitation of Liability. - -<p>IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING -WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR -CONVEYS THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, -INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES -ARISING OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT -NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR -LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM -TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER -PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. -</p> -</li><li> Interpretation of Sections 15 and 16. - -<p>If the disclaimer of warranty and limitation of liability provided -above cannot be given local legal effect according to their terms, -reviewing courts shall apply local law that most closely approximates -an absolute waiver of all civil liability in connection with the -Program, unless a warranty or assumption of liability accompanies a -copy of the Program in return for a fee. -</p> -</li></ol> - -<a name="SEC72"></a> -<h2 class="heading"> END OF TERMS AND CONDITIONS </h2> - -<a name="SEC73"></a> -<h2 class="heading"> How to Apply These Terms to Your New Programs </h2> - -<p>If you develop a new program, and you want it to be of the greatest -possible use to the public, the best way to achieve this is to make it -free software which everyone can redistribute and change under these -terms. -</p> -<p>To do so, attach the following notices to the program. It is safest -to attach them to the start of each source file to most effectively -state the exclusion of warranty; and each file should have at least -the “copyright” line and a pointer to where the full notice is found. -</p> -<table><tr><td> </td><td><pre class="smallexample"><var>one line to give the program's name and a brief idea of what it does.</var> -Copyright (C) <var>year</var> <var>name of author</var> - -This program is free software: you can redistribute it and/or modify -it under the terms of the GNU General Public License as published by -the Free Software Foundation, either version 3 of the License, or (at -your option) any later version. - -This program is distributed in the hope that it will be useful, but -WITHOUT ANY WARRANTY; without even the implied warranty of -MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU -General Public License for more details. - -You should have received a copy of the GNU General Public License -along with this program. If not, see <a href="http://www.gnu.org/licenses/">http://www.gnu.org/licenses/</a>. -</pre></td></tr></table> - -<p>Also add information on how to contact you by electronic and paper mail. -</p> -<p>If the program does terminal interaction, make it output a short -notice like this when it starts in an interactive mode: -</p> -<table><tr><td> </td><td><pre class="smallexample"><var>program</var> Copyright (C) <var>year</var> <var>name of author</var> -This program comes with ABSOLUTELY NO WARRANTY; for details type ‘<samp>show w</samp>’. -This is free software, and you are welcome to redistribute it -under certain conditions; type ‘<samp>show c</samp>’ for details. -</pre></td></tr></table> - -<p>The hypothetical commands ‘<samp>show w</samp>’ and ‘<samp>show c</samp>’ should show -the appropriate parts of the General Public License. Of course, your -program's commands might be different; for a GUI interface, you would -use an “about box”. -</p> -<p>You should also get your employer (if you work as a programmer) or school, -if any, to sign a “copyright disclaimer” for the program, if necessary. -For more information on this, and how to apply and follow the GNU GPL, see -<a href="http://www.gnu.org/licenses/">http://www.gnu.org/licenses/</a>. -</p> -<p>The GNU General Public License does not permit incorporating your -program into proprietary programs. If your program is a subroutine -library, you may consider it more useful to permit linking proprietary -applications with the library. If this is what you want to do, use -the GNU Lesser General Public License instead of this License. But -first, please read <a href="http://www.gnu.org/philosophy/why-not-lgpl.html">http://www.gnu.org/philosophy/why-not-lgpl.html</a>. - -</p><hr size="6"> -<a name="GNU-LGPL"></a> -<a name="SEC74"></a> -<h2 class="appendixsec"> <a href="libunistring.html#TOC70">A.2 GNU LESSER GENERAL PUBLIC LICENSE</a> </h2> -<p align="center"> Version 3, 29 June 2007 -</p> - -<table><tr><td> </td><td><pre class="display">Copyright © 2007 Free Software Foundation, Inc. <a href="http://fsf.org/">http://fsf.org/</a> - -Everyone is permitted to copy and distribute verbatim copies of this -license document, but changing it is not allowed. -</pre></td></tr></table> - -<p>This version of the GNU Lesser General Public License incorporates -the terms and conditions of version 3 of the GNU General Public -License, supplemented by the additional permissions listed below. -</p> -<ol> -<li> Additional Definitions. - -<p>As used herein, “this License” refers to version 3 of the GNU Lesser -General Public License, and the “GNU GPL” refers to version 3 of the GNU -General Public License. -</p> -<p>“The Library” refers to a covered work governed by this License, -other than an Application or a Combined Work as defined below. -</p> -<p>An “Application” is any work that makes use of an interface provided -by the Library, but which is not otherwise based on the Library. -Defining a subclass of a class defined by the Library is deemed a mode -of using an interface provided by the Library. -</p> -<p>A “Combined Work” is a work produced by combining or linking an -Application with the Library. The particular version of the Library -with which the Combined Work was made is also called the “Linked -Version”. -</p> -<p>The “Minimal Corresponding Source” for a Combined Work means the -Corresponding Source for the Combined Work, excluding any source code -for portions of the Combined Work that, considered in isolation, are -based on the Application, and not on the Linked Version. -</p> -<p>The “Corresponding Application Code” for a Combined Work means the -object code and/or source code for the Application, including any data -and utility programs needed for reproducing the Combined Work from the -Application, but excluding the System Libraries of the Combined Work. -</p> -</li><li> Exception to Section 3 of the GNU GPL. - -<p>You may convey a covered work under sections 3 and 4 of this License -without being bound by section 3 of the GNU GPL. -</p> -</li><li> Conveying Modified Versions. - -<p>If you modify a copy of the Library, and, in your modifications, a -facility refers to a function or data to be supplied by an Application -that uses the facility (other than as an argument passed when the -facility is invoked), then you may convey a copy of the modified -version: -</p> -<ol> -<li> -under this License, provided that you make a good faith effort to -ensure that, in the event an Application does not supply the -function or data, the facility still operates, and performs -whatever part of its purpose remains meaningful, or - -</li><li> -under the GNU GPL, with none of the additional permissions of -this License applicable to that copy. -</li></ol> - -</li><li> Object Code Incorporating Material from Library Header Files. - -<p>The object code form of an Application may incorporate material from -a header file that is part of the Library. You may convey such object -code under terms of your choice, provided that, if the incorporated -material is not limited to numerical parameters, data structure -layouts and accessors, or small macros, inline functions and templates -(ten or fewer lines in length), you do both of the following: -</p> -<ol> -<li> -Give prominent notice with each copy of the object code that the -Library is used in it and that the Library and its use are -covered by this License. -</li><li> -Accompany the object code with a copy of the GNU GPL and this license -document. -</li></ol> - -</li><li> Combined Works. - -<p>You may convey a Combined Work under terms of your choice that, -taken together, effectively do not restrict modification of the -portions of the Library contained in the Combined Work and reverse -engineering for debugging such modifications, if you also do each of -the following: -</p> -<ol> -<li> -Give prominent notice with each copy of the Combined Work that -the Library is used in it and that the Library and its use are -covered by this License. -</li><li> -Accompany the Combined Work with a copy of the GNU GPL and this license -document. -</li><li> -For a Combined Work that displays copyright notices during -execution, include the copyright notice for the Library among -these notices, as well as a reference directing the user to the -copies of the GNU GPL and this license document. -</li><li> -Do one of the following: - -<ol> -<li> -Convey the Minimal Corresponding Source under the terms of this -License, and the Corresponding Application Code in a form -suitable for, and under terms that permit, the user to -recombine or relink the Application with a modified version of -the Linked Version to produce a modified Combined Work, in the -manner specified by section 6 of the GNU GPL for conveying -Corresponding Source. -</li><li> -Use a suitable shared library mechanism for linking with the -Library. A suitable mechanism is one that (a) uses at run time -a copy of the Library already present on the user's computer -system, and (b) will operate properly with a modified version -of the Library that is interface-compatible with the Linked -Version. -</li></ol> - -</li><li> -Provide Installation Information, but only if you would otherwise -be required to provide such information under section 6 of the -GNU GPL, and only to the extent that such information is -necessary to install and execute a modified version of the -Combined Work produced by recombining or relinking the -Application with a modified version of the Linked Version. (If -you use option 4d0, the Installation Information must accompany -the Minimal Corresponding Source and Corresponding Application -Code. If you use option 4d1, you must provide the Installation -Information in the manner specified by section 6 of the GNU GPL -for conveying Corresponding Source.) -</li></ol> - -</li><li> Combined Libraries. - -<p>You may place library facilities that are a work based on the -Library side by side in a single library together with other library -facilities that are not Applications and are not covered by this -License, and convey such a combined library under terms of your -choice, if you do both of the following: -</p> -<ol> -<li> -Accompany the combined library with a copy of the same work based -on the Library, uncombined with any other library facilities, -conveyed under the terms of this License. -</li><li> -Give prominent notice with the combined library that part of it -is a work based on the Library, and explaining where to find the -accompanying uncombined form of the same work. -</li></ol> - -</li><li> Revised Versions of the GNU Lesser General Public License. - -<p>The Free Software Foundation may publish revised and/or new versions -of the GNU Lesser General Public License from time to time. Such new -versions will be similar in spirit to the present version, but may -differ in detail to address new problems or concerns. -</p> -<p>Each version is given a distinguishing version number. If the -Library as you received it specifies that a certain numbered version -of the GNU Lesser General Public License “or any later version” -applies to it, you have the option of following the terms and -conditions either of that published version or of any later version -published by the Free Software Foundation. If the Library as you -received it does not specify a version number of the GNU Lesser -General Public License, you may choose any version of the GNU Lesser -General Public License ever published by the Free Software Foundation. -</p> -<p>If the Library as you received it specifies that a proxy can decide -whether future versions of the GNU Lesser General Public License shall -apply, that proxy's public statement of acceptance of any version is -permanent authorization for you to choose that version for the -Library. -</p> -</li></ol> - -<hr size="6"> -<a name="GNU-FDL"></a> -<a name="SEC75"></a> -<h2 class="appendixsec"> <a href="libunistring.html#TOC71">A.3 GNU Free Documentation License</a> </h2> -<p align="center"> Version 1.3, 3 November 2008 -</p> - -<table><tr><td> </td><td><pre class="display">Copyright © 2000, 2001, 2002, 2007, 2008 Free Software Foundation, Inc. -<a href="http://fsf.org/">http://fsf.org/</a> - -Everyone is permitted to copy and distribute verbatim copies -of this license document, but changing it is not allowed. -</pre></td></tr></table> - -<ol> +<p>The ISO C and POSIX standard creators made an attempt to fix the first +problem mentioned in the section <a href="libunistring_1.html#SEC6">‘<samp>char *</samp>’ strings</a>. They introduced +</p><ul> <li> -PREAMBLE - -<p>The purpose of this License is to make a manual, textbook, or other -functional and useful document <em>free</em> in the sense of freedom: to -assure everyone the effective freedom to copy and redistribute it, -with or without modifying it, either commercially or noncommercially. -Secondarily, this License preserves for the author and publisher a way -to get credit for their work, while not being considered responsible -for modifications made by others. -</p> -<p>This License is a kind of “copyleft”, which means that derivative -works of the document must themselves be free in the same sense. It -complements the GNU General Public License, which is a copyleft -license designed for free software. -</p> -<p>We have designed this License in order to use it for manuals for free -software, because free software needs free documentation: a free -program should come with manuals providing the same freedoms that the -software does. But this License is not limited to software manuals; -it can be used for any textual work, regardless of subject matter or -whether it is published as a printed book. We recommend this License -principally for works whose purpose is instruction or reference. -</p> +a type ‘<samp>wchar_t</samp>’, designed to encapsulate an entire character, </li><li> -APPLICABILITY AND DEFINITIONS - -<p>This License applies to any manual or other work, in any medium, that -contains a notice placed by the copyright holder saying it can be -distributed under the terms of this License. Such a notice grants a -world-wide, royalty-free license, unlimited in duration, to use that -work under the conditions stated herein. The “Document”, below, -refers to any such manual or work. Any member of the public is a -licensee, and is addressed as “you”. You accept the license if you -copy, modify or distribute the work in a way requiring permission -under copyright law. -</p> -<p>A “Modified Version” of the Document means any work containing the -Document or a portion of it, either copied verbatim, or with -modifications and/or translated into another language. -</p> -<p>A “Secondary Section” is a named appendix or a front-matter section -of the Document that deals exclusively with the relationship of the -publishers or authors of the Document to the Document's overall -subject (or to related matters) and contains nothing that could fall -directly within that overall subject. (Thus, if the Document is in -part a textbook of mathematics, a Secondary Section may not explain -any mathematics.) The relationship could be a matter of historical -connection with the subject or with related matters, or of legal, -commercial, philosophical, ethical or political position regarding -them. -</p> -<p>The “Invariant Sections” are certain Secondary Sections whose titles -are designated, as being those of Invariant Sections, in the notice -that says that the Document is released under this License. If a -section does not fit the above definition of Secondary then it is not -allowed to be designated as Invariant. The Document may contain zero -Invariant Sections. If the Document does not identify any Invariant -Sections then there are none. -</p> -<p>The “Cover Texts” are certain short passages of text that are listed, -as Front-Cover Texts or Back-Cover Texts, in the notice that says that -the Document is released under this License. A Front-Cover Text may -be at most 5 words, and a Back-Cover Text may be at most 25 words. -</p> -<p>A “Transparent” copy of the Document means a machine-readable copy, -represented in a format whose specification is available to the -general public, that is suitable for revising the document -straightforwardly with generic text editors or (for images composed of -pixels) generic paint programs or (for drawings) some widely available -drawing editor, and that is suitable for input to text formatters or -for automatic translation to a variety of formats suitable for input -to text formatters. A copy made in an otherwise Transparent file -format whose markup, or absence of markup, has been arranged to thwart -or discourage subsequent modification by readers is not Transparent. -An image format is not Transparent if used for any substantial amount -of text. A copy that is not “Transparent” is called “Opaque”. -</p> -<p>Examples of suitable formats for Transparent copies include plain -<small>ASCII</small> without markup, Texinfo input format, LaTeX input -format, <acronym>SGML</acronym> or <acronym>XML</acronym> using a publicly available -<acronym>DTD</acronym>, and standard-conforming simple <acronym>HTML</acronym>, -PostScript or <acronym>PDF</acronym> designed for human modification. Examples -of transparent image formats include <acronym>PNG</acronym>, <acronym>XCF</acronym> and -<acronym>JPG</acronym>. Opaque formats include proprietary formats that can be -read and edited only by proprietary word processors, <acronym>SGML</acronym> or -<acronym>XML</acronym> for which the <acronym>DTD</acronym> and/or processing tools are -not generally available, and the machine-generated <acronym>HTML</acronym>, -PostScript or <acronym>PDF</acronym> produced by some word processors for -output purposes only. -</p> -<p>The “Title Page” means, for a printed book, the title page itself, -plus such following pages as are needed to hold, legibly, the material -this License requires to appear in the title page. For works in -formats which do not have any title page as such, “Title Page” means -the text near the most prominent appearance of the work's title, -preceding the beginning of the body of the text. -</p> -<p>The “publisher” means any person or entity that distributes copies -of the Document to the public. -</p> -<p>A section “Entitled XYZ” means a named subunit of the Document whose -title either is precisely XYZ or contains XYZ in parentheses following -text that translates XYZ in another language. (Here XYZ stands for a -specific section name mentioned below, such as “Acknowledgements”, -“Dedications”, “Endorsements”, or “History”.) To “Preserve the Title” -of such a section when you modify the Document means that it remains a -section “Entitled XYZ” according to this definition. -</p> -<p>The Document may include Warranty Disclaimers next to the notice which -states that this License applies to the Document. These Warranty -Disclaimers are considered to be included by reference in this -License, but only as regards disclaiming warranties: any other -implication that these Warranty Disclaimers may have is void and has -no effect on the meaning of this License. -</p> +a “wide string” type ‘<samp>wchar_t *</samp>’, and </li><li> -VERBATIM COPYING - -<p>You may copy and distribute the Document in any medium, either -commercially or noncommercially, provided that this License, the -copyright notices, and the license notice saying this License applies -to the Document are reproduced in all copies, and that you add no other -conditions whatsoever to those of this License. You may not use -technical measures to obstruct or control the reading or further -copying of the copies you make or distribute. However, you may accept -compensation in exchange for copies. If you distribute a large enough -number of copies you must also follow the conditions in section 3. -</p> -<p>You may also lend copies, under the same conditions stated above, and -you may publicly display copies. -</p> -</li><li> -COPYING IN QUANTITY - -<p>If you publish printed copies (or copies in media that commonly have -printed covers) of the Document, numbering more than 100, and the -Document's license notice requires Cover Texts, you must enclose the -copies in covers that carry, clearly and legibly, all these Cover -Texts: Front-Cover Texts on the front cover, and Back-Cover Texts on -the back cover. Both covers must also clearly and legibly identify -you as the publisher of these copies. The front cover must present -the full title with all words of the title equally prominent and -visible. You may add other material on the covers in addition. -Copying with changes limited to the covers, as long as they preserve -the title of the Document and satisfy these conditions, can be treated -as verbatim copying in other respects. -</p> -<p>If the required texts for either cover are too voluminous to fit -legibly, you should put the first ones listed (as many as fit -reasonably) on the actual cover, and continue the rest onto adjacent -pages. -</p> -<p>If you publish or distribute Opaque copies of the Document numbering -more than 100, you must either include a machine-readable Transparent -copy along with each Opaque copy, or state in or with each Opaque copy -a computer-network location from which the general network-using -public has access to download using public-standard network protocols -a complete Transparent copy of the Document, free of added material. -If you use the latter option, you must take reasonably prudent steps, -when you begin distribution of Opaque copies in quantity, to ensure -that this Transparent copy will remain thus accessible at the stated -location until at least one year after the last time you distribute an -Opaque copy (directly or through your agents or retailers) of that -edition to the public. -</p> -<p>It is requested, but not required, that you contact the authors of the -Document well before redistributing any large number of copies, to give -them a chance to provide you with an updated version of the Document. -</p> -</li><li> -MODIFICATIONS +functions declared in <a href="http://pubs.opengroup.org/onlinepubs/9699919799/basedefs/wctype.h.html"><code><wctype.h></code></a> that were meant to supplant the +ones in <a href="http://pubs.opengroup.org/onlinepubs/9699919799/basedefs/ctype.h.html"><code><ctype.h></code></a>. +</li></ul> -<p>You may copy and distribute a Modified Version of the Document under -the conditions of sections 2 and 3 above, provided that you release -the Modified Version under precisely this License, with the Modified -Version filling the role of the Document, thus licensing distribution -and modification of the Modified Version to whoever possesses a copy -of it. In addition, you must do these things in the Modified Version: +<p>Unfortunately, this API and its implementation has numerous problems: </p> -<ol> +<ul> <li> -Use in the Title Page (and on the covers, if any) a title distinct -from that of the Document, and from those of previous versions -(which should, if there were any, be listed in the History section -of the Document). You may use the same title as a previous version -if the original publisher of that version gives permission. - -</li><li> -List on the Title Page, as authors, one or more persons or entities -responsible for authorship of the modifications in the Modified -Version, together with at least five of the principal authors of the -Document (all of its principal authors, if it has fewer than five), -unless they release you from this requirement. - -</li><li> -State on the Title page the name of the publisher of the -Modified Version, as the publisher. - -</li><li> -Preserve all the copyright notices of the Document. - -</li><li> -Add an appropriate copyright notice for your modifications -adjacent to the other copyright notices. - -</li><li> -Include, immediately after the copyright notices, a license notice -giving the public permission to use the Modified Version under the -terms of this License, in the form shown in the Addendum below. - -</li><li> -Preserve in that license notice the full lists of Invariant Sections -and required Cover Texts given in the Document's license notice. - -</li><li> -Include an unaltered copy of this License. - -</li><li> -Preserve the section Entitled “History”, Preserve its Title, and add -to it an item stating at least the title, year, new authors, and -publisher of the Modified Version as given on the Title Page. If -there is no section Entitled “History” in the Document, create one -stating the title, year, authors, and publisher of the Document as -given on its Title Page, then add an item describing the Modified -Version as stated in the previous sentence. - -</li><li> -Preserve the network location, if any, given in the Document for -public access to a Transparent copy of the Document, and likewise -the network locations given in the Document for previous versions -it was based on. These may be placed in the “History” section. -You may omit a network location for a work that was published at -least four years before the Document itself, or if the original -publisher of the version it refers to gives permission. - -</li><li> -For any section Entitled “Acknowledgements” or “Dedications”, Preserve -the Title of the section, and preserve in the section all the -substance and tone of each of the contributor acknowledgements and/or -dedications given therein. - -</li><li> -Preserve all the Invariant Sections of the Document, -unaltered in their text and in their titles. Section numbers -or the equivalent are not considered part of the section titles. - -</li><li> -Delete any section Entitled “Endorsements”. Such a section -may not be included in the Modified Version. - -</li><li> -Do not retitle any existing section to be Entitled “Endorsements” or -to conflict in title with any Invariant Section. - -</li><li> -Preserve any Warranty Disclaimers. -</li></ol> - -<p>If the Modified Version includes new front-matter sections or -appendices that qualify as Secondary Sections and contain no material -copied from the Document, you may at your option designate some or all -of these sections as invariant. To do this, add their titles to the -list of Invariant Sections in the Modified Version's license notice. -These titles must be distinct from any other section titles. -</p> -<p>You may add a section Entitled “Endorsements”, provided it contains -nothing but endorsements of your Modified Version by various -parties—for example, statements of peer review or that the text has -been approved by an organization as the authoritative definition of a -standard. -</p> -<p>You may add a passage of up to five words as a Front-Cover Text, and a -passage of up to 25 words as a Back-Cover Text, to the end of the list -of Cover Texts in the Modified Version. Only one passage of -Front-Cover Text and one of Back-Cover Text may be added by (or -through arrangements made by) any one entity. If the Document already -includes a cover text for the same cover, previously added by you or -by arrangement made by the same entity you are acting on behalf of, -you may not add another; but you may replace the old one, on explicit -permission from the previous publisher that added the old one. -</p> -<p>The author(s) and publisher(s) of the Document do not by this License -give permission to use their names for publicity for or to assert or -imply endorsement of any Modified Version. -</p> -</li><li> -COMBINING DOCUMENTS - -<p>You may combine the Document with other documents released under this -License, under the terms defined in section 4 above for modified -versions, provided that you include in the combination all of the -Invariant Sections of all of the original documents, unmodified, and -list them all as Invariant Sections of your combined work in its -license notice, and that you preserve all their Warranty Disclaimers. -</p> -<p>The combined work need only contain one copy of this License, and -multiple identical Invariant Sections may be replaced with a single -copy. If there are multiple Invariant Sections with the same name but -different contents, make the title of each such section unique by -adding at the end of it, in parentheses, the name of the original -author or publisher of that section if known, or else a unique number. -Make the same adjustment to the section titles in the list of -Invariant Sections in the license notice of the combined work. -</p> -<p>In the combination, you must combine any sections Entitled “History” -in the various original documents, forming one section Entitled -“History”; likewise combine any sections Entitled “Acknowledgements”, -and any sections Entitled “Dedications”. You must delete all -sections Entitled “Endorsements.” -</p> -</li><li> -COLLECTIONS OF DOCUMENTS - -<p>You may make a collection consisting of the Document and other documents -released under this License, and replace the individual copies of this -License in the various documents with a single copy that is included in -the collection, provided that you follow the rules of this License for -verbatim copying of each of the documents in all other respects. -</p> -<p>You may extract a single document from such a collection, and distribute -it individually under this License, provided you insert a copy of this -License into the extracted document, and follow this License in all -other respects regarding verbatim copying of that document. -</p> -</li><li> -AGGREGATION WITH INDEPENDENT WORKS - -<p>A compilation of the Document or its derivatives with other separate -and independent documents or works, in or on a volume of a storage or -distribution medium, is called an “aggregate” if the copyright -resulting from the compilation is not used to limit the legal rights -of the compilation's users beyond what the individual works permit. -When the Document is included in an aggregate, this License does not -apply to the other works in the aggregate which are not themselves -derivative works of the Document. -</p> -<p>If the Cover Text requirement of section 3 is applicable to these -copies of the Document, then if the Document is less than one half of -the entire aggregate, the Document's Cover Texts may be placed on -covers that bracket the Document within the aggregate, or the -electronic equivalent of covers if the Document is in electronic form. -Otherwise they must appear on printed covers that bracket the whole -aggregate. -</p> -</li><li> -TRANSLATION - -<p>Translation is considered a kind of modification, so you may -distribute translations of the Document under the terms of section 4. -Replacing Invariant Sections with translations requires special -permission from their copyright holders, but you may include -translations of some or all Invariant Sections in addition to the -original versions of these Invariant Sections. You may include a -translation of this License, and all the license notices in the -Document, and any Warranty Disclaimers, provided that you also include -the original English version of this License and the original versions -of those notices and disclaimers. In case of a disagreement between -the translation and the original version of this License or a notice -or disclaimer, the original version will prevail. -</p> -<p>If a section in the Document is Entitled “Acknowledgements”, -“Dedications”, or “History”, the requirement (section 4) to Preserve -its Title (section 1) will typically require changing the actual -title. -</p> -</li><li> -TERMINATION - -<p>You may not copy, modify, sublicense, or distribute the Document -except as expressly provided under this License. Any attempt -otherwise to copy, modify, sublicense, or distribute it is void, and -will automatically terminate your rights under this License. -</p> -<p>However, if you cease all violation of this License, then your license -from a particular copyright holder is reinstated (a) provisionally, -unless and until the copyright holder explicitly and finally -terminates your license, and (b) permanently, if the copyright holder -fails to notify you of the violation by some reasonable means prior to -60 days after the cessation. -</p> -<p>Moreover, your license from a particular copyright holder is -reinstated permanently if the copyright holder notifies you of the -violation by some reasonable means, this is the first time you have -received notice of violation of this License (for any work) from that -copyright holder, and you cure the violation prior to 30 days after -your receipt of the notice. -</p> -<p>Termination of your rights under this section does not terminate the -licenses of parties who have received copies or rights from you under -this License. If your rights have been terminated and not permanently -reinstated, receipt of a copy of some or all of the same material does -not give you any rights to use it. -</p> -</li><li> -FUTURE REVISIONS OF THIS LICENSE - -<p>The Free Software Foundation may publish new, revised versions -of the GNU Free Documentation License from time to time. Such new -versions will be similar in spirit to the present version, but may -differ in detail to address new problems or concerns. See -<a href="http://www.gnu.org/copyleft/">http://www.gnu.org/copyleft/</a>. -</p> -<p>Each version of the License is given a distinguishing version number. -If the Document specifies that a particular numbered version of this -License “or any later version” applies to it, you have the option of -following the terms and conditions either of that specified version or -of any later version that has been published (not as a draft) by the -Free Software Foundation. If the Document does not specify a version -number of this License, you may choose any version ever published (not -as a draft) by the Free Software Foundation. If the Document -specifies that a proxy can decide which future versions of this -License can be used, that proxy's public statement of acceptance of a -version permanently authorizes you to choose that version for the -Document. -</p> -</li><li> -RELICENSING - -<p>“Massive Multiauthor Collaboration Site” (or “MMC Site”) means any -World Wide Web server that publishes copyrightable works and also -provides prominent facilities for anybody to edit those works. A -public wiki that anybody can edit is an example of such a server. A -“Massive Multiauthor Collaboration” (or “MMC”) contained in the -site means any set of copyrightable works thus published on the MMC -site. -</p> -<p>“CC-BY-SA” means the Creative Commons Attribution-Share Alike 3.0 -license published by Creative Commons Corporation, a not-for-profit -corporation with a principal place of business in San Francisco, -California, as well as future copyleft versions of that license -published by that same organization. -</p> -<p>“Incorporate” means to publish or republish a Document, in whole or -in part, as part of another Document. -</p> -<p>An MMC is “eligible for relicensing” if it is licensed under this -License, and if all works that were first published under this License -somewhere other than this MMC, and subsequently incorporated in whole -or in part into the MMC, (1) had no cover texts or invariant sections, -and (2) were thus incorporated prior to November 1, 2008. -</p> -<p>The operator of an MMC Site may republish an MMC contained in the site -under CC-BY-SA on the same site at any time before August 1, 2009, -provided the MMC is eligible for relicensing. -</p> -</li></ol> - - -<a name="SEC76"></a> -<h2 class="heading"> ADDENDUM: How to use this License for your documents </h2> - -<p>To use this License in a document you have written, include a copy of -the License in the document and put the following copyright and -license notices just after the title page: -</p> -<table><tr><td> </td><td><pre class="smallexample"> Copyright (C) <var>year</var> <var>your name</var>. - Permission is granted to copy, distribute and/or modify this document - under the terms of the GNU Free Documentation License, Version 1.3 - or any later version published by the Free Software Foundation; - with no Invariant Sections, no Front-Cover Texts, and no Back-Cover - Texts. A copy of the license is included in the section entitled ``GNU - Free Documentation License''. -</pre></td></tr></table> - -<p>If you have Invariant Sections, Front-Cover Texts and Back-Cover Texts, -replace the “with…Texts.” line with this: -</p> -<table><tr><td> </td><td><pre class="smallexample"> with the Invariant Sections being <var>list their titles</var>, with - the Front-Cover Texts being <var>list</var>, and with the Back-Cover Texts - being <var>list</var>. -</pre></td></tr></table> +On AIX and Windows platforms, <code>wchar_t</code> is a 16-bit type. This +means that it can never accommodate an entire Unicode character. Either +the <code>wchar_t *</code> strings are limited to characters in UCS-2 (the +“Basic Multilingual Plane” of Unicode), or — if <code>wchar_t *</code> +strings are encoded in UTF-16 — a <code>wchar_t</code> represents only half +of a character in the worst case, making the <a href="http://pubs.opengroup.org/onlinepubs/9699919799/basedefs/wctype.h.html"><code><wctype.h></code></a> functions +pointless. + +</li><li> +On Solaris and FreeBSD, the <code>wchar_t</code> encoding is locale dependent +and undocumented. This means, if you want to know any property of a +<code>wchar_t</code> character, other than the properties defined by +<a href="http://pubs.opengroup.org/onlinepubs/9699919799/basedefs/wctype.h.html"><code><wctype.h></code></a> — such as whether it's a dash, currency symbol, +paragraph separator, or similar —, you have to convert it to +<code>char *</code> encoding first, by use of the function <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/wctomb.html"><code>wctomb</code></a>. + +</li><li> +When you read a stream of wide characters, through the functions +<a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/fgetwc.html"><code>fgetwc</code></a> and <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/fgetws.html"><code>fgetws</code></a>, and when the input stream/file is +not in the expected encoding, you have no way to determine the invalid +byte sequence and do some corrective action. If you use these +functions, your program becomes “garbage in - more garbage out” or +“garbage in - abort”. +</li></ul> -<p>If you have Invariant Sections without Cover Texts, or some other -combination of the three, merge those two alternatives to suit the -situation. -</p> -<p>If your document contains nontrivial examples of program code, we -recommend releasing these examples in parallel under your choice of -free software license, such as the GNU General Public License, -to permit their use in free software. +<p>As a consequence, it is better to use multibyte strings, as explained in +the section <a href="libunistring_1.html#SEC6">‘<samp>char *</samp>’ strings</a>. Such multibyte strings can bypass +limitations of the <code>wchar_t</code> type, if you use functions defined in gnulib +and libunistring for text processing. They can also faithfully transport +malformed characters that were present in the input, without requiring +the program to produce garbage or abort. </p> - - <hr size="6"> <table cellpadding="1" cellspacing="1" border="0"> -<tr><td valign="middle" align="left">[<a href="#SEC68" title="Beginning of this chapter or previous chapter"> << </a>]</td> -<td valign="middle" align="left">[<a href="libunistring_19.html#SEC77" title="Next chapter"> >> </a>]</td> +<tr><td valign="middle" align="left">[<a href="libunistring_17.html#SEC80" title="Beginning of this chapter or previous chapter"> << </a>]</td> +<td valign="middle" align="left">[<a href="libunistring_19.html#SEC82" title="Next chapter"> >> </a>]</td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> @@ -1530,12 +119,12 @@ to permit their use in free software. <td valign="middle" align="left"> </td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Top" title="Cover (top) of document">Top</a>]</td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Contents" title="Table of contents">Contents</a>]</td> -<td valign="middle" align="left">[<a href="libunistring_19.html#SEC77" title="Index">Index</a>]</td> +<td valign="middle" align="left">[<a href="libunistring_20.html#SEC91" title="Index">Index</a>]</td> <td valign="middle" align="left">[<a href="libunistring_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <p> <font size="-1"> - This document was generated by <em>Daiki Ueno</em> on <em>November, 30 2017</em> using <a href="http://www.nongnu.org/texi2html/"><em>texi2html 1.78a</em></a>. + This document was generated by <em>Daiki Ueno</em> on <em>May, 25 2018</em> using <a href="http://www.nongnu.org/texi2html/"><em>texi2html 1.78a</em></a>. </font> <br> diff --git a/doc/libunistring_19.html b/doc/libunistring_19.html index f2ca86cb..e0eee13b 100644 --- a/doc/libunistring_19.html +++ b/doc/libunistring_19.html @@ -1,6 +1,6 @@ <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html401/loose.dtd"> <html> -<!-- Created on November, 30 2017 by texi2html 1.78a --> +<!-- Created on May, 25 2018 by texi2html 1.78a --> <!-- Written by: Lionel Cons <Lionel.Cons@cern.ch> (original author) Karl Berry <karl@freefriends.org> @@ -11,10 +11,10 @@ Send bugs and suggestions to <texi2html-bug@nongnu.org> --> <head> -<title>GNU libunistring: Index</title> +<title>GNU libunistring: B. Licenses</title> -<meta name="description" content="GNU libunistring: Index"> -<meta name="keywords" content="GNU libunistring: Index"> +<meta name="description" content="GNU libunistring: B. Licenses"> +<meta name="keywords" content="GNU libunistring: B. Licenses"> <meta name="resource-type" content="document"> <meta name="distribution" content="global"> <meta name="Generator" content="texi2html 1.78a"> @@ -42,8 +42,8 @@ ul.toc {list-style: none} <body lang="en" bgcolor="#FFFFFF" text="#000000" link="#0000FF" vlink="#800080" alink="#FF0000"> <table cellpadding="1" cellspacing="1" border="0"> -<tr><td valign="middle" align="left">[<a href="libunistring_18.html#SEC68" title="Beginning of this chapter or previous chapter"> << </a>]</td> -<td valign="middle" align="left">[<a href="libunistring_20.html#INDEX0" title="Next chapter"> >> </a>]</td> +<tr><td valign="middle" align="left">[<a href="libunistring_18.html#SEC81" title="Beginning of this chapter or previous chapter"> << </a>]</td> +<td valign="middle" align="left">[<a href="libunistring_20.html#SEC91" title="Next chapter"> >> </a>]</td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> @@ -51,751 +51,1478 @@ ul.toc {list-style: none} <td valign="middle" align="left"> </td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Top" title="Cover (top) of document">Top</a>]</td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Contents" title="Table of contents">Contents</a>]</td> -<td valign="middle" align="left">[<a href="#SEC77" title="Index">Index</a>]</td> +<td valign="middle" align="left">[<a href="libunistring_20.html#SEC91" title="Index">Index</a>]</td> <td valign="middle" align="left">[<a href="libunistring_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <hr size="2"> -<a name="Index"></a> -<a name="SEC77"></a> -<h1 class="unnumbered"> <a href="libunistring.html#TOC72">Index</a> </h1> - -<table><tr><th valign="top">Jump to: </th><td><a href="#SEC77_0" class="summary-letter"><b>A</b></a> - -<a href="#SEC77_1" class="summary-letter"><b>B</b></a> - -<a href="#SEC77_2" class="summary-letter"><b>C</b></a> - -<a href="#SEC77_3" class="summary-letter"><b>D</b></a> - -<a href="#SEC77_4" class="summary-letter"><b>E</b></a> - -<a href="#SEC77_5" class="summary-letter"><b>F</b></a> - -<a href="#SEC77_6" class="summary-letter"><b>G</b></a> - -<a href="#SEC77_7" class="summary-letter"><b>H</b></a> - -<a href="#SEC77_8" class="summary-letter"><b>I</b></a> - -<a href="#SEC77_9" class="summary-letter"><b>J</b></a> - -<a href="#SEC77_10" class="summary-letter"><b>L</b></a> - -<a href="#SEC77_11" class="summary-letter"><b>M</b></a> - -<a href="#SEC77_12" class="summary-letter"><b>N</b></a> - -<a href="#SEC77_13" class="summary-letter"><b>O</b></a> - -<a href="#SEC77_14" class="summary-letter"><b>P</b></a> - -<a href="#SEC77_15" class="summary-letter"><b>R</b></a> - -<a href="#SEC77_16" class="summary-letter"><b>S</b></a> - -<a href="#SEC77_17" class="summary-letter"><b>T</b></a> - -<a href="#SEC77_18" class="summary-letter"><b>U</b></a> - -<a href="libunistring_20.html#INDEX0_0" class="summary-letter"><b>V</b></a> - -<a href="libunistring_20.html#INDEX0_1" class="summary-letter"><b>W</b></a> - -</td></tr></table> -<table border="0" class="index-cp"> -<tr><td></td><th align="left">Index Entry</th><th align="left"> Section</th></tr> -<tr><td colspan="3"> <hr></td></tr> -<tr><th><a name="SEC77_0">A</a></th><td></td><td></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_9.html#IDX701">ambiguous width</a></td><td valign="top"><a href="libunistring_9.html#SEC40">9. Display width <code><uniwidth.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC30">Arabic shaping</a></td><td valign="top"><a href="libunistring_8.html#SEC30">8.8 Arabic shaping</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_2.html#IDX14">argument conventions</a></td><td valign="top"><a href="libunistring_2.html#SEC9">2. Conventions</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_16.html#SEC65">autoconf macro</a></td><td valign="top"><a href="libunistring_16.html#SEC65">16.4 Autoconf macro</a></td></tr> -<tr><td colspan="3"> <hr></td></tr> -<tr><th><a name="SEC77_1">B</a></th><td></td><td></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC25">bidi class</a></td><td valign="top"><a href="libunistring_8.html#SEC25">8.3 Bidi class</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC25">bidirectional category</a></td><td valign="top"><a href="libunistring_8.html#SEC25">8.3 Bidi class</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_17.html#SEC67">bidirectional reordering</a></td><td valign="top"><a href="libunistring_17.html#SEC67">17. More advanced functionality</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC37">block</a></td><td valign="top"><a href="libunistring_8.html#SEC37">8.11 Blocks</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_10.html#SEC41">boundaries, between grapheme clusters</a></td><td valign="top"><a href="libunistring_10.html#SEC41">10. Grapheme cluster breaks in strings <code><unigbrk.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_11.html#SEC44">boundaries, between words</a></td><td valign="top"><a href="libunistring_11.html#SEC44">11. Word breaks in strings <code><uniwbrk.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_10.html#SEC41">breaks, grapheme cluster</a></td><td valign="top"><a href="libunistring_10.html#SEC41">10. Grapheme cluster breaks in strings <code><unigbrk.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_12.html#SEC47">breaks, line</a></td><td valign="top"><a href="libunistring_12.html#SEC47">12. Line breaking <code><unilbrk.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_11.html#SEC44">breaks, word</a></td><td valign="top"><a href="libunistring_11.html#SEC44">11. Word breaks in strings <code><uniwbrk.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_16.html#SEC66">bug reports</a></td><td valign="top"><a href="libunistring_16.html#SEC66">16.5 Reporting problems</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_16.html#SEC66">bug tracker</a></td><td valign="top"><a href="libunistring_16.html#SEC66">16.5 Reporting problems</a></td></tr> -<tr><td colspan="3"> <hr></td></tr> -<tr><th><a name="SEC77_2">C</a></th><td></td><td></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_1.html#SEC6">C string functions</a></td><td valign="top"><a href="libunistring_1.html#SEC6">1.5 ‘<samp>char *</samp>’ strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC38">C, programming language</a></td><td valign="top"><a href="libunistring_8.html#SEC38">8.12 ISO C and Java syntax</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC39">C-like API</a></td><td valign="top"><a href="libunistring_8.html#SEC39">8.13 Classifications like in ISO C</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC24">canonical combining class</a></td><td valign="top"><a href="libunistring_8.html#SEC24">8.2 Canonical combining class</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#SEC59">case detection</a></td><td valign="top"><a href="libunistring_14.html#SEC59">14.5 Case detection</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#SEC56">case mappings</a></td><td valign="top"><a href="libunistring_14.html#SEC56">14.2 Case mappings of strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX845"><code>casing_prefix_context_t</code></a></td><td valign="top"><a href="libunistring_14.html#SEC57">14.3 Case mappings of substrings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX853"><code>casing_suffix_context_t</code></a></td><td valign="top"><a href="libunistring_14.html#SEC57">14.3 Case mappings of substrings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_1.html#IDX10">char, type</a></td><td valign="top"><a href="libunistring_1.html#SEC6">1.5 ‘<samp>char *</samp>’ strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#SEC50">combining, Unicode characters</a></td><td valign="top"><a href="libunistring_13.html#SEC50">13.2 Composition of Unicode characters</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX54">comparing</a></td><td valign="top"><a href="libunistring_4.html#SEC14">4.3 Elementary string functions</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX110">comparing</a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#SEC58">comparing, ignoring case</a></td><td valign="top"><a href="libunistring_14.html#SEC58">14.4 Case insensitive comparison</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX880">comparing, ignoring case, with collation rules</a></td><td valign="top"><a href="libunistring_14.html#SEC58">14.4 Case insensitive comparison</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#SEC52">comparing, ignoring normalization</a></td><td valign="top"><a href="libunistring_13.html#SEC52">13.4 Normalizing comparisons</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#SEC58">comparing, ignoring normalization and case</a></td><td valign="top"><a href="libunistring_14.html#SEC58">14.4 Case insensitive comparison</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX882">comparing, ignoring normalization and case, with collation rules</a></td><td valign="top"><a href="libunistring_14.html#SEC58">14.4 Case insensitive comparison</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX818">comparing, ignoring normalization, with collation rules</a></td><td valign="top"><a href="libunistring_13.html#SEC52">13.4 Normalizing comparisons</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX114">comparing, with collation rules</a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX881">comparing, with collation rules, ignoring case</a></td><td valign="top"><a href="libunistring_14.html#SEC58">14.4 Case insensitive comparison</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX819">comparing, with collation rules, ignoring normalization</a></td><td valign="top"><a href="libunistring_13.html#SEC52">13.4 Normalizing comparisons</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX883">comparing, with collation rules, ignoring normalization and case</a></td><td valign="top"><a href="libunistring_14.html#SEC58">14.4 Case insensitive comparison</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_16.html#IDX908">compiler options</a></td><td valign="top"><a href="libunistring_16.html#SEC63">16.2 Compiler options</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#SEC50">composing, Unicode characters</a></td><td valign="top"><a href="libunistring_13.html#SEC50">13.2 Composition of Unicode characters</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#SEC13">converting</a></td><td valign="top"><a href="libunistring_4.html#SEC13">4.2 Elementary string conversions</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_5.html#IDX160">converting</a></td><td valign="top"><a href="libunistring_5.html#SEC17">5. Conversions between Unicode and encodings <code><uniconv.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX44">copying</a></td><td valign="top"><a href="libunistring_4.html#SEC14">4.3 Elementary string functions</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX91">copying</a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX65">counting</a></td><td valign="top"><a href="libunistring_4.html#SEC14">4.3 Elementary string functions</a></td></tr> -<tr><td colspan="3"> <hr></td></tr> -<tr><th><a name="SEC77_3">D</a></th><td></td><td></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#SEC49">decomposing</a></td><td valign="top"><a href="libunistring_13.html#SEC49">13.1 Decomposition of Unicode characters</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_16.html#SEC62">dependencies</a></td><td valign="top"><a href="libunistring_16.html#SEC62">16.1 Installation</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#SEC59">detecting case</a></td><td valign="top"><a href="libunistring_14.html#SEC59">14.5 Case detection</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#SEC15">duplicating</a></td><td valign="top"><a href="libunistring_4.html#SEC15">4.4 Elementary string functions with memory allocation</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX121">duplicating</a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td colspan="3"> <hr></td></tr> -<tr><th><a name="SEC77_4">E</a></th><td></td><td></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_5.html#IDX156"><code>enum iconv_ilseq_handler</code></a></td><td valign="top"><a href="libunistring_5.html#SEC17">5. Conversions between Unicode and encodings <code><uniconv.h></code></a></td></tr> -<tr><td colspan="3"> <hr></td></tr> -<tr><th><a name="SEC77_5">F</a></th><td></td><td></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_18.html#SEC75">FDL, GNU Free Documentation License</a></td><td valign="top"><a href="libunistring_18.html#SEC75">A.3 GNU Free Documentation License</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_6.html#SEC18">formatted output</a></td><td valign="top"><a href="libunistring_6.html#SEC18">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_9.html#IDX704">fullwidth</a></td><td valign="top"><a href="libunistring_9.html#SEC40">9. Display width <code><uniwidth.h></code></a></td></tr> -<tr><td colspan="3"> <hr></td></tr> -<tr><th><a name="SEC77_6">G</a></th><td></td><td></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC21">general category</a></td><td valign="top"><a href="libunistring_8.html#SEC21">8.1 General category</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_16.html#IDX911"><code>gl_LIBUNISTRING</code></a></td><td valign="top"><a href="libunistring_16.html#SEC65">16.4 Autoconf macro</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_18.html#SEC69">GPL, GNU General Public License</a></td><td valign="top"><a href="libunistring_18.html#SEC69">A.1 GNU GENERAL PUBLIC LICENSE</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_10.html#SEC41">grapheme cluster boundaries</a></td><td valign="top"><a href="libunistring_10.html#SEC41">10. Grapheme cluster breaks in strings <code><unigbrk.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_10.html#SEC41">grapheme cluster breaks</a></td><td valign="top"><a href="libunistring_10.html#SEC41">10. Grapheme cluster breaks in strings <code><unigbrk.h></code></a></td></tr> -<tr><td colspan="3"> <hr></td></tr> -<tr><th><a name="SEC77_7">H</a></th><td></td><td></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_9.html#IDX703">halfwidth</a></td><td valign="top"><a href="libunistring_9.html#SEC40">9. Display width <code><uniwidth.h></code></a></td></tr> -<tr><td colspan="3"> <hr></td></tr> -<tr><th><a name="SEC77_8">I</a></th><td></td><td></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC38">identifiers</a></td><td valign="top"><a href="libunistring_8.html#SEC38">8.12 ISO C and Java syntax</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_16.html#IDX907">installation</a></td><td valign="top"><a href="libunistring_16.html#SEC62">16.1 Installation</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_1.html#SEC3">internationalization</a></td><td valign="top"><a href="libunistring_1.html#SEC3">1.2 Unicode and Internationalization</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#SEC14">iterating</a></td><td valign="top"><a href="libunistring_4.html#SEC14">4.3 Elementary string functions</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX75">iterating</a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td colspan="3"> <hr></td></tr> -<tr><th><a name="SEC77_9">J</a></th><td></td><td></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC38">Java, programming language</a></td><td valign="top"><a href="libunistring_8.html#SEC38">8.12 ISO C and Java syntax</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC32">joining group</a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Joining group of Arabic characters</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC30">joining of Arabic characters</a></td><td valign="top"><a href="libunistring_8.html#SEC30">8.8 Arabic shaping</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC31">joining type</a></td><td valign="top"><a href="libunistring_8.html#SEC31">8.8.1 Joining type of Arabic characters</a></td></tr> -<tr><td colspan="3"> <hr></td></tr> -<tr><th><a name="SEC77_10">L</a></th><td></td><td></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_18.html#SEC74">LGPL, GNU Lesser General Public License</a></td><td valign="top"><a href="libunistring_18.html#SEC74">A.2 GNU LESSER GENERAL PUBLIC LICENSE</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_18.html#SEC75">License, GNU FDL</a></td><td valign="top"><a href="libunistring_18.html#SEC75">A.3 GNU Free Documentation License</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_18.html#SEC69">License, GNU GPL</a></td><td valign="top"><a href="libunistring_18.html#SEC69">A.1 GNU GENERAL PUBLIC LICENSE</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_18.html#SEC74">License, GNU LGPL</a></td><td valign="top"><a href="libunistring_18.html#SEC74">A.2 GNU LESSER GENERAL PUBLIC LICENSE</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_18.html#SEC68">Licenses</a></td><td valign="top"><a href="libunistring_18.html#SEC68">A. Licenses</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_12.html#SEC47">line breaks</a></td><td valign="top"><a href="libunistring_12.html#SEC47">12. Line breaking <code><unilbrk.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_1.html#SEC4">locale</a></td><td valign="top"><a href="libunistring_1.html#SEC4">1.3 Locale encodings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_1.html#IDX7">locale categories</a></td><td valign="top"><a href="libunistring_1.html#SEC4">1.3 Locale encodings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_1.html#IDX8">locale encoding</a></td><td valign="top"><a href="libunistring_1.html#SEC4">1.3 Locale encodings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_5.html#IDX154">locale encoding</a></td><td valign="top"><a href="libunistring_5.html#SEC17">5. Conversions between Unicode and encodings <code><uniconv.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX834">locale language</a></td><td valign="top"><a href="libunistring_14.html#SEC56">14.2 Case mappings of strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_1.html#IDX9">locale, multibyte</a></td><td valign="top"><a href="libunistring_1.html#SEC6">1.5 ‘<samp>char *</samp>’ strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_5.html#IDX155"><code>locale_charset</code></a></td><td valign="top"><a href="libunistring_5.html#SEC17">5. Conversions between Unicode and encodings <code><uniconv.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#SEC56">lowercasing</a></td><td valign="top"><a href="libunistring_14.html#SEC56">14.2 Case mappings of strings</a></td></tr> -<tr><td colspan="3"> <hr></td></tr> -<tr><th><a name="SEC77_11">M</a></th><td></td><td></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_16.html#SEC66">mailing list</a></td><td valign="top"><a href="libunistring_16.html#SEC66">16.5 Reporting problems</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC29">mirroring, of Unicode character</a></td><td valign="top"><a href="libunistring_8.html#SEC29">8.7 Mirrored character</a></td></tr> -<tr><td colspan="3"> <hr></td></tr> -<tr><th><a name="SEC77_12">N</a></th><td></td><td></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#SEC48">normal forms</a></td><td valign="top"><a href="libunistring_13.html#SEC48">13. Normalization forms (composition and decomposition) <code><uninorm.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#SEC48">normalizing</a></td><td valign="top"><a href="libunistring_13.html#SEC48">13. Normalization forms (composition and decomposition) <code><uninorm.h></code></a></td></tr> -<tr><td colspan="3"> <hr></td></tr> -<tr><th><a name="SEC77_13">O</a></th><td></td><td></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_6.html#SEC18">output, formatted</a></td><td valign="top"><a href="libunistring_6.html#SEC18">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> -<tr><td colspan="3"> <hr></td></tr> -<tr><th><a name="SEC77_14">P</a></th><td></td><td></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC33">properties, of Unicode character</a></td><td valign="top"><a href="libunistring_8.html#SEC33">8.9 Properties</a></td></tr> -<tr><td colspan="3"> <hr></td></tr> -<tr><th><a name="SEC77_15">R</a></th><td></td><td></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_15.html#SEC60">regular expression</a></td><td valign="top"><a href="libunistring_15.html#SEC60">15. Regular expressions <code><uniregex.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_17.html#IDX912">rendering</a></td><td valign="top"><a href="libunistring_17.html#SEC67">17. More advanced functionality</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_2.html#IDX15">return value conventions</a></td><td valign="top"><a href="libunistring_2.html#SEC9">2. Conventions</a></td></tr> -<tr><td colspan="3"> <hr></td></tr> -<tr><th><a name="SEC77_16">S</a></th><td></td><td></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC36">scripts</a></td><td valign="top"><a href="libunistring_8.html#SEC36">8.10 Scripts</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX61">searching, for a character</a></td><td valign="top"><a href="libunistring_4.html#SEC14">4.3 Elementary string functions</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX125">searching, for a character</a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX141">searching, for a substring</a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#SEC53">stream, normalizing a</a></td><td valign="top"><a href="libunistring_13.html#SEC53">13.5 Normalization of streams of Unicode characters</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX826"><code>struct uninorm_filter</code></a></td><td valign="top"><a href="libunistring_13.html#SEC53">13.5 Normalization of streams of Unicode characters</a></td></tr> -<tr><td colspan="3"> <hr></td></tr> -<tr><th><a name="SEC77_17">T</a></th><td></td><td></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#SEC56">titlecasing</a></td><td valign="top"><a href="libunistring_14.html#SEC56">14.2 Case mappings of strings</a></td></tr> -<tr><td colspan="3"> <hr></td></tr> -<tr><th><a name="SEC77_18">U</a></th><td></td><td></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX206"><code>u16_asnprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC18">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX205"><code>u16_asprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC18">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX877"><code>u16_casecmp</code></a></td><td valign="top"><a href="libunistring_14.html#SEC58">14.4 Case insensitive comparison</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX889"><code>u16_casecoll</code></a></td><td valign="top"><a href="libunistring_14.html#SEC58">14.4 Case insensitive comparison</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX871"><code>u16_casefold</code></a></td><td valign="top"><a href="libunistring_14.html#SEC58">14.4 Case insensitive comparison</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX885"><code>u16_casexfrm</code></a></td><td valign="top"><a href="libunistring_14.html#SEC58">14.4 Case insensitive comparison</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX848"><code>u16_casing_prefix_context</code></a></td><td valign="top"><a href="libunistring_14.html#SEC57">14.3 Case mappings of substrings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX851"><code>u16_casing_prefixes_context</code></a></td><td valign="top"><a href="libunistring_14.html#SEC57">14.3 Case mappings of substrings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX856"><code>u16_casing_suffix_context</code></a></td><td valign="top"><a href="libunistring_14.html#SEC57">14.3 Case mappings of substrings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX859"><code>u16_casing_suffixes_context</code></a></td><td valign="top"><a href="libunistring_14.html#SEC57">14.3 Case mappings of substrings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX21"><code>u16_check</code></a></td><td valign="top"><a href="libunistring_4.html#SEC12">4.1 Elementary string checks</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX63"><code>u16_chr</code></a></td><td valign="top"><a href="libunistring_4.html#SEC14">4.3 Elementary string functions</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX56"><code>u16_cmp</code></a></td><td valign="top"><a href="libunistring_4.html#SEC14">4.3 Elementary string functions</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX59"><code>u16_cmp2</code></a></td><td valign="top"><a href="libunistring_4.html#SEC14">4.3 Elementary string functions</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_5.html#IDX162"><code>u16_conv_from_encoding</code></a></td><td valign="top"><a href="libunistring_5.html#SEC17">5. Conversions between Unicode and encodings <code><uniconv.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_5.html#IDX165"><code>u16_conv_to_encoding</code></a></td><td valign="top"><a href="libunistring_5.html#SEC17">5. Conversions between Unicode and encodings <code><uniconv.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX46"><code>u16_cpy</code></a></td><td valign="top"><a href="libunistring_4.html#SEC14">4.3 Elementary string functions</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX70"><code>u16_cpy_alloc</code></a></td><td valign="top"><a href="libunistring_4.html#SEC15">4.4 Elementary string functions with memory allocation</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX874"><code>u16_ct_casefold</code></a></td><td valign="top"><a href="libunistring_14.html#SEC58">14.4 Case insensitive comparison</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX865"><code>u16_ct_tolower</code></a></td><td valign="top"><a href="libunistring_14.html#SEC57">14.3 Case mappings of substrings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX868"><code>u16_ct_totitle</code></a></td><td valign="top"><a href="libunistring_14.html#SEC57">14.3 Case mappings of substrings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX862"><code>u16_ct_toupper</code></a></td><td valign="top"><a href="libunistring_14.html#SEC57">14.3 Case mappings of substrings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX149"><code>u16_endswith</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_10.html#IDX719"><code>u16_grapheme_breaks</code></a></td><td valign="top"><a href="libunistring_10.html#SEC42">10.1 Grapheme cluster breaks in a string</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_10.html#IDX713"><code>u16_grapheme_next</code></a></td><td valign="top"><a href="libunistring_10.html#SEC42">10.1 Grapheme cluster breaks in a string</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_10.html#IDX716"><code>u16_grapheme_prev</code></a></td><td valign="top"><a href="libunistring_10.html#SEC42">10.1 Grapheme cluster breaks in a string</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX905"><code>u16_is_cased</code></a></td><td valign="top"><a href="libunistring_14.html#SEC59">14.5 Case detection</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX902"><code>u16_is_casefolded</code></a></td><td valign="top"><a href="libunistring_14.html#SEC59">14.5 Case detection</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX896"><code>u16_is_lowercase</code></a></td><td valign="top"><a href="libunistring_14.html#SEC59">14.5 Case detection</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX899"><code>u16_is_titlecase</code></a></td><td valign="top"><a href="libunistring_14.html#SEC59">14.5 Case detection</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX893"><code>u16_is_uppercase</code></a></td><td valign="top"><a href="libunistring_14.html#SEC59">14.5 Case detection</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX30"><code>u16_mblen</code></a></td><td valign="top"><a href="libunistring_4.html#SEC14">4.3 Elementary string functions</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX67"><code>u16_mbsnlen</code></a></td><td valign="top"><a href="libunistring_4.html#SEC14">4.3 Elementary string functions</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX36"><code>u16_mbtouc</code></a></td><td valign="top"><a href="libunistring_4.html#SEC14">4.3 Elementary string functions</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX33"><code>u16_mbtouc_unsafe</code></a></td><td valign="top"><a href="libunistring_4.html#SEC14">4.3 Elementary string functions</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX39"><code>u16_mbtoucr</code></a></td><td valign="top"><a href="libunistring_4.html#SEC14">4.3 Elementary string functions</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX49"><code>u16_move</code></a></td><td valign="top"><a href="libunistring_4.html#SEC14">4.3 Elementary string functions</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX80"><code>u16_next</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX813"><code>u16_normalize</code></a></td><td valign="top"><a href="libunistring_13.html#SEC51">13.3 Normalization of strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX816"><code>u16_normcmp</code></a></td><td valign="top"><a href="libunistring_13.html#SEC52">13.4 Normalizing comparisons</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX824"><code>u16_normcoll</code></a></td><td valign="top"><a href="libunistring_13.html#SEC52">13.4 Normalizing comparisons</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX821"><code>u16_normxfrm</code></a></td><td valign="top"><a href="libunistring_13.html#SEC52">13.4 Normalizing comparisons</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_12.html#IDX776"><code>u16_possible_linebreaks</code></a></td><td valign="top"><a href="libunistring_12.html#SEC47">12. Line breaking <code><unilbrk.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX83"><code>u16_prev</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX52"><code>u16_set</code></a></td><td valign="top"><a href="libunistring_4.html#SEC14">4.3 Elementary string functions</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX204"><code>u16_snprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC18">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX203"><code>u16_sprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC18">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX146"><code>u16_startswith</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX96"><code>u16_stpcpy</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX102"><code>u16_stpncpy</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX105"><code>u16_strcat</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX127"><code>u16_strchr</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX112"><code>u16_strcmp</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX116"><code>u16_strcoll</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_5.html#IDX168"><code>u16_strconv_from_encoding</code></a></td><td valign="top"><a href="libunistring_5.html#SEC17">5. Conversions between Unicode and encodings <code><uniconv.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_5.html#IDX174"><code>u16_strconv_from_locale</code></a></td><td valign="top"><a href="libunistring_5.html#SEC17">5. Conversions between Unicode and encodings <code><uniconv.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_5.html#IDX171"><code>u16_strconv_to_encoding</code></a></td><td valign="top"><a href="libunistring_5.html#SEC17">5. Conversions between Unicode and encodings <code><uniconv.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_5.html#IDX177"><code>u16_strconv_to_locale</code></a></td><td valign="top"><a href="libunistring_5.html#SEC17">5. Conversions between Unicode and encodings <code><uniconv.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX93"><code>u16_strcpy</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX133"><code>u16_strcspn</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX123"><code>u16_strdup</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX86"><code>u16_strlen</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX73"><code>u16_strmblen</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX77"><code>u16_strmbtouc</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX108"><code>u16_strncat</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX119"><code>u16_strncmp</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX99"><code>u16_strncpy</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX89"><code>u16_strnlen</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX139"><code>u16_strpbrk</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX130"><code>u16_strrchr</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX136"><code>u16_strspn</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX143"><code>u16_strstr</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX152"><code>u16_strtok</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_9.html#IDX710"><code>u16_strwidth</code></a></td><td valign="top"><a href="libunistring_9.html#SEC40">9. Display width <code><uniwidth.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX26"><code>u16_to_u32</code></a></td><td valign="top"><a href="libunistring_4.html#SEC13">4.2 Elementary string conversions</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX25"><code>u16_to_u8</code></a></td><td valign="top"><a href="libunistring_4.html#SEC13">4.2 Elementary string conversions</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX840"><code>u16_tolower</code></a></td><td valign="top"><a href="libunistring_14.html#SEC56">14.2 Case mappings of strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX843"><code>u16_totitle</code></a></td><td valign="top"><a href="libunistring_14.html#SEC56">14.2 Case mappings of strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX837"><code>u16_toupper</code></a></td><td valign="top"><a href="libunistring_14.html#SEC56">14.2 Case mappings of strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX214"><code>u16_u16_asnprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC18">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX213"><code>u16_u16_asprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC18">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX212"><code>u16_u16_snprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC18">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX211"><code>u16_u16_sprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC18">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX218"><code>u16_u16_vasnprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC18">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX217"><code>u16_u16_vasprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC18">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX216"><code>u16_u16_vsnprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC18">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX215"><code>u16_u16_vsprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC18">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX42"><code>u16_uctomb</code></a></td><td valign="top"><a href="libunistring_4.html#SEC14">4.3 Elementary string functions</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX210"><code>u16_vasnprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC18">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX209"><code>u16_vasprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC18">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX208"><code>u16_vsnprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC18">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX207"><code>u16_vsprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC18">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_9.html#IDX707"><code>u16_width</code></a></td><td valign="top"><a href="libunistring_9.html#SEC40">9. Display width <code><uniwidth.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_12.html#IDX780"><code>u16_width_linebreaks</code></a></td><td valign="top"><a href="libunistring_12.html#SEC47">12. Line breaking <code><unilbrk.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_11.html#IDX744"><code>u16_wordbreaks</code></a></td><td valign="top"><a href="libunistring_11.html#SEC45">11.1 Word breaks in a string</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX222"><code>u32_asnprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC18">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX221"><code>u32_asprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC18">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX878"><code>u32_casecmp</code></a></td><td valign="top"><a href="libunistring_14.html#SEC58">14.4 Case insensitive comparison</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX890"><code>u32_casecoll</code></a></td><td valign="top"><a href="libunistring_14.html#SEC58">14.4 Case insensitive comparison</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX872"><code>u32_casefold</code></a></td><td valign="top"><a href="libunistring_14.html#SEC58">14.4 Case insensitive comparison</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX886"><code>u32_casexfrm</code></a></td><td valign="top"><a href="libunistring_14.html#SEC58">14.4 Case insensitive comparison</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX849"><code>u32_casing_prefix_context</code></a></td><td valign="top"><a href="libunistring_14.html#SEC57">14.3 Case mappings of substrings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX852"><code>u32_casing_prefixes_context</code></a></td><td valign="top"><a href="libunistring_14.html#SEC57">14.3 Case mappings of substrings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX857"><code>u32_casing_suffix_context</code></a></td><td valign="top"><a href="libunistring_14.html#SEC57">14.3 Case mappings of substrings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX860"><code>u32_casing_suffixes_context</code></a></td><td valign="top"><a href="libunistring_14.html#SEC57">14.3 Case mappings of substrings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX22"><code>u32_check</code></a></td><td valign="top"><a href="libunistring_4.html#SEC12">4.1 Elementary string checks</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX64"><code>u32_chr</code></a></td><td valign="top"><a href="libunistring_4.html#SEC14">4.3 Elementary string functions</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX57"><code>u32_cmp</code></a></td><td valign="top"><a href="libunistring_4.html#SEC14">4.3 Elementary string functions</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX60"><code>u32_cmp2</code></a></td><td valign="top"><a href="libunistring_4.html#SEC14">4.3 Elementary string functions</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_5.html#IDX163"><code>u32_conv_from_encoding</code></a></td><td valign="top"><a href="libunistring_5.html#SEC17">5. Conversions between Unicode and encodings <code><uniconv.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_5.html#IDX166"><code>u32_conv_to_encoding</code></a></td><td valign="top"><a href="libunistring_5.html#SEC17">5. Conversions between Unicode and encodings <code><uniconv.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX47"><code>u32_cpy</code></a></td><td valign="top"><a href="libunistring_4.html#SEC14">4.3 Elementary string functions</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX71"><code>u32_cpy_alloc</code></a></td><td valign="top"><a href="libunistring_4.html#SEC15">4.4 Elementary string functions with memory allocation</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX875"><code>u32_ct_casefold</code></a></td><td valign="top"><a href="libunistring_14.html#SEC58">14.4 Case insensitive comparison</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX866"><code>u32_ct_tolower</code></a></td><td valign="top"><a href="libunistring_14.html#SEC57">14.3 Case mappings of substrings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX869"><code>u32_ct_totitle</code></a></td><td valign="top"><a href="libunistring_14.html#SEC57">14.3 Case mappings of substrings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX863"><code>u32_ct_toupper</code></a></td><td valign="top"><a href="libunistring_14.html#SEC57">14.3 Case mappings of substrings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX150"><code>u32_endswith</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_10.html#IDX720"><code>u32_grapheme_breaks</code></a></td><td valign="top"><a href="libunistring_10.html#SEC42">10.1 Grapheme cluster breaks in a string</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_10.html#IDX714"><code>u32_grapheme_next</code></a></td><td valign="top"><a href="libunistring_10.html#SEC42">10.1 Grapheme cluster breaks in a string</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_10.html#IDX717"><code>u32_grapheme_prev</code></a></td><td valign="top"><a href="libunistring_10.html#SEC42">10.1 Grapheme cluster breaks in a string</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX906"><code>u32_is_cased</code></a></td><td valign="top"><a href="libunistring_14.html#SEC59">14.5 Case detection</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX903"><code>u32_is_casefolded</code></a></td><td valign="top"><a href="libunistring_14.html#SEC59">14.5 Case detection</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX897"><code>u32_is_lowercase</code></a></td><td valign="top"><a href="libunistring_14.html#SEC59">14.5 Case detection</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX900"><code>u32_is_titlecase</code></a></td><td valign="top"><a href="libunistring_14.html#SEC59">14.5 Case detection</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX894"><code>u32_is_uppercase</code></a></td><td valign="top"><a href="libunistring_14.html#SEC59">14.5 Case detection</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX31"><code>u32_mblen</code></a></td><td valign="top"><a href="libunistring_4.html#SEC14">4.3 Elementary string functions</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX68"><code>u32_mbsnlen</code></a></td><td valign="top"><a href="libunistring_4.html#SEC14">4.3 Elementary string functions</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX37"><code>u32_mbtouc</code></a></td><td valign="top"><a href="libunistring_4.html#SEC14">4.3 Elementary string functions</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX34"><code>u32_mbtouc_unsafe</code></a></td><td valign="top"><a href="libunistring_4.html#SEC14">4.3 Elementary string functions</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX40"><code>u32_mbtoucr</code></a></td><td valign="top"><a href="libunistring_4.html#SEC14">4.3 Elementary string functions</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX50"><code>u32_move</code></a></td><td valign="top"><a href="libunistring_4.html#SEC14">4.3 Elementary string functions</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX81"><code>u32_next</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX814"><code>u32_normalize</code></a></td><td valign="top"><a href="libunistring_13.html#SEC51">13.3 Normalization of strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX817"><code>u32_normcmp</code></a></td><td valign="top"><a href="libunistring_13.html#SEC52">13.4 Normalizing comparisons</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX825"><code>u32_normcoll</code></a></td><td valign="top"><a href="libunistring_13.html#SEC52">13.4 Normalizing comparisons</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX822"><code>u32_normxfrm</code></a></td><td valign="top"><a href="libunistring_13.html#SEC52">13.4 Normalizing comparisons</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_12.html#IDX777"><code>u32_possible_linebreaks</code></a></td><td valign="top"><a href="libunistring_12.html#SEC47">12. Line breaking <code><unilbrk.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX84"><code>u32_prev</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX53"><code>u32_set</code></a></td><td valign="top"><a href="libunistring_4.html#SEC14">4.3 Elementary string functions</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX220"><code>u32_snprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC18">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX219"><code>u32_sprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC18">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX147"><code>u32_startswith</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX97"><code>u32_stpcpy</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX103"><code>u32_stpncpy</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX106"><code>u32_strcat</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX128"><code>u32_strchr</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX113"><code>u32_strcmp</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX117"><code>u32_strcoll</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_5.html#IDX169"><code>u32_strconv_from_encoding</code></a></td><td valign="top"><a href="libunistring_5.html#SEC17">5. Conversions between Unicode and encodings <code><uniconv.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_5.html#IDX175"><code>u32_strconv_from_locale</code></a></td><td valign="top"><a href="libunistring_5.html#SEC17">5. Conversions between Unicode and encodings <code><uniconv.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_5.html#IDX172"><code>u32_strconv_to_encoding</code></a></td><td valign="top"><a href="libunistring_5.html#SEC17">5. Conversions between Unicode and encodings <code><uniconv.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_5.html#IDX178"><code>u32_strconv_to_locale</code></a></td><td valign="top"><a href="libunistring_5.html#SEC17">5. Conversions between Unicode and encodings <code><uniconv.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX94"><code>u32_strcpy</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX134"><code>u32_strcspn</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX124"><code>u32_strdup</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX87"><code>u32_strlen</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX74"><code>u32_strmblen</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX78"><code>u32_strmbtouc</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX109"><code>u32_strncat</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX120"><code>u32_strncmp</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX100"><code>u32_strncpy</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX90"><code>u32_strnlen</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX140"><code>u32_strpbrk</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX131"><code>u32_strrchr</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX137"><code>u32_strspn</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX144"><code>u32_strstr</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX153"><code>u32_strtok</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_9.html#IDX711"><code>u32_strwidth</code></a></td><td valign="top"><a href="libunistring_9.html#SEC40">9. Display width <code><uniwidth.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX28"><code>u32_to_u16</code></a></td><td valign="top"><a href="libunistring_4.html#SEC13">4.2 Elementary string conversions</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX27"><code>u32_to_u8</code></a></td><td valign="top"><a href="libunistring_4.html#SEC13">4.2 Elementary string conversions</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX841"><code>u32_tolower</code></a></td><td valign="top"><a href="libunistring_14.html#SEC56">14.2 Case mappings of strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX844"><code>u32_totitle</code></a></td><td valign="top"><a href="libunistring_14.html#SEC56">14.2 Case mappings of strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX838"><code>u32_toupper</code></a></td><td valign="top"><a href="libunistring_14.html#SEC56">14.2 Case mappings of strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX230"><code>u32_u32_asnprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC18">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX229"><code>u32_u32_asprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC18">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX228"><code>u32_u32_snprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC18">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX227"><code>u32_u32_sprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC18">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX234"><code>u32_u32_vasnprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC18">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX233"><code>u32_u32_vasprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC18">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX232"><code>u32_u32_vsnprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC18">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX231"><code>u32_u32_vsprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC18">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX43"><code>u32_uctomb</code></a></td><td valign="top"><a href="libunistring_4.html#SEC14">4.3 Elementary string functions</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX226"><code>u32_vasnprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC18">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX225"><code>u32_vasprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC18">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX224"><code>u32_vsnprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC18">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX223"><code>u32_vsprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC18">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_9.html#IDX708"><code>u32_width</code></a></td><td valign="top"><a href="libunistring_9.html#SEC40">9. Display width <code><uniwidth.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_12.html#IDX781"><code>u32_width_linebreaks</code></a></td><td valign="top"><a href="libunistring_12.html#SEC47">12. Line breaking <code><unilbrk.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_11.html#IDX745"><code>u32_wordbreaks</code></a></td><td valign="top"><a href="libunistring_11.html#SEC45">11.1 Word breaks in a string</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX190"><code>u8_asnprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC18">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX189"><code>u8_asprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC18">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX876"><code>u8_casecmp</code></a></td><td valign="top"><a href="libunistring_14.html#SEC58">14.4 Case insensitive comparison</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX888"><code>u8_casecoll</code></a></td><td valign="top"><a href="libunistring_14.html#SEC58">14.4 Case insensitive comparison</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX870"><code>u8_casefold</code></a></td><td valign="top"><a href="libunistring_14.html#SEC58">14.4 Case insensitive comparison</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX884"><code>u8_casexfrm</code></a></td><td valign="top"><a href="libunistring_14.html#SEC58">14.4 Case insensitive comparison</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX847"><code>u8_casing_prefix_context</code></a></td><td valign="top"><a href="libunistring_14.html#SEC57">14.3 Case mappings of substrings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX850"><code>u8_casing_prefixes_context</code></a></td><td valign="top"><a href="libunistring_14.html#SEC57">14.3 Case mappings of substrings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX855"><code>u8_casing_suffix_context</code></a></td><td valign="top"><a href="libunistring_14.html#SEC57">14.3 Case mappings of substrings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX858"><code>u8_casing_suffixes_context</code></a></td><td valign="top"><a href="libunistring_14.html#SEC57">14.3 Case mappings of substrings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX20"><code>u8_check</code></a></td><td valign="top"><a href="libunistring_4.html#SEC12">4.1 Elementary string checks</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX62"><code>u8_chr</code></a></td><td valign="top"><a href="libunistring_4.html#SEC14">4.3 Elementary string functions</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX55"><code>u8_cmp</code></a></td><td valign="top"><a href="libunistring_4.html#SEC14">4.3 Elementary string functions</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX58"><code>u8_cmp2</code></a></td><td valign="top"><a href="libunistring_4.html#SEC14">4.3 Elementary string functions</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_5.html#IDX161"><code>u8_conv_from_encoding</code></a></td><td valign="top"><a href="libunistring_5.html#SEC17">5. Conversions between Unicode and encodings <code><uniconv.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_5.html#IDX164"><code>u8_conv_to_encoding</code></a></td><td valign="top"><a href="libunistring_5.html#SEC17">5. Conversions between Unicode and encodings <code><uniconv.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX45"><code>u8_cpy</code></a></td><td valign="top"><a href="libunistring_4.html#SEC14">4.3 Elementary string functions</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX69"><code>u8_cpy_alloc</code></a></td><td valign="top"><a href="libunistring_4.html#SEC15">4.4 Elementary string functions with memory allocation</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX873"><code>u8_ct_casefold</code></a></td><td valign="top"><a href="libunistring_14.html#SEC58">14.4 Case insensitive comparison</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX864"><code>u8_ct_tolower</code></a></td><td valign="top"><a href="libunistring_14.html#SEC57">14.3 Case mappings of substrings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX867"><code>u8_ct_totitle</code></a></td><td valign="top"><a href="libunistring_14.html#SEC57">14.3 Case mappings of substrings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX861"><code>u8_ct_toupper</code></a></td><td valign="top"><a href="libunistring_14.html#SEC57">14.3 Case mappings of substrings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX148"><code>u8_endswith</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_10.html#IDX718"><code>u8_grapheme_breaks</code></a></td><td valign="top"><a href="libunistring_10.html#SEC42">10.1 Grapheme cluster breaks in a string</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_10.html#IDX712"><code>u8_grapheme_next</code></a></td><td valign="top"><a href="libunistring_10.html#SEC42">10.1 Grapheme cluster breaks in a string</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_10.html#IDX715"><code>u8_grapheme_prev</code></a></td><td valign="top"><a href="libunistring_10.html#SEC42">10.1 Grapheme cluster breaks in a string</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX904"><code>u8_is_cased</code></a></td><td valign="top"><a href="libunistring_14.html#SEC59">14.5 Case detection</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX901"><code>u8_is_casefolded</code></a></td><td valign="top"><a href="libunistring_14.html#SEC59">14.5 Case detection</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX895"><code>u8_is_lowercase</code></a></td><td valign="top"><a href="libunistring_14.html#SEC59">14.5 Case detection</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX898"><code>u8_is_titlecase</code></a></td><td valign="top"><a href="libunistring_14.html#SEC59">14.5 Case detection</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX892"><code>u8_is_uppercase</code></a></td><td valign="top"><a href="libunistring_14.html#SEC59">14.5 Case detection</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX29"><code>u8_mblen</code></a></td><td valign="top"><a href="libunistring_4.html#SEC14">4.3 Elementary string functions</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX66"><code>u8_mbsnlen</code></a></td><td valign="top"><a href="libunistring_4.html#SEC14">4.3 Elementary string functions</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX35"><code>u8_mbtouc</code></a></td><td valign="top"><a href="libunistring_4.html#SEC14">4.3 Elementary string functions</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX32"><code>u8_mbtouc_unsafe</code></a></td><td valign="top"><a href="libunistring_4.html#SEC14">4.3 Elementary string functions</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX38"><code>u8_mbtoucr</code></a></td><td valign="top"><a href="libunistring_4.html#SEC14">4.3 Elementary string functions</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX48"><code>u8_move</code></a></td><td valign="top"><a href="libunistring_4.html#SEC14">4.3 Elementary string functions</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX79"><code>u8_next</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX812"><code>u8_normalize</code></a></td><td valign="top"><a href="libunistring_13.html#SEC51">13.3 Normalization of strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX815"><code>u8_normcmp</code></a></td><td valign="top"><a href="libunistring_13.html#SEC52">13.4 Normalizing comparisons</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX823"><code>u8_normcoll</code></a></td><td valign="top"><a href="libunistring_13.html#SEC52">13.4 Normalizing comparisons</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX820"><code>u8_normxfrm</code></a></td><td valign="top"><a href="libunistring_13.html#SEC52">13.4 Normalizing comparisons</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_12.html#IDX775"><code>u8_possible_linebreaks</code></a></td><td valign="top"><a href="libunistring_12.html#SEC47">12. Line breaking <code><unilbrk.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX82"><code>u8_prev</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX51"><code>u8_set</code></a></td><td valign="top"><a href="libunistring_4.html#SEC14">4.3 Elementary string functions</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX188"><code>u8_snprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC18">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX187"><code>u8_sprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC18">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX145"><code>u8_startswith</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX95"><code>u8_stpcpy</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX101"><code>u8_stpncpy</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX104"><code>u8_strcat</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX126"><code>u8_strchr</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX111"><code>u8_strcmp</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX115"><code>u8_strcoll</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_5.html#IDX167"><code>u8_strconv_from_encoding</code></a></td><td valign="top"><a href="libunistring_5.html#SEC17">5. Conversions between Unicode and encodings <code><uniconv.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_5.html#IDX173"><code>u8_strconv_from_locale</code></a></td><td valign="top"><a href="libunistring_5.html#SEC17">5. Conversions between Unicode and encodings <code><uniconv.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_5.html#IDX170"><code>u8_strconv_to_encoding</code></a></td><td valign="top"><a href="libunistring_5.html#SEC17">5. Conversions between Unicode and encodings <code><uniconv.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_5.html#IDX176"><code>u8_strconv_to_locale</code></a></td><td valign="top"><a href="libunistring_5.html#SEC17">5. Conversions between Unicode and encodings <code><uniconv.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX92"><code>u8_strcpy</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX132"><code>u8_strcspn</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX122"><code>u8_strdup</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX85"><code>u8_strlen</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX72"><code>u8_strmblen</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX76"><code>u8_strmbtouc</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX107"><code>u8_strncat</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX118"><code>u8_strncmp</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX98"><code>u8_strncpy</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX88"><code>u8_strnlen</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX138"><code>u8_strpbrk</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX129"><code>u8_strrchr</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX135"><code>u8_strspn</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX142"><code>u8_strstr</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX151"><code>u8_strtok</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_9.html#IDX709"><code>u8_strwidth</code></a></td><td valign="top"><a href="libunistring_9.html#SEC40">9. Display width <code><uniwidth.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX23"><code>u8_to_u16</code></a></td><td valign="top"><a href="libunistring_4.html#SEC13">4.2 Elementary string conversions</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX24"><code>u8_to_u32</code></a></td><td valign="top"><a href="libunistring_4.html#SEC13">4.2 Elementary string conversions</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX839"><code>u8_tolower</code></a></td><td valign="top"><a href="libunistring_14.html#SEC56">14.2 Case mappings of strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX842"><code>u8_totitle</code></a></td><td valign="top"><a href="libunistring_14.html#SEC56">14.2 Case mappings of strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX836"><code>u8_toupper</code></a></td><td valign="top"><a href="libunistring_14.html#SEC56">14.2 Case mappings of strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX198"><code>u8_u8_asnprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC18">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX197"><code>u8_u8_asprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC18">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX196"><code>u8_u8_snprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC18">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX195"><code>u8_u8_sprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC18">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX202"><code>u8_u8_vasnprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC18">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX201"><code>u8_u8_vasprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC18">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX200"><code>u8_u8_vsnprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC18">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX199"><code>u8_u8_vsprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC18">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX41"><code>u8_uctomb</code></a></td><td valign="top"><a href="libunistring_4.html#SEC14">4.3 Elementary string functions</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX194"><code>u8_vasnprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC18">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX193"><code>u8_vasprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC18">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX192"><code>u8_vsnprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC18">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX191"><code>u8_vsprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC18">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_9.html#IDX706"><code>u8_width</code></a></td><td valign="top"><a href="libunistring_9.html#SEC40">9. Display width <code><uniwidth.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_12.html#IDX779"><code>u8_width_linebreaks</code></a></td><td valign="top"><a href="libunistring_12.html#SEC47">12. Line breaking <code><unilbrk.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_11.html#IDX743"><code>u8_wordbreaks</code></a></td><td valign="top"><a href="libunistring_11.html#SEC45">11.1 Word breaks in a string</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX678"><code>uc_all_blocks</code></a></td><td valign="top"><a href="libunistring_8.html#SEC37">8.11 Blocks</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX673"><code>uc_all_scripts</code></a></td><td valign="top"><a href="libunistring_8.html#SEC36">8.10 Scripts</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX414"><code>uc_bidi_category</code></a></td><td valign="top"><a href="libunistring_8.html#SEC25">8.3 Bidi class</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX412"><code>uc_bidi_category_byname</code></a></td><td valign="top"><a href="libunistring_8.html#SEC25">8.3 Bidi class</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX409"><code>uc_bidi_category_name</code></a></td><td valign="top"><a href="libunistring_8.html#SEC25">8.3 Bidi class</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX413"><code>uc_bidi_class</code></a></td><td valign="top"><a href="libunistring_8.html#SEC25">8.3 Bidi class</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX411"><code>uc_bidi_class_byname</code></a></td><td valign="top"><a href="libunistring_8.html#SEC25">8.3 Bidi class</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX410"><code>uc_bidi_class_long_name</code></a></td><td valign="top"><a href="libunistring_8.html#SEC25">8.3 Bidi class</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX408"><code>uc_bidi_class_name</code></a></td><td valign="top"><a href="libunistring_8.html#SEC25">8.3 Bidi class</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX676"><code>uc_block</code></a></td><td valign="top"><a href="libunistring_8.html#SEC37">8.11 Blocks</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX674"><code>uc_block_t</code></a></td><td valign="top"><a href="libunistring_8.html#SEC37">8.11 Blocks</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX686"><code>uc_c_ident_category</code></a></td><td valign="top"><a href="libunistring_8.html#SEC38">8.12 ISO C and Java syntax</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX802"><code>uc_canonical_decomposition</code></a></td><td valign="top"><a href="libunistring_13.html#SEC49">13.1 Decomposition of Unicode characters</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX388"><code>uc_combining_class</code></a></td><td valign="top"><a href="libunistring_8.html#SEC24">8.2 Canonical combining class</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX387"><code>uc_combining_class_byname</code></a></td><td valign="top"><a href="libunistring_8.html#SEC24">8.2 Canonical combining class</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX386"><code>uc_combining_class_long_name</code></a></td><td valign="top"><a href="libunistring_8.html#SEC24">8.2 Canonical combining class</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX385"><code>uc_combining_class_name</code></a></td><td valign="top"><a href="libunistring_8.html#SEC24">8.2 Canonical combining class</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX803"><code>uc_composition</code></a></td><td valign="top"><a href="libunistring_13.html#SEC50">13.2 Composition of Unicode characters</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX417"><code>uc_decimal_value</code></a></td><td valign="top"><a href="libunistring_8.html#SEC26">8.4 Decimal digit value</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX801"><code>uc_decomposition</code></a></td><td valign="top"><a href="libunistring_13.html#SEC49">13.1 Decomposition of Unicode characters</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX418"><code>uc_digit_value</code></a></td><td valign="top"><a href="libunistring_8.html#SEC27">8.5 Digit value</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX419"><code>uc_fraction_t</code></a></td><td valign="top"><a href="libunistring_8.html#SEC28">8.6 Numeric value</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX324"><code>uc_general_category</code></a></td><td valign="top"><a href="libunistring_8.html#SEC22">8.1.1 The object oriented API for general category</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX319"><code>uc_general_category_and</code></a></td><td valign="top"><a href="libunistring_8.html#SEC22">8.1.1 The object oriented API for general category</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX320"><code>uc_general_category_and_not</code></a></td><td valign="top"><a href="libunistring_8.html#SEC22">8.1.1 The object oriented API for general category</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX323"><code>uc_general_category_byname</code></a></td><td valign="top"><a href="libunistring_8.html#SEC22">8.1.1 The object oriented API for general category</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX322"><code>uc_general_category_long_name</code></a></td><td valign="top"><a href="libunistring_8.html#SEC22">8.1.1 The object oriented API for general category</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX321"><code>uc_general_category_name</code></a></td><td valign="top"><a href="libunistring_8.html#SEC22">8.1.1 The object oriented API for general category</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX318"><code>uc_general_category_or</code></a></td><td valign="top"><a href="libunistring_8.html#SEC22">8.1.1 The object oriented API for general category</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX241"><code>uc_general_category_t</code></a></td><td valign="top"><a href="libunistring_8.html#SEC22">8.1.1 The object oriented API for general category</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_10.html#IDX722"><code>uc_grapheme_breaks</code></a></td><td valign="top"><a href="libunistring_10.html#SEC42">10.1 Grapheme cluster breaks in a string</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_10.html#IDX741"><code>uc_graphemeclusterbreak_property</code></a></td><td valign="top"><a href="libunistring_10.html#SEC43">10.2 Grapheme cluster break property</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX689"><code>uc_is_alnum</code></a></td><td valign="top"><a href="libunistring_8.html#SEC39">8.13 Classifications like in ISO C</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX690"><code>uc_is_alpha</code></a></td><td valign="top"><a href="libunistring_8.html#SEC39">8.13 Classifications like in ISO C</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX416"><code>uc_is_bidi_category</code></a></td><td valign="top"><a href="libunistring_8.html#SEC25">8.3 Bidi class</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX415"><code>uc_is_bidi_class</code></a></td><td valign="top"><a href="libunistring_8.html#SEC25">8.3 Bidi class</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX700"><code>uc_is_blank</code></a></td><td valign="top"><a href="libunistring_8.html#SEC39">8.13 Classifications like in ISO C</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX677"><code>uc_is_block</code></a></td><td valign="top"><a href="libunistring_8.html#SEC37">8.11 Blocks</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX679"><code>uc_is_c_whitespace</code></a></td><td valign="top"><a href="libunistring_8.html#SEC38">8.12 ISO C and Java syntax</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX691"><code>uc_is_cntrl</code></a></td><td valign="top"><a href="libunistring_8.html#SEC39">8.13 Classifications like in ISO C</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX692"><code>uc_is_digit</code></a></td><td valign="top"><a href="libunistring_8.html#SEC39">8.13 Classifications like in ISO C</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX325"><code>uc_is_general_category</code></a></td><td valign="top"><a href="libunistring_8.html#SEC22">8.1.1 The object oriented API for general category</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX364"><code>uc_is_general_category_withtable</code></a></td><td valign="top"><a href="libunistring_8.html#SEC23">8.1.2 The bit mask API for general category</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX693"><code>uc_is_graph</code></a></td><td valign="top"><a href="libunistring_8.html#SEC39">8.13 Classifications like in ISO C</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_10.html#IDX742"><code>uc_is_grapheme_break</code></a></td><td valign="top"><a href="libunistring_10.html#SEC43">10.2 Grapheme cluster break property</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX680"><code>uc_is_java_whitespace</code></a></td><td valign="top"><a href="libunistring_8.html#SEC38">8.12 ISO C and Java syntax</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX694"><code>uc_is_lower</code></a></td><td valign="top"><a href="libunistring_8.html#SEC39">8.13 Classifications like in ISO C</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX695"><code>uc_is_print</code></a></td><td valign="top"><a href="libunistring_8.html#SEC39">8.13 Classifications like in ISO C</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX581"><code>uc_is_property</code></a></td><td valign="top"><a href="libunistring_8.html#SEC34">8.9.1 Properties as objects – the object oriented API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX583"><code>uc_is_property_alphabetic</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX637"><code>uc_is_property_ascii_hex_digit</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX626"><code>uc_is_property_bidi_arabic_digit</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX622"><code>uc_is_property_bidi_arabic_right_to_left</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX628"><code>uc_is_property_bidi_block_separator</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX632"><code>uc_is_property_bidi_boundary_neutral</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX627"><code>uc_is_property_bidi_common_separator</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX619"><code>uc_is_property_bidi_control</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX634"><code>uc_is_property_bidi_embedding_or_override</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX624"><code>uc_is_property_bidi_eur_num_separator</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX625"><code>uc_is_property_bidi_eur_num_terminator</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX623"><code>uc_is_property_bidi_european_digit</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX621"><code>uc_is_property_bidi_hebrew_right_to_left</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX620"><code>uc_is_property_bidi_left_to_right</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX631"><code>uc_is_property_bidi_non_spacing_mark</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX635"><code>uc_is_property_bidi_other_neutral</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX633"><code>uc_is_property_bidi_pdf</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX629"><code>uc_is_property_bidi_segment_separator</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX630"><code>uc_is_property_bidi_whitespace</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX599"><code>uc_is_property_case_ignorable</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX598"><code>uc_is_property_cased</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX603"><code>uc_is_property_changes_when_casefolded</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX604"><code>uc_is_property_changes_when_casemapped</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX600"><code>uc_is_property_changes_when_lowercased</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX602"><code>uc_is_property_changes_when_titlecased</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX601"><code>uc_is_property_changes_when_uppercased</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX661"><code>uc_is_property_combining</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX662"><code>uc_is_property_composite</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX656"><code>uc_is_property_currency_symbol</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX648"><code>uc_is_property_dash</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX663"><code>uc_is_property_decimal_digit</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX586"><code>uc_is_property_default_ignorable_code_point</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX588"><code>uc_is_property_deprecated</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX665"><code>uc_is_property_diacritic</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX666"><code>uc_is_property_extender</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX647"><code>uc_is_property_format_control</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX615"><code>uc_is_property_grapheme_base</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX616"><code>uc_is_property_grapheme_extend</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX618"><code>uc_is_property_grapheme_link</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX636"><code>uc_is_property_hex_digit</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX649"><code>uc_is_property_hyphen</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX608"><code>uc_is_property_id_continue</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX606"><code>uc_is_property_id_start</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX638"><code>uc_is_property_ideographic</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX641"><code>uc_is_property_ids_binary_operator</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX642"><code>uc_is_property_ids_trinary_operator</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX667"><code>uc_is_property_ignorable_control</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX646"><code>uc_is_property_iso_control</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX614"><code>uc_is_property_join_control</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX660"><code>uc_is_property_left_of_pair</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX651"><code>uc_is_property_line_separator</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX589"><code>uc_is_property_logical_order_exception</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX595"><code>uc_is_property_lowercase</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX657"><code>uc_is_property_math</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX645"><code>uc_is_property_non_break</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX585"><code>uc_is_property_not_a_character</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX664"><code>uc_is_property_numeric</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX584"><code>uc_is_property_other_alphabetic</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX587"><code>uc_is_property_other_default_ignorable_code_point</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX617"><code>uc_is_property_other_grapheme_extend</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX609"><code>uc_is_property_other_id_continue</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX607"><code>uc_is_property_other_id_start</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX596"><code>uc_is_property_other_lowercase</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX658"><code>uc_is_property_other_math</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX594"><code>uc_is_property_other_uppercase</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX659"><code>uc_is_property_paired_punctuation</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX652"><code>uc_is_property_paragraph_separator</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX613"><code>uc_is_property_pattern_syntax</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX612"><code>uc_is_property_pattern_white_space</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX591"><code>uc_is_property_private_use</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX650"><code>uc_is_property_punctuation</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX653"><code>uc_is_property_quotation_mark</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX640"><code>uc_is_property_radical</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX654"><code>uc_is_property_sentence_terminal</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX605"><code>uc_is_property_soft_dotted</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX644"><code>uc_is_property_space</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX655"><code>uc_is_property_terminal_punctuation</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX597"><code>uc_is_property_titlecase</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX592"><code>uc_is_property_unassigned_code_value</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX639"><code>uc_is_property_unified_ideograph</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX593"><code>uc_is_property_uppercase</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX590"><code>uc_is_property_variation_selector</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX582"><code>uc_is_property_white_space</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX611"><code>uc_is_property_xid_continue</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX610"><code>uc_is_property_xid_start</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX643"><code>uc_is_property_zero_width</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX696"><code>uc_is_punct</code></a></td><td valign="top"><a href="libunistring_8.html#SEC39">8.13 Classifications like in ISO C</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX672"><code>uc_is_script</code></a></td><td valign="top"><a href="libunistring_8.html#SEC36">8.10 Scripts</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX697"><code>uc_is_space</code></a></td><td valign="top"><a href="libunistring_8.html#SEC39">8.13 Classifications like in ISO C</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX698"><code>uc_is_upper</code></a></td><td valign="top"><a href="libunistring_8.html#SEC39">8.13 Classifications like in ISO C</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX699"><code>uc_is_xdigit</code></a></td><td valign="top"><a href="libunistring_8.html#SEC39">8.13 Classifications like in ISO C</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX688"><code>uc_java_ident_category</code></a></td><td valign="top"><a href="libunistring_8.html#SEC38">8.12 ISO C and Java syntax</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX491"><code>uc_joining_group</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Joining group of Arabic characters</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX490"><code>uc_joining_group_byname</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Joining group of Arabic characters</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX489"><code>uc_joining_group_name</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Joining group of Arabic characters</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX431"><code>uc_joining_type</code></a></td><td valign="top"><a href="libunistring_8.html#SEC31">8.8.1 Joining type of Arabic characters</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX430"><code>uc_joining_type_byname</code></a></td><td valign="top"><a href="libunistring_8.html#SEC31">8.8.1 Joining type of Arabic characters</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX429"><code>uc_joining_type_long_name</code></a></td><td valign="top"><a href="libunistring_8.html#SEC31">8.8.1 Joining type of Arabic characters</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX428"><code>uc_joining_type_name</code></a></td><td valign="top"><a href="libunistring_8.html#SEC31">8.8.1 Joining type of Arabic characters</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX835"><code>uc_locale_language</code></a></td><td valign="top"><a href="libunistring_14.html#SEC56">14.2 Case mappings of strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX421"><code>uc_mirror_char</code></a></td><td valign="top"><a href="libunistring_8.html#SEC29">8.7 Mirrored character</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX420"><code>uc_numeric_value</code></a></td><td valign="top"><a href="libunistring_8.html#SEC28">8.6 Numeric value</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX579"><code>uc_property_byname</code></a></td><td valign="top"><a href="libunistring_8.html#SEC34">8.9.1 Properties as objects – the object oriented API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX580"><code>uc_property_is_valid</code></a></td><td valign="top"><a href="libunistring_8.html#SEC34">8.9.1 Properties as objects – the object oriented API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX492"><code>uc_property_t</code></a></td><td valign="top"><a href="libunistring_8.html#SEC34">8.9.1 Properties as objects – the object oriented API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX670"><code>uc_script</code></a></td><td valign="top"><a href="libunistring_8.html#SEC36">8.10 Scripts</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX671"><code>uc_script_byname</code></a></td><td valign="top"><a href="libunistring_8.html#SEC36">8.10 Scripts</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX668"><code>uc_script_t</code></a></td><td valign="top"><a href="libunistring_8.html#SEC36">8.10 Scripts</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX832"><code>uc_tolower</code></a></td><td valign="top"><a href="libunistring_14.html#SEC55">14.1 Case mappings of characters</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX833"><code>uc_totitle</code></a></td><td valign="top"><a href="libunistring_14.html#SEC55">14.1 Case mappings of characters</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX831"><code>uc_toupper</code></a></td><td valign="top"><a href="libunistring_14.html#SEC55">14.1 Case mappings of characters</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_9.html#IDX705"><code>uc_width</code></a></td><td valign="top"><a href="libunistring_9.html#SEC40">9. Display width <code><uniwidth.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_11.html#IDX769"><code>uc_wordbreak_property</code></a></td><td valign="top"><a href="libunistring_11.html#SEC46">11.2 Word break property</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_1.html#IDX6">UCS-4</a></td><td valign="top"><a href="libunistring_1.html#SEC2">1.1 Unicode</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_3.html#IDX19"><code>ucs4_t</code></a></td><td valign="top"><a href="libunistring_3.html#SEC10">3. Elementary types <code><unitypes.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_3.html#IDX17"><code>uint16_t</code></a></td><td valign="top"><a href="libunistring_3.html#SEC10">3. Elementary types <code><unitypes.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_3.html#IDX18"><code>uint32_t</code></a></td><td valign="top"><a href="libunistring_3.html#SEC10">3. Elementary types <code><unitypes.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_3.html#IDX16"><code>uint8_t</code></a></td><td valign="top"><a href="libunistring_3.html#SEC10">3. Elementary types <code><unitypes.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX182"><code>ulc_asnprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC18">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX181"><code>ulc_asprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC18">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX879"><code>ulc_casecmp</code></a></td><td valign="top"><a href="libunistring_14.html#SEC58">14.4 Case insensitive comparison</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX891"><code>ulc_casecoll</code></a></td><td valign="top"><a href="libunistring_14.html#SEC58">14.4 Case insensitive comparison</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX887"><code>ulc_casexfrm</code></a></td><td valign="top"><a href="libunistring_14.html#SEC58">14.4 Case insensitive comparison</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX235"><code>ulc_fprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC18">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_10.html#IDX721"><code>ulc_grapheme_breaks</code></a></td><td valign="top"><a href="libunistring_10.html#SEC42">10.1 Grapheme cluster breaks in a string</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_12.html#IDX778"><code>ulc_possible_linebreaks</code></a></td><td valign="top"><a href="libunistring_12.html#SEC47">12. Line breaking <code><unilbrk.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX180"><code>ulc_snprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC18">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX179"><code>ulc_sprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC18">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX186"><code>ulc_vasnprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC18">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX185"><code>ulc_vasprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC18">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX236"><code>ulc_vfprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC18">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX184"><code>ulc_vsnprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC18">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX183"><code>ulc_vsprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC18">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_12.html#IDX782"><code>ulc_width_linebreaks</code></a></td><td valign="top"><a href="libunistring_12.html#SEC47">12. Line breaking <code><unilbrk.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_11.html#IDX746"><code>ulc_wordbreaks</code></a></td><td valign="top"><a href="libunistring_11.html#SEC45">11.1 Word breaks in a string</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_1.html#SEC2">Unicode</a></td><td valign="top"><a href="libunistring_1.html#SEC2">1.1 Unicode</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC25">Unicode character, bidi class</a></td><td valign="top"><a href="libunistring_8.html#SEC25">8.3 Bidi class</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC25">Unicode character, bidirectional category</a></td><td valign="top"><a href="libunistring_8.html#SEC25">8.3 Bidi class</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX675">Unicode character, block</a></td><td valign="top"><a href="libunistring_8.html#SEC37">8.11 Blocks</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC24">Unicode character, canonical combining class</a></td><td valign="top"><a href="libunistring_8.html#SEC24">8.2 Canonical combining class</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#SEC55">Unicode character, case mappings</a></td><td valign="top"><a href="libunistring_14.html#SEC55">14.1 Case mappings of characters</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC21">Unicode character, classification</a></td><td valign="top"><a href="libunistring_8.html#SEC21">8.1 General category</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC39">Unicode character, classification like in C</a></td><td valign="top"><a href="libunistring_8.html#SEC39">8.13 Classifications like in ISO C</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC21">Unicode character, general category</a></td><td valign="top"><a href="libunistring_8.html#SEC21">8.1 General category</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC29">Unicode character, mirroring</a></td><td valign="top"><a href="libunistring_8.html#SEC29">8.7 Mirrored character</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_7.html#SEC19">Unicode character, name</a></td><td valign="top"><a href="libunistring_7.html#SEC19">7. Names of Unicode characters <code><uniname.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC33">Unicode character, properties</a></td><td valign="top"><a href="libunistring_8.html#SEC33">8.9 Properties</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX669">Unicode character, script</a></td><td valign="top"><a href="libunistring_8.html#SEC36">8.10 Scripts</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX685">Unicode character, validity in C identifiers</a></td><td valign="top"><a href="libunistring_8.html#SEC38">8.12 ISO C and Java syntax</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX687">Unicode character, validity in Java identifiers</a></td><td valign="top"><a href="libunistring_8.html#SEC38">8.12 ISO C and Java syntax</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC26">Unicode character, value</a></td><td valign="top"><a href="libunistring_8.html#SEC26">8.4 Decimal digit value</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC27">Unicode character, value</a></td><td valign="top"><a href="libunistring_8.html#SEC27">8.5 Digit value</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC28">Unicode character, value</a></td><td valign="top"><a href="libunistring_8.html#SEC28">8.6 Numeric value</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_9.html#IDX702">Unicode character, width</a></td><td valign="top"><a href="libunistring_9.html#SEC40">9. Display width <code><uniwidth.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_7.html#IDX238"><code>unicode_character_name</code></a></td><td valign="top"><a href="libunistring_7.html#SEC19">7. Names of Unicode characters <code><uniname.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_7.html#IDX239"><code>unicode_name_character</code></a></td><td valign="top"><a href="libunistring_7.html#SEC19">7. Names of Unicode characters <code><uniname.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX811"><code>uninorm_decomposing_form</code></a></td><td valign="top"><a href="libunistring_13.html#SEC51">13.3 Normalization of strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX827"><code>uninorm_filter_create</code></a></td><td valign="top"><a href="libunistring_13.html#SEC53">13.5 Normalization of streams of Unicode characters</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX829"><code>uninorm_filter_flush</code></a></td><td valign="top"><a href="libunistring_13.html#SEC53">13.5 Normalization of streams of Unicode characters</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX830"><code>uninorm_filter_free</code></a></td><td valign="top"><a href="libunistring_13.html#SEC53">13.5 Normalization of streams of Unicode characters</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX828"><code>uninorm_filter_write</code></a></td><td valign="top"><a href="libunistring_13.html#SEC53">13.5 Normalization of streams of Unicode characters</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX809"><code>uninorm_is_compat_decomposing</code></a></td><td valign="top"><a href="libunistring_13.html#SEC51">13.3 Normalization of strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX810"><code>uninorm_is_composing</code></a></td><td valign="top"><a href="libunistring_13.html#SEC51">13.3 Normalization of strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX804"><code>uninorm_t</code></a></td><td valign="top"><a href="libunistring_13.html#SEC51">13.3 Normalization of strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#SEC56">uppercasing</a></td><td valign="top"><a href="libunistring_14.html#SEC56">14.2 Case mappings of strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_1.html#IDX1">use cases</a></td><td valign="top"><a href="libunistring_1.html#SEC1">1. Introduction</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_1.html#IDX4">UTF-16</a></td><td valign="top"><a href="libunistring_1.html#SEC2">1.1 Unicode</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_1.html#IDX12">UTF-16, strings</a></td><td valign="top"><a href="libunistring_1.html#SEC8">1.7 Unicode strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_1.html#IDX5">UTF-32</a></td><td valign="top"><a href="libunistring_1.html#SEC2">1.1 Unicode</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_1.html#IDX13">UTF-32, strings</a></td><td valign="top"><a href="libunistring_1.html#SEC8">1.7 Unicode strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_1.html#IDX3">UTF-8</a></td><td valign="top"><a href="libunistring_1.html#SEC2">1.1 Unicode</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_1.html#IDX11">UTF-8, strings</a></td><td valign="top"><a href="libunistring_1.html#SEC8">1.7 Unicode strings</a></td></tr> -<tr><td colspan="3"> <hr></td></tr> -</table> -<table><tr><th valign="top">Jump to: </th><td><a href="#SEC77_0" class="summary-letter"><b>A</b></a> - -<a href="#SEC77_1" class="summary-letter"><b>B</b></a> - -<a href="#SEC77_2" class="summary-letter"><b>C</b></a> - -<a href="#SEC77_3" class="summary-letter"><b>D</b></a> - -<a href="#SEC77_4" class="summary-letter"><b>E</b></a> - -<a href="#SEC77_5" class="summary-letter"><b>F</b></a> - -<a href="#SEC77_6" class="summary-letter"><b>G</b></a> - -<a href="#SEC77_7" class="summary-letter"><b>H</b></a> - -<a href="#SEC77_8" class="summary-letter"><b>I</b></a> - -<a href="#SEC77_9" class="summary-letter"><b>J</b></a> - -<a href="#SEC77_10" class="summary-letter"><b>L</b></a> - -<a href="#SEC77_11" class="summary-letter"><b>M</b></a> - -<a href="#SEC77_12" class="summary-letter"><b>N</b></a> - -<a href="#SEC77_13" class="summary-letter"><b>O</b></a> - -<a href="#SEC77_14" class="summary-letter"><b>P</b></a> - -<a href="#SEC77_15" class="summary-letter"><b>R</b></a> - -<a href="#SEC77_16" class="summary-letter"><b>S</b></a> - -<a href="#SEC77_17" class="summary-letter"><b>T</b></a> - -<a href="#SEC77_18" class="summary-letter"><b>U</b></a> - -<a href="libunistring_20.html#INDEX0_0" class="summary-letter"><b>V</b></a> - -<a href="libunistring_20.html#INDEX0_1" class="summary-letter"><b>W</b></a> - -</td></tr></table> +<a name="Licenses"></a> +<a name="SEC82"></a> +<h1 class="appendix"> <a href="libunistring.html#TOC82">B. Licenses</a> </h1> + +<p>The files of this package are covered by the licenses indicated in each +particular file or directory. Here is a summary: +</p> +<ul> +<li> +The <code>libunistring</code> library and its header files are dual-licensed under +"the GNU LGPLv3+ or the GNU GPLv2". This means, you can use it under either +<ul> +<li> - +the terms of the GNU Lesser General Public License (LGPL) version 3 or +(at your option) any later version, or +</li><li> - +the terms of the GNU General Public License (GPL) version 2, or +</li><li> - +the same dual license "the GNU LGPLv3+ or the GNU GPLv2". +</li></ul> +<p>You find the GNU LGPL version 3 in <a href="#SEC88">GNU LESSER GENERAL PUBLIC LICENSE</a>. This license is +based on the GNU GPL version 3, see <a href="#SEC83">GNU GENERAL PUBLIC LICENSE</a>. +<br> +You can find the GNU GPL version 2 at +<a href="https://www.gnu.org/licenses/old-licenses/gpl-2.0.html">https://www.gnu.org/licenses/old-licenses/gpl-2.0.html</a>. +<br> +Note: This dual license makes it possible for the <code>libunistring</code> library +to be used by packages under GPLv2 or GPLv2+ licenses, in particular. See +the table in <a href="https://www.gnu.org/licenses/gpl-faq.html#AllCompatibility">https://www.gnu.org/licenses/gpl-faq.html#AllCompatibility</a>. +</p> + +</li><li> +This manual is free documentation. It is dually licensed under the +GNU FDL and the GNU GPL. This means that you can redistribute this +manual under either of these two licenses, at your choice. +<br> +This manual is covered by the GNU FDL. Permission is granted to copy, +distribute and/or modify this document under the terms of the +GNU Free Documentation License (FDL), either version 1.2 of the +License, or (at your option) any later version published by the +Free Software Foundation (FSF); with no Invariant Sections, with no +Front-Cover Text, and with no Back-Cover Texts. +A copy of the license is included in <a href="#SEC89">GNU Free Documentation License</a>. +<br> +This manual is covered by the GNU GPL. You can redistribute it and/or +modify it under the terms of the GNU General Public License (GPL), either +version 3 of the License, or (at your option) any later version published +by the Free Software Foundation (FSF). +A copy of the license is included in <a href="#SEC83">GNU GENERAL PUBLIC LICENSE</a>. +</li></ul> + + + +<hr size="6"> +<a name="GNU-GPL"></a> +<a name="SEC83"></a> +<h2 class="appendixsec"> <a href="libunistring.html#TOC83">B.1 GNU GENERAL PUBLIC LICENSE</a> </h2> +<p align="center"> Version 3, 29 June 2007 +</p> + +<table><tr><td> </td><td><pre class="display">Copyright © 2007 Free Software Foundation, Inc. <a href="http://fsf.org/">http://fsf.org/</a> + +Everyone is permitted to copy and distribute verbatim copies of this +license document, but changing it is not allowed. +</pre></td></tr></table> + +<a name="SEC84"></a> +<h2 class="heading"> Preamble </h2> + +<p>The GNU General Public License is a free, copyleft license for +software and other kinds of works. +</p> +<p>The licenses for most software and other practical works are designed +to take away your freedom to share and change the works. By contrast, +the GNU General Public License is intended to guarantee your freedom +to share and change all versions of a program—to make sure it remains +free software for all its users. We, the Free Software Foundation, +use the GNU General Public License for most of our software; it +applies also to any other work released this way by its authors. You +can apply it to your programs, too. +</p> +<p>When we speak of free software, we are referring to freedom, not +price. Our General Public Licenses are designed to make sure that you +have the freedom to distribute copies of free software (and charge for +them if you wish), that you receive source code or can get it if you +want it, that you can change the software or use pieces of it in new +free programs, and that you know you can do these things. +</p> +<p>To protect your rights, we need to prevent others from denying you +these rights or asking you to surrender the rights. Therefore, you +have certain responsibilities if you distribute copies of the +software, or if you modify it: responsibilities to respect the freedom +of others. +</p> +<p>For example, if you distribute copies of such a program, whether +gratis or for a fee, you must pass on to the recipients the same +freedoms that you received. You must make sure that they, too, +receive or can get the source code. And you must show them these +terms so they know their rights. +</p> +<p>Developers that use the GNU GPL protect your rights with two steps: +(1) assert copyright on the software, and (2) offer you this License +giving you legal permission to copy, distribute and/or modify it. +</p> +<p>For the developers' and authors' protection, the GPL clearly explains +that there is no warranty for this free software. For both users' and +authors' sake, the GPL requires that modified versions be marked as +changed, so that their problems will not be attributed erroneously to +authors of previous versions. +</p> +<p>Some devices are designed to deny users access to install or run +modified versions of the software inside them, although the +manufacturer can do so. This is fundamentally incompatible with the +aim of protecting users' freedom to change the software. The +systematic pattern of such abuse occurs in the area of products for +individuals to use, which is precisely where it is most unacceptable. +Therefore, we have designed this version of the GPL to prohibit the +practice for those products. If such problems arise substantially in +other domains, we stand ready to extend this provision to those +domains in future versions of the GPL, as needed to protect the +freedom of users. +</p> +<p>Finally, every program is threatened constantly by software patents. +States should not allow patents to restrict development and use of +software on general-purpose computers, but in those that do, we wish +to avoid the special danger that patents applied to a free program +could make it effectively proprietary. To prevent this, the GPL +assures that patents cannot be used to render the program non-free. +</p> +<p>The precise terms and conditions for copying, distribution and +modification follow. +</p> +<a name="SEC85"></a> +<h2 class="heading"> TERMS AND CONDITIONS </h2> + +<ol> +<li> Definitions. + +<p>“This License” refers to version 3 of the GNU General Public License. +</p> +<p>“Copyright” also means copyright-like laws that apply to other kinds +of works, such as semiconductor masks. +</p> +<p>“The Program” refers to any copyrightable work licensed under this +License. Each licensee is addressed as “you”. “Licensees” and +“recipients” may be individuals or organizations. +</p> +<p>To “modify” a work means to copy from or adapt all or part of the work +in a fashion requiring copyright permission, other than the making of +an exact copy. The resulting work is called a “modified version” of +the earlier work or a work “based on” the earlier work. +</p> +<p>A “covered work” means either the unmodified Program or a work based +on the Program. +</p> +<p>To “propagate” a work means to do anything with it that, without +permission, would make you directly or secondarily liable for +infringement under applicable copyright law, except executing it on a +computer or modifying a private copy. Propagation includes copying, +distribution (with or without modification), making available to the +public, and in some countries other activities as well. +</p> +<p>To “convey” a work means any kind of propagation that enables other +parties to make or receive copies. Mere interaction with a user +through a computer network, with no transfer of a copy, is not +conveying. +</p> +<p>An interactive user interface displays “Appropriate Legal Notices” to +the extent that it includes a convenient and prominently visible +feature that (1) displays an appropriate copyright notice, and (2) +tells the user that there is no warranty for the work (except to the +extent that warranties are provided), that licensees may convey the +work under this License, and how to view a copy of this License. If +the interface presents a list of user commands or options, such as a +menu, a prominent item in the list meets this criterion. +</p> +</li><li> Source Code. + +<p>The “source code” for a work means the preferred form of the work for +making modifications to it. “Object code” means any non-source form +of a work. +</p> +<p>A “Standard Interface” means an interface that either is an official +standard defined by a recognized standards body, or, in the case of +interfaces specified for a particular programming language, one that +is widely used among developers working in that language. +</p> +<p>The “System Libraries” of an executable work include anything, other +than the work as a whole, that (a) is included in the normal form of +packaging a Major Component, but which is not part of that Major +Component, and (b) serves only to enable use of the work with that +Major Component, or to implement a Standard Interface for which an +implementation is available to the public in source code form. A +“Major Component”, in this context, means a major essential component +(kernel, window system, and so on) of the specific operating system +(if any) on which the executable work runs, or a compiler used to +produce the work, or an object code interpreter used to run it. +</p> +<p>The “Corresponding Source” for a work in object code form means all +the source code needed to generate, install, and (for an executable +work) run the object code and to modify the work, including scripts to +control those activities. However, it does not include the work's +System Libraries, or general-purpose tools or generally available free +programs which are used unmodified in performing those activities but +which are not part of the work. For example, Corresponding Source +includes interface definition files associated with source files for +the work, and the source code for shared libraries and dynamically +linked subprograms that the work is specifically designed to require, +such as by intimate data communication or control flow between those +subprograms and other parts of the work. +</p> +<p>The Corresponding Source need not include anything that users can +regenerate automatically from other parts of the Corresponding Source. +</p> +<p>The Corresponding Source for a work in source code form is that same +work. +</p> +</li><li> Basic Permissions. + +<p>All rights granted under this License are granted for the term of +copyright on the Program, and are irrevocable provided the stated +conditions are met. This License explicitly affirms your unlimited +permission to run the unmodified Program. The output from running a +covered work is covered by this License only if the output, given its +content, constitutes a covered work. This License acknowledges your +rights of fair use or other equivalent, as provided by copyright law. +</p> +<p>You may make, run and propagate covered works that you do not convey, +without conditions so long as your license otherwise remains in force. +You may convey covered works to others for the sole purpose of having +them make modifications exclusively for you, or provide you with +facilities for running those works, provided that you comply with the +terms of this License in conveying all material for which you do not +control copyright. Those thus making or running the covered works for +you must do so exclusively on your behalf, under your direction and +control, on terms that prohibit them from making any copies of your +copyrighted material outside their relationship with you. +</p> +<p>Conveying under any other circumstances is permitted solely under the +conditions stated below. Sublicensing is not allowed; section 10 +makes it unnecessary. +</p> +</li><li> Protecting Users' Legal Rights From Anti-Circumvention Law. + +<p>No covered work shall be deemed part of an effective technological +measure under any applicable law fulfilling obligations under article +11 of the WIPO copyright treaty adopted on 20 December 1996, or +similar laws prohibiting or restricting circumvention of such +measures. +</p> +<p>When you convey a covered work, you waive any legal power to forbid +circumvention of technological measures to the extent such +circumvention is effected by exercising rights under this License with +respect to the covered work, and you disclaim any intention to limit +operation or modification of the work as a means of enforcing, against +the work's users, your or third parties' legal rights to forbid +circumvention of technological measures. +</p> +</li><li> Conveying Verbatim Copies. + +<p>You may convey verbatim copies of the Program's source code as you +receive it, in any medium, provided that you conspicuously and +appropriately publish on each copy an appropriate copyright notice; +keep intact all notices stating that this License and any +non-permissive terms added in accord with section 7 apply to the code; +keep intact all notices of the absence of any warranty; and give all +recipients a copy of this License along with the Program. +</p> +<p>You may charge any price or no price for each copy that you convey, +and you may offer support or warranty protection for a fee. +</p> +</li><li> Conveying Modified Source Versions. + +<p>You may convey a work based on the Program, or the modifications to +produce it from the Program, in the form of source code under the +terms of section 4, provided that you also meet all of these +conditions: +</p> +<ol> +<li> +The work must carry prominent notices stating that you modified it, +and giving a relevant date. + +</li><li> +The work must carry prominent notices stating that it is released +under this License and any conditions added under section 7. This +requirement modifies the requirement in section 4 to “keep intact all +notices”. + +</li><li> +You must license the entire work, as a whole, under this License to +anyone who comes into possession of a copy. This License will +therefore apply, along with any applicable section 7 additional terms, +to the whole of the work, and all its parts, regardless of how they +are packaged. This License gives no permission to license the work in +any other way, but it does not invalidate such permission if you have +separately received it. + +</li><li> +If the work has interactive user interfaces, each must display +Appropriate Legal Notices; however, if the Program has interactive +interfaces that do not display Appropriate Legal Notices, your work +need not make them do so. +</li></ol> + +<p>A compilation of a covered work with other separate and independent +works, which are not by their nature extensions of the covered work, +and which are not combined with it such as to form a larger program, +in or on a volume of a storage or distribution medium, is called an +“aggregate” if the compilation and its resulting copyright are not +used to limit the access or legal rights of the compilation's users +beyond what the individual works permit. Inclusion of a covered work +in an aggregate does not cause this License to apply to the other +parts of the aggregate. +</p> +</li><li> Conveying Non-Source Forms. + +<p>You may convey a covered work in object code form under the terms of +sections 4 and 5, provided that you also convey the machine-readable +Corresponding Source under the terms of this License, in one of these +ways: +</p> +<ol> +<li> +Convey the object code in, or embodied in, a physical product +(including a physical distribution medium), accompanied by the +Corresponding Source fixed on a durable physical medium customarily +used for software interchange. + +</li><li> +Convey the object code in, or embodied in, a physical product +(including a physical distribution medium), accompanied by a written +offer, valid for at least three years and valid for as long as you +offer spare parts or customer support for that product model, to give +anyone who possesses the object code either (1) a copy of the +Corresponding Source for all the software in the product that is +covered by this License, on a durable physical medium customarily used +for software interchange, for a price no more than your reasonable +cost of physically performing this conveying of source, or (2) access +to copy the Corresponding Source from a network server at no charge. + +</li><li> +Convey individual copies of the object code with a copy of the written +offer to provide the Corresponding Source. This alternative is +allowed only occasionally and noncommercially, and only if you +received the object code with such an offer, in accord with subsection +6b. + +</li><li> +Convey the object code by offering access from a designated place +(gratis or for a charge), and offer equivalent access to the +Corresponding Source in the same way through the same place at no +further charge. You need not require recipients to copy the +Corresponding Source along with the object code. If the place to copy +the object code is a network server, the Corresponding Source may be +on a different server (operated by you or a third party) that supports +equivalent copying facilities, provided you maintain clear directions +next to the object code saying where to find the Corresponding Source. +Regardless of what server hosts the Corresponding Source, you remain +obligated to ensure that it is available for as long as needed to +satisfy these requirements. + +</li><li> +Convey the object code using peer-to-peer transmission, provided you +inform other peers where the object code and Corresponding Source of +the work are being offered to the general public at no charge under +subsection 6d. + +</li></ol> + +<p>A separable portion of the object code, whose source code is excluded +from the Corresponding Source as a System Library, need not be +included in conveying the object code work. +</p> +<p>A “User Product” is either (1) a “consumer product”, which means any +tangible personal property which is normally used for personal, +family, or household purposes, or (2) anything designed or sold for +incorporation into a dwelling. In determining whether a product is a +consumer product, doubtful cases shall be resolved in favor of +coverage. For a particular product received by a particular user, +“normally used” refers to a typical or common use of that class of +product, regardless of the status of the particular user or of the way +in which the particular user actually uses, or expects or is expected +to use, the product. A product is a consumer product regardless of +whether the product has substantial commercial, industrial or +non-consumer uses, unless such uses represent the only significant +mode of use of the product. +</p> +<p>“Installation Information” for a User Product means any methods, +procedures, authorization keys, or other information required to +install and execute modified versions of a covered work in that User +Product from a modified version of its Corresponding Source. The +information must suffice to ensure that the continued functioning of +the modified object code is in no case prevented or interfered with +solely because modification has been made. +</p> +<p>If you convey an object code work under this section in, or with, or +specifically for use in, a User Product, and the conveying occurs as +part of a transaction in which the right of possession and use of the +User Product is transferred to the recipient in perpetuity or for a +fixed term (regardless of how the transaction is characterized), the +Corresponding Source conveyed under this section must be accompanied +by the Installation Information. But this requirement does not apply +if neither you nor any third party retains the ability to install +modified object code on the User Product (for example, the work has +been installed in ROM). +</p> +<p>The requirement to provide Installation Information does not include a +requirement to continue to provide support service, warranty, or +updates for a work that has been modified or installed by the +recipient, or for the User Product in which it has been modified or +installed. Access to a network may be denied when the modification +itself materially and adversely affects the operation of the network +or violates the rules and protocols for communication across the +network. +</p> +<p>Corresponding Source conveyed, and Installation Information provided, +in accord with this section must be in a format that is publicly +documented (and with an implementation available to the public in +source code form), and must require no special password or key for +unpacking, reading or copying. +</p> +</li><li> Additional Terms. + +<p>“Additional permissions” are terms that supplement the terms of this +License by making exceptions from one or more of its conditions. +Additional permissions that are applicable to the entire Program shall +be treated as though they were included in this License, to the extent +that they are valid under applicable law. If additional permissions +apply only to part of the Program, that part may be used separately +under those permissions, but the entire Program remains governed by +this License without regard to the additional permissions. +</p> +<p>When you convey a copy of a covered work, you may at your option +remove any additional permissions from that copy, or from any part of +it. (Additional permissions may be written to require their own +removal in certain cases when you modify the work.) You may place +additional permissions on material, added by you to a covered work, +for which you have or can give appropriate copyright permission. +</p> +<p>Notwithstanding any other provision of this License, for material you +add to a covered work, you may (if authorized by the copyright holders +of that material) supplement the terms of this License with terms: +</p> +<ol> +<li> +Disclaiming warranty or limiting liability differently from the terms +of sections 15 and 16 of this License; or + +</li><li> +Requiring preservation of specified reasonable legal notices or author +attributions in that material or in the Appropriate Legal Notices +displayed by works containing it; or + +</li><li> +Prohibiting misrepresentation of the origin of that material, or +requiring that modified versions of such material be marked in +reasonable ways as different from the original version; or + +</li><li> +Limiting the use for publicity purposes of names of licensors or +authors of the material; or + +</li><li> +Declining to grant rights under trademark law for use of some trade +names, trademarks, or service marks; or + +</li><li> +Requiring indemnification of licensors and authors of that material by +anyone who conveys the material (or modified versions of it) with +contractual assumptions of liability to the recipient, for any +liability that these contractual assumptions directly impose on those +licensors and authors. +</li></ol> + +<p>All other non-permissive additional terms are considered “further +restrictions” within the meaning of section 10. If the Program as you +received it, or any part of it, contains a notice stating that it is +governed by this License along with a term that is a further +restriction, you may remove that term. If a license document contains +a further restriction but permits relicensing or conveying under this +License, you may add to a covered work material governed by the terms +of that license document, provided that the further restriction does +not survive such relicensing or conveying. +</p> +<p>If you add terms to a covered work in accord with this section, you +must place, in the relevant source files, a statement of the +additional terms that apply to those files, or a notice indicating +where to find the applicable terms. +</p> +<p>Additional terms, permissive or non-permissive, may be stated in the +form of a separately written license, or stated as exceptions; the +above requirements apply either way. +</p> +</li><li> Termination. + +<p>You may not propagate or modify a covered work except as expressly +provided under this License. Any attempt otherwise to propagate or +modify it is void, and will automatically terminate your rights under +this License (including any patent licenses granted under the third +paragraph of section 11). +</p> +<p>However, if you cease all violation of this License, then your license +from a particular copyright holder is reinstated (a) provisionally, +unless and until the copyright holder explicitly and finally +terminates your license, and (b) permanently, if the copyright holder +fails to notify you of the violation by some reasonable means prior to +60 days after the cessation. +</p> +<p>Moreover, your license from a particular copyright holder is +reinstated permanently if the copyright holder notifies you of the +violation by some reasonable means, this is the first time you have +received notice of violation of this License (for any work) from that +copyright holder, and you cure the violation prior to 30 days after +your receipt of the notice. +</p> +<p>Termination of your rights under this section does not terminate the +licenses of parties who have received copies or rights from you under +this License. If your rights have been terminated and not permanently +reinstated, you do not qualify to receive new licenses for the same +material under section 10. +</p> +</li><li> Acceptance Not Required for Having Copies. + +<p>You are not required to accept this License in order to receive or run +a copy of the Program. Ancillary propagation of a covered work +occurring solely as a consequence of using peer-to-peer transmission +to receive a copy likewise does not require acceptance. However, +nothing other than this License grants you permission to propagate or +modify any covered work. These actions infringe copyright if you do +not accept this License. Therefore, by modifying or propagating a +covered work, you indicate your acceptance of this License to do so. +</p> +</li><li> Automatic Licensing of Downstream Recipients. + +<p>Each time you convey a covered work, the recipient automatically +receives a license from the original licensors, to run, modify and +propagate that work, subject to this License. You are not responsible +for enforcing compliance by third parties with this License. +</p> +<p>An “entity transaction” is a transaction transferring control of an +organization, or substantially all assets of one, or subdividing an +organization, or merging organizations. If propagation of a covered +work results from an entity transaction, each party to that +transaction who receives a copy of the work also receives whatever +licenses to the work the party's predecessor in interest had or could +give under the previous paragraph, plus a right to possession of the +Corresponding Source of the work from the predecessor in interest, if +the predecessor has it or can get it with reasonable efforts. +</p> +<p>You may not impose any further restrictions on the exercise of the +rights granted or affirmed under this License. For example, you may +not impose a license fee, royalty, or other charge for exercise of +rights granted under this License, and you may not initiate litigation +(including a cross-claim or counterclaim in a lawsuit) alleging that +any patent claim is infringed by making, using, selling, offering for +sale, or importing the Program or any portion of it. +</p> +</li><li> Patents. + +<p>A “contributor” is a copyright holder who authorizes use under this +License of the Program or a work on which the Program is based. The +work thus licensed is called the contributor's “contributor version”. +</p> +<p>A contributor's “essential patent claims” are all patent claims owned +or controlled by the contributor, whether already acquired or +hereafter acquired, that would be infringed by some manner, permitted +by this License, of making, using, or selling its contributor version, +but do not include claims that would be infringed only as a +consequence of further modification of the contributor version. For +purposes of this definition, “control” includes the right to grant +patent sublicenses in a manner consistent with the requirements of +this License. +</p> +<p>Each contributor grants you a non-exclusive, worldwide, royalty-free +patent license under the contributor's essential patent claims, to +make, use, sell, offer for sale, import and otherwise run, modify and +propagate the contents of its contributor version. +</p> +<p>In the following three paragraphs, a “patent license” is any express +agreement or commitment, however denominated, not to enforce a patent +(such as an express permission to practice a patent or covenant not to +sue for patent infringement). To “grant” such a patent license to a +party means to make such an agreement or commitment not to enforce a +patent against the party. +</p> +<p>If you convey a covered work, knowingly relying on a patent license, +and the Corresponding Source of the work is not available for anyone +to copy, free of charge and under the terms of this License, through a +publicly available network server or other readily accessible means, +then you must either (1) cause the Corresponding Source to be so +available, or (2) arrange to deprive yourself of the benefit of the +patent license for this particular work, or (3) arrange, in a manner +consistent with the requirements of this License, to extend the patent +license to downstream recipients. “Knowingly relying” means you have +actual knowledge that, but for the patent license, your conveying the +covered work in a country, or your recipient's use of the covered work +in a country, would infringe one or more identifiable patents in that +country that you have reason to believe are valid. +</p> +<p>If, pursuant to or in connection with a single transaction or +arrangement, you convey, or propagate by procuring conveyance of, a +covered work, and grant a patent license to some of the parties +receiving the covered work authorizing them to use, propagate, modify +or convey a specific copy of the covered work, then the patent license +you grant is automatically extended to all recipients of the covered +work and works based on it. +</p> +<p>A patent license is “discriminatory” if it does not include within the +scope of its coverage, prohibits the exercise of, or is conditioned on +the non-exercise of one or more of the rights that are specifically +granted under this License. You may not convey a covered work if you +are a party to an arrangement with a third party that is in the +business of distributing software, under which you make payment to the +third party based on the extent of your activity of conveying the +work, and under which the third party grants, to any of the parties +who would receive the covered work from you, a discriminatory patent +license (a) in connection with copies of the covered work conveyed by +you (or copies made from those copies), or (b) primarily for and in +connection with specific products or compilations that contain the +covered work, unless you entered into that arrangement, or that patent +license was granted, prior to 28 March 2007. +</p> +<p>Nothing in this License shall be construed as excluding or limiting +any implied license or other defenses to infringement that may +otherwise be available to you under applicable patent law. +</p> +</li><li> No Surrender of Others' Freedom. + +<p>If conditions are imposed on you (whether by court order, agreement or +otherwise) that contradict the conditions of this License, they do not +excuse you from the conditions of this License. If you cannot convey +a covered work so as to satisfy simultaneously your obligations under +this License and any other pertinent obligations, then as a +consequence you may not convey it at all. For example, if you agree +to terms that obligate you to collect a royalty for further conveying +from those to whom you convey the Program, the only way you could +satisfy both those terms and this License would be to refrain entirely +from conveying the Program. +</p> +</li><li> Use with the GNU Affero General Public License. + +<p>Notwithstanding any other provision of this License, you have +permission to link or combine any covered work with a work licensed +under version 3 of the GNU Affero General Public License into a single +combined work, and to convey the resulting work. The terms of this +License will continue to apply to the part which is the covered work, +but the special requirements of the GNU Affero General Public License, +section 13, concerning interaction through a network will apply to the +combination as such. +</p> +</li><li> Revised Versions of this License. + +<p>The Free Software Foundation may publish revised and/or new versions +of the GNU General Public License from time to time. Such new +versions will be similar in spirit to the present version, but may +differ in detail to address new problems or concerns. +</p> +<p>Each version is given a distinguishing version number. If the Program +specifies that a certain numbered version of the GNU General Public +License “or any later version” applies to it, you have the option of +following the terms and conditions either of that numbered version or +of any later version published by the Free Software Foundation. If +the Program does not specify a version number of the GNU General +Public License, you may choose any version ever published by the Free +Software Foundation. +</p> +<p>If the Program specifies that a proxy can decide which future versions +of the GNU General Public License can be used, that proxy's public +statement of acceptance of a version permanently authorizes you to +choose that version for the Program. +</p> +<p>Later license versions may give you additional or different +permissions. However, no additional obligations are imposed on any +author or copyright holder as a result of your choosing to follow a +later version. +</p> +</li><li> Disclaimer of Warranty. + +<p>THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY +APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT +HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM “AS IS” WITHOUT +WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT +LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR +A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND +PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE +DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR +CORRECTION. +</p> +</li><li> Limitation of Liability. + +<p>IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING +WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR +CONVEYS THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, +INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES +ARISING OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT +NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR +LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM +TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER +PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. +</p> +</li><li> Interpretation of Sections 15 and 16. + +<p>If the disclaimer of warranty and limitation of liability provided +above cannot be given local legal effect according to their terms, +reviewing courts shall apply local law that most closely approximates +an absolute waiver of all civil liability in connection with the +Program, unless a warranty or assumption of liability accompanies a +copy of the Program in return for a fee. +</p> +</li></ol> + +<a name="SEC86"></a> +<h2 class="heading"> END OF TERMS AND CONDITIONS </h2> + +<a name="SEC87"></a> +<h2 class="heading"> How to Apply These Terms to Your New Programs </h2> + +<p>If you develop a new program, and you want it to be of the greatest +possible use to the public, the best way to achieve this is to make it +free software which everyone can redistribute and change under these +terms. +</p> +<p>To do so, attach the following notices to the program. It is safest +to attach them to the start of each source file to most effectively +state the exclusion of warranty; and each file should have at least +the “copyright” line and a pointer to where the full notice is found. +</p> +<table><tr><td> </td><td><pre class="smallexample"><var>one line to give the program's name and a brief idea of what it does.</var> +Copyright (C) <var>year</var> <var>name of author</var> + +This program is free software: you can redistribute it and/or modify +it under the terms of the GNU General Public License as published by +the Free Software Foundation, either version 3 of the License, or (at +your option) any later version. + +This program is distributed in the hope that it will be useful, but +WITHOUT ANY WARRANTY; without even the implied warranty of +MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU +General Public License for more details. + +You should have received a copy of the GNU General Public License +along with this program. If not, see <a href="http://www.gnu.org/licenses/">http://www.gnu.org/licenses/</a>. +</pre></td></tr></table> + +<p>Also add information on how to contact you by electronic and paper mail. +</p> +<p>If the program does terminal interaction, make it output a short +notice like this when it starts in an interactive mode: +</p> +<table><tr><td> </td><td><pre class="smallexample"><var>program</var> Copyright (C) <var>year</var> <var>name of author</var> +This program comes with ABSOLUTELY NO WARRANTY; for details type ‘<samp>show w</samp>’. +This is free software, and you are welcome to redistribute it +under certain conditions; type ‘<samp>show c</samp>’ for details. +</pre></td></tr></table> + +<p>The hypothetical commands ‘<samp>show w</samp>’ and ‘<samp>show c</samp>’ should show +the appropriate parts of the General Public License. Of course, your +program's commands might be different; for a GUI interface, you would +use an “about box”. +</p> +<p>You should also get your employer (if you work as a programmer) or school, +if any, to sign a “copyright disclaimer” for the program, if necessary. +For more information on this, and how to apply and follow the GNU GPL, see +<a href="http://www.gnu.org/licenses/">http://www.gnu.org/licenses/</a>. +</p> +<p>The GNU General Public License does not permit incorporating your +program into proprietary programs. If your program is a subroutine +library, you may consider it more useful to permit linking proprietary +applications with the library. If this is what you want to do, use +the GNU Lesser General Public License instead of this License. But +first, please read <a href="http://www.gnu.org/philosophy/why-not-lgpl.html">http://www.gnu.org/philosophy/why-not-lgpl.html</a>. + +</p><hr size="6"> +<a name="GNU-LGPL"></a> +<a name="SEC88"></a> +<h2 class="appendixsec"> <a href="libunistring.html#TOC84">B.2 GNU LESSER GENERAL PUBLIC LICENSE</a> </h2> +<p align="center"> Version 3, 29 June 2007 +</p> + +<table><tr><td> </td><td><pre class="display">Copyright © 2007 Free Software Foundation, Inc. <a href="http://fsf.org/">http://fsf.org/</a> + +Everyone is permitted to copy and distribute verbatim copies of this +license document, but changing it is not allowed. +</pre></td></tr></table> + +<p>This version of the GNU Lesser General Public License incorporates +the terms and conditions of version 3 of the GNU General Public +License, supplemented by the additional permissions listed below. +</p> +<ol> +<li> Additional Definitions. + +<p>As used herein, “this License” refers to version 3 of the GNU Lesser +General Public License, and the “GNU GPL” refers to version 3 of the GNU +General Public License. +</p> +<p>“The Library” refers to a covered work governed by this License, +other than an Application or a Combined Work as defined below. +</p> +<p>An “Application” is any work that makes use of an interface provided +by the Library, but which is not otherwise based on the Library. +Defining a subclass of a class defined by the Library is deemed a mode +of using an interface provided by the Library. +</p> +<p>A “Combined Work” is a work produced by combining or linking an +Application with the Library. The particular version of the Library +with which the Combined Work was made is also called the “Linked +Version”. +</p> +<p>The “Minimal Corresponding Source” for a Combined Work means the +Corresponding Source for the Combined Work, excluding any source code +for portions of the Combined Work that, considered in isolation, are +based on the Application, and not on the Linked Version. +</p> +<p>The “Corresponding Application Code” for a Combined Work means the +object code and/or source code for the Application, including any data +and utility programs needed for reproducing the Combined Work from the +Application, but excluding the System Libraries of the Combined Work. +</p> +</li><li> Exception to Section 3 of the GNU GPL. + +<p>You may convey a covered work under sections 3 and 4 of this License +without being bound by section 3 of the GNU GPL. +</p> +</li><li> Conveying Modified Versions. + +<p>If you modify a copy of the Library, and, in your modifications, a +facility refers to a function or data to be supplied by an Application +that uses the facility (other than as an argument passed when the +facility is invoked), then you may convey a copy of the modified +version: +</p> +<ol> +<li> +under this License, provided that you make a good faith effort to +ensure that, in the event an Application does not supply the +function or data, the facility still operates, and performs +whatever part of its purpose remains meaningful, or + +</li><li> +under the GNU GPL, with none of the additional permissions of +this License applicable to that copy. +</li></ol> + +</li><li> Object Code Incorporating Material from Library Header Files. + +<p>The object code form of an Application may incorporate material from +a header file that is part of the Library. You may convey such object +code under terms of your choice, provided that, if the incorporated +material is not limited to numerical parameters, data structure +layouts and accessors, or small macros, inline functions and templates +(ten or fewer lines in length), you do both of the following: +</p> +<ol> +<li> +Give prominent notice with each copy of the object code that the +Library is used in it and that the Library and its use are +covered by this License. +</li><li> +Accompany the object code with a copy of the GNU GPL and this license +document. +</li></ol> + +</li><li> Combined Works. + +<p>You may convey a Combined Work under terms of your choice that, +taken together, effectively do not restrict modification of the +portions of the Library contained in the Combined Work and reverse +engineering for debugging such modifications, if you also do each of +the following: +</p> +<ol> +<li> +Give prominent notice with each copy of the Combined Work that +the Library is used in it and that the Library and its use are +covered by this License. +</li><li> +Accompany the Combined Work with a copy of the GNU GPL and this license +document. +</li><li> +For a Combined Work that displays copyright notices during +execution, include the copyright notice for the Library among +these notices, as well as a reference directing the user to the +copies of the GNU GPL and this license document. +</li><li> +Do one of the following: + +<ol> +<li> +Convey the Minimal Corresponding Source under the terms of this +License, and the Corresponding Application Code in a form +suitable for, and under terms that permit, the user to +recombine or relink the Application with a modified version of +the Linked Version to produce a modified Combined Work, in the +manner specified by section 6 of the GNU GPL for conveying +Corresponding Source. +</li><li> +Use a suitable shared library mechanism for linking with the +Library. A suitable mechanism is one that (a) uses at run time +a copy of the Library already present on the user's computer +system, and (b) will operate properly with a modified version +of the Library that is interface-compatible with the Linked +Version. +</li></ol> + +</li><li> +Provide Installation Information, but only if you would otherwise +be required to provide such information under section 6 of the +GNU GPL, and only to the extent that such information is +necessary to install and execute a modified version of the +Combined Work produced by recombining or relinking the +Application with a modified version of the Linked Version. (If +you use option 4d0, the Installation Information must accompany +the Minimal Corresponding Source and Corresponding Application +Code. If you use option 4d1, you must provide the Installation +Information in the manner specified by section 6 of the GNU GPL +for conveying Corresponding Source.) +</li></ol> + +</li><li> Combined Libraries. + +<p>You may place library facilities that are a work based on the +Library side by side in a single library together with other library +facilities that are not Applications and are not covered by this +License, and convey such a combined library under terms of your +choice, if you do both of the following: +</p> +<ol> +<li> +Accompany the combined library with a copy of the same work based +on the Library, uncombined with any other library facilities, +conveyed under the terms of this License. +</li><li> +Give prominent notice with the combined library that part of it +is a work based on the Library, and explaining where to find the +accompanying uncombined form of the same work. +</li></ol> + +</li><li> Revised Versions of the GNU Lesser General Public License. + +<p>The Free Software Foundation may publish revised and/or new versions +of the GNU Lesser General Public License from time to time. Such new +versions will be similar in spirit to the present version, but may +differ in detail to address new problems or concerns. +</p> +<p>Each version is given a distinguishing version number. If the +Library as you received it specifies that a certain numbered version +of the GNU Lesser General Public License “or any later version” +applies to it, you have the option of following the terms and +conditions either of that published version or of any later version +published by the Free Software Foundation. If the Library as you +received it does not specify a version number of the GNU Lesser +General Public License, you may choose any version of the GNU Lesser +General Public License ever published by the Free Software Foundation. +</p> +<p>If the Library as you received it specifies that a proxy can decide +whether future versions of the GNU Lesser General Public License shall +apply, that proxy's public statement of acceptance of any version is +permanent authorization for you to choose that version for the +Library. +</p> +</li></ol> + +<hr size="6"> +<a name="GNU-FDL"></a> +<a name="SEC89"></a> +<h2 class="appendixsec"> <a href="libunistring.html#TOC85">B.3 GNU Free Documentation License</a> </h2> +<p align="center"> Version 1.3, 3 November 2008 +</p> + +<table><tr><td> </td><td><pre class="display">Copyright © 2000, 2001, 2002, 2007, 2008 Free Software Foundation, Inc. +<a href="http://fsf.org/">http://fsf.org/</a> + +Everyone is permitted to copy and distribute verbatim copies +of this license document, but changing it is not allowed. +</pre></td></tr></table> + +<ol> +<li> +PREAMBLE + +<p>The purpose of this License is to make a manual, textbook, or other +functional and useful document <em>free</em> in the sense of freedom: to +assure everyone the effective freedom to copy and redistribute it, +with or without modifying it, either commercially or noncommercially. +Secondarily, this License preserves for the author and publisher a way +to get credit for their work, while not being considered responsible +for modifications made by others. +</p> +<p>This License is a kind of “copyleft”, which means that derivative +works of the document must themselves be free in the same sense. It +complements the GNU General Public License, which is a copyleft +license designed for free software. +</p> +<p>We have designed this License in order to use it for manuals for free +software, because free software needs free documentation: a free +program should come with manuals providing the same freedoms that the +software does. But this License is not limited to software manuals; +it can be used for any textual work, regardless of subject matter or +whether it is published as a printed book. We recommend this License +principally for works whose purpose is instruction or reference. +</p> +</li><li> +APPLICABILITY AND DEFINITIONS + +<p>This License applies to any manual or other work, in any medium, that +contains a notice placed by the copyright holder saying it can be +distributed under the terms of this License. Such a notice grants a +world-wide, royalty-free license, unlimited in duration, to use that +work under the conditions stated herein. The “Document”, below, +refers to any such manual or work. Any member of the public is a +licensee, and is addressed as “you”. You accept the license if you +copy, modify or distribute the work in a way requiring permission +under copyright law. +</p> +<p>A “Modified Version” of the Document means any work containing the +Document or a portion of it, either copied verbatim, or with +modifications and/or translated into another language. +</p> +<p>A “Secondary Section” is a named appendix or a front-matter section +of the Document that deals exclusively with the relationship of the +publishers or authors of the Document to the Document's overall +subject (or to related matters) and contains nothing that could fall +directly within that overall subject. (Thus, if the Document is in +part a textbook of mathematics, a Secondary Section may not explain +any mathematics.) The relationship could be a matter of historical +connection with the subject or with related matters, or of legal, +commercial, philosophical, ethical or political position regarding +them. +</p> +<p>The “Invariant Sections” are certain Secondary Sections whose titles +are designated, as being those of Invariant Sections, in the notice +that says that the Document is released under this License. If a +section does not fit the above definition of Secondary then it is not +allowed to be designated as Invariant. The Document may contain zero +Invariant Sections. If the Document does not identify any Invariant +Sections then there are none. +</p> +<p>The “Cover Texts” are certain short passages of text that are listed, +as Front-Cover Texts or Back-Cover Texts, in the notice that says that +the Document is released under this License. A Front-Cover Text may +be at most 5 words, and a Back-Cover Text may be at most 25 words. +</p> +<p>A “Transparent” copy of the Document means a machine-readable copy, +represented in a format whose specification is available to the +general public, that is suitable for revising the document +straightforwardly with generic text editors or (for images composed of +pixels) generic paint programs or (for drawings) some widely available +drawing editor, and that is suitable for input to text formatters or +for automatic translation to a variety of formats suitable for input +to text formatters. A copy made in an otherwise Transparent file +format whose markup, or absence of markup, has been arranged to thwart +or discourage subsequent modification by readers is not Transparent. +An image format is not Transparent if used for any substantial amount +of text. A copy that is not “Transparent” is called “Opaque”. +</p> +<p>Examples of suitable formats for Transparent copies include plain +<small>ASCII</small> without markup, Texinfo input format, LaTeX input +format, <acronym>SGML</acronym> or <acronym>XML</acronym> using a publicly available +<acronym>DTD</acronym>, and standard-conforming simple <acronym>HTML</acronym>, +PostScript or <acronym>PDF</acronym> designed for human modification. Examples +of transparent image formats include <acronym>PNG</acronym>, <acronym>XCF</acronym> and +<acronym>JPG</acronym>. Opaque formats include proprietary formats that can be +read and edited only by proprietary word processors, <acronym>SGML</acronym> or +<acronym>XML</acronym> for which the <acronym>DTD</acronym> and/or processing tools are +not generally available, and the machine-generated <acronym>HTML</acronym>, +PostScript or <acronym>PDF</acronym> produced by some word processors for +output purposes only. +</p> +<p>The “Title Page” means, for a printed book, the title page itself, +plus such following pages as are needed to hold, legibly, the material +this License requires to appear in the title page. For works in +formats which do not have any title page as such, “Title Page” means +the text near the most prominent appearance of the work's title, +preceding the beginning of the body of the text. +</p> +<p>The “publisher” means any person or entity that distributes copies +of the Document to the public. +</p> +<p>A section “Entitled XYZ” means a named subunit of the Document whose +title either is precisely XYZ or contains XYZ in parentheses following +text that translates XYZ in another language. (Here XYZ stands for a +specific section name mentioned below, such as “Acknowledgements”, +“Dedications”, “Endorsements”, or “History”.) To “Preserve the Title” +of such a section when you modify the Document means that it remains a +section “Entitled XYZ” according to this definition. +</p> +<p>The Document may include Warranty Disclaimers next to the notice which +states that this License applies to the Document. These Warranty +Disclaimers are considered to be included by reference in this +License, but only as regards disclaiming warranties: any other +implication that these Warranty Disclaimers may have is void and has +no effect on the meaning of this License. +</p> +</li><li> +VERBATIM COPYING + +<p>You may copy and distribute the Document in any medium, either +commercially or noncommercially, provided that this License, the +copyright notices, and the license notice saying this License applies +to the Document are reproduced in all copies, and that you add no other +conditions whatsoever to those of this License. You may not use +technical measures to obstruct or control the reading or further +copying of the copies you make or distribute. However, you may accept +compensation in exchange for copies. If you distribute a large enough +number of copies you must also follow the conditions in section 3. +</p> +<p>You may also lend copies, under the same conditions stated above, and +you may publicly display copies. +</p> +</li><li> +COPYING IN QUANTITY + +<p>If you publish printed copies (or copies in media that commonly have +printed covers) of the Document, numbering more than 100, and the +Document's license notice requires Cover Texts, you must enclose the +copies in covers that carry, clearly and legibly, all these Cover +Texts: Front-Cover Texts on the front cover, and Back-Cover Texts on +the back cover. Both covers must also clearly and legibly identify +you as the publisher of these copies. The front cover must present +the full title with all words of the title equally prominent and +visible. You may add other material on the covers in addition. +Copying with changes limited to the covers, as long as they preserve +the title of the Document and satisfy these conditions, can be treated +as verbatim copying in other respects. +</p> +<p>If the required texts for either cover are too voluminous to fit +legibly, you should put the first ones listed (as many as fit +reasonably) on the actual cover, and continue the rest onto adjacent +pages. +</p> +<p>If you publish or distribute Opaque copies of the Document numbering +more than 100, you must either include a machine-readable Transparent +copy along with each Opaque copy, or state in or with each Opaque copy +a computer-network location from which the general network-using +public has access to download using public-standard network protocols +a complete Transparent copy of the Document, free of added material. +If you use the latter option, you must take reasonably prudent steps, +when you begin distribution of Opaque copies in quantity, to ensure +that this Transparent copy will remain thus accessible at the stated +location until at least one year after the last time you distribute an +Opaque copy (directly or through your agents or retailers) of that +edition to the public. +</p> +<p>It is requested, but not required, that you contact the authors of the +Document well before redistributing any large number of copies, to give +them a chance to provide you with an updated version of the Document. +</p> +</li><li> +MODIFICATIONS + +<p>You may copy and distribute a Modified Version of the Document under +the conditions of sections 2 and 3 above, provided that you release +the Modified Version under precisely this License, with the Modified +Version filling the role of the Document, thus licensing distribution +and modification of the Modified Version to whoever possesses a copy +of it. In addition, you must do these things in the Modified Version: +</p> +<ol> +<li> +Use in the Title Page (and on the covers, if any) a title distinct +from that of the Document, and from those of previous versions +(which should, if there were any, be listed in the History section +of the Document). You may use the same title as a previous version +if the original publisher of that version gives permission. + +</li><li> +List on the Title Page, as authors, one or more persons or entities +responsible for authorship of the modifications in the Modified +Version, together with at least five of the principal authors of the +Document (all of its principal authors, if it has fewer than five), +unless they release you from this requirement. + +</li><li> +State on the Title page the name of the publisher of the +Modified Version, as the publisher. + +</li><li> +Preserve all the copyright notices of the Document. + +</li><li> +Add an appropriate copyright notice for your modifications +adjacent to the other copyright notices. + +</li><li> +Include, immediately after the copyright notices, a license notice +giving the public permission to use the Modified Version under the +terms of this License, in the form shown in the Addendum below. + +</li><li> +Preserve in that license notice the full lists of Invariant Sections +and required Cover Texts given in the Document's license notice. + +</li><li> +Include an unaltered copy of this License. + +</li><li> +Preserve the section Entitled “History”, Preserve its Title, and add +to it an item stating at least the title, year, new authors, and +publisher of the Modified Version as given on the Title Page. If +there is no section Entitled “History” in the Document, create one +stating the title, year, authors, and publisher of the Document as +given on its Title Page, then add an item describing the Modified +Version as stated in the previous sentence. + +</li><li> +Preserve the network location, if any, given in the Document for +public access to a Transparent copy of the Document, and likewise +the network locations given in the Document for previous versions +it was based on. These may be placed in the “History” section. +You may omit a network location for a work that was published at +least four years before the Document itself, or if the original +publisher of the version it refers to gives permission. + +</li><li> +For any section Entitled “Acknowledgements” or “Dedications”, Preserve +the Title of the section, and preserve in the section all the +substance and tone of each of the contributor acknowledgements and/or +dedications given therein. + +</li><li> +Preserve all the Invariant Sections of the Document, +unaltered in their text and in their titles. Section numbers +or the equivalent are not considered part of the section titles. + +</li><li> +Delete any section Entitled “Endorsements”. Such a section +may not be included in the Modified Version. + +</li><li> +Do not retitle any existing section to be Entitled “Endorsements” or +to conflict in title with any Invariant Section. + +</li><li> +Preserve any Warranty Disclaimers. +</li></ol> + +<p>If the Modified Version includes new front-matter sections or +appendices that qualify as Secondary Sections and contain no material +copied from the Document, you may at your option designate some or all +of these sections as invariant. To do this, add their titles to the +list of Invariant Sections in the Modified Version's license notice. +These titles must be distinct from any other section titles. +</p> +<p>You may add a section Entitled “Endorsements”, provided it contains +nothing but endorsements of your Modified Version by various +parties—for example, statements of peer review or that the text has +been approved by an organization as the authoritative definition of a +standard. +</p> +<p>You may add a passage of up to five words as a Front-Cover Text, and a +passage of up to 25 words as a Back-Cover Text, to the end of the list +of Cover Texts in the Modified Version. Only one passage of +Front-Cover Text and one of Back-Cover Text may be added by (or +through arrangements made by) any one entity. If the Document already +includes a cover text for the same cover, previously added by you or +by arrangement made by the same entity you are acting on behalf of, +you may not add another; but you may replace the old one, on explicit +permission from the previous publisher that added the old one. +</p> +<p>The author(s) and publisher(s) of the Document do not by this License +give permission to use their names for publicity for or to assert or +imply endorsement of any Modified Version. +</p> +</li><li> +COMBINING DOCUMENTS + +<p>You may combine the Document with other documents released under this +License, under the terms defined in section 4 above for modified +versions, provided that you include in the combination all of the +Invariant Sections of all of the original documents, unmodified, and +list them all as Invariant Sections of your combined work in its +license notice, and that you preserve all their Warranty Disclaimers. +</p> +<p>The combined work need only contain one copy of this License, and +multiple identical Invariant Sections may be replaced with a single +copy. If there are multiple Invariant Sections with the same name but +different contents, make the title of each such section unique by +adding at the end of it, in parentheses, the name of the original +author or publisher of that section if known, or else a unique number. +Make the same adjustment to the section titles in the list of +Invariant Sections in the license notice of the combined work. +</p> +<p>In the combination, you must combine any sections Entitled “History” +in the various original documents, forming one section Entitled +“History”; likewise combine any sections Entitled “Acknowledgements”, +and any sections Entitled “Dedications”. You must delete all +sections Entitled “Endorsements.” +</p> +</li><li> +COLLECTIONS OF DOCUMENTS + +<p>You may make a collection consisting of the Document and other documents +released under this License, and replace the individual copies of this +License in the various documents with a single copy that is included in +the collection, provided that you follow the rules of this License for +verbatim copying of each of the documents in all other respects. +</p> +<p>You may extract a single document from such a collection, and distribute +it individually under this License, provided you insert a copy of this +License into the extracted document, and follow this License in all +other respects regarding verbatim copying of that document. +</p> +</li><li> +AGGREGATION WITH INDEPENDENT WORKS + +<p>A compilation of the Document or its derivatives with other separate +and independent documents or works, in or on a volume of a storage or +distribution medium, is called an “aggregate” if the copyright +resulting from the compilation is not used to limit the legal rights +of the compilation's users beyond what the individual works permit. +When the Document is included in an aggregate, this License does not +apply to the other works in the aggregate which are not themselves +derivative works of the Document. +</p> +<p>If the Cover Text requirement of section 3 is applicable to these +copies of the Document, then if the Document is less than one half of +the entire aggregate, the Document's Cover Texts may be placed on +covers that bracket the Document within the aggregate, or the +electronic equivalent of covers if the Document is in electronic form. +Otherwise they must appear on printed covers that bracket the whole +aggregate. +</p> +</li><li> +TRANSLATION + +<p>Translation is considered a kind of modification, so you may +distribute translations of the Document under the terms of section 4. +Replacing Invariant Sections with translations requires special +permission from their copyright holders, but you may include +translations of some or all Invariant Sections in addition to the +original versions of these Invariant Sections. You may include a +translation of this License, and all the license notices in the +Document, and any Warranty Disclaimers, provided that you also include +the original English version of this License and the original versions +of those notices and disclaimers. In case of a disagreement between +the translation and the original version of this License or a notice +or disclaimer, the original version will prevail. +</p> +<p>If a section in the Document is Entitled “Acknowledgements”, +“Dedications”, or “History”, the requirement (section 4) to Preserve +its Title (section 1) will typically require changing the actual +title. +</p> +</li><li> +TERMINATION + +<p>You may not copy, modify, sublicense, or distribute the Document +except as expressly provided under this License. Any attempt +otherwise to copy, modify, sublicense, or distribute it is void, and +will automatically terminate your rights under this License. +</p> +<p>However, if you cease all violation of this License, then your license +from a particular copyright holder is reinstated (a) provisionally, +unless and until the copyright holder explicitly and finally +terminates your license, and (b) permanently, if the copyright holder +fails to notify you of the violation by some reasonable means prior to +60 days after the cessation. +</p> +<p>Moreover, your license from a particular copyright holder is +reinstated permanently if the copyright holder notifies you of the +violation by some reasonable means, this is the first time you have +received notice of violation of this License (for any work) from that +copyright holder, and you cure the violation prior to 30 days after +your receipt of the notice. +</p> +<p>Termination of your rights under this section does not terminate the +licenses of parties who have received copies or rights from you under +this License. If your rights have been terminated and not permanently +reinstated, receipt of a copy of some or all of the same material does +not give you any rights to use it. +</p> +</li><li> +FUTURE REVISIONS OF THIS LICENSE + +<p>The Free Software Foundation may publish new, revised versions +of the GNU Free Documentation License from time to time. Such new +versions will be similar in spirit to the present version, but may +differ in detail to address new problems or concerns. See +<a href="http://www.gnu.org/copyleft/">http://www.gnu.org/copyleft/</a>. +</p> +<p>Each version of the License is given a distinguishing version number. +If the Document specifies that a particular numbered version of this +License “or any later version” applies to it, you have the option of +following the terms and conditions either of that specified version or +of any later version that has been published (not as a draft) by the +Free Software Foundation. If the Document does not specify a version +number of this License, you may choose any version ever published (not +as a draft) by the Free Software Foundation. If the Document +specifies that a proxy can decide which future versions of this +License can be used, that proxy's public statement of acceptance of a +version permanently authorizes you to choose that version for the +Document. +</p> +</li><li> +RELICENSING + +<p>“Massive Multiauthor Collaboration Site” (or “MMC Site”) means any +World Wide Web server that publishes copyrightable works and also +provides prominent facilities for anybody to edit those works. A +public wiki that anybody can edit is an example of such a server. A +“Massive Multiauthor Collaboration” (or “MMC”) contained in the +site means any set of copyrightable works thus published on the MMC +site. +</p> +<p>“CC-BY-SA” means the Creative Commons Attribution-Share Alike 3.0 +license published by Creative Commons Corporation, a not-for-profit +corporation with a principal place of business in San Francisco, +California, as well as future copyleft versions of that license +published by that same organization. +</p> +<p>“Incorporate” means to publish or republish a Document, in whole or +in part, as part of another Document. +</p> +<p>An MMC is “eligible for relicensing” if it is licensed under this +License, and if all works that were first published under this License +somewhere other than this MMC, and subsequently incorporated in whole +or in part into the MMC, (1) had no cover texts or invariant sections, +and (2) were thus incorporated prior to November 1, 2008. +</p> +<p>The operator of an MMC Site may republish an MMC contained in the site +under CC-BY-SA on the same site at any time before August 1, 2009, +provided the MMC is eligible for relicensing. +</p> +</li></ol> + + +<a name="SEC90"></a> +<h2 class="heading"> ADDENDUM: How to use this License for your documents </h2> + +<p>To use this License in a document you have written, include a copy of +the License in the document and put the following copyright and +license notices just after the title page: +</p> +<table><tr><td> </td><td><pre class="smallexample"> Copyright (C) <var>year</var> <var>your name</var>. + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU Free Documentation License, Version 1.3 + or any later version published by the Free Software Foundation; + with no Invariant Sections, no Front-Cover Texts, and no Back-Cover + Texts. A copy of the license is included in the section entitled ``GNU + Free Documentation License''. +</pre></td></tr></table> + +<p>If you have Invariant Sections, Front-Cover Texts and Back-Cover Texts, +replace the “with…Texts.” line with this: +</p> +<table><tr><td> </td><td><pre class="smallexample"> with the Invariant Sections being <var>list their titles</var>, with + the Front-Cover Texts being <var>list</var>, and with the Back-Cover Texts + being <var>list</var>. +</pre></td></tr></table> + +<p>If you have Invariant Sections without Cover Texts, or some other +combination of the three, merge those two alternatives to suit the +situation. +</p> +<p>If your document contains nontrivial examples of program code, we +recommend releasing these examples in parallel under your choice of +free software license, such as the GNU General Public License, +to permit their use in free software. +</p> + + <hr size="6"> <table cellpadding="1" cellspacing="1" border="0"> -<tr><td valign="middle" align="left">[<a href="libunistring_18.html#SEC68" title="Beginning of this chapter or previous chapter"> << </a>]</td> -<td valign="middle" align="left">[<a href="libunistring_20.html#INDEX0" title="Next chapter"> >> </a>]</td> +<tr><td valign="middle" align="left">[<a href="#SEC82" title="Beginning of this chapter or previous chapter"> << </a>]</td> +<td valign="middle" align="left">[<a href="libunistring_20.html#SEC91" title="Next chapter"> >> </a>]</td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> @@ -803,12 +1530,12 @@ ul.toc {list-style: none} <td valign="middle" align="left"> </td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Top" title="Cover (top) of document">Top</a>]</td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Contents" title="Table of contents">Contents</a>]</td> -<td valign="middle" align="left">[<a href="#SEC77" title="Index">Index</a>]</td> +<td valign="middle" align="left">[<a href="libunistring_20.html#SEC91" title="Index">Index</a>]</td> <td valign="middle" align="left">[<a href="libunistring_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <p> <font size="-1"> - This document was generated by <em>Daiki Ueno</em> on <em>November, 30 2017</em> using <a href="http://www.nongnu.org/texi2html/"><em>texi2html 1.78a</em></a>. + This document was generated by <em>Daiki Ueno</em> on <em>May, 25 2018</em> using <a href="http://www.nongnu.org/texi2html/"><em>texi2html 1.78a</em></a>. </font> <br> diff --git a/doc/libunistring_2.html b/doc/libunistring_2.html index e02999b9..46c162dd 100644 --- a/doc/libunistring_2.html +++ b/doc/libunistring_2.html @@ -1,6 +1,6 @@ <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html401/loose.dtd"> <html> -<!-- Created on November, 30 2017 by texi2html 1.78a --> +<!-- Created on May, 25 2018 by texi2html 1.78a --> <!-- Written by: Lionel Cons <Lionel.Cons@cern.ch> (original author) Karl Berry <karl@freefriends.org> @@ -43,7 +43,7 @@ ul.toc {list-style: none} <table cellpadding="1" cellspacing="1" border="0"> <tr><td valign="middle" align="left">[<a href="libunistring_1.html#SEC1" title="Beginning of this chapter or previous chapter"> << </a>]</td> -<td valign="middle" align="left">[<a href="libunistring_3.html#SEC10" title="Next chapter"> >> </a>]</td> +<td valign="middle" align="left">[<a href="libunistring_3.html#SEC9" title="Next chapter"> >> </a>]</td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> @@ -51,14 +51,14 @@ ul.toc {list-style: none} <td valign="middle" align="left"> </td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Top" title="Cover (top) of document">Top</a>]</td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Contents" title="Table of contents">Contents</a>]</td> -<td valign="middle" align="left">[<a href="libunistring_19.html#SEC77" title="Index">Index</a>]</td> +<td valign="middle" align="left">[<a href="libunistring_20.html#SEC91" title="Index">Index</a>]</td> <td valign="middle" align="left">[<a href="libunistring_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <hr size="2"> <a name="Conventions"></a> -<a name="SEC9"></a> -<h1 class="chapter"> <a href="libunistring.html#TOC9">2. Conventions</a> </h1> +<a name="SEC8"></a> +<h1 class="chapter"> <a href="libunistring.html#TOC8">2. Conventions</a> </h1> <p>This chapter explains conventions valid throughout the libunistring library. </p> @@ -119,7 +119,7 @@ NULL is returned and <code>errno</code> is set. <hr size="6"> <table cellpadding="1" cellspacing="1" border="0"> <tr><td valign="middle" align="left">[<a href="libunistring_1.html#SEC1" title="Beginning of this chapter or previous chapter"> << </a>]</td> -<td valign="middle" align="left">[<a href="libunistring_3.html#SEC10" title="Next chapter"> >> </a>]</td> +<td valign="middle" align="left">[<a href="libunistring_3.html#SEC9" title="Next chapter"> >> </a>]</td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> @@ -127,12 +127,12 @@ NULL is returned and <code>errno</code> is set. <td valign="middle" align="left"> </td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Top" title="Cover (top) of document">Top</a>]</td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Contents" title="Table of contents">Contents</a>]</td> -<td valign="middle" align="left">[<a href="libunistring_19.html#SEC77" title="Index">Index</a>]</td> +<td valign="middle" align="left">[<a href="libunistring_20.html#SEC91" title="Index">Index</a>]</td> <td valign="middle" align="left">[<a href="libunistring_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <p> <font size="-1"> - This document was generated by <em>Daiki Ueno</em> on <em>November, 30 2017</em> using <a href="http://www.nongnu.org/texi2html/"><em>texi2html 1.78a</em></a>. + This document was generated by <em>Daiki Ueno</em> on <em>May, 25 2018</em> using <a href="http://www.nongnu.org/texi2html/"><em>texi2html 1.78a</em></a>. </font> <br> diff --git a/doc/libunistring_20.html b/doc/libunistring_20.html index eb806aba..6c812272 100644 --- a/doc/libunistring_20.html +++ b/doc/libunistring_20.html @@ -1,6 +1,6 @@ <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html401/loose.dtd"> <html> -<!-- Created on November, 30 2017 by texi2html 1.78a --> +<!-- Created on May, 25 2018 by texi2html 1.78a --> <!-- Written by: Lionel Cons <Lionel.Cons@cern.ch> (original author) Karl Berry <karl@freefriends.org> @@ -11,10 +11,10 @@ Send bugs and suggestions to <texi2html-bug@nongnu.org> --> <head> -<title>GNU libunistring: Index: V – W</title> +<title>GNU libunistring: Index</title> -<meta name="description" content="GNU libunistring: Index: V – W"> -<meta name="keywords" content="GNU libunistring: Index: V – W"> +<meta name="description" content="GNU libunistring: Index"> +<meta name="keywords" content="GNU libunistring: Index"> <meta name="resource-type" content="document"> <meta name="distribution" content="global"> <meta name="Generator" content="texi2html 1.78a"> @@ -42,8 +42,8 @@ ul.toc {list-style: none} <body lang="en" bgcolor="#FFFFFF" text="#000000" link="#0000FF" vlink="#800080" alink="#FF0000"> <table cellpadding="1" cellspacing="1" border="0"> -<tr><td valign="middle" align="left">[<a href="libunistring_19.html#SEC77" title="Beginning of this chapter or previous chapter"> << </a>]</td> -<td valign="middle" align="left">[ >> ]</td> +<tr><td valign="middle" align="left">[<a href="libunistring_19.html#SEC82" title="Beginning of this chapter or previous chapter"> << </a>]</td> +<td valign="middle" align="left">[<a href="libunistring_21.html#INDEX0" title="Next chapter"> >> </a>]</td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> @@ -51,124 +51,751 @@ ul.toc {list-style: none} <td valign="middle" align="left"> </td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Top" title="Cover (top) of document">Top</a>]</td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Contents" title="Table of contents">Contents</a>]</td> -<td valign="middle" align="left">[<a href="libunistring_19.html#SEC77" title="Index">Index</a>]</td> +<td valign="middle" align="left">[<a href="#SEC91" title="Index">Index</a>]</td> <td valign="middle" align="left">[<a href="libunistring_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <hr size="2"> -<a name="INDEX0"></a> -<h1 class="unnumbered"> Index: V – W </h1> -<table><tr><th valign="top">Jump to: </th><td><a href="libunistring_19.html#SEC77_0" class="summary-letter"><b>A</b></a> +<a name="Index"></a> +<a name="SEC91"></a> +<h1 class="unnumbered"> <a href="libunistring.html#TOC86">Index</a> </h1> + +<table><tr><th valign="top">Jump to: </th><td><a href="#SEC91_0" class="summary-letter"><b>A</b></a> -<a href="libunistring_19.html#SEC77_1" class="summary-letter"><b>B</b></a> +<a href="#SEC91_1" class="summary-letter"><b>B</b></a> -<a href="libunistring_19.html#SEC77_2" class="summary-letter"><b>C</b></a> +<a href="#SEC91_2" class="summary-letter"><b>C</b></a> -<a href="libunistring_19.html#SEC77_3" class="summary-letter"><b>D</b></a> +<a href="#SEC91_3" class="summary-letter"><b>D</b></a> -<a href="libunistring_19.html#SEC77_4" class="summary-letter"><b>E</b></a> +<a href="#SEC91_4" class="summary-letter"><b>E</b></a> -<a href="libunistring_19.html#SEC77_5" class="summary-letter"><b>F</b></a> +<a href="#SEC91_5" class="summary-letter"><b>F</b></a> -<a href="libunistring_19.html#SEC77_6" class="summary-letter"><b>G</b></a> +<a href="#SEC91_6" class="summary-letter"><b>G</b></a> -<a href="libunistring_19.html#SEC77_7" class="summary-letter"><b>H</b></a> +<a href="#SEC91_7" class="summary-letter"><b>H</b></a> -<a href="libunistring_19.html#SEC77_8" class="summary-letter"><b>I</b></a> +<a href="#SEC91_8" class="summary-letter"><b>I</b></a> -<a href="libunistring_19.html#SEC77_9" class="summary-letter"><b>J</b></a> +<a href="#SEC91_9" class="summary-letter"><b>J</b></a> -<a href="libunistring_19.html#SEC77_10" class="summary-letter"><b>L</b></a> +<a href="#SEC91_10" class="summary-letter"><b>L</b></a> -<a href="libunistring_19.html#SEC77_11" class="summary-letter"><b>M</b></a> +<a href="#SEC91_11" class="summary-letter"><b>M</b></a> -<a href="libunistring_19.html#SEC77_12" class="summary-letter"><b>N</b></a> +<a href="#SEC91_12" class="summary-letter"><b>N</b></a> -<a href="libunistring_19.html#SEC77_13" class="summary-letter"><b>O</b></a> +<a href="#SEC91_13" class="summary-letter"><b>O</b></a> -<a href="libunistring_19.html#SEC77_14" class="summary-letter"><b>P</b></a> +<a href="#SEC91_14" class="summary-letter"><b>P</b></a> -<a href="libunistring_19.html#SEC77_15" class="summary-letter"><b>R</b></a> +<a href="#SEC91_15" class="summary-letter"><b>R</b></a> -<a href="libunistring_19.html#SEC77_16" class="summary-letter"><b>S</b></a> +<a href="#SEC91_16" class="summary-letter"><b>S</b></a> -<a href="libunistring_19.html#SEC77_17" class="summary-letter"><b>T</b></a> +<a href="#SEC91_17" class="summary-letter"><b>T</b></a> -<a href="libunistring_19.html#SEC77_18" class="summary-letter"><b>U</b></a> +<a href="#SEC91_18" class="summary-letter"><b>U</b></a> -<a href="#INDEX0_0" class="summary-letter"><b>V</b></a> +<a href="libunistring_21.html#INDEX0_0" class="summary-letter"><b>V</b></a> -<a href="#INDEX0_1" class="summary-letter"><b>W</b></a> +<a href="libunistring_21.html#INDEX0_1" class="summary-letter"><b>W</b></a> </td></tr></table> <table border="0" class="index-cp"> <tr><td></td><th align="left">Index Entry</th><th align="left"> Section</th></tr> <tr><td colspan="3"> <hr></td></tr> -<tr><th><a name="INDEX0_0">V</a></th><td></td><td></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#SEC12">validity</a></td><td valign="top"><a href="libunistring_4.html#SEC12">4.1 Elementary string checks</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_1.html#IDX2">value, of libunistring</a></td><td valign="top"><a href="libunistring_1.html#SEC1">1. Introduction</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC26">value, of Unicode character</a></td><td valign="top"><a href="libunistring_8.html#SEC26">8.4 Decimal digit value</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC27">value, of Unicode character</a></td><td valign="top"><a href="libunistring_8.html#SEC27">8.5 Digit value</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC28">value, of Unicode character</a></td><td valign="top"><a href="libunistring_8.html#SEC28">8.6 Numeric value</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#SEC12">verification</a></td><td valign="top"><a href="libunistring_4.html#SEC12">4.1 Elementary string checks</a></td></tr> -<tr><td colspan="3"> <hr></td></tr> -<tr><th><a name="INDEX0_1">W</a></th><td></td><td></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_1.html#SEC7">wchar_t, type</a></td><td valign="top"><a href="libunistring_1.html#SEC7">1.6 The <code>wchar_t</code> mess</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_4.html#SEC12">well-formed</a></td><td valign="top"><a href="libunistring_4.html#SEC12">4.1 Elementary string checks</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_9.html#SEC40">width</a></td><td valign="top"><a href="libunistring_9.html#SEC40">9. Display width <code><uniwidth.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_11.html#SEC44">word boundaries</a></td><td valign="top"><a href="libunistring_11.html#SEC44">11. Word breaks in strings <code><uniwbrk.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_11.html#SEC44">word breaks</a></td><td valign="top"><a href="libunistring_11.html#SEC44">11. Word breaks in strings <code><uniwbrk.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_12.html#SEC47">wrapping</a></td><td valign="top"><a href="libunistring_12.html#SEC47">12. Line breaking <code><unilbrk.h></code></a></td></tr> +<tr><th><a name="SEC91_0">A</a></th><td></td><td></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_9.html#IDX692">ambiguous width</a></td><td valign="top"><a href="libunistring_9.html#SEC53">9. Display width <code><uniwidth.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC43">Arabic shaping</a></td><td valign="top"><a href="libunistring_8.html#SEC43">8.8 Arabic shaping</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_2.html#IDX14">argument conventions</a></td><td valign="top"><a href="libunistring_2.html#SEC8">2. Conventions</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_16.html#SEC78">autoconf macro</a></td><td valign="top"><a href="libunistring_16.html#SEC78">16.4 Autoconf macro</a></td></tr> +<tr><td colspan="3"> <hr></td></tr> +<tr><th><a name="SEC91_1">B</a></th><td></td><td></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC38">bidi class</a></td><td valign="top"><a href="libunistring_8.html#SEC38">8.3 Bidi class</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC38">bidirectional category</a></td><td valign="top"><a href="libunistring_8.html#SEC38">8.3 Bidi class</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_17.html#SEC80">bidirectional reordering</a></td><td valign="top"><a href="libunistring_17.html#SEC80">17. More advanced functionality</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC50">block</a></td><td valign="top"><a href="libunistring_8.html#SEC50">8.11 Blocks</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_10.html#SEC54">boundaries, between grapheme clusters</a></td><td valign="top"><a href="libunistring_10.html#SEC54">10. Grapheme cluster breaks in strings <code><unigbrk.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_11.html#SEC57">boundaries, between words</a></td><td valign="top"><a href="libunistring_11.html#SEC57">11. Word breaks in strings <code><uniwbrk.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_10.html#SEC54">breaks, grapheme cluster</a></td><td valign="top"><a href="libunistring_10.html#SEC54">10. Grapheme cluster breaks in strings <code><unigbrk.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_12.html#SEC60">breaks, line</a></td><td valign="top"><a href="libunistring_12.html#SEC60">12. Line breaking <code><unilbrk.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_11.html#SEC57">breaks, word</a></td><td valign="top"><a href="libunistring_11.html#SEC57">11. Word breaks in strings <code><uniwbrk.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_16.html#SEC79">bug reports</a></td><td valign="top"><a href="libunistring_16.html#SEC79">16.5 Reporting problems</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_16.html#SEC79">bug tracker</a></td><td valign="top"><a href="libunistring_16.html#SEC79">16.5 Reporting problems</a></td></tr> +<tr><td colspan="3"> <hr></td></tr> +<tr><th><a name="SEC91_2">C</a></th><td></td><td></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_1.html#SEC6">C string functions</a></td><td valign="top"><a href="libunistring_1.html#SEC6">1.5 ‘<samp>char *</samp>’ strings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC51">C, programming language</a></td><td valign="top"><a href="libunistring_8.html#SEC51">8.12 ISO C and Java syntax</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC52">C-like API</a></td><td valign="top"><a href="libunistring_8.html#SEC52">8.13 Classifications like in ISO C</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC37">canonical combining class</a></td><td valign="top"><a href="libunistring_8.html#SEC37">8.2 Canonical combining class</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#SEC72">case detection</a></td><td valign="top"><a href="libunistring_14.html#SEC72">14.5 Case detection</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#SEC69">case mappings</a></td><td valign="top"><a href="libunistring_14.html#SEC69">14.2 Case mappings of strings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX836"><code>casing_prefix_context_t</code></a></td><td valign="top"><a href="libunistring_14.html#SEC70">14.3 Case mappings of substrings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX844"><code>casing_suffix_context_t</code></a></td><td valign="top"><a href="libunistring_14.html#SEC70">14.3 Case mappings of substrings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_1.html#IDX10">char, type</a></td><td valign="top"><a href="libunistring_1.html#SEC6">1.5 ‘<samp>char *</samp>’ strings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_13.html#SEC63">combining, Unicode characters</a></td><td valign="top"><a href="libunistring_13.html#SEC63">13.2 Composition of Unicode characters</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#SEC17">comparing</a></td><td valign="top"><a href="libunistring_4.html#SEC17">4.3.4 Comparing Unicode strings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#SEC25">comparing</a></td><td valign="top"><a href="libunistring_4.html#SEC25">4.5.4 Comparing NUL terminated Unicode strings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#SEC71">comparing, ignoring case</a></td><td valign="top"><a href="libunistring_14.html#SEC71">14.4 Case insensitive comparison</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX871">comparing, ignoring case, with collation rules</a></td><td valign="top"><a href="libunistring_14.html#SEC71">14.4 Case insensitive comparison</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_13.html#SEC65">comparing, ignoring normalization</a></td><td valign="top"><a href="libunistring_13.html#SEC65">13.4 Normalizing comparisons</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#SEC71">comparing, ignoring normalization and case</a></td><td valign="top"><a href="libunistring_14.html#SEC71">14.4 Case insensitive comparison</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX873">comparing, ignoring normalization and case, with collation rules</a></td><td valign="top"><a href="libunistring_14.html#SEC71">14.4 Case insensitive comparison</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX809">comparing, ignoring normalization, with collation rules</a></td><td valign="top"><a href="libunistring_13.html#SEC65">13.4 Normalizing comparisons</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX108">comparing, with collation rules</a></td><td valign="top"><a href="libunistring_4.html#SEC25">4.5.4 Comparing NUL terminated Unicode strings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX872">comparing, with collation rules, ignoring case</a></td><td valign="top"><a href="libunistring_14.html#SEC71">14.4 Case insensitive comparison</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX810">comparing, with collation rules, ignoring normalization</a></td><td valign="top"><a href="libunistring_13.html#SEC65">13.4 Normalizing comparisons</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX874">comparing, with collation rules, ignoring normalization and case</a></td><td valign="top"><a href="libunistring_14.html#SEC71">14.4 Case insensitive comparison</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_16.html#IDX899">compiler options</a></td><td valign="top"><a href="libunistring_16.html#SEC76">16.2 Compiler options</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_13.html#SEC63">composing, Unicode characters</a></td><td valign="top"><a href="libunistring_13.html#SEC63">13.2 Composition of Unicode characters</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#SEC12">converting</a></td><td valign="top"><a href="libunistring_4.html#SEC12">4.2 Elementary string conversions</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_5.html#IDX151">converting</a></td><td valign="top"><a href="libunistring_5.html#SEC30">5. Conversions between Unicode and encodings <code><uniconv.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#SEC16">copying</a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.3.3 Copying Unicode strings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#SEC24">copying</a></td><td valign="top"><a href="libunistring_4.html#SEC24">4.5.3 Copying a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#SEC19">counting</a></td><td valign="top"><a href="libunistring_4.html#SEC19">4.3.6 Counting the characters in a Unicode string</a></td></tr> +<tr><td colspan="3"> <hr></td></tr> +<tr><th><a name="SEC91_3">D</a></th><td></td><td></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_13.html#SEC62">decomposing</a></td><td valign="top"><a href="libunistring_13.html#SEC62">13.1 Decomposition of Unicode characters</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_16.html#SEC75">dependencies</a></td><td valign="top"><a href="libunistring_16.html#SEC75">16.1 Installation</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#SEC72">detecting case</a></td><td valign="top"><a href="libunistring_14.html#SEC72">14.5 Case detection</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#SEC20">duplicating</a></td><td valign="top"><a href="libunistring_4.html#SEC20">4.4 Elementary string functions with memory allocation</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#SEC26">duplicating</a></td><td valign="top"><a href="libunistring_4.html#SEC26">4.5.5 Duplicating a NUL terminated Unicode string</a></td></tr> +<tr><td colspan="3"> <hr></td></tr> +<tr><th><a name="SEC91_4">E</a></th><td></td><td></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_5.html#IDX147"><code>enum iconv_ilseq_handler</code></a></td><td valign="top"><a href="libunistring_5.html#SEC30">5. Conversions between Unicode and encodings <code><uniconv.h></code></a></td></tr> +<tr><td colspan="3"> <hr></td></tr> +<tr><th><a name="SEC91_5">F</a></th><td></td><td></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_19.html#SEC89">FDL, GNU Free Documentation License</a></td><td valign="top"><a href="libunistring_19.html#SEC89">B.3 GNU Free Documentation License</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_6.html#SEC31">formatted output</a></td><td valign="top"><a href="libunistring_6.html#SEC31">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_9.html#IDX695">fullwidth</a></td><td valign="top"><a href="libunistring_9.html#SEC53">9. Display width <code><uniwidth.h></code></a></td></tr> +<tr><td colspan="3"> <hr></td></tr> +<tr><th><a name="SEC91_6">G</a></th><td></td><td></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC34">general category</a></td><td valign="top"><a href="libunistring_8.html#SEC34">8.1 General category</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_16.html#IDX902"><code>gl_LIBUNISTRING</code></a></td><td valign="top"><a href="libunistring_16.html#SEC78">16.4 Autoconf macro</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_19.html#SEC83">GPL, GNU General Public License</a></td><td valign="top"><a href="libunistring_19.html#SEC83">B.1 GNU GENERAL PUBLIC LICENSE</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_10.html#SEC54">grapheme cluster boundaries</a></td><td valign="top"><a href="libunistring_10.html#SEC54">10. Grapheme cluster breaks in strings <code><unigbrk.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_10.html#SEC54">grapheme cluster breaks</a></td><td valign="top"><a href="libunistring_10.html#SEC54">10. Grapheme cluster breaks in strings <code><unigbrk.h></code></a></td></tr> +<tr><td colspan="3"> <hr></td></tr> +<tr><th><a name="SEC91_7">H</a></th><td></td><td></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_9.html#IDX694">halfwidth</a></td><td valign="top"><a href="libunistring_9.html#SEC53">9. Display width <code><uniwidth.h></code></a></td></tr> +<tr><td colspan="3"> <hr></td></tr> +<tr><th><a name="SEC91_8">I</a></th><td></td><td></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC51">identifiers</a></td><td valign="top"><a href="libunistring_8.html#SEC51">8.12 ISO C and Java syntax</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_16.html#IDX898">installation</a></td><td valign="top"><a href="libunistring_16.html#SEC75">16.1 Installation</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_1.html#SEC3">internationalization</a></td><td valign="top"><a href="libunistring_1.html#SEC3">1.2 Unicode and Internationalization</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#SEC14">iterating</a></td><td valign="top"><a href="libunistring_4.html#SEC14">4.3.1 Iterating over a Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX71">iterating</a></td><td valign="top"><a href="libunistring_4.html#SEC22">4.5.1 Iterating over a NUL terminated Unicode string</a></td></tr> +<tr><td colspan="3"> <hr></td></tr> +<tr><th><a name="SEC91_9">J</a></th><td></td><td></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC51">Java, programming language</a></td><td valign="top"><a href="libunistring_8.html#SEC51">8.12 ISO C and Java syntax</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC45">joining group</a></td><td valign="top"><a href="libunistring_8.html#SEC45">8.8.2 Joining group of Arabic characters</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC43">joining of Arabic characters</a></td><td valign="top"><a href="libunistring_8.html#SEC43">8.8 Arabic shaping</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC44">joining type</a></td><td valign="top"><a href="libunistring_8.html#SEC44">8.8.1 Joining type of Arabic characters</a></td></tr> +<tr><td colspan="3"> <hr></td></tr> +<tr><th><a name="SEC91_10">L</a></th><td></td><td></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_19.html#SEC88">LGPL, GNU Lesser General Public License</a></td><td valign="top"><a href="libunistring_19.html#SEC88">B.2 GNU LESSER GENERAL PUBLIC LICENSE</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_19.html#SEC89">License, GNU FDL</a></td><td valign="top"><a href="libunistring_19.html#SEC89">B.3 GNU Free Documentation License</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_19.html#SEC83">License, GNU GPL</a></td><td valign="top"><a href="libunistring_19.html#SEC83">B.1 GNU GENERAL PUBLIC LICENSE</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_19.html#SEC88">License, GNU LGPL</a></td><td valign="top"><a href="libunistring_19.html#SEC88">B.2 GNU LESSER GENERAL PUBLIC LICENSE</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_19.html#SEC82">Licenses</a></td><td valign="top"><a href="libunistring_19.html#SEC82">B. Licenses</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_12.html#SEC60">line breaks</a></td><td valign="top"><a href="libunistring_12.html#SEC60">12. Line breaking <code><unilbrk.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_1.html#SEC4">locale</a></td><td valign="top"><a href="libunistring_1.html#SEC4">1.3 Locale encodings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_1.html#IDX7">locale categories</a></td><td valign="top"><a href="libunistring_1.html#SEC4">1.3 Locale encodings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_1.html#IDX8">locale encoding</a></td><td valign="top"><a href="libunistring_1.html#SEC4">1.3 Locale encodings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_5.html#IDX145">locale encoding</a></td><td valign="top"><a href="libunistring_5.html#SEC30">5. Conversions between Unicode and encodings <code><uniconv.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX825">locale language</a></td><td valign="top"><a href="libunistring_14.html#SEC69">14.2 Case mappings of strings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_1.html#IDX9">locale, multibyte</a></td><td valign="top"><a href="libunistring_1.html#SEC6">1.5 ‘<samp>char *</samp>’ strings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_5.html#IDX146"><code>locale_charset</code></a></td><td valign="top"><a href="libunistring_5.html#SEC30">5. Conversions between Unicode and encodings <code><uniconv.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#SEC69">lowercasing</a></td><td valign="top"><a href="libunistring_14.html#SEC69">14.2 Case mappings of strings</a></td></tr> +<tr><td colspan="3"> <hr></td></tr> +<tr><th><a name="SEC91_11">M</a></th><td></td><td></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_16.html#SEC79">mailing list</a></td><td valign="top"><a href="libunistring_16.html#SEC79">16.5 Reporting problems</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC42">mirroring, of Unicode character</a></td><td valign="top"><a href="libunistring_8.html#SEC42">8.7 Mirrored character</a></td></tr> +<tr><td colspan="3"> <hr></td></tr> +<tr><th><a name="SEC91_12">N</a></th><td></td><td></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_13.html#SEC61">normal forms</a></td><td valign="top"><a href="libunistring_13.html#SEC61">13. Normalization forms (composition and decomposition) <code><uninorm.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_13.html#SEC61">normalizing</a></td><td valign="top"><a href="libunistring_13.html#SEC61">13. Normalization forms (composition and decomposition) <code><uninorm.h></code></a></td></tr> +<tr><td colspan="3"> <hr></td></tr> +<tr><th><a name="SEC91_13">O</a></th><td></td><td></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_6.html#SEC31">output, formatted</a></td><td valign="top"><a href="libunistring_6.html#SEC31">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> +<tr><td colspan="3"> <hr></td></tr> +<tr><th><a name="SEC91_14">P</a></th><td></td><td></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC46">properties, of Unicode character</a></td><td valign="top"><a href="libunistring_8.html#SEC46">8.9 Properties</a></td></tr> +<tr><td colspan="3"> <hr></td></tr> +<tr><th><a name="SEC91_15">R</a></th><td></td><td></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_15.html#SEC73">regular expression</a></td><td valign="top"><a href="libunistring_15.html#SEC73">15. Regular expressions <code><uniregex.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_17.html#IDX903">rendering</a></td><td valign="top"><a href="libunistring_17.html#SEC80">17. More advanced functionality</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_2.html#IDX15">return value conventions</a></td><td valign="top"><a href="libunistring_2.html#SEC8">2. Conventions</a></td></tr> +<tr><td colspan="3"> <hr></td></tr> +<tr><th><a name="SEC91_16">S</a></th><td></td><td></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC49">scripts</a></td><td valign="top"><a href="libunistring_8.html#SEC49">8.10 Scripts</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#SEC18">searching, for a character</a></td><td valign="top"><a href="libunistring_4.html#SEC18">4.3.5 Searching for a character in a Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#SEC27">searching, for a character</a></td><td valign="top"><a href="libunistring_4.html#SEC27">4.5.6 Searching for a character in a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#SEC28">searching, for a substring</a></td><td valign="top"><a href="libunistring_4.html#SEC28">4.5.7 Searching for a substring in a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_13.html#SEC66">stream, normalizing a</a></td><td valign="top"><a href="libunistring_13.html#SEC66">13.5 Normalization of streams of Unicode characters</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX817"><code>struct uninorm_filter</code></a></td><td valign="top"><a href="libunistring_13.html#SEC66">13.5 Normalization of streams of Unicode characters</a></td></tr> +<tr><td colspan="3"> <hr></td></tr> +<tr><th><a name="SEC91_17">T</a></th><td></td><td></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#SEC69">titlecasing</a></td><td valign="top"><a href="libunistring_14.html#SEC69">14.2 Case mappings of strings</a></td></tr> +<tr><td colspan="3"> <hr></td></tr> +<tr><th><a name="SEC91_18">U</a></th><td></td><td></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX197"><code>u16_asnprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC31">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX196"><code>u16_asprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC31">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX868"><code>u16_casecmp</code></a></td><td valign="top"><a href="libunistring_14.html#SEC71">14.4 Case insensitive comparison</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX880"><code>u16_casecoll</code></a></td><td valign="top"><a href="libunistring_14.html#SEC71">14.4 Case insensitive comparison</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX862"><code>u16_casefold</code></a></td><td valign="top"><a href="libunistring_14.html#SEC71">14.4 Case insensitive comparison</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX876"><code>u16_casexfrm</code></a></td><td valign="top"><a href="libunistring_14.html#SEC71">14.4 Case insensitive comparison</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX839"><code>u16_casing_prefix_context</code></a></td><td valign="top"><a href="libunistring_14.html#SEC70">14.3 Case mappings of substrings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX842"><code>u16_casing_prefixes_context</code></a></td><td valign="top"><a href="libunistring_14.html#SEC70">14.3 Case mappings of substrings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX847"><code>u16_casing_suffix_context</code></a></td><td valign="top"><a href="libunistring_14.html#SEC70">14.3 Case mappings of substrings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX850"><code>u16_casing_suffixes_context</code></a></td><td valign="top"><a href="libunistring_14.html#SEC70">14.3 Case mappings of substrings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX21"><code>u16_check</code></a></td><td valign="top"><a href="libunistring_4.html#SEC11">4.1 Elementary string checks</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX60"><code>u16_chr</code></a></td><td valign="top"><a href="libunistring_4.html#SEC18">4.3.5 Searching for a character in a Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX54"><code>u16_cmp</code></a></td><td valign="top"><a href="libunistring_4.html#SEC17">4.3.4 Comparing Unicode strings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX57"><code>u16_cmp2</code></a></td><td valign="top"><a href="libunistring_4.html#SEC17">4.3.4 Comparing Unicode strings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_5.html#IDX153"><code>u16_conv_from_encoding</code></a></td><td valign="top"><a href="libunistring_5.html#SEC30">5. Conversions between Unicode and encodings <code><uniconv.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_5.html#IDX156"><code>u16_conv_to_encoding</code></a></td><td valign="top"><a href="libunistring_5.html#SEC30">5. Conversions between Unicode and encodings <code><uniconv.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX45"><code>u16_cpy</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.3.3 Copying Unicode strings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX66"><code>u16_cpy_alloc</code></a></td><td valign="top"><a href="libunistring_4.html#SEC20">4.4 Elementary string functions with memory allocation</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX865"><code>u16_ct_casefold</code></a></td><td valign="top"><a href="libunistring_14.html#SEC71">14.4 Case insensitive comparison</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX856"><code>u16_ct_tolower</code></a></td><td valign="top"><a href="libunistring_14.html#SEC70">14.3 Case mappings of substrings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX859"><code>u16_ct_totitle</code></a></td><td valign="top"><a href="libunistring_14.html#SEC70">14.3 Case mappings of substrings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX853"><code>u16_ct_toupper</code></a></td><td valign="top"><a href="libunistring_14.html#SEC70">14.3 Case mappings of substrings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX140"><code>u16_endswith</code></a></td><td valign="top"><a href="libunistring_4.html#SEC28">4.5.7 Searching for a substring in a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_10.html#IDX710"><code>u16_grapheme_breaks</code></a></td><td valign="top"><a href="libunistring_10.html#SEC55">10.1 Grapheme cluster breaks in a string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_10.html#IDX704"><code>u16_grapheme_next</code></a></td><td valign="top"><a href="libunistring_10.html#SEC55">10.1 Grapheme cluster breaks in a string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_10.html#IDX707"><code>u16_grapheme_prev</code></a></td><td valign="top"><a href="libunistring_10.html#SEC55">10.1 Grapheme cluster breaks in a string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX896"><code>u16_is_cased</code></a></td><td valign="top"><a href="libunistring_14.html#SEC72">14.5 Case detection</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX893"><code>u16_is_casefolded</code></a></td><td valign="top"><a href="libunistring_14.html#SEC72">14.5 Case detection</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX887"><code>u16_is_lowercase</code></a></td><td valign="top"><a href="libunistring_14.html#SEC72">14.5 Case detection</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX890"><code>u16_is_titlecase</code></a></td><td valign="top"><a href="libunistring_14.html#SEC72">14.5 Case detection</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX884"><code>u16_is_uppercase</code></a></td><td valign="top"><a href="libunistring_14.html#SEC72">14.5 Case detection</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX30"><code>u16_mblen</code></a></td><td valign="top"><a href="libunistring_4.html#SEC14">4.3.1 Iterating over a Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX63"><code>u16_mbsnlen</code></a></td><td valign="top"><a href="libunistring_4.html#SEC19">4.3.6 Counting the characters in a Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX33"><code>u16_mbtouc</code></a></td><td valign="top"><a href="libunistring_4.html#SEC14">4.3.1 Iterating over a Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX36"><code>u16_mbtouc_unsafe</code></a></td><td valign="top"><a href="libunistring_4.html#SEC14">4.3.1 Iterating over a Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX39"><code>u16_mbtoucr</code></a></td><td valign="top"><a href="libunistring_4.html#SEC14">4.3.1 Iterating over a Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX48"><code>u16_move</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.3.3 Copying Unicode strings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX76"><code>u16_next</code></a></td><td valign="top"><a href="libunistring_4.html#SEC22">4.5.1 Iterating over a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX804"><code>u16_normalize</code></a></td><td valign="top"><a href="libunistring_13.html#SEC64">13.3 Normalization of strings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX807"><code>u16_normcmp</code></a></td><td valign="top"><a href="libunistring_13.html#SEC65">13.4 Normalizing comparisons</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX815"><code>u16_normcoll</code></a></td><td valign="top"><a href="libunistring_13.html#SEC65">13.4 Normalizing comparisons</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX812"><code>u16_normxfrm</code></a></td><td valign="top"><a href="libunistring_13.html#SEC65">13.4 Normalizing comparisons</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_12.html#IDX767"><code>u16_possible_linebreaks</code></a></td><td valign="top"><a href="libunistring_12.html#SEC60">12. Line breaking <code><unilbrk.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX79"><code>u16_prev</code></a></td><td valign="top"><a href="libunistring_4.html#SEC22">4.5.1 Iterating over a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX51"><code>u16_set</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.3.3 Copying Unicode strings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX195"><code>u16_snprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC31">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX194"><code>u16_sprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC31">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX137"><code>u16_startswith</code></a></td><td valign="top"><a href="libunistring_4.html#SEC28">4.5.7 Searching for a substring in a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX91"><code>u16_stpcpy</code></a></td><td valign="top"><a href="libunistring_4.html#SEC24">4.5.3 Copying a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX97"><code>u16_stpncpy</code></a></td><td valign="top"><a href="libunistring_4.html#SEC24">4.5.3 Copying a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX100"><code>u16_strcat</code></a></td><td valign="top"><a href="libunistring_4.html#SEC24">4.5.3 Copying a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX119"><code>u16_strchr</code></a></td><td valign="top"><a href="libunistring_4.html#SEC27">4.5.6 Searching for a character in a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX106"><code>u16_strcmp</code></a></td><td valign="top"><a href="libunistring_4.html#SEC25">4.5.4 Comparing NUL terminated Unicode strings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX110"><code>u16_strcoll</code></a></td><td valign="top"><a href="libunistring_4.html#SEC25">4.5.4 Comparing NUL terminated Unicode strings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_5.html#IDX159"><code>u16_strconv_from_encoding</code></a></td><td valign="top"><a href="libunistring_5.html#SEC30">5. Conversions between Unicode and encodings <code><uniconv.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_5.html#IDX165"><code>u16_strconv_from_locale</code></a></td><td valign="top"><a href="libunistring_5.html#SEC30">5. Conversions between Unicode and encodings <code><uniconv.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_5.html#IDX162"><code>u16_strconv_to_encoding</code></a></td><td valign="top"><a href="libunistring_5.html#SEC30">5. Conversions between Unicode and encodings <code><uniconv.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_5.html#IDX168"><code>u16_strconv_to_locale</code></a></td><td valign="top"><a href="libunistring_5.html#SEC30">5. Conversions between Unicode and encodings <code><uniconv.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX88"><code>u16_strcpy</code></a></td><td valign="top"><a href="libunistring_4.html#SEC24">4.5.3 Copying a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX125"><code>u16_strcspn</code></a></td><td valign="top"><a href="libunistring_4.html#SEC27">4.5.6 Searching for a character in a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX116"><code>u16_strdup</code></a></td><td valign="top"><a href="libunistring_4.html#SEC26">4.5.5 Duplicating a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX82"><code>u16_strlen</code></a></td><td valign="top"><a href="libunistring_4.html#SEC23">4.5.2 Length of a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX69"><code>u16_strmblen</code></a></td><td valign="top"><a href="libunistring_4.html#SEC22">4.5.1 Iterating over a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX73"><code>u16_strmbtouc</code></a></td><td valign="top"><a href="libunistring_4.html#SEC22">4.5.1 Iterating over a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX103"><code>u16_strncat</code></a></td><td valign="top"><a href="libunistring_4.html#SEC24">4.5.3 Copying a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX113"><code>u16_strncmp</code></a></td><td valign="top"><a href="libunistring_4.html#SEC25">4.5.4 Comparing NUL terminated Unicode strings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX94"><code>u16_strncpy</code></a></td><td valign="top"><a href="libunistring_4.html#SEC24">4.5.3 Copying a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX85"><code>u16_strnlen</code></a></td><td valign="top"><a href="libunistring_4.html#SEC23">4.5.2 Length of a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX131"><code>u16_strpbrk</code></a></td><td valign="top"><a href="libunistring_4.html#SEC27">4.5.6 Searching for a character in a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX122"><code>u16_strrchr</code></a></td><td valign="top"><a href="libunistring_4.html#SEC27">4.5.6 Searching for a character in a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX128"><code>u16_strspn</code></a></td><td valign="top"><a href="libunistring_4.html#SEC27">4.5.6 Searching for a character in a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX134"><code>u16_strstr</code></a></td><td valign="top"><a href="libunistring_4.html#SEC28">4.5.7 Searching for a substring in a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX143"><code>u16_strtok</code></a></td><td valign="top"><a href="libunistring_4.html#SEC29">4.5.8 Tokenizing a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_9.html#IDX701"><code>u16_strwidth</code></a></td><td valign="top"><a href="libunistring_9.html#SEC53">9. Display width <code><uniwidth.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX26"><code>u16_to_u32</code></a></td><td valign="top"><a href="libunistring_4.html#SEC12">4.2 Elementary string conversions</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX25"><code>u16_to_u8</code></a></td><td valign="top"><a href="libunistring_4.html#SEC12">4.2 Elementary string conversions</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX831"><code>u16_tolower</code></a></td><td valign="top"><a href="libunistring_14.html#SEC69">14.2 Case mappings of strings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX834"><code>u16_totitle</code></a></td><td valign="top"><a href="libunistring_14.html#SEC69">14.2 Case mappings of strings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX828"><code>u16_toupper</code></a></td><td valign="top"><a href="libunistring_14.html#SEC69">14.2 Case mappings of strings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX205"><code>u16_u16_asnprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC31">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX204"><code>u16_u16_asprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC31">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX203"><code>u16_u16_snprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC31">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX202"><code>u16_u16_sprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC31">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX209"><code>u16_u16_vasnprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC31">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX208"><code>u16_u16_vasprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC31">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX207"><code>u16_u16_vsnprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC31">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX206"><code>u16_u16_vsprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC31">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX42"><code>u16_uctomb</code></a></td><td valign="top"><a href="libunistring_4.html#SEC15">4.3.2 Creating Unicode strings one character at a time</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX201"><code>u16_vasnprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC31">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX200"><code>u16_vasprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC31">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX199"><code>u16_vsnprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC31">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX198"><code>u16_vsprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC31">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_9.html#IDX698"><code>u16_width</code></a></td><td valign="top"><a href="libunistring_9.html#SEC53">9. Display width <code><uniwidth.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_12.html#IDX771"><code>u16_width_linebreaks</code></a></td><td valign="top"><a href="libunistring_12.html#SEC60">12. Line breaking <code><unilbrk.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_11.html#IDX735"><code>u16_wordbreaks</code></a></td><td valign="top"><a href="libunistring_11.html#SEC58">11.1 Word breaks in a string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX213"><code>u32_asnprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC31">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX212"><code>u32_asprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC31">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX869"><code>u32_casecmp</code></a></td><td valign="top"><a href="libunistring_14.html#SEC71">14.4 Case insensitive comparison</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX881"><code>u32_casecoll</code></a></td><td valign="top"><a href="libunistring_14.html#SEC71">14.4 Case insensitive comparison</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX863"><code>u32_casefold</code></a></td><td valign="top"><a href="libunistring_14.html#SEC71">14.4 Case insensitive comparison</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX877"><code>u32_casexfrm</code></a></td><td valign="top"><a href="libunistring_14.html#SEC71">14.4 Case insensitive comparison</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX840"><code>u32_casing_prefix_context</code></a></td><td valign="top"><a href="libunistring_14.html#SEC70">14.3 Case mappings of substrings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX843"><code>u32_casing_prefixes_context</code></a></td><td valign="top"><a href="libunistring_14.html#SEC70">14.3 Case mappings of substrings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX848"><code>u32_casing_suffix_context</code></a></td><td valign="top"><a href="libunistring_14.html#SEC70">14.3 Case mappings of substrings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX851"><code>u32_casing_suffixes_context</code></a></td><td valign="top"><a href="libunistring_14.html#SEC70">14.3 Case mappings of substrings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX22"><code>u32_check</code></a></td><td valign="top"><a href="libunistring_4.html#SEC11">4.1 Elementary string checks</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX61"><code>u32_chr</code></a></td><td valign="top"><a href="libunistring_4.html#SEC18">4.3.5 Searching for a character in a Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX55"><code>u32_cmp</code></a></td><td valign="top"><a href="libunistring_4.html#SEC17">4.3.4 Comparing Unicode strings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX58"><code>u32_cmp2</code></a></td><td valign="top"><a href="libunistring_4.html#SEC17">4.3.4 Comparing Unicode strings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_5.html#IDX154"><code>u32_conv_from_encoding</code></a></td><td valign="top"><a href="libunistring_5.html#SEC30">5. Conversions between Unicode and encodings <code><uniconv.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_5.html#IDX157"><code>u32_conv_to_encoding</code></a></td><td valign="top"><a href="libunistring_5.html#SEC30">5. Conversions between Unicode and encodings <code><uniconv.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX46"><code>u32_cpy</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.3.3 Copying Unicode strings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX67"><code>u32_cpy_alloc</code></a></td><td valign="top"><a href="libunistring_4.html#SEC20">4.4 Elementary string functions with memory allocation</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX866"><code>u32_ct_casefold</code></a></td><td valign="top"><a href="libunistring_14.html#SEC71">14.4 Case insensitive comparison</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX857"><code>u32_ct_tolower</code></a></td><td valign="top"><a href="libunistring_14.html#SEC70">14.3 Case mappings of substrings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX860"><code>u32_ct_totitle</code></a></td><td valign="top"><a href="libunistring_14.html#SEC70">14.3 Case mappings of substrings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX854"><code>u32_ct_toupper</code></a></td><td valign="top"><a href="libunistring_14.html#SEC70">14.3 Case mappings of substrings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX141"><code>u32_endswith</code></a></td><td valign="top"><a href="libunistring_4.html#SEC28">4.5.7 Searching for a substring in a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_10.html#IDX711"><code>u32_grapheme_breaks</code></a></td><td valign="top"><a href="libunistring_10.html#SEC55">10.1 Grapheme cluster breaks in a string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_10.html#IDX705"><code>u32_grapheme_next</code></a></td><td valign="top"><a href="libunistring_10.html#SEC55">10.1 Grapheme cluster breaks in a string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_10.html#IDX708"><code>u32_grapheme_prev</code></a></td><td valign="top"><a href="libunistring_10.html#SEC55">10.1 Grapheme cluster breaks in a string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX897"><code>u32_is_cased</code></a></td><td valign="top"><a href="libunistring_14.html#SEC72">14.5 Case detection</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX894"><code>u32_is_casefolded</code></a></td><td valign="top"><a href="libunistring_14.html#SEC72">14.5 Case detection</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX888"><code>u32_is_lowercase</code></a></td><td valign="top"><a href="libunistring_14.html#SEC72">14.5 Case detection</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX891"><code>u32_is_titlecase</code></a></td><td valign="top"><a href="libunistring_14.html#SEC72">14.5 Case detection</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX885"><code>u32_is_uppercase</code></a></td><td valign="top"><a href="libunistring_14.html#SEC72">14.5 Case detection</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX31"><code>u32_mblen</code></a></td><td valign="top"><a href="libunistring_4.html#SEC14">4.3.1 Iterating over a Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX64"><code>u32_mbsnlen</code></a></td><td valign="top"><a href="libunistring_4.html#SEC19">4.3.6 Counting the characters in a Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX34"><code>u32_mbtouc</code></a></td><td valign="top"><a href="libunistring_4.html#SEC14">4.3.1 Iterating over a Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX37"><code>u32_mbtouc_unsafe</code></a></td><td valign="top"><a href="libunistring_4.html#SEC14">4.3.1 Iterating over a Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX40"><code>u32_mbtoucr</code></a></td><td valign="top"><a href="libunistring_4.html#SEC14">4.3.1 Iterating over a Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX49"><code>u32_move</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.3.3 Copying Unicode strings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX77"><code>u32_next</code></a></td><td valign="top"><a href="libunistring_4.html#SEC22">4.5.1 Iterating over a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX805"><code>u32_normalize</code></a></td><td valign="top"><a href="libunistring_13.html#SEC64">13.3 Normalization of strings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX808"><code>u32_normcmp</code></a></td><td valign="top"><a href="libunistring_13.html#SEC65">13.4 Normalizing comparisons</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX816"><code>u32_normcoll</code></a></td><td valign="top"><a href="libunistring_13.html#SEC65">13.4 Normalizing comparisons</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX813"><code>u32_normxfrm</code></a></td><td valign="top"><a href="libunistring_13.html#SEC65">13.4 Normalizing comparisons</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_12.html#IDX768"><code>u32_possible_linebreaks</code></a></td><td valign="top"><a href="libunistring_12.html#SEC60">12. Line breaking <code><unilbrk.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX80"><code>u32_prev</code></a></td><td valign="top"><a href="libunistring_4.html#SEC22">4.5.1 Iterating over a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX52"><code>u32_set</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.3.3 Copying Unicode strings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX211"><code>u32_snprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC31">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX210"><code>u32_sprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC31">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX138"><code>u32_startswith</code></a></td><td valign="top"><a href="libunistring_4.html#SEC28">4.5.7 Searching for a substring in a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX92"><code>u32_stpcpy</code></a></td><td valign="top"><a href="libunistring_4.html#SEC24">4.5.3 Copying a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX98"><code>u32_stpncpy</code></a></td><td valign="top"><a href="libunistring_4.html#SEC24">4.5.3 Copying a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX101"><code>u32_strcat</code></a></td><td valign="top"><a href="libunistring_4.html#SEC24">4.5.3 Copying a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX120"><code>u32_strchr</code></a></td><td valign="top"><a href="libunistring_4.html#SEC27">4.5.6 Searching for a character in a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX107"><code>u32_strcmp</code></a></td><td valign="top"><a href="libunistring_4.html#SEC25">4.5.4 Comparing NUL terminated Unicode strings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX111"><code>u32_strcoll</code></a></td><td valign="top"><a href="libunistring_4.html#SEC25">4.5.4 Comparing NUL terminated Unicode strings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_5.html#IDX160"><code>u32_strconv_from_encoding</code></a></td><td valign="top"><a href="libunistring_5.html#SEC30">5. Conversions between Unicode and encodings <code><uniconv.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_5.html#IDX166"><code>u32_strconv_from_locale</code></a></td><td valign="top"><a href="libunistring_5.html#SEC30">5. Conversions between Unicode and encodings <code><uniconv.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_5.html#IDX163"><code>u32_strconv_to_encoding</code></a></td><td valign="top"><a href="libunistring_5.html#SEC30">5. Conversions between Unicode and encodings <code><uniconv.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_5.html#IDX169"><code>u32_strconv_to_locale</code></a></td><td valign="top"><a href="libunistring_5.html#SEC30">5. Conversions between Unicode and encodings <code><uniconv.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX89"><code>u32_strcpy</code></a></td><td valign="top"><a href="libunistring_4.html#SEC24">4.5.3 Copying a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX126"><code>u32_strcspn</code></a></td><td valign="top"><a href="libunistring_4.html#SEC27">4.5.6 Searching for a character in a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX117"><code>u32_strdup</code></a></td><td valign="top"><a href="libunistring_4.html#SEC26">4.5.5 Duplicating a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX83"><code>u32_strlen</code></a></td><td valign="top"><a href="libunistring_4.html#SEC23">4.5.2 Length of a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX70"><code>u32_strmblen</code></a></td><td valign="top"><a href="libunistring_4.html#SEC22">4.5.1 Iterating over a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX74"><code>u32_strmbtouc</code></a></td><td valign="top"><a href="libunistring_4.html#SEC22">4.5.1 Iterating over a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX104"><code>u32_strncat</code></a></td><td valign="top"><a href="libunistring_4.html#SEC24">4.5.3 Copying a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX114"><code>u32_strncmp</code></a></td><td valign="top"><a href="libunistring_4.html#SEC25">4.5.4 Comparing NUL terminated Unicode strings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX95"><code>u32_strncpy</code></a></td><td valign="top"><a href="libunistring_4.html#SEC24">4.5.3 Copying a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX86"><code>u32_strnlen</code></a></td><td valign="top"><a href="libunistring_4.html#SEC23">4.5.2 Length of a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX132"><code>u32_strpbrk</code></a></td><td valign="top"><a href="libunistring_4.html#SEC27">4.5.6 Searching for a character in a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX123"><code>u32_strrchr</code></a></td><td valign="top"><a href="libunistring_4.html#SEC27">4.5.6 Searching for a character in a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX129"><code>u32_strspn</code></a></td><td valign="top"><a href="libunistring_4.html#SEC27">4.5.6 Searching for a character in a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX135"><code>u32_strstr</code></a></td><td valign="top"><a href="libunistring_4.html#SEC28">4.5.7 Searching for a substring in a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX144"><code>u32_strtok</code></a></td><td valign="top"><a href="libunistring_4.html#SEC29">4.5.8 Tokenizing a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_9.html#IDX702"><code>u32_strwidth</code></a></td><td valign="top"><a href="libunistring_9.html#SEC53">9. Display width <code><uniwidth.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX28"><code>u32_to_u16</code></a></td><td valign="top"><a href="libunistring_4.html#SEC12">4.2 Elementary string conversions</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX27"><code>u32_to_u8</code></a></td><td valign="top"><a href="libunistring_4.html#SEC12">4.2 Elementary string conversions</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX832"><code>u32_tolower</code></a></td><td valign="top"><a href="libunistring_14.html#SEC69">14.2 Case mappings of strings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX835"><code>u32_totitle</code></a></td><td valign="top"><a href="libunistring_14.html#SEC69">14.2 Case mappings of strings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX829"><code>u32_toupper</code></a></td><td valign="top"><a href="libunistring_14.html#SEC69">14.2 Case mappings of strings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX221"><code>u32_u32_asnprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC31">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX220"><code>u32_u32_asprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC31">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX219"><code>u32_u32_snprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC31">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX218"><code>u32_u32_sprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC31">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX225"><code>u32_u32_vasnprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC31">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX224"><code>u32_u32_vasprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC31">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX223"><code>u32_u32_vsnprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC31">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX222"><code>u32_u32_vsprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC31">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX43"><code>u32_uctomb</code></a></td><td valign="top"><a href="libunistring_4.html#SEC15">4.3.2 Creating Unicode strings one character at a time</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX217"><code>u32_vasnprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC31">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX216"><code>u32_vasprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC31">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX215"><code>u32_vsnprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC31">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX214"><code>u32_vsprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC31">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_9.html#IDX699"><code>u32_width</code></a></td><td valign="top"><a href="libunistring_9.html#SEC53">9. Display width <code><uniwidth.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_12.html#IDX772"><code>u32_width_linebreaks</code></a></td><td valign="top"><a href="libunistring_12.html#SEC60">12. Line breaking <code><unilbrk.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_11.html#IDX736"><code>u32_wordbreaks</code></a></td><td valign="top"><a href="libunistring_11.html#SEC58">11.1 Word breaks in a string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX181"><code>u8_asnprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC31">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX180"><code>u8_asprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC31">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX867"><code>u8_casecmp</code></a></td><td valign="top"><a href="libunistring_14.html#SEC71">14.4 Case insensitive comparison</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX879"><code>u8_casecoll</code></a></td><td valign="top"><a href="libunistring_14.html#SEC71">14.4 Case insensitive comparison</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX861"><code>u8_casefold</code></a></td><td valign="top"><a href="libunistring_14.html#SEC71">14.4 Case insensitive comparison</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX875"><code>u8_casexfrm</code></a></td><td valign="top"><a href="libunistring_14.html#SEC71">14.4 Case insensitive comparison</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX838"><code>u8_casing_prefix_context</code></a></td><td valign="top"><a href="libunistring_14.html#SEC70">14.3 Case mappings of substrings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX841"><code>u8_casing_prefixes_context</code></a></td><td valign="top"><a href="libunistring_14.html#SEC70">14.3 Case mappings of substrings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX846"><code>u8_casing_suffix_context</code></a></td><td valign="top"><a href="libunistring_14.html#SEC70">14.3 Case mappings of substrings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX849"><code>u8_casing_suffixes_context</code></a></td><td valign="top"><a href="libunistring_14.html#SEC70">14.3 Case mappings of substrings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX20"><code>u8_check</code></a></td><td valign="top"><a href="libunistring_4.html#SEC11">4.1 Elementary string checks</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX59"><code>u8_chr</code></a></td><td valign="top"><a href="libunistring_4.html#SEC18">4.3.5 Searching for a character in a Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX53"><code>u8_cmp</code></a></td><td valign="top"><a href="libunistring_4.html#SEC17">4.3.4 Comparing Unicode strings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX56"><code>u8_cmp2</code></a></td><td valign="top"><a href="libunistring_4.html#SEC17">4.3.4 Comparing Unicode strings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_5.html#IDX152"><code>u8_conv_from_encoding</code></a></td><td valign="top"><a href="libunistring_5.html#SEC30">5. Conversions between Unicode and encodings <code><uniconv.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_5.html#IDX155"><code>u8_conv_to_encoding</code></a></td><td valign="top"><a href="libunistring_5.html#SEC30">5. Conversions between Unicode and encodings <code><uniconv.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX44"><code>u8_cpy</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.3.3 Copying Unicode strings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX65"><code>u8_cpy_alloc</code></a></td><td valign="top"><a href="libunistring_4.html#SEC20">4.4 Elementary string functions with memory allocation</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX864"><code>u8_ct_casefold</code></a></td><td valign="top"><a href="libunistring_14.html#SEC71">14.4 Case insensitive comparison</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX855"><code>u8_ct_tolower</code></a></td><td valign="top"><a href="libunistring_14.html#SEC70">14.3 Case mappings of substrings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX858"><code>u8_ct_totitle</code></a></td><td valign="top"><a href="libunistring_14.html#SEC70">14.3 Case mappings of substrings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX852"><code>u8_ct_toupper</code></a></td><td valign="top"><a href="libunistring_14.html#SEC70">14.3 Case mappings of substrings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX139"><code>u8_endswith</code></a></td><td valign="top"><a href="libunistring_4.html#SEC28">4.5.7 Searching for a substring in a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_10.html#IDX709"><code>u8_grapheme_breaks</code></a></td><td valign="top"><a href="libunistring_10.html#SEC55">10.1 Grapheme cluster breaks in a string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_10.html#IDX703"><code>u8_grapheme_next</code></a></td><td valign="top"><a href="libunistring_10.html#SEC55">10.1 Grapheme cluster breaks in a string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_10.html#IDX706"><code>u8_grapheme_prev</code></a></td><td valign="top"><a href="libunistring_10.html#SEC55">10.1 Grapheme cluster breaks in a string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX895"><code>u8_is_cased</code></a></td><td valign="top"><a href="libunistring_14.html#SEC72">14.5 Case detection</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX892"><code>u8_is_casefolded</code></a></td><td valign="top"><a href="libunistring_14.html#SEC72">14.5 Case detection</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX886"><code>u8_is_lowercase</code></a></td><td valign="top"><a href="libunistring_14.html#SEC72">14.5 Case detection</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX889"><code>u8_is_titlecase</code></a></td><td valign="top"><a href="libunistring_14.html#SEC72">14.5 Case detection</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX883"><code>u8_is_uppercase</code></a></td><td valign="top"><a href="libunistring_14.html#SEC72">14.5 Case detection</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX29"><code>u8_mblen</code></a></td><td valign="top"><a href="libunistring_4.html#SEC14">4.3.1 Iterating over a Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX62"><code>u8_mbsnlen</code></a></td><td valign="top"><a href="libunistring_4.html#SEC19">4.3.6 Counting the characters in a Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX32"><code>u8_mbtouc</code></a></td><td valign="top"><a href="libunistring_4.html#SEC14">4.3.1 Iterating over a Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX35"><code>u8_mbtouc_unsafe</code></a></td><td valign="top"><a href="libunistring_4.html#SEC14">4.3.1 Iterating over a Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX38"><code>u8_mbtoucr</code></a></td><td valign="top"><a href="libunistring_4.html#SEC14">4.3.1 Iterating over a Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX47"><code>u8_move</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.3.3 Copying Unicode strings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX75"><code>u8_next</code></a></td><td valign="top"><a href="libunistring_4.html#SEC22">4.5.1 Iterating over a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX803"><code>u8_normalize</code></a></td><td valign="top"><a href="libunistring_13.html#SEC64">13.3 Normalization of strings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX806"><code>u8_normcmp</code></a></td><td valign="top"><a href="libunistring_13.html#SEC65">13.4 Normalizing comparisons</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX814"><code>u8_normcoll</code></a></td><td valign="top"><a href="libunistring_13.html#SEC65">13.4 Normalizing comparisons</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX811"><code>u8_normxfrm</code></a></td><td valign="top"><a href="libunistring_13.html#SEC65">13.4 Normalizing comparisons</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_12.html#IDX766"><code>u8_possible_linebreaks</code></a></td><td valign="top"><a href="libunistring_12.html#SEC60">12. Line breaking <code><unilbrk.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX78"><code>u8_prev</code></a></td><td valign="top"><a href="libunistring_4.html#SEC22">4.5.1 Iterating over a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX50"><code>u8_set</code></a></td><td valign="top"><a href="libunistring_4.html#SEC16">4.3.3 Copying Unicode strings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX179"><code>u8_snprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC31">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX178"><code>u8_sprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC31">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX136"><code>u8_startswith</code></a></td><td valign="top"><a href="libunistring_4.html#SEC28">4.5.7 Searching for a substring in a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX90"><code>u8_stpcpy</code></a></td><td valign="top"><a href="libunistring_4.html#SEC24">4.5.3 Copying a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX96"><code>u8_stpncpy</code></a></td><td valign="top"><a href="libunistring_4.html#SEC24">4.5.3 Copying a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX99"><code>u8_strcat</code></a></td><td valign="top"><a href="libunistring_4.html#SEC24">4.5.3 Copying a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX118"><code>u8_strchr</code></a></td><td valign="top"><a href="libunistring_4.html#SEC27">4.5.6 Searching for a character in a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX105"><code>u8_strcmp</code></a></td><td valign="top"><a href="libunistring_4.html#SEC25">4.5.4 Comparing NUL terminated Unicode strings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX109"><code>u8_strcoll</code></a></td><td valign="top"><a href="libunistring_4.html#SEC25">4.5.4 Comparing NUL terminated Unicode strings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_5.html#IDX158"><code>u8_strconv_from_encoding</code></a></td><td valign="top"><a href="libunistring_5.html#SEC30">5. Conversions between Unicode and encodings <code><uniconv.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_5.html#IDX164"><code>u8_strconv_from_locale</code></a></td><td valign="top"><a href="libunistring_5.html#SEC30">5. Conversions between Unicode and encodings <code><uniconv.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_5.html#IDX161"><code>u8_strconv_to_encoding</code></a></td><td valign="top"><a href="libunistring_5.html#SEC30">5. Conversions between Unicode and encodings <code><uniconv.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_5.html#IDX167"><code>u8_strconv_to_locale</code></a></td><td valign="top"><a href="libunistring_5.html#SEC30">5. Conversions between Unicode and encodings <code><uniconv.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX87"><code>u8_strcpy</code></a></td><td valign="top"><a href="libunistring_4.html#SEC24">4.5.3 Copying a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX124"><code>u8_strcspn</code></a></td><td valign="top"><a href="libunistring_4.html#SEC27">4.5.6 Searching for a character in a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX115"><code>u8_strdup</code></a></td><td valign="top"><a href="libunistring_4.html#SEC26">4.5.5 Duplicating a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX81"><code>u8_strlen</code></a></td><td valign="top"><a href="libunistring_4.html#SEC23">4.5.2 Length of a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX68"><code>u8_strmblen</code></a></td><td valign="top"><a href="libunistring_4.html#SEC22">4.5.1 Iterating over a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX72"><code>u8_strmbtouc</code></a></td><td valign="top"><a href="libunistring_4.html#SEC22">4.5.1 Iterating over a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX102"><code>u8_strncat</code></a></td><td valign="top"><a href="libunistring_4.html#SEC24">4.5.3 Copying a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX112"><code>u8_strncmp</code></a></td><td valign="top"><a href="libunistring_4.html#SEC25">4.5.4 Comparing NUL terminated Unicode strings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX93"><code>u8_strncpy</code></a></td><td valign="top"><a href="libunistring_4.html#SEC24">4.5.3 Copying a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX84"><code>u8_strnlen</code></a></td><td valign="top"><a href="libunistring_4.html#SEC23">4.5.2 Length of a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX130"><code>u8_strpbrk</code></a></td><td valign="top"><a href="libunistring_4.html#SEC27">4.5.6 Searching for a character in a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX121"><code>u8_strrchr</code></a></td><td valign="top"><a href="libunistring_4.html#SEC27">4.5.6 Searching for a character in a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX127"><code>u8_strspn</code></a></td><td valign="top"><a href="libunistring_4.html#SEC27">4.5.6 Searching for a character in a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX133"><code>u8_strstr</code></a></td><td valign="top"><a href="libunistring_4.html#SEC28">4.5.7 Searching for a substring in a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX142"><code>u8_strtok</code></a></td><td valign="top"><a href="libunistring_4.html#SEC29">4.5.8 Tokenizing a NUL terminated Unicode string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_9.html#IDX700"><code>u8_strwidth</code></a></td><td valign="top"><a href="libunistring_9.html#SEC53">9. Display width <code><uniwidth.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX23"><code>u8_to_u16</code></a></td><td valign="top"><a href="libunistring_4.html#SEC12">4.2 Elementary string conversions</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX24"><code>u8_to_u32</code></a></td><td valign="top"><a href="libunistring_4.html#SEC12">4.2 Elementary string conversions</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX830"><code>u8_tolower</code></a></td><td valign="top"><a href="libunistring_14.html#SEC69">14.2 Case mappings of strings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX833"><code>u8_totitle</code></a></td><td valign="top"><a href="libunistring_14.html#SEC69">14.2 Case mappings of strings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX827"><code>u8_toupper</code></a></td><td valign="top"><a href="libunistring_14.html#SEC69">14.2 Case mappings of strings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX189"><code>u8_u8_asnprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC31">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX188"><code>u8_u8_asprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC31">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX187"><code>u8_u8_snprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC31">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX186"><code>u8_u8_sprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC31">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX193"><code>u8_u8_vasnprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC31">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX192"><code>u8_u8_vasprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC31">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX191"><code>u8_u8_vsnprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC31">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX190"><code>u8_u8_vsprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC31">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#IDX41"><code>u8_uctomb</code></a></td><td valign="top"><a href="libunistring_4.html#SEC15">4.3.2 Creating Unicode strings one character at a time</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX185"><code>u8_vasnprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC31">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX184"><code>u8_vasprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC31">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX183"><code>u8_vsnprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC31">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX182"><code>u8_vsprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC31">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_9.html#IDX697"><code>u8_width</code></a></td><td valign="top"><a href="libunistring_9.html#SEC53">9. Display width <code><uniwidth.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_12.html#IDX770"><code>u8_width_linebreaks</code></a></td><td valign="top"><a href="libunistring_12.html#SEC60">12. Line breaking <code><unilbrk.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_11.html#IDX734"><code>u8_wordbreaks</code></a></td><td valign="top"><a href="libunistring_11.html#SEC58">11.1 Word breaks in a string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX669"><code>uc_all_blocks</code></a></td><td valign="top"><a href="libunistring_8.html#SEC50">8.11 Blocks</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX664"><code>uc_all_scripts</code></a></td><td valign="top"><a href="libunistring_8.html#SEC49">8.10 Scripts</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX405"><code>uc_bidi_category</code></a></td><td valign="top"><a href="libunistring_8.html#SEC38">8.3 Bidi class</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX403"><code>uc_bidi_category_byname</code></a></td><td valign="top"><a href="libunistring_8.html#SEC38">8.3 Bidi class</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX400"><code>uc_bidi_category_name</code></a></td><td valign="top"><a href="libunistring_8.html#SEC38">8.3 Bidi class</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX404"><code>uc_bidi_class</code></a></td><td valign="top"><a href="libunistring_8.html#SEC38">8.3 Bidi class</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX402"><code>uc_bidi_class_byname</code></a></td><td valign="top"><a href="libunistring_8.html#SEC38">8.3 Bidi class</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX401"><code>uc_bidi_class_long_name</code></a></td><td valign="top"><a href="libunistring_8.html#SEC38">8.3 Bidi class</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX399"><code>uc_bidi_class_name</code></a></td><td valign="top"><a href="libunistring_8.html#SEC38">8.3 Bidi class</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX667"><code>uc_block</code></a></td><td valign="top"><a href="libunistring_8.html#SEC50">8.11 Blocks</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX665"><code>uc_block_t</code></a></td><td valign="top"><a href="libunistring_8.html#SEC50">8.11 Blocks</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX677"><code>uc_c_ident_category</code></a></td><td valign="top"><a href="libunistring_8.html#SEC51">8.12 ISO C and Java syntax</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX793"><code>uc_canonical_decomposition</code></a></td><td valign="top"><a href="libunistring_13.html#SEC62">13.1 Decomposition of Unicode characters</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX379"><code>uc_combining_class</code></a></td><td valign="top"><a href="libunistring_8.html#SEC37">8.2 Canonical combining class</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX378"><code>uc_combining_class_byname</code></a></td><td valign="top"><a href="libunistring_8.html#SEC37">8.2 Canonical combining class</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX377"><code>uc_combining_class_long_name</code></a></td><td valign="top"><a href="libunistring_8.html#SEC37">8.2 Canonical combining class</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX376"><code>uc_combining_class_name</code></a></td><td valign="top"><a href="libunistring_8.html#SEC37">8.2 Canonical combining class</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX794"><code>uc_composition</code></a></td><td valign="top"><a href="libunistring_13.html#SEC63">13.2 Composition of Unicode characters</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX408"><code>uc_decimal_value</code></a></td><td valign="top"><a href="libunistring_8.html#SEC39">8.4 Decimal digit value</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX792"><code>uc_decomposition</code></a></td><td valign="top"><a href="libunistring_13.html#SEC62">13.1 Decomposition of Unicode characters</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX409"><code>uc_digit_value</code></a></td><td valign="top"><a href="libunistring_8.html#SEC40">8.5 Digit value</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX410"><code>uc_fraction_t</code></a></td><td valign="top"><a href="libunistring_8.html#SEC41">8.6 Numeric value</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX315"><code>uc_general_category</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.1.1 The object oriented API for general category</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX310"><code>uc_general_category_and</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.1.1 The object oriented API for general category</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX311"><code>uc_general_category_and_not</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.1.1 The object oriented API for general category</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX314"><code>uc_general_category_byname</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.1.1 The object oriented API for general category</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX313"><code>uc_general_category_long_name</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.1.1 The object oriented API for general category</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX312"><code>uc_general_category_name</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.1.1 The object oriented API for general category</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX309"><code>uc_general_category_or</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.1.1 The object oriented API for general category</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX232"><code>uc_general_category_t</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.1.1 The object oriented API for general category</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_10.html#IDX713"><code>uc_grapheme_breaks</code></a></td><td valign="top"><a href="libunistring_10.html#SEC55">10.1 Grapheme cluster breaks in a string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_10.html#IDX732"><code>uc_graphemeclusterbreak_property</code></a></td><td valign="top"><a href="libunistring_10.html#SEC56">10.2 Grapheme cluster break property</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX680"><code>uc_is_alnum</code></a></td><td valign="top"><a href="libunistring_8.html#SEC52">8.13 Classifications like in ISO C</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX681"><code>uc_is_alpha</code></a></td><td valign="top"><a href="libunistring_8.html#SEC52">8.13 Classifications like in ISO C</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX407"><code>uc_is_bidi_category</code></a></td><td valign="top"><a href="libunistring_8.html#SEC38">8.3 Bidi class</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX406"><code>uc_is_bidi_class</code></a></td><td valign="top"><a href="libunistring_8.html#SEC38">8.3 Bidi class</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX691"><code>uc_is_blank</code></a></td><td valign="top"><a href="libunistring_8.html#SEC52">8.13 Classifications like in ISO C</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX668"><code>uc_is_block</code></a></td><td valign="top"><a href="libunistring_8.html#SEC50">8.11 Blocks</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX670"><code>uc_is_c_whitespace</code></a></td><td valign="top"><a href="libunistring_8.html#SEC51">8.12 ISO C and Java syntax</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX682"><code>uc_is_cntrl</code></a></td><td valign="top"><a href="libunistring_8.html#SEC52">8.13 Classifications like in ISO C</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX683"><code>uc_is_digit</code></a></td><td valign="top"><a href="libunistring_8.html#SEC52">8.13 Classifications like in ISO C</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX316"><code>uc_is_general_category</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.1.1 The object oriented API for general category</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX355"><code>uc_is_general_category_withtable</code></a></td><td valign="top"><a href="libunistring_8.html#SEC36">8.1.2 The bit mask API for general category</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX684"><code>uc_is_graph</code></a></td><td valign="top"><a href="libunistring_8.html#SEC52">8.13 Classifications like in ISO C</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_10.html#IDX733"><code>uc_is_grapheme_break</code></a></td><td valign="top"><a href="libunistring_10.html#SEC56">10.2 Grapheme cluster break property</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX671"><code>uc_is_java_whitespace</code></a></td><td valign="top"><a href="libunistring_8.html#SEC51">8.12 ISO C and Java syntax</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX685"><code>uc_is_lower</code></a></td><td valign="top"><a href="libunistring_8.html#SEC52">8.13 Classifications like in ISO C</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX686"><code>uc_is_print</code></a></td><td valign="top"><a href="libunistring_8.html#SEC52">8.13 Classifications like in ISO C</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX572"><code>uc_is_property</code></a></td><td valign="top"><a href="libunistring_8.html#SEC47">8.9.1 Properties as objects – the object oriented API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX574"><code>uc_is_property_alphabetic</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX628"><code>uc_is_property_ascii_hex_digit</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX617"><code>uc_is_property_bidi_arabic_digit</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX613"><code>uc_is_property_bidi_arabic_right_to_left</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX619"><code>uc_is_property_bidi_block_separator</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX623"><code>uc_is_property_bidi_boundary_neutral</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX618"><code>uc_is_property_bidi_common_separator</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX610"><code>uc_is_property_bidi_control</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX625"><code>uc_is_property_bidi_embedding_or_override</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX615"><code>uc_is_property_bidi_eur_num_separator</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX616"><code>uc_is_property_bidi_eur_num_terminator</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX614"><code>uc_is_property_bidi_european_digit</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX612"><code>uc_is_property_bidi_hebrew_right_to_left</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX611"><code>uc_is_property_bidi_left_to_right</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX622"><code>uc_is_property_bidi_non_spacing_mark</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX626"><code>uc_is_property_bidi_other_neutral</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX624"><code>uc_is_property_bidi_pdf</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX620"><code>uc_is_property_bidi_segment_separator</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX621"><code>uc_is_property_bidi_whitespace</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX590"><code>uc_is_property_case_ignorable</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX589"><code>uc_is_property_cased</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX594"><code>uc_is_property_changes_when_casefolded</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX595"><code>uc_is_property_changes_when_casemapped</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX591"><code>uc_is_property_changes_when_lowercased</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX593"><code>uc_is_property_changes_when_titlecased</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX592"><code>uc_is_property_changes_when_uppercased</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX652"><code>uc_is_property_combining</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX653"><code>uc_is_property_composite</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX647"><code>uc_is_property_currency_symbol</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX639"><code>uc_is_property_dash</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX654"><code>uc_is_property_decimal_digit</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX577"><code>uc_is_property_default_ignorable_code_point</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX579"><code>uc_is_property_deprecated</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX656"><code>uc_is_property_diacritic</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX657"><code>uc_is_property_extender</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX638"><code>uc_is_property_format_control</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX606"><code>uc_is_property_grapheme_base</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX607"><code>uc_is_property_grapheme_extend</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX609"><code>uc_is_property_grapheme_link</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX627"><code>uc_is_property_hex_digit</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX640"><code>uc_is_property_hyphen</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX599"><code>uc_is_property_id_continue</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX597"><code>uc_is_property_id_start</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX629"><code>uc_is_property_ideographic</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX632"><code>uc_is_property_ids_binary_operator</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX633"><code>uc_is_property_ids_trinary_operator</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX658"><code>uc_is_property_ignorable_control</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX637"><code>uc_is_property_iso_control</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX605"><code>uc_is_property_join_control</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX651"><code>uc_is_property_left_of_pair</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX642"><code>uc_is_property_line_separator</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX580"><code>uc_is_property_logical_order_exception</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX586"><code>uc_is_property_lowercase</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX648"><code>uc_is_property_math</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX636"><code>uc_is_property_non_break</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX576"><code>uc_is_property_not_a_character</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX655"><code>uc_is_property_numeric</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX575"><code>uc_is_property_other_alphabetic</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX578"><code>uc_is_property_other_default_ignorable_code_point</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX608"><code>uc_is_property_other_grapheme_extend</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX600"><code>uc_is_property_other_id_continue</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX598"><code>uc_is_property_other_id_start</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX587"><code>uc_is_property_other_lowercase</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX649"><code>uc_is_property_other_math</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX585"><code>uc_is_property_other_uppercase</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX650"><code>uc_is_property_paired_punctuation</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX643"><code>uc_is_property_paragraph_separator</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX604"><code>uc_is_property_pattern_syntax</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX603"><code>uc_is_property_pattern_white_space</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX582"><code>uc_is_property_private_use</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX641"><code>uc_is_property_punctuation</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX644"><code>uc_is_property_quotation_mark</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX631"><code>uc_is_property_radical</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX645"><code>uc_is_property_sentence_terminal</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX596"><code>uc_is_property_soft_dotted</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX635"><code>uc_is_property_space</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX646"><code>uc_is_property_terminal_punctuation</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX588"><code>uc_is_property_titlecase</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX583"><code>uc_is_property_unassigned_code_value</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX630"><code>uc_is_property_unified_ideograph</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX584"><code>uc_is_property_uppercase</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX581"><code>uc_is_property_variation_selector</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX573"><code>uc_is_property_white_space</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX602"><code>uc_is_property_xid_continue</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX601"><code>uc_is_property_xid_start</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX634"><code>uc_is_property_zero_width</code></a></td><td valign="top"><a href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX687"><code>uc_is_punct</code></a></td><td valign="top"><a href="libunistring_8.html#SEC52">8.13 Classifications like in ISO C</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX663"><code>uc_is_script</code></a></td><td valign="top"><a href="libunistring_8.html#SEC49">8.10 Scripts</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX688"><code>uc_is_space</code></a></td><td valign="top"><a href="libunistring_8.html#SEC52">8.13 Classifications like in ISO C</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX689"><code>uc_is_upper</code></a></td><td valign="top"><a href="libunistring_8.html#SEC52">8.13 Classifications like in ISO C</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX690"><code>uc_is_xdigit</code></a></td><td valign="top"><a href="libunistring_8.html#SEC52">8.13 Classifications like in ISO C</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX679"><code>uc_java_ident_category</code></a></td><td valign="top"><a href="libunistring_8.html#SEC51">8.12 ISO C and Java syntax</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX482"><code>uc_joining_group</code></a></td><td valign="top"><a href="libunistring_8.html#SEC45">8.8.2 Joining group of Arabic characters</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX481"><code>uc_joining_group_byname</code></a></td><td valign="top"><a href="libunistring_8.html#SEC45">8.8.2 Joining group of Arabic characters</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX480"><code>uc_joining_group_name</code></a></td><td valign="top"><a href="libunistring_8.html#SEC45">8.8.2 Joining group of Arabic characters</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX422"><code>uc_joining_type</code></a></td><td valign="top"><a href="libunistring_8.html#SEC44">8.8.1 Joining type of Arabic characters</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX421"><code>uc_joining_type_byname</code></a></td><td valign="top"><a href="libunistring_8.html#SEC44">8.8.1 Joining type of Arabic characters</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX420"><code>uc_joining_type_long_name</code></a></td><td valign="top"><a href="libunistring_8.html#SEC44">8.8.1 Joining type of Arabic characters</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX419"><code>uc_joining_type_name</code></a></td><td valign="top"><a href="libunistring_8.html#SEC44">8.8.1 Joining type of Arabic characters</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX826"><code>uc_locale_language</code></a></td><td valign="top"><a href="libunistring_14.html#SEC69">14.2 Case mappings of strings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX412"><code>uc_mirror_char</code></a></td><td valign="top"><a href="libunistring_8.html#SEC42">8.7 Mirrored character</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX411"><code>uc_numeric_value</code></a></td><td valign="top"><a href="libunistring_8.html#SEC41">8.6 Numeric value</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX570"><code>uc_property_byname</code></a></td><td valign="top"><a href="libunistring_8.html#SEC47">8.9.1 Properties as objects – the object oriented API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX571"><code>uc_property_is_valid</code></a></td><td valign="top"><a href="libunistring_8.html#SEC47">8.9.1 Properties as objects – the object oriented API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX483"><code>uc_property_t</code></a></td><td valign="top"><a href="libunistring_8.html#SEC47">8.9.1 Properties as objects – the object oriented API</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX661"><code>uc_script</code></a></td><td valign="top"><a href="libunistring_8.html#SEC49">8.10 Scripts</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX662"><code>uc_script_byname</code></a></td><td valign="top"><a href="libunistring_8.html#SEC49">8.10 Scripts</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX659"><code>uc_script_t</code></a></td><td valign="top"><a href="libunistring_8.html#SEC49">8.10 Scripts</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX823"><code>uc_tolower</code></a></td><td valign="top"><a href="libunistring_14.html#SEC68">14.1 Case mappings of characters</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX824"><code>uc_totitle</code></a></td><td valign="top"><a href="libunistring_14.html#SEC68">14.1 Case mappings of characters</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX822"><code>uc_toupper</code></a></td><td valign="top"><a href="libunistring_14.html#SEC68">14.1 Case mappings of characters</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_9.html#IDX696"><code>uc_width</code></a></td><td valign="top"><a href="libunistring_9.html#SEC53">9. Display width <code><uniwidth.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_11.html#IDX760"><code>uc_wordbreak_property</code></a></td><td valign="top"><a href="libunistring_11.html#SEC59">11.2 Word break property</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_1.html#IDX6">UCS-4</a></td><td valign="top"><a href="libunistring_1.html#SEC2">1.1 Unicode</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_3.html#IDX19"><code>ucs4_t</code></a></td><td valign="top"><a href="libunistring_3.html#SEC9">3. Elementary types <code><unitypes.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_3.html#IDX17"><code>uint16_t</code></a></td><td valign="top"><a href="libunistring_3.html#SEC9">3. Elementary types <code><unitypes.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_3.html#IDX18"><code>uint32_t</code></a></td><td valign="top"><a href="libunistring_3.html#SEC9">3. Elementary types <code><unitypes.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_3.html#IDX16"><code>uint8_t</code></a></td><td valign="top"><a href="libunistring_3.html#SEC9">3. Elementary types <code><unitypes.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX173"><code>ulc_asnprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC31">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX172"><code>ulc_asprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC31">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX870"><code>ulc_casecmp</code></a></td><td valign="top"><a href="libunistring_14.html#SEC71">14.4 Case insensitive comparison</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX882"><code>ulc_casecoll</code></a></td><td valign="top"><a href="libunistring_14.html#SEC71">14.4 Case insensitive comparison</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#IDX878"><code>ulc_casexfrm</code></a></td><td valign="top"><a href="libunistring_14.html#SEC71">14.4 Case insensitive comparison</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX226"><code>ulc_fprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC31">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_10.html#IDX712"><code>ulc_grapheme_breaks</code></a></td><td valign="top"><a href="libunistring_10.html#SEC55">10.1 Grapheme cluster breaks in a string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_12.html#IDX769"><code>ulc_possible_linebreaks</code></a></td><td valign="top"><a href="libunistring_12.html#SEC60">12. Line breaking <code><unilbrk.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX171"><code>ulc_snprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC31">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX170"><code>ulc_sprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC31">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX177"><code>ulc_vasnprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC31">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX176"><code>ulc_vasprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC31">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX227"><code>ulc_vfprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC31">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX175"><code>ulc_vsnprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC31">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_6.html#IDX174"><code>ulc_vsprintf</code></a></td><td valign="top"><a href="libunistring_6.html#SEC31">6. Output with Unicode strings <code><unistdio.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_12.html#IDX773"><code>ulc_width_linebreaks</code></a></td><td valign="top"><a href="libunistring_12.html#SEC60">12. Line breaking <code><unilbrk.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_11.html#IDX737"><code>ulc_wordbreaks</code></a></td><td valign="top"><a href="libunistring_11.html#SEC58">11.1 Word breaks in a string</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_1.html#SEC2">Unicode</a></td><td valign="top"><a href="libunistring_1.html#SEC2">1.1 Unicode</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC38">Unicode character, bidi class</a></td><td valign="top"><a href="libunistring_8.html#SEC38">8.3 Bidi class</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC38">Unicode character, bidirectional category</a></td><td valign="top"><a href="libunistring_8.html#SEC38">8.3 Bidi class</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX666">Unicode character, block</a></td><td valign="top"><a href="libunistring_8.html#SEC50">8.11 Blocks</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC37">Unicode character, canonical combining class</a></td><td valign="top"><a href="libunistring_8.html#SEC37">8.2 Canonical combining class</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#SEC68">Unicode character, case mappings</a></td><td valign="top"><a href="libunistring_14.html#SEC68">14.1 Case mappings of characters</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC34">Unicode character, classification</a></td><td valign="top"><a href="libunistring_8.html#SEC34">8.1 General category</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC52">Unicode character, classification like in C</a></td><td valign="top"><a href="libunistring_8.html#SEC52">8.13 Classifications like in ISO C</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC34">Unicode character, general category</a></td><td valign="top"><a href="libunistring_8.html#SEC34">8.1 General category</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC42">Unicode character, mirroring</a></td><td valign="top"><a href="libunistring_8.html#SEC42">8.7 Mirrored character</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_7.html#SEC32">Unicode character, name</a></td><td valign="top"><a href="libunistring_7.html#SEC32">7. Names of Unicode characters <code><uniname.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC46">Unicode character, properties</a></td><td valign="top"><a href="libunistring_8.html#SEC46">8.9 Properties</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX660">Unicode character, script</a></td><td valign="top"><a href="libunistring_8.html#SEC49">8.10 Scripts</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX676">Unicode character, validity in C identifiers</a></td><td valign="top"><a href="libunistring_8.html#SEC51">8.12 ISO C and Java syntax</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX678">Unicode character, validity in Java identifiers</a></td><td valign="top"><a href="libunistring_8.html#SEC51">8.12 ISO C and Java syntax</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC39">Unicode character, value</a></td><td valign="top"><a href="libunistring_8.html#SEC39">8.4 Decimal digit value</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC40">Unicode character, value</a></td><td valign="top"><a href="libunistring_8.html#SEC40">8.5 Digit value</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC41">Unicode character, value</a></td><td valign="top"><a href="libunistring_8.html#SEC41">8.6 Numeric value</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_9.html#IDX693">Unicode character, width</a></td><td valign="top"><a href="libunistring_9.html#SEC53">9. Display width <code><uniwidth.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_7.html#IDX229"><code>unicode_character_name</code></a></td><td valign="top"><a href="libunistring_7.html#SEC32">7. Names of Unicode characters <code><uniname.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_7.html#IDX230"><code>unicode_name_character</code></a></td><td valign="top"><a href="libunistring_7.html#SEC32">7. Names of Unicode characters <code><uniname.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX802"><code>uninorm_decomposing_form</code></a></td><td valign="top"><a href="libunistring_13.html#SEC64">13.3 Normalization of strings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX818"><code>uninorm_filter_create</code></a></td><td valign="top"><a href="libunistring_13.html#SEC66">13.5 Normalization of streams of Unicode characters</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX820"><code>uninorm_filter_flush</code></a></td><td valign="top"><a href="libunistring_13.html#SEC66">13.5 Normalization of streams of Unicode characters</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX821"><code>uninorm_filter_free</code></a></td><td valign="top"><a href="libunistring_13.html#SEC66">13.5 Normalization of streams of Unicode characters</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX819"><code>uninorm_filter_write</code></a></td><td valign="top"><a href="libunistring_13.html#SEC66">13.5 Normalization of streams of Unicode characters</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX800"><code>uninorm_is_compat_decomposing</code></a></td><td valign="top"><a href="libunistring_13.html#SEC64">13.3 Normalization of strings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX801"><code>uninorm_is_composing</code></a></td><td valign="top"><a href="libunistring_13.html#SEC64">13.3 Normalization of strings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX795"><code>uninorm_t</code></a></td><td valign="top"><a href="libunistring_13.html#SEC64">13.3 Normalization of strings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_14.html#SEC69">uppercasing</a></td><td valign="top"><a href="libunistring_14.html#SEC69">14.2 Case mappings of strings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_1.html#IDX1">use cases</a></td><td valign="top"><a href="libunistring_1.html#SEC1">1. Introduction</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_1.html#IDX4">UTF-16</a></td><td valign="top"><a href="libunistring_1.html#SEC2">1.1 Unicode</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_1.html#IDX12">UTF-16, strings</a></td><td valign="top"><a href="libunistring_1.html#SEC7">1.6 Unicode strings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_1.html#IDX5">UTF-32</a></td><td valign="top"><a href="libunistring_1.html#SEC2">1.1 Unicode</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_1.html#IDX13">UTF-32, strings</a></td><td valign="top"><a href="libunistring_1.html#SEC7">1.6 Unicode strings</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_1.html#IDX3">UTF-8</a></td><td valign="top"><a href="libunistring_1.html#SEC2">1.1 Unicode</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_1.html#IDX11">UTF-8, strings</a></td><td valign="top"><a href="libunistring_1.html#SEC7">1.6 Unicode strings</a></td></tr> <tr><td colspan="3"> <hr></td></tr> </table> -<table><tr><th valign="top">Jump to: </th><td><a href="libunistring_19.html#SEC77_0" class="summary-letter"><b>A</b></a> +<table><tr><th valign="top">Jump to: </th><td><a href="#SEC91_0" class="summary-letter"><b>A</b></a> -<a href="libunistring_19.html#SEC77_1" class="summary-letter"><b>B</b></a> +<a href="#SEC91_1" class="summary-letter"><b>B</b></a> -<a href="libunistring_19.html#SEC77_2" class="summary-letter"><b>C</b></a> +<a href="#SEC91_2" class="summary-letter"><b>C</b></a> -<a href="libunistring_19.html#SEC77_3" class="summary-letter"><b>D</b></a> +<a href="#SEC91_3" class="summary-letter"><b>D</b></a> -<a href="libunistring_19.html#SEC77_4" class="summary-letter"><b>E</b></a> +<a href="#SEC91_4" class="summary-letter"><b>E</b></a> -<a href="libunistring_19.html#SEC77_5" class="summary-letter"><b>F</b></a> +<a href="#SEC91_5" class="summary-letter"><b>F</b></a> -<a href="libunistring_19.html#SEC77_6" class="summary-letter"><b>G</b></a> +<a href="#SEC91_6" class="summary-letter"><b>G</b></a> -<a href="libunistring_19.html#SEC77_7" class="summary-letter"><b>H</b></a> +<a href="#SEC91_7" class="summary-letter"><b>H</b></a> -<a href="libunistring_19.html#SEC77_8" class="summary-letter"><b>I</b></a> +<a href="#SEC91_8" class="summary-letter"><b>I</b></a> -<a href="libunistring_19.html#SEC77_9" class="summary-letter"><b>J</b></a> +<a href="#SEC91_9" class="summary-letter"><b>J</b></a> -<a href="libunistring_19.html#SEC77_10" class="summary-letter"><b>L</b></a> +<a href="#SEC91_10" class="summary-letter"><b>L</b></a> -<a href="libunistring_19.html#SEC77_11" class="summary-letter"><b>M</b></a> +<a href="#SEC91_11" class="summary-letter"><b>M</b></a> -<a href="libunistring_19.html#SEC77_12" class="summary-letter"><b>N</b></a> +<a href="#SEC91_12" class="summary-letter"><b>N</b></a> -<a href="libunistring_19.html#SEC77_13" class="summary-letter"><b>O</b></a> +<a href="#SEC91_13" class="summary-letter"><b>O</b></a> -<a href="libunistring_19.html#SEC77_14" class="summary-letter"><b>P</b></a> +<a href="#SEC91_14" class="summary-letter"><b>P</b></a> -<a href="libunistring_19.html#SEC77_15" class="summary-letter"><b>R</b></a> +<a href="#SEC91_15" class="summary-letter"><b>R</b></a> -<a href="libunistring_19.html#SEC77_16" class="summary-letter"><b>S</b></a> +<a href="#SEC91_16" class="summary-letter"><b>S</b></a> -<a href="libunistring_19.html#SEC77_17" class="summary-letter"><b>T</b></a> +<a href="#SEC91_17" class="summary-letter"><b>T</b></a> -<a href="libunistring_19.html#SEC77_18" class="summary-letter"><b>U</b></a> +<a href="#SEC91_18" class="summary-letter"><b>U</b></a> -<a href="#INDEX0_0" class="summary-letter"><b>V</b></a> +<a href="libunistring_21.html#INDEX0_0" class="summary-letter"><b>V</b></a> -<a href="#INDEX0_1" class="summary-letter"><b>W</b></a> +<a href="libunistring_21.html#INDEX0_1" class="summary-letter"><b>W</b></a> </td></tr></table> - <hr size="6"> <table cellpadding="1" cellspacing="1" border="0"> -<tr><td valign="middle" align="left">[<a href="libunistring_19.html#SEC77" title="Beginning of this chapter or previous chapter"> << </a>]</td> -<td valign="middle" align="left">[ >> ]</td> +<tr><td valign="middle" align="left">[<a href="libunistring_19.html#SEC82" title="Beginning of this chapter or previous chapter"> << </a>]</td> +<td valign="middle" align="left">[<a href="libunistring_21.html#INDEX0" title="Next chapter"> >> </a>]</td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> @@ -176,12 +803,12 @@ ul.toc {list-style: none} <td valign="middle" align="left"> </td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Top" title="Cover (top) of document">Top</a>]</td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Contents" title="Table of contents">Contents</a>]</td> -<td valign="middle" align="left">[<a href="libunistring_19.html#SEC77" title="Index">Index</a>]</td> +<td valign="middle" align="left">[<a href="#SEC91" title="Index">Index</a>]</td> <td valign="middle" align="left">[<a href="libunistring_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <p> <font size="-1"> - This document was generated by <em>Daiki Ueno</em> on <em>November, 30 2017</em> using <a href="http://www.nongnu.org/texi2html/"><em>texi2html 1.78a</em></a>. + This document was generated by <em>Daiki Ueno</em> on <em>May, 25 2018</em> using <a href="http://www.nongnu.org/texi2html/"><em>texi2html 1.78a</em></a>. </font> <br> diff --git a/doc/libunistring_21.html b/doc/libunistring_21.html new file mode 100644 index 00000000..cdca4695 --- /dev/null +++ b/doc/libunistring_21.html @@ -0,0 +1,190 @@ +<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html401/loose.dtd"> +<html> +<!-- Created on May, 25 2018 by texi2html 1.78a --> +<!-- +Written by: Lionel Cons <Lionel.Cons@cern.ch> (original author) + Karl Berry <karl@freefriends.org> + Olaf Bachmann <obachman@mathematik.uni-kl.de> + and many others. +Maintained by: Many creative people. +Send bugs and suggestions to <texi2html-bug@nongnu.org> + +--> +<head> +<title>GNU libunistring: Index: V – W</title> + +<meta name="description" content="GNU libunistring: Index: V – W"> +<meta name="keywords" content="GNU libunistring: Index: V – W"> +<meta name="resource-type" content="document"> +<meta name="distribution" content="global"> +<meta name="Generator" content="texi2html 1.78a"> +<meta http-equiv="Content-Type" content="text/html; charset=utf-8"> +<style type="text/css"> +<!-- +a.summary-letter {text-decoration: none} +pre.display {font-family: serif} +pre.format {font-family: serif} +pre.menu-comment {font-family: serif} +pre.menu-preformatted {font-family: serif} +pre.smalldisplay {font-family: serif; font-size: smaller} +pre.smallexample {font-size: smaller} +pre.smallformat {font-family: serif; font-size: smaller} +pre.smalllisp {font-size: smaller} +span.roman {font-family:serif; font-weight:normal;} +span.sansserif {font-family:sans-serif; font-weight:normal;} +ul.toc {list-style: none} +--> +</style> + + +</head> + +<body lang="en" bgcolor="#FFFFFF" text="#000000" link="#0000FF" vlink="#800080" alink="#FF0000"> + +<table cellpadding="1" cellspacing="1" border="0"> +<tr><td valign="middle" align="left">[<a href="libunistring_20.html#SEC91" title="Beginning of this chapter or previous chapter"> << </a>]</td> +<td valign="middle" align="left">[ >> ]</td> +<td valign="middle" align="left"> </td> +<td valign="middle" align="left"> </td> +<td valign="middle" align="left"> </td> +<td valign="middle" align="left"> </td> +<td valign="middle" align="left"> </td> +<td valign="middle" align="left">[<a href="libunistring.html#SEC_Top" title="Cover (top) of document">Top</a>]</td> +<td valign="middle" align="left">[<a href="libunistring.html#SEC_Contents" title="Table of contents">Contents</a>]</td> +<td valign="middle" align="left">[<a href="libunistring_20.html#SEC91" title="Index">Index</a>]</td> +<td valign="middle" align="left">[<a href="libunistring_abt.html#SEC_About" title="About (help)"> ? </a>]</td> +</tr></table> + +<hr size="2"> +<a name="INDEX0"></a> +<h1 class="unnumbered"> Index: V – W </h1> +<table><tr><th valign="top">Jump to: </th><td><a href="libunistring_20.html#SEC91_0" class="summary-letter"><b>A</b></a> + +<a href="libunistring_20.html#SEC91_1" class="summary-letter"><b>B</b></a> + +<a href="libunistring_20.html#SEC91_2" class="summary-letter"><b>C</b></a> + +<a href="libunistring_20.html#SEC91_3" class="summary-letter"><b>D</b></a> + +<a href="libunistring_20.html#SEC91_4" class="summary-letter"><b>E</b></a> + +<a href="libunistring_20.html#SEC91_5" class="summary-letter"><b>F</b></a> + +<a href="libunistring_20.html#SEC91_6" class="summary-letter"><b>G</b></a> + +<a href="libunistring_20.html#SEC91_7" class="summary-letter"><b>H</b></a> + +<a href="libunistring_20.html#SEC91_8" class="summary-letter"><b>I</b></a> + +<a href="libunistring_20.html#SEC91_9" class="summary-letter"><b>J</b></a> + +<a href="libunistring_20.html#SEC91_10" class="summary-letter"><b>L</b></a> + +<a href="libunistring_20.html#SEC91_11" class="summary-letter"><b>M</b></a> + +<a href="libunistring_20.html#SEC91_12" class="summary-letter"><b>N</b></a> + +<a href="libunistring_20.html#SEC91_13" class="summary-letter"><b>O</b></a> + +<a href="libunistring_20.html#SEC91_14" class="summary-letter"><b>P</b></a> + +<a href="libunistring_20.html#SEC91_15" class="summary-letter"><b>R</b></a> + +<a href="libunistring_20.html#SEC91_16" class="summary-letter"><b>S</b></a> + +<a href="libunistring_20.html#SEC91_17" class="summary-letter"><b>T</b></a> + +<a href="libunistring_20.html#SEC91_18" class="summary-letter"><b>U</b></a> + +<a href="#INDEX0_0" class="summary-letter"><b>V</b></a> + +<a href="#INDEX0_1" class="summary-letter"><b>W</b></a> + +</td></tr></table> +<table border="0" class="index-cp"> +<tr><td></td><th align="left">Index Entry</th><th align="left"> Section</th></tr> +<tr><td colspan="3"> <hr></td></tr> +<tr><th><a name="INDEX0_0">V</a></th><td></td><td></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#SEC11">validity</a></td><td valign="top"><a href="libunistring_4.html#SEC11">4.1 Elementary string checks</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_1.html#IDX2">value, of libunistring</a></td><td valign="top"><a href="libunistring_1.html#SEC1">1. Introduction</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC39">value, of Unicode character</a></td><td valign="top"><a href="libunistring_8.html#SEC39">8.4 Decimal digit value</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC40">value, of Unicode character</a></td><td valign="top"><a href="libunistring_8.html#SEC40">8.5 Digit value</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC41">value, of Unicode character</a></td><td valign="top"><a href="libunistring_8.html#SEC41">8.6 Numeric value</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#SEC11">verification</a></td><td valign="top"><a href="libunistring_4.html#SEC11">4.1 Elementary string checks</a></td></tr> +<tr><td colspan="3"> <hr></td></tr> +<tr><th><a name="INDEX0_1">W</a></th><td></td><td></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_18.html#SEC81">wchar_t, type</a></td><td valign="top"><a href="libunistring_18.html#SEC81">A. The <code>wchar_t</code> mess</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_4.html#SEC11">well-formed</a></td><td valign="top"><a href="libunistring_4.html#SEC11">4.1 Elementary string checks</a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_9.html#SEC53">width</a></td><td valign="top"><a href="libunistring_9.html#SEC53">9. Display width <code><uniwidth.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_11.html#SEC57">word boundaries</a></td><td valign="top"><a href="libunistring_11.html#SEC57">11. Word breaks in strings <code><uniwbrk.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_11.html#SEC57">word breaks</a></td><td valign="top"><a href="libunistring_11.html#SEC57">11. Word breaks in strings <code><uniwbrk.h></code></a></td></tr> +<tr><td></td><td valign="top"><a href="libunistring_12.html#SEC60">wrapping</a></td><td valign="top"><a href="libunistring_12.html#SEC60">12. Line breaking <code><unilbrk.h></code></a></td></tr> +<tr><td colspan="3"> <hr></td></tr> +</table> +<table><tr><th valign="top">Jump to: </th><td><a href="libunistring_20.html#SEC91_0" class="summary-letter"><b>A</b></a> + +<a href="libunistring_20.html#SEC91_1" class="summary-letter"><b>B</b></a> + +<a href="libunistring_20.html#SEC91_2" class="summary-letter"><b>C</b></a> + +<a href="libunistring_20.html#SEC91_3" class="summary-letter"><b>D</b></a> + +<a href="libunistring_20.html#SEC91_4" class="summary-letter"><b>E</b></a> + +<a href="libunistring_20.html#SEC91_5" class="summary-letter"><b>F</b></a> + +<a href="libunistring_20.html#SEC91_6" class="summary-letter"><b>G</b></a> + +<a href="libunistring_20.html#SEC91_7" class="summary-letter"><b>H</b></a> + +<a href="libunistring_20.html#SEC91_8" class="summary-letter"><b>I</b></a> + +<a href="libunistring_20.html#SEC91_9" class="summary-letter"><b>J</b></a> + +<a href="libunistring_20.html#SEC91_10" class="summary-letter"><b>L</b></a> + +<a href="libunistring_20.html#SEC91_11" class="summary-letter"><b>M</b></a> + +<a href="libunistring_20.html#SEC91_12" class="summary-letter"><b>N</b></a> + +<a href="libunistring_20.html#SEC91_13" class="summary-letter"><b>O</b></a> + +<a href="libunistring_20.html#SEC91_14" class="summary-letter"><b>P</b></a> + +<a href="libunistring_20.html#SEC91_15" class="summary-letter"><b>R</b></a> + +<a href="libunistring_20.html#SEC91_16" class="summary-letter"><b>S</b></a> + +<a href="libunistring_20.html#SEC91_17" class="summary-letter"><b>T</b></a> + +<a href="libunistring_20.html#SEC91_18" class="summary-letter"><b>U</b></a> + +<a href="#INDEX0_0" class="summary-letter"><b>V</b></a> + +<a href="#INDEX0_1" class="summary-letter"><b>W</b></a> + +</td></tr></table> + +<hr size="6"> +<table cellpadding="1" cellspacing="1" border="0"> +<tr><td valign="middle" align="left">[<a href="libunistring_20.html#SEC91" title="Beginning of this chapter or previous chapter"> << </a>]</td> +<td valign="middle" align="left">[ >> ]</td> +<td valign="middle" align="left"> </td> +<td valign="middle" align="left"> </td> +<td valign="middle" align="left"> </td> +<td valign="middle" align="left"> </td> +<td valign="middle" align="left"> </td> +<td valign="middle" align="left">[<a href="libunistring.html#SEC_Top" title="Cover (top) of document">Top</a>]</td> +<td valign="middle" align="left">[<a href="libunistring.html#SEC_Contents" title="Table of contents">Contents</a>]</td> +<td valign="middle" align="left">[<a href="libunistring_20.html#SEC91" title="Index">Index</a>]</td> +<td valign="middle" align="left">[<a href="libunistring_abt.html#SEC_About" title="About (help)"> ? </a>]</td> +</tr></table> +<p> + <font size="-1"> + This document was generated by <em>Daiki Ueno</em> on <em>May, 25 2018</em> using <a href="http://www.nongnu.org/texi2html/"><em>texi2html 1.78a</em></a>. + </font> + <br> + +</p> +</body> +</html> diff --git a/doc/libunistring_3.html b/doc/libunistring_3.html index b67ac90d..cf73702e 100644 --- a/doc/libunistring_3.html +++ b/doc/libunistring_3.html @@ -1,6 +1,6 @@ <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html401/loose.dtd"> <html> -<!-- Created on November, 30 2017 by texi2html 1.78a --> +<!-- Created on May, 25 2018 by texi2html 1.78a --> <!-- Written by: Lionel Cons <Lionel.Cons@cern.ch> (original author) Karl Berry <karl@freefriends.org> @@ -42,8 +42,8 @@ ul.toc {list-style: none} <body lang="en" bgcolor="#FFFFFF" text="#000000" link="#0000FF" vlink="#800080" alink="#FF0000"> <table cellpadding="1" cellspacing="1" border="0"> -<tr><td valign="middle" align="left">[<a href="libunistring_2.html#SEC9" title="Beginning of this chapter or previous chapter"> << </a>]</td> -<td valign="middle" align="left">[<a href="libunistring_4.html#SEC11" title="Next chapter"> >> </a>]</td> +<tr><td valign="middle" align="left">[<a href="libunistring_2.html#SEC8" title="Beginning of this chapter or previous chapter"> << </a>]</td> +<td valign="middle" align="left">[<a href="libunistring_4.html#SEC10" title="Next chapter"> >> </a>]</td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> @@ -51,14 +51,14 @@ ul.toc {list-style: none} <td valign="middle" align="left"> </td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Top" title="Cover (top) of document">Top</a>]</td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Contents" title="Table of contents">Contents</a>]</td> -<td valign="middle" align="left">[<a href="libunistring_19.html#SEC77" title="Index">Index</a>]</td> +<td valign="middle" align="left">[<a href="libunistring_20.html#SEC91" title="Index">Index</a>]</td> <td valign="middle" align="left">[<a href="libunistring_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <hr size="2"> <a name="unitypes_002eh"></a> -<a name="SEC10"></a> -<h1 class="chapter"> <a href="libunistring.html#TOC10">3. Elementary types <code><unitypes.h></code></a> </h1> +<a name="SEC9"></a> +<h1 class="chapter"> <a href="libunistring.html#TOC9">3. Elementary types <code><unitypes.h></code></a> </h1> <p>The include file <code><unitypes.h></code> provides the following basic types. </p> @@ -82,10 +82,22 @@ taken from <code><stdint.h></code>, on platforms where this include file i </dt> <dd><p>This type represents a single Unicode character, outside of an UTF-32 string. </p></dd></dl> + +<p>The types <code>ucs4_t</code> and <code>uint32_t</code> happen to be identical. They differ +in use and intent, however: +</p><ul> +<li> +Use <code>uint32_t *</code> to designate an UTF-32 string. Use <code>ucs4_t</code> to +designate a single Unicode character, outside of an UTF-32 string. +</li><li> +Conversions functions that take an UTF-32 string as input will usually perform +a range-check on the <code>uint32_t</code> values. Whereas functions that are +declared to take <code>ucs4_t</code> arguments will not perform such a range-check. +</li></ul> <hr size="6"> <table cellpadding="1" cellspacing="1" border="0"> -<tr><td valign="middle" align="left">[<a href="libunistring_2.html#SEC9" title="Beginning of this chapter or previous chapter"> << </a>]</td> -<td valign="middle" align="left">[<a href="libunistring_4.html#SEC11" title="Next chapter"> >> </a>]</td> +<tr><td valign="middle" align="left">[<a href="libunistring_2.html#SEC8" title="Beginning of this chapter or previous chapter"> << </a>]</td> +<td valign="middle" align="left">[<a href="libunistring_4.html#SEC10" title="Next chapter"> >> </a>]</td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> @@ -93,12 +105,12 @@ taken from <code><stdint.h></code>, on platforms where this include file i <td valign="middle" align="left"> </td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Top" title="Cover (top) of document">Top</a>]</td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Contents" title="Table of contents">Contents</a>]</td> -<td valign="middle" align="left">[<a href="libunistring_19.html#SEC77" title="Index">Index</a>]</td> +<td valign="middle" align="left">[<a href="libunistring_20.html#SEC91" title="Index">Index</a>]</td> <td valign="middle" align="left">[<a href="libunistring_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <p> <font size="-1"> - This document was generated by <em>Daiki Ueno</em> on <em>November, 30 2017</em> using <a href="http://www.nongnu.org/texi2html/"><em>texi2html 1.78a</em></a>. + This document was generated by <em>Daiki Ueno</em> on <em>May, 25 2018</em> using <a href="http://www.nongnu.org/texi2html/"><em>texi2html 1.78a</em></a>. </font> <br> diff --git a/doc/libunistring_4.html b/doc/libunistring_4.html index b6896ee3..f54eec52 100644 --- a/doc/libunistring_4.html +++ b/doc/libunistring_4.html @@ -1,6 +1,6 @@ <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html401/loose.dtd"> <html> -<!-- Created on November, 30 2017 by texi2html 1.78a --> +<!-- Created on May, 25 2018 by texi2html 1.78a --> <!-- Written by: Lionel Cons <Lionel.Cons@cern.ch> (original author) Karl Berry <karl@freefriends.org> @@ -42,8 +42,8 @@ ul.toc {list-style: none} <body lang="en" bgcolor="#FFFFFF" text="#000000" link="#0000FF" vlink="#800080" alink="#FF0000"> <table cellpadding="1" cellspacing="1" border="0"> -<tr><td valign="middle" align="left">[<a href="libunistring_3.html#SEC10" title="Beginning of this chapter or previous chapter"> << </a>]</td> -<td valign="middle" align="left">[<a href="libunistring_5.html#SEC17" title="Next chapter"> >> </a>]</td> +<tr><td valign="middle" align="left">[<a href="libunistring_3.html#SEC9" title="Beginning of this chapter or previous chapter"> << </a>]</td> +<td valign="middle" align="left">[<a href="libunistring_5.html#SEC30" title="Next chapter"> >> </a>]</td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> @@ -51,14 +51,14 @@ ul.toc {list-style: none} <td valign="middle" align="left"> </td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Top" title="Cover (top) of document">Top</a>]</td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Contents" title="Table of contents">Contents</a>]</td> -<td valign="middle" align="left">[<a href="libunistring_19.html#SEC77" title="Index">Index</a>]</td> +<td valign="middle" align="left">[<a href="libunistring_20.html#SEC91" title="Index">Index</a>]</td> <td valign="middle" align="left">[<a href="libunistring_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <hr size="2"> <a name="unistr_002eh"></a> -<a name="SEC11"></a> -<h1 class="chapter"> <a href="libunistring.html#TOC11">4. Elementary Unicode string functions <code><unistr.h></code></a> </h1> +<a name="SEC10"></a> +<h1 class="chapter"> <a href="libunistring.html#TOC10">4. Elementary Unicode string functions <code><unistr.h></code></a> </h1> <p>This include file declares elementary functions for Unicode strings. It is essentially the equivalent of what <code><string.h></code> is for C strings. @@ -66,8 +66,8 @@ essentially the equivalent of what <code><string.h></code> is for C string <hr size="6"> <a name="Elementary-string-checks"></a> -<a name="SEC12"></a> -<h2 class="section"> <a href="libunistring.html#TOC12">4.1 Elementary string checks</a> </h2> +<a name="SEC11"></a> +<h2 class="section"> <a href="libunistring.html#TOC11">4.1 Elementary string checks</a> </h2> <p>The following function is available to verify the integrity of a Unicode string. </p> @@ -87,8 +87,8 @@ It returns NULL if valid, or a pointer to the first invalid unit otherwise. <hr size="6"> <a name="Elementary-string-conversions"></a> -<a name="SEC13"></a> -<h2 class="section"> <a href="libunistring.html#TOC13">4.2 Elementary string conversions</a> </h2> +<a name="SEC12"></a> +<h2 class="section"> <a href="libunistring.html#TOC12">4.2 Elementary string conversions</a> </h2> <p>The following functions perform conversions between the different forms of Unicode strings. </p> @@ -97,6 +97,9 @@ It returns NULL if valid, or a pointer to the first invalid unit otherwise. <a name="IDX23"></a> </dt> <dd><p>Converts an UTF-8 string to an UTF-16 string. +</p> +<p>The <var>resultbuf</var> and <var>lengthp</var> arguments are as described in +chapter <a href="libunistring_2.html#SEC8">Conventions</a>. </p></dd></dl> <dl> @@ -104,6 +107,9 @@ It returns NULL if valid, or a pointer to the first invalid unit otherwise. <a name="IDX24"></a> </dt> <dd><p>Converts an UTF-8 string to an UTF-32 string. +</p> +<p>The <var>resultbuf</var> and <var>lengthp</var> arguments are as described in +chapter <a href="libunistring_2.html#SEC8">Conventions</a>. </p></dd></dl> <dl> @@ -111,6 +117,9 @@ It returns NULL if valid, or a pointer to the first invalid unit otherwise. <a name="IDX25"></a> </dt> <dd><p>Converts an UTF-16 string to an UTF-8 string. +</p> +<p>The <var>resultbuf</var> and <var>lengthp</var> arguments are as described in +chapter <a href="libunistring_2.html#SEC8">Conventions</a>. </p></dd></dl> <dl> @@ -118,6 +127,9 @@ It returns NULL if valid, or a pointer to the first invalid unit otherwise. <a name="IDX26"></a> </dt> <dd><p>Converts an UTF-16 string to an UTF-32 string. +</p> +<p>The <var>resultbuf</var> and <var>lengthp</var> arguments are as described in +chapter <a href="libunistring_2.html#SEC8">Conventions</a>. </p></dd></dl> <dl> @@ -125,6 +137,9 @@ It returns NULL if valid, or a pointer to the first invalid unit otherwise. <a name="IDX27"></a> </dt> <dd><p>Converts an UTF-32 string to an UTF-8 string. +</p> +<p>The <var>resultbuf</var> and <var>lengthp</var> arguments are as described in +chapter <a href="libunistring_2.html#SEC8">Conventions</a>. </p></dd></dl> <dl> @@ -132,12 +147,21 @@ It returns NULL if valid, or a pointer to the first invalid unit otherwise. <a name="IDX28"></a> </dt> <dd><p>Converts an UTF-32 string to an UTF-16 string. +</p> +<p>The <var>resultbuf</var> and <var>lengthp</var> arguments are as described in +chapter <a href="libunistring_2.html#SEC8">Conventions</a>. </p></dd></dl> <hr size="6"> <a name="Elementary-string-functions"></a> +<a name="SEC13"></a> +<h2 class="section"> <a href="libunistring.html#TOC13">4.3 Elementary string functions</a> </h2> + + +<hr size="6"> +<a name="Iterating"></a> <a name="SEC14"></a> -<h2 class="section"> <a href="libunistring.html#TOC14">4.3 Elementary string functions</a> </h2> +<h3 class="subsection"> <a href="libunistring.html#TOC14">4.3.1 Iterating over a Unicode string</a> </h3> <p>The following functions inspect and return details about the first character in a Unicode string. @@ -156,18 +180,18 @@ in a Unicode string. is no longer than <var>n</var>. Returns 0 if it is the NUL character. Returns -1 upon failure. </p> -<p>This function is similar to <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/mblen.html"><code>mblen</code></a>, except that it operates on a +<p>This function is similar to <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/mblen.html"><code>mblen</code></a>, except that it operates on a Unicode string and that <var>s</var> must not be NULL. </p></dd></dl> <dl> -<dt><u>Function:</u> int <b>u8_mbtouc_unsafe</b><i> (ucs4_t *<var>puc</var>, const uint8_t *<var>s</var>, size_t <var>n</var>)</i> +<dt><u>Function:</u> int <b>u8_mbtouc</b><i> (ucs4_t *<var>puc</var>, const uint8_t *<var>s</var>, size_t <var>n</var>)</i> <a name="IDX32"></a> </dt> -<dt><u>Function:</u> int <b>u16_mbtouc_unsafe</b><i> (ucs4_t *<var>puc</var>, const uint16_t *<var>s</var>, size_t <var>n</var>)</i> +<dt><u>Function:</u> int <b>u16_mbtouc</b><i> (ucs4_t *<var>puc</var>, const uint16_t *<var>s</var>, size_t <var>n</var>)</i> <a name="IDX33"></a> </dt> -<dt><u>Function:</u> int <b>u32_mbtouc_unsafe</b><i> (ucs4_t *<var>puc</var>, const uint32_t *<var>s</var>, size_t <var>n</var>)</i> +<dt><u>Function:</u> int <b>u32_mbtouc</b><i> (ucs4_t *<var>puc</var>, const uint32_t *<var>s</var>, size_t <var>n</var>)</i> <a name="IDX34"></a> </dt> <dd><p>Returns the length (number of units) of the first character in <var>s</var>, @@ -177,24 +201,28 @@ is returned. </p> <p>The number of available units, <var>n</var>, must be > 0. </p> -<p>This function is similar to <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/mbtowc.html"><code>mbtowc</code></a>, except that it operates on a +<p>This function fails if an invalid sequence of units is encountered at the +beginning of <var>s</var>, or if additional units (after the <var>n</var> provided units) +would be needed to form a character. +</p> +<p>This function is similar to <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/mbtowc.html"><code>mbtowc</code></a>, except that it operates on a Unicode string, <var>puc</var> and <var>s</var> must not be NULL, <var>n</var> must be > 0, and the NUL character is not treated specially. </p></dd></dl> <dl> -<dt><u>Function:</u> int <b>u8_mbtouc</b><i> (ucs4_t *<var>puc</var>, const uint8_t *<var>s</var>, size_t <var>n</var>)</i> +<dt><u>Function:</u> int <b>u8_mbtouc_unsafe</b><i> (ucs4_t *<var>puc</var>, const uint8_t *<var>s</var>, size_t <var>n</var>)</i> <a name="IDX35"></a> </dt> -<dt><u>Function:</u> int <b>u16_mbtouc</b><i> (ucs4_t *<var>puc</var>, const uint16_t *<var>s</var>, size_t <var>n</var>)</i> +<dt><u>Function:</u> int <b>u16_mbtouc_unsafe</b><i> (ucs4_t *<var>puc</var>, const uint16_t *<var>s</var>, size_t <var>n</var>)</i> <a name="IDX36"></a> </dt> -<dt><u>Function:</u> int <b>u32_mbtouc</b><i> (ucs4_t *<var>puc</var>, const uint32_t *<var>s</var>, size_t <var>n</var>)</i> +<dt><u>Function:</u> int <b>u32_mbtouc_unsafe</b><i> (ucs4_t *<var>puc</var>, const uint32_t *<var>s</var>, size_t <var>n</var>)</i> <a name="IDX37"></a> </dt> -<dd><p>This function is like <code>u8_mbtouc_unsafe</code>, except that it will detect an -invalid UTF-8 character, even if the library is compiled without -‘<samp>--enable-safety</samp>’. +<dd><p>This function is identical to <code>u8_mbtouc</code>/<code>u16_mbtouc</code>/<code>u32_mbtouc</code>. +Earlier versions of this function performed fewer range-checks on the sequence +of units. </p></dd></dl> <dl> @@ -215,9 +243,14 @@ sequence of units, -2 is returned for an incomplete sequence of units. <p>The number of available units, <var>n</var>, must be > 0. </p> <p>This function is similar to <code>u8_mbtouc</code>, except that the return value -gives more details about the failure, similar to <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/mbrtowc.html"><code>mbrtowc</code></a>. +gives more details about the failure, similar to <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/mbrtowc.html"><code>mbrtowc</code></a>. </p></dd></dl> +<hr size="6"> +<a name="Creating-Unicode-strings"></a> +<a name="SEC15"></a> +<h3 class="subsection"> <a href="libunistring.html#TOC15">4.3.2 Creating Unicode strings one character at a time</a> </h3> + <p>The following function stores a Unicode character as a Unicode string in memory. </p> @@ -235,44 +268,48 @@ memory. length. Returns -1 upon failure, -2 if the number of available units, <var>n</var>, is too small. The latter case cannot occur if <var>n</var> >= 6/2/1, respectively. </p> -<p>This function is similar to <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/wctomb.html"><code>wctomb</code></a>, except that it operates on a +<p>This function is similar to <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/wctomb.html"><code>wctomb</code></a>, except that it operates on a Unicode strings, <var>s</var> must not be NULL, and the argument <var>n</var> must be specified. </p></dd></dl> -<a name="IDX44"></a> +<hr size="6"> +<a name="Copying-Unicode-strings"></a> +<a name="SEC16"></a> +<h3 class="subsection"> <a href="libunistring.html#TOC16">4.3.3 Copying Unicode strings</a> </h3> + <p>The following functions copy Unicode strings in memory. </p> <dl> <dt><u>Function:</u> uint8_t * <b>u8_cpy</b><i> (uint8_t *<var>dest</var>, const uint8_t *<var>src</var>, size_t <var>n</var>)</i> -<a name="IDX45"></a> +<a name="IDX44"></a> </dt> <dt><u>Function:</u> uint16_t * <b>u16_cpy</b><i> (uint16_t *<var>dest</var>, const uint16_t *<var>src</var>, size_t <var>n</var>)</i> -<a name="IDX46"></a> +<a name="IDX45"></a> </dt> <dt><u>Function:</u> uint32_t * <b>u32_cpy</b><i> (uint32_t *<var>dest</var>, const uint32_t *<var>src</var>, size_t <var>n</var>)</i> -<a name="IDX47"></a> +<a name="IDX46"></a> </dt> <dd><p>Copies <var>n</var> units from <var>src</var> to <var>dest</var>. </p> -<p>This function is similar to <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/memcpy.html"><code>memcpy</code></a>, except that it operates on +<p>This function is similar to <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/memcpy.html"><code>memcpy</code></a>, except that it operates on Unicode strings. </p></dd></dl> <dl> <dt><u>Function:</u> uint8_t * <b>u8_move</b><i> (uint8_t *<var>dest</var>, const uint8_t *<var>src</var>, size_t <var>n</var>)</i> -<a name="IDX48"></a> +<a name="IDX47"></a> </dt> <dt><u>Function:</u> uint16_t * <b>u16_move</b><i> (uint16_t *<var>dest</var>, const uint16_t *<var>src</var>, size_t <var>n</var>)</i> -<a name="IDX49"></a> +<a name="IDX48"></a> </dt> <dt><u>Function:</u> uint32_t * <b>u32_move</b><i> (uint32_t *<var>dest</var>, const uint32_t *<var>src</var>, size_t <var>n</var>)</i> -<a name="IDX50"></a> +<a name="IDX49"></a> </dt> <dd><p>Copies <var>n</var> units from <var>src</var> to <var>dest</var>, guaranteeing correct behavior for overlapping memory areas. </p> -<p>This function is similar to <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/memmove.html"><code>memmove</code></a>, except that it operates on +<p>This function is similar to <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/memmove.html"><code>memmove</code></a>, except that it operates on Unicode strings. </p></dd></dl> @@ -280,40 +317,44 @@ Unicode strings. </p> <dl> <dt><u>Function:</u> uint8_t * <b>u8_set</b><i> (uint8_t *<var>s</var>, ucs4_t <var>uc</var>, size_t <var>n</var>)</i> -<a name="IDX51"></a> +<a name="IDX50"></a> </dt> <dt><u>Function:</u> uint16_t * <b>u16_set</b><i> (uint16_t *<var>s</var>, ucs4_t <var>uc</var>, size_t <var>n</var>)</i> -<a name="IDX52"></a> +<a name="IDX51"></a> </dt> <dt><u>Function:</u> uint32_t * <b>u32_set</b><i> (uint32_t *<var>s</var>, ucs4_t <var>uc</var>, size_t <var>n</var>)</i> -<a name="IDX53"></a> +<a name="IDX52"></a> </dt> <dd><p>Sets the first <var>n</var> characters of <var>s</var> to <var>uc</var>. <var>uc</var> should be a character that occupies only 1 unit. </p> -<p>This function is similar to <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/memset.html"><code>memset</code></a>, except that it operates on +<p>This function is similar to <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/memset.html"><code>memset</code></a>, except that it operates on Unicode strings. </p></dd></dl> -<a name="IDX54"></a> +<hr size="6"> +<a name="Comparing-Unicode-strings"></a> +<a name="SEC17"></a> +<h3 class="subsection"> <a href="libunistring.html#TOC17">4.3.4 Comparing Unicode strings</a> </h3> + <p>The following function compares two Unicode strings of the same length. </p> <dl> <dt><u>Function:</u> int <b>u8_cmp</b><i> (const uint8_t *<var>s1</var>, const uint8_t *<var>s2</var>, size_t <var>n</var>)</i> -<a name="IDX55"></a> +<a name="IDX53"></a> </dt> <dt><u>Function:</u> int <b>u16_cmp</b><i> (const uint16_t *<var>s1</var>, const uint16_t *<var>s2</var>, size_t <var>n</var>)</i> -<a name="IDX56"></a> +<a name="IDX54"></a> </dt> <dt><u>Function:</u> int <b>u32_cmp</b><i> (const uint32_t *<var>s1</var>, const uint32_t *<var>s2</var>, size_t <var>n</var>)</i> -<a name="IDX57"></a> +<a name="IDX55"></a> </dt> <dd><p>Compares <var>s1</var> and <var>s2</var>, each of length <var>n</var>, lexicographically. Returns a negative value if <var>s1</var> compares smaller than <var>s2</var>, a positive value if <var>s1</var> compares larger than <var>s2</var>, or 0 if they compare equal. </p> -<p>This function is similar to <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/memcmp.html"><code>memcmp</code></a>, except that it operates on +<p>This function is similar to <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/memcmp.html"><code>memcmp</code></a>, except that it operates on Unicode strings. </p></dd></dl> @@ -322,13 +363,13 @@ lengths. </p> <dl> <dt><u>Function:</u> int <b>u8_cmp2</b><i> (const uint8_t *<var>s1</var>, size_t <var>n1</var>, const uint8_t *<var>s2</var>, size_t <var>n2</var>)</i> -<a name="IDX58"></a> +<a name="IDX56"></a> </dt> <dt><u>Function:</u> int <b>u16_cmp2</b><i> (const uint16_t *<var>s1</var>, size_t <var>n1</var>, const uint16_t *<var>s2</var>, size_t <var>n2</var>)</i> -<a name="IDX59"></a> +<a name="IDX57"></a> </dt> <dt><u>Function:</u> int <b>u32_cmp2</b><i> (const uint32_t *<var>s1</var>, size_t <var>n1</var>, const uint32_t *<var>s2</var>, size_t <var>n2</var>)</i> -<a name="IDX60"></a> +<a name="IDX58"></a> </dt> <dd><p>Compares <var>s1</var> and <var>s2</var>, lexicographically. Returns a negative value if <var>s1</var> compares smaller than <var>s2</var>, @@ -339,39 +380,47 @@ they compare equal. operates on Unicode strings. </p></dd></dl> -<a name="IDX61"></a> +<hr size="6"> +<a name="Searching-for-a-character"></a> +<a name="SEC18"></a> +<h3 class="subsection"> <a href="libunistring.html#TOC18">4.3.5 Searching for a character in a Unicode string</a> </h3> + <p>The following function searches for a given Unicode character. </p> <dl> <dt><u>Function:</u> uint8_t * <b>u8_chr</b><i> (const uint8_t *<var>s</var>, size_t <var>n</var>, ucs4_t <var>uc</var>)</i> -<a name="IDX62"></a> +<a name="IDX59"></a> </dt> <dt><u>Function:</u> uint16_t * <b>u16_chr</b><i> (const uint16_t *<var>s</var>, size_t <var>n</var>, ucs4_t <var>uc</var>)</i> -<a name="IDX63"></a> +<a name="IDX60"></a> </dt> <dt><u>Function:</u> uint32_t * <b>u32_chr</b><i> (const uint32_t *<var>s</var>, size_t <var>n</var>, ucs4_t <var>uc</var>)</i> -<a name="IDX64"></a> +<a name="IDX61"></a> </dt> <dd><p>Searches the string at <var>s</var> for <var>uc</var>. Returns a pointer to the first occurrence of <var>uc</var> in <var>s</var>, or NULL if <var>uc</var> does not occur in <var>s</var>. </p> -<p>This function is similar to <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/memchr.html"><code>memchr</code></a>, except that it operates on +<p>This function is similar to <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/memchr.html"><code>memchr</code></a>, except that it operates on Unicode strings. </p></dd></dl> -<a name="IDX65"></a> +<hr size="6"> +<a name="Counting-characters"></a> +<a name="SEC19"></a> +<h3 class="subsection"> <a href="libunistring.html#TOC19">4.3.6 Counting the characters in a Unicode string</a> </h3> + <p>The following function counts the number of Unicode characters. </p> <dl> <dt><u>Function:</u> size_t <b>u8_mbsnlen</b><i> (const uint8_t *<var>s</var>, size_t <var>n</var>)</i> -<a name="IDX66"></a> +<a name="IDX62"></a> </dt> <dt><u>Function:</u> size_t <b>u16_mbsnlen</b><i> (const uint16_t *<var>s</var>, size_t <var>n</var>)</i> -<a name="IDX67"></a> +<a name="IDX63"></a> </dt> <dt><u>Function:</u> size_t <b>u32_mbsnlen</b><i> (const uint32_t *<var>s</var>, size_t <var>n</var>)</i> -<a name="IDX68"></a> +<a name="IDX64"></a> </dt> <dd><p>Counts and returns the number of Unicode characters in the <var>n</var> units from <var>s</var>. @@ -382,56 +431,62 @@ it operates on Unicode strings. <hr size="6"> <a name="Elementary-string-functions-with-memory-allocation"></a> -<a name="SEC15"></a> -<h2 class="section"> <a href="libunistring.html#TOC15">4.4 Elementary string functions with memory allocation</a> </h2> +<a name="SEC20"></a> +<h2 class="section"> <a href="libunistring.html#TOC20">4.4 Elementary string functions with memory allocation</a> </h2> <p>The following function copies a Unicode string. </p> <dl> <dt><u>Function:</u> uint8_t * <b>u8_cpy_alloc</b><i> (const uint8_t *<var>s</var>, size_t <var>n</var>)</i> -<a name="IDX69"></a> +<a name="IDX65"></a> </dt> <dt><u>Function:</u> uint16_t * <b>u16_cpy_alloc</b><i> (const uint16_t *<var>s</var>, size_t <var>n</var>)</i> -<a name="IDX70"></a> +<a name="IDX66"></a> </dt> <dt><u>Function:</u> uint32_t * <b>u32_cpy_alloc</b><i> (const uint32_t *<var>s</var>, size_t <var>n</var>)</i> -<a name="IDX71"></a> +<a name="IDX67"></a> </dt> <dd><p>Makes a freshly allocated copy of <var>s</var>, of length <var>n</var>. </p></dd></dl> <hr size="6"> <a name="Elementary-string-functions-on-NUL-terminated-strings"></a> -<a name="SEC16"></a> -<h2 class="section"> <a href="libunistring.html#TOC16">4.5 Elementary string functions on NUL terminated strings</a> </h2> +<a name="SEC21"></a> +<h2 class="section"> <a href="libunistring.html#TOC21">4.5 Elementary string functions on NUL terminated strings</a> </h2> + + +<hr size="6"> +<a name="Iterating-over-a-NUL-terminated-Unicode-string"></a> +<a name="SEC22"></a> +<h3 class="subsection"> <a href="libunistring.html#TOC22">4.5.1 Iterating over a NUL terminated Unicode string</a> </h3> <p>The following functions inspect and return details about the first character in a Unicode string. </p> <dl> <dt><u>Function:</u> int <b>u8_strmblen</b><i> (const uint8_t *<var>s</var>)</i> -<a name="IDX72"></a> +<a name="IDX68"></a> </dt> <dt><u>Function:</u> int <b>u16_strmblen</b><i> (const uint16_t *<var>s</var>)</i> -<a name="IDX73"></a> +<a name="IDX69"></a> </dt> <dt><u>Function:</u> int <b>u32_strmblen</b><i> (const uint32_t *<var>s</var>)</i> -<a name="IDX74"></a> +<a name="IDX70"></a> </dt> <dd><p>Returns the length (number of units) of the first character in <var>s</var>. Returns 0 if it is the NUL character. Returns -1 upon failure. </p></dd></dl> -<a name="IDX75"></a> +<a name="IDX71"></a> <dl> <dt><u>Function:</u> int <b>u8_strmbtouc</b><i> (ucs4_t *<var>puc</var>, const uint8_t *<var>s</var>)</i> -<a name="IDX76"></a> +<a name="IDX72"></a> </dt> <dt><u>Function:</u> int <b>u16_strmbtouc</b><i> (ucs4_t *<var>puc</var>, const uint16_t *<var>s</var>)</i> -<a name="IDX77"></a> +<a name="IDX73"></a> </dt> <dt><u>Function:</u> int <b>u32_strmbtouc</b><i> (ucs4_t *<var>puc</var>, const uint32_t *<var>s</var>)</i> -<a name="IDX78"></a> +<a name="IDX74"></a> </dt> <dd><p>Returns the length (number of units) of the first character in <var>s</var>, putting its <code>ucs4_t</code> representation in <code>*<var>puc</var></code>. Returns 0 @@ -440,13 +495,13 @@ if it is the NUL character. Returns -1 upon failure. <dl> <dt><u>Function:</u> const uint8_t * <b>u8_next</b><i> (ucs4_t *<var>puc</var>, const uint8_t *<var>s</var>)</i> -<a name="IDX79"></a> +<a name="IDX75"></a> </dt> <dt><u>Function:</u> const uint16_t * <b>u16_next</b><i> (ucs4_t *<var>puc</var>, const uint16_t *<var>s</var>)</i> -<a name="IDX80"></a> +<a name="IDX76"></a> </dt> <dt><u>Function:</u> const uint32_t * <b>u32_next</b><i> (ucs4_t *<var>puc</var>, const uint32_t *<var>s</var>)</i> -<a name="IDX81"></a> +<a name="IDX77"></a> </dt> <dd><p>Forward iteration step. Advances the pointer past the next character, or returns NULL if the end of the string has been reached. Puts the @@ -458,13 +513,13 @@ character in a Unicode string. </p> <dl> <dt><u>Function:</u> const uint8_t * <b>u8_prev</b><i> (ucs4_t *<var>puc</var>, const uint8_t *<var>s</var>, const uint8_t *<var>start</var>)</i> -<a name="IDX82"></a> +<a name="IDX78"></a> </dt> <dt><u>Function:</u> const uint16_t * <b>u16_prev</b><i> (ucs4_t *<var>puc</var>, const uint16_t *<var>s</var>, const uint16_t *<var>start</var>)</i> -<a name="IDX83"></a> +<a name="IDX79"></a> </dt> <dt><u>Function:</u> const uint32_t * <b>u32_prev</b><i> (ucs4_t *<var>puc</var>, const uint32_t *<var>s</var>, const uint32_t *<var>start</var>)</i> -<a name="IDX84"></a> +<a name="IDX80"></a> </dt> <dd><p>Backward iteration step. Advances the pointer to point to the previous character (the one that ends at <code><var>s</var></code>), or returns NULL if the @@ -473,101 +528,110 @@ Puts the character's <code>ucs4_t</code> representation in <code>*<var>puc</var> Note that this function works only on well-formed Unicode strings. </p></dd></dl> +<hr size="6"> +<a name="Length"></a> +<a name="SEC23"></a> +<h3 class="subsection"> <a href="libunistring.html#TOC23">4.5.2 Length of a NUL terminated Unicode string</a> </h3> + <p>The following functions determine the length of a Unicode string. </p> <dl> <dt><u>Function:</u> size_t <b>u8_strlen</b><i> (const uint8_t *<var>s</var>)</i> -<a name="IDX85"></a> +<a name="IDX81"></a> </dt> <dt><u>Function:</u> size_t <b>u16_strlen</b><i> (const uint16_t *<var>s</var>)</i> -<a name="IDX86"></a> +<a name="IDX82"></a> </dt> <dt><u>Function:</u> size_t <b>u32_strlen</b><i> (const uint32_t *<var>s</var>)</i> -<a name="IDX87"></a> +<a name="IDX83"></a> </dt> <dd><p>Returns the number of units in <var>s</var>. </p> -<p>This function is similar to <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/strlen.html"><code>strlen</code></a> and <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/wcslen.html"><code>wcslen</code></a>, except +<p>This function is similar to <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/strlen.html"><code>strlen</code></a> and <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/wcslen.html"><code>wcslen</code></a>, except that it operates on Unicode strings. </p></dd></dl> <dl> <dt><u>Function:</u> size_t <b>u8_strnlen</b><i> (const uint8_t *<var>s</var>, size_t <var>maxlen</var>)</i> -<a name="IDX88"></a> +<a name="IDX84"></a> </dt> <dt><u>Function:</u> size_t <b>u16_strnlen</b><i> (const uint16_t *<var>s</var>, size_t <var>maxlen</var>)</i> -<a name="IDX89"></a> +<a name="IDX85"></a> </dt> <dt><u>Function:</u> size_t <b>u32_strnlen</b><i> (const uint32_t *<var>s</var>, size_t <var>maxlen</var>)</i> -<a name="IDX90"></a> +<a name="IDX86"></a> </dt> <dd><p>Returns the number of units in <var>s</var>, but at most <var>maxlen</var>. </p> -<p>This function is similar to <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/strnlen.html"><code>strnlen</code></a> and <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/wcsnlen.html"><code>wcsnlen</code></a>, except +<p>This function is similar to <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/strnlen.html"><code>strnlen</code></a> and <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/wcsnlen.html"><code>wcsnlen</code></a>, except that it operates on Unicode strings. </p></dd></dl> -<a name="IDX91"></a> +<hr size="6"> +<a name="Copying-a-NUL-terminated-Unicode-string"></a> +<a name="SEC24"></a> +<h3 class="subsection"> <a href="libunistring.html#TOC24">4.5.3 Copying a NUL terminated Unicode string</a> </h3> + <p>The following functions copy portions of Unicode strings in memory. </p> <dl> <dt><u>Function:</u> uint8_t * <b>u8_strcpy</b><i> (uint8_t *<var>dest</var>, const uint8_t *<var>src</var>)</i> -<a name="IDX92"></a> +<a name="IDX87"></a> </dt> <dt><u>Function:</u> uint16_t * <b>u16_strcpy</b><i> (uint16_t *<var>dest</var>, const uint16_t *<var>src</var>)</i> -<a name="IDX93"></a> +<a name="IDX88"></a> </dt> <dt><u>Function:</u> uint32_t * <b>u32_strcpy</b><i> (uint32_t *<var>dest</var>, const uint32_t *<var>src</var>)</i> -<a name="IDX94"></a> +<a name="IDX89"></a> </dt> <dd><p>Copies <var>src</var> to <var>dest</var>. </p> -<p>This function is similar to <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/strcpy.html"><code>strcpy</code></a> and <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/wcscpy.html"><code>wcscpy</code></a>, except +<p>This function is similar to <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/strcpy.html"><code>strcpy</code></a> and <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/wcscpy.html"><code>wcscpy</code></a>, except that it operates on Unicode strings. </p></dd></dl> <dl> <dt><u>Function:</u> uint8_t * <b>u8_stpcpy</b><i> (uint8_t *<var>dest</var>, const uint8_t *<var>src</var>)</i> -<a name="IDX95"></a> +<a name="IDX90"></a> </dt> <dt><u>Function:</u> uint16_t * <b>u16_stpcpy</b><i> (uint16_t *<var>dest</var>, const uint16_t *<var>src</var>)</i> -<a name="IDX96"></a> +<a name="IDX91"></a> </dt> <dt><u>Function:</u> uint32_t * <b>u32_stpcpy</b><i> (uint32_t *<var>dest</var>, const uint32_t *<var>src</var>)</i> -<a name="IDX97"></a> +<a name="IDX92"></a> </dt> <dd><p>Copies <var>src</var> to <var>dest</var>, returning the address of the terminating NUL in <var>dest</var>. </p> -<p>This function is similar to <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/stpcpy.html"><code>stpcpy</code></a>, except that it operates on +<p>This function is similar to <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/stpcpy.html"><code>stpcpy</code></a>, except that it operates on Unicode strings. </p></dd></dl> <dl> <dt><u>Function:</u> uint8_t * <b>u8_strncpy</b><i> (uint8_t *<var>dest</var>, const uint8_t *<var>src</var>, size_t <var>n</var>)</i> -<a name="IDX98"></a> +<a name="IDX93"></a> </dt> <dt><u>Function:</u> uint16_t * <b>u16_strncpy</b><i> (uint16_t *<var>dest</var>, const uint16_t *<var>src</var>, size_t <var>n</var>)</i> -<a name="IDX99"></a> +<a name="IDX94"></a> </dt> <dt><u>Function:</u> uint32_t * <b>u32_strncpy</b><i> (uint32_t *<var>dest</var>, const uint32_t *<var>src</var>, size_t <var>n</var>)</i> -<a name="IDX100"></a> +<a name="IDX95"></a> </dt> <dd><p>Copies no more than <var>n</var> units of <var>src</var> to <var>dest</var>. </p> -<p>This function is similar to <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/strncpy.html"><code>strncpy</code></a> and <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/wcsncpy.html"><code>wcsncpy</code></a>, except +<p>This function is similar to <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/strncpy.html"><code>strncpy</code></a> and <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/wcsncpy.html"><code>wcsncpy</code></a>, except that it operates on Unicode strings. </p></dd></dl> <dl> <dt><u>Function:</u> uint8_t * <b>u8_stpncpy</b><i> (uint8_t *<var>dest</var>, const uint8_t *<var>src</var>, size_t <var>n</var>)</i> -<a name="IDX101"></a> +<a name="IDX96"></a> </dt> <dt><u>Function:</u> uint16_t * <b>u16_stpncpy</b><i> (uint16_t *<var>dest</var>, const uint16_t *<var>src</var>, size_t <var>n</var>)</i> -<a name="IDX102"></a> +<a name="IDX97"></a> </dt> <dt><u>Function:</u> uint32_t * <b>u32_stpncpy</b><i> (uint32_t *<var>dest</var>, const uint32_t *<var>src</var>, size_t <var>n</var>)</i> -<a name="IDX103"></a> +<a name="IDX98"></a> </dt> <dd><p>Copies no more than <var>n</var> units of <var>src</var> to <var>dest</var>. Returns a pointer past the last non-NUL unit written into <var>dest</var>. In other words, @@ -575,155 +639,167 @@ if the units written into <var>dest</var> include a NUL, the return value is the address of the first such NUL unit, otherwise it is <code><var>dest</var> + <var>n</var></code>. </p> -<p>This function is similar to <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/stpncpy.html"><code>stpncpy</code></a>, except that it operates on +<p>This function is similar to <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/stpncpy.html"><code>stpncpy</code></a>, except that it operates on Unicode strings. </p></dd></dl> <dl> <dt><u>Function:</u> uint8_t * <b>u8_strcat</b><i> (uint8_t *<var>dest</var>, const uint8_t *<var>src</var>)</i> -<a name="IDX104"></a> +<a name="IDX99"></a> </dt> <dt><u>Function:</u> uint16_t * <b>u16_strcat</b><i> (uint16_t *<var>dest</var>, const uint16_t *<var>src</var>)</i> -<a name="IDX105"></a> +<a name="IDX100"></a> </dt> <dt><u>Function:</u> uint32_t * <b>u32_strcat</b><i> (uint32_t *<var>dest</var>, const uint32_t *<var>src</var>)</i> -<a name="IDX106"></a> +<a name="IDX101"></a> </dt> <dd><p>Appends <var>src</var> onto <var>dest</var>. </p> -<p>This function is similar to <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/strcat.html"><code>strcat</code></a> and <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/wcscat.html"><code>wcscat</code></a>, except +<p>This function is similar to <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/strcat.html"><code>strcat</code></a> and <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/wcscat.html"><code>wcscat</code></a>, except that it operates on Unicode strings. </p></dd></dl> <dl> <dt><u>Function:</u> uint8_t * <b>u8_strncat</b><i> (uint8_t *<var>dest</var>, const uint8_t *<var>src</var>, size_t <var>n</var>)</i> -<a name="IDX107"></a> +<a name="IDX102"></a> </dt> <dt><u>Function:</u> uint16_t * <b>u16_strncat</b><i> (uint16_t *<var>dest</var>, const uint16_t *<var>src</var>, size_t <var>n</var>)</i> -<a name="IDX108"></a> +<a name="IDX103"></a> </dt> <dt><u>Function:</u> uint32_t * <b>u32_strncat</b><i> (uint32_t *<var>dest</var>, const uint32_t *<var>src</var>, size_t <var>n</var>)</i> -<a name="IDX109"></a> +<a name="IDX104"></a> </dt> <dd><p>Appends no more than <var>n</var> units of <var>src</var> onto <var>dest</var>. </p> -<p>This function is similar to <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/strncat.html"><code>strncat</code></a> and <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/wcsncat.html"><code>wcsncat</code></a>, except +<p>This function is similar to <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/strncat.html"><code>strncat</code></a> and <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/wcsncat.html"><code>wcsncat</code></a>, except that it operates on Unicode strings. </p></dd></dl> -<a name="IDX110"></a> +<hr size="6"> +<a name="Comparing-NUL-terminated-Unicode-strings"></a> +<a name="SEC25"></a> +<h3 class="subsection"> <a href="libunistring.html#TOC25">4.5.4 Comparing NUL terminated Unicode strings</a> </h3> + <p>The following functions compare two Unicode strings. </p> <dl> <dt><u>Function:</u> int <b>u8_strcmp</b><i> (const uint8_t *<var>s1</var>, const uint8_t *<var>s2</var>)</i> -<a name="IDX111"></a> +<a name="IDX105"></a> </dt> <dt><u>Function:</u> int <b>u16_strcmp</b><i> (const uint16_t *<var>s1</var>, const uint16_t *<var>s2</var>)</i> -<a name="IDX112"></a> +<a name="IDX106"></a> </dt> <dt><u>Function:</u> int <b>u32_strcmp</b><i> (const uint32_t *<var>s1</var>, const uint32_t *<var>s2</var>)</i> -<a name="IDX113"></a> +<a name="IDX107"></a> </dt> <dd><p>Compares <var>s1</var> and <var>s2</var>, lexicographically. Returns a negative value if <var>s1</var> compares smaller than <var>s2</var>, a positive value if <var>s1</var> compares larger than <var>s2</var>, or 0 if they compare equal. </p> -<p>This function is similar to <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/strcmp.html"><code>strcmp</code></a> and <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/wcscmp.html"><code>wcscmp</code></a>, except +<p>This function is similar to <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/strcmp.html"><code>strcmp</code></a> and <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/wcscmp.html"><code>wcscmp</code></a>, except that it operates on Unicode strings. </p></dd></dl> -<a name="IDX114"></a> +<a name="IDX108"></a> <dl> <dt><u>Function:</u> int <b>u8_strcoll</b><i> (const uint8_t *<var>s1</var>, const uint8_t *<var>s2</var>)</i> -<a name="IDX115"></a> +<a name="IDX109"></a> </dt> <dt><u>Function:</u> int <b>u16_strcoll</b><i> (const uint16_t *<var>s1</var>, const uint16_t *<var>s2</var>)</i> -<a name="IDX116"></a> +<a name="IDX110"></a> </dt> <dt><u>Function:</u> int <b>u32_strcoll</b><i> (const uint32_t *<var>s1</var>, const uint32_t *<var>s2</var>)</i> -<a name="IDX117"></a> +<a name="IDX111"></a> </dt> <dd><p>Compares <var>s1</var> and <var>s2</var> using the collation rules of the current locale. Returns -1 if <var>s1</var> < <var>s2</var>, 0 if <var>s1</var> = <var>s2</var>, 1 if <var>s1</var> > <var>s2</var>. Upon failure, sets <code>errno</code> and returns any value. </p> -<p>This function is similar to <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/strcoll.html"><code>strcoll</code></a> and <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/wcscoll.html"><code>wcscoll</code></a>, except +<p>This function is similar to <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/strcoll.html"><code>strcoll</code></a> and <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/wcscoll.html"><code>wcscoll</code></a>, except that it operates on Unicode strings. </p> <p>Note that this function may consider different canonical normalizations of the same string as having a large distance. It is therefore better to -use the function <code>u8_normcoll</code> instead of this one; see <a href="libunistring_13.html#SEC48">Normalization forms (composition and decomposition) <code><uninorm.h></code></a>. +use the function <code>u8_normcoll</code> instead of this one; see <a href="libunistring_13.html#SEC61">Normalization forms (composition and decomposition) <code><uninorm.h></code></a>. </p></dd></dl> <dl> <dt><u>Function:</u> int <b>u8_strncmp</b><i> (const uint8_t *<var>s1</var>, const uint8_t *<var>s2</var>, size_t <var>n</var>)</i> -<a name="IDX118"></a> +<a name="IDX112"></a> </dt> <dt><u>Function:</u> int <b>u16_strncmp</b><i> (const uint16_t *<var>s1</var>, const uint16_t *<var>s2</var>, size_t <var>n</var>)</i> -<a name="IDX119"></a> +<a name="IDX113"></a> </dt> <dt><u>Function:</u> int <b>u32_strncmp</b><i> (const uint32_t *<var>s1</var>, const uint32_t *<var>s2</var>, size_t <var>n</var>)</i> -<a name="IDX120"></a> +<a name="IDX114"></a> </dt> <dd><p>Compares no more than <var>n</var> units of <var>s1</var> and <var>s2</var>. </p> -<p>This function is similar to <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/strncmp.html"><code>strncmp</code></a> and <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/wcsncmp.html"><code>wcsncmp</code></a>, except +<p>This function is similar to <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/strncmp.html"><code>strncmp</code></a> and <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/wcsncmp.html"><code>wcsncmp</code></a>, except that it operates on Unicode strings. </p></dd></dl> -<a name="IDX121"></a> +<hr size="6"> +<a name="Duplicating-a-NUL-terminated-Unicode-string"></a> +<a name="SEC26"></a> +<h3 class="subsection"> <a href="libunistring.html#TOC26">4.5.5 Duplicating a NUL terminated Unicode string</a> </h3> + <p>The following function allocates a duplicate of a Unicode string. </p> <dl> <dt><u>Function:</u> uint8_t * <b>u8_strdup</b><i> (const uint8_t *<var>s</var>)</i> -<a name="IDX122"></a> +<a name="IDX115"></a> </dt> <dt><u>Function:</u> uint16_t * <b>u16_strdup</b><i> (const uint16_t *<var>s</var>)</i> -<a name="IDX123"></a> +<a name="IDX116"></a> </dt> <dt><u>Function:</u> uint32_t * <b>u32_strdup</b><i> (const uint32_t *<var>s</var>)</i> -<a name="IDX124"></a> +<a name="IDX117"></a> </dt> <dd><p>Duplicates <var>s</var>, returning an identical malloc'd string. </p> -<p>This function is similar to <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/strdup.html"><code>strdup</code></a> and <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/wcsdup.html"><code>wcsdup</code></a>, except +<p>This function is similar to <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/strdup.html"><code>strdup</code></a> and <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/wcsdup.html"><code>wcsdup</code></a>, except that it operates on Unicode strings. </p></dd></dl> -<a name="IDX125"></a> +<hr size="6"> +<a name="Searching-for-a-character-in-a-NUL-terminated-Unicode-string"></a> +<a name="SEC27"></a> +<h3 class="subsection"> <a href="libunistring.html#TOC27">4.5.6 Searching for a character in a NUL terminated Unicode string</a> </h3> + <p>The following functions search for a given Unicode character. </p> <dl> <dt><u>Function:</u> uint8_t * <b>u8_strchr</b><i> (const uint8_t *<var>str</var>, ucs4_t <var>uc</var>)</i> -<a name="IDX126"></a> +<a name="IDX118"></a> </dt> <dt><u>Function:</u> uint16_t * <b>u16_strchr</b><i> (const uint16_t *<var>str</var>, ucs4_t <var>uc</var>)</i> -<a name="IDX127"></a> +<a name="IDX119"></a> </dt> <dt><u>Function:</u> uint32_t * <b>u32_strchr</b><i> (const uint32_t *<var>str</var>, ucs4_t <var>uc</var>)</i> -<a name="IDX128"></a> +<a name="IDX120"></a> </dt> <dd><p>Finds the first occurrence of <var>uc</var> in <var>str</var>. </p> -<p>This function is similar to <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/strchr.html"><code>strchr</code></a> and <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/wcschr.html"><code>wcschr</code></a>, except +<p>This function is similar to <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/strchr.html"><code>strchr</code></a> and <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/wcschr.html"><code>wcschr</code></a>, except that it operates on Unicode strings. </p></dd></dl> <dl> <dt><u>Function:</u> uint8_t * <b>u8_strrchr</b><i> (const uint8_t *<var>str</var>, ucs4_t <var>uc</var>)</i> -<a name="IDX129"></a> +<a name="IDX121"></a> </dt> <dt><u>Function:</u> uint16_t * <b>u16_strrchr</b><i> (const uint16_t *<var>str</var>, ucs4_t <var>uc</var>)</i> -<a name="IDX130"></a> +<a name="IDX122"></a> </dt> <dt><u>Function:</u> uint32_t * <b>u32_strrchr</b><i> (const uint32_t *<var>str</var>, ucs4_t <var>uc</var>)</i> -<a name="IDX131"></a> +<a name="IDX123"></a> </dt> <dd><p>Finds the last occurrence of <var>uc</var> in <var>str</var>. </p> -<p>This function is similar to <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/strrchr.html"><code>strrchr</code></a> and <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/wcsrchr.html"><code>wcsrchr</code></a>, except +<p>This function is similar to <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/strrchr.html"><code>strrchr</code></a> and <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/wcsrchr.html"><code>wcsrchr</code></a>, except that it operates on Unicode strings. </p></dd></dl> @@ -732,122 +808,131 @@ character in or outside a given set of Unicode characters. </p> <dl> <dt><u>Function:</u> size_t <b>u8_strcspn</b><i> (const uint8_t *<var>str</var>, const uint8_t *<var>reject</var>)</i> -<a name="IDX132"></a> +<a name="IDX124"></a> </dt> <dt><u>Function:</u> size_t <b>u16_strcspn</b><i> (const uint16_t *<var>str</var>, const uint16_t *<var>reject</var>)</i> -<a name="IDX133"></a> +<a name="IDX125"></a> </dt> <dt><u>Function:</u> size_t <b>u32_strcspn</b><i> (const uint32_t *<var>str</var>, const uint32_t *<var>reject</var>)</i> -<a name="IDX134"></a> +<a name="IDX126"></a> </dt> <dd><p>Returns the length of the initial segment of <var>str</var> which consists entirely of Unicode characters not in <var>reject</var>. </p> -<p>This function is similar to <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/strcspn.html"><code>strcspn</code></a> and <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/wcscspn.html"><code>wcscspn</code></a>, except +<p>This function is similar to <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/strcspn.html"><code>strcspn</code></a> and <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/wcscspn.html"><code>wcscspn</code></a>, except that it operates on Unicode strings. </p></dd></dl> <dl> <dt><u>Function:</u> size_t <b>u8_strspn</b><i> (const uint8_t *<var>str</var>, const uint8_t *<var>accept</var>)</i> -<a name="IDX135"></a> +<a name="IDX127"></a> </dt> <dt><u>Function:</u> size_t <b>u16_strspn</b><i> (const uint16_t *<var>str</var>, const uint16_t *<var>accept</var>)</i> -<a name="IDX136"></a> +<a name="IDX128"></a> </dt> <dt><u>Function:</u> size_t <b>u32_strspn</b><i> (const uint32_t *<var>str</var>, const uint32_t *<var>accept</var>)</i> -<a name="IDX137"></a> +<a name="IDX129"></a> </dt> <dd><p>Returns the length of the initial segment of <var>str</var> which consists entirely of Unicode characters in <var>accept</var>. </p> -<p>This function is similar to <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/strspn.html"><code>strspn</code></a> and <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/wcsspn.html"><code>wcsspn</code></a>, except +<p>This function is similar to <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/strspn.html"><code>strspn</code></a> and <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/wcsspn.html"><code>wcsspn</code></a>, except that it operates on Unicode strings. </p></dd></dl> <dl> <dt><u>Function:</u> uint8_t * <b>u8_strpbrk</b><i> (const uint8_t *<var>str</var>, const uint8_t *<var>accept</var>)</i> -<a name="IDX138"></a> +<a name="IDX130"></a> </dt> <dt><u>Function:</u> uint16_t * <b>u16_strpbrk</b><i> (const uint16_t *<var>str</var>, const uint16_t *<var>accept</var>)</i> -<a name="IDX139"></a> +<a name="IDX131"></a> </dt> <dt><u>Function:</u> uint32_t * <b>u32_strpbrk</b><i> (const uint32_t *<var>str</var>, const uint32_t *<var>accept</var>)</i> -<a name="IDX140"></a> +<a name="IDX132"></a> </dt> <dd><p>Finds the first occurrence in <var>str</var> of any character in <var>accept</var>. </p> -<p>This function is similar to <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/strpbrk.html"><code>strpbrk</code></a> and <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/wcspbrk.html"><code>wcspbrk</code></a>, except +<p>This function is similar to <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/strpbrk.html"><code>strpbrk</code></a> and <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/wcspbrk.html"><code>wcspbrk</code></a>, except that it operates on Unicode strings. </p></dd></dl> -<a name="IDX141"></a> +<hr size="6"> +<a name="Searching-for-a-substring"></a> +<a name="SEC28"></a> +<h3 class="subsection"> <a href="libunistring.html#TOC28">4.5.7 Searching for a substring in a NUL terminated Unicode string</a> </h3> + <p>The following functions search whether a given Unicode string is a substring of another Unicode string. </p> <dl> <dt><u>Function:</u> uint8_t * <b>u8_strstr</b><i> (const uint8_t *<var>haystack</var>, const uint8_t *<var>needle</var>)</i> -<a name="IDX142"></a> +<a name="IDX133"></a> </dt> <dt><u>Function:</u> uint16_t * <b>u16_strstr</b><i> (const uint16_t *<var>haystack</var>, const uint16_t *<var>needle</var>)</i> -<a name="IDX143"></a> +<a name="IDX134"></a> </dt> <dt><u>Function:</u> uint32_t * <b>u32_strstr</b><i> (const uint32_t *<var>haystack</var>, const uint32_t *<var>needle</var>)</i> -<a name="IDX144"></a> +<a name="IDX135"></a> </dt> <dd><p>Finds the first occurrence of <var>needle</var> in <var>haystack</var>. </p> -<p>This function is similar to <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/strstr.html"><code>strstr</code></a> and <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/wcsstr.html"><code>wcsstr</code></a>, except +<p>This function is similar to <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/strstr.html"><code>strstr</code></a> and <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/wcsstr.html"><code>wcsstr</code></a>, except that it operates on Unicode strings. </p></dd></dl> <dl> <dt><u>Function:</u> bool <b>u8_startswith</b><i> (const uint8_t *<var>str</var>, const uint8_t *<var>prefix</var>)</i> -<a name="IDX145"></a> +<a name="IDX136"></a> </dt> <dt><u>Function:</u> bool <b>u16_startswith</b><i> (const uint16_t *<var>str</var>, const uint16_t *<var>prefix</var>)</i> -<a name="IDX146"></a> +<a name="IDX137"></a> </dt> <dt><u>Function:</u> bool <b>u32_startswith</b><i> (const uint32_t *<var>str</var>, const uint32_t *<var>prefix</var>)</i> -<a name="IDX147"></a> +<a name="IDX138"></a> </dt> <dd><p>Tests whether <var>str</var> starts with <var>prefix</var>. </p></dd></dl> <dl> <dt><u>Function:</u> bool <b>u8_endswith</b><i> (const uint8_t *<var>str</var>, const uint8_t *<var>suffix</var>)</i> -<a name="IDX148"></a> +<a name="IDX139"></a> </dt> <dt><u>Function:</u> bool <b>u16_endswith</b><i> (const uint16_t *<var>str</var>, const uint16_t *<var>suffix</var>)</i> -<a name="IDX149"></a> +<a name="IDX140"></a> </dt> <dt><u>Function:</u> bool <b>u32_endswith</b><i> (const uint32_t *<var>str</var>, const uint32_t *<var>suffix</var>)</i> -<a name="IDX150"></a> +<a name="IDX141"></a> </dt> <dd><p>Tests whether <var>str</var> ends with <var>suffix</var>. </p></dd></dl> +<hr size="6"> +<a name="Tokenizing"></a> +<a name="SEC29"></a> +<h3 class="subsection"> <a href="libunistring.html#TOC29">4.5.8 Tokenizing a NUL terminated Unicode string</a> </h3> + <p>The following function does one step in tokenizing a Unicode string. </p> <dl> <dt><u>Function:</u> uint8_t * <b>u8_strtok</b><i> (uint8_t *<var>str</var>, const uint8_t *<var>delim</var>, uint8_t **<var>ptr</var>)</i> -<a name="IDX151"></a> +<a name="IDX142"></a> </dt> <dt><u>Function:</u> uint16_t * <b>u16_strtok</b><i> (uint16_t *<var>str</var>, const uint16_t *<var>delim</var>, uint16_t **<var>ptr</var>)</i> -<a name="IDX152"></a> +<a name="IDX143"></a> </dt> <dt><u>Function:</u> uint32_t * <b>u32_strtok</b><i> (uint32_t *<var>str</var>, const uint32_t *<var>delim</var>, uint32_t **<var>ptr</var>)</i> -<a name="IDX153"></a> +<a name="IDX144"></a> </dt> <dd><p>Divides <var>str</var> into tokens separated by characters in <var>delim</var>. </p> -<p>This function is similar to <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/strtok_r.html"><code>strtok_r</code></a> and <a href="http://www.opengroup.org/onlinepubs/9699919799/functions/wcstok.html"><code>wcstok</code></a>, except +<p>This function is similar to <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/strtok_r.html"><code>strtok_r</code></a> and <a href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/wcstok.html"><code>wcstok</code></a>, except that it operates on Unicode strings. Its interface is actually more similar to <code>wcstok</code> than to <code>strtok</code>. </p></dd></dl> <hr size="6"> <table cellpadding="1" cellspacing="1" border="0"> -<tr><td valign="middle" align="left">[<a href="#SEC11" title="Beginning of this chapter or previous chapter"> << </a>]</td> -<td valign="middle" align="left">[<a href="libunistring_5.html#SEC17" title="Next chapter"> >> </a>]</td> +<tr><td valign="middle" align="left">[<a href="#SEC10" title="Beginning of this chapter or previous chapter"> << </a>]</td> +<td valign="middle" align="left">[<a href="libunistring_5.html#SEC30" title="Next chapter"> >> </a>]</td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> @@ -855,12 +940,12 @@ that it operates on Unicode strings. Its interface is actually more similar to <td valign="middle" align="left"> </td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Top" title="Cover (top) of document">Top</a>]</td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Contents" title="Table of contents">Contents</a>]</td> -<td valign="middle" align="left">[<a href="libunistring_19.html#SEC77" title="Index">Index</a>]</td> +<td valign="middle" align="left">[<a href="libunistring_20.html#SEC91" title="Index">Index</a>]</td> <td valign="middle" align="left">[<a href="libunistring_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <p> <font size="-1"> - This document was generated by <em>Daiki Ueno</em> on <em>November, 30 2017</em> using <a href="http://www.nongnu.org/texi2html/"><em>texi2html 1.78a</em></a>. + This document was generated by <em>Daiki Ueno</em> on <em>May, 25 2018</em> using <a href="http://www.nongnu.org/texi2html/"><em>texi2html 1.78a</em></a>. </font> <br> diff --git a/doc/libunistring_5.html b/doc/libunistring_5.html index 0faa6534..ef65c7e6 100644 --- a/doc/libunistring_5.html +++ b/doc/libunistring_5.html @@ -1,6 +1,6 @@ <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html401/loose.dtd"> <html> -<!-- Created on November, 30 2017 by texi2html 1.78a --> +<!-- Created on May, 25 2018 by texi2html 1.78a --> <!-- Written by: Lionel Cons <Lionel.Cons@cern.ch> (original author) Karl Berry <karl@freefriends.org> @@ -42,8 +42,8 @@ ul.toc {list-style: none} <body lang="en" bgcolor="#FFFFFF" text="#000000" link="#0000FF" vlink="#800080" alink="#FF0000"> <table cellpadding="1" cellspacing="1" border="0"> -<tr><td valign="middle" align="left">[<a href="libunistring_4.html#SEC11" title="Beginning of this chapter or previous chapter"> << </a>]</td> -<td valign="middle" align="left">[<a href="libunistring_6.html#SEC18" title="Next chapter"> >> </a>]</td> +<tr><td valign="middle" align="left">[<a href="libunistring_4.html#SEC10" title="Beginning of this chapter or previous chapter"> << </a>]</td> +<td valign="middle" align="left">[<a href="libunistring_6.html#SEC31" title="Next chapter"> >> </a>]</td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> @@ -51,24 +51,24 @@ ul.toc {list-style: none} <td valign="middle" align="left"> </td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Top" title="Cover (top) of document">Top</a>]</td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Contents" title="Table of contents">Contents</a>]</td> -<td valign="middle" align="left">[<a href="libunistring_19.html#SEC77" title="Index">Index</a>]</td> +<td valign="middle" align="left">[<a href="libunistring_20.html#SEC91" title="Index">Index</a>]</td> <td valign="middle" align="left">[<a href="libunistring_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <hr size="2"> <a name="uniconv_002eh"></a> -<a name="SEC17"></a> -<h1 class="chapter"> <a href="libunistring.html#TOC17">5. Conversions between Unicode and encodings <code><uniconv.h></code></a> </h1> +<a name="SEC30"></a> +<h1 class="chapter"> <a href="libunistring.html#TOC30">5. Conversions between Unicode and encodings <code><uniconv.h></code></a> </h1> <p>This include file declares functions for converting between Unicode strings and <code>char *</code> strings in locale encoding or in other specified encodings. </p> -<a name="IDX154"></a> +<a name="IDX145"></a> <p>The following function returns the locale encoding. </p> <dl> <dt><u>Function:</u> const char * <b>locale_charset</b><i> ()</i> -<a name="IDX155"></a> +<a name="IDX146"></a> </dt> <dd><p>Determines the current locale's character encoding, and canonicalizes it into one of the canonical names listed in ‘<tt>config.charset</tt>’. @@ -88,14 +88,14 @@ parametrized through the following enumeration type: </p> <dl> <dt><u>Type:</u> <b>enum iconv_ilseq_handler</b> -<a name="IDX156"></a> +<a name="IDX147"></a> </dt> <dd><p>This type specifies how unconvertible characters in the input are handled. </p></dd></dl> <dl> <dt><u>Constant:</u> enum iconv_ilseq_handler <b>iconveh_error</b> -<a name="IDX157"></a> +<a name="IDX148"></a> </dt> <dd><p>This handler causes the function to return with <code>errno</code> set to <code>EILSEQ</code>. @@ -103,32 +103,32 @@ parametrized through the following enumeration type: <dl> <dt><u>Constant:</u> enum iconv_ilseq_handler <b>iconveh_question_mark</b> -<a name="IDX158"></a> +<a name="IDX149"></a> </dt> <dd><p>This handler produces one question mark ‘<samp>?</samp>’ per unconvertible character. </p></dd></dl> <dl> <dt><u>Constant:</u> enum iconv_ilseq_handler <b>iconveh_escape_sequence</b> -<a name="IDX159"></a> +<a name="IDX150"></a> </dt> <dd><p>This handler produces an escape sequence <code>\u<var>xxxx</var></code> or <code>\U<var>xxxxxxxx</var></code> for each unconvertible character. </p></dd></dl> -<a name="IDX160"></a> +<a name="IDX151"></a> <p>The following functions convert between strings in a specified encoding and Unicode strings. </p> <dl> <dt><u>Function:</u> uint8_t * <b>u8_conv_from_encoding</b><i> (const char *<var>fromcode</var>, enum iconv_ilseq_handler <var>handler</var>, const char *<var>src</var>, size_t <var>srclen</var>, size_t *<var>offsets</var>, uint8_t *<var>resultbuf</var>, size_t *<var>lengthp</var>)</i> -<a name="IDX161"></a> +<a name="IDX152"></a> </dt> <dt><u>Function:</u> uint16_t * <b>u16_conv_from_encoding</b><i> (const char *<var>fromcode</var>, enum iconv_ilseq_handler <var>handler</var>, const char *<var>src</var>, size_t <var>srclen</var>, size_t *<var>offsets</var>, uint16_t *<var>resultbuf</var>, size_t *<var>lengthp</var>)</i> -<a name="IDX162"></a> +<a name="IDX153"></a> </dt> <dt><u>Function:</u> uint32_t * <b>u32_conv_from_encoding</b><i> (const char *<var>fromcode</var>, enum iconv_ilseq_handler <var>handler</var>, const char *<var>src</var>, size_t <var>srclen</var>, size_t *<var>offsets</var>, uint32_t *<var>resultbuf</var>, size_t *<var>lengthp</var>)</i> -<a name="IDX163"></a> +<a name="IDX154"></a> </dt> <dd><p>Converts an entire string, possibly including NUL bytes, from one encoding to UTF-8 encoding. @@ -161,13 +161,13 @@ Particular <code>errno</code> values: <code>EINVAL</code>, <code>EILSEQ</code>, <dl> <dt><u>Function:</u> char * <b>u8_conv_to_encoding</b><i> (const char *<var>tocode</var>, enum iconv_ilseq_handler <var>handler</var>, const uint8_t *<var>src</var>, size_t <var>srclen</var>, size_t *<var>offsets</var>, char *<var>resultbuf</var>, size_t *<var>lengthp</var>)</i> -<a name="IDX164"></a> +<a name="IDX155"></a> </dt> <dt><u>Function:</u> char * <b>u16_conv_to_encoding</b><i> (const char *<var>tocode</var>, enum iconv_ilseq_handler <var>handler</var>, const uint16_t *<var>src</var>, size_t <var>srclen</var>, size_t *<var>offsets</var>, char *<var>resultbuf</var>, size_t *<var>lengthp</var>)</i> -<a name="IDX165"></a> +<a name="IDX156"></a> </dt> <dt><u>Function:</u> char * <b>u32_conv_to_encoding</b><i> (const char *<var>tocode</var>, enum iconv_ilseq_handler <var>handler</var>, const uint32_t *<var>src</var>, size_t <var>srclen</var>, size_t *<var>offsets</var>, char *<var>resultbuf</var>, size_t *<var>lengthp</var>)</i> -<a name="IDX166"></a> +<a name="IDX157"></a> </dt> <dd><p>Converts an entire Unicode string, possibly including NUL units, from UTF-8 encoding to a given encoding. @@ -203,13 +203,13 @@ encoding and NUL terminated Unicode strings. </p> <dl> <dt><u>Function:</u> uint8_t * <b>u8_strconv_from_encoding</b><i> (const char *<var>string</var>, const char *<var>fromcode</var>, enum iconv_ilseq_handler <var>handler</var>)</i> -<a name="IDX167"></a> +<a name="IDX158"></a> </dt> <dt><u>Function:</u> uint16_t * <b>u16_strconv_from_encoding</b><i> (const char *<var>string</var>, const char *<var>fromcode</var>, enum iconv_ilseq_handler <var>handler</var>)</i> -<a name="IDX168"></a> +<a name="IDX159"></a> </dt> <dt><u>Function:</u> uint32_t * <b>u32_strconv_from_encoding</b><i> (const char *<var>string</var>, const char *<var>fromcode</var>, enum iconv_ilseq_handler <var>handler</var>)</i> -<a name="IDX169"></a> +<a name="IDX160"></a> </dt> <dd><p>Converts a NUL terminated string from a given encoding. </p> @@ -220,13 +220,13 @@ encoding and NUL terminated Unicode strings. <dl> <dt><u>Function:</u> char * <b>u8_strconv_to_encoding</b><i> (const uint8_t *<var>string</var>, const char *<var>tocode</var>, enum iconv_ilseq_handler <var>handler</var>)</i> -<a name="IDX170"></a> +<a name="IDX161"></a> </dt> <dt><u>Function:</u> char * <b>u16_strconv_to_encoding</b><i> (const uint16_t *<var>string</var>, const char *<var>tocode</var>, enum iconv_ilseq_handler <var>handler</var>)</i> -<a name="IDX171"></a> +<a name="IDX162"></a> </dt> <dt><u>Function:</u> char * <b>u32_strconv_to_encoding</b><i> (const uint32_t *<var>string</var>, const char *<var>tocode</var>, enum iconv_ilseq_handler <var>handler</var>)</i> -<a name="IDX172"></a> +<a name="IDX163"></a> </dt> <dd><p>Converts a NUL terminated string to a given encoding. </p> @@ -240,13 +240,13 @@ strings in locale encoding and NUL terminated Unicode strings. </p> <dl> <dt><u>Function:</u> uint8_t * <b>u8_strconv_from_locale</b><i> (const char *<var>string</var>)</i> -<a name="IDX173"></a> +<a name="IDX164"></a> </dt> <dt><u>Function:</u> uint16_t * <b>u16_strconv_from_locale</b><i> (const char *<var>string</var>)</i> -<a name="IDX174"></a> +<a name="IDX165"></a> </dt> <dt><u>Function:</u> uint32_t * <b>u32_strconv_from_locale</b><i> (const char *<var>string</var>)</i> -<a name="IDX175"></a> +<a name="IDX166"></a> </dt> <dd><p>Converts a NUL terminated string from the locale encoding. </p> @@ -257,13 +257,13 @@ strings in locale encoding and NUL terminated Unicode strings. <dl> <dt><u>Function:</u> char * <b>u8_strconv_to_locale</b><i> (const uint8_t *<var>string</var>)</i> -<a name="IDX176"></a> +<a name="IDX167"></a> </dt> <dt><u>Function:</u> char * <b>u16_strconv_to_locale</b><i> (const uint16_t *<var>string</var>)</i> -<a name="IDX177"></a> +<a name="IDX168"></a> </dt> <dt><u>Function:</u> char * <b>u32_strconv_to_locale</b><i> (const uint32_t *<var>string</var>)</i> -<a name="IDX178"></a> +<a name="IDX169"></a> </dt> <dd><p>Converts a NUL terminated string to the locale encoding. </p> @@ -273,8 +273,8 @@ strings in locale encoding and NUL terminated Unicode strings. </p></dd></dl> <hr size="6"> <table cellpadding="1" cellspacing="1" border="0"> -<tr><td valign="middle" align="left">[<a href="libunistring_4.html#SEC11" title="Beginning of this chapter or previous chapter"> << </a>]</td> -<td valign="middle" align="left">[<a href="libunistring_6.html#SEC18" title="Next chapter"> >> </a>]</td> +<tr><td valign="middle" align="left">[<a href="libunistring_4.html#SEC10" title="Beginning of this chapter or previous chapter"> << </a>]</td> +<td valign="middle" align="left">[<a href="libunistring_6.html#SEC31" title="Next chapter"> >> </a>]</td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> @@ -282,12 +282,12 @@ strings in locale encoding and NUL terminated Unicode strings. <td valign="middle" align="left"> </td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Top" title="Cover (top) of document">Top</a>]</td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Contents" title="Table of contents">Contents</a>]</td> -<td valign="middle" align="left">[<a href="libunistring_19.html#SEC77" title="Index">Index</a>]</td> +<td valign="middle" align="left">[<a href="libunistring_20.html#SEC91" title="Index">Index</a>]</td> <td valign="middle" align="left">[<a href="libunistring_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <p> <font size="-1"> - This document was generated by <em>Daiki Ueno</em> on <em>November, 30 2017</em> using <a href="http://www.nongnu.org/texi2html/"><em>texi2html 1.78a</em></a>. + This document was generated by <em>Daiki Ueno</em> on <em>May, 25 2018</em> using <a href="http://www.nongnu.org/texi2html/"><em>texi2html 1.78a</em></a>. </font> <br> diff --git a/doc/libunistring_6.html b/doc/libunistring_6.html index c679054c..2868ca4e 100644 --- a/doc/libunistring_6.html +++ b/doc/libunistring_6.html @@ -1,6 +1,6 @@ <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html401/loose.dtd"> <html> -<!-- Created on November, 30 2017 by texi2html 1.78a --> +<!-- Created on May, 25 2018 by texi2html 1.78a --> <!-- Written by: Lionel Cons <Lionel.Cons@cern.ch> (original author) Karl Berry <karl@freefriends.org> @@ -42,8 +42,8 @@ ul.toc {list-style: none} <body lang="en" bgcolor="#FFFFFF" text="#000000" link="#0000FF" vlink="#800080" alink="#FF0000"> <table cellpadding="1" cellspacing="1" border="0"> -<tr><td valign="middle" align="left">[<a href="libunistring_5.html#SEC17" title="Beginning of this chapter or previous chapter"> << </a>]</td> -<td valign="middle" align="left">[<a href="libunistring_7.html#SEC19" title="Next chapter"> >> </a>]</td> +<tr><td valign="middle" align="left">[<a href="libunistring_5.html#SEC30" title="Beginning of this chapter or previous chapter"> << </a>]</td> +<td valign="middle" align="left">[<a href="libunistring_7.html#SEC32" title="Next chapter"> >> </a>]</td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> @@ -51,14 +51,14 @@ ul.toc {list-style: none} <td valign="middle" align="left"> </td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Top" title="Cover (top) of document">Top</a>]</td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Contents" title="Table of contents">Contents</a>]</td> -<td valign="middle" align="left">[<a href="libunistring_19.html#SEC77" title="Index">Index</a>]</td> +<td valign="middle" align="left">[<a href="libunistring_20.html#SEC91" title="Index">Index</a>]</td> <td valign="middle" align="left">[<a href="libunistring_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <hr size="2"> <a name="unistdio_002eh"></a> -<a name="SEC18"></a> -<h1 class="chapter"> <a href="libunistring.html#TOC18">6. Output with Unicode strings <code><unistdio.h></code></a> </h1> +<a name="SEC31"></a> +<h1 class="chapter"> <a href="libunistring.html#TOC31">6. Output with Unicode strings <code><unistdio.h></code></a> </h1> <p>This include file declares functions for doing formatted output with Unicode strings. It defines a set of functions similar to <code>fprintf</code> and @@ -66,7 +66,7 @@ strings. It defines a set of functions similar to <code>fprintf</code> and </p> <p>These functions work like the <code>printf</code> function family. In the format string: -</p><ul class="toc"> +</p><ul> <li> The format directive ‘<samp>U</samp>’ takes an UTF-8 string (<code>const uint8_t *</code>). </li><li> @@ -103,49 +103,49 @@ is a <code>char *</code> string in locale encoding. </p> <dl> <dt><u>Function:</u> int <b>ulc_sprintf</b><i> (char *<var>buf</var>, const char *<var>format</var>, ...)</i> -<a name="IDX179"></a> +<a name="IDX170"></a> </dt> </dl> <dl> <dt><u>Function:</u> int <b>ulc_snprintf</b><i> (char *<var>buf</var>, size_t size, const char *<var>format</var>, ...)</i> -<a name="IDX180"></a> +<a name="IDX171"></a> </dt> </dl> <dl> <dt><u>Function:</u> int <b>ulc_asprintf</b><i> (char **<var>resultp</var>, const char *<var>format</var>, ...)</i> -<a name="IDX181"></a> +<a name="IDX172"></a> </dt> </dl> <dl> <dt><u>Function:</u> char * <b>ulc_asnprintf</b><i> (char *<var>resultbuf</var>, size_t *<var>lengthp</var>, const char *<var>format</var>, ...)</i> -<a name="IDX182"></a> +<a name="IDX173"></a> </dt> </dl> <dl> <dt><u>Function:</u> int <b>ulc_vsprintf</b><i> (char *<var>buf</var>, const char *<var>format</var>, va_list <var>ap</var>)</i> -<a name="IDX183"></a> +<a name="IDX174"></a> </dt> </dl> <dl> <dt><u>Function:</u> int <b>ulc_vsnprintf</b><i> (char *<var>buf</var>, size_t size, const char *<var>format</var>, va_list <var>ap</var>)</i> -<a name="IDX184"></a> +<a name="IDX175"></a> </dt> </dl> <dl> <dt><u>Function:</u> int <b>ulc_vasprintf</b><i> (char **<var>resultp</var>, const char *<var>format</var>, va_list <var>ap</var>)</i> -<a name="IDX185"></a> +<a name="IDX176"></a> </dt> </dl> <dl> <dt><u>Function:</u> char * <b>ulc_vasnprintf</b><i> (char *<var>resultbuf</var>, size_t *<var>lengthp</var>, const char *<var>format</var>, va_list <var>ap</var>)</i> -<a name="IDX186"></a> +<a name="IDX177"></a> </dt> </dl> @@ -154,42 +154,42 @@ UTF-8 format. </p> <dl> <dt><u>Function:</u> int <b>u8_sprintf</b><i> (uint8_t *<var>buf</var>, const char *<var>format</var>, ...)</i> -<a name="IDX187"></a> +<a name="IDX178"></a> </dt> </dl> <dl> <dt><u>Function:</u> int <b>u8_snprintf</b><i> (uint8_t *<var>buf</var>, size_t <var>size</var>, const char *<var>format</var>, ...)</i> -<a name="IDX188"></a> +<a name="IDX179"></a> </dt> </dl> <dl> <dt><u>Function:</u> int <b>u8_asprintf</b><i> (uint8_t **<var>resultp</var>, const char *<var>format</var>, ...)</i> -<a name="IDX189"></a> +<a name="IDX180"></a> </dt> </dl> <dl> <dt><u>Function:</u> uint8_t * <b>u8_asnprintf</b><i> (uint8_t *<var>resultbuf</var>, size_t *<var>lengthp</var>, const char *<var>format</var>, ...)</i> -<a name="IDX190"></a> +<a name="IDX181"></a> </dt> </dl> <dl> <dt><u>Function:</u> int <b>u8_vsprintf</b><i> (uint8_t *<var>buf</var>, const char *<var>format</var>, va_list ap)</i> -<a name="IDX191"></a> +<a name="IDX182"></a> </dt> </dl> <dl> <dt><u>Function:</u> int <b>u8_vsnprintf</b><i> (uint8_t *<var>buf</var>, size_t <var>size</var>, const char *<var>format</var>, va_list <var>ap</var>)</i> -<a name="IDX192"></a> +<a name="IDX183"></a> </dt> </dl> <dl> <dt><u>Function:</u> int <b>u8_vasprintf</b><i> (uint8_t **<var>resultp</var>, const char *<var>format</var>, va_list <var>ap</var>)</i> -<a name="IDX193"></a> +<a name="IDX184"></a> </dt> </dl> <dl> <dt><u>Function:</u> uint8_t * <b>u8_vasnprintf</b><i> (uint8_t *resultbuf, size_t *<var>lengthp</var>, const char *<var>format</var>, va_list <var>ap</var>)</i> -<a name="IDX194"></a> +<a name="IDX185"></a> </dt> </dl> @@ -198,42 +198,42 @@ UTF-8 format. </p> <dl> <dt><u>Function:</u> int <b>u8_u8_sprintf</b><i> (uint8_t *<var>buf</var>, const uint8_t *<var>format</var>, ...)</i> -<a name="IDX195"></a> +<a name="IDX186"></a> </dt> </dl> <dl> <dt><u>Function:</u> int <b>u8_u8_snprintf</b><i> (uint8_t *<var>buf</var>, size_t <var>size</var>, const uint8_t *<var>format</var>, ...)</i> -<a name="IDX196"></a> +<a name="IDX187"></a> </dt> </dl> <dl> <dt><u>Function:</u> int <b>u8_u8_asprintf</b><i> (uint8_t **<var>resultp</var>, const uint8_t *<var>format</var>, ...)</i> -<a name="IDX197"></a> +<a name="IDX188"></a> </dt> </dl> <dl> <dt><u>Function:</u> uint8_t * <b>u8_u8_asnprintf</b><i> (uint8_t *resultbuf, size_t *<var>lengthp</var>, const uint8_t *<var>format</var>, ...)</i> -<a name="IDX198"></a> +<a name="IDX189"></a> </dt> </dl> <dl> <dt><u>Function:</u> int <b>u8_u8_vsprintf</b><i> (uint8_t *<var>buf</var>, const uint8_t *<var>format</var>, va_list <var>ap</var>)</i> -<a name="IDX199"></a> +<a name="IDX190"></a> </dt> </dl> <dl> <dt><u>Function:</u> int <b>u8_u8_vsnprintf</b><i> (uint8_t *<var>buf</var>, size_t <var>size</var>, const uint8_t *<var>format</var>, va_list <var>ap</var>)</i> -<a name="IDX200"></a> +<a name="IDX191"></a> </dt> </dl> <dl> <dt><u>Function:</u> int <b>u8_u8_vasprintf</b><i> (uint8_t **<var>resultp</var>, const uint8_t *<var>format</var>, va_list <var>ap</var>)</i> -<a name="IDX201"></a> +<a name="IDX192"></a> </dt> </dl> <dl> <dt><u>Function:</u> uint8_t * <b>u8_u8_vasnprintf</b><i> (uint8_t *resultbuf, size_t *<var>lengthp</var>, const uint8_t *<var>format</var>, va_list <var>ap</var>)</i> -<a name="IDX202"></a> +<a name="IDX193"></a> </dt> </dl> @@ -242,42 +242,42 @@ UTF-16 format. </p> <dl> <dt><u>Function:</u> int <b>u16_sprintf</b><i> (uint16_t *<var>buf</var>, const char *<var>format</var>, ...)</i> -<a name="IDX203"></a> +<a name="IDX194"></a> </dt> </dl> <dl> <dt><u>Function:</u> int <b>u16_snprintf</b><i> (uint16_t *<var>buf</var>, size_t <var>size</var>, const char *<var>format</var>, ...)</i> -<a name="IDX204"></a> +<a name="IDX195"></a> </dt> </dl> <dl> <dt><u>Function:</u> int <b>u16_asprintf</b><i> (uint16_t **<var>resultp</var>, const char *<var>format</var>, ...)</i> -<a name="IDX205"></a> +<a name="IDX196"></a> </dt> </dl> <dl> <dt><u>Function:</u> uint16_t * <b>u16_asnprintf</b><i> (uint16_t *<var>resultbuf</var>, size_t *<var>lengthp</var>, const char *<var>format</var>, ...)</i> -<a name="IDX206"></a> +<a name="IDX197"></a> </dt> </dl> <dl> <dt><u>Function:</u> int <b>u16_vsprintf</b><i> (uint16_t *<var>buf</var>, const char *<var>format</var>, va_list ap)</i> -<a name="IDX207"></a> +<a name="IDX198"></a> </dt> </dl> <dl> <dt><u>Function:</u> int <b>u16_vsnprintf</b><i> (uint16_t *<var>buf</var>, size_t <var>size</var>, const char *<var>format</var>, va_list <var>ap</var>)</i> -<a name="IDX208"></a> +<a name="IDX199"></a> </dt> </dl> <dl> <dt><u>Function:</u> int <b>u16_vasprintf</b><i> (uint16_t **<var>resultp</var>, const char *<var>format</var>, va_list <var>ap</var>)</i> -<a name="IDX209"></a> +<a name="IDX200"></a> </dt> </dl> <dl> <dt><u>Function:</u> uint16_t * <b>u16_vasnprintf</b><i> (uint16_t *resultbuf, size_t *<var>lengthp</var>, const char *<var>format</var>, va_list <var>ap</var>)</i> -<a name="IDX210"></a> +<a name="IDX201"></a> </dt> </dl> @@ -286,42 +286,42 @@ UTF-16 format. </p> <dl> <dt><u>Function:</u> int <b>u16_u16_sprintf</b><i> (uint16_t *<var>buf</var>, const uint16_t *<var>format</var>, ...)</i> -<a name="IDX211"></a> +<a name="IDX202"></a> </dt> </dl> <dl> <dt><u>Function:</u> int <b>u16_u16_snprintf</b><i> (uint16_t *<var>buf</var>, size_t <var>size</var>, const uint16_t *<var>format</var>, ...)</i> -<a name="IDX212"></a> +<a name="IDX203"></a> </dt> </dl> <dl> <dt><u>Function:</u> int <b>u16_u16_asprintf</b><i> (uint16_t **<var>resultp</var>, const uint16_t *<var>format</var>, ...)</i> -<a name="IDX213"></a> +<a name="IDX204"></a> </dt> </dl> <dl> <dt><u>Function:</u> uint16_t * <b>u16_u16_asnprintf</b><i> (uint16_t *resultbuf, size_t *<var>lengthp</var>, const uint16_t *<var>format</var>, ...)</i> -<a name="IDX214"></a> +<a name="IDX205"></a> </dt> </dl> <dl> <dt><u>Function:</u> int <b>u16_u16_vsprintf</b><i> (uint16_t *<var>buf</var>, const uint16_t *<var>format</var>, va_list <var>ap</var>)</i> -<a name="IDX215"></a> +<a name="IDX206"></a> </dt> </dl> <dl> <dt><u>Function:</u> int <b>u16_u16_vsnprintf</b><i> (uint16_t *<var>buf</var>, size_t <var>size</var>, const uint16_t *<var>format</var>, va_list <var>ap</var>)</i> -<a name="IDX216"></a> +<a name="IDX207"></a> </dt> </dl> <dl> <dt><u>Function:</u> int <b>u16_u16_vasprintf</b><i> (uint16_t **<var>resultp</var>, const uint16_t *<var>format</var>, va_list <var>ap</var>)</i> -<a name="IDX217"></a> +<a name="IDX208"></a> </dt> </dl> <dl> <dt><u>Function:</u> uint16_t * <b>u16_u16_vasnprintf</b><i> (uint16_t *resultbuf, size_t *<var>lengthp</var>, const uint16_t *<var>format</var>, va_list <var>ap</var>)</i> -<a name="IDX218"></a> +<a name="IDX209"></a> </dt> </dl> @@ -330,42 +330,42 @@ UTF-32 format. </p> <dl> <dt><u>Function:</u> int <b>u32_sprintf</b><i> (uint32_t *<var>buf</var>, const char *<var>format</var>, ...)</i> -<a name="IDX219"></a> +<a name="IDX210"></a> </dt> </dl> <dl> <dt><u>Function:</u> int <b>u32_snprintf</b><i> (uint32_t *<var>buf</var>, size_t <var>size</var>, const char *<var>format</var>, ...)</i> -<a name="IDX220"></a> +<a name="IDX211"></a> </dt> </dl> <dl> <dt><u>Function:</u> int <b>u32_asprintf</b><i> (uint32_t **<var>resultp</var>, const char *<var>format</var>, ...)</i> -<a name="IDX221"></a> +<a name="IDX212"></a> </dt> </dl> <dl> <dt><u>Function:</u> uint32_t * <b>u32_asnprintf</b><i> (uint32_t *<var>resultbuf</var>, size_t *<var>lengthp</var>, const char *<var>format</var>, ...)</i> -<a name="IDX222"></a> +<a name="IDX213"></a> </dt> </dl> <dl> <dt><u>Function:</u> int <b>u32_vsprintf</b><i> (uint32_t *<var>buf</var>, const char *<var>format</var>, va_list ap)</i> -<a name="IDX223"></a> +<a name="IDX214"></a> </dt> </dl> <dl> <dt><u>Function:</u> int <b>u32_vsnprintf</b><i> (uint32_t *<var>buf</var>, size_t <var>size</var>, const char *<var>format</var>, va_list <var>ap</var>)</i> -<a name="IDX224"></a> +<a name="IDX215"></a> </dt> </dl> <dl> <dt><u>Function:</u> int <b>u32_vasprintf</b><i> (uint32_t **<var>resultp</var>, const char *<var>format</var>, va_list <var>ap</var>)</i> -<a name="IDX225"></a> +<a name="IDX216"></a> </dt> </dl> <dl> <dt><u>Function:</u> uint32_t * <b>u32_vasnprintf</b><i> (uint32_t *resultbuf, size_t *<var>lengthp</var>, const char *<var>format</var>, va_list <var>ap</var>)</i> -<a name="IDX226"></a> +<a name="IDX217"></a> </dt> </dl> @@ -374,42 +374,42 @@ UTF-32 format. </p> <dl> <dt><u>Function:</u> int <b>u32_u32_sprintf</b><i> (uint32_t *<var>buf</var>, const uint32_t *<var>format</var>, ...)</i> -<a name="IDX227"></a> +<a name="IDX218"></a> </dt> </dl> <dl> <dt><u>Function:</u> int <b>u32_u32_snprintf</b><i> (uint32_t *<var>buf</var>, size_t <var>size</var>, const uint32_t *<var>format</var>, ...)</i> -<a name="IDX228"></a> +<a name="IDX219"></a> </dt> </dl> <dl> <dt><u>Function:</u> int <b>u32_u32_asprintf</b><i> (uint32_t **<var>resultp</var>, const uint32_t *<var>format</var>, ...)</i> -<a name="IDX229"></a> +<a name="IDX220"></a> </dt> </dl> <dl> <dt><u>Function:</u> uint32_t * <b>u32_u32_asnprintf</b><i> (uint32_t *resultbuf, size_t *<var>lengthp</var>, const uint32_t *<var>format</var>, ...)</i> -<a name="IDX230"></a> +<a name="IDX221"></a> </dt> </dl> <dl> <dt><u>Function:</u> int <b>u32_u32_vsprintf</b><i> (uint32_t *<var>buf</var>, const uint32_t *<var>format</var>, va_list <var>ap</var>)</i> -<a name="IDX231"></a> +<a name="IDX222"></a> </dt> </dl> <dl> <dt><u>Function:</u> int <b>u32_u32_vsnprintf</b><i> (uint32_t *<var>buf</var>, size_t <var>size</var>, const uint32_t *<var>format</var>, va_list <var>ap</var>)</i> -<a name="IDX232"></a> +<a name="IDX223"></a> </dt> </dl> <dl> <dt><u>Function:</u> int <b>u32_u32_vasprintf</b><i> (uint32_t **<var>resultp</var>, const uint32_t *<var>format</var>, va_list <var>ap</var>)</i> -<a name="IDX233"></a> +<a name="IDX224"></a> </dt> </dl> <dl> <dt><u>Function:</u> uint32_t * <b>u32_u32_vasnprintf</b><i> (uint32_t *resultbuf, size_t *<var>lengthp</var>, const uint32_t *<var>format</var>, va_list <var>ap</var>)</i> -<a name="IDX234"></a> +<a name="IDX225"></a> </dt> </dl> @@ -418,18 +418,18 @@ locale encoding to a <code>FILE</code> stream. </p> <dl> <dt><u>Function:</u> int <b>ulc_fprintf</b><i> (FILE *<var>stream</var>, const char *<var>format</var>, ...)</i> -<a name="IDX235"></a> +<a name="IDX226"></a> </dt> </dl> <dl> <dt><u>Function:</u> int <b>ulc_vfprintf</b><i> (FILE *<var>stream</var>, const char *<var>format</var>, va_list <var>ap</var>)</i> -<a name="IDX236"></a> +<a name="IDX227"></a> </dt> </dl> <hr size="6"> <table cellpadding="1" cellspacing="1" border="0"> -<tr><td valign="middle" align="left">[<a href="libunistring_5.html#SEC17" title="Beginning of this chapter or previous chapter"> << </a>]</td> -<td valign="middle" align="left">[<a href="libunistring_7.html#SEC19" title="Next chapter"> >> </a>]</td> +<tr><td valign="middle" align="left">[<a href="libunistring_5.html#SEC30" title="Beginning of this chapter or previous chapter"> << </a>]</td> +<td valign="middle" align="left">[<a href="libunistring_7.html#SEC32" title="Next chapter"> >> </a>]</td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> @@ -437,12 +437,12 @@ locale encoding to a <code>FILE</code> stream. <td valign="middle" align="left"> </td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Top" title="Cover (top) of document">Top</a>]</td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Contents" title="Table of contents">Contents</a>]</td> -<td valign="middle" align="left">[<a href="libunistring_19.html#SEC77" title="Index">Index</a>]</td> +<td valign="middle" align="left">[<a href="libunistring_20.html#SEC91" title="Index">Index</a>]</td> <td valign="middle" align="left">[<a href="libunistring_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <p> <font size="-1"> - This document was generated by <em>Daiki Ueno</em> on <em>November, 30 2017</em> using <a href="http://www.nongnu.org/texi2html/"><em>texi2html 1.78a</em></a>. + This document was generated by <em>Daiki Ueno</em> on <em>May, 25 2018</em> using <a href="http://www.nongnu.org/texi2html/"><em>texi2html 1.78a</em></a>. </font> <br> diff --git a/doc/libunistring_7.html b/doc/libunistring_7.html index d2203e1f..7fa99b36 100644 --- a/doc/libunistring_7.html +++ b/doc/libunistring_7.html @@ -1,6 +1,6 @@ <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html401/loose.dtd"> <html> -<!-- Created on November, 30 2017 by texi2html 1.78a --> +<!-- Created on May, 25 2018 by texi2html 1.78a --> <!-- Written by: Lionel Cons <Lionel.Cons@cern.ch> (original author) Karl Berry <karl@freefriends.org> @@ -42,8 +42,8 @@ ul.toc {list-style: none} <body lang="en" bgcolor="#FFFFFF" text="#000000" link="#0000FF" vlink="#800080" alink="#FF0000"> <table cellpadding="1" cellspacing="1" border="0"> -<tr><td valign="middle" align="left">[<a href="libunistring_6.html#SEC18" title="Beginning of this chapter or previous chapter"> << </a>]</td> -<td valign="middle" align="left">[<a href="libunistring_8.html#SEC20" title="Next chapter"> >> </a>]</td> +<tr><td valign="middle" align="left">[<a href="libunistring_6.html#SEC31" title="Beginning of this chapter or previous chapter"> << </a>]</td> +<td valign="middle" align="left">[<a href="libunistring_8.html#SEC33" title="Next chapter"> >> </a>]</td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> @@ -51,14 +51,14 @@ ul.toc {list-style: none} <td valign="middle" align="left"> </td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Top" title="Cover (top) of document">Top</a>]</td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Contents" title="Table of contents">Contents</a>]</td> -<td valign="middle" align="left">[<a href="libunistring_19.html#SEC77" title="Index">Index</a>]</td> +<td valign="middle" align="left">[<a href="libunistring_20.html#SEC91" title="Index">Index</a>]</td> <td valign="middle" align="left">[<a href="libunistring_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <hr size="2"> <a name="uniname_002eh"></a> -<a name="SEC19"></a> -<h1 class="chapter"> <a href="libunistring.html#TOC19">7. Names of Unicode characters <code><uniname.h></code></a> </h1> +<a name="SEC32"></a> +<h1 class="chapter"> <a href="libunistring.html#TOC32">7. Names of Unicode characters <code><uniname.h></code></a> </h1> <p>This include file implements the association between a Unicode character and its name. @@ -70,7 +70,7 @@ named <code>"MULTIPLICATION SIGN"</code>. </p> <dl> <dt><u>Macro:</u> unsigned int <b>UNINAME_MAX</b> -<a name="IDX237"></a> +<a name="IDX228"></a> </dt> <dd><p>This macro expands to a constant that is the required size of buffer for a Unicode character name. @@ -78,7 +78,7 @@ Unicode character name. <dl> <dt><u>Function:</u> char * <b>unicode_character_name</b><i> (ucs4_t <var>uc</var>, char *<var>buf</var>)</i> -<a name="IDX238"></a> +<a name="IDX229"></a> </dt> <dd><p>Looks up the name of a Unicode character, in uppercase ASCII. <var>buf</var> must point to a buffer, at least <code>UNINAME_MAX</code> bytes in size. @@ -87,7 +87,7 @@ Returns the filled <var>buf</var>, or NULL if the character does not have a name <dl> <dt><u>Function:</u> ucs4_t <b>unicode_name_character</b><i> (const char *<var>name</var>)</i> -<a name="IDX239"></a> +<a name="IDX230"></a> </dt> <dd><p>Looks up the Unicode character with a given name, in upper- or lowercase ASCII. <var>NAME</var> can also be an alias name of a character. @@ -96,15 +96,15 @@ Returns the character if found, or <code>UNINAME_INVALID</code> if not found. <dl> <dt><u>Macro:</u> ucs4_t <b>UNINAME_INVALID</b> -<a name="IDX240"></a> +<a name="IDX231"></a> </dt> <dd><p>This macro expands to a constant that is a special return value of the <code>unicode_name_character</code> function. </p></dd></dl> <hr size="6"> <table cellpadding="1" cellspacing="1" border="0"> -<tr><td valign="middle" align="left">[<a href="libunistring_6.html#SEC18" title="Beginning of this chapter or previous chapter"> << </a>]</td> -<td valign="middle" align="left">[<a href="libunistring_8.html#SEC20" title="Next chapter"> >> </a>]</td> +<tr><td valign="middle" align="left">[<a href="libunistring_6.html#SEC31" title="Beginning of this chapter or previous chapter"> << </a>]</td> +<td valign="middle" align="left">[<a href="libunistring_8.html#SEC33" title="Next chapter"> >> </a>]</td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> @@ -112,12 +112,12 @@ Returns the character if found, or <code>UNINAME_INVALID</code> if not found. <td valign="middle" align="left"> </td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Top" title="Cover (top) of document">Top</a>]</td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Contents" title="Table of contents">Contents</a>]</td> -<td valign="middle" align="left">[<a href="libunistring_19.html#SEC77" title="Index">Index</a>]</td> +<td valign="middle" align="left">[<a href="libunistring_20.html#SEC91" title="Index">Index</a>]</td> <td valign="middle" align="left">[<a href="libunistring_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <p> <font size="-1"> - This document was generated by <em>Daiki Ueno</em> on <em>November, 30 2017</em> using <a href="http://www.nongnu.org/texi2html/"><em>texi2html 1.78a</em></a>. + This document was generated by <em>Daiki Ueno</em> on <em>May, 25 2018</em> using <a href="http://www.nongnu.org/texi2html/"><em>texi2html 1.78a</em></a>. </font> <br> diff --git a/doc/libunistring_8.html b/doc/libunistring_8.html index ce474872..1af96f55 100644 --- a/doc/libunistring_8.html +++ b/doc/libunistring_8.html @@ -1,6 +1,6 @@ <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html401/loose.dtd"> <html> -<!-- Created on November, 30 2017 by texi2html 1.78a --> +<!-- Created on May, 25 2018 by texi2html 1.78a --> <!-- Written by: Lionel Cons <Lionel.Cons@cern.ch> (original author) Karl Berry <karl@freefriends.org> @@ -42,8 +42,8 @@ ul.toc {list-style: none} <body lang="en" bgcolor="#FFFFFF" text="#000000" link="#0000FF" vlink="#800080" alink="#FF0000"> <table cellpadding="1" cellspacing="1" border="0"> -<tr><td valign="middle" align="left">[<a href="libunistring_7.html#SEC19" title="Beginning of this chapter or previous chapter"> << </a>]</td> -<td valign="middle" align="left">[<a href="libunistring_9.html#SEC40" title="Next chapter"> >> </a>]</td> +<tr><td valign="middle" align="left">[<a href="libunistring_7.html#SEC32" title="Beginning of this chapter or previous chapter"> << </a>]</td> +<td valign="middle" align="left">[<a href="libunistring_9.html#SEC53" title="Next chapter"> >> </a>]</td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> @@ -51,14 +51,14 @@ ul.toc {list-style: none} <td valign="middle" align="left"> </td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Top" title="Cover (top) of document">Top</a>]</td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Contents" title="Table of contents">Contents</a>]</td> -<td valign="middle" align="left">[<a href="libunistring_19.html#SEC77" title="Index">Index</a>]</td> +<td valign="middle" align="left">[<a href="libunistring_20.html#SEC91" title="Index">Index</a>]</td> <td valign="middle" align="left">[<a href="libunistring_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <hr size="2"> <a name="unictype_002eh"></a> -<a name="SEC20"></a> -<h1 class="chapter"> <a href="libunistring.html#TOC20">8. Unicode character classification and properties <code><unictype.h></code></a> </h1> +<a name="SEC33"></a> +<h1 class="chapter"> <a href="libunistring.html#TOC33">8. Unicode character classification and properties <code><unictype.h></code></a> </h1> <p>This include file declares functions that classify Unicode characters and that test whether Unicode characters have specific properties. @@ -73,8 +73,8 @@ in the presence of specific Unicode characters. <hr size="6"> <a name="General-category"></a> -<a name="SEC21"></a> -<h2 class="section"> <a href="libunistring.html#TOC21">8.1 General category</a> </h2> +<a name="SEC34"></a> +<h2 class="section"> <a href="libunistring.html#TOC34">8.1 General category</a> </h2> <p>Every Unicode character or code point has a <em>general category</em> assigned to it. This classification is important for most algorithms that work on @@ -94,12 +94,12 @@ information for all Unicode characters. <hr size="6"> <a name="Object-oriented-API"></a> -<a name="SEC22"></a> -<h3 class="subsection"> <a href="libunistring.html#TOC22">8.1.1 The object oriented API for general category</a> </h3> +<a name="SEC35"></a> +<h3 class="subsection"> <a href="libunistring.html#TOC35">8.1.1 The object oriented API for general category</a> </h3> <dl> <dt><u>Type:</u> <b>uc_general_category_t</b> -<a name="IDX241"></a> +<a name="IDX232"></a> </dt> <dd><p>This data type denotes a general category value. It is an immediate type that can be copied by simple assignment, without involving memory allocation. It is @@ -109,391 +109,389 @@ not an array type. <p>The following are the predefined general category value. Additional general categories may be added in the future. </p> +<p>The <code>UC_CATEGORY_*</code> constants reflect the systematic general category +values assigned by the Unicode Consortium. Whereas the other <code>UC_*</code> +macros are aliases, for use when readable code is preferred. +</p> <dl> <dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_L</b> -<a name="IDX242"></a> -</dt> -<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_LC</b> -<a name="IDX243"></a> -</dt> -<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_Lu</b> -<a name="IDX244"></a> -</dt> -<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_Ll</b> -<a name="IDX245"></a> -</dt> -<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_Lt</b> -<a name="IDX246"></a> -</dt> -<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_Lm</b> -<a name="IDX247"></a> -</dt> -<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_Lo</b> -<a name="IDX248"></a> -</dt> -<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_M</b> -<a name="IDX249"></a> -</dt> -<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_Mn</b> -<a name="IDX250"></a> -</dt> -<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_Mc</b> -<a name="IDX251"></a> -</dt> -<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_Me</b> -<a name="IDX252"></a> -</dt> -<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_N</b> -<a name="IDX253"></a> -</dt> -<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_Nd</b> -<a name="IDX254"></a> -</dt> -<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_Nl</b> -<a name="IDX255"></a> -</dt> -<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_No</b> -<a name="IDX256"></a> -</dt> -<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_P</b> -<a name="IDX257"></a> -</dt> -<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_Pc</b> -<a name="IDX258"></a> -</dt> -<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_Pd</b> -<a name="IDX259"></a> -</dt> -<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_Ps</b> -<a name="IDX260"></a> -</dt> -<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_Pe</b> -<a name="IDX261"></a> -</dt> -<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_Pi</b> -<a name="IDX262"></a> -</dt> -<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_Pf</b> -<a name="IDX263"></a> -</dt> -<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_Po</b> -<a name="IDX264"></a> -</dt> -<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_S</b> -<a name="IDX265"></a> -</dt> -<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_Sm</b> -<a name="IDX266"></a> -</dt> -<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_Sc</b> -<a name="IDX267"></a> -</dt> -<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_Sk</b> -<a name="IDX268"></a> +<a name="IDX233"></a> </dt> -<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_So</b> -<a name="IDX269"></a> -</dt> -<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_Z</b> -<a name="IDX270"></a> -</dt> -<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_Zs</b> -<a name="IDX271"></a> -</dt> -<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_Zl</b> -<a name="IDX272"></a> -</dt> -<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_Zp</b> -<a name="IDX273"></a> -</dt> -<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_C</b> -<a name="IDX274"></a> -</dt> -<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_Cc</b> -<a name="IDX275"></a> -</dt> -<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_Cf</b> -<a name="IDX276"></a> -</dt> -<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_Cs</b> -<a name="IDX277"></a> -</dt> -<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_Co</b> -<a name="IDX278"></a> -</dt> -<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_Cn</b> -<a name="IDX279"></a> -</dt> -</dl> - -<p>The following are alias names for predefined General category values. -</p> -<dl> <dt><u>Macro:</u> uc_general_category_t <b>UC_LETTER</b> -<a name="IDX280"></a> +<a name="IDX234"></a> </dt> -<dd><p>This is another name for <code>UC_CATEGORY_L</code>. +<dd><p>This represents the general category “Letter”. </p></dd></dl> <dl> +<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_LC</b> +<a name="IDX235"></a> +</dt> <dt><u>Macro:</u> uc_general_category_t <b>UC_CASED_LETTER</b> -<a name="IDX281"></a> +<a name="IDX236"></a> </dt> -<dd><p>This is another name for <code>UC_CATEGORY_LC</code>. -</p></dd></dl> +</dl> <dl> +<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_Lu</b> +<a name="IDX237"></a> +</dt> <dt><u>Macro:</u> uc_general_category_t <b>UC_UPPERCASE_LETTER</b> -<a name="IDX282"></a> +<a name="IDX238"></a> </dt> -<dd><p>This is another name for <code>UC_CATEGORY_Lu</code>. +<dd><p>This represents the general category “Letter, uppercase”. </p></dd></dl> <dl> +<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_Ll</b> +<a name="IDX239"></a> +</dt> <dt><u>Macro:</u> uc_general_category_t <b>UC_LOWERCASE_LETTER</b> -<a name="IDX283"></a> +<a name="IDX240"></a> </dt> -<dd><p>This is another name for <code>UC_CATEGORY_Ll</code>. +<dd><p>This represents the general category “Letter, lowercase”. </p></dd></dl> <dl> +<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_Lt</b> +<a name="IDX241"></a> +</dt> <dt><u>Macro:</u> uc_general_category_t <b>UC_TITLECASE_LETTER</b> -<a name="IDX284"></a> +<a name="IDX242"></a> </dt> -<dd><p>This is another name for <code>UC_CATEGORY_Lt</code>. +<dd><p>This represents the general category “Letter, titlecase”. </p></dd></dl> <dl> +<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_Lm</b> +<a name="IDX243"></a> +</dt> <dt><u>Macro:</u> uc_general_category_t <b>UC_MODIFIER_LETTER</b> -<a name="IDX285"></a> +<a name="IDX244"></a> </dt> -<dd><p>This is another name for <code>UC_CATEGORY_Lm</code>. +<dd><p>This represents the general category “Letter, modifier”. </p></dd></dl> <dl> +<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_Lo</b> +<a name="IDX245"></a> +</dt> <dt><u>Macro:</u> uc_general_category_t <b>UC_OTHER_LETTER</b> -<a name="IDX286"></a> +<a name="IDX246"></a> </dt> -<dd><p>This is another name for <code>UC_CATEGORY_Lo</code>. +<dd><p>This represents the general category “Letter, other”. </p></dd></dl> <dl> +<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_M</b> +<a name="IDX247"></a> +</dt> <dt><u>Macro:</u> uc_general_category_t <b>UC_MARK</b> -<a name="IDX287"></a> +<a name="IDX248"></a> </dt> -<dd><p>This is another name for <code>UC_CATEGORY_M</code>. +<dd><p>This represents the general category “Marker”. </p></dd></dl> <dl> +<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_Mn</b> +<a name="IDX249"></a> +</dt> <dt><u>Macro:</u> uc_general_category_t <b>UC_NON_SPACING_MARK</b> -<a name="IDX288"></a> +<a name="IDX250"></a> </dt> -<dd><p>This is another name for <code>UC_CATEGORY_Mn</code>. +<dd><p>This represents the general category “Marker, nonspacing”. </p></dd></dl> <dl> +<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_Mc</b> +<a name="IDX251"></a> +</dt> <dt><u>Macro:</u> uc_general_category_t <b>UC_COMBINING_SPACING_MARK</b> -<a name="IDX289"></a> +<a name="IDX252"></a> </dt> -<dd><p>This is another name for <code>UC_CATEGORY_Mc</code>. +<dd><p>This represents the general category “Marker, spacing combining”. </p></dd></dl> <dl> +<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_Me</b> +<a name="IDX253"></a> +</dt> <dt><u>Macro:</u> uc_general_category_t <b>UC_ENCLOSING_MARK</b> -<a name="IDX290"></a> +<a name="IDX254"></a> </dt> -<dd><p>This is another name for <code>UC_CATEGORY_Me</code>. +<dd><p>This represents the general category “Marker, enclosing”. </p></dd></dl> <dl> +<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_N</b> +<a name="IDX255"></a> +</dt> <dt><u>Macro:</u> uc_general_category_t <b>UC_NUMBER</b> -<a name="IDX291"></a> +<a name="IDX256"></a> </dt> -<dd><p>This is another name for <code>UC_CATEGORY_N</code>. +<dd><p>This represents the general category “Number”. </p></dd></dl> <dl> +<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_Nd</b> +<a name="IDX257"></a> +</dt> <dt><u>Macro:</u> uc_general_category_t <b>UC_DECIMAL_DIGIT_NUMBER</b> -<a name="IDX292"></a> +<a name="IDX258"></a> </dt> -<dd><p>This is another name for <code>UC_CATEGORY_Nd</code>. +<dd><p>This represents the general category “Number, decimal digit”. </p></dd></dl> <dl> +<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_Nl</b> +<a name="IDX259"></a> +</dt> <dt><u>Macro:</u> uc_general_category_t <b>UC_LETTER_NUMBER</b> -<a name="IDX293"></a> +<a name="IDX260"></a> </dt> -<dd><p>This is another name for <code>UC_CATEGORY_Nl</code>. +<dd><p>This represents the general category “Number, letter”. </p></dd></dl> <dl> +<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_No</b> +<a name="IDX261"></a> +</dt> <dt><u>Macro:</u> uc_general_category_t <b>UC_OTHER_NUMBER</b> -<a name="IDX294"></a> +<a name="IDX262"></a> </dt> -<dd><p>This is another name for <code>UC_CATEGORY_No</code>. +<dd><p>This represents the general category “Number, other”. </p></dd></dl> <dl> +<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_P</b> +<a name="IDX263"></a> +</dt> <dt><u>Macro:</u> uc_general_category_t <b>UC_PUNCTUATION</b> -<a name="IDX295"></a> +<a name="IDX264"></a> </dt> -<dd><p>This is another name for <code>UC_CATEGORY_P</code>. +<dd><p>This represents the general category “Punctuation”. </p></dd></dl> <dl> +<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_Pc</b> +<a name="IDX265"></a> +</dt> <dt><u>Macro:</u> uc_general_category_t <b>UC_CONNECTOR_PUNCTUATION</b> -<a name="IDX296"></a> +<a name="IDX266"></a> </dt> -<dd><p>This is another name for <code>UC_CATEGORY_Pc</code>. +<dd><p>This represents the general category “Punctuation, connector”. </p></dd></dl> <dl> +<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_Pd</b> +<a name="IDX267"></a> +</dt> <dt><u>Macro:</u> uc_general_category_t <b>UC_DASH_PUNCTUATION</b> -<a name="IDX297"></a> +<a name="IDX268"></a> </dt> -<dd><p>This is another name for <code>UC_CATEGORY_Pd</code>. +<dd><p>This represents the general category “Punctuation, dash”. </p></dd></dl> <dl> +<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_Ps</b> +<a name="IDX269"></a> +</dt> <dt><u>Macro:</u> uc_general_category_t <b>UC_OPEN_PUNCTUATION</b> -<a name="IDX298"></a> +<a name="IDX270"></a> </dt> -<dd><p>This is another name for <code>UC_CATEGORY_Ps</code> (“start punctuation”). +<dd><p>This represents the general category “Punctuation, open”, a.k.a. “start punctuation”. </p></dd></dl> <dl> +<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_Pe</b> +<a name="IDX271"></a> +</dt> <dt><u>Macro:</u> uc_general_category_t <b>UC_CLOSE_PUNCTUATION</b> -<a name="IDX299"></a> +<a name="IDX272"></a> </dt> -<dd><p>This is another name for <code>UC_CATEGORY_Pe</code> (“end punctuation”). +<dd><p>This represents the general category “Punctuation, close”, a.k.a. “end punctuation”. </p></dd></dl> <dl> +<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_Pi</b> +<a name="IDX273"></a> +</dt> <dt><u>Macro:</u> uc_general_category_t <b>UC_INITIAL_QUOTE_PUNCTUATION</b> -<a name="IDX300"></a> +<a name="IDX274"></a> </dt> -<dd><p>This is another name for <code>UC_CATEGORY_Pi</code>. +<dd><p>This represents the general category “Punctuation, initial quote”. </p></dd></dl> <dl> +<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_Pf</b> +<a name="IDX275"></a> +</dt> <dt><u>Macro:</u> uc_general_category_t <b>UC_FINAL_QUOTE_PUNCTUATION</b> -<a name="IDX301"></a> +<a name="IDX276"></a> </dt> -<dd><p>This is another name for <code>UC_CATEGORY_Pf</code>. +<dd><p>This represents the general category “Punctuation, final quote”. </p></dd></dl> <dl> +<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_Po</b> +<a name="IDX277"></a> +</dt> <dt><u>Macro:</u> uc_general_category_t <b>UC_OTHER_PUNCTUATION</b> -<a name="IDX302"></a> +<a name="IDX278"></a> </dt> -<dd><p>This is another name for <code>UC_CATEGORY_Po</code>. +<dd><p>This represents the general category “Punctuation, other”. </p></dd></dl> <dl> +<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_S</b> +<a name="IDX279"></a> +</dt> <dt><u>Macro:</u> uc_general_category_t <b>UC_SYMBOL</b> -<a name="IDX303"></a> +<a name="IDX280"></a> </dt> -<dd><p>This is another name for <code>UC_CATEGORY_S</code>. +<dd><p>This represents the general category “Symbol”. </p></dd></dl> <dl> +<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_Sm</b> +<a name="IDX281"></a> +</dt> <dt><u>Macro:</u> uc_general_category_t <b>UC_MATH_SYMBOL</b> -<a name="IDX304"></a> +<a name="IDX282"></a> </dt> -<dd><p>This is another name for <code>UC_CATEGORY_Sm</code>. +<dd><p>This represents the general category “Symbol, math”. </p></dd></dl> <dl> +<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_Sc</b> +<a name="IDX283"></a> +</dt> <dt><u>Macro:</u> uc_general_category_t <b>UC_CURRENCY_SYMBOL</b> -<a name="IDX305"></a> +<a name="IDX284"></a> </dt> -<dd><p>This is another name for <code>UC_CATEGORY_Sc</code>. +<dd><p>This represents the general category “Symbol, currency”. </p></dd></dl> <dl> +<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_Sk</b> +<a name="IDX285"></a> +</dt> <dt><u>Macro:</u> uc_general_category_t <b>UC_MODIFIER_SYMBOL</b> -<a name="IDX306"></a> +<a name="IDX286"></a> </dt> -<dd><p>This is another name for <code>UC_CATEGORY_Sk</code>. +<dd><p>This represents the general category “Symbol, modifier”. </p></dd></dl> <dl> +<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_So</b> +<a name="IDX287"></a> +</dt> <dt><u>Macro:</u> uc_general_category_t <b>UC_OTHER_SYMBOL</b> -<a name="IDX307"></a> +<a name="IDX288"></a> </dt> -<dd><p>This is another name for <code>UC_CATEGORY_So</code>. +<dd><p>This represents the general category “Symbol, other”. </p></dd></dl> <dl> +<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_Z</b> +<a name="IDX289"></a> +</dt> <dt><u>Macro:</u> uc_general_category_t <b>UC_SEPARATOR</b> -<a name="IDX308"></a> +<a name="IDX290"></a> </dt> -<dd><p>This is another name for <code>UC_CATEGORY_Z</code>. +<dd><p>This represents the general category “Separator”. </p></dd></dl> <dl> +<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_Zs</b> +<a name="IDX291"></a> +</dt> <dt><u>Macro:</u> uc_general_category_t <b>UC_SPACE_SEPARATOR</b> -<a name="IDX309"></a> +<a name="IDX292"></a> </dt> -<dd><p>This is another name for <code>UC_CATEGORY_Zs</code>. +<dd><p>This represents the general category “Separator, space”. </p></dd></dl> <dl> +<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_Zl</b> +<a name="IDX293"></a> +</dt> <dt><u>Macro:</u> uc_general_category_t <b>UC_LINE_SEPARATOR</b> -<a name="IDX310"></a> +<a name="IDX294"></a> </dt> -<dd><p>This is another name for <code>UC_CATEGORY_Zl</code>. +<dd><p>This represents the general category “Separator, line”. </p></dd></dl> <dl> +<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_Zp</b> +<a name="IDX295"></a> +</dt> <dt><u>Macro:</u> uc_general_category_t <b>UC_PARAGRAPH_SEPARATOR</b> -<a name="IDX311"></a> +<a name="IDX296"></a> </dt> -<dd><p>This is another name for <code>UC_CATEGORY_Zp</code>. +<dd><p>This represents the general category “Separator, paragraph”. </p></dd></dl> <dl> +<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_C</b> +<a name="IDX297"></a> +</dt> <dt><u>Macro:</u> uc_general_category_t <b>UC_OTHER</b> -<a name="IDX312"></a> +<a name="IDX298"></a> </dt> -<dd><p>This is another name for <code>UC_CATEGORY_C</code>. +<dd><p>This represents the general category “Other”. </p></dd></dl> <dl> +<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_Cc</b> +<a name="IDX299"></a> +</dt> <dt><u>Macro:</u> uc_general_category_t <b>UC_CONTROL</b> -<a name="IDX313"></a> +<a name="IDX300"></a> </dt> -<dd><p>This is another name for <code>UC_CATEGORY_Cc</code>. +<dd><p>This represents the general category “Other, control”. </p></dd></dl> <dl> +<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_Cf</b> +<a name="IDX301"></a> +</dt> <dt><u>Macro:</u> uc_general_category_t <b>UC_FORMAT</b> -<a name="IDX314"></a> +<a name="IDX302"></a> </dt> -<dd><p>This is another name for <code>UC_CATEGORY_Cf</code>. +<dd><p>This represents the general category “Other, format”. </p></dd></dl> <dl> +<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_Cs</b> +<a name="IDX303"></a> +</dt> <dt><u>Macro:</u> uc_general_category_t <b>UC_SURROGATE</b> -<a name="IDX315"></a> +<a name="IDX304"></a> </dt> -<dd><p>This is another name for <code>UC_CATEGORY_Cs</code>. All code points in this -category are invalid characters. +<dd><p>This represents the general category “Other, surrogate”. +All code points in this category are invalid characters. </p></dd></dl> <dl> +<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_Co</b> +<a name="IDX305"></a> +</dt> <dt><u>Macro:</u> uc_general_category_t <b>UC_PRIVATE_USE</b> -<a name="IDX316"></a> +<a name="IDX306"></a> </dt> -<dd><p>This is another name for <code>UC_CATEGORY_Co</code>. +<dd><p>This represents the general category “Other, private use”. </p></dd></dl> <dl> +<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_Cn</b> +<a name="IDX307"></a> +</dt> <dt><u>Macro:</u> uc_general_category_t <b>UC_UNASSIGNED</b> -<a name="IDX317"></a> +<a name="IDX308"></a> </dt> -<dd><p>This is another name for <code>UC_CATEGORY_Cn</code>. Some code points in this -category are invalid characters. +<dd><p>This represents the general category “Other, not assigned”. +Some code points in this category are invalid characters. </p></dd></dl> <p>The following functions combine general categories, like in a boolean algebra, @@ -501,7 +499,7 @@ except that there is no ‘<samp>not</samp>’ operation. </p> <dl> <dt><u>Function:</u> uc_general_category_t <b>uc_general_category_or</b><i> (uc_general_category_t <var>category1</var>, uc_general_category_t <var>category2</var>)</i> -<a name="IDX318"></a> +<a name="IDX309"></a> </dt> <dd><p>Returns the union of two general categories. This corresponds to the unions of the two sets of characters. @@ -509,7 +507,7 @@ This corresponds to the unions of the two sets of characters. <dl> <dt><u>Function:</u> uc_general_category_t <b>uc_general_category_and</b><i> (uc_general_category_t <var>category1</var>, uc_general_category_t <var>category2</var>)</i> -<a name="IDX319"></a> +<a name="IDX310"></a> </dt> <dd><p>Returns the intersection of two general categories as bit masks. This <em>does not</em> correspond to the intersection of the two sets of @@ -518,7 +516,7 @@ characters. <dl> <dt><u>Function:</u> uc_general_category_t <b>uc_general_category_and_not</b><i> (uc_general_category_t <var>category1</var>, uc_general_category_t <var>category2</var>)</i> -<a name="IDX320"></a> +<a name="IDX311"></a> </dt> <dd><p>Returns the intersection of a general category with the complement of a second general category, as bit masks. @@ -530,7 +528,7 @@ viewing the categories as sets of characters. </p> <dl> <dt><u>Function:</u> const char * <b>uc_general_category_name</b><i> (uc_general_category_t <var>category</var>)</i> -<a name="IDX321"></a> +<a name="IDX312"></a> </dt> <dd><p>Returns the name of a general category, more precisely, the abbreviated name. Returns NULL if the general category corresponds to a bit mask that does not @@ -539,7 +537,7 @@ have a name. <dl> <dt><u>Function:</u> const char * <b>uc_general_category_long_name</b><i> (uc_general_category_t <var>category</var>)</i> -<a name="IDX322"></a> +<a name="IDX313"></a> </dt> <dd><p>Returns the long name of a general category. Returns NULL if the general category corresponds to a bit mask that does not @@ -548,7 +546,7 @@ have a name. <dl> <dt><u>Function:</u> uc_general_category_t <b>uc_general_category_byname</b><i> (const char *<var>category_name</var>)</i> -<a name="IDX323"></a> +<a name="IDX314"></a> </dt> <dd><p>Returns the general category given by name, e.g. <code>"Lu"</code>, or by long name, e.g. <code>"Uppercase Letter"</code>. @@ -560,7 +558,7 @@ case-insignificant. </p> <dl> <dt><u>Function:</u> uc_general_category_t <b>uc_general_category</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX324"></a> +<a name="IDX315"></a> </dt> <dd><p>Returns the general category of a Unicode character. </p> @@ -569,7 +567,7 @@ case-insignificant. <dl> <dt><u>Function:</u> bool <b>uc_is_general_category</b><i> (ucs4_t <var>uc</var>, uc_general_category_t <var>category</var>)</i> -<a name="IDX325"></a> +<a name="IDX316"></a> </dt> <dd><p>Tests whether a Unicode character belongs to a given category. The <var>category</var> argument can be a predefined general category or the @@ -578,126 +576,126 @@ combination of several predefined general categories. <hr size="6"> <a name="Bit-mask-API"></a> -<a name="SEC23"></a> -<h3 class="subsection"> <a href="libunistring.html#TOC23">8.1.2 The bit mask API for general category</a> </h3> +<a name="SEC36"></a> +<h3 class="subsection"> <a href="libunistring.html#TOC36">8.1.2 The bit mask API for general category</a> </h3> <p>The following are the predefined general category value as bit masks. Additional general categories may be added in the future. </p> <dl> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_L</b> -<a name="IDX326"></a> +<a name="IDX317"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_LC</b> -<a name="IDX327"></a> +<a name="IDX318"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_Lu</b> -<a name="IDX328"></a> +<a name="IDX319"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_Ll</b> -<a name="IDX329"></a> +<a name="IDX320"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_Lt</b> -<a name="IDX330"></a> +<a name="IDX321"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_Lm</b> -<a name="IDX331"></a> +<a name="IDX322"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_Lo</b> -<a name="IDX332"></a> +<a name="IDX323"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_M</b> -<a name="IDX333"></a> +<a name="IDX324"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_Mn</b> -<a name="IDX334"></a> +<a name="IDX325"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_Mc</b> -<a name="IDX335"></a> +<a name="IDX326"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_Me</b> -<a name="IDX336"></a> +<a name="IDX327"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_N</b> -<a name="IDX337"></a> +<a name="IDX328"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_Nd</b> -<a name="IDX338"></a> +<a name="IDX329"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_Nl</b> -<a name="IDX339"></a> +<a name="IDX330"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_No</b> -<a name="IDX340"></a> +<a name="IDX331"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_P</b> -<a name="IDX341"></a> +<a name="IDX332"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_Pc</b> -<a name="IDX342"></a> +<a name="IDX333"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_Pd</b> -<a name="IDX343"></a> +<a name="IDX334"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_Ps</b> -<a name="IDX344"></a> +<a name="IDX335"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_Pe</b> -<a name="IDX345"></a> +<a name="IDX336"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_Pi</b> -<a name="IDX346"></a> +<a name="IDX337"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_Pf</b> -<a name="IDX347"></a> +<a name="IDX338"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_Po</b> -<a name="IDX348"></a> +<a name="IDX339"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_S</b> -<a name="IDX349"></a> +<a name="IDX340"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_Sm</b> -<a name="IDX350"></a> +<a name="IDX341"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_Sc</b> -<a name="IDX351"></a> +<a name="IDX342"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_Sk</b> -<a name="IDX352"></a> +<a name="IDX343"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_So</b> -<a name="IDX353"></a> +<a name="IDX344"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_Z</b> -<a name="IDX354"></a> +<a name="IDX345"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_Zs</b> -<a name="IDX355"></a> +<a name="IDX346"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_Zl</b> -<a name="IDX356"></a> +<a name="IDX347"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_Zp</b> -<a name="IDX357"></a> +<a name="IDX348"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_C</b> -<a name="IDX358"></a> +<a name="IDX349"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_Cc</b> -<a name="IDX359"></a> +<a name="IDX350"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_Cf</b> -<a name="IDX360"></a> +<a name="IDX351"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_Cs</b> -<a name="IDX361"></a> +<a name="IDX352"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_Co</b> -<a name="IDX362"></a> +<a name="IDX353"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_Cn</b> -<a name="IDX363"></a> +<a name="IDX354"></a> </dt> </dl> @@ -705,7 +703,7 @@ Additional general categories may be added in the future. </p> <dl> <dt><u>Function:</u> bool <b>uc_is_general_category_withtable</b><i> (ucs4_t <var>uc</var>, uint32_t <var>bitmask</var>)</i> -<a name="IDX364"></a> +<a name="IDX355"></a> </dt> <dd><p>Tests whether a Unicode character belongs to a given category. The <var>bitmask</var> argument can be a predefined general category bitmask or the @@ -716,8 +714,8 @@ combination of several predefined general category bitmasks. <hr size="6"> <a name="Canonical-combining-class"></a> -<a name="SEC24"></a> -<h2 class="section"> <a href="libunistring.html#TOC24">8.2 Canonical combining class</a> </h2> +<a name="SEC37"></a> +<h2 class="section"> <a href="libunistring.html#TOC37">8.2 Canonical combining class</a> </h2> <p>Every Unicode character or code point has a <em>canonical combining class</em> assigned to it. @@ -737,7 +735,7 @@ not definitive; more values can be added in future versions. </p> <dl> <dt><u>Constant:</u> int <b>UC_CCC_NR</b> -<a name="IDX365"></a> +<a name="IDX356"></a> </dt> <dd><p>The canonical combining class value for “Not Reordered” characters. The value is 0. @@ -745,133 +743,133 @@ The value is 0. <dl> <dt><u>Constant:</u> int <b>UC_CCC_OV</b> -<a name="IDX366"></a> +<a name="IDX357"></a> </dt> <dd><p>The canonical combining class value for “Overlay” characters. </p></dd></dl> <dl> <dt><u>Constant:</u> int <b>UC_CCC_NK</b> -<a name="IDX367"></a> +<a name="IDX358"></a> </dt> <dd><p>The canonical combining class value for “Nukta” characters. </p></dd></dl> <dl> <dt><u>Constant:</u> int <b>UC_CCC_KV</b> -<a name="IDX368"></a> +<a name="IDX359"></a> </dt> <dd><p>The canonical combining class value for “Kana Voicing” characters. </p></dd></dl> <dl> <dt><u>Constant:</u> int <b>UC_CCC_VR</b> -<a name="IDX369"></a> +<a name="IDX360"></a> </dt> <dd><p>The canonical combining class value for “Virama” characters. </p></dd></dl> <dl> <dt><u>Constant:</u> int <b>UC_CCC_ATBL</b> -<a name="IDX370"></a> +<a name="IDX361"></a> </dt> <dd><p>The canonical combining class value for “Attached Below Left” characters. </p></dd></dl> <dl> <dt><u>Constant:</u> int <b>UC_CCC_ATB</b> -<a name="IDX371"></a> +<a name="IDX362"></a> </dt> <dd><p>The canonical combining class value for “Attached Below” characters. </p></dd></dl> <dl> <dt><u>Constant:</u> int <b>UC_CCC_ATA</b> -<a name="IDX372"></a> +<a name="IDX363"></a> </dt> <dd><p>The canonical combining class value for “Attached Above” characters. </p></dd></dl> <dl> <dt><u>Constant:</u> int <b>UC_CCC_ATAR</b> -<a name="IDX373"></a> +<a name="IDX364"></a> </dt> <dd><p>The canonical combining class value for “Attached Above Right” characters. </p></dd></dl> <dl> <dt><u>Constant:</u> int <b>UC_CCC_BL</b> -<a name="IDX374"></a> +<a name="IDX365"></a> </dt> <dd><p>The canonical combining class value for “Below Left” characters. </p></dd></dl> <dl> <dt><u>Constant:</u> int <b>UC_CCC_B</b> -<a name="IDX375"></a> +<a name="IDX366"></a> </dt> <dd><p>The canonical combining class value for “Below” characters. </p></dd></dl> <dl> <dt><u>Constant:</u> int <b>UC_CCC_BR</b> -<a name="IDX376"></a> +<a name="IDX367"></a> </dt> <dd><p>The canonical combining class value for “Below Right” characters. </p></dd></dl> <dl> <dt><u>Constant:</u> int <b>UC_CCC_L</b> -<a name="IDX377"></a> +<a name="IDX368"></a> </dt> <dd><p>The canonical combining class value for “Left” characters. </p></dd></dl> <dl> <dt><u>Constant:</u> int <b>UC_CCC_R</b> -<a name="IDX378"></a> +<a name="IDX369"></a> </dt> <dd><p>The canonical combining class value for “Right” characters. </p></dd></dl> <dl> <dt><u>Constant:</u> int <b>UC_CCC_AL</b> -<a name="IDX379"></a> +<a name="IDX370"></a> </dt> <dd><p>The canonical combining class value for “Above Left” characters. </p></dd></dl> <dl> <dt><u>Constant:</u> int <b>UC_CCC_A</b> -<a name="IDX380"></a> +<a name="IDX371"></a> </dt> <dd><p>The canonical combining class value for “Above” characters. </p></dd></dl> <dl> <dt><u>Constant:</u> int <b>UC_CCC_AR</b> -<a name="IDX381"></a> +<a name="IDX372"></a> </dt> <dd><p>The canonical combining class value for “Above Right” characters. </p></dd></dl> <dl> <dt><u>Constant:</u> int <b>UC_CCC_DB</b> -<a name="IDX382"></a> +<a name="IDX373"></a> </dt> <dd><p>The canonical combining class value for “Double Below” characters. </p></dd></dl> <dl> <dt><u>Constant:</u> int <b>UC_CCC_DA</b> -<a name="IDX383"></a> +<a name="IDX374"></a> </dt> <dd><p>The canonical combining class value for “Double Above” characters. </p></dd></dl> <dl> <dt><u>Constant:</u> int <b>UC_CCC_IS</b> -<a name="IDX384"></a> +<a name="IDX375"></a> </dt> <dd><p>The canonical combining class value for “Iota Subscript” characters. </p></dd></dl> @@ -880,7 +878,7 @@ The value is 0. </p> <dl> <dt><u>Function:</u> const char * <b>uc_combining_class_name</b><i> (int <var>ccc</var>)</i> -<a name="IDX385"></a> +<a name="IDX376"></a> </dt> <dd><p>Returns the name of a canonical combining class, more precisely, the abbreviated name. @@ -890,7 +888,7 @@ name. <dl> <dt><u>Function:</u> const char * <b>uc_combining_class_long_name</b><i> (int <var>ccc</var>)</i> -<a name="IDX386"></a> +<a name="IDX377"></a> </dt> <dd><p>Returns the long name of a canonical combining class. Returns NULL if the canonical combining class is a numeric value without a @@ -899,7 +897,7 @@ name. <dl> <dt><u>Function:</u> int <b>uc_combining_class_byname</b><i> (const char *<var>ccc_name</var>)</i> -<a name="IDX387"></a> +<a name="IDX378"></a> </dt> <dd><p>Returns the canonical combining class given by name, e.g. <code>"BL"</code>, or by long name, e.g. <code>"Below Left"</code>. @@ -911,15 +909,15 @@ case-insignificant. </p> <dl> <dt><u>Function:</u> int <b>uc_combining_class</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX388"></a> +<a name="IDX379"></a> </dt> <dd><p>Returns the canonical combining class of a Unicode character. </p></dd></dl> <hr size="6"> <a name="Bidi-class"></a> -<a name="SEC25"></a> -<h2 class="section"> <a href="libunistring.html#TOC25">8.3 Bidi class</a> </h2> +<a name="SEC38"></a> +<h2 class="section"> <a href="libunistring.html#TOC38">8.3 Bidi class</a> </h2> <p>Every Unicode character or code point has a <em>bidi class</em> assigned to it. Before Unicode 4.0, this concept was known as <em>bidirectional category</em>. @@ -930,133 +928,133 @@ the following. </p> <dl> <dt><u>Constant:</u> int <b>UC_BIDI_L</b> -<a name="IDX389"></a> +<a name="IDX380"></a> </dt> <dd><p>The bidi class for `Left-to-Right`” characters. </p></dd></dl> <dl> <dt><u>Constant:</u> int <b>UC_BIDI_LRE</b> -<a name="IDX390"></a> +<a name="IDX381"></a> </dt> <dd><p>The bidi class for “Left-to-Right Embedding” characters. </p></dd></dl> <dl> <dt><u>Constant:</u> int <b>UC_BIDI_LRO</b> -<a name="IDX391"></a> +<a name="IDX382"></a> </dt> <dd><p>The bidi class for “Left-to-Right Override” characters. </p></dd></dl> <dl> <dt><u>Constant:</u> int <b>UC_BIDI_R</b> -<a name="IDX392"></a> +<a name="IDX383"></a> </dt> <dd><p>The bidi class for “Right-to-Left” characters. </p></dd></dl> <dl> <dt><u>Constant:</u> int <b>UC_BIDI_AL</b> -<a name="IDX393"></a> +<a name="IDX384"></a> </dt> <dd><p>The bidi class for “Right-to-Left Arabic” characters. </p></dd></dl> <dl> <dt><u>Constant:</u> int <b>UC_BIDI_RLE</b> -<a name="IDX394"></a> +<a name="IDX385"></a> </dt> <dd><p>The bidi class for “Right-to-Left Embedding” characters. </p></dd></dl> <dl> <dt><u>Constant:</u> int <b>UC_BIDI_RLO</b> -<a name="IDX395"></a> +<a name="IDX386"></a> </dt> <dd><p>The bidi class for “Right-to-Left Override” characters. </p></dd></dl> <dl> <dt><u>Constant:</u> int <b>UC_BIDI_PDF</b> -<a name="IDX396"></a> +<a name="IDX387"></a> </dt> <dd><p>The bidi class for “Pop Directional Format” characters. </p></dd></dl> <dl> <dt><u>Constant:</u> int <b>UC_BIDI_EN</b> -<a name="IDX397"></a> +<a name="IDX388"></a> </dt> <dd><p>The bidi class for “European Number” characters. </p></dd></dl> <dl> <dt><u>Constant:</u> int <b>UC_BIDI_ES</b> -<a name="IDX398"></a> +<a name="IDX389"></a> </dt> <dd><p>The bidi class for “European Number Separator” characters. </p></dd></dl> <dl> <dt><u>Constant:</u> int <b>UC_BIDI_ET</b> -<a name="IDX399"></a> +<a name="IDX390"></a> </dt> <dd><p>The bidi class for “European Number Terminator” characters. </p></dd></dl> <dl> <dt><u>Constant:</u> int <b>UC_BIDI_AN</b> -<a name="IDX400"></a> +<a name="IDX391"></a> </dt> <dd><p>The bidi class for “Arabic Number” characters. </p></dd></dl> <dl> <dt><u>Constant:</u> int <b>UC_BIDI_CS</b> -<a name="IDX401"></a> +<a name="IDX392"></a> </dt> <dd><p>The bidi class for “Common Number Separator” characters. </p></dd></dl> <dl> <dt><u>Constant:</u> int <b>UC_BIDI_NSM</b> -<a name="IDX402"></a> +<a name="IDX393"></a> </dt> <dd><p>The bidi class for “Non-Spacing Mark” characters. </p></dd></dl> <dl> <dt><u>Constant:</u> int <b>UC_BIDI_BN</b> -<a name="IDX403"></a> +<a name="IDX394"></a> </dt> <dd><p>The bidi class for “Boundary Neutral” characters. </p></dd></dl> <dl> <dt><u>Constant:</u> int <b>UC_BIDI_B</b> -<a name="IDX404"></a> +<a name="IDX395"></a> </dt> <dd><p>The bidi class for “Paragraph Separator” characters. </p></dd></dl> <dl> <dt><u>Constant:</u> int <b>UC_BIDI_S</b> -<a name="IDX405"></a> +<a name="IDX396"></a> </dt> <dd><p>The bidi class for “Segment Separator” characters. </p></dd></dl> <dl> <dt><u>Constant:</u> int <b>UC_BIDI_WS</b> -<a name="IDX406"></a> +<a name="IDX397"></a> </dt> <dd><p>The bidi class for “Whitespace” characters. </p></dd></dl> <dl> <dt><u>Constant:</u> int <b>UC_BIDI_ON</b> -<a name="IDX407"></a> +<a name="IDX398"></a> </dt> <dd><p>The bidi class for “Other Neutral” characters. </p></dd></dl> @@ -1066,27 +1064,27 @@ category and its name. </p> <dl> <dt><u>Function:</u> const char * <b>uc_bidi_class_name</b><i> (int <var>bidi_class</var>)</i> -<a name="IDX408"></a> +<a name="IDX399"></a> </dt> <dt><u>Function:</u> const char * <b>uc_bidi_category_name</b><i> (int <var>category</var>)</i> -<a name="IDX409"></a> +<a name="IDX400"></a> </dt> <dd><p>Returns the name of a bidi class, more precisely, the abbreviated name. </p></dd></dl> <dl> <dt><u>Function:</u> const char * <b>uc_bidi_class_long_name</b><i> (int <var>bidi_class</var>)</i> -<a name="IDX410"></a> +<a name="IDX401"></a> </dt> <dd><p>Returns the long name of a bidi class. </p></dd></dl> <dl> <dt><u>Function:</u> int <b>uc_bidi_class_byname</b><i> (const char *<var>bidi_class_name</var>)</i> -<a name="IDX411"></a> +<a name="IDX402"></a> </dt> <dt><u>Function:</u> int <b>uc_bidi_category_byname</b><i> (const char *<var>category_name</var>)</i> -<a name="IDX412"></a> +<a name="IDX403"></a> </dt> <dd><p>Returns the bidi class given by name, e.g. <code>"LRE"</code>, or by long name, e.g. <code>"Left-to-Right Embedding"</code>. @@ -1099,28 +1097,28 @@ characters. </p> <dl> <dt><u>Function:</u> int <b>uc_bidi_class</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX413"></a> +<a name="IDX404"></a> </dt> <dt><u>Function:</u> int <b>uc_bidi_category</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX414"></a> +<a name="IDX405"></a> </dt> <dd><p>Returns the bidi class of a Unicode character. </p></dd></dl> <dl> <dt><u>Function:</u> bool <b>uc_is_bidi_class</b><i> (ucs4_t <var>uc</var>, int <var>bidi_class</var>)</i> -<a name="IDX415"></a> +<a name="IDX406"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_bidi_category</b><i> (ucs4_t <var>uc</var>, int <var>category</var>)</i> -<a name="IDX416"></a> +<a name="IDX407"></a> </dt> <dd><p>Tests whether a Unicode character belongs to a given bidi class. </p></dd></dl> <hr size="6"> <a name="Decimal-digit-value"></a> -<a name="SEC26"></a> -<h2 class="section"> <a href="libunistring.html#TOC26">8.4 Decimal digit value</a> </h2> +<a name="SEC39"></a> +<h2 class="section"> <a href="libunistring.html#TOC39">8.4 Decimal digit value</a> </h2> <p>Decimal digits (like the digits from ‘<samp>0</samp>’ to ‘<samp>9</samp>’) exist in many scripts. The following function converts a decimal digit character to its @@ -1128,7 +1126,7 @@ numerical value. </p> <dl> <dt><u>Function:</u> int <b>uc_decimal_value</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX417"></a> +<a name="IDX408"></a> </dt> <dd><p>Returns the decimal digit value of a Unicode character. The return value is an integer in the range 0..9, or -1 for characters that @@ -1137,8 +1135,8 @@ do not represent a decimal digit. <hr size="6"> <a name="Digit-value"></a> -<a name="SEC27"></a> -<h2 class="section"> <a href="libunistring.html#TOC27">8.5 Digit value</a> </h2> +<a name="SEC40"></a> +<h2 class="section"> <a href="libunistring.html#TOC40">8.5 Digit value</a> </h2> <p>Digit characters are like decimal digit characters, possibly in special forms, like as superscript, subscript, or circled. The following function converts a @@ -1146,7 +1144,7 @@ digit character to its numerical value. </p> <dl> <dt><u>Function:</u> int <b>uc_digit_value</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX418"></a> +<a name="IDX409"></a> </dt> <dd><p>Returns the digit value of a Unicode character. The return value is an integer in the range 0..9, or -1 for characters that @@ -1155,8 +1153,8 @@ do not represent a digit. <hr size="6"> <a name="Numeric-value"></a> -<a name="SEC28"></a> -<h2 class="section"> <a href="libunistring.html#TOC28">8.6 Numeric value</a> </h2> +<a name="SEC41"></a> +<h2 class="section"> <a href="libunistring.html#TOC41">8.6 Numeric value</a> </h2> <p>There are also characters that represent numbers without a digit system, like the Roman numerals, and fractional numbers, like 1/4 or 3/4. @@ -1164,7 +1162,7 @@ the Roman numerals, and fractional numbers, like 1/4 or 3/4. <p>The following type represents the numeric value of a Unicode character. </p><dl> <dt><u>Type:</u> <b>uc_fraction_t</b> -<a name="IDX419"></a> +<a name="IDX410"></a> </dt> <dd><p>This is a structure type with the following fields: </p><table><tr><td> </td><td><pre class="smallexample">int numerator; @@ -1178,7 +1176,7 @@ int denominator; </p> <dl> <dt><u>Function:</u> uc_fraction_t <b>uc_numeric_value</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX420"></a> +<a name="IDX411"></a> </dt> <dd><p>Returns the numeric value of a Unicode character. The return value is a fraction, or the pseudo-fraction <code>{ 0, 0 }</code> for @@ -1187,8 +1185,8 @@ characters that do not represent a number. <hr size="6"> <a name="Mirrored-character"></a> -<a name="SEC29"></a> -<h2 class="section"> <a href="libunistring.html#TOC29">8.7 Mirrored character</a> </h2> +<a name="SEC42"></a> +<h2 class="section"> <a href="libunistring.html#TOC42">8.7 Mirrored character</a> </h2> <p>Character mirroring is used to associate the closing parenthesis character to the opening parenthesis character, the closing brace character with the @@ -1198,7 +1196,7 @@ opening brace character, and so on. </p> <dl> <dt><u>Function:</u> bool <b>uc_mirror_char</b><i> (ucs4_t <var>uc</var>, ucs4_t *<var>puc</var>)</i> -<a name="IDX421"></a> +<a name="IDX412"></a> </dt> <dd><p>Stores the mirrored character of a Unicode character <var>uc</var> in <code>*<var>puc</var></code> and returns <code>true</code>, if it exists. Otherwise it @@ -1207,8 +1205,8 @@ stores <var>uc</var> unmodified in <code>*<var>puc</var></code> and returns <cod <hr size="6"> <a name="Arabic-shaping"></a> -<a name="SEC30"></a> -<h2 class="section"> <a href="libunistring.html#TOC30">8.8 Arabic shaping</a> </h2> +<a name="SEC43"></a> +<h2 class="section"> <a href="libunistring.html#TOC43">8.8 Arabic shaping</a> </h2> <p>When Arabic characters are rendered, after bidi reordering has taken place, the shape of the glyphs are modified so that many adjacent glyphs @@ -1218,8 +1216,8 @@ takes place: the joining type and the joining group. <hr size="6"> <a name="Joining-type"></a> -<a name="SEC31"></a> -<h3 class="subsection"> <a href="libunistring.html#TOC31">8.8.1 Joining type of Arabic characters</a> </h3> +<a name="SEC44"></a> +<h3 class="subsection"> <a href="libunistring.html#TOC44">8.8.1 Joining type of Arabic characters</a> </h3> <p>The joining type of a character describes on which of the left and right neighbour characters the character's shape depends, and which of the two @@ -1229,14 +1227,14 @@ neighbour characters are rendered depending on this character. </p> <dl> <dt><u>Constant:</u> int <b>UC_JOINING_TYPE_U</b> -<a name="IDX422"></a> +<a name="IDX413"></a> </dt> <dd><p>“Non joining”: Characters of this joining type prohibit joining. </p></dd></dl> <dl> <dt><u>Constant:</u> int <b>UC_JOINING_TYPE_T</b> -<a name="IDX423"></a> +<a name="IDX414"></a> </dt> <dd><p>“Transparent”: Characters of this joining type are skipped when considering joining. @@ -1244,7 +1242,7 @@ considering joining. <dl> <dt><u>Constant:</u> int <b>UC_JOINING_TYPE_C</b> -<a name="IDX424"></a> +<a name="IDX415"></a> </dt> <dd><p>“Join causing”: Characters of this joining type cause their neighbour characters to change their shapes but don't change their own shape. @@ -1252,7 +1250,7 @@ characters to change their shapes but don't change their own shape. <dl> <dt><u>Constant:</u> int <b>UC_JOINING_TYPE_L</b> -<a name="IDX425"></a> +<a name="IDX416"></a> </dt> <dd><p>“Left joining”: Characters of this joining type have two shapes, isolated and initial. Such characters currently don't exist. @@ -1260,7 +1258,7 @@ isolated and initial. Such characters currently don't exist. <dl> <dt><u>Constant:</u> int <b>UC_JOINING_TYPE_R</b> -<a name="IDX426"></a> +<a name="IDX417"></a> </dt> <dd><p>“Right joining”: Characters of this joining type have two shapes, isolated and final. @@ -1268,7 +1266,7 @@ isolated and final. <dl> <dt><u>Constant:</u> int <b>UC_JOINING_TYPE_D</b> -<a name="IDX427"></a> +<a name="IDX418"></a> </dt> <dd><p>“Dual joining”: Characters of this joining type have four shapes, initial, medial, final, and isolated. @@ -1279,21 +1277,21 @@ and its name. </p> <dl> <dt><u>Function:</u> const char * <b>uc_joining_type_name</b><i> (int <var>joining_type</var>)</i> -<a name="IDX428"></a> +<a name="IDX419"></a> </dt> <dd><p>Returns the name of a joining type. </p></dd></dl> <dl> <dt><u>Function:</u> const char * <b>uc_joining_type_long_name</b><i> (int <var>joining_type</var>)</i> -<a name="IDX429"></a> +<a name="IDX420"></a> </dt> <dd><p>Returns the long name of a joining type. </p></dd></dl> <dl> <dt><u>Function:</u> int <b>uc_joining_type_byname</b><i> (const char *<var>joining_type_name</var>)</i> -<a name="IDX430"></a> +<a name="IDX421"></a> </dt> <dd><p>Returns the joining type given by name, e.g. <code>"D"</code>, or by long name, e.g. <code>"Dual Joining</code>. @@ -1305,15 +1303,15 @@ case-insignificant. </p> <dl> <dt><u>Function:</u> int <b>uc_joining_type</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX431"></a> +<a name="IDX422"></a> </dt> <dd><p>Returns the joining type of a Unicode character. </p></dd></dl> <hr size="6"> <a name="Joining-group"></a> -<a name="SEC32"></a> -<h3 class="subsection"> <a href="libunistring.html#TOC32">8.8.2 Joining group of Arabic characters</a> </h3> +<a name="SEC45"></a> +<h3 class="subsection"> <a href="libunistring.html#TOC45">8.8.2 Joining group of Arabic characters</a> </h3> <p>The joining group of a character describes how the character's shape is modified in the four contexts of dual-joining characters or in the @@ -1323,175 +1321,175 @@ two contexts of right-joining characters. </p> <dl> <dt><u>Constant:</u> int <b>UC_JOINING_GROUP_NONE</b> -<a name="IDX432"></a> +<a name="IDX423"></a> </dt> <dt><u>Constant:</u> int <b>UC_JOINING_GROUP_AIN</b> -<a name="IDX433"></a> +<a name="IDX424"></a> </dt> <dt><u>Constant:</u> int <b>UC_JOINING_GROUP_ALAPH</b> -<a name="IDX434"></a> +<a name="IDX425"></a> </dt> <dt><u>Constant:</u> int <b>UC_JOINING_GROUP_ALEF</b> -<a name="IDX435"></a> +<a name="IDX426"></a> </dt> <dt><u>Constant:</u> int <b>UC_JOINING_GROUP_BEH</b> -<a name="IDX436"></a> +<a name="IDX427"></a> </dt> <dt><u>Constant:</u> int <b>UC_JOINING_GROUP_BETH</b> -<a name="IDX437"></a> +<a name="IDX428"></a> </dt> <dt><u>Constant:</u> int <b>UC_JOINING_GROUP_BURUSHASKI_YEH_BARREE</b> -<a name="IDX438"></a> +<a name="IDX429"></a> </dt> <dt><u>Constant:</u> int <b>UC_JOINING_GROUP_DAL</b> -<a name="IDX439"></a> +<a name="IDX430"></a> </dt> <dt><u>Constant:</u> int <b>UC_JOINING_GROUP_DALATH_RISH</b> -<a name="IDX440"></a> +<a name="IDX431"></a> </dt> <dt><u>Constant:</u> int <b>UC_JOINING_GROUP_E</b> -<a name="IDX441"></a> +<a name="IDX432"></a> </dt> <dt><u>Constant:</u> int <b>UC_JOINING_GROUP_FARSI_YEH</b> -<a name="IDX442"></a> +<a name="IDX433"></a> </dt> <dt><u>Constant:</u> int <b>UC_JOINING_GROUP_FE</b> -<a name="IDX443"></a> +<a name="IDX434"></a> </dt> <dt><u>Constant:</u> int <b>UC_JOINING_GROUP_FEH</b> -<a name="IDX444"></a> +<a name="IDX435"></a> </dt> <dt><u>Constant:</u> int <b>UC_JOINING_GROUP_FINAL_SEMKATH</b> -<a name="IDX445"></a> +<a name="IDX436"></a> </dt> <dt><u>Constant:</u> int <b>UC_JOINING_GROUP_GAF</b> -<a name="IDX446"></a> +<a name="IDX437"></a> </dt> <dt><u>Constant:</u> int <b>UC_JOINING_GROUP_GAMAL</b> -<a name="IDX447"></a> +<a name="IDX438"></a> </dt> <dt><u>Constant:</u> int <b>UC_JOINING_GROUP_HAH</b> -<a name="IDX448"></a> +<a name="IDX439"></a> </dt> <dt><u>Constant:</u> int <b>UC_JOINING_GROUP_HE</b> -<a name="IDX449"></a> +<a name="IDX440"></a> </dt> <dt><u>Constant:</u> int <b>UC_JOINING_GROUP_HEH</b> -<a name="IDX450"></a> +<a name="IDX441"></a> </dt> <dt><u>Constant:</u> int <b>UC_JOINING_GROUP_HEH_GOAL</b> -<a name="IDX451"></a> +<a name="IDX442"></a> </dt> <dt><u>Constant:</u> int <b>UC_JOINING_GROUP_HETH</b> -<a name="IDX452"></a> +<a name="IDX443"></a> </dt> <dt><u>Constant:</u> int <b>UC_JOINING_GROUP_KAF</b> -<a name="IDX453"></a> +<a name="IDX444"></a> </dt> <dt><u>Constant:</u> int <b>UC_JOINING_GROUP_KAPH</b> -<a name="IDX454"></a> +<a name="IDX445"></a> </dt> <dt><u>Constant:</u> int <b>UC_JOINING_GROUP_KHAPH</b> -<a name="IDX455"></a> +<a name="IDX446"></a> </dt> <dt><u>Constant:</u> int <b>UC_JOINING_GROUP_KNOTTED_HEH</b> -<a name="IDX456"></a> +<a name="IDX447"></a> </dt> <dt><u>Constant:</u> int <b>UC_JOINING_GROUP_LAM</b> -<a name="IDX457"></a> +<a name="IDX448"></a> </dt> <dt><u>Constant:</u> int <b>UC_JOINING_GROUP_LAMADH</b> -<a name="IDX458"></a> +<a name="IDX449"></a> </dt> <dt><u>Constant:</u> int <b>UC_JOINING_GROUP_MEEM</b> -<a name="IDX459"></a> +<a name="IDX450"></a> </dt> <dt><u>Constant:</u> int <b>UC_JOINING_GROUP_MIM</b> -<a name="IDX460"></a> +<a name="IDX451"></a> </dt> <dt><u>Constant:</u> int <b>UC_JOINING_GROUP_NOON</b> -<a name="IDX461"></a> +<a name="IDX452"></a> </dt> <dt><u>Constant:</u> int <b>UC_JOINING_GROUP_NUN</b> -<a name="IDX462"></a> +<a name="IDX453"></a> </dt> <dt><u>Constant:</u> int <b>UC_JOINING_GROUP_NYA</b> -<a name="IDX463"></a> +<a name="IDX454"></a> </dt> <dt><u>Constant:</u> int <b>UC_JOINING_GROUP_PE</b> -<a name="IDX464"></a> +<a name="IDX455"></a> </dt> <dt><u>Constant:</u> int <b>UC_JOINING_GROUP_QAF</b> -<a name="IDX465"></a> +<a name="IDX456"></a> </dt> <dt><u>Constant:</u> int <b>UC_JOINING_GROUP_QAPH</b> -<a name="IDX466"></a> +<a name="IDX457"></a> </dt> <dt><u>Constant:</u> int <b>UC_JOINING_GROUP_REH</b> -<a name="IDX467"></a> +<a name="IDX458"></a> </dt> <dt><u>Constant:</u> int <b>UC_JOINING_GROUP_REVERSED_PE</b> -<a name="IDX468"></a> +<a name="IDX459"></a> </dt> <dt><u>Constant:</u> int <b>UC_JOINING_GROUP_SAD</b> -<a name="IDX469"></a> +<a name="IDX460"></a> </dt> <dt><u>Constant:</u> int <b>UC_JOINING_GROUP_SADHE</b> -<a name="IDX470"></a> +<a name="IDX461"></a> </dt> <dt><u>Constant:</u> int <b>UC_JOINING_GROUP_SEEN</b> -<a name="IDX471"></a> +<a name="IDX462"></a> </dt> <dt><u>Constant:</u> int <b>UC_JOINING_GROUP_SEMKATH</b> -<a name="IDX472"></a> +<a name="IDX463"></a> </dt> <dt><u>Constant:</u> int <b>UC_JOINING_GROUP_SHIN</b> -<a name="IDX473"></a> +<a name="IDX464"></a> </dt> <dt><u>Constant:</u> int <b>UC_JOINING_GROUP_SWASH_KAF</b> -<a name="IDX474"></a> +<a name="IDX465"></a> </dt> <dt><u>Constant:</u> int <b>UC_JOINING_GROUP_SYRIAC_WAW</b> -<a name="IDX475"></a> +<a name="IDX466"></a> </dt> <dt><u>Constant:</u> int <b>UC_JOINING_GROUP_TAH</b> -<a name="IDX476"></a> +<a name="IDX467"></a> </dt> <dt><u>Constant:</u> int <b>UC_JOINING_GROUP_TAW</b> -<a name="IDX477"></a> +<a name="IDX468"></a> </dt> <dt><u>Constant:</u> int <b>UC_JOINING_GROUP_TEH_MARBUTA</b> -<a name="IDX478"></a> +<a name="IDX469"></a> </dt> <dt><u>Constant:</u> int <b>UC_JOINING_GROUP_TEH_MARBUTA_GOAL</b> -<a name="IDX479"></a> +<a name="IDX470"></a> </dt> <dt><u>Constant:</u> int <b>UC_JOINING_GROUP_TETH</b> -<a name="IDX480"></a> +<a name="IDX471"></a> </dt> <dt><u>Constant:</u> int <b>UC_JOINING_GROUP_WAW</b> -<a name="IDX481"></a> +<a name="IDX472"></a> </dt> <dt><u>Constant:</u> int <b>UC_JOINING_GROUP_YEH</b> -<a name="IDX482"></a> +<a name="IDX473"></a> </dt> <dt><u>Constant:</u> int <b>UC_JOINING_GROUP_YEH_BARREE</b> -<a name="IDX483"></a> +<a name="IDX474"></a> </dt> <dt><u>Constant:</u> int <b>UC_JOINING_GROUP_YEH_WITH_TAIL</b> -<a name="IDX484"></a> +<a name="IDX475"></a> </dt> <dt><u>Constant:</u> int <b>UC_JOINING_GROUP_YUDH</b> -<a name="IDX485"></a> +<a name="IDX476"></a> </dt> <dt><u>Constant:</u> int <b>UC_JOINING_GROUP_YUDH_HE</b> -<a name="IDX486"></a> +<a name="IDX477"></a> </dt> <dt><u>Constant:</u> int <b>UC_JOINING_GROUP_ZAIN</b> -<a name="IDX487"></a> +<a name="IDX478"></a> </dt> <dt><u>Constant:</u> int <b>UC_JOINING_GROUP_ZHAIN</b> -<a name="IDX488"></a> +<a name="IDX479"></a> </dt> </dl> @@ -1500,14 +1498,14 @@ and its name. </p> <dl> <dt><u>Function:</u> const char * <b>uc_joining_group_name</b><i> (int <var>joining_group</var>)</i> -<a name="IDX489"></a> +<a name="IDX480"></a> </dt> <dd><p>Returns the name of a joining group. </p></dd></dl> <dl> <dt><u>Function:</u> int <b>uc_joining_group_byname</b><i> (const char *<var>joining_group_name</var>)</i> -<a name="IDX490"></a> +<a name="IDX481"></a> </dt> <dd><p>Returns the joining group given by name, e.g. <code>"Teh_Marbuta"</code>. This lookup ignores spaces, underscores, or hyphens as word separators and is @@ -1518,15 +1516,15 @@ case-insignificant. </p> <dl> <dt><u>Function:</u> int <b>uc_joining_group</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX491"></a> +<a name="IDX482"></a> </dt> <dd><p>Returns the joining group of a Unicode character. </p></dd></dl> <hr size="6"> <a name="Properties"></a> -<a name="SEC33"></a> -<h2 class="section"> <a href="libunistring.html#TOC33">8.9 Properties</a> </h2> +<a name="SEC46"></a> +<h2 class="section"> <a href="libunistring.html#TOC46">8.9 Properties</a> </h2> <p>This section defines boolean properties of Unicode characters. This means, a character either has the given property or does not have it. @@ -1541,14 +1539,14 @@ low level, a property is merely a function. <hr size="6"> <a name="Properties-as-objects"></a> -<a name="SEC34"></a> -<h3 class="subsection"> <a href="libunistring.html#TOC34">8.9.1 Properties as objects – the object oriented API</a> </h3> +<a name="SEC47"></a> +<h3 class="subsection"> <a href="libunistring.html#TOC47">8.9.1 Properties as objects – the object oriented API</a> </h3> <p>The following type designates a property on Unicode characters. </p> <dl> <dt><u>Type:</u> <b>uc_property_t</b> -<a name="IDX492"></a> +<a name="IDX483"></a> </dt> <dd><p>This data type denotes a boolean property on Unicode characters. It is an immediate type that can be copied by simple assignment, without involving @@ -1561,37 +1559,37 @@ memory allocation. It is not an array type. </p> <dl> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_WHITE_SPACE</b> -<a name="IDX493"></a> +<a name="IDX484"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_ALPHABETIC</b> -<a name="IDX494"></a> +<a name="IDX485"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_OTHER_ALPHABETIC</b> -<a name="IDX495"></a> +<a name="IDX486"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_NOT_A_CHARACTER</b> -<a name="IDX496"></a> +<a name="IDX487"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_DEFAULT_IGNORABLE_CODE_POINT</b> -<a name="IDX497"></a> +<a name="IDX488"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_OTHER_DEFAULT_IGNORABLE_CODE_POINT</b> -<a name="IDX498"></a> +<a name="IDX489"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_DEPRECATED</b> -<a name="IDX499"></a> +<a name="IDX490"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_LOGICAL_ORDER_EXCEPTION</b> -<a name="IDX500"></a> +<a name="IDX491"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_VARIATION_SELECTOR</b> -<a name="IDX501"></a> +<a name="IDX492"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_PRIVATE_USE</b> -<a name="IDX502"></a> +<a name="IDX493"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_UNASSIGNED_CODE_VALUE</b> -<a name="IDX503"></a> +<a name="IDX494"></a> </dt> </dl> @@ -1599,43 +1597,43 @@ memory allocation. It is not an array type. </p> <dl> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_UPPERCASE</b> -<a name="IDX504"></a> +<a name="IDX495"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_OTHER_UPPERCASE</b> -<a name="IDX505"></a> +<a name="IDX496"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_LOWERCASE</b> -<a name="IDX506"></a> +<a name="IDX497"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_OTHER_LOWERCASE</b> -<a name="IDX507"></a> +<a name="IDX498"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_TITLECASE</b> -<a name="IDX508"></a> +<a name="IDX499"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_CASED</b> -<a name="IDX509"></a> +<a name="IDX500"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_CASE_IGNORABLE</b> -<a name="IDX510"></a> +<a name="IDX501"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_CHANGES_WHEN_LOWERCASED</b> -<a name="IDX511"></a> +<a name="IDX502"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_CHANGES_WHEN_UPPERCASED</b> -<a name="IDX512"></a> +<a name="IDX503"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_CHANGES_WHEN_TITLECASED</b> -<a name="IDX513"></a> +<a name="IDX504"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_CHANGES_WHEN_CASEFOLDED</b> -<a name="IDX514"></a> +<a name="IDX505"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_CHANGES_WHEN_CASEMAPPED</b> -<a name="IDX515"></a> +<a name="IDX506"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_SOFT_DOTTED</b> -<a name="IDX516"></a> +<a name="IDX507"></a> </dt> </dl> @@ -1643,28 +1641,28 @@ memory allocation. It is not an array type. </p> <dl> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_ID_START</b> -<a name="IDX517"></a> +<a name="IDX508"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_OTHER_ID_START</b> -<a name="IDX518"></a> +<a name="IDX509"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_ID_CONTINUE</b> -<a name="IDX519"></a> +<a name="IDX510"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_OTHER_ID_CONTINUE</b> -<a name="IDX520"></a> +<a name="IDX511"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_XID_START</b> -<a name="IDX521"></a> +<a name="IDX512"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_XID_CONTINUE</b> -<a name="IDX522"></a> +<a name="IDX513"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_PATTERN_WHITE_SPACE</b> -<a name="IDX523"></a> +<a name="IDX514"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_PATTERN_SYNTAX</b> -<a name="IDX524"></a> +<a name="IDX515"></a> </dt> </dl> @@ -1672,19 +1670,19 @@ memory allocation. It is not an array type. </p> <dl> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_JOIN_CONTROL</b> -<a name="IDX525"></a> +<a name="IDX516"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_GRAPHEME_BASE</b> -<a name="IDX526"></a> +<a name="IDX517"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_GRAPHEME_EXTEND</b> -<a name="IDX527"></a> +<a name="IDX518"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_OTHER_GRAPHEME_EXTEND</b> -<a name="IDX528"></a> +<a name="IDX519"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_GRAPHEME_LINK</b> -<a name="IDX529"></a> +<a name="IDX520"></a> </dt> </dl> @@ -1692,55 +1690,55 @@ memory allocation. It is not an array type. </p> <dl> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_BIDI_CONTROL</b> -<a name="IDX530"></a> +<a name="IDX521"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_BIDI_LEFT_TO_RIGHT</b> -<a name="IDX531"></a> +<a name="IDX522"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_BIDI_HEBREW_RIGHT_TO_LEFT</b> -<a name="IDX532"></a> +<a name="IDX523"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_BIDI_ARABIC_RIGHT_TO_LEFT</b> -<a name="IDX533"></a> +<a name="IDX524"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_BIDI_EUROPEAN_DIGIT</b> -<a name="IDX534"></a> +<a name="IDX525"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_BIDI_EUR_NUM_SEPARATOR</b> -<a name="IDX535"></a> +<a name="IDX526"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_BIDI_EUR_NUM_TERMINATOR</b> -<a name="IDX536"></a> +<a name="IDX527"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_BIDI_ARABIC_DIGIT</b> -<a name="IDX537"></a> +<a name="IDX528"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_BIDI_COMMON_SEPARATOR</b> -<a name="IDX538"></a> +<a name="IDX529"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_BIDI_BLOCK_SEPARATOR</b> -<a name="IDX539"></a> +<a name="IDX530"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_BIDI_SEGMENT_SEPARATOR</b> -<a name="IDX540"></a> +<a name="IDX531"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_BIDI_WHITESPACE</b> -<a name="IDX541"></a> +<a name="IDX532"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_BIDI_NON_SPACING_MARK</b> -<a name="IDX542"></a> +<a name="IDX533"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_BIDI_BOUNDARY_NEUTRAL</b> -<a name="IDX543"></a> +<a name="IDX534"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_BIDI_PDF</b> -<a name="IDX544"></a> +<a name="IDX535"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_BIDI_EMBEDDING_OR_OVERRIDE</b> -<a name="IDX545"></a> +<a name="IDX536"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_BIDI_OTHER_NEUTRAL</b> -<a name="IDX546"></a> +<a name="IDX537"></a> </dt> </dl> @@ -1748,10 +1746,10 @@ memory allocation. It is not an array type. </p> <dl> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_HEX_DIGIT</b> -<a name="IDX547"></a> +<a name="IDX538"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_ASCII_HEX_DIGIT</b> -<a name="IDX548"></a> +<a name="IDX539"></a> </dt> </dl> @@ -1759,19 +1757,19 @@ memory allocation. It is not an array type. </p> <dl> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_IDEOGRAPHIC</b> -<a name="IDX549"></a> +<a name="IDX540"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_UNIFIED_IDEOGRAPH</b> -<a name="IDX550"></a> +<a name="IDX541"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_RADICAL</b> -<a name="IDX551"></a> +<a name="IDX542"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_IDS_BINARY_OPERATOR</b> -<a name="IDX552"></a> +<a name="IDX543"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_IDS_TRINARY_OPERATOR</b> -<a name="IDX553"></a> +<a name="IDX544"></a> </dt> </dl> @@ -1779,79 +1777,79 @@ memory allocation. It is not an array type. </p> <dl> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_ZERO_WIDTH</b> -<a name="IDX554"></a> +<a name="IDX545"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_SPACE</b> -<a name="IDX555"></a> +<a name="IDX546"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_NON_BREAK</b> -<a name="IDX556"></a> +<a name="IDX547"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_ISO_CONTROL</b> -<a name="IDX557"></a> +<a name="IDX548"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_FORMAT_CONTROL</b> -<a name="IDX558"></a> +<a name="IDX549"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_DASH</b> -<a name="IDX559"></a> +<a name="IDX550"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_HYPHEN</b> -<a name="IDX560"></a> +<a name="IDX551"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_PUNCTUATION</b> -<a name="IDX561"></a> +<a name="IDX552"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_LINE_SEPARATOR</b> -<a name="IDX562"></a> +<a name="IDX553"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_PARAGRAPH_SEPARATOR</b> -<a name="IDX563"></a> +<a name="IDX554"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_QUOTATION_MARK</b> -<a name="IDX564"></a> +<a name="IDX555"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_SENTENCE_TERMINAL</b> -<a name="IDX565"></a> +<a name="IDX556"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_TERMINAL_PUNCTUATION</b> -<a name="IDX566"></a> +<a name="IDX557"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_CURRENCY_SYMBOL</b> -<a name="IDX567"></a> +<a name="IDX558"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_MATH</b> -<a name="IDX568"></a> +<a name="IDX559"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_OTHER_MATH</b> -<a name="IDX569"></a> +<a name="IDX560"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_PAIRED_PUNCTUATION</b> -<a name="IDX570"></a> +<a name="IDX561"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_LEFT_OF_PAIR</b> -<a name="IDX571"></a> +<a name="IDX562"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_COMBINING</b> -<a name="IDX572"></a> +<a name="IDX563"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_COMPOSITE</b> -<a name="IDX573"></a> +<a name="IDX564"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_DECIMAL_DIGIT</b> -<a name="IDX574"></a> +<a name="IDX565"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_NUMERIC</b> -<a name="IDX575"></a> +<a name="IDX566"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_DIACRITIC</b> -<a name="IDX576"></a> +<a name="IDX567"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_EXTENDER</b> -<a name="IDX577"></a> +<a name="IDX568"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_IGNORABLE_CONTROL</b> -<a name="IDX578"></a> +<a name="IDX569"></a> </dt> </dl> @@ -1859,7 +1857,7 @@ memory allocation. It is not an array type. </p> <dl> <dt><u>Function:</u> uc_property_t <b>uc_property_byname</b><i> (const char *<var>property_name</var>)</i> -<a name="IDX579"></a> +<a name="IDX570"></a> </dt> <dd><p>Returns the property given by name, e.g. <code>"White space"</code>. If a property with the given name exists, the result will satisfy the @@ -1877,7 +1875,7 @@ can significantly increase the size of your application. <dl> <dt><u>Function:</u> bool <b>uc_property_is_valid</b><i> (uc_property_t property)</i> -<a name="IDX580"></a> +<a name="IDX571"></a> </dt> <dd><p>Returns <code>true</code> when the given property is valid, or <code>false</code> otherwise. @@ -1887,51 +1885,51 @@ otherwise. </p> <dl> <dt><u>Function:</u> bool <b>uc_is_property</b><i> (ucs4_t <var>uc</var>, uc_property_t <var>property</var>)</i> -<a name="IDX581"></a> +<a name="IDX572"></a> </dt> <dd><p>Tests whether the Unicode character <var>uc</var> has the given property. </p></dd></dl> <hr size="6"> <a name="Properties-as-functions"></a> -<a name="SEC35"></a> -<h3 class="subsection"> <a href="libunistring.html#TOC35">8.9.2 Properties as functions – the functional API</a> </h3> +<a name="SEC48"></a> +<h3 class="subsection"> <a href="libunistring.html#TOC48">8.9.2 Properties as functions – the functional API</a> </h3> <p>The following are general properties. </p> <dl> <dt><u>Function:</u> bool <b>uc_is_property_white_space</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX582"></a> +<a name="IDX573"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_alphabetic</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX583"></a> +<a name="IDX574"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_other_alphabetic</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX584"></a> +<a name="IDX575"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_not_a_character</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX585"></a> +<a name="IDX576"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_default_ignorable_code_point</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX586"></a> +<a name="IDX577"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_other_default_ignorable_code_point</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX587"></a> +<a name="IDX578"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_deprecated</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX588"></a> +<a name="IDX579"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_logical_order_exception</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX589"></a> +<a name="IDX580"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_variation_selector</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX590"></a> +<a name="IDX581"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_private_use</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX591"></a> +<a name="IDX582"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_unassigned_code_value</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX592"></a> +<a name="IDX583"></a> </dt> </dl> @@ -1939,43 +1937,43 @@ otherwise. </p> <dl> <dt><u>Function:</u> bool <b>uc_is_property_uppercase</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX593"></a> +<a name="IDX584"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_other_uppercase</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX594"></a> +<a name="IDX585"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_lowercase</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX595"></a> +<a name="IDX586"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_other_lowercase</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX596"></a> +<a name="IDX587"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_titlecase</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX597"></a> +<a name="IDX588"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_cased</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX598"></a> +<a name="IDX589"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_case_ignorable</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX599"></a> +<a name="IDX590"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_changes_when_lowercased</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX600"></a> +<a name="IDX591"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_changes_when_uppercased</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX601"></a> +<a name="IDX592"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_changes_when_titlecased</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX602"></a> +<a name="IDX593"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_changes_when_casefolded</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX603"></a> +<a name="IDX594"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_changes_when_casemapped</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX604"></a> +<a name="IDX595"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_soft_dotted</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX605"></a> +<a name="IDX596"></a> </dt> </dl> @@ -1983,28 +1981,28 @@ otherwise. </p> <dl> <dt><u>Function:</u> bool <b>uc_is_property_id_start</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX606"></a> +<a name="IDX597"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_other_id_start</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX607"></a> +<a name="IDX598"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_id_continue</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX608"></a> +<a name="IDX599"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_other_id_continue</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX609"></a> +<a name="IDX600"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_xid_start</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX610"></a> +<a name="IDX601"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_xid_continue</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX611"></a> +<a name="IDX602"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_pattern_white_space</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX612"></a> +<a name="IDX603"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_pattern_syntax</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX613"></a> +<a name="IDX604"></a> </dt> </dl> @@ -2012,19 +2010,19 @@ otherwise. </p> <dl> <dt><u>Function:</u> bool <b>uc_is_property_join_control</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX614"></a> +<a name="IDX605"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_grapheme_base</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX615"></a> +<a name="IDX606"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_grapheme_extend</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX616"></a> +<a name="IDX607"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_other_grapheme_extend</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX617"></a> +<a name="IDX608"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_grapheme_link</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX618"></a> +<a name="IDX609"></a> </dt> </dl> @@ -2032,55 +2030,55 @@ otherwise. </p> <dl> <dt><u>Function:</u> bool <b>uc_is_property_bidi_control</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX619"></a> +<a name="IDX610"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_bidi_left_to_right</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX620"></a> +<a name="IDX611"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_bidi_hebrew_right_to_left</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX621"></a> +<a name="IDX612"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_bidi_arabic_right_to_left</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX622"></a> +<a name="IDX613"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_bidi_european_digit</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX623"></a> +<a name="IDX614"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_bidi_eur_num_separator</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX624"></a> +<a name="IDX615"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_bidi_eur_num_terminator</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX625"></a> +<a name="IDX616"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_bidi_arabic_digit</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX626"></a> +<a name="IDX617"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_bidi_common_separator</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX627"></a> +<a name="IDX618"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_bidi_block_separator</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX628"></a> +<a name="IDX619"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_bidi_segment_separator</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX629"></a> +<a name="IDX620"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_bidi_whitespace</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX630"></a> +<a name="IDX621"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_bidi_non_spacing_mark</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX631"></a> +<a name="IDX622"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_bidi_boundary_neutral</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX632"></a> +<a name="IDX623"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_bidi_pdf</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX633"></a> +<a name="IDX624"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_bidi_embedding_or_override</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX634"></a> +<a name="IDX625"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_bidi_other_neutral</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX635"></a> +<a name="IDX626"></a> </dt> </dl> @@ -2088,10 +2086,10 @@ otherwise. </p> <dl> <dt><u>Function:</u> bool <b>uc_is_property_hex_digit</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX636"></a> +<a name="IDX627"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_ascii_hex_digit</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX637"></a> +<a name="IDX628"></a> </dt> </dl> @@ -2099,19 +2097,19 @@ otherwise. </p> <dl> <dt><u>Function:</u> bool <b>uc_is_property_ideographic</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX638"></a> +<a name="IDX629"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_unified_ideograph</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX639"></a> +<a name="IDX630"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_radical</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX640"></a> +<a name="IDX631"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_ids_binary_operator</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX641"></a> +<a name="IDX632"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_ids_trinary_operator</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX642"></a> +<a name="IDX633"></a> </dt> </dl> @@ -2119,86 +2117,86 @@ otherwise. </p> <dl> <dt><u>Function:</u> bool <b>uc_is_property_zero_width</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX643"></a> +<a name="IDX634"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_space</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX644"></a> +<a name="IDX635"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_non_break</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX645"></a> +<a name="IDX636"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_iso_control</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX646"></a> +<a name="IDX637"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_format_control</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX647"></a> +<a name="IDX638"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_dash</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX648"></a> +<a name="IDX639"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_hyphen</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX649"></a> +<a name="IDX640"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_punctuation</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX650"></a> +<a name="IDX641"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_line_separator</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX651"></a> +<a name="IDX642"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_paragraph_separator</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX652"></a> +<a name="IDX643"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_quotation_mark</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX653"></a> +<a name="IDX644"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_sentence_terminal</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX654"></a> +<a name="IDX645"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_terminal_punctuation</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX655"></a> +<a name="IDX646"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_currency_symbol</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX656"></a> +<a name="IDX647"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_math</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX657"></a> +<a name="IDX648"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_other_math</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX658"></a> +<a name="IDX649"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_paired_punctuation</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX659"></a> +<a name="IDX650"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_left_of_pair</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX660"></a> +<a name="IDX651"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_combining</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX661"></a> +<a name="IDX652"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_composite</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX662"></a> +<a name="IDX653"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_decimal_digit</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX663"></a> +<a name="IDX654"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_numeric</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX664"></a> +<a name="IDX655"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_diacritic</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX665"></a> +<a name="IDX656"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_extender</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX666"></a> +<a name="IDX657"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_ignorable_control</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX667"></a> +<a name="IDX658"></a> </dt> </dl> <hr size="6"> <a name="Scripts"></a> -<a name="SEC36"></a> -<h2 class="section"> <a href="libunistring.html#TOC36">8.10 Scripts</a> </h2> +<a name="SEC49"></a> +<h2 class="section"> <a href="libunistring.html#TOC49">8.10 Scripts</a> </h2> <p>The Unicode characters are subdivided into scripts. </p> @@ -2206,7 +2204,7 @@ otherwise. </p> <dl> <dt><u>Type:</u> <b>uc_script_t</b> -<a name="IDX668"></a> +<a name="IDX659"></a> </dt> <dd><p>This data type is a structure type that refers to statically allocated read-only data. It contains the following fields: @@ -2216,12 +2214,12 @@ read-only data. It contains the following fields: <p>The <code>name</code> field contains the name of the script. </p></dd></dl> -<a name="IDX669"></a> +<a name="IDX660"></a> <p>The following functions look up a script. </p> <dl> <dt><u>Function:</u> const uc_script_t * <b>uc_script</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX670"></a> +<a name="IDX661"></a> </dt> <dd><p>Returns the script of a Unicode character. Returns NULL if <var>uc</var> does not belong to any script. @@ -2229,7 +2227,7 @@ belong to any script. <dl> <dt><u>Function:</u> const uc_script_t * <b>uc_script_byname</b><i> (const char *<var>script_name</var>)</i> -<a name="IDX671"></a> +<a name="IDX662"></a> </dt> <dd><p>Returns the script given by its name, e.g. <code>"HAN"</code>. Returns NULL if a script with the given name does not exist. @@ -2239,7 +2237,7 @@ script with the given name does not exist. </p> <dl> <dt><u>Function:</u> bool <b>uc_is_script</b><i> (ucs4_t <var>uc</var>, const uc_script_t *<var>script</var>)</i> -<a name="IDX672"></a> +<a name="IDX663"></a> </dt> <dd><p>Tests whether a Unicode character belongs to a given script. </p></dd></dl> @@ -2248,7 +2246,7 @@ script with the given name does not exist. </p> <dl> <dt><u>Function:</u> void <b>uc_all_scripts</b><i> (const uc_script_t **<var>scripts</var>, size_t *<var>count</var>)</i> -<a name="IDX673"></a> +<a name="IDX664"></a> </dt> <dd><p>Get the list of all scripts. Stores a pointer to an array of all scripts in <code>*<var>scripts</var></code> and the length of this array in <code>*<var>count</var></code>. @@ -2256,8 +2254,8 @@ script with the given name does not exist. <hr size="6"> <a name="Blocks"></a> -<a name="SEC37"></a> -<h2 class="section"> <a href="libunistring.html#TOC37">8.11 Blocks</a> </h2> +<a name="SEC50"></a> +<h2 class="section"> <a href="libunistring.html#TOC50">8.11 Blocks</a> </h2> <p>The Unicode characters are subdivided into blocks. A block is an interval of Unicode code points. @@ -2266,7 +2264,7 @@ Unicode code points. </p> <dl> <dt><u>Type:</u> <b>uc_block_t</b> -<a name="IDX674"></a> +<a name="IDX665"></a> </dt> <dd><p>This data type is a structure type that refers to statically allocated data. It contains the following fields: @@ -2282,12 +2280,12 @@ const char *name; <p>The <code>name</code> field is the name of the block. </p></dd></dl> -<a name="IDX675"></a> +<a name="IDX666"></a> <p>The following function looks up a block. </p> <dl> <dt><u>Function:</u> const uc_block_t * <b>uc_block</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX676"></a> +<a name="IDX667"></a> </dt> <dd><p>Returns the block a character belongs to. </p></dd></dl> @@ -2296,7 +2294,7 @@ const char *name; </p> <dl> <dt><u>Function:</u> bool <b>uc_is_block</b><i> (ucs4_t <var>uc</var>, const uc_block_t *<var>block</var>)</i> -<a name="IDX677"></a> +<a name="IDX668"></a> </dt> <dd><p>Tests whether a Unicode character belongs to a given block. </p></dd></dl> @@ -2305,7 +2303,7 @@ const char *name; </p> <dl> <dt><u>Function:</u> void <b>uc_all_blocks</b><i> (const uc_block_t **<var>blocks</var>, size_t *<var>count</var>)</i> -<a name="IDX678"></a> +<a name="IDX669"></a> </dt> <dd><p>Get the list of all blocks. Stores a pointer to an array of all blocks in <code>*<var>blocks</var></code> and the length of this array in <code>*<var>count</var></code>. @@ -2313,22 +2311,22 @@ const char *name; <hr size="6"> <a name="ISO-C-and-Java-syntax"></a> -<a name="SEC38"></a> -<h2 class="section"> <a href="libunistring.html#TOC38">8.12 ISO C and Java syntax</a> </h2> +<a name="SEC51"></a> +<h2 class="section"> <a href="libunistring.html#TOC51">8.12 ISO C and Java syntax</a> </h2> <p>The following properties are taken from language standards. The supported language standards are ISO C 99 and Java. </p> <dl> <dt><u>Function:</u> bool <b>uc_is_c_whitespace</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX679"></a> +<a name="IDX670"></a> </dt> <dd><p>Tests whether a Unicode character is considered whitespace in ISO C 99. </p></dd></dl> <dl> <dt><u>Function:</u> bool <b>uc_is_java_whitespace</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX680"></a> +<a name="IDX671"></a> </dt> <dd><p>Tests whether a Unicode character is considered whitespace in Java. </p></dd></dl> @@ -2338,7 +2336,7 @@ language standards are ISO C 99 and Java. </p> <dl> <dt><u>Constant:</u> int <b>UC_IDENTIFIER_START</b> -<a name="IDX681"></a> +<a name="IDX672"></a> </dt> <dd><p>This return value means that the given character is valid as first or subsequent character in an identifier. @@ -2346,7 +2344,7 @@ subsequent character in an identifier. <dl> <dt><u>Constant:</u> int <b>UC_IDENTIFIER_VALID</b> -<a name="IDX682"></a> +<a name="IDX673"></a> </dt> <dd><p>This return value means that the given character is valid as subsequent character only. @@ -2354,14 +2352,14 @@ character only. <dl> <dt><u>Constant:</u> int <b>UC_IDENTIFIER_INVALID</b> -<a name="IDX683"></a> +<a name="IDX674"></a> </dt> <dd><p>This return value means that the given character is not valid in an identifier. </p></dd></dl> <dl> <dt><u>Constant:</u> int <b>UC_IDENTIFIER_IGNORABLE</b> -<a name="IDX684"></a> +<a name="IDX675"></a> </dt> <dd><p>This return value (only for Java) means that the given character is ignorable. </p></dd></dl> @@ -2369,19 +2367,19 @@ character only. <p>The following function determine whether a given character can be a constituent of an identifier in the given programming language. </p> -<a name="IDX685"></a> +<a name="IDX676"></a> <dl> <dt><u>Function:</u> int <b>uc_c_ident_category</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX686"></a> +<a name="IDX677"></a> </dt> <dd><p>Returns the categorization of a Unicode character with respect to the ISO C 99 identifier syntax. </p></dd></dl> -<a name="IDX687"></a> +<a name="IDX678"></a> <dl> <dt><u>Function:</u> int <b>uc_java_ident_category</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX688"></a> +<a name="IDX679"></a> </dt> <dd><p>Returns the categorization of a Unicode character with respect to the Java identifier syntax. @@ -2389,8 +2387,8 @@ identifier syntax. <hr size="6"> <a name="Classifications-like-in-ISO-C"></a> -<a name="SEC39"></a> -<h2 class="section"> <a href="libunistring.html#TOC39">8.13 Classifications like in ISO C</a> </h2> +<a name="SEC52"></a> +<h2 class="section"> <a href="libunistring.html#TOC52">8.13 Classifications like in ISO C</a> </h2> <p>The following character classifications mimic those declared in the ISO C header files <code><ctype.h></code> and <code><wctype.h></code>. These functions are @@ -2401,7 +2399,7 @@ APIs to Unicode strings. </p> <dl> <dt><u>Function:</u> bool <b>uc_is_alnum</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX689"></a> +<a name="IDX680"></a> </dt> <dd><p>Tests for any character for which <code>uc_is_alpha</code> or <code>uc_is_digit</code> is true. @@ -2409,7 +2407,7 @@ true. <dl> <dt><u>Function:</u> bool <b>uc_is_alpha</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX690"></a> +<a name="IDX681"></a> </dt> <dd><p>Tests for any character for which <code>uc_is_upper</code> or <code>uc_is_lower</code> is true, or any character that is one of a locale-specific set of characters for @@ -2419,21 +2417,21 @@ which none of <code>uc_is_cntrl</code>, <code>uc_is_digit</code>, <code>uc_is_pu <dl> <dt><u>Function:</u> bool <b>uc_is_cntrl</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX691"></a> +<a name="IDX682"></a> </dt> <dd><p>Tests for any control character. </p></dd></dl> <dl> <dt><u>Function:</u> bool <b>uc_is_digit</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX692"></a> +<a name="IDX683"></a> </dt> <dd><p>Tests for any character that corresponds to a decimal-digit character. </p></dd></dl> <dl> <dt><u>Function:</u> bool <b>uc_is_graph</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX693"></a> +<a name="IDX684"></a> </dt> <dd><p>Tests for any character for which <code>uc_is_print</code> is true and <code>uc_is_space</code> is false. @@ -2441,7 +2439,7 @@ which none of <code>uc_is_cntrl</code>, <code>uc_is_digit</code>, <code>uc_is_pu <dl> <dt><u>Function:</u> bool <b>uc_is_lower</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX694"></a> +<a name="IDX685"></a> </dt> <dd><p>Tests for any character that corresponds to a lowercase letter or is one of a locale-specific set of characters for which none of <code>uc_is_cntrl</code>, @@ -2450,14 +2448,14 @@ of a locale-specific set of characters for which none of <code>uc_is_cntrl</code <dl> <dt><u>Function:</u> bool <b>uc_is_print</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX695"></a> +<a name="IDX686"></a> </dt> <dd><p>Tests for any printing character. </p></dd></dl> <dl> <dt><u>Function:</u> bool <b>uc_is_punct</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX696"></a> +<a name="IDX687"></a> </dt> <dd><p>Tests for any printing character that is one of a locale-specific set of characters for which neither <code>uc_is_space</code> nor <code>uc_is_alnum</code> is true. @@ -2465,7 +2463,7 @@ characters for which neither <code>uc_is_space</code> nor <code>uc_is_alnum</cod <dl> <dt><u>Function:</u> bool <b>uc_is_space</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX697"></a> +<a name="IDX688"></a> </dt> <dd><p>Test for any character that corresponds to a locale-specific set of characters for which none of <code>uc_is_alnum</code>, <code>uc_is_graph</code>, or <code>uc_is_punct</code> @@ -2474,7 +2472,7 @@ is true. <dl> <dt><u>Function:</u> bool <b>uc_is_upper</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX698"></a> +<a name="IDX689"></a> </dt> <dd><p>Tests for any character that corresponds to an uppercase letter or is one of a locale-specific set of characters for which none of <code>uc_is_cntrl</code>, @@ -2483,22 +2481,22 @@ of a locale-specific set of characters for which none of <code>uc_is_cntrl</code <dl> <dt><u>Function:</u> bool <b>uc_is_xdigit</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX699"></a> +<a name="IDX690"></a> </dt> <dd><p>Tests for any character that corresponds to a hexadecimal-digit character. </p></dd></dl> <dl> <dt><u>Function:</u> bool <b>uc_is_blank</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX700"></a> +<a name="IDX691"></a> </dt> <dd><p>Tests for any character that corresponds to a standard blank character or a locale-specific set of characters for which <code>uc_is_alnum</code> is false. </p></dd></dl> <hr size="6"> <table cellpadding="1" cellspacing="1" border="0"> -<tr><td valign="middle" align="left">[<a href="#SEC20" title="Beginning of this chapter or previous chapter"> << </a>]</td> -<td valign="middle" align="left">[<a href="libunistring_9.html#SEC40" title="Next chapter"> >> </a>]</td> +<tr><td valign="middle" align="left">[<a href="#SEC33" title="Beginning of this chapter or previous chapter"> << </a>]</td> +<td valign="middle" align="left">[<a href="libunistring_9.html#SEC53" title="Next chapter"> >> </a>]</td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> @@ -2506,12 +2504,12 @@ a locale-specific set of characters for which <code>uc_is_alnum</code> is false. <td valign="middle" align="left"> </td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Top" title="Cover (top) of document">Top</a>]</td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Contents" title="Table of contents">Contents</a>]</td> -<td valign="middle" align="left">[<a href="libunistring_19.html#SEC77" title="Index">Index</a>]</td> +<td valign="middle" align="left">[<a href="libunistring_20.html#SEC91" title="Index">Index</a>]</td> <td valign="middle" align="left">[<a href="libunistring_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <p> <font size="-1"> - This document was generated by <em>Daiki Ueno</em> on <em>November, 30 2017</em> using <a href="http://www.nongnu.org/texi2html/"><em>texi2html 1.78a</em></a>. + This document was generated by <em>Daiki Ueno</em> on <em>May, 25 2018</em> using <a href="http://www.nongnu.org/texi2html/"><em>texi2html 1.78a</em></a>. </font> <br> diff --git a/doc/libunistring_9.html b/doc/libunistring_9.html index 3662edc0..ac653db6 100644 --- a/doc/libunistring_9.html +++ b/doc/libunistring_9.html @@ -1,6 +1,6 @@ <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html401/loose.dtd"> <html> -<!-- Created on November, 30 2017 by texi2html 1.78a --> +<!-- Created on May, 25 2018 by texi2html 1.78a --> <!-- Written by: Lionel Cons <Lionel.Cons@cern.ch> (original author) Karl Berry <karl@freefriends.org> @@ -42,8 +42,8 @@ ul.toc {list-style: none} <body lang="en" bgcolor="#FFFFFF" text="#000000" link="#0000FF" vlink="#800080" alink="#FF0000"> <table cellpadding="1" cellspacing="1" border="0"> -<tr><td valign="middle" align="left">[<a href="libunistring_8.html#SEC20" title="Beginning of this chapter or previous chapter"> << </a>]</td> -<td valign="middle" align="left">[<a href="libunistring_10.html#SEC41" title="Next chapter"> >> </a>]</td> +<tr><td valign="middle" align="left">[<a href="libunistring_8.html#SEC33" title="Beginning of this chapter or previous chapter"> << </a>]</td> +<td valign="middle" align="left">[<a href="libunistring_10.html#SEC54" title="Next chapter"> >> </a>]</td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> @@ -51,20 +51,20 @@ ul.toc {list-style: none} <td valign="middle" align="left"> </td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Top" title="Cover (top) of document">Top</a>]</td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Contents" title="Table of contents">Contents</a>]</td> -<td valign="middle" align="left">[<a href="libunistring_19.html#SEC77" title="Index">Index</a>]</td> +<td valign="middle" align="left">[<a href="libunistring_20.html#SEC91" title="Index">Index</a>]</td> <td valign="middle" align="left">[<a href="libunistring_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <hr size="2"> <a name="uniwidth_002eh"></a> -<a name="SEC40"></a> -<h1 class="chapter"> <a href="libunistring.html#TOC40">9. Display width <code><uniwidth.h></code></a> </h1> +<a name="SEC53"></a> +<h1 class="chapter"> <a href="libunistring.html#TOC53">9. Display width <code><uniwidth.h></code></a> </h1> <p>This include file declares functions that return the display width, measured in columns, of characters or strings, when output to a device that uses non-proportional fonts. </p> -<a name="IDX701"></a> +<a name="IDX692"></a> <p>Note that for some rarely used characters the actual fonts or terminal emulators can use a different width. There is no mechanism for communicating the display width of characters across a Unix pseudo-terminal (tty). Also, @@ -76,12 +76,12 @@ most characters but can fail to represent the actual display width. <p>These functions are locale dependent. The <var>encoding</var> argument identifies the encoding (e.g. <code>"ISO-8859-2"</code> for Polish). </p> -<a name="IDX702"></a> -<a name="IDX703"></a> -<a name="IDX704"></a> +<a name="IDX693"></a> +<a name="IDX694"></a> +<a name="IDX695"></a> <dl> <dt><u>Function:</u> int <b>uc_width</b><i> (ucs4_t <var>uc</var>, const char *<var>encoding</var>)</i> -<a name="IDX705"></a> +<a name="IDX696"></a> </dt> <dd><p>Determines and returns the number of column positions required for <var>uc</var>. Returns -1 if <var>uc</var> is a control character that has an influence on the @@ -90,13 +90,13 @@ column position when output. <dl> <dt><u>Function:</u> int <b>u8_width</b><i> (const uint8_t *<var>s</var>, size_t <var>n</var>, const char *<var>encoding</var>)</i> -<a name="IDX706"></a> +<a name="IDX697"></a> </dt> <dt><u>Function:</u> int <b>u16_width</b><i> (const uint16_t *<var>s</var>, size_t <var>n</var>, const char *<var>encoding</var>)</i> -<a name="IDX707"></a> +<a name="IDX698"></a> </dt> <dt><u>Function:</u> int <b>u32_width</b><i> (const uint32_t *<var>s</var>, size_t <var>n</var>, const char *<var>encoding</var>)</i> -<a name="IDX708"></a> +<a name="IDX699"></a> </dt> <dd><p>Determines and returns the number of column positions required for first <var>n</var> units (or fewer if <var>s</var> ends before this) in <var>s</var>. This @@ -105,21 +105,21 @@ function ignores control characters in the string. <dl> <dt><u>Function:</u> int <b>u8_strwidth</b><i> (const uint8_t *<var>s</var>, const char *<var>encoding</var>)</i> -<a name="IDX709"></a> +<a name="IDX700"></a> </dt> <dt><u>Function:</u> int <b>u16_strwidth</b><i> (const uint16_t *<var>s</var>, const char *<var>encoding</var>)</i> -<a name="IDX710"></a> +<a name="IDX701"></a> </dt> <dt><u>Function:</u> int <b>u32_strwidth</b><i> (const uint32_t *<var>s</var>, const char *<var>encoding</var>)</i> -<a name="IDX711"></a> +<a name="IDX702"></a> </dt> <dd><p>Determines and returns the number of column positions required for <var>s</var>. This function ignores control characters in the string. </p></dd></dl> <hr size="6"> <table cellpadding="1" cellspacing="1" border="0"> -<tr><td valign="middle" align="left">[<a href="libunistring_8.html#SEC20" title="Beginning of this chapter or previous chapter"> << </a>]</td> -<td valign="middle" align="left">[<a href="libunistring_10.html#SEC41" title="Next chapter"> >> </a>]</td> +<tr><td valign="middle" align="left">[<a href="libunistring_8.html#SEC33" title="Beginning of this chapter or previous chapter"> << </a>]</td> +<td valign="middle" align="left">[<a href="libunistring_10.html#SEC54" title="Next chapter"> >> </a>]</td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> @@ -127,12 +127,12 @@ This function ignores control characters in the string. <td valign="middle" align="left"> </td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Top" title="Cover (top) of document">Top</a>]</td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Contents" title="Table of contents">Contents</a>]</td> -<td valign="middle" align="left">[<a href="libunistring_19.html#SEC77" title="Index">Index</a>]</td> +<td valign="middle" align="left">[<a href="libunistring_20.html#SEC91" title="Index">Index</a>]</td> <td valign="middle" align="left">[<a href="libunistring_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <p> <font size="-1"> - This document was generated by <em>Daiki Ueno</em> on <em>November, 30 2017</em> using <a href="http://www.nongnu.org/texi2html/"><em>texi2html 1.78a</em></a>. + This document was generated by <em>Daiki Ueno</em> on <em>May, 25 2018</em> using <a href="http://www.nongnu.org/texi2html/"><em>texi2html 1.78a</em></a>. </font> <br> diff --git a/doc/libunistring_abt.html b/doc/libunistring_abt.html index cc452206..924f37c9 100644 --- a/doc/libunistring_abt.html +++ b/doc/libunistring_abt.html @@ -1,6 +1,6 @@ <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html401/loose.dtd"> <html> -<!-- Created on November, 30 2017 by texi2html 1.78a --> +<!-- Created on May, 25 2018 by texi2html 1.78a --> <!-- Written by: Lionel Cons <Lionel.Cons@cern.ch> (original author) Karl Berry <karl@freefriends.org> @@ -45,12 +45,12 @@ ul.toc {list-style: none} <table cellpadding="1" cellspacing="1" border="0"> <tr><td valign="middle" align="left">[<a href="libunistring.html#SEC_Top" title="Cover (top) of document">Top</a>]</td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Contents" title="Table of contents">Contents</a>]</td> -<td valign="middle" align="left">[<a href="libunistring_19.html#SEC77" title="Index">Index</a>]</td> +<td valign="middle" align="left">[<a href="libunistring_20.html#SEC91" title="Index">Index</a>]</td> <td valign="middle" align="left">[<a href="#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <h1>About This Document</h1> <p> - This document was generated by <em>Daiki Ueno</em> on <em>November, 30 2017</em> using <a href="http://www.nongnu.org/texi2html/"><em>texi2html 1.78a</em></a>. + This document was generated by <em>Daiki Ueno</em> on <em>May, 25 2018</em> using <a href="http://www.nongnu.org/texi2html/"><em>texi2html 1.78a</em></a>. </p> <p> The buttons in the navigation panels have the following meaning: @@ -153,12 +153,12 @@ ul.toc {list-style: none} <table cellpadding="1" cellspacing="1" border="0"> <tr><td valign="middle" align="left">[<a href="libunistring.html#SEC_Top" title="Cover (top) of document">Top</a>]</td> <td valign="middle" align="left">[<a href="libunistring.html#SEC_Contents" title="Table of contents">Contents</a>]</td> -<td valign="middle" align="left">[<a href="libunistring_19.html#SEC77" title="Index">Index</a>]</td> +<td valign="middle" align="left">[<a href="libunistring_20.html#SEC91" title="Index">Index</a>]</td> <td valign="middle" align="left">[<a href="#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <p> <font size="-1"> - This document was generated by <em>Daiki Ueno</em> on <em>November, 30 2017</em> using <a href="http://www.nongnu.org/texi2html/"><em>texi2html 1.78a</em></a>. + This document was generated by <em>Daiki Ueno</em> on <em>May, 25 2018</em> using <a href="http://www.nongnu.org/texi2html/"><em>texi2html 1.78a</em></a>. </font> <br> diff --git a/doc/libunistring_toc.html b/doc/libunistring_toc.html index 836ab646..7b007395 100644 --- a/doc/libunistring_toc.html +++ b/doc/libunistring_toc.html @@ -1,6 +1,6 @@ <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html401/loose.dtd"> <html> -<!-- Created on November, 30 2017 by texi2html 1.78a --> +<!-- Created on May, 25 2018 by texi2html 1.78a --> <!-- Written by: Lionel Cons <Lionel.Cons@cern.ch> (original author) Karl Berry <karl@freefriends.org> @@ -44,7 +44,7 @@ ul.toc {list-style: none} <table cellpadding="1" cellspacing="1" border="0"> <tr><td valign="middle" align="left">[<a href="#SEC_Top" title="Cover (top) of document">Top</a>]</td> <td valign="middle" align="left">[<a href="#SEC_Contents" title="Table of contents">Contents</a>]</td> -<td valign="middle" align="left">[<a href="libunistring_19.html#SEC77" title="Index">Index</a>]</td> +<td valign="middle" align="left">[<a href="libunistring_20.html#SEC91" title="Index">Index</a>]</td> <td valign="middle" align="left">[<a href="libunistring_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <h1 class="settitle">GNU libunistring</h1> @@ -60,95 +60,114 @@ ul.toc {list-style: none} <li><a name="TOC4" href="libunistring_1.html#SEC4">1.3 Locale encodings</a></li> <li><a name="TOC5" href="libunistring_1.html#SEC5">1.4 Choice of in-memory representation of strings</a></li> <li><a name="TOC6" href="libunistring_1.html#SEC6">1.5 ‘<samp>char *</samp>’ strings</a></li> - <li><a name="TOC7" href="libunistring_1.html#SEC7">1.6 The <code>wchar_t</code> mess</a></li> - <li><a name="TOC8" href="libunistring_1.html#SEC8">1.7 Unicode strings</a></li> + <li><a name="TOC7" href="libunistring_1.html#SEC7">1.6 Unicode strings</a></li> </ul></li> - <li><a name="TOC9" href="libunistring_2.html#SEC9">2. Conventions</a></li> - <li><a name="TOC10" href="libunistring_3.html#SEC10">3. Elementary types <code><unitypes.h></code></a></li> - <li><a name="TOC11" href="libunistring_4.html#SEC11">4. Elementary Unicode string functions <code><unistr.h></code></a> + <li><a name="TOC8" href="libunistring_2.html#SEC8">2. Conventions</a></li> + <li><a name="TOC9" href="libunistring_3.html#SEC9">3. Elementary types <code><unitypes.h></code></a></li> + <li><a name="TOC10" href="libunistring_4.html#SEC10">4. Elementary Unicode string functions <code><unistr.h></code></a> <ul class="toc"> - <li><a name="TOC12" href="libunistring_4.html#SEC12">4.1 Elementary string checks</a></li> - <li><a name="TOC13" href="libunistring_4.html#SEC13">4.2 Elementary string conversions</a></li> - <li><a name="TOC14" href="libunistring_4.html#SEC14">4.3 Elementary string functions</a></li> - <li><a name="TOC15" href="libunistring_4.html#SEC15">4.4 Elementary string functions with memory allocation</a></li> - <li><a name="TOC16" href="libunistring_4.html#SEC16">4.5 Elementary string functions on NUL terminated strings</a></li> + <li><a name="TOC11" href="libunistring_4.html#SEC11">4.1 Elementary string checks</a></li> + <li><a name="TOC12" href="libunistring_4.html#SEC12">4.2 Elementary string conversions</a></li> + <li><a name="TOC13" href="libunistring_4.html#SEC13">4.3 Elementary string functions</a> + <ul class="toc"> + <li><a name="TOC14" href="libunistring_4.html#SEC14">4.3.1 Iterating over a Unicode string</a></li> + <li><a name="TOC15" href="libunistring_4.html#SEC15">4.3.2 Creating Unicode strings one character at a time</a></li> + <li><a name="TOC16" href="libunistring_4.html#SEC16">4.3.3 Copying Unicode strings</a></li> + <li><a name="TOC17" href="libunistring_4.html#SEC17">4.3.4 Comparing Unicode strings</a></li> + <li><a name="TOC18" href="libunistring_4.html#SEC18">4.3.5 Searching for a character in a Unicode string</a></li> + <li><a name="TOC19" href="libunistring_4.html#SEC19">4.3.6 Counting the characters in a Unicode string</a></li> + </ul></li> + <li><a name="TOC20" href="libunistring_4.html#SEC20">4.4 Elementary string functions with memory allocation</a></li> + <li><a name="TOC21" href="libunistring_4.html#SEC21">4.5 Elementary string functions on NUL terminated strings</a> + <ul class="toc"> + <li><a name="TOC22" href="libunistring_4.html#SEC22">4.5.1 Iterating over a NUL terminated Unicode string</a></li> + <li><a name="TOC23" href="libunistring_4.html#SEC23">4.5.2 Length of a NUL terminated Unicode string</a></li> + <li><a name="TOC24" href="libunistring_4.html#SEC24">4.5.3 Copying a NUL terminated Unicode string</a></li> + <li><a name="TOC25" href="libunistring_4.html#SEC25">4.5.4 Comparing NUL terminated Unicode strings</a></li> + <li><a name="TOC26" href="libunistring_4.html#SEC26">4.5.5 Duplicating a NUL terminated Unicode string</a></li> + <li><a name="TOC27" href="libunistring_4.html#SEC27">4.5.6 Searching for a character in a NUL terminated Unicode string</a></li> + <li><a name="TOC28" href="libunistring_4.html#SEC28">4.5.7 Searching for a substring in a NUL terminated Unicode string</a></li> + <li><a name="TOC29" href="libunistring_4.html#SEC29">4.5.8 Tokenizing a NUL terminated Unicode string</a></li> + </ul> +</li> </ul></li> - <li><a name="TOC17" href="libunistring_5.html#SEC17">5. Conversions between Unicode and encodings <code><uniconv.h></code></a></li> - <li><a name="TOC18" href="libunistring_6.html#SEC18">6. Output with Unicode strings <code><unistdio.h></code></a></li> - <li><a name="TOC19" href="libunistring_7.html#SEC19">7. Names of Unicode characters <code><uniname.h></code></a></li> - <li><a name="TOC20" href="libunistring_8.html#SEC20">8. Unicode character classification and properties <code><unictype.h></code></a> + <li><a name="TOC30" href="libunistring_5.html#SEC30">5. Conversions between Unicode and encodings <code><uniconv.h></code></a></li> + <li><a name="TOC31" href="libunistring_6.html#SEC31">6. Output with Unicode strings <code><unistdio.h></code></a></li> + <li><a name="TOC32" href="libunistring_7.html#SEC32">7. Names of Unicode characters <code><uniname.h></code></a></li> + <li><a name="TOC33" href="libunistring_8.html#SEC33">8. Unicode character classification and properties <code><unictype.h></code></a> <ul class="toc"> - <li><a name="TOC21" href="libunistring_8.html#SEC21">8.1 General category</a> + <li><a name="TOC34" href="libunistring_8.html#SEC34">8.1 General category</a> <ul class="toc"> - <li><a name="TOC22" href="libunistring_8.html#SEC22">8.1.1 The object oriented API for general category</a></li> - <li><a name="TOC23" href="libunistring_8.html#SEC23">8.1.2 The bit mask API for general category</a></li> + <li><a name="TOC35" href="libunistring_8.html#SEC35">8.1.1 The object oriented API for general category</a></li> + <li><a name="TOC36" href="libunistring_8.html#SEC36">8.1.2 The bit mask API for general category</a></li> </ul></li> - <li><a name="TOC24" href="libunistring_8.html#SEC24">8.2 Canonical combining class</a></li> - <li><a name="TOC25" href="libunistring_8.html#SEC25">8.3 Bidi class</a></li> - <li><a name="TOC26" href="libunistring_8.html#SEC26">8.4 Decimal digit value</a></li> - <li><a name="TOC27" href="libunistring_8.html#SEC27">8.5 Digit value</a></li> - <li><a name="TOC28" href="libunistring_8.html#SEC28">8.6 Numeric value</a></li> - <li><a name="TOC29" href="libunistring_8.html#SEC29">8.7 Mirrored character</a></li> - <li><a name="TOC30" href="libunistring_8.html#SEC30">8.8 Arabic shaping</a> + <li><a name="TOC37" href="libunistring_8.html#SEC37">8.2 Canonical combining class</a></li> + <li><a name="TOC38" href="libunistring_8.html#SEC38">8.3 Bidi class</a></li> + <li><a name="TOC39" href="libunistring_8.html#SEC39">8.4 Decimal digit value</a></li> + <li><a name="TOC40" href="libunistring_8.html#SEC40">8.5 Digit value</a></li> + <li><a name="TOC41" href="libunistring_8.html#SEC41">8.6 Numeric value</a></li> + <li><a name="TOC42" href="libunistring_8.html#SEC42">8.7 Mirrored character</a></li> + <li><a name="TOC43" href="libunistring_8.html#SEC43">8.8 Arabic shaping</a> <ul class="toc"> - <li><a name="TOC31" href="libunistring_8.html#SEC31">8.8.1 Joining type of Arabic characters</a></li> - <li><a name="TOC32" href="libunistring_8.html#SEC32">8.8.2 Joining group of Arabic characters</a></li> + <li><a name="TOC44" href="libunistring_8.html#SEC44">8.8.1 Joining type of Arabic characters</a></li> + <li><a name="TOC45" href="libunistring_8.html#SEC45">8.8.2 Joining group of Arabic characters</a></li> </ul></li> - <li><a name="TOC33" href="libunistring_8.html#SEC33">8.9 Properties</a> + <li><a name="TOC46" href="libunistring_8.html#SEC46">8.9 Properties</a> <ul class="toc"> - <li><a name="TOC34" href="libunistring_8.html#SEC34">8.9.1 Properties as objects – the object oriented API</a></li> - <li><a name="TOC35" href="libunistring_8.html#SEC35">8.9.2 Properties as functions – the functional API</a></li> + <li><a name="TOC47" href="libunistring_8.html#SEC47">8.9.1 Properties as objects – the object oriented API</a></li> + <li><a name="TOC48" href="libunistring_8.html#SEC48">8.9.2 Properties as functions – the functional API</a></li> </ul></li> - <li><a name="TOC36" href="libunistring_8.html#SEC36">8.10 Scripts</a></li> - <li><a name="TOC37" href="libunistring_8.html#SEC37">8.11 Blocks</a></li> - <li><a name="TOC38" href="libunistring_8.html#SEC38">8.12 ISO C and Java syntax</a></li> - <li><a name="TOC39" href="libunistring_8.html#SEC39">8.13 Classifications like in ISO C</a></li> + <li><a name="TOC49" href="libunistring_8.html#SEC49">8.10 Scripts</a></li> + <li><a name="TOC50" href="libunistring_8.html#SEC50">8.11 Blocks</a></li> + <li><a name="TOC51" href="libunistring_8.html#SEC51">8.12 ISO C and Java syntax</a></li> + <li><a name="TOC52" href="libunistring_8.html#SEC52">8.13 Classifications like in ISO C</a></li> </ul></li> - <li><a name="TOC40" href="libunistring_9.html#SEC40">9. Display width <code><uniwidth.h></code></a></li> - <li><a name="TOC41" href="libunistring_10.html#SEC41">10. Grapheme cluster breaks in strings <code><unigbrk.h></code></a> + <li><a name="TOC53" href="libunistring_9.html#SEC53">9. Display width <code><uniwidth.h></code></a></li> + <li><a name="TOC54" href="libunistring_10.html#SEC54">10. Grapheme cluster breaks in strings <code><unigbrk.h></code></a> <ul class="toc"> - <li><a name="TOC42" href="libunistring_10.html#SEC42">10.1 Grapheme cluster breaks in a string</a></li> - <li><a name="TOC43" href="libunistring_10.html#SEC43">10.2 Grapheme cluster break property</a></li> + <li><a name="TOC55" href="libunistring_10.html#SEC55">10.1 Grapheme cluster breaks in a string</a></li> + <li><a name="TOC56" href="libunistring_10.html#SEC56">10.2 Grapheme cluster break property</a></li> </ul></li> - <li><a name="TOC44" href="libunistring_11.html#SEC44">11. Word breaks in strings <code><uniwbrk.h></code></a> + <li><a name="TOC57" href="libunistring_11.html#SEC57">11. Word breaks in strings <code><uniwbrk.h></code></a> <ul class="toc"> - <li><a name="TOC45" href="libunistring_11.html#SEC45">11.1 Word breaks in a string</a></li> - <li><a name="TOC46" href="libunistring_11.html#SEC46">11.2 Word break property</a></li> + <li><a name="TOC58" href="libunistring_11.html#SEC58">11.1 Word breaks in a string</a></li> + <li><a name="TOC59" href="libunistring_11.html#SEC59">11.2 Word break property</a></li> </ul></li> - <li><a name="TOC47" href="libunistring_12.html#SEC47">12. Line breaking <code><unilbrk.h></code></a></li> - <li><a name="TOC48" href="libunistring_13.html#SEC48">13. Normalization forms (composition and decomposition) <code><uninorm.h></code></a> + <li><a name="TOC60" href="libunistring_12.html#SEC60">12. Line breaking <code><unilbrk.h></code></a></li> + <li><a name="TOC61" href="libunistring_13.html#SEC61">13. Normalization forms (composition and decomposition) <code><uninorm.h></code></a> <ul class="toc"> - <li><a name="TOC49" href="libunistring_13.html#SEC49">13.1 Decomposition of Unicode characters</a></li> - <li><a name="TOC50" href="libunistring_13.html#SEC50">13.2 Composition of Unicode characters</a></li> - <li><a name="TOC51" href="libunistring_13.html#SEC51">13.3 Normalization of strings</a></li> - <li><a name="TOC52" href="libunistring_13.html#SEC52">13.4 Normalizing comparisons</a></li> - <li><a name="TOC53" href="libunistring_13.html#SEC53">13.5 Normalization of streams of Unicode characters</a></li> + <li><a name="TOC62" href="libunistring_13.html#SEC62">13.1 Decomposition of Unicode characters</a></li> + <li><a name="TOC63" href="libunistring_13.html#SEC63">13.2 Composition of Unicode characters</a></li> + <li><a name="TOC64" href="libunistring_13.html#SEC64">13.3 Normalization of strings</a></li> + <li><a name="TOC65" href="libunistring_13.html#SEC65">13.4 Normalizing comparisons</a></li> + <li><a name="TOC66" href="libunistring_13.html#SEC66">13.5 Normalization of streams of Unicode characters</a></li> </ul></li> - <li><a name="TOC54" href="libunistring_14.html#SEC54">14. Case mappings <code><unicase.h></code></a> + <li><a name="TOC67" href="libunistring_14.html#SEC67">14. Case mappings <code><unicase.h></code></a> <ul class="toc"> - <li><a name="TOC55" href="libunistring_14.html#SEC55">14.1 Case mappings of characters</a></li> - <li><a name="TOC56" href="libunistring_14.html#SEC56">14.2 Case mappings of strings</a></li> - <li><a name="TOC57" href="libunistring_14.html#SEC57">14.3 Case mappings of substrings</a></li> - <li><a name="TOC58" href="libunistring_14.html#SEC58">14.4 Case insensitive comparison</a></li> - <li><a name="TOC59" href="libunistring_14.html#SEC59">14.5 Case detection</a></li> + <li><a name="TOC68" href="libunistring_14.html#SEC68">14.1 Case mappings of characters</a></li> + <li><a name="TOC69" href="libunistring_14.html#SEC69">14.2 Case mappings of strings</a></li> + <li><a name="TOC70" href="libunistring_14.html#SEC70">14.3 Case mappings of substrings</a></li> + <li><a name="TOC71" href="libunistring_14.html#SEC71">14.4 Case insensitive comparison</a></li> + <li><a name="TOC72" href="libunistring_14.html#SEC72">14.5 Case detection</a></li> </ul></li> - <li><a name="TOC60" href="libunistring_15.html#SEC60">15. Regular expressions <code><uniregex.h></code></a></li> - <li><a name="TOC61" href="libunistring_16.html#SEC61">16. Using the library</a> + <li><a name="TOC73" href="libunistring_15.html#SEC73">15. Regular expressions <code><uniregex.h></code></a></li> + <li><a name="TOC74" href="libunistring_16.html#SEC74">16. Using the library</a> <ul class="toc"> - <li><a name="TOC62" href="libunistring_16.html#SEC62">16.1 Installation</a></li> - <li><a name="TOC63" href="libunistring_16.html#SEC63">16.2 Compiler options</a></li> - <li><a name="TOC64" href="libunistring_16.html#SEC64">16.3 Include files</a></li> - <li><a name="TOC65" href="libunistring_16.html#SEC65">16.4 Autoconf macro</a></li> - <li><a name="TOC66" href="libunistring_16.html#SEC66">16.5 Reporting problems</a></li> + <li><a name="TOC75" href="libunistring_16.html#SEC75">16.1 Installation</a></li> + <li><a name="TOC76" href="libunistring_16.html#SEC76">16.2 Compiler options</a></li> + <li><a name="TOC77" href="libunistring_16.html#SEC77">16.3 Include files</a></li> + <li><a name="TOC78" href="libunistring_16.html#SEC78">16.4 Autoconf macro</a></li> + <li><a name="TOC79" href="libunistring_16.html#SEC79">16.5 Reporting problems</a></li> </ul></li> - <li><a name="TOC67" href="libunistring_17.html#SEC67">17. More advanced functionality</a></li> - <li><a name="TOC68" href="libunistring_18.html#SEC68">A. Licenses</a> + <li><a name="TOC80" href="libunistring_17.html#SEC80">17. More advanced functionality</a></li> + <li><a name="TOC81" href="libunistring_18.html#SEC81">A. The <code>wchar_t</code> mess</a></li> + <li><a name="TOC82" href="libunistring_19.html#SEC82">B. Licenses</a> <ul class="toc"> - <li><a name="TOC69" href="libunistring_18.html#SEC69">A.1 GNU GENERAL PUBLIC LICENSE</a></li> - <li><a name="TOC70" href="libunistring_18.html#SEC74">A.2 GNU LESSER GENERAL PUBLIC LICENSE</a></li> - <li><a name="TOC71" href="libunistring_18.html#SEC75">A.3 GNU Free Documentation License</a></li> + <li><a name="TOC83" href="libunistring_19.html#SEC83">B.1 GNU GENERAL PUBLIC LICENSE</a></li> + <li><a name="TOC84" href="libunistring_19.html#SEC88">B.2 GNU LESSER GENERAL PUBLIC LICENSE</a></li> + <li><a name="TOC85" href="libunistring_19.html#SEC89">B.3 GNU Free Documentation License</a></li> </ul></li> - <li><a name="TOC72" href="libunistring_19.html#SEC77">Index</a></li> + <li><a name="TOC86" href="libunistring_20.html#SEC91">Index</a></li> </ul> </div> @@ -160,12 +179,12 @@ ul.toc {list-style: none} <table cellpadding="1" cellspacing="1" border="0"> <tr><td valign="middle" align="left">[<a href="#SEC_Top" title="Cover (top) of document">Top</a>]</td> <td valign="middle" align="left">[<a href="#SEC_Contents" title="Table of contents">Contents</a>]</td> -<td valign="middle" align="left">[<a href="libunistring_19.html#SEC77" title="Index">Index</a>]</td> +<td valign="middle" align="left">[<a href="libunistring_20.html#SEC91" title="Index">Index</a>]</td> <td valign="middle" align="left">[<a href="libunistring_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <p> <font size="-1"> - This document was generated by <em>Daiki Ueno</em> on <em>November, 30 2017</em> using <a href="http://www.nongnu.org/texi2html/"><em>texi2html 1.78a</em></a>. + This document was generated by <em>Daiki Ueno</em> on <em>May, 25 2018</em> using <a href="http://www.nongnu.org/texi2html/"><em>texi2html 1.78a</em></a>. </font> <br> diff --git a/doc/stamp-vti b/doc/stamp-vti index e2c015cc..eef982b6 100644 --- a/doc/stamp-vti +++ b/doc/stamp-vti @@ -1,4 +1,4 @@ -@set UPDATED 30 November 2017 -@set UPDATED-MONTH November 2017 -@set EDITION 0.9.8 -@set VERSION 0.9.8 +@set UPDATED 25 May 2018 +@set UPDATED-MONTH May 2018 +@set EDITION 0.9.10 +@set VERSION 0.9.10 diff --git a/doc/unicase.texi b/doc/unicase.texi index e88a0a48..8dac4a42 100644 --- a/doc/unicase.texi +++ b/doc/unicase.texi @@ -106,6 +106,9 @@ Returns the uppercase mapping of a string. The @var{nf} argument identifies the normalization form to apply after the case-mapping. It can also be NULL, for no normalization. + +The @var{resultbuf} and @var{lengthp} arguments are as described in +chapter @ref{Conventions}. @end deftypefun @deftypefun {uint8_t *} u8_tolower (const uint8_t *@var{s}, size_t @var{n}, const char *@var{iso639_language}, uninorm_t @var{nf}, uint8_t *@var{resultbuf}, size_t *@var{lengthp}) @@ -115,6 +118,9 @@ Returns the lowercase mapping of a string. The @var{nf} argument identifies the normalization form to apply after the case-mapping. It can also be NULL, for no normalization. + +The @var{resultbuf} and @var{lengthp} arguments are as described in +chapter @ref{Conventions}. @end deftypefun @deftypefun {uint8_t *} u8_totitle (const uint8_t *@var{s}, size_t @var{n}, const char *@var{iso639_language}, uninorm_t @var{nf}, uint8_t *@var{resultbuf}, size_t *@var{lengthp}) @@ -128,6 +134,9 @@ are being mapped to lower case. The @var{nf} argument identifies the normalization form to apply after the case-mapping. It can also be NULL, for no normalization. + +The @var{resultbuf} and @var{lengthp} arguments are as described in +chapter @ref{Conventions}. @end deftypefun @node Case mappings of substrings @@ -200,6 +209,9 @@ prefix context and the suffix context. @deftypefunx {uint32_t *} u32_ct_toupper (const uint32_t *@var{s}, size_t @var{n}, casing_prefix_context_t @var{prefix_context}, casing_suffix_context_t @var{suffix_context}, const char *@var{iso639_language}, uninorm_t @var{nf}, uint32_t *@var{resultbuf}, size_t *@var{lengthp}) Returns the uppercase mapping of a string that is surrounded by a prefix and a suffix. + +The @var{resultbuf} and @var{lengthp} arguments are as described in +chapter @ref{Conventions}. @end deftypefun @deftypefun {uint8_t *} u8_ct_tolower (const uint8_t *@var{s}, size_t @var{n}, casing_prefix_context_t @var{prefix_context}, casing_suffix_context_t @var{suffix_context}, const char *@var{iso639_language}, uninorm_t @var{nf}, uint8_t *@var{resultbuf}, size_t *@var{lengthp}) @@ -207,6 +219,9 @@ and a suffix. @deftypefunx {uint32_t *} u32_ct_tolower (const uint32_t *@var{s}, size_t @var{n}, casing_prefix_context_t @var{prefix_context}, casing_suffix_context_t @var{suffix_context}, const char *@var{iso639_language}, uninorm_t @var{nf}, uint32_t *@var{resultbuf}, size_t *@var{lengthp}) Returns the lowercase mapping of a string that is surrounded by a prefix and a suffix. + +The @var{resultbuf} and @var{lengthp} arguments are as described in +chapter @ref{Conventions}. @end deftypefun @deftypefun {uint8_t *} u8_ct_totitle (const uint8_t *@var{s}, size_t @var{n}, casing_prefix_context_t @var{prefix_context}, casing_suffix_context_t @var{suffix_context}, const char *@var{iso639_language}, uninorm_t @var{nf}, uint8_t *@var{resultbuf}, size_t *@var{lengthp}) @@ -214,6 +229,9 @@ and a suffix. @deftypefunx {uint32_t *} u32_ct_totitle (const uint32_t *@var{s}, size_t @var{n}, casing_prefix_context_t @var{prefix_context}, casing_suffix_context_t @var{suffix_context}, const char *@var{iso639_language}, uninorm_t @var{nf}, uint32_t *@var{resultbuf}, size_t *@var{lengthp}) Returns the titlecase mapping of a string that is surrounded by a prefix and a suffix. + +The @var{resultbuf} and @var{lengthp} arguments are as described in +chapter @ref{Conventions}. @end deftypefun For example, to uppercase the UTF-8 substring between @code{s + start_index} @@ -249,6 +267,9 @@ with the @code{u8_cmp2} function is equivalent to comparing @var{s1} and The @var{nf} argument identifies the normalization form to apply after the case-mapping. It can also be NULL, for no normalization. + +The @var{resultbuf} and @var{lengthp} arguments are as described in +chapter @ref{Conventions}. @end deftypefun @deftypefun {uint8_t *} u8_ct_casefold (const uint8_t *@var{s}, size_t @var{n}, casing_prefix_context_t @var{prefix_context}, casing_suffix_context_t @var{suffix_context}, const char *@var{iso639_language}, uninorm_t @var{nf}, uint8_t *@var{resultbuf}, size_t *@var{lengthp}) @@ -256,6 +277,9 @@ case-mapping. It can also be NULL, for no normalization. @deftypefunx {uint32_t *} u32_ct_casefold (const uint32_t *@var{s}, size_t @var{n}, casing_prefix_context_t @var{prefix_context}, casing_suffix_context_t @var{suffix_context}, const char *@var{iso639_language}, uninorm_t @var{nf}, uint32_t *@var{resultbuf}, size_t *@var{lengthp}) Returns the case folded string. The case folding takes into account the case mapping contexts of the prefix and suffix strings. + +The @var{resultbuf} and @var{lengthp} arguments are as described in +chapter @ref{Conventions}. @end deftypefun @deftypefun int u8_casecmp (const uint8_t *@var{s1}, size_t @var{n1}, const uint8_t *@var{s2}, size_t @var{n2}, const char *@var{iso639_language}, uninorm_t @var{nf}, int *@var{resultp}) @@ -290,6 +314,9 @@ equivalent to comparing @var{s1} and @var{s2} with @code{u8_casecoll}. @var{nf} must be either @code{UNINORM_NFC}, @code{UNINORM_NFKC}, or NULL for no normalization. + +The @var{resultbuf} and @var{lengthp} arguments are as described in +chapter @ref{Conventions}. @end deftypefun @deftypefun int u8_casecoll (const uint8_t *@var{s1}, size_t @var{n1}, const uint8_t *@var{s2}, size_t @var{n2}, const char *@var{iso639_language}, uninorm_t @var{nf}, int *@var{resultp}) diff --git a/doc/unictype.texi b/doc/unictype.texi index 5f292cc0..7fbeaa56 100644 --- a/doc/unictype.texi +++ b/doc/unictype.texi @@ -65,200 +65,199 @@ not an array type. The following are the predefined general category value. Additional general categories may be added in the future. -@deftypevr Constant uc_general_category_t UC_CATEGORY_L -@deftypevrx Constant uc_general_category_t UC_CATEGORY_LC -@deftypevrx Constant uc_general_category_t UC_CATEGORY_Lu -@deftypevrx Constant uc_general_category_t UC_CATEGORY_Ll -@deftypevrx Constant uc_general_category_t UC_CATEGORY_Lt -@deftypevrx Constant uc_general_category_t UC_CATEGORY_Lm -@deftypevrx Constant uc_general_category_t UC_CATEGORY_Lo -@deftypevrx Constant uc_general_category_t UC_CATEGORY_M -@deftypevrx Constant uc_general_category_t UC_CATEGORY_Mn -@deftypevrx Constant uc_general_category_t UC_CATEGORY_Mc -@deftypevrx Constant uc_general_category_t UC_CATEGORY_Me -@deftypevrx Constant uc_general_category_t UC_CATEGORY_N -@deftypevrx Constant uc_general_category_t UC_CATEGORY_Nd -@deftypevrx Constant uc_general_category_t UC_CATEGORY_Nl -@deftypevrx Constant uc_general_category_t UC_CATEGORY_No -@deftypevrx Constant uc_general_category_t UC_CATEGORY_P -@deftypevrx Constant uc_general_category_t UC_CATEGORY_Pc -@deftypevrx Constant uc_general_category_t UC_CATEGORY_Pd -@deftypevrx Constant uc_general_category_t UC_CATEGORY_Ps -@deftypevrx Constant uc_general_category_t UC_CATEGORY_Pe -@deftypevrx Constant uc_general_category_t UC_CATEGORY_Pi -@deftypevrx Constant uc_general_category_t UC_CATEGORY_Pf -@deftypevrx Constant uc_general_category_t UC_CATEGORY_Po -@deftypevrx Constant uc_general_category_t UC_CATEGORY_S -@deftypevrx Constant uc_general_category_t UC_CATEGORY_Sm -@deftypevrx Constant uc_general_category_t UC_CATEGORY_Sc -@deftypevrx Constant uc_general_category_t UC_CATEGORY_Sk -@deftypevrx Constant uc_general_category_t UC_CATEGORY_So -@deftypevrx Constant uc_general_category_t UC_CATEGORY_Z -@deftypevrx Constant uc_general_category_t UC_CATEGORY_Zs -@deftypevrx Constant uc_general_category_t UC_CATEGORY_Zl -@deftypevrx Constant uc_general_category_t UC_CATEGORY_Zp -@deftypevrx Constant uc_general_category_t UC_CATEGORY_C -@deftypevrx Constant uc_general_category_t UC_CATEGORY_Cc -@deftypevrx Constant uc_general_category_t UC_CATEGORY_Cf -@deftypevrx Constant uc_general_category_t UC_CATEGORY_Cs -@deftypevrx Constant uc_general_category_t UC_CATEGORY_Co -@deftypevrx Constant uc_general_category_t UC_CATEGORY_Cn -@end deftypevr +The @code{UC_CATEGORY_*} constants reflect the systematic general category +values assigned by the Unicode Consortium. Whereas the other @code{UC_*} +macros are aliases, for use when readable code is preferred. -The following are alias names for predefined General category values. - -@deftypevr Macro uc_general_category_t UC_LETTER -This is another name for @code{UC_CATEGORY_L}. +@deftypevr Constant uc_general_category_t UC_CATEGORY_L +@deftypevrx Macro uc_general_category_t UC_LETTER +This represents the general category ``Letter''. @end deftypevr -@deftypevr Macro uc_general_category_t UC_CASED_LETTER -This is another name for @code{UC_CATEGORY_LC}. +@deftypevr Constant uc_general_category_t UC_CATEGORY_LC +@deftypevrx Macro uc_general_category_t UC_CASED_LETTER @end deftypevr -@deftypevr Macro uc_general_category_t UC_UPPERCASE_LETTER -This is another name for @code{UC_CATEGORY_Lu}. +@deftypevr Constant uc_general_category_t UC_CATEGORY_Lu +@deftypevrx Macro uc_general_category_t UC_UPPERCASE_LETTER +This represents the general category ``Letter, uppercase''. @end deftypevr -@deftypevr Macro uc_general_category_t UC_LOWERCASE_LETTER -This is another name for @code{UC_CATEGORY_Ll}. +@deftypevr Constant uc_general_category_t UC_CATEGORY_Ll +@deftypevrx Macro uc_general_category_t UC_LOWERCASE_LETTER +This represents the general category ``Letter, lowercase''. @end deftypevr -@deftypevr Macro uc_general_category_t UC_TITLECASE_LETTER -This is another name for @code{UC_CATEGORY_Lt}. +@deftypevr Constant uc_general_category_t UC_CATEGORY_Lt +@deftypevrx Macro uc_general_category_t UC_TITLECASE_LETTER +This represents the general category ``Letter, titlecase''. @end deftypevr -@deftypevr Macro uc_general_category_t UC_MODIFIER_LETTER -This is another name for @code{UC_CATEGORY_Lm}. +@deftypevr Constant uc_general_category_t UC_CATEGORY_Lm +@deftypevrx Macro uc_general_category_t UC_MODIFIER_LETTER +This represents the general category ``Letter, modifier''. @end deftypevr -@deftypevr Macro uc_general_category_t UC_OTHER_LETTER -This is another name for @code{UC_CATEGORY_Lo}. +@deftypevr Constant uc_general_category_t UC_CATEGORY_Lo +@deftypevrx Macro uc_general_category_t UC_OTHER_LETTER +This represents the general category ``Letter, other''. @end deftypevr -@deftypevr Macro uc_general_category_t UC_MARK -This is another name for @code{UC_CATEGORY_M}. +@deftypevr Constant uc_general_category_t UC_CATEGORY_M +@deftypevrx Macro uc_general_category_t UC_MARK +This represents the general category ``Marker''. @end deftypevr -@deftypevr Macro uc_general_category_t UC_NON_SPACING_MARK -This is another name for @code{UC_CATEGORY_Mn}. +@deftypevr Constant uc_general_category_t UC_CATEGORY_Mn +@deftypevrx Macro uc_general_category_t UC_NON_SPACING_MARK +This represents the general category ``Marker, nonspacing''. @end deftypevr -@deftypevr Macro uc_general_category_t UC_COMBINING_SPACING_MARK -This is another name for @code{UC_CATEGORY_Mc}. +@deftypevr Constant uc_general_category_t UC_CATEGORY_Mc +@deftypevrx Macro uc_general_category_t UC_COMBINING_SPACING_MARK +This represents the general category ``Marker, spacing combining''. @end deftypevr -@deftypevr Macro uc_general_category_t UC_ENCLOSING_MARK -This is another name for @code{UC_CATEGORY_Me}. +@deftypevr Constant uc_general_category_t UC_CATEGORY_Me +@deftypevrx Macro uc_general_category_t UC_ENCLOSING_MARK +This represents the general category ``Marker, enclosing''. @end deftypevr -@deftypevr Macro uc_general_category_t UC_NUMBER -This is another name for @code{UC_CATEGORY_N}. +@deftypevr Constant uc_general_category_t UC_CATEGORY_N +@deftypevrx Macro uc_general_category_t UC_NUMBER +This represents the general category ``Number''. @end deftypevr -@deftypevr Macro uc_general_category_t UC_DECIMAL_DIGIT_NUMBER -This is another name for @code{UC_CATEGORY_Nd}. +@deftypevr Constant uc_general_category_t UC_CATEGORY_Nd +@deftypevrx Macro uc_general_category_t UC_DECIMAL_DIGIT_NUMBER +This represents the general category ``Number, decimal digit''. @end deftypevr -@deftypevr Macro uc_general_category_t UC_LETTER_NUMBER -This is another name for @code{UC_CATEGORY_Nl}. +@deftypevr Constant uc_general_category_t UC_CATEGORY_Nl +@deftypevrx Macro uc_general_category_t UC_LETTER_NUMBER +This represents the general category ``Number, letter''. @end deftypevr -@deftypevr Macro uc_general_category_t UC_OTHER_NUMBER -This is another name for @code{UC_CATEGORY_No}. +@deftypevr Constant uc_general_category_t UC_CATEGORY_No +@deftypevrx Macro uc_general_category_t UC_OTHER_NUMBER +This represents the general category ``Number, other''. @end deftypevr -@deftypevr Macro uc_general_category_t UC_PUNCTUATION -This is another name for @code{UC_CATEGORY_P}. +@deftypevr Constant uc_general_category_t UC_CATEGORY_P +@deftypevrx Macro uc_general_category_t UC_PUNCTUATION +This represents the general category ``Punctuation''. @end deftypevr -@deftypevr Macro uc_general_category_t UC_CONNECTOR_PUNCTUATION -This is another name for @code{UC_CATEGORY_Pc}. +@deftypevr Constant uc_general_category_t UC_CATEGORY_Pc +@deftypevrx Macro uc_general_category_t UC_CONNECTOR_PUNCTUATION +This represents the general category ``Punctuation, connector''. @end deftypevr -@deftypevr Macro uc_general_category_t UC_DASH_PUNCTUATION -This is another name for @code{UC_CATEGORY_Pd}. +@deftypevr Constant uc_general_category_t UC_CATEGORY_Pd +@deftypevrx Macro uc_general_category_t UC_DASH_PUNCTUATION +This represents the general category ``Punctuation, dash''. @end deftypevr -@deftypevr Macro uc_general_category_t UC_OPEN_PUNCTUATION -This is another name for @code{UC_CATEGORY_Ps} (``start punctuation''). +@deftypevr Constant uc_general_category_t UC_CATEGORY_Ps +@deftypevrx Macro uc_general_category_t UC_OPEN_PUNCTUATION +This represents the general category ``Punctuation, open'', a.k.a. ``start punctuation''. @end deftypevr -@deftypevr Macro uc_general_category_t UC_CLOSE_PUNCTUATION -This is another name for @code{UC_CATEGORY_Pe} (``end punctuation''). +@deftypevr Constant uc_general_category_t UC_CATEGORY_Pe +@deftypevrx Macro uc_general_category_t UC_CLOSE_PUNCTUATION +This represents the general category ``Punctuation, close'', a.k.a. ``end punctuation''. @end deftypevr -@deftypevr Macro uc_general_category_t UC_INITIAL_QUOTE_PUNCTUATION -This is another name for @code{UC_CATEGORY_Pi}. +@deftypevr Constant uc_general_category_t UC_CATEGORY_Pi +@deftypevrx Macro uc_general_category_t UC_INITIAL_QUOTE_PUNCTUATION +This represents the general category ``Punctuation, initial quote''. @end deftypevr -@deftypevr Macro uc_general_category_t UC_FINAL_QUOTE_PUNCTUATION -This is another name for @code{UC_CATEGORY_Pf}. +@deftypevr Constant uc_general_category_t UC_CATEGORY_Pf +@deftypevrx Macro uc_general_category_t UC_FINAL_QUOTE_PUNCTUATION +This represents the general category ``Punctuation, final quote''. @end deftypevr -@deftypevr Macro uc_general_category_t UC_OTHER_PUNCTUATION -This is another name for @code{UC_CATEGORY_Po}. +@deftypevr Constant uc_general_category_t UC_CATEGORY_Po +@deftypevrx Macro uc_general_category_t UC_OTHER_PUNCTUATION +This represents the general category ``Punctuation, other''. @end deftypevr -@deftypevr Macro uc_general_category_t UC_SYMBOL -This is another name for @code{UC_CATEGORY_S}. +@deftypevr Constant uc_general_category_t UC_CATEGORY_S +@deftypevrx Macro uc_general_category_t UC_SYMBOL +This represents the general category ``Symbol''. @end deftypevr -@deftypevr Macro uc_general_category_t UC_MATH_SYMBOL -This is another name for @code{UC_CATEGORY_Sm}. +@deftypevr Constant uc_general_category_t UC_CATEGORY_Sm +@deftypevrx Macro uc_general_category_t UC_MATH_SYMBOL +This represents the general category ``Symbol, math''. @end deftypevr -@deftypevr Macro uc_general_category_t UC_CURRENCY_SYMBOL -This is another name for @code{UC_CATEGORY_Sc}. +@deftypevr Constant uc_general_category_t UC_CATEGORY_Sc +@deftypevrx Macro uc_general_category_t UC_CURRENCY_SYMBOL +This represents the general category ``Symbol, currency''. @end deftypevr -@deftypevr Macro uc_general_category_t UC_MODIFIER_SYMBOL -This is another name for @code{UC_CATEGORY_Sk}. +@deftypevr Constant uc_general_category_t UC_CATEGORY_Sk +@deftypevrx Macro uc_general_category_t UC_MODIFIER_SYMBOL +This represents the general category ``Symbol, modifier''. @end deftypevr -@deftypevr Macro uc_general_category_t UC_OTHER_SYMBOL -This is another name for @code{UC_CATEGORY_So}. +@deftypevr Constant uc_general_category_t UC_CATEGORY_So +@deftypevrx Macro uc_general_category_t UC_OTHER_SYMBOL +This represents the general category ``Symbol, other''. @end deftypevr -@deftypevr Macro uc_general_category_t UC_SEPARATOR -This is another name for @code{UC_CATEGORY_Z}. +@deftypevr Constant uc_general_category_t UC_CATEGORY_Z +@deftypevrx Macro uc_general_category_t UC_SEPARATOR +This represents the general category ``Separator''. @end deftypevr -@deftypevr Macro uc_general_category_t UC_SPACE_SEPARATOR -This is another name for @code{UC_CATEGORY_Zs}. +@deftypevr Constant uc_general_category_t UC_CATEGORY_Zs +@deftypevrx Macro uc_general_category_t UC_SPACE_SEPARATOR +This represents the general category ``Separator, space''. @end deftypevr -@deftypevr Macro uc_general_category_t UC_LINE_SEPARATOR -This is another name for @code{UC_CATEGORY_Zl}. +@deftypevr Constant uc_general_category_t UC_CATEGORY_Zl +@deftypevrx Macro uc_general_category_t UC_LINE_SEPARATOR +This represents the general category ``Separator, line''. @end deftypevr -@deftypevr Macro uc_general_category_t UC_PARAGRAPH_SEPARATOR -This is another name for @code{UC_CATEGORY_Zp}. +@deftypevr Constant uc_general_category_t UC_CATEGORY_Zp +@deftypevrx Macro uc_general_category_t UC_PARAGRAPH_SEPARATOR +This represents the general category ``Separator, paragraph''. @end deftypevr -@deftypevr Macro uc_general_category_t UC_OTHER -This is another name for @code{UC_CATEGORY_C}. +@deftypevr Constant uc_general_category_t UC_CATEGORY_C +@deftypevrx Macro uc_general_category_t UC_OTHER +This represents the general category ``Other''. @end deftypevr -@deftypevr Macro uc_general_category_t UC_CONTROL -This is another name for @code{UC_CATEGORY_Cc}. +@deftypevr Constant uc_general_category_t UC_CATEGORY_Cc +@deftypevrx Macro uc_general_category_t UC_CONTROL +This represents the general category ``Other, control''. @end deftypevr -@deftypevr Macro uc_general_category_t UC_FORMAT -This is another name for @code{UC_CATEGORY_Cf}. +@deftypevr Constant uc_general_category_t UC_CATEGORY_Cf +@deftypevrx Macro uc_general_category_t UC_FORMAT +This represents the general category ``Other, format''. @end deftypevr -@deftypevr Macro uc_general_category_t UC_SURROGATE -This is another name for @code{UC_CATEGORY_Cs}. All code points in this -category are invalid characters. +@deftypevr Constant uc_general_category_t UC_CATEGORY_Cs +@deftypevrx Macro uc_general_category_t UC_SURROGATE +This represents the general category ``Other, surrogate''. +All code points in this category are invalid characters. @end deftypevr -@deftypevr Macro uc_general_category_t UC_PRIVATE_USE -This is another name for @code{UC_CATEGORY_Co}. +@deftypevr Constant uc_general_category_t UC_CATEGORY_Co +@deftypevrx Macro uc_general_category_t UC_PRIVATE_USE +This represents the general category ``Other, private use''. @end deftypevr -@deftypevr Macro uc_general_category_t UC_UNASSIGNED -This is another name for @code{UC_CATEGORY_Cn}. Some code points in this -category are invalid characters. +@deftypevr Constant uc_general_category_t UC_CATEGORY_Cn +@deftypevrx Macro uc_general_category_t UC_UNASSIGNED +This represents the general category ``Other, not assigned''. +Some code points in this category are invalid characters. @end deftypevr The following functions combine general categories, like in a boolean algebra, diff --git a/doc/unigbrk.texi b/doc/unigbrk.texi index d7847cc2..c5ced90c 100644 --- a/doc/unigbrk.texi +++ b/doc/unigbrk.texi @@ -148,7 +148,7 @@ This implements the extended (not legacy) grapheme cluster rules described in the Unicode standard, because the standard says that they are preferred. -Note that this function do not handle the case when three ore more +Note that this function does not handle the case when three or more consecutive characters are needed to determine the boundary. Use @func{uc_grapheme_breaks} for such cases. @end deftypefun diff --git a/doc/uninorm.texi b/doc/uninorm.texi index 5cad859b..ad7a1da0 100644 --- a/doc/uninorm.texi +++ b/doc/uninorm.texi @@ -209,6 +209,9 @@ The following functions apply a Unicode normalization form to a Unicode string. @deftypefunx {uint16_t *} u16_normalize (uninorm_t @var{nf}, const uint16_t *@var{s}, size_t @var{n}, uint16_t *@var{resultbuf}, size_t *@var{lengthp}) @deftypefunx {uint32_t *} u32_normalize (uninorm_t @var{nf}, const uint32_t *@var{s}, size_t @var{n}, uint32_t *@var{resultbuf}, size_t *@var{lengthp}) Returns the specified normalization form of a string. + +The @var{resultbuf} and @var{lengthp} arguments are as described in +chapter @ref{Conventions}. @end deftypefun @node Normalizing comparisons @@ -241,6 +244,9 @@ sequence, in such a way that comparing @code{u8_normxfrm (@var{s1})} and comparing @var{s1} and @var{s2} with the @code{u8_normcoll} function. @var{nf} must be either @code{UNINORM_NFC} or @code{UNINORM_NFKC}. + +The @var{resultbuf} and @var{lengthp} arguments are as described in +chapter @ref{Conventions}. @end deftypefun @deftypefun int u8_normcoll (const uint8_t *@var{s1}, size_t @var{n1}, const uint8_t *@var{s2}, size_t @var{n2}, uninorm_t @var{nf}, int *@var{resultp}) diff --git a/doc/unistdio.texi b/doc/unistdio.texi index e1fb9cfa..8f1a0a17 100644 --- a/doc/unistdio.texi +++ b/doc/unistdio.texi @@ -9,7 +9,7 @@ strings. It defines a set of functions similar to @code{fprintf} and These functions work like the @code{printf} function family. In the format string: -@itemize +@itemize @bullet @item The format directive @samp{U} takes an UTF-8 string (@code{const uint8_t *}). @item diff --git a/doc/unistr.texi b/doc/unistr.texi index 60f1daa4..da0f4da2 100644 --- a/doc/unistr.texi +++ b/doc/unistr.texi @@ -35,31 +35,61 @@ The following functions perform conversions between the different forms of Unico @deftypefun {uint16_t *} u8_to_u16 (const uint8_t *@var{s}, size_t @var{n}, uint16_t *@var{resultbuf}, size_t *@var{lengthp}) Converts an UTF-8 string to an UTF-16 string. + +The @var{resultbuf} and @var{lengthp} arguments are as described in +chapter @ref{Conventions}. @end deftypefun @deftypefun {uint32_t *} u8_to_u32 (const uint8_t *@var{s}, size_t @var{n}, uint32_t *@var{resultbuf}, size_t *@var{lengthp}) Converts an UTF-8 string to an UTF-32 string. + +The @var{resultbuf} and @var{lengthp} arguments are as described in +chapter @ref{Conventions}. @end deftypefun @deftypefun {uint8_t *} u16_to_u8 (const uint16_t *@var{s}, size_t @var{n}, uint8_t *@var{resultbuf}, size_t *@var{lengthp}) Converts an UTF-16 string to an UTF-8 string. + +The @var{resultbuf} and @var{lengthp} arguments are as described in +chapter @ref{Conventions}. @end deftypefun @deftypefun {uint32_t *} u16_to_u32 (const uint16_t *@var{s}, size_t @var{n}, uint32_t *@var{resultbuf}, size_t *@var{lengthp}) Converts an UTF-16 string to an UTF-32 string. + +The @var{resultbuf} and @var{lengthp} arguments are as described in +chapter @ref{Conventions}. @end deftypefun @deftypefun {uint8_t *} u32_to_u8 (const uint32_t *@var{s}, size_t @var{n}, uint8_t *@var{resultbuf}, size_t *@var{lengthp}) Converts an UTF-32 string to an UTF-8 string. + +The @var{resultbuf} and @var{lengthp} arguments are as described in +chapter @ref{Conventions}. @end deftypefun @deftypefun {uint16_t *} u32_to_u16 (const uint32_t *@var{s}, size_t @var{n}, uint16_t *@var{resultbuf}, size_t *@var{lengthp}) Converts an UTF-32 string to an UTF-16 string. + +The @var{resultbuf} and @var{lengthp} arguments are as described in +chapter @ref{Conventions}. @end deftypefun @node Elementary string functions @section Elementary string functions +@menu +* Iterating:: +* Creating Unicode strings:: +* Copying Unicode strings:: +* Comparing Unicode strings:: +* Searching for a character:: +* Counting characters:: +@end menu + +@node Iterating +@subsection Iterating over a Unicode string + @cindex iterating The following functions inspect and return details about the first character in a Unicode string. @@ -75,9 +105,9 @@ This function is similar to @posixfunc{mblen}, except that it operates on a Unicode string and that @var{s} must not be NULL. @end deftypefun -@deftypefun int u8_mbtouc_unsafe (ucs4_t *@var{puc}, const uint8_t *@var{s}, size_t @var{n}) -@deftypefunx int u16_mbtouc_unsafe (ucs4_t *@var{puc}, const uint16_t *@var{s}, size_t @var{n}) -@deftypefunx int u32_mbtouc_unsafe (ucs4_t *@var{puc}, const uint32_t *@var{s}, size_t @var{n}) +@deftypefun int u8_mbtouc (ucs4_t *@var{puc}, const uint8_t *@var{s}, size_t @var{n}) +@deftypefunx int u16_mbtouc (ucs4_t *@var{puc}, const uint16_t *@var{s}, size_t @var{n}) +@deftypefunx int u32_mbtouc (ucs4_t *@var{puc}, const uint32_t *@var{s}, size_t @var{n}) Returns the length (number of units) of the first character in @var{s}, putting its @code{ucs4_t} representation in @code{*@var{puc}}. Upon failure, @code{*@var{puc}} is set to @code{0xfffd}, and an appropriate number of units @@ -85,17 +115,21 @@ is returned. The number of available units, @var{n}, must be > 0. +This function fails if an invalid sequence of units is encountered at the +beginning of @var{s}, or if additional units (after the @var{n} provided units) +would be needed to form a character. + This function is similar to @posixfunc{mbtowc}, except that it operates on a Unicode string, @var{puc} and @var{s} must not be NULL, @var{n} must be > 0, and the NUL character is not treated specially. @end deftypefun -@deftypefun int u8_mbtouc (ucs4_t *@var{puc}, const uint8_t *@var{s}, size_t @var{n}) -@deftypefunx int u16_mbtouc (ucs4_t *@var{puc}, const uint16_t *@var{s}, size_t @var{n}) -@deftypefunx int u32_mbtouc (ucs4_t *@var{puc}, const uint32_t *@var{s}, size_t @var{n}) -This function is like @code{u8_mbtouc_unsafe}, except that it will detect an -invalid UTF-8 character, even if the library is compiled without -@option{--enable-safety}. +@deftypefun int u8_mbtouc_unsafe (ucs4_t *@var{puc}, const uint8_t *@var{s}, size_t @var{n}) +@deftypefunx int u16_mbtouc_unsafe (ucs4_t *@var{puc}, const uint16_t *@var{s}, size_t @var{n}) +@deftypefunx int u32_mbtouc_unsafe (ucs4_t *@var{puc}, const uint32_t *@var{s}, size_t @var{n}) +This function is identical to @code{u8_mbtouc}/@code{u16_mbtouc}/@code{u32_mbtouc}. +Earlier versions of this function performed fewer range-checks on the sequence +of units. @end deftypefun @deftypefun int u8_mbtoucr (ucs4_t *@var{puc}, const uint8_t *@var{s}, size_t @var{n}) @@ -112,6 +146,9 @@ This function is similar to @code{u8_mbtouc}, except that the return value gives more details about the failure, similar to @posixfunc{mbrtowc}. @end deftypefun +@node Creating Unicode strings +@subsection Creating Unicode strings one character at a time + The following function stores a Unicode character as a Unicode string in memory. @@ -127,6 +164,9 @@ Unicode strings, @var{s} must not be NULL, and the argument @var{n} must be specified. @end deftypefun +@node Copying Unicode strings +@subsection Copying Unicode strings + @cindex copying The following functions copy Unicode strings in memory. @@ -161,6 +201,9 @@ This function is similar to @posixfunc{memset}, except that it operates on Unicode strings. @end deftypefun +@node Comparing Unicode strings +@subsection Comparing Unicode strings + @cindex comparing The following function compares two Unicode strings of the same length. @@ -191,6 +234,9 @@ This function is similar to the gnulib function @func{memcmp2}, except that it operates on Unicode strings. @end deftypefun +@node Searching for a character +@subsection Searching for a character in a Unicode string + @cindex searching, for a character The following function searches for a given Unicode character. @@ -205,6 +251,9 @@ This function is similar to @posixfunc{memchr}, except that it operates on Unicode strings. @end deftypefun +@node Counting characters +@subsection Counting the characters in a Unicode string + @cindex counting The following function counts the number of Unicode characters. @@ -233,6 +282,20 @@ Makes a freshly allocated copy of @var{s}, of length @var{n}. @node Elementary string functions on NUL terminated strings @section Elementary string functions on NUL terminated strings +@menu +* Iterating over a NUL terminated Unicode string:: +* Length:: +* Copying a NUL terminated Unicode string:: +* Comparing NUL terminated Unicode strings:: +* Duplicating a NUL terminated Unicode string:: +* Searching for a character in a NUL terminated Unicode string:: +* Searching for a substring:: +* Tokenizing:: +@end menu + +@node Iterating over a NUL terminated Unicode string +@subsection Iterating over a NUL terminated Unicode string + The following functions inspect and return details about the first character in a Unicode string. @@ -273,6 +336,9 @@ Puts the character's @code{ucs4_t} representation in @code{*@var{puc}}. Note that this function works only on well-formed Unicode strings. @end deftypefun +@node Length +@subsection Length of a NUL terminated Unicode string + The following functions determine the length of a Unicode string. @deftypefun size_t u8_strlen (const uint8_t *@var{s}) @@ -293,6 +359,9 @@ This function is similar to @posixfunc{strnlen} and @posixfunc{wcsnlen}, except that it operates on Unicode strings. @end deftypefun +@node Copying a NUL terminated Unicode string +@subsection Copying a NUL terminated Unicode string + @cindex copying The following functions copy portions of Unicode strings in memory. @@ -355,6 +424,9 @@ This function is similar to @posixfunc{strncat} and @posixfunc{wcsncat}, except that it operates on Unicode strings. @end deftypefun +@node Comparing NUL terminated Unicode strings +@subsection Comparing NUL terminated Unicode strings + @cindex comparing The following functions compare two Unicode strings. @@ -396,6 +468,9 @@ This function is similar to @posixfunc{strncmp} and @posixfunc{wcsncmp}, except that it operates on Unicode strings. @end deftypefun +@node Duplicating a NUL terminated Unicode string +@subsection Duplicating a NUL terminated Unicode string + @cindex duplicating The following function allocates a duplicate of a Unicode string. @@ -408,6 +483,9 @@ This function is similar to @posixfunc{strdup} and @posixfunc{wcsdup}, except that it operates on Unicode strings. @end deftypefun +@node Searching for a character in a NUL terminated Unicode string +@subsection Searching for a character in a NUL terminated Unicode string + @cindex searching, for a character The following functions search for a given Unicode character. @@ -461,6 +539,9 @@ This function is similar to @posixfunc{strpbrk} and @posixfunc{wcspbrk}, except that it operates on Unicode strings. @end deftypefun +@node Searching for a substring +@subsection Searching for a substring in a NUL terminated Unicode string + @cindex searching, for a substring The following functions search whether a given Unicode string is a substring of another Unicode string. @@ -486,6 +567,9 @@ Tests whether @var{str} starts with @var{prefix}. Tests whether @var{str} ends with @var{suffix}. @end deftypefun +@node Tokenizing +@subsection Tokenizing a NUL terminated Unicode string + The following function does one step in tokenizing a Unicode string. @deftypefun {uint8_t *} u8_strtok (uint8_t *@var{str}, const uint8_t *@var{delim}, uint8_t **@var{ptr}) diff --git a/doc/unitypes.texi b/doc/unitypes.texi index 696ba881..68ab92fb 100644 --- a/doc/unitypes.texi +++ b/doc/unitypes.texi @@ -13,3 +13,15 @@ taken from @code{<stdint.h>}, on platforms where this include file is present. @deftp Type ucs4_t This type represents a single Unicode character, outside of an UTF-32 string. @end deftp + +The types @code{ucs4_t} and @code{uint32_t} happen to be identical. They differ +in use and intent, however: +@itemize @bullet +@item +Use @code{uint32_t *} to designate an UTF-32 string. Use @code{ucs4_t} to +designate a single Unicode character, outside of an UTF-32 string. +@item +Conversions functions that take an UTF-32 string as input will usually perform +a range-check on the @code{uint32_t} values. Whereas functions that are +declared to take @code{ucs4_t} arguments will not perform such a range-check. +@end itemize diff --git a/doc/version.texi b/doc/version.texi index e2c015cc..eef982b6 100644 --- a/doc/version.texi +++ b/doc/version.texi @@ -1,4 +1,4 @@ -@set UPDATED 30 November 2017 -@set UPDATED-MONTH November 2017 -@set EDITION 0.9.8 -@set VERSION 0.9.8 +@set UPDATED 25 May 2018 +@set UPDATED-MONTH May 2018 +@set EDITION 0.9.10 +@set VERSION 0.9.10 diff --git a/doc/wchar_t.texi b/doc/wchar_t.texi new file mode 100644 index 00000000..f5c239a5 --- /dev/null +++ b/doc/wchar_t.texi @@ -0,0 +1,51 @@ +@node The wchar_t mess +@appendix The @code{wchar_t} mess + +@cindex wchar_t, type +The ISO C and POSIX standard creators made an attempt to fix the first +problem mentioned in the section @ref{char * strings}. They introduced +@itemize @bullet +@item +a type @samp{wchar_t}, designed to encapsulate an entire character, +@item +a ``wide string'' type @samp{wchar_t *}, and +@item +functions declared in @posixheader{wctype.h} that were meant to supplant the +ones in @posixheader{ctype.h}. +@end itemize + +Unfortunately, this API and its implementation has numerous problems: + +@itemize @bullet +@item +On AIX and Windows platforms, @code{wchar_t} is a 16-bit type. This +means that it can never accommodate an entire Unicode character. Either +the @code{wchar_t *} strings are limited to characters in UCS-2 (the +``Basic Multilingual Plane'' of Unicode), or --- if @code{wchar_t *} +strings are encoded in UTF-16 --- a @code{wchar_t} represents only half +of a character in the worst case, making the @posixheader{wctype.h} functions +pointless. + +@item +On Solaris and FreeBSD, the @code{wchar_t} encoding is locale dependent +and undocumented. This means, if you want to know any property of a +@code{wchar_t} character, other than the properties defined by +@posixheader{wctype.h} --- such as whether it's a dash, currency symbol, +paragraph separator, or similar ---, you have to convert it to +@code{char *} encoding first, by use of the function @posixfunc{wctomb}. + +@item +When you read a stream of wide characters, through the functions +@posixfunc{fgetwc} and @posixfunc{fgetws}, and when the input stream/file is +not in the expected encoding, you have no way to determine the invalid +byte sequence and do some corrective action. If you use these +functions, your program becomes ``garbage in - more garbage out'' or +``garbage in - abort''. +@end itemize + +As a consequence, it is better to use multibyte strings, as explained in +the section @ref{char * strings}. Such multibyte strings can bypass +limitations of the @code{wchar_t} type, if you use functions defined in gnulib +and libunistring for text processing. They can also faithfully transport +malformed characters that were present in the input, without requiring +the program to produce garbage or abort. |