| J. Duke | 319a3b9 | 2007-12-01 00:00:00 +0000 | [diff] [blame^] | 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 |
| 6 | * published by the Free Software Foundation. Sun designates this |
| 7 | * particular file as subject to the "Classpath" exception as provided |
| 8 | * by Sun in the LICENSE file that accompanied this code. |
| 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 | * |
| 20 | * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, |
| 21 | * CA 95054 USA or visit www.sun.com if you need additional information or |
| 22 | * have any questions. |
| 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 | |
| 41 | TrimmedArrayProcessor::TrimmedArrayProcessor() |
| 42 | { |
| 43 | } |
| 44 | |
| 45 | TrimmedArrayProcessor::TrimmedArrayProcessor(const MorphSubtableHeader *morphSubtableHeader) |
| 46 | : NonContextualGlyphSubstitutionProcessor(morphSubtableHeader) |
| 47 | { |
| 48 | const NonContextualGlyphSubstitutionHeader *header = (const NonContextualGlyphSubstitutionHeader *) morphSubtableHeader; |
| 49 | |
| 50 | trimmedArrayLookupTable = (const TrimmedArrayLookupTable *) &header->table; |
| 51 | firstGlyph = SWAPW(trimmedArrayLookupTable->firstGlyph); |
| 52 | lastGlyph = firstGlyph + SWAPW(trimmedArrayLookupTable->glyphCount); |
| 53 | } |
| 54 | |
| 55 | TrimmedArrayProcessor::~TrimmedArrayProcessor() |
| 56 | { |
| 57 | } |
| 58 | |
| 59 | void TrimmedArrayProcessor::process(LEGlyphStorage &glyphStorage) |
| 60 | { |
| 61 | le_int32 glyphCount = glyphStorage.getGlyphCount(); |
| 62 | le_int32 glyph; |
| 63 | |
| 64 | for (glyph = 0; glyph < glyphCount; glyph += 1) { |
| 65 | LEGlyphID thisGlyph = glyphStorage[glyph]; |
| 66 | TTGlyphID ttGlyph = (TTGlyphID) LE_GET_GLYPH(thisGlyph); |
| 67 | |
| 68 | if ((ttGlyph > firstGlyph) && (ttGlyph < lastGlyph)) { |
| 69 | TTGlyphID newGlyph = SWAPW(trimmedArrayLookupTable->valueArray[ttGlyph - firstGlyph]); |
| 70 | |
| 71 | glyphStorage[glyph] = LE_SET_GLYPH(thisGlyph, newGlyph); |
| 72 | } |
| 73 | } |
| 74 | } |