hjs-codec
Version:
Codec for Hubrisjs framework
483 lines (440 loc) • 19.3 kB
JavaScript
"use strict";
Object.defineProperty(exports, "__esModule", {
value: true
});
exports.Base64Codec = exports.Base64 = undefined;
var _getPrototypeOf = require("babel-runtime/core-js/object/get-prototype-of");
var _getPrototypeOf2 = _interopRequireDefault(_getPrototypeOf);
var _classCallCheck2 = require("babel-runtime/helpers/classCallCheck");
var _classCallCheck3 = _interopRequireDefault(_classCallCheck2);
var _createClass2 = require("babel-runtime/helpers/createClass");
var _createClass3 = _interopRequireDefault(_createClass2);
var _possibleConstructorReturn2 = require("babel-runtime/helpers/possibleConstructorReturn");
var _possibleConstructorReturn3 = _interopRequireDefault(_possibleConstructorReturn2);
var _inherits2 = require("babel-runtime/helpers/inherits");
var _inherits3 = _interopRequireDefault(_inherits2);
var _util = require("hjs-core/lib/util");
var util = _interopRequireWildcard(_util);
var _char = require("hjs-core/lib/char");
var char = _interopRequireWildcard(_char);
var _buffer = require("hjs-io/lib/buffer");
var _codec = require("./codec");
function _interopRequireWildcard(obj) { if (obj && obj.__esModule) { return obj; } else { var newObj = {}; if (obj != null) { for (var key in obj) { if (Object.prototype.hasOwnProperty.call(obj, key)) newObj[key] = obj[key]; } } newObj.default = obj; return newObj; } }
function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
/** @babel */
var CA = char.stringToCharBuffer("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/");
var IA = _buffer.ByteBuffer.createBuffer({ capacity: 256 });
util.fill(IA, -1);
for (var i = 0, iS = CA.length; i < iS; i++) {
IA[CA[i]] = i;
}
IA[char.EQUAL] = 0;
var Base64 = exports.Base64 = {
encodeToChar: function encodeToChar() {
var sArr = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : null;
var lineSep = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : false;
var sLen = sArr !== null ? sArr.length : 0;
if (sLen === 0) {
return [];
}
var eLen = sLen / 3 * 3; // Length of even 24-bits.
var cCnt = (sLen - 1) / 3 + 1 << 2; // Returned character count
var dLen = cCnt + (lineSep ? (cCnt - 1) / 76 << 1 : 0); // Length of returned array
var dArr = _buffer.ByteBuffer.createBuffer({ capacity: dLen });
// Encode even 24-bits
for (var s = 0, d = 0, cc = 0; s < eLen;) {
// Copy next three bytes into lower 24 bits of int, paying attension to sign.
var _i = (sArr[s++] & 0xff) << 16 | (sArr[s++] & 0xff) << 8 | sArr[s++] & 0xff;
// Encode the int into four chars
dArr[d++] = CA[_i >>> 18 & 0x3f];
dArr[d++] = CA[_i >>> 12 & 0x3f];
dArr[d++] = CA[_i >>> 6 & 0x3f];
dArr[d++] = CA[_i & 0x3f];
// Add optional line separator
if (lineSep && ++cc == 19 && d < dLen - 2) {
dArr[d++] = char.CARRIAGE_RETURN;
dArr[d++] = char.NEWLINE;
cc = 0;
}
}
// Pad and encode last bits if source isn't even 24 bits.
var left = sLen - eLen; // 0 - 2.
if (left > 0) {
// Prepare the int
var _i2 = (sArr[eLen] & 0xff) << 10 | (left === 2 ? (sArr[sLen - 1] & 0xff) << 2 : 0);
// Set last four chars
dArr[dLen - 4] = CA[_i2 >> 12];
dArr[dLen - 3] = CA[_i2 >>> 6 & 0x3f];
dArr[dLen - 2] = left === 2 ? CA[_i2 & 0x3f] : char.EQUAL;
dArr[dLen - 1] = char.EQUAL;
}
return dArr;
},
decodeChar: function decodeChar() {
var sArr = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : null;
// Check special case
var sLen = sArr !== null ? sArr.length : 0;
if (sLen == 0) {
return [];
}
// Count illegal characters (including '\r', '\n') to know what size the returned array will be,
// so we don't have to reallocate & copy it later.
var sepCnt = 0; // Number of separator characters. (Actually illegal characters, but that's a bonus...)
for (var _i3 = 0; _i3 < sLen; _i3++) {
// If input is "pure" (I.e. no line separators or illegal chars) base64 this loop can be commented out.
if (IA[sArr[_i3]] < 0) {
sepCnt++;
}
}
// Check so that legal chars (including '=') are evenly divideable by 4 as specified in RFC 2045.
if ((sLen - sepCnt) % 4 !== 0) {
return null;
}
var pad = 0;
for (var _i4 = sLen; _i4 > 1 && IA[sArr[--_i4]] <= 0;) {
if (sArr[_i4] === char.EQUAL) {
pad++;
}
}
var len = ((sLen - sepCnt) * 6 >> 3) - pad;
var dArr = _buffer.ByteBuffer.createBuffer({ capacity: len }); // Preallocate byte[] of exact length
for (var s = 0, d = 0; d < len;) {
// Assemble three bytes into an int from four "valid" characters.
var _i5 = 0;
for (var j = 0; j < 4; j++) {
// j only increased if a valid char was found.
var c = IA[sArr[s++]];
if (c >= 0) {
_i5 |= c << 18 - j * 6;
} else {
j--;
}
}
// Add the bytes
dArr[d++] = _i5 >> 16;
if (d < len) {
dArr[d++] = _i5 >> 8;
if (d < len) {
dArr[d++] = _i5;
}
}
}
return dArr;
},
decodeCharFast: function decodeCharFast() {
var sArr = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : null;
// Check special case
var sLen = sArr !== null ? sArr.length : 0;
if (sLen === 0) {
return [];
}
var sIx = 0,
eIx = sLen - 1; // Start and end index after trimming.
// Trim illegal chars from start
while (sIx < eIx && IA[sArr[sIx]] < 0) {
sIx++;
}
// Trim illegal chars from end
while (eIx > 0 && IA[sArr[eIx]] < 0) {
eIx--;
}
// get the padding count (=) (0, 1 or 2)
var pad = sArr[eIx] === char.EQUAL ? sArr[eIx - 1] === char.EQUAL ? 2 : 1 : 0; // Count '=' at end.
var cCnt = eIx - sIx + 1; // Content count including possible separators
var sepCnt = sLen > 76 ? (sArr[76] === char.CARRIAGE_RETURN ? cCnt / 78 : 0) << 1 : 0;
var len = ((cCnt - sepCnt) * 6 >> 3) - pad; // The number of decoded bytes
var dArr = _buffer.ByteBuffer.createBuffer({ capacity: len }); // Preallocate byte[] of exact length
// Decode all but the last 0 - 2 bytes.
var d = 0;
for (var cc = 0, eLen = len / 3 * 3; d < eLen;) {
// Assemble three bytes into an int from four "valid" characters.
var _i6 = IA[sArr[sIx++]] << 18 | IA[sArr[sIx++]] << 12 | IA[sArr[sIx++]] << 6 | IA[sArr[sIx++]];
// Add the bytes
dArr[d++] = _i6 >> 16;
dArr[d++] = _i6 >> 8;
dArr[d++] = _i6;
// If line separator, jump over it.
if (sepCnt > 0 && ++cc === 19) {
sIx += 2;
cc = 0;
}
}
if (d < len) {
// Decode last 1-3 bytes (incl '=') into 1-3 bytes
var _i7 = 0;
for (var j = 0; sIx <= eIx - pad; j++) {
_i7 |= IA[sArr[sIx++]] << 18 - j * 6;
}
for (var r = 16; d < len; r -= 8) {
dArr[d++] = _i7 >> r;
}
}
return dArr;
},
encodeToByte: function encodeToByte() {
var sArr = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : null;
var lineSep = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : false;
// Check special case
var sLen = sArr !== null ? sArr.length : 0;
if (sLen === 0) {
return [];
}
var eLen = sLen / 3 * 3; // Length of even 24-bits.
var cCnt = (sLen - 1) / 3 + 1 << 2; // Returned character count
var dLen = cCnt + (lineSep ? (cCnt - 1) / 76 << 1 : 0); // Length of returned array
var dArr = _buffer.ByteBuffer.createBuffer({ capacity: dLen });
// Encode even 24-bits
for (var s = 0, d = 0, cc = 0; s < eLen;) {
// Copy next three bytes into lower 24 bits of int, paying attension to sign.
var _i8 = (sArr[s++] & 0xff) << 16 | (sArr[s++] & 0xff) << 8 | sArr[s++] & 0xff;
// Encode the int into four chars
dArr[d++] = CA[_i8 >>> 18 & 0x3f];
dArr[d++] = CA[_i8 >>> 12 & 0x3f];
dArr[d++] = CA[_i8 >>> 6 & 0x3f];
dArr[d++] = CA[_i8 & 0x3f];
// Add optional line separator
if (lineSep && ++cc === 19 && d < dLen - 2) {
dArr[d++] = char.CARRIAGE_RETURN;
dArr[d++] = char.NEWLINE;
cc = 0;
}
}
// Pad and encode last bits if source isn't an even 24 bits.
var left = sLen - eLen; // 0 - 2.
if (left > 0) {
// Prepare the int
var _i9 = (sArr[eLen] & 0xff) << 10 | (left === 2 ? (sArr[sLen - 1] & 0xff) << 2 : 0);
// Set last four chars
dArr[dLen - 4] = CA[_i9 >> 12];
dArr[dLen - 3] = CA[_i9 >>> 6 & 0x3f];
dArr[dLen - 2] = left === 2 ? CA[_i9 & 0x3f] : char.EQUAL;
dArr[dLen - 1] = char.EQUAL;
}
return dArr;
},
decodeByte: function decodeByte(sArr) {
// Check special case
var sLen = sArr.length;
// Count illegal characters (including '\r', '\n') to know what size the returned array will be,
// so we don't have to reallocate & copy it later.
var sepCnt = 0; // Number of separator characters. (Actually illegal characters, but that's a bonus...)
for (var _i10 = 0; _i10 < sLen; _i10++) {
// If input is "pure" (I.e. no line separators or illegal chars) base64 this loop can be commented out.
if (IA[sArr[_i10] & 0xff] < 0) {
sepCnt++;
}
}
// Check so that legal chars (including '=') are evenly divideable by 4 as specified in RFC 2045.
if ((sLen - sepCnt) % 4 !== 0) {
return null;
}
var pad = 0;
for (var _i11 = sLen; _i11 > 1 && IA[sArr[--_i11] & 0xff] <= 0;) {
if (sArr[_i11] === char.EQUAL) {
pad++;
}
}
var len = ((sLen - sepCnt) * 6 >> 3) - pad;
var dArr = _buffer.ByteBuffer.createBuffer({ capacity: len }); // Preallocate byte[] of exact length
for (var s = 0, d = 0; d < len;) {
// Assemble three bytes into an int from four "valid" characters.
var _i12 = 0;
for (var j = 0; j < 4; j++) {
// j only increased if a valid char was found.
var c = IA[sArr[s++] & 0xff];
if (c >= 0) {
_i12 |= c << 18 - j * 6;
} else {
j--;
}
}
// Add the bytes
dArr[d++] = _i12 >> 16;
if (d < len) {
dArr[d++] = _i12 >> 8;
if (d < len) {
dArr[d++] = _i12;
}
}
}
return dArr;
},
decodeByteFast: function decodeByteFast() {
var sArr = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : null;
// Check special case
var sLen = sArr !== null ? sArr.length : 0;
if (sLen === 0) {
return [];
}
var sIx = 0,
eIx = sLen - 1; // Start and end index after trimming.
// Trim illegal chars from start
while (sIx < eIx && IA[sArr[sIx] & 0xff] < 0) {
sIx++;
}
// Trim illegal chars from end
while (eIx > 0 && IA[sArr[eIx] & 0xff] < 0) {
eIx--;
}
// get the padding count (=) (0, 1 or 2)
var pad = sArr[eIx] === char.EQUAL ? sArr[eIx - 1] === char.EQUAL ? 2 : 1 : 0; // Count '=' at end.
var cCnt = eIx - sIx + 1; // Content count including possible separators
var sepCnt = sLen > 76 ? (sArr[76] === char.CARRIAGE_RETURN ? cCnt / 78 : 0) << 1 : 0;
var len = ((cCnt - sepCnt) * 6 >> 3) - pad; // The number of decoded bytes
var dArr = _buffer.ByteBuffer.createBuffer({ capacity: len }); // Preallocate byte[] of exact length
// Decode all but the last 0 - 2 bytes.
var d = 0;
for (var cc = 0, eLen = len / 3 * 3; d < eLen;) {
// Assemble three bytes into an int from four "valid" characters.
var _i13 = IA[sArr[sIx++]] << 18 | IA[sArr[sIx++]] << 12 | IA[sArr[sIx++]] << 6 | IA[sArr[sIx++]];
// Add the bytes
dArr[d++] = _i13 >> 16;
dArr[d++] = _i13 >> 8;
dArr[d++] = _i13;
// If line separator, jump over it.
if (sepCnt > 0 && ++cc === 19) {
sIx += 2;
cc = 0;
}
}
if (d < len) {
// Decode last 1-3 bytes (incl '=') into 1-3 bytes
var _i14 = 0;
for (var j = 0; sIx <= eIx - pad; j++) {
_i14 |= IA[sArr[sIx++]] << 18 - j * 6;
}
for (var r = 16; d < len; r -= 8) {
dArr[d++] = _i14 >> r;
}
}
return dArr;
},
encodeToString: function encodeToString() {
var sArr = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : null;
var lineSep = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : false;
// Reuse char[] since we can't create a String incrementally anyway and StringBuffer/Builder would be slower.
var buffer = Base64.encodeToChar(sArr, lineSep);
return char.charBufferToString(buffer);
},
decodeString: function decodeString() {
var str = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : null;
// Check special case
var sLen = str !== null ? str.length : 0;
if (sLen === 0) {
return [];
}
// Count illegal characters (including '\r', '\n') to know what size the returned array will be,
// so we don't have to reallocate & copy it later.
var sepCnt = 0; // Number of separator characters. (Actually illegal characters, but that's a bonus...)
for (var _i15 = 0; _i15 < sLen; _i15++) {
// If input is "pure" (I.e. no line separators or illegal chars) base64 this loop can be commented out.
if (IA[str.charCodeAt(_i15)] < 0) {
sepCnt++;
}
}
// Check so that legal chars (including '=') are evenly divideable by 4 as specified in RFC 2045.
if ((sLen - sepCnt) % 4 !== 0) {
return null;
}
// Count '=' at end
var pad = 0;
for (var _i16 = sLen; _i16 > 1 && IA[str.charCodeAt(--_i16)] <= 0;) {
if (str.charCodeAt(_i16) === char.EQUAL) {
pad++;
}
}
var len = ((sLen - sepCnt) * 6 >> 3) - pad;
var dArr = _buffer.ByteBuffer.createBuffer({ capacity: len }); // Preallocate byte[] of exact length
for (var s = 0, d = 0; d < len;) {
// Assemble three bytes into an int from four "valid" characters.
var _i17 = 0;
for (var j = 0; j < 4; j++) {
// j only increased if a valid char was found.
var c = IA[str.charCodeAt(s++)];
if (c >= 0) {
_i17 |= c << 18 - j * 6;
} else {
j--;
}
}
// Add the bytes
dArr[d++] = _i17 >> 16;
if (d < len) {
dArr[d++] = _i17 >> 8;
if (d < len) {
dArr[d++] = _i17;
}
}
}
return dArr;
},
decodeStringFast: function decodeStringFast(s) {
// Check special case
var sLen = s.length();
if (sLen === 0) {
return [];
}
var sIx = 0,
eIx = sLen - 1; // Start and end index after trimming.
// Trim illegal chars from start
while (sIx < eIx && IA[s.charCodeAt(sIx) & 0xff] < 0) {
sIx++;
}
// Trim illegal chars from end
while (eIx > 0 && IA[s.charCodeAt(eIx) & 0xff] < 0) {
eIx--;
}
// get the padding count (=) (0, 1 or 2)
var pad = s.charCodeAt(eIx) === char.EQUAL ? s.charCodeAt(eIx - 1) === char.EQUAL ? 2 : 1 : 0; // Count '=' at end.
var cCnt = eIx - sIx + 1; // Content count including possible separators
var sepCnt = sLen > 76 ? (s.charCodeAt(76) === char.CARRIAGE_RETURN ? cCnt / 78 : 0) << 1 : 0;
var len = ((cCnt - sepCnt) * 6 >> 3) - pad; // The number of decoded bytes
var dArr = _buffer.ByteBuffer.createBuffer({ capacity: len }); // Preallocate byte[] of exact length
// Decode all but the last 0 - 2 bytes.
var d = 0;
for (var cc = 0, eLen = len / 3 * 3; d < eLen;) {
// Assemble three bytes into an int from four "valid" characters.
var _i18 = IA[s.charCodeAt(sIx++)] << 18 | IA[s.charCodeAt(sIx++)] << 12 | IA[s.charCodeAt(sIx++)] << 6 | IA[s.charCodeAt(sIx++)];
// Add the bytes
dArr[d++] = _i18 >> 16;
dArr[d++] = _i18 >> 8;
dArr[d++] = _i18;
// If line separator, jump over it.
if (sepCnt > 0 && ++cc === 19) {
sIx += 2;
cc = 0;
}
}
if (d < len) {
// Decode last 1-3 bytes (incl '=') into 1-3 bytes
var _i19 = 0;
for (var j = 0; sIx <= eIx - pad; j++) {
_i19 |= IA[s.charCodeAt(sIx++)] << 18 - j * 6;
}
for (var r = 16; d < len; r -= 8) {
dArr[d++] = _i19 >> r;
}
}
return dArr;
}
};
var Base64Codec = exports.Base64Codec = function (_Codec) {
(0, _inherits3.default)(Base64Codec, _Codec);
function Base64Codec() {
(0, _classCallCheck3.default)(this, Base64Codec);
return (0, _possibleConstructorReturn3.default)(this, (Base64Codec.__proto__ || (0, _getPrototypeOf2.default)(Base64Codec)).call(this));
}
(0, _createClass3.default)(Base64Codec, [{
key: "decode",
value: function decode(output) {
return Base64.decodeString(output);
}
}, {
key: "encode",
value: function encode() {
var input = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : null;
return Base64.encodeToString(char.stringToCharBuffer(input));
}
}]);
return Base64Codec;
}(_codec.Codec);