JPH0462618A - Hierarchical record arranging device - Google Patents

Abstract

PURPOSE:To change the connection state set to each record despite the change of the tree structure form by adding the information to each record forming a hierarchical menu, etc., to show a specific area of a tree structure where each record should be built in. CONSTITUTION:A key word is added to each record in a record storage means 1 which stores a hierarchical menu, etc., to show a specific area of a tree structure where the record should be built in. A connection pattern output means 3 extracts the key word of each record stored in the means 1 and analyzes the word contents. Thus the higher-lower relationship is decided among the records and the connection pattern is outputted to a position where the block areas containing the arrangement of contents of each record are connected to each other. Thus the information is added to each record forming a hierarchical menu, etc., to show a specific area of the tree structure where the record should be built in. As a result, the records can be arranged in the corresponding areas of a changed tree structure and the connection state set to each record can be changed even though the form of the tree structure is changed with addition, deletion, etc., of the records.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a hierarchical record arrangement device for arranging and outputting a tree-structured hierarchical menu or the like in a tree-structured representation format in an office computer or the like.

[Summary of the Invention] The present invention provides a hierarchical record arrangement and device that stores a plurality of records that are distinguished by keywords that define hierarchical levels by the number of digits and define -L-lower relationships and left-right relationships in a tree structure by word contents. By doing so, even if the shape of the tree structure changes due to the addition or deletion of records, multiple records can be arranged based on the changed tree structure, and records in a vertical relationship can be connected using a connection pattern. It has been made possible to do so.

[Prior Art] Generally, in personal computers, office computers, etc., a tree-structured hierarchical menu is system-designed in advance.

By the way, if the entire hierarchical menu is output as a list in the form of a tree structure, for example, you can check the hierarchical relationship etc. at a glance based on the contents of the list, and when selecting the desired menu item, you can use the contents of the list. Make selections while reading visually.

This allows the work to be performed efficiently.

In such cases, the conventional method is to display and output the contents of each menu that makes up the hierarchical menu, hard copy each menu screen one by one, arrange the printed contents in a tree structure by cutting and pasting, etc. 16th r1 by connecting! I was trying to get a menu list like the one shown in J.

[Fill to be Solved by the Invention] However, creating a menu list as described above requires time and effort, and is extremely troublesome.

Therefore, it is a good idea to design a menu list creation program in advance to automatically output a list of 1-level menus in a tree-structured representation format, but if a part of the 1-level menu is deleted or added, Since the shape of the tree structure itself changes accordingly, that is, the arrangement position, number, connection state, etc. of each menu content changes, so the menu list creation program must be redesigned every time the menu content changes. The problem arises that the

The reason for this is thought to be that the tree structure of the Wi layer menu is fixedly incorporated into the menu list creation program.

If you do this, you can add information indicating where in the tree structure the record should be incorporated to each record that makes up a one-level menu, etc., and place each record in the corresponding place in the tree structure based on this information. If you can change the state of connection to each record, there is no need to permanently incorporate a tree structure into the menu list creation program itself, and as a result, the shape of the tree structure changes when records are deleted or added. However, it is clear that there is no need to redesign the menu list creation program based on the changed arrangement position, number, or wiring state, and the system is extremely versatile.

The problem of this invention is to add information indicating where in the tree structure the record should be incorporated to each record that makes up the hierarchical menu, etc., and to move each record to the corresponding place in the tree structure based on this information. It is possible to arrange the records and change the connection state to each record.

[Means to solve the problem] The means of this invention are as follows.

The record storage means (see the functional flowchart in Figure 1, the same applies hereinafter) defines the number of N layers by the number of digits, and also defines the vertical relationship (connection relationship in the hierarchical direction) and horizontal relationship of the tree structure by the word content. It is a file disk or the like that stores a plurality of records distinguished by keywords that define relationships (connection relationships in a direction perpendicular to the hierarchical direction).

The record output means 2 extracts the keyword of each record stored in the record storage means 1, and also outputs the output position if in the hierarchical direction determined by analyzing the number of digits of the extracted keyword (for example, in the XY coordinate system). A record corresponding to a block area specified by an output position (for example, a position in the X direction) in a direction orthogonal to the hierarchy direction determined by analyzing the word content is read from the record storage means. Output layout.

The connection pattern output means 3 extracts the keyword of each record stored in the record storage means and analyzes the word content to determine the vertical relationship of each record, and arranges the contents of each record in the vertical relationship. Outputs a connection pattern at the position where block areas are connected.

[Work] The operation of the means of this invention is as follows.

Now, the keyword of each record stored in the 1/code storage means 1 defines the hierarchical level by the number of digits, and defines the -L-lower relationship and left-right relationship of the tree structure by the word content. For example, if the keyword is numerical string data, the keyword rlJ is at the first hierarchy level, "
11'' and ``12'' define the second layer l/bell, and records with keywords ``11'' and ``12'' are in a vertical relationship with records with keyword rlJ according to their upper digits (tens digits). and also the keyword rllJ
, rX2J defines that the keyword rlIJ and the record "12" are in a left-right relationship depending on the value of the lower digit (- digit).

Hierarchical menu like this. Ref-1・゛memory f to memorize etc.
Each record in stage 1 has a keyword attached to it indicating where in the tree structure the i/code should be incorporated.

For example, in response to a command to output a list such as a hierarchical menu, the record output means 2 extracts the keyword of each record stored in the record storage means 1, and also outputs the keyword in the hierarchical direction according to the number of digits of the extracted keyword. output position 21
In addition to determining the output position in the direction orthogonal to the hierarchy direction, the content of the word is used to determine the output position. That is, by analyzing the keyword, the coordinate position in the plane coordinate system is determined as the output position of the corresponding record. Then, the record output means 2 reads out a record corresponding to the block area from the record storage stage l according to the determined output position in the hierarchy direction and the output position in the direction orthogonal to the hierarchy direction, and arranges and outputs the record.

In addition, the connection pattern output stage 3 extracts keywords 17 from each record stored in the record storage means 1 and analyzes the word content to determine the vertical relationship of each record, and determines the vertical relationship of each record. A wiring pattern is output at the position where the block areas where the contents are placed are connected.

Therefore, information indicating where in the tree structure the record should be included is attached to each record that makes up the hierarchical menu, etc., so if the shape of the tree structure changes due to the addition or deletion of records, etc. However, each record can be placed at a corresponding location in the changed tree structure, and the state of connection to each record can be changed.

[Example] An example will be described below with reference to FIGS. 2 to 14.

FIG. 2 is a block diagram showing the configuration of an office computer (R5 layer/code layout).

CPtJll has 10. Therefore, it controls the overall operation of this hierarchical record distribution M device, and the CPU is used as a peripheral device.
I has a key manual section 12, a CRT display section 13, and a printing section 14.
, file A15, and file 816 are connected.

The file A15 stores each record constituting the hierarchical menu, and in this embodiment, the file A15 stores 814 types of records as shown in FIG.

Here, each record is defined as follows.

That is, FIG. 4 is a diagram for explaining the record structure, and a keyword is added to the beginning of each record. Here, the keyword is numeric string data that defines the hierarchy level by the number of digits, and the word content in the vertical direction of the tree structure (
Define the connection relationship in the hierarchy direction) and the connection relationship in the left-right direction (direction perpendicular to the hierarchy direction). In other words, depending on the number of digits in the keyword, for example, the keyword "1" is the highest rank (
W7 layer level of 1st stage El), also Gee word ri
IJ.

"12" and "13" are the second hierarchical level, and the keywords "rllll", rl12J, r131", r133J
defines the third hierarchy level. Also, depending on the content of the keyword, for example, the keyword ri IJ, r12'', r
13'' is defined as being in a vertical relationship with the record of keyword "l" from its upper digit (tens digit), and the keyword rl is defined from the lower digit (- digit) of the keyword.
It is defined that the records of IJ, "12", and "13" are in a left-right relationship, respectively. Note that the magnitude relationship of the values of the lower digits defines the connection state in the direction perpendicular to the hierarchy direction, that is, in the left-right direction, and the connection relationship is in descending order from the left (the same applies hereinafter). keyword rl 1
1J.

The rl12J record is its upper digits (hundreds digit and tens digit)
It is defined that there is a vertical relationship with the record of the keyword "11", and that the records of the keywords "rl 11J, rl12" are in a horizontal relationship from the lower digit (- digit). Furthermore, the keyword r131J,
The r132J record is defined as being in a vertical relationship with the keyword 13J record by its high-order digits.

Also, from the lower digits, the keyword r131J, "132"
Defines that the records in are in a left-right relationship.

In addition to the keyword, each record contains a keyword, followed by a word delimiter code ":", a menu name ";", branch information (m or C), which will be described later, an item name, and a word delimiter code ";".
”, branch information (m or C), item name, etc. are provided. Note that there is as much item information (branch information and item name) as there are items, and the branch information defines the menu type of the corresponding item name, and is an execution menu for executing the corresponding processing program by selecting the menu. If so, the branch information will be "C", and if it is a selection menu for selecting an execution menu, the branch information will be rmJ. In other words, the branch information rmJ indicates that a lower menu exists.

Branch information "C" indicates that there is no subordinate menu. According to the record contents configured in this way, a menu screen as shown in FIG. 4 is displayed and output from the CRT display unit 13.

The file 816 stores data after the contents of the file A15 have been sorted according to predetermined rules, and the sort processing unit 17 sorts each record in the file A15 based on its key code, and In this case, the sort processing unit 17 uses the work memory 18 to perform sort processing. In addition,
The work memory 18 has a C register and a D register for storing various parameters to be described later.

Here, FIG. 5 shows the contents of the file A15 before being sorted and the contents of the file B16 after being sorted, and the sorting processing section 17 executes the sorting process according to the following rules.

(1) When keywords have the same number of digits, that is, when keywords define the same hierarchical level, priority is given to the word with the smaller value.

For example, the keywords rl 14, r12", r13" are sorted in the order of keywords rl IJ, "12", and "13".

(2) If the number of digits of the keywords is different, focus on the keyword with the smaller number of digits, and if the values are the same within the range of the number of digits, give priority to the keyword with the smaller number of digits0. , keyword "11", rl12J focuses on the keyword rl IJ, and its value "ll" is the same as the value "11" within the corresponding range of the other keyword rl12J, so it is a one-digit number. The keyword rllJ with a smaller value is given priority.

(3) Furthermore, if the number of digits of the keywords is different, focus on the keyword with the smaller number of digits, and if the values are different within the range of the number of digits, give priority to the keyword with the smaller value0. For example, Keyword r13J, rl12
J focuses on the keyword "13", and since the value "13" within the range of the number of digits is different from the value rl IJ in the corresponding range of other keywords rl12J, the keyword "13" with the smaller value has priority. be done.

The coordinate arrangement processing section 19 arranges the keywords in the file 816 in the arrangement table memory 20. At this time, the coordinate arrangement processing section 19 uses the work memory 21 to execute the arrangement processing.

Here, FIG. 6 shows the configuration of the arrangement table memory 20, which is configured in an 8×4 matrix corresponding to the xY coordinates, the Y axis direction corresponds to the hierarchy direction, and the X axis direction corresponds to the hierarchy direction. When arranging a keyword in the arrangement table memory 20 that corresponds to the direction perpendicular to the W4 layer direction, the coordinate arrangement processing unit 19 analyzes the number of digits of the keyword, etc. Execute the placement process to distribute the tree structure according to the image.

Note that FIG. 7 shows the contents of the arrangement table memory 20,
Keywords are arranged according to the vertical and horizontal relationships of the tree structure.

The work memory 21 is provided with an X register, a view register, an Xaax register, and a 9.1x register for storing various parameters to be described later.

The blow 2 placement processing unit 22 reads the keyword rearranged in the placement table memory 20, and also reads the record corresponding to this keyword from the file B16 and transfers it to the page memory 23. At this time, the block placement processing unit 22 blows the record contents into the corresponding coordinate position in the layout processing section 22 based on the coordinate position in the layout table memory 20 where the keyword is stored; An arrangement pattern for arranging blocks is created and written into the page memory 23.

Figure 8 is a basic configuration diagram of this block layout and pattern. This basic pattern consists of an upper Ayu line pattern that connects to the upper layer, a block area pattern where record contents are placed, and a lower connection pattern that connects to the lower layer. It consists of Note that the upper Ayu line pattern and the lower connection pattern are created as necessary.

Note that the block arrangement and processing section 22 are arranged in a work memory 21.2.
4 to execute block placement processing. The work memory 24 has a register, an X register, an L register, and an R register for storing various parameters to be described later.

The page memory 23 stores print data for one page, and the tree-structured menu list created by the block layout processing section 22 is printed from the printing section 14.

