Download Jar. Libraryless. Click here for Pure Java version (10283L/71K).
!7 p-exp { for (S text : tlft([[ real knighthood. be a real lgkgcr real knighthood. be a real knight aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa ababababababababababababababababa abcabcabcabcabcabcabcabcabcabcabc ]])) { LineCompedSingle<Char> lc = lineComp_compressTextAsChars(text); print(renderLineCompedSingleWithBrackets(lc)); print(iround(lcRepetitiveness(lc)) + "% repetition: " + uncompressLineCompedSingle(lc)); } }
download show line numbers debug dex old transpilations
Travelled to 7 computer(s): bhatertpkbcr, mqqgnosmbjvj, pyentgdyhuwx, pzhvpgtvlbxg, tvejysmllsmz, vouqrxazstgt, xrpafgyirdlv
No comments. add comment
Snippet ID: | #1028501 |
Snippet name: | LineComp complexity measure for different strings |
Eternal ID of this version: | #1028501/1 |
Text MD5: | 62266b2c987731d9ed74921d2b944832 |
Transpilation MD5: | 8266cdf0539e87ddd424d26601f0c821 |
Author: | stefan |
Category: | javax / linecomp compression |
Type: | JavaX source code (desktop) |
Public (visible to everyone): | Yes |
Archived (hidden from active list): | No |
Created/modified: | 2020-06-23 10:29:34 |
Source code size: | 469 bytes / 15 lines |
Pitched / IR pitched: | No / No |
Views / Downloads: | 271 / 830 |
Referenced in: | -