JP3213455B2 - Document processing device rearrangement method - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a document processing apparatus such as a Japanese word processor, and more particularly to a method for rearranging a plurality of data in a predetermined format and selecting data satisfying a certain condition from a plurality of data. The present invention relates to a document processing device having a function.

[0002]

2. Description of the Related Art Conventionally, a document processing apparatus such as a Japanese word processor has a so-called database search / classification function of rearranging data or selecting necessary data in addition to a basic function of document editing. Has been commercialized.

For example, as shown in FIG. 11, some conventional document processing apparatuses have a function of rearranging address book data. Hereinafter, a conventional data sorting function will be described with reference to FIG. Here, FIG.
Shows the address book data in the order in which it was entered.
FIG. 11B shows the display of the address book data after sorting in ascending order of age.

[0004] The address book data includes a name, an age, a blood type, a telephone number, and an address for each person.
Displayed across lines. That is, it is assumed that five items of information are displayed in two lines per data.
Each item of information is input at a predetermined position in a fixed format.

In order to execute a function of rearranging the input data in ascending order of age, at least a range to be rearranged and a condition for rearranging are set, and furthermore, the number of rows per data is plural. If it spans lines, specify the number of lines.

For example, a range is specified by using a cursor key, and the position of the first name, that is, (row position, column position)
, And the position of the last address, that is, (row position, column position).

[0007] To designate a condition, an item corresponding to arrangement in ascending order of age is selected from a set condition menu prepared in advance using a cursor key or a numeric keypad. To specify the number of lines of data, enter a number using the numeric keypad. Here, "2" is input. After the instruction input as described above, the sorting function is executed.

FIG. 12 shows an example of this conventional rearrangement processing. In this example as well, sorting is performed in ascending order of age. FIG. 12A shows a part of the recording state of the document data before sorting, and FIG. 12D shows a part of the recording state of the document data after sorting. Here, it is assumed that one data is composed of four pieces of information of a line number, a name, an age, and a blood type.

The processing tables shown in FIGS. 12 (b) and 12 (c) are memory areas for storing condition data extracted to execute the rearrangement processing.

FIG. 13 shows an example of the contents stored in the processing table. A start line number, a document start address, a document end address, and condition data are stored for one piece of data. For example, for the data of the first line, the storage address of the character character code of "1" for the start line number, the storage character address of the "middle" for the document start address, and the storage address of the character character code of "A" for the document end address , "22" is stored in the condition data.

Next, a description will be given of the processing operation of the rearrangement in the conventional example. As described above, when the rearrangement process is executed after the range of the rearrangement, the condition, and the number of rows of one data are specified, first, a processing table as shown in FIG. 12B is created. FIG. 14 shows a flowchart of the processing table creation.

In step S101, a pointer, a counter, and the like necessary for creating a processing table are initialized. In step S102, it is confirmed whether or not all data processing within the designated range has been completed.

If it is not the end of data, step S103
In, it is determined whether the line number indicated by the line counter is a line containing the specified condition, and if the line is a line containing the condition, the value corresponding to the condition is Take out and create a processing table (step S1
04).

If the line indicated by the line counter is not a condition line, or after the processing in step S104, the document data pointer is updated and the line counter is incremented to create a processing table for the next data ( Step S105).

As described above, the processing table is created. In order to execute the above processing procedure, the input data is stored in a fixed format, and the input position of the designated condition data is determined. It is assumed that it is known in advance and that the number of rows per data is all the same.

Before the data is rearranged, the processing data is rearranged by referring to the condition data in the processing table according to the specified condition. FIG. 12C shows the result of the processing table rearranged under the condition of “rearranged in order of age”.

Thereafter, the document data is rearranged so as to correspond to the rearranged processing table, and finally, the document data in the order shown in FIG. 12D is obtained.

Although it is not intended to rearrange the data, Japanese Patent Application Nos. Hei 3-68064 and Hei 3-28 disclose the invention of replacing document data consisting of a plurality of pages in page units.
2877 and Japanese Patent Application No. 4-188268.

Japanese Patent Application No. 3-68064 describes a method of inputting page numbers in a rearrangement order and moving a document in page units. Japanese Patent Application No. 3-282877 discloses a method of inputting page numbers. A document creation device capable of confirming at a glance the order after inputting and rearranging documents in page units is described. Japanese Patent Application No. 4-188268 has a page buffer for one page. A document processing apparatus that inputs page numbers and sorts documents in page units is described.

[0020]

Conventionally, when rearranging or selecting data, processing is performed on the premise of a fixed format, so that the number of rows per data must be the same. The user has to create data at a predetermined position in accordance with the specified number of lines, and there is a problem that data with a special annotation line added cannot be sorted or selected. .

Although a plurality of lines can be handled per data, it is necessary to specify the number of lines in advance, and the operation including the key input for moving the cursor is considerably complicated, and there is a possibility that an input error may occur. There was a problem of being big.

The present invention has been made in view of the above circumstances. One unit of data consisting of a plurality of pieces of information is delimited by a page break code, and a word serving as a search condition and its expression form are stored in advance. By doing so, the data to be rearranged or selected is treated as page-based data, making it unnecessary to specify the number of lines in one unit of data, and the rearrangement or selection can be performed for any one-unit data with a different number of lines. An object of the present invention is to provide a document processing apparatus capable of performing processing.

[0023]

According to the present invention, there is provided a one-unit data unit.
Data with a predetermined format and an optional
Document data storage composed of given page break codes
Means for storing input data in the document data storage means.
A given expression corresponding to the search term specified by the column
Formula information, one unit data delimited by the page break code
Each time, and input means based on the searched information.
One unit of data to satisfy the search conditions entered
Document processing apparatus characterized in that sorting is performed.
It provides a method of rearranging the positions. FIG. 1 shows a basic configuration block diagram of the present invention. Referring to FIG. 1, the present invention has a function of rearranging or selecting document data, comprising input means 2 for inputting document data, display means 3 for displaying document data, and control means 1 for editing document data. A document data storage means 4 storing document data having a plurality of unit data consisting of an information group of a predetermined format over an arbitrary plurality of lines, a plurality of terms serving as search criteria, and a plurality of expression forms. A reference word storage means 5 pre-stored; and a search information storage means 6 for storing search terms and search conditions specified by the input means 2; The document data is stored in the document data storage unit 4, and the control unit 1 executes the search specified by the input unit 2 in the document data storage unit 4. Information of a predetermined expression format corresponding to the phrase is searched for each unit data delimited by the page break code, and the unit data is arranged based on the searched information so as to satisfy the search condition. It is an object of the present invention to provide a document processing apparatus characterized by performing replacement or selection processing.

Further, the control means 1 divides information in a predetermined expression format corresponding to the search term specified by the input means 2 in the document data storage means 4 by the page break code. When performing a search for each unit of data, a page in which information in a predetermined expression format corresponding to the search term exists and a page in which the information does not exist are identified, the identification result is displayed on a display unit, and rearrangement or It is preferable that the rearrangement or selection process is performed after an input for specifying a page to be subjected to the selection process is performed.

Further, the control means 1 divides information in a predetermined expression format corresponding to the search term specified by the input means 2 in the document data storage means 4 by the page break code. When searching for each unit of data, a page in which information of a predetermined expression format corresponding to the search term exists and a page in which the information does not exist are identified, and only the existing pages are sorted or selected to perform processing. It is preferable that the pages not to be processed are treated as being continuous with the page immediately before the information of the predetermined expression format corresponding to the search term exists.

Here, it is preferable that the control means 1 use a CPU (central control unit), and it is preferable to perform the rearrangement or selection processing by control software stored in a ROM, a hard disk or the like. A RAM, a hard disk, or the like is preferably used for the document data storage unit 4, the reference word storage unit 5, and the search information storage unit 6.

[0027]

