JP2747233B2 - Cancel / Undo Method and System for Editing Tree Structure Data by Hierarchical Menu Inquiry - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a method and a system for canceling and undoing tree structure data by hierarchical menu inquiry, and more particularly to a plurality of units in which hierarchical connection conditions including selection by a user are defined. Data, and a menu inquiry means for displaying a menu of the selection target and inputting a selection result by the user, and selecting a connection selection target from the top unit data for the plurality of unit data according to the connection condition. A hierarchical menu inquiry data editing system for displaying a menu of other unit data and sequentially connecting the data according to the result of selection by the user, and dynamically editing a tree-structured set (tree structure data) having each unit data as a node. Restores the tree structure data changed by the selection and setting when inquiring the menu in And the recovery method, and to the recovery system.

[0002]

2. Description of the Related Art Hierarchical menu inquiry data editing systems of this type are constituted by computer systems, and each element information piece which is a component of hierarchically structured information assembled by menu inquiry such as control software for an electronic exchange. Multiple unit data (definition description data) in which correspondence and mutual connection conditions are defined in advance
And a menu inquiry means for displaying a menu to be selected on a display device and inputting a selection result from a user using an input device such as a keyboard or a mouse to realize an inquiry, and the top unit data From the menu, other unit data to be selected for connection is displayed according to the connection condition from the menu, and the tree structure data having each unit data as a node is sequentially edited according to the user's selection, and dynamically edited according to the tree structure data. The corresponding elemental information pieces are assembled to obtain the desired hierarchically structured information.

[0003] As a type of unit data (definition description data), a structure type in which a plurality of unit data to be fixedly connected and specified in advance by defining the structure of the immediately lower hierarchy and a menu inquiry is sequentially made, and which can be selectively connected as the immediately lower hierarchy. A single-selection type in which a plurality of unit data are specified in advance and one is selected by a menu inquiry, a field type that is linked only from the upper layer and makes a menu inquiry and the value input by the user is a value, and a menu inquiry that is linked only from the upper layer and There is a citation type that has a preset value without performing it.

