Search results

• Comment
  In fact, the [[right]] function (<syntaxhighlight lang=apl inline>⊢</syntaxh </syntaxhighlight>{{Works in|[[APL64]]}}
  2 KB (292 words) - 14:22, 20 May 2024
• Depth
  ...ber of levels of [[Nested array model|nesting]] or [[box]]ing it exhibits. In some languages, Depth returns a negative result to indicate that not all pa Nested APLs vary in their definition of depth. They may take into account the array's [[prototy
  3 KB (549 words) - 21:14, 10 September 2022
• Atop (operator)
  {{Built-in|Atop|⍤}} is a [[primitive operator|primitive]] [[dyadic operator]] which ...for the close form and <code>@:</code> for the rankless form that appears in modern APLs.
  3 KB (410 words) - 19:05, 16 March 2024
• Reshape
  ...right argument. Elements are copied from the right argument to the result in [[ravel order]], truncating if the result has smaller [[bound]] than the ri In fact it repeats an argument of any length, singleton or otherwise. This rep
  6 KB (891 words) - 22:26, 10 September 2022
• Ceiling
  {{Built-in|Ceiling|⌈}} is a [[monadic]] [[scalar function]] that gives the [[wikiped </syntaxhighlight>{{Works in|[[Dyalog APL]]}}
  2 KB (269 words) - 21:57, 28 November 2022
• Circular
  {{Built-in|Circular|○}}, or '''Circle Function''', is a [[dyadic]] [[scalar function The Circular function, as found in today's APL implementations, was designed by [[Gene McDonnell]], based on
  7 KB (900 words) - 22:28, 10 September 2022
• Fast Fourier transform
  ...as early as 1970, with an 8-line implementation by Alan R. Jones published in [[APL Quote-Quad]].<ref>Jones, Alan R. ([[IBM]]). "Fast Fourier transform". A Fourier Transform (FFT) is a method of calculating the frequency components in a data set — and the inverse FFT converts back from the frequency domain
  4 KB (552 words) - 21:06, 10 September 2022
• Replicate
  ...|/|⌿}}, or '''Copy''' (<syntaxhighlight lang=j inline>#</syntaxhighlight>) in [[J]], is a [[dyadic function]] or [[monadic operator]] that copies each [[ ...s the right argument, returning only those elements which correspond to 1s in the provided mask.
  16 KB (2,092 words) - 19:15, 16 March 2024
• Partitioned Enclose
  :''In the [[APL2]] family and many related dialects, <syntaxhighlight lang=apl in ...determined by the left argument. It was introduced by [[NARS]] and appears in [[Dyalog APL]] and some newer dialects influenced by it.
  4 KB (424 words) - 21:33, 28 January 2024
• Simple examples
  ...n definition. It can be assigned a name for use later, or used anonymously in a more complex expression. ...e [[tally]] function, which returns here the length of (number of elements in) the argument <syntaxhighlight lang=apl inline>⍵</syntaxhighlight>. The d
  11 KB (1,379 words) - 01:32, 10 March 2024
• Reciprocal
  {{Built-in|Reciprocal|÷}} is a [[monadic]] [[scalar function]] which gives the [[wiki </syntaxhighlight>{{Works in|[[Dyalog APL]]}}
  2 KB (235 words) - 21:56, 10 September 2022
• Interval Index
  ...) and the major cell at the following index (first word on the next page). In general computer science, this problem is known as a '''predecessor search' ...grouped together. A few APL developers want to know which section they are in. Interval Index is a perfect fit for this task. The left argument should be
  9 KB (1,337 words) - 23:27, 10 March 2024
• Windowed Reduce
  ...derives a [[dyadic function]] which [[reduce]]s each overlapping "window" in its right [[argument]] of the size given by its left argument. ...o windows of size <syntaxhighlight lang=apl inline>n</syntaxhighlight>. It works like [[Reduce]], except applied on overlapping segments of an array, and bo
  3 KB (392 words) - 21:47, 18 May 2024
• Residue
  {{Built-in|Residue|<nowiki>|</nowiki>}}, '''Remainder''', or '''Modulus''' is a [[dyad For negative arguments, one may decide to return non-negative numbers in all cases or follow the sign of the dividend or the divisor. For complex ar
  2 KB (311 words) - 21:10, 10 September 2022
• Take
  ...t the left argument length match the right argument rank, and was extended in [[SHARP APL]] 19.0 to allow short left arguments. It is closely related to {{Works in|[[Dyalog APL]], [[ngn/apl]]}}
  13 KB (1,829 words) - 01:23, 2 March 2024
• Index Generator
  ...array of [[index|indices]] with [[shape]] given by the right [[argument]]. In the result, the [[element]] at each [[index]] is that index. ...h 1. In [[A+]] and [[J]] Iota of a vector returns an array which counts up in [[ravel order]], that is, it matches Iota of its [[bound]], [[reshape]]d. A
  11 KB (1,493 words) - 21:44, 25 February 2024
• Complex (function)
  ...hlight> together with initial support for complex numbers, and was adopted in [[Extended Dyalog APL]] using the [[glyph]] <syntaxhighlight lang=apl inlin ...]. [https://www.jsoftware.com/papers/APLDesignExercises.htm Some Exercises in APL Language Design]. §8 Imaginary/Complex and sample answer. Jsoftware. 2
  4 KB (508 words) - 22:25, 10 September 2022
• Index (function)
  {{Built-in|Index|⌷}}, also called '''Squad Indexing''' after the name of the [[glyph ...right argument Y. The result is identical to that of [[bracket indexing]] in that <syntaxhighlight lang=apl inline>Y[X1;X2;…;Xn] ≡ X1 X2 … Xn⌷Y<
  3 KB (398 words) - 22:04, 10 September 2022
• Ravel
  ...odel]], an array's ravel is the [[vector]] containing all its [[elements]] in [[ravel order]]. It is equivalent to [[Reshape|reshaping]] an array using i In some APLs an [[Function axis|axis]] may be specified for Ravel in order to combine only some [[Axis|axes]] of an array, or insert a length-1
  4 KB (533 words) - 08:56, 14 February 2024
• Hook
  ...r (<code>⟜</code>), which also serve the purpose of the [[Bind]] operator. In [[J]], a 2-[[train]] is a hook, while [[I]] adds the mirror image to give t ...ef>, proposed hook as the meaning of a 2-train, and this was soon included in [[J]]. This definition specifies that <syntaxhighlight lang=j inline>(F G)
  4 KB (585 words) - 06:48, 28 February 2024

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