JPS6112125A - Optimizing system of shift code - Google Patents

Abstract

PURPOSE:To optimize efficiently a shift code by extracting a transition code from a shift code transition table decided by a preceding and present entry numbers and using the code so as to retrieve an optimized code table. CONSTITUTION:An input data from an input data storage medium 1 is inputted to a host computer 2. The computer 2 converts output mode information of the user designation into internal shift code information comprising a shift code identifier and an entry number based on the user application program 3, and an optimized processing section 4 extracts the corresponding transition code among a shift code transition code table storing the transition code by using the converted information based on the preceding and present shift code information. The corresponding optimized code is extracted from the table storing the optimized code is extracted by using the transition code and it is stored in a spool data set 5. A data is printed from the data set 5 by using a Japanese word line printer 6 or an office printing unit 7.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a shift code optimization method for compressing a shift code string that determines the output form of characters.

[Prior art and problems]

The number of character output formats supported by Japanese line printer devices, Japanese display devices, etc. is increasing. The output form of these characters is controlled by shift codes. FIG. 10 is a diagram showing the relationship between character output format and shift code. For example, the shift code for a 9-point full-width character is 30C7300130E1, and the shift code for a 9-point half-width character is 30C730E 130G O.
The shift code for full double-width characters is 30C130E 13
0C6, and the shift code for a 9-point half-width character is 30.
E 130C030C6. FIG. 11 explains full-width, half-width, full-width, and half-double-width characters. If a full-width character is represented by an m×n dot pattern, a half-width character is represented by an m×n/2 dot pattern,
Full double-width characters are expressed in a 2m x 2n dot pattern,
Half-width characters are represented by a 2 m x n dot pattern. FIG. 12 is a diagram showing an example of a print line, and characters of various output formats can exist in the - line.

When there are characters with different output formats in one line of print data, in order to reduce the memory usage efficiency on the hardware and the amount of transferred data, shift code optimization is performed when the same series of shift codes continues. It must be made.

[Purpose of the invention]

The present invention meets the above requirements and aims to provide an efficient optimization method for shift codes.

[Means to achieve a goal]

Therefore, the shift code optimization method of the present invention converts user-specified output format information into internal shift code information consisting of a shift code identifier and an entry number,
Based on the entry number of the previous internal shift code information and the entry number of the current internal shift code information, a corresponding one is selected from the shift code transition table that stores multiple transition codes determined by the previous entry number and the current entry number. The system is characterized in that it extracts a transition code corresponding to the transition code V, and, based on this transition code, extracts a corresponding optimization code from an optimization code table storing a plurality of optimization codes corresponding to the transition code V. .

[Embodiments of the invention]

Embodiments of the present invention will be described below with reference to the drawings.

FIG. 1 is a diagram showing the system configuration of one embodiment of the present invention. In FIG. 1, 1 is an input data storage medium, 2 is a host computer, 3 is a user application program, 4 is an optimization processing unit, 5 is a spool dataset, 6 is a Japanese line printer, and 7 is an office printer. The device and 8 each indicate a display device. Input data stored on a medium such as a card, a magnetic disk, or a magnetic tape is input to the host computer 2, subjected to optimization processing, and output to the spool data set 5. The print data stored in the spool data set 5 is stored in the Japanese line printer device 6 or in the office.
Printed by printer device 7. The display data displayed on the display device 8 is directly output from the host computer without being stored in the spool data set 5. Optimization processing is also performed on character strings generated by user application programs.

Figures 2 and 3 are flowcharts showing the processing performed by the optimization processing section, Figure 4 is a diagram showing the configuration of the character type storage table, Figure 5 is a diagram showing the configuration of the shift code transition table, and Figure 6 is a diagram showing the configuration of the shift code transition table. FIG. 3 is a diagram showing the configuration of an optimize code table.

