CN107885713B

CN107885713B - File format conversion method, device, equipment and storage medium

Info

Publication number: CN107885713B
Application number: CN201711217390.8A
Authority: CN
Inventors: 陈天龙
Original assignee: Guangzhou Shiyuan Electronics Thecnology Co Ltd; Guangzhou Shirui Electronics Co Ltd
Current assignee: Guangzhou Shiyuan Electronics Thecnology Co Ltd; Guangzhou Shirui Electronics Co Ltd
Priority date: 2017-11-28
Filing date: 2017-11-28
Publication date: 2021-12-14
Anticipated expiration: 2037-11-28
Also published as: CN107885713A

Abstract

The embodiment of the invention discloses a file format conversion method, a device, equipment and a storage medium, wherein the method comprises the following steps: when the currently selected operation object is determined to be a table, the table name of the table is converted into the central node of the target thinking graph according to the received first conversion instruction; if the first column on the left side in the table is the table head, taking the node obtained by converting the cells in the first column in the table as a child node of the central node in the same row of the table, and taking the node obtained by converting the cells in the previous column as a parent node of the node obtained by converting the cells in the next column; if the first upper row in the table is the table head, taking the node converted by the cell in the first row in the table as a child node of the central node in the same column of the table, and taking the node converted by the cell in the previous row as a parent node of the node converted by the cell in the next row; and determining a target thinking guide graph according to the central node and the corresponding parent node and the child node. And the quick conversion of the table to the mind map is realized.

Description

File format conversion method, device, equipment and storage medium

Technical Field

The present invention relates to file management technologies, and in particular, to a file format conversion method, apparatus, device, and storage medium.

Background

The thinking guide picture, also called mind guide picture, expresses the relationship of all levels of subjects by using mutual membership and related level pictures, establishes memory links of subject keywords, images, colors and the like, and is a method for visualizing thinking.

In the traditional method, when the form needs to be converted into the mind map, the corresponding mind map or form needs to be reestablished, the content in the original form is filled, and the operation is complex.

Disclosure of Invention

The embodiment of the invention provides a file format conversion method, a file format conversion device and a file format conversion storage medium, contents in a table are not required to be refilled after a thought map is reestablished, and the quick conversion from the table to the thought map is realized.

In a first aspect, an embodiment of the present invention provides a file format conversion method, where the method includes:

when the currently selected operation object is determined to be a table, converting the table name of the table into a central node of a target thinking guide graph according to a received first conversion instruction;

when the first column on the left side in the table is the head of the table, in the same row of the table, taking the node obtained by converting the cells in the first column in the table as a child node of the central node, and taking the node obtained by converting the cells in the previous column as a parent node of the node obtained by converting the cells in the next column;

when the first row at the upper part in the table is a table head, in the same column of the table, taking the node converted by the cell in the first row in the table as a child node of the central node, and taking the node converted by the cell in the previous row as a parent node of the node converted by the cell in the next row;

and determining the target thinking graph according to the central node and the corresponding parent node and child node.

In a second aspect, an embodiment of the present invention further provides a file format conversion apparatus, where the apparatus includes:

the central node conversion module is used for converting the table name of the table into the central node of the target thinking guide graph according to the received first conversion instruction when the currently selected operation object is determined to be the table;

a first child node conversion module, configured to, when a first column on the left side in the table is a table header, in a same row of the table, use a node obtained by converting a cell in the first column in the table as a child node of the central node, and use a node obtained by converting a cell in a previous column as a parent node of a node obtained by converting a cell in a next column;

a second child node conversion module, configured to, when a first row in the table is a table head, in the same column of the table, use a node converted by a cell in the first row in the table as a child node of the central node, and use a node obtained by converting a cell in an upper row as a parent node of a node obtained by converting a cell in a lower row;

and the target mind map determining module is used for determining the target mind map according to the central node and the corresponding father node and the child node.

In a third aspect, an embodiment of the present invention further provides a computer device, including a memory, a processor, and a computer program stored on the memory and executable on the processor, where the processor implements the file format conversion method according to any one of the embodiments of the present invention when executing the program.

In a fourth aspect, the embodiment of the present invention further provides a computer-readable storage medium, on which a computer program is stored, which when executed by a processor implements the file format conversion method according to any one of the embodiments of the present invention.

In the embodiment of the invention, when the currently selected operation object is determined to be a table, the table name of the table is converted into the central node of the target thinking graph according to the received first conversion instruction; and then respectively converting the corresponding cells into corresponding nodes aiming at two conditions that the first column on the left side in the table is a table head and the first row on the upper side in the table is a table head, and determining a target thinking graph according to the direct parent-child relationship of each node and the relationship with the central node. The contents in the table are refilled without reestablishing the mind map, so that the quick conversion from the table to the mind map is realized.

Drawings

FIG. 1a is a flowchart of a file format conversion method according to a first embodiment of the present invention;

FIG. 1b is a diagram of the target mind map transformed from Table 1, to which an embodiment of the present invention is applicable;

FIG. 1c is a table 2 transformed target mind map for use in an embodiment of the present invention;

FIG. 2a is a flowchart of a file format conversion method according to a second embodiment of the present invention;

FIG. 2b is a target mind map transformed from Table 3, to which the second embodiment of the present invention is applied;

FIG. 2c is a target mind map transformed from Table 4, to which the second embodiment of the present invention is applied;

FIG. 3a is a flowchart of a file format conversion method according to a third embodiment of the present invention;

FIG. 3b is a horizontal layout thinking diagram for the third embodiment of the invention;

FIG. 3c is a horizontal layout mind map with multiple child nodes for a third embodiment of the present invention;

FIG. 3d is a vertical layout diagram of the third embodiment of the present invention;

FIG. 3e is a vertical mind map with multiple sub-nodes for a third embodiment of the present invention;

fig. 4 is a schematic structural diagram of a file format conversion apparatus according to a fourth embodiment of the present invention;

fig. 5 is a schematic structural diagram of a computer device in the fifth embodiment of the present invention.

Detailed Description

The present invention will be described in further detail with reference to the accompanying drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the invention and are not limiting of the invention. It should be further noted that, for the convenience of description, only some of the structures related to the present invention are shown in the drawings, not all of the structures.

Example one

Fig. 1a is a flowchart of a file format conversion method according to an embodiment of the present invention, where this embodiment is applicable to a case of converting a table into a mind map, and the method can be executed by a file format conversion apparatus according to an embodiment of the present invention, and the apparatus can be implemented in a software and/or hardware manner. Referring to fig. 1a, the method may specifically include the steps of:

s110, when the currently selected operation object is determined to be a table, the table name of the table is converted into the central node of the target thinking graph according to the received first conversion instruction.

Specifically, the thought-guiding map is a method for visualizing the thought, wherein characters, numbers, symbols, fragrances, foods, lines, colors, images, rhythms, notes and the like can be called as a thought center node in the thought-guiding map, called as a father node, the thought center node emits a plurality of nodes outwards, called as subnodes, each node represents a connection with the thought center node, each connection can be called as another thought center node, and then emits a plurality of nodes outwards to present a radioactive three-dimensional structure, and the connection relations are mutually connected like neurons in the brain and can be used as a personal database. The child node of the previous node may also be a parent node of the next node, and the child node and the parent node indicate a connection relationship of the two nodes.

For example, the first conversion instruction may be generated by clicking a conversion option in a pop-up selection box after the user right-clicks the mouse, or may be generated by pressing a conversion option in a pop-up selection box after the user selects the operation object for a certain period of time, where the conversion option may also be a conversion button or the like, and the first conversion instruction may also be generated by a touch operation of the user.

Judging whether the currently selected operation object is a table, specifically, determining whether the currently selected operation object is the table according to attribute information of the table, wherein files of different formats or types have different attribute information, and determining the type of the file by determining the attribute information, optionally, the attribute information may be represented by a class or an object which encapsulates data and operations on the data together. The format or type of file may include: tables, pictures, video, music, mind maps, and the like. And determining that the current operation object is a table, displaying the conversion option or the function corresponding to the conversion button as a conversion graph word for a user to click. And if the currently selected operation object is a table, converting the table name of the table into the central node of the target thinking graph.

Determining the type of the converted target mind map according to the head position of the selected table, and optionally, determining the head position can be realized by the following method, and the table is divided into four types according to the head position in the table: (1) the header is in the first column on the left side of the table; (2) the header is at the first row above the table; (3) the header is at the first row on the left side of the table and at the first row above the table; (4) without a header. Wherein, each type corresponds to different parameters respectively, and the position of the gauge head is determined by detecting the parameters representing the position of the gauge head.

Optionally, the position of the header may be determined by detecting the content of the table, and in general, the content of the header contains a "XXXX table" pattern, and after the pattern is detected, the position of the header of the table is determined by determining the position relationship between the pattern and the table. In a specific example, if the typeface is located on top of the table, the header position is determined to be the first row above the table; if the typeface is positioned on the left side of the table, determining that the position of the header is positioned in a first column on the left side of the table; if the character cannot be detected, indicating that no header exists; if the typeface is both above and to the left of the table, the header position is determined to be in the first column to the left of the table and the first row above the table. It should be noted that the number of specific Chinese characters in the typeface "XXXX table" is not specifically limited.

If the first column on the left side of the table is the table head, determining the type of the target mind map as a horizontal layout mind map; if the first row above the table is the head, the target mind map is determined to be the vertical layout mind map. In a specific example, table 1 is a test table with a table header in the first column on the left side, table 2 is a test table with a table header in the first row on the top, and in both table 1 and table 2, the table name is "test table", and the "test table" is converted into the central node of the target mind map. It should be noted that, for a table in which the first column on the left side of the table and the first row above the table both have headers, the type of the target mind map may be further determined according to the relative position relationship of each cell in the table; for the header-free form, the type of the target mind map may be a horizontal layout mind map, or may be a horizontal layout mind map, which is not limited herein.

TABLE 1

TABLE 2

Test meter

Title 1	Title 2	Title 3	Title 4
				11	21	31	41
12	22	32	42
				13	23	33	43
14	24	34	44

And S121, when the first column on the left side in the table is the table head, in the same row of the table, taking the node obtained by converting the cell in the first column in the table as a child node of the central node, and taking the node obtained by converting the cell in the previous column as a parent node of the node obtained by converting the cell in the next column.

Specifically, when the first column on the left side in the table is the head, the determined type of the target mind map is the horizontal layout mind map, and the node obtained by converting the cells in the first column in the table is taken as a child node of the central node in the same row of the table, and normally, the first column in the table is the head position of the table. And taking the node obtained by the cell conversion of the previous column as a parent node of the node obtained by the cell conversion of the next column. In a specific example, FIG. 1b shows the target mind map converted from Table 1, where the table name "test table" is converted to the center node, and the rest of the table 1 is converted to the nodes of the target mind map.

And S122, when the first row at the upper part in the table is the table head, in the same column of the table, taking the node converted by the cell at the first row in the table as a child node of the central node, and taking the node converted by the cell at the upper row as a parent node of the node converted by the cell at the lower row.

Specifically, when the top first row in the table is the head, the determined type of the target mind map is the vertical layout mind map, and the node obtained by converting the cells in the first row in the table is taken as a child node of the central node in the same column of the table, and usually, the first row in the table is the head position of the table. And taking the node obtained by the cell conversion of the previous row as a parent node of the node obtained by the cell conversion of the next row. In a specific example, FIG. 1c shows the target mind map converted from Table 2, where the table name "test table" is converted to the center node, and the rest of the table 2 is converted to the nodes of the target mind map.

S130, determining the target thinking graph according to the central node and the corresponding parent node and the corresponding child node.

Specifically, after the type of the target mind map is determined, the target mind map is determined according to the central node, the parent node and the child nodes. In a specific example, if the target mind map is a horizontally laid mind map, the target mind map sequentially includes a central node, a parent node and a child node from left to right, where the parent node and the child node appear in pairs, and the same node may be a child node of a left-side adjacent node and a parent node of a right-side adjacent node; if the target mind map is a vertically-arranged mind map, the target mind map is a central node, a father node and a child node from top to bottom, wherein the father node and the child node appear in pairs, and the same node can be a child node of an upper connected node and also can be a father node of a lower adjacent node.

Optionally, the determining the target mind map according to the central node and the corresponding parent node and child node includes: when the first column on the left side in the table is a table head, taking each row of the table as a subtree, and determining a target thinking graph according to the central node and a parent node and a child node in the subtree; when the first upper row in the table is a table head, each column of the table is taken as a subtree, and a target thinking graph is determined according to the central node and the parent node and the child node in the subtree.

When the first column on the left side in the table is a table head, determining that a target mind map to be converted is a horizontal layout mind map, taking each row in the table as a sub-tree, determining the sub-tree according to the parent-child relationship of a parent node and a child node in the same sub-tree, determining the rest sub-trees according to the same method, and determining the target mind map according to the central node and each sub-tree; when the first upper row in the table is a table head, the target mind map to be converted is determined to be a vertical layout mind map, each column in the table is taken as a subtree, the subtree is determined according to the parent-child relationship of a parent node and a child node in the same subtree, the rest subtrees are determined according to the same method, and then the target mind map is determined according to the central node and the subtrees. The target thinking graph is determined through the subtrees and the nodes of the subtrees.

On the basis of the above technical solution, before the converting the table name of the table into the central node of the target mind map, the method further includes: acquiring a table name of a table within a preset distance range of the table boundary; or determining the table name of the table by detecting the content in the operation object.

Specifically, the preset boundary distance range can be 1 cm, and detection is performed within the preset distance range of the table boundary to obtain the table name of the table; detecting the content in the obtained operation object, wherein the content comprises a table name and the content in the table, and analyzing the obtained content to obtain the table name of the table, for example, when the content in the operation object is detected to be a daily production table, X tons and X kilowatt-hours of power consumption, determining the daily production table as the table name. The table name of the table is acquired.

Example two

Fig. 2a is a flowchart of a file format conversion method according to a second embodiment of the present invention, which is implemented on the basis of the second embodiment. Referring to fig. 2a, the method may specifically include the steps of:

s210, if the table has the merging cells, determining the position of the table head in the table.

The merged cell refers to a cell merged by two or more cells located in the same row or column. When the merge cell exists in the table, the header position in the table is determined. Optionally, the header position generally includes the header position being the first column on the left side of the table or the first row on the top of the table.

Specifically, the determination may be performed by detecting the number of rows or the number of columns of a cell, where the number of rows is a positive integer, and when the number of rows or columns of a cell in the table is greater than 1, it indicates that the cell is a merged cell; the width and the height of each cell in the table can be acquired, the default width and the default height of one cell are set, the cells with the width larger than the default width or the height larger than the default height are merged cells, and optionally, the selection of the default width and the default height can be determined by acquiring the heights and the widths of all the cells in the table; the coordinates of each vertex of the cell can also be detected, for example, if the cell is a rectangle, the coordinates of the four vertices of the cell are determined, the coordinates of the four vertices are compared with the prestored coordinates of the cell to determine a merged cell, or the area of the cell is calculated according to the coordinates of the four vertices, and if the area is larger than the preset area, the cell is determined to be the merged cell.

And S220, when the head position in the table is the first column on the left side, taking the node obtained by converting the merged cell as a father node of the node obtained by converting the adjacent cell on the right side of the merged cell in the same row.

Specifically, when the position of the head in the table is the first column on the left side, in the same row, the cell in the range of the merged cell in the next column corresponding to the merged cell is taken as the child node of the cell, that is, the parent node of the cell adjacent to the right side of the merged cell is the node corresponding to the merged cell. In this specific example, the cells in the merged cell range are cells in a row range corresponding to the position of the column occupied by the merged cell in the row and column.

And S230, when the head position in the table is the first row above, in the same column, taking the node obtained by converting the merged cell as the father node of the node obtained by converting the adjacent cell below the merged cell.

Specifically, when the position of the head in the table is the first row above, in the same column, the cell below the merged cell and within the merged cell range is taken as the child node of the merged cell, that is, the parent node of the cell adjacent to the merged cell below is the node corresponding to the merged cell. In this specific example, the cells in the merged cell range are cells in a column range corresponding to the position of the row in the row and the column occupied by the merged cell.

It should be noted that S210, S220, and S230 in the embodiment of the present invention may occur between other steps in the file format conversion process provided in the embodiment of the present invention, and if a merge cell exists in the file format conversion process, S210-S230 is executed, and if no merge cell exists in the file format conversion process, S210-S230 is not executed.

In a specific example, table 3 is a test table with merging cells, where the first column on the left side is a header, where two adjacent cells on the right side of title 1 are merging cells, the number of rows of the first-type merging cells in table 3 is 2, and the number of columns of the second-type merging cells in table 3 is 2; table 4 is a test table with merge cells in the top first row header, where two cells adjacent to the bottom of title 1 are merge cells, and the number of rows of merge cells in table 4 is 2. FIG. 2b is the target mind map transformed from Table 3; FIG. 2c is the target mind map transformed from Table 4.

TABLE 3

TABLE 4

Test meter

In the embodiment of the invention, when a merging cell exists in a table, the position of a table head in the table is determined, and when the position of the table head in the table is a first column on the left side, a node obtained by converting the merging cell is used as a father node of a node obtained by converting an adjacent cell on the right side of the merging cell in the same row; and when the head position in the table is the first row above, in the same column, taking the node obtained by converting the merged cell as the father node of the node obtained by converting the adjacent cell below the merged cell. The method and the device realize the processing of the merged cells in the table in the process of converting the table into the target mind map.

EXAMPLE III

Fig. 3a is a flowchart of a file format conversion method according to a third embodiment of the present invention, which is implemented on the basis of the third embodiment. Referring to fig. 3a, the method may specifically include the steps of:

s310, when the currently selected operation object is determined to be the mind map, converting the central node of the mind map into the table name of the target table according to the received second conversion instruction.

Specifically, whether the currently selected operation object is a mind map or not is firstly judged, and the type of the table of the target table is determined according to the type of the mind map, wherein the type of the table corresponds to the table name or the position of the table head. In a specific example, if the mind map is a horizontally laid out mind map, the head position in the target table is the first column on the left side of the table, and if the mind map is a vertically laid out mind map, the head position in the target table is the first row on the upper side of the table. The files with different formats or types have different attribute information for determination, and are not described herein again.

Optionally, the second conversion instruction may be generated by clicking a conversion option in a pop-up selection box after the user right-clicks the mouse, or may be generated by pressing a conversion option in a pop-up selection box after the user selects the operation object and presses the operation object for a certain time, where the conversion option may also be a conversion button or the like. If the currently selected operation object is a mind map, the function corresponding to the conversion option or the conversion button can be displayed as a conversion table character for the user to click. The central node of the mind map is converted to a table name of the target table. According to the type of the table, the position of the table name is determined to be the left side of the whole table or the upper side of the whole table. Optionally, the vertical layout mind map and the horizontal layout mind map have different parameters in characterizing the type of the mind map, and the type of the mind map can be determined by querying the parameters.

S321, if the mind map is a horizontally-laid mind map, converting each branch sub-tree in the mind map into a single row in the target table, wherein the cell converted by the parent node in the mind map is on the left side of the cell converted by the child node.

Specifically, the header position of the target table is determined according to the type of the mind map, and then converted into a table of a corresponding type. If the table head position of the table is the first column on the left side, the central node of the thinking guide graph is used as the table name of the target table. Each branch sub-tree in the thought-map is converted to a separate row in the target table, with the cell converted by the parent node in the thought-map to the left of the child node cell. Optionally, the current node is called an operation node, and whether the operation node needs to be converted into a merge cell is determined by judging the number of child nodes of the operation node. If the number of the child nodes of the current operation node is greater than 1, the table converted by the operation node is a merging cell in the target cell, and if the number of the current operation node is 1, the operation node is converted into a common table in the target table. Optionally, the number of the nodes is a positive integer.

In a specific example, if the mind is in a mapThe existing node N has a plurality of child nodes, and the set of child nodes is C_SIf so, converting the node N into a merging cell NC, wherein the number of the cross lines of the NC is the number of the child nodes of the NC; several child nodes C_SExecuting a recursive algorithm by a point, and expressing the recursive algorithm by A, wherein the specific implementation process of the algorithm A is as follows: and recursively traversing a child node set Children, wherein c belongs to the Children, if c has a plurality of child nodes, c is converted into a merging cell, the cross-column number of c is the number of the child nodes, and the child node set of c is subjected to the algorithm A until the traversed nodes are leaf nodes.

TABLE 5

In a specific example, FIG. 3b is a horizontal layout mind map, wherein the mind map is also a test brain map; table 5 is the target table obtained after the conversion of fig. 3 b.

In another specific example, fig. 3c is a horizontal layout mind map with a plurality of sub-nodes, wherein the mind map is also called a test brain map, and table 6 is a target table obtained by converting fig. 3 c.

TABLE 6

S322, if the mind map is a vertical layout mind map, converting each branch sub-tree in the mind map into a separate column in the target table, wherein the cells converted by the father nodes in the mind map are above the cells converted by the son nodes.

Specifically, the header position of the target table is determined according to the type of the mind map, and then converted into a table of a corresponding type. If the table head position of the table is the upper first row, the central node of the thinking map is taken as the table name of the target table. Each branch sub-tree in the mind map is converted to a separate column in the target table, with the cells converted by the parent node in the mind map being above the cells of the child nodes.

In one particular example, if there is a node N1 in the mind map with multiple children, the set of children C_s1Then node N1 is converted into merged cell NC1, and the number of columns spanned by NC1 is the number of its child nodes; set child nodes C_s1Executing a recursive algorithm, and representing the recursive algorithm A1, wherein the specific implementation process of the algorithm A1 is as follows: recursively traversing Children1 for the child node set, c1 ∈ Children1, if c1 has a plurality of child nodes, converting c1 into a merged cell, the number of columns crossed for c1 is the number of child nodes, and executing algorithm A1 for the child node set of c1 until the traversed node is a leaf node.

In a specific example, FIG. 3d is a vertical arrangement mind map, wherein the mind map is also a test brain map; table 7 is the target table obtained after the conversion of fig. 3 d.

TABLE 7

Testing brain map

Branch topic 1	Branch topic 2	Branch topic 3	Branch topic 4
				Subtopic 12	Sub-theme 22	Sub-theme 32	Sub-theme 42
Subtopic 13	Sub-theme 23	Sub-theme 33	Sub-topic 43
				Sub-theme 14	Sub-themes 24	Sub-themes 34	Sub-themes 44

In another specific example, fig. 3e is a vertical mind map with a plurality of sub-nodes, wherein the mind map is also called a test brain map, and table 8 is a target table obtained by converting fig. 3 e.

TABLE 8

Testing brain map

S330, determining the target table according to the upper and lower position relation between the rows or the left and right position relation between the columns.

Specifically, after each row or each column in the target table is determined, the target table is determined according to the upper and lower positional relationship between the rows or the left and right positional relationship between the columns. In a specific example, if the mind map is a horizontally-laid mind map, the head position in the target table is the first column on the left side of the table, and the target table is determined according to the determined up-down position relation of each line; and if the mind map is a vertical layout mind map, determining that the head position in the target table is the first row above the table, and determining the target table according to the determined left-right position relation of each column.

The embodiment of the invention provides a method for converting a thought-conducting graph into a table, and particularly, when a currently selected operation object is determined to be the thought-conducting graph, a central node of the thought-conducting graph is converted into a table name of a target table according to a received second conversion instruction; if the mind map is a horizontally-laid mind map, converting each branch sub-tree in the mind map into a separate row in the target table; if the mind map is a vertically-laid mind map, converting each branch sub-tree in the mind map into a separate column in the target table; and determining the target table according to the upper and lower position relationship between each row or the left and right position relationship between each column. The content of the original mind map is filled in without creating a new table, and the mind map is directly converted into the table, so that the method is convenient and quick.

Example four

Fig. 4 is a schematic structural diagram of a file format conversion apparatus according to a fourth embodiment of the present invention, which is suitable for executing a file format conversion method according to the fourth embodiment of the present invention. As shown in fig. 4, the apparatus may specifically include:

the central node conversion module 410 is configured to, when it is determined that the currently selected operation object is a table, convert a table name of the table into a central node of the target mind map according to the received first conversion instruction;

a first child node conversion module 420, configured to, when a first column on the left side in the table is a table header, in a same row of the table, use a node obtained by converting a cell in the first column in the table as a child node of the central node, and use a node obtained by converting a cell in a previous column as a parent node of a node obtained by converting a cell in a next column;

a second child node conversion module 430, configured to, when a first row in the table is a table header, in the same column of the table, use a node converted by a cell in the first row in the table as a child node of the central node, and use a node obtained by converting a cell in an upper row as a parent node of a node obtained by converting a cell in a lower row;

and a target mind map determining module 440, configured to determine the target mind map according to the central node and the corresponding parent node and child node.

Further, the method also comprises the following steps:

the judging module is used for determining the head position in the table when the table has the merging cells;

a third child node conversion module, configured to, when the head position in the table is a first column on the left side, in the same row, use the node obtained through conversion by the merged cell as a parent node of the node obtained through conversion by the cell adjacent to the right side of the merged cell;

and a fourth child node conversion module, configured to, when the head position in the table is in the first row above, in the same column, use the node obtained through conversion by the merged cell as a parent node of the node obtained through conversion by the adjacent cell below the merged cell.

Further, the target mind map determining module 440 is specifically configured to:

when the first column on the left side in the table is a table head, taking each row of the table as a subtree, and determining a target thinking graph according to the central node and a parent node and a child node in the subtree;

when the first upper row in the table is a table head, each column of the table is taken as a subtree, and a target thinking graph is determined according to the central node and the parent node and the child node in the subtree.

Further, the method also comprises the following steps:

the table name determining module is used for acquiring the table name of the table within a preset distance range of the table boundary before the table name of the table is converted into the central node of the target thinking guide graph; or determining the table name of the table by detecting the content in the operation object.

Further, the method also comprises the following steps:

the table name conversion module is used for converting the central node of the thought-guide graph into the table name of the target table according to the received second conversion instruction when the currently selected operation object is determined to be the thought-guide graph;

a row conversion module, configured to, when the mind map is a horizontally laid mind map, convert each branch subtree in the mind map into a separate row in the target table, where a cell converted by a parent node in the mind map is on the left side of a cell converted by a child node;

a column conversion module, configured to, when the mind map is a vertical layout mind map, convert each branch subtree in the mind map into a separate column in the target table, where a cell converted by a parent node in the mind map is above a cell converted by a child node;

and the target table determining module is used for determining the target table according to the upper and lower position relationship between each row or the left and right position relationship between each column.

