|
2
|
1 |
/*
|
|
|
2 |
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
|
|
3 |
*
|
|
|
4 |
* This code is free software; you can redistribute it and/or modify it
|
|
|
5 |
* under the terms of the GNU General Public License version 2 only, as
|
|
5506
|
6 |
* published by the Free Software Foundation. Oracle designates this
|
|
2
|
7 |
* particular file as subject to the "Classpath" exception as provided
|
|
5506
|
8 |
* by Oracle in the LICENSE file that accompanied this code.
|
|
2
|
9 |
*
|
|
|
10 |
* This code is distributed in the hope that it will be useful, but WITHOUT
|
|
|
11 |
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
|
|
12 |
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
|
|
13 |
* version 2 for more details (a copy is included in the LICENSE file that
|
|
|
14 |
* accompanied this code).
|
|
|
15 |
*
|
|
|
16 |
* You should have received a copy of the GNU General Public License version
|
|
|
17 |
* 2 along with this work; if not, write to the Free Software Foundation,
|
|
|
18 |
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
|
|
|
19 |
*
|
|
5506
|
20 |
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
|
|
|
21 |
* or visit www.oracle.com if you need additional information or have any
|
|
|
22 |
* questions.
|
|
2
|
23 |
*
|
|
|
24 |
*/
|
|
|
25 |
|
|
|
26 |
/*
|
|
|
27 |
*
|
|
|
28 |
* (C) Copyright IBM Corp. 1998-2004 - All Rights Reserved
|
|
|
29 |
*
|
|
|
30 |
*/
|
|
|
31 |
|
|
|
32 |
#include "LETypes.h"
|
|
|
33 |
#include "MorphTables.h"
|
|
|
34 |
#include "SubtableProcessor.h"
|
|
|
35 |
#include "NonContextualGlyphSubst.h"
|
|
|
36 |
#include "NonContextualGlyphSubstProc.h"
|
|
|
37 |
#include "TrimmedArrayProcessor.h"
|
|
|
38 |
#include "LEGlyphStorage.h"
|
|
|
39 |
#include "LESwaps.h"
|
|
|
40 |
|
|
3935
|
41 |
U_NAMESPACE_BEGIN
|
|
|
42 |
|
|
|
43 |
UOBJECT_DEFINE_RTTI_IMPLEMENTATION(TrimmedArrayProcessor)
|
|
|
44 |
|
|
2
|
45 |
TrimmedArrayProcessor::TrimmedArrayProcessor()
|
|
|
46 |
{
|
|
|
47 |
}
|
|
|
48 |
|
|
16891
|
49 |
TrimmedArrayProcessor::TrimmedArrayProcessor(const LEReferenceTo<MorphSubtableHeader> &morphSubtableHeader, LEErrorCode &success)
|
|
|
50 |
: NonContextualGlyphSubstitutionProcessor(morphSubtableHeader, success), firstGlyph(0), lastGlyph(0)
|
|
2
|
51 |
{
|
|
16891
|
52 |
LEReferenceTo<NonContextualGlyphSubstitutionHeader> header(morphSubtableHeader, success);
|
|
|
53 |
|
|
|
54 |
if(LE_FAILURE(success)) return;
|
|
2
|
55 |
|
|
16891
|
56 |
trimmedArrayLookupTable = LEReferenceTo<TrimmedArrayLookupTable>(morphSubtableHeader, success, (const TrimmedArrayLookupTable*)&header->table);
|
|
|
57 |
|
|
|
58 |
if(LE_FAILURE(success)) return;
|
|
|
59 |
|
|
|
60 |
firstGlyph = SWAPW(trimmedArrayLookupTable->firstGlyph);
|
|
|
61 |
lastGlyph = firstGlyph + SWAPW(trimmedArrayLookupTable->glyphCount);
|
|
2
|
62 |
}
|
|
|
63 |
|
|
|
64 |
TrimmedArrayProcessor::~TrimmedArrayProcessor()
|
|
|
65 |
{
|
|
|
66 |
}
|
|
|
67 |
|
|
16891
|
68 |
void TrimmedArrayProcessor::process(LEGlyphStorage &glyphStorage, LEErrorCode &success)
|
|
2
|
69 |
{
|
|
16891
|
70 |
if(LE_FAILURE(success)) return;
|
|
2
|
71 |
le_int32 glyphCount = glyphStorage.getGlyphCount();
|
|
|
72 |
le_int32 glyph;
|
|
|
73 |
|
|
|
74 |
for (glyph = 0; glyph < glyphCount; glyph += 1) {
|
|
|
75 |
LEGlyphID thisGlyph = glyphStorage[glyph];
|
|
|
76 |
TTGlyphID ttGlyph = (TTGlyphID) LE_GET_GLYPH(thisGlyph);
|
|
|
77 |
|
|
|
78 |
if ((ttGlyph > firstGlyph) && (ttGlyph < lastGlyph)) {
|
|
|
79 |
TTGlyphID newGlyph = SWAPW(trimmedArrayLookupTable->valueArray[ttGlyph - firstGlyph]);
|
|
|
80 |
|
|
|
81 |
glyphStorage[glyph] = LE_SET_GLYPH(thisGlyph, newGlyph);
|
|
|
82 |
}
|
|
|
83 |
}
|
|
|
84 |
}
|
|
3935
|
85 |
|
|
|
86 |
U_NAMESPACE_END
|