[0004] In order to help the user understand the editing operation of the hierarchically structured information using the tree-structured data, an example in which information on how to spend holidays is set will be described below. A description example of the unit data in this case, that is, the definition description data is as follows. % All = struct {% sub0% sub1} format {"This holiday is% t% t."% [1],% [0]}% sub0 = one0f {% sub00% sub01% sub02} message {"what % Text00 “commit to work; go to play; stay at home”% sub00 = “company” format “go to company”｝% sub01 = struct ｛% sub010% sub011｝ format ｛ % T% t "% [1],% [0]}% sub010 = one0f {% sub0100% sub0101} message {" Please choose where to go "} menuText"sea; mountain "% sub0100 =" sea " format {“go to the sea”}% sub0101 = “mou % sub011 = one0f {% sub0110% sub0110% sub0111} sub0112} message {"choose who to go"} menuText "one person; family; friend"% sub0110 = "alone" for ｛“Alone”｝% sub0111 = “family” format ｛“With family”｝% sub0112 = “friend” format ｛“With friends”｝% sub02 = one0f ｛% sub020% sub021｝ format % ＄. down @ message {"Choose what to do"} menuText "Read a book; watch TV"% sub020 = "book" format {"read a book" @% sub021 = "TV" format "" See “｝% sub1 = one0f ｛% sub10% sub10% sub11｝ sub12 ｛message ｛“ Please choose the mode of transportation ”｝ menuText“ none; car; train ”where （switch (% ＄. Up [0] .down.class. ｛Case% sub00: candidate (train); break; case% sub01: candidate (car, train); break; case% sub02: candidate (none); break;｝% buy; “Car” format ｛“by car”｝% sub12 = “train” format ｛“by train”｝ Here, the definition description data% all is at the top and defines the entire structure of how to spend holidays. This is a structure type (struct type) in which two definition description data% sub0 and% sub1 are fixedly lower layers. The format part is a part that defines a format for conversion into hierarchically structured information, and can be shared by all types. Definition description data%
sub0 is the three definition description data% sub00,% sub
This is an alternative selection type (oneOf type) in which b01 and% sub02 are selected. The message portion specifies a selection item and a method instruction message at the time of menu display, and the menuText portion specifies a selection target at the time of menu display. This part specifies the display text. That is, on the menu screen of the definition description data% sub0, "Please select what to do" is displayed as an instruction message, and "Go to work on holiday", "Go to play", and " Is displayed. Definition description data%
Similarly, the sub1 is of the alternative type, but indicates that the where section branches depending on the result of selection with other definition description data (in this case,% sub0). In other words, when the definition description data% sub00 is selected, “train” is automatically selected. When the definition description data% sub01 is selected, a selection menu of “car” and “train” is displayed. When the description data% sub02 is selected, "none" is automatically selected. The definition description data% sub00 is a quote type, has a preset value (company), and is associated with the element information piece “go to company”.

It is assumed that the tree structure shown in FIG. 20 (a) is obtained by sequentially connecting other definition description data from the highest definition description data% all while selecting a menu according to the connection condition. The information on how to spend the holiday at this time is "Go to the mountain with a friend by car on the next holiday." here,
On the menu screen of% sub0, the selection result is changed from "go to play" (% sub01) to "work on holiday" (% s
ub00),% s is automatically added to% s
ub12 is selected, and the tree structure is as shown in FIG.
The information on how to spend the holiday at this time is "Go to the company by train on the next holiday." Also, on the menu screen of% sub0, the selection result is displayed as "at home" (% sub0
When the tree structure is changed to 2), the tree structure becomes as shown in (c).
The sub02 menu (“read book”, “watch TV”) is displayed. "Read a book" (% sub020)
Tree% sub 10 is selected automatically% sub1 Selecting is as minute diagram (d). The information on how to spend the holiday at this time is "Read the book at home for the next holiday."
Becomes

When each unit data is edited into a tree structure data as a node by such a hierarchical menu inquiry data editing system, a tree structure is formed by selecting and setting a menu for a certain node (changing, adding and deleting lower nodes, etc.). In response to an operation (do operation) that changes the data and displays a menu for a lower node or the next different branch (coordinate) node, the tree structure data is returned to the node that was changed immediately before, and the The operation of displaying the menu is called undo, and the operation of returning the tree structure data to the upper node or another previous branch node and displaying the menu of that node is called cancel.

The conventional method of restoring tree-structured data by the hierarchical menu inquiry data editing system usually employs a method of performing only an undo operation or a method of performing only a cancel operation. That is, when an operation different from the previous operation (replacement, addition, deletion) is performed at each node, the entire tree structure data is copied to the undo data / cancel data storage area of the memory (undo data list / cancel data list), and the undo is performed. When the operation / cancel operation is executed, the tree structure data copied in the undo data / cancel data storage area is restored by copying. When performing both the cancel operation and the undo operation, create an undo data list,
Undo data lists returned tree structure data to the point where it should be canceled.

Here, a recovery method by an undo operation will be described. For example, for the tree structure data (hereinafter, referred to as a tree structure) 11 shown in FIG. 3A, (1) change (replace) node E to node F, and (2) change node C to node G. (Replace), (3) undo operation (return node G to node C), (4) undo operation (return node F to node E), and the tree structure
A description will be given of a case where a tree structure 12 (FIG. 3 (b)), a tree structure 13 (FIG. 3 (c)), a tree structure 12, and a tree structure 11 are changed from 1 (FIG. 3A).

First, when the node E125 is changed to the node F126, the entire tree structure becomes the tree structure 12 in FIG. At this time, the undo data 41 (entire tree structure) in FIG. 21A is copied to the undo data storage area 90.
The data stored in the undo data storage area 90 is as shown in FIG. Next, the node C123 is changed to the node G127.
, The entire tree structure becomes the tree structure 13 in FIG. At this time, the undo data 42 (entire tree structure) in FIG. 21B is similarly copied to the undo data storage area 90. The data stored in the undo data storage area 90 is as shown in FIG. Next, when an undo operation for returning the node G127 to the node C123 is executed, the entire tree structure is restored to the original tree structure by the undo data 42 at the top of the undo data storage area 90 shown in FIG. At this time, the undo data 43 (entire tree structure) in FIG. 21C is copied to the undo data storage area 90. The data stored in the undo data storage area 90 is shown in FIG.
It becomes as shown in. Next, the node F126 is connected to the node E1.
When the undo operation for returning to the row 25 is executed, the undo is executed continuously. Therefore, the entire tree structure is restored to the original one by the previous undo data 41 shown in FIG.
become. At this time, the undo data 42 (entire tree structure) in FIG. 21B is similarly copied to the undo data storage area 90. The data stored in the undo data storage area 90 is as shown in FIG.

[0010]

In the conventional method of restoring the tree structure data by the hierarchical menu inquiry data editing system, both the case where only the undo operation is performed and the case where only the cancel operation is performed are performed every time the tree structure is changed. Since a copy was taken and restored, a tree structure having the same contents was formed, and the memory consumption was large, causing waste. For this reason, when the memory amount is limited, the possible range of the undo operation / cancel operation (the number of changeable nodes) has been narrowed. In addition, as the tree structure data becomes enormous, the time for copying and the time for restoring the data have been greatly increased.

[0011] Further, when both the cancel operation and the undo operation are performed, there is a problem similar to the above-mentioned problem. In addition, it takes time to restore the tree structure in the undo data list to the place to be canceled. In some cases, and the memory consumption becomes enormous because it is necessary to keep all undo data from the beginning of editing in order to perform a cancel operation.

[0012]

An undo method according to the present invention displays a plurality of unit data in which hierarchical connection conditions between them are defined, a menu for selection and setting by a user, and displays a response from the user. Menu inquiry means to be accepted, and unit data to be connected in accordance with the connection condition corresponding to the highest order unit data of the plurality of unit data, sequentially determined according to the response result of the user through the menu inquiry means, and connected. And a tree structure data constructing means for dynamically constructing tree structure data having each of these unit data as a tree structure node, and a memory for storing various data. In a method of restoring a tree structure changed by a change, any one of the nodes When a change operation is performed and the tree structure is changed, the relative position of the changed node in the tree structure, the partial tree structure below the changed node, and the change operation performed on the changed node Undo data having information of an operation type opposite to the type is created and stored in the memory, the undo data stored in the memory is read when an undo operation is performed, and a tree structure is restored based on the undo data. There is a step of returning to

[0013] In the cancel / undo method according to the present invention, in the hierarchical menu inquiry data editing system having the above-mentioned configuration, in the method of restoring the tree structure changed by the change of the node, cancel data is stored in the memory in advance. Prepare a cancel data list and an undo data list for storing undo data,
It has been decided to provide an identifier for identifying the cancel type or the uncancel type in each of the undo data, and a menu selection for one of the nodes,
At the time of do operation to change the tree structure by setting and display the menu for the lower node or the next branch node of the same rank,
Create cancel data with information on the node position to be restored and the partial tree structure before change, add it to the end of the cancel data list, add cancel type undo data to the end of the undo data list, At the time of the cancel operation of returning the tree structure to the node of the previous branch, the last cancel data is separated from the cancel data list, and the tree structure is returned to the state before the change based on the separated cancel data, As undo data for this cancel operation, cancel data separated from the cancel data list and undo cancel type undo data using the partial tree structure changed by this cancel operation as information are created and added to the end of the undo data list, and immediately Tree structure for previously changed nodes At the time of an undo operation for undoing, it is determined whether or not the undo operation has been continued. If the previous operation is not an undo operation, the last undo data in the undo data list is read. If the previous operation is also an undo operation, the undo data is read. The undo data immediately before the undo data read at the time of the previous undo operation of the list is read, the type of the read undo data is determined by the identifier, and in the case of the cancel undo data, the same processing as the processing at the time of the cancel operation is performed. In the case of undo data, the tree structure is restored based on the information, the cancel data separated from the cancel data list is returned to the cancel data list, and the cancel data is used as undo data for this undo operation. Before type undo data Comprising the step of adding to the end of the undo data list.

[0014] Hierarchical menu inquiry data of the present invention
The editing system uses the hierarchical menu inquiry data
In the data editing system, cancel data is stored in the memory.
Data list and undo data for storing data
And an undo data list for storing data.
Any of the nodes under the control of the queue inquiry means.
Change the tree structure by selecting and setting the menu for
Menu for the next node or next branch node of the same rank
When a do operation that displays
Canceling using the position and partial tree structure before change as information
Create data and add it to the end of the cancel data list.
A cancel type identifier having an identifier indicating the cancel type.
Add undo data to the end of the undo data list
Control processing means and control of the menu inquiry means
For a higher node or a previous branch node of the same rank
When a cancel operation for restoring the tree structure is detected, the key
Remove the last cancel data from the cancel data list
Release, tree structure based on this separated cancellation data
To the state before the change, and
From the cancel data list as edit data
Canceled data released and changed by this cancel operation
Indicates the uncancelled type using the extracted partial tree structure as information
Create undo data with identifier
Cancel at the end of the undo data list
Processing means and control of the menu inquiry means
Undo tree structure for the node just changed
If an undo operation is detected, it is determined whether the undo operation has continued
If the previous operation was not an undo operation,
を Read the last undo data in the data list and
If the operation is also an undo operation, the undo data
Undo data read during the last undo operation of the list
The undo data one step before
The type of data is determined by the identifier, and the cancel type
In the case of undo data, processing by the cancel processing means
Performs the same processing, and cancels the undo data
The tree structure based on the information.
Cancel data separated from the cancel data list
Return to the cancel data list and perform this undo operation
Cancel type AND as undo data for
ア Add data to the end of the undo data list
That it has a Undo processing means.

[0015]

BRIEF DESCRIPTION OF THE DRAWINGS FIG.
You. First, an embodiment of the undo method of the present invention will be described. The undo method of the present invention can be similarly applied to the hierarchical menu inquiry data editing system shown in FIG. 1A used in the cancel / undo method described later. However, the cancel processing unit 1070 may not be provided. Unit data, the tree-structure data, the required data, information, such as A Ndudeta stored in the memory 1100 under the control of the menu inquiry control unit 1050, the node corresponding menu is displayed on the display device 1010, the menu selection by the user, A do operation and an undo operation such as change and setting are performed by the input device 1020. The undo process and the undo process for the data in the memory 1100 are performed by the do processing unit 1060 and the undo processing unit 1080 via the data construction unit 1090, respectively.

FIG. 2 is a flowchart showing the processing procedure of the undo method of the present embodiment. As described in the prior art, the tree structure 11 shown in FIG.
Change (replace) node E125 to node F126,
(2) Change (replace) the node C123 to the node G127, (3) Execute a continuous change operation of the undo operation (return the node G to the node C), (4) Undo operation (return the node F to the node E) And the tree structure,
From the tree structure 11 (FIG. 3A) to the tree structure 12 (FIG.
(B)), the tree structure 13 (FIG. 3C), the tree structure 12, and the tree structure 11 will be described as an example of the processing operation.

First, when the node E125 is changed (replaced) to the node F126 by the menu selection and setting change operation of the node C123 of the tree structure 11 (NO in step S1 in FIG. 2), the entire tree structure becomes the tree structure 12. (Step S
2). At this time, the relative position data 211 of the node E125 on the tree structure as shown in FIG.
The undo data 21 including the tree structure data 212 on the branch side (lower side including the own node) from the node 125 and the operation type data 213 opposite to the type of the change operation performed at the node E125 is created (step S3). ), And copy it to the undo data storage area 90 in the memory (step S4).
The relative position of a node on the tree structure is the relative position of the node viewed from the highest (root) node A121. Each node at the same level branched from a certain node is assigned a number of 0, 1,..., N as a relative position. That is, the relative position 111 of the node B 122 with respect to the node A 121 is “0”, and the relative position 112 of the node C 123 is “0”.
Becomes “1”, and the node D12 for the node C123
The relative position 113 of node 4 is “0”, and the relative position 114 of node E125 is “1”. Node F126 is the node E1
When replaced with 25, the relative position 115 is assigned the same “1”. Accordingly, the relative position data 211 of the node E125 includes the relative position 112 (= 1) of the node C123 viewed from the node A121 and the node C123.
From the relative position 114 (= 1) of the node E125 as seen from the left side, and becomes “1-1”. The types of change operations performed on each node include “replace”, “add”, and “delete”.
And the opposite operation types are “replace”, “delete”,
"Add". Therefore, the reverse operation type data 213 at this time is “replace”. As described above, the data storage status of the undo data storage area 90 at this time is as shown in FIG.

Next, when the node C123 is changed (substituted) to the node G127 by the menu selection and the setting change operation of the node A121 of the tree structure 12, the entire tree structure becomes the tree structure 1
It becomes 3. The relative position 116 of the node G127 to the node A121 is assigned the same “1” as the node C123. At this time, the undo data 22 shown in FIG. 4B is similarly copied to the undo data storage area 90, and the data storage status of the undo data storage area 90 is as shown in FIG.

In this state, the node G127 is connected to the node C12.
3 is executed (Y in step S1).
On the ES side), the uppermost undo data 22 in the undo data storage area 90 shown in FIG. 6 is read (step S).
5) From the relative position data 211 (= 1), the upper node (node A) to which the menu selection / setting result is returned and the position of the node (current node G) returned by it are identified, and the tree on the branch side is identified. Structure data 212 (nodes C, D,
F) and the reverse operation type data 213 (replacement) restores the tree structure to the tree structure 12 (step S6). Also at this time, the undo data 23 shown in FIG. 4C is copied to the undo data storage area 90 (steps S3 and S3).
4). The data storage status of the undo data storage area 90 is as shown in FIG.

