JPS63173124A - Data editing method - Google Patents

Abstract

PURPOSE:To perform the edit of a data at high speed, by storing a size read out with a code from a targeted data memory in a sort memory as an address. CONSTITUTION:A code data and the size are read out from the targeted data memory 2 via a CPU1. The code data is stored in a corresponding position in the sort memory 3 setting the size as the address. The data after completing storage is read out in order from the memory 3, and is outputted as an editing data, and no size comparing processing for individual data is required, thereby, the edit of the data can be performed at high speed.

Description

DETAILED DESCRIPTION OF THE INVENTION [Technical Field] The present invention relates to a data editing method, and more particularly to a data editing method for rearranging a plurality of data in order of size.

[Prior art]

Conventionally, methods such as bubble sort and quick sort are known as data editing methods for rearranging a plurality of data in order of size.

FIG. 9 is a diagram showing a data editing method using bubble sort.

The li collection method using bubble sort sorts data values by comparing them with each other. Figure 9 shows the tIA collection method, which sorts three pieces of data in order from the largest to the smallest. The method has been determined.

In FIG. 9(a), data “18” and data “11” are shown first.
”.As a result, data “18” is data “1”.
1”, so the data “18” and the data “1”
1” as shown in FIG. 9(b). Then,
In Figure (b), data "18" and data "9" are compared. As a result, data "18'" is larger, so data "18" and data "9" are rearranged as shown in FIG. 9(C). Then, in FIG. 9(C), data "11" and Compare with data “9”. the result,
Since data "11" is larger, data "11" and data "9" are rearranged as shown in FIG. 9(d).

As a result, the data is "18".

“11” and “9” were rearranged in order from smallest to largest.

In addition, in the editing method using quick sort, N pieces of data A[1] to A[N] are compared with a certain value C, and these data are divided into data larger than value C and data smaller than value C. Divide into two sets. Furthermore, values E and F are set in each of the two sets, and data is similarly divided into data larger and smaller than the values E and F,
In this way, the data is sequentially subdivided and rearranged.

How to edit data using quick sort is to edit N pieces of data into Nj! Since data can be sorted at a speed proportional to ogN, data can be collected at a higher speed than the wAt method using bubble sort.

However, in these conventional data editing methods, individual data had to be compared each time, so there was a limit to speeding up the processing.

〔the purpose〕

SUMMARY OF THE INVENTION An object of the present invention is to provide a data editing method that improves the problems of the prior art and allows data editing to be performed even faster.

〔composition〕

In order to achieve the above object, the present invention includes the steps of: reading out the code and size to be edited from the target data memory;
a writing step of storing the read code in a predetermined position of the sort memory determined by the address of the sort memory, using the size of the read data from the target data memory, and writing the code stored in the sort memory. The method is characterized by comprising a step of sequentially reading out data.

Hereinafter, a detailed explanation will be given based on one embodiment of the present invention.

FIG. 1 is a block diagram of a system for implementing the data mt & method of the present invention.

In FIG. 1, a processor 1 includes a target data memory 2 that stores data to be edited, a sort memory 3 that stores data in the target data memory 2 in order of size, and a data editing process. A work area 4 serving as an area is connected by a data bus 6 and an address bus 6. Also, processor 1 has registers AO and Do.
, A.I.

It is equipped with Dl.

The data stored in the target data memory 2 has a predetermined code, and this code is further associated with the relative address, that is, the size, of the sort memory 3 in which the data is stored.

This size allows the code to be sorted in memory 3 in order of size.
It is set to be stored in .

