First: Difference between revisions

From APL Wiki
Jump to navigation Jump to search
Miraheze>Adám Brudzewsky
(Created page with "{{Primitives|⊃|↑|First}} is a primitive monadic function which extracts the first element from its argument. {{APL built-ins}}")
 
Miraheze>Marshall
No edit summary
Line 1: Line 1:
{{Primitives|⊃|↑|First}} is a [[primitive function|primitive]] [[monadic function]] which extracts the first [[element]] from its argument.
{{Primitives|⊃|↑|First}} is a [[monadic function]] which extracts the first [[element]] in [[ravel order]] from its argument, or, if the argument is [[empty]], returns its [[prototype]]. In a [[Nested array model|nested]] APL, First reduces the positive [[depth]] of an argument other than a [[simple scalar]] by at least one; in a [[Flat array model|flat]] APL it does not change the depth. A flat array language may also use the [[Head]] function to get the first [[major cell]] of its argument rather than the first 0-[[cell]]. In this case First can be obtained by taking the Head of the [[Ravel]] of the argument.


{{APL built-ins}}
{{APL built-ins}}

Revision as of 14:27, 30 October 2019

Template:Primitives is a monadic function which extracts the first element in ravel order from its argument, or, if the argument is empty, returns its prototype. In a nested APL, First reduces the positive depth of an argument other than a simple scalar by at least one; in a flat APL it does not change the depth. A flat array language may also use the Head function to get the first major cell of its argument rather than the first 0-cell. In this case First can be obtained by taking the Head of the Ravel of the argument.


APL built-ins [edit]
Primitives (Timeline) Functions
Scalar
Monadic ConjugateNegateSignumReciprocalMagnitudeExponentialNatural LogarithmFloorCeilingFactorialNotPi TimesRollTypeImaginarySquare RootRound
Dyadic AddSubtractTimesDivideResiduePowerLogarithmMinimumMaximumBinomialComparison functionsBoolean functions (And, Or, Nand, Nor) ∙ GCDLCMCircularComplexRoot
Non-Scalar
Structural ShapeReshapeTallyDepthRavelEnlistTableCatenateReverseRotateTransposeRazeMixSplitEncloseNestCut (K)PairLinkPartitioned EnclosePartition
Selection FirstPickTakeDropUniqueIdentityStopSelectReplicateExpandSet functions (IntersectionUnionWithout) ∙ Bracket indexingIndexCartesian ProductSort
Selector Index generatorGradeIndex OfInterval IndexIndicesDealPrefix and suffix vectors
Computational MatchNot MatchMembershipFindNub SieveEncodeDecodeMatrix InverseMatrix DivideFormatExecuteMaterialiseRange
Operators Monadic EachCommuteConstantReplicateExpandReduceWindowed ReduceScanOuter ProductKeyI-BeamSpawnFunction axisIdentity (Null, Ident)
Dyadic BindCompositions (Compose, Reverse Compose, Beside, Withe, Atop, Over) ∙ Inner ProductDeterminantPowerAtUnderRankDepthVariantStencilCutDirect definition (operator)Identity (Lev, Dex)
Quad names Index originComparison toleranceMigration levelAtomic vector