-
computer programming, a function, subprogram, procedure, method,
routine or
subroutine is a
callable unit that has a well-defined
behavior and can be invoked...
-
stack is a
stack data
structure that
stores information about the
active subroutines of a
computer program. This type of
stack is also
known as an execution...
-
subroutine is a
subroutine which cannot in turn call
another subroutine. Some
compilers can
apply special program optimizations to leaf
subroutines,...
-
special kind of
variable used in a
subroutine to
refer to one of the
pieces of data
provided as
input to the
subroutine.
These pieces of data are the values...
-
where the code has a form that
essentially consists entirely of
calls to
subroutines. It is
often used in compilers,
which may
generate code in that form...
-
Reentrancy is a
programming concept where a
function or
subroutine can be
interrupted and then
resumed before it
finishes executing. This
means that the...
- no
subroutines,
would have the
lowest count. However, the
binary size of such a
program may be
larger than the same
program coded using subroutines (as...
-
idempotent subroutines where at
least one
subroutine is
different from the others, however, is not
necessarily idempotent if a
later subroutine in the sequence...
- dictionary. In
computer programming, a
thunk is a
subroutine used to
inject a
calculation into
another subroutine.
Thunks are
primarily used to
delay a calculation...
- index, for
later branching or
pointer lookup a
program name,
relative subroutine number,
program label or
program offset, to
alter control flow Controlling...
