JP2745500B2 - String search device - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a character string search apparatus for searching for an arbitrary character string from a designated position in a file.

[0002]

2. Description of the Related Art Conventionally, when character string searches are classified according to the search direction, they are divided into forward search and backward search. FIG. 4 is a flowchart of a forward search by software that handles character strings as data. In the figure, when the forward search function is selected, a search character string specified by the user is first read in a search character string read 1. Next, in the setting 8 of the search start position, it is determined from which position of the file (what line and column) the forward search is started.

In search processing 3, a character string that matches the search character string is searched forward from the file. Finally, in search end determination 4, if the search position is at the end of the file (hereinafter EOF: End Of File), the forward search ends, and if not, the process returns to search process 3 to continue the forward search. The search start position is determined by using the position where the cursor exists or by having the user specify the search start position immediately before the search.

[0004] In the case of backward search, in the flowchart of FIG. 4, search processing 3 is backward search processing. If the search position is the head of the file in search end determination 4, the backward search is terminated. If not, the process returns to the search process 3 to continue the backward search.

[0005] "SUMMA" as shown in FIG.
Assume that a source program file starting with “RY” and ending with “END” is open. At this time, using the search function of the editor, the character string “LOOP” is specified as a search character string, and the beginning of the program is specified. A forward search is performed as a search start position.First, “LOO:” in “LOOP:”
P ”and then“ LOO ”in“ BR LOOP2 ”.
"P", and so on until "LOOP" in "BR LOOP" in the same manner.
The search is terminated when it reaches the end of “END” which is the OF.

When the search start position is set in the area and a forward search of the search character example "LOOP" is performed, first, "BR L
The search from “LOOP” in “OOP2” to “LOOP” in “BR LOOP” is completed, and the forward search is completed.
“LOOP” in “OOP:” is not searched. On the other hand, the search character string “LOO” is
When the backward search of “P” is performed, “LOO” in “LOOP:”
After searching for "P", the backward search is terminated when the search position comes before "SUMMARY ..." which is the head of the file, so "LOOP" after "BR LOOP2" is not searched.

[0007]

By the way, in the above-described character string search, when the entire file is to be searched, in the conventional forward search, the search is performed when the search position reaches the end of the file (EOF). Was terminated, so the search start position had to be set at the beginning of the file.
In addition, it is necessary to switch the screen (vertical and horizontal scrolling, page switching, etc.) to set the search start position to the beginning of the file. For a file with a large number of lines or columns, take time to switch the screen. Had been.

If the search start position is not the beginning of the file, the search is performed in front of the search start position, and there is a possibility that a search omission may occur behind the search start position. In particular, if there are several setting methods for the search start position, it is impossible to know where the forward search was performed from, and it became a cause of search omission unless you checked which setting was enabled . This search omission can be eliminated by the backward search, but after all, the forward and backward searches must be performed twice. Since the search omission causes the replacement omission, the forward and backward replacement must be performed at the time of replacement. Did not. Further, the backward search has the same problem as the forward search.

SUMMARY OF THE INVENTION The present invention has been made to solve the above-described problems in the conventional example, and does not set a search start position at the beginning or end of a file and does not cause a search omission. It is an object of the present invention to provide a character string search device capable of searching for a character string by forward or backward search.

[0010]

In order to achieve the above object, a character string search device according to the present invention provides a character string search device that searches for an arbitrary character string from a designated position of a file. Storage means for storing an arbitrary designated search start position in a file; and search execution means for performing a search for a designated search character string in the entire file from the search start position. is there.

[0011] A character string search device according to another invention includes:
In a character string search device that searches for an arbitrary character string from a specified position of a file, a storage unit that saves one specified file or an arbitrary specified search start device within a specified range among a plurality of files during a character string search, Search execution means for searching for the specified search character string from the search start position to the entire specified range.

[0012]

In the character string search apparatus having the above-mentioned structure, at the time of a character string search, an arbitrary specified search start position in a file or a specified range is stored, and the specified file or the entire specified range is designated from the search start position. Search for a search string.

[0013]

【Example】

First Embodiment Next, the present invention will be described with reference to the drawings. First, FIG. 1 shows a hardware block diagram for executing a character string search according to the present invention. The hardware includes a CPU 10 for executing software for a character string search, and the CPU 10 for executing the software and data handled by the software. It comprises a memory 20 for storing, and an auxiliary storage device 30 for storing a file 60 to be searched. The software is loaded into the program area 40 and the file 6
0 is transferred from the auxiliary storage device 30 to the file 60 in the data area 50. The search start position 70 is an area for storing search start position data indicating a position at which a search starts when a character string is searched.

FIG. 2 is a flowchart for executing a character string search according to the first embodiment of the present invention, and considers a case where a character string to be found is searched forward from one file. First, a character string to be searched in the reading of a search character string 1 is read. In the storage 2 of the search start position, which position of the file 60 to start the search is determined, and is stored in the search start position 70 which is the position data (the number of lines and the number of columns).
The data at the search start position 70 is stored until the search for one search character string is completed. The search start position is
If the cursor is present, use that position, use the position specified by the user for the search, or provide a default value in the case of no specification and use the position such as the top of the file 60 or the upper left of the display screen, One search start position is selected from among them according to the priority.

Next, in search processing 3, a character string that matches the search character string is searched forward from the search start position 70 of the file 60. The search position is moved in the search process,
In search position determination 5, it is determined whether the search position has reached the end of the file 60, EOF. Search position and EO
If F does not match, it means that the search has not been completed up to the end of the file 60, and the forward search is continued as it is. Also, when they match, it means that the search has been completed up to the end of the file 60, and to search the range from the beginning of the file 60 to the search start position 70, the search position is moved to the search position 6 by moving the search position 6. After moving to the beginning, continue the forward search.

The end of the search for one search character string is determined by whether or not the search position has reached the search start position 70 in a search end determination 4 after the search processing 3. If the search position is not the search start position 70, an unsearched range still remains, so the search position is determined in the search position determination 5, and the process returns to the search process 3 to continue the forward search. When the search position matches the search start position 70, the search of the entire file 60 has been completed, and the search is terminated.

That is, in the flowchart shown in FIG. 2 described above, 1 and 2 constitute storage means for storing an arbitrary designated search start position in a file at the time of character string search,
Reference numerals 3 to 6 constitute search execution means for searching a specified search character string for the entire file from the search start position.

In a word processor or an editor, a search is performed in a single file. However, if the entire file composed of a plurality of modules (same format as a file) is to be searched for, for example, in debugging a program, the position of Add the module name as a data element. When the search position comes to the EOF of a certain module, the search position is moved to the head of the next module, and if the criterion of the determination 5 of the search position is replaced with the EOF of the last module, this character string search method can be performed. Can be used. Further, it is also possible to search for a module in such a file as a unit.

The character string search method described above is limited to forward search, but may be backward search. In the case of the backward search, the search process 3 is a backward search process, and the determination criterion of the search position determination 5 is the head of the file 60. When the search position comes to the head of the file 60, the search position is moved by the search position 6 If it moves before the last character of 60, the same processing as the case of the forward search can be performed.

Second Embodiment FIG. 3 is a flowchart for performing a character string search according to a second embodiment of the present invention. A range is designated in one file, and a character string to be found therein is searched forward. Think about it. First, a character string to be searched in the reading of a search character string 1 is read. In the search range determination 7, the user specifies a range to be searched, and the search range start position and the search range end position, which are the position data (the number of lines and the number of columns) of the start and end of the range, are stored. . The search range end position is the position of the character following the last character of the search range,
If the last character of the search range is the last character of the file, the search range end position is EOF. In the search start position saving 2, in which position of the file to start the search is determined,
Save the position data. The data of the search range start position, the search range end position, and the search start position are stored until the search for one search character string is completed.

