Logical relational database style table data structure, in which columns are
named and ordered with respect to each other. Implemented using
Cluster-per-row encoding. Each row Cluster must have an identical number
of Elements, each of which in turn must have identical names and value types
in the corresponding postions in each row.
Some columns may be designated key' columns, containing key data for each
row, in the manner of relational tables. This allows row-naming, where each row
represents a body site, a blood antigen etc. All values in a column have the same
data type.
Used for representing any data which is logically a table of values, such as blood
pressure, most protocols, many blood tests etc.
Not to be used for time-based data, which should be represented with the temporal
class HISTORY.. The table may be empty.

Declaration :

• C++ : class ITEM_TABLE : public ITEM_STRUCTURE
• Java : public class ITEM_TABLE extends ITEM_STRUCTURE

Artifact : ITEM_TABLE

All public operations : as_hierarchy , as_hierarchy , concept , is_archetype_root , item_at_path , items_at_path , parent , path_exists , path_of_item , path_unique