Post by: Halifax on August 05, 2006, 02:44:00 pm
Post by: rivereye on August 05, 2006, 02:45:00 pm
Post by: Halifax on August 05, 2006, 02:53:00 pm
[4,2,5,7]
[2,4,76,5]
[10,1,5,6]
[24,2,6,1]
155 Bytes
Then compressed into a list it is
{4257,24,1,5,1,156,1,261,761024}
90 Bytes
1 is a token to double numbers which a listed at the end
Post by: Dragon__lance on August 05, 2006, 04:06:00 pm
[1,2,3]
[4,5,6]
[7,8,9]
(92 bytes)
becomes "100200300400500" (the 00's represent empty spaces so you can fit 3 digit numbers)
(38 bytes)
Then when you decompress,use
:expr(sub(str,X,3->[A](A,B
just run that command through a loop,and it should work :D
Post by: Halifax on August 06, 2006, 04:10:00 am
Post by: Demon on August 06, 2006, 04:23:00 am
Post by: Halifax on August 06, 2006, 04:34:00 am
Post by: Dragon__lance on August 06, 2006, 06:12:00 am
:instring(str,'-',1
to find the location and start compressing from there.But if you want to use list compression,heres an idea.
:{100200300,400500600,700800900}->L1
:int(E-6L1(1->[A](1,3
basically use decimels to divide up the data ;)
Post by: Halifax on August 06, 2006, 06:16:00 am
Post by: kalan_vod on August 06, 2006, 08:28:00 am
Post by: DJ Omnimaga on August 06, 2006, 08:57:00 am
Post by: Demon on August 06, 2006, 09:49:00 am
Results are stored in Ans.
Imported from Graphlink (which is why you see all that odd slashed stuff.
String to List
c1-->
| CODE |
| ec1\start83P\ \comment=Single file dated Sun Aug 06 15:43:20 20 \protected=FALSE \name=ZS2L \file=D:\TISTUF~1\0PROGR~1\ZS2L.TXT Ans\->\Str1 {0\->\L\6\:0\->\X:1\->\Y ClrHome Output(1,1,"Str1NG->\L\IST: For(W,2,length(Str1 Output(1,14,int(W/length(Str1)*100 inString("ABCDEFGHIJKLMNOPQRSTUVWXYZ\theta\ :?\^-1\^\^2\,()/789*456-123+0.\(-54125+)\\^3\!=\!=\>\>=\<\<=\\o\'\r\\pi\\EE\{}\e\[]\i\\dot\\cross\\box\\T\",sub(Str1,W,1 If Ans:Then X+(Ans*.01^Y\->\X Y+1\->\Y If Y=6:Then X\->\L\6\(1+dim(L\6\ DelVar X1\->\Y End:End:End If X:X\->\L\6\(1+dim(L\6\:ClrHome:L\6\ DelVar XDelVar YDelVar ZDelVar L\6\ \stop83P\c2 |
ec2
List to String
c1
-->List to String
c1
| CODE |
| ec1\start83P\ \comment=Single file dated Sun Aug 06 15:43:19 20 \protected=FALSE \name=ZL2S \file=D:\TISTUF~1\0PROGR~1\ZL2S.TXT Ans\->\L\6\:" \->\Str1 If dim(L\6\:Goto R Menu("ERR:LIST EMPTY","QUIT",X Lbl X:0:Return Lbl R ClrHome Output(1,1,"\L\IST->Str1NG: For(W,2,dim(L\6\ Output(1,12,int(W/dim(L\6\)*100 L\6\(W\->\X Repeat not(fPart(X 100fPart(round(X,2\->\Y 100X\->\X If fPart(Y) or Y<1 or Y>75:DelVar X If not(X:Then .02\->\L\6\(W:2\->\Y End Str1+sub("ABCDEFGHIJKLMNOPQRSTUVWXYZ\theta\ :?\^-1\^\^2\,()/789*456-123+0.\(-54125+)\\^3\!=\!=\>\>=\<\<=\\o\'\r\\pi\\EE\{}\e\[]\i\\dot\\cross\\box\\T\",Y,1\->\Str1 End:End:0\->\L\6\(1 ClrHome ": prgmZSTAT:Str1 DelVar Str1DelVar VDelVar W \stop83P\c2 |
ec2
Post by: kalan_vod on August 06, 2006, 10:42:00 am
@pyro_xp2k: Looks like it could be simpler, but it looks like it would work. And you may want to look at not using lbls.
Post by: Demon on August 06, 2006, 10:58:00 am
Post by: Dragon__lance on August 06, 2006, 11:04:00 am
Post by: kalan_vod on August 06, 2006, 11:14:00 am
Post by: Demon on August 06, 2006, 11:41:00 am
[[0,1,2,3,4]
[5,6,7,8,9,10]
[11,12,13,14]]
[[.35] //dimensions
[.001020304]
[.0506070809]
[.11121314]]
And maybe try to combine the rows together...
Post by: kalan_vod on August 06, 2006, 12:02:00 pm
Post by: Zeromus on August 07, 2006, 11:41:00 am
Post by: DJ Omnimaga on August 08, 2006, 12:08:00 pm
Post by: Demon on August 08, 2006, 12:20:00 pm
Post by: DJ Omnimaga on August 08, 2006, 12:37:00 pm
Post by: kalan_vod on August 08, 2006, 12:51:00 pm
Post by: DJ Omnimaga on August 08, 2006, 12:57:00 pm
Post by: Dragon__lance on August 08, 2006, 01:04:00 pm
Post by: kalan_vod on August 08, 2006, 01:11:00 pm
| QUOTE (Dragon__lance @ Aug 8 2006, 07:04 PM) |
| code! code! code! :P |
I will release the code/demo once I iron out a few more things.
Post by: Zeromus on August 09, 2006, 11:36:00 am
Post by: Halifax on August 09, 2006, 01:13:00 pm
Post by: kalan_vod on August 09, 2006, 05:09:00 pm
Post by: DJ Omnimaga on August 10, 2006, 02:18:00 am
Post by: Dragon__lance on August 10, 2006, 04:37:00 am
I have a theory about strings......
Post by: Halifax on August 10, 2006, 10:57:00 am
Post by: Dragon__lance on August 10, 2006, 01:43:00 pm
.I think i get a slightly better compression ratio than with lists,but as far as run time goes......... (damn,howd u make yours go so fast :D)All i did was every 5 characters in the string is an element.So:
[1.4,0,0]
[11.4,2,2]
Becomes:
"101.420000111.420002"
I prefix the digits with 0's,and then leave the decimel.Then i put the RunLength of the data as a prefix to everything.I"m pretty sure it could be done to run very fast...but i'm not the person to do it.I'm having problems getting a stable version up.But i have a beta compressor and decompressor :)
Decompressing is easy....but here's my theory for compressing.The only way to get a matrix into a list is via "Y="
Thus,all the user has to do is to recall the matrix in "Y1".Then via "equ->str",you can store it to a string.Then from there,just have to remove all the useless characters and reformat the elements :D
If someone could help me make a decompresor(suprisingly having some difficulties to make it go faster),that'd be great.I'll release my compressor as soon as i work out the bugs.
Post by: kalan_vod on August 10, 2006, 03:01:00 pm
Post by: Dragon__lance on August 10, 2006, 03:12:00 pm
Post by: Demon on August 12, 2006, 06:26:00 am
Post by: DJ Omnimaga on August 13, 2006, 12:14:00 pm
Post by: kalan_vod on August 13, 2006, 01:22:00 pm
| QUOTE (pyro_xp2k @ Aug 12 2006, 12:26 PM) |
| Last night (after crashing and wiping out the RAM again) I decided to make a simple matrix compressor. It's not that fast (on an 83+ anyway), but A 6x9 (659 byte) Matrix was compressed down to 64 bytes. A 16x16 (2315 bytes) 265 bytes. It's not finished yet, because I'm gonna try to make it do things like pattern matching to get even smaller than that. Hopefully I remember to /back /this/ up/. |
What would the matric contain? (dont say numbers or digits :P
) Post by: Halifax on August 13, 2006, 03:31:00 pm
Post by: DJ Omnimaga on August 14, 2006, 03:25:00 am
wow thats big compression
Post by: Demon on August 14, 2006, 11:21:00 am
| QUOTE | ||
What would the matric contain? (dont say numbers or digits :P ) |
Well, I guess it could be a map or something, but right now, the numbers can only be from 0 to 99 unless I find out what every single 1-byte token is that GraphLink will display and save.
But my compressor rocks now because it is no longer only a matrix compressor, it comresses lists, too, and then you have the option to even compress the string the list or matrix is converted to. You you can take, say a 32x32 matrix with mostly zeros and some ones (maybe a map with a wall, but only a few obsticles in a middle), and compress it down to a 2- to 6-something byte string! And the compressor/expander will automatically determine wheter a string you give it is just a normal string, is compressed data, or is "supercompressed", and will determine wheter it is a list or a matrix.
Post by: kalan_vod on August 14, 2006, 12:22:00 pm
| QUOTE (pyro_xp2k @ Aug 14 2006, 05:21 PM) | ||||
Well, I guess it could be a map or something, but right now, the numbers can only be from 0 to 99 unless I find out what every single 1-byte token is that GraphLink will display and save. But my compressor rocks now because it is no longer only a matrix compressor, it comresses lists, too, and then you have the option to even compress the string the list or matrix is converted to. You you can take, say a 32x32 matrix with mostly zeros and some ones (maybe a map with a wall, but only a few obsticles in a middle), and compress it down to a 2- to 6-something byte string! And the compressor/expander will automatically determine wheter a string you give it is just a normal string, is compressed data, or is "supercompressed", and will determine wheter it is a list or a matrix. |
Sounds nice, but I am unsure who your audience is? Also, I have targeted toward those who use xLIB. I am hoping you aren't taking this as a challenge....
Post by: Demon on August 14, 2006, 12:43:00 pm
o.o
:lol:
:P:DAs for the challenge... maybe I subconsiously thought it was, but consiously, I just wanted to make something potentially useful for somebody (and myself).
Post by: Dragon__lance on August 15, 2006, 03:53:00 am
The one major thing that i would look for in the compression is Speed,not Size.Speed is more important for me,and i'd like to see who can get out the fastest compressor! :D
Post by: DJ Omnimaga on August 15, 2006, 09:44:00 am
(uhm was this idea suggested a few page ago anyway?)
Post by: Demon on August 15, 2006, 11:18:00 am
| QUOTE |
| i think his compressor is not aimed toward xlib tho |
Yep, its pure BASIC, but you can use it for what you want.
QuoteBegin
| QUOTE |
| maybe we should just start a contest and compete here |
Or maybe we can all make our own compression methods, then have a program that lets someone choose what method to compress with (and then the program can determine itself what decompressor to use). More peaceful.
Post by: DJ Omnimaga on August 15, 2006, 11:33:00 am
Post by: Dragon__lance on August 15, 2006, 11:57:00 am
Post by: Demon on August 15, 2006, 03:01:00 pm
| QUOTE (from Cemetech) |
| ...I need to find as many one-byte to[k]ens as I can find that can put put into a string, and add something that could let other people add their own compression/decompression methods/programs to it. |
I'm think I'm gonna start trying to make that a key thing in my programs is that people can add their own things to it, because, after all, if one person made programs for everyone, that only they could control (like Windows for example), the world of computing would be very boring, and not to mention, buggy as hell (also like Windows).
Post by: Halifax on August 15, 2006, 03:37:00 pm