Jameson Little
10 years ago
5 changed files with 166 additions and 172 deletions
@ -1,124 +1,126 @@ |
|||
var lookup = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'; |
|||
var lookup = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/' |
|||
|
|||
;(function (exports) { |
|||
'use strict'; |
|||
'use strict' |
|||
|
|||
var Arr = (typeof Uint8Array !== 'undefined') |
|||
? Uint8Array |
|||
: Array |
|||
|
|||
var PLUS = '+'.charCodeAt(0) |
|||
var SLASH = '/'.charCodeAt(0) |
|||
var NUMBER = '0'.charCodeAt(0) |
|||
var LOWER = 'a'.charCodeAt(0) |
|||
var UPPER = 'A'.charCodeAt(0) |
|||
var PLUS_URL_SAFE = '-'.charCodeAt(0) |
|||
var SLASH_URL_SAFE = '_'.charCodeAt(0) |
|||
|
|||
function decode (elt) { |
|||
var code = elt.charCodeAt(0) |
|||
if (code === PLUS || |
|||
code === PLUS_URL_SAFE) |
|||
return 62 // '+'
|
|||
if (code === SLASH || |
|||
code === SLASH_URL_SAFE) |
|||
return 63 // '/'
|
|||
if (code < NUMBER) |
|||
return -1 //no match
|
|||
if (code < NUMBER + 10) |
|||
return code - NUMBER + 26 + 26 |
|||
if (code < UPPER + 26) |
|||
return code - UPPER |
|||
if (code < LOWER + 26) |
|||
return code - LOWER + 26 |
|||
} |
|||
|
|||
function b64ToByteArray (b64) { |
|||
var i, j, l, tmp, placeHolders, arr |
|||
|
|||
if (b64.length % 4 > 0) { |
|||
throw new Error('Invalid string. Length must be a multiple of 4') |
|||
} |
|||
|
|||
// the number of equal signs (place holders)
|
|||
// if there are two placeholders, than the two characters before it
|
|||
// represent one byte
|
|||
// if there is only one, then the three characters before it represent 2 bytes
|
|||
// this is just a cheap hack to not do indexOf twice
|
|||
var len = b64.length |
|||
placeHolders = '=' === b64.charAt(len - 2) ? 2 : '=' === b64.charAt(len - 1) ? 1 : 0 |
|||
|
|||
// base64 is 4/3 + up to two characters of the original data
|
|||
arr = new Arr(b64.length * 3 / 4 - placeHolders) |
|||
|
|||
// if there are placeholders, only get up to the last complete 4 chars
|
|||
l = placeHolders > 0 ? b64.length - 4 : b64.length |
|||
|
|||
var L = 0 |
|||
|
|||
function push (v) { |
|||
arr[L++] = v |
|||
} |
|||
|
|||
for (i = 0, j = 0; i < l; i += 4, j += 3) { |
|||
tmp = (decode(b64.charAt(i)) << 18) | (decode(b64.charAt(i + 1)) << 12) | (decode(b64.charAt(i + 2)) << 6) | decode(b64.charAt(i + 3)) |
|||
push((tmp & 0xFF0000) >> 16) |
|||
push((tmp & 0xFF00) >> 8) |
|||
push(tmp & 0xFF) |
|||
} |
|||
|
|||
if (placeHolders === 2) { |
|||
tmp = (decode(b64.charAt(i)) << 2) | (decode(b64.charAt(i + 1)) >> 4) |
|||
push(tmp & 0xFF) |
|||
} else if (placeHolders === 1) { |
|||
tmp = (decode(b64.charAt(i)) << 10) | (decode(b64.charAt(i + 1)) << 4) | (decode(b64.charAt(i + 2)) >> 2) |
|||
push((tmp >> 8) & 0xFF) |
|||
push(tmp & 0xFF) |
|||
} |
|||
|
|||
return arr |
|||
} |
|||
|
|||
function uint8ToBase64 (uint8) { |
|||
var i, |
|||
extraBytes = uint8.length % 3, // if we have 1 byte left, pad 2 bytes
|
|||
output = "", |
|||
temp, length |
|||
|
|||
function encode (num) { |
|||
return lookup.charAt(num) |
|||
} |
|||
|
|||
function tripletToBase64 (num) { |
|||
return encode(num >> 18 & 0x3F) + encode(num >> 12 & 0x3F) + encode(num >> 6 & 0x3F) + encode(num & 0x3F) |
|||
} |
|||
|
|||
// go through the array every three bytes, we'll deal with trailing stuff later
|
|||
for (i = 0, length = uint8.length - extraBytes; i < length; i += 3) { |
|||
temp = (uint8[i] << 16) + (uint8[i + 1] << 8) + (uint8[i + 2]) |
|||
output += tripletToBase64(temp) |
|||
} |
|||
|
|||
// pad the end with zeros, but make sure to not forget the extra bytes
|
|||
switch (extraBytes) { |
|||
case 1: |
|||
temp = uint8[uint8.length - 1] |
|||
output += encode(temp >> 2) |
|||
output += encode((temp << 4) & 0x3F) |
|||
output += '==' |
|||
break |
|||
case 2: |
|||
temp = (uint8[uint8.length - 2] << 8) + (uint8[uint8.length - 1]) |
|||
output += encode(temp >> 10) |
|||
output += encode((temp >> 4) & 0x3F) |
|||
output += encode((temp << 2) & 0x3F) |
|||
output += '=' |
|||
break |
|||
} |
|||
|
|||
return output |
|||
} |
|||
|
|||
exports.toByteArray = b64ToByteArray |
|||
exports.fromByteArray = uint8ToBase64 |
|||
var PLUS = '+'.charCodeAt(0) |
|||
var SLASH = '/'.charCodeAt(0) |
|||
var NUMBER = '0'.charCodeAt(0) |
|||
var LOWER = 'a'.charCodeAt(0) |
|||
var UPPER = 'A'.charCodeAt(0) |
|||
var PLUS_URL_SAFE = '-'.charCodeAt(0) |
|||
var SLASH_URL_SAFE = '_'.charCodeAt(0) |
|||
|
|||
function decode (elt) { |
|||
var code = elt.charCodeAt(0) |
|||
if (code === PLUS || |
|||
code === PLUS_URL_SAFE) |
|||
return 62 // '+'
|
|||
if (code === SLASH || |
|||
code === SLASH_URL_SAFE) |
|||
return 63 // '/'
|
|||
if (code < NUMBER) |
|||
return -1 // no match
|
|||
if (code < NUMBER + 10) |
|||
return code - NUMBER + 26 + 26 |
|||
if (code < UPPER + 26) |
|||
return code - UPPER |
|||
if (code < LOWER + 26) |
|||
return code - LOWER + 26 |
|||
} |
|||
|
|||
function b64ToByteArray (b64) { |
|||
var i, j, l, tmp, placeHolders, arr |
|||
|
|||
if (b64.length % 4 > 0) { |
|||
throw new Error('Invalid string. Length must be a multiple of 4') |
|||
} |
|||
|
|||
// the number of equal signs (place holders)
|
|||
// if there are two placeholders, than the two characters before it
|
|||
// represent one byte
|
|||
// if there is only one, then the three characters before it represent 2 bytes
|
|||
// this is just a cheap hack to not do indexOf twice
|
|||
var len = b64.length |
|||
placeHolders = b64.charAt(len - 2) === '=' ? 2 : b64.charAt(len - 1) === '=' ? 1 : 0 |
|||
|
|||
// base64 is 4/3 + up to two characters of the original data
|
|||
arr = new Arr(b64.length * 3 / 4 - placeHolders) |
|||
|
|||
// if there are placeholders, only get up to the last complete 4 chars
|
|||
l = placeHolders > 0 ? b64.length - 4 : b64.length |
|||
|
|||
var L = 0 |
|||
|
|||
function push (v) { |
|||
arr[L++] = v |
|||
} |
|||
|
|||
for (i = 0, j = 0; i < l; i += 4, j += 3) { |
|||
tmp = (decode(b64.charAt(i)) << 18) | (decode(b64.charAt(i + 1)) << 12) | (decode(b64.charAt(i + 2)) << 6) | decode(b64.charAt(i + 3)) |
|||
push((tmp & 0xFF0000) >> 16) |
|||
push((tmp & 0xFF00) >> 8) |
|||
push(tmp & 0xFF) |
|||
} |
|||
|
|||
if (placeHolders === 2) { |
|||
tmp = (decode(b64.charAt(i)) << 2) | (decode(b64.charAt(i + 1)) >> 4) |
|||
push(tmp & 0xFF) |
|||
} else if (placeHolders === 1) { |
|||
tmp = (decode(b64.charAt(i)) << 10) | (decode(b64.charAt(i + 1)) << 4) | (decode(b64.charAt(i + 2)) >> 2) |
|||
push((tmp >> 8) & 0xFF) |
|||
push(tmp & 0xFF) |
|||
} |
|||
|
|||
return arr |
|||
} |
|||
|
|||
function uint8ToBase64 (uint8) { |
|||
var i |
|||
var extraBytes = uint8.length % 3 // if we have 1 byte left, pad 2 bytes
|
|||
var output = '' |
|||
var temp, length |
|||
|
|||
function encode (num) { |
|||
return lookup.charAt(num) |
|||
} |
|||
|
|||
function tripletToBase64 (num) { |
|||
return encode(num >> 18 & 0x3F) + encode(num >> 12 & 0x3F) + encode(num >> 6 & 0x3F) + encode(num & 0x3F) |
|||
} |
|||
|
|||
// go through the array every three bytes, we'll deal with trailing stuff later
|
|||
for (i = 0, length = uint8.length - extraBytes; i < length; i += 3) { |
|||
temp = (uint8[i] << 16) + (uint8[i + 1] << 8) + (uint8[i + 2]) |
|||
output += tripletToBase64(temp) |
|||
} |
|||
|
|||
// pad the end with zeros, but make sure to not forget the extra bytes
|
|||
switch (extraBytes) { |
|||
case 1: |
|||
temp = uint8[uint8.length - 1] |
|||
output += encode(temp >> 2) |
|||
output += encode((temp << 4) & 0x3F) |
|||
output += '==' |
|||
break |
|||
case 2: |
|||
temp = (uint8[uint8.length - 2] << 8) + (uint8[uint8.length - 1]) |
|||
output += encode(temp >> 10) |
|||
output += encode((temp >> 4) & 0x3F) |
|||
output += encode((temp << 2) & 0x3F) |
|||
output += '=' |
|||
break |
|||
default: |
|||
break |
|||
} |
|||
|
|||
return output |
|||
} |
|||
|
|||
exports.toByteArray = b64ToByteArray |
|||
exports.fromByteArray = uint8ToBase64 |
|||
}(typeof exports === 'undefined' ? (this.base64js = {}) : exports)) |
|||
|
@ -1,51 +1,47 @@ |
|||
var test = require('tape'), |
|||
b64 = require('../lib/b64'), |
|||
checks = [ |
|||
'a', |
|||
'aa', |
|||
'aaa', |
|||
'hi', |
|||
'hi!', |
|||
'hi!!', |
|||
'sup', |
|||
'sup?', |
|||
'sup?!' |
|||
]; |
|||
var test = require('tape') |
|||
var b64 = require('../lib/b64') |
|||
var checks = [ |
|||
'a', |
|||
'aa', |
|||
'aaa', |
|||
'hi', |
|||
'hi!', |
|||
'hi!!', |
|||
'sup', |
|||
'sup?', |
|||
'sup?!' |
|||
] |
|||
|
|||
test('convert to base64 and back', function (t) { |
|||
t.plan(checks.length); |
|||
t.plan(checks.length) |
|||
|
|||
for (var i = 0; i < checks.length; i++) { |
|||
var check = checks[i], |
|||
b64Str, |
|||
arr, |
|||
str; |
|||
var check = checks[i] |
|||
var b64Str, arr, str |
|||
|
|||
b64Str = b64.fromByteArray(map(check, function (char) { return char.charCodeAt(0); })); |
|||
b64Str = b64.fromByteArray(map(check, function (char) { return char.charCodeAt(0); })) |
|||
|
|||
arr = b64.toByteArray(b64Str); |
|||
str = map(arr, function (byte) { return String.fromCharCode(byte); }).join(''); |
|||
arr = b64.toByteArray(b64Str) |
|||
str = map(arr, function (byte) { return String.fromCharCode(byte); }).join('') |
|||
|
|||
t.equal(check, str, 'Checked ' + check); |
|||
t.equal(check, str, 'Checked ' + check) |
|||
} |
|||
|
|||
}); |
|||
}) |
|||
|
|||
function map (arr, callback) { |
|||
var res = [], |
|||
kValue, |
|||
mappedValue; |
|||
|
|||
for (var k = 0, len = arr.length; k < len; k++) { |
|||
if ((typeof arr === 'string' && !!arr.charAt(k))) { |
|||
kValue = arr.charAt(k); |
|||
mappedValue = callback(kValue, k, arr); |
|||
res[k] = mappedValue; |
|||
} else if (typeof arr !== 'string' && k in arr) { |
|||
kValue = arr[k]; |
|||
mappedValue = callback(kValue, k, arr); |
|||
res[k] = mappedValue; |
|||
} |
|||
} |
|||
return res; |
|||
var res = [] |
|||
var kValue, mappedValue |
|||
|
|||
for (var k = 0, len = arr.length; k < len; k++) { |
|||
if ((typeof arr === 'string' && !!arr.charAt(k))) { |
|||
kValue = arr.charAt(k) |
|||
mappedValue = callback(kValue, k, arr) |
|||
res[k] = mappedValue |
|||
} else if (typeof arr !== 'string' && k in arr) { |
|||
kValue = arr[k] |
|||
mappedValue = callback(kValue, k, arr) |
|||
res[k] = mappedValue |
|||
} |
|||
} |
|||
return res |
|||
} |
|||
|
@ -1,18 +1,18 @@ |
|||
var test = require('tape'), |
|||
b64 = require('../lib/b64'); |
|||
var test = require('tape') |
|||
var b64 = require('../lib/b64') |
|||
|
|||
test('decode url-safe style base64 strings', function (t) { |
|||
var expected = [0xff, 0xff, 0xbe, 0xff, 0xef, 0xbf, 0xfb, 0xef, 0xff]; |
|||
var expected = [0xff, 0xff, 0xbe, 0xff, 0xef, 0xbf, 0xfb, 0xef, 0xff] |
|||
|
|||
var actual = b64.toByteArray('//++/++/++//'); |
|||
var actual = b64.toByteArray('//++/++/++//') |
|||
for (var i = 0; i < actual.length; i++) { |
|||
t.equal(actual[i], expected[i]) |
|||
} |
|||
|
|||
actual = b64.toByteArray('__--_--_--__'); |
|||
for (var i = 0; i < actual.length; i++) { |
|||
actual = b64.toByteArray('__--_--_--__') |
|||
for (i = 0; i < actual.length; i++) { |
|||
t.equal(actual[i], expected[i]) |
|||
} |
|||
|
|||
t.end(); |
|||
}); |
|||
|
|||
t.end() |
|||
}) |
|||
|
Loading…
Reference in new issue