JPH0454527A - Hierarchy record arrangement device - Google Patents

Abstract

PURPOSE:To omit the need to design again a production program of a menu list despite the change of the form of a tree structure by adding the information to each record constructing a hierarchy menu, etc., to show a specific area of the tree structure where the relevant record is built in. CONSTITUTION:A key word is added to each record stored in a record storage means 1 which stores a hierarchy menu, etc., to show a specific area of a tree structure where the relevant record is built in. An output position deciding means 2 extracts the key word of each record stored in the means 1 and also decides an output position of the hierarchical direction from the number of digits of the extracted word. Furthermore the means 2 decides an output position of the direction orthogonal to the hierarchical direction from the word contents. An output means 3 reads the corresponding record out of the means 1 and outputs the record into an output area that is specified by the output position of the hierarchical direction decided by the means 2 and the output position of the direction orthogonal to the hierarchical direction. Thus each record is set at the corresponding area of a changed tree structure.

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 is a hierarchical record arrangement device that stores #1 records distinguished by keywords that define hierarchical levels by the number of digits and define vertical and horizontal relationships in a tree structure by word content. 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.

[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. If you perform the selection work while reading visually, you can perform the selection work 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. By connecting the lines, a menu list as shown in Figure 20 was obtained.

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

Therefore, it is best to design a menu list creation program in advance to automatically output a list of hierarchical menus in a tree-structured representation format, but if a part of the wie menu is deleted or added, Since the shape of the tree structure itself changes accordingly, a problem arises in that the menu list creation program must be redesigned each time the menu contents are changed.

The reason for this is thought to be that the tree structure of hierarchical menus is fixedly built 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 possible, 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 record deletion or addition, the menu list creation program can be redesigned. It is clear that there is no need for this, making it 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 11-layer menu, etc., and to move each record to the corresponding place in the tree structure based on this information. The purpose is to make it possible to place them.

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

Record memory 81 (see the functional block diagram in FIG. 1,
(same below) are distinguished by keywords that define the hierarchical level by the number of digits, and the vertical relationship (connection relationship in the hierarchy direction) and horizontal relationship (connection relationship in the direction orthogonal to the hierarchy direction) of the tree structure in the word content. This is a file disk that stores multiple records.

The output position determination means 2 extracts the keyword of each record stored in the record storage means 1, and determines the output position in the hierarchical direction (for example, x
In addition to determining the Y-direction position of the Y-coordinate system, the output position (for example, the X-direction position) in the direction orthogonal to the hierarchical direction is determined based on the word content.

The output means 3 outputs a record (for example, a menu name, etc.) corresponding to the output area specified by the output position in the hierarchy direction determined by the output position determination means 2 and the output position in the direction perpendicular thereto from the record storage means 1. Read and layout output.

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

Now, record storage means! The keyword of each record stored in the ``keyword'' defines the hierarchical level by its number of digits, and defines the vertical and horizontal relationships of the tree structure by the word content.For example, if the keyword is numeric string data, the keyword `` 1" is the first hierarchy level, rllJ
, "12" defines the second hierarchical level, and the record with the keyword rl IJ, "12" is the upper digit (
The keyword "11", r1 is defined as having a vertical relationship with the record of keyword rlJ.
The keyword rl is determined by the value of the lower digit (- digit) of 2J.
It is defined that IJ and the record "12" are in a left-right relationship.

Record storage means for storing hierarchical menus, etc. in this way
A keyword is added to each record in the tree structure to indicate where in the tree structure the record should be included.

For example, in response to a list output command such as a hierarchical menu, the output position determining means 2 extracts the keyword of each record stored in the record storage means 1, and also 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. In addition to determining the output position of the word, the output position in the direction perpendicular to the hierarchical direction is determined based on the content of the word. That is, the output position determining means 2 determines the coordinate position in the plane coordinate system as the output position of the corresponding record by analyzing the keyword.

Then, the output means 3 reads out the record corresponding to the output area specified by the output position in the hierarchical direction determined by the output position determining means 2 and the output position in the direction perpendicular thereto from the record storage means 1, and outputs it by arranging it. do.

Therefore, each record that makes up a hierarchical menu etc. has information attached to it that indicates where in the tree structure the record should be incorporated, so even if the shape of the tree structure changes due to the addition or deletion of records, each record Records can be placed at corresponding locations in the modified tree structure.

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

Figure 2 is an office computer (hierarchical record arrangement system!
FIG.

The CPU II arranges this hierarchical record according to a pre-stored system program, etc. ! It controls the overall operation of the 111t unit, and its peripheral device is the CPU.
II has a key manual section 12, a CRT display section 13, and a printing section 1.
4. File A15 and file B16 are connected.

The file A15 stores each record constituting the N layer menu, and in this embodiment, eight types of records are stored in the file A15 as shown in FIG. 3. 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 of the keyword, for example, the keyword "1" is the highest rank (1
(column) hierarchy level, and the keyword rl IJ, “1
2 and "13" define the second hierarchical level, and keywords rl114, rl12, "131" and r133J define the third hierarchical level. Also, depending on the content of the keyword, for example, the keyword rl IJ, "12", "1"
It is defined that the record of "3" is in a vertical relationship with the record of keyword r14 from the upper digit (tens digit), and the keyword "11" is defined from the lower digit (- digit) of the keyword.
, rl2'' and rl3'' are defined to have 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 11J
, rl l 2J record is defined by its upper digits (hundreds digit and thousands digit) to be in a vertical relationship with the keyword "11J record," and from its lower digits (- digit) the keyword rl l IJ, rl12'' record defines that there is a left-right relationship. Furthermore, the keyword rl
The records of 31J and r132J are defined to have a vertical relationship with the record of keyword "13" by their upper digits, and the keywords r131 and "1" are defined from the lower digits.
32'' defines that there is a left-right relationship.

In addition to the keyword, each record includes 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.

The branch information rcJ is the 4th Fi according to the record contents configured in this way, which indicates that there is no lower menu.
! A menu screen as shown in J is displayed and output from the CRT display unit 13.

The file B16 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, 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.

Rule (1) When the number of digits of the keywords is the same, that is, when the keywords define the same hierarchy level, the one with the smaller value of the word content is given priority 0 For example, the keyword rl m
l, "12", "13", keyword r11", "1
2'', r13J(7)Ill.

Rule (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 rl IJ, 1112J focuses on the keyword rl IJ 2, and the value "ll" within the range of the number of digits is the same as the value "11" within the corresponding range of the other keyword rl12J, so the number of digits is Priority is given to the smaller keyword "11".

Rule (3) Furthermore, if the number of digits of the keywords differs, focus on the keyword with the smallest number of digits, and if the values differ within the range of the number of digits, give priority to the keyword with the smaller value. For example, for the keyword "13" and rl12J, focus on the keyword "13", and because the warp value "13" is different from the value "11" within the corresponding range of the other keyword "rl12" within the range of the number of digits, Priority is given to the keyword “13” with the smaller value.

The coordinate arrangement processing section 19 arranges the keywords in the file B16 in the arrangement table memory 20. At this time, the coordinate arrangement processing section 19 executes the arrangement processing using the work memory 21.

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. It corresponds to the direction perpendicular to the hierarchy direction.

When arranging keywords in the arrangement table memory 20 configured in this manner, the coordinate arrangement processing unit 19 executes basic arrangement processing to distribute and arrange the keywords according to the image of the tree structure by analyzing the number of digits of the keywords, etc. Thereafter, a relocation process is executed in which the keywords basically arranged in the arrangement table memory 20 are aggregated and rearranged in the upper coordinate direction of the X axis (leftward in FIG. 6) according to a certain rule.

Note that FIG. 7 shows the basically arranged arrangement table memory 20.
The keywords are arranged according to the vertical and horizontal relationships of the tree structure. FIG. 8 shows the contents of the rearranged arrangement table memory 20. If there is an empty space on the left side, the keywords placed on the right side are fixed without breaking the vertical or horizontal relationship of the tree structure. Shifted to the left according to the rules.

Here, the relocation process is executed according to the following rules.

Rule (1) Focusing on an arbitrary keyword basically arranged in the arrangement table memory 20, if no keyword is stored to the left of the keyword, that is, if the left neighbor is a free space, then the keyword is placed directly below the position of interest. provided that no keywords are memorized.

Shift the keyword at the target position to the adjacent empty area on the left.

Rule (2) Focusing on an arbitrary keyword basically arranged in the arrangement table memory 20, even if the left side of the keyword is a free space, if there is a keyword directly below it,
Shift the focus position down one step. In this case, shift the focus point one step at a time until the left and right below areas are empty, respectively. When the left and right below areas are empty, select the keyword for the first focus position. Shift to the adjacent free space on the left.

Rule (3) When a keyword is shifted to the left as described above, if there is a keyword on the right side, all keywords are shifted to the left by one coordinate.

Note that the work memory 21 is provided with an X register for storing various parameters to be described later, as well as registers, an Xmaw register, an l wax register, and a register.

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 writes the record content to the corresponding coordinate position in the block placement processing unit 22 based on the coordinate position in the placement table memory 20 where the keyword is stored, and the block placement processing unit 22 writes the record content to the block placement processing unit 22. A layout pattern is created and written into the page memory 23.

Figure 9 is a basic configuration diagram of this block arrangement pattern. This basic pattern consists of an upper connection 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. has been done. Note that the upper connection pattern and the lower connection pattern are created as necessary.

Note that the block placement processing unit 22 uses 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 arrangement processing section 22 is printed out from the printing section 14.

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

Next, the operation of this embodiment will be explained based on FIGS. 11 to 18.

Outline of Operation FIG. 11 is a general flowchart showing an outline of the operation of the hierarchical 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 A15 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 arrangement processing unit 19 starts up, executes basic arrangement processing, and basically arranges the keywords in the file 816 in the arrangement table memory 20 (step B). The keywords in the arrangement table memory 20 are rearranged according to a certain rule (step C).

When the keyword is arranged in the arrangement table memory 20 in this way, the contents of the block arrangement processing section 22 are referred to, and the record contents are arranged in blocks in the page memory 23, and each block is connected while creating an arrangement pattern. (Step D).

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

Hereinafter, each of the above-mentioned processes (steps A, B, C1D) will be explained in detail with reference to FIGS. 12 to 15.

'/- 1 column FIG. 12 is a flowchart showing the operation of the sort processing section 17.

First, the initial value "1" is set in the D register and C register in the work memory 18 (steps A1 and A2).The D register is a register that specifies the number of digits of the keyword, and the C register is a register that specifies the word content. .

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 search for 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. . In this case, the contents of D and the 0 digit are both rl'',l, 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 the file A15, this is detected in step A6 and the process proceeds to step A.
Step 8 transfers the searched record from file A to file B. As a result, a record with keyword rlJ is written at the beginning of file B16 (fifth record).
(see figure).

Once the data transfer for 1 ref 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 rlJ is added to the value of the C register (step Al0).

Then, proceeding to step All, it is checked whether there are any records that have not been transferred in the file AlS, but since the presence of records is detected, a record with a keyword that has a 0 digit containing the content of D in the upper digits is selected. Search from file A15 (step A12), in this case, the content of D is rlJ, the 0 digit is r2J, so the keyword rl
Records of "IJ, rl2" 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, step A
Proceeding to step 7, the record with the smaller keyword value among the plurality of corresponding records, that is, the record with the keyword rl IJ is transferred from the file A15 to the file B16.

Then, the values of the D register and C register are updated, and as a result, the value of the D register is "rll", 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
11J and rl12J exist in the file A15, the record with the smaller keyword value, that is, the record with the keyword "rl 11" is transferred to the file 816 (step A7).

Next, the value of register D is updated to rlllJ, and the value of register C is updated to rAJ (steps A9, Al0), but even if file A15 is searched under this condition, the upper digits will be rlllJ.
l Since the 4-digit keyword including IJ 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 rl
Delete the value of the least significant digit from 11J. Then, "1" is subtracted from the value of the C register (step A14). As a result, the value of the C register is "rll", 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 AlS, 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 file A15 as a record that meets that condition, so this is transferred to file B16 (step A
8), At this point, the keyword rlJ, "11", rl
Corresponding records are stored in the file B16 in the order of "11J" and "112" (see FIG. 5).

Similarly, the values of the C register and the C register are updated in steps A9 and Al0), and the file A15 is searched based on the update results (step A12), but it has a 4-digit keyword containing rl12J in the upper digits. Since the recorded record does not exist in the file AlS, change the search conditions by decrementing the values of the C register and C register (
Steps A13 and A14), as a result, the value of the C register is "rll" and the value of the C register is "3", but the record that satisfies this search condition has already been transferred to the file B16 and is stored in the file AlS. Since this does not exist, the values of the C register and the C register are further decremented, and the value of the C register is changed to rlJ and the value of the C register is changed to "2".

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

Furthermore, either the C register and the file A15 are searched while updating the values of the C register as described above, or the value of the C register is changed to , Steps A13 and A14 are repeated until 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 at this point the record is transferred to the file B16.

After that, by updating the values of C register and C register, each record that becomes a lower menu for the record of keyword "13", that is, keyword rl 31J
, r133J are sequentially transferred to file B16.

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

Basic oj11 good! FIG. 13 is a flowchart showing the basic arrangement processing of the coordinate arrangement processing section 19.

First, the first keyword rlJ is read from the file 816 (step, step Bl), and the initial value "l" is stored in the X register in the work memory 21, and the file 8 is stored in the cross register.
The number of digits rlJ of the keyword read from 16 is set (step B2). In this case, the imperial register is the coordinate position in the Y direction of the layout table memory 20, that is, the coordinate position in the hierarchy direction, and the X register is the coordinate position in the layout table memory 20. X
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 the Emperor register in this way, proceed to step B3, and set the coordinate position (x, intersection) of the arrangement table memory 20 corresponding to the value of the X register and the Emperor register, that is, (1, 1). The keyword rlJ read from the file B16 is arranged (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 with keyword "1" includes branch information rmJ, and since there is a lower menu in that record, file B16
Step B: Read the next keyword rl IJ from
6) The number of digits of the keyword "2" is set in the register, the value of the cross register is updated, and the hierarchy level is lowered by one level (step B7).

After that, in order to return to step B3 without changing the value of the X register, this time the coordinate position W(1,
2), the keyword "rll" is placed.

In this case, the record for the keyword rl IJ also includes branch information r m J (steps B4 and B5).
, In order to update the l register, read the next record "rl 11" from file B16 and set the number of digits "3" in the register again (steps B6 and B7). As a result, the keyword rl 11J is stored in the arrangement table memory. 20 coordinate position (l, 3) (step B3
).

As a result, as shown in FIG. 7, the keyword "1", rl IJ,
rl 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 816, 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 "r3" and the value of the l register is "r3", so a match between the two is detected, and 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 for the keyword "rl12" does not include the branch information "m", the value of the X register is updated (step B8).

Then, the next keyword "12" is read from file B16 (step B9), but in this case, a mismatch between the number of digits of the keyword "2" and the value "3" of the cross register is detected, so the keyword is stored in the 1-sentence register. Set the number of digits for "12" (step B7), thereby setting the number of digits for "12".
2'' is placed at the coordinate position (3, 2) of the placement table memory 20 (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 in the X direction of that area is set to 41 wax in the work memory 21. The maximum coordinate value of the arrangement area in the Y direction is detected and set in the Rmax register in the work memory 21. Note that the value of the nmaw register is obtained by subtracting "1" from the current value of the X register.

Relocation Processing FIG. 14 is a flowchart showing the relocation processing of the coordinate placement processing section 19.

First, the initial value rlJ is set in the X register and the cross register (steps C1 and C2), and then the coordinate position of the arrangement table memory 20 corresponding to the value of the X register and the cross register is specified, and the The data is read out (step C3), and it is checked whether it is a keyword (step C4).

Now, since the keyword rlJ is read out, it is checked whether the keyword is stored to the left of the coordinate position (7 steps C5 and C6). The coordinate position of the arrangement table memory 20 specified by the value of (x-1, sentence)
Step C5) to read data from , check whether it is a keyword (step C6), assume that the keyword exists at first, and compare the X register and l wax register (step C7), in this case, there is a mismatch between the two is detected, the process proceeds to step C8, where rlJ is added to the value of the X register to update the X coordinate value, and then the process returns to step C2. In other words, if there is a keyword to the left of the position of interest, all the keywords located on the X coordinate of the position are
1", "11", rl Update the X coordinate while leaving 11J at that position.

As a result, the first position of interest is shifted by one coordinate in the X direction, and this time the coordinate position (2, 1) of the arrangement table memory 20 is specified and data reading is performed (step C3).
In this case, since no keyword is stored at the relevant position, the process proceeds to step 018 and the value of the sentence register is set to rl.
After adding J and updating it, the process returns to step C3. Then, the coordinate position (2, 2
) is specified, but since no keyword is stored in this position, the value of the cross register is updated again (step C1B).

In this case, the coordinate position (2, 3
) has the keyword "12" stored in it, so we check whether the keyword is also stored to the left of it (
Steps C5, C6), since the position (2, 2) is an empty area, the process now proceeds to step C9, and it is checked whether a keyword is also stored under the position of interest (steps C9, Cl0 ).

In this case, below the position of interest (3, 2), that is, the coordinate position fi
Since no keyword is stored at (3, 3), the process proceeds to step CI9 and shifts the keyword on the X coordinate of the position of interest to the adjacent X coordinate (X-1) on the left. Then, all the keywords existing at the lower coordinates than the X coordinate 41 (X+l) are shifted by one coordinate in the upper direction of the X coordinate (Step 2 C20), that is, all the keywords existing on the right side of the position of interest are shifted by 1 ! Shift left by W.

At this point, the contents of the arrangement table memory 20 are rearranged as shown in FIG. 8, and the arrangement area is compressed to the left. In other words, the basically arranged keywords in the arrangement table memory 20 are rearranged in such a way that the arrangement contents are packed in the upper direction of the X coordinate without destroying the vertical or horizontal relationship of the tree structure. The whole of is compressed to the left.

Since the arrangement area is compressed by such rearrangement, in the next step C21, r is calculated from the value of the x tax register.
Subtract lJ. Then, the process returns to step C2, and the initial value rlJ is set in the cross register. Therefore, this time the coordinate position of the arrangement table memory 20! ! (3, l) is specified, but since there is no keyword at that position,
The value of the register is updated and the first position of interest is shifted downward (step Cl8). In this case, the keyword "13" is stored in the position of interest (3, 2) of the arrangement table memory 2o due to the previous relocation process. Therefore, it is checked whether there is a free space to the left of it (steps C5 and C6).
, the keyword "12" is on the left side due to the previous rearrangement.
is stored, the value of the X register is updated (step C8).

Below, the same operation is repeated until the value of the X register reaches the value of The relocation process ends when the X coordinate value "4" is reached.

Note that FIGS. 16 and 17 are diagrams for explaining other operations that do not exist in the above example in the relocation process.

That is, FIGS. 16 and 17 are specific examples where there is no keyword to the left of the position of interest (No in step C6), but there is a keyword below it (YES in step C10). ” indicates the position of interest. In this case, in order to shift the position of interest downward, rlJ is added to the value of the register, and this is set in the register in the work memory 21 (step C11). Then, check whether there is a keyword to the left of this position of interest. investigate(
Steps C12, C13).

Here, the position of interest is moved from the coordinate position of the keyword "12" to the coordinate position of the keyword "121", and since the keyword "rl12" is on the left, the process returns to step C7 and
Update the register and change the position of interest.

Therefore, in the case shown in FIG. 16, no relocation processing is performed.

On the other hand, if there is no keyword on the left when the focused position is shifted downward, that is, in the case of the specific example in FIG. 17, the determination in step C13 is NO, so step C1
Proceed to step 5, shift the focused position further down, and check whether there is a keyword at that position (step C17). In this case, there is an empty area under the keyword rl 21J, so proceed to step 2 C19. Execute relocation processing. As a result, the keyword "12" and rl shown in FIG.
21J is shifted to the empty area to its left.

Block arrangement processing FIG. 15 is a flowchart showing the operation of the block arrangement processing section 22, which will be explained below with reference to FIG. 18. Incidentally, FIG. 18 is a diagram showing a process in which record contents are arranged in the page memory 23.

First, the initial value rlJ is set in the X register and l register in the work memory 21 (steps DI and D2), and the coordinate position ( Step D3) reads data from x, fL) and checks whether it is a keyword (Step D4).

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

Then, the created block area pattern is placed and output at the corresponding coordinate position on the page memory 23 (step DI
O), and step Dll to read the record contents corresponding to this keyword r14 from file B16.
), are arranged and output in the block area pattern in the page memory 23 (step D12). FIG.

First, in order to horizontally connect the block areas of records that are subordinate menus to this record in the page memory 23.

This keyword "l" is set in the register in the arrangement table memory 20 (Stella 7'D13), and rlJ is added to the value in the arrangement table memory 20 to update the value. Set the initial value "1" to the X-register (Step 2 014). Here, the X-register specifies within which range a horizontal line pattern to connect record blocks horizontally should be created and placed. The L register in the arrangement table memory 20 is set to the left coordinate position (starting point position) where the horizontal line pattern described above is drawn, and the R register is set to its right coordinate position (end point position). In the next step D15, the contents of each register L and H are reset respectively.

After setting the predetermined value in each register in this way,
Step D16) reads data from the coordinate position (x', see) of the layout table memory 20 specified by the value of the register register, and checks whether it is a keyword (step D17). Since the keyword rl IJ is read from the coordinate position (l, 2), the process advances to step D20, where this key data is compared with the value of the register, and it is determined whether the value of the K register is included in the upper digits of this keyword. In other words, check whether the two are in a hierarchical relationship. Here, the value of the register is rlJ, so the keyword rlIJ is in a vertical relationship with the keyword rlJ, so the process proceeds to step D22.Here, since the L register is initially reset, the The value rlJ is set in the L register as the starting point position coordinates of the horizontal line pattern (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 content of the keyword "1" is placed in the block (step D24), and then the process proceeds to step D25.
After adding "1" to the value of the X register, step D1
Return to 6.

As a result, the keyword "12" is now read from the coordinate position (2, 2) of the arrangement table memory 20 (
Step D16.017), because this keyword "12" also includes rlJ in the upper digits.

Proceed to step D22. In this case, the L register contains "1".
" is stored, so set the value "2" of the X register to 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, since the keyword "13" read from the coordinate position (2, 3) of the arrangement table memory 20 also includes rlJ in the upper digits, the R register is updated and its value becomes "3" (step D26). ), the X register is further updated, but since no keyword is stored in the coordinate position (4, 2) of the arrangement table memory 20, the process proceeds to step D18.
It is checked whether the value of the X register has reached the value of the X may register (maximum X coordinate value), and if it is less than that, the X register is further updated (step D25). Then, 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 system, with the value of the L register as the starting point and the value of the R register as the ending point, is created and placed in the page memory 23. FIG. 18(2) shows the contents of the page memory 23 in this case.

After that, the process returns to step D2, and the arrangement table memory 20
The data is read from the coordinate position (x, 41) and checked to see if it is a keyword (step D3), but now the value of the sentence register is r2J, and the value of the X register is rl. Therefore, from the arrangement table memory 20 keyword rl
IJ is read. In this case, after placing and outputting the upper sweet line pattern at the coordinate corresponding position on the page memory 23 in step D9, the block 'c1-/query avatar is placed (step DIO), and the keyword r is placed in this block area.
l Arrange the record contents of IJ (step D12)
, FIG. 18(3) shows the page memory 23 in this case.
It shows the contents.

Then, in the same way as described above, various register values are set (steps D13, D14, D15). In this case, the keyword rllJ is in the register, r3 is in the J
"1" is set in the J and x' registers. As a result, the keyword rl 11J is extracted from the arrangement table memory 20.
is read out (step D16.017), and since its upper digits include the value F11 of the register (steps D20 and D21), first, the value rlJ of the X register is set in the L register.

The lower connection pattern is arranged at the coordinate position WC2, l) on the page memory 23 (steps D23, D24), and the keyword rl12J is then read out from the arrangement table memory 20 by updating the X register. Since the keyword also includes rlIJ in the upper digits, the value of the
1J is read out, but since this does not include "11" in the upper digits and is not in a vertical relationship with the keyword rl IJ, this is detected in step 021 and the process proceeds to step 018, whereupon the value of the X register is X until may value is reached
The above operation is repeated while updating the value of the register.

As a result, when the value of the X register becomes "5", the process proceeds to step D19, and on the viewing coordinate "3", within the range from the starting point position "1" in the L register to the ending point position "2" in the R register. A horizontal line pattern is arranged in the page memory 23. FIG. 18(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.
l IJ 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 D01).
2, see Figure 18 (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 value of the statement register to "4". However, other keywords containing the keyword rl 11J in the upper digits are not searched, and the values of the L and R registers remain reset. Therefore, in this state,
Even if the register value reaches the X max register value and the process proceeds to step DI9, no horizontal line pattern is created or arranged.

Then, the process returns to step D2, but in this case, since no keyword is stored at the coordinate position (l, 4) of the arrangement table memory 20, the process proceeds to step D4, and the value of the statement register and the value of the l wax register are stored. compare. Here, the value of the cross register is raJ, so it is also ra. Since the values match, the value of the X register and the value of the xaax register are compared (step D6).Since the value of the X register is rlJ, the process advances to step D7 and the value of the ” is added and the value is updated to “2”, and at the same time, the value of the register is returned to the initial value “1”, and then
Return to step D2.

As a result, the coordinate position (2,
l) is specified, but no keyword is stored in that position, so on condition that the standing register is not l max value, proceed to step D5 and set the value of the sentence register to 'l'.
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 8 (6)).

Then, this keyword "12" is set in the register (step DI3), and the value of the J register is updated to "4" (step DI4), but as in the case above, the record with this keyword "12" is Since there is no menu, even if the value of the X register reaches the X max value, the values of the L register and R register 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, the contents of the record etc. are arranged in blocks (steps D9 to D12, see Figure 18 (7)). Furthermore, since this record also does not have a lower menu, the value of the cross register is the 1aax value. When the value is reached (step D4), the value of the X register is updated to "3", and the value of the X register is returned to the initial value (step D7).
).

Hereafter, as a result of repeating the above operation, the keyword "1"
3", rl 31J, r132" are sequentially arranged in blocks, and thereby the list contents of the hierarchical menu are arranged in the page memory 23 in a tree structure.

When the contents of the list are arranged in the page memory 23 in this way, the printing unit 14 is activated, and the contents of the page memory 23 are printed out and the entire hierarchical menu is expressed in a tree structure as shown in Fig. 1θ. You can get a menu list printed in this format.

As a result, you can check the hierarchy of hierarchical menus at a glance.
If the user visually reads the contents of the list when selecting a menu, the user can perform the selection process more efficiently.

In the above embodiment, after the contents of the arrangement table memory 20 are rearranged by the coordinate arrangement processing section 19, the menu list is output according to the contents. You may also want to output a menu list based on, in this case,
Since the menu list is output according to the contents of the arrangement table memory 20 shown in FIG.
As shown in the figure, it is expressed as a tree structure according to the basic arrangement.

Alternatively, the top-level menu may be centered at the top of the tree structure.

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 changes, each record can be placed at a corresponding location in the changed tree structure. 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 menu list creation program can be redesigned. This eliminates the need for it, making it extremely versatile.

[Brief explanation of drawings]

Figure 1 is a functional block diagram of this invention, Figure 2 - M418
The figure shows an embodiment, FIG. 2 is a block diagram showing the configuration of the hierarchical record distribution WI 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, Figure 5 shows the contents of file A15 in file B.
6 is a configuration diagram of the arrangement table memory 20, FIG. 7 is a diagram showing the contents of the arrangement table memory 20 basically arranged, and FIG. 8 is the rearranged arrangement table memory. 20, FIG. 9 is a diagram showing the basic pattern of block arrangement, FIG. 10 is a diagram showing an example of menu list output, FIG. 11 is a general flowchart showing an overview of the overall operation, and FIG. Sort processing unit 1
13 is a flowchart showing the basic arrangement processing among the operations of the coordinate arrangement processing section 19, and FIG. 14 is a flowchart showing the relocation processing.
FIG. 5 is a flowchart showing the operation of the block placement processing unit 22, FIGS. 16 and 17 are diagrams showing a specific example of the placement table memory 20 for supplementary explanation of the relocation process, and FIG. 18 is a flowchart showing the operation of the block placement processing unit 22. FIG. 19 is a diagram showing the contents of the page memory 23 that change depending on the execution of processing, FIG. 19 is a diagram showing another example of output of a mail list, and FIG. 20 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 placement processing unit, 20... placement table memory, 22... block placement processing unit. Patent Applicant: Casio Computer Co., Ltd.

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; Output position determining means that extracts the keyword of each stored record, determines the output position in the hierarchy direction based on the number of digits of the extracted keyword, and also determines the output position in the direction perpendicular to the hierarchy direction based on the content of the word. and output means for reading from the record storage means and placing and outputting records corresponding to the output area specified by the output position in the hierarchy direction determined by the output position determination means and the output position in the direction perpendicular thereto. A hierarchical record arrangement device characterized by comprising the following.