Note that FIG. 9 shows an example of printing the menu list.

Next, the operation of this embodiment will be explained based on FIGS. 1O to 14.

1 Operation 1 FIG. 1O is a general flowchart showing an outline of the operation with the record arrangement device, which is started in response to a menu list output command from the key human power section 12.

Now, it is assumed that data as shown in FIG. 3 is stored in advance in the file A15 as hierarchical menu contents.

First, in response to a menu list output command, the sort processing unit 17 is activated, and the records in the file AlS are sorted into the file B16 in key order according to the above-determined rules (1), (2), and (3). Sort into (Step A)
.

Next, the coordinate placement processing section 19 is activated, executes basic placement processing, and basically places the keywords in the file B16 in the placement table memory 20 (step B).

When keywords are arranged in the arrangement table memory 20 in this way, the block arrangement is referred to in the processing unit 22, and the record contents are arranged in blocks in the page memory 23, while creating an arrangement pattern for each block. (Step C).

Thereafter, the data in the page memory 23 is printed out from the printing section 14 (step D).

Hereinafter, each of the above-mentioned processes (steps A, B, C) will be performed in the 12th step.
This will be described in detail with reference to FIGS. 17 to 14.

Sorting Processing FIG. 12 is a flowchart showing the operation of the sorting processing section 17.

First, initial values rlJ are set in the D and C registers in the work memory 18 (steps A1 and A2).The D register is a register that specifies the number of digits of a keyword, and the C register is a register that specifies the word contents.

After initializing the values of the D register and C register in this way, proceed to step A3 and check whether all records in the file AlS have been transferred to the file B16, that is, whether there are any untransferred records remaining in the file A15. Check. At first, the presence of a record is detected, so proceed to step A9, and extract a record of the keyword that matches the data in the D register (contents of D) and has the number of digits in the C register (0 digits) from file A15. Search.

In this case, the contents of D and the 0 digit are both rlJ, so
A record with keyword "1" is searched from file A15. As a result.

The presence of the corresponding record is detected (step A5). In this case, since there are no multiple corresponding records in file A15, this is detected in step A6 and the process proceeds to step 88, in which the searched record is retrieved from file A. Transfer to file B. As a result, a record with keyword rlJ is written at the beginning of file B16 (fifth record).
(see figure).

After data transfer for l records is completed in this way,
In order to update the values of the D register and C register, set the keyword of the transfer record to the D register.Step A
9), and adds "1" to the value of the C register (step Al0).

Then, proceeding to step All, it is checked whether there are any untransferred records in the file AlS, but it is detected that there are records now.

Search file A15 for a keyword record with a 0 digit containing the content of D in the upper digits (step A12).
), In this case, the content of D is rlJ, 0 digit is r2'', L,
, so records with keywords "11", "12", and "13" are searched.

Therefore, since the presence of a corresponding record is detected in step A5 and the presence of multiple records is detected in step A6, the process proceeds to step A7, and the record with the smaller keyword value among the plurality of corresponding records, that is, the record with the keyword "11" is detected. Transfer the record from file A15 to file 816.

Then, the values of the D register and C register are updated, and as a result, the value of the D register is ritJ, and the value of the C register is "3.
” (Steps A9 and A10).

Therefore, this time, the file A15 is searched for a record with a 3-digit keyword including rl IJ in the upper digits (step A12). In this case, the keyword rl
Since records of rl11J and rl12J exist in file A15, the record with the smaller keyword value, that is, the record of keyword rl11J, is transferred to file B16 (step A7).

Next, the value of register D is updated to rllllJ and the value of register C is updated to "A" (steps A9, Al0), but even if file A15 is searched under this condition, the upper digits are rlllJ and the value of register C is updated to "A".
Since the 4-digit keyword including 11J does not exist in file A15, no corresponding record is detected in step A5, and the process proceeds to step A13, where the contents of the D register "llll
” to remove the least significant digit value. Then, "l" is subtracted from the value of the C register (step A14). As a result, the value of the D register is rl IJ and the value of the C register is "
It is decremented to 3.

Thereafter, the process proceeds to step All, but since untransferred records remain in the file A15, the process proceeds to step A12 to search for a record with a three-digit keyword including "11" in the upper digits.