According to the present invention, one unit of data is composed of an information group of a predetermined format extending over an arbitrary plurality of lines and a form feed code added last, and is stored in the document data storage means. In the storage unit, information of a predetermined expression format corresponding to the search phrase specified by the input unit is searched for each unit of data delimited by the page break code, and input based on the searched information. Since the unit data is rearranged or selected so as to satisfy the search condition, it is not necessary to specify the number of rows of the unit data, and the position of the information constituting the unit data can be specified accurately. This eliminates the need for inputting, and simplifies operations relating to the sorting or selection of document data, and reduces the burden of input operations.

[0028]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS The present invention will be described below in detail with reference to the embodiments shown in the drawings. Note that the present invention is not limited to this. FIG. 2 is a block diagram showing the configuration of an embodiment of the document processing apparatus according to the present invention. In FIG. 1, reference numeral 21 denotes a control unit, which includes a CPU, a ROM, a RAM, and an I / O.
It is composed of an O port and the like, and performs document processing by controlling other peripheral devices by control software built in ROM or RAM.

Reference numeral 22 denotes a keyboard for instructing a document input and a control operation. Reference numeral 23 denotes a display device, which uses a CRT or an LCD, and displays a document and an operation instruction. Reference numeral 24 denotes a program memory, which uses a ROM or a RAM and stores software indicating a control procedure of the document processing apparatus.

Reference numeral 25 denotes a document data memory, which generally uses a RAM and stores an input document. Reference numeral 26 denotes a processing table memory, which uses a RAM and stores information for performing a rearrangement or selection process. Reference numeral 27 is a reference phrase memory, which is a memory that uses a RAM and stores a reference phrase to be searched and its expression form.

FIG. 3 shows an example of a phrase stored in the reference phrase memory 27 and its expression form. Here, the terms used as search criteria are “date”, “number”,
There are five types: “page”, “table of contents”, and “setting”.

In addition, for each word, a plurality of expression forms of character strings actually used in the document are registered. For example, when “date” is selected as a search term, “xxx / xxx / xxx” and “xxx.
Xx. Xx "," xx "," Heisei.xx year xx month xx "
A search is made to see if there is a character string having an expression format such as "day" or "xxx year xx month xx day". Where xx
Is a symbol indicating that it may be an arbitrary number. Of these words and expressions, those frequently used are preferably prepared by the system from the beginning, but may be defined and registered by the user.

It is assumed that the reference phrase memory 27 has a selection flag indicating which phrase and expression form the user is currently trying to use for retrieval.
For example, the phrase and expression form in which the selection flag is “1” are used for the search.

Reference numeral 28 denotes an external storage device, which uses a hard disk or a floppy disk drive and stores many documents. Reference numeral 29 denotes a printer, which prints a document and a processing result of sorting and selection.

In the following, the rearrangement processing in one embodiment of the present invention will be described. FIG. 4 shows an example in which sorting is performed on document data in an address book. FIG. 4A shows address book data input using the keyboard, and these are stored in the document data memory 25.

It is assumed that the address book data for one person includes "name", "age", "blood type", "telephone number", and "address". Here, "name", "age", "blood type", and "telephone number" are respectively input at predetermined positions. These are the data in one line,
The line is terminated by a line feed code.

The "address" is entered in the second and subsequent lines, and the number of lines may be arbitrary as shown in the figure. For example, remarks or special notes may be entered in addition to the address. The "address" is composed of a plurality of lines, but a page break code is always added as the last delimiter of data for one person. Since the break of one unit data is indicated by a page break code, it is not necessary to unify the number of lines of one unit data to the same number of lines.

That is, as shown in FIG. 4A, each address book data is stored in page units, and a line number is given from the top. The address book data, that is, the character data codes are sequentially stored in a predetermined memory address area of the document data memory 25.

Assuming that the set value of the maximum number of characters in each line is the same, since the start position address and end position address of each line are determined in the document data memory 25,
By finding the page break code, the document start address and document end address of each address book data can be obtained.

For example, the address book data of "Katsushi Takahashi" is presently on the fourth page and is data of three lines located on the eighth to tenth lines from the top. Is the document start address, and the address where the last page break code on line 10 is stored is the document end address.

Next, a procedure for rearranging the input address book data shown in FIG. 4A in ascending order of age to obtain the address book data shown in FIG. 4E will be described. First, when the reordering function is selected, a reordering condition setting screen as shown in FIG. 7 is displayed on the CRT.

