Code:
#!/bin/bash
farr0=("#####" " #" "#####" "#####" "# #" "#####" "# " "#####" "#####" "#####" " #" " ")
farr1=("# #" " #"
Zacariaz
Last Activity: Jul 1 '15, 09:44 AM
Joined: Jun 15 '15
Location:
-
Small project, big headache. 7 segment display in bash
I've never been very good at bash, but usually I get things done on the rare occasion that I need to. This challenge however, is beyond me.
... -
The LZW does well, ut I thing my approach can do better, though of course only for specialized purposes.
Never the less I'll take a look at that article. I'm sure it will make for interesting reading. -
Okay, so I think I've finally come up with the perfect method of compression for this specific type of data, at least for a first pass. It is perfectly possible I think, that a second pass with some other type of compression algorithm can also be beneficial, but that's not really relevant at this point.
Firstly the uncompressed data will be split up into 256mb segments. These segments could be of a different size, but 256mb is convenient....Leave a comment:
-
Maybe this is what you're looking for?
http://math.stackexchange.com/questi...h-three-points
Also AFAIK only one amplitude is applicable for a given set of 3 points. I may be wrong though....Leave a comment:
-
it should also be noted that those =-a statements could potentially, though not likely, cause trouble. =(-a) would probably better, or at the very least some spacing.Leave a comment:
-
I suppose the real is: "Why does 64.07 * 100 not simply equal 6407?"
Well, can 64.07 be represented in binary? Let's try
2^6 + 2^-4 + 2^-8...
To be honest, there's really not point in trying, as the answer most definitely is no.
Just like you can't represent 1/3, pi, sqrt(2), in decimal, you cannot represent 64.07 and many other numbers in binary.
And since integer casts are always...Leave a comment:
-
You are of course right. If all I wanted was a command line utility to test large primes, I could certainly live with the overhead of 256 mb, but of course I can't stop there. I have to see how far I can't take it, how efficient I can make the process, how much I can compress the data, and in the end how many primes I can actually store in a reasonable amount of space.
It's nothing but a challenge, like climbing mount Everest. There's...Leave a comment:
-
If I were to store all primes as you suggest, it would amount to 203.280.221*4 bytes, or ~756 mb, or twice that if you opt for 64 bit variables. Already that's a 300% (or 600%) argument against your suggestion. Furthermore, although I cannot be sure as I know little of such things, I think that the possibility of compressing said data would be vastly reduced.
Also, the approach I'm using of generating the initial range of primes, I believe,...Leave a comment:
-
Compressing data with lots of reoccurring streams of consecutive zero bits
Hi there.
First of, this is only for the fun of it, and I have no illusions that it will ever lead anywhere. I simply want to learn and have fun while doing it.
So, I've written a small program, which calculates all primes, using a regular home brewed sieve, within the range of 32 bits, the idea being that nothing more is needed to test values within the 64 bit range.
Every odd number from 1 - 2^32 - 1...
No activity results to display
Leave a comment: