JPS6282432A - Unsequential text search system - Google Patents

Abstract

PURPOSE:To search efficiently even a line number test having a undefined increment by using a line number table to search efficiently tests though line numbers in a work file have a variable increment. CONSTITUTION:When a line number (for example, 120) is inputted to a control part 13 as the retrieval destination, the control part 13 reads out line number tables 14 sucessively from a line number table write/read part 12. The record number of a record where a line number which is equal to or smaller than line number 120 and is nearest to it is stored is detected. The position of the record, where the line number the search destination is place, in the register text area of a work file 10 is determined. The control part 13 reads in this record of the work file 10 to detect the text of the search line number which is equal to or smaller than 120 and is nearest to 120. It is decided whether the detected line number is equal to the search line number or not to terminate the text detection processing.

Description

[Detailed Description of the Invention] [Table of Contents] Overview Industrial Application Fields Conventional Technology Problems to be Solved by the Invention Means for Solving Problems Action Examples (1) Structure of Examples (2) Examples Operation (3) Processing when there are many inserted sentences Effects of the invention [Already 33] The present invention is capable of inserting manual text into the work file even if an indefinite increment of line numbers has been added to the input cattext 1-C in advance. and line numbers), and set the first line number of each I/:TI-1 number in the work file as a small line number. Then, if you want to detect the 1γ position in the text work file at a certain line number, first access the line number table and select the record number where the child kiss l- is thought to exist, i-1, and then: 11] Check the text within the number one by one.

(Industrial Application Field) The present invention relates to an undefined order text 1-0-000 system, and in particular, for a child kiss 1 having an undefined increment of lines Wt'-), it is also possible to find a child kiss 1 in a work file from the line number. Placement - Pertaining to something that has been made to last a thousand years.

[Conventional technology]

In the conventional nib/fri that uses text files,
As shown in Figure 7 (・)), (1)), A, B, 0, [
), 1", when copying the input category '4 mist file in which child kisses 1 to 1" have been entered into the 11 millet file, the work file's sections 3) S+ and S2- are enlarged sequentially. In sections Sl and S2. Line 11 number 100.200,
), and management information having the next row number child kiss 1 storage position n and the previous row number child kiss 1 storage position Wb is not added. In other words, Warako Kiss) A's previous line number text storage (
The position 1γ is zero because the child kiss l-A is the first sentence, and the next line number child kiss 1-storage position is 2 because it is in the section S2. In this way, AXB, C-, etc. are stored in the work file as shown in Figure 7 (1
)) every time it is entered.

When you want to display the input cattext 1 created by the br1 grammar in 7) on the display screen, use this work file.
A, [3, C- will be output from the file, but at this time, they will be renumbered and given a line number, and as shown in Figure 7 i.
clθ) state. Line numbers are child kiss) i, B
- is the stored position x increment value, and (1)) J lower operation L. - Y specifies the text to be processed by each line number. For example, if you want to insert F between 13.0 as a result of displaying the input text on Display+, numbering 1-j
-Specify 200 and 300 and 1, child kiss between -1. F
, )C to be inserted, for example, by inputting it from the keyboard. At this time, inserter kiss 1-
The crosspiece will be used from the shallow end - C1 This text I? , because of the insertion of text B and C, the next line number text is stored in A 17 position, L and the previous line number is stored in character kiss 1 (the position of ☆ is also changed!, resulting in the state shown in Figure 7 + di. Note that this example In the above, we have explained an example in which each record, or row, of a work file has five sections, but normally there are 14 or 24 sections.

The J-1000 method uses the formula: line number = stored position x increment value. I will do it.

[Problem that the invention seeks to solve]

Therefore, for example, if you enter a child kiss 1- with a line number on the input side in this work file, read it 11I, and renumber it, as in the example shown in Figure 9 (
- Text with line numbers such as ``su'' becomes renumbered child kiss 1- such as ``su'' (l), and text that does not correspond to these line numbers and renumbered line numbers becomes a raw LS. By the way, in this case, the operator specifies the text to be processed by the line number as described above, so even if an error is detected in text D and line number [400, J is specified, this will be the source block and the line number of the J-gram. 1-0061, so in a text with line numbers of indefinite increment as shown in FIG. 9, it is not possible to easily detect where the child kiss 1- to be processed exists in the work file as in the past. could not.

An object of the present invention is to create an unordered text file that can easily detect where in a created file even child kisses I- having line numbers of undefined increments as described above exist. The goal is to provide 11 methods.

[Means for solving problems]

In order to achieve the above object, in the present invention, FIG. 1: (a)
As shown in FIG. 2, the text I. is sequentially stored in the sections S s and S 2- of the work file with line numbers added. In FIG. 1 fal, only line numbers are shown to simplify the explanation, and text and management information are omitted. Separately, as shown in FIG. 1, a line number table is provided to record each record number of the work file.

Enter the line number of the text written in the first category of 1, No., and 2-. When a work file is composed of 5 horizontal sections, it is usually 14 sections or 24 sections>
, record NO.] is composed of 81 to S5, and record No. 2.3- is composed of S6 to 51o1SII to 515-.

[Effect]

When detecting the position of the text at line number 120, first access the line number table in Figure 1 (I) and select the number that is smaller than and closest to the line number of the detection light:
1-1' number (RN(')=2 in this example) is determined.

