Anonymous function
{{short description|Function definition that is not bound to an identifier}}
In computer programming, an anonymous function (function literal, expression or block) is a function definition that is not bound to an identifier. Anonymous functions are often arguments being passed to higher-order functions or used for constructing the result of a higher-order function that needs to return a function.{{cite web |title=Higher order functions |url=http://learnyouahaskell.com/higher-order-functions |access-date=3 December 2014 |website= |publisher=learnyouahaskell.com |language=en-US}}
If the function is only used once, or a limited number of times, an anonymous function may be syntactically lighter than using a named function. Anonymous functions are ubiquitous in functional programming languages and other languages with first-class functions, where they fulfil the same role for the function type as literals do for other data types.
Anonymous functions originate in the work of Alonzo Church in his invention of the lambda calculus, in which all functions are anonymous, in 1936, before electronic computers.{{citation|title=Models of Computation: An Introduction to Computability Theory|series=Undergraduate Topics in Computer Science|first=Maribel|last=Fernandez|publisher=Springer Science & Business Media|year=2009|isbn=9781848824348|page=33|url=https://books.google.com/books?id=FPFsnzzebhQC&pg=PA33|quote=The Lambda calculus ... was introduced by Alonzo Church in the 1930s as a precise notation for a theory of anonymous functions}} In several programming languages, anonymous functions are introduced using the keyword lambda, and anonymous functions are often referred to as lambdas or lambda abstractions. Anonymous functions have been a feature of programming languages since Lisp in 1958, and a growing number of modern programming languages support anonymous functions.
{{toclimit|3}}
Names
The names "lambda abstraction", "lambda function", and "lambda expression" refer to the notation of function abstraction in lambda calculus, where the usual function {{math|1={{itco|f}}(x) = M}} would be written {{math|1=(λx.{{itco|M}})}}, and where {{mvar|M}} is an expression that uses {{mvar|x}}. Compare to the Python syntax of
The name "arrow function" refers to the mathematical "maps to" symbol, {{math|x ↦ M}}. Compare to the JavaScript syntax of
Uses
{{Unreferenced Section|date=February 2018}}
Anonymous functions can be used for containing functionality that need not be named and possibly for short-term use. Some notable examples include closures and currying.
The use of anonymous functions is a matter of style. Using them is never the only way to solve a problem; each anonymous function could instead be defined as a named function and called by name. Anonymous functions often provide a briefer notation than defining named functions. In languages that do not permit the definition of named functions in local scopes, anonymous functions may provide encapsulation via localized scope, however the code in the body of such anonymous function may not be re-usable, or amenable to separate testing. Short/simple anonymous functions used in expressions may be easier to read and understand than separately defined named functions, though without a descriptive name they may be more difficult to understand.
In some programming languages, anonymous functions are commonly implemented for very specific purposes such as binding events to callbacks or instantiating the function for particular values, which may be more efficient in a Dynamic programming language, more readable, and less error-prone than calling a named function.
The following examples are written in Python 3.
= Sorting =
When attempting to sort in a non-standard way, it may be easier to contain the sorting logic as an anonymous function instead of creating a named function.
Most languages provide a generic sort function that implements a sort algorithm that will sort arbitrary objects.
This function usually accepts an arbitrary function that determines how to compare whether two elements are equal or if one is greater or less than the other.
Consider this Python code sorting a list of strings by length of the string:
>>> a = ['house', 'car', 'bike']
>>> a.sort(key=lambda x: len(x))
>>> a
['car', 'bike', 'house']
The anonymous function in this example is the lambda expression:
lambda x: len(x)
The anonymous function accepts one argument, x, and returns the length of its argument, which is then used by the sort() method as the criteria for sorting.
Basic syntax of a lambda function in Python is
lambda arg1, arg2, arg3, ...:
The expression returned by the lambda function can be assigned to a variable and used in the code at multiple places.
>>> add = lambda a: a + a
>>> add(20)
40
Another example would be sorting items in a list by the name of their class (in Python, everything has a class):
>>> a = [10, 'number', 11.2]
>>> a.sort(key=lambda x: x.__class__.__name__)
>>> a
[11.2, 10, 'number']
Note that 11.2 has class name "float", 10 has class name "int", and 'number' has class name "str". The sorted order is "float", "int", then "str".
=Closures=
{{Main|Closure (computer programming)}}
Closures are functions evaluated in an environment containing bound variables. The following example binds the variable "threshold" in an anonymous function that compares the input to the threshold.
def comp(threshold):
return lambda x: x < threshold
This can be used as a sort of generator of comparison functions:
>>> func_a = comp(10)
>>> func_b = comp(20)
>>> print(func_a(5), func_a(8), func_a(13), func_a(21))
True True False False
>>> print(func_b(5), func_b(8), func_b(13), func_b(21))
True True True False
It would be impractical to create a function for every possible comparison function and may be too inconvenient to keep the threshold around for further use. Regardless of the reason why a closure is used, the anonymous function is the entity that contains the functionality that does the comparing.
=Currying=
{{Main|currying}}
Currying is the process of changing a function so that rather than taking multiple inputs, it takes a single input and returns a function which accepts the second input, and so forth. In this example, a function that performs division by any integer is transformed into one that performs division by a set integer.
>>> def divide(x, y):
... return x / y
>>> def divisor(d):
... return lambda x: divide(x, d)
>>> half = divisor(2)
>>> third = divisor(3)
>>> print(half(32), third(32))
16.0 10.666666666666666
>>> print(half(40), third(40))
20.0 13.333333333333334
While the use of anonymous functions is perhaps not common with currying, it still can be used. In the above example, the function divisor generates functions with a specified divisor. The functions half and third curry the divide function with a fixed divisor.
The divisor function also forms a closure by binding the variable d.
=Higher-order functions=
A higher-order function is a function that takes a function as an argument or returns one as a result. This is commonly used to customize the behavior of a generically defined function, often a looping construct or recursion scheme. Anonymous functions are a convenient way to specify such function arguments. The following examples are in Python 3.
==Map==
{{Main|Map (higher-order function)}}
The map function performs a function call on each element of a list. The following example squares every element in an array with an anonymous function.
>>> a = [1, 2, 3, 4, 5, 6]
>>> list(map(lambda x: x * x, a))
[1, 4, 9, 16, 25, 36]
The anonymous function accepts an argument and multiplies it by itself (squares it). The above form is discouraged by the creators of the language, who maintain that the form presented below has the same meaning and is more aligned with the philosophy of the language:
>>> a = [1, 2, 3, 4, 5, 6]
>>> [x * x for x in a]
[1, 4, 9, 16, 25, 36]
==Filter==
{{Main|Filter (higher-order function)}}
The filter function returns all elements from a list that evaluate True when passed to a certain function.
>>> a = [1, 2, 3, 4, 5, 6]
>>> list(filter(lambda x: x % 2 == 0, a))
[2, 4, 6]
The anonymous function checks if the argument passed to it is even. The same as with map, the form below is considered more appropriate:
>>> a = [1, 2, 3, 4, 5, 6]
>>> [x for x in a if x % 2 == 0]
[2, 4, 6]
==Fold==
{{Main|Fold (higher-order function)}}
A fold function runs over all elements in a structure (for lists usually left-to-right, a "left fold", called reduce in Python), accumulating a value as it goes. This can be used to combine all elements of a structure into one value, for example:
>>> from functools import reduce
>>> a = [1, 2, 3, 4, 5]
>>> reduce(lambda x, y: x * y, a)
120
This performs
:
\left(
\left(
\left(
1 \times 2
\right)
\times 3
\right)
\times 4
\right)
\times 5
= 120.
The anonymous function here is the multiplication of the two arguments.
The result of a fold need not be one value. Instead, both map and filter can be created using fold. In map, the value that is accumulated is a new list, containing the results of applying a function to each element of the original list. In filter, the value that is accumulated is a new list containing only those elements that match the given condition.
List of languages
The following is a list of programming languages that support unnamed anonymous functions fully, or partly as some variant, or not at all.
This table shows some general trends. First, the languages that do not support anonymous functions (C, Pascal, Object Pascal) are all statically typed languages. However, statically typed languages can support anonymous functions. For example, the ML languages are statically typed and fundamentally include anonymous functions, and Delphi, a dialect of Object Pascal, has been extended to support anonymous functions, as has C++ (by the C++11 standard). Second, the languages that treat functions as first-class functions (Dylan, Haskell, JavaScript, Lisp, ML, Perl, Python, Ruby, Scheme) generally have anonymous function support so that functions can be defined and passed around as easily as other data types.
{{Expand list|date=August 2008}}
{{sticky header}}
Examples of anonymous functions
{{main|Examples of anonymous functions}}
See also
{{Portal|Computer programming}}
References
{{Reflist|30em}}
External links
- [http://www.deltics.co.nz/blog/?p=48 Anonymous Methods - When Should They Be Used?] (blog about anonymous function in Delphi)
- [http://www.takipiblog.com/2014/01/16/compiling-lambda-expressions-scala-vs-java-8/ Compiling Lambda Expressions: Scala vs. Java 8]
- [https://web.archive.org/web/20160308090330/http://webwidetutor.com/php/php-anonymous-functions-?id=12 php anonymous functions] php anonymous functions
- [http://dobegin.com/lambda-functions-everywhere/ Lambda functions in various programming languages]
- {{usurped|1=[https://web.archive.org/web/20230314153037/https://learngolangonline.com/functions Functions in Go]}}
{{Authority control}}
{{DEFAULTSORT:Anonymous Function}}
Category:Functional programming
Category:Articles with example code
Category:Articles with example C code
Category:Articles with example C++ code
Category:Articles with example C Sharp code
Category:Articles with example D code
Category:Articles with example Java code
Category:Articles with example JavaScript code
Category:Articles with example Julia code
Category:Articles with example Lisp (programming language) code
Category:Articles with example MATLAB/Octave code
Category:Articles with example PHP code
Category:Articles with example Python (programming language) code
Category:Articles with example R code
Category:Articles with example Ruby code
Category:Articles with example Scala code