The file format conversion device provided by the embodiment of the invention can execute the file format conversion method provided by any embodiment of the invention, and has corresponding functional modules and beneficial effects of the execution method.

EXAMPLE five

Fig. 5 is a schematic structural diagram of a computer device according to a fifth embodiment of the present invention. FIG. 5 illustrates a block diagram of an exemplary computer device 12 suitable for use in implementing embodiments of the present invention. The computer device 12 shown in FIG. 5 is only an example and should not bring any limitations to the functionality or scope of use of embodiments of the present invention.

As shown in FIG. 5, computer device 12 is in the form of a general purpose computing device. The components of computer device 12 may include, but are not limited to: one or more processors or processing units 16, a system memory 28, and a bus 18 that couples various system components including the system memory 28 and the processing unit 16.

Bus 18 represents one or more of any of several types of bus structures, including a memory bus or memory controller, a peripheral bus, an accelerated graphics port, and a processor or local bus using any of a variety of bus architectures. By way of example, such architectures include, but are not limited to, Industry Standard Architecture (ISA) bus, micro-channel architecture (MAC) bus, enhanced ISA bus, Video Electronics Standards Association (VESA) local bus, and Peripheral Component Interconnect (PCI) bus.

Computer device 12 typically includes a variety of computer system readable media. Such media may be any available media that is accessible by computer device 12 and includes both volatile and nonvolatile media, removable and non-removable media.

The system memory 28 may include computer system readable media in the form of volatile memory, such as Random Access Memory (RAM)30 and/or cache memory 32. Computer device 12 may further include other removable/non-removable, volatile/nonvolatile computer system storage media. By way of example only, storage system 34 may be used to read from and write to non-removable, nonvolatile magnetic media (not shown in FIG. 5, and commonly referred to as a "hard drive"). Although not shown in FIG. 5, a magnetic disk drive for reading from and writing to a removable, nonvolatile magnetic disk (e.g., a "floppy disk") and an optical disk drive for reading from or writing to a removable, nonvolatile optical disk (e.g., a CD-ROM, DVD-ROM, or other optical media) may be provided. In these cases, each drive may be connected to bus 18 by one or more data media interfaces. Memory 28 may include at least one program product having a set (e.g., at least one) of program modules that are configured to carry out the functions of embodiments of the invention.

A program/utility 40 having a set (at least one) of program modules 42 may be stored, for example, in memory 28, such program modules 42 including, but not limited to, an operating system, one or more application programs, other program modules, and program data, each of which examples or some combination thereof may comprise an implementation of a network environment. Program modules 42 generally carry out the functions and/or methodologies of the described embodiments of the invention.

Computer device 12 may also communicate with one or more external devices 14 (e.g., keyboard, pointing device, display 24, etc.), with one or more devices that enable a user to interact with computer device 12, and/or with any devices (e.g., network card, modem, etc.) that enable computer device 12 to communicate with one or more other computing devices. Such communication may be through an input/output (I/O) interface 22. Also, computer device 12 may communicate with one or more networks (e.g., a Local Area Network (LAN), a Wide Area Network (WAN), and/or a public network such as the Internet) via network adapter 20. As shown, network adapter 20 communicates with the other modules of computer device 12 via bus 18. It should be appreciated that although not shown in FIG. 5, other hardware and/or software modules may be used in conjunction with computer device 12, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems, among others.

The processing unit 16 executes various functional applications and data processing by running programs stored in the system memory 28, for example, implementing a file format conversion method provided by an embodiment of the present invention:

that is, the processing unit implements, when executing the program: when the currently selected operation object is determined to be a table, the table name of the table is converted into the central node of the target thinking graph according to the received first conversion instruction; when the first column on the left side in the table is the head of the table, in the same row of the table, taking the node obtained by converting the cell in the first column in the table as a child node of the central node, and taking the node obtained by converting the cell in the previous column as a parent node of the node obtained by converting the cell in the next column; when the first row at the upper part in the table is a table head, in the same column of the table, taking the node converted by the cell in the first row in the table as a child node of a central node, and taking the node obtained by the cell conversion in the previous row as a parent node of the node obtained by the cell conversion in the next row; and determining a target thinking guide graph according to the central node and the corresponding parent node and the child node.

EXAMPLE six

A sixth embodiment of the present invention provides a computer-readable storage medium, on which a computer program is stored, where the computer program, when executed by a processor, implements the file format conversion method provided in all the embodiments of the present invention:

that is, the program when executed by the processor implements: when the currently selected operation object is determined to be a table, the table name of the table is converted into the central node of the target thinking graph according to the received first conversion instruction; when the first column on the left side in the table is the head of the table, in the same row of the table, taking the node obtained by converting the cell in the first column in the table as a child node of the central node, and taking the node obtained by converting the cell in the previous column as a parent node of the node obtained by converting the cell in the next column; when the first row at the upper part in the table is a table head, in the same column of the table, taking the node converted by the cell in the first row in the table as a child node of a central node, and taking the node obtained by the cell conversion in the previous row as a parent node of the node obtained by the cell conversion in the next row; and determining a target thinking guide graph according to the central node and the corresponding parent node and the child node.

Any combination of one or more computer-readable media may be employed. The computer readable medium may be a computer readable signal medium or a computer readable storage medium. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this document, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.

A computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.

Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.

Computer program code for carrying out operations for aspects of the present invention may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C + + or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet service provider).

It is to be noted that the foregoing is only illustrative of the preferred embodiments of the present invention and the technical principles employed. It will be understood by those skilled in the art that the present invention is not limited to the particular embodiments described herein, but is capable of various obvious changes, rearrangements and substitutions as will now become apparent to those skilled in the art without departing from the scope of the invention. Therefore, although the present invention has been described in greater detail by the above embodiments, the present invention is not limited to the above embodiments, and may include other equivalent embodiments without departing from the spirit of the present invention, and the scope of the present invention is determined by the scope of the appended claims.

Claims

1. A file format conversion method, comprising:

determining the target thinking graph according to the central node and the corresponding parent node and child node;

the file format conversion method can be realized in a software and/or hardware mode;

when the currently selected operation object is determined to be the mind map, converting the central node of the mind map into the table name of the target table according to the received second conversion instruction;

if the mind map is a horizontally-laid mind map, converting each branch sub-tree in the mind map into a separate row in the target table, wherein the cells converted by the parent nodes in the mind map are on the left side of the cells converted by the child nodes;

if a node N in the thought-guiding graph has a plurality of child nodes, and the set of the child nodes is CS, converting the node N into a merged cell NC, wherein the number of the cross-lines of the NC is the number of the child nodes; executing a recursive algorithm on a plurality of CS points of the child node, and expressing the recursive algorithm by using A, wherein the specific implementation process of the algorithm A is as follows: recursively traversing a child node set Children, wherein c belongs to the Children, if c has a plurality of child nodes, c is converted into a merging cell, the number of the spanning lines of c is the number of the child nodes, and the child node set of c is executed with an algorithm A until the traversed nodes are leaf nodes;

if the mind map is a vertical layout mind map, converting each branch sub-tree in the mind map into a separate column in the target table, wherein the cells converted by the parent nodes in the mind map are above the cells converted by the child nodes;

if there is a node N1 in the mind map with multiple children, the set of children C_s1Then node N1 is converted into merged cell NC1, and the number of columns spanned by NC1 is the number of its child nodes; set child nodes C_s1Executing a recursive algorithm, and representing the recursive algorithm A1, wherein the specific implementation process of the algorithm A1 is as follows: recursively traversing a child node set Children1, wherein c1 belongs to Children1, if c1 has a plurality of child nodes, c1 is converted into a merging cell, the cross-column number of c1 is the number of the child nodes, and the child node set of c1 is subjected to algorithm A1 until the traversed nodes are leaf nodes;

and determining the target table according to the upper and lower position relationship between each row or the left and right position relationship between each column.

2. The method of claim 1, further comprising:

if the table has the merging cells, determining the head position of the table;

when the head position in the table is a first column on the left side, in the same row, taking the node obtained by converting the merged cell as a father node of the node obtained by converting the adjacent cell on the right side of the merged cell;

and when the head position in the table is the first row above, in the same column, taking the node obtained by converting the merged cell as the father node of the node obtained by converting the adjacent cell below the merged cell.

3. The method of claim 1, wherein said determining the target mind map from the central node and corresponding parent and child nodes comprises:

4. The method of claim 1, further comprising, prior to said converting the table name of the table to the central node of the target mind map:

acquiring a table name of a table within a preset distance range of the table boundary; or determining the table name of the table by detecting the content in the operation object.

5. A file format conversion apparatus, comprising:

the target thinking guide graph determining module is used for determining the target thinking guide graph according to the central node and the corresponding father node and the corresponding child node;

the file format conversion device can be realized in a software and/or hardware mode;

6. The apparatus of claim 5, further comprising:

7. The apparatus as claimed in claim 5, wherein the target mind map determining module is specifically configured to:

8. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor implements the method according to any of claims 1-4 when executing the program.

9. A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the method according to any one of claims 1-4.