Pure Function
In computer programming, a function may be described as pure if both these statements about the function hold:
- The function always evaluates the same result value given the same argument value(s). The function result value cannot depend on any hidden information or state that may change as program execution proceeds or between different executions of the program, nor can it depend on any external input from I/O devices.
- Evaluation of the result does not cause any semantically observable side effect or output, such as mutation of mutable objects or output to I/O devices.
The result value need not depend on all (or any) of the argument values. However, it must depend on nothing other than the argument values. The function may return multiple result values and these conditions must apply to all returned values for the function to be considered pure. If an argument is call by reference it is considered to be a combination of one argument and one return value and so the argument will get overwritten; because of this call by reference will make an expression impure even if the function called is pure.
Read more about Pure Function: Pure Expressions, Impure Functions in Pure Expressions, See Also
Famous quotes containing the words pure and/or function:
“The first duty of a lecturer—to hand you after an hour’s discourse a nugget of pure truth to wrap up between the pages of your notebooks and keep on the mantlepiece for ever.”
—Virginia Woolf (1882–1941)
“If the children and youth of a nation are afforded opportunity to develop their capacities to the fullest, if they are given the knowledge to understand the world and the wisdom to change it, then the prospects for the future are bright. In contrast, a society which neglects its children, however well it may function in other respects, risks eventual disorganization and demise.”
—Urie Bronfenbrenner (b. 1917)