Search results

Page title matches

• Rank (operator)
  ...rs associated with a function specifying its argument rank, see [[function rank]].'' {{Built-in|Rank|⍤}} is a [[primitive operator|primitive]] [[dyadic operator]] which applies its left [[operand]] function to [[cells]] of its arguments
  7 KB (949 words) - 23:54, 20 July 2023
• Rank operator
  #REDIRECT [[Rank (operator)]]
  29 bytes (3 words) - 15:19, 5 October 2020
• Rank Operator
  #REDIRECT [[Rank (operator)]]
  29 bytes (3 words) - 15:19, 5 October 2020

Page text matches

• Rank
  ...k]]. For the operator that applies a function at a given rank, see [[Rank (operator)]].'' ...ucture, or the length of its [[shape]]. The traditional expression for the rank of an array <syntaxhighlight lang=apl inline>A</syntaxhighlight> is <syntax
  1 KB (175 words) - 21:45, 10 September 2022
• Rank operator
  #REDIRECT [[Rank (operator)]]
  29 bytes (3 words) - 15:19, 5 October 2020
• Rank Operator
  #REDIRECT [[Rank (operator)]]
  29 bytes (3 words) - 15:19, 5 October 2020
• Function rank
  ...ines [[Close composition|"close" composition operators]] which inherit the rank of their right operand—the [[derived function]] produced by such a compos ....</ref> In [[J]] every function, primitive or user-defined, has a function rank.
  4 KB (618 words) - 18:06, 29 January 2024
• Frame
  ...duced by applying [[Enclose]] or [[Box function|Box]] with [[Rank operator|rank]] k to an array. When representing arrays as nested lists as in [[K]], this The frame is complementary to the [[cell shape]] for cells of a particular rank: while the frame occupies leading axes (and its [[shape]] is a [[prefix]] o
  1 KB (191 words) - 22:25, 10 September 2022
• Operand
  ...e|valence]] is inherent in the operator rather than determined by context. Operator valence is thus substantially different from [[function valence]] as [[mona ...operator application. Some APLs resolve this conflict by stranding before operator application while others apply operators before stranding.
  1 KB (213 words) - 15:15, 30 April 2020
• Close composition
  ...ow this pattern, while in J, both close and non-close forms (with a result rank of infinity, matching the definition in most modern APLs) are provided. ! Operator !! SHARP !! J close !! J non-close !! Modern APL
  2 KB (258 words) - 02:12, 27 August 2023
• Leading axis agreement
  ...nce all functions, including dyadic scalar functions, have [[function rank|rank]], leading axis agreement is a special case of [[frame agreement]]. ...s one step further, allowing the lower-rank array argument to have nonzero rank, as long as the leading dimensions match:
  3 KB (413 words) - 18:58, 19 July 2023
• Major cell
  ...ank <syntaxhighlight lang=apl inline>¯1</syntaxhighlight> using the [[Rank operator]]. Functions designed to follow leading axis theory often manipulate the ma ...e>A</syntaxhighlight>'s major cells using [[Enclose]] with [[Rank operator|rank]] <syntaxhighlight lang=apl inline>¯1</syntaxhighlight>:
  2 KB (306 words) - 23:27, 10 March 2024
• Terminology
  ...ll]] || a [[cell]] of an [[array]] which has [[rank]] one smaller than the rank of the array, or equal to it if the array is a [[scalar]] || Element | [[Matrix]] || an [[array]] of [[rank]] 2 || 2D array, Table
  3 KB (410 words) - 10:54, 10 August 2022
• Conformability
  ...lt shape are often considered part of conformability as well. The [[Each]] operator also checks conformability when called dyadically, and some functionality, * Otherwise, it is the shape of the argument with the largest rank (this condition is only possible with [[singleton extension]]).
  3 KB (408 words) - 03:17, 20 February 2024
