Search results
Jump to navigation
Jump to search
- ...[[enclose]]d array, and an array of boxes (a "boxed array") to a [[nested array]]. ...arrays which contain both numbers and characters, as well as arrays with a nested structure.1 KB (239 words) - 15:27, 30 April 2020
- :''This article is about the items of an array. For the set function, see [[Membership]]. ...y theory]] each element of an array is another array, and an element of an array can be retrieved using the [[Pick]] function. [[Stranding]] forms a [[vecto1 KB (197 words) - 07:16, 29 June 2020
- {{Infobox array language | array model = [[flat array model|flat]] arrays with nested lists2 KB (209 words) - 14:08, 12 April 2021
- The following array family programming languages, and papers describing languages, have had a major influence on commonly-used APLs. ...on of APL", [[Jim Brown]]'s Ph.D. thesis, describes a [[Nested array model|nested]] APL which later becomes the basis of [[APL2]]2 KB (337 words) - 06:36, 17 March 2024
- {{Infobox array language | array model = [[nested array model|nested]]2 KB (220 words) - 03:01, 21 February 2024
- {{Infobox array language | array model = [[nested array model|nested]]2 KB (260 words) - 19:02, 7 March 2023
- ...ed simple in most contexts, although they may have depth greater than 1 in languages that use the [[prototype]] to determine depth. ...ke numbers and characters. Arrays which would not be representable in flat array theory—those which contain a mixture of simple scalar types, or contain b1 KB (175 words) - 10:46, 20 April 2021
- :''This page is about array depth, a number associated with every array. For the operator that applies a function at a given depth, see [[Depth (op ...Depth returns a negative result to indicate that not all paths through the array have the same depth.3 KB (549 words) - 21:14, 10 September 2022
- {{Infobox array language | array model = [[nested array model|nested]]2 KB (264 words) - 22:44, 24 January 2024
- {{Infobox array language | array model = [[List model|Lists]]2 KB (212 words) - 23:27, 24 January 2024
- {{Infobox array language | array model = [[nested array model|nested]]2 KB (217 words) - 00:41, 25 November 2020
- {{DISPLAYTITLE:dzaima/APL}}{{Infobox array language | array model = [[nested array model|nested]] or [[flat array model|flat]]3 KB (393 words) - 03:39, 21 February 2024
- {{Infobox array language | array model = [[Nested array model|nested]]2 KB (245 words) - 23:28, 22 February 2024
- {{Infobox array language | array model = [[based array model|based]]2 KB (190 words) - 11:28, 20 April 2021
- ...Pervasion can be seen as and modelled by [[recursion|recursing]] into all nested elements until the function can be applied to all simple scalars.3 KB (387 words) - 21:06, 10 September 2022
- {{Infobox array language | array model = [[List model|Lists]] compiled to [[Flat array model|flat]]2 KB (213 words) - 23:06, 24 January 2024
- ...ment]] or another relevant array is used. The fill element is usually that array's [[prototype]]. [[J]] allows the fill to be specified using the fit conjun Fills are one way to convert an [[empty array]] into a non-empty array. [[Reduction]] along an empty [[axis]] also produces such a transition, but3 KB (345 words) - 14:19, 16 May 2023
- {{Infobox array language | array model = [[nested]]4 KB (448 words) - 07:43, 25 January 2024
- ...them until reaching [[simple scalars]]; in [[Flat array model|flat]] array languages they usually do not apply inside [[boxes]]. Functions which are not scalar,4 KB (503 words) - 22:25, 10 September 2022
- {{Infobox array language | array model = [[nested array model|nested]]6 KB (626 words) - 02:40, 8 March 2024