JPH113073A - Character pattern control system - Google Patents

Abstract

PROBLEM TO BE SOLVED: To enable to realize a control system of character patterns by outline data by providing an index table for retrieving outline data in which an outline memory is stored. SOLUTION: A character control table 120 is retrieved by a control code 1 in a text data 110 from a host device, and it is decided whether a character attribute table 130 and a first bit map memory index table 140 are retrieved to use a bit map font by information in its entry or an outline memory retrieving table 180 is retrieved to use an outline font. Thus, use of an outline font is decided. and the outline memory retrieving table 180 is pointed. Entry of the outline memory retrieving table 180 is retrieved by a control code 2 in the text data 110 and a character code, and an address for retrieving entry of an outline memory 190 is obtained.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a method for managing a character pattern in a display device or a printing device having a character pattern generating mechanism, and more particularly to a method for efficiently registering character data in which bitmap data and outline data are mixed.
The present invention relates to a character pattern management method suitable for searching.

[0002]

2. Description of the Related Art As a conventional character pattern generation mechanism, there is a management method focusing only on bitmap data. The prior art will be described below with reference to FIG.

In FIG. 3, (310) is text data to be searched, (340) is a first search table set for each character pattern set, and (350) is a second search used when the character code is 2 bytes. Table, (360) is the third search table for sequential search, (370) is the second search table
This is a character pattern searched using the search table (350).

In the first table (340), control information V indicating whether or not a valid character pattern is registered in the entry, and the search of the character code area are performed by the second search table (350). There is control information S indicating whether the data is the one (pointing to the start address of the table (350)) or the data according to the third search table (360) (pointing to the address in the table (360)). For example, when the control information V of the searched entry indicates invalid (no valid character pattern is registered and no search table is prepared), the character pattern does not exist in the apparatus. Therefore, an error is reported to a higher-level device (not shown) or a request to load a character pattern is made.

In this prior art, when a character pattern is searched, a character pattern is first selected by a control code in the text data (310). That is, one character pattern set is selected according to the size, code system, and typeface.
This points the first search table (340) for each character pattern set. This table (340)
Are as many as the number of character types existing in the device.
Has an entry.

Next, the storage address of the character pattern or the address of another search table is indicated according to the number of bytes of the character code.

For example, when the character code is one byte, the character code directly points to the storage address of the character pattern from the first search table (340).

When the character code is 2 bytes, one entry in the first search table (340) is selected by an appropriate 8 bits according to the code system in the character code. The second search table (35)
0) or the address of an entry in the third search table (360) for sequential search. It should be noted that which code area of which character type is stored in the second search table (350) or the third search table (36).
Whether to register in 0) is determined statically or dynamically depending on the use of the system.

When the second search table (350) is thus selected, an entry in the table (350) is directly obtained from the remaining 8 bits of the character code. There is a storage address of the character pattern in the entry. On the other hand, when the third search table (360) is selected, the entries are tested in order from the designated address, and the entry matching the character code to be obtained is selected to obtain the storage address of the character pattern.

[0010]

The prior art described above can be applied only to the management of character patterns by bitmap data, and can be used to enlarge / decrease several types of character sizes stored in bitmaps or their character sizes. Since reduced characters are generated, the data used depending on the character size cannot be represented as bitmap data or outline data.

According to the character pattern management system of the present invention, a character pattern management system based on outline data is added to the conventional character pattern management system based on bitmap data. The purpose is to enable proper use.

[0012]

SUMMARY OF THE INVENTION In order to achieve the above object, the present invention provides a method for managing character patterns based on bitmap data according to the prior art. Or an index table for indexing an outline memory storing outline data by adding information for determining whether to index the character pattern by the outline data or indexing the character pattern by the outline data. The present invention realizes a character pattern management method using outline data without changing the character pattern management method.

[0013]

DESCRIPTION OF THE PREFERRED EMBODIMENTS One embodiment of the present invention will be described below with reference to the drawings.

FIG. 1 is a diagram showing a character pattern search method according to an embodiment of the present invention. In the present embodiment, a case will be described in which text data composed of a character code sent from a higher-order device and a control code for displaying or printing a character pattern is searched for a desired character pattern.

Text data sent from the host device
The character management table (120) is indexed by the control code 1 (e.g., code system such as EBCDIC, shift JIS, etc., and the designation of the font number) in (110), and the character management table (120) is indexed by the information in the entry (that is, the text data ( 11
(0) by specifying control code 1), a character attribute table (130) for using a bitmap font,
Determine whether to index the first bitmap memory index table (140) or the outline memory index table (180) to use the outline font.

Here, an indexing method when a bitmap font is used will be described. When the use of the bitmap font is determined, the start address of the character attribute table (130) indexed from the character management table (120) and the specification of the control code 2 (for example, character size) in the text data (110) are specified. And character attribute table (130)
And finds the character attribute applied to the character code following the text data (110).

Next, a first bitmap memory index table (140) indexed from the character management table (120).
Of the first bitmap memory look-up table (140) is obtained from the start address of the first bitmap memory index table (140) and a part of the character code in the text data (110) (for example, the upper one byte part in the case of a 2-byte character code) Can be The entry points to the start address of the second bitmap memory look-up table (150) or the address of the entry in the third bitmap memory look-up table (160).

Second Bitmap Memory Lookup Table
(150) is a corresponding entry of the first bitmap memory index table (140) indexed from a part of the character code (for example, the upper one byte part in the case of a two-byte character code) in the text data (110). Has entries for all character codes represented by the remaining part of the character code in the text data (110) (for example, the lower one byte part in the case of a 2-byte character code)
That is, the first bitmap memory look-up table (14
0) and the start address of the second bitmap memory index table (150), and the text data (11).
The entry can be directly indexed from the remaining part of the character code in (0) (for example, the lower one byte part in the case of a two-byte character code).

On the other hand, the third bitmap memory index table (160) stores the text data (1) for the character code that cannot be stored as the directly accessible second bitmap memory index table (150).
10 is a table for sequentially searching the corresponding entry by the control code and the character code specified in 10).

From the entry in the second bitmap memory look-up table (150) or the third bitmap memory look-up table (160), a bitmap memory storing character bitmap data is stored.
The corresponding entry of (170) is pointed,
It is possible to index a desired character pattern.

If the control code and the character code specified in the text data (110) are single-byte characters, the first bitmap memory index table (140) indexed from the character management table (120) A desired character pattern is indexed by directly pointing to the corresponding entry of the bitmap memory (170) from the address and the character code in the text data (110).

Next, an indexing method when an outline font is used will be described.

Control code 1 in text data (110)
, The use of the outline font is determined, and the outline memory index table (180) is pointed. Outline memory index table based on control code 2 and character code in text data (110)
The corresponding entry of (180) is indexed, and information necessary for developing the outline font and the outline memory (1) are read.
90) the address for the entry index can be obtained.

Here, the outline memory index table
As shown in FIG. 2, (180) validates only a range of values obtained by subtracting a certain value according to the valid character code range of the character code system used. In this embodiment, since the valid character code range is 0xA0A0 to 0xFFFF,
A value obtained by subtracting 0xA0A0 from all character codes is regarded as an effective range, and an index table is configured.

[0025]

As described above, according to the present invention, the character pattern selection information used in the conventional character pattern management method based on bitmap data is indexed based on the bitmap data. By adding information for determining whether a character pattern is indexed by outline data and providing an index table for indexing an outline memory storing outline data, a character pattern management method using bitmap data of the related art can be implemented. It is possible to realize a character pattern management method based on outline data without any change.

[Brief description of the drawings]

FIG. 1 shows an embodiment of a character pattern search method according to the present invention.

FIG. 2 shows an effective range of a character code according to the present invention.

FIG. 3 shows an embodiment of a character pattern search method according to the prior art.

[Explanation of symbols]

110: text data, 120: character management table, 130: character attribute table, 140: first bitmap memory index table, 150: second bitmap memory index table, 160: third bitmap memory index table 170 ... bitmap memory, 18
0 ... outline memory index table, 190 ... outline memory, 310 ... text data, 340 ... first
Bitmap memory index table, 350... Second bitmap memory index table, 360... Third bitmap memory index table, 370.

Claims (3)

[Claims] In a character pattern generating mechanism having a bitmap memory for storing character bitmap data and an outline memory for storing outline data, a character code consisting of a plurality of bytes is adapted to a characteristic of a character code system. A first bitmap memory index table having an entry corresponding to the character code, a second bitmap memory index table having an entry corresponding to the number of character patterns, and an entry corresponding to the character code Control information indicating whether or not valid character data is registered in the entry, and control indicating whether the search of the character code area is based on the first bitmap memory index table or the second bitmap memory index table. An upper table having information and an entry corresponding to the character attribute, A management table for indexing an outline memory index table having an entry corresponding to a code obtained by adding or subtracting a predetermined value to or from the upper table or character code according to the character code system characteristic according to the character attribute; and a character size of bitmap data. And a character attribute table indexed from the management table. When searching for the character pattern from the character pattern selection information and the character code, the character pattern selection information determines the character pattern from the management table. The outline memory index table is indexed to determine the storage address of the character pattern in the outline memory, or the character attribute table and the upper table are indexed to determine the first address.
A storage address of the character pattern in the bit map memory is obtained from the bit map memory index table or the second bit map memory index table. 2. The character pattern management method according to claim 1, wherein the outline memory index table is indexed by the character pattern selection information regardless of the contents of the management table, and the storage address of the character pattern in the outline memory. A character pattern management method characterized by finding 3. The character pattern management method according to claim 1, wherein the character attribute table and the upper-level table are indexed based on the character pattern selection information regardless of the contents of the management table. A character pattern management method, wherein a storage address of a character pattern in the bit map memory is obtained from a memory index table or the second bit map memory index table.