Created
July 12, 2023 16:30
-
-
Save donpdonp/f55807adcc29450c8a6f50d110e16ec3 to your computer and use it in GitHub Desktop.
gluon jwt
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// if this is your Base64 encoded string | |
var str = 'VGhpcyBpcyBhbiBhd2Vzb21lIHNjcmlwdA=='; | |
// make URL friendly: | |
str = str.replace(/\+/g, '-').replace(/\//g, '_').replace(/\=+$/, ''); | |
// reverse to original encoding | |
str = (str + '===').slice(0, str.length + (str.length % 4)); | |
str = str.replace(/-/g, '+').replace(/_/g, '/'); | |
let b64 = function (utf8) { | |
var $this = this; | |
var $utf8 = utf8 || this.utf8; | |
var map = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/="; | |
return { | |
encode: function (input) { | |
if (typeof $utf8 === 'undefined') throw { error: "MissingMethod", message: "UTF8 Module is missing." }; | |
if (typeof input !== 'string') return input; | |
else input = $utf8.encode(input); | |
var output = "", a, b, c, d, e, f, g, i = 0; | |
while (i < input.length) { | |
a = input.charCodeAt(i++); | |
b = input.charCodeAt(i++); | |
c = input.charCodeAt(i++); | |
d = a >> 2; | |
e = ((a & 3) << 4) | (b >> 4); | |
f = ((b & 15) << 2) | (c >> 6); | |
g = c & 63; | |
if (isNaN(b)) f = g = 64; | |
else if (isNaN(c)) g = 64; | |
output += map.charAt(d) + map.charAt(e) + map.charAt(f) + map.charAt(g); | |
} | |
return output; | |
}, | |
decode: function (input) { | |
if (typeof $utf8 === 'undefined') throw { error: "MissingMethod", message: "UTF8 Module is missing." }; | |
if (typeof input !== 'string') return input; | |
else input = input.replace(/[^A-Za-z0-9\+\/\=]/g, ""); | |
var output = "", a, b, c, d, e, f, g, i = 0; | |
while (i < input.length) { | |
d = map.indexOf(input.charAt(i++)); | |
e = map.indexOf(input.charAt(i++)); | |
f = map.indexOf(input.charAt(i++)); | |
g = map.indexOf(input.charAt(i++)); | |
a = (d << 2) | (e >> 4); | |
b = ((e & 15) << 4) | (f >> 2); | |
c = ((f & 3) << 6) | g; | |
output += String.fromCharCode(a); | |
if (f != 64) output += String.fromCharCode(b); | |
if (g != 64) output += String.fromCharCode(c); | |
} | |
return $utf8.decode(output); | |
} | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment