/* * Copyright (c) 2003, 2006, Oracle and/or its affiliates. All rights reserved. * 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.
*/
try { while (sp < sl) { int b1, b2;
b1 = sa[sp]; int inputSize = 1; int v = 0; char outputChar = REPLACE_CHAR;
if (b1 < 0)
b1 += 256;
if (b1 == SO) { // Shift out // For SO characters - simply validate the state and if OK // update the state and go to the next byte
if (currentState != SBCS) return CoderResult.malformedForLength(1); else
currentState = DBCS;
} elseif (b1 == SI) { // For SI characters - simply validate the state and if OK // update the state and go to the next byte
// Lookup in the two level index
v = b1 * 256 + b2;
outputChar = index2.charAt(index1[((v & mask1) >> shift)]
+ (v & mask2));
} if (outputChar == '\uFFFD') return CoderResult.unmappableForLength(inputSize);
private CoderResult decodeBufferLoop(ByteBuffer src, CharBuffer dst) { int mark = src.position();
try { while (src.hasRemaining()) { int b1, b2; int v = 0;
b1 = src.get(); int inputSize = 1; char outputChar = REPLACE_CHAR;
if (b1 < 0)
b1 += 256;
if (b1 == SO) { // Shift out // For SO characters - simply validate the state and if OK // update the state and go to the next byte
if (currentState != SBCS) return CoderResult.malformedForLength(1); else
currentState = DBCS;
} elseif (b1 == SI) { // For SI characters - simply validate the state and if OK // update the state and go to the next byte
// Lookup in the two level index
v = b1 * 256 + b2;
outputChar = index2.charAt(index1[((v & mask1) >> shift)]
+ (v & mask2));
} if (outputChar == REPLACE_CHAR) return CoderResult.unmappableForLength(inputSize);
if (!dst.hasRemaining()) return CoderResult.OVERFLOW;
dst.put(outputChar);
}
mark += inputSize;
} return CoderResult.UNDERFLOW;
} finally {
src.position(mark);
}
}
Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.
Bemerkung:
Die farbliche Syntaxdarstellung und die Messung sind noch experimentell.