Huffman like comression in ES6
Ever got some rediculously redundant data that need some compression? Here is a experimental JS algo finding all repetitions in the data and encoding it.
This is obvious code that needs no license but just to be sure it will go under MIT license