i use this to debug my raster-based renderers var w = 640 var h = 480 screenres w,h,32 var a = 3.14159/4 ' start angle while inkey="" var wm = w - 1, wh = wm/2 'dependents var hm = h - 1, hh = hm/2 #define show(x,y) line ( (x), (y) ) - ( (x)+r*cos(a), (y)+r*sin(a) ), -1 var r = sqr(w*w+h*h...

i nominate srvaldez, ST_W

when I developed 'ytQSort2' it took me at least 2 days to get it working. quicksort, it would seem, is one of my achilles' heels. D. J. Peters when I run your pointer sort (latest WinFBE which uncludes fbc 1.06) it still shows Munair's version faster. Have you tried your sort with my profiler? dim s...

updated with Munair's quicksort

cool to finally see a mergesort here

nice! with the help of a video by inigo quilez "iq", and my own skills, i made an optimized sphere hit. but to use it, you'll need normalize declare property norm as d3d '' or change to function .. property d3d.norm() as d3d var s = 1 / sqr( x * x + y * y + z * z ) return d3d( s * x , s * ...

the range thing. with a 64 bit state i guess the bias is ike a needle in a haystack. for a speedy range, you've found a highly unexpected (since mod relates with division) optimization [update] haven't debugged yet with yours (have 2 tests running) Dim Shared As Ulongint x = 12, w = 0 Dim As String ...

finally got practRand working. Did a Windows restore and installed vc redist 2013. my new generator works well.

I put hi first in a lot of range-based what-have-you's b/c more often than not, lo is 0

your test code, i gather from brief glances at various threads, is a good short-term indicator of randomness.

these silly RNGs keep distracting me from my new ray tracer :-)

i'm testing the mod method on a ubyte LCG. just need "a few hours" debugging my test. i kind of already know the result but .. gotta code it ... Boom. function LCG as ubyte: const mul = 23, add = 3 static as ushort state: state = mul * state + add return state shr 8 End Function function r...

also, you could get rid of the hi (+ 1) if you change params to double

deltarho[1859] wrote:Perhaps we need to write our own Mod function if it is fast enough.

:-)

i'm having a blast with this RNG stuff

theory vs. practice. are they frozen or are they moving? (dont say yes :P)

range using modulus may fit unevenly into 2^64. the remainder goes to the least significant digits

imo you should just show them something.

acorns

always looking for ways to speed up my non-critical applications :-)