JPH02289064A - Character-string replacing system - Google Patents

Abstract

PURPOSE:To improve the replacement editing efficiency by making the character-string length to be replaced in a document equal to the character-string length of a replace ment character-string, and thereafter, succeeding to a modifying method of the character-string to be replaced and replacing it with the replacement character-string. CONSTITUTION:A character-string length comparing part 2 compares character-string length L1 of a character-string to be replaced, detected from in a document and character-string length L2 of a designated replacement character-string. Subsequently, when L1<L2 is decided by the character-string comparing part 2, a character inserting/ deleting part 3 copies and inserts the same character as a final character of the character-string to be replaced into the rear to make L1=L2, and when L1>L2 is decided, the character is deleted from the rear of the character-string to be replaced to make L1=L2. In such a case, under the state of L1=L2, a character-string replacing part 4 replaces the character-string to be replaced with the replacement character- string, and also, executes the replacement so that the modifying method of the character-string to be replaced is allowed to succeed to the replacement character-string after the replacement as it is. In such a way, editing after the replacement is eliminat ed, and the editing efficiency can be improved.

Description

[Detailed Description of the Invention] [Summary] Regarding a character string replacement method for double-copying a character string, to improve editing efficiency by inheriting a modification method of a character string to be replaced in a document and replacing it with a replacement character string. For the purpose of this, the character string length L1 of the mIIA character string and the character string length of the replacement character string! , 2, and Ll <l
, when t, the same character as the last character of the string to be replaced is inserted at the end, making it =L2, and when Ll > l, , it is deleted from the back of the string to be replaced, making it Ll ''Lx, Ll =
Under the state of Li, the character string to be replaced is replaced with a replacement character string, and the modification method of the character string to be replaced is inherited as is to the replaced character string after replacement.

C) Industrial Application Field) The present invention relates to a character string replacement method for replacing character strings.

[Prior art and problems to be solved by the invention] When creating a document using a word processor or the like, it has become possible to modify characters in various ways (full-width, half-width, superscript, subscript, font, etc.). Conventionally, when performing batch replacement of arbitrary character strings in a created document, the character string to be replaced has been specified and replaced with a new replacement character string. For this reason, there is a problem in that the decoration of the document after replacement may be corrupted, and it becomes necessary to re-edit the method of decoration of the document. In particular, if the number of characters in the character string to be replaced is different from the number of characters in the replacement character string, there is a problem in that the modification method becomes corrupted and re-editing is required.

An object of the present invention is to improve editing efficiency by inheriting a modification method of a character string to be replaced in a document and replacing it with a replacement character string.

[Means to solve problems]

Means for solving the problem will be explained with reference to FIG.

In FIG. 1, a character string to be replaced search unit 1 searches for a designated character string to be replaced in a document.

The character string length comparison unit 2 compares the character string length of the replaced character string searched from the document by the replaced character string search unit 1 with the character string length L2 of the designated replacement character string. It is.

When the character string length comparison unit 2 determines that Ll<Ll, the character insertion/deletion unit 3 copies and inserts the same character as the last character of the character string to be replaced backwards to create ■, 1-L2, and L , >L□, the character string to be replaced is deleted from the end to make L1=L2.

Under the condition of L1=L2, the character string replacement unit 4 replaces the character string to be replaced with a replacement character string, and also performs the replacement so that the modification method of the character string to be replaced is inherited as it is to the replaced character string after replacement. It is something.

[Effect]

As shown in FIG.
searches for and finds the specified string to be replaced in the document, and the string length comparison unit 2 calculates the string length L of the string to be replaced found in the document by the string to be replaced search unit 1.
1 and the character string length of the specified replacement character string, and when the character insertion/deletion unit 3 determines that <L by the character string length comparison unit 2, the last character of the replacement character string Copy and insert the same character backwards to make Ll −Lt, and when it is determined that t,+ >l, delete it from the end of the string to be replaced and make it Ll”Lx, and the string replacement part 4 reads L+ =Lt, the character string to be replaced is replaced with a one-change character string, and the replacement is performed so that the modification method of the character string to be replaced is inherited as it is to the replaced character string.

Therefore, after making the string lengths of the string to be replaced and the string to be replaced in the document equal, the modification method of the string to be replaced can be modified by inheriting the modification method of the string to be replaced and replacing it with the replacement string. It is possible to change the text as it is and replace it with a replacement character string, and then edit after the replacement, improving editing efficiency.

〔Example〕

Next, the configuration and operation of one embodiment of the present invention will be explained in detail using FIGS. 1 to 6.

In FIG. 1, ■ inputs a character string to be replaced.

■ Enter the replacement string. This means specifying a replacement string to replace the replaced string specified by ■.

■ searches for the character string to be replaced. This means that the document is searched to find the replaced character string (■).

(2) determines whether a character string to be replaced is found by the search (2). In the case of YES, execute the following steps.

If NO, the character string to be replaced was not found in the document, so the process ends (END).

■, ■ is the string length of the replaced string found in ■,
and the character string length 1-t of the replacement character string.

L, <1. ! When , use ■ to copy and insert the same character as the last character of the string to be replaced, and create
). Then, execute ■.

When Ll > I, , . . . means that the last part of the character string to be replaced is deleted to make it the same length (Ll = Lg). Then, execute ■.

■ overwrites the replacement string on the string to be replaced. By the copying/insertion processing in ■ and the deletion processing in ■, the string length L1 of the replaced string and the string length L2 of the replaced string are determined.
This means to overwrite the replaced character string with the replaced character string and to replace the replaced character string in such a manner that the modification information of the replaced character string is inherited as is.

