JPH06324931A - Resource data retrieval method - Google Patents

Abstract

(57) [Summary] [Object] To provide a resource data search method capable of allocating data without occupying a continuous memory space and quickly searching for target data. [Structure] A memory (4, 7) configured to have a resource structure including a data part and a map part / header part, which holds information about a user interface and stores resource data which can be stored in a predetermined address space, and a memory. (4,7)
In the electronic device equipped with the search device (1,2,5,6,8,9,10) that can separately search for each part of the resource data stored in the search device (1,2,5,6,8 , 9, 10) separating the character string part and the bitmap data part from the data part, and the search device for searching the data part for which the character string part and the bitmap data part are separated (1, (2,5,6,8,9,10)
And a step of searching by.

Description

Detailed Description of the Invention

[0001]

[Industrial application field] Relating to resource data search method,
More specifically, the present invention relates to a resource data search method in electronic devices such as computers and word processors.

[0002]

2. Description of the Related Art A conventional resource data structure in a word processor is shown in FIGS. Figure 8 shows sheet I
FIG. 9 is a diagram showing an OCB, FIG. 9 is a diagram showing a window-specified IOCB, FIG. 10 is a diagram illustrating control resource storage,
FIG. 11 is a diagram illustrating message resource storage, and FIG.
Is a diagram illustrating character resource storage, and FIG. 13 is a diagram illustrating bitmap resource storage. Further, in each figure, a to d indicate the relationship of the number of repetitions, and the parentheses indicate bytes.

As shown in FIGS. 8 to 13, the data in the word processor does not clearly separate the map part and the data part. For this reason, maintenance is difficult and it takes a considerable amount of time to search.

FIG. 14 shows a conventional resource data structure in a general-purpose computer. In FIG. 14, A and B indicate the relationship of the number of repetitions, and the numbers in parentheses indicate the number of bytes.

As shown in FIG. 14, in a general-purpose computer, a structure in which a map portion and a data portion are separated has been proposed, but since it is integrated as an entity, it can be stored in an arbitrary address space designated by the computer. It was not possible to store these parts separately.

[0006]

Data information for a user interface in an information device such as a word processor or a computer is becoming complicated and huge.
In addition, it is necessary to access these data frequently and modify them frequently according to the user and system expansion.

Therefore, with the current resource structure, it becomes very difficult to add / correct data in accordance with various system-up applications. Also, when searching for the target resource data, the larger the size of the data, the more the search speed becomes a problem.

Further, although the data for the user interface is increased, a ROM such as a word processor is used.
It is difficult for a base machine or a small computer to continuously secure a large memory space, and it is desirable that the parts can be freely arranged as small as possible. In particular, when it is installed in an existing device, the memory allocation by the existing application is often fixed, and such new data can be allocated only in a small empty area.

An object of the present invention is to provide a resource data search method that can arrange data without occupying a continuous memory space and can quickly search the target data.

[0010]

A memory configured to have a resource structure including a data section and a map section / header section, which holds information about a user interface and stores resource data which can be stored in a predetermined address space, In an electronic device equipped with a search device capable of separately searching for each part of resource data stored in a memory,
A step of separating the character string part and the bitmap data part from the data part by the search device, and a step of searching the data to be searched by the search device for the data part in which the character string part and the bitmap data part are separated. It is characterized by including.

[0011]

Since the character string part and the bit map data part are separated from the data part by the search device, and the data to be searched for the data part in which the character string part and the bitmap data part are separated is searched by the search device, The data can be retrieved at a high speed, and flexibility can be provided between different systems and at the time of system level upgrade, and the introduction into an existing system can be facilitated.

[0012]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS The management resource data of the user interface section of a word processor will be described as an example.

FIG. 2 is a diagram showing the equipment configuration used to carry out an embodiment of the method of the present invention.

In FIG. 2, CPU1 is KeyCPU2.
Receives input information from the input device sent from
The program in the program memory 6 is executed. KeyC
The PU 2 controls the pointing devices 8 and 9 as an input device and the keyboard 10, and interrupts the CPU 1.

The program memory 6 has a memory (ROM).
7, memory (RAM) 4, cut buffer (RAM) 5
, And output through the VRAM 3, and the CPU 1 sequentially performs these accesses.

The resource data created here is shown in FIG.
Are arranged in the memory 4 and the memory 7 together with other control data.

FIG. 3 is a diagram showing an example of a memory map including resource data.

The resource data according to the embodiment of the method of the present invention is modularized and structured so that it can be easily mixed with other data, and has the following configuration.

1) Modularization It is divided into a header part, a data part, a map part, a character string part and a bit map part.

