]> git.saurik.com Git - apple/icu.git/blame - icuSources/common/ubrk.cpp
ICU-59180.0.1.tar.gz
[apple/icu.git] / icuSources / common / ubrk.cpp
CommitLineData
f3c0d7a5
A
1// © 2016 and later: Unicode, Inc. and others.
2// License & terms of use: http://www.unicode.org/copyright.html
b75a7d8f 3/*
46f4442e 4********************************************************************************
2ca993e8 5* Copyright (C) 1996-2015, International Business Machines
b75a7d8f 6* Corporation and others. All Rights Reserved.
46f4442e 7********************************************************************************
b75a7d8f
A
8*/
9
10#include "unicode/utypes.h"
11
12#if !UCONFIG_NO_BREAK_ITERATION
13
14#include "unicode/ubrk.h"
15
16#include "unicode/brkiter.h"
17#include "unicode/uloc.h"
18#include "unicode/ustring.h"
19#include "unicode/uchriter.h"
20#include "unicode/rbbi.h"
21#include "rbbirb.h"
73c04bcf 22#include "uassert.h"
f3c0d7a5 23#include "cmemory.h"
b75a7d8f
A
24
25U_NAMESPACE_USE
26
46f4442e 27//------------------------------------------------------------------------------
b75a7d8f
A
28//
29// ubrk_open Create a canned type of break iterator based on type (word, line, etc.)
30// and locale.
31//
46f4442e 32//------------------------------------------------------------------------------
b75a7d8f
A
33U_CAPI UBreakIterator* U_EXPORT2
34ubrk_open(UBreakIteratorType type,
35 const char *locale,
36 const UChar *text,
37 int32_t textLength,
38 UErrorCode *status)
39{
40
41 if(U_FAILURE(*status)) return 0;
42
43 BreakIterator *result = 0;
44
45 switch(type) {
46
47 case UBRK_CHARACTER:
48 result = BreakIterator::createCharacterInstance(Locale(locale), *status);
49 break;
50
51 case UBRK_WORD:
52 result = BreakIterator::createWordInstance(Locale(locale), *status);
53 break;
54
55 case UBRK_LINE:
56 result = BreakIterator::createLineInstance(Locale(locale), *status);
57 break;
58
59 case UBRK_SENTENCE:
60 result = BreakIterator::createSentenceInstance(Locale(locale), *status);
61 break;
62
63 case UBRK_TITLE:
64 result = BreakIterator::createTitleInstance(Locale(locale), *status);
65 break;
73c04bcf
A
66
67 default:
68 *status = U_ILLEGAL_ARGUMENT_ERROR;
b75a7d8f
A
69 }
70
71 // check for allocation error
72 if (U_FAILURE(*status)) {
73 return 0;
74 }
75 if(result == 0) {
76 *status = U_MEMORY_ALLOCATION_ERROR;
77 return 0;
78 }
79
b75a7d8f 80
73c04bcf
A
81 UBreakIterator *uBI = (UBreakIterator *)result;
82 if (text != NULL) {
83 ubrk_setText(uBI, text, textLength, status);
84 }
85 return uBI;
b75a7d8f
A
86}
87
88
89
46f4442e 90//------------------------------------------------------------------------------
b75a7d8f
A
91//
92// ubrk_openRules open a break iterator from a set of break rules.
93// Invokes the rule builder.
94//
46f4442e 95//------------------------------------------------------------------------------
b75a7d8f
A
96U_CAPI UBreakIterator* U_EXPORT2
97ubrk_openRules( const UChar *rules,
98 int32_t rulesLength,
99 const UChar *text,
100 int32_t textLength,
101 UParseError *parseErr,
102 UErrorCode *status) {
103
104 if (status == NULL || U_FAILURE(*status)){
105 return 0;
106 }
107
108 BreakIterator *result = 0;
109 UnicodeString ruleString(rules, rulesLength);
46f4442e 110 result = RBBIRuleBuilder::createRuleBasedBreakIterator(ruleString, parseErr, *status);
b75a7d8f
A
111 if(U_FAILURE(*status)) {
112 return 0;
113 }
114
73c04bcf 115 UBreakIterator *uBI = (UBreakIterator *)result;
b75a7d8f 116 if (text != NULL) {
73c04bcf 117 ubrk_setText(uBI, text, textLength, status);
b75a7d8f 118 }
73c04bcf 119 return uBI;
b75a7d8f
A
120}
121
122
f3c0d7a5
A
123U_CAPI UBreakIterator* U_EXPORT2
124ubrk_openBinaryRules(const uint8_t *binaryRules, int32_t rulesLength,
125 const UChar * text, int32_t textLength,
126 UErrorCode * status)
127{
128 if (U_FAILURE(*status)) {
129 return NULL;
130 }
131 if (rulesLength < 0) {
132 *status = U_ILLEGAL_ARGUMENT_ERROR;
133 return NULL;
134 }
135 LocalPointer<RuleBasedBreakIterator> lpRBBI(new RuleBasedBreakIterator(binaryRules, rulesLength, *status), *status);
136 if (U_FAILURE(*status)) {
137 return NULL;
138 }
139 UBreakIterator *uBI = reinterpret_cast<UBreakIterator *>(lpRBBI.orphan());
140 if (text != NULL) {
141 ubrk_setText(uBI, text, textLength, status);
142 }
143 return uBI;
144}
b75a7d8f
A
145
146
147U_CAPI UBreakIterator * U_EXPORT2
148ubrk_safeClone(
149 const UBreakIterator *bi,
57a6839d 150 void * /*stackBuffer*/,
b75a7d8f
A
151 int32_t *pBufferSize,
152 UErrorCode *status)
153{
154 if (status == NULL || U_FAILURE(*status)){
57a6839d 155 return NULL;
b75a7d8f 156 }
57a6839d 157 if (bi == NULL) {
b75a7d8f 158 *status = U_ILLEGAL_ARGUMENT_ERROR;
57a6839d
A
159 return NULL;
160 }
161 if (pBufferSize != NULL) {
162 int32_t inputSize = *pBufferSize;
163 *pBufferSize = 1;
164 if (inputSize == 0) {
165 return NULL; // preflighting for deprecated functionality
166 }
b75a7d8f 167 }
57a6839d
A
168 BreakIterator *newBI = ((BreakIterator *)bi)->clone();
169 if (newBI == NULL) {
170 *status = U_MEMORY_ALLOCATION_ERROR;
171 } else {
172 *status = U_SAFECLONE_ALLOCATED_WARNING;
73c04bcf 173 }
57a6839d 174 return (UBreakIterator *)newBI;
b75a7d8f
A
175}
176
177
178
179U_CAPI void U_EXPORT2
180ubrk_close(UBreakIterator *bi)
181{
57a6839d 182 delete (BreakIterator *)bi;
b75a7d8f
A
183}
184
185U_CAPI void U_EXPORT2
186ubrk_setText(UBreakIterator* bi,
187 const UChar* text,
188 int32_t textLength,
189 UErrorCode* status)
190{
73c04bcf
A
191 UText ut = UTEXT_INITIALIZER;
192 utext_openUChars(&ut, text, textLength, status);
b331163b 193 ((BreakIterator*)bi)->setText(&ut, *status);
57a6839d 194 // A stack allocated UText wrapping a UChar * string
73c04bcf
A
195 // can be dumped without explicitly closing it.
196}
b75a7d8f 197
b75a7d8f 198
b75a7d8f 199
46f4442e 200U_CAPI void U_EXPORT2
73c04bcf
A
201ubrk_setUText(UBreakIterator *bi,
202 UText *text,
203 UErrorCode *status)
204{
b331163b 205 ((BreakIterator*)bi)->setText(text, *status);
b75a7d8f
A
206}
207
73c04bcf
A
208
209
210
211
b75a7d8f
A
212U_CAPI int32_t U_EXPORT2
213ubrk_current(const UBreakIterator *bi)
214{
215
b331163b 216 return ((BreakIterator*)bi)->current();
b75a7d8f
A
217}
218
219U_CAPI int32_t U_EXPORT2
220ubrk_next(UBreakIterator *bi)
221{
222
b331163b 223 return ((BreakIterator*)bi)->next();
b75a7d8f
A
224}
225
226U_CAPI int32_t U_EXPORT2
227ubrk_previous(UBreakIterator *bi)
228{
229
b331163b 230 return ((BreakIterator*)bi)->previous();
b75a7d8f
A
231}
232
233U_CAPI int32_t U_EXPORT2
234ubrk_first(UBreakIterator *bi)
235{
236
b331163b 237 return ((BreakIterator*)bi)->first();
b75a7d8f
A
238}
239
240U_CAPI int32_t U_EXPORT2
241ubrk_last(UBreakIterator *bi)
242{
243
b331163b 244 return ((BreakIterator*)bi)->last();
b75a7d8f
A
245}
246
247U_CAPI int32_t U_EXPORT2
248ubrk_preceding(UBreakIterator *bi,
249 int32_t offset)
250{
251
b331163b 252 return ((BreakIterator*)bi)->preceding(offset);
b75a7d8f
A
253}
254
255U_CAPI int32_t U_EXPORT2
256ubrk_following(UBreakIterator *bi,
257 int32_t offset)
258{
259
b331163b 260 return ((BreakIterator*)bi)->following(offset);
b75a7d8f
A
261}
262
263U_CAPI const char* U_EXPORT2
264ubrk_getAvailable(int32_t index)
265{
266
267 return uloc_getAvailable(index);
268}
269
270U_CAPI int32_t U_EXPORT2
271ubrk_countAvailable()
272{
273
274 return uloc_countAvailable();
275}
276
277
278U_CAPI UBool U_EXPORT2
279ubrk_isBoundary(UBreakIterator *bi, int32_t offset)
280{
b331163b 281 return ((BreakIterator*)bi)->isBoundary(offset);
b75a7d8f
A
282}
283
284
285U_CAPI int32_t U_EXPORT2
286ubrk_getRuleStatus(UBreakIterator *bi)
287{
b331163b 288 return ((BreakIterator*)bi)->getRuleStatus();
b75a7d8f
A
289}
290
374ca955
A
291U_CAPI int32_t U_EXPORT2
292ubrk_getRuleStatusVec(UBreakIterator *bi, int32_t *fillInVec, int32_t capacity, UErrorCode *status)
293{
b331163b 294 return ((BreakIterator*)bi)->getRuleStatusVec(fillInVec, capacity, *status);
374ca955
A
295}
296
297
298U_CAPI const char* U_EXPORT2
73c04bcf
A
299ubrk_getLocaleByType(const UBreakIterator *bi,
300 ULocDataLocaleType type,
374ca955
A
301 UErrorCode* status)
302{
303 if (bi == NULL) {
304 if (U_SUCCESS(*status)) {
305 *status = U_ILLEGAL_ARGUMENT_ERROR;
306 }
307 return NULL;
308 }
309 return ((BreakIterator*)bi)->getLocaleID(type, *status);
310}
311
312
f3c0d7a5
A
313U_CAPI void U_EXPORT2
314ubrk_refreshUText(UBreakIterator *bi,
4388f060
A
315 UText *text,
316 UErrorCode *status)
317{
318 BreakIterator *bii = reinterpret_cast<BreakIterator *>(bi);
319 bii->refreshInputText(text, *status);
320}
321
f3c0d7a5
A
322U_CAPI int32_t U_EXPORT2
323ubrk_getBinaryRules(UBreakIterator *bi,
324 uint8_t * binaryRules, int32_t rulesCapacity,
325 UErrorCode * status)
326{
327 if (U_FAILURE(*status)) {
328 return 0;
329 }
330 if ((binaryRules == NULL && rulesCapacity > 0) || rulesCapacity < 0) {
331 *status = U_ILLEGAL_ARGUMENT_ERROR;
332 return 0;
333 }
334 RuleBasedBreakIterator* rbbi;
335 if ((rbbi = dynamic_cast<RuleBasedBreakIterator*>(reinterpret_cast<BreakIterator*>(bi))) == NULL) {
336 *status = U_ILLEGAL_ARGUMENT_ERROR;
337 return 0;
338 }
339 uint32_t rulesLength;
340 const uint8_t * returnedRules = rbbi->getBinaryRules(rulesLength);
341 if (rulesLength > INT32_MAX) {
342 *status = U_INDEX_OUTOFBOUNDS_ERROR;
343 return 0;
344 }
345 if (binaryRules != NULL) { // if not preflighting
346 // Here we know rulesLength <= INT32_MAX and rulesCapacity >= 0, can cast safely
347 if ((int32_t)rulesLength > rulesCapacity) {
348 *status = U_BUFFER_OVERFLOW_ERROR;
349 } else {
350 uprv_memcpy(binaryRules, returnedRules, rulesLength);
351 }
352 }
353 return (int32_t)rulesLength;
354}
4388f060
A
355
356
b75a7d8f 357#endif /* #if !UCONFIG_NO_BREAK_ITERATION */