In this case, the record with the keyword rl12J remains in the file A15 as a record that meets that condition, so this is transferred to the file 816 (step A
8), At this point, the keyword “l”, rl IJ, r
Corresponding records are stored in the file B16 in the order of l l IJ and rl12J (see FIG. 5).

Thereafter, in the same way, the values of the D register and the C register are updated (steps A9, Al0), and the file A15 is searched based on the updated results (step 2 A12), but a 4-digit keyword containing rill in the upper digits is searched. Since there is no record in file A15, the values of the D and C registers are decremented and the search condition is changed (steps A13 and A14).As a result, the value of Dl/register is rll. The value of the C register is "3", but the record that satisfies this search condition is already in file B16.
Since it does not exist in file A15 using the transfer method,
Furthermore, the values of the D register and C register are decremented,
Change the value of D register to 'IJ' and the value of CI/register to '2'.

As a result, a record with a two-digit keyword including rlJ in the upper digits is searched from file A15 (step A12), but in this case, file A15
Since there are records with the keywords "12J" and "13" in the file, the record with the keyword "12" having the smaller value is transferred to the file B16.

Furthermore, search for file A15 while updating the values of the D register and C register as described in 1-1, or search for the file A15 while updating the values of the D register and C register. Steps AI3 and Al1 are repeated until the value of the D register becomes rlJ and the value of the C register becomes "2".

As a result, the record with the keyword "13" remaining in the file A15 satisfies the search condition, so the record is transferred to the file 816 at this point.

After that, by updating the values of the D register and C register, each record that becomes a lower menu for the record of keyword "13", that is, keywords r131J, r
133J records are sequentially transferred to file 816.

Therefore, as shown in FIG. 5, each record in the file A15 is rearranged according to the rules (1), (2), and (3) mentioned above and transferred to the file B16.
The name records in the file 816 have an array structure with regularity that conforms to the shape of the tree structure.

FIG. 12 is a flowchart showing the coordinate arrangement and the arrangement processing of the processing section 19.

First, the first keyword rlJ is read from the file B16 (step Bl), and the initial value rl is stored in the X register in the work memory 21, and the file B1 is stored in the register.
The number of digits "lJ" for the keyword read from 6 is set (step B2). In this case, the intersection register is the coordinate position in the Y direction of the arrangement table memory 20, that is, the coordinate position 21 in the hierarchy direction. Table memory 20X
This is a register in which the coordinate position in the direction, that is, the coordinate position in the direction perpendicular to the hierarchy direction, is set.

After initializing the values of the X register and statement register in this way, proceed to step B3, and set the coordinate position (x, vertical) of the arrangement table memory 20 corresponding to the values of the X register and 2 register, that is, (i, i). Arrange the keyword "11" read from file B16 (see FIG. 7).

Then, the record corresponding to this keyword is read from the file B16 and the branch information in the record is identified (Step B4). (step B5).Currently, the record for keyword rlJ includes branch information rmJ, and since there is a subordinate menu in that record, file 816
Step B: Read the next keyword rl IJ from
6) The number of digits of the keyword "2" is first set in the register, the reregister (1) is updated, and the hierarchy level is lowered by one level (step B7).

Then, step B
In order to return to step 3, the keyword rl IJ is placed at the coordinate position (l, 2) of the placement table memory 20 this time.

In this case, since the record of keyword rl IJ also includes branch information rmJ (steps B4 and B5), i
In order to update the register, the next record ri 11J is read from the file B16 and its digit number "3" is saved in the register again (steps B6 and B7). As a result, the keyword rt 11J is allocated and stored in the table memory. 2
0 coordinate position t(1,3) (step B3)
.

As a result, as shown in FIG. 7, the keywords rlJ, rlIJ, r
11J are arranged sequentially in the hierarchy direction.

Here, since the record of the keyword rl 11J does not contain any branch information rmJ, the process advances to step B8, and the X coordinate value is updated by adding rlJ to the value of the X register. The value of is "2".

Then, from file B16, the next keyword rl12J
(Step B9), it is checked whether all the keywords in the file B16 have been arranged (Step B9).
), it has not been placed yet, so proceed to step Bll,
The value of the keyword digit count register read from file B16 is compared. Here, the number of digits of the keyword is "3" and the value of the sL register is "3", so a match between the two is detected, so the process proceeds to step B3.

As a result, the keyword rl12J is placed at the coordinate position (2, 3) of the placement table memory 20. in this case,
Since the record of keyword rl12J does not include branch information rmJ, the value of the X register is updated (step B8).

