4 ms·
Hah! I'm glad you replied so I can say thanks for your kind comment earlier. Thank you. And this is indeed something intentional. I continue to explore the
by RiderOfGiraffes 16y ago
Hah! I'm glad you replied so I can say thanks for your kind comment earlier.
Thank you.
And this is indeed something intentional. I continue to explore the community, as well as trying to provide value. I don't duplicate things unless I think there is genuine value, and this is (a) very old, (b) really cool, and (c) genuinely hacking.
Thanks for noticing. More details if you email me, but I've got a large backlog at the moment so won't reply immediately.
- J3L2404 16y agoYour welcome. Will do.
- Natsu 16y agoHow long is it before you can dupe something? A while back, I tried to submit a cool little list of bit hacks, only to find out that the exact same thing had been submitted years ago. I guess many people probably know about it, but it's a pretty nice list of low level bit hacks: http://graphics.stanford.edu/~seander/bithacks.html http://graphics.stanford.edu/~seander/bithacks.html
- DanielRibeiro 16y agoNot a dupe: The other thread's url: betterexplained.com/articles/understanding-quakes-fast-inverse-square-root/ This's url: betterexplained.com/articles/understanding-quakes-fast-inverse-square-root One character as difference: the final slash.
- Natsu 16y agoGood catch! I guess no one can submit that list of bit hacks ever again, unless the dupe-catcher is changed or someone figures out a way to access it from an alternate URL (the site says we're not free to mirror it, even if we're free to use the hacks).
- AlecSchueler 16y agoMaybe it'd still be seen as a dupe, but you could try http://graphics.stanford.edu/~seander/bithacks.html?dupe=1 http://graphics.stanford.edu/~seander/bithacks.html?dupe=1