As described above, if the character string length L1 of the replaced character string is different from the character string length L2 of the replaced character string, copy/insert/delete the replaced character string to make them equal, and then use the replaced character string. By overwriting the to-be-replaced character string, the modification method of the to-be-replaced character string can be inherited as is, and the efficiency of the character string replacement process can be improved.

Next, specific examples of the present invention will be sequentially explained using FIGS. 2 to 5.

The replacement process when the character string length L+ of the character string to be replaced and the character string length L2 of the replacement character string are equal will be explained using FIG.

In FIG. 2, the expanded data format (]) represents the format of characters in the document. Characters are composed of a modification part (modification information such as full-width, half-width, superscript, subscript, font, color, etc.) and a character part (character code such as alphanumeric characters).

Replaced character string (2): “A” is a character to be replaced in the document.

The replacement character string +31:a'' is a character to be replaced.

The data development area (4) is an area in which character string data extracted from the document is developed. Here, one character is composed of two rectangular "mouths" consisting of a modification part and a character part. Modifiers include full-width, half-width, superscript, subscript,
Stores decoration information such as font and color. The character code is stored in the character part. In this embodiment, only the character part is replaced, and the modification part inherits the modification method of the character string to be replaced after the replacement.

In the replacement result (5), only the character part "A" of the character string to be replaced (2) developed in the data expansion area (4) is overwritten with the character "a" of the replaced character string (3). Therefore, as shown in the figure, from the beginning of the character string to be replaced in the data expansion area (4), the full-width "A", the superscript '1'', and the subscript are the full-width "
a, superscript "1", and subscript respectively.

The replacement process when the character string length L+ of the character string to be replaced is longer than the character string length Lx of the replacement character string will be explained using FIG.

In Figure 3, the 1jlA character string (2) is “AB”
It is.

The replacement character string (3) is “a”.

The data development area (4) shows data extracted from the document and developed.

The data development area (4-1) shows data after deleting "B" after the replaced character string "AB" in the document developed in the data development area (4). This is the string to be replaced (2
The character string length of ``A8'' is 2, and the character string length of the replaced character string (3jia'' is L2-1.
Delete the character “B” after “B” and make the length of both strings L
+ = I-t = 1.

The replacement result (5) is the state of the data development area (4-1),
The character string to be replaced “A” is overwritten by the In character string “a”.

Through the above processing, the replaced character string "AB" in the document is replaced with the replaced character string "a", and the replaced character string "A" is replaced with the replaced character string "A".
The modification part of " is inherited by the modification part of the replacement character string "a.

The case where the character string length 1.1 of the character string to be replaced is shorter than the character string length L2 of the replacement character string will be explained using FIG.

In FIG. 4, the character string to be replaced (2) is "A".

The replacement character string (3) is ab'.

The data development area (4) shows data extracted from the document and developed.

The data development area (4-1) shows the data after copying and inserting "A" after the replaced character string "A" in the document developed in the data development area (4). Replaced character string (2) Character string length of “A” L+=1. Replaced character string (3
b” differs in character string length L2-2, so the replaced character string (
2) One character "A" is copied and inserted after "A" so that the length of both character strings is L+-Lz=2.

The replacement result (5) is the state of the data development area (4-1),
The replaced character string "AA" is overwritten by the replaced character string "ab".

Through the above processing, the replaced character string "A" in the document is replaced with the replaced character string "ab", and the replaced character string "A" is replaced with the replaced character string "ab".
The modification part of ' is inherited by the modification part of the replacement character strings "a and 1b".

Figure 5 shows the replacement character string “AAA” replaced by the replacement character string
An example of substituting -bracket to "a" is shown below. Here, the character string l to be replaced in the upper row is full-width "AAA", and the character string to be replaced 2 is half-width "AA".
For all of these replaced character strings 1 and 2.3, which represent the superscript "A" and replaced character string 3, the replaced character string "AAA" is specified, and the replaced character string "aaa" is ”, the replaced character string 1 is replaced with full-width “aaa”, the replaced character string 2 is replaced with half-width “aaa”, and the replaced character string 3 is replaced with superscript 1aa”.

Next, the overall operation of the present invention will be explained using FIG.

In FIG. 6, ■ reads a document from an external storage device.

@ displays the document on the display.

(2) interacts with the user and instructs the -bracket rIL conversion.

(2) performs -batch replacement processing (the processing of (2) without (2) in Figure 1 is performed).

■ displays the processing result of [phase].

[Phase] stores the document in an external storage device.

(Effects of the Invention) As explained above, according to the present invention, after making the character string length of the replaced character string in a document equal to the character string length L2 of the replaced character string, the replaced character string is modified. Since we have adopted a structure that inherits the method and replaces with the replacement string, it is possible to replace the replaced string with the replacement string without changing the modification method of the replaced string, eliminate post-replacement editing, and improve replacement editing efficiency. .

[Brief explanation of the drawing]

FIG. 1 is an explanatory diagram of the configuration and operation of one embodiment of the present invention, FIGS. 2 to 5 are diagrams explanatory of the operation of the present invention, and FIG. 6 is a detailed explanatory flowchart of the present invention. In the figure, l is a replaced character string search part, 2 is a character string length comparison part,
3 represents a character insertion/deletion section, and 4 represents a character string replacement section. Data expansion format (1) % expression % (2): (3):

Claims (1)

[Claims] In a string replacement method that replaces a character string, the character string length L_1 of the replaced character string and the replacement Compare the character string length L_2 of the character strings, and when L_1<L_2, insert the same character as the last character of the replaced character string backwards, making L_1=L_2, and L_1>L_
2, delete from the end of the replaced character string and make L_1=L_
2, and is characterized in that, under the condition L_1=L_2, the character string to be replaced is replaced with the replacement character string, and the modification method of the character string to be replaced is inherited as is to the replaced character string after replacement. String replacement method.