Every compiled and saved program is over 800 KB without debugger! (i still think this is due fact of the trial limited version because the compiler info window display all passes (4 and more passes are possible!).
Here is a small original blitzmax benchmark test but i havent had the time to test the same with purebasic!
Code: Select all
; ---- Blitz Max Source - Winodws ----
' Ported from another Basic for benchmarking purposes...
Const ITERATIONS = 10000
Local Flags [8191]
Print "SIEVE OF ERATOSTHENES - " + ITERATIONS + " iterations"
X = MilliSecs ()
For Iter = 1 To ITERATIONS
Count = 0
For I = 0 To 8190
Flags[I] = 1
Next
For I = 0 To 8190
If Flags[I]=1 Then
Prime = I + I
Prime = Prime + 3
K = I + Prime
While K <= 8190
Flags[K] = 0
K = K + Prime
Wend
Count = Count + 1
EndIf
Next
Next
X = MilliSecs () - X
Print "1000 iterations took "+(X/1000.0)+" seconds."
Print "Primes: "+Count
End
Code: Select all
Building bench
Compiling:bench.bmx
flat assembler version 1.51
3 passes, 2657 bytes.
Linking:bench.exe
Executing:bench.exe
SIEVE OF ERATOSTHENES - 10000 iterations
1000 iterations took 0.871999979 seconds.
Primes: 1899
Process complete
Edit:
There is a RadialBlur source (original by Nehe, Tutorial 36) as BlitzMax version included! The original c++ exe is 36.864 bytes where the blitzmax compier info window display "3 passes, 11171 bytes." :roll:
The only one i dont really like, is OGL! I preffer to use DX for Windows! (Fred, you are on the right way
