JPS62166422A - Sorting method for variable length record - Google Patents

Abstract

PURPOSE:To minimize a work area by comparing data which are inputted successively on the basis of the predetermined size of an array and setting smaller data in the prescribed work area. CONSTITUTION:The value of input data is set in a comparison area A. The 1st data, however, is set in a comparison area B. The data in the areas B and A are compared with each other and when it is confirmed that the data in the area B is smaller or equal, the value in the area B is set in a buffer 0 and the value in the area A is moved to the area B. When the value of the area A is smaller than the value in the area B, it is confirmed that the (n)th byte of the word data in the area A is smaller than the word data in the area B, and the word is set in a buffer (n). Said operation is repeated up to the final data and the data are all sorted in buffers 0-(n) in predetermined array order.

Description

DETAILED DESCRIPTION OF THE INVENTION <Field of Industrial Application> The present invention relates to a method for sorting variable-length records according to a predetermined arrangement order, which is used for dictionary conversion in a word processor.

<Prior art> As a conventional sorting method, for example, as shown in Fig. 4, the size of the work area and work file used for data comparison is set to the maximum value that the data can take, and es is the unit length. There is something to use.

<Problem to be solved by the invention> However, in this conventional sorting method, the maximum possible value of the data for the size of the work area and work file is used as the unit length. This method requires a huge work area and work file, which has the disadvantage of wasting space and increasing the time required to write data to an external storage device.

An object of the present invention is to minimize the work area used.

<Means for solving the problem> In order to achieve this object, the present invention compares sequentially input data according to the size of a certain predetermined arrangement when sorting data, and specifies the smaller data. When the work area reaches the specified size, the contents are written to the external storage device I2, and finally all variable length data is written to the external storage device. It is characterized by being sorted according to a certain predetermined arrangement when it is released.

Effects> The present invention minimizes the work area required by sorting variable length records.

<Example> Hereinafter, the present invention will be explained based on the drawings.

1 and 2 are flowcharts showing an embodiment of the present invention. Enter data in step a and step b
Set that value in comparison area A of . However, only the first data can be used.

Set the data in comparison area B of step C. step d
Then, compare the data in comparison area B with the data in comparison area A, and confirm that the data in comparison area B is smaller or equal. If confirmed, the value of comparison area B is set to buffer (b) in step e. Thereafter, the value in comparison area A is moved to comparison area B in steps and g.

By the way, if the value in the comparison area B is smaller than the value in the comparison area B in step d, steps and f are performed as exception handling. In step f, it is confirmed that the n-th byte of the word data in comparison area A is smaller than the word data in comparison area B, and the word is
Set to ffer(n).

Finally, in step h, it is checked whether there is any data left, and if there is, the process returns to step a, and if there is no data left, the process ends.

As a result, buffer([, buffer(1),
buffer(2).

..., buffer (n), all data is sorted in a predetermined order (in this case, in ASCII code order).

Next, in the second step i, buffer@-buff
Data are entered into comparison area C one by one from er(n). However, only the first data is set to the comparison area D of the step. In step 1, the value of comparison area C and the value of comparison area D are compared, and
If the value in the comparison area C is smaller, the process proceeds to step m. If the value in the comparison area C is still smaller, the value in the comparison area C is moved to the comparison area D in step 1', and then the process proceeds to step m.

In step m, confirm that the rod of buffer (n) has entered, that is, buffer @ ~ buffer (
The first data of each of n) is compared once, and if the smallest data among them is in the comparison area D, the process goes to step n.

In step n, when setting the data in the comparison area D to the work area, it is checked whether there is any free space in the work area. If there is no free space, the contents of the work area are written to the external storage device in step 0.
, clear the work area in step p. Thereafter, in step q, the data in comparison area D is sent to the work area. Further, if it is determined that there is a free area in step n, step 0 and step p are skipped, and step q is performed.

Finally, in step r, if data remains, the process returns to step 7i, and if no data remains, the contents of the work area are written out to the external storage device and the process is completed.

As a result of the above, buffer (n ~ buffer (
All values in the n+1 files of n) are sorted in a predetermined array order (in this case, ASCII code order).

FIG. 3 is a specific example of the structure of a fixed-length record. In this case, it is an example of one word from WordPro's dictionary.

The following shows how to make this a variable length record. (This process is performed at the time of setting data to the buffer in the first step e1 and step f.) 8 is a "read" information area consisting of 28 bytes. Information other than the "reading" information is filled with 'pp' up to #9!591. Then, search what byte is "@g15p" and search for "p" from that byte to 28 bytes.
y5" is deleted. Next, t is a "Kanji" information area consisting of 32 bytes. In the same way as above, “y5
m". Finally, U consists of 11 bytes "
This is the area of ``grammatical information''. This is similar to the above two,
X'' is deleted. By deleting one change ρ in this way, a fixed length record of 75 bytes becomes a variable length record.

In Figure 2, the free space is checked in step n, but this is done from the rear of the work area.'' 1D93k
By searching ', you can find out how much area remains. This is shown in FIG.

<Effects of the Invention> As explained above, according to the present invention, sequentially input data is compared based on the size of a certain predetermined array, and the smaller data is transferred to a work area of a predetermined size. When the work area reaches a specified size, the contents are written to the external storage device, which has the effect of minimizing the work area used when sorting variable-length records. It will be done.

[Brief explanation of drawings]

Figures 1 and 2 are flowcharts explaining the company's invention in detail, Figure 3 is an example of the structure of a dictionary for a word processor, Figure 4 is how the data is arranged as a result of sorting using the prior art, and Figure 5 is the book The details of how data is arranged as a result of sorting using the invention method will be shown. Japanese Patent Publication No. RG2-166422 (4) Figure 3 Figure 4 Figure 5

Claims (1)

[Claims] When sorting data, sequentially input data is compared based on the size of a certain array, and the smaller data is set in a work area of a specified size until the work area reaches the specified size. A variable-length record characterized in that when the data is written to an external storage device, the contents are written to an external storage device, and when all variable-length data is finally written to the external storage device, it is sorted according to a predetermined arrangement. How to sort.