CODE |
ec1/matrix data - 16x24 19.1 19.1 19.1 19.1 19.1 19.1 19.1 19.1 19.1 19.1 19.1 19.1 19.1 19.1 19.1 19.1 19.1 19.1 19.1 19.1 19.1 19.1 19.1 19.1 19.1 8 8 8 8 8 8 8 8 8 8 8 8 8 22.2 33.2 8 8 8 8 8 8 8 19.1 19.1 8 8 8 8 8 8 19.1 8 8 8 8 8 8 8 8 8 8 8 34.2 21.2 8 8 19.1 19.1 8 19.1 8 8 8 8 19.1 8 8 8 8 8 8 8 8 8 8 8 22.2 33.2 8 8 19.1 19.1 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 19.1 19.1 8 8 8 18.2 18.2 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 19.1 19.1 8 8 8 8 8 8 8 34.2 15.2 15.2 15.2 15.2 15.2 15.2 21.2 8 8 8 8 8 8 8 19.1 19.1 8 8 8 8 8 8 8 20.2 8 8 19.1 8 8 8 20.2 8 8 8 8 8 8 8 19.1 19.1 8 8 8 8 8 8 8 20.2 8 8 8 19.1 8 8 20.2 8 8 8 8 8 8 8 19.1 19.1 8 8 8 8 8 8 8 22.2 15.2 15.2 15.2 15.2 15.2 15.2 33.2 8 8 8 8 8 8 8 19.1 19.1 8 8 8 8 18.2 8 8 8 8 8 8 8 8 8 8 8 8 13.2 8 8 8 8 19.1 19.1 8 8 8 8 18.2 18.2 8 8 8 8 8 8 8 8 8 8 13.2 13.2 8 8 8 8 19.1 19.1 8 18.2 18.2 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 13.2 13.2 8 8 19.1 19.1 8 8 18.2 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 13.2 8 8 8 19.1 19.1 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 19.1 19.1 19.1 19.1 19.1 19.1 19.1 19.1 19.1 19.1 19.1 19.1 19.1 19.1 19.1 19.1 19.1 19.1 19.1 19.1 19.1 19.1 19.1 19.1 19.1→[A]c2 |
CODE |
ec1/Once converted {16,24,25.191,13.08,1.222,1.332,7.08,2.191,6.08,1.191,11.08,1.342,1.212 ,2.08,2.191,1.08,1.191,4.08,1.191,11.08,1.222,1.332,2.08,2.191,22.08,2.191 ,3.08,2.182,17.08,2.191,7.08,1.342,6.152,1.212,7.08,2.191,7.08,1.202,2.08 ,1.191,3.08,1.202,7.08,2.191,7.08,1.202,3.08,1.191,2.08,1.202,7.08,2.191 ,7.08,1.222,6.152,1.332,7.08,2.191,4.08,1.182,12.08,1.132,4.08,2.191,4.08 ,2.182,10.08,2.132,4.08,2.191,1.08,2.182,15.08,2.132,2.08,2.191,2.08,1.182 ,15.08,1.132,3.08,2.191,22.08,25.191→L1c2 |
CODE |
ec12.191 {16,24,25.191,13.08,1.222,1.332,7.08,Ans,6.08,1.191,11.08,1.342,1.212,2.08 ,Ans,1.08,1.191,4.08,1.191,11.08,1.222,1.332,2.08,Ans,22.08,Ans,3.08,2.182 ,17.08,Ans,7.08,1.342,6.152,1.212,7.08,Ans,7.08,1.202,2.08,1.191,3.08,1.202 ,7.08,Ans,7.08,1.202,3.08,1.191,2.08,1.202,7.08,Ans,7.08,1.222,6.152,1.332 ,7.08,Ans,4.08,1.182,12.08,1.132,4.08,Ans,4.08,2.182,10.08,2.132,4.08,Ans ,1.08,2.182,15.08,2.132,2.08,Ans,2.08,1.182,15.08,1.132,3.08,Ans,22.08,25.191→L1c2 |
QUOTE (elfprince13 @ Aug 8 2006, 07:35 PM) |
I'd like to talk to you about implementing this in my uberfast scrolling routine. do you have AIM? |
QUOTE (kalan_vod @ Aug 8 2006, 08:10 PM) |
Keeping a compressed data set would be more ideal for those whom want their game playable on a 83+ (if it became that large o.o![]() This is just something I want to use, and until tr1p can add a compression routine to xLIB I will just use this. I first started this, wanting to make a ascii game (like metroid pure). I made it compress maps of metriod, and once I had it running (displaying the maps while being decompressed) it ran at the speed of what CDI had in the game. |
QUOTE (kalan_vod @ Aug 8 2006, 09:21 PM) | ||
QuoteBegin-elfprince13+Aug 8 2006, 07:35 PM-->
Yes I do, kalanvod for msn/aim. |
QUOTE (Dragon__lance @ Aug 9 2006, 10:38 AM) |
it'd work very well for games that don't load maps that often,especially big maps! Are you going to write a compressor with it Kalan_vod? :D![]() |
QUOTE (Dragon__lance @ Aug 10 2006, 05:36 PM) |
I'm still intrested in your whole technique.So if i understand correctly,the program takes Similar Run's lengths of data,and stores them into a list.Hmmmm...i wonder what the compression ration would be for a matrix with many different elements :D![]() |
QUOTE (Spellshaper @ Aug 10 2006, 11:28 AM) | ||
QuoteBegin-Dragon__lance+Aug 10 2006, 05:36 PM-->
worst case scenario: it would get bigger. |
QUOTE (Killerplayer @ Aug 15 2006, 11:43 PM) |
That compressor looks soooooo sweeeet I want it so badly :banghead:![]() ![]() |
QUOTE (xlibman @ Aug 19 2006, 07:56 AM) |
hehe I understand the feeling, btw does pure use compression? |
QUOTE (xlibman @ 12 Sep, 2006, 7:31) |
i doubt it is really that hard to use, but i dunno since i never played it. I think lolje should use it for AOCII maps :)![]() |
QUOTE (xlibman @ 13 Sep, 2006, 7:28) |
no he didnt i just said he should ^^ |