summaryrefslogtreecommitdiff
path: root/tests/unigbrk/test-u8-grapheme-next.c
blob: 10dea9d0d4d32cc5f7fd8d8ef90546b0a71c275a (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
/* Next grapheme cluster length test.
   Copyright (C) 2010-2024 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 "macros.h"

static void
test_u8_grapheme_next (const char *input, size_t n, size_t len)
{
  const uint8_t *s = (const uint8_t *) input;
  const uint8_t *next = u8_grapheme_next (s, s + n);
  if (next != s + len)
    {
      size_t i;

      if (next == NULL)
        fputs ("u8_grapheme_next returned NULL", stderr);
      else
        fprintf (stderr, "u8_grapheme_next skipped %tu bytes", next - s);
      fprintf (stderr, ", expected %zu:\n", len);
      for (i = 0; i < n; i++)
        fprintf (stderr, " %02x", s[i]);
      putc ('\n', stderr);
      fflush (stderr);
      abort ();
    }
}

int
main (void)
{
  static const uint8_t s[] = "abc";

  /* Empty string. */
  ASSERT (u8_grapheme_next (NULL, NULL) == NULL);
  ASSERT (u8_grapheme_next (s, s) == NULL);

  /* Standalone 1-unit graphemes.  */
  test_u8_grapheme_next ("a", 1, 1);
  test_u8_grapheme_next ("ab", 2, 1);
  test_u8_grapheme_next ("abc", 3, 1);

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

  /* Combining accents. */
#define GRAVE "\314\200"        /* Combining grave accent. */
#define ACUTE "\314\201"        /* Combining acute accent. */
  test_u8_grapheme_next ("e"ACUTE, 3, 3);
  test_u8_grapheme_next ("e"ACUTE GRAVE, 5, 5);
  test_u8_grapheme_next ("e"ACUTE"x", 4, 3);
  test_u8_grapheme_next ("e"ACUTE "e"ACUTE, 6, 3);

  return 0;
}