SUPPRESS
°
Isp aSP ,SP,SP,SP,SPISP ISP ,sp,spi SUPPRESS 1 Isp ,SP ISP I SP,SP ,SP ISP ,SP ,sPISPI Isp. sP.sPISP.SP1SPjsP.sP ISP , 0I I
SPa SP I SP. sp. SP. SPI SP ISP ISP ,spiI
SPISP ISP ,SP,SP ISP ,SP ,SP ,s> I S~10,0,0 1010,0,0,0 10101 lO,O,OIO,O,OIO,OIO,O\
AN EXAMPLE OF EDITING Required: To edit a one-line Dividend Check and Stub
Using COMBINE; DISTRIBUTE (V=O); SUPPRESS (V=O); EDIT (V=O, V=I); MOVE.
N A M E No. SHARES AMOUNT RATE No. SHARES
L-IJA_M_ES_J _D_O_E _ _ ---'II 1501 1$* * *900.001
AMOUNT
~--- ---,/~--- ---~
' V ' VDIVIDEND CHECK CHECK STUB
START
CLEAR
{~
PRINT LINE TO "SPACES"
SUPPRESS: "0" ~ 762:90 and 763:90 (Plant "spaces" in 762 and 763) MOVE: (763), 10 WORDS ~ 764 (Plant "spaces" in complete print line)
120·CHARACTER PRINT· LINE IMAGE
SHADED AREAS REPRESENT "SPACE" CHARACTERS PLANTED BY THE PREVIOUS OPERATIONS
DISTRIBUTE: "DECIMAL POINT" ~ 762:88 and 767:99 (Plant decimal points) EDIT: DIVIDEND RATE ~ 762:99 and 762:76 (Plant dividend rate in check) PRESET
DISTRIBUTE: (762:96) ~ 768:96 and ¢09:90 (Plant dividend rate in stub) DISTRIBUTE: "$" -~ 766:66 and ¢09:90 (Plant dollar sign in check)
RATE N A M E No. SHARES AMOUNT RATE No. SHARES AMOUNT
n
READ: AN ITEM INTO MEMORY 9 8 7 6 5 4 3 2 1FROM
386 0 0 0 1 5 0
8
387 J A M E 5 SP SP D 388 E SP SP SP SP SP SP SP SP SP
389 o 0 0 9 0 0 0 0
IV-L-6
RATE
RATE
RATE
RATE
9
SUPPRESS: (386:94)~
765:83 and 768:50 (Number of ,har .. in check and ,tub)N A M E No. SHARES AMOUNT RATE No. SHARES AMOUNT
~
MOVE: (387),2 WORDS~
763 (Name)N A M E No. SHARES AMOUNT RATE No. SHARES AMOUNT
9
EDIT (Dollar Protection): (389:70)~
766:50 and 767:87 (Amount on check)N A M E No. SHARES AMOUNT RATE No. SHARES AMOUNT
?
COMBINE: (766:60) and (767:97)~
769:90 (Amount on stub) 763876543210
N A M E No. SHARES
OUTPUT THE EDITED LINE GOTOA
~---. ~.\I
_ _ ..L.-_ _ -..&. _ _ _ _ _ ~..afJ
AMOUNT RATE No. SHARES AMOUNT
SHADED AREAS REPRESENT "SPACE" CHARACTERS PLANTED BY THE INITIAL CLEARING OPERATIONS. BLANK AREAS REPRESENT "SPACE" CHARACTERS PLANTED BY THE EDITING OPERATIONS.
IV-L-7
TABLE IV-I: Language Code
NUMERIC NUMERIC BITS
ZONE VALUE OF Sum Detennines combination
of syllables modified.
S-values of syllables
4 2
MERGE
MERGE assumes the designation of three memory areas (called
tt pockets " ), referred to, respectively, as the A, B, C pockets. Except as stated below, there is no necessary relationship among the sizes of the three pockets.
The A and B pockets ea·ch contain a nstring" of items: that is, a collection of items which has previously been sorted according to some key.
MERGE combines the A and B strings into a single new string, which appears in the C pocket.
A
c
Runout MERGE proceeds until either the
A
pocket or theB
pocket has been exhausted by copying the last item into the C pocket. Then all items remaining in the other pocket are "run out It by being copied into the C pocket.This type of MERGE assumes, therefore, that the C pocket is equal in length to the combined lengths of the
A
andB
pockets.Cutoff MERGE proceeds until:
A
pocket exhausted or B pocket exhausted or C· pocket filledand then terminates. The next instruction to be executed is selected from the appropriate one of three locations, according to the reason for termina-tion, and the MERGE instructermina-tion, as recorded in the Memory, indicates the point at which it terminated.
IV-M-l
INSTRUCTION FORV~T: Operation:
"Cutoff"
MERGE (MRGE:C) Opera tion Code: M (V • 0, 1)Execution Time: (in
micro-minutes)
9 8 7 6 5 4 3 2 1 0designates syllables for modification by index-register OOR.
designates OaR as index-register~
bases of addresses of first word, first item, A, B, C pockets. words containing the major and minor control keys, respectively.
NOTE:
locations of left-most and right-most characters, respectively, of major and minor control keys.
if a single control key is used, it is specified by
Y, Yt, YR.
X, X L, X R are then' irrelevant.
JA, JB, JC: address of next instruction if A, B, C termination condition is encountered in "Cutoff" MERGE.
V: variation designator:
Cutoff MERGE
a one control key l ' two control keys
IV-M-2
INSTRUCTION FORV~T: Operation: "Rul1out" rvmRGE (MRGE:R) Opera tion Code ~ ]\11 (V
=
2, 3)Execution Time: (in
micro- minutes)
9 8 7 6 5 4 3 2 1 0fif!ti/iifl!lii!ii!ii!ili@li!iil t I fIt
~tirtrrJtfft!ii!i!i!i!i!i!f!!rii!!!!i!lii!f!!!!i!lii!itltl!iii!lifWiiJ
designates syllables for modification by index-register OOR.
designates OOR as index-register.
bases of addresses of first ,.,rord, first item, A, B, C pockets. words ,containing the majqr and minor control keys, respectively.
NOTE:
locations of left-most and right-most characters, respectively, of major and minor control keys.
if a single control key is used, it is specified by Y,
Yt,
YR.X, XL, X R are then irrelevant.
In "Runout" MERGE, the next instruction in sequence is always executed.
V: variation designator:
Runout NERGE one control key 2
tl.,rO control keys 3
IV-M-3
DESCRIPTION OF:
MERGE
NOTES:
1) The comparison made by MERGE is the same as that made by COMPARE ALPHANUMERIC.
Therefore, if the keys are numeric, all negative num-bers .(in sequence by increasing magnitude) will sort behind all positive keys. MERGE may be made to yield any desired sorting sequence, however, by using ADD BINARY and COMPLEMENT BINARY to transform the sorting keys.
2) If the keys are positive numbers, they may be PACKED, and the operation of MERGE will be unchanged. Alphabetic characters may be combined in a single key with PACKED digits, by using IN-SERT. Therefore, MERGE will operate over a 20-character alphabetic field, over a 30-digit PACKED numeric field, or over a field containing any propor-tional combination of alphabetic characters and PACKED digits. transferred to a 20-character-Iong working register
(Ra), right-justified.
If two control keys have· been specIfied, the major control key of that item is next transferred to Ra, right-justified against the left-most character of the minor control key.
The contents of Ra is then the stored Key of the next A item.
The key of the next B item is assembled and stored in the same fashion in Rb.
4) Note that both the first and third words of the
Runout MERGE
Suggested patterns of memory space allocation for minimum space requirements