equal
deleted
inserted
replaced
|
1 /* |
|
2 * |
|
3 * (C) Copyright IBM Corp. 1998-2004 - All Rights Reserved |
|
4 * |
|
5 */ |
|
6 |
|
7 #include "LETypes.h" |
|
8 #include "MorphTables.h" |
|
9 #include "SubtableProcessor.h" |
|
10 #include "NonContextualGlyphSubst.h" |
|
11 #include "NonContextualGlyphSubstProc.h" |
|
12 #include "TrimmedArrayProcessor.h" |
|
13 #include "LEGlyphStorage.h" |
|
14 #include "LESwaps.h" |
|
15 |
|
16 U_NAMESPACE_BEGIN |
|
17 |
|
18 UOBJECT_DEFINE_RTTI_IMPLEMENTATION(TrimmedArrayProcessor) |
|
19 |
|
20 TrimmedArrayProcessor::TrimmedArrayProcessor() |
|
21 { |
|
22 } |
|
23 |
|
24 TrimmedArrayProcessor::TrimmedArrayProcessor(const MorphSubtableHeader *morphSubtableHeader) |
|
25 : NonContextualGlyphSubstitutionProcessor(morphSubtableHeader) |
|
26 { |
|
27 const NonContextualGlyphSubstitutionHeader *header = (const NonContextualGlyphSubstitutionHeader *) morphSubtableHeader; |
|
28 |
|
29 trimmedArrayLookupTable = (const TrimmedArrayLookupTable *) &header->table; |
|
30 firstGlyph = SWAPW(trimmedArrayLookupTable->firstGlyph); |
|
31 lastGlyph = firstGlyph + SWAPW(trimmedArrayLookupTable->glyphCount); |
|
32 } |
|
33 |
|
34 TrimmedArrayProcessor::~TrimmedArrayProcessor() |
|
35 { |
|
36 } |
|
37 |
|
38 void TrimmedArrayProcessor::process(LEGlyphStorage &glyphStorage) |
|
39 { |
|
40 le_int32 glyphCount = glyphStorage.getGlyphCount(); |
|
41 le_int32 glyph; |
|
42 |
|
43 for (glyph = 0; glyph < glyphCount; glyph += 1) { |
|
44 LEGlyphID thisGlyph = glyphStorage[glyph]; |
|
45 TTGlyphID ttGlyph = (TTGlyphID) LE_GET_GLYPH(thisGlyph); |
|
46 |
|
47 if ((ttGlyph > firstGlyph) && (ttGlyph < lastGlyph)) { |
|
48 TTGlyphID newGlyph = SWAPW(trimmedArrayLookupTable->valueArray[ttGlyph - firstGlyph]); |
|
49 |
|
50 glyphStorage[glyph] = LE_SET_GLYPH(thisGlyph, newGlyph); |
|
51 } |
|
52 } |
|
53 } |
|
54 |
|
55 U_NAMESPACE_END |