• Promote
  ...ing its argument, can also be interpreted as Promote because [[depth]] and rank are equivalent in the [[list model]] of arrays. ...s this allows the axis to be placed in any other position using the [[Rank operator]].
  2 KB (244 words) - 01:22, 6 February 2024
• Fill element
  | <syntaxhighlight lang=apl inline>⍤</syntaxhighlight> ||colspan=2| [[Rank operator]] Each operator in the table uses fills to force the results from its left operand to have
  3 KB (345 words) - 14:19, 16 May 2023
• Expand
  ...lt-ins|Expand|<nowiki>\</nowiki>|⍀}} is a [[dyadic function]] or [[monadic operator]] that copies each [[element]] of the right [[argument]] a given number of ...resolved by making Expand an operator itself, and sometimes by [[function-operator overloading]] allowing both syntactic elements to coexist.
  3 KB (353 words) - 22:11, 10 September 2022
• Atop (operator)
  {{Built-in|Atop|⍤}} is a [[primitive operator|primitive]] [[dyadic operator]] which takes two [[function]] [[operand]]s and produces a [[derived functi ...highlight lang=apl inline>f⍥g</syntaxhighlight> has the overall [[function rank]] of <syntaxhighlight lang=apl inline>g</syntaxhighlight>. J uses <code>@</
  3 KB (410 words) - 19:05, 16 March 2024
• Rank (operator)
  ...rs associated with a function specifying its argument rank, see [[function rank]].'' {{Built-in|Rank|⍤}} is a [[primitive operator|primitive]] [[dyadic operator]] which applies its left [[operand]] function to [[cells]] of its arguments
  7 KB (949 words) - 23:54, 20 July 2023
• Split
  ...t-in|Split|↓}} is a [[monadic]] [[primitive function]] which reduces the [[rank]] of its [[argument]] by converting one of its [[axis|axes]] to one level o ...ht> is <syntaxhighlight lang=apl inline>¯1+≢⍴Y</syntaxhighlight> (original rank minus 1), its [[shape]] is <syntaxhighlight lang=apl inline>(K≠⍳≢⍴Y
  4 KB (397 words) - 10:55, 11 September 2022
• Laminate
  ...ight lang=apl inline>,[⎕IO-0.5]</syntaxhighlight> case only, as the [[Rank operator]] can be used to add the axis in a later position, in accordance with [[lea ...th [[Catenate]], a scalar argument is subject to [[scalar extension]]: its rank is brought up to match that of the other argument by repeating its value.
  4 KB (527 words) - 01:30, 18 March 2024
• Depth (operator)
  :''This article is about the operator. See [[Depth]] for the number associated with every array and the function {{Built-in|Depth|⍥}} is a [[primitive operator|primitive]] [[dyadic operator]] which applies its left [[operand]] function to [[sub-array]]s of its argu
  6 KB (753 words) - 22:22, 7 February 2024
• Over
  {{Built-in|Over|⍥}} is a [[primitive operator|primitive]] [[dyadic operator]] which takes two [[function]] [[operand]]s and produces a [[derived functi ...it has the same behaviour as if the [[Beside]] or [[Atop (operator)|Atop]] operator had been used:
  3 KB (428 words) - 21:33, 28 January 2024
• Table
  :''This page is about the function that reshapes into a table. For the operator that generates a table of all combinations, see [[Outer Product]].'' For arrays of [[rank]] 1 or higher, the result is identical to applying Ravel to major cells:
  4 KB (381 words) - 15:33, 17 March 2024
• Each
  {{Built-in|Each|¨}} is a [[primitive operator|primitive]] [[monadic operator]] which applies its [[operand]] to each [[element]] of the [[argument]]s, a ...Under]] operator with [[close composition]] along with the [[Function rank|rank]]-0 function [[Disclose]] (or Unbox). In [[SHARP APL]] this is written <syn
  5 KB (488 words) - 22:16, 10 September 2022
• Scalar extension
  ...ally extending the scalar to function as though it were an array of higher rank. === Rank extension ===
  8 KB (947 words) - 03:06, 20 February 2024
• Scan
  ...can|<nowiki>\</nowiki>|⍀}} is a [[primitive operator|primitive]] [[monadic operator]] which takes a [[dyadic function]] [[operand]] and produces a [[monadic fu ...tained. That being said, unlike [[Reduce]], [[Scan]] does not reduce the [[rank]] of its argument, i.e. performing a scan over an N-dimensional [[array]] w
  1 KB (165 words) - 21:02, 10 September 2022
• Rationalized APL
  | function styles = definition operator ...introduced were later incorporated into [[J]]. It also featured the [[Rank operator]], invented by [[Arthur Whitney]] the previous year, just prior to its incl
  1 KB (170 words) - 08:49, 26 July 2021
• Leading axis theory
  ...tly using [[function rank]] or explicitly using the [[Rank (operator)|Rank operator]]. It was initially developed in [[SHARP APL]] in the early 1980s and is no ...perator is the reason to define functions on the leading axes: by applying Rank to a leading-axis function, the function can be made to work on any axis or
  10 KB (1,238 words) - 21:46, 10 September 2022
• Strand notation
  ...amming if unrelated arrays are stranded together. This issue occurs when [[operator]]s are allowed to take array [[operand]]s, and can be resolved by inserting ...APL]], [[NARS2000]], [[APL.68000]], and others, arrays are stranded before operator or function evaluation.
  3 KB (397 words) - 10:34, 11 September 2022
• Mix
  ...e same shape, or they may be extended in shape (with [[fill element]]s) or rank to fit a common shape. In all APLs Mix allows a [[simple array]] argument, ...and combine the results. Based on SHARP's definition of [[Rank (operator)|Rank]], the arrays to be combined were required to have the same [[shape]], and
  7 KB (900 words) - 18:27, 29 January 2024
• Rotate
  ...using <syntaxhighlight lang=apl inline>⊖</syntaxhighlight> with the [[Rank operator]]. ...arrays can be rotated on an arbitrary axis if [[function axis]] or [[Rank operator]] is supported:
  5 KB (626 words) - 22:15, 10 September 2022
• Axis
  ...ne dimension along which the [[element]]s of an array are organized. The [[rank]] of an array is the number of axes it has, and the [[shape]] is the list o ...ite this, the choice to make a positive operand to Rank specify a [[cell]] rank, while a negative operand specifies a [[frame]] length, weakly suggests an
  3 KB (444 words) - 22:29, 10 September 2022
• Cell
  ...ht> are called '''k-cells''' of an array. A [[major cell]] is a cell whose rank is one less than the entire array, or a 0-cell of a [[scalar]]. The k-cells of an array with [[rank]] <syntaxhighlight lang=apl inline>r</syntaxhighlight> share the last <synt
  7 KB (1,106 words) - 22:16, 10 September 2022
• Under
  ...nline>¨</syntaxhighlight>), is a [[primitive operator|primitive]] [[dyadic operator]] which takes two [[function]] [[operand]]s. It pre-processes its argument( ...highlight lang=apl inline>f¨g</syntaxhighlight> has the overall [[function rank]] of <syntaxhighlight lang=apl inline>g</syntaxhighlight>. This allows <syn
  5 KB (664 words) - 13:35, 17 February 2024
• Subarray
  ...he term sub-array may also be used to refer part of an array with lesser [[rank]] (i.e. a [[cell]]) or [[depth]].'' ...ght call such subarrays ''equal-rank'' subarrays. Otherwise a subarray has rank less than or equal to its containing array.
  3 KB (442 words) - 09:27, 14 September 2022
• Empty array
  ...using the [[Rank operator]] on an array with no [[cell]]s of the specified rank. Because the shape of each result cell might be determined by values in an ...inal result. In this case, this succeeds in finding the appropriate result rank but not the desired shape.
  5 KB (810 words) - 22:29, 10 September 2022
• Deal
  ...ng=apl inline>?⍤0</syntaxhighlight>, which uses the [[Rank (operator)|rank operator]] <syntaxhighlight lang=apl inline>⍤</syntaxhighlight>.
  4 KB (521 words) - 16:54, 8 February 2023
• Function axis
  ...cification in favor of the [[Rank operator]] because it is a fully general operator while the behavior of functions with axis must be defined for each function ...erride [[conformability]] rules: it specifies , for each axis in the lower-rank (or left, in case of a tie) argument, which axis in the other argument it i
  6 KB (878 words) - 05:12, 11 November 2022
• Ngn/apl
  * [[Rank (operator)|Rank (operator]] (<syntaxhighlight lang=apl inline>⍤</syntaxhighlight>) * the identity element operator (<syntaxhighlight lang=apl inline>⍁</syntaxhighlight>)
  5 KB (553 words) - 12:25, 31 August 2023
• Raze
  ...hape or an error results; in J, lower-rank arrays are promoted to a higher rank and arrays are padded with fills to a common major cell shape. ...rgument as singleton vectors, a convention which may be viewed as [[scalar rank extension]] or as a result of the idea that a scalar's only [[major cell]]
  6 KB (812 words) - 23:25, 29 January 2024
• Reduce
  ...uction''' or '''Insert''', is a [[primitive operator|primitive]] [[monadic operator]] which takes a [[dyadic function]] [[operand]], inserts it between the [[e ...r an axis other than the first is performed via the [[Rank (operator)|Rank operator]], which [[mix|mixes]] the results into a flat array.
  4 KB (570 words) - 19:11, 26 June 2023
• Reverse
  ...using <syntaxhighlight lang=apl inline>⊖</syntaxhighlight> with the [[Rank operator]]. ...he <syntaxhighlight lang=apl inline>1+r-k</syntaxhighlight>'th axis of a [[rank]]-<syntaxhighlight lang=apl inline>r</syntaxhighlight> array.
  6 KB (554 words) - 22:20, 10 September 2022
• Outer Product
  {{Built-in|Outer Product|<nowiki>∘.</nowiki>}}, or '''Table''' is a [[monadic operator]], which will produce a [[dyadic function]] when applied with a [[dyadic fu ...eft. For [[backwards compatibility|historical reasons]], the outer product operator is a [[bi-glyph]] denoted as <syntaxhighlight lang=apl inline>∘.</syntaxh
  8 KB (948 words) - 00:47, 19 March 2024
• Assignment
  ...th an [[array]] value. Some dialects also allow assignment of function and operator values using the assignment arrow. In [[defined function]]s, assignment is ...[rank]] arrays, the number of semicolons needed is one less than the array rank.
  4 KB (522 words) - 21:32, 9 March 2024
• ISO/IEC 13751:2001
  ...eatures not present in APL2, such as the [[Commute]] and [[Rank (operator)|Rank]] operators, the [[Identity function]]s, and [[GCD]] and [[LCM]] extending
  2 KB (308 words) - 13:04, 10 March 2024
• Tally
  ...in a higher-rank array. Tally applied to an array's [[shape]] gives its [[rank]]. ...s to count the major cells by turning each into a scalar 1 with the [[Rank operator]], then adding them up:
  3 KB (443 words) - 10:59, 11 September 2022
• Frame agreement
  ...rank (either [[Rank operator|derived]] and/or, when supported, [[function rank|native]]). The [[frame]]s must either be identical, or one must be [[empty] ...refix of the other. In J, because every function has associated [[function rank|ranks]], frame agreement generalizes [[leading axis agreement]].
  7 KB (779 words) - 14:23, 26 August 2023
• Ranking poker hands
  ...syntaxhighlight> below transforms a representation of a poker hand into a "rank" array so that the ordering of ranks under [[total array ordering]] is the ...s a single card by [[Pick|picking]] the appropriate character for suit and rank. We use the character <syntaxhighlight lang=apl inline>'T'</syntaxhighlight
  13 KB (1,398 words) - 22:22, 10 September 2022
• Function array
  .../syntaxhighlight> in the [[dfns workspace]] wraps this functionality in an operator.<ref>[[Dfns workspace]]. [https://dfns.dyalog.com/n_fnarray.htm <syntaxhigh
  2 KB (228 words) - 21:42, 2 January 2023
• Take
  ...ith the requirement that the left argument length match the right argument rank, and was extended in [[SHARP APL]] 19.0 to allow short left arguments. It i A higher-[[rank]] array can be shortened by using a left argument with one element for each
  13 KB (1,829 words) - 01:23, 2 March 2024
• SAX
  All scalar functions have rank zero. ! Glyph !! Rank !! Monadic !! Ranks !! Dyadic
  16 KB (1,327 words) - 22:20, 7 May 2024
• A+
  ...various novelties like symbols as a [[simple scalar]] type and the [[Rank operator]]. | <syntaxhighlight lang=apl inline>@</syntaxhighlight> || [[Rank operator|Rank]] ||
  9 KB (859 words) - 02:29, 5 March 2024
• Cut
  ...t lang=j inline>;.</syntaxhighlight> in [[J]], is a [[primitive]] [[dyadic operator]] first defined in [[Rationalized APL]] and implemented in [[SHARP APL]]. I * With operand 0, [[rank]]-2 [[cell]]s of the left argument specify [[subarray]]s of the right argum
  2 KB (252 words) - 19:34, 31 January 2024
• APL Show
  ...ding strengths; stranding, bracket axis and indexing, issues with the rank operator, etc. ...nza] || Constraints on primitive proliferation, wishes, the [[Under]]/Dual operator, and its issues.
  3 KB (395 words) - 10:40, 12 December 2023
• Suffix
  ...eory]], an array may be considered a suffix of another array of the same [[rank]] if the same relation holds with [[major cell]]s in place of elements. The ...elation is written more succinctly in a [[tacit]] style using the [[Over]] operator.
  2 KB (271 words) - 01:19, 2 March 2024
• Dyalog webinar
  ...|| [[Richard Park]] || [https://dyalog.tv/Webinar/?v=IBct81IopRk The Rank Operator] ...rk]] || [https://dyalog.tv/Webinar/?v=5wW76XX0kqk Advanced Use of The Rank Operator]
  8 KB (1,104 words) - 06:18, 5 February 2024
• Timeline of APL primitives
  ...ending [[Compress]] ([[Bob Bernecky|Bernecky]] 1980) <br/> dyadic and high-rank [[Grade]] (proposed Howard Smith 1979) ...[[Under]] (<syntaxhighlight lang=apl inline>⍢</syntaxhighlight>), [[Power (operator)|Power]] (<syntaxhighlight lang=apl inline>⍣</syntaxhighlight>), [[Window
  8 KB (788 words) - 22:14, 18 March 2024
• Replicate
  ...nline>#</syntaxhighlight>) in [[J]], is a [[dyadic function]] or [[monadic operator]] that copies each [[element]] of the right [[argument]] a given number of ...solved by making Replicate an operator itself, and sometimes by [[function-operator overloading]] allowing both syntactic elements to coexist.
  16 KB (2,092 words) - 19:15, 16 March 2024
• Kap
  | <syntaxhighlight lang=apl inline><</syntaxhighlight> || [[Increase rank]] || [[Less than]] | <syntaxhighlight lang=apl inline>></syntaxhighlight> || [[Decrease rank]] || [[Greater than]]
  11 KB (1,055 words) - 14:37, 11 March 2024
• Mesh
  ...lang=apl inline>a(u\)b</syntaxhighlight> (requiring [[Expand]] to be an [[operator]]) for <math>\backslash{}a,u,b\backslash</math>.<ref>[[Bob Bernecky|Berneck If [[Mask]] is available, for instance as a [[monadic operator]], then Mesh can be obtained by masking together the [[Expand|expansion]] o
  8 KB (1,168 words) - 22:13, 10 September 2022
• BQN
  | <code>=</code> || [[Rank]] || [[Equals]] ...adic operator|1-modifiers]] in BQN use superscript symbols, while [[Dyadic operator|2-modifiers]] use symbols with a circle, but not one with a line through it
  11 KB (1,330 words) - 15:35, 6 March 2024
• Inner Product
  {{Built-in|Inner Product|<nowiki>.</nowiki>}} is a [[dyadic operator]] that produces a [[dyadic function]] when applied with two dyadic function ...ations. If the arguments themselves are simply vectors, there is only one rank-1 cell in each argument, so this results in the following application patte
  13 KB (1,585 words) - 00:19, 10 March 2024
• APL2C
  ...1]], including some features such as the [[Commute]] and [[Rank (operator)|Rank]] operators that were not widely supported at the time of its initial relea
  4 KB (556 words) - 14:59, 10 March 2024
• NARS2000
  ...l inline>⍸</syntaxhighlight> || [[Indices]] || Array Lookup (high-rank [[Index-Of]]) ...g=apl inline>⍤</syntaxhighlight> || Dyadic ||colspan=2| [[Rank operator|Rank]]
  10 KB (1,101 words) - 02:29, 9 March 2024
• Complex number
  ...al part and a left argument of 11 gets the imaginary part. With the [[Rank operator]], Circle can be used to convert a [[shape]] <syntaxhighlight lang=apl inli
  2 KB (354 words) - 22:08, 10 September 2022
• Timeline of influential array languages
  ...r on [[Ken Iverson|Iverson]]'s latest thinking on APL, includes the [[Rank operator]] added to [[SHARP APL]] later that year
  2 KB (337 words) - 06:36, 17 March 2024
• Arthur Whitney
  ...rson]] and [[Roger Hui]]. In 1982 he is credited with inventing the [[Rank operator]] while travelling to [[APL82]].<ref name="hopl4">[[Roger Hui]] and [[Morte ...ome part of J, such as [[prefix agreement]]<ref name="hopl4"/>, the [[Rank operator]], and [[Tally]].
  6 KB (916 words) - 17:37, 19 March 2024
• SHARP APL
  ...|| Compress extended to [[Replicate]]; [[LCM]] and [[GCD]]; [[Grade]] on rank >1<ref>IPSA. [https://www.softwarepreservation.org/projects/apl/Manuals/Sha | 15 || 1983-05 || [[Rank operator]] and [[Function rank]]; [[Left|Lev]] (<syntaxhighlight lang=apl inline>⊣</syntaxhighlight>), [
  22 KB (2,021 words) - 22:59, 7 May 2024
• Extended Dyalog APL
  ...Dyalog is also planning to add [[Reverse Compose]], [[From]], and [[Depth (operator)|Depth]]. ...hoe || <syntaxhighlight lang=apl inline>∪</syntaxhighlight> || 🔵 || allows rank>1
  13 KB (1,445 words) - 15:08, 6 March 2024
• Bob Bernecky
  ...arison tolerance]], [[Replicate]] (extending [[Compress]]), and the [[Rank operator]] in [[SHARP APL]]. He remained at IPSA for three years after it was acquir * [[APL88]]: [https://doi.org/10.1145/55626.55632 An introduction to function rank].
  6 KB (787 words) - 06:49, 3 November 2021
• Stencil
  ...om a subset (specifically, case 3) of the functionality of [[J]]'s [[Cut]] operator (<syntaxhighlight lang=j inline>;.3</syntaxhighlight>),<ref>[[Eugene McDonn If the number of columns in the right operand to stencil does not match the rank of the right argument, the windowing is applied on the major cells:
  8 KB (638 words) - 21:11, 28 January 2024
• Array notation design considerations
  ...s]], forming a new array of rank one-higher than the rank of the highest-[[rank]] constituent [[cell]]. However, few [[fonts]] support these glyphs. ...for a collection of major cells, thereby handling both vectors and higher-rank arrays, a problem presents itself with [[axis|axes]] of length 1, because b
  22 KB (3,134 words) - 12:26, 5 May 2023
• Learning resources
  * [[User-defined operator]]s * [[Power (operator)|Power operator]]
  10 KB (1,442 words) - 13:09, 4 March 2024
• Roger Hui
  * [[APL95]]: [https://www.jsoftware.com/papers/rank.htm Rank and uniformity]. * Dyalog '09 26: [https://dyalog.tv/Dyalog09/?v=ui76NE5cMWo The Rank Operator] ([https://www.dyalog.com/uploads/conference/dyalog09/presentations/26_Hui_
  20 KB (2,702 words) - 10:41, 20 August 2023
• Prototype
  The [[Rank operator]] combines its left operand's result cells by extending them to a common sh
  5 KB (495 words) - 13:28, 24 October 2022
• J
  ...windowed reduction]]s (yielding the [[Prefix operator|prefix]] and [[infix operator]]s). However, J concepts such as [[function train]]s and the [[Indices]] fu ...s to two major breakthroughs made that decade: the invention of the [[Rank operator]] by [[Arthur Whitney]] in 1982 and subsequent development of [[leading axi
  17 KB (2,223 words) - 20:31, 14 April 2024
• Identity
  ...y]] result to be shown. They can also be combined with an array-oriented [[operator]] to perform structural manipulations on arrays. Identity functions are a c ...rgument while ignoring the right—is attained by using [[Atop]] (either the operator, or a 2-train) with Left as the right operand.
  7 KB (948 words) - 11:06, 7 March 2023
• Conway's Game of Life
  ...hed. More recently, it is sometimes seen as a use case for the [[Stencil]] operator, which provides a concise way to work on three-by-three neighborhoods as us ...ngle step, and showed that the same could be done with [[APL2]]'s [[Each]] operator. He first presented versions using two eight-element rotations vectors, and
  9 KB (1,291 words) - 19:38, 31 January 2024
• Comparison of APL dialects
  ...yntaxhighlight lang=apl inline>></syntaxhighlight>, and given a [[function rank]] of 0, which causes it to behave as [[Mix]]. [[First]] is not a primitive. Dialects offer a variety of ways to create [[function]]s and [[operator]]s. The three major branches are [[defined function]]s, which use a header
  21 KB (1,991 words) - 06:36, 17 March 2024
• Dyalog APL versions
  ...(operator)|Power]] (<syntaxhighlight lang=apl inline>⍣</syntaxhighlight>) operator was added, with support for [[inverse]]s. ...and repair [[component file]]s, were added. The way the [[Outer Product]] operator computes the [[prototype]] of an [[empty]] result was changed: rather than
  33 KB (4,425 words) - 23:27, 10 March 2024
• German terminology
  ...imitive operator]] || Elementaroperator<ref name="Lochner" />, Einfacher Operator | [[Rank]] || Rang
  15 KB (1,754 words) - 14:44, 4 March 2024
• APL Wiki logo
  ...taxhighlight> were swapped, we wouldn't need that parenthesis. Enter the [[operator]] (higher-order function) [[swap]] (<syntaxhighlight lang=apl inline>⍨</s ...erator which shares its [[Glyph|symbol]] with the above-mentioned [[swap]] operator. There's no ambiguity here. ''Swap'' swaps the two arguments, while ''selfi
  21 KB (2,593 words) - 21:38, 10 September 2022
• Humour
  ...nstant) array left-[[argument]] or letting them be the [[operand]] of an [[operator]]. ...ith no obvious system as to which answer is chosen. The full power of this operator is not documented.
  15 KB (2,230 words) - 14:57, 4 March 2024
• K
  ...rt because it represents arrays as [[list model|nested lists]], unifying [[rank]] and [[depth]], and encourages [[wikipedia:Scheme_(programming_language)|S | <code>/</code> || over (includes [[Reduce]] and [[Power operator|Power]])
  7 KB (674 words) - 16:43, 6 March 2024
• Backwards compatibility
  ...in the future indefinitely. For example, [[Membership]]'s behavior on high-rank arrays is incompatible with and less useful than [[major cell search]], but ...relying on the continued prohibition against immediately adjacent [[dyadic operator]]s other than for [[outer product]] (<syntaxhighlight lang=apl inline>∘.g
  7 KB (1,014 words) - 23:29, 10 March 2024
• Dyalog APL
  ...as also popularised [[SHARP APL]] and [[J]] innovations such as the [[Rank operator]] and [[train]]s among nested APLs. ...es on flat arrays, and brought concepts such as the [[Rank (operator)|Rank operator]], [[trains]], and [[Function composition|composition operators]], namely [
  32 KB (3,640 words) - 23:27, 10 March 2024
• Mnemonics
  <syntaxhighlight lang=apl inline>⍨</syntaxhighlight> is a monadic operator that looks like a face. When its derived function is applied monadically, i ...l inline>↓</syntaxhighlight> ([[Mix]] and [[Split]]) increase and decrease rank (if possible) when used monadically.
  28 KB (3,594 words) - 08:54, 3 August 2023
• Jay Foad
  ...olved in designing several extensions to Dyalog primitives, including high-rank [[Unique]] in [[Dyalog APL 17.0]] and the decision to allow duplicate left
  6 KB (887 words) - 14:50, 4 March 2024
• APL Campfire
  ...sted]] split, [[Ken Iverson]]'s [[Rationalized APL]] and [[J]], the [[Rank operator]], [[IBM]]/Insight Systems/[[Adaytum]]/Cognos/Dyadic Systems/[[Dyalog Ltd.] ...(<syntaxhighlight lang=apl inline>⊤</syntaxhighlight>) to work on higher [[rank]] arrays. Ragged [[array]]s vs [[nested array]]s. <syntaxhighlight lang=apl
  13 KB (1,708 words) - 23:39, 15 April 2024
• Ken Iverson
  ...ion]], which may have been named in part for how it reduces the argument's rank by one. It's possible that Iverson coined the term "bubble sort", as A Prog ...tware.com/papers/satn42.htm Determinant-Like Functions Produced by the Dot-Operator]. 1982-04-01.
  7 KB (953 words) - 01:59, 8 March 2024
• Performance
  ...me shape into a higher-rank array (the [[Mix]]ed nested array); the [[Rank operator]] can make working with such arrays easier. [[Roger Hui]] has advocated the
  15 KB (2,326 words) - 13:12, 31 August 2023
• Adám Brudzewsky
  ...ity, and are sometimes adopted by Dyalog or [[dzaima/APL]]. The [[Constant operator]] appeared first in Extended Dyalog, as did the versions of [[Atop]] (<synt * [https://www.arraycast.com/episodes/episode28-rank-and-leading-axis Rank and Leading Axis Theory]
  14 KB (1,892 words) - 09:42, 26 January 2024
• Dyalog user meeting
  * '''26: The Rank Operator''', [[Roger Hui]] ([https://www.dyalog.com/uploads/conference/dyalog09/pres * '''D08: Rank and Friends''', [[Roger Hui]] ([https://www.dyalog.com/uploads/conference/d
  135 KB (18,206 words) - 19:11, 20 February 2024
• APL conference
  * '''A virtual-variable name-specification operator for high level languages'''. A. J. Surkan. [https://doi.org/10.1145/800269. * '''An extension of the domain of the APL domino function to rank deficient linear least squares systems'''. Augustin A. Dubrulle. [https://d
  168 KB (20,470 words) - 00:01, 16 April 2024