n
A value, or a reference to a value, passed to a function.
n
(programming) The interface of a library with a programming language other than one it is written in.
n
(programming) The code of a subroutine, contrasted to its signature and parameters.
n
(computing) The act of jumping to a subprogram, saving the means to return to the original point.
n
(programming) Alternative form of call-by-reference [(programming) An evaluation strategy in which the arguments to a function are evaluated first, and a pointer to the result is passed to the function.]
n
(programming) An evaluation strategy where arguments passed to a function can be mutated in a way that is visible to the caller (unlike call-by-value) but access is not given to the specific variables passed as arguments (unlike call-by-reference).
n
(programming) Alternative form of call-by-value [(programming) An evaluation strategy in which the arguments to a function are evaluated first, and the result is passed into the function.]
n
(computing) A directed graph that represents relationships between called and calling subroutines in a computer program, used in code analysis.
n
(programming) The section of code from which another section is called.
n
(programming) An evaluation strategy in which the arguments to a function are evaluated concurrently with the function body.
n
(programming) An evaluation strategy whereby an argument to a function is evaluated each time its value is used in the function, and is not evaluated at all if its value is never used.
n
(programming) An evaluation strategy in which the arguments to a function are evaluated the first time they are used in that function.
n
(programming) An evaluation strategy in which the arguments to a function are evaluated first, and a pointer to the result is passed to the function.
n
(programming) An evaluation strategy in which the arguments to a function are evaluated first, and the result is passed into the function.
n
(programming) A function pointer passed as an argument to another function.
n
(programming) In the Eiffel programming language, a run-time error caused by use of the wrong data type.
n
(programming) An exception that has to be declared in the signature of the method that may raise it.
n
(programming) An abstraction that represents a function within an environment, a context consisting of the variables that are both bound at a particular time during the execution of the program and that are within the function's scope.
n
(programming) A piece of code that performs a task, and that can be passed new input and return output more than once.
n
(programming) A list of statements that effectively execute together (though not simultaneously), such that each can yield execution to the others to avoid delaying the program. They are used to implement cooperative multitasking.
n
(programming) A piece of code that accesses a shared resource that must not be concurrently accessed by more than one thread of execution.
n
(programming) A potential ambiguity in a programming language that occurs when an else clause can be associated with either a nested conditional or with the clause that encloses the nested conditional.
n
(compilers) Instructions that, when executed, have no effect on the running of the program.
n
(programming) The situation, in programming languages such as C, where an array loses its type and dimensions and is reduced to a pointer, for example by passing it to a function.
n
(programming) A construct in source code that declares something, such as a variable.
n
(programming) A statement which provides a previous declaration with a value or body of a subroutine (in the case of function).
v
(programming) To access the value or object located in a memory location stored in a pointer or another value interpreted as such; to access a value being referenced by something else.
n
(programming) A construct in source code that indicates how it should be processed but is not necessarily part of the program to be run.
n
(programming) A table of pointers to functions or methods, commonly used to implement dynamic binding.
n
(programming) An unused parameter or value.
n
(programming) The act of returning from a function before reaching the end of that function.
n
(programming) A location in a program or software library that can be called from outside, and from which the execution of code begins.
n
(programming) Alternative form of entry point [(programming) A location in a program or software library that can be called from outside, and from which the execution of code begins.]
n
(programming) The environment of a function at a point during the execution of a program is the set of identifiers in the function's scope and their bindings at that point.
n
(programming, informal) A value or variable that identifies the kind of error (or lack thereof) that has occurred during the execution of a program or subroutine.
v
(programming, of software) To evaluate (or execute) source code held in a string during run time.
adj
(programming) Of a program: such that the program flow is determined by events.
n
(programming) A function that runs when an object is garbage collected, similar to a destructor.
n
(programming) The declaration of an identifier before it is given a complete definition, so that the compiler can know its data type and memory size.
n
(programming) A data structure, used in dynamic memory allocation, that connects free (unallocated) regions of memory together in a linked list.
n
(programming) Alternative form of free list [(programming) A data structure, used in dynamic memory allocation, that connects free (unallocated) regions of memory together in a linked list.]
n
(computing, programming) A lightweight communicating process in the Go programming language.
n
(programming) Any construct which produces an unstructured jump in the flow of execution.
n
(programming) A particular programming technique that exploits call-by-name to change the value of an index variable during execution of a loop.
n
(programming) In aspect-oriented programming, a point at which advice (additional code) is triggered (a set of these constituting a pointcut).
n
(computing) A named place in source code that can be jumped to using a GOTO or equivalent construct.
adj
(programming, of a program or programming language) Able to ensure memory safety.
n
(programming) the association of entities (data and/or code) with identifiers
n
(programming) The difference between a target memory address and a base address.
n
(software) Alternative form of call-by-reference [(programming) An evaluation strategy in which the arguments to a function are evaluated first, and a pointer to the result is passed to the function.]
n
(software) Alternative form of call-by-reference [(programming) An evaluation strategy in which the arguments to a function are evaluated first, and a pointer to the result is passed to the function.]
n
(programming) Alternative form of call-by-value [(programming) An evaluation strategy in which the arguments to a function are evaluated first, and the result is passed into the function.]
adj
(computing, programming) Like a pointer (variable holding a memory address).
n
(computing) The expression of an algorithm in pseudocode.
adj
(programming) Of a variable in the APL programming language: which has been reshaped into a vector.
n
(programming) A counter variable that keeps track of the number of references to a specific block of memory.
n
(programming, neologism) A code construct that uses return operations to prevent speculative execution.
n
(computing) The output of a program or subroutine, passed back to the context where it was called; a retval.
n
(programming) Abbreviation of return value. [(computing) The output of a program or subroutine, passed back to the context where it was called; a retval.]
v
(programming) To limit (an object or variable) to a certain region of program source code.
n
(programming) the region of a computer program where a name binding is valid
n
(programming) Any point during a computer program's execution at which it is guaranteed that all side effects of previous evaluations will have been performed, and no side effects from subsequent evaluations have yet been performed.
n
(programming) A change in state caused by a function call.
n
(computing) a delegate that points to a single method
n
(programming) A form of binding that occurs before the program is run, typically at compile time.
n
(computer science) A section of code, called by the main body of a program, that implements a task.
n
(programming) The technique of writing a function so that recursive calls are only done immediately before function return, particularly when recursive control structures are used in place of iterative ones.
n
(programming) In JavaScript, the lines of code preceding the declaration of a variable.
n
(computing) In the Scheme programming language, a function or procedure taking no arguments.
n
(programming) read-eval-print loop
n
(programming) Any of a variety of looping or jumping instructions in specific programming languages.
n
(programming) In JavaScript, automatic dead code elimination during the build.
n
(computing, programming) A free variable that has been bound (closed over) with a closure.
v
(computing) To redirect to a vector, or code entry point.
n
(programming) A debugging mechanism whereby execution is suspended every time a specified memory location is modified; or, any of various similar such mechanisms.
Note: Concept clusters like the one above are an experimental OneLook
feature. We've grouped words and phrases into thousands of clusters
based on a statistical analysis of how they are used in writing. Some
of the words and concepts may be vulgar or offensive. The names of the
clusters were written automatically and may not precisely describe
every word within the cluster; furthermore, the clusters may be
missing some entries that you'd normally associate with their
names. Click on a word to look it up on OneLook.
Our daily word games Threepeat and Compound Your Joy are going strong. Bookmark and enjoy!
Today's secret word is 10 letters and means "Practical approaches prioritizing results, efficiency." Can you find it?