Then, search the text numbering of the work file with that record number and select the text closest to number 5) or lower. At this time, if the line numbers match, that becomes the search destination, but if they do not match, the search destination can be detected based on the pointer pointing to the next text.

〔Example〕

(]) Structure of Embodiment An embodiment of the present invention will be described based on FIGS. 2 to 6.

Fig. 2 is a configuration diagram of an embodiment of the present invention, Fig. 3 is an explanatory diagram of the operation of the present invention, Fig. 4 is an explanatory diagram of text creation, Fig. 5 is an illustration of text update, and Fig. 6 is an explanation of programming system J2. It is a diagram.

In the figure, 10 is a work file, 11 is a work file write/read unit, 12 is a line number table write/read unit, and 13
kl: control section, 14 is a line number table, 20 is a keyboard/display, 21 is a source editor section, 22 is an output file, 23 is a human file, 24 is a Kobol compiler section, 25 is an output file, 26? :t linkage editor section, 27 is an output file.

The work file 104 (j person catechism) is a file into which the data is copied, and is configured in the same way as in Fig. 1, in which the input text is entered in each section Sl, 32- along with the line number. do. Of course, in the sections S+ and S2-, as shown in FIG. 7, management information indicating the storage position of the previous line number text and the next line number text storage position is entered. Also, when entering insert text, this is also the seventh
Similar to what is shown in the figure, you will fill in from the rear.

The work file writing/reading section 11 is used for writing input text into the work file 10 and reading text written in the work file 10.

The line number table writing/reading unit I2 writes the line number table 14
The user inputs input data into the input data and reads the input data.

The control unit 13 writes input data into the work noisle 10, performs control to read data written in the work file 10, writes data of a specific category of the work file 10 into the line number table 14, etc. , reads the data entered in the row number table 14, and performs various controls such as determining what is predetermined.

The line number table 14 is for searching data written in the work file 10, and is used to search the data written in the work file 10.
The first section S+ of each record RNO, I, 2- of 0,
The text entered in Ss, S+ 1- (see Figure F), that is, the line number of the first text of each record (rooIJ, rloooJ, r
150 J-”) is entered.

The keyboard/display 20 is used for inputting new text in sequence, displaying input text, inputting update text for updating text in an input file, etc., inputting new text, displaying new text, updating input text, etc. It performs various types of processing.

The source editor section 21 performs processes such as creating a source module from input categories and updating input text.

The output file 22 holds the source module created by the source editor section 21, and contains 6 models.
This is an input file to the Pol compiler section 24.

The input file 23 is a file in which an input cat text t for a source module is entered.

The compiler section 21 creates a phantom object module in the source module 3 held in the output file 22.

Output file 25? ;t: Kobol: Impai 7 FB
I (object i-modino, - created from 24a)
shall be entered.

Linkage editor section 2G to output file 25? This is to create a t:r-1j module from the leftover module.

111 Cuff file 27 is filled with the object module created by the linkage editor section 26])
(so).

The configuration not shown in FIG. 2 is, for example, the source nib intake part 2 + ! in FIG. 6. , 2 are provided, and the input cathedral 1-4, 1 and 1 are provided.
θ) When the existing line number is detected by the compiler section 24 or linkage editor section 26, etc. 47, input the input cattext 1 of the line number from the work file '0' ♀)? 4). Follow-(
The line number on the work file 10 is output as it is at addition L7, which is 1.

(2) Operation of Example 21'! The operation of one embodiment of the present invention shown in FIG.
Eight examples will be explained in which the B insertion text exists in the l-area. In the following explanation, ■ to ■ are common processes, and 5. ■ is the process of adding λ1 to A, and ■ is the process of adding λ1 to A.
This is the process of adding 1. And in the case of A (, 1 line number 1
An example will be described in which text 20 is detected, and in the case of B, line number +02 is detected.

7- (In this case, the text j- from line numbers 100 to 120 is 100-] 01-] 02-Month 20. It is assumed that the management information is provided so that the text is located in the order of 20.

A. When searching for Kekis 1- in line number 120 ■ Control section +3? On the other hand, when ]20 is input as the line number of the search destination, the control unit 13 sequentially reads out the 7 line number tables 14 to the line number table writing/reading unit 12 and performs processing. Detects the record number containing the row number closest to this lower row number,
This determines which line number to search for in the registered text area of work file 0. In this case, line number 100 corresponds to this, so RN0°2, that is, record number I;32, is determined as M and lJ.

