summaryrefslogtreecommitdiff
path: root/tests/unigbrk/test-u8-grapheme-breaks.c
blob: d6f3d55a0f918986c74c92c5db978eaf0eabb2d0 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
/* Grapheme cluster breaks test.
   Copyright (C) 2010-2022 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 <https://www.gnu.org/licenses/>.  */

/* Written by Ben Pfaff <blp@cs.stanford.edu>, 2010. */

#include <config.h>

/* Specification. */
#include <unigbrk.h>

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

#include "macros.h"

static void
test_u8_grapheme_breaks (const char *input, const char *expected)
{
  const uint8_t *s = (const uint8_t *) input;
  size_t n = strlen (expected);
  char *breaks;
  size_t i;

  breaks = malloc (n);
  if (!breaks)
    abort ();
  memset (breaks, 0xcc, n);

  u8_grapheme_breaks (s, n, breaks);
  for (i = 0; i < n; i++)
    if (breaks[i] != (expected[i] == '#'))
      {
        size_t j;

        fprintf (stderr, "wrong grapheme breaks:\n");

        fprintf (stderr, "   input:");
        for (j = 0; j < n; j++)
          fprintf (stderr, " %02x", s[j]);
        putc ('\n', stderr);

        fprintf (stderr, "expected:");
        for (j = 0; j < n; j++)
          fprintf (stderr, "  %d", expected[j] == '#');
        putc ('\n', stderr);

        fprintf (stderr, "  actual:");
        for (j = 0; j < n; j++)
          fprintf (stderr, "  %d", breaks[j]);
        putc ('\n', stderr);

        abort ();
      }

  free (breaks);
}

int
main (void)
{
  /* Standalone 1-unit graphemes.  */
  test_u8_grapheme_breaks ("a", "#");
  test_u8_grapheme_breaks ("ab", "##");
  test_u8_grapheme_breaks ("abc", "###");

  /* Multi-unit, single code point graphemes. */
#define HIRAGANA_A "\343\201\202" /* あ: Hiragana letter 'a'. */
  test_u8_grapheme_breaks (HIRAGANA_A, "#__");
  test_u8_grapheme_breaks (HIRAGANA_A"x", "#__#");
  test_u8_grapheme_breaks (HIRAGANA_A HIRAGANA_A, "#__#__");

  /* Combining accents. */
#define GRAVE "\314\200"        /* Combining grave accent. */
#define ACUTE "\314\201"        /* Combining acute accent. */
  test_u8_grapheme_breaks ("e"ACUTE, "#__");
  test_u8_grapheme_breaks ("e"ACUTE GRAVE, "#____");
  test_u8_grapheme_breaks ("e"ACUTE"x", "#__#");
  test_u8_grapheme_breaks ("e"ACUTE "e"ACUTE, "#__#__");

  /* CR LF handling.  */
  test_u8_grapheme_breaks ("a\nb\rc\r\nd", "######_#");

  /* Emoji modifier / ZWJ sequence. */
  test_u8_grapheme_breaks ("\342\230\205\314\205\315\207\342\200\215\342\230\200",
                           "#____________");

  /* Regional indicators. */
  test_u8_grapheme_breaks (".\360\237\207\251\360\237\207\252\360\237\207\253\360\237\207\267.",
                           "##_______#_______#");

  return 0;
}