2 *******************************************************************************
4 * Copyright (c) 1995-2013 International Business Machines Corporation and others
8 * Permission is hereby granted, free of charge, to any person obtaining a copy of
9 * this software and associated documentation files (the "Software"), to deal in
10 * the Software without restriction, including without limitation the rights to
11 * use, copy, modify, merge, publish, distribute, and/or sell copies of the
12 * Software, and to permit persons to whom the Software is furnished to do so,
13 * provided that the above copyright notice(s) and this permission notice appear
14 * in all copies of the Software and that both the above copyright notice(s) and
15 * this permission notice appear in supporting documentation.
17 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
18 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
19 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT OF THIRD PARTY RIGHTS. IN
20 * NO EVENT SHALL THE COPYRIGHT HOLDER OR HOLDERS INCLUDED IN THIS NOTICE BE
21 * LIABLE FOR ANY CLAIM, OR ANY SPECIAL INDIRECT OR CONSEQUENTIAL DAMAGES, OR ANY
22 * DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
23 * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN
24 * CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
26 * Except as contained in this notice, the name of a copyright holder shall not be
27 * used in advertising or otherwise to promote the sale, use or other dealings in
28 * this Software without prior written authorization of the copyright holder.
30 *******************************************************************************
31 * file name: scrptrun.cpp
33 * created on: 10/17/2001
34 * created by: Eric R. Mader
37 * This file is largely copied from the ICU project,
38 * under folder source/extra/scrptrun/scrptrun.cpp
40 #include "unicode/utypes.h"
41 #include "unicode/uscript.h"
56 std::fill_n(ma00
, 0xff, -1);
57 std::fill_n(ma20
, 0x7f, -1);
58 std::fill_n(ma30
, 0x7f, -1);
60 // characters in the range 0x0000 - 0x007e (inclusive)
61 // ascii paired punctuation
74 // characters in the range 0x2000 - 0x207e (inclusive)
75 // general punctuation
83 // characters in the range 0x3000 - 0x307e (inclusive)
84 // chinese paired punctuation
105 inline int32_t getPairIndex(UChar32 ch
) const
109 if (ch
>= 0x2000 && ch
< 0x207f)
110 return ma20
[ch
- 0x2000];
111 if (ch
>= 0x3000 && ch
< 0x307f)
112 return ma30
[ch
- 0x3000];
120 static const PairIndices gPairIndices
;
125 const char ScriptRun::fgClassID
=0;
127 static inline UBool
sameScript(int32_t scriptOne
, int32_t scriptTwo
)
129 return scriptOne
<= USCRIPT_INHERITED
|| scriptTwo
<= USCRIPT_INHERITED
|| scriptOne
== scriptTwo
;
132 UBool
ScriptRun::next()
134 int32_t startSP
= parenSP
; // used to find the first new open character
135 UErrorCode error
= U_ZERO_ERROR
;
137 // if we've fallen off the end of the text, we're done
138 if (scriptEnd
>= charLimit
) {
142 scriptCode
= USCRIPT_COMMON
;
144 for (scriptStart
= scriptEnd
; scriptEnd
< charLimit
; scriptEnd
+= 1) {
145 UChar high
= charArray
[scriptEnd
];
148 // if the character is a high surrogate and it's not the last one
149 // in the text, see if it's followed by a low surrogate
150 if (high
>= 0xD800 && high
<= 0xDBFF && scriptEnd
< charLimit
- 1)
152 UChar low
= charArray
[scriptEnd
+ 1];
154 // if it is followed by a low surrogate,
155 // consume it and form the full character
156 if (low
>= 0xDC00 && low
<= 0xDFFF) {
157 ch
= (high
- 0xD800) * 0x0400 + low
- 0xDC00 + 0x10000;
162 UScriptCode sc
= uscript_getScript(ch
, &error
);
163 int32_t pairIndex
= gPairIndices
.getPairIndex(ch
);
165 // Paired character handling:
167 // if it's an open character, push it onto the stack.
168 // if it's a close character, find the matching open on the
169 // stack, and use that script code. Any non-matching open
170 // characters above it on the stack will be poped.
171 if (pairIndex
>= 0) {
172 if ((pairIndex
& 1) == 0) {
174 int32_t nVecSize
= parenStack
.size();
175 if (parenSP
== nVecSize
)
176 parenStack
.resize(nVecSize
+ 128);
177 parenStack
[parenSP
].pairIndex
= pairIndex
;
178 parenStack
[parenSP
].scriptCode
= scriptCode
;
179 } else if (parenSP
>= 0) {
180 int32_t pi
= pairIndex
& ~1;
182 while (parenSP
>= 0 && parenStack
[parenSP
].pairIndex
!= pi
) {
186 if (parenSP
< startSP
) {
191 sc
= parenStack
[parenSP
].scriptCode
;
196 if (sameScript(scriptCode
, sc
)) {
197 if (scriptCode
<= USCRIPT_INHERITED
&& sc
> USCRIPT_INHERITED
) {
200 // now that we have a final script code, fix any open
201 // characters we pushed before we knew the script code.
202 while (startSP
< parenSP
) {
203 parenStack
[++startSP
].scriptCode
= scriptCode
;
207 // if this character is a close paired character,
208 // pop it from the stack
209 if (pairIndex
>= 0 && (pairIndex
& 1) != 0 && parenSP
>= 0) {
211 /* decrement startSP only if it is >= 0,
212 decrementing it unnecessarily will lead to memory corruption
213 while processing the above while block.
214 e.g. startSP = -4 , parenSP = -1
221 // if the run broke on a surrogate pair,
222 // end it before the high surrogate