JPS6073732A - External character retrieving system - Google Patents

Abstract

PURPOSE:To shorten the time required for retrieving an external character, by storing an obtained external character code and a corresponding internal display code in an external character code buffer and, from the next time, performing the external character retrieval by referring to the external character code and corresponding internal display code buffer. CONSTITUTION:When an external character code buffer 12 is retrieved and it becomes clear that a desired ''Kanji'' (Chinese character) code is not contained in the buffer 12, an external character code table 11 is retrieved. A ''Kanji'' code obtained by this table retrieval is contained in the buffer 12. Moreover, an internal display code obtained at the table 11 is contained in an internal display code buffer 13. Once the data are contained in the buffers 12 and 13, the buffer 12 is retrieved whenever the same ''Kanji'' code is given thereafter. By this retrieval it becomes clear that the desired external character is contained in the buffer 12 and its corresponding internal display code is obtained from the corresponding buffer 13.

Description

DETAILED DESCRIPTION OF THE INVENTION [Technical Field of the Invention] The present invention relates to a non-standard character search method particularly suitable for use in a kanji data entry device.

[Technical background of the invention and its problems]

There are two types of kanji characters handled by the kanji data entry device: internal characters that are standard, and external characters that users use by registering their own codes and character font data.

The internal code has a fixed sequential value of 9, but the external character code takes a random value. These character font data for external characters must be stored sequentially, and in order to display them, corresponding sequential internal display codes (tr+) are required. Therefore, in order to display the above-mentioned non-standard characters, a non-standard character code table is required to convert the kanji code into an internal display code.

By the way, conventionally, every time a Kanji code for a non-standard character was obtained, the entire non-standard character code table was searched. Therefore, when the capacity of the external character code table becomes large, it takes time to search.

It has the disadvantage that it takes a lot of time to display the image.

[Purpose of the invention]

The present invention has been made in view of the above-mentioned drawbacks, and provides a custom character code buffer and an internal display code buffer configured with a relatively small HiA memory, thereby reducing the time required for a custom character search. The purpose is to provide a search method.

[Summary of the invention]

In the present invention, a partial copy of this table is stored before the external character code table that this type of device normally has, and a code buffer is added which is a correspondence table between external character codes and internal display codes.

This code buffer consists of a relatively small capacity high speed memory. When this device receives a custom character code from the outside, it searches the above-mentioned code buffer, and when it is confirmed that the required custom character code does not exist, it refers to the above-mentioned custom character code table and displays the obtained custom character code and its corresponding internal display. Codes are stored in their respective buffers, and from the first time onwards, the external character search is performed by referring to this external character code buffer and internal display code buffer.

By adopting this method, the time required to search for external characters is shortened, and therefore the time required to display the characters is also shortened, making it possible to improve performance.

[Embodiments of the invention]

The present invention will be explained in detail below using one drawing. Figure 1 shows the operational steps leading to the display of external characters.

It is a diagram showing the entire concept. In the figure, KC is a Kanji code for an external character, DC is an internal display code converted based on this Kanji code, and CP is character font data corresponding to this internal display code.

The desired kanji is displayed through these stages 7'' of ■, ■, and ■.

FIGS. 2 and 3 are diagrams showing an embodiment of a non-standard character search method according to the present invention.

In the figure, 11 is a memory (hereinafter referred to as a private character code table J1 for convenience of explanation) in which a private character code table that is a correspondence table between private character codes and internal display codes is stored.

This external character code table contains all the Kanji codes for external characters, and the internal display codes corresponding to each one are stored in a table format. 12 and 13 are an external character code buffer and an internal display code buffer, respectively, which are added according to the present invention. A partial copy of the external character code table 11 is transferred to the buffers 12 and 13, and is realized using a small-capacity fast memory. J4 is a register that holds the Kanji code (external character) to be converted.

The operation of one embodiment of the present invention will be described in detail below.

The embodiment shown in FIG. 2 shows the operation when a given Kanji code (external character) is not stored in the external character code buffer 12. In this case, the private character code buffer 12 is first searched. When it is determined that the desired kanji code is not stored in the external character code buffer 12, the external character code table llf is searched.

The kanji code □ obtained by this table search is stored in the external character code buffer J2. Nu.

The internal display code obtained from the external character code table 11 is also stored in the internal display code buffer 13 in correspondence with the above-mentioned Kanji code.

Once the data is stored in the code buffers 12 and 13, the subsequent operation is as shown in Figure 3. Every time the same kanji code is given, the external character code buffer J2 is searched. As a result, it can be seen that the desired external character is stored in this external character code buffer 12.

An internal display code is obtained from the corresponding internal display code buffer 13. Since the private character code buffer 12 is constructed of a memory with a much smaller capacity than the private character code table IJ, the search can be performed faster.

When the external character code table 12 becomes full (FULL) and cannot be stored, the codes are cleared in order starting from the first code stored. Gaiji (the oldest ones are discarded first) are rarely used in different types by the same user, and are often limited to a few types depending on the user. For this reason, the same external character is often used many times, and in most cases, the search method shown in FIG. 3 is implemented.

〔Effect of the invention〕

As described above, according to the present invention, by providing a small-capacity code buffer, the time required to search for external characters can be shortened. This means that the time required for display is reduced, leading to improved performance. father,
This buffer only requires /J%6, so the load on the memory is small.

[Brief explanation of the drawing]

FIG. 1 is a diagram conceptually showing the operational steps leading to the display of non-standard characters, and FIG. 2 and FIG. 3 are diagrams showing an embodiment of the non-standard character search method according to the present invention. 11... External character code table, 12... External character code buffer, 13... Internal display code buffer. J4...Gaiji codeless star. Single agent Patent attorney Takehiko Suzue Figure 1 ■ Figure 2 Figure 3

Claims (1)

[Claims] It consists of a memory that stores a custom character code table that converts custom character codes into internal display codes, a relatively small capacity memory, and a custom character code buffer that stores custom character codes, and a private character code buffer that stores custom character codes. It has an internal display code buffer in which the corresponding internal display code is stored, and searches the above-mentioned external character code buffer according to the external character code given from the outside, and confirms that the required external character code does not exist. Search the above-mentioned external character code table, store the external character code obtained by 1% and the corresponding internal display code in the external character code pannoia and internal display code buffer, and refer to this external character code buffer and the corresponding internal display code buffer from the first time onwards. A non-standard character search method characterized by performing a non-standard character search by