JPH0682333B2 - Tree structure editing method - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION [Outline] In the present invention, when performing editing such as insertion on a tree structure displayed on a screen, the upper and lower sides of a node to be edited,
In order to solve the complicated procedure of specifying the position such as left and right,
Give meaning to the node itself to be edited in the tree structure displayed on the screen, the vertical position, and the horizontal position,
By performing editing such as insertion, deletion and copying at a position corresponding to this, the editing can be performed by a simple operation and a visual feeling.

[Industrial application field]

The present invention is a tree structure editing method in which a node to be edited in a tree structure displayed on a screen, a vertical position, and a horizontal position are given meaning, and editing is performed at a position corresponding to this. It is about.

[Conventional technology]

For editing such as deleting or changing the node itself in the tree structure data, after specifying the corresponding node displayed on the display with the mouse or the line pen, delete or change the process. All that is required is that the editing process can be performed relatively easily.

However, when performing edit processing by specifying between nodes, for example, between a parent node and a child code, and between a brother node and a brother node, conventionally, in addition to the node itself to be edited, the node Before, after, after the node, to the left of the node, and to the right of the node. As another method, the above five expressions are incorporated into a command to prepare five types of commands such as a command for operating in front of a node and a command for operating after a node, and edit using any of the commands. It was processing.

[Problems to be solved by the invention]

Therefore, when performing editing such as inserting a new node between nodes, the user stores and uses five types of keys and commands to specify the position and edits the tree structure. There was a problem that I had to do.

[Means for solving problems]

In order to solve the above-mentioned problems, the present invention discriminates a discriminating unit 3 which discriminates designation information indicating whether a certain node in the tree structure displayed on the screen, top or bottom, or left or right is designated.
And an internal data processing unit 4 for editing the tree structure based on the designation information and the input data determined by the determination unit 3, and corresponding to the internal data edited by the internal data processing unit 4. The display data is edited and displayed.

FIG. 1 shows the principle configuration of the present invention. The reading unit 1 in the figure
The tree structure data represented by a character string is read from the file 8 and converted into internal data, and the display data created by the display data processing unit 6 based on this internal data is displayed on the display unit 5.
To display the tree structure on the display 7.

The command reading unit 2 receives the input command, for example, insert,
This is to read an edit command such as delete or copy and perform the corresponding edit.

The discriminating unit 3 discriminates which node in the tree structure displayed on the display 7 itself, the vertical position of the node, or the horizontal position of the node is designated.

The internal data processing unit 4 rewrites the internal data so as to correspond to the position information discriminated by the discriminating unit 3 and the editing designated by the input data.

The display unit 5 displays the display data created by the display data processing unit 6 based on the internal data on the display 7.

The display data processing unit 6 rewrites the display data in response to the internal data processing unit 4 rewriting the internal data,
The display data after the rewriting is notified to the display unit 5 and displayed on the display 7. The display data processing unit 6 creates display data based on the internal data converted by the reading unit 1, notifies the display unit 5 of the display data unit, and causes the display unit 7 to display the display data.

The display 7 is for displaying display data of a tree structure and the like.

The file 8 stores internal data and the like.

The storage unit 9 converts the internal data rewritten by the internal data processing unit 4 into tree structure data represented by a character string and stores the tree structure data in the file 8.

[Action]

 Next, the operation will be described.

In FIG. 1, the reading unit 1 reads from the file 8,
The display unit 5 is notified of the converted internal data to be edited, and is displayed on the display 7 in a tree structure. A node in the tree structure displayed on the display 7 is designated by the mouse or the vertical position or the horizontal position, and an edit command (for example, an insert command) and data are read by the command reading unit and discriminated. When input to the unit 3, the determination unit 3 uses the specified position information to have a corresponding meaning (node itself, vertical position of node,
Alternatively, the command reading unit 2 recognizes (edits, inserts, deletes, copies, etc.) the input edit command by determining whether the node is located at the left or right position. The internal data processing unit 4, which has received the notification of both of these, executes the editing process such as the input insertion at the position corresponding to the specified position information. In response to this execution, the display data processing unit 6 rewrites the display data, notifies the display unit 5 of the result, and causes the display 7 to display the tree structure after the editing process.

As described above, the node itself, the vertical position, or the horizontal position in the tree structure displayed on the display 7 is specified, and the edit command and data are input to correspond to the meaning of the specified position information. It is possible to edit the tree-structured data with a simple operation and a visual feeling by editing the internal data with the touch panel.

〔Example〕

Next, the configuration and operation of one embodiment of the present invention will be described in detail with reference to FIGS.

FIG. 2A shows a display example displayed on the display 7, and FIG. 2B shows an internal data structure example.

In FIG. 2A, the display example of the tree structure displayed on the display 7 shows a parent-child relationship in the up-down direction and a sibling relationship in the left-right direction, as indicated by the arrows. The illustrated display example is expressed by a logical expression f (x, g (y)).

FIG. 2B shows an example of the display shown in FIG. 2A by using the internal data structure. A line segment going diagonally downward to the left is used to represent parent-child relationships, and a line segment going diagonally downward to the right is used to represent sibling relationships.

As described above, the internal data structure shown in FIG.
It is displayed on the display 7 using a tree structure as shown in FIG. First, for example, when the area including the node “g” surrounded by the dotted line in FIG. 2 (a) is designated by using a mouse, the edit input to the node “g” itself is performed. A command such as delete edit is executed. Second
When a rectangular area (a) (rectangular area (b)) indicated by using diagonal lines is specified above (downside) the node "g", the node "g" and the node "f" one level above An edit process, for example, an insert process is executed between the node and the node "y" one level below. If there is no upper node (lower node), edit processing is performed in the upper (lower) direction. Third
When a rectangular area (c) (rectangular area (d)) indicated by using diagonal lines is specified on the left side (right side) of the node "g", the editing corresponding to the elder brother (brother) for the node "g" Processing, for example, writing processing is executed.

As described above, by giving the above-described meanings to the rectangular area surrounding a certain node, the upper and lower rectangular areas, and the left and right rectangular areas, it is possible to easily and visually input position information and perform editing processing. It becomes possible to do. The details will be described below.

In FIG. 3, the figure shows a state in which initial data is read. This means that the reading unit 1 shown in FIG. 1 reads the tree-structured data represented by the character string to be displayed on the display 7 from the file 8 and to be edited, and converts the tree-structured data into internal data.

The figure shows a state in which initial data is displayed. this is,
The display unit 5 in FIG. 1 reads the converted internal data from the file 8 by the reading unit 1 and converts the internal data as shown in FIG. 2B into a tree structure as shown in FIG. Means to be displayed on the display 7.

The figure shows a state in which user-specified reading is performed. This means that the user reads which position on the display 7 has been designated.

The figure shows the state of determination. This shows a state in which the position information designated by the user in the figure is judged to be any one of the position information of a certain node itself, the vertical position information of a certain node, and the horizontal position information of a certain node. . One of the items in the figure is selected according to this state.

In the figure, when it is determined that a node itself is designated, the node is replaced. this is,
For example, when the rectangular area surrounded by the dotted line in FIG. 2A is designated, it means that the editing process, for example, the replacement process is executed on the node "g" surrounded by the dotted line. This replacement process is executed by inputting the position designation, the write command, and the write data. When the position designation and the delete command are input, the delete edit is executed.

The figure shows a state in which a parent-child relationship is inserted when it is determined that the upper and lower positions of a node have been designated. This is because, for example, when the upper rectangular area (a) (lower rectangular area (b)) of a certain node "g" shown in FIG. 2 (a) is specified, it is directly above (immediately below) this node "g". ) Means that an edit process for writing a new node is executed. This writing process is executed by inputting the position designation, the write command, and the write data.

In the figure, when it is determined that the left and right positions of a certain node are designated, the state of inserting a sibling relationship is shown. For example, when a left rectangular area (c) or right rectangular area (d) of a node "g" shown in FIG. 2 (a) is specified, the node is inserted to the left or right of this node "g". It means that the edit process of writing a new node is executed in the mode. This writing process is executed by inputting the position designation, the write command, and the write data.

The figure shows the state of re-display. This means that the display unit 5 displays the editing result on the display 7 based on the result of the editing process in the drawing.

The figure shows a state in which it is determined whether or not all editing has been completed. In the case of YES, the internal data after editing is stored in the file 8 in the figure, and a series of editing processing ends. In the case of NO, the steps in the figure are repeated.

As described above, the node itself, the vertical position, and the horizontal position in the tree structure displayed on the display 7 have a meaning, and any one of these positions is designated to perform the editing process. It is possible to perform a tree structure editing process with various operations and a visual sense.

Next, referring to FIGS. 4 and 5, a specific example of insertion editing,
A specific example of deletion editing will be described in detail with reference to FIG.

Between the node “g” and the node “y” (between the parent “g” and the child “y”) in the tree structure displayed on the display 7 shown in FIG. The case of inserting the node "g ₁ " will be described. First, the rectangular area indicated by the diagonal lines in FIG. 4 (a) is designated by using the mouse. Second
In, input new node data “g ₁ ” to be written. Thirdly, the write command is input to the command reading unit 2. By the above operation, the node "g ₁ " is inserted as shown in FIG. With this insertion, the internal data initially shown in FIG. 4C is rewritten to the internal data shown in FIG. 4D. From the above, the logical expression f corresponding to FIGS.
For (x, g (y)), a new node "g ₁ " is inserted between the parent-child relationships, and the logical expression f (x, g (g ₁ ( y))) is inserted and edited.

Similarly, a case where a new node “y ₁ ” is added to the right side (younger brother) of the node “y” in the tree structure displayed on the display 7 shown in FIG. First, the rectangular area indicated by the diagonal lines in FIG. 5 (a) is designated by using the mouse. Secondly, input new node data "y ₁ " to be written. Thirdly, the write command is input to the command reading unit 2. By the above operation, the node "y ₁ " is written as shown in FIG. With this writing, the internal data initially shown in FIG. 5C is rewritten to the internal data shown in FIG. 5D.

A case will be described in which the node "g" in the tree structure displayed on the display 7 shown in FIG. 6 (a) is deleted. First, the illustrated rectangular area surrounding the node "g" to be deleted in FIG. 6 (a) is specified with the mouse. Secondly, the delete command is input to the command reading unit 2. By the above operation, as shown in FIG.
Node "g" is deleted. With this deletion, the 6th
The internal data as shown in FIG. 6C is rewritten to the internal data as shown in FIG.

FIG. 7 shows a case in which a mode is provided for selecting whether to perform editing processing by designating only the nodes in the tree structure displayed on the display 7 or by designating the entire subtree. An explanatory view is shown. First, in the state where the tree structure shown in FIG. 7 (a) is displayed on the display 7, by the first designation, the designation is made as shown by enclosing with a rectangle in FIG. 7 (b). The entire subtree including the node "g" is edited symmetrically. For example, when deletion editing is performed, the logical expression f (x, g (x)) becomes f (x). By the second designation, as shown by enclosing it with a rectangle in FIG. 7C, only the designated node “g” is to be edited. For example, if deletion editing is performed, the logical expression f (x, g (x)) is f
(X, x). When the designation is further made, the states shown in FIGS. 7A, 7B and 7C are repeated. By performing the editing process by adopting such position designation, it becomes possible to further simplify the editing process operation.

The following is a comparison between the editing process according to the present invention and the conventional process.

Expression of the present invention → Conventional expression Write + node itself → replacement + node designation ... (1) Write + node top → level addition + (top + node designation)
(2) Write + node down → level addition + (down + node specified)
(3) Write + node left → insert + (left + node designation) (4) Write + node right → insert + (right + node designation) (5) Delete + node itself → delete + Node designation (6) As described above, according to the present invention, the editing process can be performed by three expressions of writing, deleting, and position designation on the display 7.

On the other hand, in the conventional method, it is necessary to perform the eight expressions of replacement, insertion, level addition, node left (front), node right (rear), node top, node bottom, and deletion, and node designation, It is necessary for the user to memorize these, and it is difficult and complicated to perform the operation visually.

In addition to the above, by making two distinctions, copy destination and copy source, the following 10 types of copy,
It is possible to express an editing process such as moving.

Copy source + node itself + (delete +) (1) Copy destination + node itself: Copy (move) overwriting to a certain node (2) Copy destination + Before node: Copy (move) to the front (left) of a certain node (3) Copy destination + After node: Copy (move) after a certain node (right) (4) Copy destination + Above node: Copy (move) to a level above a certain node (5) Copy destination + node Below: Copy (move) to the level below a certain node [Effect of the invention] As described above, according to the present invention, the node itself to be edited in the tree structure displayed on the screen is moved up and down. Since the position and the left and right positions have meanings and the corresponding positions are used for editing such as insertion, deletion and copying, insertion and deletion can be performed with simple operation and visual sensation. Editing processing such as copying and moving can be performed. In particular, the object to be edited in the illustrated tree structure can be easily specified visually, and various editing processes can be performed with a small number of command combinations.

[Brief description of drawings]

FIG. 1 is a block diagram of the principle of the present invention, FIG. 2 is an example of a data structure,
FIG. 3 is an operation explanatory flowchart of the present invention, FIG. 4 is a parent-child relationship editing explanatory diagram, FIG.
FIG. 7 is a deletion / editing explanatory diagram, and FIG. 7 is a designation mode explanatory diagram. In the figure, 2 is a command reading unit, 3 is a discriminating unit, 4 is an internal data processing unit, 5 is a display unit, 6 is a display data processing unit, 7 is a display, and 8 is a file.

Claims (1)

[Claims] 1. In a tree structure editing method for editing a tree structure displayed on a screen, a node having a tree structure displayed on the screen itself, above or below the node, or left or right of the node. Discriminating unit (3) for discriminating the designation information designated on the screen, and a tree structure editing process based on the designation information discriminated by the discrimination unit (3) and the input data. When doing
When the node itself is specified on the screen, edit processing for the node itself is performed, and when upper or lower of the node is specified on the screen, parent-child relationship edit processing for the node is performed. An internal data processing unit (4) for performing a sibling editing process for the node when the left or right of the node is specified on the screen, and the internal data edited by the internal data processing unit (4) A tree structure editing method characterized in that display data is edited and displayed according to.