JPH0221326A - Data sorting system - Google Patents

Abstract

PURPOSE:To sort plural data with high efficiency by adding the numbers to these data stored in a memory area in desired order to send the data to an idle area of a memory on said numbers and then sending again and storing said data in the original memory area. CONSTITUTION:The numbers are added to plural data 100 stored in a memory area in desired order, and these data 100 are successively read out based on said numbers and sent successively to an idle area 104 in the read-out order. Then the data arranged in the area 104 are sent and stored again into the original memory area. Thus these data are sorted. Thus plural data can be sorted with high efficiency by means of the area 104.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a data sorting method for sorting files and the like within a limited memory area.

[Prior Art] Conventionally, when rearranging or organizing data such as files using a document processing device, a large work area is required. Reducing this work area requires a lot of data transfer and complicated algorithms, which poses a problem in that it takes a lot of time.

[Problems to be Solved by the Invention] Such problems have become particularly noticeable in document processing devices and the like in which a separate program is loaded into RAM from an external memory and executed. In other words, in the RAM area where these programs are loaded, a program area and a work area area used by the program are secured, so the required memory area may be large (variable) depending on the content of the added function program. In this case, there is no problem as long as you have enough work area to run whatever program is loaded, but in reality it is difficult to allocate a large amount of memory due to cost, RAM mounting area, etc. Therefore, when the work area capacity was limited and a function that required a large amount of memory capacity, such as data sorting, was instructed to be executed, the sorting could not be performed due to insufficient memory capacity. .

The present invention has been made in view of the above-mentioned conventional example, and an object of the present invention is to provide a data sorting method that can efficiently sort a plurality of data by utilizing an empty area of a memory.

[Means for Solving the Problems] In order to achieve the above object, the data sorting method of the present invention has the following configuration. That is, a numbering means for numbering a plurality of data stored in a memory area in a desired order, a numbering means for sequentially reading the plurality of data based on the number, and sequentially transferring the plurality of data to an empty area of the memory in the order of reading. The storage device includes a transfer means, and a means for transferring and storing the plurality of data transferred and arranged in the free area to the original memory area again.

[Operation] In the above configuration, the plurality of data stored in the memory area are numbered in a desired order, the plurality of data are sequentially read out based on the numbers, and transferred to the free area of the memory in the order in which they are read. do. Data sorting is performed by transferring and storing the plurality of data transferred and arranged in the free area to the original memory area again.

[Embodiments] Hereinafter, preferred embodiments of the present invention will be described in detail with reference to the accompanying drawings.

[Description of functional blocks (Fig. 1, Fig. 2)]] The first is a functional block diagram of the sorting method of the embodiment.
is a memory area that stores multiple independent pieces of data,
101 is a numbering means for numbering the plurality of data in a specified order. This number designation can be set in any order, such as alphabetical order or creation date order. This numbering is means 10
1, a plurality of data numbers are created in the number table 102.

Referring to this number table 102, the transfer means 103 sequentially transfers each of the plurality of data 100 to the free area 104 in the order of its number. In this way, data is transferred and stored in the free area 104 in the order corresponding to the numbers in the number table 102. Thereafter, the sorted plurality of data is transferred directly via 105 from the free area 104 to the area where the original plurality of data 100 was stored. In this way, the plural data 100 are sorted in the desired numerical order.

[Description of Document Processing Apparatus (FIGS. 1 and 2)] FIG. 2 is a block diagram showing a schematic configuration of a document processing apparatus according to an embodiment.

In the figure, 201 is a control program stored in the ROM 202 or the RAM 20 from the external memory 207.
202 is a ROM that stores the control program of the CPU 201 and various data, etc.; 203 is a ROM that stores the control program of the CPU 201 and various data;
This RAM has a memory map as shown in the figure and is used as a work area for the CPU 201 or stores a control program from the external memory 207.

204 is a display for displaying document data being processed and messages to the user, and 205 is a keyboard for inputting document information, various function instructions, etc. 206 is an interface unit that connects the external memory 207 and the CPU 201; 207 is an external memory that stores various functional programs in a nonvolatile manner; It is read out from the RAM 203 and stored in the RAM 203, and defines the control operation of the CPU 201.

