Encode

From APL Wiki
Jump to navigation Jump to search

Encode (), also called Represent or Antibase, is a dyadic primitive function which computes the representation of the right argument in the radix system defined by the left argument. Some implementations add monadic usage to this function, which computes the binary representation using as many bits as needed. Encode is the inverse of Decode with the same left argument X, when X is a vector.

Concept

Encode works by finding the "digits" one by one from the rightmost digit. Let's consider 0 7 24 6012345 (convert 12345 minutes to weeks, days, hours, and minutes) as an example.

      60|12345      ⍝ Minute's digit; 45 minutes
45
      60÷12345-45  ⍝ 205 hours remaining to convert
205
      24|205        ⍝ Hour's digit; 13 hours
13
      24÷205-13    ⍝ 8 days remaining to convert
8
      7|8           ⍝ Day's digit; 1 day
1
      7÷8-1        ⍝ 1 week remaining to convert
1                   ⍝ No more conversion needed, since there is no limit for the highest digit

Collecting all the digits gives the desired result.

      0 7 24 6012345
1 1 13 45

If the left argument has high rank, the vectors over the first axis act as independent radix systems.

      mat8 32 10 16  ⍝ Base 2, 10, and 16, being able to represent at most 8 digits
2 10 16
2 10 16
2 10 16
2 10 16
2 10 16
2 10 16
2 10 16
2 10 16
      mat121  ⍝ 121 is 1111001 in binary, 121 in decimal, 79 in hexadecimal
0 0 0
1 0 0
1 0 0
1 0 0
1 0 0
0 1 0
0 2 7
1 1 9

Examples

A common use case is to convert an integer to base N, usually base 2 or 10. However, Encode does not know how many digits to produce, so it needs to be supplied as the shape of the left argument.

      1012345  ⍝ This does not work
5
      (1010)12345  ⍝ Convert to ten decimal digits, giving leading zeros if too small
0 0 0 0 0 1 2 3 4 5
      ((1+⌊1012345)10)12345  ⍝ Convert to decimal digits using just as many digits as needed
1 2 3 4 5

Encode can be also used to convert a measure given in the smallest unit to a hierarchy of units. For example, given that 1 day = 24 hours, 1 hour = 60 minutes, and 1 minute = 60 seconds, how many days/hours/minutes/seconds is 210859 seconds?

      0 24 60 60210859
2 10 34 19

Another common usage of Encode is to simulate "divmod": a function which, given two integers, computes the quotient and remainder at once. The construct can also be used to extract the integer part and fractional part of a real number.

      7÷3  ⍝ Quotient
2
      3|7  ⍝ Remainder
1
      0 37  ⍝ Quotient and remainder at once
2 1
      0 1⊤○1  ⍝ Integer and fractional parts of pi
3 0.1415926536

Encode has an important property with array index: Given an arbitrary array A with shape S, encoding a raveled index by S gives the original index in A. This can be used to generate all indices of a given array or array shape. Note that index origin 0 (⎕IO0) is required for this to hold.

      ⎕IO0
      ⎕A[17]=(2 3 417)2 3 4⎕A
1
      2 3 4⊤⍳×/2 3 4  ⍝ Generating all indices of a 2×3×4 array as columns
0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1
0 0 0 0 1 1 1 1 2 2 2 2 0 0 0 0 1 1 1 1 2 2 2 2
0 1 2 3 0 1 2 3 0 1 2 3 0 1 2 3 0 1 2 3 0 1 2 3

External links

Lesson

Documentation


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, Atop, Over) ∙ Inner ProductPowerAtUnderRankDepthVariantStencilCut (J)
Quad names
Arrays Index originMigration levelAtomic vector
Functions Case convertUnicode convert
Operators SearchReplace