Further, in this state, the node F of the tree structure 12
When the undo operation for returning 126 to the node E125 is performed, the undo is performed continuously, and therefore the undo data 2 immediately before in FIG.
1 is read out and its relative position data 211 (= 1−1)
, The upper node (node C) to which the menu selection and setting result is returned and the position of the node (current node F) to be returned thereby are identified, and the tree structure data 212 on the branch side is identified.
The tree structure is restored to the tree structure 11 by (Node E) and the reverse operation type data 213 (replacement). At this time, the undo data 24 shown in FIG. 4D is similarly copied to the undo data storage area 90. The data storage status of the undo data storage area 90 is as shown in FIG.

In this embodiment, when the undo data 21 to 24 are set, information of the operation type opposite to the operation type performed at the node is set, and when the tree structure is restored, the information is returned according to the information. However, when the information of the type of operation performed at the node is set as it is and the tree structure is restored, the operation opposite to the information can be performed.

As described above, according to the undo method of this embodiment, when an operation different from the previous operation (change of node replacement, addition, deletion, etc.) is performed at each node by a menu operation, a node on the tree structure is changed. Undo data having information on the relative position of, the tree structure on the branch side from the node, and the operation type opposite to the operation type performed at the node, and store the undo data in the undo data storage area. Since the tree structure is restored using the undo data stored at the time of the operation, the time required to store the undo data in the undo data storage area as the tree structure data becomes enormous and the undo data storage area at the time of executing the undo operation With this undo data, the time required to restore the tree structure can be reduced. Also, as the tree structure data becomes enormous, the undo data becomes smaller than the entire tree structure, so that the memory consumption can be reduced and the possible range of the undo operation can be expanded.

