<programming> An {object} adhering to a {component
	architecture}.

	(1997-11-20)

<operating system> A list from which the user may select an
	operation to be performed.  This is often done with a {mouse}
	or other pointing device under a {graphical user interface}
	but may also be controlled from the keyboard.

	Menus are very convenient for beginners because they show what
	commands are available and make experimentating with a new
	program easy, often reducing the need for user documentation.
	Experienced users however, often prefer keyboard commands,
	especially for frequently user operations, because they are
	faster to use.  In situations such as text entry where the
	keyboard must be used anyway, having to move your hand to the
	mouse to invoke a menu operation is slow.

	There are many different ways of presenting menus but the most
	common are the {menu bar} (with {pull-down menus}) and the
	{context-sensitive menu}.

	The term "menu" tends to be reserved for a list of actions or
	global options, whereas a "{list box}" or other graphical
	{widget} might present any kind of choice.

	See also {menuitis}.

	(1994-12-02)

See also {complete graph}, {complete inference system},
	{complete lattice}, {complete metric space}, {complete partial
	ordering}, {complete theory}.

	[1. or 2. or both?]

	(1996-04-24)

<hardware> To press and release a {button} on a {mouse} or
	other {pointing device}.  This generates an {event}, also
	specifying the screen position, which is processed by the
	{window manager} or {application program}.  On a mouse with
	more than one button, the unqualified term usually implies
	pressing the left-most button (with the right index finger),
	other buttons would be qualified, e.g. "{right-click}".
	{Keyboard} modifiers may also be used, e.g. "shift-click",
	meaning to hold down the shift key on the keyboard while
	clicking the mouse button.

	If the mouse moves while the button is pressed then this is a
	{drag}.

	(1995-03-14)

1. Not simulated.  Often used as a specific antonym to
	{virtual} in any of its jargon senses.

	2. <mathematics> {real number}.

	[{Jargon File}]

	(1997-03-12)

<object-oriented> In {object-oriented programming}, an
	instance of the data structure and behaviour defined by the
	object's {class}.  Each object has its own values for the
	{instance variables} of its class and can respond to the
	{methods} defined by its class.

	For example, an object of the "Point" class might have
	instance variables "x" and "y" and might respond to the "plot"
	method by drawing a dot on the screen at those coordinates.

	(2004-01-26)

1. <application, algorithm> To arrange a collection of items
	in some specified order.  The items - {records} in a file or
	data structures in memory - consist of one or more {fields} or
	members.  One of these fields is designated as the "sort key"
	which means the records will be ordered according to the value
	of that field.  Sometimes a sequence of key fields is
	specified such that if all earlier keys are equal then the
	later keys will be compared.  Within each field some ordering
	is imposed, e.g. ascending or descending numerical, {lexical
	ordering}, or date.

	Sorting is the subject of a great deal of study since it is a
	common operation which can consume a lot of computer time.
	There are many well-known sorting {algorithms} with different
	time and space behaviour and programming {complexity}.

	Examples are {quicksort}, {insertion sort}, {bubble sort},
	{heap sort}, and {tree sort}.  These employ many different
	data structures to store sorted data, such as {arrays},
	{linked lists}, and {binary trees}.

	2. <tool> The {Unix} utility program for sorting lines of
	files.

	{Unix manual page}: sort(1).

	(1997-02-12)

<programming> (API, or "application programming interface")
	The interface (calling conventions) by which an {application
	program} accesses {operating system} and other services.  An
	API is defined at {source code} level and provides a level of
	{abstraction} between the application and the {kernel} (or
	other privileged utilities) to ensure the {portability} of the
	code.

	An API can also provide an interface between a {high level
	language} and lower level utilities and services which were
	written without consideration for the {calling conventions}
	supported by compiled languages.  In this case, the API's main
	task may be the translation of parameter lists from one format
	to another and the interpretation of {call-by-value} and
	{call-by-reference} arguments in one or both directions.

	(1995-02-15)

1. The art of debugging a blank sheet of paper (or, in these
	days of on-line editing, the art of debugging an empty file).

	2. A pastime similar to banging one's head against a wall, but
	with fewer opportunities for reward.

	3. The most fun you can have with your clothes on (although
	clothes are not mandatory).

	[{Jargon File}]

	(2003-02-12)

<programming> The name given in {Smalltalk} and other
	{object-oriented languages} to a procedure or routine
	associated with one or more {classes}.  An {object} of a
	certain class knows how to perform actions, e.g. printing
	itself or creating a new instance of itself, rather than the
	function (e.g. printing) knowing how to handle different types
	of object.

	Different classes may define methods with the same name
	(i.e. methods may be {polymorphic}).  The term "method" is used
	both for a named operation, e.g. "PRINT" and also for the code
	which a specific class provides to perform tha
	t operation.

	Most methods operate on objects that are instances of a
	certain class.  Some object-oriented languages call these
	"object methods" to distinguish then from "{class methods}".

	In {Smalltalk}, a method is defined by giving its name,
	documentation, temporary local variables and a sequence of
	expressions separated by "."s.

	(2000-03-22)

<networking> Name Daemon.

	<networking> A {Unix} {background} process that converts
	{hostnames} to {Internet addresses} for the {TCP/IP}
	{protocol}.

	{Unix manual page}: named(8).

	See also {DNS}.

	(1995-03-28)