In computer science, a variadic function, operator, or other construct is one that accepts a variable number of arguments; that is, its arity is not fixed. Variadic constructs are commonly used in programming languages to provide flexible interfaces that can operate on varying numbers of inputs.
The term variadic is a neologism, dating back to 1936/1937.1 The term was not widely used until the 1970s.
See also
See also
- Variadic function – Function with variable number of arguments
- Variadic macro – Macro taking a varying number of arguments
- Variadic template – Templates in computer programming
- Arity – Number of arguments required by a function
References
References
- Henry S. Leonard and H. N. Goodman, A calculus of individuals. Abstract of a talk given at the Second Meeting of the Association for Symbolic Logic, held in Cambridge MA on December 28–30, 1936, [1], Journal of Symbolic Logic 2(1) 1937, 63.