JPH07234770A - Canceling and undoing method in tree structure data editing by hierarchical menu inquiry and its system - Google Patents

Abstract

PURPOSE:To remarkably reduce memory consumption and a processing time by compressing an undoing data quantity at the time of changing tree structure and furthermore, fusing canceling operation and andoing operation. CONSTITUTION:A cancel data list 600 and an undo data list 700 are prepared and undo data is divided into a cancel type 701 and an uncancel type 702. Changing contents information of tree structure data 500 is set to be difference information of a changing node position, its slave side tree structure, etc. At the time of doing operation, changing contents are added to the cancel data list as cancel data 601 and the cancell type is added to the undo data list. When the cancel type is an object in canceling operation and undoing operation, tree structure is undone by last data in the canceling data list and the piece of data and the changing contents by means of this operation are added to the undo data list. When the uncancel type is an object in undoing operation, tree structure and canceling data are undone by the piece of data.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a cancel / undo method and system for editing tree-structured data by hierarchical menu inquiry, and more particularly to a plurality of units in which mutual hierarchical connection conditions including selection by a user are defined. Data and menu inquiry means for displaying a menu of selection targets and inputting selection results by the user, and selecting a connection target according to the connection condition from the highest unit data to the plurality of unit data. A hierarchical menu inquiry data editing system that dynamically displays other unit data, which is displayed as a menu, and is sequentially connected according to the selection result by the user to dynamically edit tree-structured set data (tree-structured data) having each unit data as a node. Return the tree structure data that was 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 A hierarchical menu inquiry data editing system of this kind is composed of a computer system, and each element information piece is a constituent element of hierarchical structured information assembled by a menu inquiry such as software for controlling an electronic exchange. Multiple unit data (definition description data) in which correspondence and mutual connection conditions are defined in advance
And a menu inquiring unit that realizes an inquiry by 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. From the above, other unit data to be selected for connection according to the connection condition are displayed in a menu, and the tree structure data with each unit data as a node is dynamically edited according to the user's selection, and the tree structure data is dynamically edited according to this tree structure data. Corresponding element information pieces are assembled to obtain desired hierarchical structured information.

As the type of unit data (definition description data), a structure type that defines the structure of the immediately lower layer and fixedly connects a plurality of unit data in advance and sequentially inquires a menu, a structure type that can be selectively connected as the directly lower layer An alternative 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 connected only from the upper layer to make a menu inquiry and uses the user input as a value, a menu inquiry that is only connected from the upper layer For example, there is a quote type that has a preset value without performing.

