|
sl@0
|
1 |
/*
|
|
sl@0
|
2 |
*
|
|
sl@0
|
3 |
* (C) Copyright IBM Corp. 1998-2005 - All Rights Reserved
|
|
sl@0
|
4 |
*
|
|
sl@0
|
5 |
*/
|
|
sl@0
|
6 |
|
|
sl@0
|
7 |
#include "LETypes.h"
|
|
sl@0
|
8 |
#include "LEGlyphStorage.h"
|
|
sl@0
|
9 |
#include "CanonShaping.h"
|
|
sl@0
|
10 |
#include "GlyphDefinitionTables.h"
|
|
sl@0
|
11 |
#include "ClassDefinitionTables.h"
|
|
sl@0
|
12 |
|
|
sl@0
|
13 |
U_NAMESPACE_BEGIN
|
|
sl@0
|
14 |
|
|
sl@0
|
15 |
void CanonShaping::sortMarks(le_int32 *indices, const le_int32 *combiningClasses, le_int32 index, le_int32 limit)
|
|
sl@0
|
16 |
{
|
|
sl@0
|
17 |
for (le_int32 j = index + 1; j < limit; j += 1) {
|
|
sl@0
|
18 |
le_int32 i;
|
|
sl@0
|
19 |
le_int32 v = indices[j];
|
|
sl@0
|
20 |
le_int32 c = combiningClasses[v];
|
|
sl@0
|
21 |
|
|
sl@0
|
22 |
for (i = j - 1; i >= index; i -= 1) {
|
|
sl@0
|
23 |
if (c >= combiningClasses[indices[i]]) {
|
|
sl@0
|
24 |
break;
|
|
sl@0
|
25 |
}
|
|
sl@0
|
26 |
|
|
sl@0
|
27 |
indices[i + 1] = indices[i];
|
|
sl@0
|
28 |
}
|
|
sl@0
|
29 |
|
|
sl@0
|
30 |
indices[i + 1] = v;
|
|
sl@0
|
31 |
}
|
|
sl@0
|
32 |
}
|
|
sl@0
|
33 |
|
|
sl@0
|
34 |
void CanonShaping::reorderMarks(const LEUnicode *inChars, le_int32 charCount, le_bool rightToLeft,
|
|
sl@0
|
35 |
LEUnicode *outChars, LEGlyphStorage &glyphStorage)
|
|
sl@0
|
36 |
{
|
|
sl@0
|
37 |
const GlyphDefinitionTableHeader *gdefTable = (const GlyphDefinitionTableHeader *) glyphDefinitionTable;
|
|
sl@0
|
38 |
const ClassDefinitionTable *classTable = gdefTable->getMarkAttachClassDefinitionTable();
|
|
sl@0
|
39 |
le_int32 *combiningClasses = LE_NEW_ARRAY(le_int32, charCount);
|
|
sl@0
|
40 |
le_int32 *indices = LE_NEW_ARRAY(le_int32, charCount);
|
|
sl@0
|
41 |
LEErrorCode status = LE_NO_ERROR;
|
|
sl@0
|
42 |
le_int32 i;
|
|
sl@0
|
43 |
|
|
sl@0
|
44 |
for (i = 0; i < charCount; i += 1) {
|
|
sl@0
|
45 |
combiningClasses[i] = classTable->getGlyphClass((LEGlyphID) inChars[i]);
|
|
sl@0
|
46 |
indices[i] = i;
|
|
sl@0
|
47 |
}
|
|
sl@0
|
48 |
|
|
sl@0
|
49 |
for (i = 0; i < charCount; i += 1) {
|
|
sl@0
|
50 |
if (combiningClasses[i] != 0) {
|
|
sl@0
|
51 |
le_int32 mark;
|
|
sl@0
|
52 |
|
|
sl@0
|
53 |
for (mark = i; mark < charCount; mark += 1) {
|
|
sl@0
|
54 |
if (combiningClasses[mark] == 0) {
|
|
sl@0
|
55 |
break;
|
|
sl@0
|
56 |
}
|
|
sl@0
|
57 |
}
|
|
sl@0
|
58 |
|
|
sl@0
|
59 |
sortMarks(indices, combiningClasses, i, mark);
|
|
sl@0
|
60 |
}
|
|
sl@0
|
61 |
}
|
|
sl@0
|
62 |
|
|
sl@0
|
63 |
le_int32 out = 0, dir = 1;
|
|
sl@0
|
64 |
|
|
sl@0
|
65 |
if (rightToLeft) {
|
|
sl@0
|
66 |
out = charCount - 1;
|
|
sl@0
|
67 |
dir = -1;
|
|
sl@0
|
68 |
}
|
|
sl@0
|
69 |
|
|
sl@0
|
70 |
for (i = 0; i < charCount; i += 1, out += dir) {
|
|
sl@0
|
71 |
le_int32 index = indices[i];
|
|
sl@0
|
72 |
|
|
sl@0
|
73 |
outChars[i] = inChars[index];
|
|
sl@0
|
74 |
glyphStorage.setCharIndex(out, index, status);
|
|
sl@0
|
75 |
}
|
|
sl@0
|
76 |
|
|
sl@0
|
77 |
LE_DELETE_ARRAY(indices);
|
|
sl@0
|
78 |
LE_DELETE_ARRAY(combiningClasses);
|
|
sl@0
|
79 |
}
|
|
sl@0
|
80 |
|
|
sl@0
|
81 |
U_NAMESPACE_END
|