Then, the next keyword "12" is read from the file 816 (step B9), but in this case, a mismatch between the number of digits of the keyword "2" and the value of the sentence register "3" is detected, so the keyword Set the number of digits for "12" (step B7), thereby setting the number of digits for "12".
2” is the coordinate position of the arrangement table memory 20! (3,2) (step B3).

Below, by performing the same operation, file B
The keywords in 16 are arranged in the arrangement table memory 20 as shown in FIG.

After all the keywords in the file B16 have been arranged in the arrangement table memory 20 in this way, step A
This is detected by the IO, and the process proceeds to step A12. In order to specify the placement area of the keyword basically placed in the placement table memory 20, the maximum coordinate value of the area in the X direction is n say in the work memory 21. The maximum coordinate value of the arrangement area in the Y direction is detected and set in the 8 register in the work memory 21.

Note that the value of the 1max register is obtained by subtracting rlJ from the current count of the X register.

Sudoichi/') FE! i-Process 1 FIG. 13 is a flowchart showing the operation of the block placement processing section 22, which will be described below with reference to FIG. 14. Incidentally, FIG. 14 is a diagram showing a process in which record contents are arranged in the page memory 23.

First, initial values rlJ are set in the X register and fL register in the work memory 21 (steps D1 and D2).
Then, the coordinate position N (x, !L
) is read out (step D3), and it is checked whether it is a keyword (step D4).

Now, the keyword rlJ is read from the coordinate position (1, 1) of the arrangement table memory 2o, so step D8
However, since this keyword rlJ is read out first, it is detected in step D8.

Then.

Arrange and output the created block area pattern at the corresponding coordinate position l on the page memory 23 (step DIO), and read the record contents corresponding to this keyword rlJ from the file B16 (step Dll), block in the page memory 23 Arrangement and output within the area pattern (step D12). FIG. 14 (1) shows a state in which the record contents of the keyword rlJ are arranged in the page memory 23.

Therefore, in order to horizontally connect block areas of records that are subordinate menus to this record in the page memory 23, first, use the keyword "l".
is set in a register in the arrangement table memory 20 (step D13), and the value of the register is set to "
1" is added to update the value, and an initial value rlJ is set in the X register in the arrangement table memory 20 (step 014). Here, the X register is used to connect record blocks horizontally. This is used to specify within which range the horizontal line pattern should be created and arranged, and the L register in the layout table memory 20 is set with the left coordinate position (starting point position) where the horizontal line pattern described above is drawn. Also, the right coordinate position of Rl/register (end point position!) is the register to which the next step D1 is set.
At step 5, the contents of each register L and H are reset.

In this way, if each register is set to a predetermined value (1),
The data is read from the coordinate position (x', 仝) of the arrangement table memory 20 specified by the X register (step D16), and it is checked whether it is a keyword (step D17). Now, from the coordinate position (1,?) of the arrangement table memory 20, the keyword "11"
is read out, the process proceeds to step D20, where this key data is compared with the value of the register to check whether the value of the K register is included in the upper digits of this keyword, that is, whether the two are in a vertical relationship. . Here, the value of the register is rlJ, so the keyword "11" is 1 lower than the keyword "1", so the process goes to step D22. Here, since the L register is reset at first, The value rl of the register is set in the L register with the starting point of the horizontal line pattern as the coordinate (step D23).
Then, the coordinate position (x, 1-1) on the page memory 23
In this case, the lower connection pattern is placed and output at the position where the record contents of the keyword rlJ are arranged (step D24).Then, the process proceeds to step D25, where rlJ is added to the value of the X register, and then step D
Return to 16.

As a result, the keyword "12" is now read from the coordinate position (2, 2) of the arrangement table memory 20 (
Steps D16 and D17), since this keyword "12" also includes rlJ in the upper digits, the process advances to step D22. In this case, since "l" is stored in the L register, I4 "2" of the X register is stored. is set in the R register as the end point position coordinates of the horizontal line pattern (step D26), and after updating the X register in step D25, the process returns to step D16. Here, the keyword "13" read from the coordinate position (2, 3) of the table memory 20
” also includes rlJ in the upper digits, so the R register is updated and its (a becomes “3” (step D26), and
Although the registor is updated, since no keyword is stored at the coordinate position W (4, 2) of the arrangement table memory 20, the process advances to step D18, and the value of the X registor is set to X. It is checked whether the value of the register (maximum
A horizontal line pattern is created and arranged and output in the page memory 23. In this case, a horizontal line pattern connecting two points on the coordinate 2 with A4 of the L register as the starting point and Image of the R register as the ending point is created and placed in the page memory 23. Figure 18 (2) shows the page memory 23 in this case.
・Then, return to step 7 D2 and store the layout table memory 2
The data is read from the coordinate position MCx, l) of 0 and it is checked whether it is a keyword or not (step p3), but now the value of the register is "r2" and the value of the X register is rlJ. Therefore, the arrangement table memory Keyword “1” from 20
1" is read out. In this case, in step D9, the upper line pattern is arranged at the coordinate corresponding position of the page memory 231-.
After inputting tI5, place a block area pattern (step 010), and place the record contents of the keyword rl IJ in this block area (step 01).
2) and FIG. 14(3) show the contents of the page memory 23 in this case.

Then, in the same way as described above, various register values are set (steps DI3, DI4, D15). In this case, K
Keyword rl 1'' in register, r in see register
3'', rlJ is set in the x' register. As a result, from the arrangement table memory 20, the keyword rl l
IJ is read out (step D16, 017), and its upper digits contain the value rlIJ in the register (step 020.I)21). First, the value rlJ in the X register is saved in the L register. After 2 toss.