Next, an embodiment of the cancel / undo method of the present invention will be described. FIG. 1 is a diagram showing an example of a hierarchical menu inquiry data editing system (constituted by a computer system) to which the cancel / undo method of this embodiment is applied. FIG. 1 (a) is a system configuration, and FIG. The state of control of tree structure data, cancel data, and undo data for the memory 1100 by the do processing unit 1060, cancel processing unit 1070, and undo processing unit 1080 through the data construction unit 1090 is shown. In FIG. 1A, the data construction unit 10
90 controls various types of data and information such as unit data necessary for assembling tree-structured data between the disk device 1120 and the memory 1100 by controlling the file input / output control unit 1110;
The assembled tree structure data and the like are transferred, and the tree structure data is assembled under the control of the menu inquiry control unit 1050. The menu inquiry control unit 1050 displays a menu corresponding to the node on the display device 1010 in accordance with the process of editing the tree structure data of the data construction unit 1090.
Operation information such as menu selection, change, and setting by the user is input to the menu inquiry control unit 1050 via the input device 1020, and the do processing unit 1 according to the operation content.
060, cancel processing unit 1070, undo processing unit 1
080 and the data construction unit 1090 are activated. The undo processing unit 1060, the cancel processing unit 1070, and the undo processing unit 1080 each include a data construction unit 1090.
Processing of tree structure data in the memory 1100 via
The cancel process and the undo process are performed, and the menu inquiry control unit 1050 displays the menu of the new node. In FIG. 1B, the memory 1100 has tree structure data 500, a cancel data list 600 storing cancel data 601 and an undo data list 700 storing cancel type undo data 701 and undo type undo data 702. . The undo processing unit 1080 includes a cancel undo processing unit 1081 that performs processing of cancel undo data (same as the processing of the cancel processing unit 1070) and an undo cancellation undo processing unit 1082 that performs processing of undo data. doing.

