summaryrefslogtreecommitdiff
path: root/lib/unigbrk/u16-grapheme-breaks.c
diff options
context:
space:
mode:
authorManuel A. Fernandez Montecelo <manuel.montezelo@gmail.com>2016-05-26 16:48:15 +0100
committerManuel A. Fernandez Montecelo <manuel.montezelo@gmail.com>2016-05-26 16:48:15 +0100
commit5f2b09982312c98863eb9a8dfe2c608b81f58259 (patch)
treee5d38581c2f36e1cca02efedd2d85044d77f76f9 /lib/unigbrk/u16-grapheme-breaks.c
parent3e0814cd9862b89c7a39672672937477bd87ddfb (diff)
Imported Upstream version 0.9.6upstream/0.9.6
Diffstat (limited to 'lib/unigbrk/u16-grapheme-breaks.c')
-rw-r--r--lib/unigbrk/u16-grapheme-breaks.c44
1 files changed, 44 insertions, 0 deletions
diff --git a/lib/unigbrk/u16-grapheme-breaks.c b/lib/unigbrk/u16-grapheme-breaks.c
new file mode 100644
index 0000000..981b2a6
--- /dev/null
+++ b/lib/unigbrk/u16-grapheme-breaks.c
@@ -0,0 +1,44 @@
+/* Grapheme cluster breaks function.
+ Copyright (C) 2010-2015 Free Software Foundation, Inc.
+ Written by Ben Pfaff <blp@cs.stanford.edu>, 2010.
+
+ This program is free software: you can redistribute it and/or modify it
+ under the terms of the GNU Lesser 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
+ Lesser General Public License for more details.
+
+ You should have received a copy of the GNU Lesser General Public License
+ along with this program. If not, see <http://www.gnu.org/licenses/>. */
+
+#include <config.h>
+
+/* Specification. */
+#include "unigbrk.h"
+
+#include "unistr.h"
+
+void
+u16_grapheme_breaks (const uint16_t *s, size_t n, char *p)
+{
+ ucs4_t prev;
+ int mblen;
+
+ prev = 0;
+ for (; n > 0; s += mblen, p += mblen, n -= mblen)
+ {
+ ucs4_t next;
+
+ mblen = u16_mbtouc (&next, s, n);
+
+ p[0] = uc_is_grapheme_break (prev, next);
+ if (mblen > 1)
+ p[1] = 0;
+
+ prev = next;
+ }
+}