Here, the selection of a phrase as a reference for rearrangement and the specification of the rearrangement order are performed by key input of a cursor movement. For example, to sort in ascending order of age, select "Date" and specify "Smallest".

By setting the above search conditions, a processing table for rearranging the address book data is created.

FIG. 5 shows an example of the configuration of the processing table. The processing table is created for each page, that is, for each unit of data, and includes a start line number, a last line number, a document start address,
It consists of a document end address, condition data, and a valid / invalid flag.

FIG. 6 shows a flowchart of the processing table creation by the control unit. First, in step S1, initial values of a pointer and a counter value required for the processing are set.

The document data pointer indicates an address in the document data memory where the current processing is to be performed, and the head address of the document data memory is set. The line counter is a counter indicating the line number currently being processed,
“1” is initialized. The table pointer indicates the address of the memory destination of the processing table to be created, and the start address is set.

The intra-page counter is a counter indicating the line number being processed in the page, that is, in one unit of data.
“1” is initialized. The valid / invalid flag is a flag indicating whether or not the designated reference phrase exists in the currently processed page, and is set to “invalid” as an initial value, for example, “0”.

In step S2, the conventional one-line editing function is executed, and in any line, whether the document ends at that line, ends with a line feed code, or ends with a line feed code Is checked, and the corresponding code value is returned. In step S3, if the document data has been completed, the processing is terminated assuming that the processing of all rows has been completed.

If the document data does not end, it is determined in step S4 whether the line currently being edited ends with a page break code. The number of lines indicated by the in-page counter up to this is regarded as one unit data, and a processing table as shown in FIG. 5 is created (step S10).

Here, the start line number, the last line number, the document start address, and the document end address of the page are written into the processing table memory 26 using the line counter and the in-page counter. Further, for the processing of the next page, the document data pointer is updated, the line counter is incremented by 1, and
The in-page counter is initialized to "1".

If it is determined in step S4 that the process has not ended with a page break code, it is checked whether the line to be edited fits within the page (step S5). If the line does not fit in the page, the line is regarded as the last line of the page, the process proceeds to step S10, and the same processing as when the line has a page feed code is performed. If it fits within the page, go to step S6.

In step S6, it is checked whether or not there is an expression form corresponding to the specified phrase serving as a reference for the search. For example, in the case of age data, all expression forms corresponding to the phrase "date" are checked.

In the age data, since it matches "XX" in the expression form, it is determined in step S7 that the age data exists, and in step S8, the valid / invalid flag of the reference word is set to "valid". For example, "1"
Is stored as the condition data of the page, and the process proceeds to step S9. For example, in the case of “Shingo Nakamura”, the age “22” is stored as the condition data, and “1” indicating validity is set in the valid / invalid flag.

In step S7, even when age data does not exist, the process proceeds to step S9, where the document data pointer is updated to process the next line, and the line counter is incremented by +.
The counter is incremented by one.

As described above, the processing table is created for each unit data of each page, and the data is rearranged based on the processing table. In the case of the address book data of FIG.
Under the search conditions shown in FIG. 4B, FIG.
Is created. However, in the figure, the document start address and document end address of each page are omitted here.

Next, when the processing table of FIG. 4 (c) is created, the condition data of FIG. 4 (c) is rearranged based on the condition of "small order" shown in FIG. 4 (b). The other data corresponding to the condition data is also rearranged, and the rearranged processing table shown in FIG. 4D is obtained. That is, the processing tables are rearranged in ascending order of age indicated by the condition data.

Next, according to the processing table of FIG. 4D, each page data is replaced, and the address book data is rearranged as shown in FIG. 4E. That is, the data of the line numbers 8 to 10 to which the condition data “20” belongs is moved to the second page, the data of the line numbers 3 to 5 to which the condition data “22” belongs is moved to the third page, and so on. The data to which the data “24” belongs is moved to the fourth page, the data to which the condition data “25” belongs to the fifth page, and the data to which the condition data “28” belongs to the sixth page. Note that the first page is a so-called headline row of the address book, which is left as it is because there is no condition data.

