Thread: quick log lookup table

I'm happy that you all had so much fun with this.

Imalc: clearly that code is correct and fast, but for this project I'd rather stick to a lookup table that can be understood immediately, particularly since it's faster anyway. I was only wondering if there was a nicer syntax to initialize the array. As to "the original code using logs", that was never the original code; I only mentioned it as an example of what I didn't want to do so people wouldn't suggest it.

phantomotap: I've been meaning to ask you, where did you find that "LL" type suffix? I've never seen that before and can't find it documented anywhere.

Perhaps, I wasn't [...] I imagine.

True enough, but the binary search variant would probably be faster in any case than the version you posted. Unless the processor had crappy branching in which case it would probably still be the array variant. Unless he was shooting for vectorization which would almost certainly work better with your posted variant. Unless...

*shrug*

Yea, I know that the fastest version depends on a lot. I wasn't trying to harp on you or anything for posting a link to the "Bit Twiddling" page. It is a good page to study with or without the need for a fast binary logarithm. I was... let's just say I was giving props to the OP for coming up with a good solution on his own.

Soma

Thanks, it was clear from the context that "long long" is the intended meaning. The "L", "U" and "F" suffixes can be found in K&R and elsewhere but I've never seen "LL" and couldn't find it mentioned anywhere.

I did finally find it this morning and in the process found a couple of good reference links -- nothing new to some of you but students may want to bookmark these:
http://www.linuxtopia.org/online_boo...ion/index.html
http://www.open-std.org/JTC1/SC22/WG...docs/n1256.pdf
http://msdn.microsoft.com/en-us/libr...k5(VS.80).aspx