This program is file (de)compresseor written in JavaScript + HTML. Its size is smaller than 800bytes! compression raito is usually better than gzip(especially text file).
smallest implementation. Its code is minified. GUI is very simple. and description is too small.
- o[number] -- input context order. range is 0-255. empty means 0. best balanced value is 2.
- dec -------- if checked it then unpack file else pack file.
- DL --------- if process is done, click here to download file.
almost the same as f2f-tiny.htm. it uses carryless range coder.
Its GUI is rich. Its code is not minified. But size is over than 3KB.
- mem[number] --- max count of context model. range is 0-255. Its value is converted to 1e4*number. 0 means unlimited.
- order[number] - It is the same as f2f-tiny.htm of 'o'.
- unpack -------- if checked it then unpack file else pack file.
Included improved versions(Information Inheritance, Secondary Escape Estimation). It outputs program code and its demo. You can download programs from bottom button. usage is the almost the same as f2f-tiny.htm. Difference is maximum order. program No8 and No10 is 31, others are 7.
almost the same as above. difference is maximum order(255).
includes smaller codes.
Its file includes a function '_' only. _ does encoding/decoding. its size is 609 bytes. no need for above all html.
_(k,n,f)
- @k ------ Array / Uint8Array.
- @n ------ context order. range is 0-7. Not a number means 0. best balanced value is 2.
- @f ------ false means encoding. true means decoding
- return -- if @f is false, return packed @k else unpacked @k.
//compress
var c=_([109,105,115,115,105,115,115,105,112,112,105],0),
//decompress
d=_(c,0,!0)