FIG. 9 (a) shows the cancel data 60 in FIG.
1. The cancellation type undo data 701 is shown in the distribution diagram (b).
And undo data 70 shown in FIG.
2 is shown. The cancel data 601 includes “a tree structure node to be restored” and “information before a tree structure node is changed”.
Undo data (reference numerals 21 to 2 in FIG. 4) in the undo method described earlier as another embodiment.
A configuration similar to 4) can be adopted. In this case, the upper node of the node position indicated by the relative position data 211 becomes the tree structure node to be restored, and the node position indicated by the relative position data 211, the tree structure data 212, and the reverse operation type data 213 change the tree structure node. It becomes the previous information. The information of the reverse operation type data 213 does not have to be reversed at the time of setting, as in the case of the undo method, and may be read and then reversed. Cancel type undo data 70
1 has a “cancel type identifier”. Uncancel type undo data 702 is “Uncancel type identifier”
And "Information for restoring the cancel data list"
And "information for restoring the tree structure".

FIG. 10 is a flowchart showing the processing procedure of the do processing unit 1060. The do processing unit 1060 accesses the memory 1100 via the data constructing unit 1090 when a do operation is performed by a menu inquiry, and “cancels a tree structure node” and “information before a tree structure node is changed” as cancel data. (Step S
10), add this cancel data to the end of the cancel data list 600 (step S11). And
Undo data list 7 for cancel type undo data
00 is added to the end (step S12).

FIG. 11 is a flowchart showing the processing procedure of the cancel processing unit 1070. Cancel processing unit 1
070 is a data construction unit 1 when a cancel operation is performed.
090, the memory 1100 is accessed, and based on the last cancel data in the cancel data list 600, the tree structure below the node designated as the "undelete tree structure node" is returned to the state before the change (step S2).
0). Then, the cancel data is separated from the cancel data list 600 (step S21). Undo data for this cancel operation is prepared as undo data of undo type, and the "information for returning the cancel data list" is set to the cancel data separated in the process of step S21. The information changed by the current cancellation is set in the "information to be returned" (step S22), and added to the end of the undo data list 700 (step S23).

FIG. 12 is a flowchart showing the processing procedure of the undo processing unit 1080. Undo processing unit 108
0 indicates that the data structuring unit 1090 is used when the undo operation is performed.
, And fetches one undo data from the undo data list 700. At this time, if the previous operation is not an undo operation and a new undo operation is performed, the last undo data is used. If the previous operation is an undo operation and undo operations are performed continuously, the undo data read during the previous undo operation is used. The undo data immediately before the data is read (step S30). The type of the read undo data is determined by its identifier, and in the case of the cancel type undo data (YE in step S31).
(S side) performs the same processing as that of the cancel operation by the cancel type undo processing unit 1081, and in the case of the undo data (NO side in step S 31), the “tree structure” is The tree structure is restored based on the "information for restoring" (step S32), and the cancel data set in "information for restoring the cancel data list" is returned to the cancel data list 600 (step S3).
3), undo data list 7 indicating cancel type undo data as undo data for this undo operation.
00 is added to the end (step S34).

When the undo data is added to the undo data list 700, the cancel processing unit 1070 and the undo processing unit 1080 determine whether the total number of stored undo data exceeds the maximum number of undos permitted by the system design. The first (oldest) undo data in the undo data list 700 is deleted.