■ The control unit 13 sends the work file writing/reading unit 11 the corresponding L/:l-do of the work file IO, that is, the R
No. Read the 2 part.

(2) The control unit 13 checks the line numbers of the text in each section of the read record 1. Then, the text closest to the search line number, ie, 120 or higher, is determined. In this case, line number 120 is detected.

(2) The control unit 13 determines whether the detected line number is equal to all line numbers. In this case, since both line numbers match, the text detection process ends.

B. When searching for the text at line number 102, ■ As in case A above, the control unit 13 controls the line number table Yoshigome reading unit 12 to sequentially read the line number table 14, starting from line number +02. Record number 2, which has the smallest and closest line number, is determined to be fraudulent.

(2) The control section 13 causes the work file writing/reading section 11 to read the portion of the record number 2 of the work file 10.

■ The control unit I3 checks the line number of the text in each V minute of the read record, and selects 102, which is the car line number.
Determine the closest text below. In this case line number 1
00 text is detected.

(2) The control unit I3 checks whether the detected dowel line number is equal to the line number 9.--1000, but in this case, since they are not equal, the next process (2) is performed.

■ Of course, when they are not equal, the control unit 13 sets line number 1.
00 text, it was learned from the management information that the next text position was written in section Sn, but it was not read out.

■ The control unit 13 recognizes that the line number of the text in this category Sn is 101, which is not equal to the search line number, and determines that the next text position is in the category Sn-+ based on the management information for the text in line l\no.101. It recognizes that it has been written and reads it out. Then, the read line number is checked and it is detected that it matches the search line number, and the search is ended.

(3) Processing when there are many inserted sentences In the conventional case, for example, in Figure 8 fbl, only up to 99 lines of text could be inserted between C and D, but now it is necessary to insert 100 lines. In this case, in the present invention, the line number of the text D written in the work file 10 is set to 30.
Renumber from 0 to 301. That is, the subsequent text is renumbered by insertion processing or the like. And change the row number table accordingly (if necessary). As a result, in the present invention, the number of inserted rows can be increased without reducing search efficiency.

In the above description, for the sake of simplicity, the work file was explained using an example in which the text in the code is 5, but the present invention is of course not limited to this, and for example, the text in the code is 14.
However, even 24 can be used as appropriate.

〔Effect of the invention〕

In the present invention, even if the line numbers in the work file are in indeterminate increments, it is possible to efficiently search for the desired text using the line number table. It becomes possible to search well.

Also, even if the number of lines of insert statements is large, the work file -
By renumbering with 1-, it is possible to insert the file, and this renumbered file can be efficiently accessed on the work file.

[Brief explanation of drawings]

Fig. 1 is an explanatory diagram of the principle of the present invention, Fig. 2 is a configuration diagram of an embodiment of the present invention, Fig. 3 is an explanatory diagram of text 1 to search procedure in the present invention, Fig. 4 is an explanatory diagram of text creation, Fig. 5 6 is an explanatory diagram of the program editing system, FIG. 7 is an explanatory diagram of the conventional source editor, FIG. 8 is an explanatory diagram of the conventional beam number, and FIG. 9 is an explanatory diagram of the beam number. 10 - Work file 11 - Work file writing/reading section 12 - Line number table writing/reading section 13 - Control section 14 - Line number table 20 - Keyboard/display 2I - Source editor section 22 - Output file 23 - Human file 24 - Cobol compiler section 25 = - output file 26 - linkage editor section 27 - output file

Claims (1)

[Claims] In a text editing device equipped with a work file in which input text is sequentially stored and a previous line number text storage position and a next line number text storage position are added, A line number table (14) indicating the line number of the first text, a means (12) for reading and writing to the line number table (14), and a means (11) for reading and writing to the work file (10) are provided. , When accessing text in a work file, find the record that is smaller than and closest to the search line number (including the same) from the line number table, and find the record that is smaller than and the same as the search line number in the text of that record. An irregular order text search method is characterized in that the text with the line number closest to (including the same as) is detected, and the text with the search line number is accessed from this.