Dispatch table

In computer science, a dispatch table is a data structure that maps a series of known actions to their corresponding code, which can later be retrieved dynamically. This structure is commonly implemented either using an associative array to directly map method names to a corresponding function pointer, or a simple array of function pointers with known indices.

Common use cases include the implementation of late binding and virtual polymorphism in object-oriented programming and the implementation of system calls.