4 ms·
The code is a bit dense for my taste, these are extracts from the unminified version: for(M=N=e=c=0,i=Q.length;!c &&--i;)!~s.indexOf(Q[i])&&(c=Q[i]); RegExp(
by emj 7y ago
The code is a bit dense for my taste, these are extracts from the unminified version:
for(M=N=e=c=0,i=Q.length;!c &&--i;)!~s.indexOf(Q[i])&&(c=Q[i]);
RegExp(`${(g[2]?g[2]:'')+g[0]}|${(g[3]?g[3]:'')+g[1]}`,'g');
- KilledByAPixel 7y agoThis is the JSCrush algorithm that I did not write and it is kind of magic. The uncompressor is crazy small. You can read more about it here... https://nikhilism.com/post/2012/demystifying-jscrush https://nikhilism.com/post/2012/demystifying-jscrush