For example, if you want to print the characters ABC in 7-point half-double width, and then print the characters XYZ in 12-point half-double-width,
The user is (P (7), H, D, ABC), (P (12), H,
Specify the print data in the format (D, XYZ). The optimization processing unit 4 converts the user-designated output format information into internal shift code information in a predetermined format using the character type storage table shown in FIG. This internal shift code information consists of a shift code identifier and an entry number. Shift code identifier is "30C10000"
It has the shape of For example, user-specified output format information that specifies 7 double-byte characters is "30C1000000.
01''.The optimization processing unit 4 searches the shift code transition table of FIG. 5 using the entry number of the current internal shift code information and the entry number of the previous internal shift code information as keys, and calculates the transition code. obtain.

Then, search the optimize code table shown in Figure 6 using this transition code as a key, and perform the optimization code table.
Get the code.

FIGS. 2 and 3 are flowcharts showing the flow of optimization processing. Optimization processing is performed as follows.

■ Position the displacement of the out-cover sofa at the beginning.

■ Check whether the search for the user-specified code is completed. When the answer is Yes, the process ``■'' in FIG. 3 is performed, and when the answer is No, the process ``■'' is performed.

■ Check whether internal shift code information appears. Y
If es, process ``■'' is performed, and if No, process ``■'' is performed.

■ Extract the shift code identifier and entry number from the character type storage table shown in FIG. 4 and store them in the converter sofa.

■ Find the displacement of the Kaba sofa. That is, the length of the internal shift code information is added to the original displacement.

■ Extract the next code (internal shift code information or character code).

■ Store the specified character code in the Kaba Sofa.

■ Find the displacement of the Kaba sofa. That is, the length of the character code is added to the original displacement.

■ Position the displacement of the hippo sofa at the beginning.

■ Position the displacement of the Kaba sofa at the beginning.

■ Check whether input data is finished. If Yes, the process ends, and if No, perform the @ process.

@ Check whether internal shift code information has appeared or not eY
If es, process @, and if No, process ■.

■ Check whether the first code is internal shift code information. If Yes, perform the process ■, and then press N.

When , process [phase].

■ Optimize the leading shift code and store it in the cover sofa.

[Phase] Stores the entry number of the first internal shift code information.

[Phase] Find the displacement of the Kaba Sofa. That is, the displacement of the converted cover sofa is increased by the optimized shift code.

O next code (internal shift code information or character code)
from the input buffer.

[Phase] The shift code transition table shown in FIG. 5 is searched using the entry number of the previous internal shift code information and the entry number of the current internal shift code information as keys to obtain a transition code.

[Phase] Using the obtained transition code as a key, search the optimize code table shown in FIG. 6, obtain the optimize code, and store it in the converter sofa.

[Phase] The entry number of the current internal shift code information is set as the entry number of the previous internal shift code information. Next, process the [phase].

■ Store the specified character code in the Kaba Sofa.

■ Find the displacement of the Kaba sofa. That is, the displacement of the cover sofa is increased by the character code.

Next, 0 processing is performed.

FIG. 7 shows a print character string and a data string, and FIG. 8 shows a data string before optimization and a data string after optimization. When the data string shown in FIG. 7 is optimized, the data string shown in FIG. 8 is obtained.

FIG. 9 shows the process of optimizing the data string of FIG. 7. Since the output format of character string A is 9-byte full-width, the corresponding internal shift code information is “30C1000
00005", and the output format of character string B is 9 characters, half-width, so the corresponding internal shift code information is "30C10
0000006", and the output format of the character C is 12 points half double-width, so the corresponding internal shift code information is 30C.
10000000C", and the output format of the character is 1
Since it is 2 characters full-width, the corresponding internal shift code information is 3.
0G100000009''. When optimizing the internal shift code information “30C100000005”, this is the first internal shift code information, so
The entry number of the previous code is "I". Note that 30E2 is inserted unconditionally for entry numbers 1 to 4. The current entry number is 5" and the previous entry number is "1", so from the shift code transition table in Figure 5, it is "6".
is extracted, and the optimize code corresponding to transition code "6" is extracted from the optimize code table shown in FIG.
The code "30E1" is extracted. Therefore, "30E1" and "A" are stored in the output buffer.

When optimizing "30C100000006", the previous entry number is "5" and the current entry number is "6", so the transition code "14" is extracted from the Schif] code transition table in FIG. Optimize code corresponding to this transition code “14””
30CO' is retrieved from the optimize code table of FIG. Then, the output huffer is ``30C''.
O” and B” are added. Such processing is repeated until all input data is searched. Note that the output side device only needs to identify the type of character to be printed according to the shift code that appears.

〔Effect of the invention〕

As is clear from the above description, according to the present invention, shift codes can be efficiently optimized.

[Brief explanation of drawings]

FIG. 1 is a diagram showing the system configuration of an embodiment of the present invention, FIGS. 2 and 3 are diagrams explaining the optimization process, FIG. 4 is a diagram showing the configuration of a character type storage table, and FIG. 5 is a shift diagram. Figure 6 shows the structure of the code transition table, Figure 6 shows the structure of the optimize code table, Figure 7 shows the printed character string and its data string, and Figure 8 shows the data string before optimization. FIG. 9 is a diagram explaining the process of optimization processing in FIG. 7, FIG. 10 is a diagram showing the character output form and a conventional shift code string, and FIG. 11 is a diagram showing the data string after optimization. is a diagram for explaining full-width, half-width, full-width, and half-double-width characters, and FIG. 12 is a diagram showing an example of a print line. 1-Manual data storage medium, 2-.-Host computer, 3-
User application program, 4-optimization processing section, 5
-Spool dataset, 6-Japanese line printer device, 7-Office printer device, 8-Display device Patent applicant Fujitsu Ltd. Representative Patent Attorney Kyotani Yobu Sai 1 figure, 2 figures

Claims (1)

[Claims] The output format information specified by the user is converted into internal shift code information consisting of a shift code identifier and an entry number, and the previous entry is converted based on the entry number of the previous internal shift code information and the entry number of the current internal shift code information. A corresponding transition code is extracted from a shift code transition table that stores multiple transition codes determined by the number and the current entry number, and based on this transition code, multiple optimization codes corresponding to the transition code are stored. A shift code optimization method characterized by extracting a corresponding optimization code from an optimization code table.