2) Structuring Each data is provided with a type representing the format of the data and an ID that is a unique identification number for each data type, and is structured and managed in two layers. 4 to 7 are diagrams showing examples of the configuration of such resource data. 4 is a diagram for explaining the resource header part, FIG. 5 (a) is a diagram for explaining the resource data part, FIG. 5 (b) is a diagram for explaining the resource map part, and FIG.
FIG. 7 is a diagram illustrating a character string portion, and FIG. 7 is a diagram illustrating a bitmap portion. 4 to 7, A and B show the relationship of the number of repetitions, and the numbers in parentheses show the number of bytes.

The resource data comprises a resource data part, a character string part, a bit map part, a resource map part for managing the bit map part and the resource data part, and a resource header part. The resource header section stores the start address of each part for indicating where each part of the resource is arranged in the memory.

Resource search unit (resource manager)
Then, these resources are managed based on the information in the header part. FIG. 1 is a flowchart showing a processing procedure of an embodiment of a resource data search method. The processing procedure of the resource data search by the resource manager will be described based on FIG.

First, it is confirmed whether the resource type is a character string or a bit map by using the resource type and ID provided from the user program as a key (1-
1). If the resource type is not a character string or bitmap (1-2), the start address of the map portion is read from the header portion (1-3).

The type list is searched from the "offset for the type list" in the map section, and the type list is searched until there is a type to be searched (1-4). If there is no type of search target, it means that there is no target data and an error occurs (1-5, 1-6). If the type of the search target is found, the "offset to the reference list" is referenced from the type list, and the reference list is searched until the search target ID is found (1-5, 1-7). If there is no ID to be searched, it means that there is no target data and an error occurs (1-8, 1-9). If there is a search target ID, the "offset for resource data" is read (1
-8, 1-10).

Next, the head address of the data part is read from the header part, and the stored data to be searched is indexed from the address to which the "offset value" read in step 1-10 is added (1-11). .

When the resource type is a character string or a bit map (1-2), if the type is a character string part or a bit map part, the storage address of the data is read out from the header part and jumped (1-12). Then, the offset value stored in the address obtained by adding the ID to the storage address is read, and the search target data stored is indexed from the address obtained by adding the offset value to the start address of the character string portion / bitmap portion (1-13). ), (See FIGS. 6 and 7).

[0027]

The character string part and the bitmap data part are separated from the data part by the search device, and the data to be searched for the data part in which the character string part and the bitmap data part are separated is searched by the search device. Therefore, data can be retrieved at high speed, and flexibility can be provided between different systems and at the time of upgrading the system, and introduction into an existing system can be facilitated.

[Brief description of drawings]

FIG. 1 is a flowchart showing a processing procedure of an embodiment of a resource data search method of the present invention.

FIG. 2 is a diagram of the equipment configuration used to perform an embodiment of the method of the present invention.

FIG. 3 is a diagram showing an example of a memory map including resource data.

FIG. 4 is a diagram illustrating a resource header part.

FIG. 5 is a diagram illustrating a resource data section and a resource map section.

FIG. 6 is a diagram illustrating a character string portion.

FIG. 7 is a diagram illustrating a bitmap unit.

FIG. 8 is a diagram showing a sheet IOCB.

FIG. 9 is a diagram showing a window-specified IOCB.

FIG. 10 is a diagram illustrating storage of control resources.

FIG. 11 is a diagram illustrating message resource storage.

FIG. 12 is a diagram illustrating character resource storage.

FIG. 13 is a diagram illustrating storage of bitmap resources.

FIG. 14 is a diagram showing a conventional resource data structure in a general-purpose computer.

[Explanation of symbols]

 1 CPU 2 KeyCPU 3 VRAM 4 Memory (RAM) 5 Cut buffer (RAM) 6 Program memory (ROM) 7 Memory (ROM) 8, 9 Pointing device 10 Keyboard

Claims (1)

[Claims] 1. A memory configured to have a resource structure including a data part and a map part / header part, which stores information about a user interface and stores resource data which can be stored in a predetermined address space, and the memory. In an electronic device equipped with a search device capable of separately searching for each part of the generated resource data, a step of separating the character string part and the bitmap data part from the data part by the search device, the character string part and the bitmap data. Searching the data to be searched for the data part separated from the part by the searching device.