JPH11265376A - Hypertext device - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a hypertext device capable of extremely easily and automatically executing a series of work for node synthesis. SOLUTION: A plural-node specification means specifies plural nodes to be synthesized from nodes displayed on a screen, a judgement means judges whether data included in the plural nodes specified by the specification means can be synthesized or not, and at the time of judging the existence of possibility of synthesizing data included in the plural nodes, a synthetic node generation means 7 synthesizes the data included in the plural nodes specified by the specification means and generates a new node including the synthesized data.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a hypertext device, and more particularly, to a hypertext device capable of easily performing a node combining operation.

[0002]

2. Description of the Related Art A hypertext device is capable of freely associating a plurality of data (nodes) with a link, and develops an application suitable for collecting, searching, managing, and presenting information, and utilizing the application. It is drawing attention as a possible system.

Conventionally, as a general hypertext device, "Reading and Writing the Electronic Book",
Computer, 1985, 10, P15-30, IEEE and "Hypertext: An Introduction and Survey", Co.
mputer, 1985, September, IEEE.

[0004] Also, the one described in "VP Viewers Operation Manual" issued by Fuji Xerox Co., Ltd. in June 1988 is known.

[0005] By the way, in such a conventional hypertext device, when a certain node is divided into a plurality of nodes, at least 1) (the number of nodes to be divided-1) nodes are generated.

2) One piece of data divided from the original node is selected and moved to the one node that generated it.

3) This operation is repeated by the number of nodes that have generated the operation.

4) Set a link to the generated node according to the situation.

Must be performed.

When combining a plurality of nodes into one node, at least 1) a destination node is determined.

2) All data contained in each node is selected, the insertion position is determined at the destination node, and the data is moved.

3) This operation is repeated as many times as necessary.

4) Set a link to the destination node.

5) Delete unnecessary nodes.

Must be performed.

[0016]

However, since such an operation is very time-consuming and must be performed manually, a large amount of work is required in either case of node division or synthesis. It took effort and time.

SUMMARY OF THE INVENTION An object of the present invention is to provide a hypertext apparatus which can automatically and automatically perform a series of operations for synthesizing nodes.

[0018]

According to an aspect of the present invention, there is provided a hypertext apparatus for synthesizing a plurality of nodes constituting a hypertext to generate a new node and displaying the hypertext on a screen. Node specifying means for specifying a plurality of nodes to be combined from the selected nodes, and determining means for determining whether data contained in the plurality of nodes specified by the plurality of node specifying means can be combined. If the determination unit determines that the data included in the plurality of nodes can be combined,
A combination node generating unit configured to combine data included in the plurality of nodes specified by the plurality of node specifying unit and generate a new node including the synthesized data.

[0019]

According to the first aspect of the present invention, a plurality of nodes to be synthesized are designated by a plurality of node designation means from among the nodes displayed on the screen, and are included in the plurality of nodes designated by the plurality of node designation means. It is determined by the determining means whether or not the data included in the plurality of nodes can be combined. If the determining means determines that the data included in the plurality of nodes can be combined, the determination is made by the plurality of node specifying means. The data included in the plurality of nodes is synthesized, and a new node including the synthesized data is generated by the synthesized node generation unit. According to such a configuration, a series of node synthesizing operations for synthesizing a plurality of nodes displayed on the screen into one node can also be automatically performed, and a node synthesizing operation requiring a great deal of labor and time. In a short time and easily.

The configuration of the present invention will be further described with reference to the functional block diagram shown in FIG.

In FIG. 1, a division location designation means 2 designates a division location of data in a node to be processed by the hypertext 1 by inserting a predetermined division symbol or designating a position by a mouse. The divided data recognizing means 3 recognizes each of the divided data of the in-node data to be processed for the hypertext 1 from the predetermined dividing symbol or the position designated by the mouse by the dividing part designating means 2. The divided node generating means 4 moves each divided data recognized by the divided data recognizing means 3 and sequentially generates new nodes in the hypertext 1. The node extracting means 3 extracts data of a plurality of nodes to be combined in the hypertext 1, and the combining possibility determining means 6 determines whether the extracted data can be combined. When the combination possibility determination unit 6 determines that combination is possible, the combination node generation unit 7 moves the data extracted by the node extraction unit 5 and generates a new node in the hypertext 1.

[0022]

