hextranslator.java

来自「《移动Agent技术》一书的所有章节源代码。」· Java 代码 · 共 83 行

package org.bouncycastle.util.encoders;

/**
 * Converters for going from hex to binary and back. Note: this class assumes ASCII processing.
 */
public class HexTranslator
    implements Translator
{
    private static byte[]   hexTable = 
        { 
            (byte)'0', (byte)'1', (byte)'2', (byte)'3', (byte)'4', (byte)'5', (byte)'6', (byte)'7',
            (byte)'8', (byte)'9', (byte)'a', (byte)'b', (byte)'c', (byte)'d', (byte)'e', (byte)'f'
        };

    /**
     * size of the output block on encoding produced by getDecodedBlockSize()
     * bytes.
     */
    public int getEncodedBlockSize()
    {
        return 2;
    }

    public int encode(
        byte[]  in,
        int     inOff,
        int     length,
        byte[]  out,
        int     outOff)
    {
        for (int i = 0; i != length; i++)
        {
            out[outOff + i * 2] = hexTable[(in[inOff] >> 4) & 0x0f];
            out[outOff + i * 2 + 1] = hexTable[in[inOff] & 0x0f];

            inOff++;
        }

        return length * 2;
    }

    /**
     * size of the output block on decoding produced by getEncodedBlockSize()
     * bytes.
     */
    public int getDecodedBlockSize()
    {
        return 1;
    }

    public int decode(
        byte[]  in,
        int     inOff,
        int     length,
        byte[]  out,
        int     outOff)
    {
        for (int i = 0; i != length / 2; i++)
        {
            if (in[inOff + 2 * i] < (byte)'a')
            {
                out[outOff] = (byte)((in[inOff + 2 * i] - '0') << 4);
            }
            else
            {
                out[outOff] = (byte)((in[inOff + 2 * i] - 'a' + 10) << 4);
            }
            if (in[inOff + 2 * i + 1] < (byte)'a')
            {
                out[outOff] += (byte)(in[inOff + 2 * i + 1] - '0');
            }
            else
            {
                out[outOff] += (byte)(in[inOff + 2 * i + 1] - 'a' + 10);
            }

            outOff++;
        }

        return length / 2;
    }
}