FIG. 3 is a diagram showing a memory map of the RAM 203.

27 is a work area used as a CPU work area, 28 is a new function area into which a new program is loaded from the external memory 207, and a new control program area 31 in which the control program from the external memory 207 is stored.
and a new work area 30 used as a work area for the new control program area. 29 is a document area for storing document information, 25 is a used area where document information is already stored, and 26 is an unused area where no document information is stored yet.

Reference numeral 21 denotes a memory address EMPADR that stores the start address of the unused area 26 of the document area 29. 22
When the new control program is a sorting program, a numbering table is used to number and store each piece of data to be sorted, and 23 is a sort data area in which data to be sorted is stored.

[Explanation of sorting operation (Figures 4 to 6)] Figures 4 to 6
FIG. 6 is a flowchart showing the sorting process in the document processing apparatus of the embodiment, and a control program for executing this process is stored in the external memory 207.

This program is started by an instruction from the keyboard 205, and when a command to execute the sorting program in the external memory 207 is input from the keyboard 205,
The CPU 201 sequentially reads this sorting program from the external memory 207, stores it in the new program area 31 of the RAM 203, and then starts by passing control to this program.

In step SL, a title name of document data, etc. is input. In step S2, it is determined whether the document data to be created is existing or newly created. When re-editing an existing document, the process advances to step S3, where the document with this title is transferred to the sort data area 23 and deleted from the used area 25 of the document area 29. This increases the unused area 26 and updates EMPADH.

Next, in step S4, the process moves to document information creation processing, and the document information is stored in the sort data area 23. Step S
When an instruction to end the document information is input in step S12
, move the sort data to the unused area 26 of the document area 29.
Transfer to and finish processing.

On the other hand, if a sorting instruction is input in step S6 instead of an end instruction in step S5, the process advances to step S7, where the size of the unused area 26 in the document area 29 is compared with the data size currently being created, If the size of the data being created is smaller, the process advances to step S9, but if the size of the data being created is larger than the unused area 26, the process advances to step S8, where an error is displayed.

In step S9, numbers are assigned to the data in the sort data area 23, and in step S10, the numbering created in step S9 refers to the table 22, and the data in the sort data area 23 is transferred to the unused area 26. Sort by number. In this way, in step Sll, the unused area 2
The data rearranged in the numerical order of 6 is transferred again to the sort data area 23, and the process is completed.

[Numbering indicates explanation of processing (FIGS. 7 to 9)]] The seventh figure shows a state in which data in the sort data area is divided based on delimiters and arranged in order from the beginning. Here, seven pieces of data from "5uzuki" to "Kondoh" are stored.

FIG. 8 is a diagram showing the arrangement order by numbers when these data are arranged in alphabetical order.

FIG. 9 is a diagram showing a specific example of the numbering table 22 created based on the numbers thus assigned, in which the numbers are stored in 2-byte units in the order shown in FIG. 8. In FIG. 9, the (+) number attached to the left side indicates an incremental address from the first address of the first table 22.

[Transfer Process (FIGS. 5 and 6)] FIG. 5 is a flowchart showing the transfer process to the unused area in step S10 in FIG. 4.

First, in step S20, the number to be transferred is set to "1", and in step S21, the transfer destination address is set to the start address of the unused area 26 stored in EMPADR. In step S22, data with a number equal to the transfer number is searched for. As a result, for example, when the transfer number is "1", "Kobayash" in the sort data area 23 is displayed as shown in FIG.
i'' is searched for and transferred to the unused area 26 in step S23, where it is stored starting from its first address.Step S2
4, the transfer address of the unused area 26, which is the transfer destination, is
It is updated so that it comes after the final address of the data transferred this time, and the transfer number is incremented by 1 in step S25. In step S26, it is checked whether the transfer number is larger than the final number ("7" in the case of FIG. 8), and if it is smaller, the process returns to step S22 and the aforementioned operations are executed.

FIG. 6 is a flowchart showing the process of searching for data equal to the transfer number in step S22 of FIG.

