Simple array

From APL Wiki
(Redirected from Simple)
Jump to navigation Jump to search

In the nested array model, a simple or flat array is an array whose elements are all simple scalars. A non-empty array is simple if and only if it has a depth of 0 (which makes it a scalar) or 1. Empty arrays are considered simple in most contexts, although they may have depth greater than 1 in languages that use the prototype to determine depth.

The simple arrays are a superset of the arrays allowed in flat array theory without boxes (or those which have depth 0 in flat array theory): they include all arrays of a single type, as well as arrays which mix types like numbers and characters. Arrays which would not be representable in flat array theory—those which contain a mixture of simple scalar types, or contain both simple scalars and other arrays—are called mixed.

The term "simple" is not typically used in flat APLs. On the APL Wiki, it may be used to mean a non-boxed array.

APL features [edit]
Built-ins Primitives (functions, operators) ∙ Quad name
Array model ShapeRankDepthBoundIndex (Indexing) ∙ AxisRavelRavel orderElementScalarVectorMatrixSimple scalarSimple arrayNested arrayCellMajor cellSubarrayEmpty arrayPrototype
Data types Number (Boolean, Complex number) ∙ Character (String) ∙ BoxNamespace
Concepts and paradigms Conformability (Scalar extension, Leading axis agreement) ∙ Scalar function (Pervasion) ∙ Identity elementComplex floorTotal array orderingTacit programming (Function composition, Close composition) ∙ Glyph
Errors LIMIT ERRORRANK ERRORSYNTAX ERRORDOMAIN ERRORLENGTH ERRORINDEX ERRORVALUE ERROR