n
(countable, programming) In aspect-oriented programming, the code whose execution is triggered when a join point is reached.
n
(programming) A rule by which compilers are allowed to apply any optimizing transformation to a program provided that it makes no change to the observable behavior of the program.
v
(transitive, object-oriented programming) To box (a value) automatically (map a primitive data item to a complex object).
n
(programming) The situation where a programmer sees less powerful programming languages than those he/she knows as lacking in important features, but more powerful ones as having bizarre or unnecessary features.
n
Non-redundant software code comprising of focussed task-specific modules and functions, written in a systematic manner so that another coder can easily interpret or modify it.
n
(programming, uncountable) Autocompletion of source code.
n
(computing, informal) The place where programmers develop source code (as opposed to conceptually distant areas such as design and marketing).
n
(programming) A recreational computer programming competition in which participants attempt to implement an algorithm using the shortest possible source code.
n
(programming) The obfuscation of intermediate-level code (such as compiled Java or .NET languages) by breaking it up into smaller sequences and replacing them by equivalent constructs.
n
(programming) Anything in a program's source code that suggests the presence of a design problem.
n
(programming) The body of source code used to create a particular computer program or software component.
n
(programming) Utilization of comments in source code.
n
(countable, uncountable, computing) Translation of source code into object code by a compiler.
n
(computing) The behaviour of a person repeatedly attempting to write a syntactically correct program and compile it
n
(often attributive) The point at which a program is converted from source code to machine code; literally the time of compilation.
adj
(computing) Programming language requirements that must be met by source code for it to be successfully compiled (the “compile-time requirements”).
n
(software, design) A structural (and partitioning) design pattern where a group of objects are to be treated in the same way as a single instance of an object.
n
(computing, informal) source code
n
(programming) A form of coupling where one module relies on the internal workings of another module.
n
(software compilation) An optimisation technique where a value is transfered to the final target address, instead of being copied and then destroyed.
n
(programming) A portion of source code that will never be executed as part of the running program.
n
(programming) The mode of a compiler or IDE that allows for debugging, with the availability of information such as variable names and line numbers from the source code.
n
(software architecture) A type-safe way of supplying an external dependency to a software component.
n
(computing, derogatory) Software code that has had many editors with conflicting styles, making it nearly impossible to maintain.
n
(programming) A specially formatted comment in source code, used to document a specific segment of the code.
n
(programming) A string literal specified in source code that is used, like a comment, to document a specific segment of code, but remains available at run-time.
n
(programming) Comments that explain the usage of individual functions, libraries and blocks of code.
n
(computing, database normalization) A constraint between two sets of attributes in a relation.
n
(computing) Code that serves to connect separate parts of a program for compatibility or interoperability.
v
(computing) To develop (software, web pages, etc.) by writing source code or markup directly, without the use of tools allowing higher-level representations.
v
(computing) To build absolute and unchangeable values into a program such that they can only be changed by modifying the source code.
n
(programming) A file, usually in the form of source code, that is automatically included in another source file by the compiler.
n
(software compilation) The replacement by a compiler of a function call with a copy of the entire function body, sometimes used as an optimization.
n
(programming) A routine that prepares something for use.
adj
(computing) Performing compilation of code on the client machine immediately before execution.
n
(programming) The situation in which a quoted string expression becomes difficult to read because it contains a large number of escape characters, usually backslashes, to avoid delimiter collision.
n
(computing, programming) The process of using a software tool to analyse source code and identify possible programming problems.
n
(computer science) A low-level interdependent coupling between program modules.
adj
(computing) (of an application) Programmed using a low-code development environment.
n
(computing) A subroutine in the C programming language's standard library for performing dynamic memory allocation.
n
(computer science) A technique in which partial results are recorded (forming a memo) and then can be re-used later without having to recompute them.
n
(programming) Protection from software bugs and security vulnerabilities resulting from improper memory management, such as buffer overflows and dangling pointers.
n
(computing) A compiler used to construct compilers for other programming languages.
n
(programming) A computer program that writes or manipulates other programs as data, or does the work at runtime that would otherwise be done at compile time.
n
(programming) A keyword that qualifies the meaning of other code.
n
(software compilation) An error caused by two source code elements (such as variables or functions) having the same name as each other.
n
(computing) source code written in a code readable by the processor
n
(computing) The output of a compiler or assembler; it is not necessarily executable directly without linking to other modules
n
(programming) In some programming languages, the convention by which the indentation of a line of source code affects its meaning.
adj
(computing, used before "code") Source code of a computer program that is not within the text of a macro being generated.
n
(programming) The reduction of a program or algorithm to its most efficient form, as during compilation, by removing unused portions of code and improving the speed or resource usage of others.
n
(programming) An optimization that works by eliminating redundant instructions from a small area of source code.
n
(programming) A change to program code that makes it less efficient, the opposite of an optimization.
n
(programming) Alternative form of premature optimization [(programming) The act of wasting resources on optimising source code that does not represent a significant bottleneck.]
n
(programming) The act of wasting resources on optimising source code that does not represent a significant bottleneck.
n
(software engineering) Writing individual lines of code in a programming language.
n
(computing) A variable used for storing the address of another variable or structure, equivalent to a pointer.
n
(computing) Clipping of regular expression. [(computing theory) A concise description of a regular formal language with notations for concatenation, alternation, and iteration (repetition) of subexpressions.]
n
(computer science) The location of something in computer memory expressed as an offset from the value of a register.
adj
(computing, programming, of source code) Written and structured in such a way that it can be understood without consulting separate documentation.
n
(programming) A proxy that provides additional actions whenever an object is referenced, such as counting the number of references to the object.
v
(programming) To construct a program in a way which ensures that certain values and methods of operation are adjustable at run time.
n
(computing) Source code.
n
(programming, informal, derogatory) Unstructured or poorly structured program source code; especially code with many GOTO statements (or their equivalent).
n
(computing) An instruction in a computer program, especially one that returns no value, as opposed to a function call.
n
(computing) a reference that does protect the referenced object from collection by a garbage collector
n
(computing) A technique, involving multiple metacompilations, that seeks to optimize a program.
n
(computing) A program that performs supercompilation.
n
(programming) An exception that is not declared in the signature of a method, but results in an abort with a stack trace.
n
(software engineering, informal) Acronym of you ain't gonna need it: the principle that software developers should not add functionality to software until it is required.
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?