Search results

Jump to navigation Jump to search
  • {{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
  • ...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
  • ...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
  • ...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
  • ...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
  • ...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
  • .../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
  • ...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
  • All scalar functions have rank zero. ! Glyph !! Rank !! Monadic !! Ranks !! Dyadic
    16 KB (1,323 words) - 03:23, 11 May 2024
  • ...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
  • ...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
  • ...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
  • ...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
  • ...|| [[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
  • ...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) - 17:11, 31 May 2024
  • ...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
  • | <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
  • ...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
  • | <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
  • {{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

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)