As described above, a page break code is added to the delimiter of one unit data, information of a predetermined expression format corresponding to the specified search phrase is searched from the one unit data, and the specified search condition is obtained. Since one unit data is rearranged so as to satisfy the condition, one unit data having different numbers of rows can be rearranged.

Further, since it is only necessary that the expression form corresponding to the search word exists somewhere in the unit data, it is not necessary to strictly protect the input position of the input data, and the number of lines per unit data is not required. The operation is simplified because there is no need to give the instruction.

Although the embodiment of the rearrangement process has been described above, the same applies to the process of selecting data satisfying the conditions. For example, when the selection function is selected, a selection condition setting screen as shown in FIG. 8 is displayed on the display device 23, and a reference word and a selection condition are specified. Thereafter, as in the case of the rearrangement, an expression form corresponding to the word is searched, condition data is extracted, a processing table is created, and only data whose condition data matches the condition is selected and displayed.

Next, a description will be given of a process in the case where some pages have an expression form corresponding to a designated reference phrase and some pages do not. As shown in the flowchart of FIG. 6, it is checked in step S7 whether or not there is an expression form corresponding to the reference phrase in each unit data. Are set to valid ("1"). If not present, it is not set and remains invalid ("0").

FIG. 9 shows an example of a page information confirmation screen. This is created after the completion of the creation of the processing table shown in the flowchart of FIG. 6, and displays, for each page, whether or not a specified reference word (reference word) exists.

Here, it is assumed that the page number, the data content of the first line of the page, the presence / absence of a reference word, and whether or not the data is to be rearranged are displayed. In FIG. 9, the presence / absence of a reference word is displayed as “present” when the valid / invalid flag of the processing table is “valid”, and is displayed as “absent” when the valid / invalid flag is “invalid”. The data content of the first row is the data at the start row number of the processing table.

The user instructs, by referring to FIG. 9, whether or not the page having the reference word is to be rearranged by cursor key input. The valid / invalid flag of the page specified not to be rearranged is set to invalid “0”. After inputting this instruction,
The pages to be rearranged are rearranged.

As described above, after the processing table is created, a display in which the page in which the reference word exists and the page in which the reference word does not exist is displayed, and the user is instructed whether or not the page is to be rearranged. Before replacement, unnecessary data can be removed even if a reference word exists, processing can be speeded up, and operations such as deleting unnecessary data after rearrangement can be omitted. . Similarly, in the case of the selection process, an instruction input as to whether or not to be a selection target may be input.

In the processing in the case where the page where the reference word exists and the page where the reference word does not exist are mixed, as shown in FIG. 9, the pages which do not exist are completely excluded from the sorting target. The non-existing page may be regarded as a page following the page in which the reference word immediately before the page exists, and the rearrangement process may be executed. As a result, document data including a plurality of pages can be handled as one unit data.

For example, when the page information confirmation screen shown in FIG. 9 is created, three pages without a reference word are determined to be a continuation of two pages and rearranged. That is, when the processing table is rearranged based on the reference word, pages without reference words whose valid / invalid flag is invalid are also rearranged.

After moving the processing table information of the page where a certain reference word exists, if the next page of the page is a page where no reference word exists (if the valid / invalid flag is invalid) The information of the non-existing page is also moved continuously.

As described above, by using the valid / invalid flag on the processing table, pages without the reference word are rearranged as those following the page with the reference word, and information of the processing table is rearranged for all pages. After that, the data in the document data memory is rearranged in the order of the pages of the processing table.
In the same manner, with respect to the selection function, similarly, if a page having a reference word immediately before a page having no reference word is selected by using information of the processing table, a page having no reference word is also selected continuously. It is possible.

FIG. 10 shows an embodiment of the reordering process when one unit data covers a plurality of pages. FIG. 10 (a)
Each page has a different number of lines of data, page 1, page 2, and 4
The page is a page with date data, and the third page is a page without date data. That is, the information in the expression format corresponding to the date data is as shown in FIG. 3, but there is no character string corresponding to this on page 3;
When creating the processing table, it is determined that the page has no reference word.

