JPS6019224A - Tabulating system - Google Patents

Abstract

PURPOSE:To attain the automatic processing with framing, output of contents and division of page, etc. of a table by providing the table structure factors of the table component elements and the attribute of each element and producing a table within a memory based on said structure factor and attribute to deliver the table when necessary. CONSTITUTION:An input control circuit 3 of a tabulating device 1 receives a tabulation signal 11 and supplies the attribute information on the items stored in an external memory 2 and the item information 12 consisting of written data for each item. A producing circuit for item record tree receives the item record and compares the structure level values in the order of input to obtain addresses of slave items. The addresses are stored as the tree information, and this information is sent to a tabulation circuit 6. Thus the table frame data is produced and stored to a table frame data memory circuit 8. A written data control circuit 7 adds the written data to the position value and stores them to a written data memory circuit 9. An external interface circuit 10 receives an end signal 24 and supplies the table frame data 25 and the written data 26 to deliver them to an external device in the form of the table data 28 after scale conversion.

Description

[Detailed Description of the Invention] [Field of Application of the Invention] The present invention relates to a method and an apparatus for creating a table, which can be used for general purpose, and can easily modify the expression format and contents of the table to be created. Regarding table creation methods.

[Background of the invention]

In the conventional table creation method, the frames of the items that make up the table are determined by combining line segments from published books, either manually or using equipment, and the written data corresponding to the item frames are placed in a way that is inconsistent with the item frames. Usually, a table is created by noting that no

