Search found 88 matches
- May 30, 2018 23:01
- Forum: Tips and Tricks
- Topic: Binary data visualization with OpenGL
- Replies: 5
- Views: 1243
Re: Binary data visualization with OpenGL
Great original concept and nifty OpenGL implementation! I added the following after: #include once "GL/glu.bi" to load different files more conveniently. DIM AS STRING filename DIM AS INTEGER ff = FreeFile() SCREENRES 300, 100, 32,, &h04 PRINT INPUT " filename? ", filename IF...
- Apr 30, 2018 22:35
- Forum: Tips and Tricks
- Topic: Simple Recursive Tree Generator
- Replies: 10
- Views: 2743
Re: Simple Recursive Tree Generator
Nice generative tree generator - both code and result.
- Mar 28, 2017 22:28
- Forum: General
- Topic: Timer & Threads
- Replies: 28
- Views: 3014
Re: Timer & Threads
70 and 66.
You guys rock!
Thank you fxm for all the help and coding wisdom you give to others.
You guys rock!
Thank you fxm for all the help and coding wisdom you give to others.
- Feb 01, 2017 22:04
- Forum: Beginners
- Topic: Porting Fractal program to FB
- Replies: 7
- Views: 1088
Re: Porting Fractal program to FB
I expect some readers may have already recognized the patterns generated by ganache's and BasicCoder2's programs. The equation generates a Gumowski-Mira 'fractal', which was developed at CERN in 1980 to calculate the trajectories of sub-atomic particles. A long time ago I used FreeBASIC to generate ...
- Oct 26, 2016 17:38
- Forum: Tips and Tricks
- Topic: AES Encryption/Decryption Algorithm
- Replies: 22
- Views: 13704
Re: AES Encryption/Decryption Algorithm
csde_rats is right. I think Zamaster created this example as a prototype / proof-of-concept. IMHO, I think what he coded in 2007 is excellent - as a concept. Implementing an encryption cipher is not trivial, even when meticulously following the official specs. However, this code example is dangerous...
- Apr 06, 2015 23:04
- Forum: Tips and Tricks
- Topic: flow of fluid solver and volumen rendering
- Replies: 5
- Views: 1637
Re: flow of fluid solver and volumen rendering
Really good Joshy. The stirring smoothness and speed are impressive. OpenGL is a good move. (I believe Duke4e did a Jos Stam conversion in the forum a few years ago, which was good, but pixelated.) Processing, usually fast at graphics, can struggle with this sort of thing: http://www.openprocessing....
- Mar 10, 2015 13:46
- Forum: Linux
- Topic: Debian package FBC-1.06.0~debian7_armhf
- Replies: 11
- Views: 4440
Re: Debian package FBC-1.01~debian7_armhf
Excellent work TJF.
Perhaps this is the first Linux FreeBASIC compiler that can be installed via a package manager?
Being ARMv7, I assume this package works well on a Raspberry Pi 2 ?
If so, it might be good to mention this in your English and German documentation?
Perhaps this is the first Linux FreeBASIC compiler that can be installed via a package manager?
Being ARMv7, I assume this package works well on a Raspberry Pi 2 ?
If so, it might be good to mention this in your English and German documentation?
- Jan 19, 2015 19:19
- Forum: Projects
- Topic: FlappyFB (single source... added NintendoDS Versions)
- Replies: 29
- Views: 6543
Re: FlappyFB
What a superb clone.
I wish only that you'd chosen a 'better' game to convert ... ;)
I wish only that you'd chosen a 'better' game to convert ... ;)
- Jan 12, 2015 14:34
- Forum: Projects
- Topic: Tech Arena
- Replies: 2
- Views: 1012
Re: Tech Arena
Hello Jason,
Looks impressive in the video - fast, smooth, nice background. Just a bit dark in the foreground.
Very promising.
Looks impressive in the video - fast, smooth, nice background. Just a bit dark in the foreground.
Very promising.
- Dec 11, 2014 11:02
- Forum: Projects
- Topic: Love and Letter-bots
- Replies: 9
- Views: 2009
Re: Love and Letter-bots
Impressive and interesting program.
Did you create your data section in an ASCII art program, or do it from scratch?
Did you create your data section in an ASCII art program, or do it from scratch?
- Oct 25, 2014 15:22
- Forum: Tips and Tricks
- Topic: isometric world experiment
- Replies: 8
- Views: 2481
Re: isometric world experiment
Yes, an impressive program for its size.
- Oct 25, 2014 15:20
- Forum: Projects
- Topic: My Stream-Cipher Encryption Algorithm Project
- Replies: 7
- Views: 2074
Re: My Stream-Cipher Encryption Algorithm Project
Your site documentation is clear and neat.
The Standard Version's key size of 64-bits would bother me (re: DES cipher).
But looking at a contemporary stream cipher, Achterbahn, its lower version is only 80-bit (http://en.wikipedia.org/wiki/Achterbahn).
The Standard Version's key size of 64-bits would bother me (re: DES cipher).
But looking at a contemporary stream cipher, Achterbahn, its lower version is only 80-bit (http://en.wikipedia.org/wiki/Achterbahn).
- Oct 16, 2014 18:49
- Forum: Projects
- Topic: My Stream-Cipher Encryption Algorithm Project
- Replies: 7
- Views: 2074
Re: My Stream-Cipher Encryption Algorithm Project
Would that be Playfair? http://en.wikipedia.org/wiki/Playfair_cipher The cipher was apparently quite good for the time, but "modern computers could easily break the cipher within seconds" symmetric-key stream-cipher I believe that, generally, you would want a block cipher for file storage ...
- Sep 30, 2014 22:45
- Forum: Linux
- Topic: Can not Compile on CentOS 5.10
- Replies: 7
- Views: 2155
Re: Can not Compile on CentOS 5.10
@nymair Yes, I agree. On my CentOS 6.5 32-bit, the following enabled FBC, FBC-GCC, and GUI-executable creation: cd <extracted_directory> sudo ./install.sh -i sudo yum install gcc sudo yum install ncurses-devel.i686 libX11-devel.i686 libXext-devel.i686 libXpm-devel.i686 libXrandr-devel.i686
- Mar 31, 2014 22:57
- Forum: Beginners
- Topic: Need help speeding up division
- Replies: 12
- Views: 1233
Re: Need help speeding up division
@rollie
Yes, SHR should be the fastest way to divide by powers of 2, without resorting to ASM.
Ages ago, when I compared in FBC 0.18b (?), SHR was ~15% faster than using the equivalent division operator.
Multiplying by the reciprocal of the divisor is another way to avoid slow division.
Yes, SHR should be the fastest way to divide by powers of 2, without resorting to ASM.
Ages ago, when I compared in FBC 0.18b (?), SHR was ~15% faster than using the equivalent division operator.
Multiplying by the reciprocal of the divisor is another way to avoid slow division.