Updated raqm to 0.8.0

This commit is contained in:
Andrew Murray 2022-01-28 22:04:57 +11:00
parent 1c622714f0
commit 04a3ac32a0
6 changed files with 348 additions and 113 deletions

View File

@ -1,7 +1,7 @@
The MIT License (MIT) The MIT License (MIT)
Copyright © 2015 Information Technology Authority (ITA) <foss@ita.gov.om> Copyright © 2015 Information Technology Authority (ITA) <foss@ita.gov.om>
Copyright © 2016 Khaled Hosny <khaledhosny@eglug.org> Copyright © 2016-2021 Khaled Hosny <khaled@aliftype.com>
Permission is hereby granted, free of charge, to any person obtaining a copy Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal of this software and associated documentation files (the "Software"), to deal

View File

@ -1,4 +1,18 @@
Overview of changes leading to 0.7.1 Overview of changes leading to 0.8.0
Monday, December 13, 2021
====================================
Remove autotools build.
Support using SheenBiDi instead of FriBiDi for Unicode BiDi support.
Fix running tests with Python <= 3.6.
New API:
* raqm_get_par_resolved_direction
* raqm_get_direction_at_index
Overview of changes leading to 0.7.2
Monday, September 27, 2021 Monday, September 27, 2021
==================================== ====================================

View File

@ -6,26 +6,26 @@ Raqm
Raqm is a small library that encapsulates the logic for complex text layout and Raqm is a small library that encapsulates the logic for complex text layout and
provides a convenient API. provides a convenient API.
It currently provides bidirectional text support (using [FriBiDi][1]), shaping It currently provides bidirectional text support (using [FriBiDi][1] or
(using [HarfBuzz][2]), and proper script itemization. As a result, [SheenBidi][2]), shaping (using [HarfBuzz][3]), and proper script itemization.
Raqm can support most writing systems covered by Unicode. As a result, Raqm can support most writing systems covered by Unicode.
The documentation can be accessed on the web at: The documentation can be accessed on the web at:
> http://host-oman.github.io/libraqm/ > http://host-oman.github.io/libraqm/
Raqm (Arabic: رَقْم) is writing, also number or digit and the Arabic word for Raqm (Arabic: رَقْم) is writing, also number or digit and the Arabic word for
digital (رَقَمِيّ) shares the same root, so it is a play on “digital writing”. digital (رَقَمِيّ) shares the same root, so it is a play on “digital writing”.
Building Building
-------- --------
Raqm depends on the following libraries: Raqm depends on the following libraries:
* [FreeType][3] * [FreeType][4]
* [HarfBuzz][2] * [HarfBuzz][3]
* [FriBiDi][1] * [FriBiDi][1] or [SheenBidi][2]
To build the documentation you will also need: To build the documentation you will also need:
* [GTK-Doc][4] * [GTK-Doc][5]
To install dependencies on Fedora: To install dependencies on Fedora:
@ -48,11 +48,11 @@ directory:
$ ninja -C build $ ninja -C build
$ ninja -C build install $ ninja -C build install
To build the documentation, pass `-Ddocs=enable` to the `meson`. To build the documentation, pass `-Ddocs=true` to the `meson`.
To run the tests: To run the tests:
$ ninja -C test $ ninja -C build test
Contributing Contributing
------------ ------------
@ -78,6 +78,7 @@ The following projects have patches to support complex text layout using Raqm:
[1]: http://fribidi.org [1]: http://fribidi.org
[2]: http://harfbuzz.org [2]: https://github.com/Tehreer/SheenBidi
[3]: https://www.freetype.org [3]: http://harfbuzz.org
[4]: https://www.gtk.org/gtk-doc [4]: https://www.freetype.org
[5]: https://www.gtk.org/gtk-doc

View File

