base64.java
上传用户:wcwsse
上传日期:2007-01-07
资源大小:2k
文件大小:5k
- //////////////////////license & copyright header///////////////////////
- // //
- // Copyright (c) 1998 by Kevin Kelley //
- // //
- // This program is free software; you can redistribute it and/or //
- // modify it under the terms of the GNU General Public License as //
- // published by the Free Software Foundation; either version 2 of //
- // the License, or (at your option) any later version. //
- // //
- // This program 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 for more details. //
- // //
- // You should have received a copy of the GNU General Public License //
- // along with this program in the file 'gpl.html'; if not, write to //
- // the Free Software Foundation, Inc., 59 Temple Place - Suite 330, //
- // Boston, MA 02111-1307, USA, or contact the author: //
- // //
- // Kevin Kelley <kelley@iguana.ruralnet.net> //
- // //
- ////////////////////end license & copyright header/////////////////////
- package starlight.util;
- /**
- * Provides encoding of raw bytes to base64-encoded characters, and
- * decoding of base64 characters to raw bytes.
- *
- * @author Kevin Kelley (kelley@iguana.ruralnet.net)
- * @version 1.0
- * @date 06 August 1998
- */
- public class Base64 {
- /**
- * returns an array of base64-encoded characters to represent the
- * passed data array.
- *
- * @param data the array of bytes to encode
- * @return base64-coded character array.
- */
- static public char[] encode(byte[] data)
- {
- char[] out = new char[((data.length + 2) / 3) * 4];
- //
- // 3 bytes encode to 4 chars. Output is always an even
- // multiple of 4 characters.
- //
- for (int i=0, index=0; i<data.length; i+=3, index+=4) {
- boolean quad = false;
- boolean trip = false;
- int val = (0xFF & (int) data[i]);
- val <<= 8;
- if ((i+1) < data.length) {
- val |= (0xFF & (int) data[i+1]);
- trip = true;
- }
- val <<= 8;
- if ((i+2) < data.length) {
- val |= (0xFF & (int) data[i+2]);
- quad = true;
- }
- out[index+3] = alphabet[(quad? (val & 0x3F): 64)];
- val >>= 6;
- out[index+2] = alphabet[(trip? (val & 0x3F): 64)];
- val >>= 6;
- out[index+1] = alphabet[val & 0x3F];
- val >>= 6;
- out[index+0] = alphabet[val & 0x3F];
- }
- return out;
- }
- /**
- * Returns an array of bytes which were encoded in the passed
- * character array.
- *
- * @param data the array of base64-encoded characters
- * @return decoded data array
- */
- static public byte[] decode(char[] data)
- {
- int len = ((data.length + 3) / 4) * 3;
- if (data.length>0 && data[data.length-1] == '=') --len;
- if (data.length>1 && data[data.length-2] == '=') --len;
- byte[] out = new byte[len];
- int shift = 0; // # of excess bits stored in accum
- int accum = 0; // excess bits
- int index = 0;
- for (int ix=0; ix<data.length; ix++)
- {
- int value = codes[ data[ix] & 0xFF ]; // ignore high byte of char
- if ( value >= 0 ) { // skip over non-code
- accum <<= 6; // bits shift up by 6 each time thru
- shift += 6; // loop, with new bits being put in
- accum |= value; // at the bottom.
- if ( shift >= 8 ) { // whenever there are 8 or more shifted in,
- shift -= 8; // write them out (from the top, leaving any
- out[index++] = // excess at the bottom for next iteration.
- (byte) ((accum >> shift) & 0xff);
- } } }
- if (index != out.length)
- throw new Error("miscalculated data length!");
- return out;
- }
- //
- // code characters for values 0..63
- //
- static private char[] alphabet =
- "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/="
- .toCharArray();
- //
- // lookup table for converting base64 characters to value in range 0..63
- //
- static private byte[] codes = new byte[256];
- static {
- for (int i=0; i<256; i++) codes[i] = -1;
- for (int i = 'A'; i <= 'Z'; i++) codes[i] = (byte)( i - 'A');
- for (int i = 'a'; i <= 'z'; i++) codes[i] = (byte)(26 + i - 'a');
- for (int i = '0'; i <= '9'; i++) codes[i] = (byte)(52 + i - '0');
- codes['+'] = 62;
- codes['/'] = 63;
- }
- }