CN113419739B

CN113419739B - Node map difference detection method and device, electronic equipment and storage medium

Info

Publication number: CN113419739B
Application number: CN202110693653.2A
Authority: CN
Inventors: 符建锋
Original assignee: Netease Hangzhou Network Co Ltd
Current assignee: Netease Hangzhou Network Co Ltd
Priority date: 2021-06-22
Filing date: 2021-06-22
Publication date: 2022-12-06
Anticipated expiration: 2041-06-22
Also published as: CN113419739A

Abstract

The embodiment of the application provides a node map difference detection method and device, an electronic device and a storage medium, wherein a node map file to be detected is obtained and is used for generating a node map to be detected comprising at least one node unit; analyzing the node graph file to be tested, and determining difference information, wherein the difference information represents a difference node unit of the node graph to be tested relative to a preset comparison node graph; and displaying the difference node units in the node graph to be tested according to the difference information. Because the difference information obtained after the node graph file to be tested is analyzed can be directly used for indicating the difference node unit, the difference node unit indicated by the difference information in the node graph to be tested can be directly displayed, a user can more visually and quickly position the difference point in the node graph to be tested, the difference point does not need to be positioned by manually comparing the node graph file to be tested in a text format, the positioning precision and the positioning efficiency of the difference point are improved, and the testing efficiency and the testing effect are further improved.

Description

Node map difference detection method and device, electronic equipment and storage medium

Technical Field

The present application relates to the field of computer technologies, and in particular, to a method and an apparatus for detecting a node map difference, an electronic device, and a storage medium.

Background

This section is intended to provide a background or context to the embodiments of the application that are recited in the claims. The description herein is not admitted to be prior art by inclusion in this section.

Node Graph (Node Graph) is a concept in a software design architecture, and various complex logics and functions consistent with pure source code programming can be realized by editing, combining and connecting various functional Node units, so that the Node Graph is an important design means for improving development efficiency and reducing development threshold. The development design based on the visual node diagram is widely applied to a plurality of technical industries including the game development industry, and is characterized in that the requirements on the operation level and the understanding cost of development designers are low, and even programming capability is not required, so that what you see is what you get. The method is characterized in that a specific directed graph relation is formed by performing simple operations such as dragging and connecting on a preset node on a design platform and setting parameters, so that the required logic function relation can be described and further used and operated in application.

In the prior art, a document for recording information of a node map, that is, a node map file, is implemented in a form of a text document such as Extensible Markup Language (XML), and in a program development process, after a node map file is changed, a tester needs to perform change positioning and corresponding testing by manually detecting different points of the text document, which causes a problem of inaccurate positioning of a changed position, and affects testing efficiency and testing accuracy.

Disclosure of Invention

The application provides a node map difference detection method, a node map difference detection device, an electronic device and a storage medium, which are used for solving the problems of low testing efficiency and poor testing effect caused by the fact that a change position cannot be accurately positioned after a node map file is changed.

According to a first aspect of embodiments of the present application, a method for detecting a node map difference is provided, where the method includes:

acquiring a node graph file to be tested, wherein the node graph file to be tested is used for generating a node graph to be tested comprising at least one node unit; analyzing the node graph file to be tested, and determining difference information, wherein the difference information represents a difference node unit of the node graph to be tested relative to a preset comparison node graph; and displaying the difference node unit in the node graph to be tested according to the difference information.

In a possible implementation manner, the parsing the node graph file to be tested to determine difference information includes: determining node relation data corresponding to the node graph to be tested based on the data structure of the XML file, wherein the node relation data are used for representing the logical relation among node units in the node graph to be tested; carrying out format conversion on the node relation data corresponding to the node graph to be detected to generate preprocessed data corresponding to the node graph to be detected; and performing recursive comparison on the preprocessed data corresponding to the node graph to be tested and the preprocessed data corresponding to the comparison node graph, and determining difference information.

In a possible implementation manner, the preprocessing data includes key value relationship data, the key value relationship data includes key value pairs representing correspondence between identifiers of node units and data elements of the node units, format conversion is performed on the node relationship data corresponding to the node map to be detected, and the preprocessing data corresponding to the node map to be detected is generated, including: and performing key value conversion on the node relation data corresponding to the node graph to be detected to generate the key value relation data corresponding to the node graph to be detected.

In a possible implementation manner, before performing format conversion on the node relationship data corresponding to the node map to be tested, the method further includes: performing list conversion on the node relation data corresponding to the node graph to be detected to generate list relation data corresponding to the node graph to be detected, wherein the list relation data comprises a data list representing the corresponding relation between the identifier of the node unit and a plurality of data elements of the node unit; performing format conversion on the node relation data corresponding to the node graph to be tested, including: and performing key value conversion on the list relation data corresponding to the node graph to be detected to generate key value relation data corresponding to the node graph to be detected.

In a possible implementation manner, before performing key value conversion on the list relationship data corresponding to the node map to be tested, the method further includes: and sorting each data element in the data list in the list relation data.

In a possible implementation manner, the pre-processing data includes an identifier of a node unit and a corresponding data element, and the determining difference information by performing recursive comparison on the pre-processing data corresponding to the node map to be detected and the pre-processing data corresponding to the comparison node map includes: based on the identifier of the node unit corresponding to the node graph to be detected and the corresponding data element, performing recursive difference comparison with the identifier of the node unit corresponding to the comparison node graph and the corresponding data element, and determining a difference identifier; and determining a difference node unit according to the difference identifier.

In a possible implementation manner, based on the identifier of the node unit corresponding to the node map to be tested and the corresponding data element, performing recursive difference comparison with the identifier of the node unit corresponding to the comparison node map and the corresponding data element, and determining a difference identifier includes: according to the data elements of the node units corresponding to the node graph to be detected, comparing the data elements of the node units corresponding to the comparison node graph line by line, and determining difference data elements and paths of the difference data elements; and traversing to the nearest node unit from the upper level according to the difference data element and the path of the difference data element, and determining a difference identifier according to the identifier of the nearest node unit.

In one possible implementation, the method further includes: based on the identification of the node unit corresponding to the node graph to be tested and the corresponding data element, carrying out recursive difference comparison with the identification of the node unit corresponding to the comparison node graph and the corresponding data element, and determining a difference type; the type of difference comprises one of: the numerical difference of the node units, the addition of the node units and the deletion of the node units.

In one possible implementation, the method further includes: and determining path information corresponding to the difference identifier, wherein the path information represents the path of the difference node unit in the node graph to be tested.

In one possible implementation, the method further includes: determining first difference data according to the difference information, wherein the first difference data are data representing the node structure of the difference node unit in the preprocessed data; and restoring the first difference data to generate second difference data, wherein the second difference data is data in an XML format.

In a possible implementation manner, displaying the difference node unit in the node map to be tested according to the difference information includes: determining first difference data according to the difference information, wherein the first difference data are data representing the node structure of the difference node unit in the preprocessed data;

determining the type of a node unit according to the first difference data; and displaying the difference node units in the node graph to be tested in a corresponding display mode according to the node unit types.

In a possible implementation manner, displaying the difference node unit in the node map to be tested includes: and displaying the content and the path of the difference node unit in the node graph to be tested.

In one possible implementation manner, displaying the content of the difference node unit in the node graph to be tested includes: restoring the first difference data to generate second difference data, wherein the second difference data is data in an XML format; and displaying the content of the difference node unit according to the second difference data.

In a possible implementation manner, the difference information includes a difference type, and the displaying the difference node unit in the node map to be tested according to the difference information includes: and displaying the display difference node unit in corresponding colors according to the difference type.

According to a second aspect of embodiments of the present application, there is provided a node map difference detecting apparatus, including:

the node graph generating module is used for generating a node graph to be tested, wherein the node graph to be tested comprises at least one node unit;

the analysis module is used for analyzing the node graph file to be detected and determining difference information, and the difference information represents a difference node unit of the node graph to be detected relative to a preset comparison node graph;

and the display module is used for displaying the difference node unit in the node graph to be tested according to the difference information.

In a possible implementation manner, the node graph file to be tested is an XML file, and the parsing module is specifically configured to: determining node relation data corresponding to the node graph to be tested based on the data structure of the XML file, wherein the node relation data are used for representing the logical relation among node units in the node graph to be tested; carrying out format conversion on the node relation data corresponding to the node graph to be detected to generate preprocessed data corresponding to the node graph to be detected; and performing recursive comparison on the preprocessed data corresponding to the node graph to be tested and the preprocessed data corresponding to the comparison node graph, and determining difference information.

In a possible implementation manner, the preprocessed data includes key value relationship data, the key value relationship data includes key value pairs representing correspondence between identifiers of node units and data elements of the node units, and the analysis module is specifically configured to, when performing format conversion on the node relationship data corresponding to the node map to be detected and generating the preprocessed data corresponding to the node map to be detected: and performing key value conversion on the node relation data corresponding to the node graph to be detected to generate the key value relation data corresponding to the node graph to be detected.

In a possible implementation manner, before performing format conversion on the node relationship data corresponding to the node map to be tested, the parsing module is further configured to: performing list conversion on the node relation data corresponding to the node graph to be detected to generate list relation data corresponding to the node graph to be detected, wherein the list relation data comprises a data list representing the corresponding relation between the identifier of the node unit and a plurality of data elements of the node unit; when format conversion is performed on the node relation data corresponding to the node graph to be tested, the analysis module is specifically configured to: and performing key value conversion on the list relation data corresponding to the node graph to be detected to generate key value relation data corresponding to the node graph to be detected.

In a possible implementation manner, before performing key value conversion on the list relationship data corresponding to the node map to be tested, the parsing module is further configured to: and sorting each data element in the data list in the list relation data.

In a possible implementation manner, the preprocessed data includes identifiers of node units and corresponding data elements, and the analysis module is specifically configured to, when performing recursive comparison on the preprocessed data corresponding to the node map to be detected and the preprocessed data corresponding to the comparison node map to determine difference information: based on the identification of the node unit corresponding to the node graph to be tested and the corresponding data element, carrying out recursive difference comparison with the identification of the node unit corresponding to the comparison node graph and the corresponding data element, and determining a difference identification; and determining a difference node unit according to the difference identifier.

In a possible implementation manner, the parsing module, when performing recursive difference comparison based on the identifier of the node unit corresponding to the node map to be tested and the corresponding data element, and the identifier of the node unit corresponding to the comparison node map and the corresponding data element, and determining a difference identifier, is specifically configured to: according to the data elements of the node units corresponding to the node graph to be detected, comparing the data elements of the node units corresponding to the comparison node graph line by line, and determining difference data elements and paths of the difference data elements; and traversing to the nearest node unit from the upper level according to the difference data element and the path of the difference data element, and determining a difference identifier according to the identifier of the nearest node unit.

In one possible implementation, the parsing module is further configured to: and performing recursive difference comparison on the basis of the identifier of the node unit corresponding to the node graph to be detected and the corresponding data element and the identifier of the node unit corresponding to the comparison node graph and the corresponding data element, and determining the difference type.

In one possible implementation, the type of difference includes one of: the numerical difference of the node units, the addition of the node units and the deletion of the node units.

In a possible implementation manner, the parsing module is further configured to: and determining path information corresponding to the difference identifier, wherein the path information represents the path of the difference node unit in the node graph to be tested.

In a possible implementation manner, the parsing module is further configured to: determining first difference data according to the difference information, wherein the first difference data are data representing the node structure of the difference node unit in the preprocessed data; and restoring the first difference data to generate second difference data, wherein the second difference data is data in an XML format.

In a possible implementation manner, the display module is specifically configured to: determining first difference data according to the difference information, wherein the first difference data are data representing the node structure of the difference node unit in the preprocessed data; determining the type of a node unit according to the first difference data; and displaying the difference node units in the node graph to be tested in a corresponding display mode according to the node unit types.

In a possible implementation manner, when the display module displays the difference node unit in the node map to be tested, the display module is specifically configured to: and displaying the content and the path of the difference node unit in the node graph to be tested.

In a possible implementation manner, when the display module displays the content of the difference node unit in the node map to be tested, the display module is specifically configured to: restoring the first difference data to generate second difference data, wherein the second difference data is data in an XML format; and displaying the content of the difference node unit according to the second difference data.

In a possible implementation manner, the difference information includes a difference type, and the display module is specifically configured to, when displaying the difference node unit in the node map to be tested according to the difference information: and displaying the display difference node unit in corresponding colors according to the difference type.

According to a third aspect of embodiments of the present application, there is provided an electronic device, comprising: a memory, a processor, and a computer program;

wherein the computer program is stored in the memory and configured to be executed by the processor to perform the node map difference detection method according to any one of the first aspect of the embodiments of the present application.

According to a fourth aspect of embodiments of the present application, there is provided a computer-readable storage medium having stored therein computer-executable instructions, which when executed by a processor, are configured to implement the node map difference detection method according to any one of the first aspect of embodiments of the present application.

According to a fifth aspect of embodiments of the present application, there is provided a computer program product comprising a computer program that, when executed by a processor, implements the first aspect and various possible node map difference detection methods of the first aspect as described above.

According to the node map difference detection method, the node map difference detection device, the electronic equipment and the storage medium, a node map file to be detected is obtained, and the node map file to be detected is used for generating a node map to be detected comprising at least one node unit; analyzing the node graph file to be tested, and determining difference information, wherein the difference information represents a difference node unit of the node graph to be tested relative to a preset comparison node graph; and displaying the difference node unit in the node graph to be tested according to the difference information. Because the difference information obtained after the node graph file to be tested is analyzed can be directly used for indicating the difference node unit, the difference node unit indicated by the difference information can be directly displayed in the node graph to be tested, so that a user can more visually and quickly locate the difference point in the node graph to be tested without manually comparing the node graph file to be tested in a text format to locate the difference point, the locating precision and the locating efficiency of the difference point are improved, and the testing efficiency and the testing effect are further improved.

Drawings

The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present application and together with the description, serve to explain the principles of the application.

Fig. 1 is an application scenario diagram of a node map difference detection method according to an embodiment of the present application;

FIG. 2 is a flowchart of a node map difference detection method according to an embodiment of the present application;

fig. 3 is a schematic diagram of a node map to be tested according to an embodiment of the present application;

FIG. 4 is a flowchart of a node map difference detection method according to another embodiment of the present application;

FIG. 5 is a schematic diagram of an XML file provided in an embodiment of the present application;

fig. 6 is a schematic diagram of a key value conversion process provided in an embodiment of the present application;

fig. 7 is a schematic diagram of another key value conversion process provided in the embodiment of the present application;

fig. 8 is a schematic diagram of a process of generating list relationship data according to an embodiment of the present application;

FIG. 9 is a flowchart illustrating an implementation of step S204 in the embodiment shown in FIG. 4;

FIG. 10 is a schematic view of a user interface of a design platform according to an embodiment of the present application

Fig. 11 is a schematic structural diagram of a node map difference detection apparatus according to an embodiment of the present application;

fig. 12 is a schematic diagram of an electronic device according to an embodiment of the present application.

With the above figures, there are shown specific embodiments of the present application, which will be described in more detail below. These drawings and written description are not intended to limit the scope of the inventive concepts in any manner, but rather to illustrate the inventive concepts to those skilled in the art by reference to specific embodiments.

Detailed Description

Reference will now be made in detail to the exemplary embodiments, examples of which are illustrated in the accompanying drawings. The following description refers to the accompanying drawings in which the same numbers in different drawings represent the same or similar elements unless otherwise indicated. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the present application. Rather, they are merely examples of apparatus and methods consistent with certain aspects of the present application, as detailed in the appended claims.

The terms referred to in this application are explained first:

the Node Graph (Node Graph) is a concept in a software design architecture, can realize various complex logics and functions consistent with pure source code programming by editing, combining and connecting various functional Node units, and is an important design means for improving development efficiency and reducing development threshold.

Nodes (nodes), which handle specific operations or logic by functionally encapsulating them and providing input and output to users, are the most basic features of nodes.

Node Links (Node Links) are used for transmitting data among nodes, so that specific logical combination operation relations can be formed among the nodes.

Extensible markup language (XML), a markup language for marking electronic documents to have a structure, can be used to mark data and define data types. XML is used only to store data and is easy to read/write data in any application.

The following explains an application scenario of the embodiment of the present application:

fig. 1 is an application scenario diagram of a node map difference detection method provided in an embodiment of the present application, where the node map difference detection method provided in the embodiment of the present application may be applied to an application scenario of program development and testing, and specifically, as shown in fig. 1, a first terminal device for program development and a second terminal device for program testing are respectively in communication connection with a server, a developer completes program development design based on a visual node map through the first terminal device to generate a node map file, and synchronizes the node map file to the server, and the second terminal device obtains the node map file output by the first terminal device from the server, and processes the node map file by using the node map difference detection method provided in the embodiment of the present application, locates a difference point in the node map file, and further performs processing such as testing and modifying on the difference point.

Of course, it may be understood that, in another application scenario, both development and testing of a program may be completed by one terminal device, and the node map difference detection method provided in this embodiment may also be applied in a process of processing a node map file by the terminal device, and this application scenario is not described herein again.

The development design based on the visual node diagram is widely applied to a plurality of technical industries including the game development industry, and is characterized in that the requirements on the operation level and the understanding cost of development designers are low, and even programming capability is not required, so that what you see is what you get. The method is characterized in that a specific directed node graph relation is formed by performing simple operations such as dragging and connecting on a preset node on a design platform and setting parameters, so that the required logic function relation can be described and further used and operated in application. And an output document in which such node map information is recorded needs to be saved and output as a document in a specific form. For example, the document is organized, stored and output in an XML format, and the document has flexible and cross-application description characteristics, so that a user can conveniently define a data structure, and a very good bridging effect can be achieved between a visual node diagram and the actual application.

However, in the process of developing a program which is actually used, there is a problem that a test process is complicated based on a node map of a specific format document. Taking a node graph file in an XML format as an example, because XML is actually a text document, and a node graph describes complex logical relationships and functions, when a tester faces the node graph file in a text form, the tester can only determine difference points of the node graph file by comparing text differences in the document, so that it is difficult to locate the change position and core data of the node graph, and further the test efficiency and the test precision are affected.

The following describes the technical solutions of the present application and how to solve the above technical problems with specific embodiments. The following several specific embodiments may be combined with each other, and details of the same or similar concepts or processes may not be repeated in some embodiments. Embodiments of the present application will be described below with reference to the accompanying drawings.

Fig. 2 is a flowchart of a node map difference detection method according to an embodiment of the present application, and as shown in fig. 2, the node map difference detection method according to the embodiment may be applied to a terminal device, and specifically includes the following steps:

step S101, a node graph file to be tested is obtained and is used for generating a node graph to be tested comprising at least one node unit.

Illustratively, the node map file is a file that contains information of a node map and can be used to generate the node map on a design platform based on a node map design mode, and the node map file to be tested may be an output file of a certain link in a workflow of program development based on the node map, where the design platform based on the node map design mode may be software installed in a cloud or locally. More specifically, by operating a Node graph file to be tested on a design platform, a corresponding Node graph to be tested may be generated and displayed, where the Node graph to be tested includes at least one Node unit, and the Node unit may be, for example, a Node (Node) or a Node link (Node Links) in the Node graph. Each node unit can realize corresponding operation, logic or function.

Exemplarily, a node graph file to be tested is tested to locate a difference node unit in a node graph to be tested corresponding to the node graph file to be tested, so as to determine a data change position in the node graph to be tested, and to support subsequent work contents such as testing and modifying of the node graph to be tested.

According to specific needs, the node graph file to be tested can be stored locally in the terminal equipment, and the node graph file to be tested is read after responding to an operation instruction of a user. Or the node graph file to be tested can be stored in the cloud server, and the terminal device obtains the node graph file to be tested by accessing the cloud server or receiving pushing of the cloud service, which is not described any more.

Step S102, analyzing the node map file to be tested, and determining difference information, wherein the difference information represents a difference node unit of the node map to be tested relative to a preset comparison node map.

Illustratively, the node map file to be tested is a text type file, such as an XML file. XML files have a specific data structure and characteristics, for example, the start position in an XML file includes a declaration statement, after which the start tag including a root element and corresponding child elements is to be placed before the start tags of all other elements, and the end tag of the root element is to be placed after the end tags of all other elements. The document structure of the XML file is parsed based on the specific identifier in the XML file, and each element in the XML file can be determined. Each element corresponds to a node unit, and the elements and the logical relationship among the elements can be determined by analyzing the content of the XML file.

Further, a comparison node graph file is preset in the terminal device or the cloud server, and the comparison node graph file has the same file format as the node graph file to be detected, for example, an XML file. By acquiring a preset comparison node graph file and analyzing the comparison node graph file in a similar manner, each element and the logic relationship among the elements can be determined. By comparing the elements and the logic relations between the elements in the comparison node graph file and the node graph file to be detected, the elements and the logic relations with differences can be determined, and then the difference node units corresponding to the elements and the logic relations with differences are determined, so that difference information is obtained.

And step S103, displaying the difference node units in the node graph to be tested according to the difference information.

According to the difference information obtained in the above steps, the difference node unit of the node graph to be detected relative to the preset comparison node graph can be determined, and then, when the node graph to be detected is generated through the node graph file to be detected, the difference node unit is displayed on the node graph to be detected, so that the highlight display of the difference node unit is realized, a user can directly find the node unit with the difference, and the difference position does not need to be determined by comparing the document file in a text form.

Fig. 3 is a schematic diagram of a node graph to be tested according to an embodiment of the present application, where, for example, after executing a node graph file to be tested through a design platform, a terminal device displays a corresponding node graph to be tested in a user interface of the design platform, and as shown in fig. 3, the node graph to be tested includes a plurality of node units (portions shown in the graph), the node units are represented by rectangular icons, and a parent-level node unit and a child-level node unit are connected by a node connecting line and used for representing a logical relationship between the node units. After the difference node unit is determined, the difference node unit is highlighted in the modes of highlighting, shading, thickening, color changing and the like, so that the display of the difference node unit is realized. Referring to fig. 3, the node unit with the identifier action _1 is the difference node unit determined in the above step, and is displayed in a manner of thickening the outline, and it is understood that the difference node unit may also be displayed in other manners, which is not described in detail herein.

It should be noted that, in this embodiment, the node map file to be tested and the comparison node map file are described by taking an XML file as an example, which is not limited to this time, and other text files with specific formats may also be used as the node map file to be tested and the comparison node map file in this embodiment.

In this embodiment, a node graph file to be tested is obtained and used for generating a node graph to be tested including at least one node unit; analyzing the node graph file to be tested, and determining difference information, wherein the difference information represents a difference node unit of the node graph to be tested relative to a preset comparison node graph; and displaying the difference node units in the node graph to be tested according to the difference information. Because the difference information obtained after the node graph file to be tested is analyzed can be directly used for indicating the difference node unit, the difference node unit indicated by the difference information in the node graph to be tested can be directly displayed, so that a user can more visually and quickly locate the difference point in the node graph to be tested without manually comparing the node graph file to be tested in a text format to locate the difference point, the location precision and the location efficiency of the difference point are improved, and the test efficiency and the test effect are further improved.

Fig. 4 is a flowchart of a node map difference detection method according to another embodiment of the present application, and as shown in fig. 4, the node map difference detection method according to this embodiment further details step S102 and step S103 on the basis of the node map difference detection method according to the embodiment shown in fig. 2, and then the node map difference detection method according to this embodiment includes the following steps:

step S201, acquiring a node map file to be detected, where the node map file to be detected is used to generate a node map to be detected including at least one node unit, and the node map file to be detected is an XML file.

Step S202, determining node relation data corresponding to the node graph to be tested based on the data structure of the XML file, wherein the node relation data is used for representing the logical relation among all node units in the node graph to be tested.

Illustratively, the node graph file to be tested is an XML file, and a data structure in the XML file represents a logical relationship among node units in the node graph to be tested. Therefore, the XML file is parsed, and based on the data structure of the XML file, a set of node relationship data representing the logical relationship between each node unit in the node graph to be tested may be determined, where the node relationship data includes, for example, all elements in the XML file and the hierarchical relationship between each element. In a possible implementation manner, the node relationship data corresponding to the node graph to be detected is determined, and is obtained by identifying and extracting each element in the XML file, and the specific process is not repeated here.

Step S203, performing format conversion on the node relation data corresponding to the node map to be detected, and generating preprocessed data corresponding to the node map to be detected.

Since an XML file is a text document, it is composed of multiple lines of text including multiple sets of corresponding start and end tags. Therefore, when the content of the XML file changes, the default of the start tag and the end tag may be caused based on the difference information of the line number, thereby destroying the complete XML data structure and causing the problem that the difference node unit cannot be correctly determined subsequently.

Exemplarily, fig. 5 is a schematic diagram of an XML file provided in the embodiment of the present application, referring to fig. 5, a left side is a comparison node graph file, a right side is a node graph file to be measured, the comparison node graph file includes 2 Input elements, which are respectively located by a start marker < Input > and an end marker </Input >, where a first Input element includes sub-elements (not all shown) such as < TYPE > P </TYPE >, < NAME > S </NAME >, and a second Input element includes sub-elements (not all shown) such as < TYPE > P </TYPE >, < NAME > N </NAME >. After the node diagram file is modified, two Input elements are modified into one Input element by deleting an end mark (Input) of a first Input element and a start mark (Input) of a second Input element. According to the traditional difference information based on the line number, the located difference content is from < NAME > S </NAME > in the first Input element to < TYPE > P </TYPE > in the second A element, however, the difference content is not a complete node unit structure. Therefore, a certain differential node unit cannot be formed based on the above-described differential contents.

Therefore, before the generated node relation data is processed, the node relation data is preprocessed, format conversion is carried out on the node relation data corresponding to the node graph to be tested, preprocessed data with a normalized data structure is formed, and the problem of errors in positioning of different node units is solved.

In a possible implementation manner, the preprocessed data includes key value relationship data, and the key value relationship data includes key value pairs representing correspondence between the identifier of the node unit and the data elements of the node unit. Carrying out format conversion on the node relation data corresponding to the node graph to be detected to generate preprocessed data corresponding to the node graph to be detected, wherein the format conversion comprises the following steps: and performing key value conversion on the node relation data corresponding to the node graph to be detected to generate the key value relation data corresponding to the node graph to be detected.

Fig. 6 is a schematic diagram of a key value conversion process provided in an embodiment of the present application, and fig. 7 is a schematic diagram of another key value conversion process provided in the embodiment of the present application, taking fig. 6 as an example, according to node relationship data, converting elements (such as an element a, an element B, and an element C shown in the figure) corresponding to each node unit into a key value pair form, and performing hierarchical division with specific identifiers, such as "{" and "}" shown in the figure, to implement correspondence with each element, and forming a key value pair (C: 10) with data elements (10) to constitute key value relationship data. The key-value conversion process shown in fig. 7 is similar to that shown in fig. 6, and can be introduced with reference to fig. 6, which is not described herein again. Fig. 6 shows key value relationship data of a parent-child structure, and fig. 7 shows key value relationship data of different root nodes of the same level. The implementation forms of the key-value relation data in fig. 6 and fig. 7 are only exemplary, and may be combined or changed according to specific needs, and implemented in other forms, which are not illustrated here.

In another possible implementation manner, before performing format conversion on the node relationship data corresponding to the node map to be tested, the method further includes: and performing list conversion on the node relation data corresponding to the node graph to be detected to generate list relation data corresponding to the node graph to be detected, wherein the list relation data comprises a data list representing the corresponding relation between the identifier of the node unit and a plurality of data elements of the node unit. And then, performing key value conversion on the list relation data corresponding to the node graph to be detected to generate key value relation data corresponding to the node graph to be detected. The data list in the list relation data represents data of the same level and the same root node. Optionally, before performing key-value conversion on the list relationship data corresponding to the node graph to be tested, the method further includes: and sequencing each data element in the data list in the list relation data, thereby removing misleading data caused by inconsistent sequencing and improving the differential positioning precision.

Fig. 8 is a schematic diagram of a process of generating list relationship data according to an embodiment of the present application, and referring to fig. 8, after node relationship data is obtained, list conversion is performed on the node relationship data to generate a list

Relationship data. The node unit A in the list relation data corresponds to a data list D

D includes three data elements "2", "1", "3". The list relation data is then sorted, i.e. the data elements in the data list in the list relation data are sorted, e.g. the sorted data list comprises three ordered data elements "1", "2", "3". And then, further performing key value conversion on the list relation data to generate key value relation data corresponding to the node graph to be tested, so that each data element corresponds to one unique identifier (sub 0_ D, sub1_ D, sub _ D) to form a key value pair. Thereby improving the contrast efficiency and maintaining the path consistency.

In the embodiment, the format conversion is performed on the node relation data to generate the key value relation data and/or the list relation data, so that the replacement and the coverage of the elements corresponding to each node unit in the XML are realized, and because the difference information does not need to be positioned in the modes of line numbers, starting marks, ending marks and the like, the subsequently generated difference information can represent a complete node unit structure, so that the difference node units are directly displayed.

Step S204, carrying out recursion comparison on the preprocessed data corresponding to the node graph to be tested and the preprocessed data corresponding to the comparison node graph, and determining difference information.

Exemplarily, after performing key-value relationship conversion on the node relationship data in the above steps, the generated preprocessed data is taken as the key-value relationship data, and the preprocessed data includes the identifier of the node unit and the corresponding data element, as shown in fig. 9, step S204 includes two specific implementation steps of steps S2041 and S2042:

step S2041, based on the identifier of the node unit corresponding to the node map to be measured and the corresponding data element, performing recursive difference comparison with the identifier of the node unit corresponding to the comparison node map and the corresponding data element, and determining a difference identifier.

Exemplarily, after data elements corresponding to each node unit in the node graph to be detected and data elements corresponding to each node unit in the comparison node graph are obtained, data having differences, that is, difference data elements and paths of the difference data elements are determined according to a line-by-line comparison between the data elements of the node unit corresponding to the node graph to be detected and the data elements of the node unit corresponding to the comparison node graph. Optionally, when the data elements of the node units corresponding to the node graph to be tested are compared with the data elements of the node units corresponding to the comparison node graph line by line, the difference types corresponding to the difference data elements may also be determined at the same time, and the difference types are, for example: the numerical difference of the node units, the addition of the node units and the deletion of the node units.

Step S2042, determining a difference node unit according to the difference identifier.

After the difference identifier is determined, according to the corresponding relationship between the identifier in the key value relationship data and the data element, the difference node unit corresponding to the difference identifier can be determined. One or more difference node units may be provided, which is not described in detail herein.

Step S205 determines first difference data according to the difference information, where the first difference data is data representing a node structure of the difference node unit in the key value relationship data.

Step S206, the first difference data is restored to generate second difference data, and the second difference data is data in an XML format.

Illustratively, the difference information is information for indicating a difference node unit, and in one possible implementation, the difference information includes a difference identifier corresponding to the difference node unit. According to the difference identifier, the data corresponding to the difference identifier may be determined in the key-value relationship data, so as to determine as first difference data, where the first difference data characterizes a node structure of the difference node unit, for example, the first difference data includes key-value pair data in the difference node unit. Because the first difference data is generated after the XML data is converted through the key value relationship, and is not the original XML data, in order to ensure the normalization and the consistency and enable a person skilled in the art to specify the difference point, the first difference data needs to be restored to generate the data in the corresponding XML format. When the difference node units are displayed on the node graph, the second difference data in the XML format corresponding to the difference node units can be displayed at the same time, so that the code difference points can be positioned better.

Step S207, determining the node unit type according to the first difference data.

And S208, displaying the difference node units in the node graph to be tested in a corresponding display mode according to the node unit types.

Specifically, the first difference data is data representing a node structure of the difference node unit, and the type of the node unit of the difference node unit can be determined according to the data representing the node structure of the difference node unit, so that the difference node unit is displayed on the node map in a specific mode of "node" or "node connection".

In one possible implementation manner, displaying a difference node unit in a node map to be tested includes: and displaying the content and the path of the difference node unit in the node graph to be tested. More specifically, for example, the difference node units are displayed in the node map in the form of icons and connecting lines, and the difference node units are displayed in corresponding colors according to the difference types, and at the same time, the contents of the node units are displayed in the preset area in the form of XML format.

Fig. 10 is a schematic view of a user interface of a design platform according to an embodiment of the present disclosure, as shown in fig. 10, the user interface includes a node map area for displaying a node map, where the node map is displayed with a root node unit a and child nodes A1, A2, and A3 that have a logical relationship with the root node unit a and are connected by node connecting lines, where a color of an icon with a difference node unit A3 may be green, and represents a node unit added to the node map to be tested relative to a comparison node map. Meanwhile, exemplarily, after the user clicks the difference node unit A3, a text file in an XML format corresponding to the difference node unit, that is, the second difference data, is displayed in the difference data area of the user interface, and optionally, a comparison node graph file in a corresponding position may also be displayed to prompt the user to better locate the difference point. For example, the user interface may further include a parameter area for providing information display of parameters and other event data for the node map, which is not described herein again.

In this embodiment, the implementation manner of step S201 is the same as the implementation manner of step S101 in the embodiment shown in fig. 2 of this application, and is not described in detail here.

Fig. 11 is a schematic structural diagram of a node map difference detecting apparatus according to an embodiment of the present application, and is applied to a terminal device, as shown in fig. 11, a node map difference detecting apparatus 3 according to the embodiment includes:

the acquiring module 31 is configured to acquire a node map file to be detected, where the node map file to be detected is used to generate a node map to be detected including at least one node unit;

the analysis module 32 is configured to analyze the node map file to be detected, and determine difference information, where the difference information represents a difference node unit of the node map to be detected relative to a preset comparison node map;

and a display module 33, configured to display the difference node unit in the node map to be tested according to the difference information.

In a possible implementation manner, the node graph file to be tested is an XML file, and the parsing module 32 is specifically configured to: determining node relation data corresponding to the node graph to be tested based on the data structure of the XML file, wherein the node relation data is used for representing the logical relation among all node units in the node graph to be tested; carrying out format conversion on node relation data corresponding to the node graph to be detected to generate preprocessed data corresponding to the node graph to be detected; and performing recursive comparison on the preprocessed data corresponding to the node graph to be tested and the preprocessed data corresponding to the comparison node graph, and determining difference information.

In a possible implementation manner, the preprocessed data includes key value relationship data, where the key value relationship data includes key value pairs representing correspondence between identifiers of node units and data elements of the node units, and the parsing module 32 is specifically configured to, when performing format conversion on the node relationship data corresponding to the node graph to be tested and generating the preprocessed data corresponding to the node graph to be tested: and performing key value conversion on the node relation data corresponding to the node graph to be detected to generate the key value relation data corresponding to the node graph to be detected.

In a possible implementation manner, before performing format conversion on the node relationship data corresponding to the node map to be tested, the parsing module 32 is further configured to: performing list conversion on node relation data corresponding to the node graph to be detected to generate list relation data corresponding to the node graph to be detected, wherein the list relation data comprises a data list representing the corresponding relation between the identifier of the node unit and a plurality of data elements of the node unit; when performing format conversion on the node relationship data corresponding to the node map to be detected, the parsing module 32 is specifically configured to: and performing key value conversion on the list relation data corresponding to the node graph to be detected to generate key value relation data corresponding to the node graph to be detected.

In a possible implementation manner, before performing key value conversion on the list relationship data corresponding to the node map to be tested, the parsing module 32 is further configured to: the data elements in the data list in the list relationship data are sorted.

In a possible implementation manner, the preprocessed data includes identifiers of node units and corresponding data elements, and the analysis module 32 is specifically configured to, when performing recursive comparison on the preprocessed data corresponding to the node map to be detected and the preprocessed data corresponding to the comparison node map, determine difference information: based on the identification of the node unit corresponding to the node graph to be detected and the corresponding data element, carrying out recursive difference comparison with the identification of the node unit corresponding to the comparison node graph and the corresponding data element, and determining a difference identification; and determining a difference node unit according to the difference identifier.

In a possible implementation manner, the parsing module 32 is specifically configured to, when performing recursive difference comparison based on the identifier of the node unit corresponding to the node map to be tested and the corresponding data element, and comparing the identifier of the node unit corresponding to the node map to be tested and the corresponding data element, and determining a difference identifier: according to the data elements of the node units corresponding to the node graph to be detected, comparing the data elements of the node units corresponding to the comparison node graph line by line, and determining the difference data elements and the paths of the difference data elements; and traversing to the nearest node unit from the upper level according to the difference data element and the path of the difference data element, and determining a difference identifier according to the identifier of the nearest node unit.

In one possible implementation, the parsing module 32 is further configured to: based on the identification of the node unit corresponding to the node graph to be tested and the corresponding data element, performing recursive difference comparison with the identification of the node unit corresponding to the comparison node graph and the corresponding data element, and determining the difference type.

In one possible implementation, the type of difference includes one of: the numerical value difference of the node units, the addition of the node units and the deletion of the node units.

In a possible implementation manner, the parsing module 32 is further configured to: and determining path information corresponding to the difference identifier, wherein the path information represents the path of the difference node unit in the node graph to be tested.

In a possible implementation manner, the parsing module 32 is further configured to: determining first difference data according to the difference information, wherein the first difference data are data representing the node structures of the difference node units in the preprocessed data; and restoring the first difference data to generate second difference data, wherein the second difference data is data in an XML format.

In a possible implementation manner, the display module 33 is specifically configured to: determining first difference data according to the difference information, wherein the first difference data are data representing the node structures of the difference node units in the preprocessed data; determining the type of the node unit according to the first difference data; and displaying the difference node units in the node graph to be tested in a corresponding display mode according to the node unit types.

In a possible implementation manner, when the display module 33 displays the difference node unit in the node map to be tested, the display module is specifically configured to: and displaying the content and the path of the difference node unit in the node graph to be tested.

In a possible implementation manner, when the display module 33 displays the content of the difference node unit in the node map to be tested, the display module is specifically configured to: restoring the first difference data to generate second difference data, wherein the second difference data is data in an XML format; and displaying the content of the difference node unit according to the second difference data.

In a possible implementation manner, the difference information includes a difference type, and the display module 33 is specifically configured to, when displaying the difference node unit in the node map to be tested according to the difference information: and displaying the difference node units in corresponding colors according to the difference types.

The obtaining module 31, the analyzing module 32 and the display module 33 are connected in sequence. The node map difference detecting apparatus 3 provided in this embodiment may execute the technical solutions of the method embodiments shown in fig. 2 to fig. 10, and the implementation principles and technical effects thereof are similar and will not be described herein again.

Fig. 12 is a schematic view of an electronic device according to an embodiment of the present application, and as shown in fig. 12, the electronic device according to the embodiment includes: a memory 41, a processor 42 and a computer program.

The computer program is stored in the memory 41 and configured to be executed by the processor 42 to implement the node map difference detection method provided in any one of the embodiments corresponding to fig. 2 to fig. 10 in the present application.

The memory 41 and the processor 42 are connected by a bus 43.

The relevant descriptions and effects corresponding to the steps in the embodiments corresponding to fig. 2 to fig. 10 can be understood, and are not described in detail herein.

An embodiment of the present application provides a computer-readable storage medium, on which a computer program is stored, where the computer program is executed by a processor to implement the node map difference detection method provided in any embodiment of the present application corresponding to fig. 2 to fig. 10.

The computer readable storage medium may be, among others, ROM, random Access Memory (RAM), CD-ROM, magnetic tape, floppy disk, optical data storage device, and the like.

An embodiment of the present application provides a computer program product comprising a computer program which, when executed by a processor, implements the first aspect and the various possible node map difference detection methods of the first aspect as described above.

In the several embodiments provided in the present application, it should be understood that the disclosed apparatus and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, a division of modules is merely a logical division, and other divisions may be realized in practice, for example, a plurality of modules or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or modules, and may be in an electrical, mechanical or other form.

Other embodiments of the present application will be apparent to those skilled in the art from consideration of the specification and practice of the application disclosed herein. This application is intended to cover any variations, uses, or adaptations of the invention following, in general, the principles of the application and including such departures from the present disclosure as come within known or customary practice within the art to which the invention pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the application being indicated by the following claims.

It will be understood that the present application is not limited to the precise arrangements that have been described above and shown in the drawings, and that various modifications and changes may be made without departing from the scope thereof. The scope of the application is limited only by the appended claims.

Claims

1. A node map difference detection method, comprising:

acquiring a node graph file to be tested, wherein the node graph file to be tested is used for generating a node graph to be tested comprising at least one node unit;

analyzing the node map file to be detected, and determining difference information, wherein the difference information represents a difference node unit of the node map to be detected relative to a preset comparison node map;

displaying the difference node unit in the node graph to be tested according to the difference information;

the node graph file to be tested is an XML file, the node graph file to be tested is analyzed, and difference information is determined, wherein the method comprises the following steps:

