A few other examples of table lookups appear in other sections of the book. They're used in the course of discussing other techniques, and the contexts don't emphasize the table lookups per se. Here's where you'll find them:
Looking up rates in an insurance table: Creating Loops Easily—From the Inside Out
Using decision tables to replace complicated logic: "Use decision tables to replace complicated conditions" in Boolean Expressions.
Cost of memory paging during a table lookup: Kinds of Fat and Molasses
Combinations of boolean values (A or B or C): "Substitute Table Lookups for Complicated Expressions" in Logic
Precomputing values in a loan repayment table: Expressions.
Table-Driven Methods
Have you considered table-driven methods as an alternative to complicated logic?
Have you considered table-driven methods as an alternative to complicated inheritance structures?
Have you considered storing the table's data externally and reading it at run time so that the data can be modified without changing code?
If the table cannot be accessed directly via a straightforward array index (as in the age example), have you put the access-key calculation into a routine rather than duplicating the index calculation in the code?
3.137.223.190