FIG. 2 shows data stored in the target data memory 2. As shown in FIG. In Figure 2, the code “11)
(" has a magnitude of "7", and the code "15H" has a magnitude of "12".

The processor 1 reads a predetermined code of data to be edited and a size associated with the code from the target data memory 2, and stores them in a predetermined register. Furthermore, the processor 1 adds the size stored in a predetermined register and the 'starting address of the sort memory 3 given in advance, that is, the offset value TOP.

The absolute address of the sort memory 3 where the code stored in the predetermined register is to be stored is determined. When the content of the sort memory 3 specified by this absolute address is "0", a code or the like is written at that location. Such processing is performed on all data in the target data memory 2, and the codes are stored in the sort memory 3 in order of size.

As a result, the data in the target data memory 2 as shown in FIG. 2, for example, is stored in the sort memory 3 in order of size, as shown in FIG. In FIG. 3, the code "IIH" is stored in the relative address #07 of the sort memory 3, and the code "15H" is stored in the relative address #12.The example shown in FIG. like 1st
In the second embodiment, a pointer is further written as shown in FIG.

When all data is stored in the sort memory 3, the processor 1 sequentially accesses the sort memory 3. At this time, if the content of sort memory 3 is O'', it is skipped,
If it is not '0', its contents become a code or a pointer.The code and the size of this code are obtained based on the absolute address of sort memory 3 when it is determined that the contents of sort memory 3 are not '0'. .

4 and 5 are flowcharts showing a first embodiment of the data editing method according to the present invention.

FIG. 4 is a flowchart of the process of writing data into the sort memory 3.

In FIG. 4, in step S1, data, ie, a predetermined code and a size associated with this code, are read from the target data memory 2.

Next, in step S2, the read code is stored in a register DO not shown in FIG. 1, and the size is stored in a register AO shown in FIG.

Next, in step S3, the size stored in the register AO and the offset value TOP of the sort memory 3 are added to obtain the absolute address of the sort memory 3, and this is stored in the register AO again.

Note that the offset value TOP of the sort memory 3 is the top address of the sort memory 3 where the data of the target data memory 2 is to be stored.

In step S4, the absolute address position of the sort memory 3 stored in the L/register AO is accessed.

Next, in step S5, it is determined whether the content of the absolute address position of the sort memory 3 specified by the register AO is °'0'. If it is '0', the process proceeds to step S6.
Step S5 writes the code stored in the register DO to the absolute address position of the sort memory 3 indicated by the register AO.If the content of the absolute address position of the sort memory 3 is not "0" in step S5, the code stored in the register DO is written to the absolute address position of the sort memory 3 specified by the register AO. The process advances to S7, increments the current absolute address by "1", and returns to step S5 again. As a result, the absolute address is incremented until the content of the absolute address position of the sort memory 3 is "0", and the content of the absolute address position is "0".
”, the address is moved to this absolute address position in step S6.
Write the code with.

Next, in step S8, it is determined whether all the data in the target data memory 2 have been written to the predetermined absolute address positions of the sort memory 3 as described above. If writing of all data has not yet been completed, the process returns to step S1 again and the same processing from step S1 to step S7 is repeated.

In step S8, when it is determined that all data has been written, the data writing process is ended.

In the flowchart shown in FIG. 5, the data written from the sort memory 3 is read out and the data is arranged in order of size.

In FIG. 5, in step S9, the total number of data is n
IIaX, and the data read count value n is initialized to "1".0 Next, in step SIO, the offset value TOP of the sort memory 3 is stored in the register AO as the initial value of the absolute address.

In step Sll, the contents of the address location of the sort memory 3 specified by the register AO are stored in the register Do. In step S10, the offset value T of the sort memory 3 is stored in the register AO.

Since P is stored, in step Sll,
This means that the contents of the offset value TOP of the sort memory 3, that is, the contents of the highest address position in the sort area, are stored in the register Do.

Next, in step S12, the contents of register pO become “0”.
”. If the contents of register DO are “0
”, since there is data that is not “O”, the process proceeds to step 313, uses the contents of the register DO as a code, and calculates the size by subtracting the offset value TOP from the contents of the register AO at this time.

On the other hand, in step S12, when the content of register DO is "0", the process advances to step S14, and register A
The absolute address of sort memory 3 stored in O is “
The process advances by 1'' and returns to step Sll again.

In this way, in step S12, the register DO
Sort memory 3 until the Natres position where the content is not 0''
The absolute address of is incremented, and the code and size are determined in step S13 as described above.

Next, in step S15, all the sorting areas of the sorting memory 3 are accessed, and it is determined whether the sorting areas have been exceeded. When the sort area is exceeded, this means that the entire sort area has been accessed, so the process ends.

If it is determined in step S15 that the sort area has not been exceeded, the process proceeds to step 316, where it is determined whether the data read count value n is greater than the total number of data n□8.

In step S16, the data read count value n
When is larger than the total number of data n□8, it means that reading of all data has been completed, and the process is ended.

On the other hand, if the data read count value n is not larger than the total number of data n□8 in step 816,
In order to read the next data, the process advances to step 914, and in step S14, the contents of register AO are
The value is increased by 1'' and the process returns to step Sll.

In this way, the processes from step Sll to step S16 are repeated to sequentially read data that is not "0" from the sort memory 3.

As described above, according to the first embodiment, when writing data to the sort memory 3, if the content of the address position specified by the sort memory 3 is not 0'', the content of the sort memory 3 is 0''. Increase the address until it becomes ``,
When the content of the sort memory 3 becomes "0", data is written to that address position. In the read processing of the sort memory 3, since the data is stored in the sort memory 3 in order of size, it is only necessary to read the data sequentially. Since it is only necessary to access the memory 3, data 5iii processing can be performed at high speed.

6 and 7 are flowcharts illustrating a second embodiment of the data processing method according to the present invention.

FIG. 6 is a flowchart of the process of writing data into the sort memory 3.

In this second embodiment, a pointer storage memory (not shown) for storing predetermined pointers is provided, and necessary pointers are taken out from this pointer storage memory and written into the sort memory 3.

In FIG. 6, in step S21, data, ie, a predetermined code and a size associated with this code, are read from the target data memory 2.

Next, in step 322, the read code is stored in a register DO not shown in FIG. 1, and the size is stored in a register AO shown in FIG.

Next, in step S23, the size stored in the register AO and the offset value TOP of the sort memory 3 are added to obtain the absolute address of the sort memory 3, and this is stored in the register AO again.

Note that the offset value TOP of the sort memory 3 is the top address of the sort memory 3 where the data of the target data memory 2 is to be stored.

In step S24, the absolute address position of the sort memory 3 stored in the register AO is accessed.

Next, in step S25, it is determined whether the content of the absolute address position of the sort memory 3 indicated by the register AO is "0". When “0”, step S2
6, the end pointer EP is written to the absolute address position of the sort memory 3 specified by the register AO.0Then, in step S27, the end pointer EP is stored in the register DO at the address position next to the absolute address position specified by the register AO. If the content of the absolute address position of the sort memory 3 is not "0" in step S25, the process advances to step 328, and the register AO is written.
It is determined whether the content of the absolute address position of the sort memory 3 indicated by is the end pointer EP.

If it is not the end pointer EP, the process advances to step S29, and since the content of the absolute address position of the sort memory 3 specified by the register AO is a pointer that is not the end pointer EP, this is stored in the register AO,
Returning again to step 328, this process is repeated until the end pointer EP is detected.

In step S28, if it is determined that the contents of the absolute address position of the sort memory 3 indicated by the register AO is the end pointer EP, the process proceeds to step S30, and the pointer is transferred from the pointer storage memory to the register A.
Then, in step S31, the register A1 is stored in the register A1.
The contents of are written to the absolute address position of the sort memory 3 specified by the register AO.

In step 332, register A1 is entered before register AO.
, and then increment it by "1". Therefore, a value obtained by increasing the contents stored in register A1 by "1" is stored in register AO, and step 933
Then, a code is set at the absolute address position of the sort memory 3 specified by the register AO, and in step S34, an end pointer EP is set at the absolute address position of the sort memory 3 specified by the register A1. As a result, as shown in FIG. 8, data, ie, a code, is written in the sort memory 3 at the address position next to the predetermined pointer and end pointer EP.

In this way, step S26. Step S27 or Step S33. After writing predetermined data into the sort memory 3 in step S34, the process advances to step S35.

In step S35, it is determined whether all the data in the target data memory 2 have been written to the predetermined absolute address positions of the sort memory 3 as described above. If all data has not been written yet, the process returns to step 321 and repeats the same processes from step S21 to step S34.

When it is determined in step S35 that all data has been written, the data writing process is ended.

In the flowchart shown in FIG. 7, the data written in the sort memory 3 is read out and the data is arranged in order of size.

In FIG. 7, in step S36, the total number of data is set to nnax, and the data read count value n is initialized to 1''.In step S37, the offset value TOP of the sort memory 3 is registered as the initial value of the absolute address. Store in AO.

In step S38, the contents of the address location of the sort memory 3 specified by the register AO are stored in the register Do, and the contents of the register AO are transferred to the register D1. In this case, since the offset value TOP of the sort memory 3 is stored in the register AO in step S37,
In step S38, the contents of the offset value TOP of the sort memory 3, that is, the contents of the highest address position in the sort area are stored in the register Do.

Next, in step S39, it is determined whether the contents of register]:jO are "0". When the contents of register DO are 0'', the process advances to step S45, and register AO is
The absolute address of sort memory 3 stored in
'' and returns to step 338 again. This process is repeated until the contents of register DO are no longer "0", that is, until the pointer is detected.Step S3
When the contents of the register DO are no longer "0" in step S9, this means that the address is set at the pointer position, so the process advances to step S40 and the register D is set to 1.
Transfer the contents of O to register AO first. In the sort memory 3, data, that is, a code, has been written to the address position next to the pointer, so in the next step 341, the contents of the address position next to the address position of the sort memory 3 specified by the register AO are written to the register. Store in DO. At this time, the contents of the register DO become the code 0. Then, in step S42, the size is determined by subtracting the offset value TOP from the contents of the register D1.