In step S30, the address for which the number is to be searched is set to the first address of the table 22, and in step S31
extracts 2 bytes and reads its number value. Step S
In step S32, it is checked whether the read number value matches the transfer number, and if they do not match, the process advances to step S34, where the search address is increased by 2 and the process moves to the next address search.

On the other hand, if the number searched in step S32 matches the transfer number, the process advances to step S33, where the first address of the numbering table 22 is subtracted from the search address at the time of matching, and the subtracted value is set to "2". Divide by As a result, for example, when the transfer number is "1", ((search address) - (
Starting address))÷2=3 is obtained.

At this time, data is stored in the sort data area 23 in the order shown in FIG. 8, and "5uzuki" is "0".
The th "Tanaka" is the "1" th, and the sort data area 2 is
3 "Kobayashi" is searched.

In this way, in step SIO of FIG. 4, the data in the sort data area 23 is sorted in the order of transfer numbers (in the order of the numbers in FIG. 8).
is transferred to the unused area 26 and stored therein, and is transferred to the unused area 26 and stored in step Sl.
At 1, the data is transferred from the unused area 26 to the sort data area 23 again, and data sorting in the sort data area 23 is completed.

FIG. 10 is a diagram showing an example of data arrangement sorted in this manner.

FIG. 11 is a diagram illustrating another embodiment, in which the work area 27 is divided into a system area 32 and a temporary area 33.

The system area 32 is an area in which various variables that are required during and after the execution of the functional program in the external memory 207 are collected, and the temporary area 33 is an area that is not required during the execution of the program in the external memory 207, or is an area that is This is an area that collects variables that can be destroyed.

FIG. 12 shows that by providing the temporary area 33 in a location continuous with the new work area 30, you can create an external memo! The work area that can be used when executing the J207 function program is the first
This may be the area indicated by 34 in FIG. By doing this, the new work area 30 becomes larger by the size of the temporary area 33, and more data can be processed.

Note that although this embodiment has been described in the case of a document processing device, the present invention is not limited thereto, and can of course be applied to general data processing devices.

Further, although the sorting order has been explained in the case of alphabets, an arbitrary sorting order may be specified using a keyboard, for example.

As explained above, according to this embodiment, an unused area provided for document registration in RAM or a work area that is not used except for waiting for a specific task to be executed is used as temporary memory for the sorting function. This has the effect of allowing more data to be processed with less memory space.

[Effects of the Invention] As described above, according to the present invention, there is an effect that a plurality of pieces of data can be efficiently sorted by using an empty area of memory.

[Brief explanation of the drawing]

Fig. 1 is a block diagram showing the functional configuration of the sorting method of this embodiment, Fig. 2 is a block diagram showing the schematic structure of the document processing device of this embodiment, Fig. 3 is a diagram showing the memory map of the RAM, and Fig. 4 is a flowchart showing the sorting process of the embodiment; FIGS. 5 and 6 are flowcharts showing the data transfer process to the unused area; FIGS. 7 and 8 are diagrams showing examples of data arrangement in the sort data area; FIG. 9 is a diagram showing an example of the numbered table, FIG. 1O is a diagram showing the result after sorting, and FIGS. 11 and 12 are diagrams showing memory maps of other embodiments. In the figure, 21... start address of unused area in document area, 22... numbered table, 23... sort data area, 24... new control program, 25... used area , 26...Unused area, 201...CPU
, 202...ROM, 203...RAM, 204...
・Display, 205 ・Keyboard, 206・
...Interface section, 207...External memory, 2
08... It is a printer. Figure 2 Figure 3 Figure 4 Figure 6 Figure 5 Figure 7 Figure 8 Figure 9 Figure 10 Figure 11 Figure 12

Claims (1)

[Claims] a numbering means for numbering a plurality of data stored in a memory area in a desired order; and a transfer means for sequentially reading out the plurality of data based on the numbers and sequentially transferring the plurality of data to an empty area of the memory in the order in which they were read. , means for transferring and storing the plurality of data transferred and arranged in the free area to the original memory area again.