Bit Twiddling Hacks (2005)

#1

Post by thealphanerd » Mon, Dec 15, 2014, 10:36 PM UTC

Bit Twiddling Hacks (2005)
graphics.stanford.edu

Re: Bit Twiddling Hacks (2005)

#2

Post by dang » Mon, Dec 15, 2014, 11:09 PM UTC

This has been popular over the years, but hasn't had attention on HN in a while:

https://hn.algolia.com/?q=bit+twiddling+hacks#!/story/foreve...

We put 2005 on it, though the Internet Archive says there were earlier versions.

Re: Bit Twiddling Hacks (2005)

#3

Post by aosmith » Tue, Dec 16, 2014, 2:04 AM UTC

He should pay bounties in BTC...

Re: Bit Twiddling Hacks (2005)

#4

Post by viraptor » Tue, Dec 16, 2014, 2:59 AM UTC

There's also a lot of 64-bit hacks on pages related to chess programming (8x8 boards). For example: https://chessprogramming.wikispaces.com/Bitboards

And my faviourite bit hack question on SO: https://stackoverflow.com/questions/14537831/isolate-specifi...

Re: Bit Twiddling Hacks (2005)

#5

Post by fubarred » Tue, Dec 16, 2014, 3:02 AM UTC

Neat. Also here's some other sources beyond the usual CS bookshelf suspects:

http://www.hackersdelight.org/

http://www.inwap.com/pdp10/hbaker/hakmem/hakmem.html

(We recently had to grab the C standards in order to bust out some integer under/overflow macros that wouldn't be brittle.)

Re: Bit Twiddling Hacks (2005)

#6

Post by drv » Tue, Dec 16, 2014, 3:08 AM UTC

Another resource in the same vein (it links to this page, among others):

http://aggregate.org/MAGIC/

Re: Bit Twiddling Hacks (2005)

#7

Post by new299 » Tue, Dec 16, 2014, 11:15 AM UTC

It's an awesome page.

I would guess one of the reasons it's here though is that it's almost required reading for Google interviews, #DetermineIfPowerOf2 is a particular favorite.