For this document, "date""smallorder"
When the reordering process is executed, documents are rearranged in ascending order of date as shown in FIG. 10B. Further, since there is no information of the expression format corresponding to the date data on page 3, it is placed immediately after page 2. In this example, there are four pages after rearrangement.

As described above, the page having the expression form corresponding to the designated reference word and the page immediately after the page and having no expression form are processed so as to be always continuous. Therefore, even when one unit data covers a plurality of pages, the sorting or selecting process can be performed.

[0073]

According to the present invention, one unit of data consisting of an information group of a predetermined format over an arbitrary plurality of lines is delimited by a form feed code, and information of a predetermined expression format corresponding to a specified search phrase is stored in the unit. Search for each unit of data,
Since the unit data is sorted or selected so as to satisfy the search condition based on the searched information, it is not necessary to specify the number of lines of the unit data, and any line with a different number of lines can be used. Sorting or selecting processing can be performed on data of a number.

Further, since a plurality of terms to be searched and their expression forms are stored in advance, and information of the expression form corresponding to the specified search term is searched for each unit data, one unit data is stored. It is not necessary to accurately specify the position of the information to be configured, and the operation for rearranging or selecting the document data can be simplified, and the burden on the input operation can be reduced.

Further, a page in which information of a predetermined expression format corresponding to a search term exists and a page in which the information does not exist are identified, and a page to be rearranged or selected is designated, and each process is performed. Therefore, before executing the rearrangement or selection processing, data that does not need to be processed can be excluded, and the processing can be speeded up and the operation can be simplified.

Further, a page in which information of a predetermined expression format corresponding to a search term exists and a page in which the information does not exist are identified, and a page in which no information exists is processed as a continuation of a page immediately before the information exists. Sorting or selecting processing can be performed on document data covering a plurality of pages as one unit data.

[Brief description of the drawings]

FIG. 1 is a block diagram showing a basic configuration of the present invention.

FIG. 2 is a system configuration diagram according to an embodiment of the present invention.

FIG. 3 is a configuration diagram of a reference phrase memory according to the present invention.

FIG. 4 is an explanatory diagram of a rearrangement process according to the embodiment of the present invention.

FIG. 5 is a configuration diagram of a processing table memory in the embodiment.

FIG. 6 is a flowchart of a processing table creation process in the embodiment.

FIG. 7 is an explanatory diagram showing an example of a setting screen of a sorting condition in the embodiment.

FIG. 8 is an explanatory diagram showing an example of a selection condition setting screen in the embodiment.

FIG. 9 is an explanatory diagram showing an example of a page information confirmation screen in the embodiment.

FIG. 10 is an explanatory diagram showing an embodiment in which one unit data of the present invention includes a plurality of pages.

FIG. 11 is a schematic diagram of a conventional rearrangement process.

FIG. 12 is an explanatory diagram of a conventional rearrangement process.

FIG. 13 is a configuration diagram of a conventional processing table memory.

FIG. 14 is a flowchart of a conventional process table creation.

[Explanation of symbols]

 REFERENCE SIGNS LIST 1 control means 2 input means 3 display means 4 document data storage means 5 reference word storage means 6 search information storage means 21 control unit 22 keyboard 23 display device 24 program memory 25 document data memory 26 processing table memory 27 reference word memory 28 external storage Device 29 Printer

Claims (1)

(57) [Claims] 1. A method in which one unit data includes a plurality of arbitrary rows.
Format information group and the form feed code added last.
And stored in the document data storage means.
Search term specified by the input means in the storage means
The information in a predetermined expression format corresponding to
Searched for each delimited unit of data, and the searched information
Satisfies the search condition input by the input means based on
Document processing device that sorts one unit of data
In the document data storage means by the input means.
Of a predetermined expression form corresponding to the search term specified by
Information for each unit of data separated by the page break code
When searching for, a predetermined expression corresponding to the search term
Identify the page where the formula information exists and the page where it does not exist, and
Sorts only the pages that do not
If there is information in the specified expression format corresponding to the search term
Processed as a continuation of the previous page
A sorting method for a document processing device.