JPH09231292A - Character processor - Google Patents

Abstract

PROBLEM TO BE SOLVED: To easily rearrange the character strings by means of the specific characters of a table form by dividing a character string into the sort reference character strings, retrieving the specific one of those divided character strings to count its appearance frequency, and performing a sorting operation based on the appearance frequency. SOLUTION: An input device sets a sorting order, a retrieval character, a retrieval system, a comparison range and a rearrangement range based on a set screen that is displayed by the selection or the rearrangement processing. A retrieval character designation means 17 instructs a character number order via a rearrangement system and designates the retrieval character. When the retrieval start is instructed, a processing range decision means 12 divides a character string of a processed document 11 into the sort reference character strings. A specific character count processing means 13 produces a processing table which stores the number of specific characters included in those divided character strings and the start/end positions of the processing unit. Then a rearrangement means 14 rearranges the contents of the processing table based on the number of characters and then generates and outputs the rearranged character strings via the output processing 15 and based on the processing table.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a word processor, an editor, etc. for inputting / outputting and editing character strings.

[0002]

2. Description of the Related Art In character string rearranging processing (hereinafter referred to as "sorting" or "sorting"), a method of sorting character strings in ASCII code order or JIS code order is widely known as a conventional technique. .

By using such a technique, for example, even when an address book is created, when new data is desired to be added, new registration is performed at the end of the data and sorting is performed so that the data can be located at an appropriate position. Will be inserted.

For example, as shown in FIG. 9 (a), data arranged in the order of Japanese syllabary (Arai), Iijima (Ijima), Okada (Okada), Kato (Saoto), and Sasaki (Sasaki). In addition, when the user wants to add new Ezaki data, the user does not need to be aware of the position to insert, and after inputting at the end of the sentence (Fig. 9 (b)), If sorting processing is performed (Fig. 9
(C)) Good.

Also, numerical data and the like can be easily rearranged in ascending order or descending order if the number of digits is taken into consideration.

[0006]

FIG. 10A is an example of a document. Some circles are marked on each line from AAA to GGG. In order to sort them in the order of the number of circles, multiple procedures were necessary.

Specifically, first, for each line, the user
Are counted by eye. Then, the number is inserted at the leftmost position of the data with the number of digits aligned. For example, FIG.
If there is a document such as (a), there are 2 in the AAA line.
Since there are three circles in the line of BBB, enter "0002" and "0003" at the left end (Fig. 10).
(B)).

In this state, normal sorting processing is performed. Since the number has been put on the left end in the previous process, sorting is performed in that order. Depending on the number inserted,
Sorting is performed with the number of circles (Fig. 10).
(C)). Then, after the sorting is completed, the number inserted previously is deleted, and the sorting process by the number of circles is completed (FIG. 10 (d)).

As described above, it has been possible to sort the number of circles in the past, but since the user needs to count the number of circles and insert the number into the data, the number of circles is very large. If there are many, the burden on the user will be very heavy. On an edit screen of a word processor or the like, a table or the like is large, so that scrolling may be performed in the horizontal direction, but in such a case, it is very difficult to count.

Further, inserting a digit at the left end may cause formatting problems. For example, if there is a table with the maximum number of set characters on one line, inserting a number will cause a problem that the line will be misaligned and the sorting work cannot be performed after that. Therefore, temporarily reset the format. There is a need. Further, it is a very complicated work to delete the inserted numbers after sorting.

Therefore, in the present invention, a specific character string is searched, the number of appearances of the specific character string is counted, and sorting is performed based on the result, so that the table can be easily sorted by the specific character.

[0012]

According to claim 1 of the present invention, input means for inputting characters and the like, storage means for storing characters and the like input by the input means as a character string, and the storage means Output means for outputting the character string stored in
A character processing device comprising a control means for controlling the input means, the storage means, and the output means, in which a character string stored in the storage means is divided into sort reference character strings by a specific delimiter such as a line feed. Means, a specific character string search means for searching for a specific character string in the sort reference character string, and the number of appearances of the specific character string searched by the specific character string search means for each sort reference character string The above-described problem is solved by providing the counting means and the sorting means that sorts the sorting reference character strings with the counting result of the counting means as the sorting condition.

According to a second aspect, in the character string stored in the storage means, the range of the rearrangement process is recognized by a specific character, and the rearrangement process is limited to the range and the rearrangement process is performed. , To solve the above problems.

Further, according to a third aspect, in the character string stored in the storage means, the user designates a range of the rearrangement processing, and the rearrangement processing is limited to the range, and the rearrangement processing is performed. Solve the problem.

[0015]

