Hacker's Delight

前表紙
Addison-Wesley Professional, 2003 - 306 ページ
"This is the first book that promises to tell the deep, dark secrets of computer arithmetic, and it delivers in spades. It contains every trick I knew plus many, many more. A godsend for library developers, compiler writers, and lovers of elegant hacks, it deserves a spot on your shelf right next to Knuth." --Josh Bloch "When I first saw the title, I figured that the book must be either a cookbook for breaking into computers (unlikely) or some sort of compendium of little programming tricks. It's the latter, but it's thorough, almost encyclopedic, in its coverage." --Guy Steele These are the timesaving techniques relished by computer hackers--those devoted and persistent code developers who seek elegant and efficient ways to build better software. The truth is that much of the computer programmer's job involves a healthy mix of arithmetic and logic. In Hacker's Delight , veteran programmer Hank Warren shares the tricks he has collected from his considerable experience in the worlds of application and system programming. Most of these techniques are eminently practical, but a few are included just because they are interesting and unexpected. The resulting work is an irresistible collection that will help even the most seasoned programmers better their craft. Topics covered include: A broad collection of useful programming tricks Small algorithms for common tasks Power-of-2 boundaries and bounds checking Rearranging bits and bytes Integer division and division by constants Some elementary functions on integers Gray code Hilbert's space-filling curve And even formulas for prime numbers! This book is for anyone who wants to create efficient code. Hacker's Delight will help you learn to program at a higher level--well beyond what is generally taught in schools and training courses--and will advance you substantially further than is possible through ordinary self-study alone. 0201914654B06272002
 

目次

III
1
IV
4
V
11
VII
15
VIII
16
IX
17
X
18
XI
19
LIII
156
LIV
157
LV
160
LVI
168
LVII
171
LVIII
173
LIX
178
LX
180

XIII
20
XV
21
XVI
26
XVII
33
XVIII
34
XX
35
XXI
36
XXII
37
XXIII
38
XXIV
41
XXVI
45
XXVII
46
XXVIII
49
XXIX
51
XXX
54
XXXI
58
XXXII
65
XXXIII
74
XXXIV
77
XXXV
84
XXXVI
91
XXXVIII
96
XXXIX
101
XL
106
XLI
108
XLII
116
XLIII
122
XLIV
127
XLV
129
XLVI
132
XLVII
133
XLVIII
137
XLIX
140
L
145
LI
148
LII
155
LXI
183
LXII
184
LXIII
188
LXV
189
LXVI
190
LXVII
198
LXVIII
203
LXIX
211
LXX
212
LXXI
215
LXXII
223
LXXIII
230
LXXIV
232
LXXV
233
LXXVI
235
LXXVII
237
LXXVIII
239
LXXX
241
LXXXI
244
LXXXII
250
LXXXIII
252
LXXXIV
255
LXXXVI
256
LXXXVII
259
LXXXVIII
261
LXXXIX
262
XC
265
XCI
269
XCIII
271
XCIV
277
XCV
278
XCVI
285
XCVII
289
XCVIII
291
XCIX
297
著作権

他の版 - すべて表示

多く使われている語句

人気のある引用

293 ページ - Reingold, Edward M., Nievergelt, Jurg, and Deo, Narsingh. Combinatorial Algorithms: Theory and Practice, Prentice-Hall Inc., Englewood Cliffs, New Jersey, 1977.

著者について (2003)

Henry S. Warren, Jr., has had a forty-year career with IBM, spanning from the IBM 704 to the PowerPC. He has worked on various military command and control systems and on the SETL project under Jack Schwartz at New York University. Since 1973 he has been with IBM's Research Division, focusing on compilers and computer architectures. Hank currently works on the Blue Gene petaflop computer project. He received his Ph.D. in computer science from the Courant Institute at New York University. 0201914654AB06272002

書誌情報