## Search found 5314 matches

### Yah-Zip

@StoneMonkey You got me thinking about the counting bits.... You count the number of set bits , then record every other bit , and then add in the last decimal digit.. ( 16 bits in , 16 bits out. ) It compresses... 16 bits input count = bit count vals1 = every other bit vals2 = right( decimal digit )...

### Re: Squares

@angros47 There are no quads dups , that start with "A0" , but there are some data sets that do start with "A0" Maybe making it "A" + left( quad 1 ) + "0~" ( "A 1 0 ~ ) then take out the "~" chrs. Maybe A + ? + 0 , probably almost never happens....

### Hex Zip

@Richard @Dodicat @StoneMonkey I got compression... Finally !! , it actually works.. The down side is ; it only compresses a small amount each loop. So it takes hours to compress 10,000,000 bytes.. The method is : Turn the input string into hex , and then search for quadruples n1 = "0000" ...

### Re: Squares

Thanks you guys.. How do you get the right answer??? cvl( str val ) is giving ( plus and minus ) I'm trying to get the positive 32 bit value.. screen 19 dim as string zeros = string( 32 , "0" ) dim as string rand1 dim as string rand2 do rand1 = chr( int( rnd * 256 ) ) + chr( int ( rnd * 25...

### Re: Squares

@Richard

How many permutations are there for "1234"

Is it 16 or 256 ??

1234

1243

1324

1342

etc... ??

Do you have a program , that can do the permutations for 4 chr()'s ??

How many permutations are there for "1234"

Is it 16 or 256 ??

1234

1243

1324

1342

etc... ??

Do you have a program , that can do the permutations for 4 chr()'s ??

### Re: Squares

My mistake..

I had outs1 + = mkl( count )

i need to make outs1 the same size as the input data.

And then split the outs1 string , and insert mkl( count ) into outs1 where it's supposed to go..

I'll fix it , and see if it still compresses..

( !~ Edited ~! )

Fixed it and it doesn't compress..

I had outs1 + = mkl( count )

i need to make outs1 the same size as the input data.

And then split the outs1 string , and insert mkl( count ) into outs1 where it's supposed to go..

I'll fix it , and see if it still compresses..

( !~ Edited ~! )

Fixed it and it doesn't compress..

### Rand-Zip

@Richard @Dodicat @StoneMonkey I got another compression technique... It's kinda slow.. You generate , rand = mkshort( random ) , and check the file , to see if it exists in the file. If rand > mkshort( 0 ) then you increment the counter. The output is ; outs1 + = mkl( count ) , from observation , t...

### Re: Squares

@StoneMonkey

Disregard the above compressor....

There's duplicates.

"1" + bin( 3 ) + "1" + bin( 3 )

32 = 1-11-1-10

70 = 1-111-1-0

Both the same... and there's other duplicates...

Disregard the above compressor....

There's duplicates.

"1" + bin( 3 ) + "1" + bin( 3 )

32 = 1-11-1-10

70 = 1-111-1-0

Both the same... and there's other duplicates...

### Yah-Zip ( 6 bit )

@Richard @Dodicat @StoneMonkey I decided to go ahead and post the code... ( Make it freeware ) "Yah-Zip.bas" Declare Function compress_loop( chrs as string ) as string Declare Function decompress_loop( chrs as string ) as string Namespace Zlibrary #inclib "zlib" Extern "C&qu...

### Re: Squares

I got the compressor doing 1,000,000 in 98 seconds.. ( shaved off 40 seconds ) 5,000,000 takes 460 seconds ( instead of 540 ) ( shaved off 100 seconds ) Got to speed it up more.... ============================================================= What's the fastest way to get 6 bits?? Is there a faster ...

### Re: Squares

I got to find a way to speed it up.. 1,000,000 takes 130 seconds 5,000,000 takes 540 seconds 4x ( a normal song ( 3.5 to 4 minutes) *.mp3 ) 9 minutes is too long... A movie file ( 4 gigabytes ) , would take a month to compress.. Before i work on the decompression , i need to speed the compressor up...

### Re: Squares

@Richard I finally got a method that will work.. It's a simple Simon solution.. ( 0 to 63 ) I just have to hard wire the values , into the de-compressor.. I should have it done , in a couple days.. For 100 loops : Compresses 1,000 10% Compresses 10,000 90% Compresses 100,000 98% ( takes 9 to 11 seco...

### Re: Squares

@StoneMonkey

0x and x0 are solved by

if v1 < v2 then bins+= "0" else bins+= "1"

I worked out a new formula , but it takes 400 loops to get 90% compression..

0x and x0 are solved by

if v1 < v2 then bins+= "0" else bins+= "1"

I worked out a new formula , but it takes 400 loops to get 90% compression..

### Mul-Zip

@Dodicat @StoneMonkey Here's my solution... if v1 = 0 and v2 = 0 then vals = "00" : goto done if v1 = 0 and v2 = 1 then vals = "01" : goto done if v1 = 0 and v2 = 2 then vals = "02" : goto done if v1 = 0 and v2 = 3 then vals = "03" : goto done if v1 = 0 and v2...

### Re: Squares

@Dodicat

@StoneMonkey

I got a solution worked out... Just have to write the decompression , before i post..

Compresses 1,000 , 10,000 , 100,000 , 1,000,000 , all 90+% after 100 loops..

I might need some help with the decompression.. I'll try to do it on my own..

@StoneMonkey

I got a solution worked out... Just have to write the decompression , before i post..

Compresses 1,000 , 10,000 , 100,000 , 1,000,000 , all 90+% after 100 loops..

I might need some help with the decompression.. I'll try to do it on my own..