Hacker's delight (Book, 2010) [WorldCat.org]
skip to content
Hacker's delight

Hacker's delight

Author: Henry S Warren
Publisher: Boston : Addison-Wesley, 2010, ©2003.
Edition/Format:   Print book : EnglishView all editions and formats

(not yet rated) 0 with reviews - Be the first.

More like this

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...


Additional Physical Format: Online version:
Warren, Henry S.
Hacker's delight.
Boston : Addison-Wesley, ©2003
Online version:
Warren, Henry S.
Hacker's delight.
Boston : Addison-Wesley, ©2003
Online version:
Warren, Henry S.
Hacker's delight.
Boston : Addison-Wesley, ©2003
Document Type: Book
All Authors / Contributors: Henry S Warren
ISBN: 0201914654 9780201914658
OCLC Number: 702669830
Notes: Reprint. Originally puiblished 2003.
Description: xiv, 306 pages : illustrations ; 24 cm
Contents: Introduction : Notation ; Instruction set and execution time model --
Basics : Manipulating rightmost bits ; Addition combined with logical operations ; Inequalities among logical and arithmetic expressions ; Absolute value function ; Sign extension ; Shift right signed from unsigned ; Sign function ; Three-valued compare function ; Transfer of sign ; Decoding a "zero mean 2**n" field ; Comparison predicates ; Overflow detection ; Condition code result of add, subtract, and multiply ; Rotate shifts ; Double-length add/subtract ; Double-length shifts ; Multibyte add, subtract, absolute value ; Doz, max, min ; Exchanging registers ; Alternating among two or more values --
Power-of-2 boundaries : Rounding up/down to a multiple of a known power of 2 ; Rounding up/down to the next power of 2 ; Detecting a power-of-2 boundary crossing --
Arithmetic bounds : Checking bounds of integers ; Propagating bounds through add's and subtract's ; Propagating bounds through logical operations --
Counting bits : Counting 1-bits ; Parity ; Counting leading 0's ; Counting trailing 0's --
Searching words : Find first 0-byte ; Find first string of 1-bits of a given length --
Rearranging bits and bytes : Reversing bits and bytes ; Shuffling bits ; Transposing a bit matrix ; Compress, or generalized extract ; General permutations, sheep and goats operation ; Rearrangements and index transformations --
Multiplication : Multiword multiplication ; High-order half of 64-bit product ; High-order product signed from/to unsigned ; Multiplication by constants --
Integer division : Preliminaries ; Multiword division ; Unsigned short division from signed division ; Unsigned long division --
Integer division by constants : Signed division by a known power of 2 ; Signed remainder from division by a known power of 2 ; Signed division and remainder by non-powers of 2 ; Signed division by divisors [greater than or equal to] 2 ; Signed division by divisors [less than or equal to] -2 ; Incorporation into a compiler ; Miscellaneous topics ; Unsigned division ; Unsigned division by divisors > 1 ; Incorporation into a compiler (unsigned) ; Miscellaneous topics (unsigned) ; Applicability to modulus and floor division ; Similar methods ; Sample magic numbers ; Exact division by constants ; Test for zero remainder after division by a constant --
Some elementary functions : Integer square root ; Integer cube root ; Integer exponentiation ; Integer logarithm --
Unusual bases for number systems : Base -2 ; Base -1 + i ; Other bases ; What is the most efficient base? --
Gray code : Gray code ; Incrementing a gray-coded integer ; Negabinary gray code ; Brief history and applications --
Hilbert's curve : A recursive algorithm for generating the Hilbert curve ; Coordinates from distance along the Hilbert curve ; Distance from coordinates on the Hilbert curve ; Incrementing the coordinates on the Hilbert curve ; Non-recursive generating algorithms ; Other space-filling curves ; Applications --
Floating-point : IEEE format ; Comparing floating-point numbers using integer operations ; The distribution of leading digits ; Table of miscellaneous values --
Formulas for primes : Introduction ; Willan's formulas ; Wormell's formula ; Formulas for other difficult functions --
Appendix A. Arithmetic tables for a 4-bit machine --
Appendix B. Newton's method.
Responsibility: Henry S. Warren, Jr.


User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...


Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.