diff options
| author | Manuel A. Fernandez Montecelo <manuel.montezelo@gmail.com> | 2016-05-26 16:48:15 +0100 |
|---|---|---|
| committer | Manuel A. Fernandez Montecelo <manuel.montezelo@gmail.com> | 2016-05-26 16:48:15 +0100 |
| commit | 5f2b09982312c98863eb9a8dfe2c608b81f58259 (patch) | |
| tree | e5d38581c2f36e1cca02efedd2d85044d77f76f9 /doc | |
| parent | 3e0814cd9862b89c7a39672672937477bd87ddfb (diff) | |
Imported Upstream version 0.9.6upstream/0.9.6
Diffstat (limited to 'doc')
35 files changed, 7988 insertions, 5914 deletions
diff --git a/doc/Makefile.am b/doc/Makefile.am index ac3480c8..bca3aebc 100644 --- a/doc/Makefile.am +++ b/doc/Makefile.am @@ -1,5 +1,5 @@ ## Makefile for the doc subdirectory of GNU libunistring. -## Copyright (C) 2009 Free Software Foundation, Inc. +## Copyright (C) 2009, 2011 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 @@ -33,8 +33,8 @@ info_TEXINFOS = libunistring.texi # List of texinfo sources @included by libunistring.texi, excluding version.texi. libunistring_TEXINFOS = \ unitypes.texi unistr.texi uniconv.texi unistdio.texi uniname.texi \ - unictype.texi uniwidth.texi uniwbrk.texi unilbrk.texi uninorm.texi \ - unicase.texi uniregex.texi \ + unictype.texi uniwidth.texi unigbrk.texi uniwbrk.texi unilbrk.texi \ + uninorm.texi unicase.texi uniregex.texi \ gpl.texi lgpl.texi fdl.texi # The dependencies of stamp-vti generated by automake are incomplete. @@ -87,7 +87,7 @@ TEXI2DVI = @TEXI2DVI@ $(TEXINCLUDES) # The install-dvi target is already defined by automake. installdirs-dvi: - $(mkdir_p) $(DESTDIR)$(dvidir) + $(MKDIR_P) $(DESTDIR)$(dvidir) uninstall-dvi: $(RM) $(DESTDIR)$(dvidir)/libunistring.dvi @@ -105,7 +105,7 @@ libunistring.ps: libunistring.dvi # The install-ps target is already defined by automake. installdirs-ps: - $(mkdir_p) $(DESTDIR)$(psdir) + $(MKDIR_P) $(DESTDIR)$(psdir) uninstall-ps: $(RM) $(DESTDIR)$(psdir)/libunistring.ps @@ -120,7 +120,7 @@ TEXI2PDF = @TEXI2DVI@ --pdf $(TEXINCLUDES) # The install-pdf target is already defined by automake. installdirs-pdf: - $(mkdir_p) $(DESTDIR)$(pdfdir) + $(MKDIR_P) $(DESTDIR)$(pdfdir) uninstall-pdf: $(RM) $(DESTDIR)$(pdfdir)/libunistring.pdf @@ -151,17 +151,17 @@ libunistring_toc.html: libunistring.texi version.texi $(libunistring_TEXINFOS) } install-html-monolithic: libunistring.html - $(mkdir_p) $(DESTDIR)$(htmldir) + $(MKDIR_P) $(DESTDIR)$(htmldir) $(INSTALL_DATA) `if test -f libunistring.html; then echo .; else echo $(srcdir); fi`/libunistring.html $(DESTDIR)$(htmldir)/libunistring.html install-html-split: libunistring_toc.html - $(mkdir_p) $(DESTDIR)$(htmldir) + $(MKDIR_P) $(DESTDIR)$(htmldir) for file in `if test -f libunistring_toc.html; then echo .; else echo $(srcdir); fi`/libunistring_*.html; do \ $(INSTALL_DATA) $$file $(DESTDIR)$(htmldir)/`basename $$file`; \ done installdirs-html: - $(mkdir_p) $(DESTDIR)$(htmldir) + $(MKDIR_P) $(DESTDIR)$(htmldir) uninstall-html-monolithic: $(RM) $(DESTDIR)$(htmldir)/libunistring.html @@ -170,14 +170,14 @@ uninstall-html-split: $(RM) $(DESTDIR)$(htmldir)/libunistring_*.html dist-html-monolithic: - $(mkdir_p) $(distdir)/ + $(MKDIR_P) $(distdir)/ file=libunistring.html; \ if test -f $$file; then d=.; else d=$(srcdir); fi; \ cp -p $$d/$$file $(distdir)/$$file || exit 1 # We would like to put libunistring_*.html into EXTRA_DIST, but it doesn't work. dist-html-split: libunistring_toc.html - $(mkdir_p) $(distdir)/ + $(MKDIR_P) $(distdir)/ file=libunistring_toc.html; \ if test -f $$file; then d=.; else d=$(srcdir); fi; \ for file in `cd $$d && echo libunistring_*.html`; do \ diff --git a/doc/Makefile.in b/doc/Makefile.in index 26bd7748..92929606 100644 --- a/doc/Makefile.in +++ b/doc/Makefile.in @@ -1,9 +1,8 @@ -# Makefile.in generated by automake 1.11.1 from Makefile.am. +# Makefile.in generated by automake 1.15 from Makefile.am. # @configure_input@ -# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, -# 2003, 2004, 2005, 2006, 2007, 2008, 2009 Free Software Foundation, -# Inc. +# Copyright (C) 1994-2014 Free Software Foundation, Inc. + # This Makefile.in is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. @@ -15,10 +14,64 @@ @SET_MAKE@ VPATH = @srcdir@ +am__is_gnu_make = { \ + if test -z '$(MAKELEVEL)'; then \ + false; \ + elif test -n '$(MAKE_HOST)'; then \ + true; \ + elif test -n '$(MAKE_VERSION)' && test -n '$(CURDIR)'; then \ + true; \ + else \ + false; \ + fi; \ +} +am__make_running_with_option = \ + case $${target_option-} in \ + ?) ;; \ + *) echo "am__make_running_with_option: internal error: invalid" \ + "target option '$${target_option-}' specified" >&2; \ + exit 1;; \ + esac; \ + has_opt=no; \ + sane_makeflags=$$MAKEFLAGS; \ + if $(am__is_gnu_make); then \ + sane_makeflags=$$MFLAGS; \ + else \ + case $$MAKEFLAGS in \ + *\\[\ \ ]*) \ + bs=\\; \ + sane_makeflags=`printf '%s\n' "$$MAKEFLAGS" \ + | sed "s/$$bs$$bs[$$bs $$bs ]*//g"`;; \ + esac; \ + fi; \ + skip_next=no; \ + strip_trailopt () \ + { \ + flg=`printf '%s\n' "$$flg" | sed "s/$$1.*$$//"`; \ + }; \ + for flg in $$sane_makeflags; do \ + test $$skip_next = yes && { skip_next=no; continue; }; \ + case $$flg in \ + *=*|--*) continue;; \ + -*I) strip_trailopt 'I'; skip_next=yes;; \ + -*I?*) strip_trailopt 'I';; \ + -*O) strip_trailopt 'O'; skip_next=yes;; \ + -*O?*) strip_trailopt 'O';; \ + -*l) strip_trailopt 'l'; skip_next=yes;; \ + -*l?*) strip_trailopt 'l';; \ + -[dEDm]) skip_next=yes;; \ + -[JT]) skip_next=yes;; \ + esac; \ + case $$flg in \ + *$$target_option*) has_opt=yes; break;; \ + esac; \ + done; \ + test $$has_opt = yes +am__make_dryrun = (target_option=n; $(am__make_running_with_option)) +am__make_keepgoing = (target_option=k; $(am__make_running_with_option)) pkgdatadir = $(datadir)/@PACKAGE@ pkgincludedir = $(includedir)/@PACKAGE@ pkglibdir = $(libdir)/@PACKAGE@ -pkglibexecdir = $(libexecdir)/@PACKAGE@ am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd install_sh_DATA = $(install_sh) -c -m 644 install_sh_PROGRAM = $(install_sh) -c @@ -34,13 +87,13 @@ POST_UNINSTALL = : build_triplet = @build@ host_triplet = @host@ subdir = doc -DIST_COMMON = $(libunistring_TEXINFOS) $(srcdir)/Makefile.am \ - $(srcdir)/Makefile.in $(srcdir)/stamp-vti \ - $(srcdir)/version.texi ACLOCAL_M4 = $(top_srcdir)/aclocal.m4 am__aclocal_m4_deps = $(top_srcdir)/gnulib-m4/00gnulib.m4 \ + $(top_srcdir)/gnulib-m4/absolute-header.m4 \ $(top_srcdir)/gnulib-m4/alloca.m4 \ + $(top_srcdir)/gnulib-m4/btowc.m4 \ $(top_srcdir)/gnulib-m4/codeset.m4 \ + $(top_srcdir)/gnulib-m4/configmake.m4 \ $(top_srcdir)/gnulib-m4/eealloc.m4 \ $(top_srcdir)/gnulib-m4/environ.m4 \ $(top_srcdir)/gnulib-m4/errno_h.m4 \ @@ -49,11 +102,14 @@ am__aclocal_m4_deps = $(top_srcdir)/gnulib-m4/00gnulib.m4 \ $(top_srcdir)/gnulib-m4/exponentf.m4 \ $(top_srcdir)/gnulib-m4/exponentl.m4 \ $(top_srcdir)/gnulib-m4/extensions.m4 \ + $(top_srcdir)/gnulib-m4/extern-inline.m4 \ $(top_srcdir)/gnulib-m4/fcntl-o.m4 \ + $(top_srcdir)/gnulib-m4/fdopen.m4 \ $(top_srcdir)/gnulib-m4/float_h.m4 \ $(top_srcdir)/gnulib-m4/fpieee.m4 \ $(top_srcdir)/gnulib-m4/frexp.m4 \ $(top_srcdir)/gnulib-m4/frexpl.m4 \ + $(top_srcdir)/gnulib-m4/fseterr.m4 \ $(top_srcdir)/gnulib-m4/getpagesize.m4 \ $(top_srcdir)/gnulib-m4/glibc21.m4 \ $(top_srcdir)/gnulib-m4/gnulib-common.m4 \ @@ -65,16 +121,22 @@ am__aclocal_m4_deps = $(top_srcdir)/gnulib-m4/00gnulib.m4 \ $(top_srcdir)/gnulib-m4/inline.m4 \ $(top_srcdir)/gnulib-m4/intlmacosx.m4 \ $(top_srcdir)/gnulib-m4/intmax_t.m4 \ + $(top_srcdir)/gnulib-m4/inttypes-pri.m4 \ + $(top_srcdir)/gnulib-m4/inttypes.m4 \ $(top_srcdir)/gnulib-m4/inttypes_h.m4 \ $(top_srcdir)/gnulib-m4/isnand.m4 \ $(top_srcdir)/gnulib-m4/isnanf.m4 \ $(top_srcdir)/gnulib-m4/isnanl.m4 \ + $(top_srcdir)/gnulib-m4/iswblank.m4 \ + $(top_srcdir)/gnulib-m4/langinfo_h.m4 \ $(top_srcdir)/gnulib-m4/lcmessage.m4 \ $(top_srcdir)/gnulib-m4/ldexpl.m4 \ $(top_srcdir)/gnulib-m4/lib-ld.m4 \ $(top_srcdir)/gnulib-m4/lib-link.m4 \ $(top_srcdir)/gnulib-m4/lib-prefix.m4 \ + $(top_srcdir)/gnulib-m4/libunistring-base.m4 \ $(top_srcdir)/gnulib-m4/localcharset.m4 \ + $(top_srcdir)/gnulib-m4/locale-ar.m4 \ $(top_srcdir)/gnulib-m4/locale-fr.m4 \ $(top_srcdir)/gnulib-m4/locale-ja.m4 \ $(top_srcdir)/gnulib-m4/locale-tr.m4 \ @@ -91,27 +153,38 @@ am__aclocal_m4_deps = $(top_srcdir)/gnulib-m4/00gnulib.m4 \ $(top_srcdir)/gnulib-m4/mbrtowc.m4 \ $(top_srcdir)/gnulib-m4/mbsinit.m4 \ $(top_srcdir)/gnulib-m4/mbstate_t.m4 \ + $(top_srcdir)/gnulib-m4/mbtowc.m4 \ $(top_srcdir)/gnulib-m4/memchr.m4 \ $(top_srcdir)/gnulib-m4/minmax.m4 \ $(top_srcdir)/gnulib-m4/mmap-anon.m4 \ + $(top_srcdir)/gnulib-m4/msvc-inval.m4 \ + $(top_srcdir)/gnulib-m4/msvc-nothrow.m4 \ $(top_srcdir)/gnulib-m4/multiarch.m4 \ $(top_srcdir)/gnulib-m4/nocrash.m4 \ + $(top_srcdir)/gnulib-m4/off_t.m4 \ $(top_srcdir)/gnulib-m4/printf-frexp.m4 \ $(top_srcdir)/gnulib-m4/printf-frexpl.m4 \ $(top_srcdir)/gnulib-m4/printf.m4 \ $(top_srcdir)/gnulib-m4/putenv.m4 \ $(top_srcdir)/gnulib-m4/relocatable-lib.m4 \ $(top_srcdir)/gnulib-m4/setenv.m4 \ + $(top_srcdir)/gnulib-m4/setlocale.m4 \ $(top_srcdir)/gnulib-m4/signbit.m4 \ $(top_srcdir)/gnulib-m4/size_max.m4 \ + $(top_srcdir)/gnulib-m4/ssize_t.m4 \ + $(top_srcdir)/gnulib-m4/stdalign.m4 \ $(top_srcdir)/gnulib-m4/stdbool.m4 \ $(top_srcdir)/gnulib-m4/stddef_h.m4 \ $(top_srcdir)/gnulib-m4/stdint.m4 \ $(top_srcdir)/gnulib-m4/stdint_h.m4 \ + $(top_srcdir)/gnulib-m4/stdio_h.m4 \ $(top_srcdir)/gnulib-m4/stdlib_h.m4 \ $(top_srcdir)/gnulib-m4/strerror.m4 \ $(top_srcdir)/gnulib-m4/string_h.m4 \ $(top_srcdir)/gnulib-m4/strncat.m4 \ + $(top_srcdir)/gnulib-m4/strstr.m4 \ + $(top_srcdir)/gnulib-m4/sys_socket_h.m4 \ + $(top_srcdir)/gnulib-m4/sys_types_h.m4 \ $(top_srcdir)/gnulib-m4/thread.m4 \ $(top_srcdir)/gnulib-m4/threadlib.m4 \ $(top_srcdir)/gnulib-m4/unistd_h.m4 \ @@ -119,7 +192,9 @@ am__aclocal_m4_deps = $(top_srcdir)/gnulib-m4/00gnulib.m4 \ $(top_srcdir)/gnulib-m4/warn-on-use.m4 \ $(top_srcdir)/gnulib-m4/wchar_h.m4 \ $(top_srcdir)/gnulib-m4/wchar_t.m4 \ + $(top_srcdir)/gnulib-m4/wcrtomb.m4 \ $(top_srcdir)/gnulib-m4/wctob.m4 \ + $(top_srcdir)/gnulib-m4/wctomb.m4 \ $(top_srcdir)/gnulib-m4/wctype_h.m4 \ $(top_srcdir)/gnulib-m4/wcwidth.m4 \ $(top_srcdir)/gnulib-m4/wint_t.m4 \ @@ -133,18 +208,54 @@ am__aclocal_m4_deps = $(top_srcdir)/gnulib-m4/00gnulib.m4 \ $(top_srcdir)/configure.ac am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \ $(ACLOCAL_M4) +DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/version.texi \ + $(srcdir)/stamp-vti $(am__DIST_COMMON) mkinstalldirs = $(install_sh) -d CONFIG_HEADER = $(top_builddir)/config.h CONFIG_CLEAN_FILES = CONFIG_CLEAN_VPATH_FILES = -AM_V_GEN = $(am__v_GEN_$(V)) -am__v_GEN_ = $(am__v_GEN_$(AM_DEFAULT_VERBOSITY)) -am__v_GEN_0 = @echo " GEN " $@; -AM_V_at = $(am__v_at_$(V)) -am__v_at_ = $(am__v_at_$(AM_DEFAULT_VERBOSITY)) +AM_V_P = $(am__v_P_@AM_V@) +am__v_P_ = $(am__v_P_@AM_DEFAULT_V@) +am__v_P_0 = false +am__v_P_1 = : +AM_V_GEN = $(am__v_GEN_@AM_V@) +am__v_GEN_ = $(am__v_GEN_@AM_DEFAULT_V@) +am__v_GEN_0 = @echo " GEN " $@; +am__v_GEN_1 = +AM_V_at = $(am__v_at_@AM_V@) +am__v_at_ = $(am__v_at_@AM_DEFAULT_V@) am__v_at_0 = @ +am__v_at_1 = SOURCES = DIST_SOURCES = +AM_V_DVIPS = $(am__v_DVIPS_@AM_V@) +am__v_DVIPS_ = $(am__v_DVIPS_@AM_DEFAULT_V@) +am__v_DVIPS_0 = @echo " DVIPS " $@; +am__v_DVIPS_1 = +AM_V_MAKEINFO = $(am__v_MAKEINFO_@AM_V@) +am__v_MAKEINFO_ = $(am__v_MAKEINFO_@AM_DEFAULT_V@) +am__v_MAKEINFO_0 = @echo " MAKEINFO" $@; +am__v_MAKEINFO_1 = +AM_V_INFOHTML = $(am__v_INFOHTML_@AM_V@) +am__v_INFOHTML_ = $(am__v_INFOHTML_@AM_DEFAULT_V@) +am__v_INFOHTML_0 = @echo " INFOHTML" $@; +am__v_INFOHTML_1 = +AM_V_TEXI2DVI = $(am__v_TEXI2DVI_@AM_V@) +am__v_TEXI2DVI_ = $(am__v_TEXI2DVI_@AM_DEFAULT_V@) +am__v_TEXI2DVI_0 = @echo " TEXI2DVI" $@; +am__v_TEXI2DVI_1 = +AM_V_TEXI2PDF = $(am__v_TEXI2PDF_@AM_V@) +am__v_TEXI2PDF_ = $(am__v_TEXI2PDF_@AM_DEFAULT_V@) +am__v_TEXI2PDF_0 = @echo " TEXI2PDF" $@; +am__v_TEXI2PDF_1 = +AM_V_texinfo = $(am__v_texinfo_@AM_V@) +am__v_texinfo_ = $(am__v_texinfo_@AM_DEFAULT_V@) +am__v_texinfo_0 = -q +am__v_texinfo_1 = +AM_V_texidevnull = $(am__v_texidevnull_@AM_V@) +am__v_texidevnull_ = $(am__v_texidevnull_@AM_DEFAULT_V@) +am__v_texidevnull_0 = > /dev/null +am__v_texidevnull_1 = INFO_DEPS = $(srcdir)/libunistring.info TEXINFO_TEX = $(top_srcdir)/build-aux/texinfo.tex am__TEXINFO_TEX_DIR = $(top_srcdir)/build-aux @@ -155,6 +266,11 @@ HTMLS = libunistring.html TEXINFOS = libunistring.texi MAKEINFOHTML = $(MAKEINFO) --html AM_MAKEINFOHTMLFLAGS = $(AM_MAKEINFOFLAGS) +am__can_run_installinfo = \ + case $$AM_UPDATE_INFO_DIR in \ + n|no|NO) false;; \ + *) (install-info --version) >/dev/null 2>&1;; \ + esac am__installdirs = "$(DESTDIR)$(infodir)" am__vpath_adj_setup = srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`; am__vpath_adj = case $$p in \ @@ -177,7 +293,18 @@ am__nobase_list = $(am__nobase_strip_setup); \ am__base_list = \ sed '$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;s/\n/ /g' | \ sed '$$!N;$$!N;$$!N;$$!N;s/\n/ /g' +am__uninstall_files_from_dir = { \ + test -z "$$files" \ + || { test ! -d "$$dir" && test ! -f "$$dir" && test ! -r "$$dir"; } \ + || { echo " ( cd '$$dir' && rm -f" $$files ")"; \ + $(am__cd) "$$dir" && rm -f $$files; }; \ + } +am__tagged_files = $(HEADERS) $(SOURCES) $(TAGS_FILES) $(LISP) +am__DIST_COMMON = $(libunistring_TEXINFOS) $(srcdir)/Makefile.in \ + $(top_srcdir)/build-aux/mdate-sh \ + $(top_srcdir)/build-aux/texinfo.tex DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST) +pkglibexecdir = @pkglibexecdir@ ACLOCAL = @ACLOCAL@ ALLOCA = @ALLOCA@ ALLOCA_H = @ALLOCA_H@ @@ -185,6 +312,7 @@ AMTAR = @AMTAR@ AM_DEFAULT_VERBOSITY = @AM_DEFAULT_VERBOSITY@ APPLE_UNIVERSAL_BUILD = @APPLE_UNIVERSAL_BUILD@ AR = @AR@ +ARFLAGS = @ARFLAGS@ AS = @AS@ AUTOCONF = @AUTOCONF@ AUTOHEADER = @AUTOHEADER@ @@ -229,38 +357,97 @@ FGREP = @FGREP@ FLOAT_H = @FLOAT_H@ GLIBC21 = @GLIBC21@ GLOBAL_SYMBOL_PIPE = @GLOBAL_SYMBOL_PIPE@ +GNULIB_ACOSF = @GNULIB_ACOSF@ GNULIB_ACOSL = @GNULIB_ACOSL@ +GNULIB_ASINF = @GNULIB_ASINF@ GNULIB_ASINL = @GNULIB_ASINL@ +GNULIB_ATAN2F = @GNULIB_ATAN2F@ +GNULIB_ATANF = @GNULIB_ATANF@ GNULIB_ATANL = @GNULIB_ATANL@ GNULIB_ATOLL = @GNULIB_ATOLL@ GNULIB_BTOWC = @GNULIB_BTOWC@ GNULIB_CALLOC_POSIX = @GNULIB_CALLOC_POSIX@ GNULIB_CANONICALIZE_FILE_NAME = @GNULIB_CANONICALIZE_FILE_NAME@ +GNULIB_CBRT = @GNULIB_CBRT@ +GNULIB_CBRTF = @GNULIB_CBRTF@ +GNULIB_CBRTL = @GNULIB_CBRTL@ +GNULIB_CEIL = @GNULIB_CEIL@ GNULIB_CEILF = @GNULIB_CEILF@ GNULIB_CEILL = @GNULIB_CEILL@ +GNULIB_CHDIR = @GNULIB_CHDIR@ GNULIB_CHOWN = @GNULIB_CHOWN@ GNULIB_CLOSE = @GNULIB_CLOSE@ +GNULIB_COPYSIGN = @GNULIB_COPYSIGN@ +GNULIB_COPYSIGNF = @GNULIB_COPYSIGNF@ +GNULIB_COPYSIGNL = @GNULIB_COPYSIGNL@ +GNULIB_COSF = @GNULIB_COSF@ +GNULIB_COSHF = @GNULIB_COSHF@ GNULIB_COSL = @GNULIB_COSL@ +GNULIB_DPRINTF = @GNULIB_DPRINTF@ +GNULIB_DUP = @GNULIB_DUP@ GNULIB_DUP2 = @GNULIB_DUP2@ GNULIB_DUP3 = @GNULIB_DUP3@ GNULIB_DUPLOCALE = @GNULIB_DUPLOCALE@ GNULIB_ENVIRON = @GNULIB_ENVIRON@ GNULIB_EUIDACCESS = @GNULIB_EUIDACCESS@ +GNULIB_EXP2 = @GNULIB_EXP2@ +GNULIB_EXP2F = @GNULIB_EXP2F@ +GNULIB_EXP2L = @GNULIB_EXP2L@ +GNULIB_EXPF = @GNULIB_EXPF@ GNULIB_EXPL = @GNULIB_EXPL@ +GNULIB_EXPM1 = @GNULIB_EXPM1@ +GNULIB_EXPM1F = @GNULIB_EXPM1F@ +GNULIB_EXPM1L = @GNULIB_EXPM1L@ +GNULIB_FABSF = @GNULIB_FABSF@ +GNULIB_FABSL = @GNULIB_FABSL@ GNULIB_FACCESSAT = @GNULIB_FACCESSAT@ GNULIB_FCHDIR = @GNULIB_FCHDIR@ GNULIB_FCHOWNAT = @GNULIB_FCHOWNAT@ +GNULIB_FCLOSE = @GNULIB_FCLOSE@ +GNULIB_FDATASYNC = @GNULIB_FDATASYNC@ +GNULIB_FDOPEN = @GNULIB_FDOPEN@ +GNULIB_FFLUSH = @GNULIB_FFLUSH@ +GNULIB_FFSL = @GNULIB_FFSL@ +GNULIB_FFSLL = @GNULIB_FFSLL@ +GNULIB_FGETC = @GNULIB_FGETC@ +GNULIB_FGETS = @GNULIB_FGETS@ +GNULIB_FLOOR = @GNULIB_FLOOR@ GNULIB_FLOORF = @GNULIB_FLOORF@ GNULIB_FLOORL = @GNULIB_FLOORL@ +GNULIB_FMA = @GNULIB_FMA@ +GNULIB_FMAF = @GNULIB_FMAF@ +GNULIB_FMAL = @GNULIB_FMAL@ +GNULIB_FMOD = @GNULIB_FMOD@ +GNULIB_FMODF = @GNULIB_FMODF@ +GNULIB_FMODL = @GNULIB_FMODL@ +GNULIB_FOPEN = @GNULIB_FOPEN@ +GNULIB_FPRINTF = @GNULIB_FPRINTF@ +GNULIB_FPRINTF_POSIX = @GNULIB_FPRINTF_POSIX@ +GNULIB_FPURGE = @GNULIB_FPURGE@ +GNULIB_FPUTC = @GNULIB_FPUTC@ +GNULIB_FPUTS = @GNULIB_FPUTS@ +GNULIB_FREAD = @GNULIB_FREAD@ +GNULIB_FREOPEN = @GNULIB_FREOPEN@ GNULIB_FREXP = @GNULIB_FREXP@ +GNULIB_FREXPF = @GNULIB_FREXPF@ GNULIB_FREXPL = @GNULIB_FREXPL@ +GNULIB_FSCANF = @GNULIB_FSCANF@ +GNULIB_FSEEK = @GNULIB_FSEEK@ +GNULIB_FSEEKO = @GNULIB_FSEEKO@ GNULIB_FSYNC = @GNULIB_FSYNC@ +GNULIB_FTELL = @GNULIB_FTELL@ +GNULIB_FTELLO = @GNULIB_FTELLO@ GNULIB_FTRUNCATE = @GNULIB_FTRUNCATE@ +GNULIB_FWRITE = @GNULIB_FWRITE@ +GNULIB_GETC = @GNULIB_GETC@ +GNULIB_GETCHAR = @GNULIB_GETCHAR@ GNULIB_GETCWD = @GNULIB_GETCWD@ +GNULIB_GETDELIM = @GNULIB_GETDELIM@ GNULIB_GETDOMAINNAME = @GNULIB_GETDOMAINNAME@ GNULIB_GETDTABLESIZE = @GNULIB_GETDTABLESIZE@ GNULIB_GETGROUPS = @GNULIB_GETGROUPS@ GNULIB_GETHOSTNAME = @GNULIB_GETHOSTNAME@ +GNULIB_GETLINE = @GNULIB_GETLINE@ GNULIB_GETLOADAVG = @GNULIB_GETLOADAVG@ GNULIB_GETLOGIN = @GNULIB_GETLOGIN@ GNULIB_GETLOGIN_R = @GNULIB_GETLOGIN_R@ @@ -268,17 +455,45 @@ GNULIB_GETPAGESIZE = @GNULIB_GETPAGESIZE@ GNULIB_GETSUBOPT = @GNULIB_GETSUBOPT@ GNULIB_GETUSERSHELL = @GNULIB_GETUSERSHELL@ GNULIB_GRANTPT = @GNULIB_GRANTPT@ +GNULIB_GROUP_MEMBER = @GNULIB_GROUP_MEMBER@ +GNULIB_HYPOT = @GNULIB_HYPOT@ +GNULIB_HYPOTF = @GNULIB_HYPOTF@ +GNULIB_HYPOTL = @GNULIB_HYPOTL@ +GNULIB_ICONV = @GNULIB_ICONV@ +GNULIB_ILOGB = @GNULIB_ILOGB@ +GNULIB_ILOGBF = @GNULIB_ILOGBF@ +GNULIB_ILOGBL = @GNULIB_ILOGBL@ +GNULIB_IMAXABS = @GNULIB_IMAXABS@ +GNULIB_IMAXDIV = @GNULIB_IMAXDIV@ +GNULIB_ISATTY = @GNULIB_ISATTY@ GNULIB_ISFINITE = @GNULIB_ISFINITE@ GNULIB_ISINF = @GNULIB_ISINF@ GNULIB_ISNAN = @GNULIB_ISNAN@ GNULIB_ISNAND = @GNULIB_ISNAND@ GNULIB_ISNANF = @GNULIB_ISNANF@ GNULIB_ISNANL = @GNULIB_ISNANL@ +GNULIB_ISWBLANK = @GNULIB_ISWBLANK@ +GNULIB_ISWCTYPE = @GNULIB_ISWCTYPE@ GNULIB_LCHOWN = @GNULIB_LCHOWN@ +GNULIB_LDEXPF = @GNULIB_LDEXPF@ GNULIB_LDEXPL = @GNULIB_LDEXPL@ GNULIB_LINK = @GNULIB_LINK@ GNULIB_LINKAT = @GNULIB_LINKAT@ +GNULIB_LOCALECONV = @GNULIB_LOCALECONV@ +GNULIB_LOG = @GNULIB_LOG@ +GNULIB_LOG10 = @GNULIB_LOG10@ +GNULIB_LOG10F = @GNULIB_LOG10F@ +GNULIB_LOG10L = @GNULIB_LOG10L@ +GNULIB_LOG1P = @GNULIB_LOG1P@ +GNULIB_LOG1PF = @GNULIB_LOG1PF@ +GNULIB_LOG1PL = @GNULIB_LOG1PL@ +GNULIB_LOG2 = @GNULIB_LOG2@ +GNULIB_LOG2F = @GNULIB_LOG2F@ +GNULIB_LOG2L = @GNULIB_LOG2L@ GNULIB_LOGB = @GNULIB_LOGB@ +GNULIB_LOGBF = @GNULIB_LOGBF@ +GNULIB_LOGBL = @GNULIB_LOGBL@ +GNULIB_LOGF = @GNULIB_LOGF@ GNULIB_LOGL = @GNULIB_LOGL@ GNULIB_LSEEK = @GNULIB_LSEEK@ GNULIB_MALLOC_POSIX = @GNULIB_MALLOC_POSIX@ @@ -301,6 +516,7 @@ GNULIB_MBSSEP = @GNULIB_MBSSEP@ GNULIB_MBSSPN = @GNULIB_MBSSPN@ GNULIB_MBSSTR = @GNULIB_MBSSTR@ GNULIB_MBSTOK_R = @GNULIB_MBSTOK_R@ +GNULIB_MBTOWC = @GNULIB_MBTOWC@ GNULIB_MEMCHR = @GNULIB_MEMCHR@ GNULIB_MEMMEM = @GNULIB_MEMMEM@ GNULIB_MEMPCPY = @GNULIB_MEMPCPY@ @@ -310,32 +526,75 @@ GNULIB_MKOSTEMP = @GNULIB_MKOSTEMP@ GNULIB_MKOSTEMPS = @GNULIB_MKOSTEMPS@ GNULIB_MKSTEMP = @GNULIB_MKSTEMP@ GNULIB_MKSTEMPS = @GNULIB_MKSTEMPS@ +GNULIB_MODF = @GNULIB_MODF@ +GNULIB_MODFF = @GNULIB_MODFF@ +GNULIB_MODFL = @GNULIB_MODFL@ +GNULIB_NL_LANGINFO = @GNULIB_NL_LANGINFO@ +GNULIB_OBSTACK_PRINTF = @GNULIB_OBSTACK_PRINTF@ +GNULIB_OBSTACK_PRINTF_POSIX = @GNULIB_OBSTACK_PRINTF_POSIX@ +GNULIB_PCLOSE = @GNULIB_PCLOSE@ +GNULIB_PERROR = @GNULIB_PERROR@ +GNULIB_PIPE = @GNULIB_PIPE@ GNULIB_PIPE2 = @GNULIB_PIPE2@ +GNULIB_POPEN = @GNULIB_POPEN@ +GNULIB_POSIX_OPENPT = @GNULIB_POSIX_OPENPT@ +GNULIB_POWF = @GNULIB_POWF@ GNULIB_PREAD = @GNULIB_PREAD@ +GNULIB_PRINTF = @GNULIB_PRINTF@ +GNULIB_PRINTF_POSIX = @GNULIB_PRINTF_POSIX@ GNULIB_PTSNAME = @GNULIB_PTSNAME@ +GNULIB_PTSNAME_R = @GNULIB_PTSNAME_R@ +GNULIB_PUTC = @GNULIB_PUTC@ +GNULIB_PUTCHAR = @GNULIB_PUTCHAR@ GNULIB_PUTENV = @GNULIB_PUTENV@ +GNULIB_PUTS = @GNULIB_PUTS@ +GNULIB_PWRITE = @GNULIB_PWRITE@ +GNULIB_QSORT_R = @GNULIB_QSORT_R@ +GNULIB_RANDOM = @GNULIB_RANDOM@ GNULIB_RANDOM_R = @GNULIB_RANDOM_R@ GNULIB_RAWMEMCHR = @GNULIB_RAWMEMCHR@ +GNULIB_READ = @GNULIB_READ@ GNULIB_READLINK = @GNULIB_READLINK@ GNULIB_READLINKAT = @GNULIB_READLINKAT@ GNULIB_REALLOC_POSIX = @GNULIB_REALLOC_POSIX@ GNULIB_REALPATH = @GNULIB_REALPATH@ +GNULIB_REMAINDER = @GNULIB_REMAINDER@ +GNULIB_REMAINDERF = @GNULIB_REMAINDERF@ +GNULIB_REMAINDERL = @GNULIB_REMAINDERL@ +GNULIB_REMOVE = @GNULIB_REMOVE@ +GNULIB_RENAME = @GNULIB_RENAME@ +GNULIB_RENAMEAT = @GNULIB_RENAMEAT@ +GNULIB_RINT = @GNULIB_RINT@ +GNULIB_RINTF = @GNULIB_RINTF@ +GNULIB_RINTL = @GNULIB_RINTL@ GNULIB_RMDIR = @GNULIB_RMDIR@ GNULIB_ROUND = @GNULIB_ROUND@ GNULIB_ROUNDF = @GNULIB_ROUNDF@ GNULIB_ROUNDL = @GNULIB_ROUNDL@ GNULIB_RPMATCH = @GNULIB_RPMATCH@ +GNULIB_SCANF = @GNULIB_SCANF@ +GNULIB_SECURE_GETENV = @GNULIB_SECURE_GETENV@ GNULIB_SETENV = @GNULIB_SETENV@ +GNULIB_SETHOSTNAME = @GNULIB_SETHOSTNAME@ +GNULIB_SETLOCALE = @GNULIB_SETLOCALE@ GNULIB_SIGNBIT = @GNULIB_SIGNBIT@ +GNULIB_SINF = @GNULIB_SINF@ +GNULIB_SINHF = @GNULIB_SINHF@ GNULIB_SINL = @GNULIB_SINL@ GNULIB_SLEEP = @GNULIB_SLEEP@ +GNULIB_SNPRINTF = @GNULIB_SNPRINTF@ +GNULIB_SPRINTF_POSIX = @GNULIB_SPRINTF_POSIX@ +GNULIB_SQRTF = @GNULIB_SQRTF@ GNULIB_SQRTL = @GNULIB_SQRTL@ +GNULIB_STDIO_H_NONBLOCKING = @GNULIB_STDIO_H_NONBLOCKING@ +GNULIB_STDIO_H_SIGPIPE = @GNULIB_STDIO_H_SIGPIPE@ GNULIB_STPCPY = @GNULIB_STPCPY@ GNULIB_STPNCPY = @GNULIB_STPNCPY@ GNULIB_STRCASESTR = @GNULIB_STRCASESTR@ GNULIB_STRCHRNUL = @GNULIB_STRCHRNUL@ GNULIB_STRDUP = @GNULIB_STRDUP@ GNULIB_STRERROR = @GNULIB_STRERROR@ +GNULIB_STRERROR_R = @GNULIB_STRERROR_R@ GNULIB_STRNCAT = @GNULIB_STRNCAT@ GNULIB_STRNDUP = @GNULIB_STRNDUP@ GNULIB_STRNLEN = @GNULIB_STRNLEN@ @@ -344,87 +603,197 @@ GNULIB_STRSEP = @GNULIB_STRSEP@ GNULIB_STRSIGNAL = @GNULIB_STRSIGNAL@ GNULIB_STRSTR = @GNULIB_STRSTR@ GNULIB_STRTOD = @GNULIB_STRTOD@ +GNULIB_STRTOIMAX = @GNULIB_STRTOIMAX@ GNULIB_STRTOK_R = @GNULIB_STRTOK_R@ GNULIB_STRTOLL = @GNULIB_STRTOLL@ GNULIB_STRTOULL = @GNULIB_STRTOULL@ +GNULIB_STRTOUMAX = @GNULIB_STRTOUMAX@ GNULIB_STRVERSCMP = @GNULIB_STRVERSCMP@ GNULIB_SYMLINK = @GNULIB_SYMLINK@ GNULIB_SYMLINKAT = @GNULIB_SYMLINKAT@ +GNULIB_SYSTEM_POSIX = @GNULIB_SYSTEM_POSIX@ +GNULIB_TANF = @GNULIB_TANF@ +GNULIB_TANHF = @GNULIB_TANHF@ GNULIB_TANL = @GNULIB_TANL@ +GNULIB_TMPFILE = @GNULIB_TMPFILE@ +GNULIB_TOWCTRANS = @GNULIB_TOWCTRANS@ GNULIB_TRUNC = @GNULIB_TRUNC@ GNULIB_TRUNCF = @GNULIB_TRUNCF@ GNULIB_TRUNCL = @GNULIB_TRUNCL@ GNULIB_TTYNAME_R = @GNULIB_TTYNAME_R@ -GNULIB_UNISTD_H_GETOPT = @GNULIB_UNISTD_H_GETOPT@ +GNULIB_UNISTD_H_NONBLOCKING = @GNULIB_UNISTD_H_NONBLOCKING@ GNULIB_UNISTD_H_SIGPIPE = @GNULIB_UNISTD_H_SIGPIPE@ GNULIB_UNLINK = @GNULIB_UNLINK@ GNULIB_UNLINKAT = @GNULIB_UNLINKAT@ GNULIB_UNLOCKPT = @GNULIB_UNLOCKPT@ GNULIB_UNSETENV = @GNULIB_UNSETENV@ GNULIB_USLEEP = @GNULIB_USLEEP@ +GNULIB_VASPRINTF = @GNULIB_VASPRINTF@ +GNULIB_VDPRINTF = @GNULIB_VDPRINTF@ +GNULIB_VFPRINTF = @GNULIB_VFPRINTF@ +GNULIB_VFPRINTF_POSIX = @GNULIB_VFPRINTF_POSIX@ +GNULIB_VFSCANF = @GNULIB_VFSCANF@ +GNULIB_VPRINTF = @GNULIB_VPRINTF@ +GNULIB_VPRINTF_POSIX = @GNULIB_VPRINTF_POSIX@ +GNULIB_VSCANF = @GNULIB_VSCANF@ +GNULIB_VSNPRINTF = @GNULIB_VSNPRINTF@ +GNULIB_VSPRINTF_POSIX = @GNULIB_VSPRINTF_POSIX@ +GNULIB_WCPCPY = @GNULIB_WCPCPY@ +GNULIB_WCPNCPY = @GNULIB_WCPNCPY@ GNULIB_WCRTOMB = @GNULIB_WCRTOMB@ +GNULIB_WCSCASECMP = @GNULIB_WCSCASECMP@ +GNULIB_WCSCAT = @GNULIB_WCSCAT@ +GNULIB_WCSCHR = @GNULIB_WCSCHR@ +GNULIB_WCSCMP = @GNULIB_WCSCMP@ +GNULIB_WCSCOLL = @GNULIB_WCSCOLL@ +GNULIB_WCSCPY = @GNULIB_WCSCPY@ +GNULIB_WCSCSPN = @GNULIB_WCSCSPN@ +GNULIB_WCSDUP = @GNULIB_WCSDUP@ +GNULIB_WCSLEN = @GNULIB_WCSLEN@ +GNULIB_WCSNCASECMP = @GNULIB_WCSNCASECMP@ +GNULIB_WCSNCAT = @GNULIB_WCSNCAT@ +GNULIB_WCSNCMP = @GNULIB_WCSNCMP@ +GNULIB_WCSNCPY = @GNULIB_WCSNCPY@ +GNULIB_WCSNLEN = @GNULIB_WCSNLEN@ GNULIB_WCSNRTOMBS = @GNULIB_WCSNRTOMBS@ +GNULIB_WCSPBRK = @GNULIB_WCSPBRK@ +GNULIB_WCSRCHR = @GNULIB_WCSRCHR@ GNULIB_WCSRTOMBS = @GNULIB_WCSRTOMBS@ +GNULIB_WCSSPN = @GNULIB_WCSSPN@ +GNULIB_WCSSTR = @GNULIB_WCSSTR@ +GNULIB_WCSTOK = @GNULIB_WCSTOK@ +GNULIB_WCSWIDTH = @GNULIB_WCSWIDTH@ +GNULIB_WCSXFRM = @GNULIB_WCSXFRM@ GNULIB_WCTOB = @GNULIB_WCTOB@ +GNULIB_WCTOMB = @GNULIB_WCTOMB@ +GNULIB_WCTRANS = @GNULIB_WCTRANS@ +GNULIB_WCTYPE = @GNULIB_WCTYPE@ GNULIB_WCWIDTH = @GNULIB_WCWIDTH@ +GNULIB_WMEMCHR = @GNULIB_WMEMCHR@ +GNULIB_WMEMCMP = @GNULIB_WMEMCMP@ +GNULIB_WMEMCPY = @GNULIB_WMEMCPY@ +GNULIB_WMEMMOVE = @GNULIB_WMEMMOVE@ +GNULIB_WMEMSET = @GNULIB_WMEMSET@ GNULIB_WRITE = @GNULIB_WRITE@ +GNULIB__EXIT = @GNULIB__EXIT@ GREP = @GREP@ +HAVE_ACOSF = @HAVE_ACOSF@ HAVE_ACOSL = @HAVE_ACOSL@ +HAVE_ASINF = @HAVE_ASINF@ HAVE_ASINL = @HAVE_ASINL@ +HAVE_ATAN2F = @HAVE_ATAN2F@ +HAVE_ATANF = @HAVE_ATANF@ HAVE_ATANL = @HAVE_ATANL@ HAVE_ATOLL = @HAVE_ATOLL@ HAVE_BTOWC = @HAVE_BTOWC@ -HAVE_CALLOC_POSIX = @HAVE_CALLOC_POSIX@ HAVE_CANONICALIZE_FILE_NAME = @HAVE_CANONICALIZE_FILE_NAME@ +HAVE_CBRT = @HAVE_CBRT@ +HAVE_CBRTF = @HAVE_CBRTF@ +HAVE_CBRTL = @HAVE_CBRTL@ HAVE_CHOWN = @HAVE_CHOWN@ +HAVE_COPYSIGN = @HAVE_COPYSIGN@ +HAVE_COPYSIGNL = @HAVE_COPYSIGNL@ +HAVE_COSF = @HAVE_COSF@ +HAVE_COSHF = @HAVE_COSHF@ HAVE_COSL = @HAVE_COSL@ HAVE_DECL_ACOSL = @HAVE_DECL_ACOSL@ HAVE_DECL_ASINL = @HAVE_DECL_ASINL@ HAVE_DECL_ATANL = @HAVE_DECL_ATANL@ +HAVE_DECL_CBRTF = @HAVE_DECL_CBRTF@ +HAVE_DECL_CBRTL = @HAVE_DECL_CBRTL@ HAVE_DECL_CEILF = @HAVE_DECL_CEILF@ HAVE_DECL_CEILL = @HAVE_DECL_CEILL@ +HAVE_DECL_COPYSIGNF = @HAVE_DECL_COPYSIGNF@ HAVE_DECL_COSL = @HAVE_DECL_COSL@ HAVE_DECL_ENVIRON = @HAVE_DECL_ENVIRON@ +HAVE_DECL_EXP2 = @HAVE_DECL_EXP2@ +HAVE_DECL_EXP2F = @HAVE_DECL_EXP2F@ +HAVE_DECL_EXP2L = @HAVE_DECL_EXP2L@ HAVE_DECL_EXPL = @HAVE_DECL_EXPL@ +HAVE_DECL_EXPM1L = @HAVE_DECL_EXPM1L@ +HAVE_DECL_FCHDIR = @HAVE_DECL_FCHDIR@ +HAVE_DECL_FDATASYNC = @HAVE_DECL_FDATASYNC@ HAVE_DECL_FLOORF = @HAVE_DECL_FLOORF@ HAVE_DECL_FLOORL = @HAVE_DECL_FLOORL@ +HAVE_DECL_FPURGE = @HAVE_DECL_FPURGE@ HAVE_DECL_FREXPL = @HAVE_DECL_FREXPL@ +HAVE_DECL_FSEEKO = @HAVE_DECL_FSEEKO@ +HAVE_DECL_FTELLO = @HAVE_DECL_FTELLO@ +HAVE_DECL_GETDELIM = @HAVE_DECL_GETDELIM@ +HAVE_DECL_GETDOMAINNAME = @HAVE_DECL_GETDOMAINNAME@ +HAVE_DECL_GETLINE = @HAVE_DECL_GETLINE@ HAVE_DECL_GETLOADAVG = @HAVE_DECL_GETLOADAVG@ HAVE_DECL_GETLOGIN_R = @HAVE_DECL_GETLOGIN_R@ HAVE_DECL_GETPAGESIZE = @HAVE_DECL_GETPAGESIZE@ HAVE_DECL_GETUSERSHELL = @HAVE_DECL_GETUSERSHELL@ +HAVE_DECL_IMAXABS = @HAVE_DECL_IMAXABS@ +HAVE_DECL_IMAXDIV = @HAVE_DECL_IMAXDIV@ HAVE_DECL_LDEXPL = @HAVE_DECL_LDEXPL@ +HAVE_DECL_LOG10L = @HAVE_DECL_LOG10L@ +HAVE_DECL_LOG2 = @HAVE_DECL_LOG2@ +HAVE_DECL_LOG2F = @HAVE_DECL_LOG2F@ +HAVE_DECL_LOG2L = @HAVE_DECL_LOG2L@ HAVE_DECL_LOGB = @HAVE_DECL_LOGB@ HAVE_DECL_LOGL = @HAVE_DECL_LOGL@ HAVE_DECL_MEMMEM = @HAVE_DECL_MEMMEM@ HAVE_DECL_MEMRCHR = @HAVE_DECL_MEMRCHR@ +HAVE_DECL_OBSTACK_PRINTF = @HAVE_DECL_OBSTACK_PRINTF@ +HAVE_DECL_REMAINDER = @HAVE_DECL_REMAINDER@ +HAVE_DECL_REMAINDERL = @HAVE_DECL_REMAINDERL@ +HAVE_DECL_RINTF = @HAVE_DECL_RINTF@ HAVE_DECL_ROUND = @HAVE_DECL_ROUND@ HAVE_DECL_ROUNDF = @HAVE_DECL_ROUNDF@ HAVE_DECL_ROUNDL = @HAVE_DECL_ROUNDL@ +HAVE_DECL_SETENV = @HAVE_DECL_SETENV@ +HAVE_DECL_SETHOSTNAME = @HAVE_DECL_SETHOSTNAME@ HAVE_DECL_SINL = @HAVE_DECL_SINL@ +HAVE_DECL_SNPRINTF = @HAVE_DECL_SNPRINTF@ HAVE_DECL_SQRTL = @HAVE_DECL_SQRTL@ HAVE_DECL_STRDUP = @HAVE_DECL_STRDUP@ +HAVE_DECL_STRERROR_R = @HAVE_DECL_STRERROR_R@ HAVE_DECL_STRNDUP = @HAVE_DECL_STRNDUP@ HAVE_DECL_STRNLEN = @HAVE_DECL_STRNLEN@ HAVE_DECL_STRSIGNAL = @HAVE_DECL_STRSIGNAL@ +HAVE_DECL_STRTOIMAX = @HAVE_DECL_STRTOIMAX@ 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_TRUNCF = @HAVE_DECL_TRUNCF@ HAVE_DECL_TRUNCL = @HAVE_DECL_TRUNCL@ +HAVE_DECL_TTYNAME_R = @HAVE_DECL_TTYNAME_R@ +HAVE_DECL_UNSETENV = @HAVE_DECL_UNSETENV@ +HAVE_DECL_VSNPRINTF = @HAVE_DECL_VSNPRINTF@ HAVE_DECL_WCTOB = @HAVE_DECL_WCTOB@ HAVE_DECL_WCWIDTH = @HAVE_DECL_WCWIDTH@ +HAVE_DPRINTF = @HAVE_DPRINTF@ HAVE_DUP2 = @HAVE_DUP2@ HAVE_DUP3 = @HAVE_DUP3@ HAVE_DUPLOCALE = @HAVE_DUPLOCALE@ HAVE_EUIDACCESS = @HAVE_EUIDACCESS@ +HAVE_EXPF = @HAVE_EXPF@ HAVE_EXPL = @HAVE_EXPL@ +HAVE_EXPM1 = @HAVE_EXPM1@ +HAVE_EXPM1F = @HAVE_EXPM1F@ +HAVE_FABSF = @HAVE_FABSF@ +HAVE_FABSL = @HAVE_FABSL@ HAVE_FACCESSAT = @HAVE_FACCESSAT@ HAVE_FCHDIR = @HAVE_FCHDIR@ HAVE_FCHOWNAT = @HAVE_FCHOWNAT@ +HAVE_FDATASYNC = @HAVE_FDATASYNC@ +HAVE_FEATURES_H = @HAVE_FEATURES_H@ +HAVE_FFSL = @HAVE_FFSL@ +HAVE_FFSLL = @HAVE_FFSLL@ +HAVE_FMA = @HAVE_FMA@ +HAVE_FMAF = @HAVE_FMAF@ +HAVE_FMAL = @HAVE_FMAL@ +HAVE_FMODF = @HAVE_FMODF@ +HAVE_FMODL = @HAVE_FMODL@ +HAVE_FREXPF = @HAVE_FREXPF@ +HAVE_FSEEKO = @HAVE_FSEEKO@ HAVE_FSYNC = @HAVE_FSYNC@ +HAVE_FTELLO = @HAVE_FTELLO@ HAVE_FTRUNCATE = @HAVE_FTRUNCATE@ -HAVE_GETDOMAINNAME = @HAVE_GETDOMAINNAME@ HAVE_GETDTABLESIZE = @HAVE_GETDTABLESIZE@ HAVE_GETGROUPS = @HAVE_GETGROUPS@ HAVE_GETHOSTNAME = @HAVE_GETHOSTNAME@ @@ -433,18 +802,38 @@ HAVE_GETPAGESIZE = @HAVE_GETPAGESIZE@ HAVE_GETSUBOPT = @HAVE_GETSUBOPT@ HAVE_GLOBAL_SYMBOL_PIPE = @HAVE_GLOBAL_SYMBOL_PIPE@ HAVE_GRANTPT = @HAVE_GRANTPT@ +HAVE_GROUP_MEMBER = @HAVE_GROUP_MEMBER@ +HAVE_HYPOTF = @HAVE_HYPOTF@ +HAVE_HYPOTL = @HAVE_HYPOTL@ +HAVE_ILOGB = @HAVE_ILOGB@ +HAVE_ILOGBF = @HAVE_ILOGBF@ +HAVE_ILOGBL = @HAVE_ILOGBL@ HAVE_INTTYPES_H = @HAVE_INTTYPES_H@ HAVE_ISNAND = @HAVE_ISNAND@ HAVE_ISNANF = @HAVE_ISNANF@ HAVE_ISNANL = @HAVE_ISNANL@ HAVE_ISWBLANK = @HAVE_ISWBLANK@ HAVE_ISWCNTRL = @HAVE_ISWCNTRL@ +HAVE_LANGINFO_CODESET = @HAVE_LANGINFO_CODESET@ +HAVE_LANGINFO_ERA = @HAVE_LANGINFO_ERA@ +HAVE_LANGINFO_H = @HAVE_LANGINFO_H@ +HAVE_LANGINFO_T_FMT_AMPM = @HAVE_LANGINFO_T_FMT_AMPM@ +HAVE_LANGINFO_YESEXPR = @HAVE_LANGINFO_YESEXPR@ HAVE_LCHOWN = @HAVE_LCHOWN@ +HAVE_LDEXPF = @HAVE_LDEXPF@ HAVE_LINK = @HAVE_LINK@ HAVE_LINKAT = @HAVE_LINKAT@ +HAVE_LOG10F = @HAVE_LOG10F@ +HAVE_LOG10L = @HAVE_LOG10L@ +HAVE_LOG1P = @HAVE_LOG1P@ +HAVE_LOG1PF = @HAVE_LOG1PF@ +HAVE_LOG1PL = @HAVE_LOG1PL@ +HAVE_LOGBF = @HAVE_LOGBF@ +HAVE_LOGBL = @HAVE_LOGBL@ +HAVE_LOGF = @HAVE_LOGF@ HAVE_LOGL = @HAVE_LOGL@ HAVE_LONG_LONG_INT = @HAVE_LONG_LONG_INT@ -HAVE_MALLOC_POSIX = @HAVE_MALLOC_POSIX@ +HAVE_MAX_ALIGN_T = @HAVE_MAX_ALIGN_T@ HAVE_MBRLEN = @HAVE_MBRLEN@ HAVE_MBRTOWC = @HAVE_MBRTOWC@ HAVE_MBSINIT = @HAVE_MBSINIT@ @@ -458,24 +847,46 @@ HAVE_MKOSTEMP = @HAVE_MKOSTEMP@ HAVE_MKOSTEMPS = @HAVE_MKOSTEMPS@ HAVE_MKSTEMP = @HAVE_MKSTEMP@ HAVE_MKSTEMPS = @HAVE_MKSTEMPS@ +HAVE_MODFF = @HAVE_MODFF@ +HAVE_MODFL = @HAVE_MODFL@ +HAVE_MSVC_INVALID_PARAMETER_HANDLER = @HAVE_MSVC_INVALID_PARAMETER_HANDLER@ +HAVE_NL_LANGINFO = @HAVE_NL_LANGINFO@ HAVE_OS_H = @HAVE_OS_H@ +HAVE_PCLOSE = @HAVE_PCLOSE@ +HAVE_PIPE = @HAVE_PIPE@ HAVE_PIPE2 = @HAVE_PIPE2@ +HAVE_POPEN = @HAVE_POPEN@ +HAVE_POSIX_OPENPT = @HAVE_POSIX_OPENPT@ +HAVE_POWF = @HAVE_POWF@ HAVE_PREAD = @HAVE_PREAD@ HAVE_PTSNAME = @HAVE_PTSNAME@ +HAVE_PTSNAME_R = @HAVE_PTSNAME_R@ +HAVE_PWRITE = @HAVE_PWRITE@ +HAVE_RANDOM = @HAVE_RANDOM@ HAVE_RANDOM_H = @HAVE_RANDOM_H@ HAVE_RANDOM_R = @HAVE_RANDOM_R@ HAVE_RAWMEMCHR = @HAVE_RAWMEMCHR@ HAVE_READLINK = @HAVE_READLINK@ HAVE_READLINKAT = @HAVE_READLINKAT@ -HAVE_REALLOC_POSIX = @HAVE_REALLOC_POSIX@ HAVE_REALPATH = @HAVE_REALPATH@ +HAVE_REMAINDER = @HAVE_REMAINDER@ +HAVE_REMAINDERF = @HAVE_REMAINDERF@ +HAVE_RENAMEAT = @HAVE_RENAMEAT@ +HAVE_RINT = @HAVE_RINT@ +HAVE_RINTL = @HAVE_RINTL@ HAVE_RPMATCH = @HAVE_RPMATCH@ +HAVE_SAME_LONG_DOUBLE_AS_DOUBLE = @HAVE_SAME_LONG_DOUBLE_AS_DOUBLE@ +HAVE_SECURE_GETENV = @HAVE_SECURE_GETENV@ HAVE_SETENV = @HAVE_SETENV@ +HAVE_SETHOSTNAME = @HAVE_SETHOSTNAME@ HAVE_SIGNED_SIG_ATOMIC_T = @HAVE_SIGNED_SIG_ATOMIC_T@ HAVE_SIGNED_WCHAR_T = @HAVE_SIGNED_WCHAR_T@ HAVE_SIGNED_WINT_T = @HAVE_SIGNED_WINT_T@ +HAVE_SINF = @HAVE_SINF@ +HAVE_SINHF = @HAVE_SINHF@ HAVE_SINL = @HAVE_SINL@ HAVE_SLEEP = @HAVE_SLEEP@ +HAVE_SQRTF = @HAVE_SQRTF@ HAVE_SQRTL = @HAVE_SQRTL@ HAVE_STDINT_H = @HAVE_STDINT_H@ HAVE_STPCPY = @HAVE_STPCPY@ @@ -496,24 +907,59 @@ HAVE_SYS_INTTYPES_H = @HAVE_SYS_INTTYPES_H@ HAVE_SYS_LOADAVG_H = @HAVE_SYS_LOADAVG_H@ HAVE_SYS_PARAM_H = @HAVE_SYS_PARAM_H@ HAVE_SYS_TYPES_H = @HAVE_SYS_TYPES_H@ +HAVE_TANF = @HAVE_TANF@ +HAVE_TANHF = @HAVE_TANHF@ HAVE_TANL = @HAVE_TANL@ -HAVE_TTYNAME_R = @HAVE_TTYNAME_R@ HAVE_UNISTD_H = @HAVE_UNISTD_H@ HAVE_UNLINKAT = @HAVE_UNLINKAT@ HAVE_UNLOCKPT = @HAVE_UNLOCKPT@ -HAVE_UNSETENV = @HAVE_UNSETENV@ HAVE_UNSIGNED_LONG_LONG_INT = @HAVE_UNSIGNED_LONG_LONG_INT@ HAVE_USLEEP = @HAVE_USLEEP@ +HAVE_VASPRINTF = @HAVE_VASPRINTF@ +HAVE_VDPRINTF = @HAVE_VDPRINTF@ HAVE_WCHAR_H = @HAVE_WCHAR_H@ HAVE_WCHAR_T = @HAVE_WCHAR_T@ +HAVE_WCPCPY = @HAVE_WCPCPY@ +HAVE_WCPNCPY = @HAVE_WCPNCPY@ HAVE_WCRTOMB = @HAVE_WCRTOMB@ +HAVE_WCSCASECMP = @HAVE_WCSCASECMP@ +HAVE_WCSCAT = @HAVE_WCSCAT@ +HAVE_WCSCHR = @HAVE_WCSCHR@ +HAVE_WCSCMP = @HAVE_WCSCMP@ +HAVE_WCSCOLL = @HAVE_WCSCOLL@ +HAVE_WCSCPY = @HAVE_WCSCPY@ +HAVE_WCSCSPN = @HAVE_WCSCSPN@ +HAVE_WCSDUP = @HAVE_WCSDUP@ +HAVE_WCSLEN = @HAVE_WCSLEN@ +HAVE_WCSNCASECMP = @HAVE_WCSNCASECMP@ +HAVE_WCSNCAT = @HAVE_WCSNCAT@ +HAVE_WCSNCMP = @HAVE_WCSNCMP@ +HAVE_WCSNCPY = @HAVE_WCSNCPY@ +HAVE_WCSNLEN = @HAVE_WCSNLEN@ HAVE_WCSNRTOMBS = @HAVE_WCSNRTOMBS@ +HAVE_WCSPBRK = @HAVE_WCSPBRK@ +HAVE_WCSRCHR = @HAVE_WCSRCHR@ HAVE_WCSRTOMBS = @HAVE_WCSRTOMBS@ +HAVE_WCSSPN = @HAVE_WCSSPN@ +HAVE_WCSSTR = @HAVE_WCSSTR@ +HAVE_WCSTOK = @HAVE_WCSTOK@ +HAVE_WCSWIDTH = @HAVE_WCSWIDTH@ +HAVE_WCSXFRM = @HAVE_WCSXFRM@ +HAVE_WCTRANS_T = @HAVE_WCTRANS_T@ HAVE_WCTYPE_H = @HAVE_WCTYPE_H@ +HAVE_WCTYPE_T = @HAVE_WCTYPE_T@ +HAVE_WINSOCK2_H = @HAVE_WINSOCK2_H@ HAVE_WINT_T = @HAVE_WINT_T@ +HAVE_WMEMCHR = @HAVE_WMEMCHR@ +HAVE_WMEMCMP = @HAVE_WMEMCMP@ +HAVE_WMEMCPY = @HAVE_WMEMCPY@ +HAVE_WMEMMOVE = @HAVE_WMEMMOVE@ +HAVE_WMEMSET = @HAVE_WMEMSET@ HAVE_XLOCALE_H = @HAVE_XLOCALE_H@ HAVE__BOOL = @HAVE__BOOL@ +HAVE__EXIT = @HAVE__EXIT@ HEXVERSION = @HEXVERSION@ +ICONV_CONST = @ICONV_CONST@ ICONV_H = @ICONV_H@ INCLUDE_NEXT = @INCLUDE_NEXT@ INCLUDE_NEXT_AS_FIRST_DIRECTIVE = @INCLUDE_NEXT_AS_FIRST_DIRECTIVE@ @@ -522,6 +968,8 @@ INSTALL_DATA = @INSTALL_DATA@ INSTALL_PROGRAM = @INSTALL_PROGRAM@ INSTALL_SCRIPT = @INSTALL_SCRIPT@ INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@ +INT32_MAX_LT_INTMAX_MAX = @INT32_MAX_LT_INTMAX_MAX@ +INT64_MAX_EQ_LONG_MAX = @INT64_MAX_EQ_LONG_MAX@ INTL_MACOSX_LIBS = @INTL_MACOSX_LIBS@ LD = @LD@ LDFLAGS = @LDFLAGS@ @@ -535,9 +983,22 @@ LIBS = @LIBS@ LIBTESTS_LIBDEPS = @LIBTESTS_LIBDEPS@ LIBTHREAD = @LIBTHREAD@ LIBTOOL = @LIBTOOL@ +LIBUNISTRING_UNICASE_H = @LIBUNISTRING_UNICASE_H@ +LIBUNISTRING_UNICONV_H = @LIBUNISTRING_UNICONV_H@ +LIBUNISTRING_UNICTYPE_H = @LIBUNISTRING_UNICTYPE_H@ +LIBUNISTRING_UNIGBRK_H = @LIBUNISTRING_UNIGBRK_H@ +LIBUNISTRING_UNILBRK_H = @LIBUNISTRING_UNILBRK_H@ +LIBUNISTRING_UNINAME_H = @LIBUNISTRING_UNINAME_H@ +LIBUNISTRING_UNINORM_H = @LIBUNISTRING_UNINORM_H@ +LIBUNISTRING_UNISTDIO_H = @LIBUNISTRING_UNISTDIO_H@ +LIBUNISTRING_UNISTR_H = @LIBUNISTRING_UNISTR_H@ +LIBUNISTRING_UNITYPES_H = @LIBUNISTRING_UNITYPES_H@ +LIBUNISTRING_UNIWBRK_H = @LIBUNISTRING_UNIWBRK_H@ +LIBUNISTRING_UNIWIDTH_H = @LIBUNISTRING_UNIWIDTH_H@ LIPO = @LIPO@ LN_S = @LN_S@ LOCALCHARSET_TESTS_ENVIRONMENT = @LOCALCHARSET_TESTS_ENVIRONMENT@ +LOCALE_AR = @LOCALE_AR@ LOCALE_FR = @LOCALE_FR@ LOCALE_FR_UTF8 = @LOCALE_FR_UTF8@ LOCALE_JA = @LOCALE_JA@ @@ -550,29 +1011,38 @@ LTLIBOBJS = @LTLIBOBJS@ LTLIBPTH = @LTLIBPTH@ LTLIBTHREAD = @LTLIBTHREAD@ MAKEINFO = env LANG= LC_MESSAGES= LC_ALL= LANGUAGE= @MAKEINFO@ +MANIFEST_TOOL = @MANIFEST_TOOL@ MKDIR_P = @MKDIR_P@ NAMESPACING = @NAMESPACING@ NEXT_AS_FIRST_DIRECTIVE_ERRNO_H = @NEXT_AS_FIRST_DIRECTIVE_ERRNO_H@ NEXT_AS_FIRST_DIRECTIVE_FLOAT_H = @NEXT_AS_FIRST_DIRECTIVE_FLOAT_H@ NEXT_AS_FIRST_DIRECTIVE_ICONV_H = @NEXT_AS_FIRST_DIRECTIVE_ICONV_H@ +NEXT_AS_FIRST_DIRECTIVE_INTTYPES_H = @NEXT_AS_FIRST_DIRECTIVE_INTTYPES_H@ +NEXT_AS_FIRST_DIRECTIVE_LANGINFO_H = @NEXT_AS_FIRST_DIRECTIVE_LANGINFO_H@ NEXT_AS_FIRST_DIRECTIVE_LOCALE_H = @NEXT_AS_FIRST_DIRECTIVE_LOCALE_H@ NEXT_AS_FIRST_DIRECTIVE_MATH_H = @NEXT_AS_FIRST_DIRECTIVE_MATH_H@ NEXT_AS_FIRST_DIRECTIVE_STDDEF_H = @NEXT_AS_FIRST_DIRECTIVE_STDDEF_H@ NEXT_AS_FIRST_DIRECTIVE_STDINT_H = @NEXT_AS_FIRST_DIRECTIVE_STDINT_H@ +NEXT_AS_FIRST_DIRECTIVE_STDIO_H = @NEXT_AS_FIRST_DIRECTIVE_STDIO_H@ NEXT_AS_FIRST_DIRECTIVE_STDLIB_H = @NEXT_AS_FIRST_DIRECTIVE_STDLIB_H@ NEXT_AS_FIRST_DIRECTIVE_STRING_H = @NEXT_AS_FIRST_DIRECTIVE_STRING_H@ +NEXT_AS_FIRST_DIRECTIVE_SYS_TYPES_H = @NEXT_AS_FIRST_DIRECTIVE_SYS_TYPES_H@ NEXT_AS_FIRST_DIRECTIVE_UNISTD_H = @NEXT_AS_FIRST_DIRECTIVE_UNISTD_H@ NEXT_AS_FIRST_DIRECTIVE_WCHAR_H = @NEXT_AS_FIRST_DIRECTIVE_WCHAR_H@ NEXT_AS_FIRST_DIRECTIVE_WCTYPE_H = @NEXT_AS_FIRST_DIRECTIVE_WCTYPE_H@ NEXT_ERRNO_H = @NEXT_ERRNO_H@ NEXT_FLOAT_H = @NEXT_FLOAT_H@ NEXT_ICONV_H = @NEXT_ICONV_H@ +NEXT_INTTYPES_H = @NEXT_INTTYPES_H@ +NEXT_LANGINFO_H = @NEXT_LANGINFO_H@ NEXT_LOCALE_H = @NEXT_LOCALE_H@ NEXT_MATH_H = @NEXT_MATH_H@ NEXT_STDDEF_H = @NEXT_STDDEF_H@ NEXT_STDINT_H = @NEXT_STDINT_H@ +NEXT_STDIO_H = @NEXT_STDIO_H@ NEXT_STDLIB_H = @NEXT_STDLIB_H@ NEXT_STRING_H = @NEXT_STRING_H@ +NEXT_SYS_TYPES_H = @NEXT_SYS_TYPES_H@ NEXT_UNISTD_H = @NEXT_UNISTD_H@ NEXT_WCHAR_H = @NEXT_WCHAR_H@ NEXT_WCTYPE_H = @NEXT_WCTYPE_H@ @@ -591,86 +1061,196 @@ PACKAGE_URL = @PACKAGE_URL@ PACKAGE_VERSION = @PACKAGE_VERSION@ PATH_SEPARATOR = @PATH_SEPARATOR@ PERL = @PERL@ +PRAGMA_COLUMNS = @PRAGMA_COLUMNS@ PRAGMA_SYSTEM_HEADER = @PRAGMA_SYSTEM_HEADER@ +PRIPTR_PREFIX = @PRIPTR_PREFIX@ +PRI_MACROS_BROKEN = @PRI_MACROS_BROKEN@ PTRDIFF_T_SUFFIX = @PTRDIFF_T_SUFFIX@ RANLIB = @RANLIB@ RC = @RC@ RELOCATABLE = @RELOCATABLE@ REPLACE_BTOWC = @REPLACE_BTOWC@ +REPLACE_CALLOC = @REPLACE_CALLOC@ REPLACE_CANONICALIZE_FILE_NAME = @REPLACE_CANONICALIZE_FILE_NAME@ +REPLACE_CBRTF = @REPLACE_CBRTF@ +REPLACE_CBRTL = @REPLACE_CBRTL@ +REPLACE_CEIL = @REPLACE_CEIL@ REPLACE_CEILF = @REPLACE_CEILF@ REPLACE_CEILL = @REPLACE_CEILL@ REPLACE_CHOWN = @REPLACE_CHOWN@ REPLACE_CLOSE = @REPLACE_CLOSE@ +REPLACE_DPRINTF = @REPLACE_DPRINTF@ REPLACE_DUP = @REPLACE_DUP@ REPLACE_DUP2 = @REPLACE_DUP2@ REPLACE_DUPLOCALE = @REPLACE_DUPLOCALE@ +REPLACE_EXP2 = @REPLACE_EXP2@ +REPLACE_EXP2L = @REPLACE_EXP2L@ +REPLACE_EXPM1 = @REPLACE_EXPM1@ +REPLACE_EXPM1F = @REPLACE_EXPM1F@ +REPLACE_FABSL = @REPLACE_FABSL@ REPLACE_FCHOWNAT = @REPLACE_FCHOWNAT@ +REPLACE_FCLOSE = @REPLACE_FCLOSE@ +REPLACE_FDOPEN = @REPLACE_FDOPEN@ +REPLACE_FFLUSH = @REPLACE_FFLUSH@ +REPLACE_FLOOR = @REPLACE_FLOOR@ REPLACE_FLOORF = @REPLACE_FLOORF@ REPLACE_FLOORL = @REPLACE_FLOORL@ +REPLACE_FMA = @REPLACE_FMA@ +REPLACE_FMAF = @REPLACE_FMAF@ +REPLACE_FMAL = @REPLACE_FMAL@ +REPLACE_FMOD = @REPLACE_FMOD@ +REPLACE_FMODF = @REPLACE_FMODF@ +REPLACE_FMODL = @REPLACE_FMODL@ +REPLACE_FOPEN = @REPLACE_FOPEN@ +REPLACE_FPRINTF = @REPLACE_FPRINTF@ +REPLACE_FPURGE = @REPLACE_FPURGE@ +REPLACE_FREOPEN = @REPLACE_FREOPEN@ REPLACE_FREXP = @REPLACE_FREXP@ +REPLACE_FREXPF = @REPLACE_FREXPF@ REPLACE_FREXPL = @REPLACE_FREXPL@ +REPLACE_FSEEK = @REPLACE_FSEEK@ +REPLACE_FSEEKO = @REPLACE_FSEEKO@ +REPLACE_FTELL = @REPLACE_FTELL@ +REPLACE_FTELLO = @REPLACE_FTELLO@ +REPLACE_FTRUNCATE = @REPLACE_FTRUNCATE@ REPLACE_GETCWD = @REPLACE_GETCWD@ +REPLACE_GETDELIM = @REPLACE_GETDELIM@ +REPLACE_GETDOMAINNAME = @REPLACE_GETDOMAINNAME@ +REPLACE_GETDTABLESIZE = @REPLACE_GETDTABLESIZE@ REPLACE_GETGROUPS = @REPLACE_GETGROUPS@ +REPLACE_GETLINE = @REPLACE_GETLINE@ +REPLACE_GETLOGIN_R = @REPLACE_GETLOGIN_R@ REPLACE_GETPAGESIZE = @REPLACE_GETPAGESIZE@ REPLACE_HUGE_VAL = @REPLACE_HUGE_VAL@ +REPLACE_HYPOT = @REPLACE_HYPOT@ +REPLACE_HYPOTF = @REPLACE_HYPOTF@ +REPLACE_HYPOTL = @REPLACE_HYPOTL@ REPLACE_ICONV = @REPLACE_ICONV@ REPLACE_ICONV_OPEN = @REPLACE_ICONV_OPEN@ REPLACE_ICONV_UTF = @REPLACE_ICONV_UTF@ +REPLACE_ILOGB = @REPLACE_ILOGB@ +REPLACE_ILOGBF = @REPLACE_ILOGBF@ +REPLACE_ISATTY = @REPLACE_ISATTY@ REPLACE_ISFINITE = @REPLACE_ISFINITE@ REPLACE_ISINF = @REPLACE_ISINF@ REPLACE_ISNAN = @REPLACE_ISNAN@ +REPLACE_ISWBLANK = @REPLACE_ISWBLANK@ REPLACE_ISWCNTRL = @REPLACE_ISWCNTRL@ +REPLACE_ITOLD = @REPLACE_ITOLD@ REPLACE_LCHOWN = @REPLACE_LCHOWN@ REPLACE_LDEXPL = @REPLACE_LDEXPL@ REPLACE_LINK = @REPLACE_LINK@ REPLACE_LINKAT = @REPLACE_LINKAT@ +REPLACE_LOCALECONV = @REPLACE_LOCALECONV@ +REPLACE_LOG = @REPLACE_LOG@ +REPLACE_LOG10 = @REPLACE_LOG10@ +REPLACE_LOG10F = @REPLACE_LOG10F@ +REPLACE_LOG10L = @REPLACE_LOG10L@ +REPLACE_LOG1P = @REPLACE_LOG1P@ +REPLACE_LOG1PF = @REPLACE_LOG1PF@ +REPLACE_LOG1PL = @REPLACE_LOG1PL@ +REPLACE_LOG2 = @REPLACE_LOG2@ +REPLACE_LOG2F = @REPLACE_LOG2F@ +REPLACE_LOG2L = @REPLACE_LOG2L@ +REPLACE_LOGB = @REPLACE_LOGB@ +REPLACE_LOGBF = @REPLACE_LOGBF@ +REPLACE_LOGBL = @REPLACE_LOGBL@ +REPLACE_LOGF = @REPLACE_LOGF@ +REPLACE_LOGL = @REPLACE_LOGL@ REPLACE_LSEEK = @REPLACE_LSEEK@ +REPLACE_MALLOC = @REPLACE_MALLOC@ REPLACE_MBRLEN = @REPLACE_MBRLEN@ REPLACE_MBRTOWC = @REPLACE_MBRTOWC@ REPLACE_MBSINIT = @REPLACE_MBSINIT@ REPLACE_MBSNRTOWCS = @REPLACE_MBSNRTOWCS@ REPLACE_MBSRTOWCS = @REPLACE_MBSRTOWCS@ REPLACE_MBSTATE_T = @REPLACE_MBSTATE_T@ +REPLACE_MBTOWC = @REPLACE_MBTOWC@ REPLACE_MEMCHR = @REPLACE_MEMCHR@ REPLACE_MEMMEM = @REPLACE_MEMMEM@ REPLACE_MKSTEMP = @REPLACE_MKSTEMP@ +REPLACE_MODF = @REPLACE_MODF@ +REPLACE_MODFF = @REPLACE_MODFF@ +REPLACE_MODFL = @REPLACE_MODFL@ REPLACE_NAN = @REPLACE_NAN@ +REPLACE_NL_LANGINFO = @REPLACE_NL_LANGINFO@ REPLACE_NULL = @REPLACE_NULL@ +REPLACE_OBSTACK_PRINTF = @REPLACE_OBSTACK_PRINTF@ +REPLACE_PERROR = @REPLACE_PERROR@ +REPLACE_POPEN = @REPLACE_POPEN@ REPLACE_PREAD = @REPLACE_PREAD@ +REPLACE_PRINTF = @REPLACE_PRINTF@ +REPLACE_PTSNAME = @REPLACE_PTSNAME@ +REPLACE_PTSNAME_R = @REPLACE_PTSNAME_R@ REPLACE_PUTENV = @REPLACE_PUTENV@ +REPLACE_PWRITE = @REPLACE_PWRITE@ +REPLACE_QSORT_R = @REPLACE_QSORT_R@ +REPLACE_RANDOM_R = @REPLACE_RANDOM_R@ +REPLACE_READ = @REPLACE_READ@ REPLACE_READLINK = @REPLACE_READLINK@ +REPLACE_READLINKAT = @REPLACE_READLINKAT@ +REPLACE_REALLOC = @REPLACE_REALLOC@ REPLACE_REALPATH = @REPLACE_REALPATH@ +REPLACE_REMAINDER = @REPLACE_REMAINDER@ +REPLACE_REMAINDERF = @REPLACE_REMAINDERF@ +REPLACE_REMAINDERL = @REPLACE_REMAINDERL@ +REPLACE_REMOVE = @REPLACE_REMOVE@ +REPLACE_RENAME = @REPLACE_RENAME@ +REPLACE_RENAMEAT = @REPLACE_RENAMEAT@ REPLACE_RMDIR = @REPLACE_RMDIR@ REPLACE_ROUND = @REPLACE_ROUND@ REPLACE_ROUNDF = @REPLACE_ROUNDF@ REPLACE_ROUNDL = @REPLACE_ROUNDL@ REPLACE_SETENV = @REPLACE_SETENV@ +REPLACE_SETLOCALE = @REPLACE_SETLOCALE@ REPLACE_SIGNBIT = @REPLACE_SIGNBIT@ REPLACE_SIGNBIT_USING_GCC = @REPLACE_SIGNBIT_USING_GCC@ REPLACE_SLEEP = @REPLACE_SLEEP@ +REPLACE_SNPRINTF = @REPLACE_SNPRINTF@ +REPLACE_SPRINTF = @REPLACE_SPRINTF@ +REPLACE_SQRTL = @REPLACE_SQRTL@ +REPLACE_STDIO_READ_FUNCS = @REPLACE_STDIO_READ_FUNCS@ +REPLACE_STDIO_WRITE_FUNCS = @REPLACE_STDIO_WRITE_FUNCS@ REPLACE_STPNCPY = @REPLACE_STPNCPY@ REPLACE_STRCASESTR = @REPLACE_STRCASESTR@ +REPLACE_STRCHRNUL = @REPLACE_STRCHRNUL@ REPLACE_STRDUP = @REPLACE_STRDUP@ REPLACE_STRERROR = @REPLACE_STRERROR@ +REPLACE_STRERROR_R = @REPLACE_STRERROR_R@ REPLACE_STRNCAT = @REPLACE_STRNCAT@ REPLACE_STRNDUP = @REPLACE_STRNDUP@ REPLACE_STRNLEN = @REPLACE_STRNLEN@ REPLACE_STRSIGNAL = @REPLACE_STRSIGNAL@ REPLACE_STRSTR = @REPLACE_STRSTR@ REPLACE_STRTOD = @REPLACE_STRTOD@ +REPLACE_STRTOIMAX = @REPLACE_STRTOIMAX@ REPLACE_STRTOK_R = @REPLACE_STRTOK_R@ +REPLACE_STRTOUMAX = @REPLACE_STRTOUMAX@ +REPLACE_STRUCT_LCONV = @REPLACE_STRUCT_LCONV@ REPLACE_SYMLINK = @REPLACE_SYMLINK@ +REPLACE_SYMLINKAT = @REPLACE_SYMLINKAT@ +REPLACE_TMPFILE = @REPLACE_TMPFILE@ +REPLACE_TOWLOWER = @REPLACE_TOWLOWER@ +REPLACE_TRUNC = @REPLACE_TRUNC@ +REPLACE_TRUNCF = @REPLACE_TRUNCF@ REPLACE_TRUNCL = @REPLACE_TRUNCL@ REPLACE_TTYNAME_R = @REPLACE_TTYNAME_R@ REPLACE_UNLINK = @REPLACE_UNLINK@ REPLACE_UNLINKAT = @REPLACE_UNLINKAT@ REPLACE_UNSETENV = @REPLACE_UNSETENV@ REPLACE_USLEEP = @REPLACE_USLEEP@ +REPLACE_VASPRINTF = @REPLACE_VASPRINTF@ +REPLACE_VDPRINTF = @REPLACE_VDPRINTF@ +REPLACE_VFPRINTF = @REPLACE_VFPRINTF@ +REPLACE_VPRINTF = @REPLACE_VPRINTF@ +REPLACE_VSNPRINTF = @REPLACE_VSNPRINTF@ +REPLACE_VSPRINTF = @REPLACE_VSPRINTF@ REPLACE_WCRTOMB = @REPLACE_WCRTOMB@ REPLACE_WCSNRTOMBS = @REPLACE_WCSNRTOMBS@ REPLACE_WCSRTOMBS = @REPLACE_WCSRTOMBS@ +REPLACE_WCSWIDTH = @REPLACE_WCSWIDTH@ REPLACE_WCTOB = @REPLACE_WCTOB@ +REPLACE_WCTOMB = @REPLACE_WCTOMB@ REPLACE_WCWIDTH = @REPLACE_WCWIDTH@ REPLACE_WRITE = @REPLACE_WRITE@ SED = @SED@ @@ -678,6 +1258,7 @@ SET_MAKE = @SET_MAKE@ SHELL = @SHELL@ SIG_ATOMIC_T_SUFFIX = @SIG_ATOMIC_T_SUFFIX@ SIZE_T_SUFFIX = @SIZE_T_SUFFIX@ +STDALIGN_H = @STDALIGN_H@ STDBOOL_H = @STDBOOL_H@ STDDEF_H = @STDDEF_H@ STDINT_H = @STDINT_H@ @@ -688,17 +1269,21 @@ STRIP = @STRIP@ # Override of automake's definition: #TEXI2DVI = @TEXI2DVI@ TEXI2DVI = @TEXI2DVI@ $(TEXINCLUDES) +UINT32_MAX_LT_UINTMAX_MAX = @UINT32_MAX_LT_UINTMAX_MAX@ +UINT64_MAX_EQ_ULONG_MAX = @UINT64_MAX_EQ_ULONG_MAX@ UNDEFINE_STRTOK_R = @UNDEFINE_STRTOK_R@ UNISTD_H_HAVE_WINSOCK2_H = @UNISTD_H_HAVE_WINSOCK2_H@ UNISTD_H_HAVE_WINSOCK2_H_AND_USE_SOCKETS = @UNISTD_H_HAVE_WINSOCK2_H_AND_USE_SOCKETS@ VERSION = @VERSION@ WCHAR_T_SUFFIX = @WCHAR_T_SUFFIX@ +WINDOWS_64_BIT_OFF_T = @WINDOWS_64_BIT_OFF_T@ WINT_T_SUFFIX = @WINT_T_SUFFIX@ YIELD_LIB = @YIELD_LIB@ abs_builddir = @abs_builddir@ abs_srcdir = @abs_srcdir@ abs_top_builddir = @abs_top_builddir@ abs_top_srcdir = @abs_top_srcdir@ +ac_ct_AR = @ac_ct_AR@ ac_ct_CC = @ac_ct_CC@ ac_ct_DUMPBIN = @ac_ct_DUMPBIN@ am__include = @am__include@ @@ -734,9 +1319,9 @@ infodir = @infodir@ install_sh = @install_sh@ libdir = @libdir@ libexecdir = @libexecdir@ +lispdir = @lispdir@ localedir = @localedir@ localstatedir = @localstatedir@ -lt_ECHO = @lt_ECHO@ mandir = @mandir@ mkdir_p = @mkdir_p@ oldincludedir = @oldincludedir@ @@ -744,6 +1329,7 @@ pdfdir = @pdfdir@ prefix = @prefix@ program_transform_name = @program_transform_name@ psdir = @psdir@ +runstatedir = @runstatedir@ sbindir = @sbindir@ sharedstatedir = @sharedstatedir@ srcdir = @srcdir@ @@ -766,8 +1352,8 @@ info_TEXINFOS = libunistring.texi # List of texinfo sources @included by libunistring.texi, excluding version.texi. libunistring_TEXINFOS = \ unitypes.texi unistr.texi uniconv.texi unistdio.texi uniname.texi \ - unictype.texi uniwidth.texi uniwbrk.texi unilbrk.texi uninorm.texi \ - unicase.texi uniregex.texi \ + unictype.texi uniwidth.texi unigbrk.texi uniwbrk.texi unilbrk.texi \ + uninorm.texi unicase.texi uniregex.texi \ gpl.texi lgpl.texi fdl.texi @@ -798,7 +1384,6 @@ $(srcdir)/Makefile.in: $(srcdir)/Makefile.am $(am__configure_deps) echo ' cd $(top_srcdir) && $(AUTOMAKE) --gnits doc/Makefile'; \ $(am__cd) $(top_srcdir) && \ $(AUTOMAKE) --gnits doc/Makefile -.PRECIOUS: Makefile Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status @case '$?' in \ *config.status*) \ @@ -824,7 +1409,7 @@ clean-libtool: -rm -rf .libs _libs .texi.info: - restore=: && backupdir="$(am__leading_dot)am$$$$" && \ + $(AM_V_MAKEINFO)restore=: && backupdir="$(am__leading_dot)am$$$$" && \ am__cwd=`pwd` && $(am__cd) $(srcdir) && \ rm -rf $$backupdir && mkdir $$backupdir && \ if ($(MAKEINFO) --version) >/dev/null 2>&1; then \ @@ -846,27 +1431,25 @@ clean-libtool: rm -rf $$backupdir; exit $$rc .texi.dvi: - TEXINPUTS="$(am__TEXINFO_TEX_DIR)$(PATH_SEPARATOR)$$TEXINPUTS" \ + $(AM_V_TEXI2DVI)TEXINPUTS="$(am__TEXINFO_TEX_DIR)$(PATH_SEPARATOR)$$TEXINPUTS" \ MAKEINFO='$(MAKEINFO) $(AM_MAKEINFOFLAGS) $(MAKEINFOFLAGS) -I $(srcdir)' \ - $(TEXI2DVI) $< + $(TEXI2DVI) $(AM_V_texinfo) --build-dir=$(@:.dvi=.t2d) -o $@ $(AM_V_texidevnull) \ + $< .texi.pdf: - TEXINPUTS="$(am__TEXINFO_TEX_DIR)$(PATH_SEPARATOR)$$TEXINPUTS" \ + $(AM_V_TEXI2PDF)TEXINPUTS="$(am__TEXINFO_TEX_DIR)$(PATH_SEPARATOR)$$TEXINPUTS" \ MAKEINFO='$(MAKEINFO) $(AM_MAKEINFOFLAGS) $(MAKEINFOFLAGS) -I $(srcdir)' \ - $(TEXI2PDF) $< + $(TEXI2PDF) $(AM_V_texinfo) --build-dir=$(@:.pdf=.t2p) -o $@ $(AM_V_texidevnull) \ + $< .texi.html: - rm -rf $(@:.html=.htp) - if $(MAKEINFOHTML) $(AM_MAKEINFOHTMLFLAGS) $(MAKEINFOFLAGS) -I $(srcdir) \ + $(AM_V_MAKEINFO)rm -rf $(@:.html=.htp) + $(AM_V_at)if $(MAKEINFOHTML) $(AM_MAKEINFOHTMLFLAGS) $(MAKEINFOFLAGS) -I $(srcdir) \ -o $(@:.html=.htp) $<; \ then \ - rm -rf $@; \ - if test ! -d $(@:.html=.htp) && test -d $(@:.html=); then \ - mv $(@:.html=) $@; else mv $(@:.html=.htp) $@; fi; \ + rm -rf $@ && mv $(@:.html=.htp) $@; \ else \ - if test ! -d $(@:.html=.htp) && test -d $(@:.html=); then \ - rm -rf $(@:.html=); else rm -Rf $(@:.html=.htp) $@; fi; \ - exit 1; \ + rm -rf $(@:.html=.htp); exit 1; \ fi $(srcdir)/libunistring.info: libunistring.texi $(srcdir)/version.texi $(libunistring_TEXINFOS) libunistring.dvi: libunistring.texi $(srcdir)/version.texi $(libunistring_TEXINFOS) @@ -874,13 +1457,13 @@ libunistring.pdf: libunistring.texi $(srcdir)/version.texi $(libunistring_TEXINF $(srcdir)/version.texi: $(srcdir)/stamp-vti mostlyclean-vti: - -rm -f vti.tmp + -rm -f vti.tmp* $(srcdir)/version.texi.tmp* maintainer-clean-vti: -rm -f $(srcdir)/stamp-vti $(srcdir)/version.texi .dvi.ps: - TEXINPUTS="$(am__TEXINFO_TEX_DIR)$(PATH_SEPARATOR)$$TEXINPUTS" \ - $(DVIPS) -o $@ $< + $(AM_V_DVIPS)TEXINPUTS="$(am__TEXINFO_TEX_DIR)$(PATH_SEPARATOR)$$TEXINPUTS" \ + $(DVIPS) $(AM_V_texinfo) -o $@ $< uninstall-dvi-am: @$(NORMAL_UNINSTALL) @@ -902,9 +1485,7 @@ uninstall-html-am: uninstall-info-am: @$(PRE_UNINSTALL) - @if test -d '$(DESTDIR)$(infodir)' && \ - (install-info --version && \ - install-info --version 2>&1 | sed 1q | grep -i -v debian) >/dev/null 2>&1; then \ + @if test -d '$(DESTDIR)$(infodir)' && $(am__can_run_installinfo); then \ list='$(INFO_DEPS)'; \ for file in $$list; do \ relfile=`echo "$$file" | sed 's|^.*/||'`; \ @@ -961,11 +1542,7 @@ dist-info: $(INFO_DEPS) done mostlyclean-aminfo: - -rm -rf libunistring.am libunistring.aux libunistring.cp libunistring.cps \ - libunistring.fn libunistring.ky libunistring.kys \ - libunistring.log libunistring.pg libunistring.pgs \ - libunistring.tmp libunistring.toc libunistring.tp \ - libunistring.vr libunistring.vrs + -rm -rf libunistring.t2d libunistring.t2p clean-aminfo: -test -z "libunistring.dvi libunistring.pdf libunistring.ps libunistring.html" \ @@ -977,11 +1554,11 @@ maintainer-clean-aminfo: echo " rm -f $$i $$i-[0-9] $$i-[0-9][0-9] $$i_i[0-9] $$i_i[0-9][0-9]"; \ rm -f $$i $$i-[0-9] $$i-[0-9][0-9] $$i_i[0-9] $$i_i[0-9][0-9]; \ done -tags: TAGS -TAGS: +tags TAGS: + +ctags CTAGS: -ctags: CTAGS -CTAGS: +cscope cscopelist: distdir: $(DISTFILES) @@ -1034,10 +1611,15 @@ install-am: all-am installcheck: installcheck-am install-strip: - $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ - install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \ - `test -z '$(STRIP)' || \ - echo "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'"` install + if test -z '$(STRIP)'; then \ + $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ + install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \ + install; \ + else \ + $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ + install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \ + "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'" install; \ + fi mostlyclean-generic: -test -z "$(MOSTLYCLEANFILES)" || rm -f $(MOSTLYCLEANFILES) @@ -1077,8 +1659,11 @@ install-dvi: install-dvi-am install-dvi-am: $(DVIS) @$(NORMAL_INSTALL) - test -z "$(dvidir)" || $(MKDIR_P) "$(DESTDIR)$(dvidir)" @list='$(DVIS)'; test -n "$(dvidir)" || list=; \ + if test -n "$$list"; then \ + echo " $(MKDIR_P) '$(DESTDIR)$(dvidir)'"; \ + $(MKDIR_P) "$(DESTDIR)$(dvidir)" || exit 1; \ + fi; \ for p in $$list; do \ if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \ echo "$$d$$p"; \ @@ -1091,18 +1676,22 @@ install-exec-am: install-html-am: $(HTMLS) @$(NORMAL_INSTALL) - test -z "$(htmldir)" || $(MKDIR_P) "$(DESTDIR)$(htmldir)" @list='$(HTMLS)'; list2=; test -n "$(htmldir)" || list=; \ + if test -n "$$list"; then \ + echo " $(MKDIR_P) '$(DESTDIR)$(htmldir)'"; \ + $(MKDIR_P) "$(DESTDIR)$(htmldir)" || exit 1; \ + fi; \ for p in $$list; do \ if test -f "$$p" || test -d "$$p"; then d=; else d="$(srcdir)/"; fi; \ $(am__strip_dir) \ - if test -d "$$d$$p"; then \ + d2=$$d$$p; \ + if test -d "$$d2"; then \ echo " $(MKDIR_P) '$(DESTDIR)$(htmldir)/$$f'"; \ $(MKDIR_P) "$(DESTDIR)$(htmldir)/$$f" || exit 1; \ - echo " $(INSTALL_DATA) '$$d$$p'/* '$(DESTDIR)$(htmldir)/$$f'"; \ - $(INSTALL_DATA) "$$d$$p"/* "$(DESTDIR)$(htmldir)/$$f" || exit $$?; \ + echo " $(INSTALL_DATA) '$$d2'/* '$(DESTDIR)$(htmldir)/$$f'"; \ + $(INSTALL_DATA) "$$d2"/* "$(DESTDIR)$(htmldir)/$$f" || exit $$?; \ else \ - list2="$$list2 $$d$$p"; \ + list2="$$list2 $$d2"; \ fi; \ done; \ test -z "$$list2" || { echo "$$list2" | $(am__base_list) | \ @@ -1114,9 +1703,12 @@ install-info: install-info-am install-info-am: $(INFO_DEPS) @$(NORMAL_INSTALL) - test -z "$(infodir)" || $(MKDIR_P) "$(DESTDIR)$(infodir)" @srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`; \ list='$(INFO_DEPS)'; test -n "$(infodir)" || list=; \ + if test -n "$$list"; then \ + echo " $(MKDIR_P) '$(DESTDIR)$(infodir)'"; \ + $(MKDIR_P) "$(DESTDIR)$(infodir)" || exit 1; \ + fi; \ for file in $$list; do \ case $$file in \ $(srcdir)/*) file=`echo "$$file" | sed "s|^$$srcdirstrip/||"`;; \ @@ -1134,8 +1726,7 @@ install-info-am: $(INFO_DEPS) echo " $(INSTALL_DATA) $$files '$(DESTDIR)$(infodir)'"; \ $(INSTALL_DATA) $$files "$(DESTDIR)$(infodir)" || exit $$?; done @$(POST_INSTALL) - @if (install-info --version && \ - install-info --version 2>&1 | sed 1q | grep -i -v debian) >/dev/null 2>&1; then \ + @if $(am__can_run_installinfo); then \ list='$(INFO_DEPS)'; test -n "$(infodir)" || list=; \ for file in $$list; do \ relfile=`echo "$$file" | sed 's|^.*/||'`; \ @@ -1149,8 +1740,11 @@ install-pdf: install-pdf-am install-pdf-am: $(PDFS) @$(NORMAL_INSTALL) - test -z "$(pdfdir)" || $(MKDIR_P) "$(DESTDIR)$(pdfdir)" @list='$(PDFS)'; test -n "$(pdfdir)" || list=; \ + if test -n "$$list"; then \ + echo " $(MKDIR_P) '$(DESTDIR)$(pdfdir)'"; \ + $(MKDIR_P) "$(DESTDIR)$(pdfdir)" || exit 1; \ + fi; \ for p in $$list; do \ if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \ echo "$$d$$p"; \ @@ -1162,8 +1756,11 @@ install-ps: install-ps-am install-ps-am: $(PSS) @$(NORMAL_INSTALL) - test -z "$(psdir)" || $(MKDIR_P) "$(DESTDIR)$(psdir)" @list='$(PSS)'; test -n "$(psdir)" || list=; \ + if test -n "$$list"; then \ + echo " $(MKDIR_P) '$(DESTDIR)$(psdir)'"; \ + $(MKDIR_P) "$(DESTDIR)$(psdir)" || exit 1; \ + fi; \ for p in $$list; do \ if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \ echo "$$d$$p"; \ @@ -1197,21 +1794,24 @@ uninstall-am: uninstall-dvi-am uninstall-html-am uninstall-info-am \ .MAKE: install-am install-strip .PHONY: all all-am all-local check check-am clean clean-aminfo \ - clean-generic clean-libtool dist-hook dist-info distclean \ - distclean-generic distclean-libtool distdir dvi dvi-am html \ - html-am html-local info info-am install install-am \ - install-data install-data-am install-data-local install-dvi \ - install-dvi-am install-exec install-exec-am install-html \ - install-html-am install-info install-info-am install-man \ - install-pdf install-pdf-am install-ps install-ps-am \ - install-strip installcheck installcheck-am installdirs \ - installdirs-local maintainer-clean maintainer-clean-aminfo \ - maintainer-clean-generic maintainer-clean-vti mostlyclean \ - mostlyclean-aminfo mostlyclean-generic mostlyclean-libtool \ - mostlyclean-vti pdf pdf-am ps ps-am uninstall uninstall-am \ + clean-generic clean-libtool cscopelist-am ctags-am dist-hook \ + dist-info distclean distclean-generic distclean-libtool \ + distdir dvi dvi-am html html-am html-local info info-am \ + install install-am install-data install-data-am \ + install-data-local install-dvi install-dvi-am install-exec \ + install-exec-am install-html install-html-am install-info \ + install-info-am install-man install-pdf install-pdf-am \ + install-ps install-ps-am install-strip installcheck \ + installcheck-am installdirs installdirs-local maintainer-clean \ + maintainer-clean-aminfo maintainer-clean-generic \ + maintainer-clean-vti mostlyclean mostlyclean-aminfo \ + mostlyclean-generic mostlyclean-libtool mostlyclean-vti pdf \ + pdf-am ps ps-am tags-am uninstall uninstall-am \ uninstall-dvi-am uninstall-html-am uninstall-info-am \ uninstall-local uninstall-pdf-am uninstall-ps-am +.PRECIOUS: Makefile + # The dependencies of stamp-vti generated by automake are incomplete. # So we have to duplicate the entire rule which would otherwise be generated @@ -1253,7 +1853,7 @@ dist-html: dist-html-split # The install-dvi target is already defined by automake. installdirs-dvi: - $(mkdir_p) $(DESTDIR)$(dvidir) + $(MKDIR_P) $(DESTDIR)$(dvidir) uninstall-dvi: $(RM) $(DESTDIR)$(dvidir)/libunistring.dvi @@ -1264,7 +1864,7 @@ libunistring.ps: libunistring.dvi # The install-ps target is already defined by automake. installdirs-ps: - $(mkdir_p) $(DESTDIR)$(psdir) + $(MKDIR_P) $(DESTDIR)$(psdir) uninstall-ps: $(RM) $(DESTDIR)$(psdir)/libunistring.ps @@ -1272,7 +1872,7 @@ uninstall-ps: # The install-pdf target is already defined by automake. installdirs-pdf: - $(mkdir_p) $(DESTDIR)$(pdfdir) + $(MKDIR_P) $(DESTDIR)$(pdfdir) uninstall-pdf: $(RM) $(DESTDIR)$(pdfdir)/libunistring.pdf @@ -1298,17 +1898,17 @@ libunistring_toc.html: libunistring.texi version.texi $(libunistring_TEXINFOS) } install-html-monolithic: libunistring.html - $(mkdir_p) $(DESTDIR)$(htmldir) + $(MKDIR_P) $(DESTDIR)$(htmldir) $(INSTALL_DATA) `if test -f libunistring.html; then echo .; else echo $(srcdir); fi`/libunistring.html $(DESTDIR)$(htmldir)/libunistring.html install-html-split: libunistring_toc.html - $(mkdir_p) $(DESTDIR)$(htmldir) + $(MKDIR_P) $(DESTDIR)$(htmldir) for file in `if test -f libunistring_toc.html; then echo .; else echo $(srcdir); fi`/libunistring_*.html; do \ $(INSTALL_DATA) $$file $(DESTDIR)$(htmldir)/`basename $$file`; \ done installdirs-html: - $(mkdir_p) $(DESTDIR)$(htmldir) + $(MKDIR_P) $(DESTDIR)$(htmldir) uninstall-html-monolithic: $(RM) $(DESTDIR)$(htmldir)/libunistring.html @@ -1317,14 +1917,14 @@ uninstall-html-split: $(RM) $(DESTDIR)$(htmldir)/libunistring_*.html dist-html-monolithic: - $(mkdir_p) $(distdir)/ + $(MKDIR_P) $(distdir)/ file=libunistring.html; \ if test -f $$file; then d=.; else d=$(srcdir); fi; \ cp -p $$d/$$file $(distdir)/$$file || exit 1 # We would like to put libunistring_*.html into EXTRA_DIST, but it doesn't work. dist-html-split: libunistring_toc.html - $(mkdir_p) $(distdir)/ + $(MKDIR_P) $(distdir)/ file=libunistring_toc.html; \ if test -f $$file; then d=.; else d=$(srcdir); fi; \ for file in `cd $$d && echo libunistring_*.html`; do \ diff --git a/doc/libunistring.info b/doc/libunistring.info index 749dd9b3..e981a3e1 100644 --- a/doc/libunistring.info +++ b/doc/libunistring.info @@ -1,4 +1,4 @@ -This is libunistring.info, produced by makeinfo version 4.13 from +This is libunistring.info, produced by makeinfo version 5.2 from libunistring.texi. INFO-DIR-SECTION Software development @@ -25,6 +25,7 @@ GNU libunistring * uniname.h:: Names of Unicode characters * unictype.h:: Unicode character classification and properties * uniwidth.h:: Display width +* unigbrk.h:: Grapheme cluster breaking * uniwbrk.h:: Word breaks in strings * unilbrk.h:: Line breaking * uninorm.h:: Normalization forms @@ -36,7 +37,7 @@ GNU libunistring * Index:: General Index - --- The Detailed Node Listing --- + — The Detailed Node Listing — Introduction @@ -44,8 +45,8 @@ Introduction * Unicode and i18n:: Unicode and internationalization * 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 +* 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 @@ -60,11 +61,12 @@ unictype.h * General category:: * Canonical combining class:: -* Bidirectional category:: +* Bidi class:: * Decimal digit value:: * Digit value:: * Numeric value:: * Mirrored character:: +* Arabic shaping:: * Properties:: * Scripts:: * Blocks:: @@ -81,6 +83,11 @@ Properties * Properties as objects:: * Properties as functions:: +unigbrk.h + +* Grapheme cluster breaks in a string:: +* Grapheme cluster break property:: + uniwbrk.h * Word breaks in a string:: @@ -116,6 +123,7 @@ Licenses * GNU LGPL:: GNU Lesser General Public License * GNU FDL:: GNU Free Documentation License + File: libunistring.info, Node: Introduction, Next: Conventions, Prev: Top, Up: Top @@ -127,52 +135,44 @@ for manipulating C strings according to the Unicode standard. It consists of the following parts: -`<unistr.h>' +‘<unistr.h>’ elementary string functions - -`<uniconv.h>' +‘<uniconv.h>’ conversion from/to legacy encodings - -`<unistdio.h>' +‘<unistdio.h>’ formatted output to strings - -`<uniname.h>' +‘<uniname.h>’ character names - -`<unictype.h>' +‘<unictype.h>’ character classification and properties - -`<uniwidth.h>' +‘<uniwidth.h>’ string width when using nonproportional fonts - -`<uniwbrk.h>' +‘<unigbrk.h>’ + grapheme cluster breaks +‘<uniwbrk.h>’ word breaks - -`<unilbrk.h>' +‘<unilbrk.h>’ line breaking algorithm - -`<uninorm.h>' +‘<uninorm.h>’ normalization (composition and decomposition) - -`<unicase.h>' +‘<unicase.h>’ case folding - -`<uniregex.h>' +‘<uniregex.h>’ regular expressions (not yet implemented) libunistring is for you if your application involves non-trivial text processing, such as upper/lower case conversions, line breaking, operations on words, or more advanced analysis of text. Text provided -by the user can, in general, contain characters of all kinds of -scripts. The text processing functions provided by this library handle -all scripts and all languages. +by the user can, 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 `<ctype.h>', `<wctype.h>' functions and the text it operates on is +POSIX ‘<ctype.h>’, ‘<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. + libunistring is also for you if your application uses Unicode strings +as internal in-memory representation. * Menu: @@ -180,8 +180,8 @@ strings as internal in-memory representation. * Unicode and i18n:: Unicode and internationalization * 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 +* 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? @@ -192,19 +192,17 @@ File: libunistring.info, Node: Unicode, Next: Unicode and i18n, Up: Introduct Unicode is a standardized repertoire of characters that contains characters from all scripts of the world, from Latin letters to Chinese -ideographs and Babylonian cuneiform glyphs. It also specifies how -these characters are to be rendered on a screen or on paper, and how -common text processing (word selection, line breaking, uppercasing of -page titles etc.) is supposed to behave on Unicode text. +ideographs and Babylonian cuneiform glyphs. It also specifies how these +characters are to be rendered on a screen or on paper, and how common +text processing (word selection, line breaking, uppercasing of page +titles etc.) is supposed to behave on Unicode text. Unicode also specifies three ways of storing sequences of Unicode -characters in a computer whose basic unit of data is an 8-bit byte: +characters in a computer whose basic unit of data is an 8-bit byte: UTF-8 Every character is represented as 1 to 4 bytes. - UTF-16 Every character is represented as 1 to 2 units of 16 bits. - UTF-32, a.k.a. UCS-4 Every character is represented as 1 unit of 32 bits. @@ -222,14 +220,11 @@ in the same document. Due to the many encodings for Japanese, even the processing of pure Japanese text was error prone. References: - * The Unicode standard: `http://www.unicode.org/' - - * Definition of UTF-8: `http://www.rfc-editor.org/rfc/rfc3629.txt' - - * Definition of UTF-16: `http://www.rfc-editor.org/rfc/rfc2781.txt' - - * Markus Kuhn's UTF-8 and Unicode FAQ: - `http://www.cl.cam.ac.uk/~mgk25/unicode.html' + • The Unicode standard: <http://www.unicode.org/> + • Definition of UTF-8: <http://www.rfc-editor.org/rfc/rfc3629.txt> + • Definition of UTF-16: <http://www.rfc-editor.org/rfc/rfc2781.txt> + • Markus Kuhn’s UTF-8 and Unicode FAQ: + <http://www.cl.cam.ac.uk/~mgk25/unicode.html> File: libunistring.info, Node: Unicode and i18n, Next: Locale encodings, Prev: Unicode, Up: Introduction @@ -238,14 +233,14 @@ File: libunistring.info, Node: Unicode and i18n, Next: Locale encodings, Prev ==================================== Internationalization is the process of changing the source code of a -program so that it can meet the expectations of users in any culture, -if culture specific data (translations, images etc.) are provided. - - Use of Unicode is not strictly required for internationalization, -but it makes internationalization much easier, because operations that -need to look at specific characters (like hyphenation, spell checking, -or the automatic conversion of double-quotes to opening and closing -double-quote characters) don't need to consider multiple possible +program so that it can meet the expectations of users in any culture, if +culture specific data (translations, images etc.) are provided. + + Use of Unicode is not strictly required for internationalization, but +it makes internationalization much easier, because operations that need +to look at specific characters (like hyphenation, spell checking, or the +automatic conversion of double-quotes to opening and closing +double-quote characters) don’t need to consider multiple possible encodings of the text. Use of Unicode also enables multilingualization: the ability of @@ -254,16 +249,14 @@ in the same line of text. But use of Unicode is not everything. Internationalization usually consists of three 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 + • 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 what GNU gettext is about. - - * Use of locale specific conventions for date and time formats, for + • 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. + adequately with the POSIX APIs and the implementation of locales in + the GNU C library. File: libunistring.info, Node: Locale encodings, Next: In-memory representation, Prev: Unicode and i18n, Up: Introduction @@ -271,32 +264,27 @@ File: libunistring.info, Node: Locale encodings, Next: In-memory representatio 1.3 Locale encodings ==================== - A locale is a set of cultural conventions. According to POSIX, for -a program, at any moment, there is one locale being designated as the -"current locale". (Actually, POSIX supports also one locale per -thread, but this feature is not yet universally implemented and not -widely used.) The locale is partitioned into several aspects, called -the "categories" of the locale. The main various aspects are: - * The character encoding and the character properties. This is the - `LC_CTYPE' category. - - * The sorting rules for text. This is the `LC_COLLATE' category. - - * The language specific translations of messages. This is the - `LC_MESSAGES' category. - - * The formatting rules for numbers, such as the decimal separator. - This is the `LC_NUMERIC' category. - - * The formatting rules for amounts of money. This is the - `LC_MONETARY' category. - - * The formatting of date and time. This is the `LC_TIME' category. - - In particular, the `LC_CTYPE' category of the current locale -determines the character encoding. This is the encoding of `char *' -strings. We also call it the "locale encoding". GNU libunistring has -a function, `locale_charset', that returns a standardized (platform + A locale is a set of cultural conventions. According to POSIX, for a +program, at any moment, there is one locale being designated as the +“current locale”. (Actually, POSIX supports also one locale per thread, +but this feature is not yet universally implemented and not widely +used.) The locale is partitioned into several aspects, called the +“categories” of the locale. The main various aspects are: + • The character encoding and the character properties. This is the + ‘LC_CTYPE’ category. + • The sorting rules for text. This is the ‘LC_COLLATE’ category. + • The language specific translations of messages. This is the + ‘LC_MESSAGES’ category. + • The formatting rules for numbers, such as the decimal separator. + This is the ‘LC_NUMERIC’ category. + • The formatting rules for amounts of money. This is the + ‘LC_MONETARY’ category. + • The formatting of date and time. This is the ‘LC_TIME’ category. + + In particular, the ‘LC_CTYPE’ category of the current locale +determines the character encoding. This is the encoding of ‘char *’ +strings. We also call it the “locale encoding”. GNU libunistring has a +function, ‘locale_charset’, that returns a standardized (platform independent) name for this encoding. All locale encodings used on glibc systems are essentially ASCII @@ -305,13 +293,13 @@ as a single byte, in that encoding as in ASCII. Among the possible locale encodings are UTF-8 and GB18030. Both allow to represent any Unicode character as a sequence of bytes. UTF-8 -is used in most of the world, whereas GB18030 is used in the People's +is used in most of the world, whereas GB18030 is used in the People’s Republic of China, because it is backward compatible with the GB2312 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. + 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. UTF-16 and UTF-32 are not used as locale encodings, because they are not ASCII compatible. @@ -324,184 +312,162 @@ File: libunistring.info, Node: In-memory representation, Next: char * strings, There are three ways of representing strings in memory of a running program. - * As `char *' strings. Such strings are represented in locale + • As ‘char *’ strings. Such strings are represented in locale encoding. This approach is employed when not much text processing is done by the program. When some Unicode aware processing is to be done, a string is converted to Unicode on the fly and back to locale encoding afterwards. - - * As UTF-8 or UTF-16 or UTF-32 strings. This implies that - conversion from locale encoding to Unicode is performed on input, - and in the opposite direction on output. This approach is - employed when the program does a significant amount of text - processing, or when the program has multiple threads operating on - the same data but in different locales. - - * As `wchar_t *', a.k.a. "wide strings". This approach is misguided, - see *note The wchar_t mess::. + • As UTF-8 or UTF-16 or UTF-32 strings. This implies that conversion + from locale encoding to Unicode is performed on input, and in the + opposite direction on output. This approach is employed when the + program does a significant amount of text processing, or when the + program has multiple threads operating on the same data but in + different locales. + • As ‘wchar_t *’, a.k.a. “wide strings”. This approach is + misguided, see *note The wchar_t mess::. File: libunistring.info, Node: char * strings, Next: The wchar_t mess, Prev: In-memory representation, Up: Introduction -1.5 `char *' strings +1.5 ‘char *’ strings ==================== The classical C strings, with its C library support standardized by ISO C and POSIX, can be used in internationalized programs with some precautions. The problem with this API is that many of the C library -functions for strings don't work correctly on strings in locale +functions for strings don’t work correctly on strings in locale encodings, leading to bugs that only people in some cultures of the world will experience. The first problem with the C library API is the support of multibyte locales. According to the locale encoding, in general, every character -is represented by one or more bytes (up to 4 bytes in practice -- but -use `MB_LEN_MAX' instead of the number 4 in the code). When every -character is represented by only 1 byte, we speak of an "unibyte -locale", otherwise of a "multibyte locale". It is important to realize -that the majority of Unix installations nowadays use UTF-8 or GB18030 -as locale encoding; therefore, the majority of users are using -multibyte locales. +is represented by one or more bytes (up to 4 bytes in practice — but use +‘MB_LEN_MAX’ instead of the number 4 in the code). When every character +is represented by only 1 byte, we speak of an “unibyte locale”, +otherwise of a “multibyte locale”. It is important to realize that the +majority of Unix installations nowadays use UTF-8 or GB18030 as locale +encoding; therefore, the majority of users are using multibyte locales. - The important fact to remember is: _A `char' is a byte, not a -character._ + The important fact to remember is: + _A ‘char’ is a byte, not a character._ As a consequence: - * The `<ctype.h>' API is useless in this context; it does not work in + • The ‘<ctype.h>’ API is useless in this context; it does not work in multibyte locales. - - * The `strlen' function does not return the number of characters in - a string. Nor does it return the number of screen columns occupied + • The ‘strlen’ 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 _bytes_ occupied by a string. - - * Truncating a string, for example, with `strncpy', can have the + • Truncating a string, for example, with ‘strncpy’, 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. - - * `strchr' and `strrchr' do not work with multibyte strings if the + • ‘strchr’ and ‘strrchr’ do not work with multibyte strings if the locale encoding is GB18030 and the character to be searched is a digit. - - * `strstr' does not work with multibyte strings if the locale + • ‘strstr’ does not work with multibyte strings if the locale encoding is different from UTF-8. - - * `strcspn', `strpbrk', `strspn' cannot work correctly in multibyte + • ‘strcspn’, ‘strpbrk’, ‘strspn’ 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. - - * `strsep' and `strtok_r' do not work with multibyte strings unless + • ‘strsep’ and ‘strtok_r’ do not work with multibyte strings unless all of the delimiter characters are ASCII characters < 0x30. - - * The `strcasecmp', `strncasecmp', and `strcasestr' functions do not + • The ‘strcasecmp’, ‘strncasecmp’, and ‘strcasestr’ functions do not work with multibyte strings. The workarounds can be found in GNU gnulib -`http://www.gnu.org/software/gnulib/'. - * gnulib has modules `mbchar', `mbiter', `mbuiter' that represent - multibyte characters and allow to iterate across a multibyte - string with the same ease as through a unibyte string. - - * gnulib has functions `mbslen' and `mbswidth' that can be used - instead of `strlen' when the number of characters or the number of +<http://www.gnu.org/software/gnulib/>. + • gnulib has modules ‘mbchar’, ‘mbiter’, ‘mbuiter’ that represent + multibyte characters and allow to iterate across a multibyte string + with the same ease as through a unibyte string. + • gnulib has functions ‘mbslen’ and ‘mbswidth’ that can be used + instead of ‘strlen’ when the number of characters or the number of screen columns of a string is requested. - - * gnulib has functions `mbschr' and `mbsrrchr' that are like - `strchr' and `strrchr', but work in multibyte locales. - - * gnulib has a function `mbsstr', like `strstr', but works in + • gnulib has functions ‘mbschr’ and ‘mbsrrchr’ that are like ‘strchr’ + and ‘strrchr’, but work in multibyte locales. + • gnulib has a function ‘mbsstr’, like ‘strstr’, but works in multibyte locales. - - * gnulib has functions `mbscspn', `mbspbrk', `mbsspn' that are like - `strcspn', `strpbrk', `strspn', but work in multibyte locales. - - * gnulib has functions `mbssep' and `mbstok_r' that are like - `strsep' and `strtok_r' but work in multibyte locales. - - * gnulib has functions `mbscasecmp', `mbsncasecmp', `mbspcasecmp', - and `mbscasestr' that are like `strcasecmp', `strncasecmp', and - `strcasestr', but work in multibyte locales. Still, the function - `ulc_casecmp' is preferable to these functions; see below. + • gnulib has functions ‘mbscspn’, ‘mbspbrk’, ‘mbsspn’ that are like + ‘strcspn’, ‘strpbrk’, ‘strspn’, but work in multibyte locales. + • gnulib has functions ‘mbssep’ and ‘mbstok_r’ that are like ‘strsep’ + and ‘strtok_r’ but work in multibyte locales. + • gnulib has functions ‘mbscasecmp’, ‘mbsncasecmp’, ‘mbspcasecmp’, + and ‘mbscasestr’ that are like ‘strcasecmp’, ‘strncasecmp’, and + ‘strcasestr’, but work in multibyte locales. Still, the function + ‘ulc_casecmp’ is preferable to these functions; see below. The second problem with the C library API is that it has some assumptions built-in that are not valid in some languages: - * It assumes that there are only two forms of every character: + • It assumes that there are only two forms of every character: uppercase and lowercase. This is not true for Croatian, where the character LETTER DZ WITH CARON comes in three forms: LATIN CAPITAL - LETTER DZ WITH CARON (DZ), LATIN CAPITAL LETTER D WITH SMALL - LETTER Z WITH CARON (Dz), LATIN SMALL LETTER DZ WITH CARON (dz). - - * It assumes that uppercasing of 1 character leads to 1 character. + LETTER DZ WITH CARON (DZ), LATIN CAPITAL LETTER D WITH SMALL LETTER + Z WITH CARON (Dz), LATIN SMALL LETTER DZ WITH CARON (dz). + • It assumes that uppercasing of 1 character leads to 1 character. This is not true for German, where the LATIN SMALL LETTER SHARP S, - when uppercased, becomes `SS'. - - * It assumes that there is 1:1 mapping between uppercase and + when uppercased, becomes ‘SS’. + • It assumes that there is 1:1 mapping between uppercase and lowercase forms. This is not true for the Greek sigma: GREEK CAPITAL LETTER SIGMA is the uppercase of both GREEK SMALL LETTER SIGMA and GREEK SMALL LETTER FINAL SIGMA. - - * It assumes that the upper/lowercase mappings are position + • It assumes that the upper/lowercase mappings are position independent. This is not true for the Greek sigma and the Lithuanian i. The correct way to deal with this problem is 1. to provide functions for titlecasing, as well as for upper- and lowercasing, - 2. to view case transformations as functions that operates on strings, rather than on characters. This is implemented in this library, through the functions declared -in `<unicase.h>', see *note unicase.h::. +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 +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>'. + • 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 + • 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 + 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 + • 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. + 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 @@ -509,27 +475,24 @@ File: libunistring.info, Node: Unicode strings, Prev: The wchar_t mess, Up: I 1.7 Unicode strings =================== - libunistring supports Unicode strings in three representations: - * UTF-8 strings, through the type `uint8_t *'. The units are bytes - (`uint8_t'). - - * UTF-16 strings, through the type `uint16_t *', The units are - 16-bit memory words (`uint16_t'). - - * UTF-32 strings, through the type `uint32_t *'. The units are - 32-bit memory words (`uint32_t'). + libunistring supports Unicode strings in three representations: + • UTF-8 strings, through the type ‘uint8_t *’. The units are bytes + (‘uint8_t’). + • UTF-16 strings, through the type ‘uint16_t *’, The units are 16-bit + memory words (‘uint16_t’). + • UTF-32 strings, through the type ‘uint32_t *’. The units are + 32-bit memory words (‘uint32_t’). As with C strings, there are two variants: - * Unicode strings with a terminating NUL character are represented as + • Unicode strings with a terminating NUL character are represented as a pointer to the first unit of the string. There is a unit containing a 0 value at the end. It is considered part of the string for all memory allocation purposes, but is not considered part of the string for all other logical purposes. - - * Unicode strings where embedded NUL characters are allowed. These + • Unicode strings where embedded NUL characters are allowed. These are represented by a pointer to the first unit and the number of - units (not bytes!) of the string. In this setting, there is no - trailing zero-valued unit used as "end marker". + units (not bytes!) of the string. In this setting, there is no + trailing zero-valued unit used as “end marker”. File: libunistring.info, Node: Conventions, Next: unitypes.h, Prev: Introduction, Up: Top @@ -540,33 +503,33 @@ File: libunistring.info, Node: Conventions, Next: unitypes.h, Prev: Introduct This chapter explains conventions valid throughout the libunistring library. - Variables of type `char *' denote C strings in locale encoding. See + Variables of type ‘char *’ denote C strings in locale encoding. See *note Locale encodings::. - Variables of type `uint8_t *' denote UTF-8 strings. Their units are + Variables of type ‘uint8_t *’ denote UTF-8 strings. Their units are bytes. - Variables of type `uint16_t *' denote UTF-16 strings, without byte + Variables of type ‘uint16_t *’ denote UTF-16 strings, without byte order mark. Their units are 2-byte words. - Variables of type `uint32_t *' denote UTF-32 strings, without byte + Variables of type ‘uint32_t *’ denote UTF-32 strings, without byte order mark. Their units are 4-byte words. - Argument pairs `(S, N)' denote a string `S[0..N-1]' with exactly N + Argument pairs ‘(S, N)’ denote a string ‘S[0..N-1]’ with exactly N units. - All functions with prefix `ulc_' operate on C strings in locale + All functions with prefix ‘ulc_’ operate on C strings in locale encoding. - All functions with prefix `u8_' operate on UTF-8 strings. + All functions with prefix ‘u8_’ operate on UTF-8 strings. - All functions with prefix `u16_' operate on UTF-16 strings. + All functions with prefix ‘u16_’ operate on UTF-16 strings. - All functions with prefix `u32_' operate on UTF-32 strings. + All functions with prefix ‘u32_’ operate on UTF-32 strings. - For every function with prefix `u8_', operating on UTF-8 strings, -there is also a corresponding function with prefix `u16_', operating on -UTF-16 strings, and a corresponding function with prefix `u32_', + For every function with prefix ‘u8_’, operating on UTF-8 strings, +there is also a corresponding function with prefix ‘u16_’, operating on +UTF-16 strings, and a corresponding function with prefix ‘u32_’, operating on UTF-32 strings. Their description is analogous; in this documentation we describe only the function that operates on UTF-8 strings, for brevity. @@ -574,35 +537,35 @@ strings, for brevity. A declaration with a variable N denotes the three concrete declarations with N = 8, N = 16, N = 32. - All parameters starting with `str' and the parameters of functions -starting with `u8_str'/`u16_str'/`u32_str' denote a NUL terminated + All parameters starting with ‘str’ and the parameters of functions +starting with ‘u8_str’/‘u16_str’/‘u32_str’ denote a NUL terminated string. - Error values are always returned through the `errno' variable, + Error values are always returned through the ‘errno’ variable, usually with a return value that indicates the presence of an error (NULL for functions that return an pointer, or -1 for functions that -return an `int'). +return an ‘int’). - Functions returning a string result take a `(RESULTBUF, LENGTHP)' + Functions returning a string result take a ‘(RESULTBUF, LENGTHP)’ argument pair. If RESULTBUF is not NULL and the result fits into -`*LENGTHP' units, it is put in RESULTBUF, and RESULTBUF is returned. +‘*LENGTHP’ units, it is put in RESULTBUF, and RESULTBUF is returned. Otherwise, a freshly allocated string is returned. In both cases, -`*LENGTHP' is set to the length (number of units) of the returned -string. In case of error, NULL is returned and `errno' is set. +‘*LENGTHP’ is set to the length (number of units) of the returned +string. In case of error, NULL is returned and ‘errno’ is set. File: libunistring.info, Node: unitypes.h, Next: unistr.h, Prev: Conventions, Up: Top -3 Elementary types `<unitypes.h>' +3 Elementary types ‘<unitypes.h>’ ********************************* - The include file `<unitypes.h>' provides the following basic types. + The include file ‘<unitypes.h>’ provides the following basic types. -- Type: uint8_t -- Type: uint16_t -- Type: uint32_t These are the storage units of UTF-8/16/32 strings, respectively. - The definitions are taken from `<stdint.h>', on platforms where + The definitions are taken from ‘<stdint.h>’, on platforms where this include file is present. -- Type: ucs4_t @@ -612,11 +575,11 @@ File: libunistring.info, Node: unitypes.h, Next: unistr.h, Prev: Conventions, File: libunistring.info, Node: unistr.h, Next: uniconv.h, Prev: unitypes.h, Up: Top -4 Elementary Unicode string functions `<unistr.h>' +4 Elementary Unicode string functions ‘<unistr.h>’ ************************************************** This include file declares elementary functions for Unicode strings. -It is essentially the equivalent of what `<string.h>' is for C strings. +It is essentially the equivalent of what ‘<string.h>’ is for C strings. * Menu: @@ -651,12 +614,12 @@ File: libunistring.info, Node: Elementary string conversions, Next: Elementary The following functions perform conversions between the different forms of Unicode strings. - -- Function: uint16_t * u8_to_u16 (const uint8_t *S, size_t N, - uint16_t *RESULTBUF, size_t *LENGTHP) + -- Function: uint16_t * u8_to_u16 (const uint8_t *S, size_t N, uint16_t + *RESULTBUF, size_t *LENGTHP) Converts an UTF-8 string to an UTF-16 string. - -- Function: uint32_t * u8_to_u32 (const uint8_t *S, size_t N, - uint32_t *RESULTBUF, size_t *LENGTHP) + -- 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. -- Function: uint8_t * u16_to_u8 (const uint16_t *S, size_t N, uint8_t @@ -691,7 +654,7 @@ character in a Unicode string. which is no longer than N. Returns 0 if it is the NUL character. Returns -1 upon failure. - This function is similar to `mblen', except that it operates on a + 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, @@ -701,39 +664,39 @@ character in a Unicode string. -- Function: int u32_mbtouc_unsafe (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 + putting its ‘ucs4_t’ representation in ‘*PUC’. Upon failure, + ‘*PUC’ is set to ‘0xfffd’, and an appropriate number of units is returned. The number of available units, N, must be > 0. - This function is similar to `mbtowc', except that it operates on a + 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 + 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'. + without ‘--enable-safety’. -- 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) -- Function: int u32_mbtoucr (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 -1 is returned for an invalid + putting its ‘ucs4_t’ representation in ‘*PUC’. Upon failure, + ‘*PUC’ is set to ‘0xfffd’, and -1 is returned for an invalid sequence of units, -2 is returned for an incomplete sequence of units. The number of available units, N, must be > 0. - This function is similar to `u8_mbtouc', except that the return - value gives more details about the failure, similar to `mbrtowc'. + This function is similar to ‘u8_mbtouc’, except that the return + value gives more details about the failure, similar to ‘mbrtowc’. - The following function stores a Unicode character as a Unicode -string in memory. + The following function stores a Unicode character as a Unicode string +in memory. -- Function: int u8_uctomb (uint8_t *S, ucs4_t UC, int N) -- Function: int u16_uctomb (uint16_t *S, ucs4_t UC, int N) @@ -743,7 +706,7 @@ string in memory. units, N, is too small. The latter case cannot occur if N >= 6/2/1, respectively. - This function is similar to `wctomb', except that it operates on a + This function is similar to ‘wctomb’, except that it operates on a Unicode strings, S must not be NULL, and the argument N must be specified. @@ -757,7 +720,7 @@ string in memory. size_t N) Copies N units from SRC to DEST. - This function is similar to `memcpy', except that it operates on + This function is similar to ‘memcpy’, except that it operates on Unicode strings. -- Function: uint8_t * u8_move (uint8_t *DEST, const uint8_t *SRC, @@ -769,7 +732,7 @@ string in memory. Copies N units from SRC to DEST, guaranteeing correct behavior for overlapping memory areas. - This function is similar to `memmove', except that it operates on + This function is similar to ‘memmove’, except that it operates on Unicode strings. The following function fills a Unicode string. @@ -780,7 +743,7 @@ string in memory. Sets the first N characters of S to UC. UC should be a character that occupies only 1 unit. - This function is similar to `memset', except that it operates on + This function is similar to ‘memset’, except that it operates on Unicode strings. The following function compares two Unicode strings of the same @@ -792,11 +755,11 @@ length. size_t N) -- Function: int u32_cmp (const uint32_t *S1, const uint32_t *S2, size_t N) - Compares S1 and S2, each of length N, lexicographically. Returns - a negative value if S1 compares smaller than S2, a positive value - if S1 compares larger than S2, or 0 if they compare equal. + Compares S1 and S2, each of length N, lexicographically. Returns a + negative value if S1 compares smaller than S2, a positive value if + S1 compares larger than S2, or 0 if they compare equal. - This function is similar to `memcmp', except that it operates on + This function is similar to ‘memcmp’, except that it operates on Unicode strings. The following function compares two Unicode strings of possibly @@ -808,11 +771,11 @@ different lengths. uint16_t *S2, size_t N2) -- Function: int u32_cmp2 (const uint32_t *S1, size_t N1, const uint32_t *S2, size_t N2) - Compares S1 and S2, lexicographically. Returns a negative value - if S1 compares smaller than S2, a positive value if S1 compares - larger than S2, or 0 if they compare equal. + Compares S1 and S2, lexicographically. Returns a negative value if + S1 compares smaller than S2, a positive value if S1 compares larger + than S2, or 0 if they compare equal. - This function is similar to the gnulib function `memcmp2', except + This function is similar to the gnulib function ‘memcmp2’, except that it operates on Unicode strings. The following function searches for a given Unicode character. @@ -825,7 +788,7 @@ different lengths. Searches the string at S for UC. Returns a pointer to the first occurrence of UC in S, or NULL if UC does not occur in S. - This function is similar to `memchr', except that it operates on + This function is similar to ‘memchr’, except that it operates on Unicode strings. The following function counts the number of Unicode characters. @@ -836,7 +799,7 @@ different lengths. Counts and returns the number of Unicode characters in the N units from S. - This function is similar to the gnulib function `mbsnlen', except + This function is similar to the gnulib function ‘mbsnlen’, except that it operates on Unicode strings. @@ -871,7 +834,7 @@ character in a Unicode string. -- Function: int u16_strmbtouc (ucs4_t *PUC, const uint16_t *S) -- Function: int u32_strmbtouc (ucs4_t *PUC, const uint32_t *S) Returns the length (number of units) of the first character in S, - putting its `ucs4_t' representation in `*PUC'. Returns 0 if it is + putting its ‘ucs4_t’ representation in ‘*PUC’. Returns 0 if it is the NUL character. Returns -1 upon failure. -- Function: const uint8_t * u8_next (ucs4_t *PUC, const uint8_t *S) @@ -879,21 +842,22 @@ character in a Unicode string. -- Function: const uint32_t * u32_next (ucs4_t *PUC, const uint32_t *S) Forward iteration step. Advances the pointer past the next character, or returns NULL if the end of the string has been - reached. Puts the character's `ucs4_t' representation in `*PUC'. + reached. Puts the character’s ‘ucs4_t’ representation in ‘*PUC’. The following function inspects and returns details about the previous character in a Unicode string. -- Function: const uint8_t * u8_prev (ucs4_t *PUC, const uint8_t *S, const uint8_t *START) - -- Function: const uint16_t * u16_prev (ucs4_t *PUC, const uint16_t - *S, const uint16_t *START) - -- Function: const uint32_t * u32_prev (ucs4_t *PUC, const uint32_t - *S, const uint32_t *START) + -- Function: const uint16_t * u16_prev (ucs4_t *PUC, const uint16_t *S, + const uint16_t *START) + -- Function: const uint32_t * u32_prev (ucs4_t *PUC, const uint32_t *S, + const uint32_t *START) Backward iteration step. Advances the pointer to point to the - previous character, or returns NULL if the beginning of the string - had been reached. Puts the character's `ucs4_t' representation in - `*PUC'. + previous character (the one that ends at ‘S’), or returns NULL if + the beginning of the string (specified by ‘START’) had been + reached. Puts the character’s ‘ucs4_t’ representation in ‘*PUC’. + Note that this function works only on well-formed Unicode strings. The following functions determine the length of a Unicode string. @@ -902,7 +866,7 @@ previous character in a Unicode string. -- Function: size_t u32_strlen (const uint32_t *S) Returns the number of units in S. - This function is similar to `strlen' and `wcslen', except that it + This function is similar to ‘strlen’ and ‘wcslen’, except that it operates on Unicode strings. -- Function: size_t u8_strnlen (const uint8_t *S, size_t MAXLEN) @@ -910,8 +874,8 @@ previous character in a Unicode string. -- Function: size_t u32_strnlen (const uint32_t *S, size_t MAXLEN) Returns the number of units in S, but at most MAXLEN. - This function is similar to `strnlen' and `wcsnlen', except that - it operates on Unicode strings. + This function is similar to ‘strnlen’ and ‘wcsnlen’, except that it + operates on Unicode strings. The following functions copy portions of Unicode strings in memory. @@ -922,7 +886,7 @@ previous character in a Unicode string. *SRC) Copies SRC to DEST. - This function is similar to `strcpy' and `wcscpy', except that it + This function is similar to ‘strcpy’ and ‘wcscpy’, except that it operates on Unicode strings. -- Function: uint8_t * u8_stpcpy (uint8_t *DEST, const uint8_t *SRC) @@ -930,10 +894,10 @@ previous character in a Unicode string. *SRC) -- Function: uint32_t * u32_stpcpy (uint32_t *DEST, const uint32_t *SRC) - Copies SRC to DEST, returning the address of the terminating NUL - in DEST. + Copies SRC to DEST, returning the address of the terminating NUL in + DEST. - This function is similar to `stpcpy', except that it operates on + This function is similar to ‘stpcpy’, except that it operates on Unicode strings. -- Function: uint8_t * u8_strncpy (uint8_t *DEST, const uint8_t *SRC, @@ -944,8 +908,8 @@ previous character in a Unicode string. *SRC, size_t N) Copies no more than N units of SRC to DEST. - This function is similar to `strncpy' and `wcsncpy', except that - it operates on Unicode strings. + This function is similar to ‘strncpy’ and ‘wcsncpy’, except that it + operates on Unicode strings. -- Function: uint8_t * u8_stpncpy (uint8_t *DEST, const uint8_t *SRC, size_t N) @@ -953,12 +917,12 @@ previous character in a Unicode string. *SRC, size_t N) -- Function: uint32_t * u32_stpncpy (uint32_t *DEST, const uint32_t *SRC, size_t N) - Copies no more than N units of SRC to DEST. Returns a pointer - past the last non-NUL unit written into DEST. In other words, if - the units written into DEST include a NUL, the return value is the - address of the first such NUL unit, otherwise it is `DEST + N'. + Copies no more than N units of SRC to DEST. Returns a pointer past + the last non-NUL unit written into DEST. In other words, if the + units written into DEST include a NUL, the return value is the + address of the first such NUL unit, otherwise it is ‘DEST + N’. - This function is similar to `stpncpy', except that it operates on + This function is similar to ‘stpncpy’, except that it operates on Unicode strings. -- Function: uint8_t * u8_strcat (uint8_t *DEST, const uint8_t *SRC) @@ -968,7 +932,7 @@ previous character in a Unicode string. *SRC) Appends SRC onto DEST. - This function is similar to `strcat' and `wcscat', except that it + This function is similar to ‘strcat’ and ‘wcscat’, except that it operates on Unicode strings. -- Function: uint8_t * u8_strncat (uint8_t *DEST, const uint8_t *SRC, @@ -979,19 +943,19 @@ previous character in a Unicode string. *SRC, size_t N) Appends no more than N units of SRC onto DEST. - This function is similar to `strncat' and `wcsncat', except that - it operates on Unicode strings. + This function is similar to ‘strncat’ and ‘wcsncat’, except that it + operates on Unicode strings. The following functions compare two Unicode strings. -- Function: int u8_strcmp (const uint8_t *S1, const uint8_t *S2) -- Function: int u16_strcmp (const uint16_t *S1, const uint16_t *S2) -- Function: int u32_strcmp (const uint32_t *S1, const uint32_t *S2) - Compares S1 and S2, lexicographically. Returns a negative value - if S1 compares smaller than S2, a positive value if S1 compares - larger than S2, or 0 if they compare equal. + Compares S1 and S2, lexicographically. Returns a negative value if + S1 compares smaller than S2, a positive value if S1 compares larger + than S2, or 0 if they compare equal. - This function is similar to `strcmp' and `wcscmp', except that it + This function is similar to ‘strcmp’ and ‘wcscmp’, except that it operates on Unicode strings. -- Function: int u8_strcoll (const uint8_t *S1, const uint8_t *S2) @@ -999,14 +963,14 @@ previous character in a Unicode string. -- Function: int u32_strcoll (const uint32_t *S1, const uint32_t *S2) Compares S1 and S2 using the collation rules of the current locale. Returns -1 if S1 < S2, 0 if S1 = S2, 1 if S1 > S2. Upon failure, - sets `errno' and returns any value. + sets ‘errno’ and returns any value. - This function is similar to `strcoll' and `wcscoll', except that - it operates on Unicode strings. + This function is similar to ‘strcoll’ and ‘wcscoll’, except that it + operates on Unicode strings. 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 `u8_normcoll' instead of + is therefore better to use the function ‘u8_normcoll’ instead of this one; see *note uninorm.h::. -- Function: int u8_strncmp (const uint8_t *S1, const uint8_t *S2, @@ -1017,17 +981,17 @@ previous character in a Unicode string. size_t N) Compares no more than N units of S1 and S2. - This function is similar to `strncmp' and `wcsncmp', except that - it operates on Unicode strings. + This function is similar to ‘strncmp’ and ‘wcsncmp’, except that it + operates on Unicode strings. The following function allocates a duplicate of a Unicode string. -- Function: uint8_t * u8_strdup (const uint8_t *S) -- Function: uint16_t * u16_strdup (const uint16_t *S) -- Function: uint32_t * u32_strdup (const uint32_t *S) - Duplicates S, returning an identical malloc'd string. + Duplicates S, returning an identical malloc’d string. - This function is similar to `strdup' and `wcsdup', except that it + This function is similar to ‘strdup’ and ‘wcsdup’, except that it operates on Unicode strings. The following functions search for a given Unicode character. @@ -1037,7 +1001,7 @@ previous character in a Unicode string. -- Function: uint32_t * u32_strchr (const uint32_t *STR, ucs4_t UC) Finds the first occurrence of UC in STR. - This function is similar to `strchr' and `wcschr', except that it + This function is similar to ‘strchr’ and ‘wcschr’, except that it operates on Unicode strings. -- Function: uint8_t * u8_strrchr (const uint8_t *STR, ucs4_t UC) @@ -1045,8 +1009,8 @@ previous character in a Unicode string. -- Function: uint32_t * u32_strrchr (const uint32_t *STR, ucs4_t UC) Finds the last occurrence of UC in STR. - This function is similar to `strrchr' and `wcsrchr', except that - it operates on Unicode strings. + This function is similar to ‘strrchr’ and ‘wcsrchr’, except that it + operates on Unicode strings. The following functions search for the first occurrence of some Unicode character in or outside a given set of Unicode characters. @@ -1060,8 +1024,8 @@ Unicode character in or outside a given set of Unicode characters. Returns the length of the initial segment of STR which consists entirely of Unicode characters not in REJECT. - This function is similar to `strcspn' and `wcscspn', except that - it operates on Unicode strings. + This function is similar to ‘strcspn’ and ‘wcscspn’, except that it + operates on Unicode strings. -- Function: size_t u8_strspn (const uint8_t *STR, const uint8_t *ACCEPT) @@ -1072,7 +1036,7 @@ Unicode character in or outside a given set of Unicode characters. Returns the length of the initial segment of STR which consists entirely of Unicode characters in ACCEPT. - This function is similar to `strspn' and `wcsspn', except that it + This function is similar to ‘strspn’ and ‘wcsspn’, except that it operates on Unicode strings. -- Function: uint8_t * u8_strpbrk (const uint8_t *STR, const uint8_t @@ -1083,8 +1047,8 @@ Unicode character in or outside a given set of Unicode characters. uint32_t *ACCEPT) Finds the first occurrence in STR of any character in ACCEPT. - This function is similar to `strpbrk' and `wcspbrk', except that - it operates on Unicode strings. + This function is similar to ‘strpbrk’ and ‘wcspbrk’, except that it + operates on Unicode strings. The following functions search whether a given Unicode string is a substring of another Unicode string. @@ -1097,7 +1061,7 @@ substring of another Unicode string. uint32_t *NEEDLE) Finds the first occurrence of NEEDLE in HAYSTACK. - This function is similar to `strstr' and `wcsstr', except that it + This function is similar to ‘strstr’ and ‘wcsstr’, except that it operates on Unicode strings. -- Function: bool u8_startswith (const uint8_t *STR, const uint8_t @@ -1126,34 +1090,34 @@ substring of another Unicode string. *DELIM, uint32_t **PTR) Divides STR into tokens separated by characters in DELIM. - This function is similar to `strtok_r' and `wcstok', except that - it operates on Unicode strings. Its interface is actually more - similar to `wcstok' than to `strtok'. + This function is similar to ‘strtok_r’ and ‘wcstok’, except that it + operates on Unicode strings. Its interface is actually more + similar to ‘wcstok’ than to ‘strtok’. File: libunistring.info, Node: uniconv.h, Next: unistdio.h, Prev: unistr.h, Up: Top -5 Conversions between Unicode and encodings `<uniconv.h>' +5 Conversions between Unicode and encodings ‘<uniconv.h>’ ********************************************************* This include file declares functions for converting between Unicode -strings and `char *' strings in locale encoding or in other specified +strings and ‘char *’ strings in locale encoding or in other specified encodings. The following function returns the locale encoding. -- Function: const char * locale_charset () - Determines the current locale's character encoding, and + Determines the current locale’s character encoding, and canonicalizes it into one of the canonical names listed in - `config.charset'. If the canonical name cannot be determined, the + ‘config.charset’. If the canonical name cannot be determined, the result is a non-canonical name. The result must not be freed; it is statically allocated. The result of this function can be used as an argument to the - `iconv_open' function in GNU libc, in GNU libiconv, or in the - gnulib provided wrapper around the native `iconv_open' function. - It may not work as an argument to the native `iconv_open' function + ‘iconv_open’ function in GNU libc, in GNU libiconv, or in the + gnulib provided wrapper around the native ‘iconv_open’ function. + It may not work as an argument to the native ‘iconv_open’ function directly. The handling of unconvertible characters during the conversions can @@ -1164,15 +1128,15 @@ be parametrized through the following enumeration type: handled. -- Constant: enum iconv_ilseq_handler iconveh_error - This handler causes the function to return with `errno' set to - `EILSEQ'. + This handler causes the function to return with ‘errno’ set to + ‘EILSEQ’. -- Constant: enum iconv_ilseq_handler iconveh_question_mark - This handler produces one question mark `?' per unconvertible + This handler produces one question mark ‘?’ per unconvertible character. -- Constant: enum iconv_ilseq_handler iconveh_escape_sequence - This handler produces an escape sequence `\uXXXX' or `\UXXXXXXXX' + This handler produces an escape sequence ‘\uXXXX’ or ‘\UXXXXXXXX’ for each unconvertible character. The following functions convert between strings in a specified @@ -1191,29 +1155,29 @@ encoding and Unicode strings. encoding to UTF-8 encoding. Converts a memory region given in encoding FROMCODE. FROMCODE is - as for the `iconv_open' function. + as for the ‘iconv_open’ function. - The input is in the memory region between SRC (inclusive) and `SRC - + SRCLEN' (exclusive). + The input is in the memory region between SRC (inclusive) and ‘SRC + + SRCLEN’ (exclusive). If OFFSETS is not NULL, it should point to an array of SRCLEN integers; this array is filled with offsets into the result, i.e. - the character starting at `SRC[i]' corresponds to the character - starting at `RESULT[OFFSETS[i]]', and other offsets are set to - `(size_t)(-1)'. + the character starting at ‘SRC[i]’ corresponds to the character + starting at ‘RESULT[OFFSETS[i]]’, and other offsets are set to + ‘(size_t)(-1)’. - `RESULTBUF' and `*LENGTHP' should be a scratch buffer and its - size, or `RESULTBUF' can be NULL. + ‘RESULTBUF’ and ‘*LENGTHP’ should be a scratch buffer and its size, + or ‘RESULTBUF’ can be NULL. - May erase the contents of the memory at `RESULTBUF'. + May erase the contents of the memory at ‘RESULTBUF’. If successful: The resulting Unicode string (non-NULL) is returned - and its length stored in `*LENGTHP'. The resulting string is - `RESULTBUF' if no dynamic memory allocation was necessary, or a + and its length stored in ‘*LENGTHP’. The resulting string is + ‘RESULTBUF’ if no dynamic memory allocation was necessary, or a freshly allocated memory block otherwise. - In case of error: NULL is returned and `errno' is set. Particular - `errno' values: `EINVAL', `EILSEQ', `ENOMEM'. + In case of error: NULL is returned and ‘errno’ is set. Particular + ‘errno’ values: ‘EINVAL’, ‘EILSEQ’, ‘ENOMEM’. -- Function: char * u8_conv_to_encoding (const char *TOCODE, enum iconv_ilseq_handler HANDLER, const uint8_t *SRC, size_t @@ -1228,29 +1192,29 @@ encoding and Unicode strings. from UTF-8 encoding to a given encoding. Converts a memory region to encoding TOCODE. TOCODE is as for the - `iconv_open' function. + ‘iconv_open’ function. - The input is in the memory region between SRC (inclusive) and `SRC - + SRCLEN' (exclusive). + The input is in the memory region between SRC (inclusive) and ‘SRC + + SRCLEN’ (exclusive). If OFFSETS is not NULL, it should point to an array of SRCLEN integers; this array is filled with offsets into the result, i.e. - the character starting at `SRC[i]' corresponds to the character - starting at `RESULT[OFFSETS[i]]', and other offsets are set to - `(size_t)(-1)'. + the character starting at ‘SRC[i]’ corresponds to the character + starting at ‘RESULT[OFFSETS[i]]’, and other offsets are set to + ‘(size_t)(-1)’. - `RESULTBUF' and `*LENGTHP' should be a scratch buffer and its - size, or `RESULTBUF' can be NULL. + ‘RESULTBUF’ and ‘*LENGTHP’ should be a scratch buffer and its size, + or ‘RESULTBUF’ can be NULL. - May erase the contents of the memory at `RESULTBUF'. + May erase the contents of the memory at ‘RESULTBUF’. If successful: The resulting Unicode string (non-NULL) is returned - and its length stored in `*LENGTHP'. The resulting string is - `RESULTBUF' if no dynamic memory allocation was necessary, or a + and its length stored in ‘*LENGTHP’. The resulting string is + ‘RESULTBUF’ if no dynamic memory allocation was necessary, or a freshly allocated memory block otherwise. - In case of error: NULL is returned and `errno' is set. Particular - `errno' values: `EINVAL', `EILSEQ', `ENOMEM'. + In case of error: NULL is returned and ‘errno’ is set. Particular + ‘errno’ values: ‘EINVAL’, ‘EILSEQ’, ‘ENOMEM’. The following functions convert between NUL terminated strings in a specified encoding and NUL terminated Unicode strings. @@ -1263,10 +1227,10 @@ specified encoding and NUL terminated Unicode strings. const char *FROMCODE, enum iconv_ilseq_handler HANDLER) Converts a NUL terminated string from a given encoding. - The result is `malloc' allocated, or NULL (with ERRNO set) in case + The result is ‘malloc’ allocated, or NULL (with ERRNO set) in case of error. - Particular `errno' values: `EILSEQ', `ENOMEM'. + Particular ‘errno’ values: ‘EILSEQ’, ‘ENOMEM’. -- Function: char * u8_strconv_to_encoding (const uint8_t *STRING, const char *TOCODE, enum iconv_ilseq_handler HANDLER) @@ -1276,10 +1240,10 @@ specified encoding and NUL terminated Unicode strings. const char *TOCODE, enum iconv_ilseq_handler HANDLER) Converts a NUL terminated string to a given encoding. - The result is `malloc' allocated, or NULL (with `errno' set) in + The result is ‘malloc’ allocated, or NULL (with ‘errno’ set) in case of error. - Particular `errno' values: `EILSEQ', `ENOMEM'. + Particular ‘errno’ values: ‘EILSEQ’, ‘ENOMEM’. The following functions are shorthands that convert between NUL terminated strings in locale encoding and NUL terminated Unicode @@ -1290,64 +1254,62 @@ strings. -- Function: uint32_t * u32_strconv_from_locale (const char *STRING) Converts a NUL terminated string from the locale encoding. - The result is `malloc' allocated, or NULL (with `errno' set) in + The result is ‘malloc’ allocated, or NULL (with ‘errno’ set) in case of error. - Particular `errno' values: `ENOMEM'. + Particular ‘errno’ values: ‘ENOMEM’. -- Function: char * u8_strconv_to_locale (const uint8_t *STRING) -- Function: char * u16_strconv_to_locale (const uint16_t *STRING) -- Function: char * u32_strconv_to_locale (const uint32_t *STRING) Converts a NUL terminated string to the locale encoding. - The result is `malloc' allocated, or NULL (with `errno' set) in + The result is ‘malloc’ allocated, or NULL (with ‘errno’ set) in case of error. - Particular `errno' values: `ENOMEM'. + Particular ‘errno’ values: ‘ENOMEM’. File: libunistring.info, Node: unistdio.h, Next: uniname.h, Prev: uniconv.h, Up: Top -6 Output with Unicode strings `<unistdio.h>' +6 Output with Unicode strings ‘<unistdio.h>’ ******************************************** This include file declares functions for doing formatted output with -Unicode strings. It defines a set of functions similar to `fprintf' and -`sprintf', which are declared in `<stdio.h>'. +Unicode strings. It defines a set of functions similar to ‘fprintf’ and +‘sprintf’, which are declared in ‘<stdio.h>’. - These functions work like the `printf' function family. In the + These functions work like the ‘printf’ function family. In the format string: - * The format directive `U' takes an UTF-8 string (`const uint8_t *'). - - * The format directive `lU' takes an UTF-16 string (`const uint16_t - *'). + • The format directive ‘U’ takes an UTF-8 string (‘const uint8_t *’). + • The format directive ‘lU’ takes an UTF-16 string (‘const uint16_t + *’). + • The format directive ‘llU’ takes an UTF-32 string (‘const uint32_t + *’). - * The format directive `llU' takes an UTF-32 string (`const uint32_t - *'). - - A function name with an infix `v' indicates that a `va_list' is + A function name with an infix ‘v’ indicates that a ‘va_list’ is passed instead of multiple arguments. - The functions `*sprintf' have a BUF argument that is assumed to be -large enough. (_DANGEROUS! Overflowing the buffer will crash the + The functions ‘*sprintf’ have a BUF argument that is assumed to be +large enough. (_DANGEROUS! Overflowing the buffer will crash the program._) - The functions `*snprintf' have a BUF argument that is assumed to be -SIZE units large. (_DANGEROUS! The resulting string might be -truncated in the middle of a multibyte character._) + The functions ‘*snprintf’ have a BUF argument that is assumed to be +SIZE units large. (_DANGEROUS! The resulting string might be truncated +in the middle of a multibyte character._) - The functions `*asprintf' have a RESULTP argument. The result will -be freshly allocated and stored in `*resultp'. + The functions ‘*asprintf’ have a RESULTP argument. The result will +be freshly allocated and stored in ‘*resultp’. - The functions `*asnprintf' have a (RESULTBUF, LENGTHP) argument -pair. If RESULTBUF is not NULL and the result fits into `*LENGTHP' -units, it is put in RESULTBUF, and RESULTBUF is returned. Otherwise, a -freshly allocated string is returned. In both cases, `*LENGTHP' is set -to the length (number of units) of the returned string. In case of -error, NULL is returned and `errno' is set. + The functions ‘*asnprintf’ have a (RESULTBUF, LENGTHP) argument pair. +If RESULTBUF is not NULL and the result fits into ‘*LENGTHP’ units, it +is put in RESULTBUF, and RESULTBUF is returned. Otherwise, a freshly +allocated string is returned. In both cases, ‘*LENGTHP’ is set to the +length (number of units) of the returned string. In case of error, NULL +is returned and ‘errno’ is set. The following functions take an ASCII format string and return a -result that is a `char *' string in locale encoding. +result that is a ‘char *’ string in locale encoding. -- Function: int ulc_sprintf (char *BUF, const char *FORMAT, ...) @@ -1375,25 +1337,18 @@ result that is a `char *' string in locale encoding. result in UTF-8 format. -- Function: int u8_sprintf (uint8_t *BUF, const char *FORMAT, ...) - -- Function: int u8_snprintf (uint8_t *BUF, size_t SIZE, const char *FORMAT, ...) - -- Function: int u8_asprintf (uint8_t **RESULTP, const char *FORMAT, ...) - -- Function: uint8_t * u8_asnprintf (uint8_t *RESULTBUF, size_t *LENGTHP, const char *FORMAT, ...) - - -- Function: int u8_vsprintf (uint8_t *BUF, const char *FORMAT, - va_list ap) - + -- Function: int u8_vsprintf (uint8_t *BUF, const char *FORMAT, va_list + ap) -- Function: int u8_vsnprintf (uint8_t *BUF, size_t SIZE, const char *FORMAT, va_list AP) - -- Function: int u8_vasprintf (uint8_t **RESULTP, const char *FORMAT, va_list AP) - -- Function: uint8_t * u8_vasnprintf (uint8_t *resultbuf, size_t *LENGTHP, const char *FORMAT, va_list AP) @@ -1402,25 +1357,18 @@ result in UTF-8 format. -- Function: int u8_u8_sprintf (uint8_t *BUF, const uint8_t *FORMAT, ...) - -- Function: int u8_u8_snprintf (uint8_t *BUF, size_t SIZE, const uint8_t *FORMAT, ...) - -- Function: int u8_u8_asprintf (uint8_t **RESULTP, const uint8_t *FORMAT, ...) - -- Function: uint8_t * u8_u8_asnprintf (uint8_t *resultbuf, size_t *LENGTHP, const uint8_t *FORMAT, ...) - -- Function: int u8_u8_vsprintf (uint8_t *BUF, const uint8_t *FORMAT, va_list AP) - -- Function: int u8_u8_vsnprintf (uint8_t *BUF, size_t SIZE, const uint8_t *FORMAT, va_list AP) - -- Function: int u8_u8_vasprintf (uint8_t **RESULTP, const uint8_t *FORMAT, va_list AP) - -- Function: uint8_t * u8_u8_vasnprintf (uint8_t *resultbuf, size_t *LENGTHP, const uint8_t *FORMAT, va_list AP) @@ -1428,25 +1376,18 @@ result in UTF-8 format. result in UTF-16 format. -- Function: int u16_sprintf (uint16_t *BUF, const char *FORMAT, ...) - -- Function: int u16_snprintf (uint16_t *BUF, size_t SIZE, const char *FORMAT, ...) - -- Function: int u16_asprintf (uint16_t **RESULTP, const char *FORMAT, ...) - -- Function: uint16_t * u16_asnprintf (uint16_t *RESULTBUF, size_t *LENGTHP, const char *FORMAT, ...) - -- Function: int u16_vsprintf (uint16_t *BUF, const char *FORMAT, va_list ap) - -- Function: int u16_vsnprintf (uint16_t *BUF, size_t SIZE, const char *FORMAT, va_list AP) - - -- Function: int u16_vasprintf (uint16_t **RESULTP, const char - *FORMAT, va_list AP) - + -- Function: int u16_vasprintf (uint16_t **RESULTP, const char *FORMAT, + va_list AP) -- Function: uint16_t * u16_vasnprintf (uint16_t *resultbuf, size_t *LENGTHP, const char *FORMAT, va_list AP) @@ -1455,51 +1396,37 @@ result in UTF-16 format. -- Function: int u16_u16_sprintf (uint16_t *BUF, const uint16_t *FORMAT, ...) - -- Function: int u16_u16_snprintf (uint16_t *BUF, size_t SIZE, const uint16_t *FORMAT, ...) - -- Function: int u16_u16_asprintf (uint16_t **RESULTP, const uint16_t *FORMAT, ...) - -- Function: uint16_t * u16_u16_asnprintf (uint16_t *resultbuf, size_t *LENGTHP, const uint16_t *FORMAT, ...) - -- Function: int u16_u16_vsprintf (uint16_t *BUF, const uint16_t *FORMAT, va_list AP) - -- Function: int u16_u16_vsnprintf (uint16_t *BUF, size_t SIZE, const uint16_t *FORMAT, va_list AP) - -- Function: int u16_u16_vasprintf (uint16_t **RESULTP, const uint16_t *FORMAT, va_list AP) - - -- Function: uint16_t * u16_u16_vasnprintf (uint16_t *resultbuf, - size_t *LENGTHP, const uint16_t *FORMAT, va_list AP) + -- Function: uint16_t * u16_u16_vasnprintf (uint16_t *resultbuf, size_t + *LENGTHP, const uint16_t *FORMAT, va_list AP) The following functions take an ASCII format string and return a result in UTF-32 format. -- Function: int u32_sprintf (uint32_t *BUF, const char *FORMAT, ...) - -- Function: int u32_snprintf (uint32_t *BUF, size_t SIZE, const char *FORMAT, ...) - -- Function: int u32_asprintf (uint32_t **RESULTP, const char *FORMAT, ...) - -- Function: uint32_t * u32_asnprintf (uint32_t *RESULTBUF, size_t *LENGTHP, const char *FORMAT, ...) - -- Function: int u32_vsprintf (uint32_t *BUF, const char *FORMAT, va_list ap) - -- Function: int u32_vsnprintf (uint32_t *BUF, size_t SIZE, const char *FORMAT, va_list AP) - - -- Function: int u32_vasprintf (uint32_t **RESULTP, const char - *FORMAT, va_list AP) - + -- Function: int u32_vasprintf (uint32_t **RESULTP, const char *FORMAT, + va_list AP) -- Function: uint32_t * u32_vasnprintf (uint32_t *resultbuf, size_t *LENGTHP, const char *FORMAT, va_list AP) @@ -1508,81 +1435,73 @@ result in UTF-32 format. -- Function: int u32_u32_sprintf (uint32_t *BUF, const uint32_t *FORMAT, ...) - -- Function: int u32_u32_snprintf (uint32_t *BUF, size_t SIZE, const uint32_t *FORMAT, ...) - -- Function: int u32_u32_asprintf (uint32_t **RESULTP, const uint32_t *FORMAT, ...) - -- Function: uint32_t * u32_u32_asnprintf (uint32_t *resultbuf, size_t *LENGTHP, const uint32_t *FORMAT, ...) - -- Function: int u32_u32_vsprintf (uint32_t *BUF, const uint32_t *FORMAT, va_list AP) - -- Function: int u32_u32_vsnprintf (uint32_t *BUF, size_t SIZE, const uint32_t *FORMAT, va_list AP) - -- Function: int u32_u32_vasprintf (uint32_t **RESULTP, const uint32_t *FORMAT, va_list AP) - - -- Function: uint32_t * u32_u32_vasnprintf (uint32_t *resultbuf, - size_t *LENGTHP, const uint32_t *FORMAT, va_list AP) + -- Function: uint32_t * u32_u32_vasnprintf (uint32_t *resultbuf, size_t + *LENGTHP, const uint32_t *FORMAT, va_list AP) The following functions take an ASCII format string and produce -output in locale encoding to a `FILE' stream. +output in locale encoding to a ‘FILE’ stream. -- Function: int ulc_fprintf (FILE *STREAM, const char *FORMAT, ...) - -- Function: int ulc_vfprintf (FILE *STREAM, const char *FORMAT, va_list AP) File: libunistring.info, Node: uniname.h, Next: unictype.h, Prev: unistdio.h, Up: Top -7 Names of Unicode characters `<uniname.h>' +7 Names of Unicode characters ‘<uniname.h>’ ******************************************* This include file implements the association between a Unicode character and its name. The name of a Unicode character allows to distinguish it from other, -similar looking characters. For example, the character `x' has the name -`"LATIN SMALL LETTER X"' and is therefore different from the character -named `"MULTIPLICATION SIGN"'. +similar looking characters. For example, the character ‘x’ has the name +‘"LATIN SMALL LETTER X"’ and is therefore different from the character +named ‘"MULTIPLICATION SIGN"’. -- Macro: unsigned int UNINAME_MAX This macro expands to a constant that is the required size of buffer for a Unicode character name. -- Function: char * unicode_character_name (ucs4_t UC, char *BUF) - Looks up the name of a Unicode character, in uppercase ASCII. BUF - must point to a buffer, at least `UNINAME_MAX' bytes in size. + Looks up the name of a Unicode character, in uppercase ASCII. BUF + must point to a buffer, at least ‘UNINAME_MAX’ bytes in size. Returns the filled BUF, or NULL if the character does not have a name. -- Function: ucs4_t unicode_name_character (const char *NAME) Looks up the Unicode character with a given name, in upper- or - lowercase ASCII. Returns the character if found, or - `UNINAME_INVALID' if not found. + lowercase ASCII. NAME can also be an alias name of a character. + Returns the character if found, or ‘UNINAME_INVALID’ if not found. -- Macro: ucs4_t UNINAME_INVALID This macro expands to a constant that is a special return value of - the `unicode_name_character' function. + the ‘unicode_name_character’ function. File: libunistring.info, Node: unictype.h, Next: uniwidth.h, Prev: uniname.h, Up: Top -8 Unicode character classification and properties `<unictype.h>' +8 Unicode character classification and properties ‘<unictype.h>’ **************************************************************** This include file declares functions that classify Unicode characters and that test whether Unicode characters have specific properties. - The classification assigns a "general category" to every Unicode + The classification assigns a “general category” to every Unicode character. This is similar to the classification provided by ISO C in -`<wctype.h>'. +‘<wctype.h>’. Properties are the data that guides various text processing algorithms in the presence of specific Unicode characters. @@ -1591,11 +1510,12 @@ algorithms in the presence of specific Unicode characters. * General category:: * Canonical combining class:: -* Bidirectional category:: +* Bidi class:: * Decimal digit value:: * Digit value:: * Numeric value:: * Mirrored character:: +* Arabic shaping:: * Properties:: * Scripts:: * Blocks:: @@ -1618,8 +1538,8 @@ denote every predefined general category value or combinations thereof. The low-level API uses a bit mask instead. The advantage of the object oriented API is that if only a few predefined general category values are used, the data tables are relatively small. When you combine -general category values (using `uc_general_category_or', -`uc_general_category_and', or `uc_general_category_and_not'), or when +general category values (using ‘uc_general_category_or’, +‘uc_general_category_and’, or ‘uc_general_category_and_not’), or when you use the low level bit masks, a big table is used thats holds the complete general category information for all Unicode characters. @@ -1643,6 +1563,7 @@ File: libunistring.info, Node: Object oriented API, Next: Bit mask API, Up: G 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 @@ -1683,120 +1604,123 @@ general categories may be added in the future. The following are alias names for predefined General category values. -- Macro: uc_general_category_t UC_LETTER - This is another name for `UC_CATEGORY_L'. + This is another name for ‘UC_CATEGORY_L’. + + -- Macro: uc_general_category_t UC_CASED_LETTER + This is another name for ‘UC_CATEGORY_LC’. -- Macro: uc_general_category_t UC_UPPERCASE_LETTER - This is another name for `UC_CATEGORY_Lu'. + This is another name for ‘UC_CATEGORY_Lu’. -- Macro: uc_general_category_t UC_LOWERCASE_LETTER - This is another name for `UC_CATEGORY_Ll'. + This is another name for ‘UC_CATEGORY_Ll’. -- Macro: uc_general_category_t UC_TITLECASE_LETTER - This is another name for `UC_CATEGORY_Lt'. + This is another name for ‘UC_CATEGORY_Lt’. -- Macro: uc_general_category_t UC_MODIFIER_LETTER - This is another name for `UC_CATEGORY_Lm'. + This is another name for ‘UC_CATEGORY_Lm’. -- Macro: uc_general_category_t UC_OTHER_LETTER - This is another name for `UC_CATEGORY_Lo'. + This is another name for ‘UC_CATEGORY_Lo’. -- Macro: uc_general_category_t UC_MARK - This is another name for `UC_CATEGORY_M'. + This is another name for ‘UC_CATEGORY_M’. -- Macro: uc_general_category_t UC_NON_SPACING_MARK - This is another name for `UC_CATEGORY_Mn'. + This is another name for ‘UC_CATEGORY_Mn’. -- Macro: uc_general_category_t UC_COMBINING_SPACING_MARK - This is another name for `UC_CATEGORY_Mc'. + This is another name for ‘UC_CATEGORY_Mc’. -- Macro: uc_general_category_t UC_ENCLOSING_MARK - This is another name for `UC_CATEGORY_Me'. + This is another name for ‘UC_CATEGORY_Me’. -- Macro: uc_general_category_t UC_NUMBER - This is another name for `UC_CATEGORY_N'. + This is another name for ‘UC_CATEGORY_N’. -- Macro: uc_general_category_t UC_DECIMAL_DIGIT_NUMBER - This is another name for `UC_CATEGORY_Nd'. + This is another name for ‘UC_CATEGORY_Nd’. -- Macro: uc_general_category_t UC_LETTER_NUMBER - This is another name for `UC_CATEGORY_Nl'. + This is another name for ‘UC_CATEGORY_Nl’. -- Macro: uc_general_category_t UC_OTHER_NUMBER - This is another name for `UC_CATEGORY_No'. + This is another name for ‘UC_CATEGORY_No’. -- Macro: uc_general_category_t UC_PUNCTUATION - This is another name for `UC_CATEGORY_P'. + This is another name for ‘UC_CATEGORY_P’. -- Macro: uc_general_category_t UC_CONNECTOR_PUNCTUATION - This is another name for `UC_CATEGORY_Pc'. + This is another name for ‘UC_CATEGORY_Pc’. -- Macro: uc_general_category_t UC_DASH_PUNCTUATION - This is another name for `UC_CATEGORY_Pd'. + This is another name for ‘UC_CATEGORY_Pd’. -- Macro: uc_general_category_t UC_OPEN_PUNCTUATION - This is another name for `UC_CATEGORY_Ps' ("start punctuation"). + This is another name for ‘UC_CATEGORY_Ps’ (“start punctuation”). -- Macro: uc_general_category_t UC_CLOSE_PUNCTUATION - This is another name for `UC_CATEGORY_Pe' ("end punctuation"). + This is another name for ‘UC_CATEGORY_Pe’ (“end punctuation”). -- Macro: uc_general_category_t UC_INITIAL_QUOTE_PUNCTUATION - This is another name for `UC_CATEGORY_Pi'. + This is another name for ‘UC_CATEGORY_Pi’. -- Macro: uc_general_category_t UC_FINAL_QUOTE_PUNCTUATION - This is another name for `UC_CATEGORY_Pf'. + This is another name for ‘UC_CATEGORY_Pf’. -- Macro: uc_general_category_t UC_OTHER_PUNCTUATION - This is another name for `UC_CATEGORY_Po'. + This is another name for ‘UC_CATEGORY_Po’. -- Macro: uc_general_category_t UC_SYMBOL - This is another name for `UC_CATEGORY_S'. + This is another name for ‘UC_CATEGORY_S’. -- Macro: uc_general_category_t UC_MATH_SYMBOL - This is another name for `UC_CATEGORY_Sm'. + This is another name for ‘UC_CATEGORY_Sm’. -- Macro: uc_general_category_t UC_CURRENCY_SYMBOL - This is another name for `UC_CATEGORY_Sc'. + This is another name for ‘UC_CATEGORY_Sc’. -- Macro: uc_general_category_t UC_MODIFIER_SYMBOL - This is another name for `UC_CATEGORY_Sk'. + This is another name for ‘UC_CATEGORY_Sk’. -- Macro: uc_general_category_t UC_OTHER_SYMBOL - This is another name for `UC_CATEGORY_So'. + This is another name for ‘UC_CATEGORY_So’. -- Macro: uc_general_category_t UC_SEPARATOR - This is another name for `UC_CATEGORY_Z'. + This is another name for ‘UC_CATEGORY_Z’. -- Macro: uc_general_category_t UC_SPACE_SEPARATOR - This is another name for `UC_CATEGORY_Zs'. + This is another name for ‘UC_CATEGORY_Zs’. -- Macro: uc_general_category_t UC_LINE_SEPARATOR - This is another name for `UC_CATEGORY_Zl'. + This is another name for ‘UC_CATEGORY_Zl’. -- Macro: uc_general_category_t UC_PARAGRAPH_SEPARATOR - This is another name for `UC_CATEGORY_Zp'. + This is another name for ‘UC_CATEGORY_Zp’. -- Macro: uc_general_category_t UC_OTHER - This is another name for `UC_CATEGORY_C'. + This is another name for ‘UC_CATEGORY_C’. -- Macro: uc_general_category_t UC_CONTROL - This is another name for `UC_CATEGORY_Cc'. + This is another name for ‘UC_CATEGORY_Cc’. -- Macro: uc_general_category_t UC_FORMAT - This is another name for `UC_CATEGORY_Cf'. + This is another name for ‘UC_CATEGORY_Cf’. -- Macro: uc_general_category_t UC_SURROGATE - This is another name for `UC_CATEGORY_Cs'. All code points in this + This is another name for ‘UC_CATEGORY_Cs’. All code points in this category are invalid characters. -- Macro: uc_general_category_t UC_PRIVATE_USE - This is another name for `UC_CATEGORY_Co'. + This is another name for ‘UC_CATEGORY_Co’. -- Macro: uc_general_category_t UC_UNASSIGNED - This is another name for `UC_CATEGORY_Cn'. Some code points in + This is another name for ‘UC_CATEGORY_Cn’. 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. + The following functions combine general categories, like in a boolean +algebra, except that there is no ‘not’ operation. -- Function: uc_general_category_t uc_general_category_or (uc_general_category_t CATEGORY1, uc_general_category_t @@ -1823,13 +1747,22 @@ boolean algebra, except that there is no `not' operation. -- Function: const char * uc_general_category_name (uc_general_category_t CATEGORY) - Returns the name of a general category. Returns NULL if the + 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 have a name. + + -- Function: const char * uc_general_category_long_name + (uc_general_category_t CATEGORY) + Returns the long name of a general category. Returns NULL if the general category corresponds to a bit mask that does not have a name. -- Function: uc_general_category_t uc_general_category_byname (const char *CATEGORY_NAME) - Returns the general category given by name, e.g. `"Lu"'. + Returns the general category given by name, e.g. ‘"Lu"’, or by + long name, e.g. ‘"Uppercase Letter"’. This lookup ignores spaces, + underscores, or hyphens as word separators and is + case-insignificant. The following functions view general categories as sets of Unicode characters. @@ -1841,8 +1774,8 @@ characters. -- Function: bool uc_is_general_category (ucs4_t UC, uc_general_category_t CATEGORY) - Tests whether a Unicode character belongs to a given category. - The CATEGORY argument can be a predefined general category or the + Tests whether a Unicode character belongs to a given category. The + CATEGORY argument can be a predefined general category or the combination of several predefined general categories. @@ -1855,6 +1788,7 @@ File: libunistring.info, Node: Bit mask API, Prev: Object oriented API, Up: G Additional general categories may be added in the future. -- Macro: uint32_t UC_CATEGORY_MASK_L + -- Macro: uint32_t UC_CATEGORY_MASK_LC -- Macro: uint32_t UC_CATEGORY_MASK_Lu -- Macro: uint32_t UC_CATEGORY_MASK_Ll -- Macro: uint32_t UC_CATEGORY_MASK_Lt @@ -1895,16 +1829,16 @@ Additional general categories may be added in the future. The following function views general categories as sets of Unicode characters. - -- Function: bool uc_is_general_category_withtable (ucs4_t UC, - uint32_t BITMASK) - Tests whether a Unicode character belongs to a given category. - The BITMASK argument can be a predefined general category bitmask - or the combination of several predefined general category bitmasks. + -- Function: bool uc_is_general_category_withtable (ucs4_t UC, uint32_t + BITMASK) + Tests whether a Unicode character belongs to a given category. The + BITMASK argument can be a predefined general category bitmask or + the combination of several predefined general category bitmasks. This function uses a big table comprising all general categories. -File: libunistring.info, Node: Canonical combining class, Next: Bidirectional category, Prev: General category, Up: unictype.h +File: libunistring.info, Node: Canonical combining class, Next: Bidi class, Prev: General category, Up: unictype.h 8.2 Canonical combining class ============================= @@ -1914,80 +1848,102 @@ class_ assigned to it. What is the meaning of the canonical combining class? Essentially, it indicates the priority with which a combining character is attached -to its base character. The characters for which the canonical -combining class is 0 are the base characters, and the characters for -which it is greater than 0 are the combining characters. Combining -characters are rendered near/attached/around their base character, and -combining characters with small combining classes are attached "first" -or "closer" to the base character. +to its base character. The characters for which the canonical combining +class is 0 are the base characters, and the characters for which it is +greater than 0 are the combining characters. Combining characters are +rendered near/attached/around their base character, and combining +characters with small combining classes are attached "first" or "closer" +to the base character. The canonical combining class of a character is a number in the range 0..255. The possible values are described in the Unicode Character -Database `http://www.unicode.org/Public/UNIDATA/UCD.html'. The list +Database <http://www.unicode.org/Public/UNIDATA/UCD.html>. The list here is not definitive; more values can be added in future versions. -- Constant: int UC_CCC_NR - The canonical combining class value for "Not Reordered" characters. + The canonical combining class value for “Not Reordered” characters. The value is 0. -- Constant: int UC_CCC_OV - The canonical combining class value for "Overlay" characters. + The canonical combining class value for “Overlay” characters. -- Constant: int UC_CCC_NK - The canonical combining class value for "Nukta" characters. + The canonical combining class value for “Nukta” characters. -- Constant: int UC_CCC_KV - The canonical combining class value for "Kana Voicing" characters. + The canonical combining class value for “Kana Voicing” characters. -- Constant: int UC_CCC_VR - The canonical combining class value for "Virama" characters. + The canonical combining class value for “Virama” characters. -- Constant: int UC_CCC_ATBL - The canonical combining class value for "Attached Below Left" + The canonical combining class value for “Attached Below Left” characters. -- Constant: int UC_CCC_ATB - The canonical combining class value for "Attached Below" + The canonical combining class value for “Attached Below” + characters. + + -- Constant: int UC_CCC_ATA + The canonical combining class value for “Attached Above” characters. -- Constant: int UC_CCC_ATAR - The canonical combining class value for "Attached Above Right" + The canonical combining class value for “Attached Above Right” characters. -- Constant: int UC_CCC_BL - The canonical combining class value for "Below Left" characters. + The canonical combining class value for “Below Left” characters. -- Constant: int UC_CCC_B - The canonical combining class value for "Below" characters. + The canonical combining class value for “Below” characters. -- Constant: int UC_CCC_BR - The canonical combining class value for "Below Right" characters. + The canonical combining class value for “Below Right” characters. -- Constant: int UC_CCC_L - The canonical combining class value for "Left" characters. + The canonical combining class value for “Left” characters. -- Constant: int UC_CCC_R - The canonical combining class value for "Right" characters. + The canonical combining class value for “Right” characters. -- Constant: int UC_CCC_AL - The canonical combining class value for "Above Left" characters. + The canonical combining class value for “Above Left” characters. -- Constant: int UC_CCC_A - The canonical combining class value for "Above" characters. + The canonical combining class value for “Above” characters. -- Constant: int UC_CCC_AR - The canonical combining class value for "Above Right" characters. + The canonical combining class value for “Above Right” characters. -- Constant: int UC_CCC_DB - The canonical combining class value for "Double Below" characters. + The canonical combining class value for “Double Below” characters. -- Constant: int UC_CCC_DA - The canonical combining class value for "Double Above" characters. + The canonical combining class value for “Double Above” characters. -- Constant: int UC_CCC_IS - The canonical combining class value for "Iota Subscript" + The canonical combining class value for “Iota Subscript” characters. + The following functions associate canonical combining classes with +their name. + + -- Function: const char * uc_combining_class_name (int CCC) + Returns the name of a canonical combining class, more precisely, + the abbreviated name. Returns NULL if the canonical combining + class is a numeric value without a name. + + -- Function: const char * uc_combining_class_long_name (int CCC) + Returns the long name of a canonical combining class. Returns NULL + if the canonical combining class is a numeric value without a name. + + -- Function: int uc_combining_class_byname (const char *CCC_NAME) + Returns the canonical combining class given by name, e.g. ‘"BL"’, + or by long name, e.g. ‘"Below Left"’. This lookup ignores spaces, + underscores, or hyphens as word separators and is + case-insignificant. + The following function looks up the canonical combining class of a character. @@ -1995,113 +1951,119 @@ character. Returns the canonical combining class of a Unicode character. -File: libunistring.info, Node: Bidirectional category, Next: Decimal digit value, Prev: Canonical combining class, Up: unictype.h +File: libunistring.info, Node: Bidi class, Next: Decimal digit value, Prev: Canonical combining class, Up: unictype.h -8.3 Bidirectional category -========================== +8.3 Bidi class +============== - Every Unicode character or code point has a _bidirectional category_ -assigned to it. + Every Unicode character or code point has a _bidi class_ assigned to +it. Before Unicode 4.0, this concept was known as _bidirectional +category_. - The bidirectional category guides the bidirectional algorithm -(`http://www.unicode.org/reports/tr9/'). The possible values are the + The bidi class guides the bidirectional algorithm +(<http://www.unicode.org/reports/tr9/>). The possible values are the following. -- Constant: int UC_BIDI_L - The bidirectional category for `Left-to-Right`" characters. + The bidi class for ‘Left-to-Right‘” characters. -- Constant: int UC_BIDI_LRE - The bidirectional category for "Left-to-Right Embedding" - characters. + The bidi class for “Left-to-Right Embedding” characters. -- Constant: int UC_BIDI_LRO - The bidirectional category for "Left-to-Right Override" characters. + The bidi class for “Left-to-Right Override” characters. -- Constant: int UC_BIDI_R - The bidirectional category for "Right-to-Left" characters. + The bidi class for “Right-to-Left” characters. -- Constant: int UC_BIDI_AL - The bidirectional category for "Right-to-Left Arabic" characters. + The bidi class for “Right-to-Left Arabic” characters. -- Constant: int UC_BIDI_RLE - The bidirectional category for "Right-to-Left Embedding" - characters. + The bidi class for “Right-to-Left Embedding” characters. -- Constant: int UC_BIDI_RLO - The bidirectional category for "Right-to-Left Override" characters. + The bidi class for “Right-to-Left Override” characters. -- Constant: int UC_BIDI_PDF - The bidirectional category for "Pop Directional Format" characters. + The bidi class for “Pop Directional Format” characters. -- Constant: int UC_BIDI_EN - The bidirectional category for "European Number" characters. + The bidi class for “European Number” characters. -- Constant: int UC_BIDI_ES - The bidirectional category for "European Number Separator" - characters. + The bidi class for “European Number Separator” characters. -- Constant: int UC_BIDI_ET - The bidirectional category for "European Number Terminator" - characters. + The bidi class for “European Number Terminator” characters. -- Constant: int UC_BIDI_AN - The bidirectional category for "Arabic Number" characters. + The bidi class for “Arabic Number” characters. -- Constant: int UC_BIDI_CS - The bidirectional category for "Common Number Separator" - characters. + The bidi class for “Common Number Separator” characters. -- Constant: int UC_BIDI_NSM - The bidirectional category for "Non-Spacing Mark" characters. + The bidi class for “Non-Spacing Mark” characters. -- Constant: int UC_BIDI_BN - The bidirectional category for "Boundary Neutral" characters. + The bidi class for “Boundary Neutral” characters. -- Constant: int UC_BIDI_B - The bidirectional category for "Paragraph Separator" characters. + The bidi class for “Paragraph Separator” characters. -- Constant: int UC_BIDI_S - The bidirectional category for "Segment Separator" characters. + The bidi class for “Segment Separator” characters. -- Constant: int UC_BIDI_WS - The bidirectional category for "Whitespace" characters. + The bidi class for “Whitespace” characters. -- Constant: int UC_BIDI_ON - The bidirectional category for "Other Neutral" characters. + The bidi class for “Other Neutral” characters. The following functions implement the association between a bidirectional category and its name. + -- Function: const char * uc_bidi_class_name (int BIDI_CLASS) -- Function: const char * uc_bidi_category_name (int CATEGORY) - Returns the name of a bidirectional category. + Returns the name of a bidi class, more precisely, the abbreviated + name. + -- Function: const char * uc_bidi_class_long_name (int BIDI_CLASS) + Returns the long name of a bidi class. + + -- Function: int uc_bidi_class_byname (const char *BIDI_CLASS_NAME) -- Function: int uc_bidi_category_byname (const char *CATEGORY_NAME) - Returns the bidirectional category given by name, e.g. `"LRE"'. + Returns the bidi class given by name, e.g. ‘"LRE"’, or by long + name, e.g. ‘"Left-to-Right Embedding"’. This lookup ignores + spaces, underscores, or hyphens as word separators and is + case-insignificant. The following functions view bidirectional categories as sets of Unicode characters. + -- Function: int uc_bidi_class (ucs4_t UC) -- Function: int uc_bidi_category (ucs4_t UC) - Returns the bidirectional category of a Unicode character. + Returns the bidi class of a Unicode character. + -- Function: bool uc_is_bidi_class (ucs4_t UC, int BIDI_CLASS) -- Function: bool uc_is_bidi_category (ucs4_t UC, int CATEGORY) - Tests whether a Unicode character belongs to a given bidirectional - category. + Tests whether a Unicode character belongs to a given bidi class. -File: libunistring.info, Node: Decimal digit value, Next: Digit value, Prev: Bidirectional category, Up: unictype.h +File: libunistring.info, Node: Decimal digit value, Next: Digit value, Prev: Bidi class, Up: unictype.h 8.4 Decimal digit value ======================= - Decimal digits (like the digits from `0' to `9') exist in many + Decimal digits (like the digits from ‘0’ to ‘9’) exist in many scripts. The following function converts a decimal digit character to its numerical value. -- Function: int uc_decimal_value (ucs4_t UC) - 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 do not represent a decimal digit. + 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 do + not represent a decimal digit. File: libunistring.info, Node: Digit value, Next: Numeric value, Prev: Decimal digit value, Up: unictype.h @@ -2130,23 +2092,22 @@ system, like the Roman numerals, and fractional numbers, like 1/4 or The following type represents the numeric value of a Unicode character. - -- Type: uc_fraction_t This is a structure type with the following fields: int numerator; int denominator; - An integer N is represented by `numerator = N', `denominator = 1'. + An integer N is represented by ‘numerator = N’, ‘denominator = 1’. The following function converts a number character to its numerical value. -- Function: uc_fraction_t uc_numeric_value (ucs4_t UC) - Returns the numeric value of a Unicode character. The return - value is a fraction, or the pseudo-fraction `{ 0, 0 }' for - characters that do not represent a number. + Returns the numeric value of a Unicode character. The return value + is a fraction, or the pseudo-fraction ‘{ 0, 0 }’ for characters + that do not represent a number. -File: libunistring.info, Node: Mirrored character, Next: Properties, Prev: Numeric value, Up: unictype.h +File: libunistring.info, Node: Mirrored character, Next: Arabic shaping, Prev: Numeric value, Up: unictype.h 8.7 Mirrored character ====================== @@ -2159,14 +2120,175 @@ character with the opening brace character, and so on. character. -- Function: bool uc_mirror_char (ucs4_t UC, ucs4_t *PUC) - Stores the mirrored character of a Unicode character UC in `*PUC' - and returns `true', if it exists. Otherwise it stores UC - unmodified in `*PUC' and returns `false'. + Stores the mirrored character of a Unicode character UC in ‘*PUC’ + and returns ‘true’, if it exists. Otherwise it stores UC + unmodified in ‘*PUC’ and returns ‘false’. -File: libunistring.info, Node: Properties, Next: Scripts, Prev: Mirrored character, Up: unictype.h +File: libunistring.info, Node: Arabic shaping, Next: Properties, Prev: Mirrored character, Up: unictype.h + +8.8 Arabic shaping +================== + + When Arabic characters are rendered, after bidi reordering has taken +place, the shape of the glyphs are modified so that many adjacent glyphs +are joined. Two character properties describe how this “Arabic shaping” +takes place: the joining type and the joining group. + +* Menu: + +* Joining type:: +* Joining group:: + + +File: libunistring.info, Node: Joining type, Next: Joining group, Up: Arabic shaping + +8.8.1 Joining type of Arabic characters +--------------------------------------- + + 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 neighbour characters are rendered depending on this character. + + The joining type has the following possible values: + + -- Constant: int UC_JOINING_TYPE_U + “Non joining”: Characters of this joining type prohibit joining. + + -- Constant: int UC_JOINING_TYPE_T + “Transparent”: Characters of this joining type are skipped when + considering joining. + + -- Constant: int UC_JOINING_TYPE_C + “Join causing”: Characters of this joining type cause their + neighbour characters to change their shapes but don’t change their + own shape. + + -- Constant: int UC_JOINING_TYPE_L + “Left joining”: Characters of this joining type have two shapes, + isolated and initial. Such characters currently don’t exist. + + -- Constant: int UC_JOINING_TYPE_R + “Right joining”: Characters of this joining type have two shapes, + isolated and final. + + -- Constant: int UC_JOINING_TYPE_D + “Dual joining”: Characters of this joining type have four shapes, + initial, medial, final, and isolated. + + The following functions implement the association between a joining +type and its name. + + -- Function: const char * uc_joining_type_name (int JOINING_TYPE) + Returns the name of a joining type. -8.8 Properties + -- Function: const char * uc_joining_type_long_name (int JOINING_TYPE) + Returns the long name of a joining type. + + -- Function: int uc_joining_type_byname (const char *JOINING_TYPE_NAME) + Returns the joining type given by name, e.g. ‘"D"’, or by long + name, e.g. ‘"Dual Joining’. This lookup ignores spaces, + underscores, or hyphens as word separators and is + case-insignificant. + + The following function gives the joining type of every Unicode +character. + + -- Function: int uc_joining_type (ucs4_t UC) + Returns the joining type of a Unicode character. + + +File: libunistring.info, Node: Joining group, Prev: Joining type, Up: Arabic shaping + +8.8.2 Joining group of Arabic characters +---------------------------------------- + + 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 +two contexts of right-joining characters. + + The joining group has the following possible values: + + -- Constant: int UC_JOINING_GROUP_NONE + -- Constant: int UC_JOINING_GROUP_AIN + -- Constant: int UC_JOINING_GROUP_ALAPH + -- Constant: int UC_JOINING_GROUP_ALEF + -- Constant: int UC_JOINING_GROUP_BEH + -- Constant: int UC_JOINING_GROUP_BETH + -- Constant: int UC_JOINING_GROUP_BURUSHASKI_YEH_BARREE + -- Constant: int UC_JOINING_GROUP_DAL + -- Constant: int UC_JOINING_GROUP_DALATH_RISH + -- Constant: int UC_JOINING_GROUP_E + -- Constant: int UC_JOINING_GROUP_FARSI_YEH + -- Constant: int UC_JOINING_GROUP_FE + -- Constant: int UC_JOINING_GROUP_FEH + -- Constant: int UC_JOINING_GROUP_FINAL_SEMKATH + -- Constant: int UC_JOINING_GROUP_GAF + -- Constant: int UC_JOINING_GROUP_GAMAL + -- Constant: int UC_JOINING_GROUP_HAH + -- Constant: int UC_JOINING_GROUP_HE + -- Constant: int UC_JOINING_GROUP_HEH + -- Constant: int UC_JOINING_GROUP_HEH_GOAL + -- Constant: int UC_JOINING_GROUP_HETH + -- Constant: int UC_JOINING_GROUP_KAF + -- Constant: int UC_JOINING_GROUP_KAPH + -- Constant: int UC_JOINING_GROUP_KHAPH + -- Constant: int UC_JOINING_GROUP_KNOTTED_HEH + -- Constant: int UC_JOINING_GROUP_LAM + -- Constant: int UC_JOINING_GROUP_LAMADH + -- Constant: int UC_JOINING_GROUP_MEEM + -- Constant: int UC_JOINING_GROUP_MIM + -- Constant: int UC_JOINING_GROUP_NOON + -- Constant: int UC_JOINING_GROUP_NUN + -- Constant: int UC_JOINING_GROUP_NYA + -- Constant: int UC_JOINING_GROUP_PE + -- Constant: int UC_JOINING_GROUP_QAF + -- Constant: int UC_JOINING_GROUP_QAPH + -- Constant: int UC_JOINING_GROUP_REH + -- Constant: int UC_JOINING_GROUP_REVERSED_PE + -- Constant: int UC_JOINING_GROUP_SAD + -- Constant: int UC_JOINING_GROUP_SADHE + -- Constant: int UC_JOINING_GROUP_SEEN + -- Constant: int UC_JOINING_GROUP_SEMKATH + -- Constant: int UC_JOINING_GROUP_SHIN + -- Constant: int UC_JOINING_GROUP_SWASH_KAF + -- Constant: int UC_JOINING_GROUP_SYRIAC_WAW + -- Constant: int UC_JOINING_GROUP_TAH + -- Constant: int UC_JOINING_GROUP_TAW + -- Constant: int UC_JOINING_GROUP_TEH_MARBUTA + -- Constant: int UC_JOINING_GROUP_TEH_MARBUTA_GOAL + -- Constant: int UC_JOINING_GROUP_TETH + -- Constant: int UC_JOINING_GROUP_WAW + -- Constant: int UC_JOINING_GROUP_YEH + -- Constant: int UC_JOINING_GROUP_YEH_BARREE + -- Constant: int UC_JOINING_GROUP_YEH_WITH_TAIL + -- Constant: int UC_JOINING_GROUP_YUDH + -- Constant: int UC_JOINING_GROUP_YUDH_HE + -- Constant: int UC_JOINING_GROUP_ZAIN + -- Constant: int UC_JOINING_GROUP_ZHAIN + + The following functions implement the association between a joining +group and its name. + + -- Function: const char * uc_joining_group_name (int JOINING_GROUP) + Returns the name of a joining group. + + -- Function: int uc_joining_group_byname (const char + *JOINING_GROUP_NAME) + Returns the joining group given by name, e.g. ‘"Teh_Marbuta"’. + This lookup ignores spaces, underscores, or hyphens as word + separators and is case-insignificant. + + The following function gives the joining group of every Unicode +character. + + -- Function: int uc_joining_group (ucs4_t UC) + Returns the joining group of a Unicode character. + + +File: libunistring.info, Node: Properties, Next: Scripts, Prev: Arabic shaping, Up: unictype.h + +8.9 Properties ============== This section defines boolean properties of Unicode characters. This @@ -2175,8 +2297,8 @@ In other words, the property can be viewed as a subset of the set of Unicode characters. The GNU libunistring library provides two kinds of API for working -with properties. The object oriented API uses a type `uc_property_t' -to designate a property. In the function-based API, which is a bit more +with properties. The object oriented API uses a type ‘uc_property_t’ to +designate a property. In the function-based API, which is a bit more low level, a property is merely a function. * Menu: @@ -2187,7 +2309,7 @@ low level, a property is merely a function. File: libunistring.info, Node: Properties as objects, Next: Properties as functions, Up: Properties -8.8.1 Properties as objects - the object oriented API +8.9.1 Properties as objects – the object oriented API ----------------------------------------------------- The following type designates a property on Unicode characters. @@ -2207,7 +2329,7 @@ File: libunistring.info, Node: Properties as objects, Next: Properties as func -- Constant: uc_property_t UC_PROPERTY_NOT_A_CHARACTER -- Constant: uc_property_t UC_PROPERTY_DEFAULT_IGNORABLE_CODE_POINT -- Constant: uc_property_t -UC_PROPERTY_OTHER_DEFAULT_IGNORABLE_CODE_POINT + UC_PROPERTY_OTHER_DEFAULT_IGNORABLE_CODE_POINT -- Constant: uc_property_t UC_PROPERTY_DEPRECATED -- Constant: uc_property_t UC_PROPERTY_LOGICAL_ORDER_EXCEPTION -- Constant: uc_property_t UC_PROPERTY_VARIATION_SELECTOR @@ -2221,6 +2343,13 @@ UC_PROPERTY_OTHER_DEFAULT_IGNORABLE_CODE_POINT -- Constant: uc_property_t UC_PROPERTY_LOWERCASE -- Constant: uc_property_t UC_PROPERTY_OTHER_LOWERCASE -- Constant: uc_property_t UC_PROPERTY_TITLECASE + -- Constant: uc_property_t UC_PROPERTY_CASED + -- Constant: uc_property_t UC_PROPERTY_CASE_IGNORABLE + -- Constant: uc_property_t UC_PROPERTY_CHANGES_WHEN_LOWERCASED + -- Constant: uc_property_t UC_PROPERTY_CHANGES_WHEN_UPPERCASED + -- Constant: uc_property_t UC_PROPERTY_CHANGES_WHEN_TITLECASED + -- Constant: uc_property_t UC_PROPERTY_CHANGES_WHEN_CASEFOLDED + -- Constant: uc_property_t UC_PROPERTY_CHANGES_WHEN_CASEMAPPED -- Constant: uc_property_t UC_PROPERTY_SOFT_DOTTED The following properties are related to identifiers. @@ -2307,17 +2436,21 @@ UC_PROPERTY_OTHER_DEFAULT_IGNORABLE_CODE_POINT -- Function: uc_property_t uc_property_byname (const char *PROPERTY_NAME) - Returns the property given by name, e.g. `"White space"'. If a + Returns the property given by name, e.g. ‘"White space"’. If a property with the given name exists, the result will satisfy the - `uc_property_is_valid' predicate. Otherwise the result will not + ‘uc_property_is_valid’ predicate. Otherwise the result will not satisfy this predicate and must not be passed to functions that - expect an `uc_property_t' argument. + expect an ‘uc_property_t’ argument. + + This lookup ignores spaces, underscores, or hyphens as word + separators, is case-insignificant, and supports the aliases listed + in Unicode’s ‘PropertyAliases.txt’ file. This function references a big table of all predefined properties. Its use can significantly increase the size of your application. -- Function: bool uc_property_is_valid (uc_property_t property) - Returns `true' when the given property is valid, or `false' + Returns ‘true’ when the given property is valid, or ‘false’ otherwise. The following function views a property as a set of Unicode @@ -2329,7 +2462,7 @@ characters. File: libunistring.info, Node: Properties as functions, Prev: Properties as objects, Up: Properties -8.8.2 Properties as functions - the functional API +8.9.2 Properties as functions – the functional API -------------------------------------------------- The following are general properties. @@ -2355,6 +2488,13 @@ File: libunistring.info, Node: Properties as functions, Prev: Properties as ob -- Function: bool uc_is_property_lowercase (ucs4_t UC) -- Function: bool uc_is_property_other_lowercase (ucs4_t UC) -- Function: bool uc_is_property_titlecase (ucs4_t UC) + -- Function: bool uc_is_property_cased (ucs4_t UC) + -- Function: bool uc_is_property_case_ignorable (ucs4_t UC) + -- Function: bool uc_is_property_changes_when_lowercased (ucs4_t UC) + -- Function: bool uc_is_property_changes_when_uppercased (ucs4_t UC) + -- Function: bool uc_is_property_changes_when_titlecased (ucs4_t UC) + -- Function: bool uc_is_property_changes_when_casefolded (ucs4_t UC) + -- Function: bool uc_is_property_changes_when_casemapped (ucs4_t UC) -- Function: bool uc_is_property_soft_dotted (ucs4_t UC) The following properties are related to identifiers. @@ -2440,8 +2580,8 @@ File: libunistring.info, Node: Properties as functions, Prev: Properties as ob File: libunistring.info, Node: Scripts, Next: Blocks, Prev: Properties, Up: unictype.h -8.9 Scripts -=========== +8.10 Scripts +============ The Unicode characters are subdivided into scripts. @@ -2452,17 +2592,17 @@ File: libunistring.info, Node: Scripts, Next: Blocks, Prev: Properties, Up: allocated read-only data. It contains the following fields: const char *name; - The `name' field contains the name of the script. + The ‘name’ field contains the name of the script. The following functions look up a script. -- Function: const uc_script_t * uc_script (ucs4_t UC) - Returns the script of a Unicode character. Returns NULL if UC - does not belong to any script. + Returns the script of a Unicode character. Returns NULL if UC does + not belong to any script. -- Function: const uc_script_t * uc_script_byname (const char *SCRIPT_NAME) - Returns the script given by its name, e.g. `"HAN"'. Returns NULL + Returns the script given by its name, e.g. ‘"HAN"’. Returns NULL if a script with the given name does not exist. The following function views a script as a set of Unicode characters. @@ -2475,12 +2615,12 @@ File: libunistring.info, Node: Scripts, Next: Blocks, Prev: Properties, Up: -- Function: void uc_all_scripts (const uc_script_t **SCRIPTS, size_t *COUNT) Get the list of all scripts. Stores a pointer to an array of all - scripts in `*SCRIPTS' and the length of this array in `*COUNT'. + scripts in ‘*SCRIPTS’ and the length of this array in ‘*COUNT’. File: libunistring.info, Node: Blocks, Next: ISO C and Java syntax, Prev: Scripts, Up: unictype.h -8.10 Blocks +8.11 Blocks =========== The Unicode characters are subdivided into blocks. A block is an @@ -2495,11 +2635,11 @@ interval of Unicode code points. ucs4_t end; const char *name; - The `start' field is the first Unicode code point in the block. + The ‘start’ field is the first Unicode code point in the block. - The `end' field is the last Unicode code point in the block. + The ‘end’ field is the last Unicode code point in the block. - The `name' field is the name of the block. + The ‘name’ field is the name of the block. The following function looks up a block. @@ -2516,26 +2656,26 @@ interval of Unicode code points. -- Function: void uc_all_blocks (const uc_block_t **BLOCKS, size_t *COUNT) Get the list of all blocks. Stores a pointer to an array of all - blocks in `*BLOCKS' and the length of this array in `*COUNT'. + blocks in ‘*BLOCKS’ and the length of this array in ‘*COUNT’. File: libunistring.info, Node: ISO C and Java syntax, Next: Classifications like in ISO C, Prev: Blocks, Up: unictype.h -8.11 ISO C and Java syntax +8.12 ISO C and Java syntax ========================== The following properties are taken from language standards. The supported language standards are ISO C 99 and Java. -- Function: bool uc_is_c_whitespace (ucs4_t UC) - Tests whether a Unicode character is considered whitespace in ISO - C 99. + Tests whether a Unicode character is considered whitespace in ISO C + 99. -- Function: bool uc_is_java_whitespace (ucs4_t UC) Tests whether a Unicode character is considered whitespace in Java. - The following enumerated values are the possible return values of -the functions `uc_c_ident_category' and `uc_java_ident_category'. + The following enumerated values are the possible return values of the +functions ‘uc_c_ident_category’ and ‘uc_java_ident_category’. -- Constant: int UC_IDENTIFIER_START This return value means that the given character is valid as first @@ -2546,12 +2686,12 @@ the functions `uc_c_ident_category' and `uc_java_ident_category'. subsequent character only. -- Constant: int UC_IDENTIFIER_INVALID - This return value means that the given character is not valid in - an identifier. + This return value means that the given character is not valid in an + identifier. -- Constant: int UC_IDENTIFIER_IGNORABLE - This return value (only for Java) means that the given character - is ignorable. + This return value (only for Java) means that the given character is + ignorable. The following function determine whether a given character can be a constituent of an identifier in the given programming language. @@ -2567,25 +2707,25 @@ constituent of an identifier in the given programming language. File: libunistring.info, Node: Classifications like in ISO C, Prev: ISO C and Java syntax, Up: unictype.h -8.12 Classifications like in ISO C +8.13 Classifications like in ISO C ================================== The following character classifications mimic those declared in the -ISO C header files `<ctype.h>' and `<wctype.h>'. These functions are +ISO C header files ‘<ctype.h>’ and ‘<wctype.h>’. These functions are deprecated, because this set of functions was designed with ASCII in mind and cannot reflect the more diverse reality of the Unicode character set. But they can be a quick-and-dirty porting aid when -migrating from `wchar_t' APIs to Unicode strings. +migrating from ‘wchar_t’ APIs to Unicode strings. -- Function: bool uc_is_alnum (ucs4_t UC) - Tests for any character for which `uc_is_alpha' or `uc_is_digit' is + Tests for any character for which ‘uc_is_alpha’ or ‘uc_is_digit’ is true. -- Function: bool uc_is_alpha (ucs4_t UC) - Tests for any character for which `uc_is_upper' or `uc_is_lower' is + Tests for any character for which ‘uc_is_upper’ or ‘uc_is_lower’ is true, or any character that is one of a locale-specific set of - characters for which none of `uc_is_cntrl', `uc_is_digit', - `uc_is_punct', or `uc_is_space' is true. + characters for which none of ‘uc_is_cntrl’, ‘uc_is_digit’, + ‘uc_is_punct’, or ‘uc_is_space’ is true. -- Function: bool uc_is_cntrl (ucs4_t UC) Tests for any control character. @@ -2595,13 +2735,13 @@ migrating from `wchar_t' APIs to Unicode strings. character. -- Function: bool uc_is_graph (ucs4_t UC) - Tests for any character for which `uc_is_print' is true and - `uc_is_space' is false. + Tests for any character for which ‘uc_is_print’ is true and + ‘uc_is_space’ is false. -- Function: bool uc_is_lower (ucs4_t UC) Tests for any character that corresponds to a lowercase letter or is one of a locale-specific set of characters for which none of - `uc_is_cntrl', `uc_is_digit', `uc_is_punct', or `uc_is_space' is + ‘uc_is_cntrl’, ‘uc_is_digit’, ‘uc_is_punct’, or ‘uc_is_space’ is true. -- Function: bool uc_is_print (ucs4_t UC) @@ -2609,18 +2749,18 @@ migrating from `wchar_t' APIs to Unicode strings. -- Function: bool uc_is_punct (ucs4_t UC) Tests for any printing character that is one of a locale-specific - set of characters for which neither `uc_is_space' nor - `uc_is_alnum' is true. + set of characters for which neither ‘uc_is_space’ nor ‘uc_is_alnum’ + is true. -- Function: bool uc_is_space (ucs4_t UC) - Test for any character that corresponds to a locale-specific set - of characters for which none of `uc_is_alnum', `uc_is_graph', or - `uc_is_punct' is true. + Test for any character that corresponds to a locale-specific set of + characters for which none of ‘uc_is_alnum’, ‘uc_is_graph’, or + ‘uc_is_punct’ is true. -- Function: bool uc_is_upper (ucs4_t UC) Tests for any character that corresponds to an uppercase letter or is one of a locale-specific set of characters for which none of - `uc_is_cntrl', `uc_is_digit', `uc_is_punct', or `uc_is_space' is + ‘uc_is_cntrl’, ‘uc_is_digit’, ‘uc_is_punct’, or ‘uc_is_space’ is true. -- Function: bool uc_is_xdigit (ucs4_t UC) @@ -2630,12 +2770,12 @@ migrating from `wchar_t' APIs to Unicode strings. -- Function: bool uc_is_blank (ucs4_t UC) Tests for any character that corresponds to a standard blank character or a locale-specific set of characters for which - `uc_is_alnum' is false. + ‘uc_is_alnum’ is false. -File: libunistring.info, Node: uniwidth.h, Next: uniwbrk.h, Prev: unictype.h, Up: Top +File: libunistring.info, Node: uniwidth.h, Next: unigbrk.h, Prev: unictype.h, Up: Top -9 Display width `<uniwidth.h>' +9 Display width ‘<uniwidth.h>’ ****************************** This include file declares functions that return the display width, @@ -2643,16 +2783,16 @@ measured in columns, of characters or strings, when output to a device that uses non-proportional fonts. 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 +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, there are scripts with complex rendering, like the Indic scripts. For these scripts, there is no such concept as non-proportional fonts. Therefore the results of these functions -usually work fine on most scripts and on most characters but can fail -to represent the actual display width. +usually work fine on most scripts and on most characters but can fail to +represent the actual display width. These functions are locale dependent. The ENCODING argument -identifies the encoding (e.g. `"ISO-8859-2"' for Polish). +identifies the encoding (e.g. ‘"ISO-8859-2"’ for Polish). -- Function: int uc_width (ucs4_t UC, const char *ENCODING) Determines and returns the number of column positions required for @@ -2666,8 +2806,8 @@ identifies the encoding (e.g. `"ISO-8859-2"' for Polish). -- Function: int u32_width (const uint32_t *S, size_t N, const char *ENCODING) Determines and returns the number of column positions required for - first N units (or fewer if S ends before this) in S. This - function ignores control characters in the string. + first N units (or fewer if S ends before this) in S. This function + ignores control characters in the string. -- Function: int u8_strwidth (const uint8_t *S, const char *ENCODING) -- Function: int u16_strwidth (const uint16_t *S, const char *ENCODING) @@ -2676,16 +2816,149 @@ identifies the encoding (e.g. `"ISO-8859-2"' for Polish). S. This function ignores control characters in the string. -File: libunistring.info, Node: uniwbrk.h, Next: unilbrk.h, Prev: uniwidth.h, Up: Top +File: libunistring.info, Node: unigbrk.h, Next: uniwbrk.h, Prev: uniwidth.h, Up: Top -10 Word breaks in strings `<uniwbrk.h>' +10 Grapheme cluster breaks in strings ‘<unigbrk.h>’ +*************************************************** + + This include file declares functions for determining where in a +string “grapheme clusters” start and end. A “grapheme cluster” is an +approximation to a user-perceived character, which sometimes corresponds +to multiple Unicode characters. Editing operations such as mouse +selection, cursor movement, and backspacing often operate on grapheme +clusters as units, not on individual characters. + + Some grapheme clusters are built from a base character and a +combining character. The letter ‘é’, for example, is most commonly +represented in Unicode as a single character U+00E8 LATIN SMALL LETTER E +WITH ACUTE. It is, however, equally valid to use the pair of characters +U+0065 LATIN SMALL LETTER E followed by U+0301 COMBINING ACUTE ACCENT. +Since the user would perceive this pair of characters as a single +character, they would be grouped into a single grapheme cluster. + + But there are also grapheme clusters that consist of several base +characters. For example, a Devanagari letter and a Devanagari vowel +sign that follows it may form a grapheme cluster. Similarly, some pairs +of Thai characters and Hangul syllables (formed by two or three Hangul +characters) are grapheme clusters. + +* Menu: + +* Grapheme cluster breaks in a string:: +* Grapheme cluster break property:: + + +File: libunistring.info, Node: Grapheme cluster breaks in a string, Next: Grapheme cluster break property, Up: unigbrk.h + +10.1 Grapheme cluster breaks in a string +======================================== + + The following functions find a single boundary between grapheme +clusters in a string. + + -- Function: void u8_grapheme_next (const uint8_t *S, const uint8_t + *END) + -- Function: void u16_grapheme_next (const uint16_t *S, const uint16_t + *END) + -- Function: void u32_grapheme_next (const uint32_t *S, const uint32_t + *END) + Returns the start of the next grapheme cluster following S, or END + if no grapheme cluster break is encountered before it. Returns + NULL if and only if ‘S == END’. + + -- Function: void u8_grapheme_prev (const uint8_t *S, const uint8_t + *START) + -- Function: void u16_grapheme_prev (const uint16_t *S, const uint16_t + *START) + -- Function: void u32_grapheme_prev (const uint32_t *S, const uint32_t + *START) + Returns the start of the grapheme cluster preceding S, or START if + no grapheme cluster break is encountered before it. Returns NULL + if and only if ‘S == START’. + + The following functions determine all of the grapheme cluster +boundaries in a string. + + -- Function: void u8_grapheme_breaks (const uint8_t *S, size_t N, char + *P) + -- Function: void u16_grapheme_breaks (const uint16_t *S, size_t N, + char *P) + -- Function: void u32_grapheme_breaks (const uint32_t *S, size_t N, + char *P) + -- Function: void ulc_grapheme_breaks (const char *S, size_t N, char + *P) + Determines the grapheme cluster break points in S, an array of N + units, and stores the result at ‘P[0..N-1]’. + ‘P[i] = 1’ + means that there is a grapheme cluster boundary between + ‘S[i-1]’ and ‘S[i]’. + ‘P[i] = 0’ + means that ‘S[i-1]’ and ‘S[i]’ are part of the same grapheme + cluster. + ‘P[0]’ is always set to 1, because there is always a grapheme + cluster break at start of text. + + +File: libunistring.info, Node: Grapheme cluster break property, Prev: Grapheme cluster breaks in a string, Up: unigbrk.h + +10.2 Grapheme cluster break property +==================================== + + This is a more low-level API. The grapheme cluster break property is +a property defined in Unicode Standard Annex #29, section “Grapheme +Cluster Boundaries”, see +<http://www.unicode.org/reports/tr29/#Grapheme_Cluster_Boundaries>. It +is used for determining the grapheme cluster breaks in a string. + + The following are the possible values of the grapheme cluster break +property. More values may be added in the future. + + -- Constant: int GBP_OTHER + -- Constant: int GBP_CR + -- Constant: int GBP_LF + -- Constant: int GBP_CONTROL + -- Constant: int GBP_EXTEND + -- Constant: int GBP_PREPEND + -- Constant: int GBP_SPACINGMARK + -- Constant: int GBP_L + -- Constant: int GBP_V + -- Constant: int GBP_T + -- Constant: int GBP_LV + -- Constant: int GBP_LVT + + The following function looks up the grapheme cluster break property +of a character. + + -- Function: int uc_graphemeclusterbreak_property (ucs4_t UC) + Returns the Grapheme_Cluster_Break property of a Unicode character. + + The following function determines whether there is a grapheme cluster +break between two Unicode characters. It is the primitive upon which +the higher-level functions in the previous section are directly based. + + -- Function: bool uc_is_grapheme_break (ucs4_t A, ucs4_t B) + Returns true if there is an grapheme cluster boundary between + Unicode characters A and B. + + There is always a grapheme cluster break at the start or end of + text. You can specify zero for A or B to indicate start of text or + end of text, respectively. + + This implements the extended (not legacy) grapheme cluster rules + described in the Unicode standard, because the standard says that + they are preferred. + + +File: libunistring.info, Node: uniwbrk.h, Next: unilbrk.h, Prev: unigbrk.h, Up: Top + +11 Word breaks in strings ‘<uniwbrk.h>’ *************************************** This include file declares functions for determining where in a -string "words" start and end. Here "words" are not necessarily the -same as entities that can be looked up in dictionaries, but rather -groups of consecutive characters that should not be split by text -processing operations. +string “words” start and end. Here “words” are not necessarily the same +as entities that can be looked up in dictionaries, but rather groups of +consecutive characters that should not be split by text processing +operations. * Menu: @@ -2695,7 +2968,7 @@ processing operations. File: libunistring.info, Node: Word breaks in a string, Next: Word break property, Up: uniwbrk.h -10.1 Word breaks in a string +11.1 Word breaks in a string ============================ The following functions determine the word breaks in a string. @@ -2705,27 +2978,26 @@ File: libunistring.info, Node: Word breaks in a string, Next: Word break prope -- Function: void u32_wordbreaks (const uint32_t *S, size_t N, char *P) -- Function: void ulc_wordbreaks (const char *S, size_t N, char *P) Determines the word break points in S, an array of N units, and - stores the result at `P[0..N-1]'. - `P[i] = 1' - means that there is a word boundary between `S[i-1]' and - `S[i]'. - - `P[i] = 0' - means that `S[i-1]' and `S[i]' must not be separated. - `P[0]' is always set to 0. If an application wants to consider a + stores the result at ‘P[0..N-1]’. + ‘P[i] = 1’ + means that there is a word boundary between ‘S[i-1]’ and + ‘S[i]’. + ‘P[i] = 0’ + means that ‘S[i-1]’ and ‘S[i]’ must not be separated. + ‘P[0]’ is always set to 0. If an application wants to consider a word break to be present at the beginning of the string (before - `S[0]') or at the end of the string (after `S[0..N-1]'), it has to + ‘S[0]’) or at the end of the string (after ‘S[0..N-1]’), it has to treat these cases explicitly. File: libunistring.info, Node: Word break property, Prev: Word breaks in a string, Up: uniwbrk.h -10.2 Word break property +11.2 Word break property ======================== - This is a more low-level API. The word break property is a property -defined in Unicode Standard Annex #29, section "Word Boundaries", see -`http://www.unicode.org/reports/tr29/#Word_Boundaries'. It is used for + This is a more low-level API. The word break property is a property +defined in Unicode Standard Annex #29, section “Word Boundaries”, see +<http://www.unicode.org/reports/tr29/#Word_Boundaries>. It is used for determining the word breaks in a string. The following are the possible values of the word break property. @@ -2754,7 +3026,7 @@ character. File: libunistring.info, Node: unilbrk.h, Next: uninorm.h, Prev: uniwbrk.h, Up: Top -11 Line breaking `<unilbrk.h>' +12 Line breaking ‘<unilbrk.h>’ ****************************** This include file declares functions for determining where in a @@ -2762,49 +3034,49 @@ string line breaks could or should be introduced, in order to make the displayed string fit into a column of given width. These functions are locale dependent. The ENCODING argument -identifies the encoding (e.g. `"ISO-8859-2"' for Polish). +identifies the encoding (e.g. ‘"ISO-8859-2"’ for Polish). The following enumerated values indicate whether, at a given position, a line break is possible or not. Given an string S as an -array `S[0..N-1]' and a position I, the values have the following +array ‘S[0..N-1]’ and a position I, the values have the following meanings: -- Constant: int UC_BREAK_MANDATORY - This value indicates that `S[I]' is a line break character. + This value indicates that ‘S[I]’ is a line break character. -- Constant: int UC_BREAK_POSSIBLE This value indicates that a line break may be inserted between - `S[I-1]' and `S[I]'. + ‘S[I-1]’ and ‘S[I]’. -- Constant: int UC_BREAK_HYPHENATION - This value indicates that a hyphen and a line break may be - inserted between `S[I-1]' and `S[I]'. But beware of language - dependent hyphenation rules. + This value indicates that a hyphen and a line break may be inserted + between ‘S[I-1]’ and ‘S[I]’. But beware of language dependent + hyphenation rules. -- Constant: int UC_BREAK_PROHIBITED - This value indicates that `S[I-1]' and `S[I]' must not be + This value indicates that ‘S[I-1]’ and ‘S[I]’ must not be separated. -- Constant: int UC_BREAK_UNDEFINED - This value is not used as a return value; rather, in the - overriding argument of the `u*_width_linebreaks' functions, it - indicates the absence of an override. + This value is not used as a return value; rather, in the overriding + argument of the ‘u*_width_linebreaks’ functions, it indicates the + absence of an override. The following functions determine the positions at which line breaks are possible. -- Function: void u8_possible_linebreaks (const uint8_t *S, size_t N, const char *ENCODING, char *P) - -- Function: void u16_possible_linebreaks (const uint16_t *S, size_t - N, const char *ENCODING, char *P) - -- Function: void u32_possible_linebreaks (const uint32_t *S, size_t - N, const char *ENCODING, char *P) + -- Function: void u16_possible_linebreaks (const uint16_t *S, size_t N, + const char *ENCODING, char *P) + -- Function: void u32_possible_linebreaks (const uint32_t *S, size_t N, + const char *ENCODING, char *P) -- Function: void ulc_possible_linebreaks (const char *S, size_t N, const char *ENCODING, char *P) Determines the line break points in S, and stores the result at - `P[0..N-1]'. Every `P[I]' is assigned one of the values - `UC_BREAK_MANDATORY', `UC_BREAK_POSSIBLE', `UC_BREAK_HYPHENATION', - `UC_BREAK_PROHIBITED'. + ‘P[0..N-1]’. Every ‘P[I]’ is assigned one of the values + ‘UC_BREAK_MANDATORY’, ‘UC_BREAK_POSSIBLE’, ‘UC_BREAK_HYPHENATION’, + ‘UC_BREAK_PROHIBITED’. The following functions determine where line breaks should be inserted so that each line fits in a given width, when output to a @@ -2813,47 +3085,47 @@ device that uses non-proportional fonts. -- Function: int u8_width_linebreaks (const uint8_t *S, size_t N, int WIDTH, int START_COLUMN, int AT_END_COLUMNS, const char *OVERRIDE, const char *ENCODING, char *P) - -- Function: int u16_width_linebreaks (const uint16_t *S, size_t N, - int WIDTH, int START_COLUMN, int AT_END_COLUMNS, const char + -- Function: int u16_width_linebreaks (const uint16_t *S, size_t N, int + WIDTH, int START_COLUMN, int AT_END_COLUMNS, const char *OVERRIDE, const char *ENCODING, char *P) - -- Function: int u32_width_linebreaks (const uint32_t *S, size_t N, - int WIDTH, int START_COLUMN, int AT_END_COLUMNS, const char + -- Function: int u32_width_linebreaks (const uint32_t *S, size_t N, int + WIDTH, int START_COLUMN, int AT_END_COLUMNS, const char *OVERRIDE, const char *ENCODING, char *P) -- Function: int ulc_width_linebreaks (const char *S, size_t N, int WIDTH, int START_COLUMN, int AT_END_COLUMNS, const char *OVERRIDE, const char *ENCODING, char *P) Chooses the best line breaks, assuming that every character - occupies a width given by the `uc_width' function (see *note + occupies a width given by the ‘uc_width’ function (see *note uniwidth.h::). - The string is `S[0..N-1]'. + The string is ‘S[0..N-1]’. The maximum number of columns per line is given as WIDTH. The starting column of the string is given as START_COLUMN. If the - algorithm shall keep room after the last piece, this amount of - room can be given as AT_END_COLUMNS. + algorithm shall keep room after the last piece, this amount of room + can be given as AT_END_COLUMNS. - OVERRIDE is an optional override; if `OVERRIDE[I] != - UC_BREAK_UNDEFINED', `OVERRIDE[I]' takes precedence over `P[I]' as - returned by the `u*_possible_linebreaks' function. + OVERRIDE is an optional override; if ‘OVERRIDE[I] != + UC_BREAK_UNDEFINED’, ‘OVERRIDE[I]’ takes precedence over ‘P[I]’ as + returned by the ‘u*_possible_linebreaks’ function. - The given ENCODING is used for disambiguating widths in `uc_width'. + The given ENCODING is used for disambiguating widths in ‘uc_width’. Returns the column after the end of the string, and stores the - result at `P[0..N-1]'. Every `P[I]' is assigned one of the values - `UC_BREAK_MANDATORY', `UC_BREAK_POSSIBLE', `UC_BREAK_HYPHENATION', - `UC_BREAK_PROHIBITED'. Here the value `UC_BREAK_POSSIBLE' + result at ‘P[0..N-1]’. Every ‘P[I]’ is assigned one of the values + ‘UC_BREAK_MANDATORY’, ‘UC_BREAK_POSSIBLE’, ‘UC_BREAK_HYPHENATION’, + ‘UC_BREAK_PROHIBITED’. Here the value ‘UC_BREAK_POSSIBLE’ indicates that a line break _should_ be inserted. File: libunistring.info, Node: uninorm.h, Next: unicase.h, Prev: unilbrk.h, Up: Top -12 Normalization forms (composition and decomposition) `<uninorm.h>' +13 Normalization forms (composition and decomposition) ‘<uninorm.h>’ ******************************************************************** This include file defines functions for transforming Unicode strings -to one of the four normal forms, known as NFC, NFD, NKFC, NFKD. These -transformations involve decomposition and -- for NFC and NFKC -- +to one of the four normal forms, known as NFC, NFD, NKFC, NFKD. These +transformations involve decomposition and — for NFC and NFKC — composition of Unicode characters. * Menu: @@ -2867,7 +3139,7 @@ composition of Unicode characters. File: libunistring.info, Node: Decomposition of characters, Next: Composition of characters, Up: uninorm.h -12.1 Decomposition of Unicode characters +13.1 Decomposition of Unicode characters ======================================== The following enumerated values are the possible types of @@ -2877,70 +3149,70 @@ decomposition of a Unicode character. Denotes canonical decomposition. -- Constant: int UC_DECOMP_FONT - UCD marker: `<font>'. Denotes a font variant (e.g. a blackletter + UCD marker: ‘<font>’. Denotes a font variant (e.g. a blackletter form). -- Constant: int UC_DECOMP_NOBREAK - UCD marker: `<noBreak>'. Denotes a no-break version of a space or + UCD marker: ‘<noBreak>’. Denotes a no-break version of a space or hyphen. -- Constant: int UC_DECOMP_INITIAL - UCD marker: `<initial>'. Denotes an initial presentation form + UCD marker: ‘<initial>’. Denotes an initial presentation form (Arabic). -- Constant: int UC_DECOMP_MEDIAL - UCD marker: `<medial>'. Denotes a medial presentation form + UCD marker: ‘<medial>’. Denotes a medial presentation form (Arabic). -- Constant: int UC_DECOMP_FINAL - UCD marker: `<final>'. Denotes a final presentation form (Arabic). + UCD marker: ‘<final>’. Denotes a final presentation form (Arabic). -- Constant: int UC_DECOMP_ISOLATED - UCD marker: `<isolated>'. Denotes an isolated presentation form + UCD marker: ‘<isolated>’. Denotes an isolated presentation form (Arabic). -- Constant: int UC_DECOMP_CIRCLE - UCD marker: `<circle>'. Denotes an encircled form. + UCD marker: ‘<circle>’. Denotes an encircled form. -- Constant: int UC_DECOMP_SUPER - UCD marker: `<super>'. Denotes a superscript form. + UCD marker: ‘<super>’. Denotes a superscript form. -- Constant: int UC_DECOMP_SUB - UCD marker: `<sub>'. Denotes a subscript form. + UCD marker: ‘<sub>’. Denotes a subscript form. -- Constant: int UC_DECOMP_VERTICAL - UCD marker: `<vertical>'. Denotes a vertical layout presentation + UCD marker: ‘<vertical>’. Denotes a vertical layout presentation form. -- Constant: int UC_DECOMP_WIDE - UCD marker: `<wide>'. Denotes a wide (or zenkaku) compatibility + UCD marker: ‘<wide>’. Denotes a wide (or zenkaku) compatibility character. -- Constant: int UC_DECOMP_NARROW - UCD marker: `<narrow>'. Denotes a narrow (or hankaku) + UCD marker: ‘<narrow>’. Denotes a narrow (or hankaku) compatibility character. -- Constant: int UC_DECOMP_SMALL - UCD marker: `<small>'. Denotes a small variant form (CNS + UCD marker: ‘<small>’. Denotes a small variant form (CNS compatibility). -- Constant: int UC_DECOMP_SQUARE - UCD marker: `<square>'. Denotes a CJK squared font variant. + UCD marker: ‘<square>’. Denotes a CJK squared font variant. -- Constant: int UC_DECOMP_FRACTION - UCD marker: `<fraction>'. Denotes a vulgar fraction form. + UCD marker: ‘<fraction>’. Denotes a vulgar fraction form. -- Constant: int UC_DECOMP_COMPAT - UCD marker: `<compat>'. Denotes an otherwise unspecified + UCD marker: ‘<compat>’. Denotes an otherwise unspecified compatibility character. - The following constant denotes the maximum size of decomposition of -a single Unicode character. + The following constant denotes the maximum size of decomposition of a +single Unicode character. -- Macro: unsigned int UC_DECOMPOSITION_MAX_LENGTH This macro expands to a constant that is the required size of - buffer passed to the `uc_decomposition' and - `uc_canonical_decomposition' functions. + buffer passed to the ‘uc_decomposition’ and + ‘uc_canonical_decomposition’ functions. The following functions decompose a Unicode character. @@ -2948,25 +3220,25 @@ a single Unicode character. *DECOMPOSITION) Returns the character decomposition mapping of the Unicode character UC. DECOMPOSITION must point to an array of at least - `UC_DECOMPOSITION_MAX_LENGTH' `ucs_t' elements. + ‘UC_DECOMPOSITION_MAX_LENGTH’ ‘ucs_t’ elements. - When a decomposition exists, `DECOMPOSITION[0..N-1]' and - `*DECOMP_TAG' are filled and N is returned. Otherwise -1 is + When a decomposition exists, ‘DECOMPOSITION[0..N-1]’ and + ‘*DECOMP_TAG’ are filled and N is returned. Otherwise -1 is returned. -- Function: int uc_canonical_decomposition (ucs4_t UC, ucs4_t *DECOMPOSITION) Returns the canonical character decomposition mapping of the Unicode character UC. DECOMPOSITION must point to an array of at - least `UC_DECOMPOSITION_MAX_LENGTH' `ucs_t' elements. + least ‘UC_DECOMPOSITION_MAX_LENGTH’ ‘ucs_t’ elements. - When a decomposition exists, `DECOMPOSITION[0..N-1]' is filled and + When a decomposition exists, ‘DECOMPOSITION[0..N-1]’ is filled and N is returned. Otherwise -1 is returned. File: libunistring.info, Node: Composition of characters, Next: Normalization of strings, Prev: Decomposition of characters, Up: uninorm.h -12.2 Composition of Unicode characters +13.2 Composition of Unicode characters ====================================== The following function composes a Unicode character from two Unicode @@ -2980,20 +3252,20 @@ characters. otherwise. Not all decompositions can be recombined using this function. See - the Unicode file `CompositionExclusions.txt' for details. + the Unicode file ‘CompositionExclusions.txt’ for details. File: libunistring.info, Node: Normalization of strings, Next: Normalizing comparisons, Prev: Composition of characters, Up: uninorm.h -12.3 Normalization of strings +13.3 Normalization of strings ============================= The Unicode standard defines four normalization forms for Unicode strings. The following type is used to denote a normalization form. -- Type: uninorm_t - An object of type `uninorm_t' denotes a Unicode normalization form. - This is a scalar type; its values can be compared with `=='. + An object of type ‘uninorm_t’ denotes a Unicode normalization form. + This is a scalar type; its values can be compared with ‘==’. The following constants denote the four normalization forms. @@ -3011,7 +3283,7 @@ strings. The following type is used to denote a normalization form. Normalization form KC: compatibility decomposition, then canonical composition. - The following functions operate on `uninorm_t' objects. + The following functions operate on ‘uninorm_t’ objects. -- Function: bool uninorm_is_compat_decomposing (uninorm_t NF) Tests whether the normalization form NF does compatibility @@ -3022,24 +3294,24 @@ strings. The following type is used to denote a normalization form. composition. -- Function: uninorm_t uninorm_decomposing_form (uninorm_t NF) - Returns the decomposing variant of the normalization form NF. - This maps NFC,NFD -> NFD and NFKC,NFKD -> NFKD. + Returns the decomposing variant of the normalization form NF. This + maps NFC,NFD → NFD and NFKC,NFKD → NFKD. The following functions apply a Unicode normalization form to a Unicode string. -- Function: uint8_t * u8_normalize (uninorm_t NF, const uint8_t *S, size_t N, uint8_t *RESULTBUF, size_t *LENGTHP) - -- Function: uint16_t * u16_normalize (uninorm_t NF, const uint16_t - *S, size_t N, uint16_t *RESULTBUF, size_t *LENGTHP) - -- Function: uint32_t * u32_normalize (uninorm_t NF, const uint32_t - *S, size_t N, uint32_t *RESULTBUF, size_t *LENGTHP) + -- Function: uint16_t * u16_normalize (uninorm_t NF, const uint16_t *S, + size_t N, uint16_t *RESULTBUF, size_t *LENGTHP) + -- Function: uint32_t * u32_normalize (uninorm_t NF, const uint32_t *S, + size_t N, uint32_t *RESULTBUF, size_t *LENGTHP) Returns the specified normalization form of a string. File: libunistring.info, Node: Normalizing comparisons, Next: Normalization of streams, Prev: Normalization of strings, Up: uninorm.h -12.4 Normalizing comparisons +13.4 Normalizing comparisons ============================ The following functions compare Unicode string, ignoring differences @@ -3053,11 +3325,10 @@ in normalization. uint32_t *S2, size_t N2, uninorm_t NF, int *RESULTP) Compares S1 and S2, ignoring differences in normalization. - NF must be either `UNINORM_NFD' or `UNINORM_NFKD'. + NF must be either ‘UNINORM_NFD’ or ‘UNINORM_NFKD’. - If successful, sets `*RESULTP' to -1 if S1 < S2, 0 if S1 = S2, 1 - if S1 > S2, and returns 0. Upon failure, returns -1 with `errno' - set. + If successful, sets ‘*RESULTP’ to -1 if S1 < S2, 0 if S1 = S2, 1 if + S1 > S2, and returns 0. Upon failure, returns -1 with ‘errno’ set. -- Function: char * u8_normxfrm (const uint8_t *S, size_t N, uninorm_t NF, char *RESULTBUF, size_t *LENGTHP) @@ -3066,11 +3337,11 @@ in normalization. -- Function: char * u32_normxfrm (const uint32_t *S, size_t N, uninorm_t NF, char *RESULTBUF, size_t *LENGTHP) Converts the string S of length N to a NUL-terminated byte - sequence, in such a way that comparing `u8_normxfrm (S1)' and - `u8_normxfrm (S2)' with the `u8_cmp2' function is equivalent to - comparing S1 and S2 with the `u8_normcoll' function. + sequence, in such a way that comparing ‘u8_normxfrm (S1)’ and + ‘u8_normxfrm (S2)’ with the ‘u8_cmp2’ function is equivalent to + comparing S1 and S2 with the ‘u8_normcoll’ function. - NF must be either `UNINORM_NFC' or `UNINORM_NFKC'. + NF must be either ‘UNINORM_NFC’ or ‘UNINORM_NFKC’. -- Function: int u8_normcoll (const uint8_t *S1, size_t N1, const uint8_t *S2, size_t N2, uninorm_t NF, int *RESULTP) @@ -3081,27 +3352,26 @@ in normalization. Compares S1 and S2, ignoring differences in normalization, using the collation rules of the current locale. - NF must be either `UNINORM_NFC' or `UNINORM_NFKC'. + NF must be either ‘UNINORM_NFC’ or ‘UNINORM_NFKC’. - If successful, sets `*RESULTP' to -1 if S1 < S2, 0 if S1 = S2, 1 - if S1 > S2, and returns 0. Upon failure, returns -1 with `errno' - set. + If successful, sets ‘*RESULTP’ to -1 if S1 < S2, 0 if S1 = S2, 1 if + S1 > S2, and returns 0. Upon failure, returns -1 with ‘errno’ set. File: libunistring.info, Node: Normalization of streams, Prev: Normalizing comparisons, Up: uninorm.h -12.5 Normalization of streams of Unicode characters +13.5 Normalization of streams of Unicode characters =================================================== - A "stream of Unicode characters" is essentially a function that -accepts an `ucs4_t' argument repeatedly, optionally combined with a -function that "flushes" the stream. + A “stream of Unicode characters” is essentially a function that +accepts an ‘ucs4_t’ argument repeatedly, optionally combined with a +function that “flushes” the stream. -- Type: struct uninorm_filter 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 character sequence to the encapsulated - stream of Unicode characters. + passes the normalized character sequence to the encapsulated stream + of Unicode characters. -- Function: struct uninorm_filter * uninorm_filter_create (uninorm_t NF, int (*STREAM_FUNC) (void *STREAM_DATA, ucs4_t UC), void @@ -3109,23 +3379,23 @@ function that "flushes" the stream. Creates and returns a normalization filter for Unicode characters. The pair (STREAM_FUNC, STREAM_DATA) is the encapsulated stream. - `STREAM_FUNC (STREAM_DATA, UC)' receives the Unicode character UC - and returns 0 if successful, or -1 with `errno' set upon failure. + ‘STREAM_FUNC (STREAM_DATA, UC)’ receives the Unicode character UC + and returns 0 if successful, or -1 with ‘errno’ set upon failure. - Returns the new filter, or NULL with `errno' set upon failure. + Returns the new filter, or NULL with ‘errno’ set upon failure. -- Function: int uninorm_filter_write (struct uninorm_filter *FILTER, ucs4_t UC) - Stuffs a Unicode character into a normalizing filter. Returns 0 - if successful, or -1 with `errno' set upon failure. + Stuffs a Unicode character into a normalizing filter. Returns 0 if + successful, or -1 with ‘errno’ set upon failure. -- Function: int uninorm_filter_flush (struct uninorm_filter *FILTER) Brings data buffered in the filter to its destination, the encapsulated stream. - Returns 0 if successful, or -1 with `errno' set upon failure. + Returns 0 if successful, or -1 with ‘errno’ set upon failure. - Note! If after calling this function, additional characters are + Note! If after calling this function, additional characters are written into the filter, the resulting character sequence in the encapsulated stream will not necessarily be normalized. @@ -3133,12 +3403,12 @@ function that "flushes" the stream. Brings data buffered in the filter to its destination, the encapsulated stream, then closes and frees the filter. - Returns 0 if successful, or -1 with `errno' set upon failure. + Returns 0 if successful, or -1 with ‘errno’ set upon failure. File: libunistring.info, Node: unicase.h, Next: uniregex.h, Prev: uninorm.h, Up: Top -13 Case mappings `<unicase.h>' +14 Case mappings ‘<unicase.h>’ ****************************** This include file defines functions for case mapping for Unicode @@ -3146,8 +3416,8 @@ strings and case insensitive comparison of Unicode strings and C strings. These string functions fix the problems that were mentioned in *note -char * strings::, namely, they handle the Croatian LETTER DZ WITH -CARON, the German LATIN SMALL LETTER SHARP S, the Greek sigma and the +char * strings::, namely, they handle the Croatian LETTER DZ WITH CARON, +the German LATIN SMALL LETTER SHARP S, the Greek sigma and the Lithuanian i correctly. * Menu: @@ -3161,18 +3431,18 @@ Lithuanian i correctly. File: libunistring.info, Node: Case mappings of characters, Next: Case mappings of strings, Up: unicase.h -13.1 Case mappings of characters +14.1 Case mappings of characters ================================ - The following functions implement case mappings on Unicode -characters -- for those cases only where the result of the mapping is a -again a single Unicode character. + The following functions implement case mappings on Unicode characters +— for those cases only where the result of the mapping is a again a +single Unicode character. These mappings are locale and context independent. *WARNING!* These functions are not sufficient for languages such as -German, Greek and Lithuanian. Better use the functions below that -treat an entire string at once and are language aware. +German, Greek and Lithuanian. Better use the functions below that treat +an entire string at once and are language aware. -- Function: ucs4_t uc_toupper (ucs4_t UC) Returns the uppercase mapping of the Unicode character UC. @@ -3192,51 +3462,54 @@ treat an entire string at once and are language aware. uuper case variant are different. These characters occur in the Latin writing of the Croatian, Bosnian, and Serbian languages. - Lower case Title case Upper case - ------------------------------------------------------------------ - LATIN SMALL LETTER LJ LATIN CAPITAL LETTER LATIN CAPITAL LETTER - L WITH SMALL LETTER J LJ - LATIN SMALL LETTER NJ LATIN CAPITAL LETTER LATIN CAPITAL LETTER - N WITH SMALL LETTER J NJ - LATIN SMALL LETTER DZ LATIN CAPITAL LETTER LATIN CAPITAL LETTER - D WITH SMALL LETTER Z DZ - LATIN SMALL LETTER LATIN CAPITAL LETTER LATIN CAPITAL LETTER - DZ WITH CARON D WITH SMALL LETTER DZ WITH CARON - Z WITH CARON + Lower case Title case Upper case + --------------------------------------------------------------------- + LATIN SMALL LETTER LATIN CAPITAL LETTER LATIN CAPITAL LETTER + LJ L WITH SMALL LETTER LJ + J + LATIN SMALL LETTER LATIN CAPITAL LETTER LATIN CAPITAL LETTER + NJ N WITH SMALL LETTER NJ + J + LATIN SMALL LETTER LATIN CAPITAL LETTER LATIN CAPITAL LETTER + DZ D WITH SMALL LETTER DZ + Z + LATIN SMALL LETTER LATIN CAPITAL LETTER LATIN CAPITAL LETTER + DZ WITH CARON D WITH SMALL LETTER DZ WITH CARON + Z WITH CARON File: libunistring.info, Node: Case mappings of strings, Next: Case mappings of substrings, Prev: Case mappings of characters, Up: unicase.h -13.2 Case mappings of strings +14.2 Case mappings of strings ============================= Case mapping should always be performed on entire strings, not on individual characters. The functions in this sections do so. These functions allow to apply a normalization after the case -mapping. The reason is that if you want to treat `ä' and `Ä' the -same, you most often also want to treat the composed and decomposed -forms of such a character, U+00C4 LATIN CAPITAL LETTER A WITH DIAERESIS -and U+0041 LATIN CAPITAL LETTER A U+0308 COMBINING DIAERESIS the same. -The NF argument designates the normalization. +mapping. The reason is that if you want to treat ‘ä’ and ‘Ä’ the same, +you most often also want to treat the composed and decomposed forms of +such a character, U+00C4 LATIN CAPITAL LETTER A WITH DIAERESIS and +U+0041 LATIN CAPITAL LETTER A U+0308 COMBINING DIAERESIS the same. The +NF argument designates the normalization. These functions are locale dependent. The ISO639_LANGUAGE argument -identifies the language (e.g. `"tr"' for Turkish). NULL means to use +identifies the language (e.g. ‘"tr"’ for Turkish). NULL means to use locale independent case mappings. -- Function: const char * uc_locale_language () Returns the ISO 639 language code of the current locale. Returns - `""' if it is unknown, or in the "C" locale. + ‘""’ if it is unknown, or in the "C" locale. -- Function: uint8_t * u8_toupper (const uint8_t *S, size_t N, const char *ISO639_LANGUAGE, uninorm_t NF, uint8_t *RESULTBUF, size_t *LENGTHP) - -- Function: uint16_t * u16_toupper (const uint16_t *S, size_t N, - const char *ISO639_LANGUAGE, uninorm_t NF, uint16_t - *RESULTBUF, size_t *LENGTHP) - -- Function: uint32_t * u32_toupper (const uint32_t *S, size_t N, - const char *ISO639_LANGUAGE, uninorm_t NF, uint32_t - *RESULTBUF, size_t *LENGTHP) + -- Function: uint16_t * u16_toupper (const uint16_t *S, size_t N, const + char *ISO639_LANGUAGE, uninorm_t NF, uint16_t *RESULTBUF, + size_t *LENGTHP) + -- Function: uint32_t * u32_toupper (const uint32_t *S, size_t N, const + char *ISO639_LANGUAGE, uninorm_t NF, uint32_t *RESULTBUF, + size_t *LENGTHP) Returns the uppercase mapping of a string. The NF argument identifies the normalization form to apply after @@ -3245,12 +3518,12 @@ locale independent case mappings. -- 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) - -- Function: uint16_t * u16_tolower (const uint16_t *S, size_t N, - const char *ISO639_LANGUAGE, uninorm_t NF, uint16_t - *RESULTBUF, size_t *LENGTHP) - -- Function: uint32_t * u32_tolower (const uint32_t *S, size_t N, - const char *ISO639_LANGUAGE, uninorm_t NF, uint32_t - *RESULTBUF, size_t *LENGTHP) + -- Function: uint16_t * u16_tolower (const uint16_t *S, size_t N, const + char *ISO639_LANGUAGE, uninorm_t NF, uint16_t *RESULTBUF, + size_t *LENGTHP) + -- Function: uint32_t * u32_tolower (const uint32_t *S, size_t N, const + char *ISO639_LANGUAGE, uninorm_t NF, uint32_t *RESULTBUF, + size_t *LENGTHP) Returns the lowercase mapping of a string. The NF argument identifies the normalization form to apply after @@ -3259,12 +3532,12 @@ locale independent case mappings. -- 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) - -- Function: uint16_t * u16_totitle (const uint16_t *S, size_t N, - const char *ISO639_LANGUAGE, uninorm_t NF, uint16_t - *RESULTBUF, size_t *LENGTHP) - -- Function: uint32_t * u32_totitle (const uint32_t *S, size_t N, - const char *ISO639_LANGUAGE, uninorm_t NF, uint32_t - *RESULTBUF, size_t *LENGTHP) + -- Function: uint16_t * u16_totitle (const uint16_t *S, size_t N, const + char *ISO639_LANGUAGE, uninorm_t NF, uint16_t *RESULTBUF, + size_t *LENGTHP) + -- Function: uint32_t * u32_totitle (const uint32_t *S, size_t N, const + char *ISO639_LANGUAGE, uninorm_t NF, uint32_t *RESULTBUF, + size_t *LENGTHP) Returns the titlecase mapping of a string. Mapping to title case means that, in each word, the first cased @@ -3277,7 +3550,7 @@ locale independent case mappings. File: libunistring.info, Node: Case mappings of substrings, Next: Case insensitive comparison, Prev: Case mappings of strings, Up: unicase.h -13.3 Case mappings of substrings +14.3 Case mappings of substrings ================================ Case mapping of a substring cannot simply be performed by extracting @@ -3285,8 +3558,8 @@ the substring and then applying the case mapping function to it. This does not work because case mapping requires some information about the surrounding characters. The following functions allow to apply case mappings to substrings of a given string, while taking into account the -characters that precede it (the "prefix") and the characters that -follow it (the "suffix"). +characters that precede it (the “prefix”) and the characters that follow +it (the “suffix”). -- Type: casing_prefix_context_t This data type denotes the case-mapping context that is given by a @@ -3298,7 +3571,7 @@ follow it (the "suffix"). This constant is the case-mapping context that corresponds to an empty prefix string. - The following functions return `casing_prefix_context_t' objects: + The following functions return ‘casing_prefix_context_t’ objects: -- Function: casing_prefix_context_t u8_casing_prefix_context (const uint8_t *S, size_t N) @@ -3310,12 +3583,10 @@ follow it (the "suffix"). -- Function: casing_prefix_context_t u8_casing_prefixes_context (const uint8_t *S, size_t N, casing_prefix_context_t A_CONTEXT) - -- Function: casing_prefix_context_t u16_casing_prefixes_context - (const uint16_t *S, size_t N, casing_prefix_context_t - A_CONTEXT) - -- Function: casing_prefix_context_t u32_casing_prefixes_context - (const uint32_t *S, size_t N, casing_prefix_context_t - A_CONTEXT) + -- Function: casing_prefix_context_t u16_casing_prefixes_context (const + uint16_t *S, size_t N, casing_prefix_context_t A_CONTEXT) + -- Function: casing_prefix_context_t u32_casing_prefixes_context (const + uint32_t *S, size_t N, casing_prefix_context_t A_CONTEXT) Returns the case-mapping context of the prefix concat(A, S), given the case-mapping context of the prefix A. @@ -3329,7 +3600,7 @@ follow it (the "suffix"). This constant is the case-mapping context that corresponds to an empty suffix string. - The following functions return `casing_suffix_context_t' objects: + The following functions return ‘casing_suffix_context_t’ objects: -- Function: casing_suffix_context_t u8_casing_suffix_context (const uint8_t *S, size_t N) @@ -3341,12 +3612,10 @@ follow it (the "suffix"). -- Function: casing_suffix_context_t u8_casing_suffixes_context (const uint8_t *S, size_t N, casing_suffix_context_t A_CONTEXT) - -- Function: casing_suffix_context_t u16_casing_suffixes_context - (const uint16_t *S, size_t N, casing_suffix_context_t - A_CONTEXT) - -- Function: casing_suffix_context_t u32_casing_suffixes_context - (const uint32_t *S, size_t N, casing_suffix_context_t - A_CONTEXT) + -- Function: casing_suffix_context_t u16_casing_suffixes_context (const + uint16_t *S, size_t N, casing_suffix_context_t A_CONTEXT) + -- Function: casing_suffix_context_t u32_casing_suffixes_context (const + uint32_t *S, size_t N, casing_suffix_context_t A_CONTEXT) Returns the case-mapping context of the suffix concat(S, A), given the case-mapping context of the suffix A. @@ -3407,9 +3676,9 @@ prefix context and the suffix context. Returns the titlecase mapping of a string that is surrounded by a prefix and a suffix. - 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 + 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 size_t result_length; uint8_t result = @@ -3422,11 +3691,11 @@ start_index' and `s + end_index' of a string that extends from `s' to File: libunistring.info, Node: Case insensitive comparison, Next: Case detection, Prev: Case mappings of substrings, Up: unicase.h -13.4 Case insensitive comparison +14.4 Case insensitive comparison ================================ - The following functions implement comparison that ignores -differences in case and normalization. + The following functions implement comparison that ignores differences +in case and normalization. -- Function: uint8_t * u8_casefold (const uint8_t *S, size_t N, const char *ISO639_LANGUAGE, uninorm_t NF, uint8_t *RESULTBUF, @@ -3439,9 +3708,9 @@ differences in case and normalization. *RESULTBUF, size_t *LENGTHP) Returns the case folded string. - Comparing `u8_casefold (S1)' and `u8_casefold (S2)' with the - `u8_cmp2' function is equivalent to comparing S1 and S2 with - `u8_casecmp'. + Comparing ‘u8_casefold (S1)’ and ‘u8_casefold (S2)’ with the + ‘u8_cmp2’ function is equivalent to comparing S1 and S2 with + ‘u8_casecmp’. The NF argument identifies the normalization form to apply after the case-mapping. It can also be NULL, for no normalization. @@ -3465,8 +3734,8 @@ differences in case and normalization. account the case mapping contexts of the prefix and suffix strings. -- 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) + uint8_t *S2, size_t N2, const char *ISO639_LANGUAGE, uninorm_t + NF, int *RESULTP) -- Function: int u16_casecmp (const uint16_t *S1, size_t N1, const uint16_t *S2, size_t N2, const char *ISO639_LANGUAGE, uninorm_t NF, int *RESULTP) @@ -3474,22 +3743,21 @@ differences in case and normalization. uint32_t *S2, size_t N2, const char *ISO639_LANGUAGE, uninorm_t NF, int *RESULTP) -- Function: int ulc_casecmp (const char *S1, size_t N1, const char - *S2, size_t N2, const char *ISO639_LANGUAGE, uninorm_t NF, - int *RESULTP) + *S2, size_t N2, const char *ISO639_LANGUAGE, uninorm_t NF, int + *RESULTP) Compares S1 and S2, ignoring differences 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. - If successful, sets `*RESULTP' to -1 if S1 < S2, 0 if S1 = S2, 1 - if S1 > S2, and returns 0. Upon failure, returns -1 with `errno' - set. + If successful, sets ‘*RESULTP’ to -1 if S1 < S2, 0 if S1 = S2, 1 if + S1 > S2, and returns 0. Upon failure, returns -1 with ‘errno’ set. The following functions additionally take into account the sorting rules of the current locale. - -- Function: char * u8_casexfrm (const uint8_t *S, size_t N, const - char *ISO639_LANGUAGE, uninorm_t NF, char *RESULTBUF, size_t + -- Function: char * u8_casexfrm (const uint8_t *S, size_t N, const char + *ISO639_LANGUAGE, uninorm_t NF, char *RESULTBUF, size_t *LENGTHP) -- Function: char * u16_casexfrm (const uint16_t *S, size_t N, const char *ISO639_LANGUAGE, uninorm_t NF, char *RESULTBUF, size_t @@ -3501,16 +3769,16 @@ rules of the current locale. *ISO639_LANGUAGE, uninorm_t NF, char *RESULTBUF, size_t *LENGTHP) Converts the string S of length N to a NUL-terminated byte - sequence, in such a way that comparing `u8_casexfrm (S1)' and - `u8_casexfrm (S2)' with the gnulib function `memcmp2' is - equivalent to comparing S1 and S2 with `u8_casecoll'. + sequence, in such a way that comparing ‘u8_casexfrm (S1)’ and + ‘u8_casexfrm (S2)’ with the gnulib function ‘memcmp2’ is equivalent + to comparing S1 and S2 with ‘u8_casecoll’. - NF must be either `UNINORM_NFC', `UNINORM_NFKC', or NULL for no + NF must be either ‘UNINORM_NFC’, ‘UNINORM_NFKC’, or NULL for no normalization. -- 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) + uint8_t *S2, size_t N2, const char *ISO639_LANGUAGE, uninorm_t + NF, int *RESULTP) -- Function: int u16_casecoll (const uint16_t *S1, size_t N1, const uint16_t *S2, size_t N2, const char *ISO639_LANGUAGE, uninorm_t NF, int *RESULTP) @@ -3518,27 +3786,26 @@ rules of the current locale. uint32_t *S2, size_t N2, const char *ISO639_LANGUAGE, uninorm_t NF, int *RESULTP) -- Function: int ulc_casecoll (const char *S1, size_t N1, const char - *S2, size_t N2, const char *ISO639_LANGUAGE, uninorm_t NF, - int *RESULTP) + *S2, size_t N2, const char *ISO639_LANGUAGE, uninorm_t NF, int + *RESULTP) Compares S1 and S2, ignoring differences in case and normalization, using the collation rules of the current locale. The NF argument identifies the normalization form to apply after - the case-mapping. It must be either `UNINORM_NFC' or - `UNINORM_NFKC'. It can also be NULL, for no normalization. + the case-mapping. It must be either ‘UNINORM_NFC’ or + ‘UNINORM_NFKC’. It can also be NULL, for no normalization. - If successful, sets `*RESULTP' to -1 if S1 < S2, 0 if S1 = S2, 1 - if S1 > S2, and returns 0. Upon failure, returns -1 with `errno' - set. + If successful, sets ‘*RESULTP’ to -1 if S1 < S2, 0 if S1 = S2, 1 if + S1 > S2, and returns 0. Upon failure, returns -1 with ‘errno’ set. File: libunistring.info, Node: Case detection, Prev: Case insensitive comparison, Up: unicase.h -13.5 Case detection +14.5 Case detection =================== The following functions determine whether a Unicode string is -entirely in upper case. or entirely in lower case, or entirely in title +entirely in upper case. or entirely in lower case, or entirely in title case, or already case-folded. -- Function: int u8_is_uppercase (const uint8_t *S, size_t N, const @@ -3547,9 +3814,9 @@ case, or already case-folded. char *ISO639_LANGUAGE, bool *RESULTP) -- Function: int u32_is_uppercase (const uint32_t *S, size_t N, const char *ISO639_LANGUAGE, bool *RESULTP) - Sets `*RESULTP' to true if mapping NFD(S) to upper case is a - no-op, or to false otherwise, and returns 0. Upon failure, - returns -1 with `errno' set. + Sets ‘*RESULTP’ to true if mapping NFD(S) to upper case is a no-op, + or to false otherwise, and returns 0. Upon failure, returns -1 + with ‘errno’ set. -- Function: int u8_is_lowercase (const uint8_t *S, size_t N, const char *ISO639_LANGUAGE, bool *RESULTP) @@ -3557,9 +3824,9 @@ case, or already case-folded. char *ISO639_LANGUAGE, bool *RESULTP) -- Function: int u32_is_lowercase (const uint32_t *S, size_t N, const char *ISO639_LANGUAGE, bool *RESULTP) - Sets `*RESULTP' to true if mapping NFD(S) to lower case is a - no-op, or to false otherwise, and returns 0. Upon failure, - returns -1 with `errno' set. + Sets ‘*RESULTP’ to true if mapping NFD(S) to lower case is a no-op, + or to false otherwise, and returns 0. Upon failure, returns -1 + with ‘errno’ set. -- Function: int u8_is_titlecase (const uint8_t *S, size_t N, const char *ISO639_LANGUAGE, bool *RESULTP) @@ -3567,9 +3834,9 @@ case, or already case-folded. char *ISO639_LANGUAGE, bool *RESULTP) -- Function: int u32_is_titlecase (const uint32_t *S, size_t N, const char *ISO639_LANGUAGE, bool *RESULTP) - Sets `*RESULTP' to true if mapping NFD(S) to title case is a - no-op, or to false otherwise, and returns 0. Upon failure, - returns -1 with `errno' set. + Sets ‘*RESULTP’ to true if mapping NFD(S) to title case is a no-op, + or to false otherwise, and returns 0. Upon failure, returns -1 + with ‘errno’ set. -- Function: int u8_is_casefolded (const uint8_t *S, size_t N, const char *ISO639_LANGUAGE, bool *RESULTP) @@ -3577,9 +3844,9 @@ case, or already case-folded. char *ISO639_LANGUAGE, bool *RESULTP) -- Function: int u32_is_casefolded (const uint32_t *S, size_t N, const char *ISO639_LANGUAGE, bool *RESULTP) - Sets `*RESULTP' to true if applying case folding to NFD(S) is a - no-op, or to false otherwise, and returns 0. Upon failure, - returns -1 with `errno' set. + Sets ‘*RESULTP’ to true if applying case folding to NFD(S) is a + no-op, or to false otherwise, and returns 0. Upon failure, returns + -1 with ‘errno’ set. The following functions determine whether case mappings have any effect on a Unicode string. @@ -3590,17 +3857,17 @@ effect on a Unicode string. *ISO639_LANGUAGE, bool *RESULTP) -- Function: int u32_is_cased (const uint32_t *S, size_t N, const char *ISO639_LANGUAGE, bool *RESULTP) - Sets `*RESULTP' to true if case matters for S, that is, if mapping + Sets ‘*RESULTP’ to true if case matters for S, that is, if mapping NFD(S) to either upper case or lower case or title case is not a - no-op. Set `*RESULTP' to false if NFD(S) maps to itself under the + no-op. Set ‘*RESULTP’ to false if NFD(S) maps to itself under the upper case mapping, under the lower case mapping, and under the title case mapping; in other words, when NFD(S) consists entirely - of caseless characters. Upon failure, returns -1 with `errno' set. + of caseless characters. Upon failure, returns -1 with ‘errno’ set. File: libunistring.info, Node: uniregex.h, Next: Using the library, Prev: unicase.h, Up: Top -14 Regular expressions `<uniregex.h>' +15 Regular expressions ‘<uniregex.h>’ ************************************* This include file is not yet implemented. @@ -3608,7 +3875,7 @@ File: libunistring.info, Node: uniregex.h, Next: Using the library, Prev: uni File: libunistring.info, Node: Using the library, Next: More functionality, Prev: uniregex.h, Up: Top -15 Using the library +16 Using the library ******************** This chapter explains some practical considerations, regarding the @@ -3626,147 +3893,147 @@ library. File: libunistring.info, Node: Installation, Next: Compiler options, Up: Using the library -15.1 Installation +16.1 Installation ================= 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 `DEPENDENCIES'. +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.woe32'. +in the file ‘INSTALL’. For installation on Windows systems, please +refer to the file ‘README.woe32’. File: libunistring.info, Node: Compiler options, Next: Include files, Prev: Installation, Up: Using the library -15.2 Compiler options +16.2 Compiler options ===================== - Let's denote as `LIBUNISTRING_PREFIX' the value of the `--prefix' -option that you passed to `configure' while installing this package. -If you didn't pass any `--prefix' option, then the package is installed -in `/usr/local'. + Let’s denote as ‘LIBUNISTRING_PREFIX’ the value of the ‘--prefix’ +option that you passed to ‘configure’ while installing this package. If +you didn’t pass any ‘--prefix’ option, then the package is installed in +‘/usr/local’. - Let's denote as `LIBUNISTRING_INCLUDEDIR' the directory where the + Let’s denote as ‘LIBUNISTRING_INCLUDEDIR’ the directory where the include files were installed. This is usually the same as -`${LIBUNISTRING_PREFIX}/include'. Except that if you passed an -`--includedir' option to `configure', it is the value of that option. +‘${LIBUNISTRING_PREFIX}/include’. Except that if you passed an +‘--includedir’ option to ‘configure’, it is the value of that option. - Let's further denote as `LIBUNISTRING_LIBDIR' the directory where -the library itself was installed. This is the value that you passed -with the `--libdir' option to `configure', or otherwise the same as -`${LIBUNISTRING_PREFIX}/lib'. Recall that when building in 64-bit mode + Let’s further denote as ‘LIBUNISTRING_LIBDIR’ the directory where the +library itself was installed. This is the value that you passed with +the ‘--libdir’ option to ‘configure’, or otherwise the same as +‘${LIBUNISTRING_PREFIX}/lib’. Recall that when building 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 -`--libdir=${LIBUNISTRING_PREFIX}/lib64'. +‘--libdir=${LIBUNISTRING_PREFIX}/lib64’. So that the compiler finds the include files, you have to pass it the -option `-I${LIBUNISTRING_INCLUDEDIR}'. +option ‘-I${LIBUNISTRING_INCLUDEDIR}’. So that the compiler finds the library during its linking pass, you -have to pass it the options `-L${LIBUNISTRING_LIBDIR} -lunistring'. On +have to pass it the options ‘-L${LIBUNISTRING_LIBDIR} -lunistring’. On some systems, in some configurations, you also have to pass options -needed for linking with `libiconv'. The autoconf macro -`gl_LIBUNISTRING' (see *note Autoconf macro::) deals with this +needed for linking with ‘libiconv’. The autoconf macro +‘gl_LIBUNISTRING’ (see *note Autoconf macro::) deals with this particularity. File: libunistring.info, Node: Include files, Next: Autoconf macro, Prev: Compiler options, Up: Using the library -15.3 Include files +16.3 Include files ================== Most of the include files have been presented in the introduction, see *note Introduction::, and subsequent detailed chapters. - Another include file is `<unistring/version.h>'. It contains the + Another include file is ‘<unistring/version.h>’. It contains the version number of the libunistring library. -- Macro: int _LIBUNISTRING_VERSION This constant contains the version of libunistring that is being used at compile time. It encodes the major and minor parts of the version number only. These parts are encoded in the form - `(major<<8) + minor'. + ‘(major<<8) + minor’. -- Constant: int _libunistring_version This constant contains the version of libunistring that is being used at run time. It encodes the major and minor parts of the version number only. These parts are encoded in the form - `(major<<8) + minor'. + ‘(major<<8) + minor’. - It is possible that `_libunistring_version' is greater than -`_LIBUNISTRING_VERSION'. This can happen when you use `libunistring' -as a shared library, and a newer, binary backward-compatible version -has been installed after your program that uses `libunistring' was + It is possible that ‘_libunistring_version’ is greater than +‘_LIBUNISTRING_VERSION’. This can happen when you use ‘libunistring’ as +a shared library, and a newer, binary backward-compatible version has +been installed after your program that uses ‘libunistring’ was installed. File: libunistring.info, Node: Autoconf macro, Next: Reporting problems, Prev: Include files, Up: Using the library -15.4 Autoconf macro +16.4 Autoconf macro =================== GNU Gnulib provides an autoconf macro that tests for the availability -of `libunistring'. It is contained in the Gnulib module -`libunistring', see -`http://www.gnu.org/software/gnulib/MODULES.html#module=libunistring'. +of ‘libunistring’. It is contained in the Gnulib module ‘libunistring’, +see +<http://www.gnu.org/software/gnulib/MODULES.html#module=libunistring>. - The macro is called `gl_LIBUNISTRING'. It searches for an installed -libunistring. If found, it sets and AC_SUBSTs `HAVE_LIBUNISTRING=yes' -and the `LIBUNISTRING' and `LTLIBUNISTRING' variables and augments the -`CPPFLAGS' variable, and defines the C macro `HAVE_LIBUNISTRING' to 1. -Otherwise, it sets and AC_SUBSTs `HAVE_LIBUNISTRING=no' and -`LIBUNISTRING' and `LTLIBUNISTRING' to empty. + The macro is called ‘gl_LIBUNISTRING’. It searches for an installed +libunistring. If found, it sets and AC_SUBSTs ‘HAVE_LIBUNISTRING=yes’ +and the ‘LIBUNISTRING’ and ‘LTLIBUNISTRING’ variables and augments the +‘CPPFLAGS’ variable, and defines the C macro ‘HAVE_LIBUNISTRING’ to 1. +Otherwise, it sets and AC_SUBSTs ‘HAVE_LIBUNISTRING=no’ and +‘LIBUNISTRING’ and ‘LTLIBUNISTRING’ to empty. - The complexities that `gl_LIBUNISTRING' deals with are the following: + The complexities that ‘gl_LIBUNISTRING’ deals with are the following: - * On some operating systems, in some configurations, libunistring - depends on `libiconv', and the options for linking with libiconv + • On some operating systems, in some configurations, libunistring + depends on ‘libiconv’, and the options for linking with libiconv must be mentioned explicitly on the link command line. - * GNU `libunistring', if installed, is not necessarily already in the - search path (`CPPFLAGS' for the include file search path, - `LDFLAGS' for the library search path). + • GNU ‘libunistring’, if installed, is not necessarily already in the + search path (‘CPPFLAGS’ for the include file search path, ‘LDFLAGS’ + for the library search path). - * GNU `libunistring', if installed, is not necessarily already in the + • GNU ‘libunistring’, if installed, is not necessarily already in the run time library search path. To avoid the need for setting an - environment variable like `LD_LIBRARY_PATH', the macro adds the - appropriate run time search path options to the `LIBUNISTRING' + environment variable like ‘LD_LIBRARY_PATH’, the macro adds the + appropriate run time search path options to the ‘LIBUNISTRING’ variable. This works on most systems. File: libunistring.info, Node: Reporting problems, Prev: Autoconf macro, Up: Using the library -15.5 Reporting problems +16.5 Reporting problems ======================= - If you encounter any problem, please don't hesitate to send a -detailed bug report to the `bug-libunistring@gnu.org' mailing list. -You can alternatively also use the bug tracker at the project page -`https://savannah.gnu.org/projects/libunistring'. + If you encounter any problem, please don’t hesitate to send a +detailed bug report to the ‘bug-libunistring@gnu.org’ mailing list. You +can alternatively also use the bug tracker at the project page +<https://savannah.gnu.org/projects/libunistring>. Please always include the version number of this library, and a short description of your operating system and compilation environment with corresponding version numbers. For problems that appear while building and installing -`libunistring', for which you don't find the remedy in the `INSTALL' -file, please include a description of the options that you passed to -the `configure' script. +‘libunistring’, for which you don’t find the remedy in the ‘INSTALL’ +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 -16 More advanced functionality +17 More advanced functionality ****************************** - For bidirectional reordering of strings, we recommend the GNU -FriBidi library: `http://www.fribidi.org/'. + For bidirectional reordering of strings, we recommend the GNU FriBidi +library: <http://www.fribidi.org/>. For the rendering of Unicode strings outside of the context of a given toolkit (KDE/Qt or GNOME/Gtk), we recommend the Pango library: -`http://www.pango.org/'. +<http://www.pango.org/>. File: libunistring.info, Node: Licenses, Next: Index, Prev: More functionality, Up: Top @@ -3777,24 +4044,24 @@ Appendix A Licenses The files of this package are covered by the licenses indicated in each particular file or directory. Here is a summary: - * The `libunistring' library is covered by the GNU Lesser General - Public License (LGPL). A copy of the license is included in *note + • The ‘libunistring’ library is covered by the GNU Lesser General + Public License (LGPL). A copy of the license is included in *note GNU LGPL::. - * This manual is free documentation. It is dually licensed under the - GNU FDL and the GNU GPL. This means that you can redistribute this + • 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. - This manual is covered by the GNU FDL. Permission is granted to + 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 *note GNU FDL::. - This manual is covered by the GNU GPL. You can redistribute it + 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 + later version published by the Free Software Foundation (FSF). A copy of the license is included in *note GNU GPL::. * Menu: @@ -3811,7 +4078,7 @@ A.1 GNU GENERAL PUBLIC LICENSE Version 3, 29 June 2007 - Copyright (C) 2007 Free Software Foundation, Inc. `http://fsf.org/' + Copyright © 2007 Free Software Foundation, Inc. <http://fsf.org/> Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. @@ -3825,11 +4092,11 @@ software and other kinds of works. 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. +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. When we speak of free software, we are referring to freedom, not price. Our General Public Licenses are designed to make sure that you @@ -3839,9 +4106,9 @@ 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. 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. +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. 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 @@ -3853,23 +4120,22 @@ know their rights. (1) assert copyright on the software, and (2) offer you this License giving you legal permission to copy, distribute and/or modify it. - 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 + 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. 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. +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. Finally, every program is threatened constantly by software patents. States should not allow patents to restrict development and use of @@ -3886,82 +4152,82 @@ TERMS AND CONDITIONS 0. Definitions. - "This License" refers to version 3 of the GNU General Public + “This License” refers to version 3 of the GNU General Public License. - "Copyright" also means copyright-like laws that apply to other + “Copyright” also means copyright-like laws that apply to other kinds of works, such as semiconductor masks. - "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. + “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. - To "modify" a work means to copy from or adapt all or part of the + 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. + 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. - A "covered work" means either the unmodified Program or a work + A “covered work” means either the unmodified Program or a work based on the Program. - To "propagate" a work means to do anything with it that, without + 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 + 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. - To "convey" a work means any kind of propagation that enables other + 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. - An interactive user interface displays "Appropriate Legal Notices" + 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 + 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. 1. Source Code. - 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. + 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. - A "Standard Interface" means an interface that either is an + 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. - The "System Libraries" of an executable work include anything, + 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 + 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. - The "Corresponding Source" for a work in object code form means all + 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 + 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 + 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. @@ -3978,28 +4244,28 @@ TERMS AND CONDITIONS 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. + 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. 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. + 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. Conveying under any other circumstances is permitted solely under the conditions stated below. Sublicensing is not allowed; section 10 makes it unnecessary. - 3. Protecting Users' Legal Rights From Anti-Circumvention Law. + 3. Protecting Users’ Legal Rights From Anti-Circumvention Law. No covered work shall be deemed part of an effective technological measure under any applicable law fulfilling obligations under @@ -4010,14 +4276,14 @@ TERMS AND CONDITIONS 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 + 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. 4. Conveying Verbatim Copies. - You may convey verbatim copies of the Program's source code as you + 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 @@ -4041,7 +4307,7 @@ TERMS AND CONDITIONS b. 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". + section 4 to “keep intact all notices”. c. You must license the entire work, as a whole, under this License to anyone who comes into possession of a copy. This @@ -4061,9 +4327,9 @@ TERMS AND CONDITIONS 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 + 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. + 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. @@ -4081,8 +4347,8 @@ TERMS AND CONDITIONS b. 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 + 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 @@ -4092,43 +4358,42 @@ TERMS AND CONDITIONS to copy the Corresponding Source from a network server at no charge. - c. Convey individual copies of the object code with a copy of - the written offer to provide the Corresponding Source. This + c. 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. d. 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 (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. + 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. + remain obligated to ensure that it is available for as long as + needed to satisfy these requirements. e. 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. - 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. - A "User Product" is either (1) a "consumer product", which means + 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 + 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 + “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 @@ -4136,7 +4401,7 @@ TERMS AND CONDITIONS industrial or non-consumer uses, unless such uses represent the only significant mode of use of the product. - "Installation Information" for a User Product means any methods, + “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. @@ -4157,11 +4422,11 @@ TERMS AND CONDITIONS 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 + 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. Corresponding Source conveyed, and Installation Information @@ -4172,7 +4437,7 @@ TERMS AND CONDITIONS 7. Additional Terms. - "Additional permissions" are terms that supplement the terms of + “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 @@ -4191,8 +4456,8 @@ TERMS AND CONDITIONS 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: + holders of that material) supplement the terms of this License with + terms: a. Disclaiming warranty or limiting liability differently from the terms of sections 15 and 16 of this License; or @@ -4202,9 +4467,8 @@ TERMS AND CONDITIONS Legal Notices displayed by works containing it; or c. 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 + or requiring that modified versions of such material be marked + in reasonable ways as different from the original version; or d. Limiting the use for publicity purposes of names of licensors or authors of the material; or @@ -4218,16 +4482,15 @@ TERMS AND CONDITIONS the recipient, for any liability that these contractual assumptions directly impose on those licensors and authors. - All other non-permissive additional terms are considered "further - restrictions" within the meaning of section 10. If the Program as + 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. + 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. 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 @@ -4243,13 +4506,13 @@ TERMS AND CONDITIONS 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). + under this License (including any patent licenses granted under the + third paragraph of section 11). 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 + 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. @@ -4261,10 +4524,10 @@ TERMS AND CONDITIONS after your receipt of the notice. 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. + 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. 9. Acceptance Not Required for Having Copies. @@ -4278,7 +4541,7 @@ TERMS AND CONDITIONS by modifying or propagating a covered work, you indicate your acceptance of this License to do so. - 10. Automatic Licensing of Downstream Recipients. + 10. Automatic Licensing of Downstream Recipients. Each time you convey a covered work, the recipient automatically receives a license from the original licensors, to run, modify and @@ -4286,55 +4549,55 @@ TERMS AND CONDITIONS responsible for enforcing compliance by third parties with this License. - An "entity transaction" is a transaction transferring control of an + 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. + 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. 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. + 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. - 11. Patents. + 11. Patents. - A "contributor" is a copyright holder who authorizes use under this + 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". + The work thus licensed is called the contributor’s “contributor + version”. - A contributor's "essential patent claims" are all patent claims + 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" + 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. Each contributor grants you a non-exclusive, worldwide, - royalty-free patent license under the contributor's essential + 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. + otherwise run, modify and propagate the contents of its contributor + version. - In the following three paragraphs, a "patent license" is any + 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. + 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. If you convey a covered work, knowingly relying on a patent license, and the Corresponding Source of the work is not available @@ -4345,9 +4608,9 @@ TERMS AND CONDITIONS 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 + 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 + 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. @@ -4359,41 +4622,40 @@ TERMS AND CONDITIONS patent license you grant is automatically extended to all recipients of the covered work and works based on it. - A patent license is "discriminatory" if it does not include within + 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. + 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. 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. - 12. No Surrender of Others' Freedom. + 12. No Surrender of Others’ Freedom. - 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. + 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. - 13. Use with the GNU Affero General Public License. + 13. Use with the GNU Affero General Public License. Notwithstanding any other provision of this License, you have permission to link or combine any covered work with a work licensed @@ -4404,26 +4666,25 @@ TERMS AND CONDITIONS General Public License, section 13, concerning interaction through a network will apply to the combination as such. - 14. Revised Versions of this License. + 14. Revised Versions of this License. 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. + 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. 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 + 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. + 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. 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 + proxy’s public statement of acceptance of a version permanently authorizes you to choose that version for the Program. Later license versions may give you additional or different @@ -4431,24 +4692,24 @@ TERMS AND CONDITIONS author or copyright holder as a result of your choosing to follow a later version. - 15. Disclaimer of Warranty. + 15. Disclaimer of Warranty. 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" + 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 + 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. - 16. Limitation of Liability. + 16. Limitation of Liability. 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 + 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 @@ -4456,7 +4717,7 @@ TERMS AND CONDITIONS PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. - 17. Interpretation of Sections 15 and 16. + 17. Interpretation of Sections 15 and 16. If the disclaimer of warranty and limitation of liability provided above cannot be given local legal effect according to their terms, @@ -4465,7 +4726,6 @@ TERMS AND CONDITIONS connection with the Program, unless a warranty or assumption of liability accompanies a copy of the Program in return for a fee. - END OF TERMS AND CONDITIONS =========================== @@ -4480,7 +4740,7 @@ terms. 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. +“copyright” line and a pointer to where the full notice is found. ONE LINE TO GIVE THE PROGRAM'S NAME AND A BRIEF IDEA OF WHAT IT DOES. Copyright (C) YEAR NAME OF AUTHOR @@ -4496,7 +4756,7 @@ state the exclusion of warranty; and each file should have at least the 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 `http://www.gnu.org/licenses/'. + along with this program. If not, see <http://www.gnu.org/licenses/>. Also add information on how to contact you by electronic and paper mail. @@ -4505,26 +4765,26 @@ mail. notice like this when it starts in an interactive mode: PROGRAM Copyright (C) YEAR NAME OF AUTHOR - This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. + This program comes with ABSOLUTELY NO WARRANTY; for details type ‘show w’. This is free software, and you are welcome to redistribute it - under certain conditions; type `show c' for details. + under certain conditions; type ‘show c’ for details. - The hypothetical commands `show w' and `show c' should show the + The hypothetical commands ‘show w’ and ‘show c’ 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". +program’s commands might be different; for a GUI interface, you would +use an “about box”. 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 +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 `http://www.gnu.org/licenses/'. +the GNU GPL, see <http://www.gnu.org/licenses/>. 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 `http://www.gnu.org/philosophy/why-not-lgpl.html'. +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 @@ -4534,41 +4794,41 @@ A.2 GNU LESSER GENERAL PUBLIC LICENSE Version 3, 29 June 2007 - Copyright (C) 2007 Free Software Foundation, Inc. `http://fsf.org/' + Copyright © 2007 Free Software Foundation, Inc. <http://fsf.org/> Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. 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. +the terms and conditions of version 3 of the GNU General Public License, +supplemented by the additional permissions listed below. 0. Additional Definitions. - As used herein, "this License" refers to version 3 of the GNU - Lesser General Public License, and the "GNU GPL" refers to version + 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. - "The Library" refers to a covered work governed by this License, + “The Library” refers to a covered work governed by this License, other than an Application or a Combined Work as defined below. - An "Application" is any work that makes use of an interface + 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. - A "Combined Work" is a work produced by combining or linking an + 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". + “Linked Version”. - The "Minimal Corresponding Source" for a Combined Work means the + 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. - The "Corresponding Application Code" for a Combined Work means the + 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 @@ -4584,12 +4844,12 @@ License, supplemented by the additional permissions listed below. 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: + passed when the facility is invoked), then you may convey a copy of + the modified version: - a. 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 + a. 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 b. under the GNU GPL, with none of the additional permissions of @@ -4608,7 +4868,6 @@ License, supplemented by the additional permissions listed below. a. 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. - b. Accompany the object code with a copy of the GNU GPL and this license document. @@ -4623,15 +4882,12 @@ License, supplemented by the additional permissions listed below. a. 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. - b. Accompany the Combined Work with a copy of the GNU GPL and this license document. - c. 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. - d. Do one of the following: 0. Convey the Minimal Corresponding Source under the terms @@ -4642,11 +4898,10 @@ License, supplemented by the additional permissions listed below. modified Combined Work, in the manner specified by section 6 of the GNU GPL for conveying Corresponding Source. - 1. 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 + user’s computer system, and (b) will operate properly with a modified version of the Library that is interface-compatible with the Linked Version. @@ -4656,9 +4911,9 @@ License, supplemented by the additional permissions listed below. 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 + 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, + 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.) @@ -4667,14 +4922,13 @@ License, supplemented by the additional permissions listed below. 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 + 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: a. 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. - b. 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. @@ -4683,16 +4937,16 @@ License, supplemented by the additional permissions listed below. 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 + time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns. - Each version is given a distinguishing version number. If the + 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 + 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 + 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 @@ -4700,11 +4954,10 @@ License, supplemented by the additional permissions listed below. 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 + shall apply, that proxy’s public statement of acceptance of any version is permanent authorization for you to choose that version for the Library. - File: libunistring.info, Node: GNU FDL, Prev: GNU LGPL, Up: Licenses @@ -4713,8 +4966,8 @@ A.3 GNU Free Documentation License Version 1.3, 3 November 2008 - Copyright (C) 2000, 2001, 2002, 2007, 2008 Free Software Foundation, Inc. - `http://fsf.org/' + Copyright © 2000, 2001, 2002, 2007, 2008 Free Software Foundation, Inc. + <http://fsf.org/> Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. @@ -4729,7 +4982,7 @@ A.3 GNU Free Documentation License author and publisher a way to get credit for their work, while not being considered responsible for modifications made by others. - This License is a kind of "copyleft", which means that derivative + 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. @@ -4739,29 +4992,29 @@ A.3 GNU Free Documentation License 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 + 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. 1. APPLICABILITY AND DEFINITIONS 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 + 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. + “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. - A "Modified Version" of the Document means any work containing the + 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. - A "Secondary Section" is a named appendix or a front-matter section + 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 + 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 @@ -4770,62 +5023,62 @@ A.3 GNU Free Documentation License of legal, commercial, philosophical, ethical or political position regarding them. - 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. + 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. - The "Cover Texts" are certain short passages of text that are + 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. - A "Transparent" copy of the Document means a machine-readable copy, + 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". + 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”. Examples of suitable formats for Transparent copies include plain ASCII without markup, Texinfo input format, LaTeX input format, - SGML or XML using a publicly available DTD, and - standard-conforming simple HTML, PostScript or PDF designed for - human modification. Examples of transparent image formats include - PNG, XCF and JPG. Opaque formats include proprietary formats that - can be read and edited only by proprietary word processors, SGML or - XML for which the DTD and/or processing tools are not generally - available, and the machine-generated HTML, PostScript or PDF - produced by some word processors for output purposes only. - - The "Title Page" means, for a printed book, the title page itself, + SGML or XML using a publicly available DTD, and standard-conforming + simple HTML, PostScript or PDF designed for human modification. + Examples of transparent image formats include PNG, XCF and JPG. + Opaque formats include proprietary formats that can be read and + edited only by proprietary word processors, SGML or XML for which + the DTD and/or processing tools are not generally available, and + the machine-generated HTML, PostScript or PDF produced by some word + processors for output purposes only. + + 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. + 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. - The "publisher" means any person or entity that distributes copies + The “publisher” means any person or entity that distributes copies of the Document to the public. - A section "Entitled XYZ" means a named subunit of the Document + 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 + “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. The Document may include Warranty Disclaimers next to the notice @@ -4845,8 +5098,8 @@ A.3 GNU Free Documentation License 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. + distribute a large enough number of copies you must also follow the + conditions in section 3. You may also lend copies, under the same conditions stated above, and you may publicly display copies. @@ -4855,17 +5108,16 @@ A.3 GNU Free Documentation License 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 + 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. + 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. If the required texts for either cover are too voluminous to fit legibly, you should put the first ones listed (as many as fit @@ -4873,40 +5125,39 @@ A.3 GNU Free Documentation License adjacent pages. 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. + 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. 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. + 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. 4. MODIFICATIONS 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: + 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: A. 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. + 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. B. List on the Title Page, as authors, one or more persons or entities responsible for authorship of the modifications in @@ -4929,72 +5180,71 @@ A.3 GNU Free Documentation License the Addendum below. G. Preserve in that license notice the full lists of Invariant - Sections and required Cover Texts given in the Document's + Sections and required Cover Texts given in the Document’s license notice. H. Include an unaltered copy of this License. - I. Preserve the section Entitled "History", Preserve its Title, + I. 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. + 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. J. 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. - - K. 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 + 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. + + K. 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. - L. 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. + L. 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. - M. Delete any section Entitled "Endorsements". Such a section + M. Delete any section Entitled “Endorsements”. Such a section may not be included in the Modified Version. N. Do not retitle any existing section to be Entitled - "Endorsements" or to conflict in title with any Invariant + “Endorsements” or to conflict in title with any Invariant Section. O. Preserve any Warranty Disclaimers. 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. + 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. - You may add a section Entitled "Endorsements", provided it contains + 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. + parties—for example, statements of peer review or that the text has + been approved by an organization as the authoritative definition of + a standard. 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. + 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. 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 @@ -5004,8 +5254,8 @@ A.3 GNU Free Documentation License 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, + 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. @@ -5021,10 +5271,10 @@ A.3 GNU Free Documentation License combined work. 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." + “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.” 6. COLLECTIONS OF DOCUMENTS @@ -5032,29 +5282,29 @@ A.3 GNU Free Documentation License 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. + rules of this License for verbatim copying of each of the documents + in all other respects. 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. + a copy of this License into the extracted document, and follow this + License in all other respects regarding verbatim copying of that + document. 7. AGGREGATION WITH INDEPENDENT WORKS 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 + 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 + 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. 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 + 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 @@ -5076,8 +5326,8 @@ A.3 GNU Free Documentation License this License or a notice or disclaimer, the original version will prevail. - If a section in the Document is Entitled "Acknowledgements", - "Dedications", or "History", the requirement (section 4) to + 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. @@ -5090,8 +5340,8 @@ A.3 GNU Free Documentation License 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 + 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. @@ -5103,52 +5353,52 @@ A.3 GNU Free Documentation License after your receipt of the notice. 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. + 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. - 10. FUTURE REVISIONS OF THIS LICENSE + 10. FUTURE REVISIONS OF THIS LICENSE 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 - `http://www.gnu.org/copyleft/'. + <http://www.gnu.org/copyleft/>. 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 + 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 + 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. - 11. RELICENSING + 11. RELICENSING - "Massive Multiauthor Collaboration Site" (or "MMC Site") means any + “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 + A “Massive Multiauthor Collaboration” (or “MMC”) contained in the site means any set of copyrightable works thus published on the MMC site. - "CC-BY-SA" means the Creative Commons Attribution-Share Alike 3.0 + “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. - "Incorporate" means to publish or republish a Document, in whole or + “Incorporate” means to publish or republish a Document, in whole or in part, as part of another Document. - An MMC is "eligible for relicensing" if it is licensed under this + 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 @@ -5159,7 +5409,6 @@ A.3 GNU Free Documentation License site under CC-BY-SA on the same site at any time before August 1, 2009, provided the MMC is eligible for relicensing. - ADDENDUM: How to use this License for your documents ==================================================== @@ -5176,7 +5425,7 @@ notices just after the title page: Free Documentation License''. If you have Invariant Sections, Front-Cover Texts and Back-Cover -Texts, replace the "with...Texts." line with this: +Texts, replace the “with…Texts.” line with this: with the Invariant Sections being LIST THEIR TITLES, with the Front-Cover Texts being LIST, and with the Back-Cover Texts @@ -5187,9 +5436,9 @@ combination of the three, merge those two alternatives to suit the situation. 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. +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. File: libunistring.info, Node: Index, Prev: Licenses, Up: Top @@ -5201,12 +5450,16 @@ Index * Menu: * ambiguous width: uniwidth.h. (line 10) +* Arabic shaping: Arabic shaping. (line 6) * argument conventions: Conventions. (line 9) * autoconf macro: Autoconf macro. (line 6) -* bidirectional category: Bidirectional category. - (line 6) +* bidi class: Bidi class. (line 6) +* bidirectional category: Bidi class. (line 6) * bidirectional reordering: More functionality. (line 6) * block: Blocks. (line 6) +* boundaries, between grapheme clusters: unigbrk.h. (line 6) +* boundaries, between words: uniwbrk.h. (line 6) +* breaks, grapheme cluster: unigbrk.h. (line 6) * breaks, line: unilbrk.h. (line 6) * breaks, word: uniwbrk.h. (line 6) * bug reports: Reporting problems. (line 6) @@ -5222,74 +5475,79 @@ Index * case mappings: Case mappings of strings. (line 6) * casing_prefix_context_t: Case mappings of substrings. - (line 15) + (line 14) * casing_suffix_context_t: Case mappings of substrings. - (line 46) -* char, type: char * strings. (line 23) + (line 43) +* char, type: char * strings. (line 22) * combining, Unicode characters: Composition of characters. (line 6) -* comparing <1>: Elementary string functions on NUL terminated strings. - (line 130) * comparing: Elementary string functions. (line 108) +* comparing <1>: Elementary string functions on NUL terminated strings. + (line 131) * comparing, ignoring case: Case insensitive comparison. (line 6) * comparing, ignoring case, with collation rules: Case insensitive comparison. - (line 66) + (line 65) * 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 66) + (line 65) * comparing, ignoring normalization, with collation rules: Normalizing comparisons. - (line 23) + (line 22) * comparing, with collation rules: Elementary string functions on NUL terminated strings. - (line 142) + (line 143) * comparing, with collation rules, ignoring case: Case insensitive comparison. - (line 66) + (line 65) * comparing, with collation rules, ignoring normalization: Normalizing comparisons. - (line 23) + (line 22) * comparing, with collation rules, ignoring normalization and case: Case insensitive comparison. - (line 66) + (line 65) * compiler options: Compiler options. (line 24) * composing, Unicode characters: Composition of characters. (line 6) -* converting <1>: uniconv.h. (line 45) * converting: Elementary string conversions. (line 6) -* copying <1>: Elementary string functions on NUL terminated strings. - (line 61) +* 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) * decomposing: Decomposition of characters. (line 6) * dependencies: Installation. (line 6) * detecting case: Case detection. (line 6) -* duplicating <1>: Elementary string functions on NUL terminated strings. - (line 168) * duplicating: Elementary string functions with memory allocation. (line 6) -* enum iconv_ilseq_handler: uniconv.h. (line 30) +* duplicating <1>: Elementary string functions on NUL terminated strings. + (line 169) +* enum iconv_ilseq_handler: uniconv.h. (line 29) * FDL, GNU Free Documentation License: GNU FDL. (line 6) * formatted output: unistdio.h. (line 6) * fullwidth: uniwidth.h. (line 22) * general category: General category. (line 6) * gl_LIBUNISTRING: Autoconf macro. (line 11) * GPL, GNU General Public License: GNU GPL. (line 6) +* grapheme cluster boundaries: unigbrk.h. (line 6) +* grapheme cluster breaks: unigbrk.h. (line 6) * halfwidth: uniwidth.h. (line 22) * identifiers: ISO C and Java syntax. (line 6) * installation: Installation. (line 10) * internationalization: Unicode and i18n. (line 6) -* iterating <1>: Elementary string functions on NUL terminated strings. - (line 15) * iterating: Elementary string functions. (line 6) +* iterating <1>: Elementary string functions on NUL terminated strings. + (line 15) * Java, programming language: ISO C and Java syntax. (line 6) +* joining group: Joining group. (line 6) +* joining of Arabic characters: Arabic shaping. (line 6) +* joining type: Joining type. (line 6) * LGPL, GNU Lesser General Public License: GNU LGPL. (line 6) * License, GNU FDL: GNU FDL. (line 6) * License, GNU GPL: GNU GPL. (line 6) @@ -5298,12 +5556,12 @@ Index * line breaks: unilbrk.h. (line 6) * locale: Locale encodings. (line 6) * locale categories: Locale encodings. (line 10) +* locale encoding: Locale encodings. (line 23) * locale encoding <1>: uniconv.h. (line 10) -* locale encoding: Locale encodings. (line 28) * locale language: Case mappings of strings. (line 16) * locale, multibyte: char * strings. (line 13) -* locale_charset: uniconv.h. (line 13) +* locale_charset: uniconv.h. (line 12) * lowercasing: Case mappings of strings. (line 6) * mailing list: Reporting problems. (line 6) @@ -5316,406 +5574,424 @@ Index * rendering: More functionality. (line 9) * return value conventions: Conventions. (line 47) * scripts: Scripts. (line 6) -* searching, for a character <1>: Elementary string functions on NUL terminated strings. - (line 178) * 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 234) + (line 235) * stream, normalizing a: Normalization of streams. (line 6) * struct uninorm_filter: Normalization of streams. - (line 11) + (line 10) * titlecasing: Case mappings of strings. (line 6) -* u16_asnprintf: unistdio.h. (line 132) -* u16_asprintf: unistdio.h. (line 129) +* u16_asnprintf: unistdio.h. (line 111) +* u16_asprintf: unistdio.h. (line 109) * u16_casecmp: Case insensitive comparison. - (line 51) + (line 48) * u16_casecoll: Case insensitive comparison. - (line 95) + (line 91) * u16_casefold: Case insensitive comparison. - (line 15) + (line 12) * u16_casexfrm: Case insensitive comparison. - (line 75) -* u16_casing_prefix_context: Case mappings of substrings. - (line 30) + (line 71) * u16_casing_prefixes_context: Case mappings of substrings. - (line 39) -* u16_casing_suffix_context: Case mappings of substrings. - (line 61) + (line 36) +* u16_casing_prefix_context: Case mappings of substrings. + (line 28) * u16_casing_suffixes_context: Case mappings of substrings. - (line 70) + (line 65) +* u16_casing_suffix_context: Case mappings of substrings. + (line 57) * u16_check: Elementary string checks. - (line 11) + (line 10) * u16_chr: Elementary string functions. - (line 145) + (line 143) * u16_cmp: Elementary string functions. - (line 115) + (line 113) * u16_cmp2: Elementary string functions. - (line 131) -* u16_conv_from_encoding: uniconv.h. (line 54) -* u16_conv_to_encoding: uniconv.h. (line 91) + (line 129) +* u16_conv_from_encoding: uniconv.h. (line 51) +* u16_conv_to_encoding: uniconv.h. (line 88) * u16_cpy: Elementary string functions. - (line 78) + (line 76) * u16_cpy_alloc: Elementary string functions with memory allocation. - (line 10) + (line 9) * u16_ct_casefold: Case insensitive comparison. - (line 37) + (line 32) * u16_ct_tolower: Case mappings of substrings. - (line 107) + (line 98) * u16_ct_totitle: Case mappings of substrings. - (line 125) + (line 116) * u16_ct_toupper: Case mappings of substrings. - (line 89) + (line 80) * u16_endswith: Elementary string functions on NUL terminated strings. - (line 260) -* u16_is_cased: Case detection. (line 57) -* u16_is_casefolded: Case detection. (line 44) -* u16_is_lowercase: Case detection. (line 24) -* u16_is_titlecase: Case detection. (line 34) -* u16_is_uppercase: Case detection. (line 14) -* u16_mblen: Elementary string functions. + (line 259) +* u16_grapheme_breaks: Grapheme cluster breaks in a string. + (line 34) +* u16_grapheme_next: Grapheme cluster breaks in a string. (line 11) +* u16_grapheme_prev: Grapheme cluster breaks in a string. + (line 21) +* u16_is_cased: Case detection. (line 55) +* u16_is_casefolded: Case detection. (line 42) +* 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 157) + (line 156) * u16_mbtouc: Elementary string functions. - (line 38) -* u16_mbtouc_unsafe: Elementary string functions. - (line 23) + (line 37) * u16_mbtoucr: Elementary string functions. - (line 45) + (line 44) +* u16_mbtouc_unsafe: Elementary string functions. + (line 21) * u16_move: Elementary string functions. - (line 89) + (line 87) * u16_next: Elementary string functions on NUL terminated strings. - (line 24) + (line 23) * u16_normalize: Normalization of strings. - (line 50) + (line 48) * u16_normcmp: Normalizing comparisons. - (line 13) + (line 11) * u16_normcoll: Normalizing comparisons. - (line 40) + (line 37) * u16_normxfrm: Normalizing comparisons. - (line 27) -* u16_possible_linebreaks: unilbrk.h. (line 46) + (line 24) +* u16_possible_linebreaks: unilbrk.h. (line 44) * u16_prev: Elementary string functions on NUL terminated strings. - (line 36) + (line 34) * u16_set: Elementary string functions. - (line 101) -* u16_snprintf: unistdio.h. (line 126) -* u16_sprintf: unistdio.h. (line 123) + (line 100) +* u16_snprintf: unistdio.h. (line 107) +* u16_sprintf: unistdio.h. (line 106) * u16_startswith: Elementary string functions on NUL terminated strings. - (line 252) + (line 251) * u16_stpcpy: Elementary string functions on NUL terminated strings. - (line 76) + (line 75) * u16_stpncpy: Elementary string functions on NUL terminated strings. - (line 99) + (line 98) * u16_strcat: Elementary string functions on NUL terminated strings. - (line 112) + (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_strconv_from_encoding: uniconv.h. (line 129) -* u16_strconv_from_locale: uniconv.h. (line 157) -* u16_strconv_to_encoding: uniconv.h. (line 142) -* u16_strconv_to_locale: uniconv.h. (line 167) +* 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 66) + (line 65) * u16_strcspn: Elementary string functions on NUL terminated strings. - (line 203) + (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. - (line 11) + (line 10) * u16_strmbtouc: Elementary string functions on NUL terminated strings. - (line 17) + (line 16) * u16_strncat: Elementary string functions on NUL terminated strings. - (line 123) + (line 122) * u16_strncmp: Elementary string functions on NUL terminated strings. - (line 161) + (line 160) * u16_strncpy: Elementary string functions on NUL terminated strings. - (line 88) + (line 87) * u16_strnlen: Elementary string functions on NUL terminated strings. (line 55) * u16_strpbrk: Elementary string functions on NUL terminated strings. - (line 227) + (line 226) * u16_strrchr: Elementary string functions on NUL terminated strings. (line 190) * u16_strspn: Elementary string functions on NUL terminated strings. - (line 215) + (line 214) * u16_strstr: Elementary string functions on NUL terminated strings. - (line 241) + (line 240) * u16_strtok: Elementary string functions on NUL terminated strings. - (line 270) -* u16_strwidth: uniwidth.h. (line 39) -* u16_to_u32: Elementary string conversions. - (line 23) -* u16_to_u8: Elementary string conversions. - (line 19) + (line 269) +* u16_strwidth: uniwidth.h. (line 38) * u16_tolower: Case mappings of strings. - (line 44) + (line 41) * u16_totitle: Case mappings of strings. - (line 58) + (line 55) * u16_toupper: Case mappings of strings. - (line 30) -* u16_u16_asnprintf: unistdio.h. (line 159) -* u16_u16_asprintf: unistdio.h. (line 156) -* u16_u16_snprintf: unistdio.h. (line 153) -* u16_u16_sprintf: unistdio.h. (line 150) -* u16_u16_vasnprintf: unistdio.h. (line 171) -* u16_u16_vasprintf: unistdio.h. (line 168) -* u16_u16_vsnprintf: unistdio.h. (line 165) -* u16_u16_vsprintf: unistdio.h. (line 162) + (line 27) +* u16_to_u32: Elementary string conversions. + (line 21) +* u16_to_u8: Elementary string conversions. + (line 17) +* u16_u16_asnprintf: unistdio.h. (line 131) +* u16_u16_asprintf: unistdio.h. (line 129) +* u16_u16_snprintf: unistdio.h. (line 127) +* u16_u16_sprintf: unistdio.h. (line 125) +* u16_u16_vasnprintf: unistdio.h. (line 139) +* 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 62) -* u16_vasnprintf: unistdio.h. (line 144) -* u16_vasprintf: unistdio.h. (line 141) -* u16_vsnprintf: unistdio.h. (line 138) -* u16_vsprintf: unistdio.h. (line 135) -* u16_width: uniwidth.h. (line 31) -* u16_width_linebreaks: unilbrk.h. (line 65) + (line 61) +* u16_vasnprintf: unistdio.h. (line 119) +* u16_vasprintf: unistdio.h. (line 117) +* u16_vsnprintf: unistdio.h. (line 115) +* u16_vsprintf: unistdio.h. (line 113) +* u16_width: uniwidth.h. (line 29) +* u16_width_linebreaks: unilbrk.h. (line 62) * u16_wordbreaks: Word breaks in a string. - (line 10) -* u32_asnprintf: unistdio.h. (line 185) -* u32_asprintf: unistdio.h. (line 182) + (line 9) +* u32_asnprintf: unistdio.h. (line 150) +* u32_asprintf: unistdio.h. (line 148) * u32_casecmp: Case insensitive comparison. - (line 54) + (line 51) * u32_casecoll: Case insensitive comparison. - (line 98) + (line 94) * u32_casefold: Case insensitive comparison. - (line 18) + (line 15) * u32_casexfrm: Case insensitive comparison. - (line 78) -* u32_casing_prefix_context: Case mappings of substrings. - (line 32) + (line 74) * u32_casing_prefixes_context: Case mappings of substrings. - (line 42) -* u32_casing_suffix_context: Case mappings of substrings. - (line 63) + (line 38) +* u32_casing_prefix_context: Case mappings of substrings. + (line 30) * u32_casing_suffixes_context: Case mappings of substrings. - (line 73) + (line 67) +* u32_casing_suffix_context: Case mappings of substrings. + (line 59) * u32_check: Elementary string checks. - (line 12) + (line 11) * u32_chr: Elementary string functions. - (line 147) + (line 145) * u32_cmp: Elementary string functions. - (line 117) + (line 115) * u32_cmp2: Elementary string functions. - (line 133) -* u32_conv_from_encoding: uniconv.h. (line 57) -* u32_conv_to_encoding: uniconv.h. (line 94) + (line 131) +* u32_conv_from_encoding: uniconv.h. (line 54) +* u32_conv_to_encoding: uniconv.h. (line 91) * u32_cpy: Elementary string functions. - (line 80) + (line 78) * u32_cpy_alloc: Elementary string functions with memory allocation. - (line 11) + (line 10) * u32_ct_casefold: Case insensitive comparison. - (line 42) + (line 37) * u32_ct_tolower: Case mappings of substrings. - (line 112) + (line 103) * u32_ct_totitle: Case mappings of substrings. - (line 130) + (line 121) * u32_ct_toupper: Case mappings of substrings. - (line 94) + (line 85) * u32_endswith: Elementary string functions on NUL terminated strings. - (line 262) -* u32_is_cased: Case detection. (line 59) -* u32_is_casefolded: Case detection. (line 46) -* u32_is_lowercase: Case detection. (line 26) -* u32_is_titlecase: Case detection. (line 36) -* u32_is_uppercase: Case detection. (line 16) + (line 261) +* u32_grapheme_breaks: Grapheme cluster breaks in a string. + (line 36) +* u32_grapheme_next: Grapheme cluster breaks in a string. + (line 13) +* u32_grapheme_prev: Grapheme cluster breaks in a string. + (line 23) +* u32_is_cased: Case detection. (line 57) +* u32_is_casefolded: Case detection. (line 44) +* 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 12) + (line 11) * u32_mbsnlen: Elementary string functions. - (line 158) + (line 157) * u32_mbtouc: Elementary string functions. - (line 39) -* u32_mbtouc_unsafe: Elementary string functions. - (line 25) + (line 38) * u32_mbtoucr: Elementary string functions. - (line 46) + (line 45) +* u32_mbtouc_unsafe: Elementary string functions. + (line 23) * u32_move: Elementary string functions. - (line 91) + (line 89) * u32_next: Elementary string functions on NUL terminated strings. - (line 25) + (line 24) * u32_normalize: Normalization of strings. - (line 52) + (line 50) * u32_normcmp: Normalizing comparisons. - (line 15) + (line 13) * u32_normcoll: Normalizing comparisons. - (line 42) + (line 39) * u32_normxfrm: Normalizing comparisons. - (line 29) -* u32_possible_linebreaks: unilbrk.h. (line 48) + (line 26) +* u32_possible_linebreaks: unilbrk.h. (line 46) * u32_prev: Elementary string functions on NUL terminated strings. - (line 38) + (line 36) * u32_set: Elementary string functions. - (line 102) -* u32_snprintf: unistdio.h. (line 179) -* u32_sprintf: unistdio.h. (line 176) + (line 101) +* u32_snprintf: unistdio.h. (line 146) +* u32_sprintf: unistdio.h. (line 145) * u32_startswith: Elementary string functions on NUL terminated strings. - (line 254) + (line 253) * u32_stpcpy: Elementary string functions on NUL terminated strings. - (line 78) + (line 77) * u32_stpncpy: Elementary string functions on NUL terminated strings. - (line 101) + (line 100) * u32_strcat: Elementary string functions on NUL terminated strings. - (line 114) + (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_strconv_from_encoding: uniconv.h. (line 131) -* u32_strconv_from_locale: uniconv.h. (line 158) -* u32_strconv_to_encoding: uniconv.h. (line 144) -* u32_strconv_to_locale: uniconv.h. (line 168) +* 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 68) + (line 67) * u32_strcspn: Elementary string functions on NUL terminated strings. - (line 205) + (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. - (line 12) + (line 11) * u32_strmbtouc: Elementary string functions on NUL terminated strings. - (line 18) + (line 17) * u32_strncat: Elementary string functions on NUL terminated strings. - (line 125) + (line 124) * u32_strncmp: Elementary string functions on NUL terminated strings. - (line 163) + (line 162) * u32_strncpy: Elementary string functions on NUL terminated strings. - (line 90) + (line 89) * u32_strnlen: Elementary string functions on NUL terminated strings. (line 56) * u32_strpbrk: Elementary string functions on NUL terminated strings. - (line 229) + (line 228) * u32_strrchr: Elementary string functions on NUL terminated strings. (line 191) * u32_strspn: Elementary string functions on NUL terminated strings. - (line 217) + (line 216) * u32_strstr: Elementary string functions on NUL terminated strings. - (line 243) + (line 242) * u32_strtok: Elementary string functions on NUL terminated strings. - (line 272) -* u32_strwidth: uniwidth.h. (line 40) -* u32_to_u16: Elementary string conversions. - (line 31) -* u32_to_u8: Elementary string conversions. - (line 27) + (line 271) +* u32_strwidth: uniwidth.h. (line 39) * u32_tolower: Case mappings of strings. - (line 47) + (line 44) * u32_totitle: Case mappings of strings. - (line 61) + (line 58) * u32_toupper: Case mappings of strings. - (line 33) -* u32_u32_asnprintf: unistdio.h. (line 212) -* u32_u32_asprintf: unistdio.h. (line 209) -* u32_u32_snprintf: unistdio.h. (line 206) -* u32_u32_sprintf: unistdio.h. (line 203) -* u32_u32_vasnprintf: unistdio.h. (line 224) -* u32_u32_vasprintf: unistdio.h. (line 221) -* u32_u32_vsnprintf: unistdio.h. (line 218) -* u32_u32_vsprintf: unistdio.h. (line 215) + (line 30) +* u32_to_u16: Elementary string conversions. + (line 29) +* u32_to_u8: Elementary string conversions. + (line 25) +* u32_u32_asnprintf: unistdio.h. (line 170) +* u32_u32_asprintf: unistdio.h. (line 168) +* u32_u32_snprintf: unistdio.h. (line 166) +* u32_u32_sprintf: unistdio.h. (line 164) +* u32_u32_vasnprintf: unistdio.h. (line 178) +* 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 63) -* u32_vasnprintf: unistdio.h. (line 197) -* u32_vasprintf: unistdio.h. (line 194) -* u32_vsnprintf: unistdio.h. (line 191) -* u32_vsprintf: unistdio.h. (line 188) -* u32_width: uniwidth.h. (line 33) -* u32_width_linebreaks: unilbrk.h. (line 68) + (line 62) +* u32_vasnprintf: unistdio.h. (line 158) +* u32_vasprintf: unistdio.h. (line 156) +* u32_vsnprintf: unistdio.h. (line 154) +* u32_vsprintf: unistdio.h. (line 152) +* u32_width: uniwidth.h. (line 31) +* u32_width_linebreaks: unilbrk.h. (line 65) * u32_wordbreaks: Word breaks in a string. - (line 11) -* u8_asnprintf: unistdio.h. (line 79) -* u8_asprintf: unistdio.h. (line 76) + (line 10) +* u8_asnprintf: unistdio.h. (line 72) +* u8_asprintf: unistdio.h. (line 70) * u8_casecmp: Case insensitive comparison. - (line 48) + (line 45) * u8_casecoll: Case insensitive comparison. - (line 92) + (line 88) * u8_casefold: Case insensitive comparison. - (line 12) + (line 9) * u8_casexfrm: Case insensitive comparison. - (line 72) -* u8_casing_prefix_context: Case mappings of substrings. - (line 28) + (line 68) * u8_casing_prefixes_context: Case mappings of substrings. - (line 36) -* u8_casing_suffix_context: Case mappings of substrings. - (line 59) + (line 34) +* u8_casing_prefix_context: Case mappings of substrings. + (line 26) * u8_casing_suffixes_context: Case mappings of substrings. - (line 67) + (line 63) +* u8_casing_suffix_context: Case mappings of substrings. + (line 55) * u8_check: Elementary string checks. - (line 10) + (line 9) * u8_chr: Elementary string functions. - (line 143) + (line 142) * u8_cmp: Elementary string functions. - (line 113) + (line 111) * u8_cmp2: Elementary string functions. - (line 129) -* u8_conv_from_encoding: uniconv.h. (line 51) -* u8_conv_to_encoding: uniconv.h. (line 88) + (line 127) +* u8_conv_from_encoding: uniconv.h. (line 48) +* u8_conv_to_encoding: uniconv.h. (line 85) * u8_cpy: Elementary string functions. - (line 76) + (line 74) * u8_cpy_alloc: Elementary string functions with memory allocation. - (line 9) + (line 8) * u8_ct_casefold: Case insensitive comparison. - (line 32) + (line 27) * u8_ct_tolower: Case mappings of substrings. - (line 102) + (line 93) * u8_ct_totitle: Case mappings of substrings. - (line 120) + (line 111) * u8_ct_toupper: Case mappings of substrings. - (line 84) + (line 75) * u8_endswith: Elementary string functions on NUL terminated strings. - (line 258) -* u8_is_cased: Case detection. (line 55) -* u8_is_casefolded: Case detection. (line 42) -* u8_is_lowercase: Case detection. (line 22) -* u8_is_titlecase: Case detection. (line 32) -* u8_is_uppercase: Case detection. (line 12) + (line 257) +* u8_grapheme_breaks: Grapheme cluster breaks in a string. + (line 32) +* u8_grapheme_next: Grapheme cluster breaks in a string. + (line 9) +* u8_grapheme_prev: Grapheme cluster breaks in a string. + (line 19) +* u8_is_cased: Case detection. (line 53) +* u8_is_casefolded: Case detection. (line 40) +* 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 10) + (line 9) * u8_mbsnlen: Elementary string functions. - (line 156) + (line 155) * u8_mbtouc: Elementary string functions. - (line 37) -* u8_mbtouc_unsafe: Elementary string functions. - (line 21) + (line 36) * u8_mbtoucr: Elementary string functions. - (line 44) + (line 43) +* u8_mbtouc_unsafe: Elementary string functions. + (line 19) * u8_move: Elementary string functions. - (line 87) + (line 85) * u8_next: Elementary string functions on NUL terminated strings. - (line 23) + (line 22) * u8_normalize: Normalization of strings. - (line 48) + (line 46) * u8_normcmp: Normalizing comparisons. - (line 11) + (line 9) * u8_normcoll: Normalizing comparisons. - (line 38) + (line 35) * u8_normxfrm: Normalizing comparisons. - (line 25) -* u8_possible_linebreaks: unilbrk.h. (line 44) + (line 22) +* u8_possible_linebreaks: unilbrk.h. (line 42) * u8_prev: Elementary string functions on NUL terminated strings. - (line 34) + (line 32) * u8_set: Elementary string functions. - (line 100) -* u8_snprintf: unistdio.h. (line 73) -* u8_sprintf: unistdio.h. (line 70) + (line 99) +* u8_snprintf: unistdio.h. (line 68) +* u8_sprintf: unistdio.h. (line 67) * u8_startswith: Elementary string functions on NUL terminated strings. - (line 250) + (line 249) * u8_stpcpy: Elementary string functions on NUL terminated strings. (line 74) * u8_stpncpy: Elementary string functions on NUL terminated strings. - (line 97) + (line 96) * u8_strcat: Elementary string functions on NUL terminated strings. (line 110) * u8_strchr: Elementary string functions on NUL terminated strings. @@ -5724,344 +6000,379 @@ Index (line 133) * u8_strcoll: Elementary string functions on NUL terminated strings. (line 143) -* u8_strconv_from_encoding: uniconv.h. (line 127) -* u8_strconv_from_locale: uniconv.h. (line 156) -* u8_strconv_to_encoding: uniconv.h. (line 140) -* u8_strconv_to_locale: uniconv.h. (line 166) +* 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 201) + (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. - (line 10) + (line 9) * u8_strmbtouc: Elementary string functions on NUL terminated strings. - (line 16) + (line 15) * u8_strncat: Elementary string functions on NUL terminated strings. - (line 121) + (line 120) * u8_strncmp: Elementary string functions on NUL terminated strings. - (line 159) + (line 158) * u8_strncpy: Elementary string functions on NUL terminated strings. - (line 86) + (line 85) * u8_strnlen: Elementary string functions on NUL terminated strings. (line 54) * u8_strpbrk: Elementary string functions on NUL terminated strings. - (line 225) + (line 224) * u8_strrchr: Elementary string functions on NUL terminated strings. (line 189) * u8_strspn: Elementary string functions on NUL terminated strings. - (line 213) + (line 212) * u8_strstr: Elementary string functions on NUL terminated strings. - (line 239) + (line 238) * u8_strtok: Elementary string functions on NUL terminated strings. - (line 268) -* u8_strwidth: uniwidth.h. (line 38) -* u8_to_u16: Elementary string conversions. - (line 11) -* u8_to_u32: Elementary string conversions. - (line 15) + (line 267) +* u8_strwidth: uniwidth.h. (line 37) * u8_tolower: Case mappings of strings. - (line 41) + (line 38) * u8_totitle: Case mappings of strings. - (line 55) + (line 52) * u8_toupper: Case mappings of strings. - (line 27) -* u8_u8_asnprintf: unistdio.h. (line 106) -* u8_u8_asprintf: unistdio.h. (line 103) -* u8_u8_snprintf: unistdio.h. (line 100) -* u8_u8_sprintf: unistdio.h. (line 97) -* u8_u8_vasnprintf: unistdio.h. (line 118) -* u8_u8_vasprintf: unistdio.h. (line 115) -* u8_u8_vsnprintf: unistdio.h. (line 112) -* u8_u8_vsprintf: unistdio.h. (line 109) + (line 24) +* u8_to_u16: Elementary string conversions. + (line 9) +* u8_to_u32: Elementary string conversions. + (line 13) +* u8_u8_asnprintf: unistdio.h. (line 92) +* u8_u8_asprintf: unistdio.h. (line 90) +* u8_u8_snprintf: unistdio.h. (line 88) +* u8_u8_sprintf: unistdio.h. (line 86) +* u8_u8_vasnprintf: unistdio.h. (line 100) +* 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 61) -* u8_vasnprintf: unistdio.h. (line 91) -* u8_vasprintf: unistdio.h. (line 88) -* u8_vsnprintf: unistdio.h. (line 85) -* u8_vsprintf: unistdio.h. (line 82) -* u8_width: uniwidth.h. (line 29) -* u8_width_linebreaks: unilbrk.h. (line 62) + (line 60) +* u8_vasnprintf: unistdio.h. (line 80) +* u8_vasprintf: unistdio.h. (line 78) +* u8_vsnprintf: unistdio.h. (line 76) +* u8_vsprintf: unistdio.h. (line 74) +* u8_width: uniwidth.h. (line 27) +* u8_width_linebreaks: unilbrk.h. (line 59) * u8_wordbreaks: Word breaks in a string. - (line 9) -* uc_all_blocks: Blocks. (line 38) -* uc_all_scripts: Scripts. (line 37) -* uc_bidi_category: Bidirectional category. - (line 88) -* uc_bidi_category_byname: Bidirectional category. - (line 82) -* uc_bidi_category_name: Bidirectional category. - (line 79) -* uc_block: Blocks. (line 27) -* uc_block_t: Blocks. (line 12) -* uc_c_ident_category: ISO C and Java syntax. - (line 39) + (line 8) +* UCS-4: Unicode. (line 14) +* ucs4_t: unitypes.h. (line 15) +* uc_all_blocks: Blocks. (line 36) +* uc_all_scripts: Scripts. (line 35) +* uc_bidi_category: Bidi class. (line 93) +* uc_bidi_category_byname: Bidi class. (line 83) +* uc_bidi_category_name: Bidi class. (line 75) +* uc_bidi_class: Bidi class. (line 92) +* uc_bidi_class_byname: Bidi class. (line 82) +* uc_bidi_class_long_name: Bidi class. (line 79) +* uc_bidi_class_name: Bidi class. (line 74) +* uc_block: Blocks. (line 26) +* uc_block_t: Blocks. (line 11) * uc_canonical_decomposition: Decomposition of characters. - (line 92) + (line 90) * uc_combining_class: Canonical combining class. - (line 89) + (line 110) +* uc_combining_class_byname: Canonical combining class. + (line 101) +* uc_combining_class_long_name: Canonical combining class. + (line 97) +* uc_combining_class_name: Canonical combining class. + (line 92) * uc_composition: Composition of characters. - (line 10) -* uc_decimal_value: Decimal digit value. (line 11) + (line 9) +* uc_c_ident_category: ISO C and Java syntax. + (line 38) +* uc_decimal_value: Decimal digit value. (line 10) * uc_decomposition: Decomposition of characters. - (line 82) -* uc_digit_value: Digit value. (line 11) -* uc_fraction_t: Numeric value. (line 14) -* uc_general_category: Object oriented API. (line 207) -* uc_general_category_and: Object oriented API. (line 179) -* uc_general_category_and_not: Object oriented API. (line 186) -* uc_general_category_byname: Object oriented API. (line 201) -* uc_general_category_name: Object oriented API. (line 195) -* uc_general_category_or: Object oriented API. (line 173) -* uc_general_category_t: Object oriented API. (line 7) + (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_t: Object oriented API. (line 6) +* uc_graphemeclusterbreak_property: Grapheme cluster break property. + (line 31) * uc_is_alnum: Classifications like in ISO C. - (line 14) + (line 13) * uc_is_alpha: Classifications like in ISO C. - (line 18) -* uc_is_bidi_category: Bidirectional category. - (line 91) + (line 17) +* uc_is_bidi_category: Bidi class. (line 97) +* uc_is_bidi_class: Bidi class. (line 96) * uc_is_blank: Classifications like in ISO C. - (line 64) -* uc_is_block: Blocks. (line 32) -* uc_is_c_whitespace: ISO C and Java syntax. - (line 10) + (line 63) +* uc_is_block: Blocks. (line 31) * uc_is_cntrl: Classifications like in ISO C. - (line 24) + (line 23) +* uc_is_c_whitespace: ISO C and Java syntax. + (line 9) * uc_is_digit: Classifications like in ISO C. - (line 27) -* uc_is_general_category: Object oriented API. (line 213) -* uc_is_general_category_withtable: Bit mask API. (line 52) + (line 26) +* uc_is_general_category: Object oriented API. (line 224) +* uc_is_general_category_withtable: Bit mask API. (line 51) * uc_is_graph: Classifications like in ISO C. - (line 31) + (line 30) +* uc_is_grapheme_break: Grapheme cluster break property. + (line 38) * uc_is_java_whitespace: ISO C and Java syntax. - (line 14) + (line 13) * uc_is_lower: Classifications like in ISO C. - (line 35) + (line 34) * uc_is_print: Classifications like in ISO C. - (line 41) + (line 40) * uc_is_property: Properties as objects. - (line 140) + (line 150) * uc_is_property_alphabetic: Properties as functions. - (line 10) + (line 9) * uc_is_property_ascii_hex_digit: Properties as functions. - (line 74) + (line 80) * uc_is_property_bidi_arabic_digit: Properties as functions. - (line 60) + (line 66) * uc_is_property_bidi_arabic_right_to_left: Properties as functions. - (line 56) -* uc_is_property_bidi_block_separator: Properties as functions. (line 62) +* uc_is_property_bidi_block_separator: Properties as functions. + (line 68) * uc_is_property_bidi_boundary_neutral: Properties as functions. - (line 66) + (line 72) * uc_is_property_bidi_common_separator: Properties as functions. - (line 61) + (line 67) * uc_is_property_bidi_control: Properties as functions. - (line 53) + (line 59) * uc_is_property_bidi_embedding_or_override: Properties as functions. - (line 68) + (line 74) +* uc_is_property_bidi_european_digit: Properties as functions. + (line 63) * uc_is_property_bidi_eur_num_separator: Properties as functions. - (line 58) + (line 64) * uc_is_property_bidi_eur_num_terminator: Properties as functions. - (line 59) -* uc_is_property_bidi_european_digit: Properties as functions. - (line 57) + (line 65) * uc_is_property_bidi_hebrew_right_to_left: Properties as functions. - (line 55) + (line 61) * uc_is_property_bidi_left_to_right: Properties as functions. - (line 54) + (line 60) * uc_is_property_bidi_non_spacing_mark: Properties as functions. - (line 65) + (line 71) * uc_is_property_bidi_other_neutral: Properties as functions. - (line 69) + (line 75) * uc_is_property_bidi_pdf: Properties as functions. - (line 67) + (line 73) * uc_is_property_bidi_segment_separator: Properties as functions. - (line 63) + (line 69) * uc_is_property_bidi_whitespace: Properties as functions. - (line 64) + (line 70) +* uc_is_property_cased: Properties as functions. + (line 29) +* uc_is_property_case_ignorable: Properties as functions. + (line 30) +* uc_is_property_changes_when_casefolded: Properties as functions. + (line 34) +* uc_is_property_changes_when_casemapped: Properties as functions. + (line 35) +* uc_is_property_changes_when_lowercased: Properties as functions. + (line 31) +* uc_is_property_changes_when_titlecased: Properties as functions. + (line 33) +* uc_is_property_changes_when_uppercased: Properties as functions. + (line 32) * uc_is_property_combining: Properties as functions. - (line 104) + (line 110) * uc_is_property_composite: Properties as functions. - (line 105) + (line 111) * uc_is_property_currency_symbol: Properties as functions. - (line 99) + (line 105) * uc_is_property_dash: Properties as functions. - (line 91) + (line 97) * uc_is_property_decimal_digit: Properties as functions. - (line 106) + (line 112) * uc_is_property_default_ignorable_code_point: Properties as functions. - (line 14) + (line 12) * uc_is_property_deprecated: Properties as functions. - (line 17) + (line 16) * uc_is_property_diacritic: Properties as functions. - (line 108) + (line 114) * uc_is_property_extender: Properties as functions. - (line 109) + (line 115) * uc_is_property_format_control: Properties as functions. - (line 90) + (line 96) * uc_is_property_grapheme_base: Properties as functions. - (line 46) + (line 52) * uc_is_property_grapheme_extend: Properties as functions. - (line 47) + (line 53) * uc_is_property_grapheme_link: Properties as functions. - (line 49) + (line 55) * uc_is_property_hex_digit: Properties as functions. - (line 73) + (line 79) * uc_is_property_hyphen: Properties as functions. - (line 92) -* uc_is_property_id_continue: Properties as functions. - (line 36) -* uc_is_property_id_start: Properties as functions. - (line 34) + (line 98) * uc_is_property_ideographic: Properties as functions. - (line 78) + (line 84) * uc_is_property_ids_binary_operator: Properties as functions. - (line 81) + (line 87) * uc_is_property_ids_trinary_operator: Properties as functions. - (line 82) + (line 88) +* uc_is_property_id_continue: Properties as functions. + (line 42) +* uc_is_property_id_start: Properties as functions. + (line 40) * uc_is_property_ignorable_control: Properties as functions. - (line 110) + (line 116) * uc_is_property_iso_control: Properties as functions. - (line 89) + (line 95) * uc_is_property_join_control: Properties as functions. - (line 45) + (line 51) * uc_is_property_left_of_pair: Properties as functions. - (line 103) + (line 109) * uc_is_property_line_separator: Properties as functions. - (line 94) + (line 100) * uc_is_property_logical_order_exception: Properties as functions. - (line 18) + (line 17) * uc_is_property_lowercase: Properties as functions. - (line 27) + (line 26) * uc_is_property_math: Properties as functions. - (line 100) + (line 106) * uc_is_property_non_break: Properties as functions. - (line 88) + (line 94) * uc_is_property_not_a_character: Properties as functions. - (line 12) + (line 11) * uc_is_property_numeric: Properties as functions. - (line 107) + (line 113) * uc_is_property_other_alphabetic: Properties as functions. - (line 11) + (line 10) * uc_is_property_other_default_ignorable_code_point: Properties as functions. - (line 16) + (line 14) * uc_is_property_other_grapheme_extend: Properties as functions. - (line 48) + (line 54) * uc_is_property_other_id_continue: Properties as functions. - (line 37) + (line 43) * uc_is_property_other_id_start: Properties as functions. - (line 35) + (line 41) * uc_is_property_other_lowercase: Properties as functions. - (line 28) + (line 27) * uc_is_property_other_math: Properties as functions. - (line 101) + (line 107) * uc_is_property_other_uppercase: Properties as functions. - (line 26) + (line 25) * uc_is_property_paired_punctuation: Properties as functions. - (line 102) + (line 108) * uc_is_property_paragraph_separator: Properties as functions. - (line 95) + (line 101) * uc_is_property_pattern_syntax: Properties as functions. - (line 41) + (line 47) * uc_is_property_pattern_white_space: Properties as functions. - (line 40) + (line 46) * uc_is_property_private_use: Properties as functions. - (line 20) + (line 19) * uc_is_property_punctuation: Properties as functions. - (line 93) + (line 99) * uc_is_property_quotation_mark: Properties as functions. - (line 96) + (line 102) * uc_is_property_radical: Properties as functions. - (line 80) + (line 86) * uc_is_property_sentence_terminal: Properties as functions. - (line 97) + (line 103) * uc_is_property_soft_dotted: Properties as functions. - (line 30) + (line 36) * uc_is_property_space: Properties as functions. - (line 87) + (line 93) * uc_is_property_terminal_punctuation: Properties as functions. - (line 98) + (line 104) * uc_is_property_titlecase: Properties as functions. - (line 29) + (line 28) * uc_is_property_unassigned_code_value: Properties as functions. - (line 21) + (line 20) * uc_is_property_unified_ideograph: Properties as functions. - (line 79) + (line 85) * uc_is_property_uppercase: Properties as functions. - (line 25) + (line 24) * uc_is_property_variation_selector: Properties as functions. - (line 19) + (line 18) * uc_is_property_white_space: Properties as functions. - (line 9) + (line 8) * uc_is_property_xid_continue: Properties as functions. - (line 39) + (line 45) * uc_is_property_xid_start: Properties as functions. - (line 38) + (line 44) * uc_is_property_zero_width: Properties as functions. - (line 86) + (line 92) * uc_is_punct: Classifications like in ISO C. - (line 44) -* uc_is_script: Scripts. (line 31) + (line 43) +* uc_is_script: Scripts. (line 30) * uc_is_space: Classifications like in ISO C. - (line 49) + (line 48) * uc_is_upper: Classifications like in ISO C. - (line 54) + (line 53) * uc_is_xdigit: Classifications like in ISO C. - (line 60) + (line 59) * uc_java_ident_category: ISO C and Java syntax. - (line 43) + (line 42) +* uc_joining_group: Joining group. (line 85) +* uc_joining_group_byname: Joining group. (line 76) +* uc_joining_group_name: Joining group. (line 73) +* uc_joining_type: Joining type. (line 54) +* uc_joining_type_byname: Joining type. (line 45) +* uc_joining_type_long_name: Joining type. (line 42) +* uc_joining_type_name: Joining type. (line 39) * uc_locale_language: Case mappings of strings. - (line 21) -* uc_mirror_char: Mirrored character. (line 14) -* uc_numeric_value: Numeric value. (line 23) + (line 20) +* uc_mirror_char: Mirrored character. (line 13) +* uc_numeric_value: Numeric value. (line 21) * uc_property_byname: Properties as objects. - (line 123) + (line 128) * uc_property_is_valid: Properties as objects. - (line 133) + (line 143) * uc_property_t: Properties as objects. - (line 9) -* uc_script: Scripts. (line 20) -* uc_script_byname: Scripts. (line 25) -* uc_script_t: Scripts. (line 11) + (line 8) +* uc_script: Scripts. (line 19) +* uc_script_byname: Scripts. (line 23) +* uc_script_t: Scripts. (line 10) * uc_tolower: Case mappings of characters. - (line 20) + (line 19) * uc_totitle: Case mappings of characters. - (line 23) + (line 22) * uc_toupper: Case mappings of characters. - (line 17) -* uc_width: uniwidth.h. (line 23) -* uc_wordbreak_property: Word break property. (line 32) -* UCS-4: Unicode. (line 14) -* ucs4_t: unitypes.h. (line 16) -* uint16_t: unitypes.h. (line 10) -* uint32_t: unitypes.h. (line 11) -* uint8_t: unitypes.h. (line 9) -* ulc_asnprintf: unistdio.h. (line 53) -* ulc_asprintf: unistdio.h. (line 50) + (line 16) +* uc_width: uniwidth.h. (line 22) +* uc_wordbreak_property: Word break property. (line 31) +* uint16_t: unitypes.h. (line 9) +* uint32_t: unitypes.h. (line 10) +* uint8_t: unitypes.h. (line 8) +* ulc_asnprintf: unistdio.h. (line 49) +* ulc_asprintf: unistdio.h. (line 47) * ulc_casecmp: Case insensitive comparison. - (line 57) + (line 54) * ulc_casecoll: Case insensitive comparison. - (line 101) + (line 97) * ulc_casexfrm: Case insensitive comparison. - (line 81) -* ulc_fprintf: unistdio.h. (line 229) -* ulc_possible_linebreaks: unilbrk.h. (line 50) -* ulc_snprintf: unistdio.h. (line 48) -* ulc_sprintf: unistdio.h. (line 45) -* ulc_vasnprintf: unistdio.h. (line 65) -* ulc_vasprintf: unistdio.h. (line 62) -* ulc_vfprintf: unistdio.h. (line 232) -* ulc_vsnprintf: unistdio.h. (line 59) -* ulc_vsprintf: unistdio.h. (line 56) -* ulc_width_linebreaks: unilbrk.h. (line 71) + (line 77) +* ulc_fprintf: unistdio.h. (line 184) +* ulc_grapheme_breaks: Grapheme cluster breaks in a string. + (line 38) +* ulc_possible_linebreaks: unilbrk.h. (line 48) +* ulc_snprintf: unistdio.h. (line 44) +* ulc_sprintf: unistdio.h. (line 42) +* ulc_vasnprintf: unistdio.h. (line 61) +* ulc_vasprintf: unistdio.h. (line 58) +* ulc_vfprintf: unistdio.h. (line 185) +* ulc_vsnprintf: unistdio.h. (line 55) +* ulc_vsprintf: unistdio.h. (line 52) +* ulc_width_linebreaks: unilbrk.h. (line 68) * ulc_wordbreaks: Word breaks in a string. - (line 12) + (line 11) * Unicode: Unicode. (line 6) -* Unicode character, bidirectional category: Bidirectional category. - (line 6) +* Unicode character, bidi class: Bidi class. (line 6) +* Unicode character, bidirectional category: Bidi class. (line 6) * Unicode character, block: Blocks. (line 24) * Unicode character, canonical combining class: Canonical combining class. (line 6) @@ -6079,31 +6390,31 @@ Index (line 38) * Unicode character, validity in Java identifiers: ISO C and Java syntax. (line 42) -* Unicode character, value <1>: Numeric value. (line 6) -* Unicode character, value <2>: Digit value. (line 6) * Unicode character, value: Decimal digit value. (line 6) +* Unicode character, value <1>: Digit value. (line 6) +* Unicode character, value <2>: Numeric value. (line 6) * Unicode character, width: uniwidth.h. (line 22) -* unicode_character_name: uniname.h. (line 19) -* unicode_name_character: uniname.h. (line 25) +* unicode_character_name: uniname.h. (line 18) +* unicode_name_character: uniname.h. (line 24) * uninorm_decomposing_form: Normalization of strings. - (line 40) + (line 39) * uninorm_filter_create: Normalization of streams. - (line 19) + (line 16) * uninorm_filter_flush: Normalization of streams. - (line 33) + (line 32) * uninorm_filter_free: Normalization of streams. - (line 43) + (line 42) * uninorm_filter_write: Normalization of streams. - (line 29) + (line 27) * uninorm_is_compat_decomposing: Normalization of strings. - (line 32) + (line 31) * uninorm_is_composing: Normalization of strings. - (line 36) + (line 35) * uninorm_t: Normalization of strings. - (line 10) + (line 9) * uppercasing: Case mappings of strings. (line 6) -* use cases: Introduction. (line 44) +* use cases: Introduction. (line 36) * UTF-16: Unicode. (line 14) * UTF-16, strings: Unicode strings. (line 6) * UTF-32: Unicode. (line 14) @@ -6112,87 +6423,96 @@ Index * UTF-8, strings: Unicode strings. (line 6) * validity: Elementary string checks. (line 6) -* value, of libunistring: Introduction. (line 44) -* value, of Unicode character <1>: Numeric value. (line 6) -* value, of Unicode character <2>: Digit value. (line 6) +* value, of libunistring: Introduction. (line 36) * value, of Unicode character: Decimal digit value. (line 6) +* value, of Unicode character <1>: Digit value. (line 6) +* value, of Unicode character <2>: Numeric value. (line 6) * verification: Elementary string checks. (line 6) * wchar_t, type: The wchar_t mess. (line 6) +* well-formed: Elementary string checks. + (line 6) * width: uniwidth.h. (line 6) +* word boundaries: uniwbrk.h. (line 6) * word breaks: uniwbrk.h. (line 6) * wrapping: unilbrk.h. (line 6) Tag Table: -Node: Top270 -Node: Introduction3239 -Node: Unicode5236 -Node: Unicode and i18n7116 -Node: Locale encodings8579 -Node: In-memory representation10787 -Node: char * strings11896 -Node: The wchar_t mess17153 -Node: Unicode strings19357 -Node: Conventions20508 -Node: unitypes.h22708 -Node: unistr.h23280 -Node: Elementary string checks23837 -Node: Elementary string conversions24459 -Node: Elementary string functions25761 -Node: Elementary string functions with memory allocation32732 -Node: Elementary string functions on NUL terminated strings33354 -Node: uniconv.h45258 -Node: unistdio.h52969 -Node: uniname.h61172 -Node: unictype.h62505 -Node: General category63414 -Node: Object oriented API64457 -Node: Bit mask API72919 -Node: Canonical combining class75173 -Node: Bidirectional category78387 -Node: Decimal digit value81444 -Node: Digit value82005 -Node: Numeric value82566 -Node: Mirrored character83457 -Node: Properties84130 -Node: Properties as objects84821 -Node: Properties as functions91199 -Node: Scripts96750 -Node: Blocks98136 -Node: ISO C and Java syntax99459 -Node: Classifications like in ISO C101169 -Node: uniwidth.h103873 -Node: uniwbrk.h105910 -Node: Word breaks in a string106437 -Node: Word break property107488 -Node: unilbrk.h108584 -Node: uninorm.h112755 -Node: Decomposition of characters113387 -Node: Composition of characters116763 -Node: Normalization of strings117472 -Node: Normalizing comparisons119534 -Node: Normalization of streams121890 -Node: unicase.h123978 -Node: Case mappings of characters124663 -Node: Case mappings of strings126710 -Node: Case mappings of substrings130043 -Node: Case insensitive comparison136973 -Node: Case detection142324 -Node: uniregex.h145592 -Node: Using the library145815 -Node: Installation146226 -Node: Compiler options146699 -Node: Include files148258 -Node: Autoconf macro149482 -Node: Reporting problems151040 -Node: More functionality151837 -Node: Licenses152280 -Node: GNU GPL153915 -Node: GNU LGPL191460 -Node: GNU FDL199906 -Node: Index225031 +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 property120691 +Node: uniwbrk.h122592 +Node: Word breaks in a string123130 +Node: Word break property124222 +Node: unilbrk.h125321 +Node: uninorm.h129617 +Node: Decomposition of characters130254 +Node: Composition of characters133731 +Node: Normalization of strings134444 +Node: Normalizing comparisons136521 +Node: Normalization of streams138923 +Node: unicase.h141048 +Node: Case mappings of characters141737 +Node: Case mappings of strings143886 +Node: Case mappings of substrings147237 +Node: Case insensitive comparison154159 +Node: Case detection159564 +Node: uniregex.h162878 +Node: Using the library163105 +Node: Installation163516 +Node: Compiler options164001 +Node: Include files165641 +Node: Autoconf macro166894 +Node: Reporting problems168534 +Node: More functionality169352 +Node: Licenses169795 +Node: GNU GPL171433 +Node: GNU LGPL209178 +Node: GNU FDL217661 +Node: Index242966 End Tag Table diff --git a/doc/libunistring.texi b/doc/libunistring.texi index 5778c750..a6f9c8fa 100644 --- a/doc/libunistring.texi +++ b/doc/libunistring.texi @@ -158,6 +158,7 @@ A copy of the license is included in @ref{GNU GPL}. * uniname.h:: Names of Unicode characters * unictype.h:: Unicode character classification and properties * uniwidth.h:: Display width +* unigbrk.h:: Grapheme cluster breaking * uniwbrk.h:: Word breaks in strings * unilbrk.h:: Line breaking * uninorm.h:: Normalization forms @@ -194,11 +195,12 @@ unictype.h * General category:: * Canonical combining class:: -* Bidirectional category:: +* Bidi class:: * Decimal digit value:: * Digit value:: * Numeric value:: * Mirrored character:: +* Arabic shaping:: * Properties:: * Scripts:: * Blocks:: @@ -215,6 +217,11 @@ Properties * Properties as objects:: * Properties as functions:: +unigbrk.h + +* Grapheme cluster breaks in a string:: +* Grapheme cluster break property:: + uniwbrk.h * Word breaks in a string:: @@ -274,6 +281,8 @@ character names character classification and properties @item <uniwidth.h> string width when using nonproportional fonts +@item <unigbrk.h> +grapheme cluster breaks @item <uniwbrk.h> word breaks @item <unilbrk.h> @@ -754,6 +763,7 @@ NULL is returned and @code{errno} is set. @include uniname.texi @include unictype.texi @include uniwidth.texi +@include unigbrk.texi @include uniwbrk.texi @include unilbrk.texi @include uninorm.texi diff --git a/doc/libunistring_1.html b/doc/libunistring_1.html index 7212f3f1..9a24161c 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 March, 30 2010 by texi2html 1.78a --> +<!-- Created on July, 8 2015 by texi2html 1.78a --> <!-- Written by: Lionel Cons <Lionel.Cons@cern.ch> (original author) Karl Berry <karl@freefriends.org> @@ -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_18.html#SEC71" title="Index">Index</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_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> @@ -84,6 +84,9 @@ for manipulating C strings according to the Unicode standard. <dt> <code><uniwidth.h></code></dt> <dd><p>string width when using nonproportional fonts </p></dd> +<dt> <code><unigbrk.h></code></dt> +<dd><p>grapheme cluster breaks +</p></dd> <dt> <code><uniwbrk.h></code></dt> <dd><p>word breaks </p></dd> @@ -415,7 +418,7 @@ 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_13.html#SEC48">Case mappings <code><unicase.h></code></a>. +<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> @@ -517,12 +520,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_18.html#SEC71" title="Index">Index</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_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <p> <font size="-1"> - This document was generated by <em>Bruno Haible</em> on <em>March, 30 2010</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>July, 8 2015</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 617406d6..3f4f5dac 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 March, 30 2010 by texi2html 1.78a --> +<!-- Created on July, 8 2015 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: 10. Word breaks in strings <uniwbrk.h></title> +<title>GNU libunistring: 10. Grapheme cluster breaks in strings <unigbrk.h></title> -<meta name="description" content="GNU libunistring: 10. Word breaks in strings <uniwbrk.h>"> -<meta name="keywords" content="GNU libunistring: 10. Word breaks in strings <uniwbrk.h>"> +<meta name="description" content="GNU libunistring: 10. Grapheme cluster breaks in strings <unigbrk.h>"> +<meta name="keywords" content="GNU libunistring: 10. Grapheme cluster breaks in strings <unigbrk.h>"> <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_9.html#SEC37" title="Beginning of this chapter or previous chapter"> << </a>]</td> -<td valign="middle" align="left">[<a href="libunistring_11.html#SEC41" title="Next chapter"> >> </a>]</td> +<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> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> @@ -51,126 +51,194 @@ 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_18.html#SEC71" title="Index">Index</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_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <hr size="2"> -<a name="uniwbrk_002eh"></a> -<a name="SEC38"></a> -<h1 class="chapter"> <a href="libunistring.html#TOC38">10. Word breaks in strings <code><uniwbrk.h></code></a> </h1> +<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> <p>This include file declares functions for determining where in a string -“words” start and end. Here “words” are not necessarily the same as -entities that can be looked up in dictionaries, but rather groups of -consecutive characters that should not be split by text processing -operations. +“grapheme clusters” start and end. A “grapheme cluster” is an +approximation to a user-perceived character, which sometimes +corresponds to multiple Unicode characters. Editing operations such as +mouse selection, cursor movement, and backspacing often operate on +grapheme clusters as units, not on individual characters. +</p> +<p>Some grapheme clusters are built from a base character and a combining +character. The letter ‘<samp>é</samp>’, +for example, is most commonly represented in Unicode as a single +character U+00E8 <small>LATIN SMALL LETTER E WITH ACUTE</small>. It is, +however, equally valid to use the pair of characters U+0065 <small>LATIN +SMALL LETTER E</small> followed by U+0301 <small>COMBINING ACUTE ACCENT</small>. Since +the user would perceive this pair of characters as a single character, +they would be grouped into a single grapheme cluster. +</p> +<p>But there are also grapheme clusters that consist of several base characters. +For example, a Devanagari letter and a Devanagari vowel sign that follows it +may form a grapheme cluster. Similarly, some pairs of Thai characters and +Hangul syllables (formed by two or three Hangul characters) are grapheme +clusters. </p> <hr size="6"> -<a name="Word-breaks-in-a-string"></a> -<a name="SEC39"></a> -<h2 class="section"> <a href="libunistring.html#TOC39">10.1 Word breaks in a string</a> </h2> +<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> + +<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> +</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> +</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> +</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. +Returns NULL if and only if <code><var>s</var> == <var>end</var></code>. +</p></dd></dl> + +<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> +</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> +</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> +</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. +Returns NULL if and only if <code><var>s</var> == <var>start</var></code>. +</p></dd></dl> -<p>The following functions determine the word breaks in a string. +<p>The following functions determine all of the grapheme cluster +boundaries 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="IDX615"></a> +<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> </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="IDX616"></a> +<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> </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="IDX617"></a> +<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> </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="IDX618"></a> +<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> </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>. +<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>n</var>-1]</code>. </p><dl compact="compact"> <dt> <code><var>p</var>[i] = 1</code></dt> -<dd><p>means that there is a word boundary between <code><var>s</var>[i-1]</code> and -<code><var>s</var>[i]</code>. +<dd><p>means that there is a grapheme cluster boundary between +<code><var>s</var>[i-1]</code> and <code><var>s</var>[i]</code>. </p></dd> <dt> <code><var>p</var>[i] = 0</code></dt> -<dd><p>means that <code><var>s</var>[i-1]</code> and <code><var>s</var>[i]</code> must not be separated. +<dd><p>means that <code><var>s</var>[i-1]</code> and <code><var>s</var>[i]</code> are part of the +same grapheme cluster. </p></dd> </dl> -<p><code><var>p</var>[0]</code> is always set to 0. If an application wants to consider a -word break to be present at the beginning of the string (before -<code><var>s</var>[0]</code>) or at the end of the string (after -<code><var>s</var>[0..<var>n</var>-1]</code>), it has to treat these cases explicitly. +<p><code><var>p</var>[0]</code> is always set to 1, because there is always a +grapheme cluster break at start of text. </p></dd></dl> <hr size="6"> -<a name="Word-break-property"></a> -<a name="SEC40"></a> -<h2 class="section"> <a href="libunistring.html#TOC40">10.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 -<a href="http://www.unicode.org/reports/tr29/#Word_Boundaries">http://www.unicode.org/reports/tr29/#Word_Boundaries</a>. It is -used for determining the word breaks in a string. +<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> + +<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 +Boundaries”, see +<a href="http://www.unicode.org/reports/tr29/#Grapheme_Cluster_Boundaries">http://www.unicode.org/reports/tr29/#Grapheme_Cluster_Boundaries</a>. +It is used for determining the grapheme cluster breaks in a string. </p> -<p>The following are the possible values of the word break property. More values -may be added in the future. +<p>The following are the possible values of the grapheme cluster break +property. More values may be added in the future. </p> <dl> -<dt><u>Constant:</u> int <b>WBP_OTHER</b> -<a name="IDX619"></a> -</dt> -<dt><u>Constant:</u> int <b>WBP_CR</b> -<a name="IDX620"></a> +<dt><u>Constant:</u> int <b>GBP_OTHER</b> +<a name="IDX722"></a> </dt> -<dt><u>Constant:</u> int <b>WBP_LF</b> -<a name="IDX621"></a> +<dt><u>Constant:</u> int <b>GBP_CR</b> +<a name="IDX723"></a> </dt> -<dt><u>Constant:</u> int <b>WBP_NEWLINE</b> -<a name="IDX622"></a> +<dt><u>Constant:</u> int <b>GBP_LF</b> +<a name="IDX724"></a> </dt> -<dt><u>Constant:</u> int <b>WBP_EXTEND</b> -<a name="IDX623"></a> +<dt><u>Constant:</u> int <b>GBP_CONTROL</b> +<a name="IDX725"></a> </dt> -<dt><u>Constant:</u> int <b>WBP_FORMAT</b> -<a name="IDX624"></a> +<dt><u>Constant:</u> int <b>GBP_EXTEND</b> +<a name="IDX726"></a> </dt> -<dt><u>Constant:</u> int <b>WBP_KATAKANA</b> -<a name="IDX625"></a> +<dt><u>Constant:</u> int <b>GBP_PREPEND</b> +<a name="IDX727"></a> </dt> -<dt><u>Constant:</u> int <b>WBP_ALETTER</b> -<a name="IDX626"></a> +<dt><u>Constant:</u> int <b>GBP_SPACINGMARK</b> +<a name="IDX728"></a> </dt> -<dt><u>Constant:</u> int <b>WBP_MIDNUMLET</b> -<a name="IDX627"></a> +<dt><u>Constant:</u> int <b>GBP_L</b> +<a name="IDX729"></a> </dt> -<dt><u>Constant:</u> int <b>WBP_MIDLETTER</b> -<a name="IDX628"></a> +<dt><u>Constant:</u> int <b>GBP_V</b> +<a name="IDX730"></a> </dt> -<dt><u>Constant:</u> int <b>WBP_MIDNUM</b> -<a name="IDX629"></a> +<dt><u>Constant:</u> int <b>GBP_T</b> +<a name="IDX731"></a> </dt> -<dt><u>Constant:</u> int <b>WBP_NUMERIC</b> -<a name="IDX630"></a> +<dt><u>Constant:</u> int <b>GBP_LV</b> +<a name="IDX732"></a> </dt> -<dt><u>Constant:</u> int <b>WBP_EXTENDNUMLET</b> -<a name="IDX631"></a> +<dt><u>Constant:</u> int <b>GBP_LVT</b> +<a name="IDX733"></a> </dt> </dl> -<p>The following function looks up the word break property of a character. +<p>The following function looks up the grapheme cluster break property of a +character. +</p> +<dl> +<dt><u>Function:</u> int <b>uc_graphemeclusterbreak_property</b><i> (ucs4_t <var>uc</var>)</i> +<a name="IDX734"></a> +</dt> +<dd><p>Returns the Grapheme_Cluster_Break property of a Unicode character. +</p></dd></dl> + +<p>The following function determines whether there is a grapheme cluster +break between two Unicode characters. It is the primitive upon which +the higher-level functions in the previous section are directly based. </p> <dl> -<dt><u>Function:</u> int <b>uc_wordbreak_property</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX632"></a> +<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="IDX735"></a> </dt> -<dd><p>Returns the Word_Break property of a Unicode character. +<dd><p>Returns true if there is an grapheme cluster boundary between Unicode +characters <var>a</var> and <var>b</var>. +</p> +<p>There is always a grapheme cluster break at the start or end of text. +You can specify zero for <var>a</var> or <var>b</var> to indicate start of text or end +of text, respectively. +</p> +<p>This implements the extended (not legacy) grapheme cluster rules +described in the Unicode standard, because the standard says that they +are preferred. </p></dd></dl> <hr size="6"> <table cellpadding="1" cellspacing="1" border="0"> -<tr><td valign="middle" align="left">[<a href="#SEC38" title="Beginning of this chapter or previous chapter"> << </a>]</td> -<td valign="middle" align="left">[<a href="libunistring_11.html#SEC41" title="Next chapter"> >> </a>]</td> +<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> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> @@ -178,12 +246,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_18.html#SEC71" title="Index">Index</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_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <p> <font size="-1"> - This document was generated by <em>Bruno Haible</em> on <em>March, 30 2010</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>July, 8 2015</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 7fd2dc3a..1e95b7ad 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 March, 30 2010 by texi2html 1.78a --> +<!-- Created on July, 8 2015 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: 11. Line breaking <unilbrk.h></title> +<title>GNU libunistring: 11. Word breaks in strings <uniwbrk.h></title> -<meta name="description" content="GNU libunistring: 11. Line breaking <unilbrk.h>"> -<meta name="keywords" content="GNU libunistring: 11. Line breaking <unilbrk.h>"> +<meta name="description" content="GNU libunistring: 11. Word breaks in strings <uniwbrk.h>"> +<meta name="keywords" content="GNU libunistring: 11. Word breaks in strings <uniwbrk.h>"> <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_10.html#SEC38" title="Beginning of this chapter or previous chapter"> << </a>]</td> -<td valign="middle" align="left">[<a href="libunistring_12.html#SEC42" title="Next chapter"> >> </a>]</td> +<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> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> @@ -51,134 +51,126 @@ 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_18.html#SEC71" title="Index">Index</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_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <hr size="2"> -<a name="unilbrk_002eh"></a> -<a name="SEC41"></a> -<h1 class="chapter"> <a href="libunistring.html#TOC41">11. Line breaking <code><unilbrk.h></code></a> </h1> +<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> <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 -string fit into a column of given width. +“words” start and end. Here “words” are not necessarily the same as +entities that can be looked up in dictionaries, but rather groups of +consecutive characters that should not be split by text processing +operations. </p> -<p>These functions are locale dependent. The <var>encoding</var> argument identifies -the encoding (e.g. <code>"ISO-8859-2"</code> for Polish). -</p> -<p>The following enumerated values indicate whether, at a given position, a line -break is possible or not. Given an string <var>s</var> as an array -<code><var>s</var>[0..<var>n</var>-1]</code> and a position <var>i</var>, the values have the -following meanings: + +<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> + +<p>The following functions determine the word breaks in a string. </p> <dl> -<dt><u>Constant:</u> int <b>UC_BREAK_MANDATORY</b> -<a name="IDX633"></a> +<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="IDX736"></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="IDX634"></a> +<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="IDX737"></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>. -</p></dd></dl> - -<dl> -<dt><u>Constant:</u> int <b>UC_BREAK_HYPHENATION</b> -<a name="IDX635"></a> +<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="IDX738"></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 -dependent hyphenation rules. -</p></dd></dl> - -<dl> -<dt><u>Constant:</u> int <b>UC_BREAK_PROHIBITED</b> -<a name="IDX636"></a> +<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="IDX739"></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. +<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>. +</p><dl compact="compact"> +<dt> <code><var>p</var>[i] = 1</code></dt> +<dd><p>means that there is a word boundary between <code><var>s</var>[i-1]</code> and +<code><var>s</var>[i]</code>. +</p></dd> +<dt> <code><var>p</var>[i] = 0</code></dt> +<dd><p>means that <code><var>s</var>[i-1]</code> and <code><var>s</var>[i]</code> must not be separated. +</p></dd> +</dl> +<p><code><var>p</var>[0]</code> is always set to 0. If an application wants to consider a +word break to be present at the beginning of the string (before +<code><var>s</var>[0]</code>) or at the end of the string (after +<code><var>s</var>[0..<var>n</var>-1]</code>), it has to treat these cases explicitly. </p></dd></dl> -<dl> -<dt><u>Constant:</u> int <b>UC_BREAK_UNDEFINED</b> -<a name="IDX637"></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 -override. -</p></dd></dl> +<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> -<p>The following functions determine the positions at which line breaks are -possible. +<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 +<a href="http://www.unicode.org/reports/tr29/#Word_Boundaries">http://www.unicode.org/reports/tr29/#Word_Boundaries</a>. It is +used for determining the word breaks in a string. +</p> +<p>The following are the possible values of the word break property. More values +may be added in the future. </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="IDX638"></a> +<dt><u>Constant:</u> int <b>WBP_OTHER</b> +<a name="IDX740"></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="IDX639"></a> +<dt><u>Constant:</u> int <b>WBP_CR</b> +<a name="IDX741"></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="IDX640"></a> +<dt><u>Constant:</u> int <b>WBP_LF</b> +<a name="IDX742"></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="IDX641"></a> +<dt><u>Constant:</u> int <b>WBP_NEWLINE</b> +<a name="IDX743"></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 -the values <code>UC_BREAK_MANDATORY</code>, <code>UC_BREAK_POSSIBLE</code>, -<code>UC_BREAK_HYPHENATION</code>, <code>UC_BREAK_PROHIBITED</code>. -</p></dd></dl> - -<p>The following functions determine where line breaks should be inserted so that -each line fits in a given width, when output to a device that uses -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="IDX642"></a> +<dt><u>Constant:</u> int <b>WBP_EXTEND</b> +<a name="IDX744"></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="IDX643"></a> +<dt><u>Constant:</u> int <b>WBP_FORMAT</b> +<a name="IDX745"></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="IDX644"></a> +<dt><u>Constant:</u> int <b>WBP_KATAKANA</b> +<a name="IDX746"></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="IDX645"></a> +<dt><u>Constant:</u> int <b>WBP_ALETTER</b> +<a name="IDX747"></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#SEC37">Display width <code><uniwidth.h></code></a>). -</p> -<p>The string is <code><var>s</var>[0..<var>n</var>-1]</code>. -</p> -<p>The maximum number of columns per line is given as <var>width</var>. -The starting column of the string is given as <var>start_column</var>. -If the algorithm shall keep room after the last piece, this amount of room can -be given as <var>at_end_columns</var>. -</p> -<p><var>override</var> is an optional override; if -<code><var>override</var>[<var>i</var>] != UC_BREAK_UNDEFINED</code>, -<code><var>override</var>[<var>i</var>]</code> takes precedence over <code><var>p</var>[<var>i</var>]</code> -as returned by the <code>u*_possible_linebreaks</code> function. -</p> -<p>The given <var>encoding</var> is used for disambiguating widths in <code>uc_width</code>. +<dt><u>Constant:</u> int <b>WBP_MIDNUMLET</b> +<a name="IDX748"></a> +</dt> +<dt><u>Constant:</u> int <b>WBP_MIDLETTER</b> +<a name="IDX749"></a> +</dt> +<dt><u>Constant:</u> int <b>WBP_MIDNUM</b> +<a name="IDX750"></a> +</dt> +<dt><u>Constant:</u> int <b>WBP_NUMERIC</b> +<a name="IDX751"></a> +</dt> +<dt><u>Constant:</u> int <b>WBP_EXTENDNUMLET</b> +<a name="IDX752"></a> +</dt> +</dl> + +<p>The following function looks up the word break property of a character. </p> -<p>Returns the column after the end of the string, 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 -the values <code>UC_BREAK_MANDATORY</code>, <code>UC_BREAK_POSSIBLE</code>, -<code>UC_BREAK_HYPHENATION</code>, <code>UC_BREAK_PROHIBITED</code>. Here the value -<code>UC_BREAK_POSSIBLE</code> indicates that a line break <em>should</em> be inserted. +<dl> +<dt><u>Function:</u> int <b>uc_wordbreak_property</b><i> (ucs4_t <var>uc</var>)</i> +<a name="IDX753"></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="libunistring_10.html#SEC38" title="Beginning of this chapter or previous chapter"> << </a>]</td> -<td valign="middle" align="left">[<a href="libunistring_12.html#SEC42" title="Next chapter"> >> </a>]</td> +<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> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> @@ -186,12 +178,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_18.html#SEC71" title="Index">Index</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_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <p> <font size="-1"> - This document was generated by <em>Bruno Haible</em> on <em>March, 30 2010</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>July, 8 2015</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 1a4db370..f4bee9d3 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 March, 30 2010 by texi2html 1.78a --> +<!-- Created on July, 8 2015 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: 12. Normalization forms (composition and decomposition) <uninorm.h></title> +<title>GNU libunistring: 12. Line breaking <unilbrk.h></title> -<meta name="description" content="GNU libunistring: 12. Normalization forms (composition and decomposition) <uninorm.h>"> -<meta name="keywords" content="GNU libunistring: 12. Normalization forms (composition and decomposition) <uninorm.h>"> +<meta name="description" content="GNU libunistring: 12. Line breaking <unilbrk.h>"> +<meta name="keywords" content="GNU libunistring: 12. Line breaking <unilbrk.h>"> <meta name="resource-type" content="document"> <meta name="distribution" content="global"> <meta name="Generator" content="texi2html 1.78a"> @@ -42,7 +42,7 @@ 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#SEC41" title="Beginning of this chapter or previous chapter"> << </a>]</td> +<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> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> @@ -51,440 +51,133 @@ 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_18.html#SEC71" title="Index">Index</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_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <hr size="2"> -<a name="uninorm_002eh"></a> -<a name="SEC42"></a> -<h1 class="chapter"> <a href="libunistring.html#TOC42">12. 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 -transformations involve decomposition and — for NFC and NFKC — composition -of Unicode characters. -</p> - -<hr size="6"> -<a name="Decomposition-of-characters"></a> -<a name="SEC43"></a> -<h2 class="section"> <a href="libunistring.html#TOC43">12.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="IDX646"></a> -</dt> -<dd><p>Denotes canonical decomposition. -</p></dd></dl> - -<dl> -<dt><u>Constant:</u> int <b>UC_DECOMP_FONT</b> -<a name="IDX647"></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="IDX648"></a> -</dt> -<dd><p>UCD marker: <code><noBreak></code>. -Denotes a no-break version of a space or hyphen. -</p></dd></dl> - -<dl> -<dt><u>Constant:</u> int <b>UC_DECOMP_INITIAL</b> -<a name="IDX649"></a> -</dt> -<dd><p>UCD marker: <code><initial></code>. -Denotes an initial presentation form (Arabic). -</p></dd></dl> - -<dl> -<dt><u>Constant:</u> int <b>UC_DECOMP_MEDIAL</b> -<a name="IDX650"></a> -</dt> -<dd><p>UCD marker: <code><medial></code>. -Denotes a medial presentation form (Arabic). -</p></dd></dl> - -<dl> -<dt><u>Constant:</u> int <b>UC_DECOMP_FINAL</b> -<a name="IDX651"></a> -</dt> -<dd><p>UCD marker: <code><final></code>. -Denotes a final presentation form (Arabic). -</p></dd></dl> - -<dl> -<dt><u>Constant:</u> int <b>UC_DECOMP_ISOLATED</b> -<a name="IDX652"></a> -</dt> -<dd><p>UCD marker: <code><isolated></code>. -Denotes an isolated presentation form (Arabic). -</p></dd></dl> - -<dl> -<dt><u>Constant:</u> int <b>UC_DECOMP_CIRCLE</b> -<a name="IDX653"></a> -</dt> -<dd><p>UCD marker: <code><circle></code>. -Denotes an encircled form. -</p></dd></dl> - -<dl> -<dt><u>Constant:</u> int <b>UC_DECOMP_SUPER</b> -<a name="IDX654"></a> -</dt> -<dd><p>UCD marker: <code><super></code>. -Denotes a superscript form. -</p></dd></dl> - -<dl> -<dt><u>Constant:</u> int <b>UC_DECOMP_SUB</b> -<a name="IDX655"></a> -</dt> -<dd><p>UCD marker: <code><sub></code>. -Denotes a subscript form. -</p></dd></dl> - -<dl> -<dt><u>Constant:</u> int <b>UC_DECOMP_VERTICAL</b> -<a name="IDX656"></a> -</dt> -<dd><p>UCD marker: <code><vertical></code>. -Denotes a vertical layout presentation form. -</p></dd></dl> - -<dl> -<dt><u>Constant:</u> int <b>UC_DECOMP_WIDE</b> -<a name="IDX657"></a> -</dt> -<dd><p>UCD marker: <code><wide></code>. -Denotes a wide (or zenkaku) compatibility character. -</p></dd></dl> - -<dl> -<dt><u>Constant:</u> int <b>UC_DECOMP_NARROW</b> -<a name="IDX658"></a> -</dt> -<dd><p>UCD marker: <code><narrow></code>. -Denotes a narrow (or hankaku) compatibility character. -</p></dd></dl> - -<dl> -<dt><u>Constant:</u> int <b>UC_DECOMP_SMALL</b> -<a name="IDX659"></a> -</dt> -<dd><p>UCD marker: <code><small></code>. -Denotes a small variant form (CNS compatibility). -</p></dd></dl> - -<dl> -<dt><u>Constant:</u> int <b>UC_DECOMP_SQUARE</b> -<a name="IDX660"></a> -</dt> -<dd><p>UCD marker: <code><square></code>. -Denotes a CJK squared font variant. -</p></dd></dl> - -<dl> -<dt><u>Constant:</u> int <b>UC_DECOMP_FRACTION</b> -<a name="IDX661"></a> -</dt> -<dd><p>UCD marker: <code><fraction></code>. -Denotes a vulgar fraction form. -</p></dd></dl> - -<dl> -<dt><u>Constant:</u> int <b>UC_DECOMP_COMPAT</b> -<a name="IDX662"></a> -</dt> -<dd><p>UCD marker: <code><compat></code>. -Denotes an otherwise unspecified compatibility character. -</p></dd></dl> - -<p>The following constant denotes the maximum size of decomposition of a single -Unicode character. -</p> -<dl> -<dt><u>Macro:</u> unsigned int <b>UC_DECOMPOSITION_MAX_LENGTH</b> -<a name="IDX663"></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. -</p></dd></dl> +<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> -<p>The following functions decompose a Unicode character. -</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="IDX664"></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 -<code>UC_DECOMPOSITION_MAX_LENGTH</code> <code>ucs_t</code> elements. +<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 +string fit into a column of given width. </p> -<p>When a decomposition exists, <code><var>decomposition</var>[0..<var>n</var>-1]</code> and -<code>*<var>decomp_tag</var></code> are filled and <var>n</var> is returned. Otherwise -1 is -returned. -</p></dd></dl> - -<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="IDX665"></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 -<code>UC_DECOMPOSITION_MAX_LENGTH</code> <code>ucs_t</code> elements. +<p>These functions are locale dependent. The <var>encoding</var> argument identifies +the encoding (e.g. <code>"ISO-8859-2"</code> for Polish). </p> -<p>When a decomposition exists, <code><var>decomposition</var>[0..<var>n</var>-1]</code> is filled -and <var>n</var> is returned. Otherwise -1 is returned. -</p></dd></dl> - -<hr size="6"> -<a name="Composition-of-characters"></a> -<a name="SEC44"></a> -<h2 class="section"> <a href="libunistring.html#TOC44">12.2 Composition of Unicode characters</a> </h2> - -<p>The following function composes a Unicode character from two Unicode -characters. +<p>The following enumerated values indicate whether, at a given position, a line +break is possible or not. Given an string <var>s</var> as an array +<code><var>s</var>[0..<var>n</var>-1]</code> and a position <var>i</var>, the values have the +following meanings: </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="IDX666"></a> +<dt><u>Constant:</u> int <b>UC_BREAK_MANDATORY</b> +<a name="IDX754"></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. -</p> -<p>Returns the combination of <var>uc1</var> and <var>uc2</var>, if it exists. -Returns 0 otherwise. -</p> -<p>Not all decompositions can be recombined using this function. See the Unicode -file ‘<tt>CompositionExclusions.txt</tt>’ for details. +<dd><p>This value indicates that <code><var>s</var>[<var>i</var>]</code> is a line break character. </p></dd></dl> -<hr size="6"> -<a name="Normalization-of-strings"></a> -<a name="SEC45"></a> -<h2 class="section"> <a href="libunistring.html#TOC45">12.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="IDX667"></a> +<dt><u>Constant:</u> int <b>UC_BREAK_POSSIBLE</b> +<a name="IDX755"></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>. +<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>. </p></dd></dl> -<p>The following constants denote the four normalization forms. -</p> <dl> -<dt><u>Macro:</u> uninorm_t <b>UNINORM_NFD</b> -<a name="IDX668"></a> +<dt><u>Constant:</u> int <b>UC_BREAK_HYPHENATION</b> +<a name="IDX756"></a> </dt> -<dd><p>Denotes Normalization form D: canonical decomposition. +<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 +dependent hyphenation rules. </p></dd></dl> <dl> -<dt><u>Macro:</u> uninorm_t <b>UNINORM_NFC</b> -<a name="IDX669"></a> +<dt><u>Constant:</u> int <b>UC_BREAK_PROHIBITED</b> +<a name="IDX757"></a> </dt> -<dd><p>Normalization form C: canonical decomposition, then canonical composition. +<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. </p></dd></dl> <dl> -<dt><u>Macro:</u> uninorm_t <b>UNINORM_NFKD</b> -<a name="IDX670"></a> +<dt><u>Constant:</u> int <b>UC_BREAK_UNDEFINED</b> +<a name="IDX758"></a> </dt> -<dd><p>Normalization form KD: compatibility decomposition. +<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 +override. </p></dd></dl> -<dl> -<dt><u>Macro:</u> uninorm_t <b>UNINORM_NFKC</b> -<a name="IDX671"></a> -</dt> -<dd><p>Normalization form KC: compatibility decomposition, then canonical composition. -</p></dd></dl> - -<p>The following functions operate on <code>uninorm_t</code> objects. +<p>The following functions determine the positions at which line breaks are +possible. </p> <dl> -<dt><u>Function:</u> bool <b>uninorm_is_compat_decomposing</b><i> (uninorm_t <var>nf</var>)</i> -<a name="IDX672"></a> +<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="IDX759"></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="IDX673"></a> +<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="IDX760"></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="IDX674"></a> +<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="IDX761"></a> </dt> -<dd><p>Returns the decomposing variant of the normalization form <var>nf</var>. -This maps NFC,NFD → NFD and NFKC,NFKD → NFKD. -</p></dd></dl> - -<p>The following functions apply a Unicode normalization form to a Unicode string. -</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="IDX675"></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="IDX676"></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="IDX677"></a> +<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="IDX762"></a> </dt> -<dd><p>Returns the specified normalization form of a string. +<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 +the values <code>UC_BREAK_MANDATORY</code>, <code>UC_BREAK_POSSIBLE</code>, +<code>UC_BREAK_HYPHENATION</code>, <code>UC_BREAK_PROHIBITED</code>. </p></dd></dl> -<hr size="6"> -<a name="Normalizing-comparisons"></a> -<a name="SEC46"></a> -<h2 class="section"> <a href="libunistring.html#TOC46">12.4 Normalizing comparisons</a> </h2> - -<p>The following functions compare Unicode string, ignoring differences in -normalization. +<p>The following functions determine where line breaks should be inserted so that +each line fits in a given width, when output to a device that uses +non-proportional fonts. </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="IDX678"></a> +<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="IDX763"></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="IDX679"></a> +<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="IDX764"></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="IDX680"></a> +<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="IDX765"></a> </dt> -<dd><p>Compares <var>s1</var> and <var>s2</var>, ignoring differences in normalization. -</p> -<p><var>nf</var> must be either <code>UNINORM_NFD</code> or <code>UNINORM_NFKD</code>. -</p> -<p>If successful, sets <code>*<var>resultp</var></code> to -1 if <var>s1</var> < <var>s2</var>, -0 if <var>s1</var> = <var>s2</var>, 1 if <var>s1</var> > <var>s2</var>, and returns 0. -Upon failure, returns -1 with <code>errno</code> set. -</p></dd></dl> - -<a name="IDX681"></a> -<a name="IDX682"></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="IDX683"></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="IDX684"></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="IDX685"></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 -<code>u8_normxfrm (<var>s2</var>)</code> with the <code>u8_cmp2</code> function is equivalent to -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></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="IDX686"></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="IDX687"></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="IDX688"></a> -</dt> -<dd><p>Compares <var>s1</var> and <var>s2</var>, ignoring differences in normalization, using -the collation rules of the current locale. -</p> -<p><var>nf</var> must be either <code>UNINORM_NFC</code> or <code>UNINORM_NFKC</code>. -</p> -<p>If successful, sets <code>*<var>resultp</var></code> to -1 if <var>s1</var> < <var>s2</var>, -0 if <var>s1</var> = <var>s2</var>, 1 if <var>s1</var> > <var>s2</var>, and returns 0. -Upon failure, returns -1 with <code>errno</code> set. -</p></dd></dl> - -<hr size="6"> -<a name="Normalization-of-streams"></a> -<a name="SEC47"></a> -<h2 class="section"> <a href="libunistring.html#TOC47">12.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 -“flushes” the stream. -</p> -<dl> -<dt><u>Type:</u> <b>struct uninorm_filter</b> -<a name="IDX689"></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 -character sequence to the encapsulated stream of Unicode characters. -</p></dd></dl> - -<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="IDX690"></a> +<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="IDX766"></a> </dt> -<dd><p>Creates and returns a normalization filter for Unicode characters. +<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>). </p> -<p>The pair (<var>stream_func</var>, <var>stream_data</var>) is the encapsulated stream. -<code><var>stream_func</var> (<var>stream_data</var>, <var>uc</var>)</code> receives the Unicode -character <var>uc</var> and returns 0 if successful, or -1 with <code>errno</code> set -upon failure. +<p>The string is <code><var>s</var>[0..<var>n</var>-1]</code>. </p> -<p>Returns the new filter, or NULL with <code>errno</code> set upon failure. -</p></dd></dl> - -<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="IDX691"></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. -</p></dd></dl> - -<dl> -<dt><u>Function:</u> int <b>uninorm_filter_flush</b><i> (struct uninorm_filter *<var>filter</var>)</i> -<a name="IDX692"></a> -</dt> -<dd><p>Brings data buffered in the filter to its destination, the encapsulated stream. +<p>The maximum number of columns per line is given as <var>width</var>. +The starting column of the string is given as <var>start_column</var>. +If the algorithm shall keep room after the last piece, this amount of room can +be given as <var>at_end_columns</var>. </p> -<p>Returns 0 if successful, or -1 with <code>errno</code> set upon failure. +<p><var>override</var> is an optional override; if +<code><var>override</var>[<var>i</var>] != UC_BREAK_UNDEFINED</code>, +<code><var>override</var>[<var>i</var>]</code> takes precedence over <code><var>p</var>[<var>i</var>]</code> +as returned by the <code>u*_possible_linebreaks</code> function. </p> -<p>Note! If after calling this function, additional characters are written -into the filter, the resulting character sequence in the encapsulated stream -will not necessarily be normalized. -</p></dd></dl> - -<dl> -<dt><u>Function:</u> int <b>uninorm_filter_free</b><i> (struct uninorm_filter *<var>filter</var>)</i> -<a name="IDX693"></a> -</dt> -<dd><p>Brings data buffered in the filter to its destination, the encapsulated stream, -then closes and frees the filter. +<p>The given <var>encoding</var> is used for disambiguating widths in <code>uc_width</code>. </p> -<p>Returns 0 if successful, or -1 with <code>errno</code> set upon failure. +<p>Returns the column after the end of the string, 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 +the values <code>UC_BREAK_MANDATORY</code>, <code>UC_BREAK_POSSIBLE</code>, +<code>UC_BREAK_HYPHENATION</code>, <code>UC_BREAK_PROHIBITED</code>. Here the value +<code>UC_BREAK_POSSIBLE</code> indicates that a line break <em>should</em> be inserted. </p></dd></dl> <hr size="6"> <table cellpadding="1" cellspacing="1" border="0"> -<tr><td valign="middle" align="left">[<a href="#SEC42" title="Beginning of this chapter or previous chapter"> << </a>]</td> +<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> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> @@ -493,12 +186,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_18.html#SEC71" title="Index">Index</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_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <p> <font size="-1"> - This document was generated by <em>Bruno Haible</em> on <em>March, 30 2010</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>July, 8 2015</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 8b779109..ca81cf8a 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 March, 30 2010 by texi2html 1.78a --> +<!-- Created on July, 8 2015 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: 13. Case mappings <unicase.h></title> +<title>GNU libunistring: 13. Normalization forms (composition and decomposition) <uninorm.h></title> -<meta name="description" content="GNU libunistring: 13. Case mappings <unicase.h>"> -<meta name="keywords" content="GNU libunistring: 13. Case mappings <unicase.h>"> +<meta name="description" content="GNU libunistring: 13. Normalization forms (composition and decomposition) <uninorm.h>"> +<meta name="keywords" content="GNU libunistring: 13. Normalization forms (composition and decomposition) <uninorm.h>"> <meta name="resource-type" content="document"> <meta name="distribution" content="global"> <meta name="Generator" content="texi2html 1.78a"> @@ -42,7 +42,7 @@ 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#SEC42" title="Beginning of this chapter or previous chapter"> << </a>]</td> +<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> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> @@ -51,446 +51,369 @@ 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_18.html#SEC71" title="Index">Index</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_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <hr size="2"> -<a name="unicase_002eh"></a> +<a name="uninorm_002eh"></a> <a name="SEC48"></a> -<h1 class="chapter"> <a href="libunistring.html#TOC48">13. Case mappings <code><unicase.h></code></a> </h1> +<h1 class="chapter"> <a href="libunistring.html#TOC48">13. Normalization forms (composition and decomposition) <code><uninorm.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. -</p> -<p>These string functions fix the problems that were mentioned in -<a href="libunistring_1.html#SEC6">‘<samp>char *</samp>’ strings</a>, namely, they handle the Croatian -<small>LETTER DZ WITH CARON</small>, the German <small>LATIN SMALL LETTER SHARP S</small>, the -Greek sigma and the Lithuanian i correctly. +<p>This include file defines functions for transforming Unicode strings to one +of the four normal forms, known as NFC, NFD, NKFC, NFKD. These +transformations involve decomposition and — for NFC and NFKC — composition +of Unicode characters. </p> <hr size="6"> -<a name="Case-mappings-of-characters"></a> +<a name="Decomposition-of-characters"></a> <a name="SEC49"></a> -<h2 class="section"> <a href="libunistring.html#TOC49">13.1 Case mappings of characters</a> </h2> +<h2 class="section"> <a href="libunistring.html#TOC49">13.1 Decomposition of Unicode 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 +<p>The following enumerated values are the possible types of decomposition of a Unicode character. </p> -<p>These mappings are locale and context independent. -</p> -<table class="cartouche" border="1"><tr><td> -<p><strong>WARNING!</strong> These functions are not sufficient for languages such as -German, Greek and Lithuanian. Better use the functions below that treat an -entire string at once and are language aware. -</p></td></tr></table> - <dl> -<dt><u>Function:</u> ucs4_t <b>uc_toupper</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX694"></a> +<dt><u>Constant:</u> int <b>UC_DECOMP_CANONICAL</b> +<a name="IDX767"></a> </dt> -<dd><p>Returns the uppercase mapping of the Unicode character <var>uc</var>. +<dd><p>Denotes canonical decomposition. </p></dd></dl> <dl> -<dt><u>Function:</u> ucs4_t <b>uc_tolower</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX695"></a> +<dt><u>Constant:</u> int <b>UC_DECOMP_FONT</b> +<a name="IDX768"></a> </dt> -<dd><p>Returns the lowercase mapping of the Unicode character <var>uc</var>. +<dd><p>UCD marker: <code><font></code>. Denotes a font variant (e.g. a blackletter form). </p></dd></dl> <dl> -<dt><u>Function:</u> ucs4_t <b>uc_totitle</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX696"></a> +<dt><u>Constant:</u> int <b>UC_DECOMP_NOBREAK</b> +<a name="IDX769"></a> </dt> -<dd><p>Returns the titlecase mapping of the Unicode character <var>uc</var>. -</p> -<p>The titlecase mapping of a character is to be used when the character should -look like upper case and the following characters are lower cased. -</p> -<p>For most characters, this is the same as the uppercase mapping. There are -only few characters where the title case variant and the uuper case variant -are different. These characters occur in the Latin writing of the Croatian, -Bosnian, and Serbian languages. -</p> -<table> -<thead><tr><th><p> Lower case </p></th><th><p> Title case </p></th><th><p> Upper case -</p></th></tr></thead> -<tr><td><p> LATIN SMALL LETTER LJ - </p></td><td><p> LATIN CAPITAL LETTER L WITH SMALL LETTER J - </p></td><td><p> LATIN CAPITAL LETTER LJ -</p></td></tr> -<tr><td><p> LATIN SMALL LETTER NJ - </p></td><td><p> LATIN CAPITAL LETTER N WITH SMALL LETTER J - </p></td><td><p> LATIN CAPITAL LETTER NJ -</p></td></tr> -<tr><td><p> LATIN SMALL LETTER DZ - </p></td><td><p> LATIN CAPITAL LETTER D WITH SMALL LETTER Z - </p></td><td><p> LATIN CAPITAL LETTER DZ -</p></td></tr> -<tr><td><p> LATIN SMALL LETTER DZ WITH CARON - </p></td><td><p> LATIN CAPITAL LETTER D WITH SMALL LETTER Z WITH CARON - </p></td><td><p> LATIN CAPITAL LETTER DZ WITH CARON -</p></td></tr> -</table> -</dd></dl> - -<hr size="6"> -<a name="Case-mappings-of-strings"></a> -<a name="SEC50"></a> -<h2 class="section"> <a href="libunistring.html#TOC50">13.2 Case mappings of strings</a> </h2> +<dd><p>UCD marker: <code><noBreak></code>. +Denotes a no-break version of a space or hyphen. +</p></dd></dl> -<p>Case mapping should always be performed on entire strings, not on individual -characters. The functions in this sections do so. -</p> -<p>These functions allow to apply a normalization after the case mapping. The -reason is that if you want to treat ‘<samp>ä</samp>’ and ‘<samp>Ä</samp>’ the same, -you most often also want to treat the composed and decomposed forms of such -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="IDX697"></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="IDX698"></a> +<dt><u>Constant:</u> int <b>UC_DECOMP_INITIAL</b> +<a name="IDX770"></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. +<dd><p>UCD marker: <code><initial></code>. +Denotes an initial presentation form (Arabic). </p></dd></dl> <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="IDX699"></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="IDX700"></a> +<dt><u>Constant:</u> int <b>UC_DECOMP_MEDIAL</b> +<a name="IDX771"></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="IDX701"></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. +<dd><p>UCD marker: <code><medial></code>. +Denotes a medial presentation form (Arabic). </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="IDX702"></a> +<dt><u>Constant:</u> int <b>UC_DECOMP_FINAL</b> +<a name="IDX772"></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="IDX703"></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="IDX704"></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. +<dd><p>UCD marker: <code><final></code>. +Denotes a final presentation form (Arabic). </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="IDX705"></a> +<dt><u>Constant:</u> int <b>UC_DECOMP_ISOLATED</b> +<a name="IDX773"></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="IDX706"></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="IDX707"></a> -</dt> -<dd><p>Returns the titlecase mapping of a string. -</p> -<p>Mapping to title case means that, in each word, the first cased character -is being mapped to title case and the remaining characters of the word -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. +<dd><p>UCD marker: <code><isolated></code>. +Denotes an isolated presentation form (Arabic). </p></dd></dl> -<hr size="6"> -<a name="Case-mappings-of-substrings"></a> -<a name="SEC51"></a> -<h2 class="section"> <a href="libunistring.html#TOC51">13.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 -work because case mapping requires some information about the surrounding -characters. The following functions allow to apply case mappings to -substrings of a given string, while taking into account the characters that -precede it (the “prefix”) and the characters that follow it (the “suffix”). -</p> <dl> -<dt><u>Type:</u> <b>casing_prefix_context_t</b> -<a name="IDX708"></a> +<dt><u>Constant:</u> int <b>UC_DECOMP_CIRCLE</b> +<a name="IDX774"></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, -without involving memory allocation. It is not an array type. +<dd><p>UCD marker: <code><circle></code>. +Denotes an encircled form. </p></dd></dl> <dl> -<dt><u>Constant:</u> casing_prefix_context_t <b>unicase_empty_prefix_context</b> -<a name="IDX709"></a> +<dt><u>Constant:</u> int <b>UC_DECOMP_SUPER</b> +<a name="IDX775"></a> </dt> -<dd><p>This constant is the case-mapping context that corresponds to an empty prefix -string. +<dd><p>UCD marker: <code><super></code>. +Denotes a superscript form. </p></dd></dl> -<p>The following functions return <code>casing_prefix_context_t</code> objects: -</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="IDX710"></a> +<dt><u>Constant:</u> int <b>UC_DECOMP_SUB</b> +<a name="IDX776"></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="IDX711"></a> +<dd><p>UCD marker: <code><sub></code>. +Denotes a subscript form. +</p></dd></dl> + +<dl> +<dt><u>Constant:</u> int <b>UC_DECOMP_VERTICAL</b> +<a name="IDX777"></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="IDX712"></a> +<dd><p>UCD marker: <code><vertical></code>. +Denotes a vertical layout presentation form. +</p></dd></dl> + +<dl> +<dt><u>Constant:</u> int <b>UC_DECOMP_WIDE</b> +<a name="IDX778"></a> </dt> -<dd><p>Returns the case-mapping context of a given prefix string. +<dd><p>UCD marker: <code><wide></code>. +Denotes a wide (or zenkaku) compatibility character. </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="IDX713"></a> +<dt><u>Constant:</u> int <b>UC_DECOMP_NARROW</b> +<a name="IDX779"></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="IDX714"></a> +<dd><p>UCD marker: <code><narrow></code>. +Denotes a narrow (or hankaku) compatibility character. +</p></dd></dl> + +<dl> +<dt><u>Constant:</u> int <b>UC_DECOMP_SMALL</b> +<a name="IDX780"></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="IDX715"></a> +<dd><p>UCD marker: <code><small></code>. +Denotes a small variant form (CNS compatibility). +</p></dd></dl> + +<dl> +<dt><u>Constant:</u> int <b>UC_DECOMP_SQUARE</b> +<a name="IDX781"></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>. +<dd><p>UCD marker: <code><square></code>. +Denotes a CJK squared font variant. </p></dd></dl> <dl> -<dt><u>Type:</u> <b>casing_suffix_context_t</b> -<a name="IDX716"></a> +<dt><u>Constant:</u> int <b>UC_DECOMP_FRACTION</b> +<a name="IDX782"></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, -without involving memory allocation. It is not an array type. +<dd><p>UCD marker: <code><fraction></code>. +Denotes a vulgar fraction form. </p></dd></dl> <dl> -<dt><u>Constant:</u> casing_suffix_context_t <b>unicase_empty_suffix_context</b> -<a name="IDX717"></a> +<dt><u>Constant:</u> int <b>UC_DECOMP_COMPAT</b> +<a name="IDX783"></a> </dt> -<dd><p>This constant is the case-mapping context that corresponds to an empty suffix -string. +<dd><p>UCD marker: <code><compat></code>. +Denotes an otherwise unspecified compatibility character. </p></dd></dl> -<p>The following functions return <code>casing_suffix_context_t</code> objects: +<p>The following constant denotes the maximum size of decomposition of a single +Unicode character. </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="IDX718"></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="IDX719"></a> +<dt><u>Macro:</u> unsigned int <b>UC_DECOMPOSITION_MAX_LENGTH</b> +<a name="IDX784"></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="IDX720"></a> -</dt> -<dd><p>Returns the case-mapping context of a given suffix string. +<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. </p></dd></dl> +<p>The following functions decompose a Unicode character. +</p> <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="IDX721"></a> +<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="IDX785"></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="IDX722"></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="IDX723"></a> +<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 +<code>UC_DECOMPOSITION_MAX_LENGTH</code> <code>ucs_t</code> elements. +</p> +<p>When a decomposition exists, <code><var>decomposition</var>[0..<var>n</var>-1]</code> and +<code>*<var>decomp_tag</var></code> are filled and <var>n</var> is returned. Otherwise -1 is +returned. +</p></dd></dl> + +<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="IDX786"></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>. +<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 +<code>UC_DECOMPOSITION_MAX_LENGTH</code> <code>ucs_t</code> elements. +</p> +<p>When a decomposition exists, <code><var>decomposition</var>[0..<var>n</var>-1]</code> is filled +and <var>n</var> is returned. Otherwise -1 is returned. </p></dd></dl> -<p>The following functions perform a case mapping, considering the -prefix context and the suffix context. +<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> + +<p>The following function composes a Unicode character from two Unicode +characters. </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="IDX724"></a> +<dt><u>Function:</u> ucs4_t <b>uc_composition</b><i> (ucs4_t <var>uc1</var>, ucs4_t <var>uc2</var>)</i> +<a name="IDX787"></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="IDX725"></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="IDX726"></a> -</dt> -<dd><p>Returns the uppercase mapping of a string that is surrounded by a prefix -and a suffix. +<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. +</p> +<p>Returns the combination of <var>uc1</var> and <var>uc2</var>, if it exists. +Returns 0 otherwise. +</p> +<p>Not all decompositions can be recombined using this function. See the Unicode +file ‘<tt>CompositionExclusions.txt</tt>’ for details. </p></dd></dl> +<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> + +<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>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="IDX727"></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="IDX728"></a> +<dt><u>Type:</u> <b>uninorm_t</b> +<a name="IDX788"></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="IDX729"></a> -</dt> -<dd><p>Returns the lowercase mapping of a string that is surrounded by a prefix -and a suffix. +<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>. </p></dd></dl> +<p>The following constants denote the four normalization forms. +</p> <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="IDX730"></a> +<dt><u>Macro:</u> uninorm_t <b>UNINORM_NFD</b> +<a name="IDX789"></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="IDX731"></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="IDX732"></a> +<dd><p>Denotes Normalization form D: canonical decomposition. +</p></dd></dl> + +<dl> +<dt><u>Macro:</u> uninorm_t <b>UNINORM_NFC</b> +<a name="IDX790"></a> </dt> -<dd><p>Returns the titlecase mapping of a string that is surrounded by a prefix -and a suffix. +<dd><p>Normalization form C: canonical decomposition, then canonical composition. </p></dd></dl> -<p>For example, to uppercase the UTF-8 substring between <code>s + start_index</code> -and <code>s + end_index</code> of a string that extends from <code>s</code> to -<code>s + u8_strlen (s)</code>, you can use the statements -</p> -<table><tr><td> </td><td><pre class="smallexample">size_t result_length; -uint8_t result = - u8_ct_toupper (s + start_index, end_index - start_index, - u8_casing_prefix_context (s, start_index), - u8_casing_suffix_context (s + end_index, - u8_strlen (s) - end_index), - iso639_language, NULL, NULL, &result_length); -</pre></td></tr></table> +<dl> +<dt><u>Macro:</u> uninorm_t <b>UNINORM_NFKD</b> +<a name="IDX791"></a> +</dt> +<dd><p>Normalization form KD: compatibility decomposition. +</p></dd></dl> -<hr size="6"> -<a name="Case-insensitive-comparison"></a> -<a name="SEC52"></a> -<h2 class="section"> <a href="libunistring.html#TOC52">13.4 Case insensitive comparison</a> </h2> +<dl> +<dt><u>Macro:</u> uninorm_t <b>UNINORM_NFKC</b> +<a name="IDX792"></a> +</dt> +<dd><p>Normalization form KC: compatibility decomposition, then canonical composition. +</p></dd></dl> -<p>The following functions implement comparison that ignores differences in case -and normalization. +<p>The following functions operate on <code>uninorm_t</code> objects. </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="IDX733"></a> +<dt><u>Function:</u> bool <b>uninorm_is_compat_decomposing</b><i> (uninorm_t <var>nf</var>)</i> +<a name="IDX793"></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="IDX734"></a> +<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="IDX794"></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="IDX735"></a> +<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="IDX795"></a> </dt> -<dd><p>Returns the case folded string. -</p> -<p>Comparing <code>u8_casefold (<var>s1</var>)</code> and <code>u8_casefold (<var>s2</var>)</code> -with the <code>u8_cmp2</code> function is equivalent to comparing <var>s1</var> and -<var>s2</var> with <code>u8_casecmp</code>. -</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. +<dd><p>Returns the decomposing variant of the normalization form <var>nf</var>. +This maps NFC,NFD → NFD and NFKC,NFKD → NFKD. </p></dd></dl> +<p>The following functions apply a Unicode normalization form to a Unicode string. +</p> <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="IDX736"></a> +<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="IDX796"></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="IDX737"></a> +<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="IDX797"></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="IDX738"></a> +<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="IDX798"></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. +<dd><p>Returns the specified normalization form of a string. </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> + +<p>The following functions compare Unicode string, ignoring differences in +normalization. +</p> <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="IDX739"></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="IDX740"></a> +<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="IDX799"></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="IDX741"></a> +<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="IDX800"></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="IDX742"></a> +<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="IDX801"></a> </dt> -<dd><p>Compares <var>s1</var> and <var>s2</var>, ignoring differences in case and normalization. +<dd><p>Compares <var>s1</var> and <var>s2</var>, ignoring differences in normalization. </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><var>nf</var> must be either <code>UNINORM_NFD</code> or <code>UNINORM_NFKD</code>. </p> <p>If successful, sets <code>*<var>resultp</var></code> to -1 if <var>s1</var> < <var>s2</var>, 0 if <var>s1</var> = <var>s2</var>, 1 if <var>s1</var> > <var>s2</var>, and returns 0. Upon failure, returns -1 with <code>errno</code> set. </p></dd></dl> -<a name="IDX743"></a> -<a name="IDX744"></a> -<a name="IDX745"></a> -<a name="IDX746"></a> -<p>The following functions additionally take into account the sorting rules of the -current locale. -</p> +<a name="IDX802"></a> +<a name="IDX803"></a> <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="IDX747"></a> +<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="IDX804"></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="IDX748"></a> +<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="IDX805"></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="IDX749"></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="IDX750"></a> +<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="IDX806"></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 -<code>u8_casexfrm (<var>s2</var>)</code> with the gnulib function <code>memcmp2</code> is -equivalent to comparing <var>s1</var> and <var>s2</var> with <code>u8_casecoll</code>. +sequence, in such a way that comparing <code>u8_normxfrm (<var>s1</var>)</code> and +<code>u8_normxfrm (<var>s2</var>)</code> with the <code>u8_cmp2</code> function is equivalent to +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>, <code>UNINORM_NFKC</code>, or NULL for -no normalization. +<p><var>nf</var> must be either <code>UNINORM_NFC</code> or <code>UNINORM_NFKC</code>. </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="IDX751"></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="IDX752"></a> +<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="IDX807"></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="IDX753"></a> +<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="IDX808"></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="IDX754"></a> +<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="IDX809"></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. +<dd><p>Compares <var>s1</var> and <var>s2</var>, ignoring differences in normalization, using +the collation rules of the current locale. </p> -<p>The <var>nf</var> argument identifies the normalization form to apply after the -case-mapping. It must be either <code>UNINORM_NFC</code> or <code>UNINORM_NFKC</code>. -It can also be NULL, for no normalization. +<p><var>nf</var> must be either <code>UNINORM_NFC</code> or <code>UNINORM_NFKC</code>. </p> <p>If successful, sets <code>*<var>resultp</var></code> to -1 if <var>s1</var> < <var>s2</var>, 0 if <var>s1</var> = <var>s2</var>, 1 if <var>s1</var> > <var>s2</var>, and returns 0. @@ -498,93 +421,66 @@ Upon failure, returns -1 with <code>errno</code> set. </p></dd></dl> <hr size="6"> -<a name="Case-detection"></a> +<a name="Normalization-of-streams"></a> <a name="SEC53"></a> -<h2 class="section"> <a href="libunistring.html#TOC53">13.5 Case detection</a> </h2> +<h2 class="section"> <a href="libunistring.html#TOC53">13.5 Normalization of streams of Unicode characters</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 -case-folded. +<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 +“flushes” the stream. </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="IDX755"></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="IDX756"></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="IDX757"></a> +<dt><u>Type:</u> <b>struct uninorm_filter</b> +<a name="IDX810"></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 -<code>errno</code> set. +<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 +character sequence to the encapsulated stream of Unicode characters. </p></dd></dl> <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="IDX758"></a> +<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="IDX811"></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="IDX759"></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="IDX760"></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 -<code>errno</code> set. +<dd><p>Creates and returns a normalization filter for Unicode characters. +</p> +<p>The pair (<var>stream_func</var>, <var>stream_data</var>) is the encapsulated stream. +<code><var>stream_func</var> (<var>stream_data</var>, <var>uc</var>)</code> receives the Unicode +character <var>uc</var> and returns 0 if successful, or -1 with <code>errno</code> set +upon failure. +</p> +<p>Returns the new filter, or NULL with <code>errno</code> set upon failure. </p></dd></dl> <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="IDX761"></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="IDX762"></a> +<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="IDX812"></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="IDX763"></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 -<code>errno</code> set. +<dd><p>Stuffs a Unicode character into a normalizing filter. +Returns 0 if successful, or -1 with <code>errno</code> set upon failure. </p></dd></dl> <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="IDX764"></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="IDX765"></a> +<dt><u>Function:</u> int <b>uninorm_filter_flush</b><i> (struct uninorm_filter *<var>filter</var>)</i> +<a name="IDX813"></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="IDX766"></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 -<code>errno</code> set. +<dd><p>Brings data buffered in the filter to its destination, the encapsulated stream. +</p> +<p>Returns 0 if successful, or -1 with <code>errno</code> set upon failure. +</p> +<p>Note! If after calling this function, additional characters are written +into the filter, the resulting character sequence in the encapsulated stream +will not necessarily be normalized. </p></dd></dl> -<p>The following functions determine whether case mappings have any effect on a -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="IDX767"></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="IDX768"></a> +<dt><u>Function:</u> int <b>uninorm_filter_free</b><i> (struct uninorm_filter *<var>filter</var>)</i> +<a name="IDX814"></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="IDX769"></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 -a no-op. Set <code>*<var>resultp</var></code> to false if NFD(<var>s</var>) maps to itself -under the upper case mapping, under the lower case mapping, and under the title -case mapping; in other words, when NFD(<var>s</var>) consists entirely of caseless -characters. Upon failure, returns -1 with <code>errno</code> set. +<dd><p>Brings data buffered in the filter to its destination, the encapsulated stream, +then closes and frees the filter. +</p> +<p>Returns 0 if successful, or -1 with <code>errno</code> set upon failure. </p></dd></dl> <hr size="6"> <table cellpadding="1" cellspacing="1" border="0"> @@ -597,12 +493,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_18.html#SEC71" title="Index">Index</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_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <p> <font size="-1"> - This document was generated by <em>Bruno Haible</em> on <em>March, 30 2010</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>July, 8 2015</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 1a7a338f..5f261d66 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 March, 30 2010 by texi2html 1.78a --> +<!-- Created on July, 8 2015 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: 14. Regular expressions <uniregex.h></title> +<title>GNU libunistring: 14. Case mappings <unicase.h></title> -<meta name="description" content="GNU libunistring: 14. Regular expressions <uniregex.h>"> -<meta name="keywords" content="GNU libunistring: 14. Regular expressions <uniregex.h>"> +<meta name="description" content="GNU libunistring: 14. Case mappings <unicase.h>"> +<meta name="keywords" content="GNU libunistring: 14. Case mappings <unicase.h>"> <meta name="resource-type" content="document"> <meta name="distribution" content="global"> <meta name="Generator" content="texi2html 1.78a"> @@ -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_13.html#SEC48" title="Beginning of this chapter or previous chapter"> << </a>]</td> -<td valign="middle" align="left">[<a href="libunistring_15.html#SEC55" title="Next chapter"> >> </a>]</td> +<td valign="middle" align="left">[<a href="libunistring_15.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,21 +51,545 @@ 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_18.html#SEC71" title="Index">Index</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_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <hr size="2"> -<a name="uniregex_002eh"></a> +<a name="unicase_002eh"></a> <a name="SEC54"></a> -<h1 class="chapter"> <a href="libunistring.html#TOC54">14. Regular expressions <code><uniregex.h></code></a> </h1> +<h1 class="chapter"> <a href="libunistring.html#TOC54">14. Case mappings <code><unicase.h></code></a> </h1> -<p>This include file is not yet implemented. +<p>This include file defines functions for case mapping for Unicode strings and +case insensitive comparison of Unicode strings and C strings. </p> +<p>These string functions fix the problems that were mentioned in +<a href="libunistring_1.html#SEC6">‘<samp>char *</samp>’ strings</a>, namely, they handle the Croatian +<small>LETTER DZ WITH CARON</small>, the German <small>LATIN SMALL LETTER SHARP S</small>, the +Greek sigma and the Lithuanian i correctly. +</p> + +<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> + +<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 +Unicode character. +</p> +<p>These mappings are locale and context independent. +</p> +<table class="cartouche" border="1"><tr><td> +<p><strong>WARNING!</strong> These functions are not sufficient for languages such as +German, Greek and Lithuanian. Better use the functions below that treat an +entire string at once and are language aware. +</p></td></tr></table> + +<dl> +<dt><u>Function:</u> ucs4_t <b>uc_toupper</b><i> (ucs4_t <var>uc</var>)</i> +<a name="IDX815"></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="IDX816"></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="IDX817"></a> +</dt> +<dd><p>Returns the titlecase mapping of the Unicode character <var>uc</var>. +</p> +<p>The titlecase mapping of a character is to be used when the character should +look like upper case and the following characters are lower cased. +</p> +<p>For most characters, this is the same as the uppercase mapping. There are +only few characters where the title case variant and the uuper case variant +are different. These characters occur in the Latin writing of the Croatian, +Bosnian, and Serbian languages. +</p> +<table> +<thead><tr><th><p> Lower case </p></th><th><p> Title case </p></th><th><p> Upper case +</p></th></tr></thead> +<tr><td><p> LATIN SMALL LETTER LJ + </p></td><td><p> LATIN CAPITAL LETTER L WITH SMALL LETTER J + </p></td><td><p> LATIN CAPITAL LETTER LJ +</p></td></tr> +<tr><td><p> LATIN SMALL LETTER NJ + </p></td><td><p> LATIN CAPITAL LETTER N WITH SMALL LETTER J + </p></td><td><p> LATIN CAPITAL LETTER NJ +</p></td></tr> +<tr><td><p> LATIN SMALL LETTER DZ + </p></td><td><p> LATIN CAPITAL LETTER D WITH SMALL LETTER Z + </p></td><td><p> LATIN CAPITAL LETTER DZ +</p></td></tr> +<tr><td><p> LATIN SMALL LETTER DZ WITH CARON + </p></td><td><p> LATIN CAPITAL LETTER D WITH SMALL LETTER Z WITH CARON + </p></td><td><p> LATIN CAPITAL LETTER DZ WITH CARON +</p></td></tr> +</table> +</dd></dl> + +<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> + +<p>Case mapping should always be performed on entire strings, not on individual +characters. The functions in this sections do so. +</p> +<p>These functions allow to apply a normalization after the case mapping. The +reason is that if you want to treat ‘<samp>ä</samp>’ and ‘<samp>Ä</samp>’ the same, +you most often also want to treat the composed and decomposed forms of such +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="IDX818"></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="IDX819"></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. +</p></dd></dl> + +<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="IDX820"></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="IDX821"></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="IDX822"></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></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="IDX823"></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="IDX824"></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="IDX825"></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></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="IDX826"></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="IDX827"></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="IDX828"></a> +</dt> +<dd><p>Returns the titlecase mapping of a string. +</p> +<p>Mapping to title case means that, in each word, the first cased character +is being mapped to title case and the remaining characters of the word +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></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> + +<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 +work because case mapping requires some information about the surrounding +characters. The following functions allow to apply case mappings to +substrings of a given string, while taking into account the characters that +precede it (the “prefix”) and the characters that follow it (the “suffix”). +</p> +<dl> +<dt><u>Type:</u> <b>casing_prefix_context_t</b> +<a name="IDX829"></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, +without involving memory allocation. It is not an array type. +</p></dd></dl> + +<dl> +<dt><u>Constant:</u> casing_prefix_context_t <b>unicase_empty_prefix_context</b> +<a name="IDX830"></a> +</dt> +<dd><p>This constant is the case-mapping context that corresponds to an empty prefix +string. +</p></dd></dl> + +<p>The following functions return <code>casing_prefix_context_t</code> objects: +</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="IDX831"></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="IDX832"></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="IDX833"></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="IDX834"></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="IDX835"></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="IDX836"></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>. +</p></dd></dl> + +<dl> +<dt><u>Type:</u> <b>casing_suffix_context_t</b> +<a name="IDX837"></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, +without involving memory allocation. It is not an array type. +</p></dd></dl> + +<dl> +<dt><u>Constant:</u> casing_suffix_context_t <b>unicase_empty_suffix_context</b> +<a name="IDX838"></a> +</dt> +<dd><p>This constant is the case-mapping context that corresponds to an empty suffix +string. +</p></dd></dl> + +<p>The following functions return <code>casing_suffix_context_t</code> objects: +</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="IDX839"></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="IDX840"></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="IDX841"></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="IDX842"></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="IDX843"></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="IDX844"></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>. +</p></dd></dl> + +<p>The following functions perform a case mapping, considering the +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="IDX845"></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="IDX846"></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="IDX847"></a> +</dt> +<dd><p>Returns the uppercase mapping of a string that is surrounded by a prefix +and a suffix. +</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="IDX848"></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="IDX849"></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="IDX850"></a> +</dt> +<dd><p>Returns the lowercase mapping of a string that is surrounded by a prefix +and a suffix. +</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="IDX851"></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="IDX852"></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="IDX853"></a> +</dt> +<dd><p>Returns the titlecase mapping of a string that is surrounded by a prefix +and a suffix. +</p></dd></dl> + +<p>For example, to uppercase the UTF-8 substring between <code>s + start_index</code> +and <code>s + end_index</code> of a string that extends from <code>s</code> to +<code>s + u8_strlen (s)</code>, you can use the statements +</p> +<table><tr><td> </td><td><pre class="smallexample">size_t result_length; +uint8_t result = + u8_ct_toupper (s + start_index, end_index - start_index, + u8_casing_prefix_context (s, start_index), + u8_casing_suffix_context (s + end_index, + u8_strlen (s) - end_index), + iso639_language, NULL, NULL, &result_length); +</pre></td></tr></table> + +<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> + +<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="IDX854"></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="IDX855"></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="IDX856"></a> +</dt> +<dd><p>Returns the case folded string. +</p> +<p>Comparing <code>u8_casefold (<var>s1</var>)</code> and <code>u8_casefold (<var>s2</var>)</code> +with the <code>u8_cmp2</code> function is equivalent to comparing <var>s1</var> and +<var>s2</var> with <code>u8_casecmp</code>. +</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></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="IDX857"></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="IDX858"></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="IDX859"></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></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="IDX860"></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="IDX861"></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="IDX862"></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="IDX863"></a> +</dt> +<dd><p>Compares <var>s1</var> and <var>s2</var>, ignoring differences in case and normalization. +</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>If successful, sets <code>*<var>resultp</var></code> to -1 if <var>s1</var> < <var>s2</var>, +0 if <var>s1</var> = <var>s2</var>, 1 if <var>s1</var> > <var>s2</var>, and returns 0. +Upon failure, returns -1 with <code>errno</code> set. +</p></dd></dl> + +<a name="IDX864"></a> +<a name="IDX865"></a> +<a name="IDX866"></a> +<a name="IDX867"></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="IDX868"></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="IDX869"></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="IDX870"></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="IDX871"></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 +<code>u8_casexfrm (<var>s2</var>)</code> with the gnulib function <code>memcmp2</code> is +equivalent to comparing <var>s1</var> and <var>s2</var> with <code>u8_casecoll</code>. +</p> +<p><var>nf</var> must be either <code>UNINORM_NFC</code>, <code>UNINORM_NFKC</code>, or NULL for +no normalization. +</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="IDX872"></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="IDX873"></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="IDX874"></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="IDX875"></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. +</p> +<p>The <var>nf</var> argument identifies the normalization form to apply after the +case-mapping. It must be either <code>UNINORM_NFC</code> or <code>UNINORM_NFKC</code>. +It can also be NULL, for no normalization. +</p> +<p>If successful, sets <code>*<var>resultp</var></code> to -1 if <var>s1</var> < <var>s2</var>, +0 if <var>s1</var> = <var>s2</var>, 1 if <var>s1</var> > <var>s2</var>, and returns 0. +Upon failure, returns -1 with <code>errno</code> set. +</p></dd></dl> + +<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> + +<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 +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="IDX876"></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="IDX877"></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="IDX878"></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 +<code>errno</code> set. +</p></dd></dl> + +<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="IDX879"></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="IDX880"></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="IDX881"></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 +<code>errno</code> set. +</p></dd></dl> + +<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="IDX882"></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="IDX883"></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="IDX884"></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 +<code>errno</code> set. +</p></dd></dl> + +<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="IDX885"></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="IDX886"></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="IDX887"></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 +<code>errno</code> set. +</p></dd></dl> + +<p>The following functions determine whether case mappings have any effect on a +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="IDX888"></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="IDX889"></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="IDX890"></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 +a no-op. Set <code>*<var>resultp</var></code> to false if NFD(<var>s</var>) maps to itself +under the upper case mapping, under the lower case mapping, and under the title +case mapping; in other words, when NFD(<var>s</var>) consists entirely of caseless +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="libunistring_13.html#SEC48" title="Beginning of this chapter or previous chapter"> << </a>]</td> -<td valign="middle" align="left">[<a href="libunistring_15.html#SEC55" 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_15.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> @@ -73,12 +597,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_18.html#SEC71" title="Index">Index</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_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <p> <font size="-1"> - This document was generated by <em>Bruno Haible</em> on <em>March, 30 2010</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>July, 8 2015</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 8b444199..ea836078 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 March, 30 2010 by texi2html 1.78a --> +<!-- Created on July, 8 2015 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: 15. Using the library</title> +<title>GNU libunistring: 15. Regular expressions <uniregex.h></title> -<meta name="description" content="GNU libunistring: 15. Using the library"> -<meta name="keywords" content="GNU libunistring: 15. Using the library"> +<meta name="description" content="GNU libunistring: 15. Regular expressions <uniregex.h>"> +<meta name="keywords" content="GNU libunistring: 15. Regular expressions <uniregex.h>"> <meta name="resource-type" content="document"> <meta name="distribution" content="global"> <meta name="Generator" content="texi2html 1.78a"> @@ -51,165 +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_18.html#SEC71" title="Index">Index</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_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <hr size="2"> -<a name="Using-the-library"></a> -<a name="SEC55"></a> -<h1 class="chapter"> <a href="libunistring.html#TOC55">15. 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 -library. -</p> - -<hr size="6"> -<a name="Installation"></a> -<a name="SEC56"></a> -<h2 class="section"> <a href="libunistring.html#TOC56">15.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="IDX770"></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.woe32</tt>’. -</p> -<hr size="6"> -<a name="Compiler-options"></a> -<a name="SEC57"></a> -<h2 class="section"> <a href="libunistring.html#TOC57">15.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. -If you didn't pass any ‘<samp>--prefix</samp>’ option, then the package is installed -in ‘<tt>/usr/local</tt>’. -</p> -<p>Let's denote as <code>LIBUNISTRING_INCLUDEDIR</code> the directory where the -include files were installed. This is usually the same as -<code>${LIBUNISTRING_PREFIX}/include</code>. Except that if you passed an -‘<samp>--includedir</samp>’ option to <code>configure</code>, it is the value of that -option. -</p> -<p>Let's further denote as <code>LIBUNISTRING_LIBDIR</code> the directory where -the library itself was installed. This is the value that you passed -with the ‘<samp>--libdir</samp>’ option to <code>configure</code>, or otherwise the -same as <code>${LIBUNISTRING_PREFIX}/lib</code>. Recall that when building -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="IDX771"></a> -<p>So that the compiler finds the include files, you have to pass it the -option <code>-I${LIBUNISTRING_INCLUDEDIR}</code>. -</p> -<p>So that the compiler finds the library during its linking pass, you have -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="#SEC59">Autoconf macro</a>) deals with this -particularity. -</p> -<hr size="6"> -<a name="Include-files"></a> -<a name="SEC58"></a> -<h2 class="section"> <a href="libunistring.html#TOC58">15.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. -</p> -<p>Another include file is <code><unistring/version.h></code>. It contains the -version number of the libunistring library. -</p> -<dl> -<dt><u>Macro:</u> int <b>_LIBUNISTRING_VERSION</b> -<a name="IDX772"></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 -number only. These parts are encoded in the form <code>(major<<8) + minor</code>. -</p></dd></dl> - -<dl> -<dt><u>Constant:</u> int <b>_libunistring_version</b> -<a name="IDX773"></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 -number only. These parts are encoded in the form <code>(major<<8) + minor</code>. -</p></dd></dl> - -<p>It is possible that <code>_libunistring_version</code> is greater than -<code>_LIBUNISTRING_VERSION</code>. This can happen when you use -<code>libunistring</code> as a shared library, and a newer, binary -backward-compatible version has been installed after your program -that uses <code>libunistring</code> was installed. -</p> -<hr size="6"> -<a name="Autoconf-macro"></a> -<a name="SEC59"></a> -<h2 class="section"> <a href="libunistring.html#TOC59">15.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="IDX774"></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 -the <code>CPPFLAGS</code> variable, and defines the C macro -<code>HAVE_LIBUNISTRING</code> to 1. Otherwise, it sets and AC_SUBSTs -<code>HAVE_LIBUNISTRING=no</code> and <code>LIBUNISTRING</code> and <code>LTLIBUNISTRING</code> -to empty. -</p> -<p>The complexities that <code>gl_LIBUNISTRING</code> deals with are the following: -</p> -<ul> -<li> -On some operating systems, in some configurations, libunistring depends -on <code>libiconv</code>, and the options for linking with libiconv must be -mentioned explicitly on the link command line. - -</li><li> -GNU <code>libunistring</code>, if installed, is not necessarily already in the -search path (<code>CPPFLAGS</code> for the include file search path, -<code>LDFLAGS</code> for the library search path). - -</li><li> -GNU <code>libunistring</code>, if installed, is not necessarily already in the -run time library search path. To avoid the need for setting an environment -variable like <code>LD_LIBRARY_PATH</code>, the macro adds the appropriate -run time search path options to the <code>LIBUNISTRING</code> variable. This works -on most systems. -</li></ul> - -<hr size="6"> -<a name="Reporting-problems"></a> +<a name="uniregex_002eh"></a> <a name="SEC60"></a> -<h2 class="section"> <a href="libunistring.html#TOC60">15.5 Reporting problems</a> </h2> +<h1 class="chapter"> <a href="libunistring.html#TOC60">15. Regular expressions <code><uniregex.h></code></a> </h1> -<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 -alternatively also use the bug tracker at the project page -<a href="https://savannah.gnu.org/projects/libunistring">https://savannah.gnu.org/projects/libunistring</a>. -</p> -<p>Please always include the version number of this library, and a short -description of your operating system and compilation environment with -corresponding version numbers. -</p> -<p>For problems that appear while building and installing <code>libunistring</code>, -for which you don't find the remedy in the ‘<tt>INSTALL</tt>’ file, please include -a description of the options that you passed to the ‘<samp>configure</samp>’ script. +<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="#SEC55" title="Beginning of this chapter or previous chapter"> << </a>]</td> +<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> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> @@ -218,12 +73,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_18.html#SEC71" title="Index">Index</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_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <p> <font size="-1"> - This document was generated by <em>Bruno Haible</em> on <em>March, 30 2010</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>July, 8 2015</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 5e9abeb5..cb3496a6 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 March, 30 2010 by texi2html 1.78a --> +<!-- Created on July, 8 2015 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: 16. More advanced functionality</title> +<title>GNU libunistring: 16. Using the library</title> -<meta name="description" content="GNU libunistring: 16. More advanced functionality"> -<meta name="keywords" content="GNU libunistring: 16. More advanced functionality"> +<meta name="description" content="GNU libunistring: 16. Using the library"> +<meta name="keywords" content="GNU libunistring: 16. Using the library"> <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_15.html#SEC55" title="Beginning of this chapter or previous chapter"> << </a>]</td> -<td valign="middle" align="left">[<a href="libunistring_17.html#SEC62" title="Next chapter"> >> </a>]</td> +<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> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> @@ -51,27 +51,166 @@ 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_18.html#SEC71" title="Index">Index</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_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <hr size="2"> -<a name="More-functionality"></a> +<a name="Using-the-library"></a> <a name="SEC61"></a> -<h1 class="chapter"> <a href="libunistring.html#TOC61">16. More advanced functionality</a> </h1> +<h1 class="chapter"> <a href="libunistring.html#TOC61">16. Using the library</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>This chapter explains some practical considerations, regarding the +installation and compiler options that are needed in order to use this +library. </p> -<a name="IDX775"></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>. + +<hr size="6"> +<a name="Installation"></a> +<a name="SEC62"></a> +<h2 class="section"> <a href="libunistring.html#TOC62">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="IDX891"></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.woe32</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> + +<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. +If you didn't pass any ‘<samp>--prefix</samp>’ option, then the package is installed +in ‘<tt>/usr/local</tt>’. +</p> +<p>Let's denote as <code>LIBUNISTRING_INCLUDEDIR</code> the directory where the +include files were installed. This is usually the same as +<code>${LIBUNISTRING_PREFIX}/include</code>. Except that if you passed an +‘<samp>--includedir</samp>’ option to <code>configure</code>, it is the value of that +option. +</p> +<p>Let's further denote as <code>LIBUNISTRING_LIBDIR</code> the directory where +the library itself was installed. This is the value that you passed +with the ‘<samp>--libdir</samp>’ option to <code>configure</code>, or otherwise the +same as <code>${LIBUNISTRING_PREFIX}/lib</code>. Recall that when building +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="IDX892"></a> +<p>So that the compiler finds the include files, you have to pass it the +option <code>-I${LIBUNISTRING_INCLUDEDIR}</code>. +</p> +<p>So that the compiler finds the library during its linking pass, you have +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 +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> + +<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. +</p> +<p>Another include file is <code><unistring/version.h></code>. It contains the +version number of the libunistring library. +</p> +<dl> +<dt><u>Macro:</u> int <b>_LIBUNISTRING_VERSION</b> +<a name="IDX893"></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 +number only. These parts are encoded in the form <code>(major<<8) + minor</code>. +</p></dd></dl> + +<dl> +<dt><u>Constant:</u> int <b>_libunistring_version</b> +<a name="IDX894"></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 +number only. These parts are encoded in the form <code>(major<<8) + minor</code>. +</p></dd></dl> + +<p>It is possible that <code>_libunistring_version</code> is greater than +<code>_LIBUNISTRING_VERSION</code>. This can happen when you use +<code>libunistring</code> as a shared library, and a newer, binary +backward-compatible version has been installed after your program +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> + +<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="IDX895"></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 +the <code>CPPFLAGS</code> variable, and defines the C macro +<code>HAVE_LIBUNISTRING</code> to 1. Otherwise, it sets and AC_SUBSTs +<code>HAVE_LIBUNISTRING=no</code> and <code>LIBUNISTRING</code> and <code>LTLIBUNISTRING</code> +to empty. +</p> +<p>The complexities that <code>gl_LIBUNISTRING</code> deals with are the following: +</p> +<ul> +<li> +On some operating systems, in some configurations, libunistring depends +on <code>libiconv</code>, and the options for linking with libiconv must be +mentioned explicitly on the link command line. + +</li><li> +GNU <code>libunistring</code>, if installed, is not necessarily already in the +search path (<code>CPPFLAGS</code> for the include file search path, +<code>LDFLAGS</code> for the library search path). + +</li><li> +GNU <code>libunistring</code>, if installed, is not necessarily already in the +run time library search path. To avoid the need for setting an environment +variable like <code>LD_LIBRARY_PATH</code>, the macro adds the appropriate +run time search path options to the <code>LIBUNISTRING</code> variable. This works +on most systems. +</li></ul> + +<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> + +<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 +alternatively also use the bug tracker at the project page +<a href="https://savannah.gnu.org/projects/libunistring">https://savannah.gnu.org/projects/libunistring</a>. +</p> +<p>Please always include the version number of this library, and a short +description of your operating system and compilation environment with +corresponding version numbers. +</p> +<p>For problems that appear while building and installing <code>libunistring</code>, +for which you don't find the remedy in the ‘<tt>INSTALL</tt>’ file, please include +a description of the options that you passed to the ‘<samp>configure</samp>’ script. </p> <hr size="6"> <table cellpadding="1" cellspacing="1" border="0"> -<tr><td valign="middle" align="left">[<a href="libunistring_15.html#SEC55" title="Beginning of this chapter or previous chapter"> << </a>]</td> -<td valign="middle" align="left">[<a href="libunistring_17.html#SEC62" 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_17.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> @@ -79,12 +218,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_18.html#SEC71" title="Index">Index</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_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <p> <font size="-1"> - This document was generated by <em>Bruno Haible</em> on <em>March, 30 2010</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>July, 8 2015</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 7eeed079..7daf5a88 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 March, 30 2010 by texi2html 1.78a --> +<!-- Created on July, 8 2015 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: 17. More advanced functionality</title> -<meta name="description" content="GNU libunistring: A. Licenses"> -<meta name="keywords" content="GNU libunistring: A. Licenses"> +<meta name="description" content="GNU libunistring: 17. More advanced functionality"> +<meta name="keywords" content="GNU libunistring: 17. More advanced functionality"> <meta name="resource-type" content="document"> <meta name="distribution" content="global"> <meta name="Generator" content="texi2html 1.78a"> @@ -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_16.html#SEC61" title="Beginning of this chapter or previous chapter"> << </a>]</td> -<td valign="middle" align="left">[<a href="libunistring_18.html#SEC71" title="Next chapter"> >> </a>]</td> +<td valign="middle" align="left">[<a href="libunistring_18.html#SEC68" title="Next chapter"> >> </a>]</td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> @@ -51,1460 +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_18.html#SEC71" title="Index">Index</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_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <hr size="2"> -<a name="Licenses"></a> -<a name="SEC62"></a> -<h1 class="appendix"> <a href="libunistring.html#TOC62">A. 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 is covered by the -GNU Lesser General Public License (LGPL). -A copy of the license is included in <a href="#SEC68">GNU LESSER GENERAL PUBLIC LICENSE</a>. - -</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="#SEC69">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="#SEC63">GNU GENERAL PUBLIC LICENSE</a>. -</li></ul> - - - -<hr size="6"> -<a name="GNU-GPL"></a> -<a name="SEC63"></a> -<h2 class="appendixsec"> <a href="libunistring.html#TOC63">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="SEC64"></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="SEC65"></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="SEC66"></a> -<h2 class="heading"> END OF TERMS AND CONDITIONS </h2> - +<a name="More-functionality"></a> <a name="SEC67"></a> -<h2 class="heading"> How to Apply These Terms to Your New Programs </h2> +<h1 class="chapter"> <a href="libunistring.html#TOC67">17. More advanced functionality</a> </h1> -<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>For bidirectional reordering of strings, we recommend the GNU FriBidi library: +<a href="http://www.fribidi.org/">http://www.fribidi.org/</a>. </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. +<a name="IDX896"></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> -<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="SEC68"></a> -<h2 class="appendixsec"> <a href="libunistring.html#TOC64">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="SEC69"></a> -<h2 class="appendixsec"> <a href="libunistring.html#TOC65">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> -<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="SEC70"></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="#SEC62" title="Beginning of this chapter or previous chapter"> << </a>]</td> -<td valign="middle" align="left">[<a href="libunistring_18.html#SEC71" title="Next chapter"> >> </a>]</td> +<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> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> @@ -1512,12 +79,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_18.html#SEC71" title="Index">Index</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_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <p> <font size="-1"> - This document was generated by <em>Bruno Haible</em> on <em>March, 30 2010</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>July, 8 2015</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 61efd623..40a5e2e0 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 March, 30 2010 by texi2html 1.78a --> +<!-- Created on July, 8 2015 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: A. Licenses</title> -<meta name="description" content="GNU libunistring: Index"> -<meta name="keywords" content="GNU libunistring: Index"> +<meta name="description" content="GNU libunistring: A. Licenses"> +<meta name="keywords" content="GNU libunistring: A. 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_17.html#SEC62" title="Beginning of this chapter or previous chapter"> << </a>]</td> -<td valign="middle" align="left">[<a href="libunistring_19.html#INDEX0" title="Next chapter"> >> </a>]</td> +<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> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> @@ -51,704 +51,1460 @@ 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="#SEC71" title="Index">Index</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_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <hr size="2"> -<a name="Index"></a> +<a name="Licenses"></a> +<a name="SEC68"></a> +<h1 class="appendix"> <a href="libunistring.html#TOC68">A. 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 is covered by the +GNU Lesser General Public License (LGPL). +A copy of the license is included in <a href="#SEC74">GNU LESSER GENERAL PUBLIC LICENSE</a>. + +</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> -<h1 class="unnumbered"> <a href="libunistring.html#TOC66">Index</a> </h1> - -<table><tr><th valign="top">Jump to: </th><td><a href="#SEC71_0" class="summary-letter"><b>A</b></a> - -<a href="#SEC71_1" class="summary-letter"><b>B</b></a> - -<a href="#SEC71_2" class="summary-letter"><b>C</b></a> - -<a href="#SEC71_3" class="summary-letter"><b>D</b></a> - -<a href="#SEC71_4" class="summary-letter"><b>E</b></a> - -<a href="#SEC71_5" class="summary-letter"><b>F</b></a> - -<a href="#SEC71_6" class="summary-letter"><b>G</b></a> - -<a href="#SEC71_7" class="summary-letter"><b>H</b></a> - -<a href="#SEC71_8" class="summary-letter"><b>I</b></a> - -<a href="#SEC71_9" class="summary-letter"><b>J</b></a> - -<a href="#SEC71_10" class="summary-letter"><b>L</b></a> - -<a href="#SEC71_11" class="summary-letter"><b>M</b></a> - -<a href="#SEC71_12" class="summary-letter"><b>N</b></a> - -<a href="#SEC71_13" class="summary-letter"><b>O</b></a> - -<a href="#SEC71_14" class="summary-letter"><b>P</b></a> - -<a href="#SEC71_15" class="summary-letter"><b>R</b></a> - -<a href="#SEC71_16" class="summary-letter"><b>S</b></a> - -<a href="#SEC71_17" class="summary-letter"><b>T</b></a> - -<a href="#SEC71_18" class="summary-letter"><b>U</b></a> - -<a href="libunistring_19.html#INDEX0_0" class="summary-letter"><b>V</b></a> - -<a href="libunistring_19.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="SEC71_0">A</a></th><td></td><td></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_9.html#IDX604">ambiguous width</a></td><td valign="top"><a href="libunistring_9.html#SEC37">9. Display width <code><uniwidth.h></code></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_15.html#SEC59">autoconf macro</a></td><td valign="top"><a href="libunistring_15.html#SEC59">15.4 Autoconf macro</a></td></tr> -<tr><td colspan="3"> <hr></td></tr> -<tr><th><a name="SEC71_1">B</a></th><td></td><td></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 Bidirectional category</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_16.html#SEC61">bidirectional reordering</a></td><td valign="top"><a href="libunistring_16.html#SEC61">16. More advanced functionality</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC34">block</a></td><td valign="top"><a href="libunistring_8.html#SEC34">8.10 Blocks</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_11.html#SEC41">breaks, line</a></td><td valign="top"><a href="libunistring_11.html#SEC41">11. Line breaking <code><unilbrk.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_10.html#SEC38">breaks, word</a></td><td valign="top"><a href="libunistring_10.html#SEC38">10. Word breaks in strings <code><uniwbrk.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_15.html#SEC60">bug reports</a></td><td valign="top"><a href="libunistring_15.html#SEC60">15.5 Reporting problems</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_15.html#SEC60">bug tracker</a></td><td valign="top"><a href="libunistring_15.html#SEC60">15.5 Reporting problems</a></td></tr> -<tr><td colspan="3"> <hr></td></tr> -<tr><th><a name="SEC71_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#SEC35">C, programming language</a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.11 ISO C and Java syntax</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC36">C-like API</a></td><td valign="top"><a href="libunistring_8.html#SEC36">8.12 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_13.html#SEC53">case detection</a></td><td valign="top"><a href="libunistring_13.html#SEC53">13.5 Case detection</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#SEC50">case mappings</a></td><td valign="top"><a href="libunistring_13.html#SEC50">13.2 Case mappings of strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX708"><code>casing_prefix_context_t</code></a></td><td valign="top"><a href="libunistring_13.html#SEC51">13.3 Case mappings of substrings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX716"><code>casing_suffix_context_t</code></a></td><td valign="top"><a href="libunistring_13.html#SEC51">13.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_12.html#SEC44">combining, Unicode characters</a></td><td valign="top"><a href="libunistring_12.html#SEC44">12.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_13.html#SEC52">comparing, ignoring case</a></td><td valign="top"><a href="libunistring_13.html#SEC52">13.4 Case insensitive comparison</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX743">comparing, ignoring case, with collation rules</a></td><td valign="top"><a href="libunistring_13.html#SEC52">13.4 Case insensitive comparison</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_12.html#SEC46">comparing, ignoring normalization</a></td><td valign="top"><a href="libunistring_12.html#SEC46">12.4 Normalizing comparisons</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#SEC52">comparing, ignoring normalization and case</a></td><td valign="top"><a href="libunistring_13.html#SEC52">13.4 Case insensitive comparison</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX745">comparing, ignoring normalization and case, with collation rules</a></td><td valign="top"><a href="libunistring_13.html#SEC52">13.4 Case insensitive comparison</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_12.html#IDX681">comparing, ignoring normalization, with collation rules</a></td><td valign="top"><a href="libunistring_12.html#SEC46">12.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_13.html#IDX744">comparing, with collation rules, ignoring case</a></td><td valign="top"><a href="libunistring_13.html#SEC52">13.4 Case insensitive comparison</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_12.html#IDX682">comparing, with collation rules, ignoring normalization</a></td><td valign="top"><a href="libunistring_12.html#SEC46">12.4 Normalizing comparisons</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX746">comparing, with collation rules, ignoring normalization and case</a></td><td valign="top"><a href="libunistring_13.html#SEC52">13.4 Case insensitive comparison</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_15.html#IDX771">compiler options</a></td><td valign="top"><a href="libunistring_15.html#SEC57">15.2 Compiler options</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_12.html#SEC44">composing, Unicode characters</a></td><td valign="top"><a href="libunistring_12.html#SEC44">12.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="SEC71_3">D</a></th><td></td><td></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_12.html#SEC43">decomposing</a></td><td valign="top"><a href="libunistring_12.html#SEC43">12.1 Decomposition of Unicode characters</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_15.html#SEC56">dependencies</a></td><td valign="top"><a href="libunistring_15.html#SEC56">15.1 Installation</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#SEC53">detecting case</a></td><td valign="top"><a href="libunistring_13.html#SEC53">13.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="SEC71_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="SEC71_5">F</a></th><td></td><td></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_17.html#SEC69">FDL, GNU Free Documentation License</a></td><td valign="top"><a href="libunistring_17.html#SEC69">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#IDX607">fullwidth</a></td><td valign="top"><a href="libunistring_9.html#SEC37">9. Display width <code><uniwidth.h></code></a></td></tr> -<tr><td colspan="3"> <hr></td></tr> -<tr><th><a name="SEC71_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_15.html#IDX774"><code>gl_LIBUNISTRING</code></a></td><td valign="top"><a href="libunistring_15.html#SEC59">15.4 Autoconf macro</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_17.html#SEC63">GPL, GNU General Public License</a></td><td valign="top"><a href="libunistring_17.html#SEC63">A.1 GNU GENERAL PUBLIC LICENSE</a></td></tr> -<tr><td colspan="3"> <hr></td></tr> -<tr><th><a name="SEC71_7">H</a></th><td></td><td></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_9.html#IDX606">halfwidth</a></td><td valign="top"><a href="libunistring_9.html#SEC37">9. Display width <code><uniwidth.h></code></a></td></tr> -<tr><td colspan="3"> <hr></td></tr> -<tr><th><a name="SEC71_8">I</a></th><td></td><td></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC35">identifiers</a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.11 ISO C and Java syntax</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_15.html#IDX770">installation</a></td><td valign="top"><a href="libunistring_15.html#SEC56">15.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="SEC71_9">J</a></th><td></td><td></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC35">Java, programming language</a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.11 ISO C and Java syntax</a></td></tr> -<tr><td colspan="3"> <hr></td></tr> -<tr><th><a name="SEC71_10">L</a></th><td></td><td></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_17.html#SEC68">LGPL, GNU Lesser General Public License</a></td><td valign="top"><a href="libunistring_17.html#SEC68">A.2 GNU LESSER GENERAL PUBLIC LICENSE</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_17.html#SEC69">License, GNU FDL</a></td><td valign="top"><a href="libunistring_17.html#SEC69">A.3 GNU Free Documentation License</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_17.html#SEC63">License, GNU GPL</a></td><td valign="top"><a href="libunistring_17.html#SEC63">A.1 GNU GENERAL PUBLIC LICENSE</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_17.html#SEC68">License, GNU LGPL</a></td><td valign="top"><a href="libunistring_17.html#SEC68">A.2 GNU LESSER GENERAL PUBLIC LICENSE</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_17.html#SEC62">Licenses</a></td><td valign="top"><a href="libunistring_17.html#SEC62">A. Licenses</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_11.html#SEC41">line breaks</a></td><td valign="top"><a href="libunistring_11.html#SEC41">11. 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_13.html#IDX697">locale language</a></td><td valign="top"><a href="libunistring_13.html#SEC50">13.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_13.html#SEC50">lowercasing</a></td><td valign="top"><a href="libunistring_13.html#SEC50">13.2 Case mappings of strings</a></td></tr> -<tr><td colspan="3"> <hr></td></tr> -<tr><th><a name="SEC71_11">M</a></th><td></td><td></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_15.html#SEC60">mailing list</a></td><td valign="top"><a href="libunistring_15.html#SEC60">15.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="SEC71_12">N</a></th><td></td><td></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_12.html#SEC42">normal forms</a></td><td valign="top"><a href="libunistring_12.html#SEC42">12. Normalization forms (composition and decomposition) <code><uninorm.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_12.html#SEC42">normalizing</a></td><td valign="top"><a href="libunistring_12.html#SEC42">12. Normalization forms (composition and decomposition) <code><uninorm.h></code></a></td></tr> -<tr><td colspan="3"> <hr></td></tr> -<tr><th><a name="SEC71_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="SEC71_14">P</a></th><td></td><td></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC30">properties, of Unicode character</a></td><td valign="top"><a href="libunistring_8.html#SEC30">8.8 Properties</a></td></tr> -<tr><td colspan="3"> <hr></td></tr> -<tr><th><a name="SEC71_15">R</a></th><td></td><td></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_14.html#SEC54">regular expression</a></td><td valign="top"><a href="libunistring_14.html#SEC54">14. Regular expressions <code><uniregex.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_16.html#IDX775">rendering</a></td><td valign="top"><a href="libunistring_16.html#SEC61">16. 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="SEC71_16">S</a></th><td></td><td></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#SEC33">scripts</a></td><td valign="top"><a href="libunistring_8.html#SEC33">8.9 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_12.html#SEC47">stream, normalizing a</a></td><td valign="top"><a href="libunistring_12.html#SEC47">12.5 Normalization of streams of Unicode characters</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_12.html#IDX689"><code>struct uninorm_filter</code></a></td><td valign="top"><a href="libunistring_12.html#SEC47">12.5 Normalization of streams of Unicode characters</a></td></tr> -<tr><td colspan="3"> <hr></td></tr> -<tr><th><a name="SEC71_17">T</a></th><td></td><td></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#SEC50">titlecasing</a></td><td valign="top"><a href="libunistring_13.html#SEC50">13.2 Case mappings of strings</a></td></tr> -<tr><td colspan="3"> <hr></td></tr> -<tr><th><a name="SEC71_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_13.html#IDX740"><code>u16_casecmp</code></a></td><td valign="top"><a href="libunistring_13.html#SEC52">13.4 Case insensitive comparison</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX752"><code>u16_casecoll</code></a></td><td valign="top"><a href="libunistring_13.html#SEC52">13.4 Case insensitive comparison</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX734"><code>u16_casefold</code></a></td><td valign="top"><a href="libunistring_13.html#SEC52">13.4 Case insensitive comparison</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX748"><code>u16_casexfrm</code></a></td><td valign="top"><a href="libunistring_13.html#SEC52">13.4 Case insensitive comparison</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX711"><code>u16_casing_prefix_context</code></a></td><td valign="top"><a href="libunistring_13.html#SEC51">13.3 Case mappings of substrings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX714"><code>u16_casing_prefixes_context</code></a></td><td valign="top"><a href="libunistring_13.html#SEC51">13.3 Case mappings of substrings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX719"><code>u16_casing_suffix_context</code></a></td><td valign="top"><a href="libunistring_13.html#SEC51">13.3 Case mappings of substrings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX722"><code>u16_casing_suffixes_context</code></a></td><td valign="top"><a href="libunistring_13.html#SEC51">13.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_13.html#IDX737"><code>u16_ct_casefold</code></a></td><td valign="top"><a href="libunistring_13.html#SEC52">13.4 Case insensitive comparison</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX728"><code>u16_ct_tolower</code></a></td><td valign="top"><a href="libunistring_13.html#SEC51">13.3 Case mappings of substrings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX731"><code>u16_ct_totitle</code></a></td><td valign="top"><a href="libunistring_13.html#SEC51">13.3 Case mappings of substrings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX725"><code>u16_ct_toupper</code></a></td><td valign="top"><a href="libunistring_13.html#SEC51">13.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_13.html#IDX768"><code>u16_is_cased</code></a></td><td valign="top"><a href="libunistring_13.html#SEC53">13.5 Case detection</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX765"><code>u16_is_casefolded</code></a></td><td valign="top"><a href="libunistring_13.html#SEC53">13.5 Case detection</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX759"><code>u16_is_lowercase</code></a></td><td valign="top"><a href="libunistring_13.html#SEC53">13.5 Case detection</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX762"><code>u16_is_titlecase</code></a></td><td valign="top"><a href="libunistring_13.html#SEC53">13.5 Case detection</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX756"><code>u16_is_uppercase</code></a></td><td valign="top"><a href="libunistring_13.html#SEC53">13.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_12.html#IDX676"><code>u16_normalize</code></a></td><td valign="top"><a href="libunistring_12.html#SEC45">12.3 Normalization of strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_12.html#IDX679"><code>u16_normcmp</code></a></td><td valign="top"><a href="libunistring_12.html#SEC46">12.4 Normalizing comparisons</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_12.html#IDX687"><code>u16_normcoll</code></a></td><td valign="top"><a href="libunistring_12.html#SEC46">12.4 Normalizing comparisons</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_12.html#IDX684"><code>u16_normxfrm</code></a></td><td valign="top"><a href="libunistring_12.html#SEC46">12.4 Normalizing comparisons</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_11.html#IDX639"><code>u16_possible_linebreaks</code></a></td><td valign="top"><a href="libunistring_11.html#SEC41">11. 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#IDX613"><code>u16_strwidth</code></a></td><td valign="top"><a href="libunistring_9.html#SEC37">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_13.html#IDX703"><code>u16_tolower</code></a></td><td valign="top"><a href="libunistring_13.html#SEC50">13.2 Case mappings of strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX706"><code>u16_totitle</code></a></td><td valign="top"><a href="libunistring_13.html#SEC50">13.2 Case mappings of strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX700"><code>u16_toupper</code></a></td><td valign="top"><a href="libunistring_13.html#SEC50">13.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#IDX610"><code>u16_width</code></a></td><td valign="top"><a href="libunistring_9.html#SEC37">9. Display width <code><uniwidth.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_11.html#IDX643"><code>u16_width_linebreaks</code></a></td><td valign="top"><a href="libunistring_11.html#SEC41">11. Line breaking <code><unilbrk.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_10.html#IDX616"><code>u16_wordbreaks</code></a></td><td valign="top"><a href="libunistring_10.html#SEC39">10.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_13.html#IDX741"><code>u32_casecmp</code></a></td><td valign="top"><a href="libunistring_13.html#SEC52">13.4 Case insensitive comparison</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX753"><code>u32_casecoll</code></a></td><td valign="top"><a href="libunistring_13.html#SEC52">13.4 Case insensitive comparison</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX735"><code>u32_casefold</code></a></td><td valign="top"><a href="libunistring_13.html#SEC52">13.4 Case insensitive comparison</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX749"><code>u32_casexfrm</code></a></td><td valign="top"><a href="libunistring_13.html#SEC52">13.4 Case insensitive comparison</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX712"><code>u32_casing_prefix_context</code></a></td><td valign="top"><a href="libunistring_13.html#SEC51">13.3 Case mappings of substrings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX715"><code>u32_casing_prefixes_context</code></a></td><td valign="top"><a href="libunistring_13.html#SEC51">13.3 Case mappings of substrings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX720"><code>u32_casing_suffix_context</code></a></td><td valign="top"><a href="libunistring_13.html#SEC51">13.3 Case mappings of substrings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX723"><code>u32_casing_suffixes_context</code></a></td><td valign="top"><a href="libunistring_13.html#SEC51">13.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_13.html#IDX738"><code>u32_ct_casefold</code></a></td><td valign="top"><a href="libunistring_13.html#SEC52">13.4 Case insensitive comparison</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX729"><code>u32_ct_tolower</code></a></td><td valign="top"><a href="libunistring_13.html#SEC51">13.3 Case mappings of substrings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX732"><code>u32_ct_totitle</code></a></td><td valign="top"><a href="libunistring_13.html#SEC51">13.3 Case mappings of substrings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX726"><code>u32_ct_toupper</code></a></td><td valign="top"><a href="libunistring_13.html#SEC51">13.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_13.html#IDX769"><code>u32_is_cased</code></a></td><td valign="top"><a href="libunistring_13.html#SEC53">13.5 Case detection</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX766"><code>u32_is_casefolded</code></a></td><td valign="top"><a href="libunistring_13.html#SEC53">13.5 Case detection</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX760"><code>u32_is_lowercase</code></a></td><td valign="top"><a href="libunistring_13.html#SEC53">13.5 Case detection</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX763"><code>u32_is_titlecase</code></a></td><td valign="top"><a href="libunistring_13.html#SEC53">13.5 Case detection</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX757"><code>u32_is_uppercase</code></a></td><td valign="top"><a href="libunistring_13.html#SEC53">13.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_12.html#IDX677"><code>u32_normalize</code></a></td><td valign="top"><a href="libunistring_12.html#SEC45">12.3 Normalization of strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_12.html#IDX680"><code>u32_normcmp</code></a></td><td valign="top"><a href="libunistring_12.html#SEC46">12.4 Normalizing comparisons</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_12.html#IDX688"><code>u32_normcoll</code></a></td><td valign="top"><a href="libunistring_12.html#SEC46">12.4 Normalizing comparisons</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_12.html#IDX685"><code>u32_normxfrm</code></a></td><td valign="top"><a href="libunistring_12.html#SEC46">12.4 Normalizing comparisons</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_11.html#IDX640"><code>u32_possible_linebreaks</code></a></td><td valign="top"><a href="libunistring_11.html#SEC41">11. 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#IDX614"><code>u32_strwidth</code></a></td><td valign="top"><a href="libunistring_9.html#SEC37">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_13.html#IDX704"><code>u32_tolower</code></a></td><td valign="top"><a href="libunistring_13.html#SEC50">13.2 Case mappings of strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX707"><code>u32_totitle</code></a></td><td valign="top"><a href="libunistring_13.html#SEC50">13.2 Case mappings of strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX701"><code>u32_toupper</code></a></td><td valign="top"><a href="libunistring_13.html#SEC50">13.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#IDX611"><code>u32_width</code></a></td><td valign="top"><a href="libunistring_9.html#SEC37">9. Display width <code><uniwidth.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_11.html#IDX644"><code>u32_width_linebreaks</code></a></td><td valign="top"><a href="libunistring_11.html#SEC41">11. Line breaking <code><unilbrk.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_10.html#IDX617"><code>u32_wordbreaks</code></a></td><td valign="top"><a href="libunistring_10.html#SEC39">10.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_13.html#IDX739"><code>u8_casecmp</code></a></td><td valign="top"><a href="libunistring_13.html#SEC52">13.4 Case insensitive comparison</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX751"><code>u8_casecoll</code></a></td><td valign="top"><a href="libunistring_13.html#SEC52">13.4 Case insensitive comparison</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX733"><code>u8_casefold</code></a></td><td valign="top"><a href="libunistring_13.html#SEC52">13.4 Case insensitive comparison</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX747"><code>u8_casexfrm</code></a></td><td valign="top"><a href="libunistring_13.html#SEC52">13.4 Case insensitive comparison</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX710"><code>u8_casing_prefix_context</code></a></td><td valign="top"><a href="libunistring_13.html#SEC51">13.3 Case mappings of substrings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX713"><code>u8_casing_prefixes_context</code></a></td><td valign="top"><a href="libunistring_13.html#SEC51">13.3 Case mappings of substrings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX718"><code>u8_casing_suffix_context</code></a></td><td valign="top"><a href="libunistring_13.html#SEC51">13.3 Case mappings of substrings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX721"><code>u8_casing_suffixes_context</code></a></td><td valign="top"><a href="libunistring_13.html#SEC51">13.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_13.html#IDX736"><code>u8_ct_casefold</code></a></td><td valign="top"><a href="libunistring_13.html#SEC52">13.4 Case insensitive comparison</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX727"><code>u8_ct_tolower</code></a></td><td valign="top"><a href="libunistring_13.html#SEC51">13.3 Case mappings of substrings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX730"><code>u8_ct_totitle</code></a></td><td valign="top"><a href="libunistring_13.html#SEC51">13.3 Case mappings of substrings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX724"><code>u8_ct_toupper</code></a></td><td valign="top"><a href="libunistring_13.html#SEC51">13.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_13.html#IDX767"><code>u8_is_cased</code></a></td><td valign="top"><a href="libunistring_13.html#SEC53">13.5 Case detection</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX764"><code>u8_is_casefolded</code></a></td><td valign="top"><a href="libunistring_13.html#SEC53">13.5 Case detection</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX758"><code>u8_is_lowercase</code></a></td><td valign="top"><a href="libunistring_13.html#SEC53">13.5 Case detection</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX761"><code>u8_is_titlecase</code></a></td><td valign="top"><a href="libunistring_13.html#SEC53">13.5 Case detection</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX755"><code>u8_is_uppercase</code></a></td><td valign="top"><a href="libunistring_13.html#SEC53">13.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_12.html#IDX675"><code>u8_normalize</code></a></td><td valign="top"><a href="libunistring_12.html#SEC45">12.3 Normalization of strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_12.html#IDX678"><code>u8_normcmp</code></a></td><td valign="top"><a href="libunistring_12.html#SEC46">12.4 Normalizing comparisons</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_12.html#IDX686"><code>u8_normcoll</code></a></td><td valign="top"><a href="libunistring_12.html#SEC46">12.4 Normalizing comparisons</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_12.html#IDX683"><code>u8_normxfrm</code></a></td><td valign="top"><a href="libunistring_12.html#SEC46">12.4 Normalizing comparisons</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_11.html#IDX638"><code>u8_possible_linebreaks</code></a></td><td valign="top"><a href="libunistring_11.html#SEC41">11. 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#IDX612"><code>u8_strwidth</code></a></td><td valign="top"><a href="libunistring_9.html#SEC37">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_13.html#IDX702"><code>u8_tolower</code></a></td><td valign="top"><a href="libunistring_13.html#SEC50">13.2 Case mappings of strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX705"><code>u8_totitle</code></a></td><td valign="top"><a href="libunistring_13.html#SEC50">13.2 Case mappings of strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX699"><code>u8_toupper</code></a></td><td valign="top"><a href="libunistring_13.html#SEC50">13.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#IDX609"><code>u8_width</code></a></td><td valign="top"><a href="libunistring_9.html#SEC37">9. Display width <code><uniwidth.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_11.html#IDX642"><code>u8_width_linebreaks</code></a></td><td valign="top"><a href="libunistring_11.html#SEC41">11. Line breaking <code><unilbrk.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_10.html#IDX615"><code>u8_wordbreaks</code></a></td><td valign="top"><a href="libunistring_10.html#SEC39">10.1 Word breaks in a string</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX581"><code>uc_all_blocks</code></a></td><td valign="top"><a href="libunistring_8.html#SEC34">8.10 Blocks</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX576"><code>uc_all_scripts</code></a></td><td valign="top"><a href="libunistring_8.html#SEC33">8.9 Scripts</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX402"><code>uc_bidi_category</code></a></td><td valign="top"><a href="libunistring_8.html#SEC25">8.3 Bidirectional category</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX401"><code>uc_bidi_category_byname</code></a></td><td valign="top"><a href="libunistring_8.html#SEC25">8.3 Bidirectional category</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#SEC25">8.3 Bidirectional category</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX579"><code>uc_block</code></a></td><td valign="top"><a href="libunistring_8.html#SEC34">8.10 Blocks</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX577"><code>uc_block_t</code></a></td><td valign="top"><a href="libunistring_8.html#SEC34">8.10 Blocks</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX589"><code>uc_c_ident_category</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.11 ISO C and Java syntax</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_12.html#IDX665"><code>uc_canonical_decomposition</code></a></td><td valign="top"><a href="libunistring_12.html#SEC43">12.1 Decomposition of Unicode characters</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX380"><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_12.html#IDX666"><code>uc_composition</code></a></td><td valign="top"><a href="libunistring_12.html#SEC44">12.2 Composition of Unicode characters</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX404"><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_12.html#IDX664"><code>uc_decomposition</code></a></td><td valign="top"><a href="libunistring_12.html#SEC43">12.1 Decomposition of Unicode characters</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX405"><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#IDX406"><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#IDX321"><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#IDX317"><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#IDX318"><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#IDX320"><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#IDX319"><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#IDX316"><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_8.html#IDX592"><code>uc_is_alnum</code></a></td><td valign="top"><a href="libunistring_8.html#SEC36">8.12 Classifications like in ISO C</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX593"><code>uc_is_alpha</code></a></td><td valign="top"><a href="libunistring_8.html#SEC36">8.12 Classifications like in ISO C</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX403"><code>uc_is_bidi_category</code></a></td><td valign="top"><a href="libunistring_8.html#SEC25">8.3 Bidirectional category</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX603"><code>uc_is_blank</code></a></td><td valign="top"><a href="libunistring_8.html#SEC36">8.12 Classifications like in ISO C</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX580"><code>uc_is_block</code></a></td><td valign="top"><a href="libunistring_8.html#SEC34">8.10 Blocks</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX582"><code>uc_is_c_whitespace</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.11 ISO C and Java syntax</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX594"><code>uc_is_cntrl</code></a></td><td valign="top"><a href="libunistring_8.html#SEC36">8.12 Classifications like in ISO C</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX595"><code>uc_is_digit</code></a></td><td valign="top"><a href="libunistring_8.html#SEC36">8.12 Classifications like in ISO C</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX322"><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#IDX360"><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#IDX596"><code>uc_is_graph</code></a></td><td valign="top"><a href="libunistring_8.html#SEC36">8.12 Classifications like in ISO C</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX583"><code>uc_is_java_whitespace</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.11 ISO C and Java syntax</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX597"><code>uc_is_lower</code></a></td><td valign="top"><a href="libunistring_8.html#SEC36">8.12 Classifications like in ISO C</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX598"><code>uc_is_print</code></a></td><td valign="top"><a href="libunistring_8.html#SEC36">8.12 Classifications like in ISO C</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX491"><code>uc_is_property</code></a></td><td valign="top"><a href="libunistring_8.html#SEC31">8.8.1 Properties as objects – the object oriented API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX493"><code>uc_is_property_alphabetic</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX540"><code>uc_is_property_ascii_hex_digit</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX529"><code>uc_is_property_bidi_arabic_digit</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX525"><code>uc_is_property_bidi_arabic_right_to_left</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX531"><code>uc_is_property_bidi_block_separator</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX535"><code>uc_is_property_bidi_boundary_neutral</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX530"><code>uc_is_property_bidi_common_separator</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX522"><code>uc_is_property_bidi_control</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX537"><code>uc_is_property_bidi_embedding_or_override</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX527"><code>uc_is_property_bidi_eur_num_separator</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX528"><code>uc_is_property_bidi_eur_num_terminator</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX526"><code>uc_is_property_bidi_european_digit</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX524"><code>uc_is_property_bidi_hebrew_right_to_left</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX523"><code>uc_is_property_bidi_left_to_right</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX534"><code>uc_is_property_bidi_non_spacing_mark</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX538"><code>uc_is_property_bidi_other_neutral</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX536"><code>uc_is_property_bidi_pdf</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX532"><code>uc_is_property_bidi_segment_separator</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX533"><code>uc_is_property_bidi_whitespace</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX564"><code>uc_is_property_combining</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX565"><code>uc_is_property_composite</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX559"><code>uc_is_property_currency_symbol</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX551"><code>uc_is_property_dash</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX566"><code>uc_is_property_decimal_digit</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX496"><code>uc_is_property_default_ignorable_code_point</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX498"><code>uc_is_property_deprecated</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX568"><code>uc_is_property_diacritic</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX569"><code>uc_is_property_extender</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX550"><code>uc_is_property_format_control</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX518"><code>uc_is_property_grapheme_base</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX519"><code>uc_is_property_grapheme_extend</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX521"><code>uc_is_property_grapheme_link</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX539"><code>uc_is_property_hex_digit</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX552"><code>uc_is_property_hyphen</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX511"><code>uc_is_property_id_continue</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX509"><code>uc_is_property_id_start</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX541"><code>uc_is_property_ideographic</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX544"><code>uc_is_property_ids_binary_operator</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX545"><code>uc_is_property_ids_trinary_operator</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX570"><code>uc_is_property_ignorable_control</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX549"><code>uc_is_property_iso_control</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX517"><code>uc_is_property_join_control</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX563"><code>uc_is_property_left_of_pair</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX554"><code>uc_is_property_line_separator</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX499"><code>uc_is_property_logical_order_exception</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX505"><code>uc_is_property_lowercase</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX560"><code>uc_is_property_math</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX548"><code>uc_is_property_non_break</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX495"><code>uc_is_property_not_a_character</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX567"><code>uc_is_property_numeric</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX494"><code>uc_is_property_other_alphabetic</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX497"><code>uc_is_property_other_default_ignorable_code_point</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX520"><code>uc_is_property_other_grapheme_extend</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX512"><code>uc_is_property_other_id_continue</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX510"><code>uc_is_property_other_id_start</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX506"><code>uc_is_property_other_lowercase</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX561"><code>uc_is_property_other_math</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX504"><code>uc_is_property_other_uppercase</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX562"><code>uc_is_property_paired_punctuation</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX555"><code>uc_is_property_paragraph_separator</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX516"><code>uc_is_property_pattern_syntax</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX515"><code>uc_is_property_pattern_white_space</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX501"><code>uc_is_property_private_use</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX553"><code>uc_is_property_punctuation</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX556"><code>uc_is_property_quotation_mark</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX543"><code>uc_is_property_radical</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX557"><code>uc_is_property_sentence_terminal</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX508"><code>uc_is_property_soft_dotted</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX547"><code>uc_is_property_space</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX558"><code>uc_is_property_terminal_punctuation</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX507"><code>uc_is_property_titlecase</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX502"><code>uc_is_property_unassigned_code_value</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX542"><code>uc_is_property_unified_ideograph</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX503"><code>uc_is_property_uppercase</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX500"><code>uc_is_property_variation_selector</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX492"><code>uc_is_property_white_space</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX514"><code>uc_is_property_xid_continue</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX513"><code>uc_is_property_xid_start</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX546"><code>uc_is_property_zero_width</code></a></td><td valign="top"><a href="libunistring_8.html#SEC32">8.8.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_punct</code></a></td><td valign="top"><a href="libunistring_8.html#SEC36">8.12 Classifications like in ISO C</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX575"><code>uc_is_script</code></a></td><td valign="top"><a href="libunistring_8.html#SEC33">8.9 Scripts</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX600"><code>uc_is_space</code></a></td><td valign="top"><a href="libunistring_8.html#SEC36">8.12 Classifications like in ISO C</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX601"><code>uc_is_upper</code></a></td><td valign="top"><a href="libunistring_8.html#SEC36">8.12 Classifications like in ISO C</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX602"><code>uc_is_xdigit</code></a></td><td valign="top"><a href="libunistring_8.html#SEC36">8.12 Classifications like in ISO C</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX591"><code>uc_java_ident_category</code></a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.11 ISO C and Java syntax</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX698"><code>uc_locale_language</code></a></td><td valign="top"><a href="libunistring_13.html#SEC50">13.2 Case mappings of strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX408"><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#IDX407"><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#IDX489"><code>uc_property_byname</code></a></td><td valign="top"><a href="libunistring_8.html#SEC31">8.8.1 Properties as objects – the object oriented API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX490"><code>uc_property_is_valid</code></a></td><td valign="top"><a href="libunistring_8.html#SEC31">8.8.1 Properties as objects – the object oriented API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX409"><code>uc_property_t</code></a></td><td valign="top"><a href="libunistring_8.html#SEC31">8.8.1 Properties as objects – the object oriented API</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX573"><code>uc_script</code></a></td><td valign="top"><a href="libunistring_8.html#SEC33">8.9 Scripts</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX574"><code>uc_script_byname</code></a></td><td valign="top"><a href="libunistring_8.html#SEC33">8.9 Scripts</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX571"><code>uc_script_t</code></a></td><td valign="top"><a href="libunistring_8.html#SEC33">8.9 Scripts</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX695"><code>uc_tolower</code></a></td><td valign="top"><a href="libunistring_13.html#SEC49">13.1 Case mappings of characters</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX696"><code>uc_totitle</code></a></td><td valign="top"><a href="libunistring_13.html#SEC49">13.1 Case mappings of characters</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX694"><code>uc_toupper</code></a></td><td valign="top"><a href="libunistring_13.html#SEC49">13.1 Case mappings of characters</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_9.html#IDX608"><code>uc_width</code></a></td><td valign="top"><a href="libunistring_9.html#SEC37">9. Display width <code><uniwidth.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_10.html#IDX632"><code>uc_wordbreak_property</code></a></td><td valign="top"><a href="libunistring_10.html#SEC40">10.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_13.html#IDX742"><code>ulc_casecmp</code></a></td><td valign="top"><a href="libunistring_13.html#SEC52">13.4 Case insensitive comparison</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX754"><code>ulc_casecoll</code></a></td><td valign="top"><a href="libunistring_13.html#SEC52">13.4 Case insensitive comparison</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#IDX750"><code>ulc_casexfrm</code></a></td><td valign="top"><a href="libunistring_13.html#SEC52">13.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_11.html#IDX641"><code>ulc_possible_linebreaks</code></a></td><td valign="top"><a href="libunistring_11.html#SEC41">11. 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_11.html#IDX645"><code>ulc_width_linebreaks</code></a></td><td valign="top"><a href="libunistring_11.html#SEC41">11. Line breaking <code><unilbrk.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_10.html#IDX618"><code>ulc_wordbreaks</code></a></td><td valign="top"><a href="libunistring_10.html#SEC39">10.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, bidirectional category</a></td><td valign="top"><a href="libunistring_8.html#SEC25">8.3 Bidirectional category</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX578">Unicode character, block</a></td><td valign="top"><a href="libunistring_8.html#SEC34">8.10 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_13.html#SEC49">Unicode character, case mappings</a></td><td valign="top"><a href="libunistring_13.html#SEC49">13.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#SEC36">Unicode character, classification like in C</a></td><td valign="top"><a href="libunistring_8.html#SEC36">8.12 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#SEC30">Unicode character, properties</a></td><td valign="top"><a href="libunistring_8.html#SEC30">8.8 Properties</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX572">Unicode character, script</a></td><td valign="top"><a href="libunistring_8.html#SEC33">8.9 Scripts</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX588">Unicode character, validity in C identifiers</a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.11 ISO C and Java syntax</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_8.html#IDX590">Unicode character, validity in Java identifiers</a></td><td valign="top"><a href="libunistring_8.html#SEC35">8.11 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#IDX605">Unicode character, width</a></td><td valign="top"><a href="libunistring_9.html#SEC37">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_12.html#IDX674"><code>uninorm_decomposing_form</code></a></td><td valign="top"><a href="libunistring_12.html#SEC45">12.3 Normalization of strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_12.html#IDX690"><code>uninorm_filter_create</code></a></td><td valign="top"><a href="libunistring_12.html#SEC47">12.5 Normalization of streams of Unicode characters</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_12.html#IDX692"><code>uninorm_filter_flush</code></a></td><td valign="top"><a href="libunistring_12.html#SEC47">12.5 Normalization of streams of Unicode characters</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_12.html#IDX693"><code>uninorm_filter_free</code></a></td><td valign="top"><a href="libunistring_12.html#SEC47">12.5 Normalization of streams of Unicode characters</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_12.html#IDX691"><code>uninorm_filter_write</code></a></td><td valign="top"><a href="libunistring_12.html#SEC47">12.5 Normalization of streams of Unicode characters</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_12.html#IDX672"><code>uninorm_is_compat_decomposing</code></a></td><td valign="top"><a href="libunistring_12.html#SEC45">12.3 Normalization of strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_12.html#IDX673"><code>uninorm_is_composing</code></a></td><td valign="top"><a href="libunistring_12.html#SEC45">12.3 Normalization of strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_12.html#IDX667"><code>uninorm_t</code></a></td><td valign="top"><a href="libunistring_12.html#SEC45">12.3 Normalization of strings</a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_13.html#SEC50">uppercasing</a></td><td valign="top"><a href="libunistring_13.html#SEC50">13.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="#SEC71_0" class="summary-letter"><b>A</b></a> - -<a href="#SEC71_1" class="summary-letter"><b>B</b></a> - -<a href="#SEC71_2" class="summary-letter"><b>C</b></a> - -<a href="#SEC71_3" class="summary-letter"><b>D</b></a> - -<a href="#SEC71_4" class="summary-letter"><b>E</b></a> - -<a href="#SEC71_5" class="summary-letter"><b>F</b></a> - -<a href="#SEC71_6" class="summary-letter"><b>G</b></a> - -<a href="#SEC71_7" class="summary-letter"><b>H</b></a> - -<a href="#SEC71_8" class="summary-letter"><b>I</b></a> - -<a href="#SEC71_9" class="summary-letter"><b>J</b></a> - -<a href="#SEC71_10" class="summary-letter"><b>L</b></a> - -<a href="#SEC71_11" class="summary-letter"><b>M</b></a> - -<a href="#SEC71_12" class="summary-letter"><b>N</b></a> - -<a href="#SEC71_13" class="summary-letter"><b>O</b></a> - -<a href="#SEC71_14" class="summary-letter"><b>P</b></a> - -<a href="#SEC71_15" class="summary-letter"><b>R</b></a> - -<a href="#SEC71_16" class="summary-letter"><b>S</b></a> - -<a href="#SEC71_17" class="summary-letter"><b>T</b></a> - -<a href="#SEC71_18" class="summary-letter"><b>U</b></a> - -<a href="libunistring_19.html#INDEX0_0" class="summary-letter"><b>V</b></a> - -<a href="libunistring_19.html#INDEX0_1" class="summary-letter"><b>W</b></a> - -</td></tr></table> +<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> +<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="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> + +<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_17.html#SEC62" title="Beginning of this chapter or previous chapter"> << </a>]</td> -<td valign="middle" align="left">[<a href="libunistring_19.html#INDEX0" title="Next chapter"> >> </a>]</td> +<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> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> @@ -756,12 +1512,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="#SEC71" title="Index">Index</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_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <p> <font size="-1"> - This document was generated by <em>Bruno Haible</em> on <em>March, 30 2010</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>July, 8 2015</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 bd513cc8..e9c32b3f 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 March, 30 2010 by texi2html 1.78a --> +<!-- Created on July, 8 2015 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_18.html#SEC71" 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_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> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> @@ -51,122 +51,750 @@ 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_18.html#SEC71" title="Index">Index</a>]</td> +<td valign="middle" align="left">[<a href="#SEC77" 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_18.html#SEC71_0" class="summary-letter"><b>A</b></a> +<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="libunistring_18.html#SEC71_1" class="summary-letter"><b>B</b></a> +<a href="#SEC77_1" class="summary-letter"><b>B</b></a> -<a href="libunistring_18.html#SEC71_2" class="summary-letter"><b>C</b></a> +<a href="#SEC77_2" class="summary-letter"><b>C</b></a> -<a href="libunistring_18.html#SEC71_3" class="summary-letter"><b>D</b></a> +<a href="#SEC77_3" class="summary-letter"><b>D</b></a> -<a href="libunistring_18.html#SEC71_4" class="summary-letter"><b>E</b></a> +<a href="#SEC77_4" class="summary-letter"><b>E</b></a> -<a href="libunistring_18.html#SEC71_5" class="summary-letter"><b>F</b></a> +<a href="#SEC77_5" class="summary-letter"><b>F</b></a> -<a href="libunistring_18.html#SEC71_6" class="summary-letter"><b>G</b></a> +<a href="#SEC77_6" class="summary-letter"><b>G</b></a> -<a href="libunistring_18.html#SEC71_7" class="summary-letter"><b>H</b></a> +<a href="#SEC77_7" class="summary-letter"><b>H</b></a> -<a href="libunistring_18.html#SEC71_8" class="summary-letter"><b>I</b></a> +<a href="#SEC77_8" class="summary-letter"><b>I</b></a> -<a href="libunistring_18.html#SEC71_9" class="summary-letter"><b>J</b></a> +<a href="#SEC77_9" class="summary-letter"><b>J</b></a> -<a href="libunistring_18.html#SEC71_10" class="summary-letter"><b>L</b></a> +<a href="#SEC77_10" class="summary-letter"><b>L</b></a> -<a href="libunistring_18.html#SEC71_11" class="summary-letter"><b>M</b></a> +<a href="#SEC77_11" class="summary-letter"><b>M</b></a> -<a href="libunistring_18.html#SEC71_12" class="summary-letter"><b>N</b></a> +<a href="#SEC77_12" class="summary-letter"><b>N</b></a> -<a href="libunistring_18.html#SEC71_13" class="summary-letter"><b>O</b></a> +<a href="#SEC77_13" class="summary-letter"><b>O</b></a> -<a href="libunistring_18.html#SEC71_14" class="summary-letter"><b>P</b></a> +<a href="#SEC77_14" class="summary-letter"><b>P</b></a> -<a href="libunistring_18.html#SEC71_15" class="summary-letter"><b>R</b></a> +<a href="#SEC77_15" class="summary-letter"><b>R</b></a> -<a href="libunistring_18.html#SEC71_16" class="summary-letter"><b>S</b></a> +<a href="#SEC77_16" class="summary-letter"><b>S</b></a> -<a href="libunistring_18.html#SEC71_17" class="summary-letter"><b>T</b></a> +<a href="#SEC77_17" class="summary-letter"><b>T</b></a> -<a href="libunistring_18.html#SEC71_18" class="summary-letter"><b>U</b></a> +<a href="#SEC77_18" class="summary-letter"><b>U</b></a> -<a href="#INDEX0_0" class="summary-letter"><b>V</b></a> +<a href="libunistring_20.html#INDEX0_0" class="summary-letter"><b>V</b></a> -<a href="#INDEX0_1" class="summary-letter"><b>W</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="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><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#IDX829"><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#IDX837"><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#IDX864">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#IDX866">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#IDX802">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#IDX865">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#IDX803">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#IDX867">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#IDX892">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#IDX895"><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#IDX891">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="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_9.html#SEC37">width</a></td><td valign="top"><a href="libunistring_9.html#SEC37">9. Display width <code><uniwidth.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_10.html#SEC38">word breaks</a></td><td valign="top"><a href="libunistring_10.html#SEC38">10. Word breaks in strings <code><uniwbrk.h></code></a></td></tr> -<tr><td></td><td valign="top"><a href="libunistring_11.html#SEC41">wrapping</a></td><td valign="top"><a href="libunistring_11.html#SEC41">11. Line breaking <code><unilbrk.h></code></a></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#IDX818">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#IDX896">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#IDX810"><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#IDX861"><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#IDX873"><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#IDX855"><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#IDX869"><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#IDX832"><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#IDX835"><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#IDX840"><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#IDX843"><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#IDX858"><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#IDX849"><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#IDX852"><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#IDX846"><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#IDX889"><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#IDX886"><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#IDX880"><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#IDX883"><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#IDX877"><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#IDX797"><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#IDX800"><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#IDX808"><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#IDX805"><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#IDX760"><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#IDX824"><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#IDX827"><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#IDX821"><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#IDX764"><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#IDX737"><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#IDX862"><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#IDX874"><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#IDX856"><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#IDX870"><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#IDX833"><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#IDX836"><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#IDX841"><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#IDX844"><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#IDX859"><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#IDX850"><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#IDX853"><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#IDX847"><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#IDX890"><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#IDX887"><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#IDX881"><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#IDX884"><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#IDX878"><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#IDX798"><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#IDX801"><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#IDX809"><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#IDX806"><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#IDX761"><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#IDX825"><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#IDX828"><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#IDX822"><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#IDX765"><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#IDX738"><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#IDX860"><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#IDX872"><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#IDX854"><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#IDX868"><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#IDX831"><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#IDX834"><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#IDX839"><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#IDX842"><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#IDX857"><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#IDX848"><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#IDX851"><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#IDX845"><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#IDX888"><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#IDX885"><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#IDX879"><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#IDX882"><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#IDX876"><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#IDX796"><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#IDX799"><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#IDX807"><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#IDX804"><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#IDX759"><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#IDX823"><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#IDX826"><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#IDX820"><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#IDX763"><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#IDX736"><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#IDX786"><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#IDX787"><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#IDX785"><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#IDX734"><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#IDX735"><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#IDX819"><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#IDX816"><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#IDX817"><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#IDX815"><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#IDX753"><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#IDX863"><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#IDX875"><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#IDX871"><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#IDX762"><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#IDX766"><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#IDX739"><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#IDX795"><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#IDX811"><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#IDX813"><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#IDX814"><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#IDX812"><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#IDX793"><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#IDX794"><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#IDX788"><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="libunistring_18.html#SEC71_0" class="summary-letter"><b>A</b></a> +<table><tr><th valign="top">Jump to: </th><td><a href="#SEC77_0" class="summary-letter"><b>A</b></a> -<a href="libunistring_18.html#SEC71_1" class="summary-letter"><b>B</b></a> +<a href="#SEC77_1" class="summary-letter"><b>B</b></a> -<a href="libunistring_18.html#SEC71_2" class="summary-letter"><b>C</b></a> +<a href="#SEC77_2" class="summary-letter"><b>C</b></a> -<a href="libunistring_18.html#SEC71_3" class="summary-letter"><b>D</b></a> +<a href="#SEC77_3" class="summary-letter"><b>D</b></a> -<a href="libunistring_18.html#SEC71_4" class="summary-letter"><b>E</b></a> +<a href="#SEC77_4" class="summary-letter"><b>E</b></a> -<a href="libunistring_18.html#SEC71_5" class="summary-letter"><b>F</b></a> +<a href="#SEC77_5" class="summary-letter"><b>F</b></a> -<a href="libunistring_18.html#SEC71_6" class="summary-letter"><b>G</b></a> +<a href="#SEC77_6" class="summary-letter"><b>G</b></a> -<a href="libunistring_18.html#SEC71_7" class="summary-letter"><b>H</b></a> +<a href="#SEC77_7" class="summary-letter"><b>H</b></a> -<a href="libunistring_18.html#SEC71_8" class="summary-letter"><b>I</b></a> +<a href="#SEC77_8" class="summary-letter"><b>I</b></a> -<a href="libunistring_18.html#SEC71_9" class="summary-letter"><b>J</b></a> +<a href="#SEC77_9" class="summary-letter"><b>J</b></a> -<a href="libunistring_18.html#SEC71_10" class="summary-letter"><b>L</b></a> +<a href="#SEC77_10" class="summary-letter"><b>L</b></a> -<a href="libunistring_18.html#SEC71_11" class="summary-letter"><b>M</b></a> +<a href="#SEC77_11" class="summary-letter"><b>M</b></a> -<a href="libunistring_18.html#SEC71_12" class="summary-letter"><b>N</b></a> +<a href="#SEC77_12" class="summary-letter"><b>N</b></a> -<a href="libunistring_18.html#SEC71_13" class="summary-letter"><b>O</b></a> +<a href="#SEC77_13" class="summary-letter"><b>O</b></a> -<a href="libunistring_18.html#SEC71_14" class="summary-letter"><b>P</b></a> +<a href="#SEC77_14" class="summary-letter"><b>P</b></a> -<a href="libunistring_18.html#SEC71_15" class="summary-letter"><b>R</b></a> +<a href="#SEC77_15" class="summary-letter"><b>R</b></a> -<a href="libunistring_18.html#SEC71_16" class="summary-letter"><b>S</b></a> +<a href="#SEC77_16" class="summary-letter"><b>S</b></a> -<a href="libunistring_18.html#SEC71_17" class="summary-letter"><b>T</b></a> +<a href="#SEC77_17" class="summary-letter"><b>T</b></a> -<a href="libunistring_18.html#SEC71_18" class="summary-letter"><b>U</b></a> +<a href="#SEC77_18" class="summary-letter"><b>U</b></a> -<a href="#INDEX0_0" class="summary-letter"><b>V</b></a> +<a href="libunistring_20.html#INDEX0_0" class="summary-letter"><b>V</b></a> -<a href="#INDEX0_1" class="summary-letter"><b>W</b></a> +<a href="libunistring_20.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_18.html#SEC71" 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_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> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> @@ -174,12 +802,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_18.html#SEC71" title="Index">Index</a>]</td> +<td valign="middle" align="left">[<a href="#SEC77" 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>Bruno Haible</em> on <em>March, 30 2010</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>July, 8 2015</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 f90fd553..539a68a7 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 March, 30 2010 by texi2html 1.78a --> +<!-- Created on July, 8 2015 by texi2html 1.78a --> <!-- Written by: Lionel Cons <Lionel.Cons@cern.ch> (original author) Karl Berry <karl@freefriends.org> @@ -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_18.html#SEC71" title="Index">Index</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_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> @@ -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_18.html#SEC71" title="Index">Index</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_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <p> <font size="-1"> - This document was generated by <em>Bruno Haible</em> on <em>March, 30 2010</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>July, 8 2015</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 new file mode 100644 index 00000000..841a6d43 --- /dev/null +++ b/doc/libunistring_20.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 July, 8 2015 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_19.html#SEC77" 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_19.html#SEC77" 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 href="libunistring_19.html#SEC77_1" class="summary-letter"><b>B</b></a> + +<a href="libunistring_19.html#SEC77_2" class="summary-letter"><b>C</b></a> + +<a href="libunistring_19.html#SEC77_3" class="summary-letter"><b>D</b></a> + +<a href="libunistring_19.html#SEC77_4" class="summary-letter"><b>E</b></a> + +<a href="libunistring_19.html#SEC77_5" class="summary-letter"><b>F</b></a> + +<a href="libunistring_19.html#SEC77_6" class="summary-letter"><b>G</b></a> + +<a href="libunistring_19.html#SEC77_7" class="summary-letter"><b>H</b></a> + +<a href="libunistring_19.html#SEC77_8" class="summary-letter"><b>I</b></a> + +<a href="libunistring_19.html#SEC77_9" class="summary-letter"><b>J</b></a> + +<a href="libunistring_19.html#SEC77_10" class="summary-letter"><b>L</b></a> + +<a href="libunistring_19.html#SEC77_11" class="summary-letter"><b>M</b></a> + +<a href="libunistring_19.html#SEC77_12" class="summary-letter"><b>N</b></a> + +<a href="libunistring_19.html#SEC77_13" class="summary-letter"><b>O</b></a> + +<a href="libunistring_19.html#SEC77_14" class="summary-letter"><b>P</b></a> + +<a href="libunistring_19.html#SEC77_15" class="summary-letter"><b>R</b></a> + +<a href="libunistring_19.html#SEC77_16" class="summary-letter"><b>S</b></a> + +<a href="libunistring_19.html#SEC77_17" class="summary-letter"><b>T</b></a> + +<a href="libunistring_19.html#SEC77_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#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><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> + +<a href="libunistring_19.html#SEC77_1" class="summary-letter"><b>B</b></a> + +<a href="libunistring_19.html#SEC77_2" class="summary-letter"><b>C</b></a> + +<a href="libunistring_19.html#SEC77_3" class="summary-letter"><b>D</b></a> + +<a href="libunistring_19.html#SEC77_4" class="summary-letter"><b>E</b></a> + +<a href="libunistring_19.html#SEC77_5" class="summary-letter"><b>F</b></a> + +<a href="libunistring_19.html#SEC77_6" class="summary-letter"><b>G</b></a> + +<a href="libunistring_19.html#SEC77_7" class="summary-letter"><b>H</b></a> + +<a href="libunistring_19.html#SEC77_8" class="summary-letter"><b>I</b></a> + +<a href="libunistring_19.html#SEC77_9" class="summary-letter"><b>J</b></a> + +<a href="libunistring_19.html#SEC77_10" class="summary-letter"><b>L</b></a> + +<a href="libunistring_19.html#SEC77_11" class="summary-letter"><b>M</b></a> + +<a href="libunistring_19.html#SEC77_12" class="summary-letter"><b>N</b></a> + +<a href="libunistring_19.html#SEC77_13" class="summary-letter"><b>O</b></a> + +<a href="libunistring_19.html#SEC77_14" class="summary-letter"><b>P</b></a> + +<a href="libunistring_19.html#SEC77_15" class="summary-letter"><b>R</b></a> + +<a href="libunistring_19.html#SEC77_16" class="summary-letter"><b>S</b></a> + +<a href="libunistring_19.html#SEC77_17" class="summary-letter"><b>T</b></a> + +<a href="libunistring_19.html#SEC77_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_19.html#SEC77" 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_19.html#SEC77" 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>July, 8 2015</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 f86bf871..4cb35974 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 March, 30 2010 by texi2html 1.78a --> +<!-- Created on July, 8 2015 by texi2html 1.78a --> <!-- Written by: Lionel Cons <Lionel.Cons@cern.ch> (original author) Karl Berry <karl@freefriends.org> @@ -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_18.html#SEC71" title="Index">Index</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_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> @@ -93,12 +93,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_18.html#SEC71" title="Index">Index</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_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <p> <font size="-1"> - This document was generated by <em>Bruno Haible</em> on <em>March, 30 2010</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>July, 8 2015</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 b00d3a65..2bc2ee35 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 March, 30 2010 by texi2html 1.78a --> +<!-- Created on July, 8 2015 by texi2html 1.78a --> <!-- Written by: Lionel Cons <Lionel.Cons@cern.ch> (original author) Karl Berry <karl@freefriends.org> @@ -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_18.html#SEC71" title="Index">Index</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_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> @@ -467,8 +467,10 @@ character in a Unicode string. <a name="IDX84"></a> </dt> <dd><p>Backward iteration step. Advances the pointer to point to the previous -character, or returns NULL if the beginning of the string had been reached. +character (the one that ends at <code><var>s</var></code>), or returns NULL if the +beginning of the string (specified by <code><var>start</var></code>) had been reached. Puts the character's <code>ucs4_t</code> representation in <code>*<var>puc</var></code>. +Note that this function works only on well-formed Unicode strings. </p></dd></dl> <p>The following functions determine the length of a Unicode string. @@ -652,7 +654,7 @@ 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_12.html#SEC42">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#SEC48">Normalization forms (composition and decomposition) <code><uninorm.h></code></a>. </p></dd></dl> <dl> @@ -853,12 +855,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_18.html#SEC71" title="Index">Index</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_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <p> <font size="-1"> - This document was generated by <em>Bruno Haible</em> on <em>March, 30 2010</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>July, 8 2015</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 313b0632..3d4c477a 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 March, 30 2010 by texi2html 1.78a --> +<!-- Created on July, 8 2015 by texi2html 1.78a --> <!-- Written by: Lionel Cons <Lionel.Cons@cern.ch> (original author) Karl Berry <karl@freefriends.org> @@ -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_18.html#SEC71" title="Index">Index</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_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> @@ -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_18.html#SEC71" title="Index">Index</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_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <p> <font size="-1"> - This document was generated by <em>Bruno Haible</em> on <em>March, 30 2010</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>July, 8 2015</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 2ec4ddb6..9a6320b3 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 March, 30 2010 by texi2html 1.78a --> +<!-- Created on July, 8 2015 by texi2html 1.78a --> <!-- Written by: Lionel Cons <Lionel.Cons@cern.ch> (original author) Karl Berry <karl@freefriends.org> @@ -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_18.html#SEC71" title="Index">Index</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_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> @@ -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_18.html#SEC71" title="Index">Index</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_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <p> <font size="-1"> - This document was generated by <em>Bruno Haible</em> on <em>March, 30 2010</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>July, 8 2015</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 c1ac3ebb..b309c6bc 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 March, 30 2010 by texi2html 1.78a --> +<!-- Created on July, 8 2015 by texi2html 1.78a --> <!-- Written by: Lionel Cons <Lionel.Cons@cern.ch> (original author) Karl Berry <karl@freefriends.org> @@ -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_18.html#SEC71" title="Index">Index</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_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> @@ -90,7 +90,8 @@ Returns the filled <var>buf</var>, or NULL if the character does not have a name <a name="IDX239"></a> </dt> <dd><p>Looks up the Unicode character with a given name, in upper- or lowercase -ASCII. Returns the character if found, or <code>UNINAME_INVALID</code> if not found. +ASCII. <var>NAME</var> can also be an alias name of a character. +Returns the character if found, or <code>UNINAME_INVALID</code> if not found. </p></dd></dl> <dl> @@ -111,12 +112,12 @@ ASCII. Returns the character if found, or <code>UNINAME_INVALID</code> if not f <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_18.html#SEC71" title="Index">Index</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_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <p> <font size="-1"> - This document was generated by <em>Bruno Haible</em> on <em>March, 30 2010</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>July, 8 2015</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 b2887125..d815ae48 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 March, 30 2010 by texi2html 1.78a --> +<!-- Created on July, 8 2015 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_7.html#SEC19" title="Beginning of this chapter or previous chapter"> << </a>]</td> -<td valign="middle" align="left">[<a href="libunistring_9.html#SEC37" title="Next chapter"> >> </a>]</td> +<td valign="middle" align="left">[<a href="libunistring_9.html#SEC40" 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_18.html#SEC71" title="Index">Index</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_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> @@ -113,359 +113,369 @@ categories may be added in the future. <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_Lu</b> +<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_Ll</b> +<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_Lt</b> +<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_Lm</b> +<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_Lo</b> +<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_M</b> +<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_Mn</b> +<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_Mc</b> +<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_Me</b> +<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_N</b> +<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_Nd</b> +<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_Nl</b> +<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_No</b> +<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_P</b> +<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_Pc</b> +<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_Pd</b> +<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_Ps</b> +<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_Pe</b> +<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_Pi</b> +<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_Pf</b> +<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_Po</b> +<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_S</b> +<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_Sm</b> +<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_Sc</b> +<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_Sk</b> +<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_So</b> +<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_Sk</b> <a name="IDX268"></a> </dt> -<dt><u>Constant:</u> uc_general_category_t <b>UC_CATEGORY_Z</b> +<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_Zs</b> +<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_Zl</b> +<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_Zp</b> +<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_C</b> +<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_Cc</b> +<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_Cf</b> +<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_Cs</b> +<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_Co</b> +<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_Cn</b> +<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="IDX279"></a> +<a name="IDX280"></a> </dt> <dd><p>This is another name for <code>UC_CATEGORY_L</code>. </p></dd></dl> <dl> +<dt><u>Macro:</u> uc_general_category_t <b>UC_CASED_LETTER</b> +<a name="IDX281"></a> +</dt> +<dd><p>This is another name for <code>UC_CATEGORY_LC</code>. +</p></dd></dl> + +<dl> <dt><u>Macro:</u> uc_general_category_t <b>UC_UPPERCASE_LETTER</b> -<a name="IDX280"></a> +<a name="IDX282"></a> </dt> <dd><p>This is another name for <code>UC_CATEGORY_Lu</code>. </p></dd></dl> <dl> <dt><u>Macro:</u> uc_general_category_t <b>UC_LOWERCASE_LETTER</b> -<a name="IDX281"></a> +<a name="IDX283"></a> </dt> <dd><p>This is another name for <code>UC_CATEGORY_Ll</code>. </p></dd></dl> <dl> <dt><u>Macro:</u> uc_general_category_t <b>UC_TITLECASE_LETTER</b> -<a name="IDX282"></a> +<a name="IDX284"></a> </dt> <dd><p>This is another name for <code>UC_CATEGORY_Lt</code>. </p></dd></dl> <dl> <dt><u>Macro:</u> uc_general_category_t <b>UC_MODIFIER_LETTER</b> -<a name="IDX283"></a> +<a name="IDX285"></a> </dt> <dd><p>This is another name for <code>UC_CATEGORY_Lm</code>. </p></dd></dl> <dl> <dt><u>Macro:</u> uc_general_category_t <b>UC_OTHER_LETTER</b> -<a name="IDX284"></a> +<a name="IDX286"></a> </dt> <dd><p>This is another name for <code>UC_CATEGORY_Lo</code>. </p></dd></dl> <dl> <dt><u>Macro:</u> uc_general_category_t <b>UC_MARK</b> -<a name="IDX285"></a> +<a name="IDX287"></a> </dt> <dd><p>This is another name for <code>UC_CATEGORY_M</code>. </p></dd></dl> <dl> <dt><u>Macro:</u> uc_general_category_t <b>UC_NON_SPACING_MARK</b> -<a name="IDX286"></a> +<a name="IDX288"></a> </dt> <dd><p>This is another name for <code>UC_CATEGORY_Mn</code>. </p></dd></dl> <dl> <dt><u>Macro:</u> uc_general_category_t <b>UC_COMBINING_SPACING_MARK</b> -<a name="IDX287"></a> +<a name="IDX289"></a> </dt> <dd><p>This is another name for <code>UC_CATEGORY_Mc</code>. </p></dd></dl> <dl> <dt><u>Macro:</u> uc_general_category_t <b>UC_ENCLOSING_MARK</b> -<a name="IDX288"></a> +<a name="IDX290"></a> </dt> <dd><p>This is another name for <code>UC_CATEGORY_Me</code>. </p></dd></dl> <dl> <dt><u>Macro:</u> uc_general_category_t <b>UC_NUMBER</b> -<a name="IDX289"></a> +<a name="IDX291"></a> </dt> <dd><p>This is another name for <code>UC_CATEGORY_N</code>. </p></dd></dl> <dl> <dt><u>Macro:</u> uc_general_category_t <b>UC_DECIMAL_DIGIT_NUMBER</b> -<a name="IDX290"></a> +<a name="IDX292"></a> </dt> <dd><p>This is another name for <code>UC_CATEGORY_Nd</code>. </p></dd></dl> <dl> <dt><u>Macro:</u> uc_general_category_t <b>UC_LETTER_NUMBER</b> -<a name="IDX291"></a> +<a name="IDX293"></a> </dt> <dd><p>This is another name for <code>UC_CATEGORY_Nl</code>. </p></dd></dl> <dl> <dt><u>Macro:</u> uc_general_category_t <b>UC_OTHER_NUMBER</b> -<a name="IDX292"></a> +<a name="IDX294"></a> </dt> <dd><p>This is another name for <code>UC_CATEGORY_No</code>. </p></dd></dl> <dl> <dt><u>Macro:</u> uc_general_category_t <b>UC_PUNCTUATION</b> -<a name="IDX293"></a> +<a name="IDX295"></a> </dt> <dd><p>This is another name for <code>UC_CATEGORY_P</code>. </p></dd></dl> <dl> <dt><u>Macro:</u> uc_general_category_t <b>UC_CONNECTOR_PUNCTUATION</b> -<a name="IDX294"></a> +<a name="IDX296"></a> </dt> <dd><p>This is another name for <code>UC_CATEGORY_Pc</code>. </p></dd></dl> <dl> <dt><u>Macro:</u> uc_general_category_t <b>UC_DASH_PUNCTUATION</b> -<a name="IDX295"></a> +<a name="IDX297"></a> </dt> <dd><p>This is another name for <code>UC_CATEGORY_Pd</code>. </p></dd></dl> <dl> <dt><u>Macro:</u> uc_general_category_t <b>UC_OPEN_PUNCTUATION</b> -<a name="IDX296"></a> +<a name="IDX298"></a> </dt> <dd><p>This is another name for <code>UC_CATEGORY_Ps</code> (“start punctuation”). </p></dd></dl> <dl> <dt><u>Macro:</u> uc_general_category_t <b>UC_CLOSE_PUNCTUATION</b> -<a name="IDX297"></a> +<a name="IDX299"></a> </dt> <dd><p>This is another name for <code>UC_CATEGORY_Pe</code> (“end punctuation”). </p></dd></dl> <dl> <dt><u>Macro:</u> uc_general_category_t <b>UC_INITIAL_QUOTE_PUNCTUATION</b> -<a name="IDX298"></a> +<a name="IDX300"></a> </dt> <dd><p>This is another name for <code>UC_CATEGORY_Pi</code>. </p></dd></dl> <dl> <dt><u>Macro:</u> uc_general_category_t <b>UC_FINAL_QUOTE_PUNCTUATION</b> -<a name="IDX299"></a> +<a name="IDX301"></a> </dt> <dd><p>This is another name for <code>UC_CATEGORY_Pf</code>. </p></dd></dl> <dl> <dt><u>Macro:</u> uc_general_category_t <b>UC_OTHER_PUNCTUATION</b> -<a name="IDX300"></a> +<a name="IDX302"></a> </dt> <dd><p>This is another name for <code>UC_CATEGORY_Po</code>. </p></dd></dl> <dl> <dt><u>Macro:</u> uc_general_category_t <b>UC_SYMBOL</b> -<a name="IDX301"></a> +<a name="IDX303"></a> </dt> <dd><p>This is another name for <code>UC_CATEGORY_S</code>. </p></dd></dl> <dl> <dt><u>Macro:</u> uc_general_category_t <b>UC_MATH_SYMBOL</b> -<a name="IDX302"></a> +<a name="IDX304"></a> </dt> <dd><p>This is another name for <code>UC_CATEGORY_Sm</code>. </p></dd></dl> <dl> <dt><u>Macro:</u> uc_general_category_t <b>UC_CURRENCY_SYMBOL</b> -<a name="IDX303"></a> +<a name="IDX305"></a> </dt> <dd><p>This is another name for <code>UC_CATEGORY_Sc</code>. </p></dd></dl> <dl> <dt><u>Macro:</u> uc_general_category_t <b>UC_MODIFIER_SYMBOL</b> -<a name="IDX304"></a> +<a name="IDX306"></a> </dt> <dd><p>This is another name for <code>UC_CATEGORY_Sk</code>. </p></dd></dl> <dl> <dt><u>Macro:</u> uc_general_category_t <b>UC_OTHER_SYMBOL</b> -<a name="IDX305"></a> +<a name="IDX307"></a> </dt> <dd><p>This is another name for <code>UC_CATEGORY_So</code>. </p></dd></dl> <dl> <dt><u>Macro:</u> uc_general_category_t <b>UC_SEPARATOR</b> -<a name="IDX306"></a> +<a name="IDX308"></a> </dt> <dd><p>This is another name for <code>UC_CATEGORY_Z</code>. </p></dd></dl> <dl> <dt><u>Macro:</u> uc_general_category_t <b>UC_SPACE_SEPARATOR</b> -<a name="IDX307"></a> +<a name="IDX309"></a> </dt> <dd><p>This is another name for <code>UC_CATEGORY_Zs</code>. </p></dd></dl> <dl> <dt><u>Macro:</u> uc_general_category_t <b>UC_LINE_SEPARATOR</b> -<a name="IDX308"></a> +<a name="IDX310"></a> </dt> <dd><p>This is another name for <code>UC_CATEGORY_Zl</code>. </p></dd></dl> <dl> <dt><u>Macro:</u> uc_general_category_t <b>UC_PARAGRAPH_SEPARATOR</b> -<a name="IDX309"></a> +<a name="IDX311"></a> </dt> <dd><p>This is another name for <code>UC_CATEGORY_Zp</code>. </p></dd></dl> <dl> <dt><u>Macro:</u> uc_general_category_t <b>UC_OTHER</b> -<a name="IDX310"></a> +<a name="IDX312"></a> </dt> <dd><p>This is another name for <code>UC_CATEGORY_C</code>. </p></dd></dl> <dl> <dt><u>Macro:</u> uc_general_category_t <b>UC_CONTROL</b> -<a name="IDX311"></a> +<a name="IDX313"></a> </dt> <dd><p>This is another name for <code>UC_CATEGORY_Cc</code>. </p></dd></dl> <dl> <dt><u>Macro:</u> uc_general_category_t <b>UC_FORMAT</b> -<a name="IDX312"></a> +<a name="IDX314"></a> </dt> <dd><p>This is another name for <code>UC_CATEGORY_Cf</code>. </p></dd></dl> <dl> <dt><u>Macro:</u> uc_general_category_t <b>UC_SURROGATE</b> -<a name="IDX313"></a> +<a name="IDX315"></a> </dt> <dd><p>This is another name for <code>UC_CATEGORY_Cs</code>. All code points in this category are invalid characters. @@ -473,14 +483,14 @@ category are invalid characters. <dl> <dt><u>Macro:</u> uc_general_category_t <b>UC_PRIVATE_USE</b> -<a name="IDX314"></a> +<a name="IDX316"></a> </dt> <dd><p>This is another name for <code>UC_CATEGORY_Co</code>. </p></dd></dl> <dl> <dt><u>Macro:</u> uc_general_category_t <b>UC_UNASSIGNED</b> -<a name="IDX315"></a> +<a name="IDX317"></a> </dt> <dd><p>This is another name for <code>UC_CATEGORY_Cn</code>. Some code points in this category are invalid characters. @@ -491,7 +501,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="IDX316"></a> +<a name="IDX318"></a> </dt> <dd><p>Returns the union of two general categories. This corresponds to the unions of the two sets of characters. @@ -499,7 +509,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="IDX317"></a> +<a name="IDX319"></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 @@ -508,7 +518,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="IDX318"></a> +<a name="IDX320"></a> </dt> <dd><p>Returns the intersection of a general category with the complement of a second general category, as bit masks. @@ -520,25 +530,37 @@ 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="IDX319"></a> +<a name="IDX321"></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 +have a name. +</p></dd></dl> + +<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> </dt> -<dd><p>Returns the name of a general category. +<dd><p>Returns the long name of a general category. Returns NULL if the general category corresponds to a bit mask that does not have a name. </p></dd></dl> <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="IDX320"></a> +<a name="IDX323"></a> </dt> -<dd><p>Returns the general category given by name, e.g. <code>"Lu"</code>. +<dd><p>Returns the general category given by name, e.g. <code>"Lu"</code>, or by long +name, e.g. <code>"Uppercase Letter"</code>. +This lookup ignores spaces, underscores, or hyphens as word separators and is +case-insignificant. </p></dd></dl> <p>The following functions view general categories as sets of Unicode characters. </p> <dl> <dt><u>Function:</u> uc_general_category_t <b>uc_general_category</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX321"></a> +<a name="IDX324"></a> </dt> <dd><p>Returns the general category of a Unicode character. </p> @@ -547,7 +569,7 @@ have a name. <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="IDX322"></a> +<a name="IDX325"></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 @@ -564,115 +586,118 @@ 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="IDX323"></a> +<a name="IDX326"></a> +</dt> +<dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_LC</b> +<a name="IDX327"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_Lu</b> -<a name="IDX324"></a> +<a name="IDX328"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_Ll</b> -<a name="IDX325"></a> +<a name="IDX329"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_Lt</b> -<a name="IDX326"></a> +<a name="IDX330"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_Lm</b> -<a name="IDX327"></a> +<a name="IDX331"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_Lo</b> -<a name="IDX328"></a> +<a name="IDX332"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_M</b> -<a name="IDX329"></a> +<a name="IDX333"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_Mn</b> -<a name="IDX330"></a> +<a name="IDX334"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_Mc</b> -<a name="IDX331"></a> +<a name="IDX335"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_Me</b> -<a name="IDX332"></a> +<a name="IDX336"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_N</b> -<a name="IDX333"></a> +<a name="IDX337"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_Nd</b> -<a name="IDX334"></a> +<a name="IDX338"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_Nl</b> -<a name="IDX335"></a> +<a name="IDX339"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_No</b> -<a name="IDX336"></a> +<a name="IDX340"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_P</b> -<a name="IDX337"></a> +<a name="IDX341"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_Pc</b> -<a name="IDX338"></a> +<a name="IDX342"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_Pd</b> -<a name="IDX339"></a> +<a name="IDX343"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_Ps</b> -<a name="IDX340"></a> +<a name="IDX344"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_Pe</b> -<a name="IDX341"></a> +<a name="IDX345"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_Pi</b> -<a name="IDX342"></a> +<a name="IDX346"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_Pf</b> -<a name="IDX343"></a> +<a name="IDX347"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_Po</b> -<a name="IDX344"></a> +<a name="IDX348"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_S</b> -<a name="IDX345"></a> +<a name="IDX349"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_Sm</b> -<a name="IDX346"></a> +<a name="IDX350"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_Sc</b> -<a name="IDX347"></a> +<a name="IDX351"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_Sk</b> -<a name="IDX348"></a> +<a name="IDX352"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_So</b> -<a name="IDX349"></a> +<a name="IDX353"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_Z</b> -<a name="IDX350"></a> +<a name="IDX354"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_Zs</b> -<a name="IDX351"></a> +<a name="IDX355"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_Zl</b> -<a name="IDX352"></a> +<a name="IDX356"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_Zp</b> -<a name="IDX353"></a> +<a name="IDX357"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_C</b> -<a name="IDX354"></a> +<a name="IDX358"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_Cc</b> -<a name="IDX355"></a> +<a name="IDX359"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_Cf</b> -<a name="IDX356"></a> +<a name="IDX360"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_Cs</b> -<a name="IDX357"></a> +<a name="IDX361"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_Co</b> -<a name="IDX358"></a> +<a name="IDX362"></a> </dt> <dt><u>Macro:</u> uint32_t <b>UC_CATEGORY_MASK_Cn</b> -<a name="IDX359"></a> +<a name="IDX363"></a> </dt> </dl> @@ -680,7 +705,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="IDX360"></a> +<a name="IDX364"></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 @@ -712,7 +737,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="IDX361"></a> +<a name="IDX365"></a> </dt> <dd><p>The canonical combining class value for “Not Reordered” characters. The value is 0. @@ -720,316 +745,376 @@ The value is 0. <dl> <dt><u>Constant:</u> int <b>UC_CCC_OV</b> -<a name="IDX362"></a> +<a name="IDX366"></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="IDX363"></a> +<a name="IDX367"></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="IDX364"></a> +<a name="IDX368"></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="IDX365"></a> +<a name="IDX369"></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="IDX366"></a> +<a name="IDX370"></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="IDX367"></a> +<a name="IDX371"></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> +</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="IDX368"></a> +<a name="IDX373"></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="IDX369"></a> +<a name="IDX374"></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="IDX370"></a> +<a name="IDX375"></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="IDX371"></a> +<a name="IDX376"></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="IDX372"></a> +<a name="IDX377"></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="IDX373"></a> +<a name="IDX378"></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="IDX374"></a> +<a name="IDX379"></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="IDX375"></a> +<a name="IDX380"></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="IDX376"></a> +<a name="IDX381"></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="IDX377"></a> +<a name="IDX382"></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="IDX378"></a> +<a name="IDX383"></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="IDX379"></a> +<a name="IDX384"></a> </dt> <dd><p>The canonical combining class value for “Iota Subscript” characters. </p></dd></dl> +<p>The following functions associate canonical combining classes with their name. +</p> +<dl> +<dt><u>Function:</u> const char * <b>uc_combining_class_name</b><i> (int <var>ccc</var>)</i> +<a name="IDX385"></a> +</dt> +<dd><p>Returns the name of a canonical combining class, more precisely, the +abbreviated name. +Returns NULL if the canonical combining class is a numeric value without a +name. +</p></dd></dl> + +<dl> +<dt><u>Function:</u> const char * <b>uc_combining_class_long_name</b><i> (int <var>ccc</var>)</i> +<a name="IDX386"></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 +name. +</p></dd></dl> + +<dl> +<dt><u>Function:</u> int <b>uc_combining_class_byname</b><i> (const char *<var>ccc_name</var>)</i> +<a name="IDX387"></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>. +This lookup ignores spaces, underscores, or hyphens as word separators and is +case-insignificant. +</p></dd></dl> + <p>The following function looks up the canonical combining class of a character. </p> <dl> <dt><u>Function:</u> int <b>uc_combining_class</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX380"></a> +<a name="IDX388"></a> </dt> <dd><p>Returns the canonical combining class of a Unicode character. </p></dd></dl> <hr size="6"> -<a name="Bidirectional-category"></a> +<a name="Bidi-class"></a> <a name="SEC25"></a> -<h2 class="section"> <a href="libunistring.html#TOC25">8.3 Bidirectional category</a> </h2> +<h2 class="section"> <a href="libunistring.html#TOC25">8.3 Bidi class</a> </h2> -<p>Every Unicode character or code point has a <em>bidirectional category</em> -assigned to it. +<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>. </p> -<p>The bidirectional category guides the bidirectional algorithm +<p>The bidi class guides the bidirectional algorithm (<a href="http://www.unicode.org/reports/tr9/">http://www.unicode.org/reports/tr9/</a>). The possible values are the following. </p> <dl> <dt><u>Constant:</u> int <b>UC_BIDI_L</b> -<a name="IDX381"></a> +<a name="IDX389"></a> </dt> -<dd><p>The bidirectional category for `Left-to-Right`” characters. +<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="IDX382"></a> +<a name="IDX390"></a> </dt> -<dd><p>The bidirectional category for “Left-to-Right Embedding” characters. +<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="IDX383"></a> +<a name="IDX391"></a> </dt> -<dd><p>The bidirectional category for “Left-to-Right Override” characters. +<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="IDX384"></a> +<a name="IDX392"></a> </dt> -<dd><p>The bidirectional category for “Right-to-Left” characters. +<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="IDX385"></a> +<a name="IDX393"></a> </dt> -<dd><p>The bidirectional category for “Right-to-Left Arabic” characters. +<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="IDX386"></a> +<a name="IDX394"></a> </dt> -<dd><p>The bidirectional category for “Right-to-Left Embedding” characters. +<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="IDX387"></a> +<a name="IDX395"></a> </dt> -<dd><p>The bidirectional category for “Right-to-Left Override” characters. +<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="IDX388"></a> +<a name="IDX396"></a> </dt> -<dd><p>The bidirectional category for “Pop Directional Format” characters. +<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="IDX389"></a> +<a name="IDX397"></a> </dt> -<dd><p>The bidirectional category for “European Number” characters. +<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="IDX390"></a> +<a name="IDX398"></a> </dt> -<dd><p>The bidirectional category for “European Number Separator” characters. +<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="IDX391"></a> +<a name="IDX399"></a> </dt> -<dd><p>The bidirectional category for “European Number Terminator” characters. +<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="IDX392"></a> +<a name="IDX400"></a> </dt> -<dd><p>The bidirectional category for “Arabic Number” characters. +<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="IDX393"></a> +<a name="IDX401"></a> </dt> -<dd><p>The bidirectional category for “Common Number Separator” characters. +<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="IDX394"></a> +<a name="IDX402"></a> </dt> -<dd><p>The bidirectional category for “Non-Spacing Mark” characters. +<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="IDX395"></a> +<a name="IDX403"></a> </dt> -<dd><p>The bidirectional category for “Boundary Neutral” characters. +<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="IDX396"></a> +<a name="IDX404"></a> </dt> -<dd><p>The bidirectional category for “Paragraph Separator” characters. +<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="IDX397"></a> +<a name="IDX405"></a> </dt> -<dd><p>The bidirectional category for “Segment Separator” characters. +<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="IDX398"></a> +<a name="IDX406"></a> </dt> -<dd><p>The bidirectional category for “Whitespace” characters. +<dd><p>The bidi class for “Whitespace” characters. </p></dd></dl> <dl> <dt><u>Constant:</u> int <b>UC_BIDI_ON</b> -<a name="IDX399"></a> +<a name="IDX407"></a> </dt> -<dd><p>The bidirectional category for “Other Neutral” characters. +<dd><p>The bidi class for “Other Neutral” characters. </p></dd></dl> <p>The following functions implement the association between a bidirectional 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> +</dt> <dt><u>Function:</u> const char * <b>uc_bidi_category_name</b><i> (int <var>category</var>)</i> -<a name="IDX400"></a> +<a name="IDX409"></a> </dt> -<dd><p>Returns the name of a bidirectional category. +<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> +</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> +</dt> <dt><u>Function:</u> int <b>uc_bidi_category_byname</b><i> (const char *<var>category_name</var>)</i> -<a name="IDX401"></a> +<a name="IDX412"></a> </dt> -<dd><p>Returns the bidirectional category given by name, e.g. <code>"LRE"</code>. +<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>. +This lookup ignores spaces, underscores, or hyphens as word separators and is +case-insignificant. </p></dd></dl> <p>The following functions view bidirectional categories as sets of Unicode characters. </p> <dl> +<dt><u>Function:</u> int <b>uc_bidi_class</b><i> (ucs4_t <var>uc</var>)</i> +<a name="IDX413"></a> +</dt> <dt><u>Function:</u> int <b>uc_bidi_category</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX402"></a> +<a name="IDX414"></a> </dt> -<dd><p>Returns the bidirectional category of a Unicode character. +<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> +</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="IDX403"></a> +<a name="IDX416"></a> </dt> -<dd><p>Tests whether a Unicode character belongs to a given bidirectional category. +<dd><p>Tests whether a Unicode character belongs to a given bidi class. </p></dd></dl> <hr size="6"> @@ -1043,7 +1128,7 @@ numerical value. </p> <dl> <dt><u>Function:</u> int <b>uc_decimal_value</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX404"></a> +<a name="IDX417"></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 @@ -1061,7 +1146,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="IDX405"></a> +<a name="IDX418"></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 @@ -1079,7 +1164,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="IDX406"></a> +<a name="IDX419"></a> </dt> <dd><p>This is a structure type with the following fields: </p><table><tr><td> </td><td><pre class="smallexample">int numerator; @@ -1093,7 +1178,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="IDX407"></a> +<a name="IDX420"></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 @@ -1113,7 +1198,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="IDX408"></a> +<a name="IDX421"></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 @@ -1121,9 +1206,327 @@ stores <var>uc</var> unmodified in <code>*<var>puc</var></code> and returns <cod </p></dd></dl> <hr size="6"> -<a name="Properties"></a> +<a name="Arabic-shaping"></a> <a name="SEC30"></a> -<h2 class="section"> <a href="libunistring.html#TOC30">8.8 Properties</a> </h2> +<h2 class="section"> <a href="libunistring.html#TOC30">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 +are joined. Two character properties describe how this “Arabic shaping” +takes place: the joining type and the joining group. +</p> + +<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> + +<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 +neighbour characters are rendered depending on this character. +</p> +<p>The joining type has the following possible values: +</p> +<dl> +<dt><u>Constant:</u> int <b>UC_JOINING_TYPE_U</b> +<a name="IDX422"></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> +</dt> +<dd><p>“Transparent”: Characters of this joining type are skipped when +considering joining. +</p></dd></dl> + +<dl> +<dt><u>Constant:</u> int <b>UC_JOINING_TYPE_C</b> +<a name="IDX424"></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. +</p></dd></dl> + +<dl> +<dt><u>Constant:</u> int <b>UC_JOINING_TYPE_L</b> +<a name="IDX425"></a> +</dt> +<dd><p>“Left joining”: Characters of this joining type have two shapes, +isolated and initial. Such characters currently don't exist. +</p></dd></dl> + +<dl> +<dt><u>Constant:</u> int <b>UC_JOINING_TYPE_R</b> +<a name="IDX426"></a> +</dt> +<dd><p>“Right joining”: Characters of this joining type have two shapes, +isolated and final. +</p></dd></dl> + +<dl> +<dt><u>Constant:</u> int <b>UC_JOINING_TYPE_D</b> +<a name="IDX427"></a> +</dt> +<dd><p>“Dual joining”: Characters of this joining type have four shapes, +initial, medial, final, and isolated. +</p></dd></dl> + +<p>The following functions implement the association between a joining type +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> +</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> +</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> +</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>. +This lookup ignores spaces, underscores, or hyphens as word separators and is +case-insignificant. +</p></dd></dl> + +<p>The following function gives the joining type of every Unicode character. +</p> +<dl> +<dt><u>Function:</u> int <b>uc_joining_type</b><i> (ucs4_t <var>uc</var>)</i> +<a name="IDX431"></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> + +<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 +two contexts of right-joining characters. +</p> +<p>The joining group has the following possible values: +</p> +<dl> +<dt><u>Constant:</u> int <b>UC_JOINING_GROUP_NONE</b> +<a name="IDX432"></a> +</dt> +<dt><u>Constant:</u> int <b>UC_JOINING_GROUP_AIN</b> +<a name="IDX433"></a> +</dt> +<dt><u>Constant:</u> int <b>UC_JOINING_GROUP_ALAPH</b> +<a name="IDX434"></a> +</dt> +<dt><u>Constant:</u> int <b>UC_JOINING_GROUP_ALEF</b> +<a name="IDX435"></a> +</dt> +<dt><u>Constant:</u> int <b>UC_JOINING_GROUP_BEH</b> +<a name="IDX436"></a> +</dt> +<dt><u>Constant:</u> int <b>UC_JOINING_GROUP_BETH</b> +<a name="IDX437"></a> +</dt> +<dt><u>Constant:</u> int <b>UC_JOINING_GROUP_BURUSHASKI_YEH_BARREE</b> +<a name="IDX438"></a> +</dt> +<dt><u>Constant:</u> int <b>UC_JOINING_GROUP_DAL</b> +<a name="IDX439"></a> +</dt> +<dt><u>Constant:</u> int <b>UC_JOINING_GROUP_DALATH_RISH</b> +<a name="IDX440"></a> +</dt> +<dt><u>Constant:</u> int <b>UC_JOINING_GROUP_E</b> +<a name="IDX441"></a> +</dt> +<dt><u>Constant:</u> int <b>UC_JOINING_GROUP_FARSI_YEH</b> +<a name="IDX442"></a> +</dt> +<dt><u>Constant:</u> int <b>UC_JOINING_GROUP_FE</b> +<a name="IDX443"></a> +</dt> +<dt><u>Constant:</u> int <b>UC_JOINING_GROUP_FEH</b> +<a name="IDX444"></a> +</dt> +<dt><u>Constant:</u> int <b>UC_JOINING_GROUP_FINAL_SEMKATH</b> +<a name="IDX445"></a> +</dt> +<dt><u>Constant:</u> int <b>UC_JOINING_GROUP_GAF</b> +<a name="IDX446"></a> +</dt> +<dt><u>Constant:</u> int <b>UC_JOINING_GROUP_GAMAL</b> +<a name="IDX447"></a> +</dt> +<dt><u>Constant:</u> int <b>UC_JOINING_GROUP_HAH</b> +<a name="IDX448"></a> +</dt> +<dt><u>Constant:</u> int <b>UC_JOINING_GROUP_HE</b> +<a name="IDX449"></a> +</dt> +<dt><u>Constant:</u> int <b>UC_JOINING_GROUP_HEH</b> +<a name="IDX450"></a> +</dt> +<dt><u>Constant:</u> int <b>UC_JOINING_GROUP_HEH_GOAL</b> +<a name="IDX451"></a> +</dt> +<dt><u>Constant:</u> int <b>UC_JOINING_GROUP_HETH</b> +<a name="IDX452"></a> +</dt> +<dt><u>Constant:</u> int <b>UC_JOINING_GROUP_KAF</b> +<a name="IDX453"></a> +</dt> +<dt><u>Constant:</u> int <b>UC_JOINING_GROUP_KAPH</b> +<a name="IDX454"></a> +</dt> +<dt><u>Constant:</u> int <b>UC_JOINING_GROUP_KHAPH</b> +<a name="IDX455"></a> +</dt> +<dt><u>Constant:</u> int <b>UC_JOINING_GROUP_KNOTTED_HEH</b> +<a name="IDX456"></a> +</dt> +<dt><u>Constant:</u> int <b>UC_JOINING_GROUP_LAM</b> +<a name="IDX457"></a> +</dt> +<dt><u>Constant:</u> int <b>UC_JOINING_GROUP_LAMADH</b> +<a name="IDX458"></a> +</dt> +<dt><u>Constant:</u> int <b>UC_JOINING_GROUP_MEEM</b> +<a name="IDX459"></a> +</dt> +<dt><u>Constant:</u> int <b>UC_JOINING_GROUP_MIM</b> +<a name="IDX460"></a> +</dt> +<dt><u>Constant:</u> int <b>UC_JOINING_GROUP_NOON</b> +<a name="IDX461"></a> +</dt> +<dt><u>Constant:</u> int <b>UC_JOINING_GROUP_NUN</b> +<a name="IDX462"></a> +</dt> +<dt><u>Constant:</u> int <b>UC_JOINING_GROUP_NYA</b> +<a name="IDX463"></a> +</dt> +<dt><u>Constant:</u> int <b>UC_JOINING_GROUP_PE</b> +<a name="IDX464"></a> +</dt> +<dt><u>Constant:</u> int <b>UC_JOINING_GROUP_QAF</b> +<a name="IDX465"></a> +</dt> +<dt><u>Constant:</u> int <b>UC_JOINING_GROUP_QAPH</b> +<a name="IDX466"></a> +</dt> +<dt><u>Constant:</u> int <b>UC_JOINING_GROUP_REH</b> +<a name="IDX467"></a> +</dt> +<dt><u>Constant:</u> int <b>UC_JOINING_GROUP_REVERSED_PE</b> +<a name="IDX468"></a> +</dt> +<dt><u>Constant:</u> int <b>UC_JOINING_GROUP_SAD</b> +<a name="IDX469"></a> +</dt> +<dt><u>Constant:</u> int <b>UC_JOINING_GROUP_SADHE</b> +<a name="IDX470"></a> +</dt> +<dt><u>Constant:</u> int <b>UC_JOINING_GROUP_SEEN</b> +<a name="IDX471"></a> +</dt> +<dt><u>Constant:</u> int <b>UC_JOINING_GROUP_SEMKATH</b> +<a name="IDX472"></a> +</dt> +<dt><u>Constant:</u> int <b>UC_JOINING_GROUP_SHIN</b> +<a name="IDX473"></a> +</dt> +<dt><u>Constant:</u> int <b>UC_JOINING_GROUP_SWASH_KAF</b> +<a name="IDX474"></a> +</dt> +<dt><u>Constant:</u> int <b>UC_JOINING_GROUP_SYRIAC_WAW</b> +<a name="IDX475"></a> +</dt> +<dt><u>Constant:</u> int <b>UC_JOINING_GROUP_TAH</b> +<a name="IDX476"></a> +</dt> +<dt><u>Constant:</u> int <b>UC_JOINING_GROUP_TAW</b> +<a name="IDX477"></a> +</dt> +<dt><u>Constant:</u> int <b>UC_JOINING_GROUP_TEH_MARBUTA</b> +<a name="IDX478"></a> +</dt> +<dt><u>Constant:</u> int <b>UC_JOINING_GROUP_TEH_MARBUTA_GOAL</b> +<a name="IDX479"></a> +</dt> +<dt><u>Constant:</u> int <b>UC_JOINING_GROUP_TETH</b> +<a name="IDX480"></a> +</dt> +<dt><u>Constant:</u> int <b>UC_JOINING_GROUP_WAW</b> +<a name="IDX481"></a> +</dt> +<dt><u>Constant:</u> int <b>UC_JOINING_GROUP_YEH</b> +<a name="IDX482"></a> +</dt> +<dt><u>Constant:</u> int <b>UC_JOINING_GROUP_YEH_BARREE</b> +<a name="IDX483"></a> +</dt> +<dt><u>Constant:</u> int <b>UC_JOINING_GROUP_YEH_WITH_TAIL</b> +<a name="IDX484"></a> +</dt> +<dt><u>Constant:</u> int <b>UC_JOINING_GROUP_YUDH</b> +<a name="IDX485"></a> +</dt> +<dt><u>Constant:</u> int <b>UC_JOINING_GROUP_YUDH_HE</b> +<a name="IDX486"></a> +</dt> +<dt><u>Constant:</u> int <b>UC_JOINING_GROUP_ZAIN</b> +<a name="IDX487"></a> +</dt> +<dt><u>Constant:</u> int <b>UC_JOINING_GROUP_ZHAIN</b> +<a name="IDX488"></a> +</dt> +</dl> + +<p>The following functions implement the association between a joining group +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> +</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> +</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 +case-insignificant. +</p></dd></dl> + +<p>The following function gives the joining group of every Unicode character. +</p> +<dl> +<dt><u>Function:</u> int <b>uc_joining_group</b><i> (ucs4_t <var>uc</var>)</i> +<a name="IDX491"></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> <p>This section defines boolean properties of Unicode characters. This means, a character either has the given property or does not have it. @@ -1138,14 +1541,14 @@ low level, a property is merely a function. <hr size="6"> <a name="Properties-as-objects"></a> -<a name="SEC31"></a> -<h3 class="subsection"> <a href="libunistring.html#TOC31">8.8.1 Properties as objects – the object oriented API</a> </h3> +<a name="SEC34"></a> +<h3 class="subsection"> <a href="libunistring.html#TOC34">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="IDX409"></a> +<a name="IDX492"></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 @@ -1158,37 +1561,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="IDX410"></a> +<a name="IDX493"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_ALPHABETIC</b> -<a name="IDX411"></a> +<a name="IDX494"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_OTHER_ALPHABETIC</b> -<a name="IDX412"></a> +<a name="IDX495"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_NOT_A_CHARACTER</b> -<a name="IDX413"></a> +<a name="IDX496"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_DEFAULT_IGNORABLE_CODE_POINT</b> -<a name="IDX414"></a> +<a name="IDX497"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_OTHER_DEFAULT_IGNORABLE_CODE_POINT</b> -<a name="IDX415"></a> +<a name="IDX498"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_DEPRECATED</b> -<a name="IDX416"></a> +<a name="IDX499"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_LOGICAL_ORDER_EXCEPTION</b> -<a name="IDX417"></a> +<a name="IDX500"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_VARIATION_SELECTOR</b> -<a name="IDX418"></a> +<a name="IDX501"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_PRIVATE_USE</b> -<a name="IDX419"></a> +<a name="IDX502"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_UNASSIGNED_CODE_VALUE</b> -<a name="IDX420"></a> +<a name="IDX503"></a> </dt> </dl> @@ -1196,22 +1599,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="IDX421"></a> +<a name="IDX504"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_OTHER_UPPERCASE</b> -<a name="IDX422"></a> +<a name="IDX505"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_LOWERCASE</b> -<a name="IDX423"></a> +<a name="IDX506"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_OTHER_LOWERCASE</b> -<a name="IDX424"></a> +<a name="IDX507"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_TITLECASE</b> -<a name="IDX425"></a> +<a name="IDX508"></a> +</dt> +<dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_CASED</b> +<a name="IDX509"></a> +</dt> +<dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_CASE_IGNORABLE</b> +<a name="IDX510"></a> +</dt> +<dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_CHANGES_WHEN_LOWERCASED</b> +<a name="IDX511"></a> +</dt> +<dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_CHANGES_WHEN_UPPERCASED</b> +<a name="IDX512"></a> +</dt> +<dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_CHANGES_WHEN_TITLECASED</b> +<a name="IDX513"></a> +</dt> +<dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_CHANGES_WHEN_CASEFOLDED</b> +<a name="IDX514"></a> +</dt> +<dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_CHANGES_WHEN_CASEMAPPED</b> +<a name="IDX515"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_SOFT_DOTTED</b> -<a name="IDX426"></a> +<a name="IDX516"></a> </dt> </dl> @@ -1219,28 +1643,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="IDX427"></a> +<a name="IDX517"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_OTHER_ID_START</b> -<a name="IDX428"></a> +<a name="IDX518"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_ID_CONTINUE</b> -<a name="IDX429"></a> +<a name="IDX519"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_OTHER_ID_CONTINUE</b> -<a name="IDX430"></a> +<a name="IDX520"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_XID_START</b> -<a name="IDX431"></a> +<a name="IDX521"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_XID_CONTINUE</b> -<a name="IDX432"></a> +<a name="IDX522"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_PATTERN_WHITE_SPACE</b> -<a name="IDX433"></a> +<a name="IDX523"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_PATTERN_SYNTAX</b> -<a name="IDX434"></a> +<a name="IDX524"></a> </dt> </dl> @@ -1248,19 +1672,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="IDX435"></a> +<a name="IDX525"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_GRAPHEME_BASE</b> -<a name="IDX436"></a> +<a name="IDX526"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_GRAPHEME_EXTEND</b> -<a name="IDX437"></a> +<a name="IDX527"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_OTHER_GRAPHEME_EXTEND</b> -<a name="IDX438"></a> +<a name="IDX528"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_GRAPHEME_LINK</b> -<a name="IDX439"></a> +<a name="IDX529"></a> </dt> </dl> @@ -1268,55 +1692,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="IDX440"></a> +<a name="IDX530"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_BIDI_LEFT_TO_RIGHT</b> -<a name="IDX441"></a> +<a name="IDX531"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_BIDI_HEBREW_RIGHT_TO_LEFT</b> -<a name="IDX442"></a> +<a name="IDX532"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_BIDI_ARABIC_RIGHT_TO_LEFT</b> -<a name="IDX443"></a> +<a name="IDX533"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_BIDI_EUROPEAN_DIGIT</b> -<a name="IDX444"></a> +<a name="IDX534"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_BIDI_EUR_NUM_SEPARATOR</b> -<a name="IDX445"></a> +<a name="IDX535"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_BIDI_EUR_NUM_TERMINATOR</b> -<a name="IDX446"></a> +<a name="IDX536"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_BIDI_ARABIC_DIGIT</b> -<a name="IDX447"></a> +<a name="IDX537"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_BIDI_COMMON_SEPARATOR</b> -<a name="IDX448"></a> +<a name="IDX538"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_BIDI_BLOCK_SEPARATOR</b> -<a name="IDX449"></a> +<a name="IDX539"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_BIDI_SEGMENT_SEPARATOR</b> -<a name="IDX450"></a> +<a name="IDX540"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_BIDI_WHITESPACE</b> -<a name="IDX451"></a> +<a name="IDX541"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_BIDI_NON_SPACING_MARK</b> -<a name="IDX452"></a> +<a name="IDX542"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_BIDI_BOUNDARY_NEUTRAL</b> -<a name="IDX453"></a> +<a name="IDX543"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_BIDI_PDF</b> -<a name="IDX454"></a> +<a name="IDX544"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_BIDI_EMBEDDING_OR_OVERRIDE</b> -<a name="IDX455"></a> +<a name="IDX545"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_BIDI_OTHER_NEUTRAL</b> -<a name="IDX456"></a> +<a name="IDX546"></a> </dt> </dl> @@ -1324,10 +1748,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="IDX457"></a> +<a name="IDX547"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_ASCII_HEX_DIGIT</b> -<a name="IDX458"></a> +<a name="IDX548"></a> </dt> </dl> @@ -1335,19 +1759,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="IDX459"></a> +<a name="IDX549"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_UNIFIED_IDEOGRAPH</b> -<a name="IDX460"></a> +<a name="IDX550"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_RADICAL</b> -<a name="IDX461"></a> +<a name="IDX551"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_IDS_BINARY_OPERATOR</b> -<a name="IDX462"></a> +<a name="IDX552"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_IDS_TRINARY_OPERATOR</b> -<a name="IDX463"></a> +<a name="IDX553"></a> </dt> </dl> @@ -1355,79 +1779,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="IDX464"></a> +<a name="IDX554"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_SPACE</b> -<a name="IDX465"></a> +<a name="IDX555"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_NON_BREAK</b> -<a name="IDX466"></a> +<a name="IDX556"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_ISO_CONTROL</b> -<a name="IDX467"></a> +<a name="IDX557"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_FORMAT_CONTROL</b> -<a name="IDX468"></a> +<a name="IDX558"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_DASH</b> -<a name="IDX469"></a> +<a name="IDX559"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_HYPHEN</b> -<a name="IDX470"></a> +<a name="IDX560"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_PUNCTUATION</b> -<a name="IDX471"></a> +<a name="IDX561"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_LINE_SEPARATOR</b> -<a name="IDX472"></a> +<a name="IDX562"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_PARAGRAPH_SEPARATOR</b> -<a name="IDX473"></a> +<a name="IDX563"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_QUOTATION_MARK</b> -<a name="IDX474"></a> +<a name="IDX564"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_SENTENCE_TERMINAL</b> -<a name="IDX475"></a> +<a name="IDX565"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_TERMINAL_PUNCTUATION</b> -<a name="IDX476"></a> +<a name="IDX566"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_CURRENCY_SYMBOL</b> -<a name="IDX477"></a> +<a name="IDX567"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_MATH</b> -<a name="IDX478"></a> +<a name="IDX568"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_OTHER_MATH</b> -<a name="IDX479"></a> +<a name="IDX569"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_PAIRED_PUNCTUATION</b> -<a name="IDX480"></a> +<a name="IDX570"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_LEFT_OF_PAIR</b> -<a name="IDX481"></a> +<a name="IDX571"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_COMBINING</b> -<a name="IDX482"></a> +<a name="IDX572"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_COMPOSITE</b> -<a name="IDX483"></a> +<a name="IDX573"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_DECIMAL_DIGIT</b> -<a name="IDX484"></a> +<a name="IDX574"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_NUMERIC</b> -<a name="IDX485"></a> +<a name="IDX575"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_DIACRITIC</b> -<a name="IDX486"></a> +<a name="IDX576"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_EXTENDER</b> -<a name="IDX487"></a> +<a name="IDX577"></a> </dt> <dt><u>Constant:</u> uc_property_t <b>UC_PROPERTY_IGNORABLE_CONTROL</b> -<a name="IDX488"></a> +<a name="IDX578"></a> </dt> </dl> @@ -1435,7 +1859,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="IDX489"></a> +<a name="IDX579"></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 @@ -1443,13 +1867,17 @@ with the given name exists, the result will satisfy the this predicate and must not be passed to functions that expect an <code>uc_property_t</code> argument. </p> +<p>This lookup ignores spaces, underscores, or hyphens as word separators, is +case-insignificant, and supports the aliases listed in Unicode's +‘<tt>PropertyAliases.txt</tt>’ file. +</p> <p>This function references a big table of all predefined properties. Its use can significantly increase the size of your application. </p></dd></dl> <dl> <dt><u>Function:</u> bool <b>uc_property_is_valid</b><i> (uc_property_t property)</i> -<a name="IDX490"></a> +<a name="IDX580"></a> </dt> <dd><p>Returns <code>true</code> when the given property is valid, or <code>false</code> otherwise. @@ -1459,51 +1887,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="IDX491"></a> +<a name="IDX581"></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="SEC32"></a> -<h3 class="subsection"> <a href="libunistring.html#TOC32">8.8.2 Properties as functions – the functional API</a> </h3> +<a name="SEC35"></a> +<h3 class="subsection"> <a href="libunistring.html#TOC35">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="IDX492"></a> +<a name="IDX582"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_alphabetic</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX493"></a> +<a name="IDX583"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_other_alphabetic</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX494"></a> +<a name="IDX584"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_not_a_character</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX495"></a> +<a name="IDX585"></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="IDX496"></a> +<a name="IDX586"></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="IDX497"></a> +<a name="IDX587"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_deprecated</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX498"></a> +<a name="IDX588"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_logical_order_exception</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX499"></a> +<a name="IDX589"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_variation_selector</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX500"></a> +<a name="IDX590"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_private_use</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX501"></a> +<a name="IDX591"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_unassigned_code_value</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX502"></a> +<a name="IDX592"></a> </dt> </dl> @@ -1511,22 +1939,43 @@ otherwise. </p> <dl> <dt><u>Function:</u> bool <b>uc_is_property_uppercase</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX503"></a> +<a name="IDX593"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_other_uppercase</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX504"></a> +<a name="IDX594"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_lowercase</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX505"></a> +<a name="IDX595"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_other_lowercase</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX506"></a> +<a name="IDX596"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_titlecase</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX507"></a> +<a name="IDX597"></a> +</dt> +<dt><u>Function:</u> bool <b>uc_is_property_cased</b><i> (ucs4_t <var>uc</var>)</i> +<a name="IDX598"></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> +</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> +</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> +</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> +</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> +</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> </dt> <dt><u>Function:</u> bool <b>uc_is_property_soft_dotted</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX508"></a> +<a name="IDX605"></a> </dt> </dl> @@ -1534,28 +1983,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="IDX509"></a> +<a name="IDX606"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_other_id_start</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX510"></a> +<a name="IDX607"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_id_continue</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX511"></a> +<a name="IDX608"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_other_id_continue</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX512"></a> +<a name="IDX609"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_xid_start</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX513"></a> +<a name="IDX610"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_xid_continue</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX514"></a> +<a name="IDX611"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_pattern_white_space</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX515"></a> +<a name="IDX612"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_pattern_syntax</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX516"></a> +<a name="IDX613"></a> </dt> </dl> @@ -1563,19 +2012,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="IDX517"></a> +<a name="IDX614"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_grapheme_base</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX518"></a> +<a name="IDX615"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_grapheme_extend</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX519"></a> +<a name="IDX616"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_other_grapheme_extend</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX520"></a> +<a name="IDX617"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_grapheme_link</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX521"></a> +<a name="IDX618"></a> </dt> </dl> @@ -1583,55 +2032,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="IDX522"></a> +<a name="IDX619"></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="IDX523"></a> +<a name="IDX620"></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="IDX524"></a> +<a name="IDX621"></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="IDX525"></a> +<a name="IDX622"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_bidi_european_digit</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX526"></a> +<a name="IDX623"></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="IDX527"></a> +<a name="IDX624"></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="IDX528"></a> +<a name="IDX625"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_bidi_arabic_digit</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX529"></a> +<a name="IDX626"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_bidi_common_separator</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX530"></a> +<a name="IDX627"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_bidi_block_separator</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX531"></a> +<a name="IDX628"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_bidi_segment_separator</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX532"></a> +<a name="IDX629"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_bidi_whitespace</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX533"></a> +<a name="IDX630"></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="IDX534"></a> +<a name="IDX631"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_bidi_boundary_neutral</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX535"></a> +<a name="IDX632"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_bidi_pdf</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX536"></a> +<a name="IDX633"></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="IDX537"></a> +<a name="IDX634"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_bidi_other_neutral</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX538"></a> +<a name="IDX635"></a> </dt> </dl> @@ -1639,10 +2088,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="IDX539"></a> +<a name="IDX636"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_ascii_hex_digit</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX540"></a> +<a name="IDX637"></a> </dt> </dl> @@ -1650,19 +2099,19 @@ otherwise. </p> <dl> <dt><u>Function:</u> bool <b>uc_is_property_ideographic</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX541"></a> +<a name="IDX638"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_unified_ideograph</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX542"></a> +<a name="IDX639"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_radical</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX543"></a> +<a name="IDX640"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_ids_binary_operator</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX544"></a> +<a name="IDX641"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_ids_trinary_operator</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX545"></a> +<a name="IDX642"></a> </dt> </dl> @@ -1670,86 +2119,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="IDX546"></a> +<a name="IDX643"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_space</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX547"></a> +<a name="IDX644"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_non_break</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX548"></a> +<a name="IDX645"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_iso_control</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX549"></a> +<a name="IDX646"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_format_control</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX550"></a> +<a name="IDX647"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_dash</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX551"></a> +<a name="IDX648"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_hyphen</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX552"></a> +<a name="IDX649"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_punctuation</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX553"></a> +<a name="IDX650"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_line_separator</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX554"></a> +<a name="IDX651"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_paragraph_separator</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX555"></a> +<a name="IDX652"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_quotation_mark</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX556"></a> +<a name="IDX653"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_sentence_terminal</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX557"></a> +<a name="IDX654"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_terminal_punctuation</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX558"></a> +<a name="IDX655"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_currency_symbol</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX559"></a> +<a name="IDX656"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_math</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX560"></a> +<a name="IDX657"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_other_math</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX561"></a> +<a name="IDX658"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_paired_punctuation</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX562"></a> +<a name="IDX659"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_left_of_pair</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX563"></a> +<a name="IDX660"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_combining</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX564"></a> +<a name="IDX661"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_composite</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX565"></a> +<a name="IDX662"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_decimal_digit</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX566"></a> +<a name="IDX663"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_numeric</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX567"></a> +<a name="IDX664"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_diacritic</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX568"></a> +<a name="IDX665"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_extender</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX569"></a> +<a name="IDX666"></a> </dt> <dt><u>Function:</u> bool <b>uc_is_property_ignorable_control</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX570"></a> +<a name="IDX667"></a> </dt> </dl> <hr size="6"> <a name="Scripts"></a> -<a name="SEC33"></a> -<h2 class="section"> <a href="libunistring.html#TOC33">8.9 Scripts</a> </h2> +<a name="SEC36"></a> +<h2 class="section"> <a href="libunistring.html#TOC36">8.10 Scripts</a> </h2> <p>The Unicode characters are subdivided into scripts. </p> @@ -1757,7 +2206,7 @@ otherwise. </p> <dl> <dt><u>Type:</u> <b>uc_script_t</b> -<a name="IDX571"></a> +<a name="IDX668"></a> </dt> <dd><p>This data type is a structure type that refers to statically allocated read-only data. It contains the following fields: @@ -1767,12 +2216,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="IDX572"></a> +<a name="IDX669"></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="IDX573"></a> +<a name="IDX670"></a> </dt> <dd><p>Returns the script of a Unicode character. Returns NULL if <var>uc</var> does not belong to any script. @@ -1780,7 +2229,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="IDX574"></a> +<a name="IDX671"></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. @@ -1790,7 +2239,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="IDX575"></a> +<a name="IDX672"></a> </dt> <dd><p>Tests whether a Unicode character belongs to a given script. </p></dd></dl> @@ -1799,7 +2248,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="IDX576"></a> +<a name="IDX673"></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>. @@ -1807,8 +2256,8 @@ script with the given name does not exist. <hr size="6"> <a name="Blocks"></a> -<a name="SEC34"></a> -<h2 class="section"> <a href="libunistring.html#TOC34">8.10 Blocks</a> </h2> +<a name="SEC37"></a> +<h2 class="section"> <a href="libunistring.html#TOC37">8.11 Blocks</a> </h2> <p>The Unicode characters are subdivided into blocks. A block is an interval of Unicode code points. @@ -1817,7 +2266,7 @@ Unicode code points. </p> <dl> <dt><u>Type:</u> <b>uc_block_t</b> -<a name="IDX577"></a> +<a name="IDX674"></a> </dt> <dd><p>This data type is a structure type that refers to statically allocated data. It contains the following fields: @@ -1833,12 +2282,12 @@ const char *name; <p>The <code>name</code> field is the name of the block. </p></dd></dl> -<a name="IDX578"></a> +<a name="IDX675"></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="IDX579"></a> +<a name="IDX676"></a> </dt> <dd><p>Returns the block a character belongs to. </p></dd></dl> @@ -1847,7 +2296,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="IDX580"></a> +<a name="IDX677"></a> </dt> <dd><p>Tests whether a Unicode character belongs to a given block. </p></dd></dl> @@ -1856,7 +2305,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="IDX581"></a> +<a name="IDX678"></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>. @@ -1864,22 +2313,22 @@ const char *name; <hr size="6"> <a name="ISO-C-and-Java-syntax"></a> -<a name="SEC35"></a> -<h2 class="section"> <a href="libunistring.html#TOC35">8.11 ISO C and Java syntax</a> </h2> +<a name="SEC38"></a> +<h2 class="section"> <a href="libunistring.html#TOC38">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="IDX582"></a> +<a name="IDX679"></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="IDX583"></a> +<a name="IDX680"></a> </dt> <dd><p>Tests whether a Unicode character is considered whitespace in Java. </p></dd></dl> @@ -1889,7 +2338,7 @@ language standards are ISO C 99 and Java. </p> <dl> <dt><u>Constant:</u> int <b>UC_IDENTIFIER_START</b> -<a name="IDX584"></a> +<a name="IDX681"></a> </dt> <dd><p>This return value means that the given character is valid as first or subsequent character in an identifier. @@ -1897,7 +2346,7 @@ subsequent character in an identifier. <dl> <dt><u>Constant:</u> int <b>UC_IDENTIFIER_VALID</b> -<a name="IDX585"></a> +<a name="IDX682"></a> </dt> <dd><p>This return value means that the given character is valid as subsequent character only. @@ -1905,14 +2354,14 @@ character only. <dl> <dt><u>Constant:</u> int <b>UC_IDENTIFIER_INVALID</b> -<a name="IDX586"></a> +<a name="IDX683"></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="IDX587"></a> +<a name="IDX684"></a> </dt> <dd><p>This return value (only for Java) means that the given character is ignorable. </p></dd></dl> @@ -1920,19 +2369,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="IDX588"></a> +<a name="IDX685"></a> <dl> <dt><u>Function:</u> int <b>uc_c_ident_category</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX589"></a> +<a name="IDX686"></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="IDX590"></a> +<a name="IDX687"></a> <dl> <dt><u>Function:</u> int <b>uc_java_ident_category</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX591"></a> +<a name="IDX688"></a> </dt> <dd><p>Returns the categorization of a Unicode character with respect to the Java identifier syntax. @@ -1940,8 +2389,8 @@ identifier syntax. <hr size="6"> <a name="Classifications-like-in-ISO-C"></a> -<a name="SEC36"></a> -<h2 class="section"> <a href="libunistring.html#TOC36">8.12 Classifications like in ISO C</a> </h2> +<a name="SEC39"></a> +<h2 class="section"> <a href="libunistring.html#TOC39">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 @@ -1952,7 +2401,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="IDX592"></a> +<a name="IDX689"></a> </dt> <dd><p>Tests for any character for which <code>uc_is_alpha</code> or <code>uc_is_digit</code> is true. @@ -1960,7 +2409,7 @@ true. <dl> <dt><u>Function:</u> bool <b>uc_is_alpha</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX593"></a> +<a name="IDX690"></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 @@ -1970,21 +2419,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="IDX594"></a> +<a name="IDX691"></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="IDX595"></a> +<a name="IDX692"></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="IDX596"></a> +<a name="IDX693"></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. @@ -1992,7 +2441,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="IDX597"></a> +<a name="IDX694"></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>, @@ -2001,14 +2450,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="IDX598"></a> +<a name="IDX695"></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="IDX599"></a> +<a name="IDX696"></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. @@ -2016,7 +2465,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="IDX600"></a> +<a name="IDX697"></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> @@ -2025,7 +2474,7 @@ is true. <dl> <dt><u>Function:</u> bool <b>uc_is_upper</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX601"></a> +<a name="IDX698"></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>, @@ -2034,14 +2483,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_xdigit</b><i> (ucs4_t <var>uc</var>)</i> -<a name="IDX602"></a> +<a name="IDX699"></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="IDX603"></a> +<a name="IDX700"></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. @@ -2049,7 +2498,7 @@ a locale-specific set of characters for which <code>uc_is_alnum</code> is false. <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#SEC37" title="Next chapter"> >> </a>]</td> +<td valign="middle" align="left">[<a href="libunistring_9.html#SEC40" title="Next chapter"> >> </a>]</td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> <td valign="middle" align="left"> </td> @@ -2057,12 +2506,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_18.html#SEC71" title="Index">Index</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_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <p> <font size="-1"> - This document was generated by <em>Bruno Haible</em> on <em>March, 30 2010</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>July, 8 2015</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 6b5d13d9..74cfaad7 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 March, 30 2010 by texi2html 1.78a --> +<!-- Created on July, 8 2015 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_8.html#SEC20" title="Beginning of this chapter or previous chapter"> << </a>]</td> -<td valign="middle" align="left">[<a href="libunistring_10.html#SEC38" title="Next chapter"> >> </a>]</td> +<td valign="middle" align="left">[<a href="libunistring_10.html#SEC41" 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_18.html#SEC71" title="Index">Index</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_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <hr size="2"> <a name="uniwidth_002eh"></a> -<a name="SEC37"></a> -<h1 class="chapter"> <a href="libunistring.html#TOC37">9. Display width <code><uniwidth.h></code></a> </h1> +<a name="SEC40"></a> +<h1 class="chapter"> <a href="libunistring.html#TOC40">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="IDX604"></a> +<a name="IDX701"></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="IDX605"></a> -<a name="IDX606"></a> -<a name="IDX607"></a> +<a name="IDX702"></a> +<a name="IDX703"></a> +<a name="IDX704"></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="IDX608"></a> +<a name="IDX705"></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="IDX609"></a> +<a name="IDX706"></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="IDX610"></a> +<a name="IDX707"></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="IDX611"></a> +<a name="IDX708"></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,13 +105,13 @@ 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="IDX612"></a> +<a name="IDX709"></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="IDX613"></a> +<a name="IDX710"></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="IDX614"></a> +<a name="IDX711"></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. @@ -119,7 +119,7 @@ This function ignores control characters in the string. <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#SEC38" title="Next chapter"> >> </a>]</td> +<td valign="middle" align="left">[<a href="libunistring_10.html#SEC41" 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_18.html#SEC71" title="Index">Index</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_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <p> <font size="-1"> - This document was generated by <em>Bruno Haible</em> on <em>March, 30 2010</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>July, 8 2015</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 40e4977e..a44b9f53 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 March, 30 2010 by texi2html 1.78a --> +<!-- Created on July, 8 2015 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_18.html#SEC71" title="Index">Index</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="#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <h1>About This Document</h1> <p> - This document was generated by <em>Bruno Haible</em> on <em>March, 30 2010</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>July, 8 2015</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_18.html#SEC71" title="Index">Index</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="#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <p> <font size="-1"> - This document was generated by <em>Bruno Haible</em> on <em>March, 30 2010</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>July, 8 2015</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 6dd04ac0..10eaa3ba 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 March, 30 2010 by texi2html 1.78a --> +<!-- Created on July, 8 2015 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_18.html#SEC71" title="Index">Index</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_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <h1 class="settitle">GNU libunistring</h1> @@ -84,61 +84,71 @@ ul.toc {list-style: none} <li><a name="TOC23" href="libunistring_8.html#SEC23">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 Bidirectional category</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 Properties</a> + <li><a name="TOC30" href="libunistring_8.html#SEC30">8.8 Arabic shaping</a> <ul class="toc"> - <li><a name="TOC31" href="libunistring_8.html#SEC31">8.8.1 Properties as objects – the object oriented API</a></li> - <li><a name="TOC32" href="libunistring_8.html#SEC32">8.8.2 Properties as functions – the functional API</a></li> + <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> </ul></li> - <li><a name="TOC33" href="libunistring_8.html#SEC33">8.9 Scripts</a></li> - <li><a name="TOC34" href="libunistring_8.html#SEC34">8.10 Blocks</a></li> - <li><a name="TOC35" href="libunistring_8.html#SEC35">8.11 ISO C and Java syntax</a></li> - <li><a name="TOC36" href="libunistring_8.html#SEC36">8.12 Classifications like in ISO C</a></li> + <li><a name="TOC33" href="libunistring_8.html#SEC33">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> + </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> + </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> + <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> </ul></li> - <li><a name="TOC37" href="libunistring_9.html#SEC37">9. Display width <code><uniwidth.h></code></a></li> - <li><a name="TOC38" href="libunistring_10.html#SEC38">10. Word breaks in strings <code><uniwbrk.h></code></a> + <li><a name="TOC44" href="libunistring_11.html#SEC44">11. Word breaks in strings <code><uniwbrk.h></code></a> <ul class="toc"> - <li><a name="TOC39" href="libunistring_10.html#SEC39">10.1 Word breaks in a string</a></li> - <li><a name="TOC40" href="libunistring_10.html#SEC40">10.2 Word break property</a></li> + <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> </ul></li> - <li><a name="TOC41" href="libunistring_11.html#SEC41">11. Line breaking <code><unilbrk.h></code></a></li> - <li><a name="TOC42" href="libunistring_12.html#SEC42">12. Normalization forms (composition and decomposition) <code><uninorm.h></code></a> + <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> <ul class="toc"> - <li><a name="TOC43" href="libunistring_12.html#SEC43">12.1 Decomposition of Unicode characters</a></li> - <li><a name="TOC44" href="libunistring_12.html#SEC44">12.2 Composition of Unicode characters</a></li> - <li><a name="TOC45" href="libunistring_12.html#SEC45">12.3 Normalization of strings</a></li> - <li><a name="TOC46" href="libunistring_12.html#SEC46">12.4 Normalizing comparisons</a></li> - <li><a name="TOC47" href="libunistring_12.html#SEC47">12.5 Normalization of streams of Unicode characters</a></li> + <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> </ul></li> - <li><a name="TOC48" href="libunistring_13.html#SEC48">13. Case mappings <code><unicase.h></code></a> + <li><a name="TOC54" href="libunistring_14.html#SEC54">14. Case mappings <code><unicase.h></code></a> <ul class="toc"> - <li><a name="TOC49" href="libunistring_13.html#SEC49">13.1 Case mappings of characters</a></li> - <li><a name="TOC50" href="libunistring_13.html#SEC50">13.2 Case mappings of strings</a></li> - <li><a name="TOC51" href="libunistring_13.html#SEC51">13.3 Case mappings of substrings</a></li> - <li><a name="TOC52" href="libunistring_13.html#SEC52">13.4 Case insensitive comparison</a></li> - <li><a name="TOC53" href="libunistring_13.html#SEC53">13.5 Case detection</a></li> + <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> </ul></li> - <li><a name="TOC54" href="libunistring_14.html#SEC54">14. Regular expressions <code><uniregex.h></code></a></li> - <li><a name="TOC55" href="libunistring_15.html#SEC55">15. Using the library</a> + <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> <ul class="toc"> - <li><a name="TOC56" href="libunistring_15.html#SEC56">15.1 Installation</a></li> - <li><a name="TOC57" href="libunistring_15.html#SEC57">15.2 Compiler options</a></li> - <li><a name="TOC58" href="libunistring_15.html#SEC58">15.3 Include files</a></li> - <li><a name="TOC59" href="libunistring_15.html#SEC59">15.4 Autoconf macro</a></li> - <li><a name="TOC60" href="libunistring_15.html#SEC60">15.5 Reporting problems</a></li> + <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> </ul></li> - <li><a name="TOC61" href="libunistring_16.html#SEC61">16. More advanced functionality</a></li> - <li><a name="TOC62" href="libunistring_17.html#SEC62">A. Licenses</a> + <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> <ul class="toc"> - <li><a name="TOC63" href="libunistring_17.html#SEC63">A.1 GNU GENERAL PUBLIC LICENSE</a></li> - <li><a name="TOC64" href="libunistring_17.html#SEC68">A.2 GNU LESSER GENERAL PUBLIC LICENSE</a></li> - <li><a name="TOC65" href="libunistring_17.html#SEC69">A.3 GNU Free Documentation License</a></li> + <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> </ul></li> - <li><a name="TOC66" href="libunistring_18.html#SEC71">Index</a></li> + <li><a name="TOC72" href="libunistring_19.html#SEC77">Index</a></li> </ul> </div> @@ -150,12 +160,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_18.html#SEC71" title="Index">Index</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_abt.html#SEC_About" title="About (help)"> ? </a>]</td> </tr></table> <p> <font size="-1"> - This document was generated by <em>Bruno Haible</em> on <em>March, 30 2010</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>July, 8 2015</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 4384b70b..745f9945 100644 --- a/doc/stamp-vti +++ b/doc/stamp-vti @@ -1,4 +1,4 @@ -@set UPDATED 1 January 2010 -@set UPDATED-MONTH January 2010 -@set EDITION 0.9.3 -@set VERSION 0.9.3 +@set UPDATED 27 July 2012 +@set UPDATED-MONTH July 2012 +@set EDITION 0.9.6 +@set VERSION 0.9.6 diff --git a/doc/unicase.texi b/doc/unicase.texi index 14b46be0..e88a0a48 100644 --- a/doc/unicase.texi +++ b/doc/unicase.texi @@ -91,7 +91,7 @@ The @var{nf} argument designates the normalization. @cindex locale language These functions are locale dependent. The @var{iso639_language} argument -identifies the language (e.g. @code{"tr"} for Turkish). NULL means to use +identifies the language (e.g@. @code{"tr"} for Turkish). NULL means to use locale independent case mappings. @deftypefun {const char *} uc_locale_language () diff --git a/doc/unictype.texi b/doc/unictype.texi index 129159c7..5f292cc0 100644 --- a/doc/unictype.texi +++ b/doc/unictype.texi @@ -14,11 +14,12 @@ in the presence of specific Unicode characters. @menu * General category:: * Canonical combining class:: -* Bidirectional category:: +* Bidi class:: * Decimal digit value:: * Digit value:: * Numeric value:: * Mirrored character:: +* Arabic shaping:: * Properties:: * Scripts:: * Blocks:: @@ -65,6 +66,7 @@ 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 @@ -109,6 +111,10 @@ The following are alias names for predefined General category values. This is another name for @code{UC_CATEGORY_L}. @end deftypevr +@deftypevr Macro uc_general_category_t UC_CASED_LETTER +This is another name for @code{UC_CATEGORY_LC}. +@end deftypevr + @deftypevr Macro uc_general_category_t UC_UPPERCASE_LETTER This is another name for @code{UC_CATEGORY_Lu}. @end deftypevr @@ -281,13 +287,22 @@ viewing the categories as sets of characters. The following functions associate general categories with their name. @deftypefun {const char *} uc_general_category_name (uc_general_category_t @var{category}) -Returns the name of a general category. +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 +have a name. +@end deftypefun + +@deftypefun {const char *} uc_general_category_long_name (uc_general_category_t @var{category}) +Returns the long name of a general category. Returns NULL if the general category corresponds to a bit mask that does not have a name. @end deftypefun @deftypefun uc_general_category_t uc_general_category_byname (const char *@var{category_name}) -Returns the general category given by name, e.g@. @code{"Lu"}. +Returns the general category given by name, e.g@. @code{"Lu"}, or by long +name, e.g@. @code{"Uppercase Letter"}. +This lookup ignores spaces, underscores, or hyphens as word separators and is +case-insignificant. @end deftypefun The following functions view general categories as sets of Unicode characters. @@ -311,6 +326,7 @@ The following are the predefined general category value as bit masks. Additional general categories may be added in the future. @deftypevr Macro uint32_t UC_CATEGORY_MASK_L +@deftypevrx Macro uint32_t UC_CATEGORY_MASK_LC @deftypevrx Macro uint32_t UC_CATEGORY_MASK_Lu @deftypevrx Macro uint32_t UC_CATEGORY_MASK_Ll @deftypevrx Macro uint32_t UC_CATEGORY_MASK_Lt @@ -409,6 +425,10 @@ The canonical combining class value for ``Attached Below Left'' characters. The canonical combining class value for ``Attached Below'' characters. @end deftypevr +@deftypevr Constant int UC_CCC_ATA +The canonical combining class value for ``Attached Above'' characters. +@end deftypevr + @deftypevr Constant int UC_CCC_ATAR The canonical combining class value for ``Attached Above Right'' characters. @end deftypevr @@ -457,120 +477,155 @@ The canonical combining class value for ``Double Above'' characters. The canonical combining class value for ``Iota Subscript'' characters. @end deftypevr +The following functions associate canonical combining classes with their name. + +@deftypefun {const char *} uc_combining_class_name (int @var{ccc}) +Returns the name of a canonical combining class, more precisely, the +abbreviated name. +Returns NULL if the canonical combining class is a numeric value without a +name. +@end deftypefun + +@deftypefun {const char *} uc_combining_class_long_name (int @var{ccc}) +Returns the long name of a canonical combining class. +Returns NULL if the canonical combining class is a numeric value without a +name. +@end deftypefun + +@deftypefun int uc_combining_class_byname (const char *@var{ccc_name}) +Returns the canonical combining class given by name, e.g@. @code{"BL"}, or by +long name, e.g@. @code{"Below Left"}. +This lookup ignores spaces, underscores, or hyphens as word separators and is +case-insignificant. +@end deftypefun + The following function looks up the canonical combining class of a character. @deftypefun int uc_combining_class (ucs4_t @var{uc}) Returns the canonical combining class of a Unicode character. @end deftypefun -@node Bidirectional category -@section Bidirectional category +@node Bidi class +@section Bidi class +@cindex bidi class @cindex bidirectional category +@cindex Unicode character, bidi class @cindex Unicode character, bidirectional category -Every Unicode character or code point has a @emph{bidirectional category} -assigned to it. +Every Unicode character or code point has a @emph{bidi class} assigned to it. +Before Unicode 4.0, this concept was known as @emph{bidirectional category}. -The bidirectional category guides the bidirectional algorithm@texnl{} +The bidi class guides the bidirectional algorithm@texnl{} (@url{http://www.unicode.org/reports/tr9/}). The possible values are the following. @deftypevr Constant int UC_BIDI_L -The bidirectional category for `Left-to-Right`'' characters. +The bidi class for `Left-to-Right`'' characters. @end deftypevr @deftypevr Constant int UC_BIDI_LRE -The bidirectional category for ``Left-to-Right Embedding'' characters. +The bidi class for ``Left-to-Right Embedding'' characters. @end deftypevr @deftypevr Constant int UC_BIDI_LRO -The bidirectional category for ``Left-to-Right Override'' characters. +The bidi class for ``Left-to-Right Override'' characters. @end deftypevr @deftypevr Constant int UC_BIDI_R -The bidirectional category for ``Right-to-Left'' characters. +The bidi class for ``Right-to-Left'' characters. @end deftypevr @deftypevr Constant int UC_BIDI_AL -The bidirectional category for ``Right-to-Left Arabic'' characters. +The bidi class for ``Right-to-Left Arabic'' characters. @end deftypevr @deftypevr Constant int UC_BIDI_RLE -The bidirectional category for ``Right-to-Left Embedding'' characters. +The bidi class for ``Right-to-Left Embedding'' characters. @end deftypevr @deftypevr Constant int UC_BIDI_RLO -The bidirectional category for ``Right-to-Left Override'' characters. +The bidi class for ``Right-to-Left Override'' characters. @end deftypevr @deftypevr Constant int UC_BIDI_PDF -The bidirectional category for ``Pop Directional Format'' characters. +The bidi class for ``Pop Directional Format'' characters. @end deftypevr @deftypevr Constant int UC_BIDI_EN -The bidirectional category for ``European Number'' characters. +The bidi class for ``European Number'' characters. @end deftypevr @deftypevr Constant int UC_BIDI_ES -The bidirectional category for ``European Number Separator'' characters. +The bidi class for ``European Number Separator'' characters. @end deftypevr @deftypevr Constant int UC_BIDI_ET -The bidirectional category for ``European Number Terminator'' characters. +The bidi class for ``European Number Terminator'' characters. @end deftypevr @deftypevr Constant int UC_BIDI_AN -The bidirectional category for ``Arabic Number'' characters. +The bidi class for ``Arabic Number'' characters. @end deftypevr @deftypevr Constant int UC_BIDI_CS -The bidirectional category for ``Common Number Separator'' characters. +The bidi class for ``Common Number Separator'' characters. @end deftypevr @deftypevr Constant int UC_BIDI_NSM -The bidirectional category for ``Non-Spacing Mark'' characters. +The bidi class for ``Non-Spacing Mark'' characters. @end deftypevr @deftypevr Constant int UC_BIDI_BN -The bidirectional category for ``Boundary Neutral'' characters. +The bidi class for ``Boundary Neutral'' characters. @end deftypevr @deftypevr Constant int UC_BIDI_B -The bidirectional category for ``Paragraph Separator'' characters. +The bidi class for ``Paragraph Separator'' characters. @end deftypevr @deftypevr Constant int UC_BIDI_S -The bidirectional category for ``Segment Separator'' characters. +The bidi class for ``Segment Separator'' characters. @end deftypevr @deftypevr Constant int UC_BIDI_WS -The bidirectional category for ``Whitespace'' characters. +The bidi class for ``Whitespace'' characters. @end deftypevr @deftypevr Constant int UC_BIDI_ON -The bidirectional category for ``Other Neutral'' characters. +The bidi class for ``Other Neutral'' characters. @end deftypevr The following functions implement the association between a bidirectional category and its name. -@deftypefun {const char *} uc_bidi_category_name (int @var{category}) -Returns the name of a bidirectional category. +@deftypefun {const char *} uc_bidi_class_name (int @var{bidi_class}) +@deftypefunx {const char *} uc_bidi_category_name (int @var{category}) +Returns the name of a bidi class, more precisely, the abbreviated name. +@end deftypefun + +@deftypefun {const char *} uc_bidi_class_long_name (int @var{bidi_class}) +Returns the long name of a bidi class. @end deftypefun -@deftypefun int uc_bidi_category_byname (const char *@var{category_name}) -Returns the bidirectional category given by name, e.g@. @code{"LRE"}. +@deftypefun int uc_bidi_class_byname (const char *@var{bidi_class_name}) +@deftypefunx int uc_bidi_category_byname (const char *@var{category_name}) +Returns the bidi class given by name, e.g@. @code{"LRE"}, or by long name, +e.g@. @code{"Left-to-Right Embedding"}. +This lookup ignores spaces, underscores, or hyphens as word separators and is +case-insignificant. @end deftypefun The following functions view bidirectional categories as sets of Unicode characters. -@deftypefun int uc_bidi_category (ucs4_t @var{uc}) -Returns the bidirectional category of a Unicode character. +@deftypefun int uc_bidi_class (ucs4_t @var{uc}) +@deftypefunx int uc_bidi_category (ucs4_t @var{uc}) +Returns the bidi class of a Unicode character. @end deftypefun -@deftypefun bool uc_is_bidi_category (ucs4_t @var{uc}, int @var{category}) -Tests whether a Unicode character belongs to a given bidirectional category. +@deftypefun bool uc_is_bidi_class (ucs4_t @var{uc}, int @var{bidi_class}) +@deftypefunx bool uc_is_bidi_category (ucs4_t @var{uc}, int @var{category}) +Tests whether a Unicode character belongs to a given bidi class. @end deftypefun @node Decimal digit value @@ -647,6 +702,172 @@ Stores the mirrored character of a Unicode character @var{uc} in stores @var{uc} unmodified in @code{*@var{puc}} and returns @code{false}. @end deftypefun +@node Arabic shaping +@section Arabic shaping + +@cindex Arabic shaping +@cindex joining of Arabic characters +When Arabic characters are rendered, after bidi reordering has taken +place, the shape of the glyphs are modified so that many adjacent glyphs +are joined. Two character properties describe how this ``Arabic shaping'' +takes place: the joining type and the joining group. + +@menu +* Joining type:: +* Joining group:: +@end menu + +@node Joining type +@subsection Joining type of Arabic characters + +@cindex joining type +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 +neighbour characters are rendered depending on this character. + +The joining type has the following possible values: + +@deftypevr Constant int UC_JOINING_TYPE_U +``Non joining'': Characters of this joining type prohibit joining. +@end deftypevr + +@deftypevr Constant int UC_JOINING_TYPE_T +``Transparent'': Characters of this joining type are skipped when +considering joining. +@end deftypevr + +@deftypevr Constant int UC_JOINING_TYPE_C +``Join causing'': Characters of this joining type cause their neighbour +characters to change their shapes but don't change their own shape. +@end deftypevr + +@deftypevr Constant int UC_JOINING_TYPE_L +``Left joining'': Characters of this joining type have two shapes, +isolated and initial. Such characters currently don't exist. +@end deftypevr + +@deftypevr Constant int UC_JOINING_TYPE_R +``Right joining'': Characters of this joining type have two shapes, +isolated and final. +@end deftypevr + +@deftypevr Constant int UC_JOINING_TYPE_D +``Dual joining'': Characters of this joining type have four shapes, +initial, medial, final, and isolated. +@end deftypevr + +The following functions implement the association between a joining type +and its name. + +@deftypefun {const char *} uc_joining_type_name (int @var{joining_type}) +Returns the name of a joining type. +@end deftypefun + +@deftypefun {const char *} uc_joining_type_long_name (int @var{joining_type}) +Returns the long name of a joining type. +@end deftypefun + +@deftypefun int uc_joining_type_byname (const char *@var{joining_type_name}) +Returns the joining type given by name, e.g@. @code{"D"}, or by long name, +e.g@. @code{"Dual Joining}. +This lookup ignores spaces, underscores, or hyphens as word separators and is +case-insignificant. +@end deftypefun + +The following function gives the joining type of every Unicode character. + +@deftypefun int uc_joining_type (ucs4_t @var{uc}) +Returns the joining type of a Unicode character. +@end deftypefun + +@node Joining group +@subsection Joining group of Arabic characters + +@cindex joining group +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 +two contexts of right-joining characters. + +The joining group has the following possible values: + +@deftypevr Constant int UC_JOINING_GROUP_NONE +@deftypevrx Constant int UC_JOINING_GROUP_AIN +@deftypevrx Constant int UC_JOINING_GROUP_ALAPH +@deftypevrx Constant int UC_JOINING_GROUP_ALEF +@deftypevrx Constant int UC_JOINING_GROUP_BEH +@deftypevrx Constant int UC_JOINING_GROUP_BETH +@deftypevrx Constant int UC_JOINING_GROUP_BURUSHASKI_YEH_BARREE +@deftypevrx Constant int UC_JOINING_GROUP_DAL +@deftypevrx Constant int UC_JOINING_GROUP_DALATH_RISH +@deftypevrx Constant int UC_JOINING_GROUP_E +@deftypevrx Constant int UC_JOINING_GROUP_FARSI_YEH +@deftypevrx Constant int UC_JOINING_GROUP_FE +@deftypevrx Constant int UC_JOINING_GROUP_FEH +@deftypevrx Constant int UC_JOINING_GROUP_FINAL_SEMKATH +@deftypevrx Constant int UC_JOINING_GROUP_GAF +@deftypevrx Constant int UC_JOINING_GROUP_GAMAL +@deftypevrx Constant int UC_JOINING_GROUP_HAH +@deftypevrx Constant int UC_JOINING_GROUP_HE +@deftypevrx Constant int UC_JOINING_GROUP_HEH +@deftypevrx Constant int UC_JOINING_GROUP_HEH_GOAL +@deftypevrx Constant int UC_JOINING_GROUP_HETH +@deftypevrx Constant int UC_JOINING_GROUP_KAF +@deftypevrx Constant int UC_JOINING_GROUP_KAPH +@deftypevrx Constant int UC_JOINING_GROUP_KHAPH +@deftypevrx Constant int UC_JOINING_GROUP_KNOTTED_HEH +@deftypevrx Constant int UC_JOINING_GROUP_LAM +@deftypevrx Constant int UC_JOINING_GROUP_LAMADH +@deftypevrx Constant int UC_JOINING_GROUP_MEEM +@deftypevrx Constant int UC_JOINING_GROUP_MIM +@deftypevrx Constant int UC_JOINING_GROUP_NOON +@deftypevrx Constant int UC_JOINING_GROUP_NUN +@deftypevrx Constant int UC_JOINING_GROUP_NYA +@deftypevrx Constant int UC_JOINING_GROUP_PE +@deftypevrx Constant int UC_JOINING_GROUP_QAF +@deftypevrx Constant int UC_JOINING_GROUP_QAPH +@deftypevrx Constant int UC_JOINING_GROUP_REH +@deftypevrx Constant int UC_JOINING_GROUP_REVERSED_PE +@deftypevrx Constant int UC_JOINING_GROUP_SAD +@deftypevrx Constant int UC_JOINING_GROUP_SADHE +@deftypevrx Constant int UC_JOINING_GROUP_SEEN +@deftypevrx Constant int UC_JOINING_GROUP_SEMKATH +@deftypevrx Constant int UC_JOINING_GROUP_SHIN +@deftypevrx Constant int UC_JOINING_GROUP_SWASH_KAF +@deftypevrx Constant int UC_JOINING_GROUP_SYRIAC_WAW +@deftypevrx Constant int UC_JOINING_GROUP_TAH +@deftypevrx Constant int UC_JOINING_GROUP_TAW +@deftypevrx Constant int UC_JOINING_GROUP_TEH_MARBUTA +@deftypevrx Constant int UC_JOINING_GROUP_TEH_MARBUTA_GOAL +@deftypevrx Constant int UC_JOINING_GROUP_TETH +@deftypevrx Constant int UC_JOINING_GROUP_WAW +@deftypevrx Constant int UC_JOINING_GROUP_YEH +@deftypevrx Constant int UC_JOINING_GROUP_YEH_BARREE +@deftypevrx Constant int UC_JOINING_GROUP_YEH_WITH_TAIL +@deftypevrx Constant int UC_JOINING_GROUP_YUDH +@deftypevrx Constant int UC_JOINING_GROUP_YUDH_HE +@deftypevrx Constant int UC_JOINING_GROUP_ZAIN +@deftypevrx Constant int UC_JOINING_GROUP_ZHAIN +@end deftypevr + +The following functions implement the association between a joining group +and its name. + +@deftypefun {const char *} uc_joining_group_name (int @var{joining_group}) +Returns the name of a joining group. +@end deftypefun + +@deftypefun int uc_joining_group_byname (const char *@var{joining_group_name}) +Returns the joining group given by name, e.g@. @code{"Teh_Marbuta"}. +This lookup ignores spaces, underscores, or hyphens as word separators and is +case-insignificant. +@end deftypefun + +The following function gives the joining group of every Unicode character. + +@deftypefun int uc_joining_group (ucs4_t @var{uc}) +Returns the joining group of a Unicode character. +@end deftypefun + @node Properties @section Properties @@ -702,6 +923,13 @@ The following properties are related to case folding. @deftypevrx Constant uc_property_t UC_PROPERTY_LOWERCASE @deftypevrx Constant uc_property_t UC_PROPERTY_OTHER_LOWERCASE @deftypevrx Constant uc_property_t UC_PROPERTY_TITLECASE +@deftypevrx Constant uc_property_t UC_PROPERTY_CASED +@deftypevrx Constant uc_property_t UC_PROPERTY_CASE_IGNORABLE +@deftypevrx Constant uc_property_t UC_PROPERTY_CHANGES_WHEN_LOWERCASED +@deftypevrx Constant uc_property_t UC_PROPERTY_CHANGES_WHEN_UPPERCASED +@deftypevrx Constant uc_property_t UC_PROPERTY_CHANGES_WHEN_TITLECASED +@deftypevrx Constant uc_property_t UC_PROPERTY_CHANGES_WHEN_CASEFOLDED +@deftypevrx Constant uc_property_t UC_PROPERTY_CHANGES_WHEN_CASEMAPPED @deftypevrx Constant uc_property_t UC_PROPERTY_SOFT_DOTTED @end deftypevr @@ -794,12 +1022,16 @@ Other miscellaneous properties are: The following function looks up a property by its name. @deftypefun uc_property_t uc_property_byname (const char *@var{property_name}) -Returns the property given by name, e.g. @code{"White space"}. If a property +Returns the property given by name, e.g@. @code{"White space"}. If a property with the given name exists, the result will satisfy the @code{uc_property_is_valid} predicate. Otherwise the result will not satisfy this predicate and must not be passed to functions that expect an @code{uc_property_t} argument. +This lookup ignores spaces, underscores, or hyphens as word separators, is +case-insignificant, and supports the aliases listed in Unicode's +@file{PropertyAliases.txt} file. + This function references a big table of all predefined properties. Its use can significantly increase the size of your application. @end deftypefun @@ -840,6 +1072,13 @@ The following properties are related to case folding. @deftypefunx bool uc_is_property_lowercase (ucs4_t @var{uc}) @deftypefunx bool uc_is_property_other_lowercase (ucs4_t @var{uc}) @deftypefunx bool uc_is_property_titlecase (ucs4_t @var{uc}) +@deftypefunx bool uc_is_property_cased (ucs4_t @var{uc}) +@deftypefunx bool uc_is_property_case_ignorable (ucs4_t @var{uc}) +@deftypefunx bool uc_is_property_changes_when_lowercased (ucs4_t @var{uc}) +@deftypefunx bool uc_is_property_changes_when_uppercased (ucs4_t @var{uc}) +@deftypefunx bool uc_is_property_changes_when_titlecased (ucs4_t @var{uc}) +@deftypefunx bool uc_is_property_changes_when_casefolded (ucs4_t @var{uc}) +@deftypefunx bool uc_is_property_changes_when_casemapped (ucs4_t @var{uc}) @deftypefunx bool uc_is_property_soft_dotted (ucs4_t @var{uc}) @end deftypefun diff --git a/doc/unigbrk.texi b/doc/unigbrk.texi new file mode 100644 index 00000000..196bd9fd --- /dev/null +++ b/doc/unigbrk.texi @@ -0,0 +1,126 @@ +@node unigbrk.h +@chapter Grapheme cluster breaks in strings @code{<unigbrk.h>} + +@cindex grapheme cluster breaks +@cindex grapheme cluster boundaries +@cindex breaks, grapheme cluster +@cindex boundaries, between grapheme clusters +This include file declares functions for determining where in a string +``grapheme clusters'' start and end. A ``grapheme cluster'' is an +approximation to a user-perceived character, which sometimes +corresponds to multiple Unicode characters. Editing operations such as +mouse selection, cursor movement, and backspacing often operate on +grapheme clusters as units, not on individual characters. + +Some grapheme clusters are built from a base character and a combining +character. The letter @samp{@'e}, +for example, is most commonly represented in Unicode as a single +character U+00E8 @sc{LATIN SMALL LETTER E WITH ACUTE}. It is, +however, equally valid to use the pair of characters U+0065 @sc{LATIN +SMALL LETTER E} followed by U+0301 @sc{COMBINING ACUTE ACCENT}. Since +the user would perceive this pair of characters as a single character, +they would be grouped into a single grapheme cluster. + +But there are also grapheme clusters that consist of several base characters. +For example, a Devanagari letter and a Devanagari vowel sign that follows it +may form a grapheme cluster. Similarly, some pairs of Thai characters and +Hangul syllables (formed by two or three Hangul characters) are grapheme +clusters. + +@menu +* Grapheme cluster breaks in a string:: +* Grapheme cluster break property:: +@end menu + +@node Grapheme cluster breaks in a string +@section Grapheme cluster breaks in a string + +The following functions find a single boundary between grapheme +clusters in a string. + +@deftypefun void u8_grapheme_next (const uint8_t *@var{s}, const uint8_t *@var{end}) +@deftypefunx void u16_grapheme_next (const uint16_t *@var{s}, const uint16_t *@var{end}) +@deftypefunx void u32_grapheme_next (const uint32_t *@var{s}, const uint32_t *@var{end}) +Returns the start of the next grapheme cluster following @var{s}, +or @var{end} if no grapheme cluster break is encountered before it. +Returns NULL if and only if @code{@var{s} == @var{end}}. +@end deftypefun + +@deftypefun void u8_grapheme_prev (const uint8_t *@var{s}, const uint8_t *@var{start}) +@deftypefunx void u16_grapheme_prev (const uint16_t *@var{s}, const uint16_t *@var{start}) +@deftypefunx void u32_grapheme_prev (const uint32_t *@var{s}, const uint32_t *@var{start}) +Returns the start of the grapheme cluster preceding @var{s}, or +@var{start} if no grapheme cluster break is encountered before it. +Returns NULL if and only if @code{@var{s} == @var{start}}. +@end deftypefun + +The following functions determine all of the grapheme cluster +boundaries in a string. + +@deftypefun void u8_grapheme_breaks (const uint8_t *@var{s}, size_t @var{n}, char *@var{p}) +@deftypefunx void u16_grapheme_breaks (const uint16_t *@var{s}, size_t @var{n}, char *@var{p}) +@deftypefunx void u32_grapheme_breaks (const uint32_t *@var{s}, size_t @var{n}, char *@var{p}) +@deftypefunx void ulc_grapheme_breaks (const char *@var{s}, size_t @var{n}, char *@var{p}) +Determines the grapheme cluster break points in @var{s}, an array of +@var{n} units, and stores the result at @code{@var{p}[0..@var{n}-1]}. +@table @asis +@item @code{@var{p}[i] = 1} +means that there is a grapheme cluster boundary between +@code{@var{s}[i-1]} and @code{@var{s}[i]}. +@item @code{@var{p}[i] = 0} +means that @code{@var{s}[i-1]} and @code{@var{s}[i]} are part of the +same grapheme cluster. +@end table +@code{@var{p}[0]} is always set to 1, because there is always a +grapheme cluster break at start of text. +@end deftypefun + +@node Grapheme cluster break property +@section Grapheme cluster break property + +This is a more low-level API. The grapheme cluster break property is a +property defined in Unicode Standard Annex #29, section ``Grapheme Cluster +Boundaries'', see +@url{http://www.unicode.org/reports/tr29/#Grapheme_Cluster_Boundaries}.@texnl{} +It is used for determining the grapheme cluster breaks in a string. + +The following are the possible values of the grapheme cluster break +property. More values may be added in the future. + +@deftypevr Constant int GBP_OTHER +@deftypevrx Constant int GBP_CR +@deftypevrx Constant int GBP_LF +@deftypevrx Constant int GBP_CONTROL +@deftypevrx Constant int GBP_EXTEND +@deftypevrx Constant int GBP_PREPEND +@deftypevrx Constant int GBP_SPACINGMARK +@deftypevrx Constant int GBP_L +@deftypevrx Constant int GBP_V +@deftypevrx Constant int GBP_T +@deftypevrx Constant int GBP_LV +@deftypevrx Constant int GBP_LVT +@end deftypevr + +The following function looks up the grapheme cluster break property of a +character. + +@deftypefun int uc_graphemeclusterbreak_property (ucs4_t @var{uc}) +Returns the Grapheme_Cluster_Break property of a Unicode character. +@end deftypefun + +The following function determines whether there is a grapheme cluster +break between two Unicode characters. It is the primitive upon which +the higher-level functions in the previous section are directly based. + +@deftypefun bool uc_is_grapheme_break (ucs4_t @var{a}, ucs4_t @var{b}) +Returns true if there is an grapheme cluster boundary between Unicode +characters @var{a} and @var{b}. + +There is always a grapheme cluster break at the start or end of text. +You can specify zero for @var{a} or @var{b} to indicate start of text or end +of text, respectively. + +This implements the extended (not legacy) grapheme cluster rules +described in the Unicode standard, because the standard says that they +are preferred. +@end deftypefun diff --git a/doc/uniname.texi b/doc/uniname.texi index 66461be5..fa571470 100644 --- a/doc/uniname.texi +++ b/doc/uniname.texi @@ -23,7 +23,8 @@ Returns the filled @var{buf}, or NULL if the character does not have a name. @deftypefun ucs4_t unicode_name_character (const char *@var{name}) Looks up the Unicode character with a given name, in upper- or lowercase -ASCII. Returns the character if found, or @code{UNINAME_INVALID} if not found. +ASCII. @var{NAME} can also be an alias name of a character. +Returns the character if found, or @code{UNINAME_INVALID} if not found. @end deftypefun @deftypevr Macro ucs4_t UNINAME_INVALID diff --git a/doc/uninorm.texi b/doc/uninorm.texi index d4206d50..6797fe85 100644 --- a/doc/uninorm.texi +++ b/doc/uninorm.texi @@ -28,7 +28,7 @@ Denotes canonical decomposition. @end deftypevr @deftypevr Constant int UC_DECOMP_FONT -UCD marker: @code{<font>}. Denotes a font variant (e.g. a blackletter form). +UCD marker: @code{<font>}. Denotes a font variant (e.g@. a blackletter form). @end deftypevr @deftypevr Constant int UC_DECOMP_NOBREAK diff --git a/doc/unistr.texi b/doc/unistr.texi index ad04f425..60f1daa4 100644 --- a/doc/unistr.texi +++ b/doc/unistr.texi @@ -17,6 +17,7 @@ essentially the equivalent of what @code{<string.h>} is for C strings. @cindex validity @cindex verification +@cindex well-formed The following function is available to verify the integrity of a Unicode string. @deftypefun {const uint8_t *} u8_check (const uint8_t *@var{s}, size_t @var{n}) @@ -266,8 +267,10 @@ character in a Unicode string. @deftypefunx {const uint16_t *} u16_prev (ucs4_t *@var{puc}, const uint16_t *@var{s}, const uint16_t *@var{start}) @deftypefunx {const uint32_t *} u32_prev (ucs4_t *@var{puc}, const uint32_t *@var{s}, const uint32_t *@var{start}) Backward iteration step. Advances the pointer to point to the previous -character, or returns NULL if the beginning of the string had been reached. +character (the one that ends at @code{@var{s}}), or returns NULL if the +beginning of the string (specified by @code{@var{start}}) had been reached. 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 The following functions determine the length of a Unicode string. diff --git a/doc/uniwbrk.texi b/doc/uniwbrk.texi index 6f06b926..08c273c2 100644 --- a/doc/uniwbrk.texi +++ b/doc/uniwbrk.texi @@ -2,7 +2,9 @@ @chapter Word breaks in strings @code{<uniwbrk.h>} @cindex word breaks +@cindex word boundaries @cindex breaks, word +@cindex boundaries, between words This include file declares functions for determining where in a string ``words'' start and end. Here ``words'' are not necessarily the same as entities that can be looked up in dictionaries, but rather groups of diff --git a/doc/version.texi b/doc/version.texi index 4384b70b..745f9945 100644 --- a/doc/version.texi +++ b/doc/version.texi @@ -1,4 +1,4 @@ -@set UPDATED 1 January 2010 -@set UPDATED-MONTH January 2010 -@set EDITION 0.9.3 -@set VERSION 0.9.3 +@set UPDATED 27 July 2012 +@set UPDATED-MONTH July 2012 +@set EDITION 0.9.6 +@set VERSION 0.9.6 |