If you haven't bought any of Knuth's fascicles yet, this is definitely the one to get. Bitwise Tricks & Techniques

If you haven't bought any of Knuth's fascicles yet, this is definitely the one to get. "The Art of Computer Programming: Volume 4 Bitwise Tricks & Techniques Binary Decision Diagrams" Fascicle 1 Donald E. Knuth 2009 Describes basic "broadword" operations and an important class of data structures that can make computer programs run dozens - even thousands - of times faster. I started a Haskell program using bitwise operations and then discarded them thinking them to low level. I think one of the dangers of Haskell, is that I get carried away with medium and high level abstractions and think "everything" MUST be done that way. :) -- Regards, Casey

I can't compare it with Knuth's fascicle, but the FXT book (linked to
from http://www.jjj.de/fxt/) has a whole chapter on bit wizardry and
is another excellent resource along these lines.
On Wed, Nov 18, 2009 at 6:22 PM, Casey Hawthorne
If you haven't bought any of Knuth's fascicles yet, this is definitely the one to get.
"The Art of Computer Programming: Volume 4 Bitwise Tricks & Techniques Binary Decision Diagrams" Fascicle 1 Donald E. Knuth 2009
Describes basic "broadword" operations and an important class of data structures that can make computer programs run dozens - even thousands - of times faster.
I started a Haskell program using bitwise operations and then discarded them thinking them to low level.
I think one of the dangers of Haskell, is that I get carried away with medium and high level abstractions and think "everything" MUST be done that way.
:) -- Regards, Casey _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Thank you for the URL. On Wed, 18 Nov 2009 18:30:31 -0500, you wrote:
I can't compare it with Knuth's fascicle, but the FXT book (linked to from http://www.jjj.de/fxt/) has a whole chapter on bit wizardry and is another excellent resource along these lines.
On Wed, Nov 18, 2009 at 6:22 PM, Casey Hawthorne
wrote: If you haven't bought any of Knuth's fascicles yet, this is definitely the one to get.
"The Art of Computer Programming: Volume 4 Bitwise Tricks & Techniques Binary Decision Diagrams" Fascicle 1 Donald E. Knuth 2009
Describes basic "broadword" operations and an important class of data structures that can make computer programs run dozens - even thousands - of times faster.
I started a Haskell program using bitwise operations and then discarded them thinking them to low level.
I think one of the dangers of Haskell, is that I get carried away with medium and high level abstractions and think "everything" MUST be done that way.
:) -- Regards, Casey _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
_______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe -- Regards, Casey
participants (2)
-
Casey Hawthorne
-
MightyByte