The upper connection pattern is placed at the coordinate corresponding position (2, 1) on the page memory 23 (steps D23, D24), and the keyword rl12J is then read out from the placement table memory 20 by updating the x register. Since this keyword also includes rl IJ in the upper digits, the value of the X register is set to "2" in the R register in step 026, and then the X register is updated.
Then, the keyword rl is retrieved from the arrangement table memory 20.
31J is read out, but since this does not include rllJ in the upper digits and has no vertical relationship with the keyword rllJ, this is detected in step 021 and the process proceeds to step D18, whereupon the value of the X register is set as the X□8 value. The above operation is repeated while updating the value of the X register until reaching .

As a result, when the value of the X registor becomes "5", the process proceeds to step D19, and! ;On the L coordinate "3", from the starting point 1 rl in the L register to the ending point "2" in the R register
"The III line pattern is within the range up to page memory 2.
Located within 3. FIG. 14(4) shows the contents of the page memory 23 in this case.

After that, the keyword rl is stored in the layout table memory 20.
11J is read out (step D2), and its record contents are placed in the page memory 23 along with the upper connection pattern and block area pattern (steps D9 to D12).
, see Figure 14 (5)). In this case, the record with keyword rl 11J is the lowest menu, so below, set keyword rl 11J in the register and update the register value to "4". However, other keywords containing the keyword rl 11J in the upper digits are not searched, and the L and R registers remain reset. therefore.

In this state, even if the value of the X register reaches the value of the x @ay register and the process proceeds to step 019, no horizontal line pattern is created and arranged.

Then, the process returns to step D2, but in this case, since no keyword is stored in the coordinate position (1, 4) of the arrangement table memory 20, the process proceeds to step D4, and the value of the register and the value of the l■aX register are Compare. here,
The value of the statement register is r4J, which therefore matches the value of intersection1x, so the value of the X register and the value of the xsax register are compared (step D6), since the value of the X register is "l" now. , the process proceeds to step D7, where "1" is added to the value of the X register and the value is updated to r2J, and at the same time the value of the see register is returned to the initial value rlJ, after which the process returns to step D2.

As a result, the coordinate position (2,
1) is specified, but since no keyword is stored in that position, the process proceeds to step D5, and the value of the statement register is set to "1", provided that the value of the statement register is not l wax.
” is added and the process returns to step D2.

Then, the keyword “12” is retrieved from the arrangement table memory 20.
” is read out, the record contents of that keyword along with the upper connection pattern and block area pattern are arranged in the page memory 23 (steps D9 to D12, the first
(See Figure 4 (6)).

Then, this keyword "12" is set in the register (Step D13), and the value of the i register is updated to "4" (Step D14), but as in the case above, the record of this keyword "12" is Since there is no menu, even if the f value of the X register reaches the xlJX value, the values of the L and R registers remain reset, so no horizontal line pattern is placed.

Next, the keyword rl12 is extracted from the arrangement table memory 20.
Since J is read out, its record contents are arranged in blocks (steps D9 to D12, see FIG. 14 (7)). Note that this record also has a lower menu. does not exist, so when the reregister I^ reaches the 9-may value (step D4), the value of the x register is updated to "3" and the reregister value is returned to its initial value (step D4). D7).