FIG. 2 shows an overall configuration of an embodiment of a hypertext apparatus to which the present invention is applied. The hypertext device of this embodiment includes a central processing unit (CPU) 30, a real memory 36, and a display control unit 3 on a bus 45.
5, keyboard / mouse control unit 31, disk control unit 3
4. It is configured by connecting the network control unit 39 and the communication control unit 43.

A central processing unit (CPU) 30 controls the entire hypertext device. The real memory 36 stores various parameters and programs necessary for controlling the central processing unit (CPU) 30. The display control unit 35 controls display on the display device 38. Keyboard / mouse control unit 31
Controls the keyboard 32 and the mouse 33 for inputting data and various commands. The disk control unit 34 controls a disk 37 that stores various data. The network control unit 39 controls the transceiver 40 to
1 for sending and receiving data to and from the file server (database) 42. Further, the communication control unit 43 controls communication with another device (not shown) via the communication port 44.

FIG. 3 is a functional block diagram of the hypertext apparatus according to the embodiment shown in FIG. The hypertext device of this embodiment has an input / editing unit 11 for inputting and editing the hypertext data 10, a display unit 12 for displaying the hypertext data 10, and a data management unit 13 for managing the hypertext data 10. . The data management means 13 includes a node management means 14 for managing nodes of the hypertext data 10 and a link management means 15 for managing links.
Reference numeral 4 denotes intra-node data transcription means 16 for controlling the transcription of intra-node data, intra-node data deletion means 17 for controlling deletion of intra-node data, node generation means 18 for generating a new node, and node deletion for deleting a node. Means 19,
A division position designation unit 20 that designates a division position when dividing one node, and a division symbol designation unit 21 that designates a division symbol used when dividing one node. Setting means 22 for setting a link to a link, link deleting means 2 for deleting a link
3. It has link pattern setting means 24 for setting a link pattern when setting a link.

In the hypertext apparatus of this embodiment, in addition to the functions of the conventional hypertext apparatus, 1) by designating the division symbol by the division symbol designating means 21, the intra-node data transfer means 16 and the intra-node data deletion One node is divided into a plurality of nodes using the means 17 and the node generating means 18.

2) By designating the division position by the division position designation means 20, one node is divided into a plurality of nodes using the intra-node data transfer means 16, the intra-node data deletion means 17, and the node generation means 18. .

3) A plurality of nodes are combined into one node by using the intra-node data transfer unit 16, the intra-node data deletion unit 17, the node generation unit 18, and the node deletion unit 19.

4) The link is automatically set to the divided or combined node based on the link setting pattern set by the link pattern setting means 24.

It has a function.

In the functional block diagram of FIG. 3, the hypertext data 10 is stored on the disk 37 of FIG. 2, the input editing unit 11 corresponds to the keyboard 32 and the mouse 33 of FIG. 2, the data management means 13, the node management means 14, the link management means 15, and the intra-node data transfer means 1 corresponding to the display device 38 in FIG.
6. Intra-node data deleting means 17, node generating means 1
8, a node deletion unit 19, a division position designation unit 20, a division symbol designation unit 21, a link setting unit 22, a link deletion unit 23, and a link pattern setting unit 24 are a central processing unit (CPU) 30, a keyboard / mouse of FIG. Control unit 3
1, keyboard 32, mouse 33, disk controller 3
4. It is realized by a part including the real memory 36.

The relationship between this embodiment and the functional block diagram of the present invention shown in FIG. 1 will be described. The division location designating means 2 shown in FIG. 21 and the data recognition means 3
Is realized by the data management means 13 in FIG. 3, and the divided node generation means 4
6. Intra-node data deleting means 17, node generating means 18
And the node management means 14. The node extraction means 5 is realized by the node management means 14 of FIG.
The synthesizable determination means 6 is realized by the data management means 13 and the node management means 14 of FIG. 3, and the synthesis node generation means 7 includes the intra-node data transcription means 16, the intra-node data deletion means 17, the node generation means 18, and the node This is realized by the management unit 14.

Next, the operation of this embodiment will be described with reference to the following flowchart.

FIG. 4 shows the operation of dividing a node.

First, a node to be divided is selected on the display screen of the display device 38 (step 101). The selection of the node to be divided is performed by selecting the node to be divided with the mouse 33 and highlighting this node to select it explicitly, or by blinking the caret with the mouse 33 at the node to be divided. Will be

Subsequently, a menu relating to the node division processing is displayed on the display screen of the display device 38 (step 102). In this embodiment, as the node division processing, there are two methods of “division by division symbol” and “division by division position”
Various kinds of division modes can be selected, and an example of the menu is shown in FIG. As shown in FIG. 5, the menu includes an area 51a for selecting a mode of "division by division symbol" and an area 51b for selecting a mode of "division by division position". When the area 51a for selecting the "division by" mode is selected (step 103), the mode becomes the division mode using division symbols, and a division operation window using division symbols is displayed on the display screen of the display device 38 (step 104). FIG. 6 shows an example of a window for the division operation using the division symbol.

In the division operation window 52 using division symbols shown in FIG. 6, an area 52a for instructing the start of division, an area 52b for instructing the end of division, a division symbol input area 52c for inputting division symbols, and a link are set. As link patterns, there are regions 53a, 53b, and 53c for specifying any one of three types of "serial", "parallel", and "not set".

Thereafter, the division processing by the division symbol is started by a selection operation on the division operation window 52, and the division processing by the division symbol is executed (step 200).
Details of the division processing using the division symbols are shown in FIGS.
The details will be described later with reference to FIG.

The division mode using division symbols is effective when data included in a node to be divided can be regarded as a data string, and normal text data is targeted. However, the text data may include a link icon and some graphic data.

In the menu display of step 102,
When the area 51b for selecting the mode of "division by division position number" is selected by the mouse 33 (step 10).
5) The mode is set to the division mode based on the division position, and it is checked whether the data included in the node to be divided is normal text data that can be regarded as a data string (step 106). Here, the normal text data may include a link icon and some graphic data as in the case of the division mode using division symbols.
If the data included in the node to be divided is ordinary text data that can be regarded as a data string, a division operation window based on the division position is displayed on the display screen of the display device 38 (step 107). FIG. 7 shows an example of the division operation window based on the division position.

The division operation window 54 based on the division position shown in FIG. 7 has an area 54a for instructing the start of division, an area 54b for instructing the end of division, an area 54c for instructing the start of division position, and an instruction for end. An area 54d to be set, and areas 55a, 55b, and 55c for designating any one of three types of "serial", "parallel", and "not set" as a link pattern for setting a link.

Hereinafter, the division processing based on the division position is started by the selection operation on the division operation window 54, and the division processing of the node including the text data based on the division position is executed (step 200). Details of the process of dividing the node including the text data by the division symbol will be described later with reference to FIGS.

In step 106, the data included in the node to be divided cannot be regarded as a data string, that is, the data included in the node to be divided is spatially arranged as shown in FIG. If so, a menu for selecting a division method is displayed (step 108). In FIG. 8, text data and graphic data are respectively indicated by dotted text frames 5.
6. Although shown as being surrounded by the graphic data frame 57, the text frame 56 and the graphic data frame 57 are not generally displayed on the display screen of the display device 38. In this embodiment, when the data included in the node to be divided is spatially arranged, the dividing method is to divide the data in the node in the vertical direction as shown in FIG. It is possible to select one of three methods of dividing the intra-node data in the horizontal direction as shown in FIG. 9 (b) or dividing the intra-node data in both the vertical and horizontal directions as shown in FIG. 9 (c). In the menu display of step 108, the three division methods are displayed on the display screen of the display device 38, and one of the three division methods is selected by operating the mouse 33, for example (step 108). 109).

When the division method is designated, the display device 3
A division operation window based on the division position is displayed on the display screen 8 (step 110). This division operation window is the same as that shown in FIG.

Hereinafter, the division processing based on the division position is started by a selection operation on the division operation window based on the division position, and the division processing based on the division position of the node where the data is spatially arranged is executed (step 400). ).
The details of the division processing based on the division position of the node where the data is spatially arranged will be described later in detail with reference to FIGS.

Division processing by division symbols The division processing 200 by division symbols of a node is intended for a case in which the data contained in this node can be regarded as a series of data strings. (Hereinafter referred to as a division symbol) to divide the data in the node to generate a plurality of nodes as division nodes. Although any symbol can be used as the division symbol, for example, a line feed symbol, “☆”, or the like can be used. A series of data strings included in the node is divided into a plurality of divided data at the boundary of the division symbol. As described above, the data to be subjected to the division processing using the division symbol may include a link icon or some graphic data, but in this case, it is not possible to specify the link icon or some graphic data as the division symbol. Can not.