[0004] In order to help understanding of the editing operation of the hierarchical structured information based on the tree structure data, a case of setting holiday spending information will be described below as an example. In this case, a description example of the unit data, that is, the definition description data is as follows. % All = structure {% sub0% sub1} format {“Next holiday is% t% t.”% [1],% [0]}% sub0 = one0f {% sub00% sub01% sub02} message {“What Please choose "} menuText" Go to work on holiday; go to play; stay at home "% sub00 =" company "format {" go to company "% sub01 = structure {% sub010% sub011} format {" % T% t "% [1],% [0]}% sub010 = one0f {% sub0100% sub0101} message {" Please choose where to go "} menuText"Umi; Mountain "% sub0100 =" sea " format {"go to the sea"}% sub0101 = "mou ntain ”format {“ go to the mountain ”}% sub011 = one0f {% sub0110% sub0111% sub0112} message {“ Choose who to go ”} menuText“ one person; family; friend ”% sub0110 =“ alone ” {“Alone”}% sub0111 = “family” format {“Family”}% sub0112 = “friend” format {“Friends”}% sub02 = one0f {% sub020% sub021} format {“At home% t” % $. down} message {"Please choose what to do"} menuText "Read a book; watch TV"% sub020 = "book" format {"Read a book"}% sub021 = "TV" format {"Watch TV See ”}% sub1 = one0f {% sub10% sub11% sub12} message {“ Please choose a 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;}}% sub10 = empt11 “Car” format {“by car”}% sub12 = “train” format {“by train”} Here, the definition description data% all is at the highest level, and defines the overall structure of holiday spending information. This is a structural type (struct type) in which one definition description data% sub0 and% sub1 is fixedly set as a lower hierarchy. The format part is a part that defines a conversion format to hierarchical structured information, and can be shared by all types. Definition description data%
sub0 is the three definition description data% sub00,% su
b01 and% sub02 are alternative selection types (oneOf type). The message part is a selection item when a menu is displayed, a part that specifies a method instruction message, and the menuText part is a selection target when a menu is displayed. This is the part that 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 the display text of the selection target is "go to work on holiday", "go to play", "go home". Is displayed. Definition description data%
Similarly, although sub1 is also an alternative selection type, it indicates that the where part causes branching depending on the selection result in other definition description data (% sub0 in this case). In other words, if the definition description data% sub00 is selected, "train" is automatically selected, and if the definition description data% sub01 is selected, a "car" and "train" selection menu is displayed to define the definition. When the description data% sub02 is selected, "none" is automatically selected. Further, the definition description data% sub00 is a citation type, has a preset value (company), and is associated with the element information piece “go to company”.

Assume that a tree structure shown in FIG. 20 (a) is obtained by sequentially connecting other definition description data from the highest-level definition description data% all while selecting a menu according to the connection condition. The information on how to spend the holidays at this time is "I will go to the mountains with my friends by car next holiday." here,
On the menu screen of% sub0, select the result from "go to play" (% sub01) to "go to work on holiday" (% s
If you change to (sub00),% sub1 will automatically be% s
ub12 is selected and the tree structure becomes as shown in the diagram (b).
The information on how to spend the holidays at this time is "I will go to work by train next holiday." In addition, on the menu screen of% sub0, the selection result is “at home” (% sub0
If you change to 2), the tree structure becomes as shown in diagram (c), and%
The menu of sub02 ("Read book", "Watch TV") is displayed. "Reading a book" (% sub020)
When is selected,% sub12 is automatically selected for% sub1 and the tree structure becomes as shown in the diagram (d). The information on how to spend the holidays at this time is "Read books at home next holiday."
Becomes

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

As a conventional method of restoring tree-structured data by a hierarchical menu inquiry data editing system, a method of performing only an undo operation or a method of performing only a cancel operation has been adopted. That is, when a different operation (replacement, addition, deletion) is performed on each node, the entire tree structure data is copied to the undo data / cancellation data storage area of the memory (undo data list / cancellation data list), and undo is performed. When the operation / cancel operation was executed, the tree structure data that had been copied in the undo data / cancelled data storage area was copied back to the original state. If you want to perform both cancel operation and undo operation, create an undo data list,
The tree structure data was returned by this undo data list to the place where it should be canceled.

Here, a recovery method by an undo operation will be described. For example, with respect to the tree structure data (hereinafter referred to as a tree structure) 11 shown in FIG. 3A, (1) node E is changed (replaced) with node F, and (2) node C is changed with node G. (Replacement), (3) undo operation (returning node G to node C), and (4) undo operation (returning node F to node E), and the tree structures are respectively tree structure 1
The case where the tree structure 12 (FIG. 3A) to the tree structure 12 (FIG. 3B), the tree structure 13 (FIG. 3C), the tree structure 12 and the tree structure 11 are described.

First, when the node E125 is changed to the node F126, the entire tree structure becomes the tree structure 12 shown in FIG. 3B. At this time, the undo data 41 (entire tree structure) of FIG. 21A is copied to the ANDO data storage area 90.
Data stored in the undo data storage area 90 is as shown in FIG. Next, the node C123 is connected to the node G127.
When changed to, the entire tree structure becomes the tree structure 13 in FIG. At this time, similarly, the undo data 42 (entire tree structure) of FIG. 21B is copied to the undo data storage area 90. The stored data 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 structure with the highest level undo data 42 in the undo data storage area 90 shown in FIG. Also at this time, the undo data 43 (entire tree structure) of FIG. 21C is copied to the undo data storage area 90. The stored data in the undo data storage area 90 is shown in FIG.
As shown in. Next, the node F126 is replaced by the node E1.
When the undo operation for returning to 25 is executed, the undo is continuously executed. Therefore, the entire tree structure is restored to the original state by the previous undo data 41 shown in FIG.
become. At this time, similarly, the undo data 42 (entire tree structure) of FIG. 21B is copied to the undo data storage area 90. The stored data in the undo data storage area 90 is as shown in FIG.

[0010]

In the conventional method of restoring tree-structured data by the hierarchical menu inquiry data editing system, the entire tree-structure is rewritten every time the tree-structure is changed, both when the undo operation is performed and when the cancel operation is performed. Since a copy was made and restored, a tree structure with the same contents was created, resulting in a large amount of memory consumption and waste. For this reason, when the memory amount is limited, the possible range of the undo operation / cancel operation (the number of possible node changes) is narrowed. In addition, as the amount of tree structure data increases, the copying time and the restoring time increase significantly.

Further, when both the cancel operation and the undo operation are performed, there is a problem similar to the above problem, and further, it takes time to restore the tree structure in the undo data list until it is canceled. May take a lot of time, or it may be necessary to keep all the undo data from the beginning of the edit in order to perform the cancel operation, resulting in a huge memory consumption.

[0012]

The undo method of the present invention displays a plurality of unit data in which hierarchical connection conditions are defined and a menu to be selected and set by the user and displays the user's response. The menu inquiry unit that receives the unit data and the unit data to be connected according to the connection condition corresponding to the highest unit data of the plurality of unit data are sequentially determined and connected according to the response result of the user through the menu inquiry unit. Of the nodes in the hierarchical menu query data editing system having a tree structure data constructing means for dynamically constructing tree structure data with each of these unit data as a node of the tree structure, and a memory storing various data. In the method of undoing the tree structure changed by the change, one of the changed nodes of the nodes When a change operation is performed and the tree structure is changed, the relative position on the tree structure of the changed node, the partial tree structure under the changed node, and the change operation performed on the changed node An undo data having an operation type opposite to the type is created and stored in the memory, the undo data stored in the memory is read when the undo operation is executed, and a tree structure is created based on the undo data. There is a step of returning to.

The cancel / undo method of the present invention is a method of restoring the tree structure changed by the change of the node in the hierarchical menu inquiry data editing system having the above-mentioned configuration, in which cancel data is stored in advance in the memory. Prepare a cancellation data list and an undo data list to store undo data,
It is arranged that an identifier for identifying the cancel type or the uncance type is provided in each of the undo data, and the menu selection for any one of the nodes is performed.
When doing a do operation that changes the tree structure by setting and displays the menu for the lower node or the node of the next branch of the peer,
Cancel data that creates information about the node position to be restored and the partial tree structure before the change is created and added to the end of the cancel data list, and cancel-type undo data is added to the end of the undo data list, and a higher node or At the time of a cancel operation that restores the tree structure to the node of the branch before the same peer, 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 the undo data for this cancel operation, the cancel data separated from the cancel data list and the undo data of the partial tree structure changed by this cancel operation are created as information, and added to the end of the undo data list. Tree structure for the previously changed node At the time of the undo operation to be undone, it is determined whether the undo operation is continuous. If the previous operation is not the undo operation, the last undo data in the undo data list is read, and if the previous operation is also the undo operation, the undo data is read. Undo data immediately before the undo data read at the time of the previous undo operation in the list is read, the type of the undo data read is determined by the identifier, and in the case of cancellation type undo data, the same processing as the processing at the time of the cancel operation In the case of undo data of the undo type, 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 undo data for this undo operation is canceled. Type before undo data The hierarchical menu inquiry data editing system of the present invention, which has a step of adding to the end of the undo data list, is the hierarchical menu inquiry data editing system having the above-mentioned configuration. An undo data list is provided, and a tree operation is changed by selecting and setting a menu for any one of the nodes under the control of the menu inquiring means, and a menu for a lower node or a node on the next branch of the peer is displayed. Is detected, cancellation data having the node position to be restored and the partial tree structure before the change as information is created and added to the end of the cancellation data list, and cancellation undo data having an identifier indicating a cancellation type is added to the undo. Day When a cancel operation for returning the tree structure to the upper node or the node on the previous branch of the peer is detected by the control of the do processing means added to the end of the data list and the menu inquiry means, the last data from the cancellation data list is detected. The cancel data is separated, the tree structure is returned to the state before the change based on the separated cancel data, and the cancel data separated from the cancel data list as the undo data for this cancel operation and the partial tree modified by this cancel operation A cancel processing unit that creates uncancelled undo data having a structure as information and an identifier indicating an undo type and adds it to the end of the undo data list, and a tree for the node that was changed immediately before by the control of the menu inquiry unit. Undo structure When the undo operation is detected, it is determined whether the undo operation is continuous. If the previous operation is not the undo operation, the last undo data in the undo data list is read. If the previous operation is also the undo operation, the undo data list is read. The undo data immediately before the undo data read at the previous undo operation is read, the type of the read undo data is determined by the identifier, and in the case of cancellation type undo data, the same processing as the processing of the cancel processing means is performed. In the case of undo data of undo type, 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 undo data for the undo operation is the cancel type. Undo data before And a undo processing means for applying to the end of the undo data list.

[0014]

The present invention will be described below with reference to the drawings.

First, an embodiment of the undo method of the present invention will be described. The undo method of the present invention is used in a cancel / undo method described later with reference to FIG.
It is similarly applicable to the hierarchical menu inquiry data editing system shown in FIG. However, the cancellation processing unit 1
070 may be omitted. Unit data, tree structure data,
Necessary data and information such as undo data is stored in the memory 11
00, and the menu corresponding to the node is displayed on the display device 1010 under the control of the menu inquiry control unit 1050.
Is displayed on the input device 1020, and the user performs a do operation and an undo operation such as menu selection, change, and setting. Do processing and undo processing for the data in the memory 1100 are performed by the do processing section 1060 and the undo processing section 1080 via the data construction section 1090, respectively.

FIG. 2 is a flow chart showing the processing procedure of the undo method of this embodiment. In the same manner as described in the related art, for the tree structure 11 shown in FIG.
Change (replace) node E125 to node F126,
(2) Change (replace) node C123 to node G127, (3) undo operation (return node G to node C), and (4) undo operation (return node F to node E) And each tree structure
From the tree structure 11 (FIG. 3A) to the tree structure 12 (FIG. 3)
(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 the setting change operation of the node C123 of the tree structure 11 (NO side of step S1 in FIG. 2), the entire tree structure becomes the tree structure 12. (Step S
2). At this time, as shown in FIG. 4A, the relative position data 211 of the node E125 on the tree structure and the node E
The undo data 21 including the tree structure data 212 on the branch side (lower side including the own node) of 125 and the operation type data 213 opposite to the change operation type performed at the node E125 is created (step S3). ), And copy to the undo data storage area 90 in the memory (step S4).
The relative position of the node on the tree structure is the relative position of the node as viewed from the highest (root) node A121. Numbers 0, 1, ..., N are assigned as relative positions to the nodes of the same level branched from a certain node. That is, the relative position 111 of the node B122 with respect to the node A121 is "0", and the relative position 112 of the node C123 is 112.
Becomes "1", and node D12 with respect to node C123
The relative position 113 of No. 4 is "0", and the relative position 114 of the node E125 is "1". Node F126 is node E1
When replaced with 25, its relative position 115 is assigned the same "1". Therefore, the relative position data 211 of the node E125 is the relative position 112 (= 1) of the node C123 viewed from the node A121 and the node C123.
It is made from the relative position 114 (= 1) of the node E125 seen from the above, and becomes "1-1". In addition, the type of change operation performed at each node is "replace", "add", "delete".
, And the opposite operation types are "replace", "delete", and
It becomes "addition". Therefore, the reverse operation type data 213 at this time is “replacement”. 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 (replaced) 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 is changed to the tree structure 1
It will be 3. The relative position 116 of the node G127 with respect to the node A121 is assigned the same "1" as the node C123. At this time, similarly, the undo data 22 shown in FIG. 4B is copied to the undo data storage area 90, and the data storage state of the undo data storage area 90 is as shown in FIG.

In this state, the node G127 is connected to the node C12.
When the undo operation for returning to 3 is executed (Y in step S1)
ES side), the highest 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) to be returned thereby are identified, and the tree on the branch side is identified. Structural 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 S).
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 executed, the undo is continuously executed. Therefore, in the process of step S5, the undo data 2 of the previous one in FIG.
1 is read and its relative position data 211 (= 1-1)
The upper node (node C) from which the menu selection and setting results are returned and the node position (current node F) 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 as well, 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 setting the undo data 21 to 24, information on the operation type opposite to the operation type performed on the node is set, and when the tree structure is restored, the information is returned according to the information. However, it is also possible to set information that is the same as the type of operation performed at that node and perform an operation that is the reverse of that information when restoring the tree structure.

As described above, according to the undo method of this embodiment, when a different operation (change of node replacement, addition, deletion, etc.) is performed on each node by the menu operation, the node on the tree structure is changed. Of the undo, the tree structure on the branch side of the node, and the operation type opposite to the operation type performed at the node are created and stored in the undo data storage area. Since the tree structure is restored with the undo data that was stored when the operation was executed, the time to store this undo data in the undo data storage area as the tree structure data becomes huge, and the undo data storage area when the undo operation is executed This undo data saved can reduce the time for restoring the tree structure. Further, as the tree structure data becomes huge, 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 widened.

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 (configured by a computer system) to which the cancel / undo method of this embodiment is applied. FIG. 1A 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 dou processing unit 1060, the cancellation processing unit 1070, and the undo processing unit 1080 through the data construction unit 1090 is shown. In FIG. 1A, the data construction unit 10
Reference numeral 90 controls the file input / output control unit 1110 to control various data and information such as unit data necessary for assembling the tree structure data between the disk device 1120 and the memory 1120,
The assembled tree structure data is transferred, and the tree inquiry data is assembled under the control of the menu inquiry control unit 1050. The menu inquiry control unit 1050 displays a node-corresponding menu on the display device 1010 according to the process of editing the tree structure data of the data construction unit 1090.
Operation information such as selection, change, and setting of the menu by the user is input to the menu inquiry control unit 1050 via the input device 1020, and the du processing unit 1 is selected according to the operation content.
060, cancellation processing unit 1070, undo processing unit 1
080 and the data construction unit 1090 are activated. The undo processing unit 1060, the cancellation processing unit 1070, and the undo processing unit 1080 are each a data construction unit 1090.
Do processing of tree-structured data in the memory 1100 via
The cancel processing and the undo processing are performed, and the menu inquiry control unit 1050 displays the menu of the new node. In FIG. 1B, the memory 1100 has a tree structure data 500, a cancel data list 600 that stores cancel data 601, and an undo data list 700 that stores cancel undo data 701 and undo data 702. . The undo processing unit 1080 includes a cancel-type undo processing unit 1081 that performs processing of cancel-type undo data (the same as the processing of the cancellation processing unit 1070) and an undo-cancel-type undo processing unit 1082 that performs processing of undo-type undo data. is doing.

Cancellation data 60 is shown in FIG.
1, the cancellation type undo data 701 in the diagram (b),
And the undo data 70 of the cancellation type in the diagram (c).
2 shows the configuration. The cancellation data 601 includes “a tree structure node to be restored” and “information before the change of the tree structure node”.
However, the undo data (reference numerals 21 to 2 in FIG. 4) in the undo method described above as another embodiment are included.
The same configuration as 4) can be adopted. In that 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 are changed to the tree structure node. It becomes the previous information. It should be noted that the information of the reverse operation type data 213 may be reversed after being read, instead of being reversed at the time of setting, similarly to the undo method described above. Cancel undo data 70
1 has a "cancellation type identifier". Uncanceled undo data 702 is "Uncanceled identifier"
And "Information for restoring the canceled 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 by a menu inquiry is performed, and uses “undelete tree structure node” and “information before changing tree structure node” as cancel data. Hold (step S
10) Add this cancellation data to the end of the cancellation data list 600 (step S11). And
Undo data list 7 for cancel undo data
00 at 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 the data construction unit 1 when the cancel operation is performed
The memory 1100 is accessed via 090, and the tree structure under the node designated as the “restore tree structure node” is returned to the state before the change based on the last cancel data of the cancel data list 600 (step S2
0). Then, the cancel data is separated from the cancel data list 600 (step S21). As the undo data for this cancel operation, undo data of the undo type is prepared, and in the "information for restoring the cancel data list", the cancel data separated in the process of step S21 is set, and "based on the tree structure" The information changed by the current cancellation is set in the "information for returning" (step S22), and added to the end of the undo data list 44 (step S23).

FIG. 12 is a flow chart showing the processing procedure of the undo processing unit 1080. Undo processing unit 108
0 is the data construction unit 1090 when the undo operation is performed.
The memory 1100 is accessed via to retrieve 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 set.If the previous operation is an undo operation and continuous undo operations are performed, the undo data read during the previous undo operation is read. The undo data immediately preceding the data is read (step S30). The type of the read undo data is determined by its identifier, and in the case of cancellation type undo data (YE in step S31)
The S-side) performs the same processing as the cancel operation by the cancel-type undo processing unit 1081. In the case of undo-type undo data (NO side of step S31), the undo-type undo processing unit 1082 causes the "tree structure The tree structure is restored based on "information for restoring" (step S32), and the cancellation data set in "information for restoring the cancellation data list" is returned to the cancellation data list 600 (step S3).
3), undo data list 7 with cancel undo data as undo data for this undo operation
00 at the end (step S34).

When the cancel processing unit 1070 and the undo processing unit 1080 add undo data to the undo data list 700, if 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 processing operation for changing and restoring the 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, and the tree structure data (hereinafter referred to as a tree structure) 501 in FIG. 13 is changed from the node C to the node H in the menu of the node B to form the tree structure 502 (FIG. 14). For the tree structure 502, the node E is changed to the node I in the menu of the node D and the tree structure 503
(FIG. 15), the node J is set in the menu of the node I for the tree structure 503 to form the tree structure 504 (FIG. 16),
Undo operation (Fig. 17), cancel operation (Fig. 18),
A case where the tree structure 503, the tree structure 502, and the tree structure 503 are returned 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 are not set yet 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 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 of FIG. 14, the cancel data 612 is prepared, and the node D is set as the tree structure node to be restored.
Is set, and the node E and the nodes F and G immediately below the node E are set as the information before the change of the node and added to the cancel data list 600. Cancel 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 in the tree structure 503 of FIG. 15, the cancel data 613 is set.
And set node I to the tree structure node to be restored,
“None” is set as the information before the change of the node and added to the cancel data list 600. Cancel undo data 713 is added to the undo data list 700 (FIG. 16).

When the undo operation is performed in the tree structure 504 of FIG. 16, since the last undo data in the undo data list 700 is the cancel undo data 713, the tree to be restored to the original cancel data 613 in 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, the undo data 714 is prepared, the cancel data 613 is connected to the 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 of FIG. 17, the last tree structure node of the cancel data 612 in the cancel data list 600 is the node D.
Then, 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 is created.
12 is connected to the information for restoring the cancellation data list of the undo data 315, and the separated node I is connected to the information for restoring the tree structure (FIG. 1).
8).

When the undo operation is performed with the tree structure 502 of FIG. 18, since the last undo data of the undo data list 700 is the undo data 715, the information for restoring the cancellation data list of the undo data 715 to the original. Since the tree structure node of the cancel data 612 of the above 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 Connect. Then, the cancel data 612 of the information for restoring the cancel data list of the undo data 715 is replaced with the cancel data list 600. Since the maximum number of undos is 5, the undo data list 700 is set so that the number of undo data does not exceed the maximum number of undos.
The first AND data 711 of is deleted (FIG. 19).

As described above, according to the cancel / undo method of the present embodiment, even though the cancel data list and the undo data list are separate, the cancellation data and the undo data are shared, so that the consumption of memory and the processing are performed. The 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 in which each of a plurality of unit data is a node of the tree structure When performing an undo operation to undo the change, when the change operation is performed on the changed node and the tree structure is changed, the relative position on the tree structure of the changed node, the partial tree under the changed node Data amount of undo data compared to the conventional method (copying the entire tree structure) by creating undo data that has the structure and the operation type opposite to the change operation type performed in the changed node As the tree structure data becomes huge, the time to store this undo data in memory and 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 both the cancel operation and the undo operation are performed, the cancel data list and the undo data list are separately provided, but two types of undo data, that is, the cancel data type and the undo data type, are provided. Both the type undo data and the partial tree structure before the change and the partial tree structure before the change are used as information, and the amount of data is significantly compressed while sharing, so it consumes less processing time and memory than the conventional method. It can be greatly improved and the range of undo / cancel operations can be expanded.

[Brief description of drawings]

FIG. 1 is a diagram showing an embodiment of a hierarchical menu inquiry data editing system according to the present invention, where FIG. 1A shows a system configuration and FIG. 1B 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 an embodiment of an undo method of the present invention.

3A to 3C are diagrams showing an example of a tree structure change history.

4A, 4B, 4C, and 4D are diagrams showing undo data for the tree structure change history of FIG. 3 according to the undo method of the present invention.

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

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

FIG. 7 is a diagram showing a memory storage state of undo data when the tree structure of FIG. 3 is returned from the diagram (c) to the 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 diagram (b) to the diagram (a) in the state of FIG. 7.

9A to 9C are diagrams showing the configurations of cancel data, cancel undo data, and undo cancel undo data, respectively, according to the cancel / undo method of the present invention.

FIG. 10 is a flowchart showing a processing procedure at the time of a do operation of an 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 of the 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 of an embodiment of the cancel / undo method of the present invention.

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

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

15 is a diagram showing a memory storage state of tree structure data, cancel data, and undo data when node E of FIG. 14 is changed to 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 a memory storage state of tree structure data, cancel data, and undo data when an undo operation is performed in the state of FIG. 16;

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

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

FIG. 20 is a diagram showing a tree structure for explaining the operation of the hierarchical menu inquiry data editing system, in subsections (a), (b), (c), and (d).

21A, 21B and 21C 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 a memory storage state of undo data when the tree structure of FIG. 3 is changed from the branch diagram (a) to the branch diagram (b) by the conventional undo method.

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

FIG. 24 is a diagram showing a memory storage state of undo data when the tree structure of FIG. 3 is returned from the diagram (c) to the 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 branching diagram (b) to the branching 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 Node relative position data 212 Technique side tree structure data 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 undo data 702 714, 715 Uncanceled 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 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 NEC Communication Systems Co., Ltd.

Claims (3)

[Claims] 1. A plurality of unit data in which mutual hierarchical connection conditions are defined, a menu inquiring 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. Unit data to be linked according to the corresponding linking condition from the highest unit data of the above is sequentially determined and linked according to the response result of the user through the menu inquiry means, and each of these unit data of the tree structure Restore the tree structure changed by the change of the node in the hierarchical menu query 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 one of the nodes to be changed and the tree structure is changed. Information about the relative position on the tree structure of the changed node, the partial tree structure below the changed node, and the operation type opposite to the change operation type performed on the changed node. An undo method, wherein undo data is created and stored in the memory, the undo data stored in the memory is read when the undo operation is executed, and the tree structure is restored based on the undo data. 2. A plurality of unit data in which hierarchical connection conditions are defined, mutual menu inquiry means for displaying a menu for selection and setting by a user and receiving a response from the user, and the plurality of unit data. Unit data to be linked according to the corresponding linking condition from the highest unit data of the above is sequentially determined and linked according to the response result of the user through the menu inquiry means, and each of these unit data of the tree structure Restore the tree structure changed by the change of the node in the hierarchical menu query 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 cache that stores cancel data in the memory in advance. It is arranged that a cell data list and an undo data list for storing undo data are prepared, and that each of the undo data is provided with an identifier for identifying a cancel type or an undo type, Change the tree structure by selecting and setting the menu and display the menu for the lower node or the node of the next branch of the peer. Cancel when using the node position to be restored and the partial tree structure before the change as information. Add data to the end of the cancellation data list, add cancellation undo data to the end of the undo data list, and restore the tree structure to the upper node or the node on the previous branch of the peer. , Disconnect the last cancellation data from the cancellation data list, and disconnect this An uncancelled type in which the tree structure is returned to the state before the change based on the cancel data, and the cancel data separated from the cancel data list as undo data for this cancel operation and the partial tree structure changed by this cancel operation are used as information. When undo data is created and added to the end of the undo data list, and when the undo operation that restores the tree structure to the node that was changed immediately before is determined whether the undo operation is continuous and the previous operation is not an undo operation Reads the last undo data in the undo data list. If the previous operation is also an undo operation, the undo data immediately before the undo data read in the previous undo operation in the undo data list is read and the read undo data is read. Determine the type of data 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. 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. A cancel / undo method characterized by 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 this undo operation. 3. A plurality of unit data in which mutual 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. Unit data to be linked according to the corresponding linking condition from the highest unit data of the above is sequentially determined and linked according to the response result of the user through the menu inquiry means, and each of these unit data of the tree structure Hierarchical menu inquiry data editing that has tree structure data constructing means for dynamically constructing tree structure data as nodes and a memory for storing various data, and restores the tree structure changed by the change of the node In the system, the cancellation data is stored in the memory, the cancellation data list and the undo data are stored. And a menu data list is provided, and a tree operation is changed by selecting and setting a menu for any of the nodes under the control of the menu inquiring means, and a menu operation for displaying a menu for a lower node or a node on the next branch of the peer is performed. When it is detected, the cancel data having the information of the node position to be restored and the partial tree structure before the change is created, and the cancel undo data having the identifier indicating the cancel type is added to the end of the cancel data list. When a cancel operation for returning the tree structure to the upper node or the node of the branch before the peer is detected by the control of the menu inquiry means and the do processing means added to the end of the list, the last data from the cancellation data list is detected. Cancel Cancels the separated data and cancels this separated The tree structure is restored to the state before the change based on the data, and the cancel data separated from the cancel data list as the undo data for this cancel operation and the partial tree structure changed by this cancel operation are used as the information and the uncancel type is set. A cancel processing means for creating undo data of an undo type having an identifier shown and adding it to the end of the undo data list, and an undo operation for restoring the tree structure to the node changed immediately before by the control of the menu inquiry means. When it is detected, it is determined whether the undo operation is continuous. If the previous operation is not the undo operation, the last undo data in the undo data list is read, and if the previous operation is also the undo operation, the previous undo data list is deleted. And read during undo operation When 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 cancellation type undo data, the same processing as that of the cancel processing means is performed. Returns the tree structure based on the information, returns the cancel data separated from the cancel data list to the cancel data list, and sets the cancel undo data as the undo data for this undo operation to the end of the undo data list. And a undo processing means in addition to the above.