✳flâneur — a map of the web's best reading

Dynamic dispatch - Wikipedia

en.wikipedia.org · 3,879 words · saved by 1 readers

In computer science, dynamic dispatch is the process of selecting which implementation of a polymorphic operation (method or function) to call at run time. It is commonly employed in, and considered a prime characteristic of, object-oriented programming (OOP) languages and systems.[1] Object-oriented systems model a problem as a set of interacting objects that enact operations referred to by name. Polymorphism is the phenomenon wherein somewhat interchangeable objects each expose an operation of the same name but possibly differing in behavior. As an example, a File object and a Database object both have a StoreRecord method that can be used to write a personnel record to storage. Their implementations differ. A program holds a reference to an object which may be either a File object or a Database object. Which one it is may have been determined by a run-time setting, and at this stage, the program may not know or care which. When the program calls StoreRecord on the object, something

Dynamic dispatch - Wikipedia Jump to content From Wikipedia, the free encyclopedia Computer science process This article is about the selection of an implementation of a polymorphic operation. For dynamic binding, see Late binding . Polymorphism Ad hoc polymorphism Function overloading Operator overloading Parametric polymorphism Generic function Generic programming Subtyping Virtual function Single and dynamic dispatch Double dispatch Multiple dispatch Predicate dispatch v t e In computer science , dynamic dispatch is the process of selecting which implementation of a polymorphic operation (

Explore this link on the map →

saved by

related reading