BEST MODE FOR CARRYING OUT THE INVENTION Embodiments of the present invention will now be described in detail with reference to the drawings. In FIG. 1, the external storage device (1) is a floppy disk, a hard disk, a CD-
Refers to media such as ROM. In the present invention, the documents stored in these are processed. ROM (2)
Stores various programs and character data in advance. The RAM (3) is a temporary storage device, and temporarily stores a document to be processed, a character string, and the like. The display device (5) displays characters and the like, and corresponds to a CRT or LCD. In addition to this, it is also possible to further use a printing device such as a printer. The input device (6) is a keyboard or the like. It is also possible to use a handwriting tablet or the like. The arithmetic unit (4) inputs and outputs data between these units and performs arithmetic operations using an address bus and a data bus.

The first embodiment will be described. FIG.
[Fig. 3] is a diagram showing a relationship between processes. When the rearrangement process in the present invention is selected, the setting screen shown in FIG. 3A is displayed on the display device (5). The user sets the following items from the input device (6) based on the displayed setting screen.

The items are sort order / search character / search method / comparison range / sort range. The search character designating means (7) indicates the order of the number of characters from the rearrangement method,
Specify "○" as the search character. The designated character is not limited to one character and may be a character string. Up to this point, the minimum specification is required.

The comparison range specifies a range in which the number of characters in the specified range (or the code order of the range) is searched. In FIG. 3A, the search range is from the 4th digit to the 30th digit. This specification is not mandatory, and if omitted, the start position will be the beginning of the line and the end position will be the end of the line.

When the search is instructed after the setting is completed,
The following processing is performed. Specific character counting processing means (13)
Thus, the processing table (FIG. 4 (f)) storing the number of specific characters and the start / end positions of the processing unit (for example, one line) in the processed document (11) in the RAM (3) is created.

Subsequently, the rearrangement means (14) is used to set the number of characters as a condition for the processing table (FIG. 4 (g)).
Rearrange. Based on the processing table (FIG. 4 (i)) rearranged last, the character string rearranged by the output processing (15) is generated and output.

Each process will be described in detail. The counting process (13) will be described with reference to FIGS. 4 and 5. First, in step S1, a character string (11) to be rearranged
Figure 4 (d) shows the start and end addresses of the part of
Stored in the internal memory indicated by. Addresses indicating the beginning and end of the character string (11) are stored.

Subsequently, in step S2, rearrangement is performed 1
The start / end addresses of the unit data (one line in the example) are obtained and stored in the processing table FIG. 4 (e).

Next, the position of the search start relative digit number stored in the search digit information (13) is obtained for the one data (step S3).

The character at the position obtained in step S3 is compared with the retrieved character shown in FIG. 4 (b) (step S5). If they match, the number information is increased (step S6).

While the processing position is sequentially updated (step S8), the processing is repeated, and when the processing is completed up to the position of the relative digit number of the search end stored in the search digit information FIG. 4 (c), the number information is displayed. Are stored in the number of positions in the processing table of FIG. 4 (e) (step S8).

By repeating the above processing until the end address stored in the internal memory FIG. 4D (step S10), a processing table as shown in FIG. 4F is created.

The sorting means will be described with reference to FIGS. 4 and 6. The number information is extracted from the processing table shown in FIG. 4 (f) created by the counting processing means (step S1).
1) A comparison is made with the largest sorted table that has already been largely divided (step S13).

As a result of the comparison, if the extracted number information is smaller, the comparison target is changed to the previous one (step S1).
4) Then, compare again. If it is larger, the number information extracted next to the table to be compared and the start / end positions of the data are inserted (step S15).

Repeating to the end of the processing table, FIG.
A rearranged processing table as shown in (g) is created (step S16).

The output process is performed in the following procedure. First, the pointer is initialized (step S17). Then, the start / end address of one data is taken out from the processing table FIG. 4 (g) (step S18), and the corresponding part of the processed document FIG. 4 (a) is transferred to the intermediate buffer FIG. 4 (h) (step S19). .

Processing table All the data in FIG. 4 (g) are transferred (step S20), and the buffer diagram in FIG.
When added to (h), the processing range shown in FIG. 4 (d) is an intermediate buffer in which the portions specified in FIG. 4 have been rearranged.
(H) is created.

When this intermediate buffer FIG. 4 (h) is transferred from the start address to the end address specified in the processing range FIG. 4 (d) (step S22), the final output is the document buffer FIG. 4 (i). Is completed.

Next, an example in which the designated character is "all characters" is shown. FIG. 3B shows an example of the setting screen. Here, the sorting method is the order of the number of characters, and the designated character is "all characters".
And The subsequent settings may be the same, but this time, the example shown in FIG. 7A is used for the document buffer. Therefore, the comparison range is set from the first digit to the tenth digit. The settings are stored in FIGS. 7B to 7D.

A procedure for rearranging the document buffer as shown in FIG. 7A in the order of the number of characters will be described. First, step S1
The same is true up to step S3. In step S4, it is determined whether the mode is the all-character mode. Since the mode is the all-character mode, the valid characters are counted in step S9. The other processing is the same.