The search start position uses the position of the cursor if it exists, uses the position specified by the user for the search, or sets a default value in the case of no specification to set the start of the file or the upper left corner of the display screen. One of the search start positions is selected from the positions according to the priority order. In this case, a precondition is that the search start position is within the search range.

Next, in search processing 3, a character string that matches the search character string is searched forward from the search start position of the file.
The search position is moved in the search processing. In search position determination 5, it is determined whether the search position has reached the end position of the search range. The search position and the search range end position are compared. If they do not match, it means that the search has not been completed up to the end of the search range, and the forward search is continued as it is. Also, when they match, it means that the search has been completed up to the end of the search range. In order to search the range from the start position of the search range to the search start position, the search position is moved to the start of the search range by moving the search position 6. After moving to the position, continue the forward search.

The end of the search for one search character string is determined by whether the search position has reached the search start position in the search end determination 4 after the search processing 3. If the search position is not the search start position, an unsearched range still remains, so the search position is determined in the search position determination 5, and the process returns to the search process 3 to continue the forward search. When the search position matches the search start position, it means that the search of the entire search range has been completed, and the search ends.

That is, in the flowchart shown in FIG. 3 described above, storage means 1, 7, and 2 store arbitrary designated search start positions within a range designated between one file or a plurality of files at the time of character string search. And 3 to
6 constitutes a search execution unit for searching for a specified search character string from the search start position to the entire specified range.

In a word processor or an editor, a search is performed within one file. However, when a file composed of a plurality of modules (same format as a file) is to be searched for, for example, debugging of a program, the position of the file is determined. By adding a module name as a data element, this character string search method can be used in a search range specified over a plurality of modules.

The character string search method described above is limited to forward search, but may be backward search. In the case of a backward search, the search process 3 is a backward search process, and the criterion of the search position determination 5 is the search position head position. When the search position comes to the head of the search range, the search position is searched by the movement 6 of the search position. If it moves one character before the range end position, the same processing as in the case of the forward search can be performed.

[0027]

As described above, according to the present invention, the entire file (or the specified search range) is searched until the search for one search character string is completed. The search start position is not set at the beginning or end of the file, or the search start position is set at any position of the file (or the specified search range). This has an effect that a search for a search character string can be performed for the entire file (or a specified search range) by a forward or backward search.

[Brief description of the drawings]

FIG. 1 is a hardware block diagram for implementing a character string search according to the present invention.

FIG. 2 is a flowchart of the first embodiment of the present invention.

FIG. 3 is a flowchart of a second embodiment of the present invention.

FIG. 4 is a flowchart of a conventional example.

FIG. 5 is an illustration of a source program used in the description of the conventional example.

[Explanation of symbols]

 1 Search character string reading 2 Search start position storage 3 Forward or backward search processing 4 Search end determination 5 Search position determination 6 Search position movement 7 Search range determination 8 Search start position setting 10 CPU 20 Memory 30 Auxiliary Storage device 40 Program area in memory 50 Data area in memory 60 File 70 Search start position

 ──────────────────────────────────────────────────続 き Continuation of the front page (56) References JP-A-2-45876 (JP, A) JP-A-63-19066 (JP, A) JP-A-63-201766 (JP, A) JP-A-62-1987 180459 (JP, A) Newton separate volume All the latest versions of word processors PP. 154-155, Education Corporation, October 13, 1983

Claims (2)

(57) [Claims] 1. A character string search apparatus for searching for an arbitrary character string from a specified position in a file, a storage means for storing an arbitrary specified search start position in the file at the time of a character string search, and A character string search device comprising: a search execution unit that searches a specified search character string for the entire file. 2. A character string search device for searching for an arbitrary character string from a specified position of a file, wherein at the time of the character string search, an arbitrary specified search start position within a range specified between one file or a plurality of files is stored. A character string search apparatus, comprising: a storage unit for performing a search for a specified search character string in the entire specified range from the search start position.