In computer science, a lookup table is a data structure, usually an array or associative array, often used to replace a runtime computation with a simpler array indexing operation. The savings in terms of processing time can be significant, since retrieving a value from memory is often faster than undergoing an 'expensive' computation or input/output operation. The tables may be precalculated and stored in static program storage, calculated (or "pre-fetched") as part of a programs initialization phase (memoization), or even stored in hardware in application-specific platforms. Lookup tables are also used extensively to validate input values by matching against a list of valid (or invalid) items in an array and, in some programming languages, may include pointer functions (or offsets to labels) to process the matching input.
Read more about Lookup Table: History
Famous quotes containing the word table:
“But hospitality must be for service, and not for show, or it pulls down the host. The brave soul rates itself too high to value itself by the splendor of its table and draperies. It gives what it hath, and all it hath, but its own majesty can lend a better grace to bannocks and fair water than belong to city feasts.”
—Ralph Waldo Emerson (1803–1882)