FIG. 10 shows division processing 2 using this division symbol.
10 is a flowchart showing details of the routine of FIG.

In FIG. 10, first, a division symbol is specified (step 210). Here, when the division symbol is “☆”, the division symbol “☆” is inserted in advance in the data in the node to be divided corresponding to the division location. When a normal line is used as a division symbol, for example, when a line feed symbol is used, it is not necessary to previously process data in such a node.

The designation of the division symbol is performed by writing the division symbol in the division symbol designation area 52c of the division operation window 52 shown in FIG. This operation may be performed by directly writing from the keyboard 32 into the division symbol input area 52c of the division operation window 52, but the division symbol included in the data in the node is transcribed using the transcription key of the keyboard 32. You may.

FIG. 10 shows a process for designating a division symbol by directly writing from the keyboard 32 into the division symbol input area 52c of the division operation window 52. In this case, first, the division symbol input area 52c of the division operation window 52 is clicked with the mouse 33 (step 211). Then, a predetermined division symbol, for example, "☆" is input from the keyboard 32 (step 21).
2).

FIG. 12 shows a process for designating a division symbol by transcribing the division symbol included in the data in the node using the transcription key of the keyboard 32. In this case, first, a division symbol is selected with the mouse 33 from the data in the node (step 213). Next, the transcription key of the keyboard 32 is pressed (step 21).
4) The display of the cursor pointing to the division symbol of the data in the node is changed for the transfer mode (step 215). Subsequently, the division symbol input area 52c of the division operation window 52 is clicked with the mouse 33 (step 216), and the selected character string, that is, the division symbol is displayed in the division symbol input area 52c of the division operation window 52 (step 216). 2
17).

After the division symbol is specified, the link setting method is specified (step 220). The designation of the link setting method is performed by selecting areas 53a, 53b, and 53c that specify “serial”, “parallel”, and “not set” on the split operation window 52. Here, “serial” is a method of setting links in the order in which the divided data appears, starting from the original node, that is, the node to be divided, as shown in FIG. Node 60 is the original node, node 61 is the node corresponding to the first divided data, node 62 is the node corresponding to the next divided data, and node 63 is the node corresponding to the next divided data. Is shown. As is clear from FIG.
A link 64 is provided between the node 60 and the node 61,
A link 65 is provided between the node 61 and the node 62,
A link 66 is provided between the nodes 62 and 63.

Further, “parallel” means that, as shown in FIG. 14, if there is a link set with the original node, that is, the node to be divided as an end point, all newly generated nodes On the other hand, in the method of setting the link and the starting point to be the same and setting a link with the ending point being each node, in FIG.
Nodes 71, 72, and 73 are newly created nodes. In this case, three links 74, 75, and 76 having the same start point as the link set with the original node 70 as the end point and the end points as the respective nodes 71, 72, and 73.
Is stretched.

Further, "not set" indicates a method in which a link is not automatically set for a node newly generated by division. In this case, for example, the operator manually sets the link as needed.

FIG. 15 shows an example of the designation of the link setting method. First, three items of the link designation in the division operation window 52, that is, "serial", "parallel",
Areas 53a and 53 for designating "do not set"
One of b and 53c is clicked with the mouse 33 (step 221). Then, the link setting method is explicitly designated by highlighting the selected item. As a result, in the subsequent link setting, the link is set according to the specified link setting method.

When the designation of the link setting method is completed, the area 5 for instructing the start of division of the division operation window 52 is next displayed.
It is checked whether or not 2a is clicked by the mouse 33 (step 230), and when clicked, the data in the node to be divided is divided (step 240). Details of this data division are shown in FIG.

In FIG. 16, first, the data of the original node consisting of the data string is sequentially read from the head into the buffer (step 241). This buffer is provided in the real memory 36. At the same time, pattern matching with the designated division symbol is started (step 242). Then, it is checked whether the pattern of the division symbol specified by the pattern matching matches the pattern of the data read into the buffer or the end of the data (step 234), and the pattern of the specified division symbol and the data of the data read into the buffer are checked. If the pattern matches, it is determined that it is a division symbol, a storage area for a new node is set in the real memory 36 (step 244), and the data before the division symbol read into the buffer is stored in the storage area. It is moved (step 245). Then, 1 is added to the number of nodes to be generated (step 245). That is, in this case, since the number of nodes to be generated is still 0, the number of nodes to be generated is set to 1. Subsequently, it is checked whether or not the data in the buffer is gone (step 247). If not, the process returns to step 242 again and repeats this operation.
Then, if it is determined in step 243 that the data has ended, or if it is determined in step 247 that there is no more data in the buffer, the data division processing ends. Here, if there are n divided symbols in the node, the number of nodes counted in step 246 is (n + 1), and a storage area corresponding to the (n + 1) nodes is formed in step 244. Step 24
At 5, the data of each node is moved to this storage area.

When the data division is completed, a node is generated next (step 250). In the generation of this node, the data stored in the storage area is transferred to the generated node, and this operation is repeated by the number of nodes counted in step 246 in FIG. This node generation process is shown in FIG.

In FIG. 17, first, one node is generated (step 251), and the data of the first storage area set in step 244 of FIG. 15 is moved to the data area of this node (step 252). Subsequently, 1 is subtracted from the number of nodes counted in step 246 of FIG. 16 (step 253), and it is checked whether this value, that is, the remaining node to be generated becomes 0 (step 254),
If not, the process returns to step 251 again, and this operation is repeated until the rest of the nodes generating the operation become 0. As a result, the same number of nodes as the nodes counted in step 246 of FIG. 16 are generated.

FIG. 18 shows details of the node generation processing shown in step 251 of FIG. FIG.
In step 8, first, a memory area necessary for the node is secured (step 2511), and then the internal variables of the node are initialized (step 2512). Thereafter, the node is displayed on the display (display device 38). (Step 2513).

When the generation of the node is completed, a link is set (step 260). The setting of this link is performed according to the link setting method designated in step 220.

FIG. 19 shows a link setting process when the designated link setting method is "serial". In this case, first, the original node is set to node1 (step 261). Then, the node generated next is set to node2 (step 262), and a link is set between node1 and node2 (step 263). Then n
mode2 is set to node1 (step 265). Subsequently, it is checked whether there is a next generated node (step 26).
5) If there is, return to step 263 again, and repeat this operation until it is determined in step 265 that there is no next generated node. This establishes links in a “serial” manner for all nodes created in step 250.

FIG. 20 shows a link setting process when the designated link setting method is "parallel". In this case, first, the starting points of the links set in the original node are listed, and the number is set to m (step 266). Subsequently, the number of generated nodes is checked, and this is set to n (step 267). Then, m listed in step 266
M × n links from the start points to the n nodes checked in step 267 are set (step 268).

FIG. 21 shows details of the link generation processing used in the processing of step 263 of FIG. 19 and step 268 of FIG. In FIG. 21, first, a memory area necessary for a link is secured (step 26).
31) Then, the internal variables of the link are initialized (step 2632), and thereafter, the designated objects are set at the respective end points of the link (step 263).
3).

With the above processing, the division processing using the division symbols is completed.

Division Processing by Division Position Division processing by the division position of a node differs between a case where the data included in this node can be regarded as a series of data strings and a case where the data is spatially arranged. First, a description will be given of division processing 300 based on division positions when data included in a node can be regarded as a series of data strings.

FIG. 22 shows details of division processing 300 based on division positions when data included in this node can be regarded as a series of data strings.

In FIG. 22, first, a link setting method is specified (step 310). The designation of the link setting method is the same as the designation of the link setting method shown in step 220 of FIG. That is, first, one of the three items of the link specification of the division operation window 54 shown in FIG. 7, that is, one of the areas 55a, 55b, and 55c that specify "serial", "parallel", and "do not set", By clicking with the mouse 33, the link setting method is explicitly designated by highlighting the selected item. This allows
In the subsequent link setting, the link is set according to the specified link setting method.

Next, a division position is designated (step 3).
20). The details of the designation of the division position are shown in FIG. First, the mouse 33 is clicked on the start button of the division position designation item of the division operation window 54, that is, the area 54c for instructing the start of division position designation (step 323). Next, the position on the display screen of the display device 38 where the data of the node to be divided is to be divided is clicked with the mouse 33 (step 322). Next, the coordinates of the clicked position on the screen are converted into relative coordinates of the node (step 323). Then, the relative coordinates on this node are converted into a position on the data string of the node (step 32).
4). Next, it is determined whether or not the end button of the item for specifying the division position in the division operation window 54 has been pressed, that is, whether or not the area 54d for instructing the end of the specification of the division position has been clicked with the mouse 33 (step 325). If it is determined that is not pressed, the flow returns to step 322 again to specify the next division position. This operation is repeated until the end button of the item of the division position designation in the division operation window 54 is pressed, and thereafter, the designated division positions are arranged in ascending order (step 326), and the designation of the division position ends.

When the designation of the division position is completed, the data of the node is divided (step 330). Details of this data division are shown in FIG.

In FIG. 24, first, the data of the original node is read into the buffer (step 332). Subsequently, storage areas for the same number of new nodes as the designated division position are set (step 332). Then, the data read into the buffer is divided based on the designated division position, and moved to the corresponding storage area set in step 332 (step 333).

When the data division is completed in this way, a node is generated (step 340). The generation of this node is executed in accordance with the number of data divided in step 330, and the details are the same as in the case of the division processing using the division symbol described above. Here, the repetitive description will not be made.

When the node setting is completed, a link setting operation is executed next (step 350). The link setting operation is performed according to the link setting method set in step 310, and the link setting operation is the same as the above-described division processing using the division symbol.

Next, division processing 400 based on division positions when data included in nodes is spatially arranged will be described.

FIG. 25 shows details of division processing 400 based on division positions when data included in this node is spatially arranged. Note that, in the following description, a case where the division method for dividing the in-node data in both the vertical and horizontal directions shown in FIG. 9C is selected in the selection of the division method in step 109 shown in FIG.

In FIG. 25, first, a division position is designated (step 410). Details of the designation of the division position are shown in FIG. First, the mouse 33 is clicked on the start button of the division position designation item of the division operation window 54, that is, the area 54c for instructing the start of division position designation (step 411). Next, the mouse 33 is clicked at a position on the display screen of the display device 38 where the user wants to divide (step 412). Then, the vertical and horizontal lines that intersect at the clicked position are displayed inside the node as dotted lines. For example, in FIG. 7, if point P1 is clicked,
A vertical line L1 and a horizontal line L2 intersecting at this point P1 are displayed in the node as dotted lines. Thus, the node is divided into four by the vertical line L1 and the horizontal line L2. The example of FIG. 9 shows a case where two points P1 and P2 are clicked with the mouse 33, whereby the node is divided into nine regions.

Subsequently, whether the end button of the item of the division position designation of the division operation window 54 has been pressed, that is, the area 54 d for instructing the end of the division position designation is displayed on the mouse 33.
Is checked (step 414), and if it is determined that the end button has not been pressed, step 41 is performed again.
Returning to 2, the next division position is designated, and this operation is repeated until the end button of the division position designation item of the division operation window 54 is pressed, and the designation of the division position is completed.

The designation of the division position has been described in connection with the case where the method of dividing the data in the node in both the vertical and horizontal directions shown in FIG. 9C is selected as the division method.
If the method of dividing the data in the node shown in FIG. 9A in the vertical direction or the method of dividing the data in the node shown in FIG. 9B in the horizontal direction is selected, only the vertical line or the horizontal line is determined in step 413. Is calculated, and only the vertical or horizontal line passing through the position where the mouse 33 is clicked is displayed as a dotted line in the node, and the node may be divided.

When the designation of the division position is completed, the designation of the link setting method is performed next (step 420). The designation of the link setting method is the same as the designation of the link setting method shown in step 310 of FIG. That is, first, three items of the link designation in the division operation window 54 shown in FIG. 7, that is, “serial”, “parallel”, and “not set”
Is clicked with the mouse 33 on one of the areas 55a, 55b, 55c for designating the respective items, and the link setting method is explicitly designated by highlighting the selected item. As a result, in the subsequent link setting, the link is set according to the specified link setting method.

Next, a node is generated (step 43).
0). Details of the generation of this node are shown in FIG.

In FIG. 27, first, the same number of nodes as the divided rectangular area divided by the designation of the division position in step 410 are generated (step 431). Then, the size of each node generated in step 431 is changed to include the corresponding rectangular area just as the data area.

Next, data division is performed based on the designation of the division position in step 410, and data division movement processing for moving the divided data to the nodes generated in step 430 is executed. FIG. 28 shows the details of the data dividing and moving process. That is, first, for all the data frames of the original node, it is calculated which rectangular area contains the coordinates of the upper left vertex (step 4).
41) Then, the data in each data frame is moved to the data area of the node corresponding to the rectangular area to which it belongs (step 442).

Next, a link is set (step 45).
0). The link setting operation is performed in accordance with the link setting method set in step 420. This link setting operation is performed in the same manner as in the above-described division processing using division symbols. However, when the division position of the node is designated as shown in FIG. 9, there is no order of generation for the divided nodes. Therefore, in this case, when "serial" is selected as the link setting method, for example, first,
The node corresponding to the upper left rectangular area is defined as the first node, the node corresponding to the rectangular area adjacent to the right of the rectangular area is defined as the second node, and the rectangular area adjacent to the right of the rectangular area is sequentially determined. Are arranged in order, and when there is no longer a rectangular area on the right, the display returns to the leftmost rectangular area, and a node corresponding to a rectangular area adjacent to the rectangular area has the next rank. Thereafter, the right direction is prioritized, and the nodes are ranked in the set direction. This ranking is merely an example, and can be changed as appropriate in accordance with the content of the data to be divided. When "parallel" or "don't set" is selected, it is exactly the same as the case of the division processing using division symbols.

Combining Nodes The node combining process is a process of combining a plurality of nodes displayed on the screen of the display device 38 to generate one node. In this embodiment, a plurality of nodes to be combined displayed on the screen of the display device 38 are designated by the mouse 3.
3 is clicked, and the node designation is terminated by clicking the right button of the mouse 33. FIG. 29 shows details of the node combining process.
Is shown.

In FIG. 29, first, a menu is displayed (step 501), and the node combination is selected by clicking the mouse 33 or the like (step 502), and the mode is set to the node combination mode. As a result, a message indicating that the node to be combined should be specified is displayed (step 50).
3). Thus, the designation of the node to be synthesized is started. The node to be combined is specified with the mouse 3 as described above.
3 is performed by clicking the left button. That is, the cursor of the mouse 33 is moved to the position of the node to be synthesized,
At this position, the left button of the mouse 33 is clicked.

When the left button of the mouse 33 is clicked at the position of the node to be combined (step 504), it is determined that the node to be combined has been designated, and the designated node is stored as the node to be combined. (Step 51
0), mouse 33 indicating the end of node designation
Repeat until the right button is clicked.

When the right button of the mouse 33 is clicked and designation of a node to be combined is completed, it is checked whether the designated node can be combined next (step 505). Here, the case where the nodes cannot be combined refers to, for example, a case where a specified node has a direct link, and a case where the data in the specified node is two-dimensionally arranged. This is the case in which some are mixed and some are not.

If it is determined in step 505 that the designated node can be combined, a new node is generated (step 506), and all data of the designated node is moved to this new node (step 506). 507), and set a link to this new node (step 50)
8). Thereafter, the original node that is no longer needed is deleted (step 509). This completes the node combining process.

In the above embodiment, a plurality of nodes to be synthesized are designated by clicking the left button of the mouse 33, and the node designation is terminated by clicking the right button of the mouse 33. However, as in the case of the above-described node division, a composition operation window may be used, and the composition processing of the nodes may be started from the composition operation window.

[0089]

As described above, according to the present invention,
Since a series of node synthesis work is configured to be performed automatically, a hypertext device that can perform node synthesis work that is extremely time-consuming and requires a great deal of labor and time is extremely easy. It has the effect that it can be provided.

[Brief description of the drawings]

FIG. 1 is a functional block diagram showing a configuration of a hypertext device according to the present invention.

FIG. 2 is a system configuration diagram showing one embodiment of a hypertext device to which the present invention is applied.

FIG. 3 is a functional block diagram of the embodiment shown in FIG. 2;

FIG. 4 is a main flowchart for explaining node division processing in the embodiment shown in FIG. 2;

FIG. 5 is a view showing an example of a menu display for a node dividing process in the embodiment shown in FIG. 2;

FIG. 6 is a view showing an example of a division operation window used for division of a node by division symbols in the embodiment shown in FIG. 2;

FIG. 7 is a view showing an example of a division operation window used for division by a division position of a node in the embodiment shown in FIG. 2;

FIG. 8 is a diagram illustrating an example of a node in which data is spatially arranged.

FIG. 9 is a view for explaining a method of dividing nodes in which data is spatially arranged.

FIG. 10 is a main flowchart for explaining a division process of the node shown in FIG. 4 using division symbols.

11 is a flowchart illustrating an example of designation of a division symbol in the division process using the division symbol shown in FIG.

FIG. 12 is a flowchart illustrating another example of designation of a division symbol in the division processing using the division symbol illustrated in FIG. 10;

FIG. 13 is an exemplary view for explaining an example of a link setting method in the division processing using division symbols shown in FIG. 10;

FIG. 14 is an exemplary view for explaining another example of a link setting method in the division processing using the division symbols shown in FIG. 10;

FIG. 15 is a flowchart illustrating an example of a link setting method in the division processing using division symbols illustrated in FIG. 10;

16 is a flowchart illustrating an example of a data division process in the division process using the division symbols illustrated in FIG.

17 is a flowchart illustrating an example of a node generation process in the division process using the division symbols illustrated in FIG.

FIG. 18 is a flowchart illustrating details of a node generation process illustrated in FIG. 17;

FIG. 19 is a flowchart illustrating an example of a link setting process in the division process using the division symbols illustrated in FIG. 10;

20 is a flowchart for explaining another example of the link setting process in the division process using the division symbols shown in FIG. 10;

FIG. 21 is a flowchart illustrating details of a link setting process illustrated in FIGS. 19 and 20;

FIG. 22 is a main flowchart for explaining division processing based on division positions in a case where the data of the node shown in FIG. 4 can be regarded as a data string.

FIG. 23 is a flowchart illustrating an example of a data division position designation process in the division process based on the division position illustrated in FIG. 22;

24 is a flowchart illustrating an example of a data division process in the division process based on the division position illustrated in FIG.

FIG. 25 is a main flowchart for explaining division processing based on division positions when the data of the nodes shown in FIG. 4 has a spatial arrangement.

FIG. 26 is a flowchart for explaining an example of a data division position designation process in the division position division process shown in FIG. 25;

FIG. 27 is a flowchart illustrating an example of node generation processing in the division processing using division symbols illustrated in FIG. 25;

28 is a flowchart illustrating an example of a data division moving process in the division process using the division symbols illustrated in FIG. 25.

FIG. 29 is a main flowchart for explaining node combining processing in the embodiment shown in FIG. 2;

[Explanation of symbols]

DESCRIPTION OF SYMBOLS 1 ... Hypertext, 2 ... Division location designation means, 3 ... Division data recognition means, 4 ... Node generation means, 5 ... Node extraction means, 6 ... Synthesis possible determination means, 7 ... Synthesis node generation means, 10 ... Hypertext data , 11 ... input editing means, 12 ... display means, 13 ... data management means, 14 ... node management means, 15 ... link management means, 16 ... intra-node data transfer means, 17 ... intra-node data deletion means, 18
... node generation means, 19 ... node deletion means, 20 ... division position designation means, 21 ... division symbol designation means, 22 ... link setting means, 23 ... link deletion means, 24 ... link pattern setting means, 30 ... central processing unit 31 ... Keyboard /
Mouse control unit, 32 ... keyboard, 33 ... mouse, 34
... Disk control unit, 35 ... Display control unit, 36 ... Real memory, 37 ... Disk, 38 ... Display device, 39 ... Network control unit, 40 ... Transceiver, 41 ... Wireless line, 4
2. File server, 43 Communication controller, 44 Communication port, 45 Bus.

 ──────────────────────────────────────────────────続 き Continuing on the front page (72) Inventor Eriko Tamaru 3-2-1, Sakado, Takatsu-ku, Kawasaki-shi, Kanagawa KSP R & D Business Park Building Inside Fuji Xerox Co., Ltd. (72) Inventor Hisashiki Nakamura Takatsu-ku, Kawasaki-shi, Kanagawa 3-2-1 Sakado KSP R & D Business Park Building Fuji Xerox Co., Ltd.

Claims (1)

[Claims] 1. A hypertext apparatus for generating a new node by synthesizing a plurality of nodes constituting a hypertext, and specifying a plurality of nodes to be synthesized from nodes displayed on a screen. Means, determining means for determining whether data contained in the plurality of nodes specified by the plurality of node specifying means can be combined, and combining the data contained in the plurality of nodes by the determining means. When it is determined that there is a combination node, a combination node generation unit that combines data included in the plurality of nodes designated by the plurality of node designation unit and generates a new node including the combined data. A hypertext device characterized by the above-mentioned.