JPH01166253A - Table display processing system - Google Patents

Abstract

(57) [Summary] This bulletin contains application data before electronic filing, so abstract data is not recorded.

Description

[Detailed description of the invention] [a required] The present invention relates to a table display processing method by a computer.

The object of the present invention is to provide a table display processing method that makes it easy to change the shape definition of a table and automatically determines the size of the table depending on the contents of the table.

A table structure definition that summarizes graphical information and page division availability information for each rectangular area of a table for each item in the table display processing method of a computer that creates and outputs tabular data consisting of multiple rectangular areas. data and
The size of each rectangular area in the 5 tables is determined by inputting the table contents of each rectangular area, the table contents of adjacent rectangular areas, and the table internal data including link information for related table structure definition data. The present invention has a table layout determination section that divides one display into pages, a page division section that divides one display into pages, and a display section that creates and outputs one table.

[Industrial application field]

The present invention relates to a table display processing method based on the total rt,a, and in particular to a table having an internal representation format and display processing function for structured table data that allows easy changes in table format and size. Regarding display processing methods.

Computer processing results are often output in the form of an easy-to-read table. However, when changing the format of a table, a means is needed that allows for flexible changes in display in different formats by externally redefining the format.

[Conventional technology]

Tables are generally vertical, as shown in Figure 1O.

Each side has one or more items (columns), and one display body has a structure in which a plurality of small rectangular areas are combined. In this case, for example, the table is divided horizontally into a plurality of items of fixed length, and vertically is divided into a plurality of items whose length is variable depending on the data size of the processing result. As a result, the length of each rectangular area in the vertical direction is variable.

In most systems, the shape of such a table is usually determined within the program, and even in systems where it can be defined from outside the program, the shape of a table is not fixedly defined. Ta.

[Problem that the invention seeks to solve]

In the case of a conventional system in which the shape of the table is fixed in the program, if the shape of the two tables changes, the first display program itself has to be significantly modified. Furthermore, the display program could only be used on that system.

On the other hand, even in systems where the shape of a table is defined externally, the defined shape is fixed, so the size can be flexibly changed depending on the contents of the table, such as increase/decrease, change, or number of data items. I couldn't do that.

The present invention makes it easy to change the shape definition in one table.

Another object of the present invention is to provide a table display processing method that can automatically determine the size of a table depending on the contents of the table.

[Means for solving problems]

The present invention summarizes the graphical information of one table into table configuration definition data that can be redefined for every three items when outputting tabular data using a computer.

By making the contents of the front side into independent data for each rectangular area and linking the inner world data of each front side to each other, it is possible to express the composition of the entire back side. A table layout determining unit 7 that realizes a data structure that can be expressed and uses these data to determine the actual size and coordinates of the table. By providing a display section, etc. that assembles the screen image of the page division section 1 table, which sets an appropriate page division boundary when crossing the page division boundary, it is possible to handle tables in any format without major changes to the display section program. .

FIG. 1 is a diagram showing the basic structure of the present invention. In the figure, 81 is a table configuration definition data holding section 52, which is a table internal world data holding section, 3 is a table layout determining section, and 4 is a page dividing section.

Reference numeral 5 indicates a display unit, 6 indicates a display, and 7 indicates a printer, in which graphical information such as the length and position of the table in a fixed direction, table structure definition data specifying whether or not page division is possible, etc. are set. On the other hand, the specific contents of the five tables are set in the one-table content data storage unit 2 as one-table content data for each rectangular area.

The table content data corresponding to each rectangular area of the table was linked to one table structure definition data for each item and followed the definition, and also corresponded to the graphical arrangement of each rectangular area within one table.

Necessary links are provided to define vertical, horizontal, and horizontal adjacency relationships.

[Effect]

In FIG. 1, the 1-table layout determining unit determines the length of each rectangular area in the variable direction according to the contents of the table, and the page dividing unit determines the length of each rectangular area in the variable direction according to the table contents.
The page boundary coordinates are determined depending on whether or not page division is possible in the table configuration definition data.The 0 display section sequentially extracts the table configuration data and table content data according to the links set in the 1 table content data and creates 1 table. By doing this, it is possible to change, add, or delete items in two tables simply by changing the contents of the table composition definition data or the link relationship of the table content data, and it is possible to create tables of any shape, depending on the amount of data, etc. It becomes possible to display the table in a flexible size depending on the contents of the table.

Figure 2 is an example of two-table structure definition data and table content data.In Figure 8, (a) to (e) are.