After determining the code and size of the data in steps S41 and S42 in this manner, the process proceeds to step 343.

In step 343, it is determined whether the contents of the absolute address location of the sort memory 3 indicated by the register AO are the end pointer EP. If it is not the end pointer EP, the content is a pointer indicating the next codon, so the process advances to step S44 to access the address location of the sort memory 3 indicated by the pointer, step S4.
In step S4, the contents of the absolute address position of the sort memory 3 specified by the register AO are stored in the register AO, and the process returns to step S40, and this process is repeated until the end pointer EP is detected.

When it is determined in step S43 that the content of the absolute address position of the sort memory 3 indicated by the register AO is the end pointer EP, the process proceeds to step S45, and it is determined whether or not the sort area has been exceeded. When the sort area is exceeded, this means that the entire sort area has been accessed, so the process ends.

If it is determined in step S45 that the sort area has not been exceeded, the process proceeds to step S46, where it is determined whether the data read count value n is greater than the total number n of data.

In step S46, the data read count value n
When is larger than the total number of data n1aX, it means that reading of all data has been completed, and the process is ended.

On the other hand, in step S46, if the data read count value n is not larger than the total number of data n1aX, step S45 is performed to read the next data.
Then, in step S45, the contents of register AO are incremented by "1", and the process returns to step 938.

