Santa Barbara , California , U.S.A.

Now has 25 cases of Covid-19 in the city..

## Search found 5527 matches

### Re: Squares

I've got another compression formula... Now , it's just a matter of telling if a output chr() is 7 or 8 bits ??? Compresses 100,000 bytes by 84% after 100 loops : Takes about 6 to 8 seconds. Function compress_loop( chrs as string ) as string print "c inp = " ; len(chrs) ' , chrs dim as str...

- Mar 26, 2020 2:19
- Forum: General
- Topic: Corona virus simulator
- Replies:
**33** - Views:
**846**

### Re: Corona virus simulator

They need to take white cells from people that have recovered the fastest , and implant them into new infected cases...

Make a human serum like a horse serum...

Make a human serum like a horse serum...

### Re: Squares

@Dodicat Another idea... ubp = ubyte ptr ========================== v1 = ( *ubp ) : ubp+= 1 v2 = v1 mod 2 v3 = v1 mod 129 v4 = ( v2 * 100 ) + v3 outs1+= chr( v4 ) ========================= mod 2 & mod 129 solves all 256 byte values... How do you tell if v3 > 99 ??? How to undo it ?? Compresses 1...

### Yah-Zip

@Richard @Dodicat I got yet another formula that compresses.... Compresses 100,000 by 12% - 13% after 100 loops.. : Takes 4 seconds. It's a Simple Simon formula... "ubp" is a ushort ptr ===================================================================== n1 = str( *ubp ) : ubp+= 1 if len(...

### Re: Squares

Never mind!!

I forgot to include the case of n1 , being less than 2 bits... 0 or 1 , so it doesn't compress.

I've got another formula that does compress , I'll post it in a little while.... After i make sure it works...

.

I forgot to include the case of n1 , being less than 2 bits... 0 or 1 , so it doesn't compress.

I've got another formula that does compress , I'll post it in a little while.... After i make sure it works...

.

### Yah-Zip

@Richard @Dodicat ( !!~~ COMPRESSION SUCCESS ~~!! ) Maybe this will win the Hutter Prize , and get me a Nobel Prize in "Computer Science" I finally got some actual compression.... It requires 5,000,000 or more bytes to compress... less than 5,000,000 it expands... It takes about a half min...

### Yah-Zip

I need someone to check this out for me... For some reason it's compressing 70% on loop 1.. Can't figure it out... Did i finally get compression ???? ' YAH-ZIP ' ' Writen in FreeBasic for Windows ' 'Zlibrary code by Dodicat , From Scottland ' ' compress_loop() , decompress_loop by Albert Redditt Dec...

### Yah-Zip

@Dodicat @badidea I think i got it this time... if mid( outs2 , a , 1 ) = "0" then you pull a value from outs1 ( 0 , 1 , 2 ) if mid( outs2 , a , 1 ) = "1" then you insert a "11" at that location Here's Dodicat's Zlib code doing 100,000 bytes in over 50 loops.. ( compres...

### Re: Squares

Sorry , it was a badidea!!

### Yah-Zip ( Alter Bin )

@Richard @Dodicat I think I've finally done it... Compresses 100,000 bytes in by 80+% after 100 loops : Takes about 4 to 10 seconds... ( I need some help with the decompression... ) =================================== bits = character string converted to binary. n1 = mid( bits , a , 6 ) s1 = 0 if n1...

### Re: Squares

@angros47 Hutter with an udder.. I'd like to win that prize!!! One thought.. If you bring in a byte , input = bin( str[ 0 ] ) , The input has to start with a 1 unless the byte is 0 So you can lose the first bit... But if that first bit is followed by 0's then you don't know how many zeros to add bac...

### Re: Squares

@Dodicat

Never mind....

If v1 <= v2 then the output is normal v1 + v2

if v1 > v2 then the output is v1 + ( v1 - v2 )

if v2 = 0 then outputs = v1 , ( v1 - v2 ) It comes out to an equate.. like the first case.. no way to solve it..

Never mind....

If v1 <= v2 then the output is normal v1 + v2

if v1 > v2 then the output is v1 + ( v1 - v2 )

if v2 = 0 then outputs = v1 , ( v1 - v2 ) It comes out to an equate.. like the first case.. no way to solve it..

### Yah-Zip ( Test Bed )

@Dodicat I altered it some.....Now it only compresses 100,000 bytes in by 64% after 100 loops. : takes about 20 seconds =================================================== n1 = mid( bits , a , 8 ) v1 = val( "&B" + mid( n1 , 1 , 4 ) ) v2 = val( "&B" + mid( n1 , 5 , 4 ) ) i...

### Yah-Zip ( Test Bed )

@Dodicat I've got another formula that compresses... Compresses 100,000 bytes in by 98% after 100 loops.. I've got to figure out where to add and where to subtract... Got to solve the yellow values. Here's the "Test Bed" where i write the decompression... Declare Function compress_loop( ch...