xxxxxxxxxx
In Julia, a function is an object that maps a tuple of argument values to a return value. Julia functions are not pure mathematical functions, because they can alter and be affected by the global state of the program. The basic syntax for defining functions in Julia is:
xxxxxxxxxx
Multiple definitions for f.
Combine all definitions into a single reactive cell using a `begin ... end` block.
xxxxxxxxxx
function f(x,y)
x + y
end
This function accepts two arguments x
and y
and returns the value of the last expression evaluated, which is x + y
.
xxxxxxxxxx
There is a second, more terse syntax for defining a function in Julia. The traditional function declaration syntax demonstrated above is equivalent to the following compact "assignment form":
xxxxxxxxxx
Multiple definitions for f.
Combine all definitions into a single reactive cell using a `begin ... end` block.
xxxxxxxxxx
f(x,y) = x + y
In the assignment form, the body of the function must be a single expression, although it can be a compound expression (see Compound Expressions). Short, simple function definitions are common in Julia. The short function syntax is accordingly quite idiomatic, considerably reducing both typing and visual noise.
xxxxxxxxxx
A function is called using the traditional parenthesis syntax:
xxxxxxxxxx
UndefVarError: f not defined
- top-level scope@Local: 1
xxxxxxxxxx
Without parentheses, the expression f
refers to the function object, and can be passed around like any other value:
xxxxxxxxxx
Multiple definitions for g.
Combine all definitions into a single reactive cell using a `begin ... end` block.
xxxxxxxxxx
UndefVarError: g not defined
- top-level scope@Local: 1
xxxxxxxxxx
As with variables, Unicode can also be used for function names:
xxxxxxxxxx
∑ (generic function with 1 method)
xxxxxxxxxx
5
xxxxxxxxxx
Argument Passing Behavior
xxxxxxxxxx
Julia function arguments follow a convention sometimes called "pass-by-sharing", which means that values are not copied when they are passed to functions. Function arguments themselves act as new variable bindings (new locations that can refer to values), but the values they refer to are identical to the passed values. Modifications to mutable values (such as Array
s) made within a function will be visible to the caller. This is the same behavior found in Scheme, most Lisps, Python, Ruby and Perl, among other dynamic languages.
xxxxxxxxxx
The return
Keyword
xxxxxxxxxx
The value returned by a function is the value of the last expression evaluated, which, by default, is the last expression in the body of the function definition. In the example function, f
, from the previous section this is the value of the expression x + y
. As an alternative, as in many other languages, the return
keyword causes a function to return immediately, providing an expression whose value is returned:
xxxxxxxxxx
function g(x,y)
return x * y
x + y
end
xxxxxxxxxx
Since function definitions can be entered into interactive sessions, it is easy to compare these definitions:
xxxxxxxxxx
Multiple definitions for f.
Combine all definitions into a single reactive cell using a `begin ... end` block.
xxxxxxxxxx
f(x,y) = x + y
Multiple definitions for g.
Combine all definitions into a single reactive cell using a `begin ... end` block.
xxxxxxxxxx
function g(x,y)
UndefVarError: f not defined
- top-level scope@Local: 1
xxxxxxxxxx
f(2,3)
UndefVarError: g not defined
- top-level scope@Local: 1
xxxxxxxxxx
g(2,3)
Of course, in a purely linear function body like g
, the usage of return
is pointless since the expression x + y
is never evaluated and we could simply make x * y
the last expression in the function and omit the return
. In conjunction with other control flow, however, return
is of real use. Here, for example, is a function that computes the hypotenuse length of a right triangle with sides of length x
and y
, avoiding overflow:
xxxxxxxxxx
md"""
hypot (generic function with 1 method)
xxxxxxxxxx
function hypot(x,y)
5.0
xxxxxxxxxx
hypot(3, 4)
There are three possible points of return from this function, returning the values of three different expressions, depending on the values of x
and y
. The return
on the last line could be omitted since it is the last expression.
xxxxxxxxxx
md"""
Return type
xxxxxxxxxx
A return type can be specified in the function declaration using the ::
operator. This converts the return value to the specified type.
xxxxxxxxxx
Multiple definitions for g.
Combine all definitions into a single reactive cell using a `begin ... end` block.
xxxxxxxxxx
UndefVarError: g not defined
- top-level scope@Local: 1
xxxxxxxxxx
This function will always return an Int8
regardless of the types of x
and y
. See Type Declarations for more on return types.
xxxxxxxxxx
Returning nothing
xxxxxxxxxx
For functions that do not need to return a value (functions used only for some side effects), the Julia convention is to return the value nothing
:
xxxxxxxxxx
function printx(x)
println("x = $x")
return nothing
end
xxxxxxxxxx
This is a convention in the sense that nothing
is not a Julia keyword but a only singleton object of type Nothing
. Also, you may notice that the printx
function example above is contrived, because println
already returns nothing
, so that the return
line is redundant.
xxxxxxxxxx
There are two possible shortened forms for the return nothing
expression. On the one hand, the return
keyword implicitly returns nothing
, so it can be used alone. On the other hand, since functions implicitly return their last expression evaluated, nothing
can be used alone when it's the last expression. The preference for the expression return nothing
as opposed to return
or nothing
alone is a matter of coding style.
xxxxxxxxxx
Operators Are Functions
xxxxxxxxxx
In Julia, most operators are just functions with support for special syntax. (The exceptions are operators with special evaluation semantics like &&
and ||
. These operators cannot be functions since Short-Circuit Evaluation requires that their operands are not evaluated before evaluation of the operator.) Accordingly, you can also apply them using parenthesized argument lists, just as you would any other function:
xxxxxxxxxx
6
xxxxxxxxxx
6
xxxxxxxxxx
xxxxxxxxxx
Multiple definitions for f.
Combine all definitions into a single reactive cell using a `begin ... end` block.
xxxxxxxxxx
UndefVarError: f not defined
- top-level scope@Local: 1
xxxxxxxxxx
Under the name f
, the function does not support infix notation, however.
xxxxxxxxxx
Operators With Special Names
xxxxxxxxxx
A few special expressions correspond to calls to functions with non-obvious names. These are:
xxxxxxxxxx
Expression | Calls |
---|---|
[A B C ...] | hcat |
[A; B; C; ...] | vcat |
[A B; C D; ...] | hvcat |
A' | adjoint |
A[i] | getindex |
A[i] = x | setindex! |
A.n | getproperty |
A.n = x | setproperty! |
xxxxxxxxxx
xxxxxxxxxx
Functions in Julia are first-class objects: they can be assigned to variables, and called using the standard function call syntax from the variable they have been assigned to. They can be used as arguments, and they can be returned as values. They can also be created anonymously, without being given a name, using either of these syntaxes:
xxxxxxxxxx
#1 (generic function with 1 method)
xxxxxxxxxx
#1 (generic function with 1 method)
xxxxxxxxxx
This creates a function taking one argument x
and returning the value of the polynomial x^2 + 2x - 1
at that value. Notice that the result is a generic function, but with a compiler-generated name based on consecutive numbering.
xxxxxxxxxx
The primary use for anonymous functions is passing them to functions which take other functions as arguments. A classic example is map
, which applies a function to each value of an array and returns a new array containing the resulting values:
xxxxxxxxxx
1.0
4.0
2.0
xxxxxxxxxx
This is fine if a named function effecting the transform already exists to pass as the first argument to map
. Often, however, a ready-to-use, named function does not exist. In these situations, the anonymous function construct allows easy creation of a single-use function object without needing a name:
xxxxxxxxxx
2
14
-2
xxxxxxxxxx
An anonymous function accepting multiple arguments can be written using the syntax (x,y,z)->2x+y-z
. A zero-argument anonymous function is written as ()->3
. The idea of a function with no arguments may seem strange, but is useful for "delaying" a computation. In this usage, a block of code is wrapped in a zero-argument function, which is later invoked by calling it as f
.
xxxxxxxxxx
As an example, consider this call to get
:
xxxxxxxxxx
get(dict, key) do
# default value calculated here
time()
end
xxxxxxxxxx
The code above is equivalent to calling get
with an anonymous function containing the code enclosed between do
and end
, like so:
xxxxxxxxxx
get(()->time(), dict, key)
xxxxxxxxxx
The call to time
is delayed by wrapping it in a 0-argument anonymous function that is called only when the requested key is absent from dict
.
xxxxxxxxxx
Tuples
xxxxxxxxxx
Julia has a built-in data structure called a tuple that is closely related to function arguments and return values. A tuple is a fixed-length container that can hold any values, but cannot be modified (it is immutable). Tuples are constructed with commas and parentheses, and can be accessed via indexing:
xxxxxxxxxx
1
2
xxxxxxxxxx
1
xxxxxxxxxx
Multiple definitions for x.
Combine all definitions into a single reactive cell using a `begin ... end` block.
xxxxxxxxxx
UndefVarError: x not defined
- top-level scope@Local: 1
xxxxxxxxxx
Notice that a length-1 tuple must be written with a comma, (1,)
, since (1)
would just be a parenthesized value. ()
represents the empty (length-0) tuple.
xxxxxxxxxx
Named Tuples
xxxxxxxxxx
The components of tuples can optionally be named, in which case a named tuple is constructed:
xxxxxxxxxx
Multiple definitions for x.
Combine all definitions into a single reactive cell using a `begin ... end` block.
xxxxxxxxxx
UndefVarError: x not defined
- top-level scope@Local: 1
xxxxxxxxxx
UndefVarError: x not defined
- top-level scope@Local: 1
xxxxxxxxxx
Named tuples are very similar to tuples, except that fields can additionally be accessed by name using dot syntax (x.a
) in addition to the regular indexing syntax (x[1]
).
xxxxxxxxxx
Multiple Return Values
xxxxxxxxxx
In Julia, one returns a tuple of values to simulate returning multiple values. However, tuples can be created and destructured without needing parentheses, thereby providing an illusion that multiple values are being returned, rather than a single tuple value. For example, the following function returns a pair of values:
xxxxxxxxxx
foo (generic function with 1 method)
xxxxxxxxxx
If you call it in an interactive session without assigning the return value anywhere, you will see the tuple returned:
xxxxxxxxxx
5
6
xxxxxxxxxx
A typical usage of such a pair of return values, however, extracts each value into a variable. Julia supports simple tuple "destructuring" that facilitates this:
xxxxxxxxxx
Multiple definitions for x.
Combine all definitions into a single reactive cell using a `begin ... end` block.
xxxxxxxxxx
UndefVarError: x not defined
- top-level scope@Local: 1
xxxxxxxxxx
UndefVarError: y not defined
- top-level scope@Local: 1
xxxxxxxxxx
You can also return multiple values using the return
keyword:
xxxxxxxxxx
function foo(a,b)
return a+b, a*b
end
xxxxxxxxxx
This has the exact same effect as the previous definition of foo
.
xxxxxxxxxx
Argument destructuring
xxxxxxxxxx
The destructuring feature can also be used within a function argument. If a function argument name is written as a tuple (e.g. (x, y)
) instead of just a symbol, then an assignment (x, y) = argument
will be inserted for you:
xxxxxxxxxx
julia> minmax(x, y) = (y < x) ? (y, x) : (x, y)
julia> gap((min, max)) = max - min
julia> gap(minmax(10, 2))
8
xxxxxxxxxx
Notice the extra set of parentheses in the definition of gap
. Without those, gap
would be a two-argument function, and this example would not work.
xxxxxxxxxx
Varargs Functions
xxxxxxxxxx
It is often convenient to be able to write functions taking an arbitrary number of arguments. Such functions are traditionally known as "varargs" functions, which is short for "variable number of arguments". You can define a varargs function by following the last positional argument with an ellipsis:
xxxxxxxxxx
bar (generic function with 1 method)
xxxxxxxxxx
The variables a
and b
are bound to the first two argument values as usual, and the variable x
is bound to an iterable collection of the zero or more values passed to bar
after its first two arguments:
xxxxxxxxxx
1
2
xxxxxxxxxx
1
2
3
xxxxxxxxxx
1
2
3
4
xxxxxxxxxx
1
2
3
4
5
6
xxxxxxxxxx
In all these cases, x
is bound to a tuple of the trailing values passed to bar
.
xxxxxxxxxx
It is possible to constrain the number of values passed as a variable argument; this will be discussed later in Parametrically-constrained Varargs methods.
xxxxxxxxxx
On the flip side, it is often handy to "splat" the values contained in an iterable collection into a function call as individual arguments. To do this, one also uses ...
but in the function call instead:
xxxxxxxxxx
Multiple definitions for x.
Combine all definitions into a single reactive cell using a `begin ... end` block.
xxxxxxxxxx
UndefVarError: x not defined
- top-level scope@Local: 1
xxxxxxxxxx
In this case a tuple of values is spliced into a varargs call precisely where the variable number of arguments go. This need not be the case, however:
xxxxxxxxxx
Multiple definitions for x.
Combine all definitions into a single reactive cell using a `begin ... end` block.
xxxxxxxxxx
UndefVarError: x not defined
- top-level scope@Local: 1
xxxxxxxxxx
Multiple definitions for x.
Combine all definitions into a single reactive cell using a `begin ... end` block.
xxxxxxxxxx
UndefVarError: x not defined
- top-level scope@Local: 1
xxxxxxxxxx
Furthermore, the iterable object splatted into a function call need not be a tuple:
xxxxxxxxxx
Multiple definitions for x.
Combine all definitions into a single reactive cell using a `begin ... end` block.
xxxxxxxxxx
UndefVarError: x not defined
- top-level scope@Local: 1
xxxxxxxxxx
Multiple definitions for x.
Combine all definitions into a single reactive cell using a `begin ... end` block.
xxxxxxxxxx
UndefVarError: x not defined
- top-level scope@Local: 1
xxxxxxxxxx
Also, the function that arguments are splatted into need not be a varargs function (although it often is):
xxxxxxxxxx
xxxxxxxxxx
Multiple definitions for args.
Combine all definitions into a single reactive cell using a `begin ... end` block.
xxxxxxxxxx
UndefVarError: args not defined
- top-level scope@Local: 1
xxxxxxxxxx
Multiple definitions for args.
Combine all definitions into a single reactive cell using a `begin ... end` block.
xxxxxxxxxx
UndefVarError: args not defined
- top-level scope@Local: 1
xxxxxxxxxx
As you can see, if the wrong number of elements are in the splatted container, then the function call will fail, just as it would if too many arguments were given explicitly.
xxxxxxxxxx
Optional Arguments
xxxxxxxxxx
It is often possible to provide sensible default values for function arguments. This can save users from having to pass every argument on every call. For example, the function Date(y, [m, d])
from Dates
module constructs a Date
type for a given year y
, month m
and day d
. However, m
and d
arguments are optional and their default value is 1
. This behavior can be expressed concisely as:
xxxxxxxxxx
function Date(y::Int64, m::Int64=1, d::Int64=1)
err = validargs(Date, y, m, d)
err === nothing || throw(err)
return Date(UTD(totaldays(y, m, d)))
end
xxxxxxxxxx
Observe, that this definition calls another method of the Date
function that takes one argument of type UTInstant{Day}
.
xxxxxxxxxx
With this definition, the function can be called with either one, two or three arguments, and 1
is automatically passed when only one or two of the arguments are specified:
xxxxxxxxxx
xxxxxxxxxx
2000-12-12
xxxxxxxxxx
2000-12-01
xxxxxxxxxx
2000-01-01
xxxxxxxxxx
Optional arguments are actually just a convenient syntax for writing multiple method definitions with different numbers of arguments (see Note on Optional and keyword Arguments). This can be checked for our Date
function example by calling methods
function.
xxxxxxxxxx
Keyword Arguments
xxxxxxxxxx
Some functions need a large number of arguments, or have a large number of behaviors. Remembering how to call such functions can be difficult. Keyword arguments can make these complex interfaces easier to use and extend by allowing arguments to be identified by name instead of only by position.
xxxxxxxxxx
For example, consider a function plot
that plots a line. This function might have many options, for controlling line style, width, color, and so on. If it accepts keyword arguments, a possible call might look like plot(x, y, width=2)
, where we have chosen to specify only line width. Notice that this serves two purposes. The call is easier to read, since we can label an argument with its meaning. It also becomes possible to pass any subset of a large number of arguments, in any order.
xxxxxxxxxx
Functions with keyword arguments are defined using a semicolon in the signature:
xxxxxxxxxx
function plot(x, y; style="solid", width=1, color="black")
###
end
xxxxxxxxxx
When the function is called, the semicolon is optional: one can either call plot(x, y, width=2)
or plot(x, y; width=2)
, but the former style is more common. An explicit semicolon is required only for passing varargs or computed keywords as described below.
xxxxxxxxxx
Keyword argument default values are evaluated only when necessary (when a corresponding keyword argument is not passed), and in left-to-right order. Therefore default expressions may refer to prior keyword arguments.
xxxxxxxxxx
The types of keyword arguments can be made explicit as follows:
xxxxxxxxxx
function f(;x::Int=1)
###
end
xxxxxxxxxx
Keyword arguments can also be used in varargs functions:
xxxxxxxxxx
function plot(x...; style="solid")
###
end
xxxxxxxxxx
Extra keyword arguments can be collected using ...
, as in varargs functions:
xxxxxxxxxx
function f(x; y=0, kwargs...)
###
end
xxxxxxxxxx
Inside f
, kwargs
will be an immutable key-value iterator over a named tuple. Named tuples (as well as dictionaries with keys of Symbol
) can be passed as keyword arguments using a semicolon in a call, e.g. f(x, z=1; kwargs...)
.
xxxxxxxxxx
If a keyword argument is not assigned a default value in the method definition, then it is required: an UndefKeywordError
exception will be thrown if the caller does not assign it a value:
xxxxxxxxxx
function f(x; y)
###
end
f(3, y=5) # ok, y is assigned
f(3) # throws UndefKeywordError(:y)
xxxxxxxxxx
One can also pass key => value
expressions after a semicolon. For example, plot(x, y; :width => 2)
is equivalent to plot(x, y, width=2)
. This is useful in situations where the keyword name is computed at runtime.
xxxxxxxxxx
When a bare identifier or dot expression occurs after a semicolon, the keyword argument name is implied by the identifier or field name. For example plot(x, y; width)
is equivalent to plot(x, y; width=width)
and plot(x, y; options.width)
is equivalent to plot(x, y; width=options.width)
.
xxxxxxxxxx
The nature of keyword arguments makes it possible to specify the same argument more than once. For example, in the call plot(x, y; options..., width=2)
it is possible that the options
structure also contains a value for width
. In such a case the rightmost occurrence takes precedence; in this example, width
is certain to have the value 2
. However, explicitly specifying the same keyword argument multiple times, for example plot(x, y, width=2, width=3)
, is not allowed and results in a syntax error.
xxxxxxxxxx
Evaluation Scope of Default Values
xxxxxxxxxx
When optional and keyword argument default expressions are evaluated, only previous arguments are in scope. For example, given this definition:
xxxxxxxxxx
function f(x, a=b, b=1)
###
end
xxxxxxxxxx
the b
in a=b
refers to a b
in an outer scope, not the subsequent argument b
.
xxxxxxxxxx
Do-Block Syntax for Function Arguments
xxxxxxxxxx
Passing functions as arguments to other functions is a powerful technique, but the syntax for it is not always convenient. Such calls are especially awkward to write when the function argument requires multiple lines. As an example, consider calling map
on a function with several cases:
xxxxxxxxxx
map(x->begin
if x < 0 && iseven(x)
return 0
elseif x == 0
return 1
else
return x
end
end,
[A, B, C])
xxxxxxxxxx
Julia provides a reserved word do
for rewriting this code more clearly:
xxxxxxxxxx
map([A, B, C]) do x
if x < 0 && iseven(x)
return 0
elseif x == 0
return 1
else
return x
end
end
xxxxxxxxxx
The do x
syntax creates an anonymous function with argument x
and passes it as the first argument to map
. Similarly, do a,b
would create a two-argument anonymous function, and a plain do
would declare that what follows is an anonymous function of the form () -> ...
.
xxxxxxxxxx
How these arguments are initialized depends on the "outer" function; here, map
will sequentially set x
to A
, B
, C
, calling the anonymous function on each, just as would happen in the syntax map(func, [A, B, C])
.
xxxxxxxxxx
This syntax makes it easier to use functions to effectively extend the language, since calls look like normal code blocks. There are many possible uses quite different from map
, such as managing system state. For example, there is a version of open
that runs code ensuring that the opened file is eventually closed:
xxxxxxxxxx
open("outfile", "w") do io
write(io, data)
end
xxxxxxxxxx
This is accomplished by the following definition:
xxxxxxxxxx
function open(f::Function, args...)
io = open(args...)
try
f(io)
finally
close(io)
end
end
xxxxxxxxxx
Here, open
first opens the file for writing and then passes the resulting output stream to the anonymous function you defined in the do ... end
block. After your function exits, open
will make sure that the stream is properly closed, regardless of whether your function exited normally or threw an exception. (The try/finally
construct will be described in Control Flow.)
xxxxxxxxxx
With the do
block syntax, it helps to check the documentation or implementation to know how the arguments of the user function are initialized.
xxxxxxxxxx
A do
block, like any other inner function, can "capture" variables from its enclosing scope. For example, the variable data
in the above example of open...do
is captured from the outer scope. Captured variables can create performance challenges as discussed in performance tips.
xxxxxxxxxx
Function composition and piping
xxxxxxxxxx
Functions in Julia can be combined by composing or piping (chaining) them together.
xxxxxxxxxx
Function composition is when you combine functions together and apply the resulting composition to arguments. You use the function composition operator (∘
) to compose the functions, so (f ∘ g)(args...)
is the same as f(g(args...))
.
xxxxxxxxxx
You can type the composition operator at the REPL and suitably-configured editors using \circ<tab>
.
xxxxxxxxxx
For example, the sqrt
and +
functions can be composed like this:
xxxxxxxxxx
3.0
xxxxxxxxxx
This adds the numbers first, then finds the square root of the result.
xxxxxxxxxx
The next example composes three functions and maps the result over an array of strings:
xxxxxxxxxx
'U'
'N'
'E'
'S'
'E'
'S'
xxxxxxxxxx
Function chaining (sometimes called "piping" or "using a pipe" to send data to a subsequent function) is when you apply a function to the previous function's output:
xxxxxxxxxx
7.416198487095663
xxxxxxxxxx
Here, the total produced by sum
is passed to the sqrt
function. The equivalent composition would be:
xxxxxxxxxx
7.416198487095663
xxxxxxxxxx
The pipe operator can also be used with broadcasting, as .|>
, to provide a useful combination of the chaining/piping and dot vectorization syntax (described next).
xxxxxxxxxx
"A"
"tsil"
"Of"
7
xxxxxxxxxx
xxxxxxxxxx
In technical-computing languages, it is common to have "vectorized" versions of functions, which simply apply a given function f(x)
to each element of an array A
to yield a new array via f(A)
. This kind of syntax is convenient for data processing, but in other languages vectorization is also often required for performance: if loops are slow, the "vectorized" version of a function can call fast library code written in a low-level language. In Julia, vectorized functions are not required for performance, and indeed it is often beneficial to write your own loops (see Performance Tips), but they can still be convenient. Therefore, any Julia function f
can be applied elementwise to any array (or other collection) with the syntax f.(A)
. For example, sin
can be applied to all elements in the vector A
like so:
xxxxxxxxxx
Multiple definitions for A.
Combine all definitions into a single reactive cell using a `begin ... end` block.
xxxxxxxxxx
UndefVarError: A not defined
- top-level scope@Local: 1
xxxxxxxxxx
Of course, you can omit the dot if you write a specialized "vector" method of f
, e.g. via f(A::AbstractArray) = map(f, A)
, and this is just as efficient as f.(A)
. The advantage of the f.(A)
syntax is that which functions are vectorizable need not be decided upon in advance by the library writer.
xxxxxxxxxx
More generally, f.(args...)
is actually equivalent to broadcast(f, args...)
, which allows you to operate on multiple arrays (even of different shapes), or a mix of arrays and scalars (see Broadcasting). For example, if you have f(x,y) = 3x + 4y
, then f.(pi,A)
will return a new array consisting of f(pi,a)
for each a
in A
, and f.(vector1,vector2)
will return a new vector consisting of f(vector1[i],vector2[i])
for each index i
(throwing an exception if the vectors have different length).
xxxxxxxxxx
Multiple definitions for f.
Combine all definitions into a single reactive cell using a `begin ... end` block.
xxxxxxxxxx
Multiple definitions for A.
Combine all definitions into a single reactive cell using a `begin ... end` block.
xxxxxxxxxx
xxxxxxxxxx
UndefVarError: f not defined
- top-level scope@Local: 1
xxxxxxxxxx
UndefVarError: f not defined
- top-level scope@Local: 1
xxxxxxxxxx
Moreover, nested f.(args...)
calls are fused into a single broadcast
loop. For example, sin.(cos.(X))
is equivalent to broadcast(x -> sin(cos(x)), X)
, similar to [sin(cos(x)) for x in X]
: there is only a single loop over X
, and a single array is allocated for the result. [In contrast, sin(cos(X))
in a typical "vectorized" language would first allocate one temporary array for tmp=cos(X)
, and then compute sin(tmp)
in a separate loop, allocating a second array.] This loop fusion is not a compiler optimization that may or may not occur, it is a syntactic guarantee whenever nested f.(args...)
calls are encountered. Technically, the fusion stops as soon as a "non-dot" function call is encountered; for example, in sin.(sort(cos.(X)))
the sin
and cos
loops cannot be merged because of the intervening sort
function.
xxxxxxxxxx
Finally, the maximum efficiency is typically achieved when the output array of a vectorized operation is pre-allocated, so that repeated calls do not allocate new arrays over and over again for the results (see Pre-allocating outputs). A convenient syntax for this is X .= ...
, which is equivalent to broadcast!(identity, X, ...)
except that, as above, the broadcast!
loop is fused with any nested "dot" calls. For example, X .= sin.(Y)
is equivalent to broadcast!(sin, X, Y)
, overwriting X
with sin.(Y)
in-place. If the left-hand side is an array-indexing expression, e.g. X[begin+1:end] .= sin.(Y)
, then it translates to broadcast!
on a view
, e.g. broadcast!(sin, view(X, firstindex(X)+1:lastindex(X)), Y)
, so that the left-hand side is updated in-place.
xxxxxxxxxx
Since adding dots to many operations and function calls in an expression can be tedious and lead to code that is difficult to read, the macro @.
is provided to convert every function call, operation, and assignment in an expression into the "dotted" version.
xxxxxxxxxx
xxxxxxxxxx
Multiple definitions for X.
Combine all definitions into a single reactive cell using a `begin ... end` block.
xxxxxxxxxx
Multiple definitions for X.
Combine all definitions into a single reactive cell using a `begin ... end` block.
xxxxxxxxxx
Binary (or unary) operators like .+
are handled with the same mechanism: they are equivalent to broadcast
calls and are fused with other nested "dot" calls. X .+= Y
etcetera is equivalent to X .= X .+ Y
and results in a fused in-place assignment; see also dot operators.
xxxxxxxxxx
You can also combine dot operations with function chaining using |>
, as in this example:
xxxxxxxxxx
1
0.5
6
-4
true
xxxxxxxxxx
Further Reading
xxxxxxxxxx
We should mention here that this is far from a complete picture of defining functions. Julia has a sophisticated type system and allows multiple dispatch on argument types. None of the examples given here provide any type annotations on their arguments, meaning that they are applicable to all types of arguments. The type system is described in Types and defining a function in terms of methods chosen by multiple dispatch on run-time argument types is described in Methods.
xxxxxxxxxx