| slovo | definícia |
optimisation
(encz) | optimisation,optimalizace n: Zdeněk Brož |
optimisation
(wn) | optimisation
n 1: the act of rendering optimal; "the simultaneous
optimization of growth and profitability"; "in an
optimization problem we seek values of the variables that
lead to an optimal value of the function that is to be
optimized"; "to promote the optimization and
diversification of agricultural products" [syn:
optimization, optimisation] |
| | podobné slovo | definícia |
last call optimisation
(foldoc) | last call optimisation
tail call optimisation
tail call optimization
(Or "tail call optimisation") Discarding the
immediate calling context (call stack frame) when the last
action of a function or procedure, A, is to call another
function or procedure, B. B will then return directly to A's
caller, or possibly further up the call stack if the
optimisation has been applied to several consecutive calls.
Last call optimisation allows arbitrarily deep nesting of
procedure calls without consuming memory to store useless
environments. This is particularly useful in the special case
of tail recursion optimisation, where a procedure's last
action is to call itself (possibly indirectly).
(2007-03-16)
|
peephole optimisation
(foldoc) | peephole optimisation
peephole optimization
A kind of low-level code optimisation that
considers only a few adjacent machine code instructions at a
time and looks for certain combinations which can be replaced
with more efficient sequences. E.g.
ADD R0, #1
ADD R0, #1
(add one to register R0) could be replaced by
ADD R0, #2
as long as there were no jumps to the second instruction.
(2008-11-17)
|
tail call optimisation
(foldoc) | last call optimisation
tail call optimisation
tail call optimization
(Or "tail call optimisation") Discarding the
immediate calling context (call stack frame) when the last
action of a function or procedure, A, is to call another
function or procedure, B. B will then return directly to A's
caller, or possibly further up the call stack if the
optimisation has been applied to several consecutive calls.
Last call optimisation allows arbitrarily deep nesting of
procedure calls without consuming memory to store useless
environments. This is particularly useful in the special case
of tail recursion optimisation, where a procedure's last
action is to call itself (possibly indirectly).
(2007-03-16)
|
tail recursion optimisation
(foldoc) | tail recursion optimisation
TRO
(TRO) Discarding the calling environment ({call
stack} frame) when the last thing a function or procedure
does is to call itself. This is important when a procedure
calls itself recursively many times since, without tail
recursion optimisation, the environments of earlier
invocations would fill up the memory only to be discarded when
(if) the last call terminated.
Tail recursion optimisation is a special case of {last call
optimisation} but it allows the further optimisation that some
arguments may be passed in situ, possibly in registers. It
allows recursive functions to be compiled into iterative
loops.
See also conversion to iteration, {tail recursion modulo
cons}.
(2006-04-16)
|
|