JNKrunch v1.0 - BlitzCoder.net

-=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- (c) WidthPadding Industries 1987 0\|596\|0 -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=-
SoCoder -> Snippet Home -> Variables

Jayenkai	Created : 27 April 2013 Edited : 02 February 2022 System : Cross Platform JNKrunch v1.0 Compress postable ascii data to compressed postable ascii data..!
\|update\| Added PHP and Javascript implementations \|update\| JNKrunch takes a string of letters/numbers, compresses it as much as it can in a very simple way, then spits out the (hopefully) smaller result. You should find that the compressed result from all three are identical, so should be easily portable between the different versions. Function CompressedString=JNKrunch(MyString) to compress a string, and OriginalString=JuNKrunch(CompressedString) to get it back again. Couldn't really be any easier. How? JNKrunch uses bog standard piss-easy compression methods. The basic output is "Number of Repeats, Letter, Number of Repeats, Letter" and so on, until the length of the string is reached. Example, "HELLO" would be converted as 1 H, 1 E, 2 L, 1 O. 1H1E2L1O is longer than HELLO, so in this example you might as well not bother with JNKrunch. Example 2 : "AAABBBCCCDDD" would be converted to 3 A, 3 B, 3 C, 3 D 3A3B3C3D is smaller than AAABBBCCCDDD, so would be marginally useful in this scenario. Usage Best used to compress level data, where you know things are vaguely similar. For example, if you're making a level with lots of "1" floors, "0" sky, and "2" walls, you'll have a lot of repeating data. JNKrunch is fantastic for compressing things like that. Monkey Import mojo Class MyApp Extends App Field a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,u,v,w,x,y,z Method OnCreate() TestJNKrunch("My Belly is Ginormous. I eat a lot of cake.") TestJNKrunch("ABCDEFGHIJKLMNOP") TestJNKrunch("AAAAAAAABBBBBBBBCCCCCCCCCDDDDDDDDEEEEEFFFGGGGHHHHIIIIIIIIJJJJJJJ") End Method TestJNKrunch(txt$) Local txt2$,txt3$,perc%,comp,compF# DebugLog("-=-=-=-=-") DebugLog("Testing : "+txt) txt2=JNKrunch(txt) DebugLog(" JNKrunched : "+txt2) txt3=JuNKrunch(txt2) DebugLog(" JuNKrunched : "+txt3) perc=100 For n=0 To txt.Length()-1 If txt[n]<>txt3[n] Then perc=perc-1 Next DebugLog("Accuracy : "+perc) compF=Float(txt2.Length())/Float(txt.Length()) comp=Floor(compF100) DebugLog("Compression : "+comp+"%") DebugLog("-=-=-=-=-") DebugLog("") End Method JNKrunch$(ftxt$) Local fout$="" Local ftxt2$="" p=0 s=1 v=ftxt[0] For n=1 To ftxt.Length()-1 i=ftxt[n] u=s;If s>26 Then u=u+6 If i=v s=s+1 If s>52 ftxt2=ftxt2.FromChar(u+64);fout=fout+ftxt2 ftxt2=ftxt2.FromChar(v);fout=fout+ftxt2 s=1;v=i;p=p+1 If p=10 Then fout=fout+" ";p=0 Endif Endif If i<>v ftxt2=ftxt2.FromChar(u+64);fout=fout+ftxt2 ftxt2=ftxt2.FromChar(v);fout=fout+ftxt2 s=1;v=i;p=p+1 If p=10 Then fout=fout+" ";p=0 Endif Next u=s;If s>26 Then u=u+6 ftxt2=ftxt2.FromChar(u+64);fout=fout+ftxt2 ftxt2=ftxt2.FromChar(v);fout=fout+ftxt2 Return fout End Method JuNKrunch$(ftxt$) Local fout$="" Local ftxt2$="" n=0 f=0 Repeat d=0 c=ftxt[n] s=c-64 If c>90 Then s=c-70 If c<65 Or c>122 Then d=1 If d=0 n=n+1 ftxt2=ftxt2.FromChar(ftxt[n]) For m=1 To s fout=fout+ftxt2 Next Endif n=n+1 If n>=ftxt.Length() Then f=1 Until f=1 Return fout End End Function Main() New MyApp End --v BlitzMax TestJNKrunch("My Belly is Ginormous. I eat a lot of cake.") TestJNKrunch("ABCDEFGHIJKLMNOP") TestJNKrunch("AAAAAAAABBBBBBBBCCCCCCCCCDDDDDDDDEEEEEFFFGGGGHHHHIIIIIIIIJJJJJJJ") Function TestJNKrunch(txt$) DebugLog("-=-=-=-=-") DebugLog("Testing : "+txt$) txt2$=JNKrunch(txt$) DebugLog(" JNKrunched : "+txt2$) txt3$=JuNKrunch(txt2$) DebugLog(" JuNKrunched : "+txt3$) perc=100 For n=1 To Len(txt$) If Mid$(txt$,n,1)<>Mid$(txt3$,n,1) Then perc=perc-1 Next DebugLog("Accuracy : "+perc) compF#=Float(Len(txt2$))/Float(Len(txt$)) comp=Floor(compF100) DebugLog("Compression : "+comp+"%") DebugLog("-=-=-=-=-") DebugLog("") End Function Function JNKrunch$(txt$) 'Compresses ascii data To smaller data. 'Note, this only really works If there's lots of repetition in the data. 'If there isn't, it's probably going to make things worse. 'It's the basic of basic compression methods. 'Take the word "Hello" 'it would be changed To "H1e1l2o1", that is 1 H, 1 e, 2 l's and 1 o '"Hello"=5, "1H1e2l1o"=8, Not very good. But '"Weeeeeeeeeeee!"=14, "1W12e1!"=7, is better! 'On average, we should be able To compress things quite well. out$="" Pairs=0 count=1 char=Asc(Mid$(txt$,1,1)) For n=2 To Len(txt$) i=Asc(Mid$(txt$,n,1)) showcount=count;If count>26 Then showcount=showcount+6 If i=char Then count=count+1;If count>52 Then out=out+Chr$(showcount+64)+Chr$(char);count=1;char=i;Pairs=Pairs+1;If Pairs=10 Then out=out+" ";Pairs=0 If i<>char Then out=out+Chr$(showcount+64)+Chr$(char);count=1;char=i;Pairs=Pairs+1;If Pairs=10 Then out=out+" ";Pairs=0 Next showcount=count;If count>26 Then showcount=showcount+6 out=out+Chr$(showcount+64)+Chr$(char) Return out$ End Function Function JuNKrunch$(txt$) 'This throws your original text back out. 'Nice And simple. BigData$="" n=1 fin=0 Repeat donot=0 c=Asc(Mid$(txt$,n,1)) count=c-64 If c>90 Then count=c-(70) If c<65 Or c>122 Then donot=1 If donot=0 n=n+1; char$=Mid$(txt$,n,1); ' DebugLog count+":"+char ftxt$="" For ee=1 To count ftxt$=ftxt$+char$ Next bigdata$=bigdata$+ftxt$ ' DebugLog ee+":"+n+":"+Len(txt$)+":"+Len(BigData$) EndIf n=n+1 If n=>Len(txt$) Then fin=1 Until fin=1 Return bigdata$ End Function --v Blitz2D/3D/Plus TestJNKrunch("My Belly is Ginormous. I eat a lot of cake.") TestJNKrunch("ABCDEFGHIJKLMNOP") TestJNKrunch("AAAAAAAABBBBBBBBCCCCCCCCCDDDDDDDDEEEEEFFFGGGGHHHHIIIIIIIIJJJJJJJ") Function TestJNKrunch(txt$) DebugLog("-=-=-=-=-") DebugLog("Testing : "+txt$) txt2$=JNKrunch(txt$) DebugLog(" JNKrunched : "+txt2$) txt3$=JuNKrunch(txt2$) DebugLog(" JuNKrunched : "+txt3$) perc=100 For n=1 To Len(txt$) If Mid$(txt$,n,1)<>Mid$(txt3$,n,1) Then perc=perc-1 Next DebugLog("Accuracy : "+perc) compF#=Float(Len(txt2$))/Float(Len(txt$)) comp=Floor(compF*100) DebugLog("Compression : "+comp+"%") DebugLog("-=-=-=-=-") DebugLog("") End Function Function JNKrunch$(ftxt$) Local fout$="" Local ftxt2$="" p=0 s=1 v=Asc(Mid$(ftxt,1,1)) For n=1 To Len(ftxt)-1 i=Asc(Mid$(ftxt,n+1,1)) u=s:If s>26 Then u=u+6 If i=v s=s+1 If s>52 ftxt2=Chr$(u+64):fout=fout+ftxt2 ftxt2=Chr$(v):fout=fout+ftxt2 s=1:v=i:p=p+1 If p=10 Then fout=fout+" ":p=0 EndIf EndIf If i<>v ftxt2=Chr$(u+64):fout=fout+ftxt2 ftxt2=Chr$(v):fout=fout+ftxt2 s=1:v=i:p=p+1 If p=10 Then fout=fout+" ":p=0 EndIf Next u=s:If s>26 Then u=u+6 ftxt2=Chr$(u+64):fout=fout+ftxt2 ftxt2=Chr$(v):fout=fout+ftxt2 Return fout End Function Function JuNKrunch$(ftxt$) Local fout$="" Local ftxt2$="" n=0 f=0 Repeat d=0 c=Asc(Mid$(ftxt,n+1,1)) s=c-64 If c>90 Then s=c-70 If c<65 Or c>122 Then d=1 If d=0 n=n+1 ftxt2=Chr$(Asc(Mid$(ftxt,n+1,1))) For m=1 To s fout=fout+ftxt2 Next EndIf n=n+1 If n>=Len(ftxt) Then f=1 Until f=1 Return fout End Function --v PHP function JNKrunch($ftxt) { $fout=""; $ftxt2=""; $p=0; $s=1; $v=ord($ftxt[0]); for($n=1;$n<strlen($ftxt);$n++) { $i=ord($ftxt[$n]); $u=$s; if ($s>26) {$u=$u+6;} if ($i==$v) { $s=$s+1; if ($s>52) { $ftxt2=chr($u+64);$fout=$fout.$ftxt2; $ftxt2=chr($v);$fout=$fout.$ftxt2; $s=1;$v=$i;$p=$p+1; if ($p==10) {$fout=$fout." ";$p=0;} } } if ($i!=$v) { $ftxt2=chr($u+64);$fout=$fout.$ftxt2; $ftxt2=chr($v);$fout=$fout.$ftxt2; $s=1;$v=$i;$p=$p+1; if ($p==10) {$fout=$fout." ";$p=0;} } } $u=$s;if ($s>26) {$u=$u+6;} $ftxt2=chr($u+64);$fout=$fout.$ftxt2; $ftxt2=chr($v);$fout=$fout.$ftxt2; return $fout; } function JuNKrunch($ftxt) { $fout=""; $ftxt2=""; $n=0; $f=0; while ($f==0) { $d=0; $c=ord($ftxt[$n]); $s=$c-64; if ($c>90) {$s=$c-70;} if ($c<65 \|\| $c>122) {$d=1;} if ($d==0) { $n=$n+1; $ftxt2=$ftxt[$n]; for ($m=0;$m<$s;$m++) {$fout=$fout.$ftxt2;} } $n=$n+1; if ($n>=strlen($ftxt)) {$f=1;} } return $fout; } --v Javascript function JNKrunch(ftxt) { var fout=""; var ftxt2=""; var fp=0; var fs=1; var fi=0; var fv=ftxt.charCodeAt(0); for (fn=1;fn<ftxt.length;fn++) { fi=ftxt.charCodeAt(fn); fu=fs;if (fs>26) {fu+=6;} if (fi==fv) { fs++; if (fs>52) { ftxt2=String.fromCharCode(fu+64);fout=fout+ftxt2; ftxt2=String.fromCharCode(fv);fout=fout+ftxt2; fs=1;fv=fi;fp++; if (fp==10) {fout=fout+" ";fp=0;} } } if (fi!=fv) { ftxt2=String.fromCharCode(fu+64);fout=fout+ftxt2; ftxt2=String.fromCharCode(fv);fout=fout+ftxt2; fs=1;fv=fi;fp++; if (fp==10) {fout=fout+" ";fp=0;} } } fu=fs;if (fs>26) {fu+=6;} ftxt2=String.fromCharCode(fu+64);fout=fout+ftxt2; ftxt2=String.fromCharCode(fv);fout=fout+ftxt2; return fout; } function JuNKrunch(ftxt) { var fout=""; var ftxt2=""; var fn=0; var ff=0; var fd=0; var fc=0; var fs=0; while (ff==0) { fd=0; fc=ftxt.charCodeAt(fn); fs=fc-64; if (fc>90) {fs=fc-70;} if (fc<65 \|\| fc>122) {fd=1;} if (fd==0) { fn++; ftxt2=ftxt[fn]; for (fm=0;fm<fs;fm++) { fout=fout+ftxt2; } } fn++; if (fn>=ftxt.length) {ff=1;} } return fout; } --v Let me know if you need any further conversions of this function.

