|
Java example source code file (StateTableProcessor.cpp)
The StateTableProcessor.cpp Java example source code/* * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * This code is free software; you can redistribute it and/or modify it * under the terms of the GNU General Public License version 2 only, as * published by the Free Software Foundation. Oracle designates this * particular file as subject to the "Classpath" exception as provided * by Oracle in the LICENSE file that accompanied this code. * * This code is distributed in the hope that it will be useful, but WITHOUT * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License * version 2 for more details (a copy is included in the LICENSE file that * accompanied this code). * * You should have received a copy of the GNU General Public License version * 2 along with this work; if not, write to the Free Software Foundation, * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. * * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA * or visit www.oracle.com if you need additional information or have any * questions. * */ /* * * (C) Copyright IBM Corp. 1998-2004 - All Rights Reserved * */ #include "LETypes.h" #include "MorphTables.h" #include "StateTables.h" #include "MorphStateTables.h" #include "SubtableProcessor.h" #include "StateTableProcessor.h" #include "LEGlyphStorage.h" #include "LESwaps.h" U_NAMESPACE_BEGIN StateTableProcessor::StateTableProcessor() { } StateTableProcessor::StateTableProcessor(const LEReferenceTo<MorphSubtableHeader> &morphSubtableHeader, LEErrorCode &success) : SubtableProcessor(morphSubtableHeader, success), stateTableHeader(morphSubtableHeader, success), stHeader(stateTableHeader, success, (const StateTableHeader*)&stateTableHeader->stHeader) { if(LE_FAILURE(success)) return; stateSize = SWAPW(stateTableHeader->stHeader.stateSize); classTableOffset = SWAPW(stateTableHeader->stHeader.classTableOffset); stateArrayOffset = SWAPW(stateTableHeader->stHeader.stateArrayOffset); entryTableOffset = SWAPW(stateTableHeader->stHeader.entryTableOffset); classTable = LEReferenceTo<ClassTable>(stateTableHeader, success, ((char *) &stateTableHeader->stHeader + classTableOffset)); if(LE_FAILURE(success)) return; firstGlyph = SWAPW(classTable->firstGlyph); lastGlyph = firstGlyph + SWAPW(classTable->nGlyphs); } StateTableProcessor::~StateTableProcessor() { } void StateTableProcessor::process(LEGlyphStorage &glyphStorage, LEErrorCode &success) { if (LE_FAILURE(success)) return; LE_STATE_PATIENCE_INIT(); // Start at state 0 // XXX: How do we know when to start at state 1? ByteOffset currentState = stateArrayOffset; // XXX: reverse? le_int32 currGlyph = 0; le_int32 glyphCount = glyphStorage.getGlyphCount(); beginStateTable(); while (currGlyph <= glyphCount) { if(LE_STATE_PATIENCE_DECR()) break; // patience exceeded. ClassCode classCode = classCodeOOB; if (currGlyph == glyphCount) { // XXX: How do we handle EOT vs. EOL? classCode = classCodeEOT; } else { TTGlyphID glyphCode = (TTGlyphID) LE_GET_GLYPH(glyphStorage[currGlyph]); if (glyphCode == 0xFFFF) { classCode = classCodeDEL; } else if ((glyphCode >= firstGlyph) && (glyphCode < lastGlyph)) { classCode = classTable->classArray[glyphCode - firstGlyph]; } } LEReferenceToArrayOf<EntryTableIndex> stateArray(stHeader, success, currentState, LE_UNBOUNDED_ARRAY); EntryTableIndex entryTableIndex = stateArray.getObject((le_uint8)classCode, success); LE_STATE_PATIENCE_CURR(le_int32, currGlyph); currentState = processStateEntry(glyphStorage, currGlyph, entryTableIndex); LE_STATE_PATIENCE_INCR(currGlyph); } endStateTable(); } U_NAMESPACE_END Other Java examples (source code examples)Here is a short list of links related to this Java StateTableProcessor.cpp source code file: |
... this post is sponsored by my books ... | |
#1 New Release! |
FP Best Seller |
Copyright 1998-2024 Alvin Alexander, alvinalexander.com
All Rights Reserved.
A percentage of advertising revenue from
pages under the /java/jwarehouse
URI on this website is
paid back to open source projects.