@ -32,10 +32,10 @@
#define _RAQM_VERSION_H_ #define _RAQM_VERSION_H_
#define RAQM_VERSION_MAJOR 0 #define RAQM_VERSION_MAJOR 0
#define RAQM_VERSION_MINOR 7 #define RAQM_VERSION_MINOR 8
#define RAQM_VERSION_MICRO 2 #define RAQM_VERSION_MICRO 0
#define RAQM_VERSION_STRING "0.7.2" #define RAQM_VERSION_STRING "0.8.0"
#define RAQM_VERSION_ATLEAST(major,minor,micro) \ #define RAQM_VERSION_ATLEAST(major,minor,micro) \
((major)*10000+(minor)*100+(micro) <= \ ((major)*10000+(minor)*100+(micro) <= \

View File

@ -1,6 +1,6 @@
/* /*
* Copyright © 2015 Information Technology Authority (ITA) <foss@ita.gov.om> * Copyright © 2015 Information Technology Authority (ITA) <foss@ita.gov.om>
* Copyright © 2016 Khaled Hosny <khaledhosny@eglug.org> * Copyright © 2016-2021 Khaled Hosny <khaled@aliftype.com>
* *
* Permission is hereby granted, free of charge, to any person obtaining a copy * Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to * of this software and associated documentation files (the "Software"), to
@ -30,11 +30,18 @@
#include <assert.h> #include <assert.h>
#include <string.h> #include <string.h>
#ifdef RAQM_SHEENBIDI
#include <SheenBidi.h>
#else
#ifdef HAVE_FRIBIDI_SYSTEM #ifdef HAVE_FRIBIDI_SYSTEM
#include <fribidi.h> #include <fribidi.h>
#else #else
#include "../fribidi-shim/fribidi.h" #include "../fribidi-shim/fribidi.h"
#endif #endif
#if FRIBIDI_MAJOR_VERSION >= 1
#define USE_FRIBIDI_EX_API
#endif
#endif
#include <hb.h> #include <hb.h>
#include <hb-ft.h> #include <hb-ft.h>
@ -56,10 +63,6 @@
#include "raqm.h" #include "raqm.h"
#if FRIBIDI_MAJOR_VERSION >= 1
#define USE_FRIBIDI_EX_API
#endif
/** /**
* SECTION:raqm * SECTION:raqm
* @title: Raqm * @title: Raqm
@ -178,6 +181,15 @@
# define RAQM_TEST(...) # define RAQM_TEST(...)
#endif #endif
#define RAQM_BIDI_LEVEL_IS_RTL(level) \
((level) & 1)
#ifdef RAQM_SHEENBIDI
typedef SBLevel _raqm_bidi_level_t;
#else
typedef FriBidiLevel _raqm_bidi_level_t;
#endif
typedef enum { typedef enum {
RAQM_FLAG_NONE = 0, RAQM_FLAG_NONE = 0,
RAQM_FLAG_UTF8 = 1 << 0 RAQM_FLAG_UTF8 = 1 << 0
@ -438,6 +450,53 @@ raqm_set_text (raqm_t *rq,
return true; return true;
} }
static void *
_raqm_get_utf8_codepoint (const void *str,
uint32_t *out_codepoint)
{
const char *s = (const char *)str;
if (0xf0 == (0xf8 & s[0]))
{
*out_codepoint = ((0x07 & s[0]) << 18) | ((0x3f & s[1]) << 12) | ((0x3f & s[2]) << 6) | (0x3f & s[3]);
s += 4;
}
else if (0xe0 == (0xf0 & s[0]))
{
*out_codepoint = ((0x0f & s[0]) << 12) | ((0x3f & s[1]) << 6) | (0x3f & s[2]);
s += 3;
}
else if (0xc0 == (0xe0 & s[0]))
{
*out_codepoint = ((0x1f & s[0]) << 6) | (0x3f & s[1]);
s += 2;
}
else
{
*out_codepoint = s[0];
s += 1;
}
return (void *)s;
}
static size_t
_raqm_u8_to_u32 (const char *text, size_t len, uint32_t *unicode)
{
size_t in_len = 0;
uint32_t *out_utf32 = unicode;
const char *in_utf8 = text;
while ((*in_utf8 != '\0') && (in_len < len))
{
in_utf8 = _raqm_get_utf8_codepoint (in_utf8, out_utf32);
++out_utf32;
++in_len;
}
return (out_utf32 - unicode);
}
/** /**
* raqm_set_text_utf8: * raqm_set_text_utf8:
* @rq: a #raqm_t. * @rq: a #raqm_t.
@ -482,9 +541,7 @@ raqm_set_text_utf8 (raqm_t *rq,
memcpy (rq->text_utf8, text, sizeof (char) * len); memcpy (rq->text_utf8, text, sizeof (char) * len);
ulen = fribidi_charset_to_unicode (FRIBIDI_CHAR_SET_UTF8, ulen = _raqm_u8_to_u32 (text, len, unicode);
text, len, unicode);
ok = raqm_set_text (rq, unicode, ulen); ok = raqm_set_text (rq, unicode, ulen);
free (unicode); free (unicode);
@ -504,7 +561,7 @@ raqm_set_text_utf8 (raqm_t *rq,
* *
* The default is #RAQM_DIRECTION_DEFAULT, which determines the paragraph * The default is #RAQM_DIRECTION_DEFAULT, which determines the paragraph
* direction based on the first character with strong bidi type (see [rule * direction based on the first character with strong bidi type (see [rule
* P2](https://unicode.org/reports/tr9/#P2) in Unicode Bidirectional Algorithm), * P2](http://unicode.org/reports/tr9/#P2) in Unicode Bidirectional Algorithm),
* which can be good enough for many cases but has problems when a mainly * which can be good enough for many cases but has problems when a mainly
* right-to-left paragraph starts with a left-to-right character and vice versa * right-to-left paragraph starts with a left-to-right character and vice versa
* as the detected paragraph direction will be the wrong one, or when text does * as the detected paragraph direction will be the wrong one, or when text does
@ -971,17 +1028,78 @@ raqm_get_glyphs (raqm_t *rq,
return rq->glyphs; return rq->glyphs;
} }
/**
* raqm_get_par_resolved_direction:
* @rq: a #raqm_t.
*
* Gets the resolved direction of the paragraph;
*
* Return value:
* The #raqm_direction_t specifying the resolved direction of text,
* or #RAQM_DIRECTION_DEFAULT if raqm_layout() has not been called on @rq.
*
* Since: 0.8
*/
RAQM_API raqm_direction_t
raqm_get_par_resolved_direction (raqm_t *rq)
{
if (!rq)
return RAQM_DIRECTION_DEFAULT;
return rq->resolved_dir;
}
/**
* raqm_get_direction_at_index:
* @rq: a #raqm_t.
* @index: (in): character index.
*
* Gets the resolved direction of the character at specified index;
*
* Return value:
* The #raqm_direction_t specifying the resolved direction of text at the
* specified index, or #RAQM_DIRECTION_DEFAULT if raqm_layout() has not been
* called on @rq.
*
* Since: 0.8
*/
RAQM_API raqm_direction_t
raqm_get_direction_at_index (raqm_t *rq,
size_t index)
{
if (!rq)
return RAQM_DIRECTION_DEFAULT;
for (raqm_run_t *run = rq->runs; run != NULL; run = run->next)
{
if (run->pos <= index && index < run->pos + run->len) {
switch (run->direction) {
case HB_DIRECTION_LTR:
return RAQM_DIRECTION_LTR;
case HB_DIRECTION_RTL:
return RAQM_DIRECTION_RTL;
case HB_DIRECTION_TTB:
return RAQM_DIRECTION_TTB;
default:
return RAQM_DIRECTION_DEFAULT;
}
}
}
return RAQM_DIRECTION_DEFAULT;
}
static bool static bool
_raqm_resolve_scripts (raqm_t *rq); _raqm_resolve_scripts (raqm_t *rq);
static hb_direction_t static hb_direction_t
_raqm_hb_dir (raqm_t *rq, FriBidiLevel level) _raqm_hb_dir (raqm_t *rq, _raqm_bidi_level_t level)
{ {
hb_direction_t dir = HB_DIRECTION_LTR; hb_direction_t dir = HB_DIRECTION_LTR;
if (rq->base_dir == RAQM_DIRECTION_TTB) if (rq->base_dir == RAQM_DIRECTION_TTB)
dir = HB_DIRECTION_TTB; dir = HB_DIRECTION_TTB;
else if (FRIBIDI_LEVEL_IS_RTL (level)) else if (RAQM_BIDI_LEVEL_IS_RTL(level))
dir = HB_DIRECTION_RTL; dir = HB_DIRECTION_RTL;
return dir; return dir;
@ -990,9 +1108,65 @@ _raqm_hb_dir (raqm_t *rq, FriBidiLevel level)
typedef struct { typedef struct {
size_t pos; size_t pos;
size_t len; size_t len;
FriBidiLevel level; _raqm_bidi_level_t level;
} _raqm_bidi_run; } _raqm_bidi_run;
#ifdef RAQM_SHEENBIDI
static _raqm_bidi_run *
_raqm_bidi_itemize (raqm_t *rq, size_t *run_count)
{
_raqm_bidi_run *runs;
SBAlgorithmRef bidi;
SBParagraphRef par;
SBUInteger par_len;
SBLineRef line;
SBLevel base_level = SBLevelDefaultLTR;
SBCodepointSequence input = {
SBStringEncodingUTF32,
(void *) rq->text,
rq->text_len
};
if (rq->base_dir == RAQM_DIRECTION_RTL)
base_level = 1;
else if (rq->base_dir == RAQM_DIRECTION_LTR)
base_level = 0;
/* paragraph */
bidi = SBAlgorithmCreate (&input);
par = SBAlgorithmCreateParagraph (bidi, 0, INT32_MAX, base_level);
par_len = SBParagraphGetLength (par);
/* lines */
line = SBParagraphCreateLine (par, 0, par_len);
*run_count = SBLineGetRunCount (line);
if (SBParagraphGetBaseLevel (par) == 0)
rq->resolved_dir = RAQM_DIRECTION_LTR;
else
rq->resolved_dir = RAQM_DIRECTION_RTL;
runs = malloc (sizeof (_raqm_bidi_run) * (*run_count));
if (runs)
{
const SBRun *sheenbidi_runs = SBLineGetRunsPtr(line);
for (size_t i = 0; i < (*run_count); ++i)
{
runs[i].pos = sheenbidi_runs[i].offset;
runs[i].len = sheenbidi_runs[i].length;
runs[i].level = sheenbidi_runs[i].level;
}
}
SBLineRelease (line);
SBParagraphRelease (par);
SBAlgorithmRelease (bidi);
return runs;
}
#else
static void static void
_raqm_reverse_run (_raqm_bidi_run *run, const size_t len) _raqm_reverse_run (_raqm_bidi_run *run, const size_t len)
{ {
@ -1093,19 +1267,78 @@ _raqm_reorder_runs (const FriBidiCharType *types,
return runs; return runs;
} }
static bool static _raqm_bidi_run *
_raqm_itemize (raqm_t *rq) _raqm_bidi_itemize (raqm_t *rq, size_t *run_count)
{ {
FriBidiParType par_type = FRIBIDI_PAR_ON; FriBidiParType par_type = FRIBIDI_PAR_ON;
_raqm_bidi_run *runs = NULL;
FriBidiCharType *types; FriBidiCharType *types;
_raqm_bidi_level_t *levels;
int max_level = 0;
#ifdef USE_FRIBIDI_EX_API #ifdef USE_FRIBIDI_EX_API
FriBidiBracketType *btypes; FriBidiBracketType *btypes;
#endif #endif
FriBidiLevel *levels;
types = calloc (rq->text_len, sizeof (FriBidiCharType));
#ifdef USE_FRIBIDI_EX_API
btypes = calloc (rq->text_len, sizeof (FriBidiBracketType));
#endif
levels = calloc (rq->text_len, sizeof (_raqm_bidi_level_t));
if (!types || !levels
#ifdef USE_FRIBIDI_EX_API
|| !btypes
#endif
)
{
goto done;
}
if (rq->base_dir == RAQM_DIRECTION_RTL)
par_type = FRIBIDI_PAR_RTL;
else if (rq->base_dir == RAQM_DIRECTION_LTR)
par_type = FRIBIDI_PAR_LTR;
fribidi_get_bidi_types (rq->text, rq->text_len, types);
#ifdef USE_FRIBIDI_EX_API
fribidi_get_bracket_types (rq->text, rq->text_len, types, btypes);
max_level = fribidi_get_par_embedding_levels_ex (types, btypes,
rq->text_len, &par_type,
levels);
#else
max_level = fribidi_get_par_embedding_levels (types, rq->text_len,
&par_type, levels);
#endif
if (par_type == FRIBIDI_PAR_LTR)
rq->resolved_dir = RAQM_DIRECTION_LTR;
else
rq->resolved_dir = RAQM_DIRECTION_RTL;
if (max_level == 0)
goto done;
/* Get the number of bidi runs */
runs = _raqm_reorder_runs (types, rq->text_len, par_type, levels, run_count);
done:
free (types);
free (levels);
#ifdef USE_FRIBIDI_EX_API
free (btypes);
#endif
return runs;
}
#endif
static bool
_raqm_itemize (raqm_t *rq)
{
_raqm_bidi_run *runs = NULL; _raqm_bidi_run *runs = NULL;
raqm_run_t *last; raqm_run_t *last;
int max_level; size_t run_count = 0;
size_t run_count;
bool ok = true; bool ok = true;
#ifdef RAQM_TESTING #ifdef RAQM_TESTING
@ -1127,67 +1360,28 @@ _raqm_itemize (raqm_t *rq)
} }
#endif #endif
types = calloc (rq->text_len, sizeof (FriBidiCharType));
#ifdef USE_FRIBIDI_EX_API
btypes = calloc (rq->text_len, sizeof (FriBidiBracketType));
#endif
levels = calloc (rq->text_len, sizeof (FriBidiLevel));
if (!types || !levels
#ifdef USE_FRIBIDI_EX_API
|| !btypes
#endif
)
{
ok = false;
goto done;
}
if (rq->base_dir == RAQM_DIRECTION_RTL)
par_type = FRIBIDI_PAR_RTL;
else if (rq->base_dir == RAQM_DIRECTION_LTR)
par_type = FRIBIDI_PAR_LTR;
if (rq->base_dir == RAQM_DIRECTION_TTB)
{
/* Treat every thing as LTR in vertical text */
max_level = 1;
memset (types, FRIBIDI_TYPE_LTR, rq->text_len);
memset (levels, 0, rq->text_len);
rq->resolved_dir = RAQM_DIRECTION_LTR;
}
else
{
fribidi_get_bidi_types (rq->text, rq->text_len, types);
#ifdef USE_FRIBIDI_EX_API
fribidi_get_bracket_types (rq->text, rq->text_len, types, btypes);
max_level = fribidi_get_par_embedding_levels_ex (types, btypes,
rq->text_len, &par_type,
levels);
#else
max_level = fribidi_get_par_embedding_levels (types, rq->text_len,
&par_type, levels);
#endif
if (par_type == FRIBIDI_PAR_LTR)
rq->resolved_dir = RAQM_DIRECTION_LTR;
else
rq->resolved_dir = RAQM_DIRECTION_RTL;
}
if (max_level == 0)
{
ok = false;
goto done;
}
if (!_raqm_resolve_scripts (rq)) if (!_raqm_resolve_scripts (rq))
{ {
ok = false; ok = false;
goto done; goto done;
} }
/* Get the number of bidi runs */ if (rq->base_dir == RAQM_DIRECTION_TTB)
runs = _raqm_reorder_runs (types, rq->text_len, par_type, levels, &run_count); {
/* Treat every thing as LTR in vertical text */
run_count = 1;
rq->resolved_dir = RAQM_DIRECTION_TTB;
runs = malloc (sizeof (_raqm_bidi_run));
if (runs)
{
runs->pos = 0;
runs->len = rq->text_len;
runs->level = 0;
}
} else {
runs = _raqm_bidi_itemize (rq, &run_count);
}
if (!runs) if (!runs)
{ {
ok = false; ok = false;
@ -1197,7 +1391,7 @@ _raqm_itemize (raqm_t *rq)
#ifdef RAQM_TESTING #ifdef RAQM_TESTING
RAQM_TEST ("Number of runs before script itemization: %zu\n\n", run_count); RAQM_TEST ("Number of runs before script itemization: %zu\n\n", run_count);
RAQM_TEST ("Fribidi Runs:\n"); RAQM_TEST ("BiDi Runs:\n");
for (size_t i = 0; i < run_count; i++) for (size_t i = 0; i < run_count; i++)
{ {
RAQM_TEST ("run[%zu]:\t start: %zu\tlength: %zu\tlevel: %d\n", RAQM_TEST ("run[%zu]:\t start: %zu\tlength: %zu\tlevel: %d\n",
@ -1309,11 +1503,6 @@ _raqm_itemize (raqm_t *rq)
done: done:
free (runs); free (runs);
free (types);
#ifdef USE_FRIBIDI_EX_API
free (btypes);
#endif
free (levels);
return ok; return ok;
} }
@ -1328,7 +1517,7 @@ typedef struct {
/* Special paired characters for script detection */ /* Special paired characters for script detection */
static size_t paired_len = 34; static size_t paired_len = 34;
static const FriBidiChar paired_chars[] = static const uint32_t paired_chars[] =
{ {
0x0028, 0x0029, /* ascii paired punctuation */ 0x0028, 0x0029, /* ascii paired punctuation */
0x003c, 0x003e, 0x003c, 0x003e,
@ -1431,7 +1620,7 @@ _raqm_stack_push (_raqm_stack_t *stack,
} }
static int static int
_get_pair_index (const FriBidiChar ch) _get_pair_index (const uint32_t ch)
{ {
int lower = 0; int lower = 0;
int upper = paired_len - 1; int upper = paired_len - 1;
@ -1569,6 +1758,7 @@ _raqm_resolve_scripts (raqm_t *rq)
return true; return true;
} }
#ifdef HAVE_FT_GET_TRANSFORM
static void static void
_raqm_ft_transform (int *x, _raqm_ft_transform (int *x,
int *y, int *y,
@ -1583,6 +1773,7 @@ _raqm_ft_transform (int *x,
*x = vector.x; *x = vector.x;
*y = vector.y; *y = vector.y;
} }
#endif
static bool static bool
_raqm_shape (raqm_t *rq) _raqm_shape (raqm_t *rq)
@ -1634,20 +1825,30 @@ _raqm_shape (raqm_t *rq)
return true; return true;
} }
/* Count equivalent UTF-8 bytes in codepoint */
static size_t
_raqm_count_codepoint_utf8_bytes (uint32_t chr)
{
if (0 == ((uint32_t) 0xffffff80 & chr))
return 1;
else if (0 == ((uint32_t) 0xfffff800 & chr))
return 2;
else if (0 == ((uint32_t) 0xffff0000 & chr))
return 3;
else
return 4;
}
/* Convert index from UTF-32 to UTF-8 */ /* Convert index from UTF-32 to UTF-8 */
static uint32_t static uint32_t
_raqm_u32_to_u8_index (raqm_t *rq, _raqm_u32_to_u8_index (raqm_t *rq,
uint32_t index) uint32_t index)
{ {
FriBidiStrIndex length; size_t length = 0;
char *output = malloc ((sizeof (char) * 4 * index) + 1);
length = fribidi_unicode_to_charset (FRIBIDI_CHAR_SET_UTF8, for (uint32_t i = 0; i < index; ++i)
rq->text, length += _raqm_count_codepoint_utf8_bytes (rq->text[i]);
index,
output);
free (output);
return length; return length;
} }
@ -1656,15 +1857,27 @@ static uint32_t
_raqm_u8_to_u32_index (raqm_t *rq, _raqm_u8_to_u32_index (raqm_t *rq,
uint32_t index) uint32_t index)
{ {
FriBidiStrIndex length; const unsigned char *s = (const unsigned char *) rq->text_utf8;
uint32_t *output = malloc (sizeof (uint32_t) * (index + 1)); const unsigned char *t = s;
size_t length = 0;
length = fribidi_charset_to_unicode (FRIBIDI_CHAR_SET_UTF8, while (((size_t) (s - t) < index) && ('\0' != *s))
rq->text_utf8, {
index, if (0xf0 == (0xf8 & *s))
output); s += 4;
else if (0xe0 == (0xf0 & *s))
s += 3;
else if (0xc0 == (0xe0 & *s))
s += 2;
else
s += 1;
length++;
}
if ((size_t) (s-t) > index)
length--;
free (output);
return length; return length;
} }

View File

@ -1,6 +1,6 @@
/* /*
* Copyright © 2015 Information Technology Authority (ITA) <foss@ita.gov.om> * Copyright © 2015 Information Technology Authority (ITA) <foss@ita.gov.om>
* Copyright © 2016 Khaled Hosny <khaledhosny@eglug.org> * Copyright © 2016-2021 Khaled Hosny <khaled@aliftype.com>
* *
* Permission is hereby granted, free of charge, to any person obtaining a copy * Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to * of this software and associated documentation files (the "Software"), to
@ -156,6 +156,13 @@ RAQM_API raqm_glyph_t *
raqm_get_glyphs (raqm_t *rq, raqm_get_glyphs (raqm_t *rq,
size_t *length); size_t *length);
RAQM_API raqm_direction_t
raqm_get_par_resolved_direction (raqm_t *rq);
RAQM_API raqm_direction_t
raqm_get_direction_at_index (raqm_t *rq,
size_t index);
RAQM_API bool RAQM_API bool
raqm_index_to_position (raqm_t *rq, raqm_index_to_position (raqm_t *rq,
size_t *index, size_t *index,