However, with this conventional method, (when creating a table using a combination of 13 line segments, the order in which the frameworks will be created must be clarified in advance, the size of the framework to be created must be considered, and the coordinates of the line segments must be specified. At this time, if the line segments overlap between the frameworks, the work is complicated, such as having to specify that the line segments be drawn when creating one of the frameworks.

(2) If you try to change the position of the table frame or written data, the position coordinates of the frame or written data are indicated by relative coordinate values from the origin coordinates, so the change will affect the change of the table body. No more than that.

(3) Since the creation of a table framework and the description of recorded data are treated independently of each other, changes in recorded data will affect changes in the table framework. Additionally, changes to the framework affect the presentation of written data.

There were drawbacks such as.

[Purpose of the invention]

An object of the present invention is to solve the problems of the conventional table creation method described above, by using the expression format and content of the items that make up the table as nodes, and using a structure representing the entire section as input data. The purpose of the present invention is to provide a general-purpose table creation method that automatically processes frames, headings, output of contents, and page division when the contents exceed.

[Summary of the invention]

In order to achieve the above object, the present invention assigns table structure factors (items) of elements constituting a table and attributes of each element (item),
Based on this, it is tabulated in a storage device and output as necessary. Table structure factors include the tree that shows the relationship between elements, the arrangement method, the framework, etc.
Attribute factors include factors such as formant, heading, and content.

[Embodiments of the invention]

This will be explained in detail below using examples.

In this embodiment, the attributes that the items should have are defined as follows in order to represent the expression format and content of the items that make up the table.

(1) Terminal/non-terminal In the parent-child relationship of items, the lowest item is called a terminal item.

(2) When the written content of an array/non-array item consists of multiple components, it is called an array item.

(3) When the heading field and description field/child item field (there are terminal items and non-terminal items) of a vertical/horizontal item are arranged vertically as shown in Figure 1, it is considered a vertical item. When items are arranged horizontally like this, they are called horizontal items.

(4) Vertical/horizontal non-terminal items When the items are arranged vertically as shown in FIG. 3, they are called "cross-arranged items," and when they are arranged horizontally as shown in FIG. 4, they are called "horizontally arranged" items.

(5) Alignment/Unalignment A non-terminal item is called an aligned item if its descendant items are aligned (the boundaries between the heading column and the content column of the descendant items match).

(6) Item format The item formant has the following six item definitions.

(a) The position of the position item is expressed as an offset of 0 from the parent item. Fifth
The figure shows the case where the parent items are arranged horizontally, and FIG. 6 shows the case where the parent items are arranged vertically.

(b) Size The size of the item is expressed by the item's width w1 length t11 and the length t2 of the heading box. FIG. 7 shows the case of a horizontal item, and FIG. 8 shows the case of a vertical item.

(C) Heading Format The heading format of an item is expressed as heading data, heading position p1, one line length t of heading data, as shown in FIG.

(d) Description content format The description content format of the item is performed for the terminal item. The written content format of an item is represented by a blank length t1 and a line length t2 of the written content, as shown in FIG.

(e) Alignment position The alignment position is specified for the alignment item.

For sorted items, as shown in FIG. 11, the sorted position t represents the boundary between the heading column and the written content column of descendant items.

(f) Array component boundaries For array components, boundaries can be specified between the components, as shown in FIG.

Taking advantage of the fact that a table can be expressed as a structure of table items, we create a tree representing the entire section, and use this tree to create a table framework by searching each item from the root of the tree. Add headings and output the description for each item. At this time, if the written content does not fit within the frame, a new page is output for that item.

Next, the meaning of item attributes and the tabulation process according to the present invention will be explained using a specific example.

The case of creating the table shown in FIG. 13(a) will be explained.

The structure of the items constituting the table in the same figure is as shown in FIG. 13(b). In the item structure shown in the figure, the numerical value indicates the depth level of the item structure, and the alphabetic character indicates the item. Also, (*) indicates an array. From this example, the terminal items are A and B.
, D, E, and non-terminal items are T, C. The array items are B and C, and the non-array items are T, A, D, and E.

The vertical items are B, C, D, and E, and the horizontal items are T and C.

The vertically arranged items are T and the horizontally arranged items are C.

The aligned item is C, and the unaligned item is T. The table is represented by an item record tree shown in FIG. 14 and an entry record tree shown in FIG. 15. The item record tree is for representing the structure of the table. The entry record tree is a tree structure of written contents according to the table structure, and there are three types: array entry record, array component entry record, and non-array entry record.6 As shown in Figure 15, the array entry record is B, c.

The array component entry record is B(11, BF2+, B
(31, non-array entry records are T, A, C (11.
D.

C(2)・D, C(3)・D, C(11・E, C(2)
・E, C (31・E. Item record is the attribute information of the item. Entry record is the written data in the case of a terminal item. In the case of a non-terminal item, it exists to represent the tree structure. .Plot page 1 of the table shall be drawn in the following order.

(1) Create a table framework from the item record tree (2)
) Fill in the description content column of the item.) Write the IJ record. (3) Delete the written entry record from the entry record. Figures 16 to 19 show the order in which the tables are created.

Next, an embodiment of the automatic processing apparatus of the present invention will be described in detail. FIG. 20 is a block diagram of a table creation device that operates based on the table creation method according to the present invention. The table creation device 1 inputs table item information defined based on a table creation method, frames the table and provides headings according to the information, and writes data to be written in the frame so that it does not conflict with the table framework. The input control circuit 3, the item record tree creation circuit 4,
Entry record tree creation circuit 5, table frame creation circuit 6,
It is composed of eight circuits: a written data control circuit 7, a table frame data storage circuit 8, a written data storage circuit 9, and an external interface control circuit 10.

3 receives the table creation signal 11 from the input device, and inputs item information 12 consisting of item attribute information and written data stored in the external storage device 2 in advance by the input device for each item. This item information and its storage example are shown in the second section.
This is the passage shown in Figure 1. When storing 12 in 2, the structure of the item is taken into consideration. This means that the first item is an item located at the top of the structure, and the child items of the item are always items that are stored after you, and their range has a level value that is the same or greater than you. This is until the item is memorized. That is, they are stored sequentially according to the order and depth level of the item structure. When the input control circuit 3 receives the item information 12, it transmits the attribute information of the item to the item record 13 according to the data transfer control function. Further, the description data 14 is transmitted to the entry record tree creation circuit 5 while maintaining the correspondence with the item record. Then, it is stored in internal storage areas 4 and 5. 3 sends an input end signal 15 to 4 when the input is completed, and ends the input process.

When 4 receives the item record 13, it compares the structure level values of 13 in the order of input, finds the child item address and the address of the first item for each item, and uses this as the child item address area added to each item record. It is stored in the item address area, and the parent-child relationship and sibling relationship of the item records are determined and stored in the internal storage area as item record tree information. This improves processing efficiency by converting item records from sequential access to dynamic access. , FIG. 22 shows an overview of the method for creating an item record tree.

In the figure, 200 indicates attribute information, and 201 and 202 indicate attribute information of item 11 and item 2, respectively.

Further, 211 indicates the level value of the item structure of item 1, and 212 indicates the number of child items. The item record tree information 16 is created by the creation device 4. 16, 161 is a child item address area, and 162 is a first item address area. The operation of creating an item record tree according to 4.
This will be explained based on the flow shown in the figure. First, as an initial comparison value, O is set to the level value of the previous item. In the comparison with the first item, since the level value of the previous item is 0, NULL values are set in the child item address area 161 and the first item address area 162 (45).

Next, when the level value of the previous item is higher than the level value of the next item, the next item becomes a child item of the previous item as shown in 46, and the child item address area of the previous item is The address of the next item is stored in , and the NULL value is updated.

Also, when the level values of the previous item and the next item are equal,
The next item is the same as the previous item, and the address of the next item is stored in the previous item's address area.
The ULL value is updated (47.451°. Also, if the previous item is lower than the level value of the next item, a NULL value is set in the child item address area of the previous item.

Then, a reverse search is performed on the level values of items before this item, and the address value is stored in the first item address area as the first item of the item that is closest to this item and has the same level value ( 48°47.49). The creation of the item record tree information ends when 4 receives the input end signal 15. And item record tree information 16
is sent to 5. 5 creates entry record tree information according to 16 and stores it in the internal storage area. Second
Figure 4 shows an overview of the creation of the entry record tree information 19.

The entry/record tree creation circuit 5 writes data based on a table creation request based on the item record tree information 16 and partially written written data 19. 19, io is for non-array items, il, i2.
. . . are for array items, and each area has three items. In the case of non-array data, an entry record (194) to be written in the parent entry 191 and its child entries 192 to 10 is created. Further array en) 193
In the case of 19.
Write in each data entry column. Each entry record is 1
It has 97 configurations. Next, referring to FIG. 25, the operation flow of the entry record tree information creation circuit 5 will be explained. When creating an entry record free, check whether the item is an array item or a non-array item (505). If it is a non-array and terminal item, as non-array entry record processing,
Described data having an address value corresponding to the item record is detected from the internal storage area, and the address is added to the entry record and the corresponding item in the entry record tree (507.512). Also, if the item is an array item, perform array entry record creation processing (5
08 and Figure 26). This process is performed when the child item of the array item is a terminal item.
s4), and stores the address as an entry record.

This process is performed for all child items, and this storage address value is stored as an array component entry record. By repeatedly executing this array component entry record creation process for the number of arrays, an array entry record is created (561), and this address is added to the corresponding array item. If the item is a non-terminal, it exists to construct the tree and no processing is performed on the written data.

When 5 receives the deletion signal 20 transmitted by 7, it deletes the entry record corresponding to this address from the entry record tree. When 5 finishes the entry record tree creation process, it sends an entry end signal 17 to 4, and ends the process.

Next, the table frame creation circuit 6 operates, and its processing flow is shown in FIG. 27. That is, when 4 receives 17 and reads the transmitted item record tree information 16 (62), it performs processing according to the item record tree. That is, the frame and heading positions for each item are calculated from the item format information (item position, size, and heading format) for each item (64, 65);
Table frame data 22 is generated and transmitted to 8. Here, if the alignment position is specified in the alignment item, after generating the heading column of the descendant item, the boundary line between the heading column and the content column is processed (67), and the table frame data 22 is set to 8. Send. When the generation of table frame data is completed, 6 transmits a table frame end signal 18 to 4 and ends the process.

Next, the written data control circuit 7 operates, and the operation flow is shown in FIG. First, when 7 receives the item record tree information 16 transmitted after 4 receives 18, it inputs the entry record tree information 19 stored in the internal storage area of 5 (704). Then, an item check is performed (705, 707), and the entry record (terminal item) to which the address value of the described data is added and the entry record (terminal item) configuring the array item are checked for the item. The position of the entry record is calculated from the format information (description content format) (706, 710). Here, if an array component boundary is specified in an array item, a position calculation for drawing a boundary line between array components is also performed (709). Then, perform a limit crossing check on this result (7i
i) For entry records that fit within the frame, the written data 21 corresponding to the address is received from the internal storage area of 5, the written data is added to the position value, and the data is sent to 9 as table written data 23 and stored. . At the same time as this transmission, a deletion signal 20 from 7 is sent to 5, and the entry record is
- Delete the corresponding entry record from the tree (713). If the entry record exceeds the limit, 7
14, 715, the processing for that item is completed, and control is transferred to entry record processing for the next item. By performing this process on the entry record for all items, the table description data 23 to be written in the table on the first page is stored in 9. 7, the above process is repeated until all entry records are deleted from the entry record tree, and 23 is stored in 9 in page units.

7 sends an end signal 24 to 10 when the processing is completed. FIG. 29 shows the structure of table frame data and table description data.

The external interface control circuit 10 receives the termination signal 2 from 7.
4 is received, the table frame data 25 from 8 and the table entry data 26 of the first page from 9 are input, a predetermined scale conversion is performed by the connected external device, and the output signal 27 from the external device is input. When received, it is output as table data 28 to an external device. At the same time, the second page 26 is input from 9, and output is performed when 27 is received. This process is repeated until 26 is completed, but when an output end signal 29 is received from the external device, the output process ends.

The present embodiment described above has the following effects.

(1) Table creation data is stored in a storage device as table frame data and page-by-page description data.

Therefore, replication is easy.

(2) Using the framework check function, the data listed in the table is automatically divided into pages and edited.

(3) Since the necessary information for creating a table is clearly defined, any table can be created using the same operations, and the quality of the created table is uniform.

(4) Connection with various external devices is easy due to the external interface control circuit that performs scale conversion processing according to the external device.

Further, although this embodiment has been described as a table creation device, it is also possible for those skilled in the art to easily implement the present invention in a general manner such as a computer using software within the scope of the concept of the present invention.

[Efficacy of invention, pot]

As explained above, the table creation method according to the present invention differs from the conventional method of combining line segments by (1) expressing the structure of the table as a structure of 444 items forming the table; By clearly defining the attributes of tables, we standardized the way tables are created. You can create any table with the same operation. Furthermore, the quality of the created tables is uniform.

(2) By creating tables on an item-by-item basis, even if there is a change in the data entered in an item, the effect will not spread to other items. This makes it easier to correct.

There are other effects.

[Brief explanation of drawings]

Figures 1 to 12 are explanatory diagrams illustrating examples of attribute items of the present invention, where Figure 1 is the definition of vertical items, and Figure 2 is the
Standard work for horizontal items, Figure 3 is the definition of vertical items, Figure 4 is the definition of horizontal items, Figure 5 is the definition of the item position when the parent items are horizontal, Figure 6 is the definition of the parent items. Figure 7 is the definition of the item position when the items are vertically arranged items, Figure 7 is the definition of the item size when the items are horizontal items, Figure 8 is the definition of the size of the item when the items are vertical items, Figure 9 is the definition of the heading format of the item, Figure 10 is the definition of the entry content format of the item, Figure 11 is the definition of the alignment position for the alignment items, and Figure 1 is the definition of the item description format.
Figure 2 shows the definition of array component boundaries for array items. Figures 13 to 19 are explanatory diagrams showing the tabulation process according to the present invention. Figure 13 is the structure of the table used in the example and its items, and Figure 14 is the item record list of the table used in the example. I.J.
-1 Figure 15 is the entry record tree of the table used in the example, Figure 16 is the drawing of the table framework, Figure 17 is the drawing of the contents of one item, and Figure 18 is after drawing the first page. The entry record tree in FIG. 19 is a drawing of the contents written on the second page. FIG. 20 is a block diagram of a table creation device according to the present invention. FIG. 21 is an explanatory diagram showing an example of item information and storage format according to the present invention, FIG. 22 is an explanatory diagram illustrating an overview of creating an item record tree of the present invention, and FIG. 23 is an explanatory diagram showing an example of item record tree creation circuit of the present invention. A flowchart showing the processing of
FIG. 24 is an explanatory diagram showing an outline of creation of an entry record tree in the embodiment of the present invention, FIG. 25 is a flowchart showing processing in the entry record tree creation circuit in the embodiment, and FIG. 26 is an embodiment of the present invention. FIG. 27 is a flowchart showing the process for creating a table frame in the embodiment of the present invention, FIG. 28 is a flowchart showing the process in the description data control circuit, and FIG. The figure is an explanatory diagram showing the structure of table frame data and table description data according to an embodiment of the present invention. l... Table creation device, 2... External storage device, 3...
Heka control circuit, 4...Item record tree creation circuit,
5... Entry record tree creation circuit, 6... Table frame creation circuit, 7... Description data control circuit, 8... Table frame data storage circuit, 9... Description data storage circuit, 1o
...External interface control circuit, 11...Table creation signal, 12...Item information, 13...Item record, 14...Description data, 15...Input end signal, 1
6 River item record tree information, 17...Entry end signal, 18...Table frame end signal, 19...Entry record tree information, 20...Deletion signal, 21...Description data, 22...・Table frame data, 23...Table description data, 24...End signal, 25...Table frame data, 2
6. ...Table data, 27...Output signal, 28.
...Table data, 29... Output final foil 1 figure 2 figure piece 3 figure '4s figure 11 figure 7 figure 80 110 figure 12 figure 13 mouth"('p) % +4 figure figure 15 figure % tg t9 I7 Figure face 21 Mouth IQn- Nest 22 Figure redundancy 25 Figure Akira 2Z times 27 Figure 21

Claims (1)

[Claims] 1. In a data processing device having a table creation function, a step of defining table structure attributes of elements forming the table;
A table creation method comprising the steps of specifying the constituent elements of the target table and assigning the above-mentioned attributes to each of them, and arranging the constituent elements of the target table according to the attributes. 2. The table creation method according to claim 1, which uses at least the direction of arrangement of table constituent elements, alignment/non-alignment, and vertical relationship as attributes. 3. The table creation method according to claim 1, which has a table frame checking function and a page division function.