A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | R | S | T | U | V | W | X | Y | Z

A

ABI

Application Binary Interface. The assembly-level specification for how functions are to interact with one another (pass parameters, parameter ordering, type size specifications, etc.)

adobe::

adobe::array_t

adobe::array_t is a copy-on-write vector of values.

adobe::auto_ptr

adobe::auto_ptr is an improved auto_ptr class and auto_resource for managing non-pointer referenced resources.

adobe::dictionary_t

adobe::dictionary_tis a copy-on-write name/value associative container (this is great for messaging.)

adobe::final

adobe::final is a mix-in class to ensure that a class cannot be derived from. From Doug Ahmann.

adobe::forest

adobe::forest is a hierarchical container class.

adobe::name_t

adobe::name_t is an efficient string class for simple, non-mutable, character strings.

API

Application Programming Interface. The C or C++ header file that describes the functions available to you in the DLL (or other code block).

B

C

class invariants

(Also see invariant.) A class invariant expresses constraints that must always hold true of any object of that class (except, possibly, during the course of a method invocation on the class). Class invariants behave like postconditions - the child's invariant must imply the parent's invariant.

D

discriminated types

A generic (in the sense of general as opposed to template-based programming) concept of types that contain values of different types but do not attempt conversion between them, i.e. 5 is held strictly as an int and is not implicitly convertible either to "5" or to 5.0. Their indifference to interpretation but awareness of type effectively makes them safe, generic containers of single values, with no scope for surprises from ambiguous conversions. (taken from a defintion found at boost.org.)

E

F

G

H

I

invariant

A rule, such as the ordering of an ordered list or heap, that applies throughout the life of a data structure (see class invariants) or procedure. Each change to the data structure must maintain the correctness of the invariant.

J

K

L

leading edge

The first iteration path through an adobe::forest node, contrasting to the trailing edge which is the second iteration path.

M

N

O

P

postconditions

One or more statements of what the method guarantees to the caller after it is done. An error in a postcondition denotes an error in the method implementation.

preconditions

The set of conditions on a method that must be met to permit the method to execute correctly. Preconditions essentially capture what the method expects to be true when it is called - a violation of the precondition denotes a bug in the client of the method.

projection function

A Unary Function without side effects. See TransformFunction. Also known as a project function.

Q

R

range

A concept and associated traits and functions for handling [first, last) style ranges. Please see ConvertibleToRange.

reference semantics

When you can treat a variable as you would treat an int*

regular type

Please see the related page on Regular.

S

T

trailing edge

The second iteration path through an adobe::forest node, contrasting to the leading edge which is the first iteration path.

translation unit

A source file together with all the headers and source files included via #include, less any source lines skipped by any of the conditional inclusion (#if, etc.) preprocessing directives.

U

V

value

Please see the related page on Regular.

value semantics

When you can treat a variable as you would treat an int