v
(transitive, computing) To store (data) in a way that is consistent with the memory architecture, i.e. by beginning each item at an offset equal to some multiple of the word size.
n
(programming) A data structure that associates keys with data; implemented as a list whose members are paired storage locations (cons cells), one element of which (the car) contains the key and the other element of which (the cdr) contains the keyed data.
n
(programming) A software mechanism that automatically locates and loads classes etc. as required at run time.
n
(compilers) A sequence of contiguous instructions that contains no jumps or labels.
n
(programming) A comment in source code that occupies several consecutive lines.
adj
(computing) encoded using bytecode
n
Alternative form of call site [(programming) The section of code from which another section is called.]
n
(computing) A value placed in memory such that it will be the first data corrupted by a buffer overflow, allowing the program to identify and recover from it.
n
(scientific programming) A program.
n
(programming) A block of source code, often one that is delimited by brackets or in some similar way, depending on the programming language.
n
(programming) A sequence of null bytes in a process's memory, offering the capacity for the injection of custom instructions by a hacker.
n
(programming) A token predicted by means of autocompletion.
n
Alternative spelling of code face [(computing, informal) The place where programmers develop source code (as opposed to conceptually distant areas such as design and marketing).]
n
(computing) A branch (group of related files) in a source control system.
n
A form of creative writing in which the text is mixed with code from various computer languages.
n
(cryptography) An attack on a cryptographic hash function that is able to find a hash collision (a pair of different inputs that have the same hash) faster than by brute force.
n
(programming) A remark embedded in source code in such a way that it will be ignored by the compiler or interpreter, typically to help people to understand the code.
v
(programming, transitive) To disable a section of source code by converting it into a comment.
n
(programming) Any set of information that affects the code of a computer program.
n
(computing) The tendency of programmers to disproportionately emphasize elegance in software at the expense of other requirements such as functionality, shipping schedule, and usability.
n
(computer science) A scheme for resolving hash collisions, using two hash functions instead of one, and allowing a newly inserted key to "kick out" any existing key at the same index.
n
(programming) A problematic situation where one thread could potentially read or write a memory location while another thread is writing to it.
n
(computing) The delete character (U+007F or %7F).
adj
(programming, of a data structure) Whose elements each link to the previous and the next element.
n
(computing) The process of allocating memory at runtime.
n
(programming, Microsoft) A software library containing some combination of code, data, and resources, capable of being loaded at run time and shared by multiple applications.
n
(computing) A component of a computer program that prepares the computer to return from a routine.
n
(compilers) A sequence of contiguous instructions that contains no labels; unlike basic blocks, they may contain jumps.
n
(computing) A file extension.
n
(computing) In COBOL, the description of an unnamed part of a record that contains no data relevant to a given context (normally capitalised when in a data division).
n
(programming) A limited pattern matching technique using wildcards, less powerful than a regular expression.
n
(programming) The cognitive process of creating a mental model of a computer program by reading the code.
v
(computing) To write something in as few characters as possible (e.g. in code golf, regex golf)
n
(computing) Alternative letter-case form of GOTO [(programming) Any construct which produces an unstructured jump in the flow of execution.]
n
(computing) A thread of execution that is scheduled by a virtual machine, not natively by the underlying operating system.
n
A program which selects lines in a file which match a given pattern.
n
(computing) A reference to an object or structure that can be stored in a variable.
n
(programming) A subroutine that handles a particular situation such as an event or exception.
v
Alternative spelling of hard code [(computing) To build absolute and unchangeable values into a program such that they can only be changed by modifying the source code.]
n
(computing) The code or value generated by a hash function to represent some piece of data.
n
(programming) An associative array implemented as a vector, the indexes into which are the result of applying a hash function to the key.
n
(rare, computing) Extreme automation; the automating of as many processes as possible.
n
(computing) The state of a network in which the number of nodes is far in excess of the number of users.
n
(computing) The (sometimes optional) part of a COBOL program that identifies the name of the program (and optionally of its programmer)
v
(programming) To use a directive that allows the use of source code from another file.
n
(computing) That which increments; a computer programming instruction that increments a value.
n
(software compilation) A program or algorithm that optimizes code using in-line expansion.
n
(computing) That which causes a program or subroutine to execute.
n
(programming) An array of arrays in which the component arrays are of varying lengths.
n
One who uses the JavaScript programming language.
n
(computing, usually attributive) A pair consisting of a key (usually unique) and a value associated with the key.
n
(computing) A user-defined alias for a numerical designation, the reverse of an enumeration.
n
(computing) A computer program that performs lexical analysis.
n
(computing, derogatory) Incomprehensible source code or other textual material (often due to terseness or overuse of operators).
n
(computing) The part of the data division of a COBOL program that describes the format of variables and constants passed to the program as parameters, either from JCL or from a calling program
n
(computer science) A simple linear data structure, each of whose nodes includes a pointer to the next (and sometimes previous) node in the list, enabling traversal of the structure in at least one direction from any starting point.
n
(programming, often attributive) The assembly and loading into memory of a program as a single operation, without generating and saving an intermediate object program.
n
(computing) A mechanism for marshalling data.
n
(software) The process of transforming the memory representation of an object to a data format suitable for storage or transmission, which is typically used when data must be moved between different parts of a computer program, or from one program to another.
v
(programming) To be an example of a rule or regex.
n
(programming) An algorithm or software component that memoizes.
n
(computing, rare) A memory leak.
n
(programming) One who uses the technique of metaprogramming.
n
(programming) A section of a program; a subroutine or group of subroutines.
n
(software engineering) A humorous aphorism stating that the first 90% of the code accounts for the first 90% of the development time, and the remaining 10% of the code accounts for the other 90% of the development time.
adj
(computing) (of a development environment) Involving a graphical user interface rather than a text-based one.
v
(programming) To replace machine code with nop instructions when modifying software.
n
(computing) A compiler or assembler that produces optimized code.
n
(computing) Extra characters such as spaces added to a record to fill it out to a fixed length.
n
(computing, programming) A software development technique, part of extreme programming, in which two programmers work together at a single keyboard, one coding while the other observes and reviews. The roles are often switched at regular intervals.
n
(programming) (in the Python programming language) A program or algorithm that performs serialization.
n
(programming, uncountable) The environment where finished code runs, as opposed to staging or development.
n
(computing, rare) A program undergoing profiling.
n
(operations) A method for diagramming and analyzing the flow of dependent tasks and other events in a project.
n
(programming) A software analysis tool that displays data links and related characteristics to enable a programmer to track the effects of proposed changes.
n
(computing) A component of a computer program that prepares the computer to execute a routine.
n
(computing, programming) A construct that resembles a block of source code but is not a true block.
n
(computing) Something that can be accessed in the manner of a protocol but is not in fact a protocol.
n
(computing) The technique of storing the number of handles, pointers, or references to a resource such as a block of memory, disk space, or an object, so that the system can determine when the resource is no longer in use.
n
(computing) Alternative form of regex
n
(computing) A function used in an operating system that is not available to application programs.
n
(programming) Source code etc. that is incomplete and serves as a basis for further development.
adj
(computing) Consisting of a complete executable package that takes some action with the included data, rather than a pure data file requiring some additional tool to read it.
n
(programming) The process of separating a computer program into distinct features that overlap functionally as little as possible.
n
(computing) A text file containing a relatively small amount of code, useless by itself, along with instructions for inserting that code into a larger codebase.
adv
(rare, informal, computing) By the use of software, especially without direct user intervention.
n
Alternative letter-case form of spaghetti western [(film) A motion picture produced by an Italian-based company and filmed in Europe, notably in Italy, and depicting a tale of cowboys and desperadoes set in the American Old West.]
n
(programming) A placeholder procedure that has the signature of the planned procedure but does not yet implement the intended behavior.
n
(computing, programming) A programming construct that takes different actions depending on the value of an expression.
n
(computing) Highlighting of source code with color, boldfacing, etc. to indicate its syntactic structure.
n
(computing) A translating compiler that takes the source code of a programming language as its input and outputs the source code into either another programming language or an older version of the same language.
n
(programming) In a computer program, library called by another dependency.
n
(computing) A program or algorithm that unparses.
n
(regular expressions, rare) A type of matching where the newline character matches newlines but the wildcard character also does.
adj
(software engineering) Of code, having the quality of adhering to the principle of WET; containing much repetition.
n
(computing) The use of wildcard characters for partial matching.
n
(computing) The wry observation that "Every program attempts to expand until it can read mail. Those programs which cannot so expand are replaced by ones which can."
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?