Next, the operation of changing and restoring tree structure data by the cancel / undo method of the present invention will be described in detail. As an example, the maximum number of undos is 5, the node C is changed to the node H in the menu of the node B with respect to the tree structure data (hereinafter, referred to as a tree structure) 501 in FIG. The node E is changed to the node I in the menu of the node D with respect to the tree structure 502 so that the tree structure 503 is obtained.
(FIG. 15), the node J is set in the menu of the node I for the tree structure 503, and the tree structure 504 is obtained (FIG. 16).
Undo operation (FIG. 17), cancel operation (FIG. 18),
A case in which the tree structure is returned to the tree structure 503, the tree structure 502, and the tree structure 503 in the order of the undo operation (FIG. 19) will be described.

In FIG. 13, the cancel data list 600 and the undo data list 700 have not yet been set in the initial state. When the node C is changed to the node H in the menu of the node B of the tree structure 501 in FIG. 13, the cancel data 611 is prepared, the node B is set to the tree structure node to be restored, and the information before the change of the node is set. Set node C and cancel data list 60
Add to 0. Cancel type undo data 711 is added to the undo data list 700 (FIG. 14).

When the node E is changed to the node I in the menu of the node D of the tree structure 502 in FIG. 14, the cancel data 612 is prepared, and the node D is added to the tree structure node to be restored.
Is set, the node E and the nodes F and G immediately below the node E are set as information before the change of the node, and the information is added to the cancel data list 600. Cancel type undo data 712 is added to the undo data list 700 (FIG. 15).

When the node J is set in the menu of the node I of the tree structure 503 in FIG.
And set the node I to the tree node to be restored,
“None” is set as the information before the change of the node, and is added to the cancel data list 600. Cancel type undo data 713 is added to the undo data list 700 (FIG. 16).

When an undo operation is performed in the tree structure 504 of FIG. 16, since the last undo data of the undo data list 700 is the cancel type undo data 713, a tree for returning to the original of the last cancel data 613 of the cancel data list 600. Since the structure node is the node I and the information before the node change is “none”, the node J is separated from the node I of the tree structure 504. Then, undo data 714 is prepared, and the cancel data 613 is replaced with information for restoring the cancel data list of the undo data 714, and the separated node J is the information for restoring the tree structure. (FIG. 17).

When a cancel operation is performed in the tree structure 503 in FIG. 17, the tree structure node for returning the last cancel data 612 in the cancel data list 600 is the node D.
Since the information before the node change is the nodes E, F, and G, the node I is separated from the node D of the tree structure, and the nodes E and below are connected. Then, the undo data 715 is prepared, and the cancel data 6
12 is connected to information for returning the cancel data list of the undo data 315 to the original state, and the separated node I is connected to information for returning the tree structure to the original state (FIG. 1).
8).

When an undo operation is performed in the tree structure 502 of FIG. 18, since the last undo data of the undo data list 700 is the undo data 715, information for returning the cancel data list of the undo data 715 to the original state is provided. Since the node of the tree structure node to be restored of the cancel data 612 is the node D and the information for restoring the tree structure of the undo data 715 is the node I, the node E is separated from the node D of the tree structure 502 and the node I is Connect. Then, the cancel data 612 of the information for returning the cancel data list of the undo data 715 to the original state is connected to the cancel data list 600. Here, since the maximum number of undos is 5, the undo data list 700 is used so that the number of undo data does not exceed the maximum number of undos.
Is deleted (FIG. 19).

As described above, according to the cancel / undo method of the present embodiment, while the cancel data list and the undo data list are separated, the cancel data and the undo data are shared, so that the memory consumption and processing are performed. Time can be greatly improved.

[0037]

As described above, according to the present invention, a tree structure changed in a hierarchical menu inquiry data editing system for dynamically editing tree structure data using a plurality of unit data as nodes of the tree structure. When an undo operation is performed to restore the original node, when a change operation is performed on the changed node and the tree structure is changed, the relative position of the changed node in the tree structure and the partial tree below the changed node are changed. By creating undo data using information of the structure and the type of operation opposite to the type of change operation performed on the changed node, the amount of undo data compared with the conventional method (copy of the entire tree structure) Can be significantly compressed, so that as the tree-structured data becomes enormous, the time required to store the undo data in the memory and the execution of the undo operation Ndudeta can the reduce the time for returning from the memory based on the read tree structure, also, the memory consumption can also be reduced, it is possible to expand the range of undo operations.

When performing both the cancel operation and the undo operation, the cancel data list and the undo data list are separately provided, but two types of undo data are provided, namely, a cancel type and an undo type. Both the type undo data and the node position to be restored and the partial tree structure before the change are used as information, and the amount of data is significantly reduced while sharing, so processing time and memory consumption are reduced compared to the conventional method. It is possible to greatly improve, and the possible range of the undo operation / cancel operation can be expanded.

[Brief description of the drawings]

FIG. 1 is a diagram showing an embodiment of a hierarchical menu inquiry data editing system according to the present invention. FIG. 1 (a) shows a system configuration, and FIG. 1 (b) shows tree structure data, cancel data and undo data. The state of control is shown.