This is table structure definition data in which items are arranged (direction (fixed direction), position (coordinates) of each item in the fixed direction, and information Ig such as whether or not page division is possible is defined for each item.
. . . is table content data that represents the contents of a table such as one item name or data, and the structure of the table is determined by linking (connecting) the contents with each other.

Table contents that are adjacent to each other are linked with LEFT, RICH1 links (dashed lines), and tables in other tables within the same item are linked with BEFORE, NEXT links (1 point 11 &!i), and further table contents. for the table configuration definition data representing each item.

Linked by ITEM (solid line).

The process of displaying a table represented by such data on a display screen or the like is performed by the following means.

First, the table layout determining section 9 sets the coordinates of a rectangular area for each content. The horizontal coordinates are fixed for each item,
The value set in the table structure definition data pointed to by the ITEM link is used.

The vertical coordinate is variable depending on the content of the table 1, and the minimum size (the product of the number of lines of text and the height of the text) is determined according to the amount of the content of the table. FIG. 3 shows an image of a table based on the coordinates set in this way, in which the game is determined to result in one loss.

Next, the page dividing unit divides the page when the page boundary reaches the position shown by the broken line in FIG.

Contents A, F, and K are divided into separate pages.

However, since the item (item) of content F is defined as non-divisible in the table structure definition data, it cannot be divided here.

Therefore, if you move the page border upwards and split content F at the top, content A and K only need to be split.
Items (a) and (e) of contents A and 2 are defined as page-dividable, so page division is performed here.

Finally, the display section shows the first and second pages.

For each table content, a rectangular area and its content are output on the screen or paper, and the final output image shown in FIG. 4 is obtained.

〔Example〕

Next, the present invention will be explained in detail with reference to Examples.

Note that the explanation of FIGS. 1 to 4 applies as is to the explanation of the following embodiments.

FIG. 5 is a processing flow diagram showing the operation procedure of the notation location determination unit 3 in FIG. 1.

The notation π determining unit 3 sequentially follows the links of the table contents data from the upper left, and determines the size in the variable direction (vertical direction) according to the table contents of each rectangular $i area.

Determine the coordinates of the top and bottom of each. The operation will be explained below using steps (1) to (2) shown in FIG.

Φ: Select the upper leftmost table content data as a starting point and set it as α.

■: Find the vertical coordinates of the table content data corresponding to α (
(Detailed processing will be described later with reference to FIG. 6).

■: Check whether NEXT table content data is linked to the right side of α. If there is no NEXT, the process ends, and if there is a NIEXT, execute (2).

■: Nr linked to α! , XT table contents data as a new α, and repeat the operation.

FIG. 6 is a detailed processing flow diagram of step (2) in the processing flow of FIG. This step (2) is to find the size in the variable direction (vertical direction) of the table content index α of interest and determine the coordinates of the rectangular area.

However, the size of the rectangular area in the variable direction changes when there is other table content data linked to the left side (such as when medium items and small items are connected to a large item). must be determined depending on.

For example, in the example of FIG. 3, the vertical size of A is C
You must choose whichever is larger considering the size of +F.Similarly, C considers D + E, D considers J, and E and +F consider K and choose the size. Need to decide.

The processing flow diagram in FIG. 6 is for performing these processes. The operation will be roughly explained below according to steps ① to [phase].

■: Check whether there is table content data linked to the right side (RIGHT) of α. If there is, go to ■, otherwise go to 0.

■: Check the number of links on the right side of α and set its value n.

■: Number of variable links 1-1. Initialize the coordinates Yβ-Yl.

■: Let β1 be the first table content data linked to the right side of α.

(2): If the upper end coordinate of βi has already been determined, it is set as Yβ.

◎Sign as sea bream, if it reaches i-n, ■, and i<n again
If so, execute ■ respectively.

■ = Load Nystack Yβ (PUSH).

O: Recursively call the process shown in FIG. 6, and calculate the required number of rows based on the contents of the table (number of data), assuming that the upper end of the rectangular flIT area corresponding to βi is Yβ.

Find the coordinates of the lower end and set them as new Yβ.

◎ Push up the Ni stack (PoP) and do not take out the TOP Yβ.

■: Update i with H+1, return to ■, and repeat the above operation with i=
This is repeated until n, and the coordinates of each lower end up to βn are sequentially determined.

■: When ixn, check the number of links ``n'' in the table content data on the left side of βi (for example, E and F for K in FIG. 3).

[Phase]: The table content data of the m-th left link of βi is α
If so, execute O, otherwise execute 0.

O: Let the minimum width of α be ymin, compare Yβ retrieved by POPing the stack and y 1 + ymin,
Push the larger one back onto the stack (PUSll), where y sin is the number of rows of data, 12 characters high, and h
Then, it is given by l×h.

[Phase]: Recursively call the process shown in FIG. 6 to find the coordinates of the lower end when the upper end of the rectangular area of βi is Yβ, and set it as Y2 to end the process.

0: Yβ is the upper end of βi.

The value at the top of the 0nis stack and Y 1 + ymln
Compare them, decide the larger one as Y2, and end.

The operations when the process in FIG. 5 is applied to the specific examples in FIGS. 2 and 3 are shown in FIGS.
Shown in 1.

FIG. 8+a+ and FIG. 8fbl are process flow diagrams showing the operation procedure of the page dividing section 4 of FIG. 1. Here, the page division processing unit divides the table using predetermined legal page boundary coordinates.

If an item that is prohibited from being divided in the middle is located at that coordinate, processing is performed without shifting the page boundary.The operation will be explained below according to steps ① to [phase] in the figure.

■2 Initialize page number P to 1.

O: Regarding all table content data that constitutes the table.

Figure 9 shows a lower edge coordinate table created based on the examples in Figures 2 and 3, in which the lower edge coordinates of each rectangular area are summarized for each item. has been determined by the two-table arrangement determination unit 3).

0: Set the convex page boundary coordinates to Y.

Using the 08 table configuration definition data, among the bottom coordinates of the items that cannot be page divided in the bottom coordinate table (Figure 9),
Detect the closest one within a range smaller than Y, and let its coordinate be y.

0: Processing of steps [phase] to [phase] is executed sequentially for each item.

[Phase]: Check whether the picked item cannot be divided into pages, and if it can be divided into 1 page, execute 0.

If it cannot be divided, execute [phase].

0: If there is table content data a that is within a range not smaller than y and has the nearest lower end coordinate under that item, it is found.

O: Find the minimum width of the top coordinate + a for the table content disk a, and check whether that value is within or outside the range of the y value (to find out whether there is any meaning in dividing it), and If it is within the range, execute 0; if it is outside the W1 range, execute 0.

◎; Check whether all items have been completed, and if there are any remaining items, return to [phase] and repeat the above operation, and if completed, execute 0.

o: If the item cannot be divided into pages with @, it is checked whether there is table content data that cannot be divided into pages and has the value of y exactly at the lower end coordinate under that item. If there is, execute ■; otherwise, execute 0.

0: If not present, use the value of y as the page boundary.

Update Y with y, return to [phase], and repeat the operations for other items that cannot be divided into pages.

0; 0 for each a obtained in ■. Repeat the @ process.

@: Copy and generate a page-divided page a, and set the lower end coordinate of one divided portion to y, and the upper end coordinate of the other divided portion to y.

@: Execute O for all a, and when finished, execute ■.

O: The bottom coordinate of all the rectangular areas that make up the table is y
Page number P for the following and the page number is not set
(Set “1°” at first).

Update O:P to P+1, return to 0, and perform the next page division process.

As described above, for tables whose size exceeds the standard page boundaries, the rectangular areas of items that cannot be divided into pages are not divided, and the rectangular areas of items that can be divided into pages are divided where possible. Optimal page boundaries can be set so that the maximum amount of table content can be displayed within the standard page boundaries.

〔Effect of the invention〕

According to the present invention, table configuration definition data and table content data that define the shape of a table can be set from the outside independently of the display program, and links that indicate the relationship between customers in the table in individual rectangular areas. Since any table can be described using , it is extremely easy to create and change the definition of one table, and the two table structure definition data and table content data. It has the advantage that it can be used in common between systems A.

[Brief explanation of the drawing]

FIG. 1 is a diagram showing the basic configuration of the present invention, FIG. 2 is an explanatory diagram of an example of table structure definition data and table content data according to the present invention, and FIG. 3 is an explanatory diagram of an example of an image of a table before page division. Fourth
The figure is an explanatory diagram of the page-divided final output image of the table image example in Figure 3, Figure 5 is a processing flow diagram of the notation location determining unit according to the embodiment of the present invention, and Figure 6 is the same as that of Figure 5. Detailed processing flow diagram of coordinate determination in the processing flow, Fig. 7 (a
) to 7 (C1 is an explanatory diagram (parts 1 to 3) of coordinate determination processing according to a specific example), and FIGS. Flowcharts (Part 1) and (Part 2), Figure 9 is an explanatory diagram of the bottom coordinate table created by the page division unit,
Diagram O is an explanatory diagram of the structure of a general table. In Figure 1. 1: Table structure definition data holding unit 2: Table content data holding unit 3: Notation location determining unit 4: Page dividing unit 5; Display unit 6: Display 7: Printer

Claims (1)

[Claims] In a table display processing method in a computer that creates and outputs tabular data consisting of a plurality of rectangular areas, graphical information and page division possibility information about each rectangular area of the table are displayed for each item. The table configuration definition data summarized in , and the table content data including the table contents of each rectangular area, the table contents of adjacent rectangular areas, and each link information for the related table configuration definition data are input, Table layout determining unit (3) that determines the size of each rectangular area
), a page dividing unit (4) that divides the entire table into pages, and a display unit (5) that creates and outputs the table, and the table layout determining unit (3) is configured to divide the entire table into pages. The page dividing unit (4) determines the variable direction size and coordinates of each rectangular area constituting the table using the graphical information and the table content data, and the page dividing unit (4) The display unit (5) performs optimal page division based on the coordinates, predetermined page size, and page division availability information for each item, and displays the table content data and table structure definition data according to the links. A table display processing method characterized by selectively referencing, creating and outputting a table for each divided page.