1// © 2016 and later: Unicode, Inc. and others.
2// License & terms of use: http://www.unicode.org/copyright.html
3/*
4******************************************************************************
5*
6*   Copyright (C) 1999-2013, International Business Machines
7*   Corporation and others.  All Rights Reserved.
8*
9******************************************************************************
10*   file name:  ubidi.h
11*   encoding:   UTF-8
12*   tab size:   8 (not used)
13*   indentation:4
14*
15*   created on: 1999jul27
16*   created by: Markus W. Scherer, updated by Matitiahu Allouche
17*/
18
19#ifndef UBIDI_H
20#define UBIDI_H
21
22#include "unicode/utypes.h"
23#include "unicode/uchar.h"
24
25#if U_SHOW_CPLUSPLUS_API
26#include "unicode/localpointer.h"
27#endif   // U_SHOW_CPLUSPLUS_API
28
29/**
30 *\file
31 * \brief C API: Bidi algorithm
32 *
33 * <h2>Bidi algorithm for ICU</h2>
34 *
35 * This is an implementation of the Unicode Bidirectional Algorithm.
36 * The algorithm is defined in the
37 * <a href="http://www.unicode.org/unicode/reports/tr9/">Unicode Standard Annex #9</a>.<p>
38 *
39 * Note: Libraries that perform a bidirectional algorithm and
40 * reorder strings accordingly are sometimes called "Storage Layout Engines".
41 * ICU's Bidi and shaping (u_shapeArabic()) APIs can be used at the core of such
42 * "Storage Layout Engines".
43 *
44 * <h3>General remarks about the API:</h3>
45 *
46 * In functions with an error code parameter,
47 * the <code>pErrorCode</code> pointer must be valid
48 * and the value that it points to must not indicate a failure before
49 * the function call. Otherwise, the function returns immediately.
50 * After the function call, the value indicates success or failure.<p>
51 *
52 * The &quot;limit&quot; of a sequence of characters is the position just after their
53 * last character, i.e., one more than that position.<p>
54 *
55 * Some of the API functions provide access to &quot;runs&quot;.
56 * Such a &quot;run&quot; is defined as a sequence of characters
57 * that are at the same embedding level
58 * after performing the Bidi algorithm.<p>
59 *
60 * @author Markus W. Scherer
61 * @version 1.0
62 *
63 *
64 * <h4> Sample code for the ICU Bidi API </h4>
65 *
66 * <h5>Rendering a paragraph with the ICU Bidi API</h5>
67 *
68 * This is (hypothetical) sample code that illustrates
69 * how the ICU Bidi API could be used to render a paragraph of text.
70 * Rendering code depends highly on the graphics system,
71 * therefore this sample code must make a lot of assumptions,
72 * which may or may not match any existing graphics system's properties.
73 *
74 * <p>The basic assumptions are:</p>
75 * <ul>
76 * <li>Rendering is done from left to right on a horizontal line.</li>
77 * <li>A run of single-style, unidirectional text can be rendered at once.</li>
78 * <li>Such a run of text is passed to the graphics system with
79 *     characters (code units) in logical order.</li>
80 * <li>The line-breaking algorithm is very complicated
81 *     and Locale-dependent -
82 *     and therefore its implementation omitted from this sample code.</li>
83 * </ul>
84 *
85 * <pre>
86 * \code
87 *#include <unicode/ubidi.h>
88 *
89 *typedef enum {
90 *     styleNormal=0, styleSelected=1,
91 *     styleBold=2, styleItalics=4,
92 *     styleSuper=8, styleSub=16
93 *} Style;
94 *
95 *typedef struct { int32_t limit; Style style; } StyleRun;
96 *
97 *int getTextWidth(const UChar *text, int32_t start, int32_t limit,
98 *                  const StyleRun *styleRuns, int styleRunCount);
99 *
100 * // set *pLimit and *pStyleRunLimit for a line
101 * // from text[start] and from styleRuns[styleRunStart]
102 * // using ubidi_getLogicalRun(para, ...)
103 *void getLineBreak(const UChar *text, int32_t start, int32_t *pLimit,
104 *                  UBiDi *para,
105 *                  const StyleRun *styleRuns, int styleRunStart, int *pStyleRunLimit,
106 *                  int *pLineWidth);
107 *
108 * // render runs on a line sequentially, always from left to right
109 *
110 * // prepare rendering a new line
111 * void startLine(UBiDiDirection textDirection, int lineWidth);
112 *
113 * // render a run of text and advance to the right by the run width
114 * // the text[start..limit-1] is always in logical order
115 * void renderRun(const UChar *text, int32_t start, int32_t limit,
116 *               UBiDiDirection textDirection, Style style);
117 *
118 * // We could compute a cross-product
119 * // from the style runs with the directional runs
120 * // and then reorder it.
121 * // Instead, here we iterate over each run type
122 * // and render the intersections -
123 * // with shortcuts in simple (and common) cases.
124 * // renderParagraph() is the main function.
125 *
126 * // render a directional run with
127 * // (possibly) multiple style runs intersecting with it
128 * void renderDirectionalRun(const UChar *text,
129 *                           int32_t start, int32_t limit,
130 *                           UBiDiDirection direction,
131 *                           const StyleRun *styleRuns, int styleRunCount) {
132 *     int i;
133 *
134 *     // iterate over style runs
135 *     if(direction==UBIDI_LTR) {
136 *         int styleLimit;
137 *
138 *         for(i=0; i<styleRunCount; ++i) {
139 *             styleLimit=styleRuns[i].limit;
140 *             if(start<styleLimit) {
141 *                 if(styleLimit>limit) { styleLimit=limit; }
142 *                 renderRun(text, start, styleLimit,
143 *                           direction, styleRuns[i].style);
144 *                 if(styleLimit==limit) { break; }
145 *                 start=styleLimit;
146 *             }
147 *         }
148 *     } else {
149 *         int styleStart;
150 *
151 *         for(i=styleRunCount-1; i>=0; --i) {
152 *             if(i>0) {
153 *                 styleStart=styleRuns[i-1].limit;
154 *             } else {
155 *                 styleStart=0;
156 *             }
157 *             if(limit>=styleStart) {
158 *                 if(styleStart<start) { styleStart=start; }
159 *                 renderRun(text, styleStart, limit,
160 *                           direction, styleRuns[i].style);
161 *                 if(styleStart==start) { break; }
162 *                 limit=styleStart;
163 *             }
164 *         }
165 *     }
166 * }
167 *
168 * // the line object represents text[start..limit-1]
169 * void renderLine(UBiDi *line, const UChar *text,
170 *                 int32_t start, int32_t limit,
171 *                 const StyleRun *styleRuns, int styleRunCount,
172 *                 UErrorCode *pErrorCode) {
173 *     UBiDiDirection direction=ubidi_getDirection(line);
174 *     if(direction!=UBIDI_MIXED) {
175 *         // unidirectional
176 *         if(styleRunCount<=1) {
177 *             renderRun(text, start, limit, direction, styleRuns[0].style);
178 *         } else {
179 *             renderDirectionalRun(text, start, limit,
180 *                                  direction, styleRuns, styleRunCount);
181 *         }
182 *     } else {
183 *         // mixed-directional
184 *         int32_t count, i, length;
185 *         UBiDiLevel level;
186 *
187 *         count=ubidi_countRuns(line, pErrorCode);
188 *         if(U_SUCCESS(*pErrorCode)) {
189 *             if(styleRunCount<=1) {
190 *                 Style style=styleRuns[0].style;
191 *
192 *                 // iterate over directional runs
193 *                for(i=0; i<count; ++i) {
194 *                    direction=ubidi_getVisualRun(line, i, &start, &length);
195 *                     renderRun(text, start, start+length, direction, style);
196 *                }
197 *             } else {
198 *                 int32_t j;
199 *
200 *                 // iterate over both directional and style runs
201 *                 for(i=0; i<count; ++i) {
202 *                     direction=ubidi_getVisualRun(line, i, &start, &length);
203 *                     renderDirectionalRun(text, start, start+length,
204 *                                          direction, styleRuns, styleRunCount);
205 *                 }
206 *             }
207 *         }
208 *     }
209 * }
210 *
211 *void renderParagraph(const UChar *text, int32_t length,
212 *                     UBiDiDirection textDirection,
213 *                      const StyleRun *styleRuns, int styleRunCount,
214 *                      int lineWidth,
215 *                      UErrorCode *pErrorCode) {
216 *     UBiDi *para;
217 *
218 *     if(pErrorCode==NULL || U_FAILURE(*pErrorCode) || length<=0) {
219 *         return;
220 *     }
221 *
222 *     para=ubidi_openSized(length, 0, pErrorCode);
223 *     if(para==NULL) { return; }
224 *
225 *     ubidi_setPara(para, text, length,
226 *                   textDirection ? UBIDI_DEFAULT_RTL : UBIDI_DEFAULT_LTR,
227 *                   NULL, pErrorCode);
228 *     if(U_SUCCESS(*pErrorCode)) {
229 *         UBiDiLevel paraLevel=1&ubidi_getParaLevel(para);
230 *         StyleRun styleRun={ length, styleNormal };
231 *         int width;
232 *
233 *         if(styleRuns==NULL || styleRunCount<=0) {
234 *            styleRunCount=1;
235 *             styleRuns=&styleRun;
236 *         }
237 *
238 *        // assume styleRuns[styleRunCount-1].limit>=length
239 *
240 *         width=getTextWidth(text, 0, length, styleRuns, styleRunCount);
241 *         if(width<=lineWidth) {
242 *             // everything fits onto one line
243 *
244 *            // prepare rendering a new line from either left or right
245 *             startLine(paraLevel, width);
246 *
247 *             renderLine(para, text, 0, length,
248 *                        styleRuns, styleRunCount, pErrorCode);
249 *         } else {
250 *             UBiDi *line;
251 *
252 *             // we need to render several lines
253 *             line=ubidi_openSized(length, 0, pErrorCode);
254 *             if(line!=NULL) {
255 *                 int32_t start=0, limit;
256 *                 int styleRunStart=0, styleRunLimit;
257 *
258 *                 for(;;) {
259 *                     limit=length;
260 *                     styleRunLimit=styleRunCount;
261 *                     getLineBreak(text, start, &limit, para,
262 *                                  styleRuns, styleRunStart, &styleRunLimit,
263 *                                 &width);
264 *                     ubidi_setLine(para, start, limit, line, pErrorCode);
265 *                     if(U_SUCCESS(*pErrorCode)) {
266 *                         // prepare rendering a new line
267 *                         // from either left or right
268 *                         startLine(paraLevel, width);
269 *
270 *                         renderLine(line, text, start, limit,
271 *                                    styleRuns+styleRunStart,
272 *                                    styleRunLimit-styleRunStart, pErrorCode);
273 *                     }
274 *                     if(limit==length) { break; }
275 *                     start=limit;
276 *                     styleRunStart=styleRunLimit-1;
277 *                     if(start>=styleRuns[styleRunStart].limit) {
278 *                         ++styleRunStart;
279 *                     }
280 *                 }
281 *
282 *                 ubidi_close(line);
283 *             }
284 *        }
285 *    }
286 *
287 *     ubidi_close(para);
288 *}
289 *\endcode
290 * </pre>
291 */
292
293/*DOCXX_TAG*/
294/*@{*/
295
296/**
297 * UBiDiLevel is the type of the level values in this
298 * Bidi implementation.
299 * It holds an embedding level and indicates the visual direction
300 * by its bit&nbsp;0 (even/odd value).<p>
301 *
302 * It can also hold non-level values for the
303 * <code>paraLevel</code> and <code>embeddingLevels</code>
304 * arguments of <code>ubidi_setPara()</code>; there:
305 * <ul>
306 * <li>bit&nbsp;7 of an <code>embeddingLevels[]</code>
307 * value indicates whether the using application is
308 * specifying the level of a character to <i>override</i> whatever the
309 * Bidi implementation would resolve it to.</li>
310 * <li><code>paraLevel</code> can be set to the
311 * pseudo-level values <code>UBIDI_DEFAULT_LTR</code>
312 * and <code>UBIDI_DEFAULT_RTL</code>.</li>
313 * </ul>
314 *
315 * @see ubidi_setPara
316 *
317 * <p>The related constants are not real, valid level values.
318 * <code>UBIDI_DEFAULT_XXX</code> can be used to specify
319 * a default for the paragraph level for
320 * when the <code>ubidi_setPara()</code> function
321 * shall determine it but there is no
322 * strongly typed character in the input.<p>
323 *
324 * Note that the value for <code>UBIDI_DEFAULT_LTR</code> is even
325 * and the one for <code>UBIDI_DEFAULT_RTL</code> is odd,
326 * just like with normal LTR and RTL level values -
327 * these special values are designed that way. Also, the implementation
328 * assumes that UBIDI_MAX_EXPLICIT_LEVEL is odd.
329 *
330 * Note: The numeric values of the related constants will not change:
331 * They are tied to the use of 7-bit byte values (plus the override bit)
332 * and of the UBiDiLevel=uint8_t data type in this API.
333 *
334 * @see UBIDI_DEFAULT_LTR
335 * @see UBIDI_DEFAULT_RTL
336 * @see UBIDI_LEVEL_OVERRIDE
337 * @see UBIDI_MAX_EXPLICIT_LEVEL
338 * @stable ICU 2.0
339 */
340typedef uint8_t UBiDiLevel;
341
342/** Paragraph level setting.<p>
343 *
344 * Constant indicating that the base direction depends on the first strong
345 * directional character in the text according to the Unicode Bidirectional
346 * Algorithm. If no strong directional character is present,
347 * then set the paragraph level to 0 (left-to-right).<p>
348 *
349 * If this value is used in conjunction with reordering modes
350 * <code>UBIDI_REORDER_INVERSE_LIKE_DIRECT</code> or
351 * <code>UBIDI_REORDER_INVERSE_FOR_NUMBERS_SPECIAL</code>, the text to reorder
352 * is assumed to be visual LTR, and the text after reordering is required
353 * to be the corresponding logical string with appropriate contextual
354 * direction. The direction of the result string will be RTL if either
355 * the righmost or leftmost strong character of the source text is RTL
356 * or Arabic Letter, the direction will be LTR otherwise.<p>
357 *
358 * If reordering option <code>UBIDI_OPTION_INSERT_MARKS</code> is set, an RLM may
359 * be added at the beginning of the result string to ensure round trip
360 * (that the result string, when reordered back to visual, will produce
361 * the original source text).
362 * @see UBIDI_REORDER_INVERSE_LIKE_DIRECT
363 * @see UBIDI_REORDER_INVERSE_FOR_NUMBERS_SPECIAL
364 * @stable ICU 2.0
365 */
366#define UBIDI_DEFAULT_LTR 0xfe
367
368/** Paragraph level setting.<p>
369 *
370 * Constant indicating that the base direction depends on the first strong
371 * directional character in the text according to the Unicode Bidirectional
372 * Algorithm. If no strong directional character is present,
373 * then set the paragraph level to 1 (right-to-left).<p>
374 *
375 * If this value is used in conjunction with reordering modes
376 * <code>UBIDI_REORDER_INVERSE_LIKE_DIRECT</code> or
377 * <code>UBIDI_REORDER_INVERSE_FOR_NUMBERS_SPECIAL</code>, the text to reorder
378 * is assumed to be visual LTR, and the text after reordering is required
379 * to be the corresponding logical string with appropriate contextual
380 * direction. The direction of the result string will be RTL if either
381 * the righmost or leftmost strong character of the source text is RTL
382 * or Arabic Letter, or if the text contains no strong character;
383 * the direction will be LTR otherwise.<p>
384 *
385 * If reordering option <code>UBIDI_OPTION_INSERT_MARKS</code> is set, an RLM may
386 * be added at the beginning of the result string to ensure round trip
387 * (that the result string, when reordered back to visual, will produce
388 * the original source text).
389 * @see UBIDI_REORDER_INVERSE_LIKE_DIRECT
390 * @see UBIDI_REORDER_INVERSE_FOR_NUMBERS_SPECIAL
391 * @stable ICU 2.0
392 */
393#define UBIDI_DEFAULT_RTL 0xff
394
395/**
396 * Maximum explicit embedding level.
397 * Same as the max_depth value in the
398 * <a href="http://www.unicode.org/reports/tr9/#BD2">Unicode Bidirectional Algorithm</a>.
399 * (The maximum resolved level can be up to <code>UBIDI_MAX_EXPLICIT_LEVEL+1</code>).
400 * @stable ICU 2.0
401 */
402#define UBIDI_MAX_EXPLICIT_LEVEL 125
403
404/** Bit flag for level input.
405 *  Overrides directional properties.
406 * @stable ICU 2.0
407 */
408#define UBIDI_LEVEL_OVERRIDE 0x80
409
410/**
411 * Special value which can be returned by the mapping functions when a logical
412 * index has no corresponding visual index or vice-versa. This may happen
413 * for the logical-to-visual mapping of a Bidi control when option
414 * <code>#UBIDI_OPTION_REMOVE_CONTROLS</code> is specified. This can also happen
415 * for the visual-to-logical mapping of a Bidi mark (LRM or RLM) inserted
416 * by option <code>#UBIDI_OPTION_INSERT_MARKS</code>.
417 * @see ubidi_getVisualIndex
418 * @see ubidi_getVisualMap
419 * @see ubidi_getLogicalIndex
420 * @see ubidi_getLogicalMap
421 * @stable ICU 3.6
422 */
423#define UBIDI_MAP_NOWHERE   (-1)
424
425/**
426 * <code>UBiDiDirection</code> values indicate the text direction.
427 * @stable ICU 2.0
428 */
429enum UBiDiDirection {
430  /** Left-to-right text. This is a 0 value.
431   * <ul>
432   * <li>As return value for <code>ubidi_getDirection()</code>, it means
433   *     that the source string contains no right-to-left characters, or
434   *     that the source string is empty and the paragraph level is even.
435   * <li> As return value for <code>ubidi_getBaseDirection()</code>, it
436   *      means that the first strong character of the source string has
437   *      a left-to-right direction.
438   * </ul>
439   * @stable ICU 2.0
440   */
441  UBIDI_LTR,
442  /** Right-to-left text. This is a 1 value.
443   * <ul>
444   * <li>As return value for <code>ubidi_getDirection()</code>, it means
445   *     that the source string contains no left-to-right characters, or
446   *     that the source string is empty and the paragraph level is odd.
447   * <li> As return value for <code>ubidi_getBaseDirection()</code>, it
448   *      means that the first strong character of the source string has
449   *      a right-to-left direction.
450   * </ul>
451   * @stable ICU 2.0
452   */
453  UBIDI_RTL,
454  /** Mixed-directional text.
455   * <p>As return value for <code>ubidi_getDirection()</code>, it means
456   *    that the source string contains both left-to-right and
457   *    right-to-left characters.
458   * @stable ICU 2.0
459   */
460  UBIDI_MIXED,
461  /** No strongly directional text.
462   * <p>As return value for <code>ubidi_getBaseDirection()</code>, it means
463   *    that the source string is missing or empty, or contains neither left-to-right
464   *    nor right-to-left characters.
465   * @stable ICU 4.6
466   */
467  UBIDI_NEUTRAL
468};
469
470/** @stable ICU 2.0 */
471typedef enum UBiDiDirection UBiDiDirection;
472
473/**
474 * Forward declaration of the <code>UBiDi</code> structure for the declaration of
475 * the API functions. Its fields are implementation-specific.<p>
476 * This structure holds information about a paragraph (or multiple paragraphs)
477 * of text with Bidi-algorithm-related details, or about one line of
478 * such a paragraph.<p>
479 * Reordering can be done on a line, or on one or more paragraphs which are
480 * then interpreted each as one single line.
481 * @stable ICU 2.0
482 */
483struct UBiDi;
484
485/** @stable ICU 2.0 */
486typedef struct UBiDi UBiDi;
487
488/**
489 * Allocate a <code>UBiDi</code> structure.
490 * Such an object is initially empty. It is assigned
491 * the Bidi properties of a piece of text containing one or more paragraphs
492 * by <code>ubidi_setPara()</code>
493 * or the Bidi properties of a line within a paragraph by
494 * <code>ubidi_setLine()</code>.<p>
495 * This object can be reused for as long as it is not deallocated
496 * by calling <code>ubidi_close()</code>.<p>
497 * <code>ubidi_setPara()</code> and <code>ubidi_setLine()</code> will allocate
498 * additional memory for internal structures as necessary.
499 *
500 * @return An empty <code>UBiDi</code> object.
501 * @stable ICU 2.0
502 */
503U_CAPI UBiDi * U_EXPORT2
504ubidi_open(void);
505
506/**
507 * Allocate a <code>UBiDi</code> structure with preallocated memory
508 * for internal structures.
509 * This function provides a <code>UBiDi</code> object like <code>ubidi_open()</code>
510 * with no arguments, but it also preallocates memory for internal structures
511 * according to the sizings supplied by the caller.<p>
512 * Subsequent functions will not allocate any more memory, and are thus
513 * guaranteed not to fail because of lack of memory.<p>
514 * The preallocation can be limited to some of the internal memory
515 * by setting some values to 0 here. That means that if, e.g.,
516 * <code>maxRunCount</code> cannot be reasonably predetermined and should not
517 * be set to <code>maxLength</code> (the only failproof value) to avoid
518 * wasting memory, then <code>maxRunCount</code> could be set to 0 here
519 * and the internal structures that are associated with it will be allocated
520 * on demand, just like with <code>ubidi_open()</code>.
521 *
522 * @param maxLength is the maximum text or line length that internal memory
523 *        will be preallocated for. An attempt to associate this object with a
524 *        longer text will fail, unless this value is 0, which leaves the allocation
525 *        up to the implementation.
526 *
527 * @param maxRunCount is the maximum anticipated number of same-level runs
528 *        that internal memory will be preallocated for. An attempt to access
529 *        visual runs on an object that was not preallocated for as many runs
530 *        as the text was actually resolved to will fail,
531 *        unless this value is 0, which leaves the allocation up to the implementation.<br><br>
532 *        The number of runs depends on the actual text and maybe anywhere between
533 *        1 and <code>maxLength</code>. It is typically small.
534 *
535 * @param pErrorCode must be a valid pointer to an error code value.
536 *
537 * @return An empty <code>UBiDi</code> object with preallocated memory.
538 * @stable ICU 2.0
539 */
540U_CAPI UBiDi * U_EXPORT2
541ubidi_openSized(int32_t maxLength, int32_t maxRunCount, UErrorCode *pErrorCode);
542
543/**
544 * <code>ubidi_close()</code> must be called to free the memory
545 * associated with a UBiDi object.<p>
546 *
547 * <strong>Important: </strong>
548 * A parent <code>UBiDi</code> object must not be destroyed or reused if
549 * it still has children.
550 * If a <code>UBiDi</code> object has become the <i>child</i>
551 * of another one (its <i>parent</i>) by calling
552 * <code>ubidi_setLine()</code>, then the child object must
553 * be destroyed (closed) or reused (by calling
554 * <code>ubidi_setPara()</code> or <code>ubidi_setLine()</code>)
555 * before the parent object.
556 *
557 * @param pBiDi is a <code>UBiDi</code> object.
558 *
559 * @see ubidi_setPara
560 * @see ubidi_setLine
561 * @stable ICU 2.0
562 */
563U_CAPI void U_EXPORT2
564ubidi_close(UBiDi *pBiDi);
565
566#if U_SHOW_CPLUSPLUS_API
567
568U_NAMESPACE_BEGIN
569
570/**
571 * \class LocalUBiDiPointer
572 * "Smart pointer" class, closes a UBiDi via ubidi_close().
573 * For most methods see the LocalPointerBase base class.
574 *
575 * @see LocalPointerBase
576 * @see LocalPointer
577 * @stable ICU 4.4
578 */
579U_DEFINE_LOCAL_OPEN_POINTER(LocalUBiDiPointer, UBiDi, ubidi_close);
580
581U_NAMESPACE_END
582
583#endif
584
585/**
586 * Modify the operation of the Bidi algorithm such that it
587 * approximates an "inverse Bidi" algorithm. This function
588 * must be called before <code>ubidi_setPara()</code>.
589 *
590 * <p>The normal operation of the Bidi algorithm as described
591 * in the Unicode Technical Report is to take text stored in logical
592 * (keyboard, typing) order and to determine the reordering of it for visual
593 * rendering.
594 * Some legacy systems store text in visual order, and for operations
595 * with standard, Unicode-based algorithms, the text needs to be transformed
596 * to logical order. This is effectively the inverse algorithm of the
597 * described Bidi algorithm. Note that there is no standard algorithm for
598 * this "inverse Bidi" and that the current implementation provides only an
599 * approximation of "inverse Bidi".</p>
600 *
601 * <p>With <code>isInverse</code> set to <code>true</code>,
602 * this function changes the behavior of some of the subsequent functions
603 * in a way that they can be used for the inverse Bidi algorithm.
604 * Specifically, runs of text with numeric characters will be treated in a
605 * special way and may need to be surrounded with LRM characters when they are
606 * written in reordered sequence.</p>
607 *
608 * <p>Output runs should be retrieved using <code>ubidi_getVisualRun()</code>.
609 * Since the actual input for "inverse Bidi" is visually ordered text and
610 * <code>ubidi_getVisualRun()</code> gets the reordered runs, these are actually
611 * the runs of the logically ordered output.</p>
612 *
613 * <p>Calling this function with argument <code>isInverse</code> set to
614 * <code>true</code> is equivalent to calling
615 * <code>ubidi_setReorderingMode</code> with argument
616 * <code>reorderingMode</code>
617 * set to <code>#UBIDI_REORDER_INVERSE_NUMBERS_AS_L</code>.<br>
618 * Calling this function with argument <code>isInverse</code> set to
619 * <code>false</code> is equivalent to calling
620 * <code>ubidi_setReorderingMode</code> with argument
621 * <code>reorderingMode</code>
622 * set to <code>#UBIDI_REORDER_DEFAULT</code>.
623 *
624 * @param pBiDi is a <code>UBiDi</code> object.
625 *
626 * @param isInverse specifies "forward" or "inverse" Bidi operation.
627 *
628 * @see ubidi_setPara
629 * @see ubidi_writeReordered
630 * @see ubidi_setReorderingMode
631 * @stable ICU 2.0
632 */
633U_CAPI void U_EXPORT2
634ubidi_setInverse(UBiDi *pBiDi, UBool isInverse);
635
636/**
637 * Is this Bidi object set to perform the inverse Bidi algorithm?
638 * <p>Note: calling this function after setting the reordering mode with
639 * <code>ubidi_setReorderingMode</code> will return <code>true</code> if the
640 * reordering mode was set to <code>#UBIDI_REORDER_INVERSE_NUMBERS_AS_L</code>,
641 * <code>false</code> for all other values.</p>
642 *
643 * @param pBiDi is a <code>UBiDi</code> object.
644 * @return true if the Bidi object is set to perform the inverse Bidi algorithm
645 * by handling numbers as L.
646 *
647 * @see ubidi_setInverse
648 * @see ubidi_setReorderingMode
649 * @stable ICU 2.0
650 */
651
652U_CAPI UBool U_EXPORT2
653ubidi_isInverse(UBiDi *pBiDi);
654
655/**
656 * Specify whether block separators must be allocated level zero,
657 * so that successive paragraphs will progress from left to right.
658 * This function must be called before <code>ubidi_setPara()</code>.
659 * Paragraph separators (B) may appear in the text.  Setting them to level zero
660 * means that all paragraph separators (including one possibly appearing
661 * in the last text position) are kept in the reordered text after the text
662 * that they follow in the source text.
663 * When this feature is not enabled, a paragraph separator at the last
664 * position of the text before reordering will go to the first position
665 * of the reordered text when the paragraph level is odd.
666 *
667 * @param pBiDi is a <code>UBiDi</code> object.
668 *
669 * @param orderParagraphsLTR specifies whether paragraph separators (B) must
670 * receive level 0, so that successive paragraphs progress from left to right.
671 *
672 * @see ubidi_setPara
673 * @stable ICU 3.4
674 */
675U_CAPI void U_EXPORT2
676ubidi_orderParagraphsLTR(UBiDi *pBiDi, UBool orderParagraphsLTR);
677
678/**
679 * Is this Bidi object set to allocate level 0 to block separators so that
680 * successive paragraphs progress from left to right?
681 *
682 * @param pBiDi is a <code>UBiDi</code> object.
683 * @return true if the Bidi object is set to allocate level 0 to block
684 *         separators.
685 *
686 * @see ubidi_orderParagraphsLTR
687 * @stable ICU 3.4
688 */
689U_CAPI UBool U_EXPORT2
690ubidi_isOrderParagraphsLTR(UBiDi *pBiDi);
691
692/**
693 * <code>UBiDiReorderingMode</code> values indicate which variant of the Bidi
694 * algorithm to use.
695 *
696 * @see ubidi_setReorderingMode
697 * @stable ICU 3.6
698 */
699typedef enum UBiDiReorderingMode {
700    /** Regular Logical to Visual Bidi algorithm according to Unicode.
701      * This is a 0 value.
702      * @stable ICU 3.6 */
703    UBIDI_REORDER_DEFAULT = 0,
704    /** Logical to Visual algorithm which handles numbers in a way which
705      * mimics the behavior of Windows XP.
706      * @stable ICU 3.6 */
707    UBIDI_REORDER_NUMBERS_SPECIAL,
708    /** Logical to Visual algorithm grouping numbers with adjacent R characters
709      * (reversible algorithm).
710      * @stable ICU 3.6 */
711    UBIDI_REORDER_GROUP_NUMBERS_WITH_R,
712    /** Reorder runs only to transform a Logical LTR string to the Logical RTL
713      * string with the same display, or vice-versa.<br>
714      * If this mode is set together with option
715      * <code>#UBIDI_OPTION_INSERT_MARKS</code>, some Bidi controls in the source
716      * text may be removed and other controls may be added to produce the
717      * minimum combination which has the required display.
718      * @stable ICU 3.6 */
719    UBIDI_REORDER_RUNS_ONLY,
720    /** Visual to Logical algorithm which handles numbers like L
721      * (same algorithm as selected by <code>ubidi_setInverse(true)</code>.
722      * @see ubidi_setInverse
723      * @stable ICU 3.6 */
724    UBIDI_REORDER_INVERSE_NUMBERS_AS_L,
725    /** Visual to Logical algorithm equivalent to the regular Logical to Visual
726      * algorithm.
727      * @stable ICU 3.6 */
728    UBIDI_REORDER_INVERSE_LIKE_DIRECT,
729    /** Inverse Bidi (Visual to Logical) algorithm for the
730      * <code>UBIDI_REORDER_NUMBERS_SPECIAL</code> Bidi algorithm.
731      * @stable ICU 3.6 */
732    UBIDI_REORDER_INVERSE_FOR_NUMBERS_SPECIAL,
733} UBiDiReorderingMode;
734
735/**
736 * Modify the operation of the Bidi algorithm such that it implements some
737 * variant to the basic Bidi algorithm or approximates an "inverse Bidi"
738 * algorithm, depending on different values of the "reordering mode".
739 * This function must be called before <code>ubidi_setPara()</code>, and stays
740 * in effect until called again with a different argument.
741 *
742 * <p>The normal operation of the Bidi algorithm as described
743 * in the Unicode Standard Annex #9 is to take text stored in logical
744 * (keyboard, typing) order and to determine how to reorder it for visual
745 * rendering.</p>
746 *
747 * <p>With the reordering mode set to a value other than
748 * <code>#UBIDI_REORDER_DEFAULT</code>, this function changes the behavior of
749 * some of the subsequent functions in a way such that they implement an
750 * inverse Bidi algorithm or some other algorithm variants.</p>
751 *
752 * <p>Some legacy systems store text in visual order, and for operations
753 * with standard, Unicode-based algorithms, the text needs to be transformed
754 * into logical order. This is effectively the inverse algorithm of the
755 * described Bidi algorithm. Note that there is no standard algorithm for
756 * this "inverse Bidi", so a number of variants are implemented here.</p>
757 *
758 * <p>In other cases, it may be desirable to emulate some variant of the
759 * Logical to Visual algorithm (e.g. one used in MS Windows), or perform a
760 * Logical to Logical transformation.</p>
761 *
762 * <ul>
763 * <li>When the reordering mode is set to <code>#UBIDI_REORDER_DEFAULT</code>,
764 * the standard Bidi Logical to Visual algorithm is applied.</li>
765 *
766 * <li>When the reordering mode is set to
767 * <code>#UBIDI_REORDER_NUMBERS_SPECIAL</code>,
768 * the algorithm used to perform Bidi transformations when calling
769 * <code>ubidi_setPara</code> should approximate the algorithm used in
770 * Microsoft Windows XP rather than strictly conform to the Unicode Bidi
771 * algorithm.
772 * <br>
773 * The differences between the basic algorithm and the algorithm addressed
774 * by this option are as follows:
775 * <ul>
776 *   <li>Within text at an even embedding level, the sequence "123AB"
777 *   (where AB represent R or AL letters) is transformed to "123BA" by the
778 *   Unicode algorithm and to "BA123" by the Windows algorithm.</li>
779 *   <li>Arabic-Indic numbers (AN) are handled by the Windows algorithm just
780 *   like regular numbers (EN).</li>
781 * </ul></li>
782 *
783 * <li>When the reordering mode is set to
784 * <code>#UBIDI_REORDER_GROUP_NUMBERS_WITH_R</code>,
785 * numbers located between LTR text and RTL text are associated with the RTL
786 * text. For instance, an LTR paragraph with content "abc 123 DEF" (where
787 * upper case letters represent RTL characters) will be transformed to
788 * "abc FED 123" (and not "abc 123 FED"), "DEF 123 abc" will be transformed
789 * to "123 FED abc" and "123 FED abc" will be transformed to "DEF 123 abc".
790 * This makes the algorithm reversible and makes it useful when round trip
791 * (from visual to logical and back to visual) must be achieved without
792 * adding LRM characters. However, this is a variation from the standard
793 * Unicode Bidi algorithm.<br>
794 * The source text should not contain Bidi control characters other than LRM
795 * or RLM.</li>
796 *
797 * <li>When the reordering mode is set to
798 * <code>#UBIDI_REORDER_RUNS_ONLY</code>,
799 * a "Logical to Logical" transformation must be performed:
800 * <ul>
801 * <li>If the default text level of the source text (argument <code>paraLevel</code>
802 * in <code>ubidi_setPara</code>) is even, the source text will be handled as
803 * LTR logical text and will be transformed to the RTL logical text which has
804 * the same LTR visual display.</li>
805 * <li>If the default level of the source text is odd, the source text
806 * will be handled as RTL logical text and will be transformed to the
807 * LTR logical text which has the same LTR visual display.</li>
808 * </ul>
809 * This mode may be needed when logical text which is basically Arabic or
810 * Hebrew, with possible included numbers or phrases in English, has to be
811 * displayed as if it had an even embedding level (this can happen if the
812 * displaying application treats all text as if it was basically LTR).
813 * <br>
814 * This mode may also be needed in the reverse case, when logical text which is
815 * basically English, with possible included phrases in Arabic or Hebrew, has to
816 * be displayed as if it had an odd embedding level.
817 * <br>
818 * Both cases could be handled by adding LRE or RLE at the head of the text,
819 * if the display subsystem supports these formatting controls. If it does not,
820 * the problem may be handled by transforming the source text in this mode
821 * before displaying it, so that it will be displayed properly.<br>
822 * The source text should not contain Bidi control characters other than LRM
823 * or RLM.</li>
824 *
825 * <li>When the reordering mode is set to
826 * <code>#UBIDI_REORDER_INVERSE_NUMBERS_AS_L</code>, an "inverse Bidi" algorithm
827 * is applied.
828 * Runs of text with numeric characters will be treated like LTR letters and
829 * may need to be surrounded with LRM characters when they are written in
830 * reordered sequence (the option <code>#UBIDI_INSERT_LRM_FOR_NUMERIC</code> can
831 * be used with function <code>ubidi_writeReordered</code> to this end. This
832 * mode is equivalent to calling <code>ubidi_setInverse()</code> with
833 * argument <code>isInverse</code> set to <code>true</code>.</li>
834 *
835 * <li>When the reordering mode is set to
836 * <code>#UBIDI_REORDER_INVERSE_LIKE_DIRECT</code>, the "direct" Logical to Visual
837 * Bidi algorithm is used as an approximation of an "inverse Bidi" algorithm.
838 * This mode is similar to mode <code>#UBIDI_REORDER_INVERSE_NUMBERS_AS_L</code>
839 * but is closer to the regular Bidi algorithm.
840 * <br>
841 * For example, an LTR paragraph with the content "FED 123 456 CBA" (where
842 * upper case represents RTL characters) will be transformed to
843 * "ABC 456 123 DEF", as opposed to "DEF 123 456 ABC"
844 * with mode <code>UBIDI_REORDER_INVERSE_NUMBERS_AS_L</code>.<br>
845 * When used in conjunction with option
846 * <code>#UBIDI_OPTION_INSERT_MARKS</code>, this mode generally
847 * adds Bidi marks to the output significantly more sparingly than mode
848 * <code>#UBIDI_REORDER_INVERSE_NUMBERS_AS_L</code> with option
849 * <code>#UBIDI_INSERT_LRM_FOR_NUMERIC</code> in calls to
850 * <code>ubidi_writeReordered</code>.</li>
851 *
852 * <li>When the reordering mode is set to
853 * <code>#UBIDI_REORDER_INVERSE_FOR_NUMBERS_SPECIAL</code>, the Logical to Visual
854 * Bidi algorithm used in Windows XP is used as an approximation of an "inverse Bidi" algorithm.
855 * <br>
856 * For example, an LTR paragraph with the content "abc FED123" (where
857 * upper case represents RTL characters) will be transformed to "abc 123DEF."</li>
858 * </ul>
859 *
860 * <p>In all the reordering modes specifying an "inverse Bidi" algorithm
861 * (i.e. those with a name starting with <code>UBIDI_REORDER_INVERSE</code>),
862 * output runs should be retrieved using
863 * <code>ubidi_getVisualRun()</code>, and the output text with
864 * <code>ubidi_writeReordered()</code>. The caller should keep in mind that in
865 * "inverse Bidi" modes the input is actually visually ordered text and
866 * reordered output returned by <code>ubidi_getVisualRun()</code> or
867 * <code>ubidi_writeReordered()</code> are actually runs or character string
868 * of logically ordered output.<br>
869 * For all the "inverse Bidi" modes, the source text should not contain
870 * Bidi control characters other than LRM or RLM.</p>
871 *
872 * <p>Note that option <code>#UBIDI_OUTPUT_REVERSE</code> of
873 * <code>ubidi_writeReordered</code> has no useful meaning and should not be
874 * used in conjunction with any value of the reordering mode specifying
875 * "inverse Bidi" or with value <code>UBIDI_REORDER_RUNS_ONLY</code>.
876 *
877 * @param pBiDi is a <code>UBiDi</code> object.
878 * @param reorderingMode specifies the required variant of the Bidi algorithm.
879 *
880 * @see UBiDiReorderingMode
881 * @see ubidi_setInverse
882 * @see ubidi_setPara
883 * @see ubidi_writeReordered
884 * @stable ICU 3.6
885 */
886U_CAPI void U_EXPORT2
887ubidi_setReorderingMode(UBiDi *pBiDi, UBiDiReorderingMode reorderingMode);
888
889/**
890 * What is the requested reordering mode for a given Bidi object?
891 *
892 * @param pBiDi is a <code>UBiDi</code> object.
893 * @return the current reordering mode of the Bidi object
894 * @see ubidi_setReorderingMode
895 * @stable ICU 3.6
896 */
897U_CAPI UBiDiReorderingMode U_EXPORT2
898ubidi_getReorderingMode(UBiDi *pBiDi);
899
900/**
901 * <code>UBiDiReorderingOption</code> values indicate which options are
902 * specified to affect the Bidi algorithm.
903 *
904 * @see ubidi_setReorderingOptions
905 * @stable ICU 3.6
906 */
907typedef enum UBiDiReorderingOption {
908    /**
909     * option value for <code>ubidi_setReorderingOptions</code>:
910     * disable all the options which can be set with this function
911     * @see ubidi_setReorderingOptions
912     * @stable ICU 3.6
913     */
914    UBIDI_OPTION_DEFAULT = 0,
915
916    /**
917     * option bit for <code>ubidi_setReorderingOptions</code>:
918     * insert Bidi marks (LRM or RLM) when needed to ensure correct result of
919     * a reordering to a Logical order
920     *
921     * <p>This option must be set or reset before calling
922     * <code>ubidi_setPara</code>.</p>
923     *
924     * <p>This option is significant only with reordering modes which generate
925     * a result with Logical order, specifically:</p>
926     * <ul>
927     *   <li><code>#UBIDI_REORDER_RUNS_ONLY</code></li>
928     *   <li><code>#UBIDI_REORDER_INVERSE_NUMBERS_AS_L</code></li>
929     *   <li><code>#UBIDI_REORDER_INVERSE_LIKE_DIRECT</code></li>
930     *   <li><code>#UBIDI_REORDER_INVERSE_FOR_NUMBERS_SPECIAL</code></li>
931     * </ul>
932     *
933     * <p>If this option is set in conjunction with reordering mode
934     * <code>#UBIDI_REORDER_INVERSE_NUMBERS_AS_L</code> or with calling
935     * <code>ubidi_setInverse(true)</code>, it implies
936     * option <code>#UBIDI_INSERT_LRM_FOR_NUMERIC</code>
937     * in calls to function <code>ubidi_writeReordered()</code>.</p>
938     *
939     * <p>For other reordering modes, a minimum number of LRM or RLM characters
940     * will be added to the source text after reordering it so as to ensure
941     * round trip, i.e. when applying the inverse reordering mode on the
942     * resulting logical text with removal of Bidi marks
943     * (option <code>#UBIDI_OPTION_REMOVE_CONTROLS</code> set before calling
944     * <code>ubidi_setPara()</code> or option <code>#UBIDI_REMOVE_BIDI_CONTROLS</code>
945     * in <code>ubidi_writeReordered</code>), the result will be identical to the
946     * source text in the first transformation.
947     *
948     * <p>This option will be ignored if specified together with option
949     * <code>#UBIDI_OPTION_REMOVE_CONTROLS</code>. It inhibits option
950     * <code>UBIDI_REMOVE_BIDI_CONTROLS</code> in calls to function
951     * <code>ubidi_writeReordered()</code> and it implies option
952     * <code>#UBIDI_INSERT_LRM_FOR_NUMERIC</code> in calls to function
953     * <code>ubidi_writeReordered()</code> if the reordering mode is
954     * <code>#UBIDI_REORDER_INVERSE_NUMBERS_AS_L</code>.</p>
955     *
956     * @see ubidi_setReorderingMode
957     * @see ubidi_setReorderingOptions
958     * @stable ICU 3.6
959     */
960    UBIDI_OPTION_INSERT_MARKS = 1,
961
962    /**
963     * option bit for <code>ubidi_setReorderingOptions</code>:
964     * remove Bidi control characters
965     *
966     * <p>This option must be set or reset before calling
967     * <code>ubidi_setPara</code>.</p>
968     *
969     * <p>This option nullifies option <code>#UBIDI_OPTION_INSERT_MARKS</code>.
970     * It inhibits option <code>#UBIDI_INSERT_LRM_FOR_NUMERIC</code> in calls
971     * to function <code>ubidi_writeReordered()</code> and it implies option
972     * <code>#UBIDI_REMOVE_BIDI_CONTROLS</code> in calls to that function.</p>
973     *
974     * @see ubidi_setReorderingMode
975     * @see ubidi_setReorderingOptions
976     * @stable ICU 3.6
977     */
978    UBIDI_OPTION_REMOVE_CONTROLS = 2,
979
980    /**
981     * option bit for <code>ubidi_setReorderingOptions</code>:
982     * process the output as part of a stream to be continued
983     *
984     * <p>This option must be set or reset before calling
985     * <code>ubidi_setPara</code>.</p>
986     *
987     * <p>This option specifies that the caller is interested in processing large
988     * text object in parts.
989     * The results of the successive calls are expected to be concatenated by the
990     * caller. Only the call for the last part will have this option bit off.</p>
991     *
992     * <p>When this option bit is on, <code>ubidi_setPara()</code> may process
993     * less than the full source text in order to truncate the text at a meaningful
994     * boundary. The caller should call <code>ubidi_getProcessedLength()</code>
995     * immediately after calling <code>ubidi_setPara()</code> in order to
996     * determine how much of the source text has been processed.
997     * Source text beyond that length should be resubmitted in following calls to
998     * <code>ubidi_setPara</code>. The processed length may be less than
999     * the length of the source text if a character preceding the last character of
1000     * the source text constitutes a reasonable boundary (like a block separator)
1001     * for text to be continued.<br>
1002     * If the last character of the source text constitutes a reasonable
1003     * boundary, the whole text will be processed at once.<br>
1004     * If nowhere in the source text there exists
1005     * such a reasonable boundary, the processed length will be zero.<br>
1006     * The caller should check for such an occurrence and do one of the following:
1007     * <ul><li>submit a larger amount of text with a better chance to include
1008     *         a reasonable boundary.</li>
1009     *     <li>resubmit the same text after turning off option
1010     *         <code>UBIDI_OPTION_STREAMING</code>.</li></ul>
1011     * In all cases, this option should be turned off before processing the last
1012     * part of the text.</p>
1013     *
1014     * <p>When the <code>UBIDI_OPTION_STREAMING</code> option is used,
1015     * it is recommended to call <code>ubidi_orderParagraphsLTR()</code> with
1016     * argument <code>orderParagraphsLTR</code> set to <code>true</code> before
1017     * calling <code>ubidi_setPara</code> so that later paragraphs may be
1018     * concatenated to previous paragraphs on the right.</p>
1019     *
1020     * @see ubidi_setReorderingMode
1021     * @see ubidi_setReorderingOptions
1022     * @see ubidi_getProcessedLength
1023     * @see ubidi_orderParagraphsLTR
1024     * @stable ICU 3.6
1025     */
1026    UBIDI_OPTION_STREAMING = 4
1027} UBiDiReorderingOption;
1028
1029/**
1030 * Specify which of the reordering options
1031 * should be applied during Bidi transformations.
1032 *
1033 * @param pBiDi is a <code>UBiDi</code> object.
1034 * @param reorderingOptions is a combination of zero or more of the following
1035 * options:
1036 * <code>#UBIDI_OPTION_DEFAULT</code>, <code>#UBIDI_OPTION_INSERT_MARKS</code>,
1037 * <code>#UBIDI_OPTION_REMOVE_CONTROLS</code>, <code>#UBIDI_OPTION_STREAMING</code>.
1038 *
1039 * @see ubidi_getReorderingOptions
1040 * @stable ICU 3.6
1041 */
1042U_CAPI void U_EXPORT2
1043ubidi_setReorderingOptions(UBiDi *pBiDi, uint32_t reorderingOptions);
1044
1045/**
1046 * What are the reordering options applied to a given Bidi object?
1047 *
1048 * @param pBiDi is a <code>UBiDi</code> object.
1049 * @return the current reordering options of the Bidi object
1050 * @see ubidi_setReorderingOptions
1051 * @stable ICU 3.6
1052 */
1053U_CAPI uint32_t U_EXPORT2
1054ubidi_getReorderingOptions(UBiDi *pBiDi);
1055
1056/**
1057 * Set the context before a call to ubidi_setPara().<p>
1058 *
1059 * ubidi_setPara() computes the left-right directionality for a given piece
1060 * of text which is supplied as one of its arguments. Sometimes this piece
1061 * of text (the "main text") should be considered in context, because text
1062 * appearing before ("prologue") and/or after ("epilogue") the main text
1063 * may affect the result of this computation.<p>
1064 *
1065 * This function specifies the prologue and/or the epilogue for the next
1066 * call to ubidi_setPara(). The characters specified as prologue and
1067 * epilogue should not be modified by the calling program until the call
1068 * to ubidi_setPara() has returned. If successive calls to ubidi_setPara()
1069 * all need specification of a context, ubidi_setContext() must be called
1070 * before each call to ubidi_setPara(). In other words, a context is not
1071 * "remembered" after the following successful call to ubidi_setPara().<p>
1072 *
1073 * If a call to ubidi_setPara() specifies UBIDI_DEFAULT_LTR or
1074 * UBIDI_DEFAULT_RTL as paraLevel and is preceded by a call to
1075 * ubidi_setContext() which specifies a prologue, the paragraph level will
1076 * be computed taking in consideration the text in the prologue.<p>
1077 *
1078 * When ubidi_setPara() is called without a previous call to
1079 * ubidi_setContext, the main text is handled as if preceded and followed
1080 * by strong directional characters at the current paragraph level.
1081 * Calling ubidi_setContext() with specification of a prologue will change
1082 * this behavior by handling the main text as if preceded by the last
1083 * strong character appearing in the prologue, if any.
1084 * Calling ubidi_setContext() with specification of an epilogue will change
1085 * the behavior of ubidi_setPara() by handling the main text as if followed
1086 * by the first strong character or digit appearing in the epilogue, if any.<p>
1087 *
1088 * Note 1: if <code>ubidi_setContext</code> is called repeatedly without
1089 *         calling <code>ubidi_setPara</code>, the earlier calls have no effect,
1090 *         only the last call will be remembered for the next call to
1091 *         <code>ubidi_setPara</code>.<p>
1092 *
1093 * Note 2: calling <code>ubidi_setContext(pBiDi, NULL, 0, NULL, 0, &errorCode)</code>
1094 *         cancels any previous setting of non-empty prologue or epilogue.
1095 *         The next call to <code>ubidi_setPara()</code> will process no
1096 *         prologue or epilogue.<p>
1097 *
1098 * Note 3: users must be aware that even after setting the context
1099 *         before a call to ubidi_setPara() to perform e.g. a logical to visual
1100 *         transformation, the resulting string may not be identical to what it
1101 *         would have been if all the text, including prologue and epilogue, had
1102 *         been processed together.<br>
1103 * Example (upper case letters represent RTL characters):<br>
1104 * &nbsp;&nbsp;prologue = "<code>abc DE</code>"<br>
1105 * &nbsp;&nbsp;epilogue = none<br>
1106 * &nbsp;&nbsp;main text = "<code>FGH xyz</code>"<br>
1107 * &nbsp;&nbsp;paraLevel = UBIDI_LTR<br>
1108 * &nbsp;&nbsp;display without prologue = "<code>HGF xyz</code>"
1109 *             ("HGF" is adjacent to "xyz")<br>
1110 * &nbsp;&nbsp;display with prologue = "<code>abc HGFED xyz</code>"
1111 *             ("HGF" is not adjacent to "xyz")<br>
1112 *
1113 * @param pBiDi is a paragraph <code>UBiDi</code> object.
1114 *
1115 * @param prologue is a pointer to the text which precedes the text that
1116 *        will be specified in a coming call to ubidi_setPara().
1117 *        If there is no prologue to consider, then <code>proLength</code>
1118 *        must be zero and this pointer can be NULL.
1119 *
1120 * @param proLength is the length of the prologue; if <code>proLength==-1</code>
1121 *        then the prologue must be zero-terminated.
1122 *        Otherwise proLength must be >= 0. If <code>proLength==0</code>, it means
1123 *        that there is no prologue to consider.
1124 *
1125 * @param epilogue is a pointer to the text which follows the text that
1126 *        will be specified in a coming call to ubidi_setPara().
1127 *        If there is no epilogue to consider, then <code>epiLength</code>
1128 *        must be zero and this pointer can be NULL.
1129 *
1130 * @param epiLength is the length of the epilogue; if <code>epiLength==-1</code>
1131 *        then the epilogue must be zero-terminated.
1132 *        Otherwise epiLength must be >= 0. If <code>epiLength==0</code>, it means
1133 *        that there is no epilogue to consider.
1134 *
1135 * @param pErrorCode must be a valid pointer to an error code value.
1136 *
1137 * @see ubidi_setPara
1138 * @stable ICU 4.8
1139 */
1140U_CAPI void U_EXPORT2
1141ubidi_setContext(UBiDi *pBiDi,
1142                 const UChar *prologue, int32_t proLength,
1143                 const UChar *epilogue, int32_t epiLength,
1144                 UErrorCode *pErrorCode);
1145
1146/**
1147 * Perform the Unicode Bidi algorithm. It is defined in the
1148 * <a href="http://www.unicode.org/unicode/reports/tr9/">Unicode Standard Annex #9</a>,
1149 * version 13,
1150 * also described in The Unicode Standard, Version 4.0 .<p>
1151 *
1152 * This function takes a piece of plain text containing one or more paragraphs,
1153 * with or without externally specified embedding levels from <i>styled</i>
1154 * text and computes the left-right-directionality of each character.<p>
1155 *
1156 * If the entire text is all of the same directionality, then
1157 * the function may not perform all the steps described by the algorithm,
1158 * i.e., some levels may not be the same as if all steps were performed.
1159 * This is not relevant for unidirectional text.<br>
1160 * For example, in pure LTR text with numbers the numbers would get
1161 * a resolved level of 2 higher than the surrounding text according to
1162 * the algorithm. This implementation may set all resolved levels to
1163 * the same value in such a case.<p>
1164 *
1165 * The text can be composed of multiple paragraphs. Occurrence of a block
1166 * separator in the text terminates a paragraph, and whatever comes next starts
1167 * a new paragraph. The exception to this rule is when a Carriage Return (CR)
1168 * is followed by a Line Feed (LF). Both CR and LF are block separators, but
1169 * in that case, the pair of characters is considered as terminating the
1170 * preceding paragraph, and a new paragraph will be started by a character
1171 * coming after the LF.
1172 *
1173 * @param pBiDi A <code>UBiDi</code> object allocated with <code>ubidi_open()</code>
1174 *        which will be set to contain the reordering information,
1175 *        especially the resolved levels for all the characters in <code>text</code>.
1176 *
1177 * @param text is a pointer to the text that the Bidi algorithm will be performed on.
1178 *        This pointer is stored in the UBiDi object and can be retrieved
1179 *        with <code>ubidi_getText()</code>.<br>
1180 *        <strong>Note:</strong> the text must be (at least) <code>length</code> long.
1181 *
1182 * @param length is the length of the text; if <code>length==-1</code> then
1183 *        the text must be zero-terminated.
1184 *
1185 * @param paraLevel specifies the default level for the text;
1186 *        it is typically 0 (LTR) or 1 (RTL).
1187 *        If the function shall determine the paragraph level from the text,
1188 *        then <code>paraLevel</code> can be set to
1189 *        either <code>#UBIDI_DEFAULT_LTR</code>
1190 *        or <code>#UBIDI_DEFAULT_RTL</code>; if the text contains multiple
1191 *        paragraphs, the paragraph level shall be determined separately for
1192 *        each paragraph; if a paragraph does not include any strongly typed
1193 *        character, then the desired default is used (0 for LTR or 1 for RTL).
1194 *        Any other value between 0 and <code>#UBIDI_MAX_EXPLICIT_LEVEL</code>
1195 *        is also valid, with odd levels indicating RTL.
1196 *
1197 * @param embeddingLevels (in) may be used to preset the embedding and override levels,
1198 *        ignoring characters like LRE and PDF in the text.
1199 *        A level overrides the directional property of its corresponding
1200 *        (same index) character if the level has the
1201 *        <code>#UBIDI_LEVEL_OVERRIDE</code> bit set.<br><br>
1202 *        Aside from that bit, it must be
1203 *        <code>paraLevel<=embeddingLevels[]<=UBIDI_MAX_EXPLICIT_LEVEL</code>,
1204 *        except that level 0 is always allowed.
1205 *        Level 0 for a paragraph separator prevents reordering of paragraphs;
1206 *        this only works reliably if <code>#UBIDI_LEVEL_OVERRIDE</code>
1207 *        is also set for paragraph separators.
1208 *        Level 0 for other characters is treated as a wildcard
1209 *        and is lifted up to the resolved level of the surrounding paragraph.<br><br>
1210 *        <strong>Caution: </strong>A copy of this pointer, not of the levels,
1211 *        will be stored in the <code>UBiDi</code> object;
1212 *        the <code>embeddingLevels</code> array must not be
1213 *        deallocated before the <code>UBiDi</code> structure is destroyed or reused,
1214 *        and the <code>embeddingLevels</code>
1215 *        should not be modified to avoid unexpected results on subsequent Bidi operations.
1216 *        However, the <code>ubidi_setPara()</code> and
1217 *        <code>ubidi_setLine()</code> functions may modify some or all of the levels.<br><br>
1218 *        After the <code>UBiDi</code> object is reused or destroyed, the caller
1219 *        must take care of the deallocation of the <code>embeddingLevels</code> array.<br><br>
1220 *        <strong>Note:</strong> the <code>embeddingLevels</code> array must be
1221 *        at least <code>length</code> long.
1222 *        This pointer can be <code>NULL</code> if this
1223 *        value is not necessary.
1224 *
1225 * @param pErrorCode must be a valid pointer to an error code value.
1226 * @stable ICU 2.0
1227 */
1228U_CAPI void U_EXPORT2
1229ubidi_setPara(UBiDi *pBiDi, const UChar *text, int32_t length,
1230              UBiDiLevel paraLevel, UBiDiLevel *embeddingLevels,
1231              UErrorCode *pErrorCode);
1232
1233/**
1234 * <code>ubidi_setLine()</code> sets a <code>UBiDi</code> to
1235 * contain the reordering information, especially the resolved levels,
1236 * for all the characters in a line of text. This line of text is
1237 * specified by referring to a <code>UBiDi</code> object representing
1238 * this information for a piece of text containing one or more paragraphs,
1239 * and by specifying a range of indexes in this text.<p>
1240 * In the new line object, the indexes will range from 0 to <code>limit-start-1</code>.<p>
1241 *
1242 * This is used after calling <code>ubidi_setPara()</code>
1243 * for a piece of text, and after line-breaking on that text.
1244 * It is not necessary if each paragraph is treated as a single line.<p>
1245 *
1246 * After line-breaking, rules (L1) and (L2) for the treatment of
1247 * trailing WS and for reordering are performed on
1248 * a <code>UBiDi</code> object that represents a line.<p>
1249 *
1250 * <strong>Important: </strong><code>pLineBiDi</code> shares data with
1251 * <code>pParaBiDi</code>.
1252 * You must destroy or reuse <code>pLineBiDi</code> before <code>pParaBiDi</code>.
1253 * In other words, you must destroy or reuse the <code>UBiDi</code> object for a line
1254 * before the object for its parent paragraph.<p>
1255 *
1256 * The text pointer that was stored in <code>pParaBiDi</code> is also copied,
1257 * and <code>start</code> is added to it so that it points to the beginning of the
1258 * line for this object.
1259 *
1260 * @param pParaBiDi is the parent paragraph object. It must have been set
1261 * by a successful call to ubidi_setPara.
1262 *
1263 * @param start is the line's first index into the text.
1264 *
1265 * @param limit is just behind the line's last index into the text
1266 *        (its last index +1).<br>
1267 *        It must be <code>0<=start<limit<=</code>containing paragraph limit.
1268 *        If the specified line crosses a paragraph boundary, the function
1269 *        will terminate with error code U_ILLEGAL_ARGUMENT_ERROR.
1270 *
1271 * @param pLineBiDi is the object that will now represent a line of the text.
1272 *
1273 * @param pErrorCode must be a valid pointer to an error code value.
1274 *
1275 * @see ubidi_setPara
1276 * @see ubidi_getProcessedLength
1277 * @stable ICU 2.0
1278 */
1279U_CAPI void U_EXPORT2
1280ubidi_setLine(const UBiDi *pParaBiDi,
1281              int32_t start, int32_t limit,
1282              UBiDi *pLineBiDi,
1283              UErrorCode *pErrorCode);
1284
1285/**
1286 * Get the directionality of the text.
1287 *
1288 * @param pBiDi is the paragraph or line <code>UBiDi</code> object.
1289 *
1290 * @return a value of <code>UBIDI_LTR</code>, <code>UBIDI_RTL</code>
1291 *         or <code>UBIDI_MIXED</code>
1292 *         that indicates if the entire text
1293 *         represented by this object is unidirectional,
1294 *         and which direction, or if it is mixed-directional.
1295 * Note -  The value <code>UBIDI_NEUTRAL</code> is never returned from this method.
1296 *
1297 * @see UBiDiDirection
1298 * @stable ICU 2.0
1299 */
1300U_CAPI UBiDiDirection U_EXPORT2
1301ubidi_getDirection(const UBiDi *pBiDi);
1302
1303/**
1304 * Gets the base direction of the text provided according
1305 * to the Unicode Bidirectional Algorithm. The base direction
1306 * is derived from the first character in the string with bidirectional
1307 * character type L, R, or AL. If the first such character has type L,
1308 * <code>UBIDI_LTR</code> is returned. If the first such character has
1309 * type R or AL, <code>UBIDI_RTL</code> is returned. If the string does
1310 * not contain any character of these types, then
1311 * <code>UBIDI_NEUTRAL</code> is returned.
1312 *
1313 * This is a lightweight function for use when only the base direction
1314 * is needed and no further bidi processing of the text is needed.
1315 *
1316 * @param text is a pointer to the text whose base
1317 *             direction is needed.
1318 * Note: the text must be (at least) @c length long.
1319 *
1320 * @param length is the length of the text;
1321 *               if <code>length==-1</code> then the text
1322 *               must be zero-terminated.
1323 *
1324 * @return  <code>UBIDI_LTR</code>, <code>UBIDI_RTL</code>,
1325 *          <code>UBIDI_NEUTRAL</code>
1326 *
1327 * @see UBiDiDirection
1328 * @stable ICU 4.6
1329 */
1330U_CAPI UBiDiDirection U_EXPORT2
1331ubidi_getBaseDirection(const UChar *text,  int32_t length );
1332
1333/**
1334 * Get the pointer to the text.
1335 *
1336 * @param pBiDi is the paragraph or line <code>UBiDi</code> object.
1337 *
1338 * @return The pointer to the text that the UBiDi object was created for.
1339 *
1340 * @see ubidi_setPara
1341 * @see ubidi_setLine
1342 * @stable ICU 2.0
1343 */
1344U_CAPI const UChar * U_EXPORT2
1345ubidi_getText(const UBiDi *pBiDi);
1346
1347/**
1348 * Get the length of the text.
1349 *
1350 * @param pBiDi is the paragraph or line <code>UBiDi</code> object.
1351 *
1352 * @return The length of the text that the UBiDi object was created for.
1353 * @stable ICU 2.0
1354 */
1355U_CAPI int32_t U_EXPORT2
1356ubidi_getLength(const UBiDi *pBiDi);
1357
1358/**
1359 * Get the paragraph level of the text.
1360 *
1361 * @param pBiDi is the paragraph or line <code>UBiDi</code> object.
1362 *
1363 * @return The paragraph level. If there are multiple paragraphs, their
1364 *         level may vary if the required paraLevel is UBIDI_DEFAULT_LTR or
1365 *         UBIDI_DEFAULT_RTL.  In that case, the level of the first paragraph
1366 *         is returned.
1367 *
1368 * @see UBiDiLevel
1369 * @see ubidi_getParagraph
1370 * @see ubidi_getParagraphByIndex
1371 * @stable ICU 2.0
1372 */
1373U_CAPI UBiDiLevel U_EXPORT2
1374ubidi_getParaLevel(const UBiDi *pBiDi);
1375
1376/**
1377 * Get the number of paragraphs.
1378 *
1379 * @param pBiDi is the paragraph or line <code>UBiDi</code> object.
1380 *
1381 * @return The number of paragraphs.
1382 * @stable ICU 3.4
1383 */
1384U_CAPI int32_t U_EXPORT2
1385ubidi_countParagraphs(UBiDi *pBiDi);
1386
1387/**
1388 * Get a paragraph, given a position within the text.
1389 * This function returns information about a paragraph.<br>
1390 * Note: if the paragraph index is known, it is more efficient to
1391 * retrieve the paragraph information using ubidi_getParagraphByIndex().<p>
1392 *
1393 * @param pBiDi is the paragraph or line <code>UBiDi</code> object.
1394 *
1395 * @param charIndex is the index of a character within the text, in the
1396 *        range <code>[0..ubidi_getProcessedLength(pBiDi)-1]</code>.
1397 *
1398 * @param pParaStart will receive the index of the first character of the
1399 *        paragraph in the text.
1400 *        This pointer can be <code>NULL</code> if this
1401 *        value is not necessary.
1402 *
1403 * @param pParaLimit will receive the limit of the paragraph.
1404 *        The l-value that you point to here may be the
1405 *        same expression (variable) as the one for
1406 *        <code>charIndex</code>.
1407 *        This pointer can be <code>NULL</code> if this
1408 *        value is not necessary.
1409 *
1410 * @param pParaLevel will receive the level of the paragraph.
1411 *        This pointer can be <code>NULL</code> if this
1412 *        value is not necessary.
1413 *
1414 * @param pErrorCode must be a valid pointer to an error code value.
1415 *
1416 * @return The index of the paragraph containing the specified position.
1417 *
1418 * @see ubidi_getProcessedLength
1419 * @stable ICU 3.4
1420 */
1421U_CAPI int32_t U_EXPORT2
1422ubidi_getParagraph(const UBiDi *pBiDi, int32_t charIndex, int32_t *pParaStart,
1423                   int32_t *pParaLimit, UBiDiLevel *pParaLevel,
1424                   UErrorCode *pErrorCode);
1425
1426/**
1427 * Get a paragraph, given the index of this paragraph.
1428 *
1429 * This function returns information about a paragraph.<p>
1430 *
1431 * @param pBiDi is the paragraph <code>UBiDi</code> object.
1432 *
1433 * @param paraIndex is the number of the paragraph, in the
1434 *        range <code>[0..ubidi_countParagraphs(pBiDi)-1]</code>.
1435 *
1436 * @param pParaStart will receive the index of the first character of the
1437 *        paragraph in the text.
1438 *        This pointer can be <code>NULL</code> if this
1439 *        value is not necessary.
1440 *
1441 * @param pParaLimit will receive the limit of the paragraph.
1442 *        This pointer can be <code>NULL</code> if this
1443 *        value is not necessary.
1444 *
1445 * @param pParaLevel will receive the level of the paragraph.
1446 *        This pointer can be <code>NULL</code> if this
1447 *        value is not necessary.
1448 *
1449 * @param pErrorCode must be a valid pointer to an error code value.
1450 *
1451 * @stable ICU 3.4
1452 */
1453U_CAPI void U_EXPORT2
1454ubidi_getParagraphByIndex(const UBiDi *pBiDi, int32_t paraIndex,
1455                          int32_t *pParaStart, int32_t *pParaLimit,
1456                          UBiDiLevel *pParaLevel, UErrorCode *pErrorCode);
1457
1458/**
1459 * Get the level for one character.
1460 *
1461 * @param pBiDi is the paragraph or line <code>UBiDi</code> object.
1462 *
1463 * @param charIndex the index of a character. It must be in the range
1464 *         [0..ubidi_getProcessedLength(pBiDi)].
1465 *
1466 * @return The level for the character at charIndex (0 if charIndex is not
1467 *         in the valid range).
1468 *
1469 * @see UBiDiLevel
1470 * @see ubidi_getProcessedLength
1471 * @stable ICU 2.0
1472 */
1473U_CAPI UBiDiLevel U_EXPORT2
1474ubidi_getLevelAt(const UBiDi *pBiDi, int32_t charIndex);
1475
1476/**
1477 * Get an array of levels for each character.<p>
1478 *
1479 * Note that this function may allocate memory under some
1480 * circumstances, unlike <code>ubidi_getLevelAt()</code>.
1481 *
1482 * @param pBiDi is the paragraph or line <code>UBiDi</code> object, whose
1483 *        text length must be strictly positive.
1484 *
1485 * @param pErrorCode must be a valid pointer to an error code value.
1486 *
1487 * @return The levels array for the text,
1488 *         or <code>NULL</code> if an error occurs.
1489 *
1490 * @see UBiDiLevel
1491 * @see ubidi_getProcessedLength
1492 * @stable ICU 2.0
1493 */
1494U_CAPI const UBiDiLevel * U_EXPORT2
1495ubidi_getLevels(UBiDi *pBiDi, UErrorCode *pErrorCode);
1496
1497/**
1498 * Get a logical run.
1499 * This function returns information about a run and is used
1500 * to retrieve runs in logical order.<p>
1501 * This is especially useful for line-breaking on a paragraph.
1502 *
1503 * @param pBiDi is the paragraph or line <code>UBiDi</code> object.
1504 *
1505 * @param logicalPosition is a logical position within the source text.
1506 *
1507 * @param pLogicalLimit will receive the limit of the corresponding run.
1508 *        The l-value that you point to here may be the
1509 *        same expression (variable) as the one for
1510 *        <code>logicalPosition</code>.
1511 *        This pointer can be <code>NULL</code> if this
1512 *        value is not necessary.
1513 *
1514 * @param pLevel will receive the level of the corresponding run.
1515 *        This pointer can be <code>NULL</code> if this
1516 *        value is not necessary.
1517 *
1518 * @see ubidi_getProcessedLength
1519 * @stable ICU 2.0
1520 */
1521U_CAPI void U_EXPORT2
1522ubidi_getLogicalRun(const UBiDi *pBiDi, int32_t logicalPosition,
1523                    int32_t *pLogicalLimit, UBiDiLevel *pLevel);
1524
1525/**
1526 * Get the number of runs.
1527 * This function may invoke the actual reordering on the
1528 * <code>UBiDi</code> object, after <code>ubidi_setPara()</code>
1529 * may have resolved only the levels of the text. Therefore,
1530 * <code>ubidi_countRuns()</code> may have to allocate memory,
1531 * and may fail doing so.
1532 *
1533 * @param pBiDi is the paragraph or line <code>UBiDi</code> object.
1534 *
1535 * @param pErrorCode must be a valid pointer to an error code value.
1536 *
1537 * @return The number of runs.
1538 * @stable ICU 2.0
1539 */
1540U_CAPI int32_t U_EXPORT2
1541ubidi_countRuns(UBiDi *pBiDi, UErrorCode *pErrorCode);
1542
1543/**
1544 * Get one run's logical start, length, and directionality,
1545 * which can be 0 for LTR or 1 for RTL.
1546 * In an RTL run, the character at the logical start is
1547 * visually on the right of the displayed run.
1548 * The length is the number of characters in the run.<p>
1549 * <code>ubidi_countRuns()</code> should be called
1550 * before the runs are retrieved.
1551 *
1552 * @param pBiDi is the paragraph or line <code>UBiDi</code> object.
1553 *
1554 * @param runIndex is the number of the run in visual order, in the
1555 *        range <code>[0..ubidi_countRuns(pBiDi)-1]</code>.
1556 *
1557 * @param pLogicalStart is the first logical character index in the text.
1558 *        The pointer may be <code>NULL</code> if this index is not needed.
1559 *
1560 * @param pLength is the number of characters (at least one) in the run.
1561 *        The pointer may be <code>NULL</code> if this is not needed.
1562 *
1563 * @return the directionality of the run,
1564 *         <code>UBIDI_LTR==0</code> or <code>UBIDI_RTL==1</code>,
1565 *         never <code>UBIDI_MIXED</code>,
1566 *         never <code>UBIDI_NEUTRAL</code>.
1567 *
1568 * @see ubidi_countRuns
1569 *
1570 * Example:
1571 * <pre>
1572 * \code
1573 * int32_t i, count=ubidi_countRuns(pBiDi),
1574 *         logicalStart, visualIndex=0, length;
1575 * for(i=0; i<count; ++i) {
1576 *    if(UBIDI_LTR==ubidi_getVisualRun(pBiDi, i, &logicalStart, &length)) {
1577 *         do { // LTR
1578 *             show_char(text[logicalStart++], visualIndex++);
1579 *         } while(--length>0);
1580 *     } else {
1581 *         logicalStart+=length;  // logicalLimit
1582 *         do { // RTL
1583 *             show_char(text[--logicalStart], visualIndex++);
1584 *         } while(--length>0);
1585 *     }
1586 * }
1587 *\endcode
1588 * </pre>
1589 *
1590 * Note that in right-to-left runs, code like this places
1591 * second surrogates before first ones (which is generally a bad idea)
1592 * and combining characters before base characters.
1593 * <p>
1594 * Use of <code>ubidi_writeReordered()</code>, optionally with the
1595 * <code>#UBIDI_KEEP_BASE_COMBINING</code> option, can be considered in order
1596 * to avoid these issues.
1597 * @stable ICU 2.0
1598 */
1599U_CAPI UBiDiDirection U_EXPORT2
1600ubidi_getVisualRun(UBiDi *pBiDi, int32_t runIndex,
1601                   int32_t *pLogicalStart, int32_t *pLength);
1602
1603/**
1604 * Get the visual position from a logical text position.
1605 * If such a mapping is used many times on the same
1606 * <code>UBiDi</code> object, then calling
1607 * <code>ubidi_getLogicalMap()</code> is more efficient.<p>
1608 *
1609 * The value returned may be <code>#UBIDI_MAP_NOWHERE</code> if there is no
1610 * visual position because the corresponding text character is a Bidi control
1611 * removed from output by the option <code>#UBIDI_OPTION_REMOVE_CONTROLS</code>.
1612 * <p>
1613 * When the visual output is altered by using options of
1614 * <code>ubidi_writeReordered()</code> such as <code>UBIDI_INSERT_LRM_FOR_NUMERIC</code>,
1615 * <code>UBIDI_KEEP_BASE_COMBINING</code>, <code>UBIDI_OUTPUT_REVERSE</code>,
1616 * <code>UBIDI_REMOVE_BIDI_CONTROLS</code>, the visual position returned may not
1617 * be correct. It is advised to use, when possible, reordering options
1618 * such as <code>UBIDI_OPTION_INSERT_MARKS</code> and <code>UBIDI_OPTION_REMOVE_CONTROLS</code>.
1619 * <p>
1620 * Note that in right-to-left runs, this mapping places
1621 * second surrogates before first ones (which is generally a bad idea)
1622 * and combining characters before base characters.
1623 * Use of <code>ubidi_writeReordered()</code>, optionally with the
1624 * <code>#UBIDI_KEEP_BASE_COMBINING</code> option can be considered instead
1625 * of using the mapping, in order to avoid these issues.
1626 *
1627 * @param pBiDi is the paragraph or line <code>UBiDi</code> object.
1628 *
1629 * @param logicalIndex is the index of a character in the text.
1630 *
1631 * @param pErrorCode must be a valid pointer to an error code value.
1632 *
1633 * @return The visual position of this character.
1634 *
1635 * @see ubidi_getLogicalMap
1636 * @see ubidi_getLogicalIndex
1637 * @see ubidi_getProcessedLength
1638 * @stable ICU 2.0
1639 */
1640U_CAPI int32_t U_EXPORT2
1641ubidi_getVisualIndex(UBiDi *pBiDi, int32_t logicalIndex, UErrorCode *pErrorCode);
1642
1643/**
1644 * Get the logical text position from a visual position.
1645 * If such a mapping is used many times on the same
1646 * <code>UBiDi</code> object, then calling
1647 * <code>ubidi_getVisualMap()</code> is more efficient.<p>
1648 *
1649 * The value returned may be <code>#UBIDI_MAP_NOWHERE</code> if there is no
1650 * logical position because the corresponding text character is a Bidi mark
1651 * inserted in the output by option <code>#UBIDI_OPTION_INSERT_MARKS</code>.
1652 * <p>
1653 * This is the inverse function to <code>ubidi_getVisualIndex()</code>.
1654 * <p>
1655 * When the visual output is altered by using options of
1656 * <code>ubidi_writeReordered()</code> such as <code>UBIDI_INSERT_LRM_FOR_NUMERIC</code>,
1657 * <code>UBIDI_KEEP_BASE_COMBINING</code>, <code>UBIDI_OUTPUT_REVERSE</code>,
1658 * <code>UBIDI_REMOVE_BIDI_CONTROLS</code>, the logical position returned may not
1659 * be correct. It is advised to use, when possible, reordering options
1660 * such as <code>UBIDI_OPTION_INSERT_MARKS</code> and <code>UBIDI_OPTION_REMOVE_CONTROLS</code>.
1661 *
1662 * @param pBiDi is the paragraph or line <code>UBiDi</code> object.
1663 *
1664 * @param visualIndex is the visual position of a character.
1665 *
1666 * @param pErrorCode must be a valid pointer to an error code value.
1667 *
1668 * @return The index of this character in the text.
1669 *
1670 * @see ubidi_getVisualMap
1671 * @see ubidi_getVisualIndex
1672 * @see ubidi_getResultLength
1673 * @stable ICU 2.0
1674 */
1675U_CAPI int32_t U_EXPORT2
1676ubidi_getLogicalIndex(UBiDi *pBiDi, int32_t visualIndex, UErrorCode *pErrorCode);
1677
1678/**
1679 * Get a logical-to-visual index map (array) for the characters in the UBiDi
1680 * (paragraph or line) object.
1681 * <p>
1682 * Some values in the map may be <code>#UBIDI_MAP_NOWHERE</code> if the
1683 * corresponding text characters are Bidi controls removed from the visual
1684 * output by the option <code>#UBIDI_OPTION_REMOVE_CONTROLS</code>.
1685 * <p>
1686 * When the visual output is altered by using options of
1687 * <code>ubidi_writeReordered()</code> such as <code>UBIDI_INSERT_LRM_FOR_NUMERIC</code>,
1688 * <code>UBIDI_KEEP_BASE_COMBINING</code>, <code>UBIDI_OUTPUT_REVERSE</code>,
1689 * <code>UBIDI_REMOVE_BIDI_CONTROLS</code>, the visual positions returned may not
1690 * be correct. It is advised to use, when possible, reordering options
1691 * such as <code>UBIDI_OPTION_INSERT_MARKS</code> and <code>UBIDI_OPTION_REMOVE_CONTROLS</code>.
1692 * <p>
1693 * Note that in right-to-left runs, this mapping places
1694 * second surrogates before first ones (which is generally a bad idea)
1695 * and combining characters before base characters.
1696 * Use of <code>ubidi_writeReordered()</code>, optionally with the
1697 * <code>#UBIDI_KEEP_BASE_COMBINING</code> option can be considered instead
1698 * of using the mapping, in order to avoid these issues.
1699 *
1700 * @param pBiDi is the paragraph or line <code>UBiDi</code> object.
1701 *
1702 * @param indexMap is a pointer to an array of <code>ubidi_getProcessedLength()</code>
1703 *        indexes which will reflect the reordering of the characters.
1704 *        If option <code>#UBIDI_OPTION_INSERT_MARKS</code> is set, the number
1705 *        of elements allocated in <code>indexMap</code> must be no less than
1706 *        <code>ubidi_getResultLength()</code>.
1707 *        The array does not need to be initialized.<br><br>
1708 *        The index map will result in <code>indexMap[logicalIndex]==visualIndex</code>.
1709 *
1710 * @param pErrorCode must be a valid pointer to an error code value.
1711 *
1712 * @see ubidi_getVisualMap
1713 * @see ubidi_getVisualIndex
1714 * @see ubidi_getProcessedLength
1715 * @see ubidi_getResultLength
1716 * @stable ICU 2.0
1717 */
1718U_CAPI void U_EXPORT2
1719ubidi_getLogicalMap(UBiDi *pBiDi, int32_t *indexMap, UErrorCode *pErrorCode);
1720
1721/**
1722 * Get a visual-to-logical index map (array) for the characters in the UBiDi
1723 * (paragraph or line) object.
1724 * <p>
1725 * Some values in the map may be <code>#UBIDI_MAP_NOWHERE</code> if the
1726 * corresponding text characters are Bidi marks inserted in the visual output
1727 * by the option <code>#UBIDI_OPTION_INSERT_MARKS</code>.
1728 * <p>
1729 * When the visual output is altered by using options of
1730 * <code>ubidi_writeReordered()</code> such as <code>UBIDI_INSERT_LRM_FOR_NUMERIC</code>,
1731 * <code>UBIDI_KEEP_BASE_COMBINING</code>, <code>UBIDI_OUTPUT_REVERSE</code>,
1732 * <code>UBIDI_REMOVE_BIDI_CONTROLS</code>, the logical positions returned may not
1733 * be correct. It is advised to use, when possible, reordering options
1734 * such as <code>UBIDI_OPTION_INSERT_MARKS</code> and <code>UBIDI_OPTION_REMOVE_CONTROLS</code>.
1735 *
1736 * @param pBiDi is the paragraph or line <code>UBiDi</code> object.
1737 *
1738 * @param indexMap is a pointer to an array of <code>ubidi_getResultLength()</code>
1739 *        indexes which will reflect the reordering of the characters.
1740 *        If option <code>#UBIDI_OPTION_REMOVE_CONTROLS</code> is set, the number
1741 *        of elements allocated in <code>indexMap</code> must be no less than
1742 *        <code>ubidi_getProcessedLength()</code>.
1743 *        The array does not need to be initialized.<br><br>
1744 *        The index map will result in <code>indexMap[visualIndex]==logicalIndex</code>.
1745 *
1746 * @param pErrorCode must be a valid pointer to an error code value.
1747 *
1748 * @see ubidi_getLogicalMap
1749 * @see ubidi_getLogicalIndex
1750 * @see ubidi_getProcessedLength
1751 * @see ubidi_getResultLength
1752 * @stable ICU 2.0
1753 */
1754U_CAPI void U_EXPORT2
1755ubidi_getVisualMap(UBiDi *pBiDi, int32_t *indexMap, UErrorCode *pErrorCode);
1756
1757/**
1758 * This is a convenience function that does not use a UBiDi object.
1759 * It is intended to be used for when an application has determined the levels
1760 * of objects (character sequences) and just needs to have them reordered (L2).
1761 * This is equivalent to using <code>ubidi_getLogicalMap()</code> on a
1762 * <code>UBiDi</code> object.
1763 *
1764 * @param levels is an array with <code>length</code> levels that have been determined by
1765 *        the application.
1766 *
1767 * @param length is the number of levels in the array, or, semantically,
1768 *        the number of objects to be reordered.
1769 *        It must be <code>length>0</code>.
1770 *
1771 * @param indexMap is a pointer to an array of <code>length</code>
1772 *        indexes which will reflect the reordering of the characters.
1773 *        The array does not need to be initialized.<p>
1774 *        The index map will result in <code>indexMap[logicalIndex]==visualIndex</code>.
1775 * @stable ICU 2.0
1776 */
1777U_CAPI void U_EXPORT2
1778ubidi_reorderLogical(const UBiDiLevel *levels, int32_t length, int32_t *indexMap);
1779
1780/**
1781 * This is a convenience function that does not use a UBiDi object.
1782 * It is intended to be used for when an application has determined the levels
1783 * of objects (character sequences) and just needs to have them reordered (L2).
1784 * This is equivalent to using <code>ubidi_getVisualMap()</code> on a
1785 * <code>UBiDi</code> object.
1786 *
1787 * @param levels is an array with <code>length</code> levels that have been determined by
1788 *        the application.
1789 *
1790 * @param length is the number of levels in the array, or, semantically,
1791 *        the number of objects to be reordered.
1792 *        It must be <code>length>0</code>.
1793 *
1794 * @param indexMap is a pointer to an array of <code>length</code>
1795 *        indexes which will reflect the reordering of the characters.
1796 *        The array does not need to be initialized.<p>
1797 *        The index map will result in <code>indexMap[visualIndex]==logicalIndex</code>.
1798 * @stable ICU 2.0
1799 */
1800U_CAPI void U_EXPORT2
1801ubidi_reorderVisual(const UBiDiLevel *levels, int32_t length, int32_t *indexMap);
1802
1803/**
1804 * Invert an index map.
1805 * The index mapping of the first map is inverted and written to
1806 * the second one.
1807 *
1808 * @param srcMap is an array with <code>length</code> elements
1809 *        which defines the original mapping from a source array containing
1810 *        <code>length</code> elements to a destination array.
1811 *        Some elements of the source array may have no mapping in the
1812 *        destination array. In that case, their value will be
1813 *        the special value <code>UBIDI_MAP_NOWHERE</code>.
1814 *        All elements must be >=0 or equal to <code>UBIDI_MAP_NOWHERE</code>.
1815 *        Some elements may have a value >= <code>length</code>, if the
1816 *        destination array has more elements than the source array.
1817 *        There must be no duplicate indexes (two or more elements with the
1818 *        same value except <code>UBIDI_MAP_NOWHERE</code>).
1819 *
1820 * @param destMap is an array with a number of elements equal to 1 + the highest
1821 *        value in <code>srcMap</code>.
1822 *        <code>destMap</code> will be filled with the inverse mapping.
1823 *        If element with index i in <code>srcMap</code> has a value k different
1824 *        from <code>UBIDI_MAP_NOWHERE</code>, this means that element i of
1825 *        the source array maps to element k in the destination array.
1826 *        The inverse map will have value i in its k-th element.
1827 *        For all elements of the destination array which do not map to
1828 *        an element in the source array, the corresponding element in the
1829 *        inverse map will have a value equal to <code>UBIDI_MAP_NOWHERE</code>.
1830 *
1831 * @param length is the length of each array.
1832 * @see UBIDI_MAP_NOWHERE
1833 * @stable ICU 2.0
1834 */
1835U_CAPI void U_EXPORT2
1836ubidi_invertMap(const int32_t *srcMap, int32_t *destMap, int32_t length);
1837
1838/** option flags for ubidi_writeReordered() */
1839
1840/**
1841 * option bit for ubidi_writeReordered():
1842 * keep combining characters after their base characters in RTL runs
1843 *
1844 * @see ubidi_writeReordered
1845 * @stable ICU 2.0
1846 */
1847#define UBIDI_KEEP_BASE_COMBINING       1
1848
1849/**
1850 * option bit for ubidi_writeReordered():
1851 * replace characters with the "mirrored" property in RTL runs
1852 * by their mirror-image mappings
1853 *
1854 * @see ubidi_writeReordered
1855 * @stable ICU 2.0
1856 */
1857#define UBIDI_DO_MIRRORING              2
1858
1859/**
1860 * option bit for ubidi_writeReordered():
1861 * surround the run with LRMs if necessary;
1862 * this is part of the approximate "inverse Bidi" algorithm
1863 *
1864 * <p>This option does not imply corresponding adjustment of the index
1865 * mappings.</p>
1866 *
1867 * @see ubidi_setInverse
1868 * @see ubidi_writeReordered
1869 * @stable ICU 2.0
1870 */
1871#define UBIDI_INSERT_LRM_FOR_NUMERIC    4
1872
1873/**
1874 * option bit for ubidi_writeReordered():
1875 * remove Bidi control characters
1876 * (this does not affect #UBIDI_INSERT_LRM_FOR_NUMERIC)
1877 *
1878 * <p>This option does not imply corresponding adjustment of the index
1879 * mappings.</p>
1880 *
1881 * @see ubidi_writeReordered
1882 * @stable ICU 2.0
1883 */
1884#define UBIDI_REMOVE_BIDI_CONTROLS      8
1885
1886/**
1887 * option bit for ubidi_writeReordered():
1888 * write the output in reverse order
1889 *
1890 * <p>This has the same effect as calling <code>ubidi_writeReordered()</code>
1891 * first without this option, and then calling
1892 * <code>ubidi_writeReverse()</code> without mirroring.
1893 * Doing this in the same step is faster and avoids a temporary buffer.
1894 * An example for using this option is output to a character terminal that
1895 * is designed for RTL scripts and stores text in reverse order.</p>
1896 *
1897 * @see ubidi_writeReordered
1898 * @stable ICU 2.0
1899 */
1900#define UBIDI_OUTPUT_REVERSE            16
1901
1902/**
1903 * Get the length of the source text processed by the last call to
1904 * <code>ubidi_setPara()</code>. This length may be different from the length
1905 * of the source text if option <code>#UBIDI_OPTION_STREAMING</code>
1906 * has been set.
1907 * <br>
1908 * Note that whenever the length of the text affects the execution or the
1909 * result of a function, it is the processed length which must be considered,
1910 * except for <code>ubidi_setPara</code> (which receives unprocessed source
1911 * text) and <code>ubidi_getLength</code> (which returns the original length
1912 * of the source text).<br>
1913 * In particular, the processed length is the one to consider in the following
1914 * cases:
1915 * <ul>
1916 * <li>maximum value of the <code>limit</code> argument of
1917 * <code>ubidi_setLine</code></li>
1918 * <li>maximum value of the <code>charIndex</code> argument of
1919 * <code>ubidi_getParagraph</code></li>
1920 * <li>maximum value of the <code>charIndex</code> argument of
1921 * <code>ubidi_getLevelAt</code></li>
1922 * <li>number of elements in the array returned by <code>ubidi_getLevels</code></li>
1923 * <li>maximum value of the <code>logicalStart</code> argument of
1924 * <code>ubidi_getLogicalRun</code></li>
1925 * <li>maximum value of the <code>logicalIndex</code> argument of
1926 * <code>ubidi_getVisualIndex</code></li>
1927 * <li>number of elements filled in the <code>*indexMap</code> argument of
1928 * <code>ubidi_getLogicalMap</code></li>
1929 * <li>length of text processed by <code>ubidi_writeReordered</code></li>
1930 * </ul>
1931 *
1932 * @param pBiDi is the paragraph <code>UBiDi</code> object.
1933 *
1934 * @return The length of the part of the source text processed by
1935 *         the last call to <code>ubidi_setPara</code>.
1936 * @see ubidi_setPara
1937 * @see UBIDI_OPTION_STREAMING
1938 * @stable ICU 3.6
1939 */
1940U_CAPI int32_t U_EXPORT2
1941ubidi_getProcessedLength(const UBiDi *pBiDi);
1942
1943/**
1944 * Get the length of the reordered text resulting from the last call to
1945 * <code>ubidi_setPara()</code>. This length may be different from the length
1946 * of the source text if option <code>#UBIDI_OPTION_INSERT_MARKS</code>
1947 * or option <code>#UBIDI_OPTION_REMOVE_CONTROLS</code> has been set.
1948 * <br>
1949 * This resulting length is the one to consider in the following cases:
1950 * <ul>
1951 * <li>maximum value of the <code>visualIndex</code> argument of
1952 * <code>ubidi_getLogicalIndex</code></li>
1953 * <li>number of elements of the <code>*indexMap</code> argument of
1954 * <code>ubidi_getVisualMap</code></li>
1955 * </ul>
1956 * Note that this length stays identical to the source text length if
1957 * Bidi marks are inserted or removed using option bits of
1958 * <code>ubidi_writeReordered</code>, or if option
1959 * <code>#UBIDI_REORDER_INVERSE_NUMBERS_AS_L</code> has been set.
1960 *
1961 * @param pBiDi is the paragraph <code>UBiDi</code> object.
1962 *
1963 * @return The length of the reordered text resulting from
1964 *         the last call to <code>ubidi_setPara</code>.
1965 * @see ubidi_setPara
1966 * @see UBIDI_OPTION_INSERT_MARKS
1967 * @see UBIDI_OPTION_REMOVE_CONTROLS
1968 * @stable ICU 3.6
1969 */
1970U_CAPI int32_t U_EXPORT2
1971ubidi_getResultLength(const UBiDi *pBiDi);
1972
1973U_CDECL_BEGIN
1974
1975/**
1976 * Callback type declaration for overriding default Bidi class values with
1977 * custom ones.
1978 * <p>Usually, the function pointer will be propagated to a <code>UBiDi</code>
1979 * object by calling the <code>ubidi_setClassCallback()</code> function;
1980 * then the callback will be invoked by the UBA implementation any time the
1981 * class of a character is to be determined.</p>
1982 *
1983 * @param context is a pointer to the callback private data.
1984 *
1985 * @param c       is the code point to get a Bidi class for.
1986 *
1987 * @return The directional property / Bidi class for the given code point
1988 *         <code>c</code> if the default class has been overridden, or
1989 *         <code>u_getIntPropertyMaxValue(UCHAR_BIDI_CLASS)+1</code>
1990 *         if the standard Bidi class value for <code>c</code> is to be used.
1991 * @see ubidi_setClassCallback
1992 * @see ubidi_getClassCallback
1993 * @stable ICU 3.6
1994 */
1995typedef UCharDirection U_CALLCONV
1996UBiDiClassCallback(const void *context, UChar32 c);
1997
1998U_CDECL_END
1999
2000/**
2001 * Retrieve the Bidi class for a given code point.
2002 * <p>If a <code>#UBiDiClassCallback</code> callback is defined and returns a
2003 * value other than <code>u_getIntPropertyMaxValue(UCHAR_BIDI_CLASS)+1</code>,
2004 * that value is used; otherwise the default class determination mechanism is invoked.</p>
2005 *
2006 * @param pBiDi is the paragraph <code>UBiDi</code> object.
2007 *
2008 * @param c     is the code point whose Bidi class must be retrieved.
2009 *
2010 * @return The Bidi class for character <code>c</code> based
2011 *         on the given <code>pBiDi</code> instance.
2012 * @see UBiDiClassCallback
2013 * @stable ICU 3.6
2014 */
2015U_CAPI UCharDirection U_EXPORT2
2016ubidi_getCustomizedClass(UBiDi *pBiDi, UChar32 c);
2017
2018/**
2019 * Set the callback function and callback data used by the UBA
2020 * implementation for Bidi class determination.
2021 * <p>This may be useful for assigning Bidi classes to PUA characters, or
2022 * for special application needs. For instance, an application may want to
2023 * handle all spaces like L or R characters (according to the base direction)
2024 * when creating the visual ordering of logical lines which are part of a report
2025 * organized in columns: there should not be interaction between adjacent
2026 * cells.<p>
2027 *
2028 * @param pBiDi is the paragraph <code>UBiDi</code> object.
2029 *
2030 * @param newFn is the new callback function pointer.
2031 *
2032 * @param newContext is the new callback context pointer. This can be NULL.
2033 *
2034 * @param oldFn fillin: Returns the old callback function pointer. This can be
2035 *                      NULL.
2036 *
2037 * @param oldContext fillin: Returns the old callback's context. This can be
2038 *                           NULL.
2039 *
2040 * @param pErrorCode must be a valid pointer to an error code value.
2041 *
2042 * @see ubidi_getClassCallback
2043 * @stable ICU 3.6
2044 */
2045U_CAPI void U_EXPORT2
2046ubidi_setClassCallback(UBiDi *pBiDi, UBiDiClassCallback *newFn,
2047                       const void *newContext, UBiDiClassCallback **oldFn,
2048                       const void **oldContext, UErrorCode *pErrorCode);
2049
2050/**
2051 * Get the current callback function used for Bidi class determination.
2052 *
2053 * @param pBiDi is the paragraph <code>UBiDi</code> object.
2054 *
2055 * @param fn fillin: Returns the callback function pointer.
2056 *
2057 * @param context fillin: Returns the callback's private context.
2058 *
2059 * @see ubidi_setClassCallback
2060 * @stable ICU 3.6
2061 */
2062U_CAPI void U_EXPORT2
2063ubidi_getClassCallback(UBiDi *pBiDi, UBiDiClassCallback **fn, const void **context);
2064
2065/**
2066 * Take a <code>UBiDi</code> object containing the reordering
2067 * information for a piece of text (one or more paragraphs) set by
2068 * <code>ubidi_setPara()</code> or for a line of text set by
2069 * <code>ubidi_setLine()</code> and write a reordered string to the
2070 * destination buffer.
2071 *
2072 * This function preserves the integrity of characters with multiple
2073 * code units and (optionally) combining characters.
2074 * Characters in RTL runs can be replaced by mirror-image characters
2075 * in the destination buffer. Note that "real" mirroring has
2076 * to be done in a rendering engine by glyph selection
2077 * and that for many "mirrored" characters there are no
2078 * Unicode characters as mirror-image equivalents.
2079 * There are also options to insert or remove Bidi control
2080 * characters; see the description of the <code>destSize</code>
2081 * and <code>options</code> parameters and of the option bit flags.
2082 *
2083 * @param pBiDi A pointer to a <code>UBiDi</code> object that
2084 *              is set by <code>ubidi_setPara()</code> or
2085 *              <code>ubidi_setLine()</code> and contains the reordering
2086 *              information for the text that it was defined for,
2087 *              as well as a pointer to that text.<br><br>
2088 *              The text was aliased (only the pointer was stored
2089 *              without copying the contents) and must not have been modified
2090 *              since the <code>ubidi_setPara()</code> call.
2091 *
2092 * @param dest A pointer to where the reordered text is to be copied.
2093 *             The source text and <code>dest[destSize]</code>
2094 *             must not overlap.
2095 *
2096 * @param destSize The size of the <code>dest</code> buffer,
2097 *                 in number of UChars.
2098 *                 If the <code>UBIDI_INSERT_LRM_FOR_NUMERIC</code>
2099 *                 option is set, then the destination length could be
2100 *                 as large as
2101 *                 <code>ubidi_getLength(pBiDi)+2*ubidi_countRuns(pBiDi)</code>.
2102 *                 If the <code>UBIDI_REMOVE_BIDI_CONTROLS</code> option
2103 *                 is set, then the destination length may be less than
2104 *                 <code>ubidi_getLength(pBiDi)</code>.
2105 *                 If none of these options is set, then the destination length
2106 *                 will be exactly <code>ubidi_getProcessedLength(pBiDi)</code>.
2107 *
2108 * @param options A bit set of options for the reordering that control
2109 *                how the reordered text is written.
2110 *                The options include mirroring the characters on a code
2111 *                point basis and inserting LRM characters, which is used
2112 *                especially for transforming visually stored text
2113 *                to logically stored text (although this is still an
2114 *                imperfect implementation of an "inverse Bidi" algorithm
2115 *                because it uses the "forward Bidi" algorithm at its core).
2116 *                The available options are:
2117 *                <code>#UBIDI_DO_MIRRORING</code>,
2118 *                <code>#UBIDI_INSERT_LRM_FOR_NUMERIC</code>,
2119 *                <code>#UBIDI_KEEP_BASE_COMBINING</code>,
2120 *                <code>#UBIDI_OUTPUT_REVERSE</code>,
2121 *                <code>#UBIDI_REMOVE_BIDI_CONTROLS</code>
2122 *
2123 * @param pErrorCode must be a valid pointer to an error code value.
2124 *
2125 * @return The length of the output string.
2126 *
2127 * @see ubidi_getProcessedLength
2128 * @stable ICU 2.0
2129 */
2130U_CAPI int32_t U_EXPORT2
2131ubidi_writeReordered(UBiDi *pBiDi,
2132                     UChar *dest, int32_t destSize,
2133                     uint16_t options,
2134                     UErrorCode *pErrorCode);
2135
2136/**
2137 * Reverse a Right-To-Left run of Unicode text.
2138 *
2139 * This function preserves the integrity of characters with multiple
2140 * code units and (optionally) combining characters.
2141 * Characters can be replaced by mirror-image characters
2142 * in the destination buffer. Note that "real" mirroring has
2143 * to be done in a rendering engine by glyph selection
2144 * and that for many "mirrored" characters there are no
2145 * Unicode characters as mirror-image equivalents.
2146 * There are also options to insert or remove Bidi control
2147 * characters.
2148 *
2149 * This function is the implementation for reversing RTL runs as part
2150 * of <code>ubidi_writeReordered()</code>. For detailed descriptions
2151 * of the parameters, see there.
2152 * Since no Bidi controls are inserted here, the output string length
2153 * will never exceed <code>srcLength</code>.
2154 *
2155 * @see ubidi_writeReordered
2156 *
2157 * @param src A pointer to the RTL run text.
2158 *
2159 * @param srcLength The length of the RTL run.
2160 *
2161 * @param dest A pointer to where the reordered text is to be copied.
2162 *             <code>src[srcLength]</code> and <code>dest[destSize]</code>
2163 *             must not overlap.
2164 *
2165 * @param destSize The size of the <code>dest</code> buffer,
2166 *                 in number of UChars.
2167 *                 If the <code>UBIDI_REMOVE_BIDI_CONTROLS</code> option
2168 *                 is set, then the destination length may be less than
2169 *                 <code>srcLength</code>.
2170 *                 If this option is not set, then the destination length
2171 *                 will be exactly <code>srcLength</code>.
2172 *
2173 * @param options A bit set of options for the reordering that control
2174 *                how the reordered text is written.
2175 *                See the <code>options</code> parameter in <code>ubidi_writeReordered()</code>.
2176 *
2177 * @param pErrorCode must be a valid pointer to an error code value.
2178 *
2179 * @return The length of the output string.
2180 * @stable ICU 2.0
2181 */
2182U_CAPI int32_t U_EXPORT2
2183ubidi_writeReverse(const UChar *src, int32_t srcLength,
2184                   UChar *dest, int32_t destSize,
2185                   uint16_t options,
2186                   UErrorCode *pErrorCode);
2187
2188/*#define BIDI_SAMPLE_CODE*/
2189/*@}*/
2190
2191#endif
2192