determining node relation data corresponding to the node graph to be tested based on the data structure of the XML file, wherein the node relation data are used for representing the logical relation among node units in the node graph to be tested;

carrying out format conversion on the node relation data corresponding to the node graph to be detected to generate preprocessed data corresponding to the node graph to be detected;

performing recursive comparison on the preprocessed data corresponding to the node graph to be tested and the preprocessed data corresponding to the comparison node graph, and determining difference information;

the preprocessing data includes key value relation data, the key value relation data includes key value pairs representing correspondence between identifiers of node units and data elements of the node units, format conversion is performed on the node relation data corresponding to the node graph to be detected, and preprocessing data corresponding to the node graph to be detected is generated, and the method includes:

performing key value conversion on the node relation data corresponding to the node graph to be detected to generate key value relation data corresponding to the node graph to be detected;

the preprocessing data comprises the identification of a node unit and a corresponding data element, the preprocessing data corresponding to the node graph to be detected and the preprocessing data corresponding to the comparison node graph are recursively compared, and difference information is determined, wherein the difference information comprises:

based on the identification of the node unit corresponding to the node graph to be tested and the corresponding data element, carrying out recursive difference comparison with the identification of the node unit corresponding to the comparison node graph and the corresponding data element, and determining a difference identification;

and determining a difference node unit according to the difference identifier.

2. The method according to claim 1, wherein before performing format conversion on the node relationship data corresponding to the node map to be tested, the method further comprises:

performing list conversion on the node relation data corresponding to the node graph to be detected to generate list relation data corresponding to the node graph to be detected, wherein the list relation data comprises a data list representing the corresponding relation between the identifier of the node unit and a plurality of data elements of the node unit;

carrying out format conversion on the node relation data corresponding to the node graph to be tested, wherein the format conversion comprises the following steps:

and performing key value conversion on the list relation data corresponding to the node graph to be tested to generate key value relation data corresponding to the node graph to be tested.

3. The method according to claim 2, wherein before performing key value conversion on the list relationship data corresponding to the node map to be tested, the method further comprises:

and sorting each data element in the data list in the list relation data.

4. The method according to claim 1, wherein performing recursive difference comparison based on the identifier of the node unit corresponding to the node map to be tested and the corresponding data element, and the identifier of the node unit corresponding to the comparison node map and the corresponding data element, and determining a difference identifier comprises:

according to the data elements of the node units corresponding to the node graph to be detected, comparing the data elements of the node units corresponding to the comparison node graph line by line, and determining difference data elements and paths of the difference data elements;

and traversing to the nearest node unit from the upper level according to the difference data element and the path of the difference data element, and determining a difference identifier according to the identifier of the nearest node unit.

5. The method of claim 1, further comprising:

based on the identification of the node unit corresponding to the node graph to be tested and the corresponding data element, carrying out recursive difference comparison with the identification of the node unit corresponding to the comparison node graph and the corresponding data element, and determining a difference type;

the type of difference comprises one of: the numerical difference of the node units, the addition of the node units and the deletion of the node units.

6. The method of claim 1, further comprising:

and determining path information corresponding to the difference identifier, wherein the path information represents the path of the difference node unit in the node graph to be tested.

7. The method of claim 1, further comprising:

determining first difference data according to the difference information, wherein the first difference data are data representing the node structure of the difference node unit in the preprocessed data;

and restoring the first difference data to generate second difference data, wherein the second difference data is data in an XML format.

8. The method according to any one of claims 2 to 7, wherein displaying the difference node unit in the node map to be tested according to the difference information comprises:

determining the type of a node unit according to the first difference data;

and displaying the difference node unit in the node graph to be tested in a corresponding display mode according to the type of the node unit.

9. The method according to claim 8, wherein displaying the difference node unit in the node map under test comprises:

and displaying the content and the path of the difference node unit in the node graph to be tested.

10. The method according to claim 9, wherein displaying the contents of the difference node unit in the node map under test comprises:

restoring the first difference data to generate second difference data, wherein the second difference data is data in an XML format;

and displaying the content of the difference node unit according to the second difference data.

11. The method according to claim 8, wherein the difference information includes a difference type, and displaying the difference node unit in the node map to be tested according to the difference information includes:

and displaying the difference node units in corresponding colors according to the difference types.

12. A node map difference detecting apparatus, comprising:

the node graph file to be tested is used for generating a node graph to be tested comprising at least one node unit;

the display module is used for displaying the difference node unit in the node graph to be tested according to the difference information;

the analysis module is specifically configured to: determining node relation data corresponding to the node graph to be tested based on the data structure of the XML file, wherein the node relation data is used for representing the logical relation among all node units in the node graph to be tested; carrying out format conversion on node relation data corresponding to the node graph to be detected to generate preprocessed data corresponding to the node graph to be detected; carrying out recursive comparison on the preprocessed data corresponding to the node graph to be tested and the preprocessed data corresponding to the comparison node graph, and determining difference information;

the preprocessing data comprises key value relation data, the key value relation data comprises key value pairs representing the corresponding relation between the identifiers of the node units and the data elements of the node units, and the analysis module is specifically used for performing key value conversion on the node relation data corresponding to the node diagram to be detected and generating the key value relation data corresponding to the node diagram to be detected when performing format conversion on the node relation data corresponding to the node diagram to be detected and generating the preprocessing data corresponding to the node diagram to be detected;

the analysis module is specifically used for carrying out recursive difference comparison on the identifier of the node unit corresponding to the node graph to be tested and the corresponding data element of the node unit corresponding to the comparison node graph based on the identifier of the node unit corresponding to the node graph to be tested and the corresponding data element, and determining a difference identifier; and determining a difference node unit according to the difference identifier.

13. An electronic device, comprising: a memory, a processor, and a computer program;

wherein the computer program is stored in the memory and configured to be executed by the processor to implement the node map difference detection method according to any one of claims 1 to 11.

14. A computer-readable storage medium having computer-executable instructions stored thereon, which when executed by a processor, are configured to implement the node map difference detection method according to any one of claims 1 to 11.