Scalar function: Difference between revisions

From APL Wiki
Jump to navigation Jump to search
(Remove derived op to work in dzaima/APL)
Line 86: Line 86:
└──┴─┴────┘
└──┴─┴────┘
</source>
</source>
{{Works in|[[Extended Dyalog APL]], [[dzaima/APL]]}}
{{Works in|[[Extended Dyalog APL]], [[dzaima/APL]] since 2020-03-01}}
In [[dzaima/APL]] the [[dyadic]] form of Depth is not yet implemented, so this definition will only work for monadic <source lang=apl inline>NonScalarFn</source>.
 
In dialects that support [[dfn]]s, this operator can be defined<ref>[[John Scholes]], [https://dfns.dyalog.com/n_perv.htm perv] (Scalar pervasion). dfns workspace, 2019-02-17.</ref> as:
In dialects that support [[dfn]]s, this operator can be defined<ref>[[John Scholes]], [https://dfns.dyalog.com/n_perv.htm perv] (Scalar pervasion). dfns workspace, 2019-02-17.</ref> as:



Revision as of 09:01, 1 April 2020

A scalar function is one of a class of primitive functions that apply to arguments one element at a time. Dyadic scalar functions pair elements of their arguments based on conformability rules, and thus are subject to scalar extension. In nested array languages scalar functions recursively descend into nested arrays until they can be applied to simple scalars; in flat array languages they usually do not apply inside boxes.

Only a particular valence of a function is labelled "scalar". The scalar monad Not usually shares the glyph ~ with non-scalar dyad Without, and similarly scalar Roll and non-scalar Deal are both written ?.

Standard scalar functions

Most APLs use a set of scalar functions that was worked out fairly early in APL's development. These are listed in this section.

Monadic function Glyph Dyadic function
Conjugate + Plus
Negate - Minus
Signum or Direction × Times
Reciprocal ÷ Divide
Floor Minimum
Ceiling Maximum
Exponential * Power function
Natural Logarithm Logarithm
Magnitude or Absolute value | Residue
Pi Times Circle function
Factorial ! Binomial coefficient or combination function
Roll ?
Not ~
Logical And
Logical Or
Nand
Nor
< Less than
Less than or equal to
= Equal to
Greater than or equal to
> Greater than
Not equal to

Additional scalar functions

Very few additional scalar functions have been added later in various dialects:

Monadic function Glyph Dyadic function
Square Root Nth Root
Type or
Lowest Common Multiple (LCM)
Greatest Common Divisor (GCD)

User defined scalar functions

In nested array model dialects with the Depth operator (), any function can be used as a scalar function (that is, be applied to all simple scalars) using the perv←⍥0:

Try it online!

      NonScalarFn←{⍵:'t' ⋄ 'f'}
      (NonScalarFn⍥0) (0 1) 1 (⊂1 0)
┌──┬─┬────┐
│ft│t│┌──┐│
│  │ ││tf││
│  │ │└──┘│
└──┴─┴────┘
Works in: Extended Dyalog APL, dzaima/APL since 2020-03-01

In dzaima/APL the dyadic form of Depth is not yet implemented, so this definition will only work for monadic NonScalarFn.

In dialects that support dfns, this operator can be defined[1] as:

perv←{⍺←⊢               ⍝ Scalar pervasion
    1=≡⍺ ⍵ ⍵:⍺ ⍺⍺ ⍵     ⍝ (⍺ and) ⍵ depth 0: operand fn application
             ⍺ ∇¨⍵      ⍝ (⍺ or) ⍵ deeper: recursive traversal.
}
Works in: Dyalog APL

External links


APL features [edit]
Built-ins Primitives (functions, operators) ∙ Quad name
Array model ShapeRankDepthBoundIndex (Indexing) ∙ AxisRavelRavel orderElementScalarVectorMatrixSimple scalarSimple arrayNested arrayCellMajor cellSubarrayEmpty arrayPrototype
Data types Number (Boolean, Complex number) ∙ Character (String) ∙ BoxNamespaceFunction array
Concepts and paradigms Conformability (Scalar extension, Leading axis agreement) ∙ Scalar function (Pervasion) ∙ Identity elementComplex floorArray ordering (Total) ∙ Tacit programming (Function composition, Close composition) ∙ GlyphLeading axis theoryMajor cell search
Errors LIMIT ERRORRANK ERRORSYNTAX ERRORDOMAIN ERRORLENGTH ERRORINDEX ERRORVALUE ERROREVOLUTION ERROR
  1. John Scholes, perv (Scalar pervasion). dfns workspace, 2019-02-17.