Ravel order: Difference between revisions
Jump to navigation
Jump to search
Miraheze>Marshall (Created page with "In the APL array model, '''ravel order''' is the ordering of elements in the ravel of an array. When an array is displayed, this corresponds to the reading order f...") |
Miraheze>Marshall No edit summary |
||
Line 4: | Line 4: | ||
The ravel order is also used to [[reshape]] an array. | The ravel order is also used to [[reshape]] an array. | ||
== External links == | |||
* [https://www.sacrideo.us/apl-a-day-4-arrays-have-elements/ Arrays have elements], [https://www.sacrideo.us/apl-a-day-6-indices-and-encoding/ Indices and Encoding] (part of [https://www.sacrideo.us/tag/apl-a-day/ APL a Day]) | |||
{{APL programming language}} | {{APL programming language}} |
Revision as of 09:14, 15 November 2019
In the APL array model, ravel order is the ordering of elements in the ravel of an array. When an array is displayed, this corresponds to the reading order for English: left to right, then top to bottom. In APL implementations, elements of an array are universally stored in ravel order.
The ravel order defines, or is defined by, a hierarchy of axes with one direction called leading and the other trailing. By convention, the leading axes are those with lower indices while trailing axes have higher indices. This convention causes the ravel order of array indices to be the same as their lexicographical order. For this reason, ravel order is sometimes called "index order".
The ravel order is also used to reshape an array.
External links
- Arrays have elements, Indices and Encoding (part of APL a Day)