From now on, as a result of the above-mentioned operation being repeated, Geewart "1"
3", rl 31J, and r132J are sequentially arranged in blocks, thereby filling the page memory 23.
In this way, the contents of the list of the Wi layer menu are arranged in a wooden pattern. When the contents of the list are arranged in the page memory 23 at step 17, the printing unit 14 is activated and the contents of the page memory 23 are When printed, as shown in FIG. 9, a menu list is obtained in which the entire hierarchical menu is printed in a tree-structured representation format.

As a result, the vertical relationship of the hierarchical menus can be confirmed with -[1, and if the menu is selected while visually reading the contents of the list, the selection process can be performed efficiently.

In addition, in the embodiment described above, when connecting block areas in which record contents are placed in a vertical relationship as shown in FIG. 9, the top line pattern of each block is connected with a horizontal line pattern. However.

As shown in Figure 15, the sides of adjacent block areas may be directly connected in a horizontal line pattern in the direction (left and right) perpendicular to the hierarchical direction of the tree structure, so that the vertical relationship can be clearly seen. All you have to do is create and output a suitable wiring pattern.

Further, in the above embodiment, a hierarchical menu is output as a list, but other hierarchical data having a tree structure may be output as a menu.

[Effects of the Invention] In the present invention, since each record constituting a hierarchical menu etc. is attached with information indicating where in the tree structure the record should be incorporated, the tree structure can be changed by adding or deleting records. Even if the shape has changed, each record can be placed at a corresponding location in the changed tree structure, and the state of connection to each record can be changed. Therefore, there is no need to permanently incorporate a tree structure into the menu list creation program itself, and as a result, even if the shape of the tree structure changes due to deletion or addition of records, the changed arrangement can be changed to Alternatively, there is no need to redesign the menu/list creation program based on the wiring state, resulting in extremely versatile functionality.

[Brief explanation of drawings]

Fig. 1 is a functional block diagram of this invention, Fig. 2~ff11
Figure 4 shows an example, and Figure t52 shows the hierarchical record arrangement I! A block diagram showing the configuration of the device, FIG. 3 is a diagram showing a specific example of file A15, FIG. 4 is a diagram showing the record structure in file A15, and FIG. 5 is a state in which the contents of file A15 are sorted into file B16. 6 is a 4#1 configuration diagram of the layout table memory 20, FIG. 7 is a diagram showing the contents of the layout table memory 20, FIG. 8 is a diagram showing the basic pattern of block layout, and FIG. 9 is a diagram showing the basic pattern of block layout. Figure 1 shows an example of menu list output, and Figure io shows the overall operation of I! 11 is a flowchart showing the operation of the sort processing section 17, FIG. 12 is a flowchart showing the operation of the coordinate placement processing section 19, FIG. 13 is a flowchart showing the operation of the block placement processing section 22, FIG. 14 is a diagram showing the contents of the page memory 23 that change as the block placement process is executed, and FIG. 15 is another menu with the connection state changed. FIG. 16, which is a diagram showing an example of list output, is a diagram for explaining a conventional example. 11...CPU, 14...Printing section, 1
5...File A, 16-----File B, 17-----Sort processing section, 19...
. . . Coordinate arrangement processing section, 2o . . . Arrangement table memory, 22 . . . Block arrangement processing section.

Claims (1)

[Scope of Claims] Record storage means for storing a plurality of records differentiated by keywords that define hierarchical levels by the number of digits and define vertical and horizontal relationships of a tree structure by word contents; The output position in the hierarchy direction is determined by extracting the keyword of each stored record and analyzing its number of digits, and the output position in the direction perpendicular to the hierarchy direction is determined by analyzing the word content. record output means for reading and arranging and outputting records corresponding to a specified block area from the record storage means; and extracting keywords of each record stored in the record storage means and analyzing the word contents. A hierarchical record characterized by comprising: connection pattern output means for determining the vertical relationship of each record and outputting a connection pattern at a position connecting block areas in which the contents of each record in the vertical relationship are arranged; Placement device.