The state of the memory is shown in FIG. The state of the memory at the time of counting “january” of one item is 615. 61 when all 12 items have been counted
The results shown in 6 are obtained.

The rearrangement process is performed on it. The state of the memory after processing is shown in FIG. Based on this, the document buffer shown in FIG. 7 (h) is created. In other words, they are sorted in descending order of the number of characters.

The second embodiment will be described. This is a method of designating the start / end range of the sorting process by a specific character string. FIG. 3C shows an example of setting. In this setting example, "character designation" is selected as the rearrangement range, and the character string "table start" is input as the start designation. If this string is in the document buffer,
The processing range starts from the next line.

The end designation is also the same. In this example, the character string "end of table" is entered. When this character string exists in the document buffer, the processing range up to the preceding line is set.

The flow of processing will be described with reference to the flowchart of FIG. Step S31 is a process for discriminating between the process for determining the start line and the process for determining the end line, and the start line determination process is substituted as the initial value. In step S32, one line of data is fetched from the document buffer, and in step S36, it is checked whether the start character string is included in the data.

If the character string exists, the start address of the next line is stored as the processing range (step S39),
Using the search mode as the end line (step S41), the end line determination process is performed by the same procedure. Subsequent processing is the same as in the above-described first embodiment.

In this example, the processing range extends to the next line where the designated character string exists and the line before the end designated character string exists. However, for example, it starts from the line where the designated character string exists. Or, you may allow the setting method of ending.

A third embodiment will be described. This is a method of specifying the start / end range of the sorting process by directly inputting the line number. An example of setting is shown in FIG. In this setting example, the sorting range is "12.
The lines from "line 350" to "line 350" are specified, that is, the 12th to 350th lines in the document buffer are the processing range.

If the number of rows is designated in step S38 of FIG. 8, that row is set in step S39. Subsequent processing is the same as in the above-described first embodiment.

By the above processing, the sorting processing can be performed based on the number of appearances of a specific character string.

[0045]

According to the related art, a user conventionally searches for a specific character string in the entire document, counts the value, temporarily writes the value in the document for sorting, and then deletes the complicated character string. I had to do some processing,
According to the present invention, it is possible to collectively perform the processes of searching, counting, and rearranging.

Furthermore, not only sorting by the number of appearances of a specific character string, but also sorting of all characters by the number of characters becomes possible.

Further, by designating a specific character string existing in the document as the processing range, the table data and the like can be automatically sorted even when the table length and the start position are different, and the table configuration is the same. In the case of, by specifying the number of rows, it becomes possible to automatically sort the table portion.

[Brief description of drawings]

FIG. 1 is a block diagram according to an embodiment of the present invention.

FIG. 2 is a diagram showing a processing relationship in the embodiment of the present invention.

FIG. 3 is a diagram showing a display example of a setting screen in the embodiment of the present invention.

FIG. 4 is a diagram showing a state of a buffer / memory in the embodiment of the present invention.

FIG. 5 is a flowchart showing a flow of counting processing in the embodiment of the present invention.

FIG. 6 is a flowchart showing a flow of rearrangement processing according to the embodiment of the present invention.

FIG. 7 is a diagram showing a state of a buffer / memory in the embodiment of the present invention.

FIG. 8 is a flowchart showing a flow of range search processing according to the embodiment of the present invention.

FIG. 9 is an explanatory diagram of a conventional technique of the present invention.

FIG. 10 is an explanatory diagram of a conventional technique of the present invention.

[Explanation of symbols]

 1 External Storage Device 2 ROM 3 RAM 4 Computing Device 5 Display Device 6 Input Device 11 Processed Document 12 Processing Range Determining Means 13 Counting Processing 14 Sorting Means 15 Output Processing 16 Processing Start / End Line Designating Means 17 Search Character Designating Means 18 Processing start / end character string specifying means 19 Search means 20 Search start / end digit specifying means

Claims (3)

[Claims] 1. Input means for inputting characters and the like; storage means for storing the characters and the like input by the input means as a character string; output means for outputting the character string stored in the storage means; A character processing device comprising a control means for controlling an input means, a storage means, and an output means, wherein a character string dividing means for dividing a character string stored in the storage means into sort reference character strings by a specific delimiter such as a line feed A specific character string search means for searching a specific character string in the sort reference character string; and an appearance frequency of the specific character string searched by the specific character string search means is counted for each of the sort reference character strings. Counting means, as a condition of sorting the counting results by the counting means,
A character processing device comprising: a rearrangement unit that rearranges the sort reference character strings. 2. The character string stored in the storage means, the range of the rearrangement process is recognized by a specific character, and the rearrangement process is limited to the range to perform the rearrangement process. Character processing device described. 3. The character string stored in the storage means, wherein the user designates a range of the rearrangement process, and the rearrangement process is limited to the range, and the rearrangement process is performed. Character processing unit.