Page 1¶
ND 10179 ND-100 SORT/MERGE SYSTEM¶
INTRODUCTION¶
The ND-100 SORT/MERGE SYSTEM is a program package which enables the user to sort and merge mass storage files, including magnetic tape files. The program handles three types of files – fixed length, variable length and text files in accordance with COBOL specifications.
The ND-100 SORT/MERGE SYSTEM is available in two versions, as a SINTRAN III/V subsystem and as a subroutine which can be called from user programs.
FEATURES¶
- Most significant Digit – RADIX algorithm provides very fast sorting
- Merges and sorts on 10 different key types
- Handles fixed, variable length and text records
- Ascending or descending sort sequences
- Merges up to 14 files simultaneously
- Unlimited number of keys permitted as subroutine, 1–7 as utility
- Sorts and merges all mass storage files including magnetic tape files
- Total key length up to 255 characters
- Optional collating sequences can be defined by user
- Processes files as large as 1500 Mbytes, depending on buffer sizes
PRODUCT DESCRIPTION¶
The ND-100 SORT/MERGE SYSTEM is a utility developed both for production runs and for program development and testing. It comprises 2 subroutines written in PLANC: a sort routine and a merge routine. Both can be used interactively or be called from user programs during execution.
The SORT program employs the Most Significant Digit – MSD-RADIX algorithm, which gives very high processing speed. The user can specify 10 different types of sort keys:
- ASCII
- alternative-ASCII
- NUMERIC-UNSIGNED
- NUMERIC-LEADING-SEPARATE
- NUMERIC-TRAILING-SEPARATE
- NUMERIC-LEADING-EMBEDDED
- NUMERIC-TRAILING-EMBEDDED
- INTEGER
- BCD
- ASCII-ALL-UPPER
The SORT routine uses a scratch-file, the size of which depends on the size of the input file and buffer size. The user can specify file size or rely on default values. The interactive version permits the user to submit from 1 to 7 sort keys of different types. He is also prompted by the program to submit parameters for sorting sequence and collating sequence. The SORT routine divides the input file into separate partitions which are individually sorted and subsequently merged into a sorted output file.
The MERGE routine permits the user to merge already sorted files into a single one. The maximum number of files which can be merged is 14, and parameter entry is similar to that of the SORT program.
10179–A1–6000–0481
Page 2¶
Command Summary¶
- SORT-MERGE – enter subsystem from SINTRAN
- HELP – list available commands
- EXIT – exit from subsystem
- SCRATCH-FILE
<file-name> - RECORD-DESCRIPTION
<min. reclength>[: max-length]<no. of keys><rec mode> - KEY-DESCRIPTION
<Key-pos><key-length><sequence><key-type>etc.
Note: This is the order of parameter entry for any number of keys. Any of the 10 key types listed previously may be submitted by the user. - BLOCK-FACTOR-INPUT
<number><unit> - BLOCK-FACTOR-OUTPUT
<number><unit> - ALTERNATIVE-COLLATING-SEQUENCE
<file-name> - SORT
<input file><output file> - MERGE
<no. of input files><file name-1><file name-4><output file>
As subroutines, the SORT/MERGE can be called from user programs by CALL SORT or CALL MERGE followed by the relevant parameters as for the interactive version, i.e.:
CALL SORT <parameter list> or CALL MERGE <parameter list>
Requirements¶
The program is written in PLANC and requires 9 Kbytes of main memory as subroutine. In addition, a sort buffer is used, which should be set as large as possible to enhance processing speed. For the SINTRAN III subsystem, a buffer area of 59 Kbytes is standard.
Documentation¶
ND-60.123.03.
.-------. .-------. .---------. .-------.
| ND | | ND | | ND | | ND |
| Norsk | | COMTEC| | Dance | | |
| Data | | | | | | |
'-------' '-------' '---------' '-------'
Oslo Trondheim Copenhagen Paris
Tel.: [illegible] Tel.: [illegible] Tel.: [illegible] Tel.: [illegible]
[Additional contact information not transcribed due to legibility]