summaryrefslogtreecommitdiff
path: root/tests/unigbrk/test-u32-grapheme-next.c
diff options
context:
space:
mode:
authorStephen Kitt <skitt@debian.org>2016-05-27 10:11:04 +0200
committerManuel A. Fernandez Montecelo <manuel.montezelo@gmail.com>2016-05-27 14:28:33 +0100
commit752fd7247bc223bcea35bd89cf56d1c08ead9ba6 (patch)
treeb4a428f847a963738faaf24c8eff070fdb03a3a5 /tests/unigbrk/test-u32-grapheme-next.c
parent9f7d4fa477ff2a51d7c932b13d57ac22dc033105 (diff)
parenta9a31b1de5776a3b08a82101a4fa711294f0dd1d (diff)
Imported Debian patch 0.9.6+really0.9.3-0.1debian/0.9.6+really0.9.3-0.1
Diffstat (limited to 'tests/unigbrk/test-u32-grapheme-next.c')
-rw-r--r--tests/unigbrk/test-u32-grapheme-next.c103
1 files changed, 0 insertions, 103 deletions
diff --git a/tests/unigbrk/test-u32-grapheme-next.c b/tests/unigbrk/test-u32-grapheme-next.c
deleted file mode 100644
index 4fc6498..0000000
--- a/tests/unigbrk/test-u32-grapheme-next.c
+++ /dev/null
@@ -1,103 +0,0 @@
-/* Next grapheme cluster length test.
- Copyright (C) 2010-2015 Free Software Foundation, Inc.
-
- 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/>. */
-
-/* Written by Ben Pfaff <blp@cs.stanford.edu>, 2010. */
-
-#include <config.h>
-
-/* Specification. */
-#include <unigbrk.h>
-
-#include <stdio.h>
-#include <stdarg.h>
-#include <stdlib.h>
-
-#include "macros.h"
-
-static void
-test_u32_grapheme_next (size_t len, ...)
-{
- const uint32_t *next;
- uint32_t s[32];
- va_list args;
- size_t n;
-
- va_start (args, len);
- n = 0;
- for (;;)
- {
- int unit = va_arg (args, int);
- if (unit == -1)
- break;
- else if (n >= sizeof s / sizeof *s)
- abort ();
-
- s[n++] = unit;
- }
- va_end (args);
-
- next = u32_grapheme_next (s, s + n);
- if (next != s + len)
- {
- size_t i;
-
- if (next == NULL)
- fputs ("u32_grapheme_next returned NULL", stderr);
- else
- fprintf (stderr, "u32_grapheme_next skipped %zu units", next - s);
- fprintf (stderr, ", expected %zu:\n", len);
- for (i = 0; i < n; i++)
- fprintf (stderr, " %04x", s[i]);
- putc ('\n', stderr);
- abort ();
- }
-}
-
-int
-main (void)
-{
- static const uint32_t s[] = { 'a', 'b', 'c' };
-
- /* Empty string. */
- ASSERT (u32_grapheme_next (NULL, NULL) == NULL);
- ASSERT (u32_grapheme_next (s, s) == NULL);
-
- /* Standalone 1-unit graphemes. */
- test_u32_grapheme_next (1, 'a', -1);
- test_u32_grapheme_next (1, 'a', 'b', -1);
- test_u32_grapheme_next (1, 'a', 'b', 'c', -1);
-
- /* Multi-unit, single code point graphemes. */
-#define HIRAGANA_A 0x3042 /* あ: Hiragana letter 'a'. */
- test_u32_grapheme_next (1, HIRAGANA_A, -1);
- test_u32_grapheme_next (1, HIRAGANA_A, 'x', -1);
- test_u32_grapheme_next (1, HIRAGANA_A, HIRAGANA_A, -1);
-
- /* Combining accents. */
-#define GRAVE 0x0300 /* Combining grave accent. */
-#define ACUTE 0x0301 /* Combining acute accent. */
- test_u32_grapheme_next (2, 'e', ACUTE, -1);
- test_u32_grapheme_next (3, 'e', ACUTE, GRAVE, -1);
- test_u32_grapheme_next (2, 'e', ACUTE, 'x', -1);
- test_u32_grapheme_next (2, 'e', ACUTE, 'e', ACUTE, -1);
-
- /* Outside BMP. */
-#define NEUTRAL_FACE 0x1f610 /* 😐: neutral face. */
- test_u32_grapheme_next (1, NEUTRAL_FACE, -1);
- test_u32_grapheme_next (2, NEUTRAL_FACE, GRAVE, -1);
-
- return 0;
-}