FIG. 2 is a flowchart showing a processing procedure of one embodiment of the undo method of the present invention.

FIGS. 3A, 3B, and 3C are diagrams illustrating an example of a change history of a tree structure; FIGS.

FIGS. 4 (a), (b), (c) and (d) are diagrams showing undo data for the tree structure change history of FIG. 3 by the undo method of the present invention.

FIG. 5 is a diagram showing the storage state of undo data in the memory when the tree structure of FIG. 3 is changed from the split diagram (a) to the split diagram (b) by the undo method of the present invention.

FIG. 6 is a diagram illustrating a memory storage state of undo data when the tree structure in FIG. 3 is changed from the diagram (b) to the diagram (c) in the state of FIG. 5;

7 is a diagram illustrating a memory storage state of undo data when the tree structure of FIG. 3 is returned from the division diagram (c) to the division diagram (b) in the state of FIG. 6;

8 is a diagram showing a memory storage state of undo data when the tree structure of FIG. 3 is returned from the division diagram (b) to the division diagram (a) in the state of FIG. 7;

FIGS. 9 (a), 9 (b), and 9 (c) are diagrams showing the configurations of cancel data, cancel type undo data, and undo type undo data according to the cancel / undo method of the present invention, respectively.

FIG. 10 is a flowchart showing a processing procedure at the time of a do operation in one embodiment of the cancel / undo method of the present invention.

FIG. 11 is a flowchart showing a processing procedure at the time of a cancel operation in one embodiment of the cancel / undo method of the present invention.

FIG. 12 is a flowchart showing a processing procedure at the time of an undo operation in one embodiment of the cancel / undo method of the present invention.

FIG. 13 is a diagram showing an example of an initial state of storing tree structure data, cancel data, and undo data in a memory according to the cancel / undo method of the present invention.

FIG. 14 is a diagram showing a memory storage state of tree structure data, cancel data, and undo data when node C of FIG. 13 is changed to node H;

FIG. 15 is a diagram showing a storage state of tree structure data, cancel data, and undo data in a memory when a node E in FIG. 14 is changed to a node I;

FIG. 16 is a diagram showing a memory storage state of tree structure data, cancel data, and undo data when a node J is set to the node I of FIG.

FIG. 17 is a diagram showing the storage state of tree structure data, cancel data, and undo data in a memory when an undo operation is performed in the state of FIG. 16;

FIG. 18 is a diagram showing the storage state of tree structure data, cancel data, and undo data in the memory when a cancel operation is performed in the state of FIG. 17;

FIG. 19 is a diagram showing the storage state of tree structure data, cancel data, and undo data in a memory when an undo operation is performed in the state of FIG. 18;

FIGS. 20 (a), (b), (c) and (d) are diagrams showing a tree structure for explaining the operation of the hierarchical menu inquiry data editing system.

FIGS. 21 (a), (b) and (c) are diagrams showing undo data for the tree structure change history of FIG. 3 according to the conventional undo method.

FIG. 22 is a diagram showing the storage state of undo data in the memory when the tree structure in FIG. 3 is changed from the diagram (a) to the diagram (b) by the conventional undo method.

FIG. 23 is a diagram showing the storage state of undo data in the memory when the tree structure in FIG. 3 is changed from the diagram (b) to the diagram (c) in the state of FIG. 22;

24 is a diagram showing a memory storage state of undo data when the tree structure of FIG. 3 is returned from the division diagram (c) to the division diagram (b) in the state of FIG. 23;

25 is a diagram showing a memory storage state of undo data when the tree structure of FIG. 3 is returned from the division diagram (b) to the division diagram (a) in the state of FIG. 24.

[Explanation of symbols]

11, 12, 13 Tree structure (tree structure data) 21, 22, 23, 24 Undo data 121, 122, ..., 127 Node A ... Node G 211 Relative position data of node 212 Tree structure data of technique side 213 Reverse operation Type data 500, 501, 502, 503, 504 Tree structure (tree structure data) 600 Cancel data list 601, 611, 612, 613 Cancel data 700 Undo data list 701, 711, 712, 713, 716 Cancel type undo data 702 714, 715 Uncancel type undo data 1010 Display device 1020 Input device 1050 Menu inquiry control unit 1060 Do processing unit 1070 Cancel processing unit 1080 Undo processing unit 1090 Data construction unit 1100 Memory

 ────────────────────────────────────────────────── ─── Continued on the front page (72) Inventor Hirohisa Yamamoto 5-7-1 Shiba, Minato-ku, Tokyo Inside NEC Corporation (72) Inventor Katsuki Satozaki 4-28 Mita, Minato-ku, Tokyo Japan (56) References JP-A-3-212718 (JP, A) JP-A-3-83121 (JP, A) JP-A-62-22141 (JP, A) 68544 (JP, U)

Claims (3)

