1999-12-28 23:57:50 +00:00
|
|
|
/*
|
2001-03-22 00:09:10 +00:00
|
|
|
* Copyright (C) 1996-2001, International Business Machines Corporation and others. All Rights Reserved.
|
1999-12-28 23:57:50 +00:00
|
|
|
*****************************************************************************************
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef UBRK_H
|
|
|
|
#define UBRK_H
|
|
|
|
|
|
|
|
#include "unicode/utypes.h"
|
|
|
|
/**
|
2000-12-08 18:46:55 +00:00
|
|
|
* \file
|
2001-03-22 00:09:10 +00:00
|
|
|
* \brief C API: BreakIterator
|
2000-12-08 18:46:55 +00:00
|
|
|
*
|
|
|
|
* <h2> BreakIterator C API </h2>
|
1999-12-28 23:57:50 +00:00
|
|
|
*
|
|
|
|
* The BreakIterator C API defines methods for finding the location
|
2001-03-22 00:09:10 +00:00
|
|
|
* of boundaries in text. Pointer to a UBreakIterator maintain a
|
|
|
|
* current position and scan over text returning the index of characters
|
1999-12-28 23:57:50 +00:00
|
|
|
* where boundaries occur.
|
|
|
|
* <P>
|
|
|
|
* Line boundary analysis determines where a text string can be broken
|
|
|
|
* when line-wrapping. The mechanism correctly handles punctuation and
|
|
|
|
* hyphenated words.
|
|
|
|
* <P>
|
|
|
|
* Sentence boundary analysis allows selection with correct
|
|
|
|
* interpretation of periods within numbers and abbreviations, and
|
|
|
|
* trailing punctuation marks such as quotation marks and parentheses.
|
|
|
|
* <P>
|
|
|
|
* Word boundary analysis is used by search and replace functions, as
|
|
|
|
* well as within text editing applications that allow the user to
|
|
|
|
* select words with a double click. Word selection provides correct
|
|
|
|
* interpretation of punctuation marks within and following
|
|
|
|
* words. Characters that are not part of a word, such as symbols or
|
|
|
|
* punctuation marks, have word-breaks on both sides.
|
|
|
|
* <P>
|
|
|
|
* Character boundary analysis allows users to interact with
|
|
|
|
* characters as they expect to, for example, when moving the cursor
|
|
|
|
* through a text string. Character boundary analysis provides correct
|
|
|
|
* navigation of through character strings, regardless of how the
|
|
|
|
* character is stored. For example, an accented character might be
|
|
|
|
* stored as a base character and a diacritical mark. What users
|
|
|
|
* consider to be a character can differ between languages.
|
|
|
|
* <P>
|
2002-02-28 01:28:04 +00:00
|
|
|
* Title boundary analysis locates all positions,
|
|
|
|
* typically starts of words, that should be set to Title Case
|
|
|
|
* when title casing the text.
|
|
|
|
* <P>
|
|
|
|
*
|
1999-12-28 23:57:50 +00:00
|
|
|
* This is the interface for all text boundaries.
|
|
|
|
* <P>
|
|
|
|
* Examples:
|
|
|
|
* <P>
|
|
|
|
* Helper function to output text
|
|
|
|
* <pre>
|
2000-12-08 18:46:55 +00:00
|
|
|
* \code
|
2002-03-12 01:32:42 +00:00
|
|
|
* void printTextRange(UChar* str, int32_t start, int32_t end ) {
|
2000-12-08 18:46:55 +00:00
|
|
|
* UChar* result;
|
|
|
|
* UChar* temp;
|
|
|
|
* const char* res;
|
|
|
|
* temp=(UChar*)malloc(sizeof(UChar) * ((u_strlen(str)-start)+1));
|
|
|
|
* result=(UChar*)malloc(sizeof(UChar) * ((end-start)+1));
|
|
|
|
* u_strcpy(temp, &str[start]);
|
|
|
|
* u_strncpy(result, temp, end-start);
|
|
|
|
* res=(char*)malloc(sizeof(char) * (u_strlen(result)+1));
|
|
|
|
* u_austrcpy(res, result);
|
2001-03-22 00:09:10 +00:00
|
|
|
* printf("%s\n", res);
|
2000-12-08 18:46:55 +00:00
|
|
|
* }
|
|
|
|
* \endcode
|
1999-12-28 23:57:50 +00:00
|
|
|
* </pre>
|
|
|
|
* Print each element in order:
|
|
|
|
* <pre>
|
2000-12-08 18:46:55 +00:00
|
|
|
* \code
|
|
|
|
* void printEachForward( UBreakIterator* boundary, UChar* str) {
|
2002-03-12 01:32:42 +00:00
|
|
|
* int32_t end;
|
|
|
|
* int32_t start = ubrk_first(boundary);
|
2000-12-08 18:46:55 +00:00
|
|
|
* for (end = ubrk_next(boundary)); end != UBRK_DONE; start = end, end = ubrk_next(boundary)) {
|
|
|
|
* printTextRange(str, start, end );
|
|
|
|
* }
|
|
|
|
* }
|
|
|
|
* \endcode
|
1999-12-28 23:57:50 +00:00
|
|
|
* </pre>
|
|
|
|
* Print each element in reverse order:
|
|
|
|
* <pre>
|
2000-12-08 18:46:55 +00:00
|
|
|
* \code
|
|
|
|
* void printEachBackward( UBreakIterator* boundary, UChar* str) {
|
2002-03-12 01:32:42 +00:00
|
|
|
* int32_t start;
|
|
|
|
* int32_t end = ubrk_last(boundary);
|
2000-12-08 18:46:55 +00:00
|
|
|
* for (start = ubrk_previous(boundary); start != UBRK_DONE; end = start, start =ubrk_previous(boundary)) {
|
|
|
|
* printTextRange( str, start, end );
|
|
|
|
* }
|
|
|
|
* }
|
|
|
|
* \endcode
|
1999-12-28 23:57:50 +00:00
|
|
|
* </pre>
|
|
|
|
* Print first element
|
|
|
|
* <pre>
|
2000-12-08 18:46:55 +00:00
|
|
|
* \code
|
|
|
|
* void printFirst(UBreakIterator* boundary, UChar* str) {
|
2002-03-12 01:32:42 +00:00
|
|
|
* int32_t end;
|
|
|
|
* int32_t start = ubrk_first(boundary);
|
2000-12-08 18:46:55 +00:00
|
|
|
* end = ubrk_next(boundary);
|
|
|
|
* printTextRange( str, start, end );
|
|
|
|
* }
|
|
|
|
* \endcode
|
1999-12-28 23:57:50 +00:00
|
|
|
* </pre>
|
|
|
|
* Print last element
|
|
|
|
* <pre>
|
2000-12-08 18:46:55 +00:00
|
|
|
* \code
|
|
|
|
* void printLast(UBreakIterator* boundary, UChar* str) {
|
2002-03-12 01:32:42 +00:00
|
|
|
* int32_t start;
|
|
|
|
* int32_t end = ubrk_last(boundary);
|
2000-12-08 18:46:55 +00:00
|
|
|
* start = ubrk_previous(boundary);
|
|
|
|
* printTextRange(str, start, end );
|
|
|
|
* }
|
|
|
|
* \endcode
|
1999-12-28 23:57:50 +00:00
|
|
|
* </pre>
|
|
|
|
* Print the element at a specified position
|
|
|
|
* <pre>
|
2000-12-08 18:46:55 +00:00
|
|
|
* \code
|
2002-03-12 01:32:42 +00:00
|
|
|
* void printAt(UBreakIterator* boundary, int32_t pos , UChar* str) {
|
|
|
|
* int32_t start;
|
|
|
|
* int32_t end = ubrk_following(boundary, pos);
|
2000-12-08 18:46:55 +00:00
|
|
|
* start = ubrk_previous(boundary);
|
|
|
|
* printTextRange(str, start, end );
|
|
|
|
* }
|
|
|
|
* \endcode
|
1999-12-28 23:57:50 +00:00
|
|
|
* </pre>
|
|
|
|
* Creating and using text boundaries
|
|
|
|
* <pre>
|
2000-12-08 18:46:55 +00:00
|
|
|
* \code
|
|
|
|
* void BreakIterator_Example( void ) {
|
|
|
|
* UBreakIterator* boundary;
|
|
|
|
* UChar *stringToExamine;
|
|
|
|
* stringToExamine=(UChar*)malloc(sizeof(UChar) * (strlen("Aaa bbb ccc. Ddd eee fff.")+1) );
|
|
|
|
* u_uastrcpy(stringToExamine, "Aaa bbb ccc. Ddd eee fff.");
|
|
|
|
* printf("Examining: "Aaa bbb ccc. Ddd eee fff.");
|
2001-03-22 00:09:10 +00:00
|
|
|
*
|
2000-12-08 18:46:55 +00:00
|
|
|
* //print each sentence in forward and reverse order
|
|
|
|
* boundary = ubrk_open(UBRK_SENTENCE, "en_us", stringToExamine, u_strlen(stringToExamine), &status);
|
2001-03-22 00:09:10 +00:00
|
|
|
* printf("----- forward: -----------\n");
|
2000-12-08 18:46:55 +00:00
|
|
|
* printEachForward(boundary, stringToExamine);
|
|
|
|
* printf("----- backward: ----------\n");
|
|
|
|
* printEachBackward(boundary, stringToExamine);
|
|
|
|
* ubrk_close(boundary);
|
2001-03-22 00:09:10 +00:00
|
|
|
*
|
2000-12-08 18:46:55 +00:00
|
|
|
* //print each word in order
|
|
|
|
* boundary = ubrk_open(UBRK_WORD, "en_us", stringToExamine, u_strlen(stringToExamine), &status);
|
2001-03-22 00:09:10 +00:00
|
|
|
* printf("----- forward: -----------\n");
|
2000-12-08 18:46:55 +00:00
|
|
|
* printEachForward(boundary, stringToExamine);
|
|
|
|
* printf("----- backward: ----------\n");
|
|
|
|
* printEachBackward(boundary, stringToExamine);
|
|
|
|
* //print first element
|
|
|
|
* printf("----- first: -------------\n");
|
|
|
|
* printFirst(boundary, stringToExamine);
|
|
|
|
* //print last element
|
|
|
|
* printf("----- last: --------------\n");
|
|
|
|
* printLast(boundary, stringToExamine);
|
|
|
|
* //print word at charpos 10
|
|
|
|
* printf("----- at pos 10: ---------\n");
|
|
|
|
* printAt(boundary, 10 , stringToExamine);
|
2001-03-22 00:09:10 +00:00
|
|
|
*
|
2000-12-08 18:46:55 +00:00
|
|
|
* ubrk_close(boundary);
|
|
|
|
* }
|
|
|
|
* \endcode
|
1999-12-28 23:57:50 +00:00
|
|
|
* </pre>
|
|
|
|
*/
|
|
|
|
|
2001-03-22 00:09:10 +00:00
|
|
|
/**
|
1999-12-28 23:57:50 +00:00
|
|
|
* A text-break iterator.
|
|
|
|
* For usage in C programs.
|
|
|
|
*/
|
2002-02-22 00:14:13 +00:00
|
|
|
#ifndef UBRK_TYPEDEF_UBREAK_ITERATOR
|
|
|
|
# define UBRK_TYPEDEF_UBREAK_ITERATOR
|
2002-05-23 00:08:38 +00:00
|
|
|
typedef void UBreakIterator;
|
2002-02-22 00:14:13 +00:00
|
|
|
#endif
|
1999-12-28 23:57:50 +00:00
|
|
|
|
|
|
|
/** The possible types of text boundaries. */
|
|
|
|
enum UBreakIteratorType {
|
|
|
|
/** Character breaks */
|
|
|
|
UBRK_CHARACTER,
|
|
|
|
/** Word breaks */
|
|
|
|
UBRK_WORD,
|
|
|
|
/** Line breaks */
|
|
|
|
UBRK_LINE,
|
|
|
|
/** Sentence breaks */
|
2002-02-28 01:28:04 +00:00
|
|
|
UBRK_SENTENCE,
|
|
|
|
/** Title Case breaks */
|
|
|
|
UBRK_TITLE
|
1999-12-28 23:57:50 +00:00
|
|
|
};
|
|
|
|
typedef enum UBreakIteratorType UBreakIteratorType;
|
|
|
|
|
2001-03-22 00:09:10 +00:00
|
|
|
/** Value indicating all text boundaries have been returned.
|
1999-12-28 23:57:50 +00:00
|
|
|
*
|
|
|
|
*/
|
2002-03-12 01:32:42 +00:00
|
|
|
#define UBRK_DONE ((int32_t) -1)
|
1999-12-28 23:57:50 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Open a new UBreakIterator for locating text boundaries for a specified locale.
|
2001-03-22 00:09:10 +00:00
|
|
|
* A UBreakIterator may be used for detecting character, line, word,
|
1999-12-28 23:57:50 +00:00
|
|
|
* and sentence breaks in text.
|
|
|
|
* @param type The type of UBreakIterator to open: one of UBRK_CHARACTER, UBRK_WORD,
|
|
|
|
* UBRK_LINE, UBRK_SENTENCE
|
|
|
|
* @param locale The locale specifying the text-breaking conventions.
|
|
|
|
* @param text The text to be iterated over.
|
|
|
|
* @param textLength The number of characters in text, or -1 if null-terminated.
|
|
|
|
* @param status A UErrorCode to receive any errors.
|
|
|
|
* @return A UBreakIterator for the specified locale.
|
|
|
|
* @see ubrk_openRules
|
2000-01-08 02:05:05 +00:00
|
|
|
* @stable
|
1999-12-28 23:57:50 +00:00
|
|
|
*/
|
2001-11-21 01:08:55 +00:00
|
|
|
U_CAPI UBreakIterator* U_EXPORT2
|
1999-12-28 23:57:50 +00:00
|
|
|
ubrk_open(UBreakIteratorType type,
|
|
|
|
const char *locale,
|
|
|
|
const UChar *text,
|
|
|
|
int32_t textLength,
|
|
|
|
UErrorCode *status);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Open a new UBreakIterator for locating text boundaries using specified breaking rules.
|
|
|
|
* The rule syntax is ... (TBD)
|
|
|
|
* @param rules A set of rules specifying the text breaking conventions.
|
|
|
|
* @param rulesLength The number of characters in rules, or -1 if null-terminated.
|
|
|
|
* @param text The text to be iterated over.
|
|
|
|
* @param textLength The number of characters in text, or -1 if null-terminated.
|
|
|
|
* @param status A UErrorCode to receive any errors.
|
|
|
|
* @return A UBreakIterator for the specified rules.
|
|
|
|
* @see ubrk_open
|
2001-11-15 02:02:54 +00:00
|
|
|
* @stable
|
1999-12-28 23:57:50 +00:00
|
|
|
*/
|
2001-11-21 01:08:55 +00:00
|
|
|
U_CAPI UBreakIterator* U_EXPORT2
|
1999-12-28 23:57:50 +00:00
|
|
|
ubrk_openRules(const UChar *rules,
|
|
|
|
int32_t rulesLength,
|
|
|
|
const UChar *text,
|
|
|
|
int32_t textLength,
|
|
|
|
UErrorCode *status);
|
|
|
|
|
2001-02-16 22:42:45 +00:00
|
|
|
/**
|
|
|
|
* Thread safe cloning operation
|
|
|
|
* @param bi iterator to be cloned
|
2001-03-22 00:09:10 +00:00
|
|
|
* @param stackBuffer user allocated space for the new clone. If NULL new memory will be allocated.
|
2002-04-02 01:17:28 +00:00
|
|
|
* If buffer is not large enough, new memory will be allocated.
|
|
|
|
* Clients can use the U_BRK_SAFECLONE_BUFFERSIZE. This will probably be enough to avoid memory allocations.
|
2001-03-22 00:09:10 +00:00
|
|
|
* @param pBufferSize pointer to size of allocated space.
|
2002-04-02 01:17:28 +00:00
|
|
|
* If *pBufferSize == 0, a sufficient size for use in cloning will
|
|
|
|
* be returned ('pre-flighting')
|
|
|
|
* If *pBufferSize is not enough for a stack-based safe clone,
|
|
|
|
* new memory will be allocated.
|
2001-02-16 22:42:45 +00:00
|
|
|
* @param status to indicate whether the operation went on smoothly or there were errors
|
2002-04-02 01:17:28 +00:00
|
|
|
* An informational status value, U_SAFECLONE_ALLOCATED_ERROR, is used if any allocations were necessary.
|
2001-02-16 22:42:45 +00:00
|
|
|
* @return pointer to the new clone
|
2001-11-15 02:02:54 +00:00
|
|
|
* @draft ICU 1.8
|
2001-02-16 22:42:45 +00:00
|
|
|
*/
|
2001-11-21 01:08:55 +00:00
|
|
|
U_CAPI UBreakIterator * U_EXPORT2
|
2001-02-16 22:42:45 +00:00
|
|
|
ubrk_safeClone(
|
|
|
|
const UBreakIterator *bi,
|
|
|
|
void *stackBuffer,
|
|
|
|
int32_t *pBufferSize,
|
|
|
|
UErrorCode *status);
|
|
|
|
|
|
|
|
#define U_BRK_SAFECLONE_BUFFERSIZE 512
|
|
|
|
|
1999-12-28 23:57:50 +00:00
|
|
|
/**
|
|
|
|
* Close a UBreakIterator.
|
|
|
|
* Once closed, a UBreakIterator may no longer be used.
|
|
|
|
* @param bi The break iterator to close.
|
2000-01-08 02:05:05 +00:00
|
|
|
* @stable
|
1999-12-28 23:57:50 +00:00
|
|
|
*/
|
2001-11-21 01:08:55 +00:00
|
|
|
U_CAPI void U_EXPORT2
|
1999-12-28 23:57:50 +00:00
|
|
|
ubrk_close(UBreakIterator *bi);
|
|
|
|
|
2000-01-08 02:05:05 +00:00
|
|
|
/**
|
|
|
|
* Sets an existing iterator to point to a new piece of text
|
|
|
|
* @stable
|
|
|
|
*/
|
2001-11-21 01:08:55 +00:00
|
|
|
U_CAPI void U_EXPORT2
|
2000-01-08 02:05:05 +00:00
|
|
|
ubrk_setText(UBreakIterator* bi,
|
|
|
|
const UChar* text,
|
|
|
|
int32_t textLength,
|
|
|
|
UErrorCode* status);
|
|
|
|
|
1999-12-28 23:57:50 +00:00
|
|
|
/**
|
|
|
|
* Determine the most recently-returned text boundary.
|
2001-03-22 00:09:10 +00:00
|
|
|
*
|
1999-12-28 23:57:50 +00:00
|
|
|
* @param bi The break iterator to use.
|
2001-03-22 00:09:10 +00:00
|
|
|
* @return The character index most recently returned by \Ref{ubrk_next}, \Ref{ubrk_previous},
|
1999-12-28 23:57:50 +00:00
|
|
|
* \Ref{ubrk_first}, or \Ref{ubrk_last}.
|
2000-01-08 02:05:05 +00:00
|
|
|
* @stable
|
1999-12-28 23:57:50 +00:00
|
|
|
*/
|
2002-03-12 01:32:42 +00:00
|
|
|
U_CAPI int32_t U_EXPORT2
|
1999-12-28 23:57:50 +00:00
|
|
|
ubrk_current(const UBreakIterator *bi);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Determine the text boundary following the current text boundary.
|
2001-03-22 00:09:10 +00:00
|
|
|
*
|
1999-12-28 23:57:50 +00:00
|
|
|
* @param bi The break iterator to use.
|
|
|
|
* @return The character index of the next text boundary, or UBRK_DONE
|
|
|
|
* if all text boundaries have been returned.
|
|
|
|
* @see ubrk_previous
|
2000-01-08 02:05:05 +00:00
|
|
|
* @stable
|
1999-12-28 23:57:50 +00:00
|
|
|
*/
|
2002-03-12 01:32:42 +00:00
|
|
|
U_CAPI int32_t U_EXPORT2
|
1999-12-28 23:57:50 +00:00
|
|
|
ubrk_next(UBreakIterator *bi);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Determine the text boundary preceding the current text boundary.
|
|
|
|
*
|
|
|
|
* @param bi The break iterator to use.
|
|
|
|
* @return The character index of the preceding text boundary, or UBRK_DONE
|
|
|
|
* if all text boundaries have been returned.
|
|
|
|
* @see ubrk_next
|
2000-01-08 02:05:05 +00:00
|
|
|
* @stable
|
1999-12-28 23:57:50 +00:00
|
|
|
*/
|
2002-03-12 01:32:42 +00:00
|
|
|
U_CAPI int32_t U_EXPORT2
|
1999-12-28 23:57:50 +00:00
|
|
|
ubrk_previous(UBreakIterator *bi);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Determine the index of the first character in the text being scanned.
|
|
|
|
* This is not always the same as index 0 of the text.
|
|
|
|
* @param bi The break iterator to use.
|
|
|
|
* @return The character index of the first character in the text being scanned.
|
|
|
|
* @see ubrk_last
|
2000-01-08 02:05:05 +00:00
|
|
|
* @stable
|
1999-12-28 23:57:50 +00:00
|
|
|
*/
|
2002-03-12 01:32:42 +00:00
|
|
|
U_CAPI int32_t U_EXPORT2
|
1999-12-28 23:57:50 +00:00
|
|
|
ubrk_first(UBreakIterator *bi);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Determine the index immediately <EM>beyond</EM> the last character in the text being
|
|
|
|
* scanned.
|
|
|
|
* This is not the same as the last character.
|
|
|
|
* @param bi The break iterator to use.
|
|
|
|
* @return The character offset immediately <EM>beyond</EM> the last character in the
|
|
|
|
* text being scanned.
|
|
|
|
* @see ubrk_first
|
2000-01-08 02:05:05 +00:00
|
|
|
* @stable
|
1999-12-28 23:57:50 +00:00
|
|
|
*/
|
2002-03-12 01:32:42 +00:00
|
|
|
U_CAPI int32_t U_EXPORT2
|
1999-12-28 23:57:50 +00:00
|
|
|
ubrk_last(UBreakIterator *bi);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Determine the text boundary preceding the specified offset.
|
|
|
|
* The value returned is always smaller than offset, or UBRK_DONE.
|
|
|
|
* @param bi The break iterator to use.
|
|
|
|
* @param offset The offset to begin scanning.
|
|
|
|
* @return The text boundary preceding offset, or UBRK_DONE.
|
|
|
|
* @see ubrk_following
|
2000-01-08 02:05:05 +00:00
|
|
|
* @stable
|
1999-12-28 23:57:50 +00:00
|
|
|
*/
|
2002-03-12 01:32:42 +00:00
|
|
|
U_CAPI int32_t U_EXPORT2
|
1999-12-28 23:57:50 +00:00
|
|
|
ubrk_preceding(UBreakIterator *bi,
|
2002-03-12 01:32:42 +00:00
|
|
|
int32_t offset);
|
1999-12-28 23:57:50 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Determine the text boundary following the specified offset.
|
|
|
|
* The value returned is always greater than offset, or UBRK_DONE.
|
|
|
|
* @param bi The break iterator to use.
|
|
|
|
* @param offset The offset to begin scanning.
|
|
|
|
* @return The text boundary following offset, or UBRK_DONE.
|
|
|
|
* @see ubrk_preceding
|
2000-01-08 02:05:05 +00:00
|
|
|
* @stable
|
1999-12-28 23:57:50 +00:00
|
|
|
*/
|
2002-03-12 01:32:42 +00:00
|
|
|
U_CAPI int32_t U_EXPORT2
|
1999-12-28 23:57:50 +00:00
|
|
|
ubrk_following(UBreakIterator *bi,
|
2002-03-12 01:32:42 +00:00
|
|
|
int32_t offset);
|
1999-12-28 23:57:50 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Get a locale for which text breaking information is available.
|
|
|
|
* A UBreakIterator in a locale returned by this function will perform the correct
|
|
|
|
* text breaking for the locale.
|
|
|
|
* @param index The index of the desired locale.
|
|
|
|
* @return A locale for which number text breaking information is available, or 0 if none.
|
|
|
|
* @see ubrk_countAvailable
|
2000-01-08 02:05:05 +00:00
|
|
|
* @stable
|
1999-12-28 23:57:50 +00:00
|
|
|
*/
|
2001-11-21 01:08:55 +00:00
|
|
|
U_CAPI const char* U_EXPORT2
|
1999-12-28 23:57:50 +00:00
|
|
|
ubrk_getAvailable(int32_t index);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Determine how many locales have text breaking information available.
|
|
|
|
* This function is most useful as determining the loop ending condition for
|
|
|
|
* calls to \Ref{ubrk_getAvailable}.
|
|
|
|
* @return The number of locales for which text breaking information is available.
|
|
|
|
* @see ubrk_getAvailable
|
2000-01-08 02:05:05 +00:00
|
|
|
* @stable
|
1999-12-28 23:57:50 +00:00
|
|
|
*/
|
2001-11-21 01:08:55 +00:00
|
|
|
U_CAPI int32_t U_EXPORT2
|
1999-12-28 23:57:50 +00:00
|
|
|
ubrk_countAvailable(void);
|
|
|
|
|
2002-03-08 18:58:46 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Returns true if the specfied position is a boundary position. As a side
|
|
|
|
* effect, leaves the iterator pointing to the first boundary position at
|
|
|
|
* or after "offset".
|
|
|
|
* @param bi The break iterator to use.
|
|
|
|
* @param offset the offset to check.
|
|
|
|
* @return True if "offset" is a boundary position.
|
|
|
|
*/
|
|
|
|
U_CAPI UBool U_EXPORT2
|
|
|
|
ubrk_isBoundary(UBreakIterator *bi, int32_t offset);
|
|
|
|
|
1999-12-28 23:57:50 +00:00
|
|
|
#endif
|