perf base64url

[mimiMonads]

Reasons for potential speed improvement:

• Fewer String Parses: In the original function, the string is parsed three times due to three replace calls. In the new function, the string is parsed at most twice using replace, and even this is optimized using quick endsWith checks.

• Optimized Checks for '=': The new function uses the endsWith method, which is optimized for checking the end of a string and is faster than scanning the entire string as in the replace method.

• Slice Over Replace: The new function uses slice to remove trailing '=' characters. slice is generally faster for such operations since it simply involves adjusting a pointer/reference to the string start/end, whereas replace would have to parse through the string.

also, this operation is safe because is a base64 where = only can be at the end

It's proximally 15% faster than the current implementation

[CLAassistant]

All committers have signed the CLA.

[kt3k]

LGTM

[kt3k]

It might be also worth considering using a pattern like b64.replace(/[\+\/\=]/g, (c) => {...})

[mimiMonads]

I already did, and it was slower, I had another good candidate

[kt3k]

Oh, interesting. Thanks for the researches