I-Beam: Difference between revisions

From APL Wiki
Jump to navigation Jump to search
(Created page with "{{Built-in|I-Beam|⌶}} is a primitive monadic operator that takes a numeric code as it operand and derives an ambivalent function which provides a range of ad-hoc operations. This range covers non-primitive functions - for example: experimental features, interpreter-level control, access to the environment, and information about APL itself. == Mnemonics == In general, I-Beam's numeric operand isn't intended t...")
 
mNo edit summary
Line 1: Line 1:
{{Built-in|I-Beam|⌶}} is a [[primitive operator|primitive]] [[monadic operator]] that takes a numeric code as it [[operand]] and [[derived function|derives]] an [[ambivalent]] function which provides a range of ad-hoc operations. This range covers non-[[primitive function]]s - for example: experimental features, interpreter-level control, access to the environment, and information about APL itself.
{{Built-in|I-Beam|⌶}} is a [[primitive operator|primitive]] [[monadic operator]] that takes a numeric code as it's [[operand]] and [[derived function|derives]] an [[ambivalent]] function which provides a range of ad-hoc operations. This range covers non-[[primitive function]]s - for example: experimental features, interpreter-level control, access to the environment, and information about APL itself.





Revision as of 09:46, 14 September 2022

I-Beam () is a primitive monadic operator that takes a numeric code as it's operand and derives an ambivalent function which provides a range of ad-hoc operations. This range covers non-primitive functions - for example: experimental features, interpreter-level control, access to the environment, and information about APL itself.


Mnemonics

In general, I-Beam's numeric operand isn't intended to be easily recalled. But some are given meaningful names.

One method is to devise a name from the Roman numeral letters I, V, X, L, C, D, and M[1]

I-Beam Numeral
Called Monadically CM (900)
Line Count LC (50100)

References

APL built-ins [edit]
Primitive functions
Scalar
Monadic ConjugateNegateSignumReciprocalMagnitudeExponentialNatural LogarithmFloorCeilingFactorialNotPi TimesRollTypeImaginarySquare Root
Dyadic AddSubtractTimesDivideResiduePowerLogarithmMinimumMaximumBinomialComparison functionsBoolean functions (And, Or, Nand, Nor) ∙ GCDLCMCircularComplexRoot
Non-Scalar
Structural ShapeReshapeTallyDepthRavelEnlistTableCatenateReverseRotateTransposeRazeMixSplitEncloseNestCut (K)PairLinkPartitioned EnclosePartition
Selection FirstPickTakeDropUniqueIdentitySelectReplicateExpandSet functions (IntersectionUnionWithout) ∙ Bracket indexingIndex
Selector Index generatorGradeIndex OfInterval IndexIndicesDeal
Computational MatchNot MatchMembershipFindNub SieveEncodeDecodeMatrix InverseMatrix DivideFormatExecuteMaterialiseRange
Primitive operators Monadic EachCommuteConstantReplicateExpandReduceWindowed ReduceScanOuter ProductKeyI-BeamSpawnFunction axis
Dyadic BindCompositions (Compose, Reverse Compose, Beside, Withe, Atop, Over) ∙ Inner ProductPowerAtUnderRankDepthVariantStencilCut (J)
Quad names
Arrays Index originMigration levelAtomic vector
Functions Name classCase convertUnicode convert
Operators SearchReplace