WO2005062198A1

WO2005062198A1 - Data generation method, data processing method, data generation device, data processing device, data generation program, data processing program, recording medium containing the data generation program, and recording medium containing the data processing program

Info

Publication number: WO2005062198A1
Application number: PCT/JP2004/015039
Authority: WO
Inventors: Masashi Hirosawa
Original assignee: Sharp Kabushiki Kaisha
Priority date: 2003-12-19
Filing date: 2004-10-12
Publication date: 2005-07-07

Abstract

Among divided data obtained by dividing electronic data, such a divided data that the content is not lost when the divided data is processed solely is called partial data. The present invention relates to generation of partial data or processing of the generated partial data. When generating partial data by dividing electronic data, such a division boundary is obtained that the aforementioned appropriate processing result is obtained and the data size of the divided data does not exceed the specified maximum data size. Moreover, if such a division boundary exists that the processing result of divided data before the division boundary does not affect the processing result of the divided data after the division boundary, the division boundary is calculated with a higher priority, thereby generating division boundary data, divided data, information having divided data insufficient to obtain a fundamentally intended processing result, or information associated with the affect between the divided data processing results.

Description

Specification

Data generation method, data processing method, data generation device, data processing device, data generation program, data processing program, recording medium recording data generation program, and recording medium recording data processing program

Technical field

[0001] The present invention is directed to generation of partial data, which is data obtained by dividing electronic data into a plurality of pieces, and which does not impair the meaning of the data even when processed alone, and which is a data obtained as a processing result; It relates to processing using partial data.

[0002] Further, the present invention contemplates that when performing predetermined processing using the partial data, it is possible to perform the processing at high speed and with resource saving! V, related to processing.

[0003] More specifically, the present invention is intended to prevent the processing result of one partial data from affecting the processing result of another partial data so that the connection between the processing results of the affected partial data does not deteriorate. The present invention relates to a method, an apparatus, a program, and a computer-readable program medium for processing partial data.

[0004] Further, a method, an apparatus, and a program for generating partial data necessary for processing of partial data so as not to deteriorate the connection between the processing results of the affected partial data and data that facilitates the processing , And a computer-readable program medium.

Background art

[0005] In order to process large electronic data at high speed or in an operating environment with a small processing resource such as a memory, only a part of data necessary for immediate processing is read and written. However, the use has been performed conventionally.

[0006] However, it is easy to simply read and process some data from electronic data. If the data to be read is related to the preceding and following data, it is sufficient to read only the data to be read. Cannot process.

[0007] As data related to the data before and after, for example, compressed data or encrypted data Data. For example, in general, in moving image compression, data compression is performed by recording only difference information between frame images. That is, the data to be recorded first includes the data of the reference frame image (usually the first frame image), and thereafter, as the information of each frame image, the data capacity of the difference information from the previous frame image is used. It will be repeated for the number of remaining frame images.

[0008] Therefore, when a specific frame image is developed (reproduced), even if only the difference information from the previous frame image that is the data of the specific frame image is obtained, the meaning is not lost. Images cannot be expanded. In order to develop a frame image without impairing its meaning, processing is performed in which the first reference frame image is used as the first developed image, and the difference information of the next frame image is added to the developed image to create a new developed image. Must be repeated until a specific frame image.

[0009] On the other hand, for example, moving image compressed data in the MPEG (moving picture expert group) format divides a series of frame images before compression into a plurality of frame image groups (GOP: group of picture), Each GOP is independently compressed and recorded. That is, a reference frame image exists for each GOP. If you want to expand a specific image frame during playback, you need only expand the GOP to which the specific image frame belongs without having to expand the first image frame sequentially. As a result, a specific image frame can be quickly reproduced.

[0010] The "document data whose display layout changes depending on the display setting" is, for example, HTML (hyper text markup language) HTML displayed on a WWW (world wide web) browser.

In this case, by changing the size of the character or the width of the window displaying the display layout, the line wrapping position or the like also changes, the display layout is changed, and the appearance changes.

[0012] Japanese published patent publications disclosing such a technology include:

1. JP-A-7-95388 (published on April 7, 1995)

2.Japanese Unexamined Patent Publication No. Hei 10-283350 (published October 23, 1998)

3. JP-A-11-341434 (published December 10, 1999) There are.

[0013] However, these conventional techniques have four major problems.

[0014] As described above, the GOP of MPEG data and the like are "data obtained by dividing electronic data into a plurality of pieces and can be processed independently" (hereinafter, for the sake of explanation, electronic data is simply divided. The generated data is referred to as divided data, and the divided data that can be processed by itself may be referred to as “partial data.” The partial data may be referred to as partial data.

(1) Problems that cannot be divided well into partial data,

(2) Although the data can be divided into partial data, the processing results influence each other (the effect of the division appears in the processing results), and the connection of the processing results of each partial data becomes poor.

(3) It can be divided into partial data, but depending on the way of division, the size of the partial data may be reduced to reduce the advantages of high speed and memory saving,

(4) If the processing results do not influence each other, there is a problem that the partial data becomes large.

[0015] Regarding the problem (1), for example, HTML data is applicable. In HTML data, a hierarchical structure can be created by sandwiching a character string between a start tag and an end tag and nesting a set of start and end tags, but it is simply divided between the start and end tags Then, each divided data cannot be processed by itself without impairing the meaning of the divided data.

[0016] FIGS. 4A and 4B are diagrams for explaining this. In the fifth line, there is a start tag (“ku font size =“ + l ”>) for changing the character size. It is instructed to change the characters to the specified size up to the end tag (“ku Zfont>”). Assume that this HTML data is divided into two pieces of data, the first half of the first line up to the eighth line and the second half of the ninth to sixteenth lines.

[0017] Then, for example, when processing the divided data in the latter half, since the start tag for changing the size of the character on the fifth line is not read, the character size cannot be changed to the specified size. Would. That is, only the second half of the divided data includes an error caused by the division, and the content of the divided data alone ( Electronic data cannot be processed without losing its original intention.

Regarding the problem (2), for example, plain text data applies. Plain text data does not have a hierarchical structure such as tags, so processing partial data alone does not impair the meaning of the partial data.However, when processing results of each partial data are arranged, processing There is a problem that the connection of the result becomes poor, that is, an unintended wrong connection appears.

In order to explain these problems, first, the entire electronic data of FIG. 4A or FIG. 4B is collectively processed and displayed on a certain display means in FIG. 5A (corresponding to FIG. 4A) or FIG. This is shown in Figure 5B (corresponding to Figure 4B). Lines are wrapped according to the width of the display means.

[0020] A part of the electronic data of FIG. 4A intended for such a display state is obtained by combining the partial data of the “through” force in the ninth line with the “based” in the twelfth line and the “on” in the twelfth line. ”To the 15th line of“ J ”.

In this case, FIG. 17A shows an example in which the preceding partial data is displayed on a certain display means, and FIG. 17B shows an example in which the subsequent partial data is displayed on a certain display means.

Similarly, a part of the electronic data of FIG. 4B is partially converted from the partial data up to “glass.” In the eighth line and the “When” in the eighth line to the thirteenth line. Suppose that the data is divided into two parts up to the "information."

In this case, FIG. 17C shows an example in which the preceding partial data is displayed on some display means, and FIG. 17D shows an example in which the subsequent partial data is displayed on some display means (FIGS. 17A to 17D). Then, for the sake of later explanation, other data is displayed or the display frame is slightly shifted. In any case, there is nothing wrong with the display when viewed alone.

However, when the display layouts of FIGS. 17A and 17B are successively displayed, it can be seen that the originally intended display state is altered as shown in FIG. 19A. Further, when the display layouts of FIG. 17C and FIG. 17D are successively displayed, it can be seen that the originally intended display state changes as shown in FIG. 19B. (In Fig. 19A and Fig. 19B, other data is displayed, the display frame is slightly shifted, the part that is protruded and laid out, and the font size is adjusted for later explanation. Ignore it here). That is, in FIG. 19A and FIG. 19B, a line feed is displayed at a connection portion of the display layouts of FIG. 17A and FIG. 17B and a connection portion of the display layout of FIG. 17C and FIG. The display results are clearly different from those of 5A and FIG. 5B. That is, in FIGS. 19A and 19B, the effect of dividing and processing the electronic data appears as an erroneous line feed that was not originally intended.

[0026] Regarding the problems (3) and (4), although partial data is advantageous in that it is not necessary to process the entire electronic data, the partial data itself is not affected by division. If it gets bigger, this advantage diminishes. Also, if the partial data size is too small, processing such as file reading will be chopped, and the total processing speed will be slow (it is generally faster to read the files all together at once). Similarly, the benefits diminish as more memory is needed to manage the data.

[0027] Therefore, partial data having the optimal size is processed as much as possible, and when the processing results of the partial data affect each other or the processing result shows the effect of division, the processing result of each partial data is processed. These problems can be solved by taking a method of processing the partial data so that the connection is not broken.

Therefore, a first object of the present invention is to provide a data generation method for generating partial data necessary for performing the above processing, auxiliary data for facilitating the above processing, and a data generation method. An object is to provide a device, a data generation program, and a recording medium on which the data generation program is recorded.

[0029] Further, the second object of the present invention is to pay attention to the above-mentioned problem (2), and to perform high-speed and low-speed operation when the division of electronic data into partial data affects the processing result of the partial data. Data processing methods, data processing devices, and data processing that process partial data so that connections between the processing results of each partial data do not deteriorate while maximizing the benefits of partial data. It is to provide a program and a recording medium on which the program is recorded.

Disclosure of the invention

[0030] (1) The data generation method according to the present invention performs processing independently to solve the above-described problems. If partial data with no error in the processing result itself is generated by dividing electronic data at a certain division boundary, the data size of the partial data is judged whether it is smaller than a predetermined standard data size. A partial data size determination step, an influence determination step of determining whether or not the processing result of the generated partial data has a predetermined effect due to the division at the division boundary, and a data size equal to or smaller than the standard data size And extracting a dividing boundary where the predetermined influence does not appear as a non-standard-dependent dividing boundary.

Hereinafter, for the sake of explanation, data obtained by simply dividing electronic data at “division boundaries” will be referred to as “divided data”.

The divided data has an order, and is relatively called “previous divided data” and “next divided data”. This order is the processing order of the divided data when the processing result obtained by sequentially processing the divided data in consideration of the influence of the division matches the processing result of the entire electronic data. It often corresponds to the order of the position of the divided data in the electronic data.

[0033] Note that not all pieces of electronic data that are divided are referred to as divided data. Here, the target divided data is data that is a material that directly generates a processing result. For example, in the case of electronic data of document data, text data is the target. Therefore, other parts in the electronic data, for example, the header information part, are not materials that directly generate the processing result, but may not be subject to the divided data! /. .

[0034] "Division boundary" is a boundary that divides electronic data into two or more sets of division data. The division boundary can be expressed by a position in the electronic data.For example, when expressed in byte units, it is called before the byte, or between the bytes and the bytes, or after the bytes. It takes shape. Other unit systems that represent positions include the number of characters, the number of bits, the number of tags, and combinations thereof.

[0035] "Partial data" is data generated from electronic data using the obtained "partition boundary", and includes data of a part of the electronic data, and is included when the partial data is processed alone. This is data that has no error in the processing result itself of the electronic data portion.

There are two types of relationships between the partial data and the divided data. First, the partial data is converted into divided data selected from among the divided data generated from the electronic data using the dividing boundaries. , If equal. The selection is performed by selecting an appropriate division boundary where no error appears in the processing result of the division data itself. The second is a case where the partial data, the divided data, and the data are not equal, and auxiliary information (processing auxiliary data described later) for creating a state in which the processing result of the divided data itself has no error is combined. This is the case for split data.

The process of selecting an appropriate division boundary described above is a process in the influence determination step and the standard-independent boundary extraction step of the present invention.

[0038] The electronic data portion included in the partial data does not always constitute a continuous lump of data portion in the electronic data, and discrete data portions are included in the present invention. The data part is easier to handle. If the divided data in the partial data is not skipped, it has the same order as the divided data, and is referred to as “previous partial data” or “next partial data”.

Note that the partial data need not necessarily exist in a form independent of the electronic data (for example, in a separate file). It may be stored as a set of electronic data and information on the division boundary. When partial data is needed, it may be dynamically generated from a set of electronic data and information on a division boundary. For example, partial data can be dynamically generated by, for example, obtaining position information of a division boundary from division boundary data and reading data of a portion corresponding to the range of the partial data from electronic data. .

[0040] As a result, electronic data that does not need to be separately generated as a file or the like is used as it is! / If you can leave it! There are advantages.

[0041] Examples of the case where this advantage is viable are that, for electronic data, for example, the file is changed or added due to encryption or copyright issues, or the file is divided into divided data and filed. It may not be possible. In some cases, electronic data is recorded on a non-writable medium such as a CD-ROM. In such a case, the electronic data can be kept as it is, and a separate boundary data file or the like can be separately generated as an auxiliary file.

[0042] The definition of "there is no error in the processing result itself when processed alone" differs depending on the type of electronic data. Basically, processing results when partial data is processed independently The criterion is whether or not the result of processing the contents meant by the child data (the contents originally intended by the electronic data) is obtained.

For example, in the case of HTML data, the display result, which is the processing result, differs depending on the display settings of the WWW browser. However, if the HTML data itself has control data that specifies the display result! /, The content of the control data is reflected in the display result. One of the criterion is whether or not the display result according to the command result by the tag is generated, such as whether or not the font tag is used and the power of the specification of the character size and character color by the font tag.

[0044] More specifically, even if the display setting of the character size is changed and the total number of lines is changed, a line feed is performed at the line feed tag position! / Is null. " If only data between the start tag and the end tag of the font tag is processed, the specification of the font tag is not reflected, and in this case, it is determined that the processing result itself has an error.

In the case of plain text, a line feed is indicated by a character of a line feed code.

“Influence” here means that the processing result of the partial data changes depending on whether or not to refer to the processing result of another partial data when processing certain partial data. This tends to change when the processing result of the next partial data is added to the processing result of the previous partial data. The impact may or may not occur, depending on how the data is divided and the content of the data. Also, even with the same partial data, it may or may not occur depending on the processing method and processing settings.

[0047] As an example where the processing result is affected, when processing of arranging characters on a line using partial data of document data is performed, the previous partial data is the last character (for explanation, "text In some cases, a character (called "Character B" for the sake of explanation) that is first placed by the next partial data is added to the line of "Character A". In the case of additional arrangement, since “character B” is arranged next to “character A”, the processing result of the next partial data may change depending on the processing result of the previous partial data.

[0048] However, even if the processing result of another partial data is referred to or the next partial data is processed in succession with the previous partial data, the result may not be changed. For example, "letter A" is a new line If it were a code, "letter B" would always be placed at the beginning of the next line. In this case, regardless of the processing result of the previous partial data, the position of “Character B” does not always change. That is, in this case, the processing result of the partial data including “character B” is not affected by the division.

The processing result is affected not only by the processing results of the adjacent partial data before and after, but may also be affected by distant partial data. For example, when performing processing to generate a display layout using divided data or partial data of HTML data, this may occur when characters run around an image. When characters are laid out around an image, the layout range is limited by the image. This limitation of the layout range has an effect.

More specifically, partial data having wraparound image information is, for example, the first partial data, and the remaining partial data does not have wraparound image information. At this time, the partial data having no wraparound image information has no clue to know that the character string in the partial data is a character string to be wrapped around the wraparound image.

[0051] Therefore, if the partial data including the wraparound image information and the partial data not including the wraparound image information are separately processed and simply connected, there is still room for the wraparound image. As a result, a character string may be displayed at the head of the line. This is different from the layout intended by the original data.

[0052] In this way, an effect may occur even between distant blocks.

Further, as an example in which the processing result is affected, there is a case where the value (variable value) used internally changes depending on the processing of each partial data. For example, suppose that the value of variable C is set to 1 in the processing of the first partial data, and the value of variable C is doubled in the second and third partial data. When processing is performed in the order of the first, second, and third partial data, before the processing of the third partial data, the value of the variable C is 2, and after the processing, the force becomes 4, and the order of the third partial data Before processing the third partial data, the value of variable C is 1 and after processing it is 2.

[0054] Regardless of the influence or helplessness, the single processing result of each partial data does not always impair the meaning. However, if the processing results of each partial data are combined, the meaning of the partial data as a whole may be impaired (that is, an influence may appear). . For example, in the case of “Character A” and “Character B”, if the next partial data is processed independently, character B is the first character and is placed at the beginning of the line. When the processing result in which the character B is placed at the beginning of the line is viewed alone, the meaning of the partial data is not impaired as the processing result.

However, when viewed together with the processing result of the previous partial data including “character A”, that is, the line of the processing result of the previous partial data and the line of the processing result of the next partial data are simply When displayed side by side, the meaning of the partial data may be lost in the connection between the two partial data.

[0056] For example, if "character A" is not a line feed code, the character next to "character A", that is, "character B" is suddenly located at the beginning of the next line, and a line feed is performed. They look like they are. That is, although there is no character of the line feed code in the document data, a processing result as if there is a character of the line feed code is obtained.

[0057] Therefore, when the processing results of the partial data are combined, the effect of dividing the electronic data appears as an erroneous processing result as if there is pseudo data that does not actually exist. Therefore, the combined processing result impairs the meaning of the partial data.

In general, the processing result of the partial data in the preceding order often affects the processing result of the partial data in the subsequent order.

[0059] The "standard data size" can be obtained by a predetermined value or by having a user or the like input it. Alternatively, it may be obtained by a predetermined calculation method. Normally, the standard data size is set to the most desirable data size for partial data. This may be determined by the user based on the processing capacity of the processing device and the purpose of the processing.

An outline of the operation of the present invention is as follows. In a partial data size determination step, a data size of partial data generated by a certain division boundary is obtained, and the data size is equal to or smaller than a predetermined standard data size. Judge.

[0061] In the influence determining step, it is determined whether or not the processing result of the partial data generated by the above-described division boundary has a force that exhibits a predetermined effect specified in advance among various effects due to division at the above-mentioned division boundary. . The type of given impact is not limited to one May be. Either of the partial data size determination step and the influence determination step may be performed first.

[0062] In the within-standard non-independent boundary extraction step, if the data size is equal to or smaller than the standard data size and a division boundary where the above-mentioned predetermined influence does not appear is found using the results of both steps, the division is performed. Extract boundaries as intra-standard independent division boundaries.

[0063] By dividing the electronic data using the extracted standard-independent division boundary, partial data having a size equal to or smaller than a predetermined standard data size and having no predetermined effect on the processing result is obtained. can do.

The above-described effects derived from the acting force will be described with an example of using partial data.

A processing device that uses electronic data uses partial data. When using electronic data, the entire electronic data is read and processed. When partial data is used, only the necessary partial data is read and processed.

[0066] Since the partial data is generated such that there is no error in the processing result even when the processing is performed alone, the processing result itself is a problem! / ヽ.

[0067] However, when partial data having an influence between the processing results are used simultaneously, the processing needs to be performed in consideration of the influence. This is because the effect is taken into account only by combining the processing results obtained by processing each partial data independently! Therefore, the combined processing result is incorrect.

[0068] Thus, for a plurality of partial data that have an effect between the processing results, the plurality of partial data are processed in succession. As a result, a correct processing result can be obtained even when the processing results having an influence are used simultaneously.

[0069] As an effect derived by performing the use as described above, first, the partial data can be processed at a high speed because the amount of data to be processed is generally smaller than the processing of the entire electronic data. This has the effect of enabling resource-saving processing that does not use much resources such as memory.

[0070] However, if the data size of the partial data is large, the effects of high speed and resource saving are weakened more than processing the entire electronic data. In the present invention, since the partial data generated by the found standard-independent division boundary has a data size not exceeding the standard data size, the data size of the partial data can be reduced, and This has the effect of preventing the effects of resource savings from diminishing. Also, if the standard data size is set to the ideal data size, the data size of the partial data can be suppressed to the ideal value, and the most desirable effect of high speed and resource saving can be obtained.

It is preferable that the standard data size be determined by the user or the like in accordance with the processing capacity of the processing device and the purpose of the processing.

When it is desired to obtain only a part of the processing result of the electronic data, processing from the beginning of the electronic data to obtain a processing result of a desired part takes a long processing time or a large amount of resources. It may be. On the other hand, by using partial data, only the partial data needs to be processed as long as the desired data belongs to which partial data, so that the effect of high-speed and resource-saving processing can be obtained. Come.

[0073] In addition, by suppressing the data size of the partial data, it is possible to predict the time required for processing the partial data and the maximum value of the resources to some extent, and to guarantee the operation even on a device having limited processing capacity and resources. The effect that can be easily done comes out.

Further, when processing the affected partial data, it is necessary to perform the processing in consideration of the influence, and sometimes it is necessary to reprocess the already obtained processing result. However, as in the present invention, by selecting a division boundary that does not affect the processing result as much as possible, it is possible to increase the partial data that does not need to be processed or reprocessed in consideration of the effect. The effect that can be done comes out.

As an advantage of recording the information of the division boundary separately from the electronic data, as described above, there is an advantage that the electronic data itself does not need to be changed, but the processing is more flexible. There is also the advantage that you can do it. In other words, since the electronic data itself is not changed, the way of division can be changed simply by replacing the information of the division boundary, the amount of information change can be minimized rather than recreating all the partial data, It is easier to change the division method according to the situation.

By dividing the data within the standard data size as much as possible, the size does not exceed the standard data size The partial data of the data size increases. If the standard data size is set to an appropriate value such as the processing capacity of the processing device and the purpose of the processing, the processing time of each partial data and the required resources can be adjusted to the vicinity of the desired range. Come.

[0077] If all the data can be divided within the standard data size, for example, when it is desired to process a part of the electronic data, no matter what part is selected, that is, no matter what part data is selected, the processing result is It is possible to guarantee the time until it is obtained, and there is an advantage that the user's operation feeling is improved.

[0078] Note that electronic data that has many uses in which only a part of the processing result of the electronic data is used include, for example, moving image data such as a movie and audio data such as music. If it is assumed that the settings related to playback, such as video data and audio data (playback speed, volume, sound quality, color, contrast, filters, etc.), will be changed in parts, such settings are assumed. In the case where the data related to the partial data is included in the partial data or associated with the partial data, the division may occur between the partial data as in the case of the data of the HTML document.

As described above, the data generation method of the present invention also exerts the effects described above for electronic data such as moving image data and audio data.

(2) In order to solve the above problem, the data generation device according to the present invention generates partial data having no error in the processing result itself when processed independently by dividing electronic data at a certain division boundary. In this case, the data size of the partial data is determined by a partial data size determining means for determining whether the data size is equal to or smaller than a predetermined standard data size, and the processing result of the generated partial data includes a predetermined Influence determination means for determining whether or not the effect will occur, and a partition boundary whose data size is equal to or smaller than the standard data size and which does not exhibit the above-mentioned predetermined effect is prioritized as a standard-independent partition boundary. And a standard-independent boundary extracting means for selectively extracting.

[0080] An outline of the operation of the present invention will be described.

It is assumed that the electronic data is obtained, for example, in the form of a file from a main storage, an external storage, a device at a network destination, or the like. First, a division boundary (a candidate) is obtained from the obtained electronic data. For example, the leading power of electronic data is information such as the number of bytes, Since this is temporary information, it may be recorded on a memory or the like. The method of obtaining the division boundary candidates differs depending on the type and purpose of the electronic data, and therefore will not be described in detail here. For example, in the case of HTML data, the method is before and after a line break tag.

Next, the data size of the partial data generated by a certain division boundary is acquired by the partial data size determining means, and it is determined whether the data size is equal to or smaller than a predetermined standard data size.

[0082] The influence determining means determines whether or not the processing result of the partial data generated by the division boundary, among various effects due to the division at the division boundary, shows a predetermined effect specified in advance. to decide. The type of the predetermined influence is not limited to one, but may be plural. Either of the partial data size determining means and the influence determining means may be processed first.

[0083] In the standard-independent boundary extracting means, using the results of the above two means, if the data size is equal to or smaller than the standard data size and a division boundary which does not show the predetermined effect is found, the division boundary is determined. Is extracted as a standard-independent division boundary.

[0084] A processing example in which divided data is generated using the above-described processing, and among the generated divided data, the divided data having an appropriate data size and having no error in the processing result itself is used as a partial data. This is the same as the processing example described above. The generated partial data is recorded on a memory, for example, or recorded on a recording medium as a file.

[0085] Various effects resulting from this are as described above.

(3) In order to solve the above problems, the data processing method according to the present invention is a method in which electronic data is divided into a plurality of pieces of data, and the processing result itself when processed alone has no error, and What is claimed is: 1. A data processing method for performing a predetermined process using a certain partial data, comprising: an influence detecting step of detecting an influence partial data which has an effect of dividing the electronic data into a processing result of a desired partial data; When performing the data processing, a partial data processing step of processing the range up to the desired partial data as a continuous data when the affected partial data is detected. Features.

[0086] Further, the data processing device according to the present invention provides an electronic data processing device for solving the above-mentioned problems. A data processing device that performs predetermined processing using partial data, which is data obtained by dividing data into a plurality of pieces and processing the data independently when the processing is performed independently. An influence detecting means for detecting an influence part data which has an effect of dividing the electronic data into the processing result of the above, and when processing the desired partial data, when the influence is detected by the influence detection means, Influence partial data force: a partial data processing means for processing a range up to desired partial data as continuous data.

[0087] In the above configuration, "data obtained by dividing electronic data into a plurality of pieces" refers to data obtained by dividing electronic data into a smaller size (hereinafter, referred to as a divided size). If all of the divided data that overlaps the overlapped portion of the divided data are added together, the original electronic data will be equal.

[0088] The division size is not always constant, and may be various. In general, the division size is often determined according to the electronic data by looking at the contents of the electronic data. Hereinafter, small-sized data obtained by simply dividing electronic data is referred to as divided data as described above.

[0089] Note that the divided data is not necessarily divided into a continuous mass of data portions in the electronic data, and may be divided into discrete portions. The part is divided, and it is easier to handle.

The definition of “the processing result itself when processed alone has no error” has already been described.

[0091] "Data that does not have an error in the processing result itself when processed alone" means that data is not used except for the data, and the predetermined processing is performed only with the data, and the meaning of the data is described. Is data for which a processing result can be obtained without impairment. In the present invention, such data generated based on the divided data obtained by dividing the electronic data is referred to as “partial data” described above.

[0092] The partial data is accompanied by an order according to a predetermined process. The terms "previous partial data" and "next partial data" are relatively used. This order is used when the processing result of processing each partial data in order considering the effect of division matches the processing result of the entire electronic data. This is the processing order of minute data. It often corresponds to the order of the position of the partial data in the electronic data.

[0093] As described above, the partial data and the divided data may or may not be equal. In the case where partial data having no error in the processing result itself when only the electronic data is divided and processed alone is obtained, the partial data and the divided data are equal. On the other hand, in the case of divided data that needs to be combined with auxiliary information (processing auxiliary data to be described later) to create a state where there is no error in the processing result of the divided data, the partial data and the divided data are not equal. Absent. In this case, the divided data and auxiliary information are considered as partial data.

[0094] The auxiliary information may be data that is required in common by a plurality of pieces of divided data. If the necessary data is duplicated and distributed to each divided data, data obtained by processing alone without error can be obtained, that is, partial data. However, this would increase the data size, so that the required data may be shared by the divided data. Although it is defined that the divided data does not overlap each other, if there is a purpose such as data sharing, overlapping is allowed, and the data of the shared part and the divided data may be regarded as partial data.

[0095] The "desired partial data" obtained the processing result! /, A force that is the partial data. The desired partial data is not limited to one partial data, but may be plural.

[0096] The "influence" here means that when processing a certain partial data, the processing result of the partial data changes depending on whether or not to process the partial data as a continuous data. “Process as a series of data” means that continuous partial data is processed as a single piece of data. The effect is likely to appear when the processing result of the next partial data is added to the processing result of the previous partial data. This is because the processing result of the next partial data is added depending on whether the next partial data is processed continuously with the previous partial data or whether the next partial data is processed separately from the previous partial data. It is a force that is easy to change.

Therefore, by examining the degree of connection (continuity) between continuous partial data, it is possible to determine the presence or absence of the influence. High-speed processing by using partial data In order not to impair the merits of the dagger, the effects of the partial data are examined in advance, information on which partial data has an effect on which partial data is obtained, and the information is used in the effect detection step. U, preferably to be able to reference at runtime.

[0098] An example in which the processing result is affected is as described above.

[0099] The "predetermined process" performs some kind of output using electronic data as input data, which generally depends on the type and purpose of electronic data. For example, in the case of HTML data, the processing of analyzing the HTML data and calculating the display layout corresponds to “predetermined processing”.

[0100] To explain the outline of the operation of the present invention, first, when obtaining the processing result of desired partial data, it is determined whether or not the processing result affects the processing result of the desired partial data for each partial data. The influence detecting means detects in the influence detecting step. As a result, when the affected partial data is detected, a partial data processing step of processing the range from the affected partial data to the desired partial data as continuous data (by the partial data processing means) is executed. As a result, the desired partial data including the affected partial data is processed, so that the processing result of the desired partial data reflects the influence of the affected partial data.

[0101] If there is no influential partial data affecting the processing result of the desired partial data, the desired partial data is processed alone (by the partial data processing means), and the desired processing result is obtained. Obtainable.

[0102] Therefore, when processing desired partial data, only the partial data in the affected range can be processed, and a processing result in which the influence is reflected can be obtained. Of course, the same processing result can be obtained by processing the entire electronic data. On the other hand, it is only necessary to process the minimum necessary number of partial data.

[0103] As a result, when the processing results of the partial data influence each other without impairing the advantage of the partial data as well as speeding up the data processing and saving resources, the processing of each partial data is performed. If the partial data can be processed in such a manner that the result is not impaired, there is an effect.

[0104] Still other objects, features, and advantages of the present invention will be sufficiently enhanced by the following description. Also, the advantages of the present invention will become apparent in the following description with reference to the accompanying drawings. Brief Description of Drawings

FIG. 1 is a block diagram showing a functional configuration of a data generation device of the present invention.

FIG. 2 is a diagram illustrating a configuration example of an apparatus that specifically realizes each unit shown in FIG. 1 or FIG. 41.

FIG. 3 is a diagram showing an example of a window display for specifying a specified maximum data size and a specified standard data size.

FIG. 4A is an explanatory diagram illustrating an example of document data in HTML data format as electronic data.

FIG. 4B is an explanatory diagram illustrating another example of document data in HTML data format as electronic data.

FIG. 5A is an explanatory diagram illustrating an example in which the entire electronic data of FIG. 4A is displayed in a certain display setting of a WWW browser.

FIG. 5B is an explanatory diagram illustrating an example in which the entire electronic data of FIG. 4B is displayed in a certain display setting of a WWW browser.

[Figure 6A] An example of displaying the HTML data in Figure 4A by changing the display settings in Figure 5A to 1.5 times the size of the reference characters and the same display window size It is a figure.

[Fig. 6B] Explanation that shows the example of displaying the HTML data of Fig. 4B by changing the display setting of Fig. 5B to 1.5 times the size of the reference character and the same display window size. It is a figure.

FIG. 7A is an explanatory view schematically explaining the divided data generated in the document data of FIG. 4A.

FIG. 7B is an explanatory diagram illustrating an example of partial data obtained by dividing the HTML data in FIG. 4B.

FIG. 8 is an explanatory diagram illustrating an example of processing auxiliary data indicating whether or not it is affected by previous divided data.

FIG. 9 is an explanatory diagram illustrating an example of processing auxiliary data representing the earliest divided data affected.

[Figure 10] Electronic data, division boundary data, division data, processing auxiliary data, dependency data FIG. 3 is a schematic perspective view showing an example of the appearance of a data processing device using a data processing device or the like.

FIG. 11 is a flowchart illustrating an example of processing for generating and displaying a display layout of partial data.

FIG. 12 is a flowchart illustrating an example of a processing method for acquiring a display layout of the current divided data in consideration of the influence of other divided data.

FIG. 13 is an explanatory diagram illustrating a state in which a display layout for one page from the beginning of document data has been obtained on the display unit / tablet in FIG. 10;

FIG. 14 is an explanatory diagram illustrating a state in which a display layout of a display range for one page has been obtained below the state of FIG. 13;

FIG. 15 is an explanatory diagram illustrating a state in which a display layout of a display range for one page is obtained from the top of the divided data to the bottom.

[16] FIG. 16 is an explanatory diagram illustrating a state where the line is scrolled upward by one line from the state of FIG.

FIG. 17A is an explanatory diagram illustrating an example of a display layout of divided data.

FIG. 17B is an explanatory diagram illustrating a state where the line is scrolled up by one line from the state of FIG. 16.

FIG. 17C is an explanatory diagram showing a state where the entire layout in a state where the partial data 401 shown in FIG. 7B has been laid out is temporarily displayed for explanation.

[17D] FIG. 7B is an explanatory diagram showing a state where the partial data 402 shown in FIG. 7B is laid out.

FIG. 17E is an explanatory diagram showing a state in which the entire layout in a state where the character elements that also start with the “W” force have been added and laid out after the state of FIG. 17C is temporarily displayed for explanation.

FIG. 17F is an explanatory diagram showing a state where layout is performed from partial data 402 to partial data 405 shown in FIG. 7B.

FIG. 18A is an explanatory diagram illustrating a state where the line is scrolled upward by five lines from the state of FIG. 17B.

[圆 18B] FIG. 17F is an explanatory view showing a state in which the range of one page is displayed on the state force as well.

[Fig. 18C] An example of a display layout showing the display range of the electronic data in Fig. 7B FIG.

[19A] FIG. 19A is an explanatory diagram illustrating a state in which display layouts of individually generated divided data are simply arranged.

[FIG. 19B] FIG. 19B is an explanatory diagram showing a state in which the range of one page is displayed on the state force of FIG. 17F without regenerating the display layout of the partial data 402 shown in FIG. 7B.

FIG. 19C is an explanatory diagram showing a layout in a state where the layout of the partial data 405 and 406 shown in FIG. 7B has been generated.

[Fig. 19D] An example in which an error appears in the display result when the layout of the partial data 405 and 406 shown in Fig. 7Β was generated while taking into account the influence of the partial data including the wraparound image. FIG.

FIG. 19E is an explanatory diagram showing an example in which the range below “One such” in the partial data 407 shown in FIG. 7Β by one page is displayed.

FIG. 20 is an explanatory diagram illustrating a state where the line is scrolled up by three lines from the state of FIG. 18A.

[21] FIG. 21 is a flowchart illustrating another example of a processing method for acquiring the display layout of the current divided data in consideration of the influence of other divided data.

FIG. 22 is an explanatory diagram illustrating a state in which one line has been scrolled further upward from the state of FIG. 16 in accordance with the processing procedure shown in FIG. 21.

FIG. 23 is a flowchart illustrating an example of a data generation method according to an embodiment of the present invention.

FIG. 24 is a flowchart illustrating a method of calculating a division boundary for dividing electronic data into division data.

[25] Fig. 25 is a flowchart illustrating a method of searching for a candidate for a standard-dependent boundary or a standard-independent non-dependent boundary within the range of the current position force up to the current position, and setting it if it exists. .

FIG. 26 is a flowchart illustrating a method of searching for a nonstandard non-dependent boundary candidate in the range up to the current position, and setting it if it exists. [27] FIG. 27 is a flowchart illustrating a method of generating processing auxiliary data using divided data.

FIG. 28 is an explanatory diagram illustrating a data structure of a current start tag list and a current end tag list.

[29] FIG. 29 is an explanatory diagram illustrating an example of processing auxiliary data.

FIG. 30 is a flowchart illustrating a method of generating division boundary data using the obtained division boundary.

FIG. 31 is a flowchart illustrating another method of processing for generating division boundary data using the obtained division boundary.

[32] Fig. 32 is an explanatory diagram illustrating a data structure of a file used in a method of extracting divided data that also requires electronic data by using division boundary data.

FIG. 33 is an explanatory diagram for explaining the structure of a file of divided data used in a method of directly reading divided data from each file card.

FIG. 34 is an explanatory diagram showing an example in which file names of files of divided data are recorded in an XML format.

[35] FIG. 35 is an explanatory diagram illustrating an example of a file structure in a text format when electronic data is recorded in a file.

FIG. 36 is an explanatory diagram illustrating an example of a binary file structure when electronic data is recorded in a file.

FIG. 37 is an explanatory diagram illustrating an example of a binary file structure when recording division boundary data, processing auxiliary data, and dependency data in one file.

FIG. 38 is an explanatory diagram illustrating an example of a file structure of a file in which substantially the same information as in FIG. 37 is described in a text format.

FIG. 39 is an explanatory diagram showing the contents of each file when the divided data is recorded as a file including processing auxiliary data.

FIG. 40 is an explanatory diagram illustrating a file structure of a file in which a file of divided data is recorded in an XML format.

FIG. 41 is a block diagram showing a functional configuration of a data processing device of the present invention. [42] FIG. 42 is a schematic perspective view showing an example of the appearance of the data processing device.

[43] FIG. 43 is an explanatory diagram illustrating an example of a data structure of processing auxiliary data.

FIG. 44 is an explanatory view for explaining another example of the data structure of the processing auxiliary data.

FIG. 45 is an explanatory diagram illustrating a data structure example of display layout element data that is a basic unit of a display layout.

FIG. 46 is an explanatory diagram illustrating an example of a data structure of row data for managing a collection of display layout element data.

[47] It is explanatory drawing explaining the information of line data.

[48] FIG. 48 is an explanatory diagram illustrating an example of a data structure of management data of partial data.

FIG. 49 is a flowchart illustrating an example of a data processing method according to an embodiment of the present invention.

50 is a flowchart illustrating a method of processing in S15 in FIG. 49, that is, a method of acquiring a display layout of current partial data in consideration of an influence.

FIG. 51 is a flowchart illustrating another method of the process of S15 in FIG. 49, that is, a process of acquiring the display layout of the current partial data in consideration of the influence.

[52] FIG. 52 is a flowchart illustrating details of a process for generating a display layout for partial data output.

[53] FIG. 53 is an explanatory diagram illustrating one stage of display layout generation processing when a wraparound image is present.

[54] FIG. 54 is an explanatory diagram illustrating the next stage of the display layout generation process when there is a wraparound image.

FIG. 55 is an explanatory diagram illustrating a processing order when displaying a range of one page on the state force of FIG. 17F.

[FIG. 56] Processing of processing when the display layout of the partial data 402 and 403 shown in FIG. 7B is stored, and one page is displayed upward with reference to a certain note position in the partial data 403. It is explanatory drawing explaining an order.

FIG. 57 is an explanatory diagram illustrating a processing procedure when performing the processing in FIG. 56 based on the processing method in FIG. 51. BEST MODE FOR CARRYING OUT THE INVENTION

[0106] Hereinafter, embodiments of the present invention will be described with reference to the drawings. Figure 1 shows the waveform shaping method of the present embodiment. In the present embodiment, members having the same functions as the members described in the section of the related art are assigned the same member numbers, and descriptions thereof are omitted.

[0107] (First embodiment)

Hereinafter, a first embodiment of the present invention will be described with reference to the drawings.

[0108] (Definition of terms)

First, the definition of words is explained.

Hereinafter, for the sake of explanation, data obtained by simply dividing electronic data at “division boundaries” will be referred to as “divided data”. For example, FIG. 7A shows an example of how to divide the entire HTML data as electronic data into six pieces of divided data. As can be seen from FIG. 7A, there is no overlapping part or missing part between the divided data.

[0110] Divided data is assumed to have an order, and is relatively referred to as "previous divided data" and "next divided data". This order is the processing order of the divided data when the processing result obtained by sequentially processing the divided data in consideration of the influence matches the processing result of the entire electronic data. Incidentally, the processing order often corresponds to the order of the position of the divided data in the electronic data.

[0111] Note that not all data obtained by dividing electronic data are referred to as divided data. Here, the divided data mainly as data is data (material data) that is a material that directly generates a processing result. For example, in the case of electronic data of a document, text data is a target. Therefore, parts other than the material data in the electronic data, for example, the header information part, are said to be the materials that directly generate the processing results! is there.

[0112] The "division boundary" is a boundary that divides electronic data into two or more sets of division data, as shown in FIG. 7A. The division boundary can be expressed by the position in the electronic data.For example, when expressed in byte units, the leading force of the electronic data is also before any byte, or between what byte and what byte, or what byte. Later, take the form. As a unit system that represents position Is the number of characters, the number of bits, the number of tags, and combinations thereof.

[0113] "Partial data" is data generated from electronic data using a "division boundary", and includes data of a part of the electronic data. The data processing result itself has no error as described later.

[0114] There are two types of relationships between the partial data and the divided data. The first case is when the partial data is equal to the divided data selected from among the divided data generated from the electronic data using the divided boundaries. The selection is performed by selecting an appropriate division boundary where no error appears in the processing result of the division data itself. The second is a case where the partial data, the divided data, and the force are not equal, and the divided data is a combination of auxiliary information for creating a state in which there is no error in the processing result itself of the divided data. .

The above-described process of selecting an appropriate division boundary is a process in the influence determination step and the standard-independent boundary extraction step of the present invention.

[0116] The electronic data portion included in the partial data does not necessarily constitute a continuous mass of data portion in the electronic data, and the case of discrete data is included in the present invention. The data part is easier to handle. If the partial data is not skipped, it has the same order as the divided data, and is called “previous partial data” or “next partial data”.

Note that the partial data need not necessarily exist in a form independent of the electronic data (for example, in a separate file). It may be stored as a set of electronic data and information on the division boundary. When partial data is needed, it may be dynamically generated from a set of electronic data and information on a division boundary. For example, partial data can be dynamically generated by obtaining position information of a division boundary from division boundary data and reading data of a portion corresponding to the range of the partial data from electronic data.

[0118] As a result, there is an IJ point for electronic data that does not need to be generated as a separate file, etc., as it is!

[0119] The case where this advantage comes into play is, for example, in the case of electronic data, due to problems such as encryption and copyright, files may be changed and Z or added, or each file may be created by dividing it into divided data. You may not be able to do that. Also, if the electronic data is It may be recorded on non-writable media such as CD-ROM. In such a case, it is possible to cope with each of the above cases by leaving the electronic data as it is and separately generating a file of division boundary data as an auxiliary file.

[0120] The definition of "the processing result itself when processed alone has no error" differs depending on the type of electronic data. Basically, data that is not included in the original electronic data (referred to as pseudo data) The processing results as if they were included in the electronic data (for example, unintended line breaks, font sizes, etc.) If the processing result is defined as an error, the processing result corresponding to such pseudo data is not included, and if the processing result originally intended by the original electronic data is obtained, There is no error in the result itself,

Is defined.

[0121] The expression "no error appears in the processing result" may be referred to as "a processing result can be obtained without impairing the meaning of the data".

[0122] For example, in the case of HTML data, the display result as the processing result differs depending on the display setting of the WWW browser. In this case, whether the display result is generated in accordance with the instruction result by the tag, such as whether a line break has been performed by the line break tag, the force of reflecting the specification of the character size and character color by the font tag, etc. This is one of the criteria for determining whether an error has appeared in the processing result. For example, even if the display setting of the character size changes and the total number of lines changes, if a line break is made at the line break tag position, in this case, it is determined that there is no error in the processing result itself. If only the data between the start tag and the end tag of the font tag is processed, the specification of the font tag is not reflected. In this case, it is determined that the processing result itself has an error.

[0123] In the case of plain text, a line feed is indicated by a character of a line feed code.

FIG. 19A and FIG. 19B show specific examples in which an error appears in the processing result. Assuming that the display result shown in FIG. 18A is an error-free display result with respect to FIG. 19A, a line feed appears after “based” in FIG. 19A. In addition, assuming that the display result shown in FIG. 18B is error-free compared to the display result shown in FIG. 19B, a line break appears after “glass.” In FIG. 19B.

[0125] In other words, although the line feed tag and line feed code are not present in the original data, the In FIG. 19B, the line feed tag and the line feed code are included as pseudo data, and the original data also includes the power!

[0126] In the case of plain text, a line feed is indicated by a character of a line feed code.

[0127] "Processing auxiliary data" means that processing of the divided data alone does not impair the meaning of the divided data! / ヽ In order to obtain a processing result, information ( Data). Alternatively, the “processing auxiliary data” is data that assists information that is not obtained by simply processing the divided data so that the divided data can be processed as partial data.

That is, the divided data and the processing auxiliary data are combined into partial data. For example, information to take over the effect of the previous divided data, information to be processed by the later divided data, or specific data (for example, control code, etc.) that is commonly related to the processing results of multiple divided data is there.

[0129] The processing auxiliary data is basically generated as another data in the form of a file, not a part of the electronic data or partial data. In some cases, processing assistance data is included as part of electronic data at the end or at the end.

[0130] More specifically, as will be described later, in the case of HTML data, the start tag in the divided data existing before the target divided data, and the corresponding end tag is the divided data. If it exists in the subsequent divided data, its start tag becomes information to be taken over from the previous divided data card, and thus corresponds to processing auxiliary data for the focused divided data.

[0131] In other words, the effect of the start tag in the previous divided data originally extends to the subsequent divided data, but as a result of the division, when the subsequent divided data is processed independently, the start tag Is not read, and the processing result does not show the effect of the start tag. Eventually, the division generates divided data that does not result in the intended processing result. Therefore, by combining the start tag as processing auxiliary data for the subsequent divided data, the original processing result can be obtained even if the subsequent divided data is independently processed.

[0132] The processing auxiliary data and the divided data are treated as a set. If necessary, the information may be dispersed and recorded. For example, it is acceptable to record the data in a form such as a file in which only the processing auxiliary data is collected, or to add the processing auxiliary data to the end of the electronic data or the like.

[0133] The processing auxiliary data and the divided data are generally created in advance, but can be dynamically generated at the time of use.

[0134] However, if data required by each set of the divided data and the processing auxiliary data is present in the electronic data, the required data is copied to each divided data (or processing auxiliary data). If distributed, it is possible to obtain a processing result that does not impair the contents of the divided data by itself. However, then, the data size of each divided data (or processing auxiliary data) becomes large. Therefore, in order to avoid such a problem, even when a shared part other than the divided data (or the processing auxiliary data) is used, it is regarded as “processed by partial data”.

Examples of commonly required data include so-called header information such as type and version information of electronic data, copyright information, encryption information, and the like.

[0136] Next, the "effect" here refers to whether to refer to the processing result of another partial data when processing certain partial data, or to determine whether to refer to the processing result of another partial data. It means that the processing result of partial data changes depending on whether to process as partial data and continuous data. “Process as a series of data” means that continuous partial data is processed as a single piece of data.

For example, regarding continuous partial data X and Y, when partial data Y is processed with reference to the processing result of partial data X, or partial data X and Y are processed as continuous data in this order If there is a difference in the processing result between the case and the case in which each is processed independently, if the processing result appears to be different, such as "partial data Y is affected by partial data X" or "partial data X Will affect the partial data Y "and" the partial data Y will be affected by the division "in the present invention. The effect is likely to appear when the processing result of the next partial data Y is added to the processing result of the previous partial data X.

[0138] The partial data X that affects the partial data Y is referred to as affected partial data.

In the examples of FIGS. 18B and 19B mentioned above, FIG. Fig. 19B shows the processing results when processing as a series of data, and Fig. 19B shows the processing results when processing is not performed as a series of data, that is, processing individual partial data independently and combining the processing results. It is a processing result in the case of having performed.

[0140] As described above, the influence is likely to appear when the processing result of the next partial data is added to the processing result of the previous partial data. The effects may or may not occur, depending on how the data is divided and the content of the data. In addition, even if the same partial data is used, depending on the processing method and processing settings, effects may occur or power may not occur.

[0141] As an example where the processing result is affected, when a process of arranging a character on a line using partial data of document data is performed, the previous partial data is the last character (for explanation, " In some cases, a character (called "Character B" for the sake of explanation) that is first placed by the next partial data is added to the line of "Character A". In the case of additional arrangement, since “character B” is arranged next to “character A”, the processing result of the next partial data may change depending on the processing result of the previous partial data.

[0142] However, the result may not change depending on the processing result of the previous partial data, or the result may not change even if the processing result of the previous partial data is referred to or not. Therefore, an error does not always appear when a force is used to refer to the processing result of other partial data or when a force is used to process as a series of data. For example, if "letter A" is a line feed code, "letter B" is always placed at the beginning of the next line. In this case, regardless of the processing result of the previous partial data, the arrangement position of “Character B” does not always change.

The effect of the processing result is not limited to the processing result of adjacent partial data before and after, and may be affected even between distant partial data. For example, when performing a process of generating a display layout using partial data of HTML data, this may occur when text data or the like wraps around an image. When characters are laid out around an image, the layout range is limited by the image. This limitation of the layout range has an effect.

[0144] At this time, if the data is composed of a plurality of partial data such as characters wrapped around the image and laid out, an instruction to lay out characters and the like wrapping around the image (hereinafter, wraparound finger) Is usually the first partial data of the plurality of partial data. Therefore, the partial data that does not include the wraparound instruction has no clue to know that the character string in the partial data should be wrapped around the image. The image accompanied with the wraparound instruction is hereinafter referred to as a wraparound image (see FIG. 5B).

Therefore, if the partial data including the wraparound image and the partial data not including the wraparound image are separately processed and simply connected, there is still room for the wraparound image, but the wraparound image is not included. With respect to the partial data, an error may occur in which the wraparound is canceled and the leading character string of the next line after the layout of the partial data including the wraparound image is completed is displayed. This is different from the layout intended by the original data.

[0146] FIGS. 19C and 19D show display examples of partial data including a wraparound image. Fig. 19C shows the case where no error appears in the display result by the data processing method of the present invention, and Fig. 19D shows the case where an error appears because the effect of the partial data including the wraparound image was not considered. Yes, it is.

[0147] In this way, an effect may occur even between distant partial data.

[0148] Further, as an example in which the processing order affects the processing result, there is a case where a value (variable value) used internally changes in the processing of each partial data. For example, suppose that the value of variable C is set to 1 in the processing of the first partial data, and the value of variable C is doubled in the second and third partial data. If processing is performed in the order of the first, second, and third partial data, before processing the third partial data, the value of the variable C is 2, and after processing, the force 1 becomes 4, and the force of the third partial data is When processed in order, the value of variable C is 1 before processing the third partial data, and 2 after processing.

[0149] Regardless of whether or not there is an effect, the processing result of each partial data alone does not always impair the meaning of the partial data as defined by the partial data (no error appears). However, when the processing results of each partial data alone are combined, the effect of processing each partial data independently impairs the meaning of the partial data as a whole (the original electronic data originally intended). Therefore, the processing result can be obtained).

[0150] For example, in the above example of "character A" and "character B", if the "next partial data" including character B is processed independently, character B (for example, "When" in Fig. 19B) becomes Because it is the first character, Be placed. When viewing the processing result with the letter B at the beginning of the line alone, there is no error in the processing result of the “next partial data” itself! ,.

[0151] However, when viewed together with the processing result of the "previous partial data" including the character A, that is, the row of the processing result of the "previous partial data" and the row of the processing result of the "next partial data" When they are simply displayed side-by-side, the effect of the division appears at the connection, and the meaning of the partial data may be lost.

[0152] For example, if "Character A" is not a line feed code, "Character B" next to "Character A" is suddenly placed at the beginning of the next line. It looks like. However, since the character of the line feed code does not exist there as document data, the combined processing result shows the effect of processing each partial data independently.

[0153] In general, the processing result of the partial data in the previous order affects the processing result of the partial data in the subsequent order, or the partial data in the previous order is processed in the processing of the partial data in the subsequent order. In most cases, the result is affected.

[0154] The "hierarchical structure" is also called a "tree structure" and refers to a state in which the relationship between data elements is managed as a branched tree-shaped structure. Branching is only a matter of detail, and the branches do not share a relationship (when they do, they are called a "network structure"). In general, the hierarchy to which the branched and finely divided data belongs is often referred to as a “lower layer”, and the hierarchy to which the original data belongs is referred to as an “upper layer” in a vertical relationship.

[0155] For example, a nested structure of HTML data tags described below corresponds to a hierarchical structure.

[0156] The "order structure" is a structure in which there is no hierarchical relationship between data elements, but the order is significant. Even if the elements of the data are the same, if the order changes, the data becomes different. For example, the LI tag, which is the layer below the OL tag of HTML data, displays a bulleted number, and the number is determined by the order in which the LI tag appears.

[0157] It should be noted that a data structure in which a branch destination is given an order in each layer of the hierarchical structure may be included in the hierarchical structure. In addition, the division of the data element of the hierarchical structure or the order structure does not always need to coincide with the division of the partial data.

[0158] The "hierarchical structure of the starting position" refers to the initial force of electronic data up to the starting position of the partial data. Means a hierarchical structure generated by data. In the case of HTML data, a hierarchical structure can be expressed by a string of one or more tags connected (arranged) that appeared up to the start position. In general, it is often possible to omit the same layer, which is determined by only the information in the upper layer, or the information in the lower layer, text data sandwiched by tags, etc. for the partial data of interest. In the example of HTML data, only the information in the upper layer means only the start tag having no corresponding end tag among one or more tags that have appeared up to the start position.

[0159] For example, taking the first divided data 400 'of the HTML data in Fig. 7A as an example, the information of the upper layer indicates the start tag of the HTML tag, that is, HTML>, and the information of the lower layer is font Specifies the start tag of the tag font color = "red" size = "+3"> and the end tag of Zfont>.

[0160] The "hierarchical structure of the end position" means a hierarchical structure generated from data from the end position of the partial data to the end of the electronic data. Speaking of the example of HTML data, the hierarchical structure can be represented by a character string that connects one or more tags that appear after the end position. In general, it is often possible to omit the same layer, which is obtained only by the information in the upper layer, or the information in the lower layer, or the text data sandwiched by tags, for the partial data of interest. Only the information in the upper layer means, in the example of HTML data, only one end tag having no corresponding start tag among one or more tags appearing after the end position.

[0161] Regarding "ordered structure of start position" and "ordered structure of end position", the target data range is the same as the hierarchical structure. Unlike the hierarchical structure, there is no upper or lower layer, but the information that appears in the data range is the subject of the sequential structure. Even in a hierarchical structure, if the hierarchical structure is composed of information including the information of the same layer and lower layers, the hierarchical structure can include the information of the order structure.

[0162] For example, in the case of HTML data, the layers of a plurality of LI tags are layers below the layer of the OL tags. Just include it. In this case, even if there is a division boundary of the partial data in the layer of the OL tag, the information on the order structure of the start position of the subsequent partial data includes the LI tag of the previous partial data. Can be obtained in the order in which appears.

[0163] A "display layout" is a collection of "display layout elements" such as characters and images. This is layout information of display layout elements output to an output unit such as a display unit or a printing unit so that the user can visually recognize it. In general, the display layout has information such as the position and size of each display layout element and the output format.

[0164] The "display settings" include, for example, the type and size of characters to be displayed, a range for generating a display layout (generally limited by the size of the display means), and the like. By changing these settings, the generated display layout changes. However, even if the display layout changes, usually only the position and size of each display layout element changes, but the contents (character information, image information, etc.) expressed by the document data do not change.

The “maximum data size” is a predetermined value, a value input to a user or the like, a value obtained by a predetermined calculation method, or the like, like the standard data size. Normally, the maximum data size is set to a data size that is the maximum allowable as partial data in consideration of resource saving and high processing speed. This is determined by the user based on the processing capacity of the processing device and the purpose of the processing.

[0166] The "dependency" is a relationship indicating which partial data has an effect on the processing result.

[0167] Like the processing auxiliary data, the "dependency data" may be added to the electronic data, and may be recorded in a format such as a file independent of the electronic data. .

[0168] The "row" here is a group of display layout elements, and generally includes display layout elements arranged in a horizontal row or a vertical row. All display layout elements belong to one row.As in wraparound images, display layout elements related to multiple rows should be managed separately from power rows that are divided and belong to each row. Do

[0169] "Beginning of line" is a position where display layout elements are first arranged in a normal arrangement method on a line. In general, the left end is for horizontal rows arranged in a horizontal line, and the upper end is for vertical rows arranged in a vertical line. Whether the first display layout element of the desired partial data is a display layout element that performs a special arrangement such as a wraparound image or a display layout element that is managed separately from a line is displayed from the beginning of the line. Next line to be placed in the row Normal display layout elements (characters, etc.) are to be judged.

(Configuration of Data Generation Device)

FIG. 1 is a configuration diagram illustrating a data generation device that performs a data generation method according to an embodiment of the present invention.

[0171] That is, the main parts of the data generation device are divided into electronic data acquisition means 1, influence determination means 2, division boundary data generation means 3, divided data generation means 4, processing auxiliary data generation means 5, and dependency relation data generation. Means 6, standard-independent boundary extraction means 7, non-standard-independent boundary extraction means 8, partial data size determination means 9, first division boundary extraction means 10, second division boundary extraction means 11, and third division boundary The extraction means 12 can be expanded and shown in the main functional blocks.

FIG. 2 is a configuration example of an apparatus that specifically realizes each of the units 111 to 12 in FIG.

[0173] The CPU (central processing unit) 70 includes the influence determination means 2, the division boundary data generation means 3, the division data generation means 4, the processing auxiliary data generation means 5, the dependency data generation means 6, and the standard independent. Boundary extraction means 7, non-standard independent boundary extraction means 8, partial data size determination means 9, first division boundary extraction means 10, second division boundary extraction means 11, third division boundary extraction means 12 A program in which the processing procedure of each of these means 2-12 is described can be obtained from a main memory 74, an external memory 75, a network destination via a communication device 77, and the like. Note that the CPU 70 also has a function as electronic data acquisition means 1 for reading and transferring necessary data.

[0174] The CPU 70 includes the display 71, the mouse 72, the tablet 73, the main memory 74, the external memory 75, the button 76, the communication device 77, the keyboard 78, and the Z connected to each other via the bus 79 including the CPU 70. Alternatively, the processing is performed while exchanging data with the speaker 80.

[0175] The data exchange may be performed via a communication cable or a wireless communication device such as a wireless communication device, in addition to via the node 79. The means for realizing each of the means 2-12 is not limited to the CPU, but may be a DSP (digital signal processor) or a logic circuit in which a processing procedure is incorporated as a circuit.

[0176] The display 71 is usually realized in combination with a graphic card or the like. It has VRAM (video random access memory) on the IC card, converts the data in VRAM into a display signal, sends it to a display such as a monitor (display Z output medium), and the display displays the display signal as an image I do.

[0177] As means for inputting user instructions, there are a mouse 72, a tablet 73, a button 76, a keyboard 78, and the like. The user's instruction is input to each means 111 through a bus 79. In addition, various input means such as voice input using a microphone can be used. The mouse 72 also functions as a detecting device and a button for detecting the moving direction and the moving distance of the mouse. The tablet 73 includes a pen and a detection device for detecting the pen position. Button 76 may be a mechanical or electronic switch. The keyboard 78 is composed of a group of buttons (keys) and sends out a signal corresponding to the pressed key.

[0178] The main memory 74 is usually configured by a memory device such as a dynamic random access memory (DRAM) or a flash memory. Note that memories and registers included in the CPU may be interpreted as a kind of main memory.

[0179] The external storage 75 is a removable storage means such as a hard disk drive (HDD) or a personal computer (PC) card. Alternatively, a main memory or an external memory attached to another network device connected by wire or wirelessly to the CPU 70 via a network can be used as the external memory 75.

[0180] The communication device 77 is realized by a network interface card or the like, and exchanges data with another network device connected wirelessly or by wire.

[0181] The speaker 80 interprets the audio data transmitted via the node 79 or the like as an audio signal and outputs it as audio. The output voice may be a simple sound of a single wavelength, or it may be complex such as music or human voice. If the audio to be output is predetermined, the transmitted data may be only an on / off operation control signal instead of an audio signal.

[0182] Next, the viewpoint of data transmission / reception between the respective means 11 and 12 in Fig. 1 will also be described.

[0183] The data exchange between each means is expressed as "** from the means" or "** sent (passed) to the means" without any particular annotation. Assume that data is exchanged via bus 79. At this time, data may be directly exchanged between each means, In some cases, data is exchanged with a memory 74, an external memory 75, a network destination via the communication device 77, etc. interposed therebetween.

[0184] The electronic data acquisition means 1 is composed of, for example, a CPU 70 and a main storage 74 or an external storage 75, and also obtains electronic data from a main storage 74, an external storage 75, or a network destination via the communication device 77. . In this case, electronic data prepared in advance is read.

[0185] For example, when the electronic data is encrypted, the electronic data acquisition means 1 reads out the encrypted electronic data from the main memory 74 or the external memory 75, and decrypts and reads it. There is also.

[0186] The obtained electronic data is sent to the influence determining means 2, the divided data generating means 4, the non-standard independent boundary extracting means 7, the non-standard independent boundary extracting means 8, and the third divided boundary extracting means 12. .

[0187] The CPU 70 as the standard-independent non-independent boundary extraction means 7 has a data size smaller than or equal to the standard data size based on a program in which power is read such as a main memory 74, an external memory 75, or a network destination via the communication device 77. The electronic data is divided into partial data. More specifically, the intra-standard independent division boundary is used for determining the data size obtained from the partial data size determination means 9 and the influence determination means for the partial data candidates of the electronic data obtained from the electronic data acquisition means 1. It is determined and obtained comprehensively from the judgment on the influence of the division obtained from 2. The obtained intra-standard independent division boundary is sent to division boundary data generation means 3, division data generation means 4, and first division boundary extraction means 10.

[0188] The method of obtaining partial data candidates may be fixedly determined in a program, or a part of the method or a value (parameter) used as a criterion is instructed to the user. In some cases. The instruction from the user is performed using an input device such as a mouse 72, a keyboard 78, a button 76, or a tablet 73 while viewing an instruction screen displayed on the display 71. Figure 3 is an example of a window display where the user specifies the specified maximum data size and the specified standard data size.

[0189] The CPU 70 as the non-standard-independent boundary extracting means 8 is a program that is read in the same manner as described above. One or more non-standard independent division boundaries for dividing the electronic data into partial data having a data size equal to or smaller than a predetermined maximum data size are obtained based on the datagram. More specifically, the non-standard-independent division boundary is used for determining the data size obtained from the partial data size determination means 9 and the effect determination means 2 for the partial data candidates of the electronic data obtained from the electronic data acquisition means 1. It is determined comprehensively from the judgment on the effect of the division obtained from the above. The obtained non-standard-independent division boundary is sent to division boundary data generation means 3, division data generation means 4, and first division boundary extraction means 10.

[0190] The CPU 70 as the first division boundary extracting means 10 obtains a standard-independent division boundary closest to the standard data size and from which partial data of the data size can be obtained, based on the program read in the same manner as described above. . For the determination of the standard-independent division boundary, the judgment obtained from the standard-independent division boundary data size judging means 9 with respect to the standard-independent division boundary obtained from the standard-independent boundary extraction means 7 is used. The obtained intra-standard-independent division boundary is sent to division boundary data generation means 3 and division data generation means 4.

[0191] The CPU 70 as the second division boundary extraction means 11 obtains a nonstandard non-standard division boundary at a data position closest to the standard data size based on a program read in the same manner as described above. For the determination of the non-standard-independent division boundary, the judgment obtained from the partial data size determination means 9 regarding the non-standard-independent division boundary obtained from the non-standard-independent boundary extraction means 8 is used. The obtained division boundaries are sent to division boundary data generation means 3 and division data generation means 4.

[0192] The CPU 70 as the third division boundary extraction means 12 obtains a division boundary from which partial data whose data size exceeds the maximum data size is obtained, based on the program read in the same manner as described above. However, regarding the partial data candidates of the electronic data obtained from the electronic data acquisition means 1, neither the standard-independent non-dependent boundary extraction means 7 nor the non-standard-independent boundary extraction means 8 cannot extract the division boundary! The third division boundary extraction means 12 accepts that the effect of the division appears in the processing result. The obtained division boundaries are sent to division boundary data generation means 3 and division data generation means 4.

[0193] It should be noted that within-standard non-dependent boundary extraction means 7, non-standard non-dependent boundary extraction means 8, first division boundary When obtaining the division boundary by the boundary extraction means 10, the second division boundary extraction means 11, and the Z or the third division boundary extraction means 12, one of the means 7, 8, 10-12 is determined by each of the means 7, 8, , 10-12, the extraction result of the other means may be used to determine whether or not to extract the division boundary. Regardless of the extraction results of the other means, each means 7, 8, 10-12 You may try to extract the division boundaries.

[0194] In the former case, the division boundary data generation unit 3 or division data generation unit 4, which is the side that uses the extracted division boundary, applies any one of the means 7, 8, 10-12 to the division boundary. Is only extracted, so you can use it. In the latter case, the highest-priority division boundary may be selected from one or more division boundaries that are force-extracted by each of the means 7, 8, and 10-12. The priority may be determined in advance by the extracting means, or may be obtained by numerically denoting the priority using some evaluation function or the like. In addition, it is preferable to set the priority from the viewpoints of high data processing speed and Z or resource saving in view of the object of the present invention.

[0195] The CPU 70 as the division boundary data generating means 3 is based on the program read in the same manner as described above, and includes the standard-independent boundary extraction means 7, the non-standard-independent boundary extraction means 8, the first division boundary extraction means 10 The divided boundary data obtained from the second divided boundary extracting means 11 and Z or the third divided boundary extracting means 12 is stored in a main storage 74, an external storage 75, or a network destination via a communication device 77, for example. Record in a format such as a file.

[0196] The generated division boundary data is sent to the processing auxiliary data generation means 5 and Z or the dependency relation data generation means 6, and the like.

When the division boundary data is recorded in the form of a file or the like, the division boundary data generating means 3 adds header information or data structure information, etc., encrypts, In some cases, a process such as adding a signature is performed. Header information and data structure information will be described later. These processes are not limited to the division boundary data generation means 3, but may be similarly performed by the division data generation means 4, the processing auxiliary data generation means 5, the dependency relation data generation means 6, and the like.

[0198] The CPU 70 as the divided data generating means 4, based on the program read in the same manner as described above, uses the standard-independent boundary extracting means 7, the non-standard-independent boundary extracting means 8, the first divided boundary Before dividing the electronic data obtained from the electronic data acquisition means 1 with the division boundaries obtained from the boundary extraction means 10, the second division boundary extraction means 11, and the Z or third division boundary extraction means 12, and generating partial data As a stage, divided data is generated. The generated divided data is recorded in a format such as a file on the main memory 74, the external memory 75, or a network destination via the communication device 77, for example. The generated divided data is sent to the processing auxiliary data generating means 5 and Z or the dependency data generating means 6 or the like.

[0199] Normally, it is rare that both the division boundary data generation means 3 and the division data generation means 4 execute processing. Only one of the processings depends on the division data generation mode described later. Often performed.

[0200] The CPU 70 as the processing auxiliary data generating means 5 generates the processing auxiliary data from the focused divided data and the other divided data based on the program read in the same manner as described above. The processing auxiliary data is information that is not enough to make the divided data into partial data, that is, information that is not enough to process the divided data by itself and obtain a result that does not impair the meaning of the divided data. The generated processing auxiliary data is recorded in the main storage 74, the external storage 75, or a network destination via the communication device 77, for example, in a file format.

[0201] The divided data may be in a form directly obtained from the divided data generating means 4, and indirectly obtained from the electronic data obtained from the electronic data obtaining means 1 and the divided boundary data obtained from the divided boundary data generating means 3. It may be a form that can be obtained in a targeted manner. The term “indirectly” refers to a process of generating divided data in the processing auxiliary data generating unit 5 by partially cutting out and reading electronic data based on the dividing boundary data.

[0202] The CPU 70 as the dependency data generation means 6 generates the dependency data from the partial data based on the program read in the same manner as described above. The dependency data is information on partial data having a dependency between the processing results of the partial data. The method for acquiring the partial data is the same as the method by which the processing auxiliary data generating means 5 acquires the divided data.

The generated dependency data is recorded in, for example, a file format on the main memory 74, the external memory 75, or a network destination via the communication device 77. [0204] The division boundary data generated by the division boundary data generation means 3, the division data generated by the division data generation means 4, the processing auxiliary data generated by the processing auxiliary data generation means 5, the dependency data generation means The various data of the dependency data generated in 6 may be generated as separate files, or may be generated as a file in which the data are combined. In addition, data other than the divided data may be recorded in a form that is added to a file of electronic data.

[0205] Note that the CPU 70 can also function as a layout generation unit that generates a display layout (processing result) for the divided data and the display range specified according to a program or user input by the control unit 8. At the time of layout generation, the processing auxiliary data obtained from the processing auxiliary data generating means 5 may be used together with the divided data. The generated display layout is sent to and stored in the main storage 74 or the external storage 75, or to a device at the network destination via the communication device 77, or is sent to the display 71 for display.

Further, the CPU 70 gives necessary control commands and instructions to each means 111, and functions as a general control means 8 for bidirectionally transmitting and receiving necessary data to and from each means 111. There is.

[0207] Further, the CPU 70 can also function as layout display means for displaying the created display layout on the display 71 or the like. Here, the description is made as a display on the display 71. However, for example, there may be a case of printing on a printer or outputting a file to a file in which a display layout is recorded.

[0208] (Data and Data Structure)

Next, data and a data structure will be described.

FIGS. 4A and 4B are explanatory diagrams for explaining examples of electronic data as original data.

Here, HTML data (exactly XHTML data) will be described as an example of document data whose display layout changes depending on the display settings. The HTML data is inside the frame, and the number to the left is the line number for explanation.

[0210] Fig. 5A is an example in which the HTML data of Fig. 4A is displayed by a WWW browser at a certain display setting. Fig. 5B shows the HTML data of Fig. 4B with a WWW browser. This is an example displayed at the time of setting. Here, it is assumed that the WWW browser window is sufficiently large to display the HTML data of FIG. 4A or 4B at a time.

[0211] In Fig. 6A, the display setting of Fig. 5A is set to 1.5 times the size of the reference character, and the width and height of the display window are set to be the same, and the HTML data of Fig. 4A is displayed. It is an example. The same applies to FIG. 6B. Since each character has become larger, it can be seen that the wrapping position of each line has changed. In FIG. 6A and FIG. 6B, all the HTML data of FIG. 4A and FIG. 4B cannot be displayed, so only the first part is displayed. By switching the display range using a scroll bar or a page turning button, it is generally possible to display a portion that is not completely displayed.

[0212] For the purpose of explanation, the structure of HTML data (more precisely, XHTML data) will be briefly described. The “tag” described above is a character string that starts with the character “ku” and ends with the character “>”, and is a character string that instructs display settings. For example, the display settings in Fig. 5A or Fig. 5B are specified by various tags in the HTML data in Fig. 4A or Fig. 4B.

[0213] Generally, a tag is made up of a pair of a start tag and an end tag, and the end tag has a character "Z" after "ku". Each tag has a "tag name", the start tag is "ku" + "tag name" + ">", and the end tag is "ku Z" + "tag name" + ">".

[0214] For example, the first line in Fig. 4A or Fig. 4B starts with a start tag "kuHTML>", and the last line ends with an end tag "kuZHTML>". In this specification, each tag composed of a pair of HTML> and <ZHTML> is referred to as a “HTML tag” using a tag name.

[0215] The start tag can also have an "attribute" as information for setting the display layout in detail. An attribute consists of an "attribute name" and an "attribute value"

Multiple attributes can be given in a format such as "ku tag name attribute name 1 =" attribute value 1 "attribute name 2 =" attribute value 2 ">".

[0216] Partial force sandwiched between a start tag and an end tag. The part other than the tag is “TEXT”. For example, the line “ku font color =“ red ”si ze =“ +3 ”> How does LCD works? LCD works? Is the target of the font tag.

[0217] Specifically, since the color attribute is red, the character color is red, and since the size attribute is +3, the font is three levels larger than the reference font size. In FIG. 5A or FIG. 5B, the above T EXT is certainly displayed in large characters. (Because the text color is hard to understand on a black-and-white print screen, it is assumed that it is displayed in red on a full color display shown in black here.)

[0218] If there is no TEXT to be inserted between the start tag and the end tag, the start tag and the end tag may be put together to form "ku tag name Z>". For example, “ku brZ>” (the specific meaning will be described later) in the third line of FIG. 4A or FIG. 4B is this example.

[0219] As described above, the tags of the HTML data have a nested structure and a hierarchical structure. Here, it is assumed that the HTML data conforms to the XHTML (extensible hypertext markup language) format or the XML (extensible markup language) format, and cannot have any structure other than the nested structure.

[0220] For example, since the A tag and B tag power “ku A> <ZB> <ZA>” is a nested structure, the power “ku A> <ZA that has the correct hierarchical structure > <ZB> ”is not allowed because it does not have a nested structure. Note that when tags are nested, the effect of the outer tag extends to the inner tag and its TEXT, but the tags with the same tag name and the attribute values of the same attribute name with the same tag name are not affected. , The inner tag is generally preferred.

[0221] In the example of Fig. 4A or Fig. 4B, the tags at the top level are the HTML tags on the first and last lines, and the font layers and br tags on the second and third lines are below. Many tags follow. In the hierarchy below the font tag on the 5th and 16th lines, there are P tags on the 6th and 15th lines (the meaning is described later).

Next, the function of each tag other than the font tag shown in FIG. 4A or 4B will be briefly described. The HTML tag only declares that it is an HTML document and has no meaning for display settings. The br tag means that a line feed is performed on the display layout. Line feed codes in HTML data are usually ignored. The P tag means a graph, and is expressed as a slight vertical space and a line feed at the start tag, and as a line feed and a slight vertical space at the end tag. The vertical space inserted by the P tag is set based on the character size. It can be fixed or fixed to a certain size. Indentation may be displayed depending on the WWW browser. Here, there is no indentation.

In the present invention, the power of generating data such as division boundary data, division data, processing auxiliary data, and dependency data will be briefly described before describing a method of generating these data. I do.

First, data used in a usage example will be described.

[0225] FIG. 7A is an explanatory diagram schematically illustrating division data 400'-405 'generated before considering the influence of division from the document data 406 of Fig. 4A. The division (indicated by a broken line) of each divided data 400'-405 'is actually generated as divided boundary data, or the divided data 400'-405' is generated as an individual file or the like. The power is shown here as a broken line to make it easier to understand the division.

[0226] When each of the divided data 400'-405 is independently processed using the processing auxiliary data and displayed, there is no error in the display result itself. Can be partial data by using the processing auxiliary data.

FIG. 8 shows that the influence determining means 2 determines the influence of the division on the divided data 400 ′-405 ′ of FIG. 7A, and the dependency data 140 ′ generated by the dependency data generating means 6 based on the determination result. FIG. 146 is an explanatory diagram for explaining the data structure of 145 ′. Each of the divided data 400'-405 'corresponds to each of the dependency relationship data 140 and 145'. The dependency data 140'-145 'is in the form of an array, and each of the dependency data 140'-145' can be accessed by an index number.

[0228] Here, information as to whether or not the processing result of each divided data is affected by the processing result of the immediately preceding divided data is recorded as dependency data. Information is recorded as "0" or "1", and is recorded as "1" if affected (affected) or "0" if not affected (no effect) . For example, when the dependency data 142 'is taken as an example, the content is "1", which indicates that the processing result of the focused divided data 402' is affected by the processing result of the immediately preceding divided data 401 '.

FIG. 9 is an explanatory diagram illustrating the data structure of the dependency relationship data 150-155 generated by another method of the divided data 400′-405 ′ of FIG. 7A. Split data 400'-405 ' Each corresponds to each of the dependency data 150-155. The dependency data 150-155 is in the form of an array, and each of the dependency data 150-155 can be accessed by an index number.

[0230] Here, the information of the divided data before the processing result of each divided data is affected is recorded as dependency data. The information is recorded as information for specifying the divided data. In this example, “divided data 401 ′” (dependency data 152, 153) and the data of the affected divided data are stored so that they can be easily divided. It is a number. Other information that specifies the divided data includes the index number of the array, the address of the divided data in the memory, and the file name of the divided data.

[0231] In the case where there is no affected divided data, the data may be empty or information specifying the own divided data may be recorded. In FIG. 9, the data number of the own divided data is shown in parentheses to indicate that the data may be recorded empty (dependency data 150, 151, 154, 155).

FIG. 10 shows an example of the appearance of a data processing apparatus that uses electronic data, division boundary data, division data, processing auxiliary data, dependency data, and the like. A display unit / tablet 301 and page turning buttons 302 and 303 are provided on the main body 300. A pen 304 for operating the tablet is also provided.

[0233] Here, as the electronic data, document data that can generate a different display layout depending on the display setting is used. The data processing device in FIG. 10 uses the above-described document data, division boundary data, division data, processing auxiliary data, and dependency data For example, it is assumed that a display layout can be generated and displayed using necessary data.

[0234] The generated display layout is displayed on the display unit / tablet 301. The display unit / tablet 301 is also used to display various setting menus of the data processing device and change settings with a finger or a pen using a tablet.

[0235] As operation means for various settings and the like, other operation buttons and the like that can be operated only by the display unit / tablet 301 may be used. The page turning buttons 302 and 303 are used to switch the display range of the display layout displayed on the display unit / tablet 301, for example. The pen 304 is used for various operations such as link jump operation and user input for various settings. Available.

[0236] Although not shown in this example, other than these, a slot such as a memory card as an external storage, a communication device 77 for communicating with a network, an input device such as a mouse 72 and a keyboard 78, a microphone, and a speaker 80 are provided. An output device, such as, may be attached.

[Details of Data Generation Method]

(Processing flow)

Next, a method of generating the divided data, the divided boundary data, the processing auxiliary data, and the dependency data will be described.

First, in step S1 (hereinafter, “step S” is abbreviated as “S”), the electronic data acquisition unit 1 transmits, for example, a main storage 74, an external storage 75, a network destination via a communication device 77, or the like in advance. Read the electronic data prepared in. As a result, the electronic data acquisition means 1 acquires the electronic data, and the process proceeds to S2 via the connection point P10 (hereinafter, "connection point P" is abbreviated as "P").

[0240] Next, in S2, the influence determining means 2, the processing auxiliary data generating means 5, the dependency data generating means 6, the standard non-dependent boundary extracting means 7, the non-standard non-dependent boundary extracting means 8, the partial data size determining means 9, the first division boundary extraction unit 10, the second division boundary extraction unit 11, and the Z or third division boundary extraction unit 12 receive the electronic data from the electronic data acquisition unit 1 and divide the electronic data into divided data. The dividing boundary is calculated, and the process proceeds to S3 via P20. Details of the processing here will be described later with reference to FIG.

[0241] In S3, the dividing boundary data generating means 3 includes the dependent boundary extracting means 7, the non-standard independent boundary extracting means 8, the first dividing boundary extracting means 10, the second dividing boundary extracting means 11, and the Z or the third dividing boundary extracting means. The division boundary data is generated using the division boundary obtained from the division boundary extraction means 12, and the process proceeds to S4 via P30. Alternatively, the divided data generating means 4 generates divided data using the dividing boundaries obtained from the means 7, 8, 10-12, and the process proceeds to S4 via P30.

[0242] In S4, the processing auxiliary data generation means 5 uses the divided data to generate the processing auxiliary data. After generation, the process proceeds to S5 via P40. Details of the processing here will be described later using FIG. 27 and the like.

[0243] In S5, the dependency relationship data generation means 6 generates dependency relationship data using the divided data, and ends the process via P50. Details of the processing here will be described later with reference to FIGS.

[0244] The divided data used in S4 and S5 may be obtained directly from the divided data generating means 4 (S3) as described above, or may be obtained from the electronic data obtaining means 1 (S1). And the division boundary data obtained from the division boundary data generating means 3 (S3) in some cases.

[0245] Through the above processing of S1 to S5, division boundary data, division data, processing auxiliary data, dependency data, and the like are generated.

[0246] (Division boundary calculation processing)

FIG. 24 is a flowchart illustrating one method of the process of S2 in FIG. 23, that is, a process of calculating a dividing boundary for dividing electronic data into divided data.

[0247] In S2-1 after P10, the partial data size determination means 9 acquires the following specified maximum data size, and the process proceeds to S2-2.

[0248] In S2-2, the partial data size determination means 9 acquires the following specified standard data size, and the process proceeds to S2-3.

[0249] The specified maximum data size and the specified standard data size are parameters relating to the size of one piece of divided data. In other words, the specified maximum data size is the maximum size of the divided data that is allowed from the viewpoint that does not hinder realization of high-speed processing and resource saving of the processing device. The designated standard data size is the most desirable size of the divided data, and is determined according to the processing capability of the processing apparatus and the purpose of the processing.

[0250] Note that the specified maximum data size and the specified standard data size may be fixedly determined by the program, and the user is instructed in some methods and values (parameters) used as criteria. It may be done.

[0251] The instruction from the user is, for example, looking at the instruction screen displayed on the display 71, This is done using input devices such as a mouse 72, keyboard 78, buttons 76, and tablet 73. Figure 3 is an example of a window display for specifying the specified maximum data size and the specified standard data size.

[0252] In S2-3, it is determined whether or not the force at which the current position exists, that is, the force at which all the electronic data has been read, or whether the force at the current position has been specified as the display start position also by the user. If it does not exist, the calculation of the dividing boundary has been completed, so the process exits to P20. If it does, the process proceeds to S2-4. When determining the first division boundary, it is assumed that the current position has been initialized to the beginning of the electronic data. Note that the processing in S2-3 is general-purpose, and the means that is the main subject of operation is not particularly limited. However, here, it is assumed that the related strength or the means 7-12 is shifted.

In S2-4, an initial setting process is performed !, and the process proceeds to S2-5. As an initial setting process, the current position is set to the start position (new division boundary) of the new division data, and the setting of the standard-independent boundary candidate, the non-standard-independent boundary candidate, and the standard-dependent boundary candidate is performed. Clearing is performed. Note that the division boundary position is also initialized to the beginning of the electronic data in a stage before the first division boundary position is obtained.

[0254] Here, the word "in standard" means that the starting position force of the divided data also falls within the specified standard data size, and the word "nonstandard" means (((starting position of divided data) + (specified standard data)). It means the range from (data size)) to ((partition data start position) + (specified maximum data size)).

[0255] The "independent boundary candidate" means a candidate for a boundary that does not affect the processing result when the original electronic data is divided at the division boundary to be obtained. The “existing boundary candidate” means a candidate for a division boundary where the division affects the processing result.

[0256] Here, a criterion that desirability increases in the order of the standard-dependent boundary candidate, the non-standard-independent boundary candidate, and the standard-independent boundary candidate is set. In other words, non-dependent boundaries are most desirable within the standard. This determination criterion may be set so that the user can make a desired setting.

The current position, the division boundary position, the standard-independent non-dependent boundary candidate, the non-standard non-dependent boundary candidate, and the standard-independent boundary candidate are values that are temporarily recorded on the main memory 74 or the like. These indicate positions in the electronic data. The unit may be the number of bytes, characters, words, etc. Can be

[0258] The start position of the divided data is naturally the beginning of the electronic data at first. In addition, as in S2-3, the means that is the main actor of S2-4 is any of the closely related means 7-12 here.

[0259] In S2-5, the partial data size determination means 9 determines whether the data size at the start position (division boundary position) of the divided data up to the current position exceeds the specified standard data size, and determines that the data size is exceeded. If so, the process proceeds to S2-6, and if not, the process proceeds to S2-11 via PI1.

[0260] In S2-6, the influence determination means 2 and the standard-independent boundary extraction means 7 determine whether there is a standard-independent boundary candidate between the start position force of the divided data and the current position. However, if it is determined that it exists, the process proceeds to S2-7, and if it is determined that it does not exist, the process proceeds to S2-8. This can be determined by determining whether or not a value indicating the existence of the candidate within the standard-independent boundary is set.

[0261] At S2-7, the standard-independent boundary extracting means 7 sets the standard-independent boundary candidate as a new division boundary, and the process returns to S2-3. As a result, the non-standard independent boundary candidate is set as a division boundary with priority over other boundary candidates.

[0262] When the current position exceeds the specified standard data size (S2-5), since the standard-independent boundary candidate already exists at that point (S2-6), it fits within the specified standard data size. This is the most desirable state because you have found a boundary candidate. The new division boundary is added to the division boundary array.

[0263] In a series of processes described in the flowchart of Fig. 24, the current position is advanced, and the first invisible standard-independent boundary candidate is set as a division boundary. Assuming that another standard-independent boundary candidate can be found at a location after the current position, it is better to use one of the standard-independent boundary candidates as the division boundary, and the data size of the divided data will be the specified standard data size. Is naturally the first candidate within the standard that is found.

That is, it can be said that the whole of the series of processing is the first division boundary extraction means 10.

A plurality of standard-independent boundary candidates are found, and the data size of the The non-standard-independent boundary candidate closest to the specified standard data size may be extracted as a division boundary, but the processing in FIG. 24 is more efficient, and the description is given here accordingly.

[0265] In S2-8, the partial data size determination means 9 determines whether or not the start position force of the divided data also exceeds the data size force up to the current position, and if it is determined that it exceeds S2-9. The process proceeds to S212 if it is determined that the value does not exceed S16.

[0266] In S2-9, the influence determination means 2, the non-standard independent boundary extraction means 8, the second division boundary extraction means 11, and the third division boundary extraction means 12 determine ((partition data start position) + (specified It is determined whether nonstandard non-dependent boundary candidates exist in the range from (standard data size)) to ((partition data start position) + (specified maximum data size)). The process proceeds to S2-10, and if it is determined that it does not exist, the process proceeds to S2-15. This can be determined by determining whether a value indicating the existence of the non-standard independent boundary candidate is set.

[0267] In S2-10, the non-standard-independent boundary extraction means 8 sets a non-standard-independent boundary candidate as a new division boundary, and the process returns to S2-3.

[0268] When the current position exceeds the specified maximum data size (according to the result of S2-8), the nonstandard non-dependent boundary candidate already exists at that time (according to the result of S2-9). This means that a non-dependent boundary candidate that exceeds the data size but falls within the specified maximum data size has been found. Since there is no intra-standard non-dependent boundary candidate (according to the result of S2-6), a sub-standard non-independent boundary candidate is set as a division boundary as a next best measure. The new division boundary is added to the division boundary array.

[0269] Here, the first nonstandard non-dependent boundary candidate found is set as a division boundary. However, similar to S2-7, another nonstandard nondependent boundary candidate is temporarily found at a location after the current position. If the data size of the divided data is close to the designated standard data size, it is the first nonstandard non-dependent boundary candidate found, and it can be said that the entire series of processes is the second divided boundary extraction means 11. A plurality of non-standard-independent boundary candidates are obtained, and the non-standard-independent data whose data size is closest to the specified standard data size are obtained. The existence boundary candidate may be extracted as a division boundary, but the processing in FIG. 24 is more efficient, and therefore, the description will be made here accordingly.

[0270] (In S2-9, it is determined that there is no nonstandard non-dependent boundary candidate.) In S2-15, the third division boundary extraction unit 12 sets the intrastandard nonstandard boundary candidate as a new division boundary. Processing returns to S2-3.

[0271] As the current position exceeds the specified maximum data size (according to the result of S2-8) and there are no nonstandard independent boundary candidates (according to the result of S2-9), the specified standard data Although the size exceeds, the dependent boundary candidate that falls within the specified maximum data size must be set as a new division boundary. The position of the division boundary set based on the intra-standard dependence boundary candidate is usually the position obtained by adding the specified standard data size to the previous division boundary position. This is because up to this position, only the dependent boundary candidate exists. The new division boundary is added to the division boundary array.

[0272] (In S2-5, it was determined that the data size did not exceed the specified standard data size.) In S2-11, the influence determination means 2, the standard-independent boundary extraction means 7, and the third division boundary extraction means 12 Current position force Within the range up to the current position, a candidate for a standard-dependent boundary or a standard-independent boundary is searched for and set if it exists, and the process proceeds to S2-13 via P15. Since it is smaller than the specified standard data size, it is not enough to set a division boundary, and it is only necessary to search for division boundary candidates. Details of the processing here will be described later with reference to FIG.

[0273] (In S2-8, it was determined that the specified maximum data size was not exceeded.) In S2-12, the impact determination means 2 and the non-standard independent boundary extraction means 8 set the current position A nonstandard non-dependent boundary candidate is searched for in the range up to the position, and if it exists, it is set, and the process proceeds to S2-13 via P17. The current position exceeds the specified standard data size (S2-5), but there is no standard-independent boundary candidate (S2-6), which is less than the specified maximum data size! /, (S2-8) However, it is only necessary to find a non-standard-independent boundary candidate without setting a division boundary. Details of the processing here will be described later with reference to FIG.

In S2-13, the current position is advanced to the next character, next word, next tag, or the like, and the process proceeds to S2-14. How to advance the current position depends on the type of electronic data or the division boundary Various methods can be considered depending on how to search for candidates. Further, the processing here also relates to the efficiency of processing for searching for a division boundary candidate such as S2-11 or S2-12.

[0275] Here, it is assumed that the process proceeds in units of tags and words. For example, in the beginning of the electronic data 406 in FIG. 4A, the units are “KU HTML>”, “KU font color =“ red ”size =“ +3 ,,> ”,“ How ”,“ does ”, "LCD", "works?", "Ku / font>", "ku brZ>" and so on. In the case of document data in which words are not separated by spaces or the like, such as in Japanese, a tag and a block up to a certain number of characters may be used as a unit instead of a word.

[0276] Note that, as in S2-3, the means that is the main subject of operation in S2-13 is any one of the closely related means 7-12 here.

[0277] In S2-14, it is determined whether the current position exists, that is, whether or not all the electronic data has been read in order to obtain the division boundary. If it is determined that the current position exists, S2-14 The process returns to 5, and if it is determined that there is not, the process proceeds to S2-9. The judgment process is the same as S2-3.

[0278] In the above-described processing of S2-1 to S2-15, the processing of S2 in Fig. 23, that is, the processing of calculating the division boundary for dividing the electronic data into the divided data can be performed.

[0279] Fig. 25 shows the process of S2-11 in Fig. 24, that is, within the range from the previous current position to the present current position, searching for a standard-dependent boundary candidate or a standard-independent non-standard boundary candidate. It is a flowchart figure explaining one method of the setting process.

[0280] Previous current position force Processing power for the range up to the current current position. Here, since tags and words are used as units in S2-13, the force that can be a standard internal dependent boundary candidate for the current position is Alternatively, it is only necessary to judge whether or not it can be a standard-independent boundary candidate. In other cases, the power depends on the type of electronic data. For example, it is necessary to repeat the judgment in the above range in units of one character at a time.

[0281] In S2-11-1 after P11, when the influence determination means 2 uses the current position (possibly in addition to the current position and the position before the current position) as the division boundary, the influence determination means 2 sets the position before and after the division boundary. It is determined whether or not there is an effect of the division on the processing result of the divided data. If it is determined that the effect will occur, the process proceeds to S2—112, and if it is determined that the effect does not occur, the process proceeds to S2—113. Processing proceeds. [0282] Here, if the current position is immediately after the tag, the position immediately before the tag is also regarded as "the position before the current position", and it is determined whether or not the influence occurs. This is because there is a tag that forces a line break at the previous position like the P tag. If the current position is not immediately after the tag! /, Then only the current position should be considered!

[0283] There is no unified judgment method because the influence is varied depending on the type of electronic data and the like. For example, in the case of the HTML data shown in Fig. 4A, one criterion is whether a line break occurs. Here, before the start tag of the P tag, after the end tag of the P tag, and after the br tag, it is assumed that a line break is performed. Judgment is made as a boundary candidate, and other positions are judged as dependency boundary candidates.

[0284] For example, "ku HTML>", "ku font color =" red "size =" +3 ,,> "," How "," dos "," LCD "," works? "," Ku Zfont> ”,“ Ku brZ> ”,“ ku font color = “red” size = “+3”> ”,“ ku P> ”,“: Liquid ”, and“ Crystal ”. There are two locations where no effect occurs after “ku brZ>” and before “ku P>”. All other positions are affected.

[0285] More specifically, a process in which a position where a forced line break is not set is set as a division boundary, and a display layout is generated independently in this order from the divided data before and after generated by division at the division boundary I do. In this case, since the subsequent divided data is laid out from the beginning of the line as a result of the independent processing, the effect of an undesired line feed at the end of the previous divided data appears. Therefore, in the above example, positions other than the two positions after “ku brZ>” and before “ku P>” are determined to be candidate dependency boundaries.

[0286] Since the HTML tag merely serves to declare that the document data is HTML data, it is ignored here and is not considered as a candidate for a division boundary.

[0287] In S2-11-2, the third division boundary extraction means 12 determines the current position (in some cases, moves to the current position, and Position) is set as a candidate for the intra-standard dependence boundary, and the processing exits from S2-11 via P15. Since the current position does not exceed the specified standard data size (S2-5), it is within the standard and has an influence, so it is a candidate for the dependent boundary. [0288] In S2-11-3, it is determined that there is no effect in S2-11-1. In-standard non-dependent boundary extracting means 7 sets the current position (in some cases, (Previous position) is set as a standard-independent boundary candidate, and the processing exits from S2-11 via P15. Since the current position does not exceed the specified standard data size (S2-5), it is within the standard and has no effect, so it is an independent boundary candidate.

[0289] In the processing of S2-11-1 and S2-11-3 described above, the processing of S2-11 in Fig. 24, that is, the previous current position force, within the range up to the current position, the candidate within the standard Alternatively, it is possible to search for a standard-independent boundary candidate and perform a setting process if it exists.

[0290] In S2-112 and S2-113, even if the intra-standard dependent boundary candidate and the intra-standard non-dependent boundary candidate have already been set, the newly determined intra-standard dependent boundary candidate and the intra-standard non-standard Dependent boundary candidate is overwritten. As a result, the effect is obtained that a standard-dependent boundary candidate and a standard-independent non-standard boundary candidate at a position as close as possible to the specified standard data size can be obtained.

[0291] Fig. 26 shows a method of the process of S2-12 in Fig. 24, that is, a process of searching for a non-standard-independent boundary candidate in the range from the previous current position to the current current position and setting it if it exists. It is a flowchart figure explaining.

[0292] In S2-12-1 after P16, when the influence determination means 2 uses the current position (possibly in addition to the current position and the position before the current position) as the division boundary, the influence determination means 2 sets It is determined whether or not there is an effect of the division on the processing result of the divided data. If it is determined that the effect will occur, the processing exits from step S2-12 via P17, and if it is determined that the effect does not occur, step S2-12 — Processing proceeds to 2. The processing of the determination here is the same as the processing of the determination of S2-11-1.

[0293] Note that when it is determined that an effect will occur, a "non-standard dependency boundary candidate" may be used. In many cases, “non-standard dependent boundary candidates” are set here because they are often good from the viewpoint of high-speed processing and resource saving in power processing.

[0294] In S2-12-2, the non-standard-independent boundary extraction means 8 sets the current position (in some cases, the current position and the position before it) as a non-standard-independent boundary candidate, and sets P17 to Then, the process exits from step S2-12. Because the current position exceeds the specified standard data size ( S2-5) Since it is nonstandard and has no effect, it is a candidate for an independent boundary.

[0295] In the above processing from S2-12-1 to S2-12-2, the processing of S2-12 in Fig. 24, that is, the previous current position force, the nonstandard non-standard boundary candidate in the range up to the current position , And if it exists, the setting process can be performed.

[0296] In S2-12-2, if non-standard-independent boundary candidates have already been set, they may be overwritten to set non-standard-independent boundary candidates, but do not overwrite them. Is better

. This has the effect that non-standard-independent boundary candidates at positions as close as possible to the specified standard data size can be obtained.

[0297] In the above-described processing, it is determined whether the data size up to the start position force and the current position of the divided data exceeds the specified standard data size or the specified maximum data size. In addition to the data size, a determination criterion that the range does not exceed a predetermined amount may be used. This is the same as the criterion for increasing the designated standard data size by a predetermined amount and not exceeding it.

[0298] Further, for example, a criterion for determining whether or not the start position force of the divided data also falls within a predetermined amount range before and after the data size force designated standard data size up to the current position may be used. Thereby, there is an advantage that the sizes of the divided data can be easily made uniform. In other words, when the divided data is used, extremely large divided data and extremely small divided data are reduced, so that there is an advantage that the processing amount is leveled.

[0299] (Processing auxiliary data generation processing)

FIG. 27 is a flowchart illustrating a method of the process of S4 in FIG. 23, that is, a process of generating processing auxiliary data using the divided data. Since the actors in each step are all processing auxiliary data generating means 5, the description of the actors is omitted in the description of each step.

[0300] In S4-1 after P30, the first divided data is set as the current divided data, and the process proceeds to S4-2. The current divided data is recorded in the main memory 74, the external memory 75, or the like.

[0301] In S4-2, the current start tag list described below is set as the start tag character string of the current divided data, and the process proceeds to S4-3. [0302] FIG. 28 is an explanatory diagram illustrating the data structure of the current start tag list and the current end tag list. The current start tag list is an array of start tag data (character strings) for which the split data existing before the current split data should also take effect. In addition, since the input / output of start tag data for generating the current start tag list takes the form of first 'in' last 'out, the data structure is a stack structure.

[0303] On the other hand, the end tag list is an array of end tag data (character strings) that is paired with the start tag data that is effective for the current divided data, and has the same data structure as the current start tag list. Is a stack structure.

[0304] Initially, both the current start tag list and the end tag list are empty.

[0305] In order to generate a series of start tag data of the current divided data from the generated current start tag list, the first start tag data of the current start tag list is sequentially connected to the last start tag data, and a character string is formed. Generate it. Since the current start tag list has a stack structure, for example, in the case of the current start tag list shown in FIG. 28, the start tag data 311 and 312 are read in order from the first start tag data 310 at the bottom.

[0306] For example, in the case of the first divided data 400 'shown in FIG. 7A, there is no preceding divided data, so the current start tag list is empty. Therefore, as S42, an empty current start tag list is set as the start tag character string of the divided data 400 ′, so that the start tag character string (the processing auxiliary data 131 in FIG. 29) is an empty character string.

[0307] Start tag data 310-312 in Fig. 28 shows the state of the current start tag list when the process of S4-2 is performed using the divided data 401 'as current divided data. The current start tag list at this time was created when the current divided data was divided data 400. That is, the processing auxiliary data generating means 5 selects start tag data for which the end data is not present in the divided data 400 'as the start tag data from which the divided data 401' should inherit the effect from the divided data 400 '. As a result, the current start tag list for the divided data 400 'is obtained.

[0308] In this manner, the current start tag list for the divided data 400 'connecting the start tag data 310-312 is set to the start tag character string of the divided data 401' that is the current current divided data. The column (processing auxiliary data 133 in Figure 29) Font size = "+ l">".

[0309] In S4-3, the tag in the current divided data is used to update the current start tag list, and

Processing proceeds to 4. The update processing at that time is deletion and addition of start tag data. As additional processing, the current divided data is first "parsed" in order, and when a start tag appears, start tag data is generated from the start tag and the generated start tag data is added to the current start tag list. . Here, “parse” means reading the character string of the current divided data and distinguishing the start tag, end tag, and TEXT.

[0310] In the deletion process, when an end tag appears in the "parse", the last start tag data in the current start tag list is deleted.

[0311] Since the XHTML data and the XML data have the hierarchical structure as described above, the start tag and the end tag always correspond. In addition, if the section of the corresponding start tag and end tag partially overlaps with the section of the other corresponding start tag and end tag, the entire section overlaps, that is, only the inclusion relationship (parent-child relationship) can be obtained. Not to be.

[0312] XHTML data and XML data have the above structure, and since the current start tag list is a stack structure, the start tag corresponding to the end tag that appears in the parse must be added at the end. It should be the start tag data.

[0313] The above-described deletion processing and addition processing are performed at the same time as the parse processing proceeds.

[0314] For example, in the case of the divided data 400 ', if only the tags are extracted, "ku HTML>", "ku font color =" red "size =" +3, >> "," ku Zfont> ", "Ku brZ>", "ku font s ize =" + l ,,> "and" ku P> "are extracted.

[0315] Initially, the current start tag list is empty.

[0316] In this state, first, the start tag of the HTML tag appears, so that start tag data 310 having a start tag character string of "" HTML> "" is generated and added to the current start tag list. The current start tag list at this point is only the start tag data 310.

[0317] Next, since the start tag of the font tag appears, "" font color = "red" size = "+ 3"

> Start tag data 311 having a start tag character string of "" is generated and added to the current start tag list. FIG. 28 shows a state in which the division data 400 'has been processed, and since the deletion processing has been performed, the content of the start tag data 311 differs from the description here. Yes. The current start tag list at this point is the start tag data 310 and 311.

[0318] Next, since the end tag of the font tag appears, the start tag data 311 last added to the current start tag list is deleted. The current start tag list at this point returns to the start tag data 310 only.

[0319] Next, the force that the br tag appears This is an empty tag, and since the start tag and the end tag are put together, nothing is processed here. Addition and deletion may be performed, but the results are the same. The current start tag list at this point is only the start tag data 310.

[0320] Next, since a start tag of a font tag different from the above appears, start tag data 311 having a start tag character string of “ku font size =“ + l ”>” j is generated, and the current start tag is generated. The current start tag list at this point is the start tag data 310 and 311.

[0321] Finally, since the start tag of the P tag appears, start tag data 312 having a start tag character string of ""> is generated and added to the current start tag list. The current start tag list at this point is the start tag data 310, 311 and 312.

[0322] Thus, start tag data 310-312 in Fig. 28 is generated.

[0323] In S4-4, the current end tag list is updated with the tag in the current divided data, and

The process proceeds to 5.

[0324] The processing here is similar to the processing of S4-3, and is the deletion and addition of end tag data.

[0325] In S4-3, when the end tag appears, the force that deleted the last start tag data in the current start tag list Similarly, in S4-4, when the end tag appears, the force in the current end tag list Delete the last end tag data.

[0326] Also, in S4-3, when the start tag appears, the force generated and added to the start tag data having the start tag S4-4 similarly, when the start tag appears, the start tag appears. Generate the corresponding end tag character string, and generate and add end tag data with the end tag character string. The difference is that the end tag string corresponding to the start tag is generated.

[0327] As an example, description will be made using the tag of the divided data 400 'used in S4-3.

[0328] Initially, the current end tag list is empty.

[0329] In this state, first, since the start tag of the HTML tag appears, the corresponding end tag character string “<ZHTML>” ”is generated, and end tag data 320 having the generated end tag character string is generated and added to the current end tag list. The current end tag list at this point is only the end tag data 320.

[0330] Next, since the start tag of the font tag appears, end tag data 321 having an end tag character string of "" Zfont> "" is generated and added to the current end tag list. The current end tag list at this point is the end tag data 320 and 321.

[0331] Next, since the end tag of the font tag appears, the end tag data 321 added last to the current end tag list is deleted. The current end tag list at this point returns to end tag data 320 only.

[0332] Next, the force that the br tag appears This is an empty tag, and since the start tag and the end tag are put together, nothing is processed here. Addition and deletion may be performed, but the results are the same. The current end tag list at this point is only the end tag data 320.

[0333] Next, since the start tag of the font tag different from the above appears, end tag data 321 having an end tag character string of "" is obtained and added to the current end tag list. The current end tag list at this point is the end tag data 320 and 321.

[0334] Finally, since the start tag of the P tag appears, end tag data 312 having an end tag character string of "" ZP> "is generated and added to the current end tag list. At this point, the current end tag list is the end tag data 320, 321 and 322.

[0335] Thus, end tag data 320-322 in Fig. 28 is generated.

[0336] The processing of S4-3 and S4-4 is described here as being parsed separately in order to make the description easier to understand. It is better to perform both processing at the same time with a single parse. Efficient.

[0337] In S4-5, the current end tag list is set to the end tag character string of the current divided data, and the process proceeds to S4-6.

[0338] To generate an end tag character string of the current divided data from the current end tag list, the last end tag data in the current end tag list is generated by connecting the character strings in order up to the first end tag data. Good. Since the current end tag list has a stack structure, for example, in the case of FIG. 28, the end tag data 321 is changed from the last end tag data 322 at the top. , Read in order of 320.

For example, when the current divided data is the first divided data 400, the current end tag list is the end tag data 320-322 in FIG. Therefore, the processing auxiliary data generating means 5 connects the end tag data 322, 321 and 320 in this order, so that the end tag character string (processing auxiliary data 132 in FIG. 29) becomes "<ZP> <Zfont> <ZHTML> ".

[0340] In S4-6, it is determined whether or not the next divided data of the current divided data exists. If it is determined that the data exists, the process proceeds to S4-7. 23) Processing exits.

[0341] In S4-7, the current divided data is set to the next divided data, and the process returns to S4-2.

[0342] Here, to confirm a more specific example, for example, since the divided data 401 '-402' is composed of only plain text data, the divided data 401 '-402' is divided into the current start tag list shown in FIG. There is no start tag added or deleted based on the data 401 '402'. Accordingly, each of the processing auxiliary data 133 and 135 of the divided data 401 'and 402' is composed of only the start tag read from the divided data 400 '.

[0343] The processing auxiliary data 134 and 136 of the divided data 401 'and 402' have the same contents as the processing auxiliary data 132 of the end tag generated from the divided data 400 '.

On the other hand, in the case of the processing auxiliary data 137 related to the start tag of the divided data 403 ′, since the divided data 403 and the end tag of the Ρ tag are read, the タグ tag start tag data 312 is deleted. Also, regarding the processing auxiliary data 138 relating to the end tag of the divided data 403 ′, the end tag data 322 of the Ρ tag is deleted.

[0345] By the above-described processing of S4-1 to S4-7, the processing of S4 in Fig. 23, that is, the processing of generating processing auxiliary data using the divided data can be performed.

[0346] (Dependency Data Generation Process 1)

FIG. 30 is a flowchart illustrating one method of processing of S5 in FIG. 23, that is, a method of generating dependency data using the divided boundary data obtained from each of the means 7, 8, and 10-12. It is. Since the actors in each step are all the dependency data generating means 6, the description of the actors is omitted in the description of each step.

[0347] Here, the influence between the processing results of the divided data depends on the direction in which the display layout is created. Since the direction is from the front to the back of the child data, it affects the direction from the previous divided data to the subsequent divided data. This direction is the most common force. If it is electronic data that affects the direction of the previous divided data, the description here may be reversed. If both directions are possible, both directions may be processed.

[0348] In S5A-1 that has passed through P40, the dependency of the first divided data is set to "independent", the first divided data is set to the current divided data, and the process proceeds to S5A-2. The direction of influence is the direction after the front force, so the first divided data is naturally not affected because there is no preceding divided data.

[0349] The information of "independent" or "dependent" may be recorded as values "0" and "1", for example, as shown in FIG.

[0350] In S5A-2, it is determined whether or not the next divided data of the current divided data exists. If it is determined that the data exists, the process proceeds to S5A-3. Then, the process of S5 (FIG. 23) is exited, and all the processes relating to the data generation method of the present invention are completed.

In S5A-3, the next divided data following the current divided data is set as new current divided data, and the process proceeds to S5A-4.

[0352] In S5A-4, the division boundary between the current divided data and the previous divided data determines whether or not the attribute is "independent". If the attribute is determined to be "independent", the S5A-5 The process proceeds to S5A-6 if it is determined that the condition is not "independent" (that is, "dependent").

[0353] Force that is "independent" Information on whether it is "dependent" can be obtained when creating a division boundary in S2 of FIG. Specifically, in S2-7 in Fig. 24, when the in-standard non-dependent division boundary candidate is set as the division boundary, there is a case where the nonstandard non-independent division boundary candidate is set as the division boundary in S2-10. The attribute of the division boundary is “independent”. On the other hand, in S2-15, if the intra-standard dependent dividing boundary candidate is set as the dividing boundary, the attribute of the dividing boundary is “dependent”.

[0354] Saving of various data generated by the method of the present invention, such as division boundary data, to a file will be described later.

[0355] In S5A-5, the dependency data of the current divided data is set to "independent", The process returns to 2.

[0356] In S5A-6, the dependency data of the current divided data is set to "dependent", and the process returns to S5A-2.

[0357] In the above processing of S5A-1 to S5A-6, the dependency data is generated using the processing of S5 in Fig. 23, that is, the division boundary data obtained from each of the means 7, 8, and 10-12. Processing can be performed.

[0358] In the case of the divided data 400'-405 ', the division boundary between the divided data 401' and the divided data 402 'and the division boundary force between the divided data 402' and the divided data 403 'are not divided by line feed. Therefore, since the attribute is “dependent”, a result like the processing auxiliary data 140 to 145 in FIG. 8 is obtained.

[0359] (Dependency Data Generation Process 1)

FIG. 31 is a flowchart for explaining one method of the process of S5 in FIG. 23, that is, a process of generating another form of dependency data using the divided boundary data obtained from each of the means 7, 8, and 10-12. FIG. As shown in FIG. 9, the dependency data in another form is data indicating the earliest divided data affected by the processing result of the focused divided data.

[0360] Since the operation subject in each step is all the dependency relationship data generation means 6, the description of the operation subject is omitted in the description of each step. Further, regarding the direction of the influence, as in the description of FIG. 30, here, the direction of the divided data after the front force will be described.

[0361] In S5B-1 that has passed through P40, the "first-most dependent divided data" of the first divided data is set in the divided data itself, the first divided data is set in the current divided data, and processing is performed in S5B-2. Advances. In the case of own, the foremost dependent divided data may be a specification in which empty data is used, but in this case, it is assumed that the own is set for the time being.

[0362] In S5B-2, the first divided data is set to "target divided data", and the process proceeds to S5B-3. “Target split data” means the current foremost dependent split data.

[0363] In S5B-3, it is determined whether or not the next divided data of the current divided data exists. If it is determined that the data exists, the process proceeds to S5B-4. To exit the processing of S5, and all the processing ends. The processing here is the same as S5A-2 [0364] In S5B-4, the next divided data following the current divided data is set as new current divided data, and the process proceeds to S5B-5. The processing here is the same as in S5A-3.

[0365] In S5B-5, it is determined whether the attribute of the dividing boundary between the current divided data and the preceding divided data is "independent", and if it is determined to be "independent", the process proceeds to S5B-6. If it is determined that it is not “independent”! / (Ie, “dependent”), the process proceeds to S5B-7. The processing here is the same as for S5A-4.

[0366] In S5B-6, the current divided data is set as the target divided data, and the process proceeds to S5B-7. In other words, in S5B-5, the fact that the dividing boundary between the current divided data and the preceding divided data was determined to be “independent” means that the dependency was reset at the position of this dividing boundary. Therefore, the first dependent divided data of the current divided data is itself.

[0367] When the process proceeds from S5B-5 to S5B-7, that is, when the attribute of the division boundary is "dependent", the foremost dependent divided data remains unchanged and is taken over by the current divided data. Become.

[0368] Therefore, in S5B-7, the foremost dependent divided data of the current divided data is set to the target divided data specified as the foremost dependent divided data at that time, and the process returns to S5B-3.

[0369] In the above processing of S5B-1 to S5B-7, the processing of S5 in Fig. 23, that is, the dependency data of another form is obtained by using the division boundary data obtained from each means 7, 8, 10-12. Can be generated.

[0370] In the case of the divided data 400 '-405', the division boundary between the divided data 401 'and the divided data 402' and the division boundary force between the divided data 402 'and the divided data 403' are not divided by a line feed. Dependency ". Therefore, as shown in the processing auxiliary data 150-155 in FIG. 9, the processing auxiliary data 152 and 153 corresponding to the divided data 402'-403 'point to the previous divided data 401' and the other processing auxiliary data. When the data indicates its own divided data, it becomes a meaningful value.

[0371] (Data recording file format) Next, the divided data, the divided boundary data, the processing auxiliary data, the dependency data, and the like generated by the data generation method of the present invention are actually stored in a main storage in the form of a file or the like.

The format for recording on 74 or external storage 75 will be described.

First, the outline of the relationship between electronic data, division data, division boundary data, and the like will be described. The details of the divided data, the divided boundary data, the processing auxiliary data, the dependency data, and the like, and the file structure will be described later with reference to the drawings.

[0373] As described above, in order to obtain the divided data, the method of extracting the necessary divided data from the electronic data (file) when it is needed using the dividing boundary data, and a method of calculating There are two main methods: one is to record the divided data generated by dividing the electronic data at the data position of the divided boundary in units such as files, and then read the divided data directly from each file.

FIG. 32 is an explanatory diagram illustrating the data structure of a file used in the former method. Here, two files, an electronic data file 100 'and a division boundary data array file 110, are created. In the division boundary data array file 110, division boundary data 111-117 is recorded. The data position of the division boundary of the electronic data file 100 'is obtained from the division boundary data 111-117. That is, by using the division boundary data 111-117, the header data 101 and the division data 400'-405 'can be arbitrarily extracted from the electronic data file 100' as shown in FIG.

[0375] The division boundary data 111 indicates the position of the division boundary between the header data 101 and the division data 400 'in the electronic data file 100'. The division boundary data 112 indicates the position of the division boundary between the division data 400 'and the division data 401' in the electronic data file 100. Similarly, the division boundary data 113-116 represents the position of the corresponding division boundary. The division boundary data 117 indicates the last position of the division data 405 '.

[0376] Note that the file structure in Fig. 32 does not necessarily mean that the file structure must be this structure, but merely shows one of the typical file structures as an example. For example, the necessity of header data in which the header data 101 is arranged before the divided data 400 'is necessary depending on the type of electronic data and the purpose of use. The header data contains the type (format) and version information of the electronic data, how to access various internal data, copyright Information, if encrypted, often includes cryptographic information. Also, if the division data and the division boundary data are not arranged side by side as shown in FIG. 32, the interval is not empty, and the information to know it is header data or division information. There is no problem if you can acquire boundary data.

[0377] As described above, the necessary division data can be obtained in the electronic data file using the division boundary data. In the case of this division data acquisition method, there is an advantage that the electronic data file can be used as it is if the division boundary data is created in a file or the like. For example, when a window as shown in FIG. 3 is called to change the size of the divided data, it is only necessary to recalculate the division boundary data, which is convenient for speeding up the processing.

[0378] Fig. 33 is an explanatory diagram illustrating the file structure of the divided data used in the latter method of obtaining the divided data, that is, the method of directly reading the divided data of each file.

[0379] The header data 101 and the divided data 400'-405 'are recorded as files 120-126, respectively. After that, it is only necessary to obtain information on which divided data corresponds to which file.

[0380] In general, files are often distinguished by file names, and therefore, for example, it is only necessary to obtain the file name of each divided data. In this case, for example, if the file name of each divided data is separately recorded in the file 120 of the header data 101 or the like, a naming rule for the file name may be determined.

[0381] Fig. 34 is an example in which the file name of each file of the divided data is recorded in the XML format. These file names are recorded in the "division data list" portion of FIG. 34, that is, in the hierarchy below the DividedFileList tag. The file name is recorded in the name attribute of the file tag below the DividedFileList tag. The order of the file tags is the order of the divided data.

[0382] In addition, in Fig. 34, the data of the file of each divided data is recorded in the same file as "data of each file". As described above, it may be recorded as an independent file.

As described above, each file can directly read the divided data. Processing that requires processing such as reading some files using the division boundary data is simplified. There are advantages that can be. In addition, in a mode in which the size of the divided data is not frequently changed, it is not necessary to generate the divided data every time the processing result of the display layout or the like is obtained simply by reading the already recorded divided data. Therefore, it is convenient for speeding up the processing.

Next, the details of the divided data, the divided boundary data, the processing auxiliary data, the dependency data, and the like, and the file structure will be described.

[0385] There are various methods and structures for recording in a file, but for example, there is also a viewpoint of writing in text data or writing data in knowledge data. When data is expressed in 8-bit character codes in units of one knot, text data is generally limited to about 100 character codes such as alphanumeric characters and some symbols, and binary data is the remaining characters. It consists of a total of 256 character codes, including (expression Z control codes that cannot be printed).

[0386] Text data has the advantage of being easy to handle because it can be viewed and understood by humans and edited with an editor application or the like. However, since the character codes that can be used are limited, there is also a disadvantage that the data size tends to be larger than binary data when describing the same amount of information. Conversely, knowledge data is difficult to handle, but has the advantage of reducing the data size.

[0387] In the following description, the same information will be shown in both text data and binary data formats.

[0389] Each rectangle in the figure has a number! /, Which is character string data. Here, for the sake of explanation, rectangles with only numerical power are fixed-length numeric data, character strings enclosed by "" "are variable-length character string data, and characters not enclosed by" "and" ". The column is fixed-length character string data, and the data enclosed in parentheses is variable-length binary data.

[0390] Here, a "chunk structure" is used as the file structure of the binary data. A “chunk” is a chunk of data, and usually has a data size of the chunk, an identification character string indicating the type of data, and the like recorded at the beginning. The structure consisting of a collection of chunks Yank structure ". In the following description, “A chunk structure data” may be omitted, and may be referred to as “A chunk data” or “A chunk”.

[0391] Advantages of the chunk structure include faster data access and flexibility in the data structure. For example, to obtain only a certain type of data, the chunk data is checked in order from the beginning. Look at the identification character string described at the beginning of each chunk data. If the data is of the desired type, it is sufficient to read the data size. If it is not the desired type of data, the data size You can skip reading the minute and skip to the next chunk data. As a result, data access to target chunk data is performed at high speed.

[0392] Also, as for the chunk data to be skipped, it is not necessary to know the internal structure of the chunk data, so that the file structure, that is, the structure of all the chunk data cannot be known at all, cannot be processed at all. ! /, Knowing that you can handle only chunk data. Therefore, there is an advantage that the processing can be performed strongly and flexibly against a change in the file structure.

[0393] In the electronic data file in Fig. 36, first, a file identification character string 180 is provided at the beginning. Here, “MAINDATA—VI. 00” is used. Here, “MAINDATA” indicates that this file type is “electronic data”, and “VI.00” means the version of the file structure. Here, the version is included in the identification character string, but may be recorded as numerical data.

[0394] Since the file structure may need to be changed later, flexible processing can be easily performed by including version information that is not limited to the file type. For example, when electronic data with a new version number is compared with a version number for which the processing system knows the file structure, processing can be stopped or the user can be asked whether to continue processing. It becomes.

[0395] After the file identification character string 180, the chunk identification character strings 181 to the encryption information 183 are "encryption information chunks" (chunk data of encryption information). Here, the chunk data has a chunk identification string 181 consisting of a fixed character string of three characters at the beginning, a chunk data size 182 consisting of a 4-byte numeric data capacity, and then an internal data of each chunk. Data follows. Here, the chunk data size represents the size of internal data.

[0396] In the case of an encryption information chunk, the chunk identification character string 181 is "ECP", the chunk data size 182 is "4", and the encryption information 183 that is internal data is a fixed-length character string "NONE". Since the cipher information 183 is a fixed-length character string and the character string length is 4 characters, the chunk data size 182 is “4”. Here, “byte” is used as the unit of the data size.

[0397] The encryption information chunk here indicates information such as the encryption method of the subsequent data. Here, for simplicity of explanation, it is assumed that "NONE", that is, no encryption is performed.

[0398] The file list chunk follows the encryption information chunk. In this example, it is assumed that HTML data is used as electronic data. It is assumed that data such as image data and audio data that are not limited to the HTML data in the text are also required separately. We use file list chunks to indicate the location of these data.

[0399] In the internal data of the file list chunk, the number of lists 186 represents the number of file lists, and thereafter, three data of each file list follow. The file list includes “file position data” and “file name”. "File name" indicates the file name of each data, and "File position data" indicates the position of the data chunk where the data of the file name exists. The “file name” here is the so-called “internal file name” used inside the electronic data.

[0400] Here, there are three internal files, “MAIN.HTML”, “IMAGE1.PNG”, and “SOUN Dl.WAV”, and file data chunks that start at 80th, 875th, and 1034th bytes, respectively. Is recorded in each of the internal files.

[0401] After the file list chunk, the data chunk of each internal file follows. The internal data of the file data chunk is the data of the above three internal files.

[0402] When processing the electronic data shown in Fig. 36, first, the type and version of the file are confirmed by the file identification character string 180, and information such as the encryption method of the subsequent data is obtained by the encryption information chunk. Then, the subsequent data is interpreted according to the encryption method.

[0403] Next, the file list chunk is read and interpreted. For example, suppose you decide that the file at the top of the file list is the main HTML file. And the main HTM Get and read the position of the data chunk in the L file.

[0404] The read HTML file is interpreted and Z-processed. If other internal files become necessary, a file list with a matching internal file name is selected from the file list, the position of the data chunk is obtained and read.

[0405] It is assumed that electronic data is described in this way.

In the present invention, since it is assumed that the electronic data has already been generated, the details will not be described here.

FIG. 35 is an example in which the electronic data of FIG. 36 is expressed in a text format. Although the structure is almost the same as that of Fig. 34, binary data such as IMAGE1.PNG and SOUNDl.WAV is also converted to text format by MIME64 method. Any method other than MIME64 may be used to convert binary data to text format.

[0408] Fig. 37 is an explanatory diagram illustrating an example of a binary file structure when the division boundary data, the processing auxiliary data, and the dependency data are recorded in one file. For the sake of explanation, this file will be called the "auxiliary file".

[0409] "SUBDATA VI.00" indicating that the file is an auxiliary file has a file identification string 1

60!

[0410] Thereafter, a division boundary data chunk, a processing auxiliary data chunk, and a dependency data chunk are recorded.

[0411] In the division boundary data chunk, division boundary data 111-117 and division data sizes 163-168 are recorded as internal data as numerical data. Here, an example of the division boundary data of the division data 400'-405 'in FIG. 7A is shown. The number of divided data is 6, but the number of divided boundaries is 7 including the first and last boundaries.

[0412] In the processing auxiliary data chunk, processing auxiliary data 131-142 of a variable-length character string is recorded.

[0413] In the dependency data chunk, dependency data 140'-145 'is recorded as numerical data.

[0414] It is assumed that the processing system that reads and interprets this auxiliary file knows these data chunk structures in advance. [0415] A method of creating data of the file structure of the auxiliary file will be briefly described.

[0416] First, the file identification character string 160 is a fixed-length character string, and therefore does not require processing such as calculation or conversion, and may be recorded as it is.

[0417] Next, regarding the division boundary data chunk, the first chunk identification character string 161 is also a fixed-length character string, and may be recorded as it is.

[0418] The next chunk data size 162 needs to be calculated and obtained. Division boundary data 11

Assuming that each one of 117 and the divided data size of 163-168 are recorded as 4-byte numerical data, the chunk data size 162 is "52" from 4 X (7 + 6) = 52.

[0419] Subsequent internal boundary data, divided boundary data 111-117, and a divided data size of 163—

168 are recorded as 4-byte numerical data.

[0420] Thereby, the division boundary data chunk portion is recorded.

Next, the processing auxiliary data chunk is recorded. Since the first chunk identification character string 169 is also a fixed-length character string, it should be recorded as it is.

[0422] The next chunk data size 162 needs to be calculated and obtained. Since the processing auxiliary data 13 1-1 142 has already been determined, the sum of the data sizes is obtained. It is assumed that a variable-length character string is added with a character code having a value “0” at the end. For example, as in the processing auxiliary data 131, at least one byte is required even if the character string is empty. Since the sum of the data sizes of the variable-length character strings is "175", the chunk data size 162 is recorded as "175".

[0423] Processing auxiliary data 131-142, which is internal data thereafter, is recorded as variable-length character strings.

Next, the dependency data chunk is recorded. Since the first chunk identification character string 171 is also a fixed-length character string, it should be recorded as it is.

[0425] The next chunk data size 172 needs to be calculated. Dependency data 14

0 and 1 145 are each recorded as 1-byte numeric data, and IX 6 = 1, so the chunk data size 172 is “6”.

[0426] Dependency data 140'—145 ', which is internal data thereafter, is a 1-byte number each. Record as character data.

[0427] Through the above processing, the auxiliary file having the file structure shown in Fig. 37 can be recorded.

[0428] Fig. 38 is an explanatory diagram illustrating an example of a file structure of a file in which substantially the same information as in Fig. 37 is described in a text format. For the sake of explanation, this file will also be called the "auxiliary file".

[0429] Here, the text format is described using the XML format. The first line mainly declares that it is in XML format, so we will not explain it in detail here.

[0430] The whole is surrounded by the SubData tags on the second and last lines, indicating that it is an auxiliary file. Version information is indicated by a version attribute.

[0431] The division boundary data, the processing auxiliary data, and the dependency data are described in the "h boundaries tag, assist-data tag, and dependency-data tag of the SubData tag. These tags collect information. In this sense, it can be considered to correspond to the data chunk described above.

[0432] Below the boundaries tag of the division boundary data, there is a boundary tag representing each division boundary data. The boundary position in the electronic data is indicated by the pos attribute of the boundary tag. Here, information on the data size of each divided data is omitted.

[0433] Below the assist-data tag of the processing auxiliary data, there is a data tag representing the processing auxiliary data of each divided data. Below the data tag, there are a start-tag tag indicating a start tag character string and an end-tag tag indicating an end character string. The TEXT of the start-tag tag and end-tag tag is the start tag character string and end tag character string itself.

[0434] Under the dependency-data tag of the dependency data, there is a data tag representing dependency data of each divided data. The data tag is a flag attribute and holds the value of dependency data (here, 0 or 1).

[0435] As to the method of creating the auxiliary file in the format of Fig. 38, the data of the tag hierarchy as described above is recorded in order, and only the data is recorded.

When creating the auxiliary file having the chunk data structure in FIG. 37, it is necessary to calculate the data size of the internal data of the chunk data. However, when creating the XML-format auxiliary file shown in Fig. 38, it is not necessary to calculate the data size of each tag hierarchy. is there. This is because a break in data can be identified by a start tag and an end tag.

[0437] Regardless of the chunk data structure or the XML format, the data structure of unknown data, that is, the data of unknown chunk data having a chunk identification character string or the data of unknown tag name tag is ignored. Or interrupt the process. However, since the XML format is easier for humans to understand directly, it is possible to guess the data content to some extent even with unknown tags, and to ignore unknown data or suspend processing. There is an advantage that the guess is used for the judgment, or the processing method inside the processing device is added or changed based on the guess.

[0438] Next, an example of a file structure when each of the divided data is recorded as a file as shown in Fig. 33 will be described.

[0439] First, each divided data is recorded as a file as the divided data 400'-405 'in FIG. 7A, and the processing auxiliary data is read from another file card and used. , One 405, and the ability to record as a file in a form that also includes processing auxiliary data.

[0440] As for the method of recording each of the divided data 400'-405 'as a file,

, There is no particular explanation.

[0441] Fig. 39 is an explanatory diagram showing the contents of each file when the divided data 400'-405 'is recorded as a file including processing auxiliary data. Split data 400'—405 '

1S respectively correspond to files 410-415.

[0442] When creating each file, record the start tag character string that each divided data should take over.

Then, each divided data is recorded, and finally, an end tag character string corresponding to the recorded start tag character string is recorded.

[0443] For example, in the case of the file 411 corresponding to the divided data 401 ', "kuHTML> <Ρ> "of the processing auxiliary data 133 in FIG. 29 is used as the start tag character string. First recorded, then the divided data 401 'from "Liquid" to "passed" are recorded, and finally, the processing auxiliary data 134 "ku ZP> </ HTML> is recorded! To

[0444] Note that the processing auxiliary data and the divided data are recorded as they are here, but other information , And may be recorded in another format, for example, the format shown in FIG. 36 described above, or in an XML format!

[0445] Fig. 40 is an explanatory diagram illustrating the file structure of a file in which one divided data file is recorded in the XML format. Below the DividedData tag indicating that the data is divided data, there are an encryption tag for encryption information that is additional information and a contents tag that is the content of the divided data. In the TEXT part of the contents tag, the text of one of the divided data 400'-405 in Fig. 7A and the file 410-415 in Fig. 39 may be described.

[0446] In the XML format, the symbol used for the tag (for example, "<") cannot be directly described in the TEXT part. Therefore, a predetermined conversion determined in the XML format (for example, "&It;"), and perform the reverse conversion when reading.

[0447] It is also possible to record the same contents in a binary format as shown in FIG. 36, which is converted into a text format as shown in FIG.

(Example of data use)

A process of generating a display layout of a portion corresponding to desired divided data using the divided data, processing auxiliary data, and dependency data generated as described above will be specifically described.

FIG. 11 is a flowchart showing an example of processing for generating and displaying a display layout as an example using data such as division boundary data, division data, processing auxiliary data, and dependency data. In addition, since the subject of the processing in each of the following steps is the CPU 70 as the display layout generating means (not shown), the description of the subject of the operation is omitted in the following description.

First, in step SL1 (hereinafter, “step SL” is abbreviated as “3”), processing auxiliary data, dependency data, and the like are obtained, and the process proceeds to SL2. If division boundary data is used, also obtain division boundary data. It is assumed that the processing auxiliary data, the dependency data, and the division boundary data are recorded as files in the external storage 75, for example. Therefore, the CPU 70 can read necessary data from the external storage 75 or the like when necessary. [0450] In SL2, the display range specified according to the program or user input, that is, the position and size of the display range is obtained, and the process proceeds to SL3. This processing will be described later with a specific example.

In SL3, the divided data including the position of the display range is obtained, set as the current divided data, and the process proceeds to SL4. This process will be described later with a specific example.

[0452] In SL4, the display layout of the current divided data is determined as to whether it is necessary, and if it is determined to be necessary, the connection point PL10 (hereinafter, "connection point 1 ^" is abbreviated as "1 ^"). After that, the process proceeds to SL5, and if it is determined that it is not necessary, the process proceeds to SL8 because the display layout corresponding to the display range has been obtained by the process after SL5 as described later. .

[0453] Whether the display layout of the divided data is necessary is determined based on whether the display layout of the divided data is included in the display range. Since each display layout element has information on the position and size, it can be determined by comparing the position and size with the position and size of the display range. In a specific example to be described later, whether or not it is included will be described using a drawing. However, in actual processing, calculation and determination are performed using values of position and size.

[0454] In SL5, the display layout of the current divided data is obtained in consideration of the influence of the other divided data, and the processing advances to SL6 via PL20. Details of the processing here will be described later with reference to FIGS.

[0455] In SL6, it is determined whether or not the divided data before the current divided data exists, and if it exists, the process proceeds to SL7; otherwise, the process proceeds to SL8.

[0456] In SL7, the current divided data is set to the previous divided data, and the process returns to SL4.

[0457] In SL6 and SL7, both "previous divided data" and "next divided data" may be referred to as "next divided data". This may be determined according to the purpose of the processing, such as the force of turning a page forward or the force of turning a page next. Which one to use will be described in a specific example of processing.

[0458] In SL8, the display layout included in the display range is extracted from the display layout of each of the obtained divided data, displayed on the display unit / tablet 301, and the process ends.

[0459] The display layout of the display range is generated and displayed by the above processing of SL1 to SL8. be able to.

FIG. 12 is a flowchart illustrating an example of the processing method of SL5 in FIG. 11, that is, an example of a processing method of acquiring the display layout of the current divided data in consideration of the influence of other divided data.

[0461] In SL5A-1 after passing through PL10, the display layout of the current divided data is acquired, and the process proceeds to SL5A-2.

[0462] As the current divided data, as described with reference to Fig. 33, a divided data dolphin filtered can also be obtained. Alternatively, as described with reference to FIG. 32, the electronic data file strength can also be obtained by extracting and reading the divided data portion using the divided boundary data.

[0463] The display layout of the divided data is used if it already exists, and is generated from the divided data if it does not exist. The generated display layout may be recorded in the main memory 74 or the external memory 75 in association with the divided data.

[0464] Divided data strength When generating a display layout, processing auxiliary data is used. For example, the information shown in FIG. 29 is not enough to obtain the same display result (FIG. 5A) as the display result (FIG. 5A) of the original electronic data (FIG. 4A) specified by the tag for the divided data 401 ′ in FIG. 7A. In this way, it is assumed that the start tag character string and the end tag character string of the divided data 401 'are prepared as the processing auxiliary data 133 and 134, respectively. In this case, when interpreting the divided data 401 ′, first, the start tag character string of the processing auxiliary data 133 is interpreted, then the divided data 401 ′ is interpreted, and finally, the end tag character string of the processing auxiliary data 134 is interpreted. Interpret. As a result, the divided data 401 'which is incomplete HTML data can be interpreted as ヽ HTML data in which the content of the divided data is not impaired.

[0465] Note that the method of generating the display layout for the divided data force is not directly related to the present invention, and thus the detailed description is omitted.

[0466] In SL5A-2, it is determined whether the display layout of the divided data immediately before the current divided data is necessary for the specified display range. If it is determined that the display layout is necessary, the process proceeds to SL5A-3, and the processing is performed. If not, the process exits to PL20. The processing here is the same as the processing of SL4. [0467] In SL5A-3, it is determined whether or not the current divided data is affected by the immediately preceding divided data. If it is determined that the current divided data is affected, the process proceeds to SL5A-4, and the processing is affected. If it is determined that there is no processing, the processing exits to PL20. The determination as to whether or not it is affected may be made by referring to the dependency data 140'-145 'in FIG.

[0468] When the generated current divided data is generated under the influence of the immediately preceding divided data, the process may be exited to the PL20. Such a judgment can be made by separately recording whether or not the data is generated under the influence of the immediately preceding divided data. By making this determination, useless regeneration can be avoided.

In SL5A-4, the display layout of the divided data immediately before the current divided data is obtained in consideration of the influence of other divided data, and the process proceeds to SL5A-5.

[0470] The process of "acquiring the display layout of the current divided data in consideration of the influence of other divided data" is equivalent to the entire SL5 process. Therefore, in this case, the current divided data is temporarily set to the immediately preceding divided data, the processing of SL5 is performed recursively, and after the recursive processing of SL5, the temporary setting data of the current divided data may be reset to the original setting. "Recursive" refers to calling (performing) its own process in a process. In other words, the processing form is nested.

[0471] In SL5A-5, the display layout of the current divided data is generated following the display layout of the immediately preceding divided data, and the processing exits to the PL20.

[0472] The generation following the display layout means that, for example, when the display layout of the previous divided data ends in the middle of the row, the first display layout of the next divided data ends in the middle. In other words, the layout is to be added to the line, in other words, a plurality of divided data affected by the division is treated as a series of data, and a display layout as a processing result is generated. This will be described later with a specific example.

[0473] With the above processing of SL5A-1 to SL5A-5, the processing of SL5 in Fig. 11 can be performed.

[0474] The above processing of SL1 to SL8 will be specifically described below using the divided data 400'-405 '(Fig. 7A) and the dependency data 140'-145' (Fig. 8).

[0475] FIG. 13 shows one page from the top of the document data on the display / tablet 301 in FIG. FIG. 4 is an explanatory diagram illustrating a state in which a display layout has been obtained. The frame in FIG. 13 indicates the display range of the display unit / tablet 301. The size of this display range is hereinafter referred to as “one page”. In FIG. 13, the display layout that extends beyond the frame is not actually displayed. This is a method of such expression in order to explain the relationship between the generated display layout and the display layout to be displayed (display layout in the display range). The numbers to the left of the frame are line numbers used for explanation.

First, in SL1 in FIG. 11, the dependency data in FIG. 8, the processing auxiliary data in FIG. 29, and the like are obtained for all the divided data 400 ′ to 405 ′.

Next, the position and size of the display range are obtained by SL2. Since the document data is displayed from the beginning, the position of the display range is the first display layout of the electronic data. The size of the display area is one page.

[0478] In SL3, since the divided data including the first display layout is the first divided data,

, Set the divided data 400 'as the current divided data.

[0479] In SL4, there is no display layout yet, and the display layout of the divided data 400 'is inevitably included in the display range. Therefore, it is determined that the divided data 400' is necessary here. Processing proceeds to SL5.

[0480] In SL5, the display layout of the divided data 400 is acquired in consideration of the influence.

[0481] First, the display layout of the divided data 400 is acquired by SL5A-1 in FIG. Since the display layout has not been generated yet, it will be generated here. The generated display layout is the first “How does LCD works?” Line in Figure 13 and the next blank line.

[0482] In SL5A-2, there is no divided data immediately before the divided data 400 '! Therefore, the processing is skipped from SL5A-2 to PL20, and the processing proceeds to SL6.

[0483] Since the divided data 401 'exists as the "next" divided data of the divided data 400' in SL6, the process proceeds to SL7.

[0484] Here, in the processing of SL6 and SL7, processing is performed on the "next" divided data that is not the "previous" divided data. This is because the display range is "one page from the beginning". In other words, the first display layout of the document data is located at the upper end of the display range. This is because a display layout for one page is required below, so it is necessary to obtain the display layout in the forward direction (next direction) from the first divided data.

In SL7, the “next” divided data, divided data 401, is set as the current divided data, and the process returns to SL4.

[0486] In SL4, it is determined whether or not the display layout of the divided data 401 'is necessary. Judgment is also made by calculating the size of the display range and the display layout, etc., but as shown in Fig. 13, the above two lines are less than one page. Therefore, here, the generated display layout is less than the display range, so it is determined that the display layout of the divided data 401 ′ is necessary.

In SL5, the display layout of the divided data 401 is acquired in consideration of the influence.

[0488] For this purpose, first, the display layout of the divided data 401 is acquired by SL5A-1 in FIG. Since the display layout has not been generated yet, it will be generated here. The generated display layout is from the line starting with "Liquid Crystal" on the third line in Fig. 13 to the line ending with "passed" on the sixth line.

[0489] Since the divided data 400 'immediately before the divided data 401' is required in SL5A-2, SL5A-

The process proceeds to 3.

[0490] In SL5A-3, the divided data 401 'is not affected by the immediately preceding divided data 400'! This means that the processing auxiliary data 141 is 0, so processing is performed from SL5A-3 to PL20. Is missing and the process proceeds to SL6.

[0491] Since the divided data 402 'exists in the divided data next to the divided data 401 in SL6, the process proceeds to SL7.

[0492] In SL7, the next divided data 402 'is set as the current divided data, and the process returns to SL4.

[0493] In SL4, it is determined whether or not a display layout of the divided data 402 'is necessary. As can be seen from FIG. 13, the running force starting with “passed” included in the divided data 401 ′ is already out of the display range, so the divided data 402 ′ is determined to be unnecessary here, and is processed to SL8. The process goes on. [0494] The display layout of the display range in FIG. 13 is displayed on SL8, and the process ends.

[0495] As shown in FIG. 13, the display result has no problem as the display layout result. By processing only the divided data necessary to display the display range, the entire electronic data 406 is processed and the display layout is created.In the case of FIG. 13, the data processing amount is about 1Z3. Done. As a result, the amount of memory required for processing can be reduced. In this way, processing by using the divided data has the advantage that processing can be performed at high speed and with resource saving.

[0496] FIG. 14 is an explanatory diagram illustrating a state in which a display layout of a display range for one page is obtained below the state of FIG. Processing for obtaining the display layout in FIG. 14 will be briefly described.

Since processing is performed following the state of FIG. 13, it is assumed that the display layout generated in FIG. 13, that is, the display layout of the divided data 400 ′ and 401 ′ is maintained.

[0498] In SL2, since the fifth line is displayed in Fig. 13, the display layout of the sixth line, which is the last line starting with "passed", is the position of the display range.

[0499] The existence of the dependency data is effective when the layout of the previous divided data is not created when the divided data affected by the previous divided data is created. In the processing of FIG. 14, since the layout of the divided data before being affected has already been created, the subsequent processing will be briefly described.

First, a display layout of the divided data 401 is obtained, and a display layout of the divided data 402 is generated. Since this is generated following the display layout of the divided data 401 ′, the first “through the” of the divided data 402 is laid out after “passed” on the sixth line in FIG. Similarly, the display layout of the divided data 403 'is generated following the display layout of the divided data 402'.

[0501] Then, a display layout is generated in the order of the divided data 404 'and 405'. The generated layout is as shown in Fig.14. The sixth to fourteenth lines in FIG. 14 are displayed as the display range.

[0502] The above is the description of the process of turning pages in the forward direction (downward, next direction). The process of performing line scrolling in the reverse direction (upward, forward) will be described below. [0503] FIG. 15 is an explanatory diagram illustrating a state in which a display layout of a display range for one page has been obtained from the beginning of divided data 405 'to the bottom. In the state where there is no display layout in which the divided data has already been generated, the independent processing is performed on the divided data 405 ′. Therefore, in the state of FIG. 15, only the display layout of the divided data 405 exists. The process for obtaining the layout in FIG. 15 is the same as that in FIG. 13 except for the position of the display range, and thus the description is omitted here.

[0504] FIG. 16 is an explanatory diagram illustrating a state where the line is scrolled upward by one line from the state of FIG. A display layout (only one blank line) for the divided data 404 'is added to the divided data 405'.

[0505] FIG. 17B is an explanatory diagram illustrating a state in which one line has been scrolled further upward from the state of FIG. The display layout of the divided data 403 '(from the first line where the "on" force starts, to the fourth line ending with remployed.) Is added to the divided data 404' -405 '.

[0506] The divided data 403 'is composed of a force starting with a word in the middle of the sentence "on". The display layout itself (that is, employed. And line feed) of the divided data 403' in the display range is not particularly problematic. Not appearing. That is, the display layout of the divided data 403 'is the same as the case where the display setting is changed and the line is wrapped before “on” in one sentence, and the HTML such as the line feed is used. Follow the tags! /

FIG. 18A is an explanatory diagram illustrating a state in which the line is scrolled upward by five lines from the state of FIG. 17B. Since the processing here involves the influence between the divided data, the processing will be described in some detail in accordance with the flowcharts of FIGS.

First, from the state in FIG. 17B, when an instruction to turn a page to the previous page is input, the flow in FIG. 11 is restarted. Here, since the processing auxiliary data and the dependency data have already been acquired, SL1 is skipped and the processing proceeds to SL2.

[0509] In SL2, in the case of FIG. 18A, the display range is one page above the last row of the divided data 405 '.

[0510] In SL3, the divided data 405 'is set as the current divided data, and the process proceeds to SL4.

[0511] Thereafter, processing is performed with SL4 and SL5, a display layout in which the divided data 405 'has been generated is obtained, and the processing proceeds to SL6.

[0512] In SL6, the divided data 404 'exists as "before" the divided data of the divided data 405. Therefore, the "previous" divided data 404 'is set as the current divided data in SL7, and the process returns to SL4.

[0513] Here, in the processing of SL6 and SL7, processing is performed on the "previous" divided data that is not the "next" divided data. This is because the display range is set to "one page above the certain power". In other words, the display layout of a certain row is located at the lower end of the display range, and a display layout of one page is required above it. It is necessary to process to acquire the display layout in the forward direction).

[0514] In this way, while the current divided data is set to the previous divided data one by one, the repetition processing of SL4 and SL7 is performed, and the generated display layout of the divided data 404 'is obtained.

[0515] It is assumed that the divided data 403 'is about to be processed in SL5 as current divided data.

[0516] In SL5A-1 (divided data 403,), the generated display layout of divided data 403, is obtained, and the process proceeds to SL5A-2 (divided data 403 '). The parentheses after each step sign indicate the current divided data. When recursive processing is described later, it is added to make it easy to distinguish what the current split data is.

[0517] In SL5A-2 (divided data 403 '), it is determined that the immediately preceding divided data 402' is necessary, and the process proceeds to SL5A-3 (divided data 403 '). Since the row is scrolled up by about five rows from the state of FIG. 17B, it can be seen from FIG. 17B that the display layout of the divided data 403 ′ alone is not enough for the display range.

[0518] In SL5A-3 (split data 403 '), it can be seen that the value of the dependency data 143' is 1 because the split data 403 'is affected by the split data 402'. Proceed to the divided data 403 ′).

[0519] In the SL5A-4 (divided data 403,), the display layout of the divided data 402 'is acquired by taking the divided data 402, temporarily as current divided data, taking into account the influence of other divided data.

[0520] After that, SL5A-4 (split data 403 ') force is also called recursively. (Step 402 ′).

[0521] In SL5A-1 (divided data 402 '), the display layout of the divided data 402' is obtained, and the process proceeds to SL5A-2 (divided data 402 '). Since the display layout of the divided data 402 does not yet exist, the display layout of the divided data 402 'is generated alone here.

[0522] The generated display layout ranges from the first line starting with rthroughj to the fourth line based on "based". In FIG. 18A, the state after all the processing is completed, so the first “on the broadcast of divided data 403, is connected by the fourth line. At this point, the layout of the generated four lines is And it exists as a form inserted above the first line in Fig. 17B.In other words, there is nothing after “based” in the fourth line, as if the power had been broken. Let's say

[0523] In the SL5A-2 (divided data 402 '), it is determined that the immediately preceding divided data 401' is not necessary for the display range, and the processing of the SL5 (divided data 402 ') is exited via the PL20. — 5 (divided data 403,) The processing proceeds (see the description of recursive processing below). The sufficient display range up to the display layout of the divided data 402 'can be visually confirmed from FIG. 18A. Since it is determined that the divided data 401 'is unnecessary, there is no need to consider the influence of the divided data 401' when acquiring the display layout of the divided data 402 '. Therefore, the display layout of the separately generated divided data 402 ′ is used as it is later. Further, as described in SL5A-1 (divided data 402 ′), “based” and “on the broad castj are The force of splitting into separate lines Later this line should be merged, so it can be one line smaller than the current display layout size, so here is It is better to make a judgment with a little extra time.

[0524] After the display layout of the divided data 403 is discarded in the SL5A-5 (the divided data 403,), the display layout of the divided data 403 'is regenerated following the display layout of the divided data 402', The processing advances to SL6 (divided data 403 ') via PL20. Here, the display layout shown in Fig. 17B of the portion corresponding to the line beginning with "on the broadcast" to the line ending with "employed." Is discarded, and "on" is added after "based" in the fourth line of Fig. 18A. The characters after t he broadcasts are laid out again, resulting in the display layout of Figure 18A. [0525] Since the previous divided data 402 'exists in SL6 (divided data 403'), processing proceeds with SL7 and SL4 (divided data 402 '), but the display range is already satisfied at this point. Therefore, it is determined by SL4 (divided data 402 ') that the divided data 402' is not necessary. As a result, the process proceeds to SL8, the display range in FIG. 18A is displayed on SL8, and the display process ends.

[0526] Regarding the above processing, in order to make the recursive processing in SL5 particularly easy to understand, the processing procedure is summarized as follows.

[0527] SL5A-1 (split data 403,)

I

SL5A-2 (split data 403,)

I

SL5A-3 (split data 403,)

I

SL5A-4 (split data 403 ')

I (Start recursive processing)

SL5A-1 (split data 402 ')

I

SL5A-2 (split data 402 ')

I (end of recursion)

SL5A-5 (split data 403,)

In FIG. 18A, the divided data 402 ′ starts with a word in the middle of the sentence “through”, but there is no particular problem with the display layout of the divided data 402 ′ as in FIG. 17B. In FIG. 18A, a sentence that has been divided between the divided data 402 ′ and the divided data 403 is laid out without error as a continuous sentence as a result of considering the influence of the division.

When FIG. 17B and FIG. 18A are compared, for example, the fourth line in FIG. 17B and the seventh line of “employe d.” In FIG. 18A have different end positions. However, neither of them has any problem in displaying HTML.

[0529] As a comparison, the layout of the divided data 403 'is not generated again as in the present invention, but FIG. 19A is a state force obtained by simply performing the process of inserting the layout of the split data 402 before the layout of the split data 403. The “based” on the fourth line, which is the last layout of the divided data 402, and the “on” force on the fifth line, which is the first layout of the divided data 403, are originally connected as shown in FIG. 18A. Instead, they are on separate lines. Just looking at Figure 19A, it looks like there is a line break after “based” on the fourth line. This is an incorrect processing result because it does not exist at this place.

[0530] As described above, by processing the minimum necessary number of divided data in consideration of the influence between the divided data, the advantage of the processing of the divided data, which can be processed at high speed and with resource saving, can be minimized. . Furthermore, even if the processing results of the divided data influence each other, various effects can be obtained such that the processing results of the divided data can be processed so as not to deteriorate the connection.

[0531] FIG. 20 is an explanatory diagram illustrating a state where the line is scrolled three lines further upward from the state of FIG. 18A.

[0532] Except for setting the current divided data to the divided data 404 'in SL3, the description of the processing in FIG. Since the processing after SL5A-2 (divided data 402 ') is different, the subsequent processing will be described.

[0533] In SL5A-2 (divided data 402 '), it is determined that the immediately preceding divided data 401' is necessary for the current display range, and the process proceeds to SL5A-3 (divided data 402 '). The state shown in FIG. 18A Since the line scrolls up by about three lines, it can be visually confirmed from FIG. 18A that the display layout of the divided data 402 ′ alone is not enough for the display range.

In SL5A-3 (split data 402 ′), it can be seen from the dependency data 142 ′ that the value of the split data 402 ′ is affected by the split data 401 ′. The process proceeds to the divided data 402 ').

[0535] In the SL5A-4 (divided data 402,), the display layout is acquired in consideration of the influence of other divided data, assuming that the divided data 401, is the current divided data.

[0536] The processing of SL5A-4 (divided data 402 ') is a process of SL5 (divided data 401') called recursively. [0537] The display layout of the divided data 401 'is acquired by SL5A-1 (divided data 401'), and the process proceeds to SL5A-2 (divided data 401 '). Since the display layout of the divided data 401 'does not yet exist, it is generated here.

[0538] The generated display layout is from the first line starting with "Liquid" to the "pas sed" on the fourth line in FIG. In FIG. 20, the row of “passed” is different from the row of “through” in the first row of FIG. 18A, similar to the processing in FIG. 18A described above.

[0539] Since it is determined that the immediately preceding divided data 400 'is not necessary in SL5A-2 (divided data 401'), the processing of the SL5 (divided data 401 ') is passed through the PL20 and SL5A-5 ( The process proceeds to the divided data 402 '). It can be confirmed from FIG. 20 that the display range is sufficient if the display layout of the divided data 401 ′ is acquired.

[0540] After the display layout of the divided data 402, is destroyed in the SL5A-5 (divided data 402,), it is generated, and the processing of the SL5 (divided data 402,) is passed through the PL20. The process proceeds to (divided data 403 '). Here, the display layout of the divided data 402 ′ shown in FIG. 18A in the portion corresponding to the line starting from “through” to “based” is discarded, and after “passed” on the fourth line in FIG. , And the subsequent divided data 402, are relayed. As a result, the display layout shown in FIG. 20 is obtained.

[0541] Thereafter, the divided data 402 and the divided data 401 are used as the current divided data, and the processing of SL4-SL7 is repeated, and the processing proceeds to SL8. Since the generated display layout of the divided data 402 'is generated under the influence of the divided data 401, the processing exits from 31 ^ 5-8-3 (divided data 402') to the PL20. Therefore, unnecessary regeneration of the divided data 402 ′ can be avoided.

[0542] There is no particular problem in the display layout itself in FIG. 20 as in FIGS. 17B and 18A.

In FIG. 20, the sentence that is divided between the divided data 401 and the divided data 402 and between the divided data 402 and the divided data 403 is also connected and laid out in FIG.

As described above, by performing the processing while going back in consideration of the influence between the divided data, even if a plurality of the divided data are continuously affected, the connection of the processing result of each divided data does not deteriorate.

V, the effect can be processed as follows.

[0544] Next, Fig. 21 shows the processing method of SL5 in Fig. 11, that is, the display layout of the current divided data. FIG. 21 is a flowchart illustrating another example of a processing method for obtaining an out-of-out considering the influence of other divided data.

[0545] In the SL5B-1 that has passed through the PL10, the process proceeds to the SL5B-2 in order to find the earliest divided data that affects the current divided data. The first split data is the dependency data in Fig. 9.

See 0-155.

[0546] In SL5B-2, a display layout is generated by regarding the data from the foremost divided data to the current divided data as continuous data, and the processing exits to the PL20. If there is a display layout already generated, there is no need to generate one.

[0547] With the processing of SL5B-1 to SL5B-2, the processing of SL5 in Fig. 11 can be performed.

[0548] A specific example using the divided data 400'-405 'and the dependency data 150-155 will be described using the processing of the flowchart in Fig. 21.

[0549] It is assumed that the same state and display range as in Fig. 17B, that is, the display range in a state where the line is scrolled one line further upward from the state in Fig. 16 are obtained. At this time, the power to explain the state of the display layout finally required is shown in FIG.

[0550] In the SL5B-1 (divided data 403,), the first divided data affecting the divided data 403, is understood from the dependency relationship data 153 to be the divided data 401 '.

[0551] Note that even with the dependency data in the format of Fig. 8, it is possible to obtain the divided data that is the earliest influencing data. Going forward from the corresponding dependency data and finding the dependency data that first becomes 0, the split data corresponding to the dependency data becomes the first split data that has an effect.

[0552] The display layout is generated in the order of the divided data 401, -402 ', and 403 in the SL5B-2 (divided data 403,). However, the divided data 402 'and 403' are generated in a form following the display layout of the previous divided data.

[0553] The display layout of Fig. 22 is obtained by the above processing from SL5B-1 to SL5B-2. There is no particular problem with the display layout in Fig. 22.

[0554] Here, the difference between the method of the flowchart of FIG. 12 and the method of the flowchart of FIG. 21 will be described. [0555] FIGS. 17B, 18A, and 20 using the method of the flowchart of FIG. 12 show that the display layout changes when the position of the display range is changed upward. For example, the first “on” on the first line in FIG. 17B is the third word on the fourth line in FIG. 18A. In addition, the first “through” on the first line in FIG. 18A is the second word on the fourth line in FIG. Such a change would make it difficult for the reader to follow the sentence, as the result would be a slight change in the part of the line that had been read.

[0556] On the other hand, when the method of the flowchart of Fig. 21 is used, the display layout does not change even if the position of the display range is changed upward from the state of Fig. 22. It always has the same display layout as in Figure 5A.

[0557] The difference between the two methods is that the check target of the divided data that affects the divided data within the display range is limited to the divided data that is at least partially included in the display range, or is not related to the display range. This is the difference in the power of all the divided data up to the last divided data affected.

[0558] The former method does not generate a display layout of the divided data outside the display range, and thus has an advantage that the amount of data processing when the display layout of the display range is generated for the first time can be suppressed. However, if the display range is changed, the display layout may change.If the display range is changed, the generated display layout will be discarded and re-generated! There are also two drawbacks in that they may.

[0559] Conversely, the latter method generates a display layout even outside the display range, and thus has a disadvantage that the amount of data processing when the display layout of the display range is generated for the first time may increase. However, the point that the display layout does not change even if the display range is changed, and that if the generated display layout is discarded and re-generated even if the display range is changed, unnecessary processing does not occur. There are also two advantages.

[0560] Which method to use may be selected in consideration of the operating environment and purpose, such as whether to emphasize high-speed or resource saving or to keep the display unchanged.

[0561] The use examples of the divided data, the divided boundary data, the processing auxiliary data, and the dependency data have been described above.

[0562] Finally, the methods described above are not limited to the combinations described here. Any combination is possible.

[0563] The difference in the processing method between the data generated by the present invention and, for example, MPEG format data will be described.

[0564] In the present invention, "Even if processed alone, there is no error in the processing result of itself,

Is targeted. For the sake of explanation, the divided data defined above will be hereinafter referred to as “partial data”.

[0565] The MPEG GOP described above is data obtained by dividing electronic data into a plurality of pieces, and is data that can be processed independently, and thus corresponds to "partial data" in the present invention. However, the restored image frame that is the processing result of the GOP of the MPEG always has the same result.

[0566] Also, the restoration result of the previous GOP is not affected by the restoration result of the previous GOP. Therefore, to obtain the restoration results of multiple GOPs, simply combine the restoration results of the previous GOP and the next GOP! / ,.

[0567] On the other hand, HTML data given as an example in the present invention is a language specification designed on the assumption that the display result changes depending on the display setting of the WWW browser. That is, as long as the logical meaning of the display result (for example, forced line break or the wraparound of characters in the image) does not change even if the display setting is changed, the content of the divided data means no matter what display is performed. Is not impaired.

[0568] In the case of partial data of HTML data, the processing result of the previous partial data may logically affect the processing result of the next partial data. For example, the original electronic data is divided into partial data at places other than the line feed tag. Therefore, simply joining the processing result of the next partial data to the processing result of the previous partial data may change the logical meaning as a whole, and the meaning of the divided data may be lost. (See Figures 19A and 19B).

That is, when handling partial data, it is necessary to change the processing method as in the usage example described in the present invention in accordance with the characteristics of the data. The present invention pays particular attention to the influence of the processing result between partial data, and generates data so as to obtain a processing result in which the meaning of the divided data is not impaired.

[0570] Also, the GOP of MPEG has a structure such as a hierarchical structure using HTML data tags. Another difference is that they can be processed without using auxiliary information on their structure.

[0571] Note that if the difference image in the GOP is considered as partial data, the image frame cannot be restored only with the difference image that appears to be affected by the preceding and following partial data. Since it is not, it is not partial data. If the reference image and the related difference image are added as auxiliary information, it is not impossible to regard it as partial data, but the one with such auxiliary information is the same as the GOP. The reason explained for the difference from the GOP, such as the same result, always applies, and is again different from the partial data targeted by the present invention.

[0572] The data generation method according to the present invention must be applied to the above-mentioned divided data in order to independently process the divided data and obtain a correct processing result with respect to the division boundary for dividing the electronic data into a plurality of divided data. A processing auxiliary data generating step of generating processing auxiliary data, which is insufficient information, from the divided data and other divided data, and a correct processing result can be obtained even if a set of the divided data and the processing auxiliary data is processed alone. In addition, a division boundary that satisfies the condition that the data size of the division data does not exceed the specified maximum data size is obtained, and the processing result of the division data before the division boundary is satisfied while satisfying the above conditions. If there is a division boundary that does not affect the processing result of the subsequent division data, the division boundary calculation step for giving priority to the division boundary and the division boundary calculation step power A divided data generating step of dividing the electronic data at the divided boundary to generate the divided data.

[0573] Other features of the present invention will be summarized below.

(a) In the data generation method according to the present invention, when the above-mentioned standard-independent division boundary does not exist, the division boundary smaller than a predetermined maximum data size and in which the influence of the division does not appear is defined as a non-standard non-standard division boundary. The method further comprises a nonstandard non-dependent boundary extraction step of extracting as a dependent division boundary.

In the above configuration, in the case where the above-mentioned standard-independent division boundary does not exist !, the condition of the data size of the partial data is relaxed. That is, a condition that the data size of the partial data is larger than the standard data size and equal to or smaller than the maximum data size is set. Of that data size Within the range, a division boundary where the influence of division does not appear is extracted.

[0575] As a result, it is possible to obtain an appropriate processing result in which the influence of the division does not appear, and it is also possible to suppress the data size of the partial data within an allowable range, thereby preventing the effects of high speed and resource saving from being reduced. The effect comes out.

[0576] The "maximum data size" is, like the standard data size, a predetermined value, a certain value is a value to be input by a user or the like, or a value obtained by a predetermined calculation method. Normally, the maximum data size is set to the maximum allowable data size for partial data. This is preferably determined by the user or the like in accordance with the processing capacity of the processing device and the purpose of the processing.

[0577] The outline of the process of generating the partial data is similar to the operation of first using the intra-standard independent boundary extraction step, in which the division boundaries are sequentially obtained and the generation of the partial data is repeated. However, since the process of setting the division boundary used to generate the partial data differs, only the processing part will be further described.

[0578] First, a division boundary is determined in the standard-independent boundary extraction step.

[0579] If a standard-independent division boundary is obtained in the standard-independent boundary extraction step

, And set the standard-independent division boundary as the division boundary used to generate the partial data. If multiple intra-standard independent boundaries are determined, one of them is selected in some way and set as the next division boundary.

[0580] If the dividing boundary cannot be obtained in the standard-independent boundary extraction step, the process proceeds to the non-standard-independent boundary extraction step, and the results of the partial data size determination step and the influence determination step are used. Find a division boundary where the data size is less than or equal to the maximum data size and the above-mentioned effects do not appear. The processing of the partial data size determination step is the same as the processing described above, except that “standard data size” is changed to “maximum data size”.

[0581] If a division boundary satisfying the above conditions is found in the non-standard independent boundary extraction step, the division boundary is extracted as a non-standard independent division boundary and set as a division boundary used to generate partial data. .

[0582] If no non-standard independent boundaries are found, a new partitioning boundary can be found. Just move on to the other steps!

[0583] The above process is a process of setting a division boundary used to generate partial data.

[0584] As a result, even when a non-standard independent division boundary cannot be extracted, if there is a non-standard independent division boundary, the processing time of each partial data and necessary resources can be reduced to an ideal range if possible. If this is not possible within the standard data size, it will be easier to keep it within the allowable range (maximum data size). The advantages of keeping the data size of the partial data as small as possible are the same as the advantages described above for the intra-standard independent boundary extraction step.

(b) In order to solve the above-mentioned problem, the data generation method according to the present invention provides a standard-independent division boundary at a data position closest to the standard data size among the obtained standard-independent division boundaries. The method further comprises a first division boundary extraction step of extracting

[0585] The outline of the operation of the present invention is as follows. The outline of the process of generating partial data is similar to the operation using the standard-independent boundary extraction step, in which division boundaries are obtained in order. Repeat generating data. However, since the process of setting the division boundary used to generate the partial data differs, only the processing part will be described.

[0586] First, a division boundary is determined in the standard-independent boundary extraction step. This is the process already described.

[0587] If only one intra-standard independent division boundary is obtained in the intra-standard independent boundary extraction step, the intra-standard independent division boundary is used as a division boundary used to generate partial data. Set.

[0588] If a plurality of non-standard-independent boundaries are obtained, a non-standard-independent boundary that is closest to the standard data size is extracted in the first division boundary extraction step, and the next division is performed. Set as a boundary.

[0589] If the division boundary cannot be obtained in the intra-standard independent boundary extraction step, the process may be shifted to another step for obtaining a new division boundary.

[0590] The above process is a process of setting a division boundary used to generate partial data.

[0591] As a result, partial data that is as close to the standard data size as possible at the Since data can be divided by data size, the number of small data sizes tends to decrease within the standard data size. A decrease in the number of small data sizes means a decrease in the number of partial data. By processing part of the electronic data as partial data, it is possible to save memory and process at high speed. If the number of partial data increases too much, the memory and memory required to manage it Since the number of processing and auxiliary information increases, the advantage is negated. Set the standard data size to an appropriate value according to the content and purpose of the electronic data so that the number of partial data does not increase too much so that the advantage and the gap of the disadvantages are maximized. The effect that can be done comes out.

[0592] Also, the size of the partial data to be processed can be easily adjusted to the vicinity of the standard data size. For example, when processing a part of the electronic data, it is possible to select any part, that is, which part Even if you select the data, the time until the processing result is obtained is even! This is effective when you do not want the processing time of the partial data to vary as much as possible.

(c) In order to solve the above-mentioned problem, the data generation method according to the present invention provides a non-standard independent division boundary at a data position closest to the standard data size among the obtained non-standard independent division boundaries. The method further comprises a second division boundary extraction step of extracting

In the above configuration, the same effect can be obtained because the standard-independent division boundary in the first division boundary setting step described above is merely replaced with the non-standard-independent division boundary.

[0594] Even at non-standard independent division boundaries, data can be divided by the partial data size as close as possible to the standard data size, so large data sizes can be obtained between the standard data size and the maximum data size. The number of sizes tends to decrease. Decreasing the number of large data sizes increases the effect of memory-saving and high-speed processing.

(d) In order to solve the above-mentioned problem, the data generation method according to the present invention does not include the above-mentioned standard-independent division boundary and the above-mentioned non-standard-independent division boundary! The method further comprises a third division boundary extraction step of extracting a division boundary at a data position not exceeding. [0595] According to the above configuration, the original electronic data has neither a standard-independent division boundary nor a non-standard-independent division boundary. In other words, there is no division boundary that can generate partial data that has a data size that does not exceed the maximum data size and is not affected by division.

[0596] In such a case, it is allowed that the effect of division, which is not to relax the data size condition to further increase the maximum data size, appears in the processing result.

[0597] Instead, a division boundary at a data position that does not exceed the maximum data size is extracted.

[0598] Thus, in any case, the data size of the partial data can be suppressed within the maximum data size. Once the upper limit of the data size of the partial data is determined, the upper limit of the memory and processing resources required to process the partial data is determined, so there is no need to prepare extra memory or processing resources. come.

[0599] At the same time, since the upper limit of the processing time is also determined, there is an advantage that real-time processing is slow. Another advantage is that the processing wait time of the user can be kept within a certain time.

[0600] However, in the third division boundary setting step, the division boundary may be set at the data position closest to the standard data size. As a result, the effects of increasing the processing speed and saving resources can be optimized, and furthermore, the processing time of each partial data and the value of the required resource can be brought close to a desired range.

(e) In order to solve the above problems, the data generation method according to the present invention divides the electronic data at the extracted division boundary to generate divided data, Is characterized by further comprising a processing auxiliary data generation step of generating processing auxiliary data, which is information that is insufficient information to be used as partial data, from the focused divided data and other divided data.

[0601] "Processing auxiliary data" is information that is insufficient for the divided data in order to process the divided data independently and obtain a processing result that does not impair the meaning of the divided data.

[0602] For example, information to take over the effect of the previous divided data, information to be processed by the subsequent divided data, and certain data that are commonly related to the processing results of a plurality of divided data (eg, , Control code, etc.). [0603] As an example, when the electronic data is HTML data, if a start tag exists in the previous divided data and an end tag corresponding to the start tag exists after the divided data, the start tag is used. Corresponds to the processing auxiliary data.

[0604] In other words, the effect of the start tag in the previous divided data originally extends to the subsequent divided data, but as a result of the division, when the subsequent divided data is processed independently, the start tag Is not read, and the processing result does not show the effect of the start tag. Eventually, the division generates divided data that does not result in the intended processing result. Therefore, by combining the start tag as processing auxiliary data for the subsequent divided data, the original processing result can be obtained even if the subsequent divided data is independently processed.

[0605] The processing auxiliary data and the divided data are not necessarily required to be recorded as integral data, and may be recorded in a dispersed manner. For example, it is acceptable to record the data in a form such as a file in which only the processing auxiliary data is collected, or to add the processing auxiliary data to the end of the electronic data.

[0606] The processing auxiliary data and the divided data are generally created in advance, but can be dynamically generated at the time of use.

[0607] However, in the case where data that is commonly required by each set of the divided data and the processing auxiliary data exists in the electronic data, the necessary data is copied to each divided data (or the processing auxiliary data). By distributing, it is possible to obtain a processing result that does not impair the contents of the divided data by itself. However, this would increase the data size of each divided data (or processing auxiliary data). Therefore, even if a shared part other than the divided data (or processing auxiliary data) is used, it is regarded as “processed with partial data”. To be

[0608] Examples of commonly required data include so-called header information such as the type and version information of electronic data, copyright information, and encryption information.

[0609] The outline of the operation of the present invention is as follows. The outline of the process of generating partial data is the same as that described earlier for the operation using the standard-independent boundary extraction step and the non-standard-independent boundary extraction step. , Are sequentially obtained, and the generation of partial data is repeated. Since partial data is generated as a set of divided data and processing auxiliary data, processing auxiliary data generation Only the process of generating the processing auxiliary data in the steps will be described.

[0610] It is also possible to generate partial data after generating all the divided data instead of generating partial data each time one divided data is generated. Which method is better depends on the type of electronic data and the purpose of use. If the later divided data is also needed to generate the processing auxiliary data, the latter method is easier to process.

[0611] Here, it is assumed that the processing auxiliary data is generated for the divided data of the electronic data in the HTML format so that the description can be easily explained. In the case of data in HTML format, the applicable range of the tag is indicated by a start tag and an end tag. Start tags and end tags generally have a one-to-one correspondence.

[0612] When the HTML format data is divided at the division boundary, the start tag and the end tag may be divided into different division data. In this case, there may be divided data that does not include the start tag or the end tag, or both, even though the data is within the applicable range of the tag. For those divided data, the processing result when processed alone is not correct because the tag cannot be interpreted correctly. Therefore, divided data alone cannot be used as partial data.

[0613] Therefore, in the processing auxiliary data generation step, start tags and end tags that are insufficient for the divided data as partial data are generated as processing auxiliary data.

[0614] As a method of extracting the start tag and the end tag that are insufficient for the divided data as the partial data, for example, the divided data is also sequentially looked at for the first divided data, and the correspondence between the start tag and the end tag is taken. If the end tag corresponding to the start tag appearing in a certain divided data does not exist in the divided data, the end tag corresponding to the divided data is insufficient. Therefore, the corresponding end tag is included in the processing auxiliary data of the divided data.

In addition, since the start tag is insufficient for the next divided data, the start tag is added to the processing auxiliary data of the divided data.

[0615] If there is one or more divided data between the divided data including the start tag and the corresponding divided data including the end tag, the divided data between them is sufficient for both the start tag and the end tag. Therefore, both tags are added to the processing auxiliary data.

[0616] The processing auxiliary data (start tag in this example) obtained from the previous divided data and the subsequent It is convenient to separately record the processing auxiliary data (the end tag in this example) from which the divided data power is also obtained when processing as partial data later.

[0617] Through the above processing, processing auxiliary data can be generated.

[0618] When processing the partial data, the processing is performed using the divided data and the processing auxiliary data.

For example, in the case of the example of HTML data, if the processing data for the start tag that is insufficient for the divided data is read first, then the divided data, and finally the processing auxiliary data for the end tag that is missing for the divided data, then , Can be handled as partial data. As described above, when generating the processing auxiliary data, the processing auxiliary data obtained from the previous divided data (the start tag in this example) and the processing auxiliary data obtained from the subsequent divided data (the end tag in this example). ) May be easier to process.

[0619] As a result, since partial data can be handled as a set of divided data and processing auxiliary data without directly creating partial data, electronic data that cannot be generated by simply dividing divided data alone can not be generated. However, there is an advantage that it can be handled as partial data by using the processing auxiliary data.

[0620] The advantage obtained by recording the processing auxiliary data separately from the electronic data is the same as the advantage obtained by recording the divided data separately from the electronic data as division boundary information.

(D The data generation method according to the present invention has a dependency data generation step of generating dependency data, which is information indicating that there is a dependency between the processing results of the partial data, in order to solve the above problem. It is characterized by the following.

[0621] "Dependency" is a relationship that indicates which partial data has an effect on the processing result.

[0622] Like the processing auxiliary data, the "dependency data" may be added to the electronic data, or may be recorded in a format such as a file independent of the electronic data.

[0623] An outline of the operation of the present invention is as follows. First, whether or not there is an influence between the processing results of partial data is determined if the division boundary is a standard-independent division boundary or a non-standard-independent division boundary. It is judged that there is no effect on the division boundary before and after the boundary, and if neither the standard-independent division boundary nor the non-standard-independent division boundary, the division boundary before and after that division boundary is determined. Is determined to have an effect.

[0624] The dividing boundary is neither a standard-independent nor a non-standard-independent dividing boundary! At this time, the only way to determine whether or not there is any impact is to determine the type of electronic data and the position of the dividing boundary in the dependency data generation step. For example, in the case of HTML data, if there is a division boundary before and after a tag indicating a line break, such as a br tag or a p tag, it can be determined that there is no effect. When a position such as the middle of a word is used as the division boundary, it can be determined that there is an effect.

[0625] From this determination, it is determined whether there is an effect between any of the partial data and the partial data. This information may be generated as dependency data in the dependency data generation step.

[0626] The generated dependency data is used when processing the partial data. Dependency data does not need to be used when the processing result of each partial data is used alone, but when multiple processing results of each partial data are used together, dependency data is used. Then, it is necessary to process in consideration of the dependency.

[0627] Specifically, the affected partial data is processed first, and subsequently the affected partial data is processed in consideration of the influence.

[0628] For example, in the case of the above-described HTML data, if the middle of a word or the like is a division boundary, the previous partial data is processed first, and the layout data of the previous partial data is obtained. The layout data is up to the first half of the word. Next, the subsequent partial data is processed by being added to the layout data of the previous partial data. In this case, the state “considering the influence” means “add”, ie, laying out the last character of the existing layout data. The first half of the word, which is the last layout data of the previous partial data, and the second half of the word, the first layout data of the subsequent partial data, are connected to form layout data that is continuous as one word. Become.

[0629] If the subsequent partial data is generated in a "not considering influence" state, the latter half of the word, which is the first layout data of the subsequent partial data, is laid out at the beginning of the line. It is problematic to see only the processing result of the subsequent partial data alone, but when combined with the processing result of the previous partial data, it looks as if a line break is inserted in the middle of the word. Since the original electronic data does not include line break tags, this is incorrect as a whole. Result.

[0630] As described above, by processing a plurality of partial data using the information as to whether or not there is an effect, an effect is obtained in which the processing result itself can be made free from errors. From a different perspective, it can be said that by using dependency data, a plurality of partial data can be treated as one large partial data.

[0631] It is not impossible to determine whether or not there is an effect by looking at the contents of the partial data. However, if the information is summarized as dependency data, the information as to whether or not there is an effect can be determined in advance. The effect can be obtained quickly.

[0632] Note that the configuration described as the present invention can be combined with the respective configurations described as the above invention as needed.

(g) In the data generation method according to the present invention, in order to solve the above-described problem, in the dependency data generation step, partial data for which dependency data is to be generated is set immediately before or immediately after each partial data. One ヽ is characterized by both partial data.

[0633] As described above, when processing the partial data in consideration of the influence, the partial data that is affected is processed first, and the partial data that is affected later is considered in consideration of the influence. To process.

[0634] At this time, the processing varies depending on the extent to which partial data to be affected is searched. When searching for only the partial data immediately before or immediately after, focus on V, the partial data and the immediately preceding partial data should generate dependency data from the effect between the immediate and both partial data. That is enough.

[0635] The information directly obtained at the time of obtaining the division boundary is whether or not there is an effect between two adjacent partial data. Therefore, the dependency data on the immediately preceding or next partial data or both partial data is obtained at the time of obtaining the division boundary. Has the effect of being easy to generate.

(h) In the data generation method according to the present invention, in the dependency data generation step,

Alternatively, the information for specifying the partial data before or after which the processing result of the partial data depends, or both, may be the dependency data!

[0636] As described above, when processing the partial data in consideration of the influence, the partial data that is affected is processed first, and the partial data that is affected later is considered in consideration of the influence. To process.

[0637] At that time, the processing varies depending on the extent to which the partial data to be affected is searched. If the processing result of the partial data depends first, is the last, and if both of the partial data are to be searched, some processing is required.

[0638] To explain the outline of the operation of the present invention, the information obtained when obtaining the division boundary is whether or not there is an effect between two adjacent partial data. For the first or last data affected, the affected partial data is sequentially added in the forward or backward direction, and the process is continued until there is no affected partial data. The last affected partial data is the first or last partial data for a certain partial data. The front or the last is determined by the direction (forward direction Z reverse direction).

[0639] The foremost found! / And the last are! /, The information for specifying both partial data is generated as dependency data by the dependency data generation step.

[0640] If the processing result of the focused partial data depends on the first, last, or both partial data, the partial data strength at the front can be processed collectively up to the focused partial data, or the focused partial data strength can be determined. It is possible to process up to partial data at once, or to process the last partial data at once. As a result, the same processing result as when processing the entire electronic data is always obtained.

[0641] On the other hand, if the processing result is generated halfway from the front or the end, the processing result itself does not lose the meaning of the partial data, but it does not inherit the effect from the front or the last. The processing result is different from the case where the entire electronic data is processed. In this case, if the processing result of the data above the middle part is made to be the same as the processing result of the middle part below, the connection in the middle part will be powerful. In order to prevent this, there is a drawback that the lower processing result must be recreated from the middle.

[0642] If the dependency data generated by the present invention is used, the same processing result as when processing the entire electronic data is always obtained, so it is not necessary to re-create the processing result once created. . [0643] Note that it is possible to obtain the last or both partial data for the first, the last, and the affected data without using the dependency data that has the information on the first, last, or both of the affected data. .

[0644] For example, if there is information on whether or not each partial data is affected by the previous or next partial data or both of them, the dependency data of the first or last partial data affected by the present invention is generated. By performing the same processing as the processing, it is easier to find.

[0645] However, in that case, the processing time is time-consuming, so that the processing time can be saved by previously obtaining the partial data before or after being affected, or both. .

[0646] Further, in the data generation method according to the present invention, the electronic data is document data capable of generating a different display layout depending on display settings, and the processing of the partial data generates a display layout of the partial data. It may be characterized in that it is a process.

[0647] As described above, one of the advantages of processing using partial data is that when only a part of the processing result of electronic data is to be obtained, only the relevant partial data needs to be processed, so that high-speed processing is possible. , And can be processed with reduced resources. "

[0648] As electronic data that can easily bring about this advantage, electronic data that can be used in many cases, such as viewing only a part of the processing result of electronic data, can be considered.

[0649] For example, in a book, there are many usage forms in which a desired page is opened by looking at a table of contents or an index, and reading is started next time with a bookmark in between. The electronic version of a book is "document data," and the document data is used in the same way as a paper book.

[0650] Therefore, as in the present invention, the document data is an electronic data that has the advantage that if only a part of the processing result of the electronic data can be processed with high speed and resource saving using the partial data. .

[0651] The document data can generate different display layouts depending on the display settings. In addition, depending on the position of the boundary for dividing the document data, the display layout may be affected by division or may not be possible! /, It also has features.

[0652] That is, in the case of document data in which different display layouts can be generated depending on display settings, For example, it is typical to display HTML data on a WWW browser. Even if the display layout changes depending on the display settings, there is no inconvenience. Therefore, even if the position of the dividing boundary is not necessarily a good cut, or a place (for example, before or after a line feed), the user does not feel that the display layout of the partial data alone is powerful, so the partial data Able to obtain error-free processing results. On the other hand, if the document data is divided at a poorly cut place, the processing result will be affected between the partial data before and after the document data.

[0653] On the other hand, in the present invention, the processing result is not affected between partial data, such as the processing relating to the independent division boundary candidate, and such a device is incorporated. The effect of the present invention is particularly effective for document data which can be generated and whose processing is generation of a display layout.

(0) The data generation program according to the present invention is characterized by causing a computer to function as each unit included in the data generation device in order to solve the above problems.

[0654] Further, in order to solve the above-described problems, a data generation program according to the present invention causes a computer to execute each step of the data generation method.

[0655] In order to solve the above problems, a recording medium according to the present invention is characterized by recording the data generation program.

[0656] Thus, by installing the data generation program on a general computer via the recording medium or the network, the data generation method is realized using the computer. A computer can be operated as a data generation device.

[0657] The invention described above is not limited to the combinations described here, but can be any combination.

[0658] (Second embodiment)

Hereinafter, a second embodiment of the present invention will be described with reference to the drawings.

[0659] (Definition of terms)

First, the definition of words is explained.

[0660] "Data obtained by dividing electronic data into a plurality of pieces" means that electronic data is smaller than its size. Data that is divided into different sizes (hereinafter referred to as division sizes). Hereinafter, small-size data obtained by simply dividing electronic data is referred to as divided data as described above.

[0661] For example, FIG. 7B shows an example of a division method when the whole of other HTML data as electronic data is divided into nine division data. As can be seen from FIG. 7B, there is no overlapping part or missing part between the divided data. The division size is not always fixed and may be various.

[0662] In general, it is advantageous to process divided data at high speed and with resource saving if the division size is set to a size that is easy to handle in the assumed usage environment. If the division size is too large, there is a problem that the processing speed becomes slow or a large amount of resources are required. On the other hand, if the size is too small, there is a problem that the number of processes for managing the divided data increases and the management information and the like expand. In order to determine an appropriate division size, for example, the user can determine a time during which processing can be allowed to wait, and use the amount of data that can be processed within that time in an assumed usage environment as a guide.

In addition, if an outline of an appropriate size is determined, it is often determined from the contents of the electronic data which of the divided positions of the divided data is located before or after the appropriate size. For example, in the case of an electronic book, a division position is determined based on a unit such as a noragraph, or a line feed is determined as a division position.

[0663] Note that the divided data is not necessarily generated by dividing a continuous chunk of data part in the electronic data, and may be divided into discrete parts. The part is divided, and it is easier to handle.

[0664] The definition of "there is no error in the processing result itself when processed alone" is as described in (First Embodiment).

An object of the present invention is to prevent an error as shown in FIG. 19B from appearing in a processing result when original data is divided and processed.

[0666] "Data having no error in the processing result itself when processed alone" means that a predetermined process is performed using only the data without using the data other than the data, and thus the processing result is obtained. Data that does not show errors. In the present invention, such data is referred to as “partial data” or “block data”. In the following, we use the term "partial data" The

That is, the “partial data” is “data obtained by dividing the original electronic data into a plurality of pieces and having no error in the processing result itself when processed independently”.

In the example of FIG. 7B, the nine divided data are referred to as partial data 400 to 408. The reason why such data can be called will be described later in detail.

[0669] It should be noted that the partial data has an order, and is relatively referred to as "previous partial data" or "next partial data". This order is based on the processing order of the partial data when the processing result obtained by processing each partial data in order considering whether or not the above error appears appears matches the processing result obtained when the entire electronic data is collectively processed. is there. Incidentally, the processing order often corresponds to the order of the position of the partial data in the electronic data.

[0670] When a plurality of pieces of divided data are present in electronic data that is required in common, if the required data is copied and distributed to each piece of divided data, it can be processed independently. However, in that case, the data size of the divided data becomes large, so that commonly needed data may be shared. In other words, it is defined that the divided data does not overlap each other, but if there is a purpose such as data sharing, overlapping is allowed.

[0671] Or, as for the data as the shared part, if any of the divided data is processed, if the storage capacity of the shared part is assumed to be read in advance, the divided data with that premise can be processed alone. With data.

[0672] Examples of commonly required data include so-called header information such as the type and version information of electronic data, copyright information, and encryption information.

[0673] At this time, if data that is required in common is used and the processing result itself when the divided data is independently processed does not show an error, the divided data is required in common It can be regarded as partial data together with the data.

[0674] Further, the partial data may be structured, for example, into main data and sub data, and the sub data may be configured to assist processing of the main data. Further, the main data and the sub data may be stored in different storage areas in association with each other. Such sub-data will be described in detail later.For example, information to take over the effect of the previous divided data, information to be processed by the subsequent divided data, or Specific data (for example, a control code or the like) commonly associated with the processing result of a plurality of divided data is an example of the sub data.

The partial data 400-408 in FIG. 7B actually corresponds to the main data, and corresponds to the processing auxiliary data 100-108, 600-608 shown in FIG. 43 or FIG. This will be described later in detail.

[0676] Since the partial data and the processing result of the partial data correspond to each other, in the following description, the term "partial data" may be used including the meaning of the processing result. For example, the expression “the partial data A affects the partial data B” may be omitted, and the expression “the partial data A affects the partial data B” may be omitted.

[0677] The "desired partial data" obtained the processing result! /, Which is the partial data The desired partial data is not limited to one partial data, but may be plural. For example, when a display result as shown in FIG. 42 is obtained, all of the partial data required to obtain such a display result is the desired partial data.

[0678] The meaning and specific examples of "influence" are as described in (First Embodiment).

[0679] Next, "predetermined processing (using partial data)" generally refers to processing for obtaining some output using electronic data as input data, although the processing differs depending on the type and purpose of electronic data. For example, in the case of HTML data, the display layout is calculated by analyzing the HTML data.

[0680] "Process first" means, in terms of the processing order, processing the partial data detected to affect the processing result of the desired partial data, and then taking over the effect ( Next, it means to process the desired partial data.

[0681] The "partial data in the desired partial data" means that there are a plurality of desired partial data, and some of them are partial data units, and is a unit of partial data. It does not mean that the partial data is further divided data.

[0682] The "desired processing range" means a range of electronic data for which an output result is to be obtained, and is specified by some index. For example, in document data, “from what line to what line”, a certain ある is “from what character to what character” or “from what percentage to what percentage of the whole” Specify the processing range of. [0683] In addition to specifying the start point and end point of the range, there is also a method of specifying a reference point and a range around the reference point. For example, it is possible to specify “how many lines and how many lines”, or “from what line to the range displayed on the display means (the number of dots, etc.)”. The reference point and the range need not be the unit of the processing result (such as “line”) as long as the processing range can be finally specified. For example, the reference point may be “data at the head of any number of electronic data (or partial data)”.

[0684] The meanings of "processing auxiliary data", "hierarchical structure", "hierarchical structure of start position", "display layout", "display setting", "line", and "head of line" are as described in the first embodiment. It is.

[0685] In general, it is often sufficient to judge whether a "line including a display layout of desired partial data" is only the first line generated from the desired partial data.

[0686] In the case of a display layout element managed separately from a row, when the display range of the row of the partial data to be detected is extended in the row direction (vertical for vertical rows, horizontal for horizontal rows), The effect is determined based on whether it overlaps the display range of the display layout element to be managed.

[0687] "Calculate the display layout also for the line ending force" is to calculate the display position of the new display layout element so as to arrange the new display layout element following the display layout element at the end of the line. is there. Usually, a new display layout element is often arranged next to the display layout element at the end of the line.

[0688] In the following description, "electronic data" will be referred to as "document data whose display layout changes depending on the display settings" and "processing result" will be referred to as "display layout" in order to make the description concrete and easy to understand. Although the description will be replaced, the flow of processing such as the flowchart of the basic part in FIG. 49 described later can be performed in almost the same manner even if the electronic data and the processing result are replaced as before.

[0689] (Data and data structures)

Next, various data and their data structure related to the present invention are shown in FIG. 4B, which has already been described based on FIG. 4A in (First Embodiment) and will not be described.

[0690] The IMG tag shown in line 28 of Fig. 4B represents an illustration, the src attribute specifies the image file name of the illustration, etc., and the align attribute specifies how to display the illustration and TEXT (illustration Wraparound image force). In the IMG tag in Figure 4B, the image file The name is TFT.png and align is right. Right means that the illustration is placed on the right end and the TEXT is laid out around it. In FIG. 5B, the rows with the illustrations are laid out such that the width of the rows is reduced by the amount of the illustrations.

[0691] FIG. 7B is an explanatory diagram illustrating an example of partial data obtained by dividing the HTML data of FIG. 4B. HTML data is divided into nine parts, 400-408. However, in the case of HTML data, the start tag and end tag that make up various tags are often separated into different partial data by division. Strict data containing only the start tag or only the end tag is not a partial data but strictly a mere divided data because the tag does not function by itself. The reason is that partial data is data that can be processed and obtained without any loss of the meaning of the data.

[0692] Nevertheless, the partial data 400-408 is called partial data because it is premised that data (described later) that assists the processing of the partial data 400-408 is read at the time of processing. As a result, as a result, the partial data 400 to 408 are treated as data from which a processing result can be obtained without impairing the meaning of the data even when processed alone.

[0693] Note that the method of dividing the electronic data is not the gist of the present invention, and thus a detailed description of the specific processing procedure is omitted here, and the partial data divided as shown in FIG. It is assumed that it is prepared.

[0694] Fig. 43 is an explanatory diagram illustrating an example of the data structure of processing auxiliary data that assists processing of partial data 400 to 408. It is assumed that the processing auxiliary data 100 to 108 correspond to the partial data 400 to 408 in FIG. 7B, respectively. It is assumed that the processing auxiliary data 100-108 is managed in the form of an array and can be accessed by an index number or the like.

As shown in FIG. 43, the processing auxiliary data includes “start byte”, “byte size”, “presence / absence of influence”, “start tag auxiliary information”, and “end tag auxiliary information”. The “start byte” indicates how many bytes (the zero force is counted) the leading data of the original document data is located at the leading byte of the original document data. “Byte size” indicates the data size of each partial data in bytes. Note that, for example, a unit of characters may be used instead of a byte unit, but in many cases, a byte unit is more convenient for reading data.

[0696] "Presence / absence of influence" focuses on the processing result of partial data. Information about whether or not to receive For example, when the processing auxiliary data 102 is taken as an example, the “presence / absence” is “presence”, so that attention is paid to the fact that the partial data 402 is affected by the power of other partial data (specifically, the immediately preceding partial data). Represents This will be further described later in connection with the description of the flowcharts in FIGS. 50 and 51.

[0697] "Start tag auxiliary information" and "end tag auxiliary information" are information that assists information on the hierarchical structure of tags. Its role is not to interpret the entire document data from the beginning to the end, but to interpret each partial data independently so that the same processing result as interpreting the entire document data to the beginning and end can be obtained. That is. Here, information constituted by a character string of a start tag or an end tag is referred to as “start tag auxiliary information” or “end tag auxiliary information”.

[0698] Regarding the start tag auxiliary information, if the combination of the corresponding start tag and end tag exists in the gap of the previous partial data existing before the partial data, Since the hierarchy to which the tag and the end tag belong does not directly affect the hierarchical structure of the corresponding partial data, it generally does not affect the start tag auxiliary information.

[0699] On the other hand, when only the start tag exists in the previous partial data and the corresponding end tag does not exist in the previous partial data, attention is paid below the hierarchy to which the start tag and the end tag belong. This means that the hierarchical structure of the partial data that belongs to it belongs, so information that supplements the meaning is included in the start tag auxiliary information. That is, the start tag auxiliary information is information indicating that the start tag whose effect is continuing exists in the previous partial data, and more specifically, the start tag whose effect is continuing.

As shown in FIG. 7B and FIG. 43, for example, since the partial data 400 is the leading partial data, there is no start tag auxiliary information of the processing auxiliary data 100.

[0701] Regarding the partial data 401, the previous partial data is the partial data 400. The font tag and the br tag in the partial data 400 are the force that the pair of the corresponding start tag and end tag exists in the partial data 400. The HTML tag is only the start tag (the first line) and the end tag ( (Line 45) does not exist in the partial data 400. Accordingly, the start tag auxiliary information of the processing auxiliary data 101 is “kuHTML>”, which is a start tag that is in effect.

[0702] Similarly, regarding the partial data 402, the previous partial data are the partial data 400 and 401. The validity of the start tag <HTML> is still in effect for partial data 401. It is the same. The second font tag and P tag in the partial data 400 and 401 are only the start tag (line 5 and line 6), and the end tag (line 16 and line 15) is included in the partial data 400 and 401. Since it does not exist, its effectiveness is ongoing in partial data 402. Therefore, the start tag auxiliary information of the processing auxiliary data 102 is “く HTMLXfont size =“ + l ”> in the order in which the start tags appear.

[0703] On the other hand, the "end tag auxiliary information" is the opposite of the start tag auxiliary information, and is information indicating an end tag that should be paired with a start tag that is in effect, and more specifically, the end tag. It is. Of the end tags corresponding to the start tag appearing in the partial data up to the partial data from the beginning partial data, the end tags that do not exist in the partial data from the start partial data to the partial data of interest , And the end tag.

As shown in FIGS. 7B and 43, for example, in the case of the partial data 400, the partial data up to the corresponding partial data is also only the partial data 400 itself. The font tag and br tag in the partial data 400 are the force that the pair of the corresponding start tag and end tag exists in the partial data 400. The HTML tag is only the start tag (line 1) and the end tag (line 45). ) Does not exist in the partial data 400. Accordingly, the end tag auxiliary information of the processing auxiliary data 100 is an end tag “<ZHTM L>” that should be paired with the start tag “<HTML>” that is still in effect.

[0705] As for the partial data 401, the partial data up to the leading partial data force corresponding partial data are the partial data 400 and 401. The effect of the opening tag <HTML> is still in effect as in the case of the partial data 400. The second font tag and P tag in the partial data 400 and 401 have only the start tag (line 5 and line 6), and the end tag (line 16 and line 15) has the partial data 400 and 401. Does not exist. Therefore, the end tag auxiliary information of the processing auxiliary data 101 is “<ZP> <Zfont> <ZHTML>” in the order in which the end tags appear.

[0706] Although not shown in Fig. 7B, there may be data that is required in common for each partial data. For example, information on the settings of the entire display processing, such as the background color of the entire display. Such information may be expressed by a tag that sandwiches the whole. It may be expressed simply by a pair of a start tag and an end tag at the head of the HTML document. So to speak It is a way of describing information.

[0707] In this case, these pieces of header information do not appear in the start Z end tag auxiliary information of each block. However, if the header information is not interpreted, the background color and the like will not be accurately represented. Therefore, the fact that these commonly required data are required in common is separately indicated by a flag or the like. Thus, the common part can be interpreted before interpreting each partial data, so that no inconvenience occurs.

[0708] Since the method of generating the processing auxiliary data is not the gist of the present invention, a specific and detailed description of the processing procedure will be described later with reference to the flowchart of Fig. 52. It is assumed that processing auxiliary data as shown in FIG. 43 generated by analyzing the data is prepared in advance.

[0709] As already mentioned, each of the partial data 400-408 in Fig. 7B is "division data" that cannot be processed by itself, and the start tag auxiliary information and the end tag auxiliary information of the processing auxiliary data are By using it, it becomes "partial data" that can be processed independently.

[0710] If the start tag auxiliary information and the end tag auxiliary information of the processing auxiliary data are not used! / ヽ, the start tag auxiliary information and the end tag auxiliary information must be added to each divided data. For example, at the beginning of the partial data 401 in FIG. 7B, "<HTML>" is used as start tag auxiliary information, and at the end of the partial data 401, "<ZP> <Zfont> <ZHTML>" is used as end tag auxiliary information. Need to be added.

[0711] As described above, if the necessary information such as the start tag auxiliary information and the end tag auxiliary information is supplemented, the divided data can be handled in the same manner as the partial data to which the necessary information is added. Therefore, in the present invention, the divided data having a format in which the processing auxiliary data to be processed together when the divided data is processed is separately included in the category of the partial data, and is referred to as “partial data” instead of “divided data”. To

[0712] Fig. 44 is an explanatory diagram for explaining another example of the data structure of the processing auxiliary data. The data structure is almost the same as the data structure example in Fig. 43, but the item "presence / absence" in Fig. 43 is "effected data" in Fig. 44. “Influenced partial data” is information on the first partial data that affects each partial data. This will be described later with reference to the description of FIG. [0713] Next, an example of the data structure of the display layout will be described.

[0714] FIG. 45 is an explanatory diagram illustrating an example of the data structure of a display layout element (hereinafter, may be simply abbreviated as "element") as a basic unit of the display layout. Elements correspond to each character and each image on the display such as Fig. 5B.

[0715] Each element (display layout element data; indicated by numbers 120 to 122) includes, for example, “type”, “start byte”, “byte size”, “offset X”, and “offset” as shown in FIG. Y "," Width

”,“ Height ”, and“ contents ”.

[0716] The "type" represents the type of the element. Here, "CHAR" for "character" and "I" for "image"

The power that only MAGEJ gives as an example In addition, it is possible to have various types of elements, such as video elements.

[0717] The "start byte" indicates where the element is described in the electronic data. Here, in the HTML data of Fig. 4B, it is assumed that the element is represented by the TEXT part representing the element or the number of bytes from the head of the tag.

[0718] "Byte size" indicates the amount of data required for that element to be described in electronic data. Here, it is assumed that in the HTML data of FIG. 4B, the element is represented by the number of bytes of a character representing the element and, in some cases, the number of bytes including the tag. For example, if one character in HTML data is an element as it is and that one character is expressed in, for example, Shift-JIS, the byte size is "2".

[0719] "Offset X" and "Offset Y" will be described later together with the data structure example of the row data in Fig. 46.

"Width" and "height" represent the size of the element when it is displayed. The unit may be a pixel (dot). "Content" is data representing the content of displaying each element. In the case of a character element, it is a character code, and in the case of an image element, it is image data.

[0720] Fig. 46 is an explanatory diagram illustrating an example of the data structure of row data (indicated by numbers 200 to 222) that manages the collection of the above elements. Each line data corresponds to each line on the display such as Fig. 5Β. In the following, since “line on display” and “line data” have a one-to-one correspondence, in both cases, they may be simply expressed as “line”.

[0721] Row data can have zero or more elements. Elements owned (managed) are displayed The above corresponds to elements such as characters belonging to the range of each line. A line with zero elements is a blank line. There are various ways to manage image elements such as the wraparound image in Fig. 5B, but here we divide the image into multiple parts at the height of each line and manage them as image elements in each line. I do.

[0722] As shown in FIG. 46, the row data includes "height", "placeable start position", "placeable end position", "next element position", "number of elements", and "element array". With information.

“Element array” is the array of elements managed by the row data in one row, and “Number of elements” is the number of elements managed in one row. The “element array” contains information specifying each element included in one line. Here, the information is a number assigned to each element in FIG. 45 for easy understanding. In practice, the data that makes up the “element array” is often the array index or memory address of each element.

“Height” is the height of a circumscribed rectangle including all managed elements.

[0723] Fig. 47 is an explanatory diagram for explaining the information of the row data, which is described using an example of the row data of the first row in Fig. 5B. The elements are the letters of the sentence "How does LCD works?" Each element is represented by a rectangle surrounding each character in FIG. For example, a rectangle 503 around the letter "o" of "How". Although nothing is displayed in the rectangle 505, this is an element of "" (blank character).

[0724] Note that the displayed characters are indicated by dotted lines because the figures are complicated and cluttered.

Although each rectangle is actually a circumscribed rectangle of the character, it is slightly larger because it is difficult to display. The row rectangle 500 described later is also shown slightly larger.

[0725] A circumscribed rectangle 500 surrounding a group of these characters, that is, a sentence “How does LCD works?” Indicates the range of line data. The height LH in this range is the “height” in FIG.

[0726] The position of each character in the line of the rectangle 500 is fixed! This position is indicated by “Offset X” and “Offset Y” in FIG. Here, when the origin is the upper left corner of the rectangle in each row, the right direction is + Χ direction, and the lower direction is + Υ direction, “Offset X” and “Offset Υ” are the upper left corner of the rectangle of each element. Since it represents the position, the relative displacement of each element in the row rectangle The amount of offset (offset).

[0727] The "placeable start position", "placeable end position", and "next element position" are information used when generating a display layout, which will be described in detail later in the description of a display layout generating method. explain.

[0728] It is assumed that the row data 200, 201, 222, and the like in Fig. 46 are managed in the form of an array and can be accessed by an index number or the like.

As will be described in detail later, it is assumed that a display layout is generated from document data in a format such as the element data in FIG. 45 or the row data in FIG. 46 by the layout generating means 5 described later. The layout display means 8 described later uses the data in this format to display the display layout of the display range.

[0730] FIG. 48 is an explanatory diagram illustrating an example of the data structure of management data of partial data (hereinafter, referred to as "block management data"). The block management data (indicated by numbers 300 to 308) has information of “start line”, “end line”, “final layout line”, and “processing auxiliary data”.

[0731] The "start row", "end row", and "final layout row" are information on the row data generated from each partial data, and the numbers (200, 222, etc.) are the row data shown in FIG. Points to the data number assigned to. Leave blank if no row data has been generated yet

[0732] The "start row" and "end row" mean the first and last row data that includes the generated element data. The row data is indicated by the data number attached to each row data in Fig. 46 so that it can be easily divided. The actual row data is the index number and row number of the row data array, and the memory address of the row data. And so on.

[0733] The "final layout row" is row data to which the last element data generated from the partial data belongs. The “end row” and the “final layout row” may be the same row data or may be different like the block management data 302.

[0734] The different case is, for example, a case where the partial data includes a wraparound image as in the partial data 406 of Fig. 7B. For example, FIG. 19D shows a display result obtained by processing the partial data 406 independently. As shown in this example, the TEXT included in the partial data is wrapped around the wrap-around image compared to the number of lines required for the layout of the wrap-around image. When the number of lines required for printing is smaller, the end line of the TEXT layout does not reach the end line of the wraparound image layout. In such a case, the “end line” is represented by the last line data of the image element, while the “final layout line” is represented by the last line data of the TEXT wrapped by the partial data. Therefore, in the context of the rows, the “end row” always follows the “final layout row”.

[0735] "Processing auxiliary data" in Fig. 48 is information indicating the above-described processing auxiliary data corresponding to each partial data. Also in this case, the actual processing auxiliary data is often represented by an index number or a memory address of the processing auxiliary data.

[0736] (Overview of processing that is the key of the present invention)

Before describing the detailed processing, a brief description will be given of a processing example of processing the partial data having an effect and the desired partial data as one continuous data, which is one of the processings that is the key of the present invention. Let me explain. Details will be described later.

[0737] For example, FIG. 17D shows a state in which only the partial data 402 of FIG. 7B is used, and a display layout is generated and displayed so that a part thereof is displayed.

[0738] The "When" power line is laid out from the beginning of the line. FIG. 17D also shows a portion beyond the display frame so that the layout can be easily understood. Actually, based on the display position specified by the user or the like, only the third and subsequent lines starting with the “pass” force, which is a line in the display frame, are displayed in the example of FIG. 17D.

[0739] The state force in Fig. 17D is also displayed by scrolling the upper portion. If this is not performed by the data processing method of the present invention, the display layouts of the partial data 400 and 401 are individually processed, and the display layout of the partial data 402 in FIG. It will simply be combined. The state force displayed in this manner is shown in FIG. 19B.

[0740] As shown in FIG. 19B, a display result in which an error in which a line feed has occurred between "glass." And "When" positioned at the break of the partial data 401 and 402 is obtained. However, looking at the partial data 401 and the partial data 402 in FIG. 7B, there is no br tag indicating a line feed between “glass.” And “When”.

[0741] Therefore, the display result of Fig. 19B shows the effect of dividing HTML data into partial data. Therefore, the display result when the HTML data is processed without division and the display result when the HTML data is divided into partial data and each partial data is processed independently and connected are one. I haven't.

[0742] The HTML data given as an example in the present invention is a language specification designed on the assumption that the display result changes according to the display setting of the WWW browser. If the logical meaning given by (for example, forced line break or wrapping around the image) does not change, it is assumed that there is no error in any display, that is, the meaning of the original data is not damaged.

[0743] In addition, the division of the HTML data into partial data may logically affect the processing result of the partial data. For example, when the original data is divided into partial data at a place other than the line feed tag as in the example of FIG. 19B above, or without considering the partial data including the wraparound image as in the example of FIG. 19D, For example, when processing the following partial data

[0744] Therefore, simply joining the processing result of the next partial data to the processing result of the previous partial data may change the meaning of the original data as a whole. Errors may appear.

[0745] In other words, when handling partial data, it is necessary to change the processing method according to the characteristics of the data. In view of this, the present invention pays particular attention to the effect of the processing result between partial data, and devises a processing result that does not show an error. More specifically, when it is detected that one partial data affects another partial data, the partial data is treated as a set of data and processed. As a result, it is possible to obtain an appropriate processing result in which the above-mentioned influence is reflected.

[0746] An example in which partial data is actually read and a display layout is displayed by the data processing method of the present invention which has been schematically described above will be described with reference to the drawings.

[0747] First, it is assumed that only one page (height of the display means) is displayed below the top of the partial data 400 in Fig. 7B. Since the partial data 400 is the first partial data and is constituted by the first line data, the TEXT of “How does LCD works?” Is laid out. At this point, the block management data of the partial data 400 (Fig. 48) includes the start row and the last row. The first line is recorded as the last line and the last layout line.

Assuming that this is less than one page, the partial data 401 is laid out next.

The partial data 401 is laid out following the final layout row of the partial data 400, that is, the first row. At this time, a br tag indicating a line feed is detected as the last element of the partial data 400. Therefore, for the next partial data 401, it is only necessary to create a headline display layout of a new line. That is, since the br tag is detected as the last element of the partial data 400, it is detected that the partial data 400 does not affect the next partial data 401.

[0749] In the layout of the partial data 401, since the P tag exists at the beginning, the first line is broken, the second line is made a blank line for the vertical space, and the "L" force starts from the beginning of the third line You will lay out the character elements.

[0750] FIG. 17C shows the entire layout in a state where the layout of partial data 401 has been completed, for the sake of explanation. It is assumed that the surrounding rectangle is the display range of the display means. For explanation, the line numbers are assigned to the left side of the rectangle. Figure 17C ends on the fifth line with "glass." Since there is no br tag or the like at the end of the partial data 401, a line break is not performed. Accordingly, the block management data of the partial data 401 at this point is such that the start line is the second line, and the last line and the final layout line are the fifth line.

[0751] Since this is still less than one page, the partial data 402 is laid out next. At this time, no br tag indicating a line feed is detected as the last element of the partial data 401, and no P tag is detected from the first element of the partial data 402. From this, it is detected that the next partial data 402 is affected by the previous partial data 401.

As a result, the partial data 402 is laid out so that the layout is not interrupted in the final layout row of the partial data 401, ie, the fifth row. That is, the character elements starting with the “W” force of the partial data 402 are added to the fifth line and laid out.

[0753] Fig. 17E shows the result of the layout. The last “glass.” Of the partial data 401 and the first “When” of the partial data 402 are laid out in a single row. Compared to FIG. 5B, the layout is exactly the same, and the display result is obtained without losing the meaning of the original electronic data. As described above, when it is detected that the partial data 401 affects the partial data 402 when the partial data 401 and 402 are processed in this order, the partial data 401 and the partial data 402 are separately processed. It is processed as a series of data that does not need to be done. As a result, for example, when the partial data 402 is laid out so that the layout is not interrupted in the final layout line of the partial data 401, an appropriate processing result in which the influence is reflected can be obtained as described above.

[0755] As described above, by laying out the subsequent partial data following the final layout line of the previous partial data, even if the method of dividing the partial data that does not include line breaks is Since the data can be processed as the data, the effect that the layout can be naturally continued comes out.

[0756] Next, a case will be described in which character strength in the middle of partial data is displayed. It is assumed that a range of one page is displayed below the line including “Each” on the 10th line of the partial data 402 in FIG. 7B. At this time, it is assumed that the display layout of any partial data has not been saved.

[0757] It is assumed that the display start position is actually specified by the number of bytes such as "byte position 180". It is assumed that this is specified by a link jump or the like. From the start byte 150 and byte size 201 of the processing auxiliary data 102 in FIG. 43, it can be seen that the partial data including the position is the partial data 402 corresponding to the processing auxiliary data 102.

FIG. 17D shows a state where partial data 402 is laid out. Finally, the display is started from the line containing "Each", so that it is adjusted to the final display state for easy understanding. Actually, as described above, the first and second lines in FIG. 17D are not displayed.

However, when compared with the 5th to 9th lines generated from the partial data 402 in FIG. 17E, “When” is the first line in FIG. 17D. This does not lay out following the previous partial data 401, in other words, irrespective of the influence of the previous partial data 401, even if the partial data 402 is laid out alone, the specified display range will be incorrect. This is because it is possible to obtain a display that is completely absent.

[0760] As described above, it is a feature of the data processing method of the present invention that it is determined that the corresponding partial data may be independently processed depending on the display range to obtain the display layout. Ie Before the influence detecting step, a layout investigating step is carried out to check whether the first display layout element of the desired partial data is a head force displayed on the display medium which is the output target of the display layout. When the display layout element is displayed from the beginning of the line, the influence detection step may not be performed. The head of the line may be the head position where the display of the output medium is started, or may be the head of a line that is being displayed.

[0761] For example, in FIG. 17F, the first display layout element (LCD) of a paragraph beginning with “LCD alio ws” (corresponding to the partial data 404) is always displayed from the beginning of the line. An error-free display result can be obtained without executing the influence detection step.

[0762] Also, as shown in FIGS. 17D and 17F, an arbitrary display layout element (in this case, “pass”) of a paragraph beginning with “When” (corresponding to the partial data 402) is located at the beginning of the display range. However, no error appears in the display result of the partial data 402 even when the data is displayed. Therefore, in such a case, that is, when an arbitrary display layout element of the partial data is displayed from the head position of the display range, the effect detection step is not performed on the partial data. It is a feature point.

[0763] Continuing! It is assumed that this alone is less than one page, and the layout is continued to partial data 403, 404, and 405. FIG. 17F is an explanatory diagram illustrating a state where the layout up to the partial data 405 is performed. The third to fifteenth lines are the range that is actually displayed.

[0764] This display layout is different from the processing result of the partial data 402 and 403 in the first half as compared with FIG. 5B. However, since line breaks are laid out as instructed, there is no error in displaying HTML data. Even without laying out the data 400 and 401 at the beginning of the HTML data, the HTML data can be laid out without any error. Since the layout only needs to be laid out in a range necessary for display, a special effect that a high-speed, resource-saving and error-free layout can be generated can be obtained.

[0765] (Configuration of data processing device)

FIG. 41 shows a data processing apparatus that performs a data processing method according to an embodiment of the present invention. FIG.

[0766] More specifically, the main parts of the data processing apparatus are divided into a partial data acquisition unit 21, a processing auxiliary data acquisition unit 22, an influence detection unit 23, a partial data necessity determination unit 24, a layout generation unit 25 , Control means 26, layout storage means 27, layout display means 28, and foremost data detection means 29.

[0767] FIG. 2 is a configuration example of an apparatus that specifically realizes the means 21 to 29 of FIG.

[0768] The CPU (central processing unit) 70 includes the influence detection means 23, the partial data necessity determination means 24, the layout generation means 25, the control means 26, the layout storage means 27, the layout display means 28, and the foremost partial data detection means. It functions as 29 and obtains a program in which the processing procedure of each of the means 23-29 is described, such as a main memory 74, an external memory 75, or a network destination via the communication device 77. Note that the CPU 70 also has a function as a partial data acquisition unit 21 and a processing auxiliary data acquisition unit 22 for reading and transferring necessary data.

[0769] Note that the method of exchanging data with the CPU 70, display 71, mouse 72, tablet 73, main memory 74, external memory 75, buttons 76, communication device 77, keyboard 78, and Z or speaker 80 The description of each part in FIG. 2 and FIG. 2 is the same as that described in the first embodiment, and a description thereof will not be repeated.

[0770] Next, the viewpoint of data transmission / reception between the units 21 to 29 in Fig. 41 will also be described.

[0771] The partial data acquisition means 21 is composed of, for example, the CPU 70 and the main storage 74 or the external storage 75, and obtains the partial data from the network destination or the like. In this case, the previously prepared partial data is read.

[0772] For example, when the partial data is not prepared in advance, the partial data acquisition unit 21 stores the data of the part corresponding to the partial data to be read in the main memory 74 or the external storage 75. It may also search for and read electronic data that has been processed.

[0773] More specifically, the partial data obtaining means 21 obtains processing auxiliary data from the processing auxiliary data obtaining means 22, and obtains information on the partial data from the obtained processing auxiliary data, for example, each partial data. To obtain the desired partial data by reading the start byte position and byte size of the Can do. Alternatively, the partial data obtaining means 21 may generate the partial data by obtaining the electronic data in consideration of the information on the partial data and dividing the electronic data using the information on the partial data.

[0774] The obtained partial data is sent to the influence detection means 23 and Z or the layout generation means 25.

[0775] The processing auxiliary data acquisition means 22 is composed of, for example, the CPU 70 and the main storage 74 or the external storage 75, and can obtain the processing auxiliary data from the network destination or the like. In this case, the processing auxiliary data prepared in advance is read.

[0776] For example, when extracting necessary information from the processing auxiliary data, the processing auxiliary data acquiring unit 22 may analyze the data structure of the processing auxiliary data to obtain necessary information. The obtained processing auxiliary data is sent to the partial data acquisition unit 21, the influence detection unit 23, the layout generation unit 25, the Z or the frontmost partial data detection unit 29, and the like.

[0777] The CPU 70 serving as the influence detecting means 23 displays the partial data obtained from the partial data obtaining means 21 and the partial data obtained from the layout generating means 25 and the layout storing means 27. The desired partial data and the partial data immediately before it are individually processed using the obtained processing auxiliary data, etc. Power Processing result (here, display layout) Detects whether or not this has any effect. Alternatively, it may detect the influence of the previous partial data rather than just the previous partial data. The detection result is sent from the influence detecting means 23 to the control means 26.

[0778] The CPU 70 as the partial data necessity judging means 24 determines the control means from the display range obtained from the layout display means 28 and the display layout range of each partial data obtained through the control means 26. It is determined whether or not the processing result (display layout) is necessary for the partial data designated by 26, and the determination result is sent to the control means 26.

[0779] The CPU 70 as the layout generating means 25 obtains the partial data specified by the control means 26 from the partial data acquiring means 21 and displays the partial data in a format such as the element data in Fig. 45 or the row data in Fig. 46. Generate a layout. The layout generating means 25 uses the processing auxiliary data obtained from the processing auxiliary data obtaining means 22 together with the partial data when generating the layout. In some cases. The generated display layout is sent to the layout storage unit 27 and stored, or sent to the layout display unit 28 and displayed. In some cases, the partial data is not directly specified by the control unit 26 but is specified through the layout storage unit 27.

[0780] The CPU 70 as the control means 26 controls and instructs each means 21-25, 27-29, and exchanges necessary data with each means 21-25, 27-29. In FIG. 41, the lines indicating the control Z instruction and data exchange between the control means 26 and each of the means 21-25 and 27-29 are shown only as the main lines because if all the lines are shown, the diagram becomes difficult to see. Basically, it is assumed that the control means 26 and each of the means 21-25 and 27-29 exchange control Z instructions, data, and the like in two directions.

[0781] The CPU 70 as the layout storage unit 27 stores the display layout (processing result) of the partial data obtained from the layout generation unit 25 in the main storage 74, the external storage 75, or the device at the network destination via the communication device 77. And save it. The stored display layout is passed to layout display means 28, influence detection means 23 and Z or control means 26.

In some cases, based on an instruction from the control unit 26, the layout generation unit 25 may be requested to generate a display layout of the partial data specified by the control unit 26. Further, based on an instruction from the control means 26, the display layout in which the partial data specified by the control means 26 is stored is discarded, or the data is overwritten and saved with a display layout newly obtained from the layout generation means 25. Or in some cases.

[0783] Information necessary for generating a display layout, which will be described later with reference to Fig. 48 and the like, may be stored and managed by any of the layout generation unit 25, the control unit 26, and the layout storage unit 27.

The CPU 70 as the layout display means 28 displays the display layout obtained from the display layout generation means 25 or the layout storage means 27 on a display 71 or the like. Here, the output operation of the layout display means 28 is described as a display on the display 71, but it may be, for example, printing on a printer, or outputting a file to a file in which a display layout is recorded.

[0785] The CPU 70 as the foremost partial data detecting means 29 extracts the partial data for which the processing result is to be obtained. When specified by the control means 26, information for specifying the first or last partial data affecting the partial data is obtained from the processing auxiliary data acquisition means 22 and sent to the control means 26. Alternatively, the foremost partial data detecting means 29 obtains each partial data and its display layout through the control means 26 and obtains the processing result! /, Judges the influence on the partial data, and determines the effect before or after the influence. The obtained partial data is sent to the control means 26.

[0786] Fig. 42 shows an example of the appearance of a data processing device according to the present invention. On the main body 1400, a display / tablet button, a previous page turning button 1420 and a next page turning button 1430 are provided. There is also a pen 1440 to operate the tablet.

[0787] The display unit / tablet 1410 corresponds to the input / output device (the display 71 and the tablet 73, etc.) and the layout display means 28. The display layout generated by the layout generation means 25 or the display layout stored by the layout storage means 27 is displayed on the display / tablet 1410. It is also used to display various setting menus of the data processing device and to change settings with a finger or a pen 1440 using the display unit / tablet 1410.

[0788] As operation means for various settings and the like, operation buttons or the like that can be operated only with the display unit / tablet 1410 may be used. The front page turning button 1420 and the next page turning button 1430 are used to change the display range of the display layout displayed on the display unit / tablet 1410, for example. The pen 1440 can be used variously for operations such as link jump and user input such as various settings.

[0789] In addition, although not shown in this example, in addition to the above, as the external storage 75, a slot such as a memory card, a communication device 77 for communication with a network, a keyboard and a keyboard 78, an input device such as a microphone, a speaker 80 If an output mouse device such as 7 is included with the main unit 1400, it is also determined.

[0790] (Details of data processing method)

Hereinafter, a method of processing the partial data so that the connection of the processing results of the respective partial data is not deteriorated will be described in detail.

[0791] The points of the processing method can be summarized as follows. (1) Processing Result Power of Partial Data Surrounding Desired Partial Data The influence detecting means 3 detects whether or not the processing result of the desired partial data is affected by the division.

[0793] (2) If an influence is exerted, the layout data generation unit 5 processes the partial data force up to the desired partial data as continuous data.

[0794] (3) Further, regarding the partial data to be processed first, it is detected whether or not the peripheral data is affected by the surrounding data. To process.

[0795] (4) These processes are repeated until no influence is detected.

[0796] (Processing example 1)

[0797] First, in step S11 (hereinafter, "step S" is abbreviated as "S"), the processing auxiliary data obtaining unit 22 obtains processing auxiliary data, and the process proceeds to S12. For example, it is assumed that the processing auxiliary data acquisition unit 22 reads processing auxiliary data prepared in advance in the main memory 74, the external storage 75, or a network destination via the communication device 77, or the like.

[0798] The "influence / non-effect" determination processing shown in FIG. 43 and the "influence block" determination processing shown in FIG. 44 will be described later with reference to the flowchart shown in FIG.

[0799] Here, the processing auxiliary data of each partial data is read at a time! /, But may be read individually when the processing auxiliary data of each block becomes necessary. It is assumed that the read processing auxiliary data has a data structure as shown in FIG.

[0800] Next, in S12, the control means 26 acquires a desired display layout range as information input by a user from the mouse 72, the tablet 73, the button 76, the keyboard 78, or the like, and proceeds to S13. The display layout range is expressed, for example, in the form of a combination of “reference position” and “size”. There are two types of display layout ranges: the case where it is indicated by the data range of document data and the case where it is indicated by the display size on the display means Conceivable.

[0801] When the display layout range is indicated by the data range of the document data, for example, "data between the nth byte and the mth byte of the document data", that is, "reference data position (n) in the document data" And "data size (m)". When indicated by the data range, the desired It is easy to specify the partial data corresponding to the display layout range. This is because, using the start byte and byte size information of each partial data in the processing auxiliary data in FIG. 43, it is easy to determine which partial data is in the nth and mth bytes. is there.

[0802] On the other hand, in the case of indicating the display size on the display means, for example, the form "p dots below based on the nth byte of the document data", that is, "data position in document data" and "display size" In the form of The part of the n-th byte as the data position is determined by the power that can be easily obtained by using processing auxiliary data. It is not easy to ask.

In the present invention, since the influence of the display layout between the partial data is a problem, it is important to find the range of the partial data necessary for the desired display layout range. In the case of showing in the data range of the document data, necessary partial data can be easily obtained. Therefore, the following description will be made in terms of difficult processing and the case of showing in the display size on the display means.

[0804] There are various variations in a method of expressing the display layout range in the form of "data position in document data" and "display size".

[0805] The data position in the document data may be represented by, for example, a ratio (percent) of a scroll bar or the like. However, if the data size (byte unit) of the entire document data is a component, the ratio can be converted to each other, so the expression is essentially the same as the number of bytes. Therefore, the following description will be made in terms of the number of bytes.

[0806] In addition, it is also possible to specify in units of bytes, for example, in units of "number of characters". This is also interchangeable. Since one character is generally represented by 13 bytes, it can be said that the byte unit is finer than the "character number" unit. Alternatively, it is also possible to specify in "tag" units. For example, the third P tag. Since the tag is composed of characters, the unit size is "byte" ≤ "character" ≤ "tag". Here, it is assumed that the data position is specified in the byte unit which can be specified most finely among the above three.

[0807] Similarly, the "display size" can also be expressed as a ratio of the display layout size (dots) of the entire document data as 100%, and the number of dots in the display range can be mutually converted with the data position. Is the same as However, the advantages of processing with partial data Mainly, high speed and resource saving by processing only a part of data without processing the entire document data are the main. In order to obtain the display layout size of the entire document data, layout processing of the entire document data is necessary, and this method makes the advantage of partial data meaningless. Therefore, it is not realistic to specify the display size in proportion.

[0808] Even in actual usage scenes, when using a scroll bar, a page turning button, or the like to indicate a display, the display is often used with the awareness that "display size is a range that can be displayed on the display means". Therefore, hereinafter, the display size is processed in a manner of expressing how many dots.

[0809] The relationship between the data position in the document data and the display size also depends on where in the display range the data position reference is set. If the reference is placed at the beginning of the display range, the expression is “p dots below the nth byte of the document data”, and if the reference is placed inside the display range, “n The expression is p dots above and q dots below, based on the byte.If the reference is placed at the end of the display range, `` p dots above the nth byte of the document data Expression.

[0810] Among them, in the present embodiment, it is assumed that a desired display layout range can be obtained by the expression "up to p dots and down to q dots based on the nth byte of the document data". Because if p or q is 0, it is the same force as if you set the reference at the beginning or end.

[0811] How the user can obtain the desired display layout range First, the display size is often the vertical size WH (dot) of the display means (display window). Always p + q = WH. In this case, we mainly assume the usage of reading horizontal content while scrolling it up and down. Therefore, the power of the display means (display window) using the vertical size WH is used. You can use

[0812] Hereinafter, "page" means a range only displayed on the display means (display window) or a display layout only displayed on the display means (display window). The "previous page" and "next page" mean one page before or next to the display layout of the current page. The operation of switching the display range to "previous page" or "next page" is referred to as "previous page turning" or "next page turning".

[0813] When reading document data for the first time, it is normal to read one page from the top. In this case, n = 0 as the reference data position (the beginning is the 0th byte), and there is no display layout above, so that p = 0 and q = WH.

[0814] When a predetermined display layout range is specified by a link jump, a page jump, or the like, a jump destination must be specified, and the data position in the document data should be obtained therefrom. For example, in HTML, in the link source, in the href attribute of the A tag,

",,,,, A href =" # target "> Link source / A ,,,,,"

, The information of the link destination is shown. Here, it is a place called "" in the document data. In response, somewhere in the document data,

",,, <A name = "target"> ZA to link to ,,,,"

For example, in the name attribute of the A tag, "target" t and the location should be specified.

[0815] As a result, in a WWW browser or the like, when the display layout of TEXT "link source" is clicked with a mouse or the like, a display layout range including "link destination" is displayed. That is, it is a link jump. In FIG. 42, this corresponds to the user operating the tablet / display 1410 with the pen 1440.

[0816] In this case, the first character of the character string of the “link destination” (or the first character of the A tag surrounding the character) can be determined in advance by the control means 26 as to the byte in the document data. . Therefore, the information may be separately recorded in a database or a file, or the like, so that the control means 26 can immediately know the byte position of the "tar get" location. A new item may be added to the data structure of the processing auxiliary data in FIG. 43 and recorded.

[0817] Without checking in advance, when link jumping, the entire document data can be interpreted and the location of “target” can be checked. However, similar to the case of the percentage specification of the display layout described above, The advantage of using it is lost, so it is better to check beforehand.

[0818] When a predetermined display layout range is specified by a scroll bar or the like, the position is specified by a percentage or the like. However, if the data position is also obtained for the percentage power, the display range is determined by link jump. Is equivalent to As a method of determining the data position, the method of setting the data size of the entire document data to 100% is also a method for calculating the data position. Other than the above, for example, the force proposed by the present inventor in Japanese Patent Application No. 2002-139310 Display layout size There is a method of obtaining the data position including a part of the estimation.

[0819] Assuming that a reference data position can be obtained by link jump, what to do with the display range depends on the display application or display device. In many WWW browsers, the reference data position is defined as the head of the display range (p = 0, q = WH) and the center of the force display range (p = q = WH / 2).

[0820] In addition to the link jump, for example, the same designation can be performed by a bookmark function or the like. When the display application or the display device finishes displaying the document data, the display layout range displayed last is recorded in the external memory 75 or the like as bookmark data. The content to be recorded may be in the form of “data position in document data” and “display size”. If the display size is fixed or unnecessary, only the data position in the document data may be used.

[0821] Then, the next time a display application or display device attempts to display the document data, the layout generating means 25 or the like reads the bookmark data and displays the data position or the like in the obtained document data as desired. By setting the layout range, it is possible to display a display layout range that is almost the same as the display layout range for which the display of the document data has been completed last time.

[0822] Regarding how to obtain a user's power to obtain a desired display layout range, the power described when reading document data for the first time and when a predetermined display layout range is specified by link jump or page jump, etc. In actual use, there are many usage scenes in which the display layout range of the previous page or the next page is set as a desired display layout range.

[0823] For example, when turning the document data to the next page, the desired display layout range is "one page down from the line following the last line of the current page". It is assumed that the next page turning instruction is input by the user by an operation such as pressing a next page turning button 1430 in FIG.

[0824] It is possible to convert "the next line after the last line of the current page" into the form of data position. As described later in S13, the data position is needed to obtain which partial data belongs. However, here it is assumed that the data position is not forcibly converted to the form of "display position" + "display size". The “display position” is a position on the display layout. In this example, “start position of the next line after the last line of the current page” is “the last position of the last line of the current page”. End position "and so on.

[0825] In addition to this, detailed specifications such as how to display line spacing, whether to partially overlap the line on the previous page, and what to do if the line is displayed halfway, etc. Varies depending on the display application and the display device. In the present invention, it is assumed that the “start position of the line following the last line of the current page” is designated as the “display position”.

[0826] Similarly, in the case of page-turning, the desired display layout range is "one page from the end position of the line preceding the start line of the current page". In addition, there are various ways to specify forward / backward scrolling by one line or scrolling forward / backward by a predetermined dot, etc. Force The way of specifying force is basically the same as turning a page, so the description is omitted.

[0827] As described above, in S12, the desired display layout range is specified in the format of "data position in document data" and "display size" or in the format of "display position" and "display size". Suppose it is done.

[0828] Next, in S13, the control unit 26 determines that the partial data that can generate the display layout in the desired display layout range obtained in S12, in other words, belongs to the desired display layout range (applicable) The partial data is obtained and set as the current partial data. Here, the partial data including the reference data position obtained in S12 may be obtained from the processing auxiliary data in FIG.

[0829] The "partial data belonging to (applicable to) the desired display layout range" means partial data belonging to even a part of the desired display layout range.

[0830] In order to check the partial data for which the layout has been acquired later, information such as "acquisition start partial data" and "acquisition end partial data" is provided. Is set. Here, the data number 300 or the like or the index number of the block management data described later with reference to FIG. 48 may be set.

[0831] More specifically, when the reference data position is in the format of "data position in document data", it is specified in the form of the nth byte. Using the starting byte and byte size of each block of processing auxiliary data in Figure 43,

(Start byte of partial data) ≤n <(start byte of partial data) + (byte size of partial data) Find partial data that satisfies.

[0832] When the reference data position is in the format of "display position", the partial data of the display layout currently displayed is known, so the partial data of the display position may be obtained. This can be obtained by using the block management data shown in FIG. 48, which is information for managing the range of the displayed row data. It is assumed that the range of the displayed line data is separately managed by the control unit 26, the layout display unit 28, and the like.

[0833] For example, in the case of "the start position of the next line after the last line of the current page", the last line of the current page corresponds to the last line data displayed. The next line can be understood by looking at the line data next to “the last line of the current page” in the line data array of FIG.

If the next row data exists, the partial data to which the row data belongs may be set as the current partial data. Which row data belongs to which partial data can be determined from the block management data in Fig. 48.

It can be found by finding partial data that satisfies (start row of partial data) ≤ (row data) ≤ (final layout row of partial data). In this case, the inequality sign is determined by the order of the row data. Actually, the inequality sign may be determined by the index number in the row data array.

[0835] If the next line data does not exist, it means that the display layout of the partial data for generating the line data has not yet been generated. Let the next partial data of the data be the current partial data. "Last line on current page

Is obtained from the block management data in FIG. 48, and is the next partial data.

[0836] In S14, the partial data necessity determining means 24 determines whether or not the processing result of the current partial data is necessary for displaying a desired display layout range. The process advances to S15 via “connection point P” (abbreviated as “P”). If it is determined that it is not necessary, the process advances to S16 via P200. Details of the processing here will be described later. The process in S14 corresponds to a partial data necessity determining step described in the claims.

[0837] In S15, the influence detection unit 23, the partial data necessity determination unit 24, the layout generation unit 25, the control unit 26, the layout storage unit 27, and the like use the current partial data display layer. And take into account the impact, then proceed to S16 via P200.

[0838] "Acquiring the display layout of the current partial data in consideration of the influence" means that the partial data that affects the current partial data and the current partial data are processed as a continuous data. Then, processing to generate a display layout that has no effect! Details of the processing here will be described later.

[0839] The process here includes important processes related to the points of the present invention, such as "effect detection process" and "partial data processing step".

[0840] In S16, the control means 26 determines whether or not there is partial data before the "acquisition start partial data" set in S13 with respect to the desired display layout range.

Proceed to 7; if not, proceed to S18.

[0841] For example, in Fig. 48, if the acquisition start partial data is the partial data 301, the partial data 300 before it exists. If the acquisition start partial data is partial data 300, there is no partial data before that.

[0842] In S17, the control means 26 sets the partial data before the acquisition start partial data as the current partial data, and returns to S14.

[0843] In the repetition processing of S14 to S17, the processing result of the partial data determined to be necessary to generate the display layout (display layout) for the partial data ahead of the desired partial data including the reference data position (display layout) Is obtained.

[0844] In S18, the control means 26 resets the acquisition end block set in S13 to current partial data, and proceeds to S21.

In S21, the control means 26 determines whether or not there is partial data next to the acquisition end partial data. If there is, the process proceeds to S22. If not, the process proceeds to S23. The direction of checking the existence of partial data is reversed, but the process is the same as S16.

[0845] In S22, the control means 26 sets the partial data next to the acquisition end partial data as the current partial data, and the process returns to S19.

[0846] In S19, the partial data necessity determining means 24 determines whether the processing result of the current partial data is necessary for displaying a desired display layout range. If it is determined that the processing result is necessary, the process proceeds to S20. If it is determined that it is not necessary, the process proceeds to S21. The judgment method is S14 Is the same. The processing of S19 also corresponds to the partial data necessity determination step described in the claims.

[0847] In S20, the influence detection means 23, the partial data necessity determination means 24, the layout generation means 25, the control means 26, the layout storage means 27, and the like obtain the display layout of the current partial data in consideration of the influence. Then, proceed to S21. This is almost the same processing as S15.

[0848] In the repetitive processing of S19 to S22, the processing result of the partial data determined to be necessary is obtained with respect to the desired partial data including the reference data position and the subsequent partial data.

[0849] In S23, the layout display unit 28 displays a display layout of a desired display layout range using the display layout of all necessary partial data acquired in the processing of S11 to S22, and performs processing. To end.

[0850] The process for setting the information of "display start line data" and "display end line data" will be described later, and is assumed to be set in the processes from S11 to S23. The display processing by the layout display means 28 only displays the display start line data and the display end line data on the display means in order. Assuming that display is performed in units of display layout elements, display layout elements in a display layout element array in row data to be displayed are sequentially displayed. The display position of the display layout element is

(X coordinate of element data) = (Offset of element data X)

(Y coordinate of element data) = (Y coordinate of row data) + (offset Y of element data). For the Y coordinate of the line data, set the Y coordinate of the first display start line data to 0,

(Y coordinate of row data) = (Y coordinate of previous row data) + (height of previous row data) + (line spacing)

Is determined by The line interval may be a predetermined value or a value obtained by multiplying the height of the line data by a predetermined ratio.

[0851] FIG. 5B is an example of a display layout in which the electronic data of FIG. 7B is displayed from the top. The surrounding frame is the display range of the display means. The part beyond the display range is not displayed.

[0852] Through the processing from S11 to S23, a display layout can be generated and displayed for a desired display layout range in consideration of the influence of division. [0853] Next, the processing of S14 in Fig. 49, that is, the processing result power of the current partial data is determined by the partial data necessity determination means 24 as to whether or not it is necessary to display the desired display layout range (the processing (partial data required). The details of the sex determination step will be described.

First, it is determined whether or not the already generated display layout is capable of satisfying a desired display layout range. Since the already generated display layout is managed in the row data array in FIG. 46, the determination is made based on this row data array.

[0855] First, it is checked whether or not row data at the reference data position exists.

[0856] When the reference data position is in the format of "data position in document data", it is specified in the form of the nth byte. Use the “start byte” and “byte size” information of the element data in Figure 45.

(Start byte of element data) ≤n <(start byte of element data) + (byte size of element data)

Find row data with element data that satisfies For each row data of the row data array and each element data of the element data array in the row data, it is sufficient to sequentially check whether the above expression is satisfied by using the element data array and the row data array.

[0857] If the reference data position is in the form of "display position", it is specified as a line, so it is immediately known whether or not there is any force. For example, if the reference data position is “the line next to the last line of the current page”, the last line of the current page is searched from the line data array in FIG. 46, and if the next line data exists, it is checked. Yeah.

[0858] If there is no line data at the reference data position, it is determined that the current partial data is necessary. This is a flowchart of FIG. 49. First, in S13, the partial data of the reference data position is determined, and in S15, the processing result (display layout) is obtained so that V is obtained. If the processing result of the partial data at the data position does not yet exist, it means that the current current partial data is the partial data at the reference position set in S13, and it is attempted to obtain the processing result from now. This is because it is a component to be partial data (desired partial data).

[0859] If the line data at the reference data position exists, the partial data having the line data is obtained. This is obtained from the block management data shown in FIG. If the line data at the reference data position If it is the current partial data to be judged, this current partial data is naturally judged to be necessary.

[0860] Compared with the partial data at the reference data position, if the current partial data to be judged is ahead, the reference data position force The display layout of the size in the forward direction designated as the desired display layout range (P dots) Checks if exists already.

[0861] That is, the height PH of the layout from the “start row” of the partial data after the current partial data to be determined to the row at the reference position is

(Line of reference position)

ΡΗ = ∑ ((height of line data i) + (line spacing))

i = (start line)

Ask for.

[0862] If p≤PH, a display layout of the size in the forward direction specified as a desired display layout range can be generated only from the partial data after the current partial data to the partial data at the reference position. !, It can be determined that the current partial data is unnecessary.

[0863] If p> PH, it means that the layout in the upward direction is not sufficient only with the partial data after the current partial data, so that the current partial data is necessary.

[0864] For example, suppose that the partial data at the reference position is the partial data 304 in Fig. 48 and the current partial data to be determined is the partial data 301. In this case, the height from the start row of the partial data 302 to the row data at the reference position of the partial data 304 is determined to determine whether the display layout of the partial data 301 is necessary.

[0865] If the current partial data is the partial data immediately before the partial data at the reference position (desired partial data), in the partial data necessity determination step, the partial data immediately before or immediately after the desired partial data is determined. To determine whether the (partial data 301) is necessary, use the display layout (processing result) of the desired partial data (partial data 302) and continuous partial data (partial data 303, 304) to determine! / Become.

[0866] Alternatively, if the above-mentioned current partial data (partial data 301) is regarded as desired partial data in a different point of view, the determination of whether or not the desired partial data is necessary is performed. Processing of one or more subsequent partial data (partial data 302-304) You are using the result. Also, if the current partial data to be determined is later than the partial data at the reference data position, one or more consecutive partial data before the desired partial data can be used to determine whether the desired partial data is necessary. You will use the data processing results.

[0867] In the case where the current partial data is later than the partial data at the reference data position, the same processing can be performed if the method of determining the forward direction and the direction are reversed. In other words, the height of the layout from the line data at the reference data position to the “final layout line” of the partial data before the current partial data is obtained, and the reference data position designated as the desired display layout range is obtained. Compare with the size of the back (q dot)!

[0868] In this manner, the process of S14 for determining whether the display layout of the current partial data is necessary is performed based on whether the display layout of the current partial data is included in a desired display layout range. it can.

[0869] In the partial data necessity determination step of the present invention, the effect detection step is not executed for the partial data that is not necessary to obtain the processing result of the specified processing range. It can be simplified, and contributes to speeding up of processing.

[0870] FIG. 50 is a flowchart illustrating a method of S15 in FIG. 49, that is, a method of acquiring the display layout of the current partial data in consideration of the influence.

[0871] In S15A-1 via P100, the display layout of the current partial data determined to be necessary by the force S14, such as the layout generation means 25 and the control means 26, is acquired, and the flow advances to S15A-2. If the acquired display layout is stored in the layout storage unit 27, the display layout of the current partial data can be extracted as needed. Further, when the display layout of the current partial data is recreated in consideration of the influence, the current partial data stored in the layout storage unit 27 is cleared or overwritten and rewritten.

[0872] Step S15A-1 corresponds to a partial acquisition step of the present invention in which a processing result of desired partial data is acquired and held before the influence detection step.

[0873] If the display layout of the current partial data is not stored, the layout storage unit 27 requests the layout generation unit 25 to generate a display layout of the current partial data. In response, the layout generation unit 25 generates a display layout of the current partial data, and passes the generated display layout to the layout storage unit 27. The layout storage unit 27 stores the display layout of the current partial data obtained from the layout generation unit 25 in a recording unit such as the main memory 74 or the external storage 75, and stores the display layout of the current partial data in the control unit 26. hand over.

[0874] When the layout storage unit 27 is not used, the layout generation unit 25 generates a display layout of the partial data and transfers it to the control unit 26 each time.

[0875] In S15A-2, the partial data necessity determining means 24 determines whether the partial data immediately before the current partial data is necessary to display a desired display layout range, and determines that it is necessary. If it is determined, proceed to S15A-3. If not, exit to P200. The method of determining whether or not it is necessary is the same as the processing in S14, except that the partial data to be determined is the partial data immediately before the current partial data.

[0876] When the processing result of the current partial data is obtained to determine the necessity of the partial data immediately before the current partial data, even if the immediately preceding partial data corresponds to the above-described affected partial data, The partial data and the specified partial data are not processed as a continuous data.

[0877] Because, if the previous partial data corresponds to the above-mentioned affected partial data with respect to the current partial data, it is necessary to process the previous partial data before obtaining the processing result of the current partial data. This is because contradictions occur.

[0878] In other words, while the processing result of the current partial data is needed to determine whether the previous partial data is necessary, the processing result of the previous partial data is needed to obtain the processing result of the current partial data. Therefore, there is a contradiction between the current partial data and the immediately preceding partial data, which requires mutual processing results. Alternatively, infinite repetition processing is performed.

[0879] In order to determine the necessity of the immediately preceding partial data, when obtaining the processing result of the current partial data, even if the immediately preceding partial data corresponds to the above-mentioned affected partial data, the processing of the immediately preceding partial data is performed. I will not do it. As a result, inconsistency and infinite repetition of the processing can be prevented. [0880] In S15A-3, the influence detecting means 23 determines whether or not the display layout of the current partial data is affected by the display layout of the immediately preceding partial data (execution of the effect detection step). If determined, proceed to S15A-4, otherwise, exit to P200. As a result, if the affected part data is not detected in the influence detection step, it is possible to proceed to the display processing using the display layout of the acquired current part data.

[0881] In order to determine whether or not it is affected, for example, there is a method using the processing auxiliary data in Fig. 43. The section “Presence or absence of influence” in FIG. 43 is information (impact information) on whether or not the processing result of each partial data is affected.Here, each partial data is affected by the previous partial data. Or not.

[0882] In addition, the "start tag auxiliary information" in Fig. 43 indicates, as described above, whether or not there is a start tag that is still in effect for certain focused partial data. For example, focusing on the partial data 402 in FIG. 7B, the processing auxiliary data 102 corresponding to the partial data 402 includes start tag auxiliary information of font size = “+ l”>. Therefore, font size = "+1">! When the influence detection means 23 detects the start tag auxiliary information at the time of executing the influence detection step, the effect of the start tag "font size =" + l "> is continued in the partial data 402. Can be determined. As a result, the immediately preceding partial data 401 can be made a candidate for the affected partial data.

[0883] Whether or not the partial data 400 becomes the affected partial data with respect to the partial data 401 may be determined by checking the processing auxiliary data 101 corresponding to the partial data 401 in the same manner. Then, the processing auxiliary data 101 does not include the start tag auxiliary information of “font size =“ + l ”>. Therefore, the partial data 401 is the last affected partial data having the start tag. Can be determined. As a result, in order to obtain the display layout of the partial data 402, it is understood that the partial data 401 and 402 should be processed as a continuous data.

[0884] Since the partial data immediately before or immediately after the desired partial data is relatively likely to affect the processing result of the desired partial data, it is not possible to start examining the partial data immediately before or immediately after the desired partial data. Thus, the detection efficiency of the affected part data is improved. Therefore, partial data that is not necessary to obtain a predetermined processing result is The effect of suppressing unnecessary processing that is targeted can be obtained.

[0885] When the processing auxiliary data is not used, the only choice is to directly examine the partial data and display layout. The method of determination will be described later with reference to FIG. 52 along with the description of the method of generating a display layout.

[0886] In general, it is faster and more resource-saving to make a determination using information on the influence on the previously created processing auxiliary data than to make a determination by directly examining the partial data and display layout. come.

[0887] In S15A-4, the previous partial data is temporarily set as the current partial data.

Performs the processing of 5 and returns the setting of the current partial data, and proceeds to S15A-5. The process of S15A-4 is a so-called recursive process that repeats the processes of S15A-1 to S15A-5.

[0888] This iterative process is repeated until S15A-2 S15A-3, the partial data immediately before the current partial data (including the temporary data) is determined to be unnecessary or has no effect. Will be repeated. Put simply, it means to process (repeat) till all the previous blocks affected have been processed.

[0889] In S15A-5, the layout generation unit 25 generates a display layout of the current partial data, passes the display layout to the layout storage unit 27 and the layout display unit 28, and exits to P200.

[0890] The processing of S15A-1 to S15A-5 described above enables the processing of S15 in Fig. 49, that is, the processing of reacquiring the display layout of the current partial data in consideration of the influence.

[0891] In addition, the recursive processing that repeats the processing from S15A-1 to S15A-5 gives an effect such as the affected part data to the desired part data and the affected part data that further affects the affected part data. All matching partial data are extracted, and those partial data are processed by the layout generating means 25 as a series of data. Therefore, the recursive processing power of repeating the processing from S15A-1 to S15A-5 corresponds to the partial data processing step of the present invention, and the layout generating means 25 corresponds to the partial data processing means of the present invention.

[0892] Also, in a recursive process in which the processes from S15A-1 to S15A-5 are repeated, when the display layout of the current portion data is newly acquired and stored again in the layout storage means 27, the influence portion data capacity is reduced. Process the range up to the current partial data as a continuous data It is preferable to hold the information that the processing has been performed in association with the processing result of the current partial data, such as the processing auxiliary data 100-108, 600-608, and the like.

[0893] This makes it possible to take into account the information that the data has been processed as a series of data. When the display layout of the current partial data is used later, it is not necessary to execute the influence detection step again, and the processing efficiency is improved. A dagger can be planned.

[0894] FIG. 51 is a flowchart illustrating another method of the process of S15 in FIG. 49, that is, a process of acquiring the display layout of the current partial data in consideration of the influence.

[0895] In S15B-1 after P100, the foremost partial data detection means 29 obtains the foremost partial data that affects the display layout of the current partial data (execution of the influence detection step), and proceeds to S15B-2. . If the current partial data is not affected by the previous partial data, the first partial data is the current partial data itself.

[0896] Similar to S15A-3, for example, there is a method of using the processing auxiliary data in Fig. 44 to obtain the partial data that is affected before. The section of “influence block” in FIG. 44 is information on the partial data that affects the processing result of each partial data, and here, represents the earliest partial data that is affected by each partial data. In FIG. 44, the data number of the processing auxiliary data is not replaced by the data number of the partial data so that the correspondence can be easily divided. Since the power partial data and the processing auxiliary data have a one-to-one correspondence, either one may be used.

[0897] When the processing auxiliary data is not used, as in S15A-3, there is no choice but to directly examine the partial data and display layout. The details of the determination method will be described later with reference to FIG. 52, together with the description of the display layout generation method.

[0898] The advantage of using the processing auxiliary data as shown in Fig. 44 is the same as the advantage described in S15A-3.

[0899] In S15B-2, the display layout is generated in order from the previous partial data obtained in S15B-1 to the current partial data as a continuous data, and the process exits to P200. Therefore, S15B-2 corresponds to the partial data processing step of the present invention. Here, it is assumed that the display layout stored in the layout storage unit 27 is not used, but all are generated.

[0900] Note that, here, in order to simplify the processing, the display layout is not generated, and the display layout is not used. You can use the saved layout if you can verify that it was generated with the effect.

[0901] Through the processing from S15B-1 to S15B-2, the processing in S15 in FIG. 49, that is, the processing for acquiring the display layout of the current partial data in consideration of the influence can be performed.

[0902] The difference between the processes of Fig. 50 and Fig. 51 will be described later.

[0903] Fig. 52 is a flowchart for explaining the details of the processing for generating the partial data force display layout. This corresponds to the processing of S15A-5 in Fig. 50. The process of generating the display layout as the processing result varies depending on the purpose of the application and the like and the electronic data.Here, like the WWW browser, the display layout is generated from the HTML data in FIGS. 4B and 7B. The display process will be described.

The process of FIG. 52 is a process of generating a display layout from one piece of partial data and processing auxiliary data having no information on “presence / absence”. If there is a display layout of the partial data immediately before the desired partial data, and this may affect the processing result of the desired partial data, the display layout of the partial data immediately before the desired partial data is added. Generate the display layout of the partial data of.

[0905] In general, document data in XHTML format or extensible markup language (XML) format can express tree-structured (hierarchical) data using tags. There are APIs (application programming interface) such as DOM (document object model) and SAX (simple API for XML) as a processing method.

[0906] When using the DOM, first, all XML data is read, and tree-structured data is created in a memory or the like. By accessing this tree-structured data, it is possible to quickly access any element data in any hierarchy. When processing XML data, this hierarchy is interpreted sequentially to generate a display layout.

[0907] When SAX is used, tree-structured data is not generated, and when a start tag, TEXT, and end tag are read, the read start tag, TEXT, and end tag are interpreted to generate a display layout. I do. [0908] Regardless of the method used, the same display layout result can be obtained if the interpretation of tags and the like is the same. From the viewpoint of generating a display layout, if the processing result changes depending on the hierarchy at which the data being interpreted exists, the DOM uses the API to convert the information of the hierarchical structure into a tree. Since the information is stored as a structure, it is easy to obtain information as to which hierarchical level it is. Since SAX does not hold hierarchical data on the API side, it is necessary for the processing side to hold hierarchical information as needed. However, since the DOM holds all the information of the document data as tree-structured data, it has disadvantages such as a long processing time and a large data storage area.

[0909] When high-speed, resource-saving processing is intended as in the present invention, processing with SAX is preferable. However, in the SAX processing method, the reading and processing of data are integrated, making it difficult to explain. Therefore, the method of processing using DOM is described here.

[0910] First, in step SL21 (hereinafter, "step 3" is abbreviated as "3"), the layout generation unit 25 reads the start tag auxiliary information from the processing auxiliary data of the current partial data, and executes SL22. The process proceeds to. The start tag auxiliary information is obtained from the processing auxiliary data in FIG. Since the operation subject of each step in FIG. 52 is all the layout generating means 25, the description of the operation subject in each step will be omitted.

[0911] In SL22, the current partial data is read, and the process proceeds to SL23.

[0912] In SL23, the processing auxiliary data input end tag auxiliary information of the current partial data is read, and the process proceeds to SL24.

[0913] With the above SL21 to SL23, the document data necessary for interpreting the current partial data can be obtained. Here, it is assumed that the DOM processes these document data to generate tree-structured data. If the start tag auxiliary information and the end tag auxiliary information of the processing auxiliary data are not used, the start tag auxiliary information and the end tag auxiliary information are embedded in the partial data itself, that is, the divided HTML data It is assumed that the data is obtained by adding the missing start tag and end tag character strings before and after.

[0914] In SL24, all display layout elements in the current partial data are generated from the read document data, and the process proceeds to SL25. By interpreting the tags ゃ TEXT of each layer in order from the tree-structured data, and generating display layout elements in the format of Fig. 45, , Generate all display layout elements. Leave undetermined parts, such as the position of each element, blank. The generated display layout elements are temporarily stored in an array in the order of generation (hereinafter, referred to as “generated display layout element array”).

[0915] How the display layout element is generated depends on each tag and TEXT. However, the display of individual tags appearing in the document data in FIG. 4B has been described above. Here, how the tree structure data is generated as a display layout element will be described in a hierarchy.

[0916] The elements are generated while interpreting each level of the tree structure data in ascending order, and interpreting the TEXT included in each level in order of one character at a time. , Character size and character color are required. The first is the standard font size and font color. For this, standard settings are determined by applications and devices. When the size of the standard character is set by the user, that priority is given. For example, assume that the character size is 10 points and the character color is black in the standard settings.

[0917] For example, in lines 4 and 3 of FIG. 4B, “ku font color =“ red ”size =“ +3 ”> How does

LCD works? When interpreting the hierarchy generated from "Zfont>", the color of the character is red because the color attribute is red in this hierarchy, and the size attribute is +3, so the size of the character is increased by three levels. Here, it is assumed that the size is increased by 2 points each time the size is increased by one step, so that the size is increased by 16 points.

[0918] Next, the TEXT “How does LCD works?” In this hierarchy is interpreted one character at a time. Generate the character element (type "CHAR") shown in Fig. 45 for each character, set the character code to "content", and set "width" and "height" from the character code and character size. Although there is no character color information in the data structure example of the character element shown in FIG. 45, it is assumed here that a character color item is provided in the display layout element data and set. The "start byte" and "byte size" can also be set if they are checked when generating the tree structure data. "Offset X" and "Offset Y" are left blank because their positions have not been determined yet. The generated character elements are added to the generated display layout element array in order.

[0919] Then, when the processing of this layer ends, the character size and character color are returned to the standard settings (10 points and black). [0920] The next level is the level of the br tag on the third line in Figure 4B, which only indicates a line break. Since the position of each element and the line data to which it belongs are not specified yet, let's use a character element with a line feed code as the character code for the time being. The other items do not need to be set.

In the next layer, the font on the fifth line in Fig. 4B is also the layer of the font tag up to the 16th line. In this case, the character color remains black, and the size of the character increases by one level from the standard size to 12 points. Become.

[0921] The layer below it is the p tag hierarchy from line 6 to line 15 in Fig. 4B, but it is displayed as a slight vertical space and line break at the start tag, and as a line break and some vertical space at the end tag Therefore, it is assumed here that a character element having the same width as the width of the display means and a character element of a line feed code are generated. The height of the preceding character element is the vertical space (for example, the size of the current character), and the content is set to “blank”. Note that there is no way to create a vertical space element of the type "VSPACE", which is not shown in Fig. 45, which is different from a blank character element.

[0922] TEXT in the hierarchy of the p tag generates character elements one character at a time, with a character size of 12 points and a character color of black.

[0923] Also, in the layer of the IMG tag on the 28th line in Fig. 4B, an image element (IMAGE in Fig. 45) is generated, an image file with the specified file name is read, and the image data is expanded. The content data is set, and the size of the image is set as the width and height. Set the start byte and byte size as well as other element data. If wraparound is specified in the align attribute, add a wraparound item for the image element to the data of the display layout element shown in Fig. By setting a new type (such as RIMAGE when align is right) so that it can be identified later.

[0924] In SL25, if there is line data that can be added following the display layout element of the next partial data after the display layout element of the previous partial data (hereinafter simply referred to as addable line data), Then, the line data is set as the current line data, and the process proceeds to SL26. If there is no line data that can be added, a new line is created and added to the line data array, and a new V, line is set as the current line. [0925] In other words, the line data that can be added is line data in which the display layout of the previous partial data exists and the final layout line does not end with a line feed. The final layout row is obtained from the block management data shown in FIG. Therefore, if the final layout line is not set in the block management data of the previous partial data (if it is blank), it is determined that there is no line data that can be added! And new line data must be created.ょ

[0926] After the current line is set, the current line is set as the start line of the block management data of the next partial data.

[0927] New, row data, width, height and element array are blank. The number of elements is also 0. The start position of arrangement and the end position of arrangement are often set to predetermined values. For example, the arrangement start position is set to 0, and the arrangement end position is set to the width of the display means. Alternatively, in order to provide blanks (margins) on the left and right, the start position where arrangement is possible is set to the left margin amount, and the end position where arrangement is possible is set to a value obtained by subtracting the width and right margin amount of the display means. The next element is placed at the start position where it can be placed.

[0928] In SL26, the first display layout element is set as the current element, and the process proceeds to SL27. Use the first element of the generated display layout element array created with SL24.

[0929] In SL27, it is determined whether or not the current element is a line feed. If the current element is a line feed, the process proceeds to SL28; if not, the process proceeds to SL30. In this case, it is necessary to judge whether it is a character element that has the contents of the line feed code! ヽ.

[0930] In SL28, a line feed attribute is set for the current line, and the process proceeds to SL29. As for the line feed attribute, the item of “line feed attribute” may be added to the line data in FIG. 46, or the value of the item of the next element arrangement position is set to a value equal to or more than the arrangement possible end position, and the line It may be possible to provide an equivalent function by preventing elements from being added to.

[0931] In SL29, if there is row data next to the current row, that row is set as the current row data. If not, new row data is generated and the row data array is created. Add, set to current line data, and proceed to SL37.

[0932] In the processing of SL28 and SL29, the current line is the next line, so this means that a line break has occurred. Note that the reason why the line break attribute is set in SL28 while the current line is updated in SL29 is that if the next element of the partial data does not exist, the line with the line break attribute set in SL28 This is the final layout line, but to prevent the next partial data element from being added to that line.

[0933] When updating the current row, it is necessary to set the height of the old current row, the offset Y of each element in the current row, and the like. The tallest of the elements is the row height. However, wraparound images are not counted. The processing related to the wraparound image height and the row height will be described later. In the example of FIG. 47, the height of the first uppercase letter element such as “H” is the line height LH. The offset Y of each element is (row height) (element height). In the example of FIG. 47, the gap between the upper side of the rectangle 500 in the row range and the upper side of each element is the offset Y.

[0934] The setting of each item of the new line data may be the same as the setting described in SL25, but is slightly different when there is a wraparound image. The setting when there is a wraparound image will be described later.

[0935] If the current element is not a line feed at SL27, at SL30 it is determined whether the current element is a wraparound image. If it is a wraparound image, the process proceeds to SL31.

Continue to SL33. Whether the image is a wraparound image is determined by the method described when generating element data from the IMG tag in SL24.

[0936] In SL31, it is determined whether or not the wraparound image element can be arranged on the current line. If the arrangement is possible, the process proceeds to SL36. If the arrangement is not possible, the process proceeds to SL32. If the element to be placed at the right end (align = "right"), in the current line,

(Image element width) ≤ (Positionable end position)-(Next element position)

At this time, it may be determined that the arrangement is possible. If the element to be placed at the left end (align = "left"),

(Possible start position) = (Next element position)

Then, it may be determined that the arrangement is possible.

[0937] In SL32, if there is row data next to the current row, that row is set as the current row data. If not, new row data is generated and the row data array is created. Add, set to the current line data, and return to SL31. The processing here is the same as in SL29.

[0938] Until processing of SL31 and SL32 finds a placeable line that fits the width of the image element Will be repeated.

[0939] In SL36, the wraparound image is arranged on the current line, the arrangement start position or the arrangement end position of the line data is updated, and the process proceeds to SL37.

[0940] The image element placement position (offset X) is the image element to be placed at the right end (align = "righ t").

(Offset X) = (Possible ending position) (Image element width)

And the element to be placed at the left end (align = "left"),

(Offset X) = (Possible start position)

It is.

[0941] After setting the arrangement position of the image element, the line data of the current line is updated. If the image element to be placed at the right end (align = "right"),

(New posable ending position) = (old possible ending position)-(image element width), if the element to be placed at the left end (align = "left"),

Update the row data to (new start position) = (old start position) + (image element width). This prevents other elements from being arranged in the image portion of the row.

[0942] Note that even if it is determined that the image element can be arranged in the SL31, an image element having a width larger than the width of the line cannot be accommodated in any line. become.

[0943] The SL33 determines whether the current element can be additionally placed on the current line, and if possible,

Proceed to SL35, otherwise proceed to SL34. Whether additional placement is possible,

(Next element placement position) + (Current element width) ≤ (Placeable end position)

Judgment is based on the ability to satisfy That is, it is determined whether or not there is a sufficient width on the right of the next element arrangement position to arrange the current element.

[0944] In SL34, if row data next to the current row exists, that row is set as the current row data. If not, new row data is generated and the row data array is created. Add, set to the current line data, and proceed to SL35. The processing here is the same as in SL29.

[0945] In SL35, the current element is arranged at the next element arrangement position of the current line, the value of the next element arrangement position is updated, and the flow advances to SL37. That is, (Current element offset X) = (Next element placement position of current line)

And set

(Next element placement position of new current line) = (Next element placement position of previous current line) + (Width of current element)

And update.

[0946] If the arrangement processing is expressed in terms of a display layout, for example, when a character element is arranged, if additional arrangement is possible with S L33, a character is added to the end of the current line, and if additional arrangement is not possible. , Is arranged at the beginning of the next line, and so on.

[0947] In SL37, it is determined whether or not the next display layout element exists in the generated display layout element array. If so, the process proceeds to SL38, and if not, the process proceeds to SL39.

[0948] In SL38, the next display layout element in the generated display layout element array is set as the current element, and the flow returns to SL27.

In SL39, the end row of the block management data of the partial data, the final layout row, the processing auxiliary data, and the presence / absence of the processing auxiliary data are set, and the display layout generation processing is exited.

[0950] Since the line in which the last element is laid out is the final layout line, the current line is set as the final layout line. For the last line, set the last layout line among all the layout lines of this partial data. In the processing auxiliary data of the block management data, an index number (100-108) of the processing auxiliary data is set as shown in FIG.

[0951] Regarding the influence of the processing auxiliary data in Fig. 43, if the final layout line ends with a line feed, there is no effect; if it does not end with a line feed, there is an effect. Whether or not the final layout line ends with a line feed can be determined based on whether or not the final layout line has a line feed attribute.

[0952] In addition, when considering a wraparound image that can only be affected by line breaks as the presence or absence of an influence, it is necessary to judge whether or not there is enough room to wrap around a new line and lay out. If the final layout line matches the end line, the next time a layout element is added, the layout must be laid out on the end line or the next new line, so it is determined that there is no effect in this case. If the final layout line does not match the end line, the next line after the final layout line It is assumed that there is an impact because it can be added.

[0953] Note that the affected part data in Fig. 44 (representing the foremost affected part data) can be obtained from the section on the presence / absence of the processing auxiliary data of each partial data. In order to obtain the partial data before the one that affects a certain block, the influence of the block management data of the partial data before the partial data of interest is examined in order, and the extent of the influence continues. You only have to bite.

[0954] For example, if attention is paid to the fact that the presence or absence of the influence of the partial data is "absent", the partial data is not affected by the previous partial data power, so the affected partial data is set as the partial data itself. (For example, the correspondence between the processing auxiliary data 104 in FIG. 43 and the processing auxiliary data 604 in FIG. 44).

[0955] For example, if the presence or absence of the influence of the partial data is "existent" and the presence or absence of the influence of the immediately preceding partial data is "absent", for example, The affected partial data is the previous partial data (for example, the correspondence between the processing auxiliary data 107 in FIG. 43 and the processing auxiliary data 607 in FIG. 44).

[0956] Further, for example, if the presence / absence of the partial data of interest and the previous partial data is "present" and the presence / absence of the previous partial data is "absent", the partial data The affected partial data is the previous partial data (for example, the correspondence between the processing auxiliary data 103 in FIG. 43 and the processing auxiliary data 603 in FIG. 44).

[0957] The display layout of the partial data is generated by the processing from SL21 to SL39.

[0958] The display layout generation processing will be described with reference to the example of Fig. 47. First, a current line is generated, and the arrangement start position and the next element arrangement position are set to the position 502 in Fig. 47, and the arrangement end position is set to the position 504. Is set to Next, the first letter "H" becomes the current element, and the width of "H" fits on the current line, so it is placed at position 502. The next element arrangement position is increased by the width of “H” to be position 503. The next character "o" becomes the current element and is located at position 503, and the next element is located at position 506. In this way, the last character “?” Is arranged, and the next element position is position 507.

[0959] In the partial data 400, the line feed character by the br tag becomes the current element, and a line feed attribute is set for the current line (the next element arrangement position is set to position 504). And the new line The generated start position and the next element position are set at position 508, the end position is set at position 509, and the current line is set. In Figure 47, the new line is represented by the dotted rectangle below the rectangle 500.The height is not actually determined until a line break.

[0960] The arrangement position of each character element is basically determined by the next element arrangement position, and the distance between the character elements is zero. However, in many word processors and printing, a process called queuing adjustment may be performed to make the display result easier to see. Kayung adjustment means adjusting the distance between characters and words so that the horizontal position of the character at the end of a line is aligned with the previous and next lines when there is no line feed. These processes can be performed simultaneously with the process of obtaining the row height. In the present invention, queuing adjustment is not essential, but in order to make it easier to emphasize the unnaturalness when the effect of line breaks is not taken into account, the display processing results are shown using the display layout after kerning adjustment. RU

[0961] (Processing example 2)

FIGS. 53 and 54 are explanatory diagrams illustrating a process of generating a partial data having a wraparound image (for example, the partial data 406 in FIG. 7B).

First, a new row 526 is generated, and an arrangement start position and a next element arrangement position are set to position 520, and an arrangement end position is set to position 522.

[0963] The first part of the partial data 406 is an IMG tag, and since it is a wraparound image with align = "right", first, the image element 528 is processed as the current element. Since the image element 528 is arranged at the right end, the arrangement position of the image element 528 is determined at the position 521 so as to be at the right end of the row 526. As a result, the operable end position is updated to the position 521. Thus, this subsequent element is located between position 520 and position 521.

[0964] After that, the first character element "F" to the character element "D" are arranged one by one. It is assumed that after the character element “D” has been arranged, the next element arrangement position is near position 521. It is assumed that the next character element “t” does not fit between the next element arrangement position (the right end of “D”) and position 521. Then, the next row 527 is generated, and the height and the like of the row 526 are set, since the next row must be arranged.

[0965] Next, the arrangement start position and the next element arrangement position in row 527 are set to position 523, and the arrangement end position is set. The end position is temporarily set to position 525.

[0966] Since the height of the line 526 is the maximum height of the character elements other than the wraparound image element 528, the height is LH1 as shown in FIG. At this time, since the height of the image element 528 is larger than LH1, it does not fit in the row 526. Therefore, it is divided into the next line 527. Fig. 54 shows the divided state. Image element 528 is split into image element 529 in row 526 and image element 530 in row 527. The height of the image element 529 is LH1, and the height of the image element 530 is the height of the image element 528 minus LH1. In the image content, the image element 529 also has an upper force of LH1 and the image element 530 has the remaining upper LH1.

[0967] Similar to image element 529, the arrangement position of image element 530 is determined to be position 524 so as to be at the right end of the row. Then, the possible placement end position in row 527 is updated to position 524. This places the subsequent element between position 523 and position 524.

[0968] Then, character element "t" that could not be arranged on line 526 is arranged at the head position 523 of power line 527. This means that, in terms of display layout, a character string is wrapped around by a wraparound image and is laid out.

[0969] In this manner, the display layout of the wraparound image is generated. Note that in FIG. 53, as compared with FIG. 5B, the force that leaves no margin around the wraparound image or the force that does not take the line spacing into account is used. Is processed in consideration of these values.

[0970] (Processing example 3)

In the above example, the display layout is obtained in the order of the top power.Next, as an example of obtaining the display layout from the bottom, the range of one page is displayed from the state of FIG. 17F. . In other words, the second line of FIG. 17F also displays a new page for one page. In this state, it is assumed that the display layouts of the partial data 402 to 405 are stored by the layout storage unit 27.

[0971] Fig. 55 is an explanatory diagram for explaining the processing order of the layout generating means 25 at this time. Processes 706-709 indicated by a dotted frame in the figure are a series of processes (S15) in FIG. 50 performed by setting current partial data, and processes 701-705 are processes for acquiring and generating a layout. Yes, part of processing 706-709. Figure 50 shows the nested dotted frame. Means that S15 is called recursively in S15A-4. Each process is assumed to be processed from top to bottom. Note that the description below will not be repeated in the following description.

[0972] First, based on the fact that the desired display range starts on the second line in Fig. 17F, the partial data 402 including the second line in Fig. 17F becomes the first current partial data (S13 in Fig. 49). Then, the process of acquiring the display layout of the partial data 402 in consideration of the influence of the division is started (process 706 in FIG. 55, S14 and S15 in FIG. 49).

[0973] To obtain the display layout of the partial data 402 in consideration of the influence of the division, first, the display layout of the partial data 402 is obtained from the layout storage unit 27 (process 701, S15A-1 in FIG. 50). Since the power of the first line in FIG. 17F is not enough to compare the height up to the second line with that of one page, it is understood that the display layout of the partial data 401 before that is necessary (S15A-2).

[0974] From the processing auxiliary data 102 in Fig. 43 corresponding to the partial data 402, it is known that the partial data 402 is affected by the partial data 401 (S15A-3). The process of acquiring the information is started in consideration (process 707, S15A-4).

[0975] The process in Fig. 50 is performed recursively with the current partial data as the partial data 401. Since the display layout of the partial data 401 is not stored in the layout storage unit 27, a display layout of the partial data 401 is generated (processing 702, S15A-1). Since the partial data 401 is not affected by the further required partial data 400 (S15A-2), the recursive processing power is lost (S15A-3).

[0976] As a result, the recursive process (S15A-4) of the partial data 401 is completed, and the display layout of the current partial data (the partial data 402) is changed to the display layout of the partial data 401 generated in the above process 702. Generate (Process 703, S15A-5). That is, the partial data 401 and 402 are processed as a continuous data. As a result, the display layout of the partial data 402 stored in the layout storage unit 27 is updated.

[0977] Since there is partial data 401 before the current partial data (partial data 402) (S16 in Fig. 49), the partial data 401 is set as the current partial data. (S17)

Repeat S14 and S17 to acquire and generate display layout in the order of partial data 401 and 400 (Processing 708, 709). Since the partial data 401 and 400 are not affected by each other, no recursive processing is performed here.

[0978] Since one page is specified above, the processing from S19 to S22 is not performed, the processing for acquiring the display layout of the desired display range ends, and the display processing is performed (S23).

[0979] According to FIG. 55, the layout used for display is generated by the partial data 401 in processing 702 and the processing 7

The partial data 402 of 03 and the partial data 400 of process 705 are performed in this order. From this, it is possible to obtain the processing result of the partial data 402 in consideration of the influence of the partial data 401!

[0980] The final display obtained in this way is as shown in Fig. 18B. Compared to FIG. 17F, the “When” line is laid out continuously with the last “glass.” Of the partial data 401. This is a force that regenerates the display layout of the partial data 402 so that the display layout of the partial data 401 is laid out continuously since the necessary partial data 401 affects the partial data 402.

[0981] This is the same as finally generating the block data 401 and 402 in this order. In other words, the block data 401 and the block data 402 are processed as a continuous data. As a result, the processing can be performed without the influence between blocks.

Note that the layout of the “Each” line has changed, so the specification of one page above the “Each” line in FIG. 17F must be specified in a byte position. For example, one page from the line containing the byte position of the element before "Each".

[0982] If processing is performed without regenerating the display layout of the partial data 402, the result is as shown in Fig. 19B. Compared to FIG. 18B, the part after the last “glass.” Of the partial data 401 becomes a line break, and “When” comes to the beginning of the next line. Since this is not a line break specified in the HTML data, it is a display layout that shows errors. In other words, it can be called a display layout that is included in the original data and in which the data appears as a processing result, or a display layout that results from the original data being altered due to the influence of the division.

[0983] As described above, when the display layout of the previous partial data is affected, the display layout of the previous partial data is obtained first, and then the display layout of the partial data is changed. By re-generating the data as needed, an effect is obtained in which a display layout can be obtained in which the meaning of the data is not impaired.

[0984] In Fig. 18B, the upper part of the display layout of the first partial data 400 is empty. In such a case, many WWW browsers display the display layout of the partial data 400 from the beginning of the display range, and if there is a space after the “Each” line, the display layout below it can be displayed. Many. In this case, specify p dots above the reference position, q dots below, etc. If there are only r dots (r−p) above, the maximum (q + p− r) In order to obtain a display layout within the range of dots, the judgment should be made in S14 and S19 in FIG.

[0985] By performing such processing, the display of FIG. 18B becomes a display as shown in FIG. 18C. If there is a space below the display layout of the last partial data when the next page is turned rather than just the previous page, the same view can be used to make up for the downward display layout.

[0986] (Processing example 4)

In the example of FIG. 18B, the force based on a certain byte position in the partial data 402 is assumed. For example, assuming that the display layout of the partial data 402 and 403 is stored, the force is determined based on a certain byte position in the partial data 403. The process for displaying one page in the direction will be described. FIG. 56 is an explanatory diagram for explaining the processing order of the processing at this time. Similarly to FIG. 55, processes 610-617 are processes for acquiring and generating a layout, and processes 618-623 indicated by dotted frames in the figure are a series of processes in FIG. 50 performed by setting current partial data. It is.

[0987] Detailed processing will be omitted and only the processing flow will be described with reference to Fig. 56. First, in processing 618, display layout acquisition processing in which the partial data 403 is used as current partial data and the effect is taken into consideration is started. Specifically, first, in step 610, the display layout in which the partial data 403 is stored is obtained.

[0988] Since the partial data 403 is affected by the partial data 402, the process proceeds to a process 619 in which the partial data 402 is used as the current partial data and the display layout is acquired in consideration of the influence. Thereby, the display layout in which the partial data 402 is stored is acquired in the process 611. [0989] However, since the partial data 402 is further affected by the partial data 401, the process 620 shifts to a process of acquiring the display layout in consideration of the influence of the partial data 401 as the current partial data. Since the partial data 401 is not affected by the partial data 400, the display layout of the partial data 401 is generated in the process 612, and the process 620 ends.

[0990] Returning to the process 619, the display layout of the partial data 402 is generated again by generating the display layout of the partial data 402 following the display layout of the partial data 401 in the process 613. Then, the display layout of the stored partial data 402 is updated, and the process 619 is omitted. Next, in step 618, in step 614, the display layout of the partial data 403 is generated again by generating the display layout of the partial data 403 following the display layout of the partial data 402. Then, the display layout of the stored partial data 403 is updated, and the process 618 ends.

[0991] In a process 621, acquisition of a display layout in consideration of the influence is started with the partial data 402 as current partial data. More specifically, in the process 615, the layout in which the partial data 402 is stored is acquired, and the process 621 ends.

[0992] Subsequently, in a process 622, acquisition of a layout considering the influence of the partial data 401 as the current partial data is started. More specifically, in process 616, the display layout in which the partial data 401 is stored is acquired, and the process 622 ends.

[0993] Finally, in process 623, acquisition of a layout taking into account the influence of the partial data 400 as the current partial data is started. More specifically, in process 617, a layout of the partial data 400 is generated, and the process 623 ends.

As described above, according to FIG. 56, the display layout is generated in the order of the partial data 401 of the process 612, the partial data 402 of the process 613, the partial data 403 of the process 614, and the partial data 400 of the process 617. Has been done. That is, each display layout is generated in consideration of the influence of the partial data 401 and the influence of the partial data 402 and the influence of the partial data 402 and the partial data 403.

[0995] In this way, even if the influence exists between three or more consecutive blocks, the affected partial data is processed first, and the display layout of the affected partial data is subsequently generated. Fixing does not impair the meaning of the data! / ヽ The effect that can be done comes out.

[0996] (Processing example 5)

The examples of FIGS. 55 and 56 are based on the processing method of FIG. 50. The processing method slightly changes when the processing method of FIG. 51 is based. FIG. 57 is an explanatory diagram illustrating a processing procedure when a desired display rate range in the case of FIG. 56 is processed based on the processing method of FIG. 51. As in FIG. 55, processes 630 to 635 are processes for acquiring and generating a layout, and processes 636 to 639 indicated by a dotted frame in the diagram are a series of processes in FIG. 51 performed by setting current partial data. It is.

[0997] First, in process 636, acquisition of a display layout in consideration of the influence is started with the partial data 403 as current partial data. In processing 636, the foremost partial data affecting the partial data 403 is obtained (S15B-1 in FIG. 51). 44, it can be seen that the partial data 401 is the foremost partial data that affects the partial data 403.

[0998] Therefore, in processes 630, 631, and 632, the display layouts of the partial data 401, 402, and 403 are successively generated in succession, and the generated display layouts are stored in the layout storage unit 27 and processed 636. Finish.

[0999] In the process 637, the display layout is acquired with the partial data 402 as the current partial data in consideration of the influence. That is, in the process 633, the display layout in which the partial data 402 is stored is acquired, and the process 637 ends.

[1000] In the process 638, the display layout is acquired by taking the partial data 401 as the current partial data and considering the influence. That is, in the process 634, the display layout in which the partial data 401 is stored is acquired, and the process 638 ends.

[1001] In the process 639, the display layout is acquired with the partial data 400 as the current partial data taking into account the influence. In processing 635, a display layout of the partial data 400 is newly generated, and the processing 639 ends.

[1002] As shown in FIG. 57, the generation outside the display layer is performed in the order of the partial data 401, 402, 403, and 400 as in FIG.

[1003] Comparing Fig. 56 and Fig. 57, the ability to recursively determine the blocks that affect Processed in order or looks like a difference. The range of finding blocks that affect the force is different. In the process of FIG. 50, the range to be obtained is limited to blocks having a display layout within a desired display layout range by determining whether or not the block is necessary in S15A-2. In the processing of FIG. 51, there is no limitation on the range to be obtained.

[1004] For example, it is assumed that only the display layout of the partial data 403 is included in the desired display range, and the display layout of the partial data 401 and 402 is not included. The partial data affecting the partial data 403 is the partial data 401 from the processing auxiliary data 603. At this time, in the process of FIG. 50, only the layout of the partial data 403 is obtained. In FIG. 51, a layout is generated in the order of the partial data 401, 402, and 403, and only the layout of the partial data 403 is used.

[1005] Both processing results do not impair the meaning of the data without error as the display layout of HTML data. The advantage of the processing in FIG. 50 is that the layout of the range (partial data 401, 402) is not wasted, but is not used for the immediate display. However, if a slightly higher portion is to be displayed, the layout of the partial data 403 must be generated again after the partial data 402, and the layout will not be able to be generated. There is a disadvantage.

[1006] Further, since the layout may be regenerated depending on the display range, there is a disadvantage that the display result at the same byte position may be changed even though the display setting is not changed. For example, in both Fig. 17F and Fig. 18B, there is no error in the display layout of HTML data. Force (with no saved display layout) is displayed as shown in Fig. 17F, and then one page is displayed. When the display in Fig. 18B is performed, the X positions in the line of the "Each" part are different from each other. Some users may find such changes inconvenient to follow the text.

[1007] In the processing shown in FIG. 51, the display layout of a desired display range is extracted from the display layout up to a desired block without fail, and the above-described display layout of a desired display range is extracted from the display layout. There is an advantage that the problem of different X positions does not occur.

[1008] Both the processing in Fig. 50 and the processing in Fig. 51 have advantages and disadvantages, and thus may be used properly according to the purpose. [1009] In S15A-5 of FIG. 50 and S15B-1 of FIG. 51, unnecessary generation processing for generating the display layout of the partial data can be omitted. For example, a method of having a “continuous generation flag” item for determining whether the display layout of each block is generated following the previous block in the block management data is conceivable. If it can be determined from the continuous generation flag section that data is generated following the previous block, there is no need to generate a partial data display layout in S15A-5 in FIG. In other words, the saved display layout can be used.

[1010] However, when the layout of the previous partial data is regenerated by the recursive processing of S15A-4, it is necessary to clear the term of the continuous generation flag of the next block management data. If the continuous generation flag is set also in the subsequent block management data, it is necessary to clear all the items. Then, when re-generating in S15A-5, a setting is made so as to raise the item of the continuous generation flag.

[1011] By providing information for determining whether or not the display layout of each block is generated following the previous block, unnecessary processing of layout can be avoided, which is effective. come.

[1012] (Processing example 6)

In the above example, the processing method is the same for the influence between blocks, mainly in the case of the wraparound of the force image described in the example of the effect of the line feed. FIG. 19E shows an example in which the lower range of one page from the “One such” part in the partial data 407 is displayed. Since the layout is generated from the partial data 407, it is not displayed, but it can be seen that the part starting with "rsharp is" is located at the beginning of the line.

[1013] FIG. 19C is an example in which a range one page higher than the first line displayed in FIG. 19E is displayed. The first line displayed in FIG. 19E is included in the partial data 407 according to the partial data in FIG. 7B. Further, according to the processing auxiliary data of FIG. 44, the partial data 407 is affected by the partial data 406. Then, based on the method of the present invention, the display layout is regenerated by treating the partial data 406-407 as a continuous data. As a result, with respect to the partial data 407, a portion starting with “Sharp is” is arranged in the wraparound portion of the image, following the display layout of the partial data 406. [1014] The partial data 405 is also laid out to make up for the lack of layout for one page.

[1015] In both FIG. 19C and FIG. 19E, no error appears as the display layout result of the HTML data, and the meaning of the original data is impaired.

[1016] FIG. 19D shows an example of displaying a range one page higher than the displayed first line of FIG. 19E, similarly to FIG. 19C. A layout of partial data 407 is generated as in the present invention. This is an example in which the layout is simply connected to the layout of the partial data 406 without correction. When comparing FIG. 19D with FIG. 19C, the display layout of the partial data 406 and the display layout of the partial data 407 are not considered because the display result of the partial data 406 does not affect the display result of the partial data 407. Are processed independently. For this reason, the wraparound portion of the image is vacant, and the content of the partial data 407 is located next to the line including the lower end of the image, that is, the word V, in other words, next to the display layout range of the partial data 406. The head of the line is laid out. Since such blanks and line feeds are not specified in the original HTML data, an error has occurred in the display result, and the meaning of the original data has been lost as a display result.

[1017] As described above, by regenerating the layout as necessary in consideration of the wraparound of the image, an effect of preventing the generation of a display result in which an error appears as shown in Fig. 19D can be obtained.

[1018] Note that the wraparound of an image differs from a line feed in that it may affect a plurality of subsequent blocks. When generating information on the effects of processing auxiliary data, it is necessary to consider this point and determine that there is an effect even if there is an effect of partial data that is earlier than the previous block.

[1019] At that time, there is a problem that the range of the partial data affecting the wraparound of the image is difficult to understand clearly. For example, if the size of the reference character is changed, assuming that the size of the image does not change, there is a case where the partial data laid out around the image cannot determine the power. In HTML data, there are tags that cancel the wrap around of the image, so if such tags come out, it is clear that the effect is up to that force. It means that even data can be affected. This has too large a range of effects, and will be processed using partial data. Therefore, there is a problem that advantages such as high speed and resource saving are lost.

[1020] In the present invention, it is assumed that processing auxiliary data is generated in advance. Here, a description will be given of a corresponding method that does not rely on processing auxiliary data.

[1021] If you do not rely on the processing assistance data for the effects, you have to actually obtain the layout and determine whether there is any effect. Specifically, in the determination of “whether affected by the immediately preceding block” in S15A-3 in FIG. 50, the layout of the immediately preceding partial data is obtained, or the partial data itself is examined, and there is an image wraparound. It is necessary to determine whether or not the wraparound of the image is completed only by the character elements in the partial data.

[1022] Alternatively, as a simpler method, after obtaining the layout of the current partial data in S15A-1, it is determined whether the wraparound of the image is not completed only by the character elements in the partial data, etc. If you're not finished, you can clear the display layout that saves the partial data later. As a result, it is guaranteed that the display layout of the subsequent partial data will be continued and generated, so that the wraparound will not be discontinuous!

[1023] The determination as to whether or not the wraparound is over depends on the method of generating the layout data. In the above description, it has been described that the wraparound image is divided into a plurality of display layout elements (IMG) corresponding to a plurality of wraparound rows. It has been described that the divided display layout elements are flagged to indicate a wraparound image.

[1024] Therefore, when laying out the first line of a certain partial data, check whether the display layout element with the flag indicating that it is a wraparound image continues to be the same as the previous partial data. For example, it can be determined whether or not the layout of the wraparound image ends in the immediately preceding partial data.

[1025] FIG. 19C shows the layout in which the layout of partial data 405 and 406 has been completely generated. The final layout row of partial data 406 is the eighth row (more than keeping pace). In the eighth line, since the display layout element having the wraparound image flag continues the previous running force, when starting the layout of the partial data 407, it can be determined that the wraparound has not ended.

[1026] In the present invention, the processing result of the preceding partial data is mainly different from the processing result of the subsequent partial data. Power explained in case of influence Conversely, when the processing result of the previous partial data affects the processing result of the previous partial data, the same concept can be applied. Alternatively, if the direction of influence is not fixed in one direction, and there are both front and rear directions, check the effects in both directions and re-process.

[1027] Regarding the method described above, not only the combination described here, but also any combination is possible.

[1028] The difference in the processing method between the data targeted by the present invention and, for example, the data in the MPEG format or the like has already been described in the first embodiment.

[1029] An object of the present invention is to provide a storage medium storing program codes of software for realizing the functions of the above-described embodiments to a system or an apparatus, and to provide a computer (or a computer) of the system or the apparatus. Needless to say, this can be achieved by reading and executing the program code stored in the storage medium by the CPU or MPU.

[1030] In this case, the readout program code itself implements the functions of the above-described embodiments, and the storage medium storing the program code constitutes the present invention.

[1031] As a storage medium for supplying the program code, for example, a floppy disk, a hard disk, an optical disk, a magneto-optical disk, a magnetic tape, a nonvolatile memory card, and the like can be used.

[1032] In addition, the above-mentioned program code may be a program in which other computer system power is also downloaded to the storage unit of the terminal via a transmission medium such as a communication network.

[1033] In addition, the computer executes the readout program code, so that not only the functions of the above-described embodiment are realized, but also the OS ( It is needless to say that an operating system) performs part or all of the actual processing, and the processing realizes the functions of the above-described embodiments! /.

[1034] Further, the program code read from the storage medium is written into the memory provided on the function expansion board inserted into the computer or the function expansion unit connected to the computer, and then, based on the instructions of the program code, The function expansion board or function expansion It goes without saying that a CPU or the like provided in the unit performs part or all of the actual processing, and the processing realizes the functions of the above-described embodiments.

[1035] When the present invention is applied to the storage medium, the storage medium stores program codes corresponding to the flowcharts described above.

[1036] According to the data processing method of the present invention, when processing partial data in desired partial data, the influence is detected in the influence detecting step, and the partial data to be detected is not detected. If the data is included in the desired partial data, the range of the partial data to be detected and the desired partial data may be processed as a continuous data.

[1037] The "partial data in the desired partial data" is a unit of partial data in the sense that there are a plurality of desired partial data and some of them are partial data. It does not mean that the partial data is further divided data.

[1038] In the influence detection step, partial data other than the desired partial data in the desired partial data is detected as a target for detecting partial data that affects the processing result of the partial data in the desired partial data. use. That is, the influence between the desired partial data is considered, and the influence of the partial data other than the desired partial data is ignored.

[1039] Since partial data is data that can be processed independently, there is no problem in using the processing result alone. When using the processing results of multiple partial data, the effect becomes a problem. If processing is performed taking into account the effects among multiple partial data, there is no problem if only the processing results of the multiple partial data are used. In other words, it can be considered that the plurality of partial data constitute one large partial data. If the processing result of the large partial data is used together with the processing results of the other partial data, the influence may exist, but there is no problem in using the large partial data alone.

[1040] As a result, since the processing is performed in consideration of the influence in the range to be used, the processing result of the desired partial data is not a problem, and the processing of the partial data other than the desired partial data is performed. Since there is no need, there is an effect that unnecessary processing is not required.

[1041] The data processing method according to the present invention includes a partial data necessity determining step of determining whether or not the partial data processing result power is included in a desired processing result. It may be characterized in that desired partial data is obtained from a desired processing result by using the determination in the necessity determining step.

[1042] For each partial data, in the partial data necessity determination step, it is determined whether or not the processing result is included in a desired processing result. If it is included, it is determined that the partial data is the desired partial data, and if it is not included, it is determined that it is not the desired partial data. As a result, the required minimum required partial data is obtained from the desired processing result.

[1043] Generally, what the user needs is the processing result, not the partial data. In general, the user often does not know how the electronic data is divided into partial data. Therefore, it is more natural for the user to give a desired processing result range than a desired partial data. For example, if the electronic data is an electronic book, the range of the processing result is from what page to what page. If the electronic data is the moving image data, the range is the processing result of what component.

[1044] As a result, there is an effect that the user can obtain the processing result of a part of the electronic data! /, And can specify the data naturally without being aware of the existence of the partial data.

[1045] In addition, since the required minimum required partial data can be obtained from the desired processing result, there is an effect that the processing amount can be minimized.

[1046] The data processing method of the present invention may be characterized in that partial data to be processed first is set as new desired partial data and the processing is repeated.

[1047] When the influence is detected, the partial data to be processed first is set as new desired partial data. Then, when processing the new partial data, if there is partial data that affects the processing result of the new partial data, the processing of the partial data is performed first.

[1048] By performing such repetitive processing up to the partial data without affecting, there is an effect that the processing can be performed in the order of the influence, starting from the partial data having the effect. come.

[1049] In the data processing method according to the present invention, in the influence detecting step, the processing result of the desired partial data to be retained is processed by being affected by the processing result of the partial data to be affected. If it does, the effect may not be detected!

[1050] When storing the processing result in storage means, etc., whether the processing was affected and processed Information is also stored separately. When the effect is detected in the effect detection step, the processing result of the partial data to be detected is retained! If it has been processed in response to a request, no impact will be detected.

[1051] This has an effect of preventing the same processing result as the processing result processed in consideration of the influence from being obtained by being processed again and again in vain.

[1052] The data processing method according to the present invention is data in which electronic data is divided into a plurality of pieces, and even if it is processed alone, the meaning of the data is not impaired! A data processing method for performing a predetermined process using partial data, comprising: a front-end partial data detection step of detecting a front or last partial data for generating a processing result affecting a processing result of a desired partial data. And processing as partial data from partial data detected in the preceding partial data detection step to desired partial data.

[1053] The above-mentioned iterative processing method, that is, the effect of the processing result before and after the desired partial data is examined, and if there is an effect, the previously processed partial data is repeatedly set as new desired partial data. Similar to the processing method, if the processing results of the partial data influence each other without deteriorating the advantage of the processing of the partial data that can be processed at high speed and with resource saving, the connection of the processing results of each partial data is poor. Of course, there is an effect that partial data can be processed so as not to be lost.

[1054] Explaining other effects and the like, compared to the above-described repetitive processing method, there is no need to perform the processing of the partial data again, so that there is an advantage that unnecessary processing can be omitted.

[1055] Also, taking into account only the influence of the partial data in the limited range, if the range to be considered changes, the processing result changes even for the same partial data. For example, if the processing result is scrolled and displayed using a scroll bar, and if the range in which the effect is considered changes depending on the scroll position, the processing result of the same electronic data will vary depending on the operation of the scroll bar. It will be displayed differently. In the present invention, a processing result that always considers all effects is generated regardless of the range of desired partial data. Made. Therefore, if the same partial data is used, the same processing result can always be obtained. Speaking of the scroll bar example above, no matter how the scroll bar is operated, the processing result of the same electronic data will always be displayed the same.

[1056] Note that if the range of the last partial data before and after the detection is limited to, for example, a desired partial data, the advantage that the same processing result is always obtained is lost. Since there is no need to process partial data related to the result, there is an advantage that the amount of processing is reduced. Even if the range of the first and last partial data is limited, the advantage that the amount of processing is smaller than that of the above-described repetitive processing method remains as it is.

[1057] In the data processing method according to the present invention, in order to solve the above-described problem, the electronic data has a hierarchical structure or an order structure or a combination thereof, and the processing auxiliary data includes a starting position of the divided data and a starting position of the divided data. The end position has a hierarchical structure! /, Which is characterized by having information on an order structure or a combination thereof.

[1058] The "hierarchical structure" is also called the "tree structure" and refers to a state in which the relationship between data elements is managed as a branched tree-shaped structure. Branching is only a matter of detail, and the branches do not share a relationship (when they do, they are called a "network structure"). In general, the branching point is often referred to as the “lower layer” and the branching source is referred to as the “upper layer” in a vertical relationship.

[1059] For example, a nested structure of HTML data tags corresponds to a hierarchical structure.

[1060] The "order structure" is a structure in which there is no hierarchical relationship between data elements, but the order is significant. Even if the data elements are the same, if the order changes, it becomes different data. For example, the LI tag in the OL tag of HTML data displays a bulleted number. The number is determined by the order in which the LI tag appears.

[1061] In the case where each layer of the hierarchical structure has an order in the branch destination, it may be included in the hierarchical structure.

[1062] The division of the data element of the hierarchical structure or the order structure and the division of the partial data are not necessarily the same.

The “hierarchical structure at the start position” means a hierarchical structure generated from data from the beginning of the electronic data to the start position of the divided data. Speaking of the example of HTML data, it can be represented by a character string that connects tags appearing up to the start position. Generally, only the information in the upper layer is available In many cases, information on the same layer, lower layers, and text data sandwiched between tags can be omitted. Only the information in the upper layer means, in the example of HTML data, only the start tag that has no corresponding end tag among the tags that have appeared up to the start position.

[1063] The "hierarchical structure at the end position" means a hierarchical structure generated from data from the end position of the divided data to the end of the electronic data. Speaking of the example of HTML data, it can be expressed by a character string connecting tags that appear after the end position. In general, only the information in the upper layer is sufficient, and the information in the same layer, the lower layer, text data sandwiched between tags, and the like can be omitted in many cases. In the example of HTML data, only the information in the upper layer means only the end tag that does not have a corresponding start tag among the tags that appear after the end position.

[1064] The hierarchical structure and the target data range are the same for the "ordered structure of start position" and "ordered structure of end position". Unlike the hierarchical structure, there is no upper or lower layer, but it is information that appears in the data range. Even in a hierarchical structure, if information including the information of the same layer and lower layers is included, it is possible to include the information of the ordered structure. For example, in the case of HTML data, the layers of a plurality of LI tags are layers below the layer of the OL tags, but the information should be generated without omitting the corresponding end tags even if they exist. Even if there is a division boundary of the partial data in the layer of the OL tag, since the information on the order structure of the starting position of the subsequent partial data includes the LI tag of the previous partial data, the order in which the LI tags appear You will be able to obtain information.

[1065] First, information on the hierarchical structure or the order structure of the start position of the divided data or a combination thereof is read from the processing auxiliary data and processed. Next, the divided data is read and processed. Finally, the information of the hierarchical structure or the order structure of the end position of the divided data or the combination thereof is read from the processing auxiliary data and processed.

[1066] As a result, when processing the electronic data to the beginning and the end, it is possible to perform processing in the same state as processing the part of the divided data.

[1067] As a result, there is an effect that electronic data having a hierarchical structure, an order structure, or a combination thereof can be divided and processed as partial data.

[1068] The data processing method according to the present invention is a method in which electronic data is divided into a plurality of pieces of data, This is a data processing method that performs predetermined processing using partial data that is free from errors in the processing result itself when processed independently, and that electronic data is divided into processing results of desired partial data. An impact detection step for detecting the affected partial data having an influence on the part data, and when processing the desired partial data, if the affected partial data is detected, the range of the affected partial data force to the desired partial data is determined. A partial data processing step of processing as a series of data.

[1069] As a result, since the range up to the desired partial data is processed as continuous data, the processing result of the desired partial data reflects the influence of the affected partial data. become.

[1070] Therefore, when processing desired partial data, only the partial data in the affected range can be processed, and a processing result in which the influence is reflected can be obtained. Of course, the same processing result can be obtained by processing the entire electronic data. On the other hand, it is only necessary to process the minimum necessary number of partial data.

[1071] Therefore, when the processing results of the partial data influence each other without impairing the advantage of the partial data as much as possible with the speeding up of the data processing and the resource saving! / Rena! / ヽ, and can handle partial data!ヽぅ Effective.

[1072] In addition, the data processing method according to the present invention provides a method using predetermined partial data that is data obtained by dividing electronic data into a plurality of pieces and that has no error in the processing result itself when processed independently. A data processing method for performing processing, in which, among the influencing partial data that has an effect of dividing electronic data into a processing result of a desired partial data, an influencing portion that is positioned at the front or last as a processing order in the electronic data. In performing the influence detection step of detecting data and the processing of the desired partial data, if the influence partial data is detected, the influence partial data force is processed as a continuous data range up to the desired partial data. And a partial data processing step.

[1073] With this, regardless of the processing range for performing the predetermined processing, the influence partial data force positioned at the front or the last as the processing order in the electronic data, the range up to the desired partial data is regarded as continuous data. Processing to obtain a processing result of desired partial data. That is, all the partial data to be processed as a series of data are processed, and a desired part is processed. Get data processing results. Therefore, if the desired partial data is the same, it is possible to always obtain the same processing result reflecting all the effects necessary to obtain the processing result.

[1074] Therefore, in addition to the above-mentioned effect that the partial data can be appropriately processed without deteriorating the advantage of the partial data as well as speeding up the data processing and saving resources! / If the processing result of the same partial data can be prevented from being changed depending on the detection range of the partial data, and if the processing result can be obtained without a sense of incongruity, a further effect can be obtained.

[1075] Other features of the present invention will be summarized below.

(a) In order to solve the above problem, the data processing method according to the present invention is characterized in that the effect detection step is performed on partial data immediately before or immediately after desired partial data.

[1076] According to the above configuration, the partial data immediately before or immediately after the desired partial data is relatively likely to affect the processing result of the desired partial data. The effect is that the efficiency can be increased and unnecessary detection processing can be suppressed.

(b) In the data processing method according to the present invention, in order to solve the above-described problem, when a processing range of the electronic data is specified, the partial data is processed in a processing range of the specified processing range. The method further includes a partial data necessity determining step of determining whether or not necessary power is required to obtain a result, and the effect detecting step is performed on the partial data determined to be necessary.

[1077] According to the above configuration, in the partial data necessity determining step, the partial data necessary for obtaining the processing result of the specified processing range of the electronic data is specified, and the influence detecting step is performed on the specified partial data. Execute In other words, the effect detection step is not performed on partial data that is not necessary to obtain a processing result within the specified processing range.

[1078] Therefore, the processing of the influence detection step can be simplified, which contributes to speeding up the processing.

[1079] Partial data is data that can be processed independently, so if only one partial data is required for the specified processing range, it is necessary to process only that partial data. Thus, an error-free processing result can be obtained.

[1080] On the other hand, when a plurality of partial data are required for a specified processing range, an error may appear in the processing result unless at least the influence of the partial data is considered. Therefore, by employing the above configuration, the possibility that an error appears in the processing result can be reduced.

[1081] By the way, "specified! Processing range" is given by specifying the range of the processing result by some index. For example, in the case of document data, "from what line to what line", "what character power and what character", or "from what percentage to what percentage of the whole" is specified. In addition to specifying the start point and end point, there is also a method of specifying a reference point, the range around the reference point, and ヽぅ specification. For example, "from what line to how many lines" or "what line is displayed on the power display means (number of dots, etc.)". The reference point or range need not be a unit of the processing result such as “line” as long as the processing result can be finally specified. For example, the starting point of the electronic data (some or partial data) and the processing result from the data of the byte may be used as the reference point! / ヽ.

[1082] It should be noted that the partial data unnecessary for obtaining the processing result of the specified processing range may affect the partial data required for the processing range. Not. A method that takes this point into consideration will be described later.

(c) In the data processing method according to the present invention, in order to solve the above-described problem, in the partial data necessity determining step, a partial data capacity required to obtain a processing result of a designated processing range is provided. If the processing result of the specified partial data is obtained to determine the necessity of the partial data immediately before the specified partial data, Is characterized in that even if the data corresponds to the affected partial data, the preceding partial data and the specified partial data are not processed as a continuous data.

[1083] According to the configuration described above, when the partial data required to obtain the processing result in the specified processing range is specified, the processing result of the specified partial data is obtained. It is possible to judge whether the partial data capacity for obtaining the processing result of the specified processing range is sufficient or insufficient. Therefore, the specified partial data Can be used as means for determining the necessity of the immediately preceding partial data.

[1084] Here, if the immediately preceding partial data corresponds to the above-mentioned affected partial data with respect to the specified partial data, processing of the immediately preceding partial data is performed before obtaining the processing result of the specified partial data. If not, then a contradiction arises.

[1085] In other words, the processing result of the specified partial data is needed to determine whether or not the previous partial data is necessary, while the processing result of the previous partial data is needed to obtain the processing result of the specified partial data. The result of processing the data is required, and there is a contradiction between the specified partial data and the immediately preceding partial data, requiring the processing results of each other. Alternatively, infinite repetition processing is performed.

In order to determine the necessity of the immediately preceding partial data, when obtaining the processing result of the specified partial data, even if the immediately preceding partial data corresponds to the affected partial data, We will not process the partial data.

[1087] Note that if the immediately preceding partial data is determined to be necessary based on the processing result of the specified partial data, and the immediately preceding partial data corresponds to the affected partial data, the above-described partial data processing is performed. By executing the step and processing the previous partial data and the specified partial data as continuous data.

[1088] As a result, it is possible to prevent inconsistency and infinite repetition of processing from occurring.

(d) In order to solve the above problems, the data processing method according to the present invention first specifies partial data to be detected in the influence detection step, and then determines the partial data to be detected by the influence target partial data. It is characterized in that whether or not the data corresponds to the partial data is determined using the processing result of the partial data to be detected.

[1089] According to the above configuration, if information for knowing the influence between partial data is not separately prepared, is there any affected partial data every time the processing result of the desired partial data is obtained? Detect if there is. At this time, first, the partial data to be detected as the influence partial data is specified. Next, the processing result of the partial data to be detected itself is used in the process of determining whether or not the partial data to be detected corresponds to the affected partial data.

[1090] Thus, even if information for knowing the influence between partial data is not separately prepared, The effect can be detected.

[1091] When the affected partial data is detected, the processing of the desired partial data is performed again even if the processing result of the desired partial data has already been obtained.

(e) The data processing method according to the present invention includes, in order to solve the above-mentioned problem, a partial acquisition step of acquiring and holding a processing result of desired partial data before the influence detection step. If the affected part data is not detected in the influence detecting step, the predetermined process is performed using the processing result of the acquired desired partial data, while if the affected part data is detected in the effect detecting step, By executing the partial data processing step, a processing result of a desired partial data is newly acquired and held again.

[1092] According to the above configuration, by acquiring and holding the processing result of the desired partial data, if the affected partial data affecting the processing result of the desired partial data is not detected, In addition, the held processing result can be used for a predetermined processing.

[1093] As a result, the held processing results can be used effectively, so that unnecessary processing for acquiring the processing result of desired partial data from 1 when the affected partial data is not detected can be omitted, and processing efficiency can be reduced. The effect of improving comes out.

[1094] Note that, when newly acquiring and holding the processing result of the desired partial data again, for example, a step of clearing the processing result already held in a storage medium or the like may be executed, A step of overwriting the new processing result with the processing result already held may be executed.

(D The data processing method according to the present invention, in order to solve the above-described problem, newly obtains a processing result of desired partial data and holds it again When the range up to is processed as a series of data, the information is stored in association with the processing result of the desired partial data.

[1095] According to the above configuration, when a processing result of desired partial data is obtained, information indicating that a range up to the desired partial data has been processed as continuous data can be referred to. become. As a result, it can be seen that the processing result of the held desired partial data is obtained in consideration of the influence of the affected partial data force. Therefore, When a predetermined process is to be performed using the processing result of the desired partial data, it is not necessary to execute the influence detecting step again, and the efficiency of the process can be reduced.

(g) In the data processing method according to the present invention, in order to solve the above-described problem, when the electronic data has data that affects the processing result of the partial data, the influence detecting step is performed. Is a step of determining whether or not the effect of the effected data is valid for the desired partial data; and, if determined to be valid, at least the immediately preceding partial data of the desired partial data is replaced with the affected partial data. And a step of making the candidate.

[1096] According to the above configuration, it is determined whether or not at least partial data immediately before desired partial data is a candidate for affected part data by examining the effect of data affecting the processing result of the partial data. Can be determined by

[1097] The data that affects the processing result of the partial data is, for example, control data that specifies the processing content so that a specific processing result is obtained. As a more specific example, when the electronic data is HTML document data, a tag that specifies a display state corresponds to the control data.

[1098] In order to determine whether the effect of the affecting data is valid for the desired partial data, information on the validity (eg, start tag auxiliary information shown in Fig. 8) is prepared in advance. Then, the information may be used, or it may be checked whether or not the partial data immediately before the desired partial data includes the data having the influence.

(h) According to the data processing method of the present invention, in order to solve the above-mentioned problem, electronic data is divided into a plurality of pieces of data, and there is no error in a processing result itself when processed independently.

V. A data processing method for performing a predetermined process using partial data which is data, and among the partial data, which influences the division of the electronic data into the processing result of the desired partial data, An influence detecting step of detecting the first or last affected part data as a processing order in the data; and, when processing the desired partial data, when the affected partial data is detected, the influence partial data force is determined. And a partial data processing step of processing the range up to the partial data as continuous data. (i) Further, the data processing device according to the present invention performs predetermined processing using partial data in which electronic data is divided into a plurality of data, and the processing result itself when processed independently has no error. A data processing device that performs the processing of the desired partial data. Effect processing means for detecting the partial data, and when processing the desired partial data, when the affected partial data is detected, processes the range of the affected partial data to the desired partial data as continuous data. And partial data processing means.

[1099] According to the above configuration, when processing desired partial data, among the affected partial data that affect the processing result, the first or last affected partial data as the processing order in the electronic data is replaced by ( The influence detecting means detects in the influence detecting step. Then, when the most or last affected partial data is detected, the partial data processing step (in the partial data processing step) sets the range from the affected partial data to the desired partial data. Is processed as a series of data, and a processing result of a desired partial data is obtained.

[1100] Here, the partial data whose processing order in the electronic data is further before or after the affected partial data located at the forefront or last is not the affected partial data for the desired partial data. . Therefore, the partial data whose processing order is further before or after is ignored in order to obtain the processing result of the desired partial data.

According to the above configuration, regardless of the processing range for performing the predetermined processing, the influence partial data force positioned at the front or last as the processing order in the electronic data continuously extends to the desired partial data. And obtain the processing result of the desired partial data. That is, all partial data to be processed as a series of data are processed, and a processing result of a desired partial data is obtained. Therefore, if the desired partial data is the same, it is possible to always obtain the same processing result in which all the effects required to obtain the processing result are reflected.

[1102] On the other hand, the influence partial data is detected from the partial data related to the processing range for performing the predetermined processing, and the detected influence partial data force The range to the desired partial data is obtained. In a method of processing as a set of data, a part of all the partial data to be processed as a set of data is processed as a set of data. In this case, even if the desired partial data is the same, the processing result may differ depending on which part of all the partial data to be processed as the continuous data is processed as the continuous data. is there.

[1103] Therefore, according to the above configuration, it is possible to consider the possibility of affecting the partial data necessary for obtaining the processing result in the specified processing range even if it affects the partial data necessary for the processing range. Process results are obtained.

[1104] In this way, in addition to the above-described effect that the partial data can be appropriately processed without impairing the advantage of the partial data such as high-speed data processing and resource saving, the affected partial data can be obtained. It is possible to prevent the processing result of the same partial data from being changed depending on the detection range, and it is possible to obtain the processing result without any uncomfortable feeling.

(j) In the data processing method according to the present invention, in order to solve the above-described problem, in the influence detecting step, processing auxiliary data in which a preceding or last affected part data is detected and held in advance is stored. It is characterized by detecting the affected part data located at the forefront or the last using this method.

[1105] According to the above configuration, when processing desired partial data, it is possible to detect the foremost or last affected part data simply by referring to the processing auxiliary data. In short, when processing desired partial data, there is no need to analyze the partial data or check the processing result of the partial data to detect the affected partial data. Therefore, processing efficiency can be improved.

[1106] The processing auxiliary data may be managed as data separate from the electronic data in the form of a file or the like, or may be added to the beginning or end of the electronic data for easy management. It may be included as a part.

(k) In order to solve the above-mentioned problems, the data processing method according to the present invention provides a method in which the divided data obtained by dividing the electronic data into a plurality of pieces and the divided data are processed without errors when processed independently. In this case, the partial data is combined with processing auxiliary data, which is information that is insufficient for obtaining the partial data. [1107] In many cases, only divided data obtained by simply dividing electronic data does not become partial data capable of obtaining a processing result having no error when processed alone. Therefore, information that supplements the divided data is created in advance as processing auxiliary data.

[1108] According to the above configuration, when processing the divided data, the corresponding processing auxiliary data is read, and processing is performed using both data, whereby processing can be performed as partial data. That is, the divided data and the processing auxiliary data are regarded as partial data. Alternatively, it may be considered that the partial data is divided into the divided data and the processing auxiliary data.

[1109] As a result, even when partial data cannot be generated by simply dividing electronic data, there is an advantage that partial data can be easily generated by using the processing auxiliary data.

[1110] In this case, if the processing auxiliary data is managed separately from the electronic data, there is an advantage that the electronic data does not need to be processed so that the processing auxiliary data is included in the electronic data. .

(1) In the data processing method according to the present invention, in order to solve the above-described problem, the processing auxiliary data has information on a position of the divided data in the electronic data or information on a position and a size. The feature is that.

[1111] According to the above configuration, when generating the divided data into electronic data, information on the position of the divided data in the electronic data, or information on the position and size in the electronic data can be obtained by referring to the processing auxiliary data. Can be. For example, by obtaining information on the position of each of the continuous divided data, it is possible to read the electronic data force of the divided data one by one. Also, by obtaining information on the position and size of a piece of data, one of the pieces of data can also be read by electronic data.

[1112] As a result, the divided data can be easily generated from the electronic data, and the electronic data does not need to be divided into the divided data in the form of a file or the like. (m) In order to solve the above problem, the data processing method according to the present invention includes, for each of the partial data, influence information for specifying which of the partial data to be the affected partial data is the auxiliary processing data. In the effect detecting step, the influence partial data is detected using the influence information. [1113] According to the above configuration, when a certain partial data is set to the desired partial data simply by referring to the processing auxiliary data, the partial data corresponding to the affected partial data is specified for the desired partial data. can do.

[1114] If an attempt is made to detect the affected partial data without referring to the processing auxiliary data, the partial data itself is read to check whether it is affected by the division, or to process the read partial data. It is necessary to obtain the result and check whether it is affected, and if so, for example, read the partial data immediately before or immediately after that, and check whether it can be affected. In that case, as a result, there is a case where partial data that is not required is read or processed.

[1115] As described above, according to the above-described configuration, it is possible to expand the advantages of high-speed data processing and resource saving.

[1116] In the above configuration, the processing auxiliary data has information on whether or not the processing result of each partial data is affected by the processing results of other partial data, and the influence detection step includes this information. In other words, you can use it to detect effects.

(n) In the data processing method according to the present invention, in order to solve the above-described problem, the electronic data is document data whose display layout is changed according to display settings, and the predetermined processing is performed based on partial data to display layout. Is generated.

[1117] In the above configuration, the "display layout" is composed of a group of "display layout elements" such as characters and images, and is output to an output means such as a display means or a printing means so that the user can output the data. This is the layout information of the display layout elements that can be visually recognized. In general, the display layout has information such as the position and size of each display layout element, the output form, and the like.

[1118] The "display setting" refers to, for example, the type and size of a character to be displayed, a range for generating a display layout (generally restricted by the size of the display means), and the like. By changing such display settings, the generated display layout changes. However, even if the display layout changes, only the position and size of each display layout element usually does not change the contents (character information, image information, etc.) expressed by the document data!

[1119] With the above configuration, the document data whose display layout changes depending on the display setting is It will be possible to process the data separately. Therefore, a document processing device capable of displaying document data on a screen and scrolling and displaying the content, or jumping and displaying the page.

High-speed data processing and resource saving can be achieved.

(o) In order to solve the above-mentioned problem, the data processing method according to the present invention may be modified such that before the influence detecting step, the first display layout element of the desired partial data is a display layout output target. In a certain display medium, there is provided a layout examination step of always examining whether or not to be displayed from the beginning of a line, and when the first display layout element is displayed from the beginning of the line, the effect detection step is not performed. Features.

[1120] In the above configuration, the "row" here is a group of display layout elements, and generally also includes display layout elements arranged in a horizontal or vertical line. The size of one line, the line spacing, and the like are set as appropriate based on the relationship with the size of the display medium that is the output target of the display layout. It is assumed that all display layout elements belong to one of the rows.However, display layout elements related to multiple rows, such as a wraparound image, must be divided and belong to each row, and managed separately from the rows. To

[1121] "Beginning of line" is a position where a display layout element is arranged at the beginning of an arbitrary line belonging to a display range by a normal arrangement method of display layout elements on lines. In general, the left end is for horizontal rows arranged in a horizontal line, and the upper end is for vertical rows arranged in a vertical line. If the first display layout element of the desired partial data is a display layout element that arranges specially, such as a wraparound image, or a display layout element that is managed separately from the line, whether it is displayed from the beginning of the line The next normal display layout element (characters, etc.) to be placed on a line is not considered as the target of the judgment, but should be regarded as the first display layout element and should be judged.

[1122] According to the above configuration, it is determined whether or not desired partial data includes data having a function of designating or controlling a display layout (for example, a tag included in HTML document data). Alternatively, actually generate a display layout and check whether the head force of the display medium is also displayed, or check whether the processing auxiliary data has information on whether the head force is also displayed or not. Performed as a layout survey step. [1123] If the first display layout element of the desired partial data is displayed from the beginning of the line on the display medium, the partial data will be displayed appropriately. In other words, the effect of the division appears, and a display result is obtained.

[1124] Therefore, for the desired partial data, it is no longer necessary to detect the affected partial data. As a result, the processing speed can be improved by not performing the influence detection step.

(P) In order to solve the above-mentioned problems, in the data processing method according to the present invention, before the influence detection step, an arbitrary display layout element of the desired partial data is output to a display layout. In a certain display medium, the method further comprises a layout examination step of examining whether or not a force is displayed from a head position of the display range. If the arbitrary display layout element is displayed at the head position, the influence detection step is performed. It is characterized by not being executed.

[1125] According to the above configuration, if the desired partial data is displayed from the start position of the display range, the boundary between the immediately preceding partial data and the desired partial data becomes It does not appear within the display range and is located outside the display range.

[1126] Therefore, since no error appears in the display result of the desired partial data, it is not necessary to execute the influence detection step for the desired partial data. As a result, the processing speed can be improved because the influence detection step is not performed.

(q) In order to solve the above problem, the data processing method according to the present invention generates a display layout of the desired partial data before the influence detecting step and determines whether or not the display layout is the affected partial data. And a layout generation step of generating a display layout of the partial data to be detected. In the influence detection step, all the rows including the display layout of the desired partial data are provided. In this case, when the display layout of the partial data to be detected is not included, it is determined that the partial data to be detected is not the affected partial data.

[1127] In the above configuration, the display layout of the desired partial data generated in the layout generation step and the display layout of the partial data to be detected are used, and the detection is performed in each row specified from the display layout of the desired partial data. Display layout required for target partial data Checks if the element is located.

[1128] In the influence detection step, if the display layout of the partial data to be detected is not included in all the rows, it is determined that the partial data to be detected is not the affected partial data. If it is included, it is determined that the partial data to be detected is the affected partial data.

[1129] That is, it is determined whether or not the display result of the partial data is affected by the division by generating an actual display layout. In the case of line breaks, it is possible to check in advance whether there is a line break by examining the partial data itself without necessarily examining the display layout. The number of characters to be wrapped varies depending on the type. Therefore, whether or not an image included in the partial data to be detected wraps around in the display layout of the desired partial data is determined by actually examining the display layout.

[1130] With this, even in the case of partial data for which the affected partial data cannot be detected in advance, the effect that the affected partial data can be detected when a predetermined process is executed is achieved. Come.

(r) In the data processing method according to the present invention, in order to solve the above-described problem, the electronic data is document data whose display layout changes according to display settings, and the predetermined processing includes a partial data display display layout. If the partial data immediately before the desired partial data is detected as the affected partial data in the influence detection step, the partial data processing step is performed in the partial data processing step. After generating the display layout, a display layout of desired partial data is generated following the last display layout element of the display layout.

[1131] In the above configuration, when partial data is generated by being divided at a location such as a line break where the upper display is good, the partial data immediately before the desired partial data does not become the affected partial data. . Therefore, a new line is added after the line containing the last display layout element of the previous partial data, and the head of the line is added. The display layout of the desired partial data is added. Yo,

[1132] On the other hand, the partial data is generated by dividing it at places where display In this case, the partial data immediately before the desired partial data becomes the affected partial data. In other words, when each partial data is displayed independently, a new line is added after the line containing the last display layout element of the previous partial data, and the heading of that line also changes the display layout of the next partial data. Will be pursued. Therefore, the display result is as if there is a line feed between the immediately preceding partial data and the desired partial data, and the display state becomes discontinuous. Since the electronic data does not include such a line feed command (line feed tag, etc.), the display layout result is incorrect.

[1133] Therefore, according to the above configuration, if a display layout of desired partial data is generated following the last display layout element of the previous partial data, a line is not broken on the display, and a continuous display result is displayed. looks like.

[1134] According to this, even if the partial data is not divided at a place where the display is well-cut such as a line feed, it is possible to obtain a display result which does not impair the meaning of the original electronic data. Comes out.

(s) In the data processing method according to the present invention, when the processing range of the electronic data is specified, the partial data force is used to determine whether it is necessary to obtain the processing result of the specified processing range. The method further comprises a necessity determining step, wherein the partial data necessity determining step determines whether or not the desired partial data is necessary, and determines whether or not a result of processing of one or more partial data continuous before or after the desired partial data. It is good to use

[1135] In the above configuration, when determining whether or not the partial data force is necessary to obtain the processing result of the specified processing range, a reference position in the electronic data is designated, and the reference position is determined with respect to the reference position. Then, it is determined which partial data is necessary to obtain the processing result of the specified processing range. At this time, for example, when the desired partial data is located ahead of the reference position and the processing result of one or more partial data continuous after the desired partial data has already been obtained, By determining whether or not the processing result is specified and whether or not the power satisfies a certain processing range, the necessity of the desired partial data can be determined.

[1136] That is, the processing result of one or more partial data continuous after the desired partial data If the specified processing range is satisfied, the desired partial data can be determined to be unnecessary, and if not, the desired partial data can be determined to be necessary.

[1137] As a result, it is possible to determine whether or not the desired partial data is necessary before obtaining the desired partial data processing result by using the processing result of the already acquired partial data. come.

(t) The data processing method according to the present invention is characterized in that, when a processing range of the electronic data is specified, partial data power is used to determine whether or not it is necessary to obtain a processing result of the specified processing range. A need judging step, wherein in the partial data necessity judging step, the desired partial data is included in the designated processing range; It is characterized by using the processing result of the desired partial data to determine whether the data is necessary.

[1138] According to the above configuration, when the desired partial data is included in the specified processing range, the processing result of the desired partial data is first obtained, and the result is specified. It is determined whether the processing range is satisfied. If not, the processing result is insufficient for the processing range. Therefore, it can be determined in the partial data necessity determining step that the processing result of the partial data immediately before or immediately after is further required. . Processing result power of desired partial data Whether forward or backward direction is satisfied with respect to the processing range! /, If you look at it, you can determine the processing power of either the previous or next partial data.

[1139] The processing result of the partial data is generally not determined without processing. If one desired partial data belonging to the specified processing range is known, the partial data before and after it By sequentially examining whether or not is necessary, the effect that the required partial data for the specified processing range can be obtained is obtained.

(u) A data processing program according to the present invention is characterized by causing a computer to execute each step of the data processing method in order to solve the above problems.

[1140] A data processing program according to the present invention is characterized by causing a computer to function as each unit included in the data processing device in order to solve the above-mentioned problems. [1141] A recording medium according to the present invention is characterized by recording the data processing program in order to solve the above problems.

As a result, by installing the data processing program on a general computer via the recording medium or the network, the data processing method is realized using the computer. The computer can function as a partial data processing device.

[1143] It should be noted that the combination power of the configuration described in a certain focused claim and the configuration described in another claim is not limited to the combination described in the focused claim as necessary. Combinations not described in the focused claim are possible.

[1144] It should be noted that the specific embodiments or examples made in the section of the best mode for carrying out the invention merely clarify the technical content of the present invention, and such specific Various modifications can be made within the spirit of the present invention, which should not be construed in a narrow sense by limiting only to the examples, and the claims described below.

[1145] Embodiments obtained by appropriately combining technical means disclosed in different embodiments are also included in the technical scope of the present invention.

Industrial potential

[1146] Original electronic data (document data, music data, still image data, moving image data, etc.) power, and devices that allow a part of it to be cut out as partial data and used (viewing, playback, etc.) (computer, The present invention can be applied to the generation, Z processing, or processing of the partial data in general (e-books, mobile terminals, etc.).

[1147] This is particularly effective for creating partial data for devices with limited processing resources (CPU processing speed, memory size, etc.) and for Z or processing.

Claims

The scope of the claims

[1] There is no error in the processing result itself when processed alone, and when partial data is generated by dividing electronic data at a certain division boundary, the data size of the partial data is set to a predetermined standard data. A partial data size determining step of determining whether the size is equal to or less than the size;

An influence judging step of judging whether or not the processing result of the generated partial data has a predetermined effect due to the division at the division boundary;

A standard-independent boundary extracting step of extracting, as a standard-independent division boundary, a division boundary having a data size equal to or smaller than the standard data size and not exhibiting the predetermined effect. Generation method.

[2] If the above-mentioned standard-independent division boundary does not exist, a non-standard non-standard division boundary is extracted as a non-standard-independent division boundary, and a division boundary that is equal to or smaller than a predetermined maximum data size and does not show the influence of division is not exhibited. 2. The data generation method according to claim 1, further comprising a dependent boundary extraction step.

[3] The method further comprises a first division boundary extraction step of extracting a standard-independent division boundary at a data position closest to the standard data size among the obtained standard-independent division boundaries. The data generation method according to claim 1.

[4] The method further comprises a second division boundary extraction step of extracting a non-standard independent division boundary at a data position closest to the standard data size among the obtained non-standard independent division boundaries. 3. The data generation method according to claim 2.

[5] In the case where neither the standard-independent division boundary nor the non-standard-independent division boundary does not exist, a third division boundary extraction step of extracting a data position division boundary that does not exceed the maximum data size is further performed. 3. The data generation method according to claim 2, comprising:

[6] a division data generating step of dividing the electronic data at the extracted division boundary to generate division data;

Focus on the processing auxiliary data, which is information that is insufficient to make the divided data into partial data. A processing auxiliary data generating step of generating from the divided data and the other divided data,

The data generation method according to any one of claims 2 to 5, further comprising:

[7] Dependency data generation step for generating dependency data that is information indicating that there is a dependency between the processing results of the partial data

2. The data generation method according to claim 1, comprising:

[8] In the dependent relationship data generating step, the partial data for which the dependency data is to be generated may be partial data immediately before, immediately after, or both of the partial data. Data generation method described.

[9] There is no error in the processing result itself when processed alone, and when the partial data is generated by dividing the electronic data at a certain division boundary, the data size of the partial data is set to the predetermined standard data. A partial data size determining means for determining whether the size is equal to or smaller than the size,

Impact determining means for determining whether or not the processing result of the generated partial data exerts a predetermined effect due to the division at the division boundary;

A non-standard independent boundary extracting means for preferentially extracting, as a non-standard independent division boundary, a division boundary having a data size equal to or smaller than the standard data size and not exhibiting the predetermined effect;

A data generation device comprising:

[10] A data generation program for causing a computer to execute each step of the data generation method according to any one of claims 8 to 10.

[11] A data generation program for causing a computer to function as each means included in the data generation device according to claim 9.

[12] A computer-readable recording medium on which the data generation program according to claim 10 or 11 is recorded.

[13] A data processing method in which electronic data is divided into a plurality of pieces, and a predetermined result is obtained by using partial data that is a data obtained by processing alone and having no error. The law,

An influence detecting step of detecting an affected part data which has an effect of dividing the electronic data into a processing result of a desired partial data;

When performing the processing of the desired partial data, if the affected partial data is detected, processing the range of the affected partial data force to the desired partial data as a continuous data partial data processing step;

A data processing method comprising:

14. The data processing method according to claim 13, wherein the effect detection step is performed on partial data immediately before or immediately after the desired partial data.

[15] When a processing range of the electronic data is specified, a partial data necessity determining step of determining whether partial data is necessary to obtain a processing result of the specified processing range is performed. In addition,

14. The data processing method according to claim 13, wherein the effect detecting step is performed based on the partial data determined to be necessary.

[16] In the partial data necessity judging step, when one piece of partial data necessary to obtain a processing result of the specified processing range is specified, and the part immediately before the specified partial data is used. When obtaining the processing result of the specified partial data to determine the necessity of data, even if the previous partial data corresponds to the affected partial data, the previous partial data and the specified partial data are obtained. 16. The data processing method according to claim 15, wherein the data is not processed as a series of data.

[17] In the influence detection step, first, the partial data to be detected is specified, and then whether or not the partial data to be detected corresponds to the affected partial data is determined by a processing result of the partial data to be detected. 14. The data processing method according to claim 13, wherein the determination is made using

[18] Before the influence detecting step, a partial acquisition step of acquiring and holding a processing result of desired partial data is provided,

In the case where the influence partial data is not detected in the influence detection step, the predetermined processing is performed using the processing result of the acquired desired partial data, while the influence detection step performs shadow processing. 14. The data according to claim 13, wherein, when reverberation partial data is detected, the processing result of the desired partial data is newly acquired and held again by executing the partial data processing step. Processing method.

[19] When a new processing result of the desired partial data is newly acquired and stored again, the information indicating that the range up to the desired partial data has been processed as continuous data is replaced with the desired partial data. 19. The data processing method according to claim 18, wherein the data processing method is stored in association with a processing result.

[20] In the case where the electronic data has data that affects the processing result of the partial data, the influence detecting step includes determining that the effect of the affecting data is effective for the desired partial data. 14. A method according to claim 13, further comprising the step of: determining whether or not the partial data immediately before the desired partial data is a candidate of the affected partial data when the valid partial data is determined. The data processing method described in 1.

[21] A data processing method in which electronic data is divided into a plurality of pieces, and a predetermined processing is performed using partial data which is a data obtained by processing alone and having no error in itself. ,

An influence detecting step of detecting, from among the influential part data that influences the division of the electronic data into the processing result of the desired partial data, the influential partial data positioned at the earliest or last in the processing order of the electronic data;

A data processing method comprising:

[22] In the influence detecting step, the foremost or last affected part data is detected using the processing auxiliary data previously detected and held. 22. The data processing method according to claim 21, wherein:

[23] A combination of the divided data obtained by dividing the electronic data into a plurality of pieces and processing auxiliary data, which is information that is insufficient for obtaining a processing result without error when the divided data is processed alone, is combined. 22. The data processing method according to claim 13, wherein said partial data is used as said partial data.

24. The data processing according to claim 23, wherein the processing auxiliary data has information on a position of the divided data in the electronic data or information on a position and a size. Method.

[25] For each of the partial data, the processing auxiliary data has influence information for specifying which partial data is to be the affected partial data. In the influence detecting step, the influence partial data is used by using the influence information. 24. The data processing method according to claim 23, wherein the data is detected.

26. The electronic device according to claim 13, wherein the electronic data is document data whose display layout changes according to display settings, and wherein the predetermined process is a process of generating a partial data display layout. Data processing method described in the section.

[27] Before the influence detecting step, a layout investigating step for checking whether or not the desired display data is always displayed from the beginning of the line on the display medium to which the desired partial data is to be output is displayed. Prepare,

27. The data processing method according to claim 26, wherein when the first display layout element is displayed from the beginning of the line, the effect detection step is not performed.

[28] Prior to the influence detecting step, an arbitrary display layout element of the desired partial data is determined on the display medium to which the display layout is to be output, whether or not the head position of the display range is also displayed. It has a layout survey step to examine,

27. The data processing method according to claim 26, wherein when said arbitrary display layout element is displayed from said head position, said effect detecting step is not performed.

[29] Before the influence detecting step, a display layout of the desired partial data is generated, and partial data to be detected as to whether or not the partial data is to be detected is specified. A layout generating step of generating a display layout, wherein in the influence detecting step, if all the rows including the display layout of the desired partial data do not include the display layout of the partial data to be detected, Claim 2 is characterized in that it is determined that the partial data is not the affected partial data!

The data processing method according to item 6.

[30] The electronic data is document data whose display layout changes according to display settings, and the predetermined process is a process of generating a partial data display layout.

In the influence detecting step, when the partial data immediately before the desired partial data is detected as the affected partial data, in the partial data processing step, after the display layout of the immediately preceding partial data is generated, the display layout is generated. 14. The data processing method according to claim 13, wherein a display layout of desired partial data is generated following the last display layout element of the layout.

[31] When a processing range of the electronic data is specified, a partial data necessity determining step of determining whether the partial data is necessary to obtain a processing result of the specified processing range is further performed. Prepare,

In the partial data necessity judging step, the processing result of one or more partial data continuous before or after the desired partial data is used to judge whether or not the desired partial data is necessary. 22. A data processing method according to claim 13 or claim 21, wherein

[32] A data processing device that performs a predetermined process using partial data that is data obtained by dividing electronic data into a plurality of data and that has no error in the processing result itself when processed independently. ,

An influence detecting means for detecting an affected part data which has an effect of dividing the electronic data into a processing result of a desired partial data;

When processing the desired partial data, if an influence is detected by the influence detecting means, a partial data processing means for processing the range up to the desired partial data as a continuous data,

A data processing device comprising:

[33] A data processing device that performs a predetermined process using partial data that is data obtained by dividing electronic data into a plurality of data and that has no error in the processing result itself when processed independently. , An influence detecting means for detecting, in the influencing part data which influences the division of the electronic data into the processing result of the desired partial data, the influencing partial data positioned at the earliest or last processing order in the electronic data,

When performing the processing of the desired partial data, if the affected partial data is detected, the affected partial data force is used to process the range up to the desired partial data as continuous data.

A data processing device comprising:

[34] A data processing program for causing a computer to execute each step of the data processing method according to any one of [31] to [13].

[35] A data processing program for causing a computer to function as each unit included in the data processing device according to claim 32 or 33.

[36] A computer-readable recording medium on which the data processing program according to claim 34 or 35 is recorded.