(57) [Claims] 1. A plurality of unit data in which hierarchical connection conditions are defined, a menu inquiry means for displaying a menu to be selected and set by a user and receiving a response from the user, and the plurality of unit data. The unit data to be connected according to the corresponding connection condition is sequentially determined from the top-level unit data according to the response result of the user through the menu inquiring means and connected, and each of these unit data has a tree structure. Restore the tree structure changed by the change of the node in the hierarchical menu inquiry data editing system having a tree structure data constructing means for dynamically constructing tree structure data as a node and a memory for storing various data. In the undo method, a change operation is performed on any of the nodes to be changed, and the tree structure is changed. Information about the relative position in the tree structure of the node to be changed, the partial tree structure below the node to be changed, and the operation type opposite to the type of change operation performed in the node to be changed. Undo data is created and stored in the memory, the undo data stored in the memory is read when an undo operation is performed, and the tree structure is restored based on the undo data. 2. A plurality of unit data in which hierarchical connection conditions between each other are defined, a menu inquiry means for displaying a menu to be selected and set by a user and receiving a response from the user, and the plurality of unit data. The unit data to be connected according to the corresponding connection condition is sequentially determined from the top-level unit data according to the response result of the user through the menu inquiring means and connected, and each of these unit data has a tree structure. Restore the tree structure changed by the change of the node in the hierarchical menu inquiry data editing system having a tree structure data constructing means for dynamically constructing tree structure data as a node and a memory for storing various data. In the cancel / undo method, a memory for storing cancel data in the memory in advance is used. A cell data list and an undo data list for storing undo data are prepared, and it is determined that an identifier for identifying a cancel type or an uncancel type is provided for each of the undo data, and for each of the nodes, At the time of a do operation of changing a tree structure by selecting and setting a menu and displaying a menu for a lower node or a next branch node of the same rank, a cancellation using information on a node position to be restored and a partial tree structure before the change. At the time of a cancel operation for creating data and adding it to the end of the cancel data list, adding cancel type undo data to the end of the undo data list, and returning the tree structure to the upper node or the previous branch node of the same rank , Disconnect the last cancel data from the cancel data list, and disconnect The tree structure is returned to the state before the change based on the cancel data, and the undo data for the cancel operation is information of the cancel data separated from the cancel data list and the partial tree structure changed by the cancel operation as information. Undo data is created and added to the end of the undo data list. At the time of the undo operation for returning the tree structure to the node that was changed immediately before, it is determined whether or not the undo operation has been continued. If the previous operation is not the undo operation Reads the last undo data of the undo data list, and if the previous operation is also an undo operation, reads the undo data immediately before the undo data read at the time of the previous undo operation of the undo data list, and reads the read undo data. Determine the data type with the identifier In the case of cancel type undo data, the same process as the process at the time of the cancel operation is performed, and in the case of undo type undo data, the tree structure is restored based on the information, and the cancel data separated from the cancel data list is deleted. Returning to the cancel data list, and adding the cancel type undo data to the end of the undo data list as undo data for the undo operation. 3. A plurality of unit data defining a hierarchical connection condition between each other, a menu inquiry means for displaying a menu to be selected and set by a user and receiving a response from the user, and a plurality of unit data. The unit data to be connected according to the corresponding connection condition is sequentially determined from the top-level unit data according to the response result of the user through the menu inquiring means and connected, and each of these unit data has a tree structure. Hierarchical menu inquiry data editing having tree structure data construction means for dynamically constructing tree structure data as nodes, and a memory for storing various data, and restoring the tree structure changed by changing the nodes In the system, a cancel data list for storing cancel data and undo data are stored in the memory. And a menu operation for displaying a menu for a lower node or a next branch node of the same rank by changing a tree structure by selecting and setting a menu for any one of the nodes under the control of the menu inquiry means. Upon detection, cancel data having information on a node position to be restored and a partial tree structure before the change is added to the end of the cancel data list, and cancel type undo data having an identifier indicating a cancel type is added to the undo data. A do processing means to be added to the end of the list; and detecting a cancel operation for returning the tree structure to the upper node or the node of the previous branch under the control of the menu inquiring means. Detach the cancel data and cancel this detached The tree structure is returned to the state before the change based on the data, and as the undo data for the cancel operation, the cancel data separated from the cancel data list and the partial tree structure changed by the cancel operation are used as information to change the uncancel type. Cancel processing means for creating undo cancellation type undo data having an identifier shown and adding the undo data to the end of the undo data list; and undo operation for restoring the tree structure to the node changed immediately before under the control of the menu inquiry means. Upon detection, it is determined whether the undo operation has been continued.If the previous operation is not an undo operation, the last undo data in the undo data list is read.If the previous operation is also an undo operation, the last undo data in the undo data list is read. AND read during undo operation The undo data immediately before the data is read, the type of the read undo data is determined by the identifier, and in the case of the cancel type undo data, the same processing as that of the cancel processing means is performed. Restores the tree structure based on the information, returns the cancel data separated from the cancel data list to the cancel data list, and adds the cancel type undo data to the end of the undo data list as undo data for this undo operation. A hierarchical menu inquiry data editing system, comprising: