JPH04288674A - Hypertext device - Google Patents

Abstract

PURPOSE:To easily and automatically perform a series of work for the division and synthesis of a node by providing a means to designate the dividing part of in-node data, a dividing node generating means, a means to extract the data of plural nodes, and a synthesizing node generating means. CONSTITUTION:A dividing part designation means 2 designates the dividing part in the node by performing the insertion of a prescribed division signal or position designation by a mouse. A dividing node recognizing means 3 recognizes each dividing data in the in-node data that becomes the processing target of a hypertext 1 from a designated position. The dividing node generating means 4 moves recognized dividing data, and generates a new node sequentially. Also, a node extraction means 5 extracts the data of the plural nodes to be synthesized in the hypertext 1. When it is judged that extracted data can be synthesized by a synthesis possibility judging means 6, the synthesizing node generating means 7 generates the new node by moving the extracted 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 that can easily divide and combine nodes.

0002

[Prior Art] A hypertext device is a device that allows multiple pieces of data (nodes) to be freely related by links, and is used to develop and utilize applications suitable for collecting, searching, managing, and presenting information. It is attracting attention as a possible system.

[0003] Conventionally, as a general hypertext device, "Reading and Writing the
Electronic Book”,Compute
r, 1985, 10, P15-30, IEEE and “
Hypertext: An Introduction
"n and Survey", Computer, 19
85, September, introduced in IEEE.

[0004] Also known is the one shown in "VP View Cars Operating Manual" published by Fuji Xerox Co., Ltd. in June 1988.

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

2) Select one piece of data divided from the original node and move it to the one node that generated it.

3) Repeat this operation for the number of generated nodes.

4) Links are set to the generated nodes depending on the situation.

It is necessary to perform the following operation.

[0010] Furthermore, when combining a plurality of nodes into one node, at least 1) the destination node is determined.

2) Select all data included in each node, determine the insertion position at the destination node, and move the data.

3) Repeat this operation as many times as necessary.

4) Set a link to the destination node.

5) Delete unnecessary nodes.

It is necessary to perform the following operation.

[0016]

[Problem to be Solved by the Invention] However, such operations are very time-consuming and must be performed manually, so it takes a lot of work in both node division and compositing. It took effort and time.

SUMMARY OF THE INVENTION Accordingly, an object of the present invention is to provide a hypertext device that can extremely easily and automatically perform a series of tasks of dividing and composing nodes.

[0018]

[Means for Solving the Problems] In order to achieve the above object, according to a first aspect of the present invention, there is provided a dividing point specifying means for specifying a dividing point of data within a node, and a dividing point specifying means for specifying a dividing point of data within a node. a divided data recognition means for recognizing the divided data, a divided node generation means for moving the divided data recognized by the divided data recognition means to generate a node corresponding to the divided data, and extracting data of a plurality of nodes. a node extracting means for determining whether the data of a plurality of nodes extracted by the node extracting means can be synthesized; and composite node generation means for generating a node by moving data of a plurality of extracted nodes.

Further, according to the second invention, there is provided a dividing point specifying means for specifying a dividing point of data within a node, a divided data recognizing means for recognizing the divided data specified by the dividing point specifying means, and a divided data recognizing means for recognizing the divided data specified by the dividing point specifying means. and a divided node generating means for moving the divided data recognized by the data recognizing means and generating a node corresponding to the divided data.

According to a third aspect of the present invention, there is provided a node extracting means for extracting data of a plurality of nodes, and a composition possibility determining means for determining whether data of a plurality of nodes extracted by the node extraction means can be synthesized. and a composite node generation means for moving data of a plurality of nodes extracted by the extraction means to generate a node when the composition possibility determination means determines that the composition is possible.

[0021]

[Operation] In the first invention, the division point specifying means specifies the division point of data within a node by inserting a predetermined division symbol or by specifying a position using a mouse. The divided data recognition means recognizes each divided data from the position specified by the predetermined division symbol or the mouse. The divided node generation means moves each piece of divided data recognized by the divided data recognition means and sequentially generates new nodes. The node extraction means extracts data of a plurality of nodes to be synthesized, and when the synthesis possibility judgment means judges that the extracted data can be synthesized, the synthesis node generation means extracts the data of the plurality of nodes to be synthesized. Move data and create new nodes.

Further, in the second aspect of the invention, the division point specifying means specifies the division point of the intra-node data by inserting a predetermined division symbol or by specifying the position using a mouse. The divided data recognition means recognizes each divided data from the position specified by the predetermined division symbol or the mouse. The divided node generation means moves each piece of divided data recognized by the divided data recognition means and sequentially generates new nodes.

Further, in the third invention, the node extraction means extracts data of a plurality of nodes to be synthesized, and when the synthesis possibility judgment means judges that the extracted data can be synthesized, the synthesis The node generation means moves the data extracted by the node extraction means to generate a new node.

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

The functional block diagram in FIG.
This is a drawing that focuses on the invention of In Figure 1,
The division point specifying means 2 specifies the division point of the intra-node data to be processed in the hypertext 1 by inserting a predetermined division symbol or by specifying the position using the mouse. The divided data recognition means 3 recognizes each divided data of the intra-node data to be processed in the hypertext 1 from the position specified by the division point specifying means 2 using a predetermined division symbol or the mouse. The divided node generation means 4 moves each divided data recognized by the divided data recognition means 3 and sequentially generates new nodes within the hypertext 1. The node extracting means 3 extracts data of a plurality of nodes to be synthesized in the hypertext 1, and the compositable judgment means 6 judges whether the extracted data can be synthesized. When the composition possibility determination means 6 determines that composition is possible, the composition node generation means 7 moves the data extracted by the node extraction means 5 to generate a new node in the hypertext 1.

Note that from the configuration of FIG. 1, the node extraction means 5,
If the composition possibility determination means 6 and composition node generation means 7 are removed, the second invention is obtained, and when the division location designation means 2, divided data recognition means 3, and division node generation means 4 are removed, the second invention is obtained.

[0027]

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

A central processing unit (CPU) 30 centrally 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 the display on the display device 38. Keyboard/mouse control section 31
controls a keyboard 32 and mouse 33 for inputting data and various commands. A disk control unit 34 controls a disk 37 that stores various data. The network control unit 39 controls the transceiver 40 to
Data is exchanged with the file server (database) 42 via the file server (database) 1. Further, the communication control unit 43 controls communication with other devices (not shown) via the communication port 44.

FIG. 3 shows the hypertext device of the embodiment shown in FIG. 2 in functional blocks. The hypertext device of this embodiment has an input editing section 11 for inputting and editing hypertext data 10, a display means 12 for displaying hypertext data 10, and a data management means 13 for managing 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.
4 is an intra-node data transcription means 16 for controlling the transcription of intra-node data, an intra-node data deletion means 17 for controlling deletion of intra-node data, a node generation means 18 for generating a new node, and a node deletion means for deleting a node. Means 19,
The link management means 15 includes a division position designation means 20 for designating a division position when dividing one node, and a division symbol designation means 21 for designating a division symbol used when dividing one node. a link setting means 22 for setting a link, and a link deletion means 23 for deleting a link.
, has link pattern setting means 24 for setting a link pattern when setting a link.

In addition to the functions of the conventional hypertext device, the hypertext device of this embodiment has 1)
By specifying a division symbol with the division symbol designation means 21, one node is divided into a plurality of nodes using the intra-node data transcription means 16, the intra-node data deletion means 17, and the node generation means 18.

2) By specifying a dividing position with the dividing position specifying means 20, one node is divided into a plurality of nodes using the intra-node data transcription 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 using the intra-node data transcription means 16, the intra-node data deletion means 17, the node generation means 18, and the node deletion means 19.

4) Links are automatically set to nodes after division or synthesis based on the link setting pattern set by the link pattern setting means 24.

[0034] It has a function.

In the functional block diagram of FIG. 3, the hypertext data 10 is stored in the disk 37 of FIG. 2, the input editing section 11 corresponds to the keyboard 32 and mouse 33 of FIG. , corresponding to the display device 38 in FIG.
6, intra-node data deletion means 17, node generation means 18
, node deletion means 19, division position designation means 20, division symbol designation means 21, link setting means 22, link deletion means 23, and link pattern setting means 24 are the central processing unit (CPU) 30 and keyboard/mouse control in FIG. Part 31,
It is realized by a portion including a keyboard 32, a mouse 33, a disk control unit 34, and a real memory 36.

Further, to explain the relationship between this embodiment and the functional block diagram of the present invention shown in FIG. 1, the division point designation means 2 in FIG. 21, the data recognition means 3
is realized by the data management means 13 in FIG. 3, and the divided node generation means 4 is realized by the intra-node data transcription means 16 in FIG.
, the intra-node data deletion means 17, the node generation means 18, and the node management means 14, the node extraction means 5 is realized by the node management means 14 of FIG. The composite node generation means 7 is realized by the means 13 and the node management means 14, and the composite node generation means 7 is realized by the intra-node data transcription means 16, the intra-node data deletion means 17, the node generation means 18, and the node management means 14.

Next, the operation of this embodiment will be explained with reference to the flowchart shown below.

[0038] Node division FIG. 4 shows the node dividing operation.

First, a node to be divided is selected on the display screen of the display device 38 (step 101). The node to be divided can be selected by selecting the node to be divided using the mouse 33 and explicitly selecting this node by highlighting it, or by displaying a blinking caret on the node to be divided by using the mouse 33. be exposed.

Next, a menu related to node division processing is displayed on the display screen of the display device 38 (step 102). In this example, "
Two types of division modes can be selected: ``Division by division symbol'' and ``Division by division position,'' and an example of the menu is shown in FIG. The menu, as shown in FIG. When the region 51a is selected to select the mode of "dividing by division" (step 103), the mode of division by division symbol is entered, and a division operation window by division symbol is displayed on the display screen of the display device 38 (step 104). An example of a window for the division operation using the division symbol is shown in FIG.

The division operation window 52 using division symbols shown in FIG. 6 includes 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 a division symbol, and a link setting area. It has areas 53a, 53b, and 53c for specifying one of three types of link patterns: "serial,""parallel," and "not set."

Thereafter, the division process using the division symbol is activated by a selection operation on the division operation window 52, and the division process using the division symbol is executed (step 200). Details of the division process using this division symbol are shown in Figures 10 to 21.
will be explained in detail later.

Note that the division mode using a division symbol is effective when the data included in the node to be divided can be regarded as a data string, and is applicable to ordinary text data. However, this text data may also include link icons and some graphic data.

[0044] In the menu display at step 102,
When the mouse 33 selects the area 51b for selecting the mode of "division by division position number" (step 105)
, a division mode based on the division position is entered, and then 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 link icons 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 normal 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). An example of the division operation window based on this division position is shown in FIG.

The division operation window 54 by division position shown in FIG. 7 includes 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 specifying the division position, and an area 54c for instructing the end. and areas 55a, 55b, and 55c for specifying one of three types of link patterns: "serial,""parallel," and "not set."

[0046] Thereafter, the division process based on this division position is activated by a selection operation on the division operation window 54, and the process of dividing nodes containing text data according to the division position is executed (step 200). Details of the process of dividing nodes including text data using the division symbol will be described in detail later with reference to FIGS. 22 to 24.

In step 106, the data contained in the node to be divided cannot be regarded as a data string, that is, the data contained 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). Note that in FIG. 8, text data and graphic data are each indicated by a dotted text frame 5.
6. Although shown surrounded by a graphic data frame 57, these text frame 56 and graphic data frame 57 are generally not 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 within the node vertically as shown in FIG. There are three dividing methods to choose from: dividing the data within a node horizontally as shown in Figure 9(b), or dividing the data within a node both vertically and horizontally as shown in Figure 9(c). In the menu display of step 108, these three division methods are displayed on the display screen of the display device 38, and one of these three division methods is selected by, for example, operating the mouse 33 (step 109).

When the division method is specified, 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 similar to that shown in FIG.

[0049] Thereafter, this division process based on the division position is activated by a selection operation on the division operation window based on the division position, and the division process based on the division position of the node where data is spatially arranged is executed (step 400 ). The details of the division process based on the division position of the node where this data is spatially arranged will be described in detail later with reference to FIGS. 25 to 28.

Division processing using division symbol The division processing 200 using division symbol of a node is applicable to the case where the data included in this node can be regarded as a series of data strings. The data within a node is divided by specifying the symbol (hereinafter referred to as a division symbol) to generate multiple nodes as divided nodes. Any symbol can be used as this division symbol, and for example, a line feed symbol, "☆", etc. can be used. A series of data strings included in a node are divided into a plurality of divided data at this dividing symbol. Note that the data subject to division processing using this division symbol may include link icons and some graphic data as described above, 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 00.

In FIG. 10, first, a division symbol is specified (step 210). Here, if the division symbol is "☆", this division symbol "☆" is inserted in advance in the data in the node to be divided, corresponding to the division location. Note that when using, for example, a line feed symbol that is used in normal text as a division symbol, there is no need to process data in such a node in advance.

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 into the division symbol input area 52c of the division operation window 52 from the keyboard 32, but it is preferable to transcribe the division symbol included in the data within the node using the transcription key of the keyboard 32. It's okay.

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

FIG. 12 shows a process for specifying a division symbol by transcribing the division symbol included in data within a node using the transcription keys of the keyboard 32. In this case, first, a division symbol is selected from the data within the node using the mouse 33 (step 213). Next, press the transcription key on the keyboard 32 (step 214
), changes the display of the cursor pointing to the division symbol of the data in the node to the transcription mode (step 215). continue,
Click the division symbol input area 52c of the division operation window 52 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 217).
).

Once the division symbol has been specified, the link setting method is then specified (step 220). This link setting method is specified on the division operation window 52 by selecting areas 53a, 53b, and 53c for specifying "serial,""parallel," and "not set," respectively. Here, "serial" refers to a method in which links are set in the order in which the divided data appears, starting with the original node, that is, the node to be divided, as shown in FIG. 13. Node 60 is the original node, node 61 is a node corresponding to the first divided data, node 62 is a node corresponding to the next divided data, and node 63 is a node corresponding to the next divided data. It shows. As is clear from Figure 13,
A link 64 is stretched between the node 60 and the node 61,
A link 65 is stretched between the node 61 and the node 62,
A link 66 is established between node 62 and node 63.

Furthermore, as shown in FIG. 14, "parallel" means that if there is a link that is set as the end point of the original node, that is, the node to be divided, all newly generated nodes On the other hand, the method is to set a link whose starting point is the same as that link and whose end point is each node. In FIG. 14, node 70 is the original node, and nodes 71, 72, and 73 are newly generated nodes. be. In this case, the starting point is the same as the link set with the original node 70 as the ending point, and the ending point is set to each node 7.
Three links 74, 75, and 76, numbered 1, 72, and 73, are set.

Furthermore, "not set" indicates a method in which links are not automatically set for nodes newly generated by division. In this case, for example, the operator will manually set the link as necessary.

FIG. 15 shows an example of specifying the link setting method. First, three items of link specification in the splitting operation window 52 are selected, namely, "serial", "parallel", and "
Areas 53a and 53b for specifying "Do not set", respectively.
, 53c with the mouse 33 (step 221). Then, the link setting method is explicitly specified by highlighting the selected item. This results in
In subsequent link settings, the link will be set according to this specified link setting method.

[0060] When the link setting method has been specified, the next area 5 of the splitting operation window 52 instructs the start of splitting.
2a is clicked by the mouse 33 (step 230), and if it is 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 source node consisting of a data string is read into the buffer sequentially from the beginning (
Step 241). This buffer is provided within real memory 36. Pattern matching with the division symbol specified at the same time is started (step 242). Then, through this pattern matching, it is checked whether the specified division symbol pattern matches the data pattern read into the buffer or whether the data is at the end (step 234). If it matches the pattern, it is determined that it is a division symbol, and
A storage area for the new node is set in the real memory 36 (step 244), and the data before the division symbol read into the buffer is moved to the storage area (step 245). Then, 1 is added to the number of nodes to be generated (step 245). That is, in this case, the number of nodes to be generated is 0, so the number of nodes to be generated is set to 1. Next, it is checked whether the data in the buffer is gone (step 247), and if it is not,
Returning again to step 242, this operation is repeated. 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 process is ended. Here, if there are n division symbols in the node, the number of nodes counted in step 246 is (
n+1), a storage area corresponding to these (n+1) nodes is created in step 244, and step 245
The data of each node is moved to this storage area.

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

In FIG. 17, first, one node is generated (step 251), and the data in the first storage area set in step 244 in FIG. 15 is moved to the data area of this node (step 252). Next, subtract 1 from the number of nodes counted in step 246 of FIG.
Step 253), check whether this value, that is, the remaining number of nodes to generate, is 0 (step 254), and if it is not 0, return to step 251 again until the remaining number of nodes to generate this action becomes 0. repeat. 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 process shown in step 251 of FIG. 17. Figure 1
8, first allocate the memory area necessary for the node (step 2511), then initialize the internal variables of this node (step 2512), and then display this node on the display (display device 38). (step 2513).

[0065] When node generation is completed, links are next set (step 260). This link setting is performed according to the link setting method specified in step 220.

FIG. 19 shows link setting processing when the specified link setting method is "serial". In this case, first, the source node is set to node1 (step 261). Then, the next generated node is designated as node2 (step 262), and a link is set between node1 and node2 (step 263). then n
ode2 is set to node1 (step 265). Next, check to see if there is a generated node (step 26).
5) If there is, the process returns to step 263 and repeats this operation until it is determined in step 265 that there is no next generated node. This establishes links to all nodes created in step 250 in a "serial" manner.

FIG. 20 shows link setting processing when the specified link setting method is "parallel". In this case, first, the starting points of links set in the source node are listed, and the number is set to m (step 266). Next, the number of generated nodes is checked and this is set as n (step 267). Then, the m enumerated in step 266
m×n links are set from the starting point to the n nodes checked in step 267 (step 268).

FIG. 21 shows details of the link generation process used in step 263 of FIG. 19 and step 268 of FIG. 20. In FIG. 21, first, a memory area necessary for linking is secured (step 26).
31), the internal variables of the link are initialized (step 2632), and the specified objects are set at each end point of the link (step 2633).
).

With the above processing, the division process using the division symbol is completed.

Division Processing by Division Position Division processing of a node by division position differs depending on whether the data contained in this node can be regarded as a series of data strings or when it is spatially arranged. First, division processing 300 based on division positions when data included in a node can be regarded as a series of data strings will be described.

FIG. 22 shows details of the division process 300 based on division positions when the 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 this link setting method is similar to the designation of the link setting method shown in step 220 of FIG. That is, first, select one of the three link specification items of the split operation window 54 shown in FIG. Click with the mouse 33 to explicitly specify the link setting method by highlighting the selected item. This results in
In subsequent link settings, the link will be set according to this specified link setting method.

Next, specify the dividing position (step 3).
20). Details of this division position designation are shown in FIG. First, the user clicks on the start button of the division position specification item in the division operation window 54, that is, the area 54c for instructing the start of division position specification, with the mouse 33 (step 323). Next, the user clicks with the mouse 33 the position at which the data of the node to be divided is to be divided on the display screen of the display device 38 (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 to the position on the data string of the node (step 324). Next, it is checked whether the end button of the division position specification item in the division operation window 54 has been pressed, that is, whether the area 54d for instructing the end of division position specification has been clicked with the mouse 33 (step 325), and the end button is checked. If it is determined that is not pressed, the process returns to step 322 and the next dividing position is specified. This operation is repeated until the end button of the division position designation item in the division operation window 54 is pressed, and then the designated division positions are arranged in ascending order (step 326), and the division position designation is ended.

[0074] Once the division position has been specified, the node data is then 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 new nodes are set as many times as there are designated division positions (step 332). Then, the data read into the buffer is divided based on the specified division position and moved to the corresponding storage area set in step 332 (step 333).

[0076] When the data division is completed in this way, node generation is executed (step 340). This node generation 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. I will not repeat the explanation here.

[0077] When the node setting is completed, a link setting operation is then executed (step 350). This link setting operation is performed according to the link setting method set in step 310, and this link setting operation is similar to the case of the division process using the division symbol described above.

Next, a division process 400 based on division positions when data included in a node is spatially arranged will be explained.

FIG. 25 shows details of the division process 400 based on division positions when the data included in this node is spatially arranged. In addition, in the following description, in the selection of the division method in step 109 shown in FIG. 4, a case is shown in which the division method of dividing the intra-node data in both the vertical and horizontal directions shown in FIG. 9(c) is selected.

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

Next, whether the end button of the division position specification item in the division operation window 54 is pressed or the area 54d for instructing the end of division position specification is pressed with the mouse 33.
It is checked whether the button has been clicked (step 414), and if it is determined that the end button has not been pressed, the process returns to step 41.
2, the next division position is designated, and this operation is repeated until the end button of the division position designation item in the division operation window 54 is pressed, thereby completing the division position designation.

[0082] The specification of the above-mentioned division position is shown in the case where the division method shown in Fig. 9(c) is selected, in which data within a node is divided both vertically and horizontally.
), or the method of dividing the data within a node horizontally as shown in FIG. 9(b), in step 413, only vertical or horizontal lines are calculated. The node may be divided by displaying only the vertical or horizontal line passing through the clicked position of the mouse 33 as a dotted line within the node.

[0083] Once the division positions have been specified, the link setting method is then specified (step 420). This link setting method designation is similar to the link setting method designation shown in step 310 of FIG. 22. That is, first, the three items of link designation in the splitting operation window 54 shown in FIG.
Click on one of the areas 55a, 55b, and 55c to specify each of them with the mouse 33, and explicitly specify the link setting method by highlighting the selected item. Thereby, when setting a link from now on, the link will be set according to this 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 areas divided by the designation of the division positions in step 410 are generated (step 431). Then, the size of each node generated in step 431 is changed so that it just includes the corresponding rectangular area as a data area.

Next, the data is divided based on the designation of the division position in step 410, and a data division/movement process is executed in which the divided data is respectively moved to the generated nodes in step 430. Details of this data division and movement process are shown in FIG. That is, first, for all data frames of the original node, calculate which rectangular area contains the coordinates of the top 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, link settings are performed (step 45).
0). This link setting operation is performed according to the link setting method set in step 420, and this link setting operation is performed in the same manner as in the case of the division process using the division symbol described above. However, if the node division positions are specified as shown in FIG. 9, there is no generation order for the divided nodes. Therefore, in this case, when "serial" is selected as the link setting method, first, for example,
The node corresponding to the upper left rectangular area is the first node, then the node corresponding to the rectangular area to the right of that rectangular area is the second node, and the subsequent nodes correspond to the rectangular areas to the right of the rectangular area in order. The nodes are arranged in order, and when the rectangular area on the right side runs out, the process returns to the leftmost rectangular area, and the node corresponding to the adjacent rectangular area below that rectangular area becomes the next rank. From then on, the nodes are ranked in that direction, with priority given to the right direction. Note that this ranking is just an example, and can be changed as appropriate depending on the content of the data to be divided. Note that when "parallel" or "not set" is selected, the process is exactly the same as the case of division processing using division symbols.

Composition of nodes [0088] The node composition process is a process of synthesizing a plurality of nodes displayed on the screen of the display device 38 to generate one node. In this embodiment, the designation of a plurality of nodes to be synthesized displayed on the screen of the display device 38 is performed using the mouse 38.
3, and the node specification is completed by clicking the right button of the mouse 33. The details of the compositing process for this node are shown in Figure 29.
is shown.

In FIG. 29, first, a menu is displayed (step 501), and node compositing is selected by clicking the mouse 33 (step 502) to enter node compositing mode. As a result, a message indicating that nodes to be synthesized should be specified is displayed (step 503).
. This starts specifying nodes to be synthesized. The nodes to be synthesized are specified by clicking the left button of the mouse 33, as described above. That is, the cursor of the mouse 33 is moved to the position of the node to be synthesized, and the left button of the mouse 33 is clicked at this position.

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

When the right button of the mouse 33 is clicked and the designation of the node to be synthesized is completed, it is checked whether the specified node can be synthesized next (step 505). Here, cases in which nodes cannot be combined include, for example, cases in which direct links are set among the specified nodes, and cases in which data within the specified nodes are arranged two-dimensionally. This is a case where there is a mixture of those that are and those that are not.

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

In the above embodiment, a plurality of nodes to be synthesized are specified by clicking the left button of the mouse 33, and the node specification is ended by clicking the right button of the mouse 33. However, as in the case of node division described above, a compositing operation window may be used and the node compositing process may be started from this compositing operation window.

[0094]

[Effects of the Invention] As explained above, according to the present invention,
Since the system is configured to automatically perform a series of tasks such as dividing and composing nodes, it is now extremely easy to perform the task of dividing and composing nodes, which was previously extremely time-consuming and required a great deal of effort and time. This has the effect of providing a hypertext device.

[Brief explanation of the drawing]

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

FIG. 2 is a system configuration diagram showing an 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 diagram showing an example of a menu display for node division processing in the embodiment shown in FIG. 2;

FIG. 6 is a diagram showing an example of a splitting operation window used for splitting a node using a splitting symbol in the embodiment shown in FIG. 2;

FIG. 7 is a diagram illustrating an example of a division operation window used to divide nodes according to division positions in the embodiment shown in FIG. 2;

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

FIG. 9 is a diagram illustrating a method of dividing nodes in which data is spatially arranged.

FIG. 10 is a main flowchart for explaining a process of dividing nodes using dividing symbols shown in FIG. 4;

FIG. 11 is a flowchart illustrating an example of specifying a division symbol in the division process using division symbols shown in FIG. 10;

FIG. 12 is a flowchart illustrating another example of specifying a division symbol in the division process using division symbols shown in FIG. 10;

FIG. 13 is a diagram illustrating an example of a link setting method in the division process using the division symbol shown in FIG. 10;

FIG. 14 is a diagram illustrating another example of a link setting method in the division process using the division symbol shown in FIG. 10;

FIG. 15 is a flowchart illustrating an example of a link setting method in the division process using the division symbol shown in FIG. 10;

FIG. 16 is a flowchart illustrating an example of data division processing in the division processing using division symbols shown in FIG. 10;

FIG. 17 is a flowchart illustrating an example of node generation processing in the division processing using the division symbol shown in FIG. 10;

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

FIG. 19 is a flowchart illustrating an example of link setting processing in the division processing using the division symbol shown in FIG. 10;

FIG. 20 is a flowchart illustrating another example of link setting processing in the division processing using the division symbol shown in FIG. 10;

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

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

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

FIG. 24 is a flowchart illustrating an example of data division processing in the division processing based on division positions shown in FIG. 22;

25 is a main flowchart for explaining division processing based on division positions when the node data shown in FIG. 4 takes a spatial arrangement; FIG.

26 is a flowchart illustrating an example of a data division position designation process in the division process based on division positions shown in FIG. 25; FIG.

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

FIG. 28 is a flowchart illustrating an example of data division movement processing in the division processing using division symbols shown in FIG. 25;

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

[Explanation of symbols]

DESCRIPTION OF SYMBOLS 1...Hypertext, 2...Divided point specifying means, 3...Divided data recognition means, 4...Node generation means, 5...Node extraction means, 6...Composition possibility judgment means, 7...Composition 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 transcription means, 17... intra-node data deletion means, 18
...Node generation means, 19...Node deletion means, 20...Division position specification means, 21...Division symbol specification 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, 42
...File server, 43...Communication control unit, 44...Communication port, 45...Bus.

Claims (3)

[Claims] 1. A division point specifying means for specifying a division point of data within a node, a divided data recognition means for recognizing the divided data specified by the division point specifying means, and a division recognized by the divided data recognition means. A divided node generation means that moves data to generate a node corresponding to the divided data, a node extraction means that extracts data of a plurality of nodes, and the data of the plurality of nodes extracted by the node extraction means can be synthesized. and a composite node generating means for generating a node by moving data of a plurality of nodes extracted by the extraction means when the composition possibility determination means determines that composition is possible. A hypertext device characterized by: 2. A division point specifying means for specifying a division point of data within a node, a divided data recognition means for recognizing the divided data specified by the division point specifying means, and a division recognized by the divided data recognition means. 1. A hypertext device comprising: divided node generation means for moving data and generating nodes corresponding to the divided data. 3. A node extraction means for extracting data of a plurality of nodes; a composition possibility determination means for determining whether data of a plurality of nodes extracted by the node extraction means can be synthesized; and a composition possibility determination means. If it is determined that synthesis is possible,
A hypertext device comprising a composite node generating means for generating a node by moving data of a plurality of nodes extracted by the extracting means.