# Difference between revisions of "Simple scalar"

Jump to navigation
Jump to search

Miraheze>Marshall m |
m (Nested array model category) |
||

(3 intermediate revisions by 3 users not shown) | |||

Line 3: | Line 3: | ||

Simple scalars are the only arrays with [[depth]] 0. An array consisting only of simple scalars therefore has depth 1; such arrays are called [[simple]]. | Simple scalars are the only arrays with [[depth]] 0. An array consisting only of simple scalars therefore has depth 1; such arrays are called [[simple]]. | ||

− | {{APL | + | {{APL features}}[[Category:Kinds of array]][[Category:Nested array model]] |

## Latest revision as of 15:02, 30 April 2020

In nested array theory, a **simple scalar** is an array encoding data from one of the language's fundamental data types such as a number or character. A simple scalar is defined to be a scalar whose only element is itself. All nested APLs specify that simple scalars float, that is, a scalar array containing only a simple scalar is identical to that simple scalar. Because of this property, all arrays which are both simple and scalar are simple scalars.

Simple scalars are the only arrays with depth 0. An array consisting only of simple scalars therefore has depth 1; such arrays are called simple.

APL features [edit]
| |
---|---|

Built-ins | Primitive function ∙ Primitive operator ∙ Quad name |

Array model | Shape ∙ Rank ∙ Depth ∙ Bound ∙ Index (Indexing) ∙ Axis ∙ Ravel ∙ Ravel order ∙ Element ∙ Scalar ∙ Vector ∙ Matrix ∙ Simple scalar ∙ Simple array ∙ Nested array ∙ Cell ∙ Major cell ∙ Subarray ∙ Empty array ∙ Prototype |

Data types | Number (Boolean, Complex number) ∙ Character (String) ∙ Box ∙ Namespace |

Concepts and paradigms | Leading axis theory ∙ Scalar extension ∙ Conformability ∙ Scalar function ∙ Pervasion ∙ Glyph ∙ Identity element ∙ Complex floor ∙ Total array ordering |

Errors | LIMIT ERROR ∙ RANK ERROR ∙ SYNTAX ERROR ∙ DOMAIN ERROR ∙ LENGTH ERROR ∙ INDEX ERROR ∙ VALUE ERROR |