Comments
Sunday, 21 August 2016, 07:34
spinal	I don't suppose there's a C version knocking about?
Sunday, 21 August 2016, 07:37
Jayenkai	Nope! But feel free to post it when you're done 3 sources to choose from, should be easy enough.
Sunday, 21 August 2016, 08:13
spinal	Will do, not yet though, gotta play some Wii games!
Sunday, 21 August 2016, 08:26
Jayenkai	Needs to be done!!
Sunday, 21 August 2016, 12:02
spinal	Not fully tested, but it looks right, JuNKrunch only though (thats all I need) c# public string JuNKrunch(string passString){ string fout = ""; string ftxt2 = ""; int n = 0; int f = 0; char[] ftxt = passString.ToCharArray(); while(f==0){ int d = 0; char c = ftxt[n]; int s = c - 64; if(c>90){s = c - 70;} if(c<65 \|\| c>122){d = 1;} if(d==0){ n++; for(int m = 0; m<s; m++){ fout+=ftxt[n]; } } n++; if(n>=ftxt.Length){f=1;} } return(fout); } --v
Wednesday, 02 February 2022, 06:23
Jayenkai	Updated with PHP and Javascript implementations.

Copyright Jayenkai - 2017+ | Thanks to Shroom_Monk for CSS/Dev Tips | Uses a Jay-Tweaked version of CBParser.
Page Took : 0.116

JNKrunch v1.0 - BlitzCoder.net