JNKrunch (v0.2 - Postable)

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

Jayenkai	Created : 30 April 2007 Language : Blitz JNKrunch (v0.2 - Postable) Forum Postable Compression.
JNKrunch v0.2 ------------- If your original ASCII data is in a forum postable format, that is containing nothing more fancy than numbers, letters and the occasional plus and minus, But no Spaces, then this version will compress the data so that it is then postable inside a forum. It does this by only using Letters to symbolise duplicate letters. It also inserts the occasional space into the compressed data to pad it out a bit. Due to this padding, there's a slight increase in the end result between this and the previous version. It shouldn't be too bad, though, and is only really there so that forums don't get widened by long lines of garbled data! ;JNKrunch V2 - Creates compressed data which is postable to a forum. ;(So long as the original data was also postable to a forum!) ;Now, not only should your data be nicely compressed, ;but it should also contain normal printable Ascii characters, ;AND be able to deal with the occasional linebreaks and things, inbetween. ;(So long as the linebreaks occur between different Pairs and not in the middle of a single pair!) ;Note, that this wont't compress quite as well as the original, though. ;The data below is from my Hero game. ;It's the complete level layout from Classic - Level 3, spanning 6 rooms. Original$="1111000000000220000000000000000011111111000000000002200000000000000000001111111111111111111100001111111111111111111111111111111111000L11111111111111111111000000s00000000000000000000000001111111100000000000000w0000000000000111111111100000000000000000000000000001111111100000000s0000000000000000000000011111111111111001111111111111001111111111111111111110011111111111110L111111111111100000000000000022000000b00000000111111111111s011111111111111111001111111111111111100111111111111111110011111111111000000000000000w0000220000000000111111111111111111111000011111111111111111111111111111111110000111111111111111111111m000000w0000000000000000000011111111111111111111111111111111111111111111" Print Original$ Print Len(Original$)+" bytes" Compressed$=JNKrunch(Original$) Print Compressed$ Print Len(Compressed$)+" bytes" Decompressed$=JuNKrunch(Compressed$) Print Decompressed Print Len(Decompressed$)+" bytes" DebugLog Original$ DebugLog Compressed$ DebugLog Decompressed$ Perc = (Len(compressed$)*100)/Len(decompressed$) Print "Compression : "+Perc+"% of original" 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. out$="" 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 Then n=n+1:char$=Mid$(txt$,n,1):out=out+String$(char,count) n=n+1 If n=>Len(txt$) Then fin=1 Until fin=1 Return out$ End Function --v

Comments
Tuesday, 14 June 2011, 15:12
rockford	Cheers. I thought it had to be compressed, as the data was so small, but I've never seen pure ASCII (lettering only) compression. I can't test it right now, as I'm at work, but that seems really cool. Mind if I use that?
Wednesday, 15 June 2011, 00:26
Jayenkai	That's what it's here for! Use away!!

JNKrunch (v0.2 - Postable)

Comments