In this manner, the processes from step 338 to step S46 are repeated to sequentially read data that is not "0" from the sort memory 3.

As described above, according to the second embodiment, since pointers are used, it is possible to prevent data from disappearing even when a plurality of pieces of data having the same size exist.

〔effect〕

As explained above, according to the present invention, codes are stored in the sort memory in order of size according to the size read from the target data memory, so there is no need to compare individual data. , data editing processing can be performed at high speed.

[Brief explanation of the drawing]

Figure 1 is a block diagram of a system that implements the data editing method of the present invention, Figure 2 is a diagram showing the code and size of data stored in the target data memory, and Figure 3 is shown in Figure 2. A diagram showing the state in which data is stored in sort memory,
4 and 5 are flowcharts showing the first embodiment of the data Wa&method according to the present invention, and FIGS. 6 and 7 show the second embodiment of the data w4 drug method according to the present invention. FIG. 8 is a diagram showing a state in which data is stored in the sort memory according to the second embodiment, and FIG. 9 is a diagram for explaining bubble sort.
) is a diagram showing the initial data arrangement, FIG. 9(b) is a diagram showing the rearranged data arrangement shown in FIG. 9(a), and FIG. 9(C) is a diagram showing the data arrangement shown in FIG. 9(b). FIG. 9(d) is a diagram showing a rearranged state of the data array shown in FIG. 9(C). 2...Target data memory, 3...Sort memory, A
O, AI, Do, DI...Register, EP...End pointer Patent applicant Rico Co., Ltd. - Figure 1 Figure 2 Figure 3 Figure 4 Figure 5 Figure 6 Figure 7 Figure 8

Claims (1)

[Claims] 1) A step of reading out the code and size to be edited from the target data memory, and setting the size read from the target data memory as the address of the sort memory, and creating a sort memory defined by this address. A data editing method comprising: a writing step of storing the read code at a predetermined position in the sort memory; and a step of sequentially reading out the codes stored in the sort memory. 2) The data editing method according to claim 1, wherein the writing step stores the read code at the address location of the sort memory. 3) The writing step stores a predetermined pointer at the address position of the sort memory, and stores a code at the next position of the address. How to edit data.