CN104834528A - Dependency version processing plug-in and dependency version processing method adopting same - Google Patents

Dependency version processing plug-in and dependency version processing method adopting same Download PDF

Info

Publication number
CN104834528A
CN104834528A CN201510268811.4A CN201510268811A CN104834528A CN 104834528 A CN104834528 A CN 104834528A CN 201510268811 A CN201510268811 A CN 201510268811A CN 104834528 A CN104834528 A CN 104834528A
Authority
CN
China
Prior art keywords
dependence
node
data structure
file
tree
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201510268811.4A
Other languages
Chinese (zh)
Other versions
CN104834528B (en
Inventor
孙庆超
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Jingdong Century Trading Co Ltd
Beijing Jingdong Shangke Information Technology Co Ltd
Original Assignee
Beijing Jingdong Century Trading Co Ltd
Beijing Jingdong Shangke Information Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing Jingdong Century Trading Co Ltd, Beijing Jingdong Shangke Information Technology Co Ltd filed Critical Beijing Jingdong Century Trading Co Ltd
Priority to CN201510268811.4A priority Critical patent/CN104834528B/en
Publication of CN104834528A publication Critical patent/CN104834528A/en
Application granted granted Critical
Publication of CN104834528B publication Critical patent/CN104834528B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Landscapes

  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
  • Stored Programmes (AREA)

Abstract

The invention discloses a dependency version processing plug-in and a dependency version processing method adopting the same. The dependency version processing plug-in comprises a basic information processing unit, a data structure building unit, a dependency logic processing unit and a file operating unit. The basic information processing unit is used for analyzing dependency in items and generating a tree file. The data structure building unit is used for defining a data structure and converting the tree file generated by the basic information processing unit into a tree data structure. The dependency logic processing unit is used for traversing the tree data structure generated by the data structure building unit, and marking nodes where repeated dependencies exist. The file operating unit is used for traversing the tree data structure generated by the data structure building unit again, and operating the marked nodes. According to the dependency version processing plug-in and method, the repeated dependencies in the items can be automatically removed, the item weight is reduced, and hidden dangers caused by dependency conflicts on items are reduced.

Description

Rely on version process plug-in unit and adopt its method that dependence version is processed
Technical field
The invention belongs to internet arena, particularly relate in a kind of project development and rely on version process plug-in unit and adopt its method that dependence version is processed.
Background technology
The project that present exploitation one is complete, the particularly larger Web application application program of open network web page access (a kind of can), needs during code development to introduce a large amount of jar bag (providing the bag of the Java Class file that can directly use).Because these jar bag is also in the more new stage, and different company may provide same jar bag, is therefore easy to generation problem in project uses.Such as: A company provides x-1.0.jar bag, is updated to x-1.1.jar afterwards.Introduce this two jar bags when project development because of various reasons simultaneously, following problem can be caused: 1. jar bag (x-1.0.jar) introducing redundancy; 2.x-1.1.jar with x-1.0.jar has compared a class file M and there occurs change, therefore uses in project when M and has two versions, be easy to make mistakes.
Maven is a kind of project management tool based on item objects model, can come the structure of management project, report and document by a bit of descriptor.
Intellij Idea is a kind of the integration environment of java language development, it is in the industry cycle acknowledged as one of best java developing instrument, especially in smart code assistant, code automatic-prompting and reconstruct, Java 2 Platform Enterprise Edition (J2EE) support, code inspection and graphic user interface (GUI) design etc., has powerful function.
In prior art, when project development, according to the dependent tree (dependency:tree) that maven provides, the dependence in project can be parsed.If but the project that huge, the dependence parsed is numerous, carry out repeating relying on that to get rid of operation as follows: need to retrieve certain jar in whole analysis result and wrap in those places and introduce dependence, then according to result for retrieval, review from level to level, and the statement position relied on is introduced in search in the project, then the eliminating of this dependence is carried out, if there are two places of repeating will by the operation of such as upper type once, if there are three places to repeat to operate twice, that is for a jar bag, if be repeated N time, then N-1 re-scheduling operation is needed.Visible this mode is lost time and manpower.Therefore, need exploitation plug-in unit, analysis result can be processed further, repeating in automatic eliminating project relies on.
Summary of the invention
(1) technical matters that will solve
The object of the present invention is to provide and a kind ofly rely on version process plug-in unit and adopt it to relying on the method that processes of version, rely on repeating in eliminating project automatically, alleviate the weight of project, reduction project is because rely on the hidden danger of conflicting and causing.
(2) technical scheme
The invention provides a kind of dependence version process plug-in unit, it runs on Intellij Idea, and this plug-in unit comprises:
Back ground Information processing unit, for the dependence in parsing project, generates tree file;
Data structure construction unit, for defining a data structure, changes into tree data structure by the tree file that Back ground Information processing unit generates;
Dependency logic processing unit, for the tree data structure that ergodic data structure construction unit generates, mark repeats the node relying on place; And
File operating unit, for the tree data structure of ergodic data structure construction unit generation again, and operates the node marked.
The present invention also provides a kind of and adopts the method relying on version process plug-in unit and process dependence version, and method comprises:
Step 1, the dependence in Back ground Information processing unit parsing project, generates tree file;
Step 2, data structure construction unit defines a data structure, and the tree file that Back ground Information processing unit generates is changed into tree data structure;
Step 3, the tree data structure that dependency logic processing unit ergodic data structure construction unit generates, mark repeats the node relying on place;
Step 4, file operating unit travels through this tree data structure again, and operates the node marked.
(3) beneficial effect
1. dependence version process plug-in unit provided by the invention and adopt it to relying on the method that processes of version, after parsing the dependence repeated in project, marked repeating dependence by dependency logic processing unit, then file operating unit is adopted the dependence that repeats of mark automatically to be deleted, wrap to get rid of bulk redundancy jar, so the size of a project greatly can be reduced.
2. prior art is after parsing the dependence repeated in project, manually can only carry out retrieval one by one in the project for the result parsed to get rid of, lose time and manpower, and the present invention is by data structure construction cell formation tree data structure, then this tree data structure is traveled through by dependency logic processing unit, mark and repeat to rely on, this tree data structure is again traveled through finally by file operating unit, repeat dependence operate marking, therefore automatically can get rid of repeating dependence, so reduce research staff to get rid of the time repeating to rely on cost.
3. owing to eliminating repeating dependence, the jar bag of redundancy would not be introduced, also can not use in the project when class file and have multiple version, so reduction project is because rely on the hidden danger of conflicting and causing.
Accompanying drawing explanation
Fig. 1 is the structural representation of dependence version process plug-in unit provided by the invention.
Fig. 2 is the method flow diagram processed dependence version provided by the invention.
Embodiment
For making the object, technical solutions and advantages of the present invention clearly understand, below in conjunction with specific embodiment, and with reference to accompanying drawing, the present invention is described in more detail.
Dependence version process plug-in unit provided by the invention, by data structure construction cell formation tree data structure, then this tree data structure is traveled through by dependency logic processing unit, mark and repeat to rely on, this tree data structure is again traveled through finally by file operating unit, repeat dependence operate marking, therefore automatically can get rid of repeating to rely on, wrap so bulk redundancy jar can be got rid of, greatly reduce the size of a project, also can not use in the project when class file and have multiple version, so reduction project is because rely on the hidden danger of conflicting and causing.
As shown in Figure 1, Fig. 1 is the structural representation of dependence version process plug-in unit of the present invention, and this dependence version process plug-in unit comprises Back ground Information processing unit 10, data structure construction unit 20, dependency logic processing unit 30 and file operating unit 40, wherein:
Back ground Information processing unit 10, for the dependent tree (dependency:tree) provided according to project management tool maven, parses the dependence in project, forms tree file.
Data structure construction unit 20 is for defining a data structure, and the tree file that Back ground Information processing unit generates is changed into tree data structure, wherein, each node in tree data structure at least comprises and relies on that statement file path, dependent file are organized unique identification (groupId), dependent file unique identifier (artifactId), relied on version (version), transitive dependency mark, relies on and can delete mark, rely on the abnormal mark of process and node type identifies.
The tree data structure that dependency logic processing unit 30 generates for ergodic data structure construction unit, mark repeats the node relying on place, wherein, when traveling through described tree data structure, whether the dependent file of dependency logic processing unit decision node organizes unique identification consistent with dependent file unique identifier, if inconsistent, then the dependence of this node can be deleted mark and be set to Yes; If consistent, then whether the dependence version of decision node is most highest version further, if not most highest version, then the dependence of this node can be deleted mark and be set to Yes; If most highest version, then judge whether most highest version is snapshot (snapshot), if so, then the dependence of this node can be deleted mark and be set to Yes further; If not, then retain this node.
File operating unit 40 is for again traveling through tree data structure, the dependence obtaining node can delete mark, judge whether the setting that described dependence can delete mark is Yes, if so, the type of this node is then judged by described node type mark, if the type of this node is root node, then delete this root node, if the type of this node is child node, then find the root node of this child node, and rely on eliminating label in the write of this root node place.
In addition, conveniently user checks related dependant process information, dependence version process plug-in unit provided by the invention also comprises auxiliary unit 50, auxiliary unit 50 relies on process file for generating, and this dependence process file at least comprises the details, dependence process information and the dependence manual handle mark that repeat to rely on.
Dependence version process plug-in unit provided by the invention, after parsing the dependence repeated in project, marked repeating dependence by dependency logic processing unit, then file operating unit is adopted the dependence that repeats of mark automatically to be deleted, wrap to get rid of bulk redundancy jar, so the size of a project greatly can be reduced, prior art is after parsing the dependence repeated in project, manually can only carry out retrieval one by one in the project for the result parsed to get rid of, lose time and manpower, and the present invention is by data structure construction cell formation tree data structure, then this tree data structure is traveled through by dependency logic processing unit, mark and repeat to rely on, this tree data structure is again traveled through finally by file operating unit, repeat dependence operate marking, therefore automatically can get rid of repeating dependence, so reduce research staff to get rid of the time repeating to rely on cost, owing to eliminating repeating dependence, the jar bag of redundancy would not be introduced, also can not use in the project when class file and have multiple version, so reduction project is because rely on the hidden danger of conflicting and causing.
Based on the dependence version process plug-in unit shown in Fig. 1, the present invention also provides a kind of method adopting this plug-in unit to carry out relying on version management, and as shown in Figure 2, the method comprises:
Step 1, the dependence in Back ground Information processing unit parsing project, generates tree file;
Step 2, data structure construction unit defines a data structure, and the tree file that Back ground Information processing unit generates is changed into tree data structure;
Step 3, the tree data structure that dependency logic processing unit ergodic data structure construction unit generates, mark repeats the node relying on place;
Step 4, file operating unit travels through this tree data structure again, and operates the node marked.
The present invention is by data structure construction cell formation tree data structure, then this tree data structure is traveled through by dependency logic processing unit, mark and repeat to rely on, this tree data structure is again traveled through finally by file operating unit, repeat dependence operate marking, therefore automatically can get rid of repeating to rely on, wrap so bulk redundancy jar can be got rid of, greatly reduce the size of a project, also can not use in the project when class file and have multiple version, so reduction project is because rely on the hidden danger of conflicting and causing.
Dependence method for edition management according to Fig. 2, in conjunction with specific embodiments, this dependence method for edition management comprises:
S1, the dependent tree (dependency:tree) that Back ground Information processing unit provides according to project management tool maven, parses the dependence in project, generates tree file;
S2, data structure construction unit defines a data structure, and the tree file that Back ground Information processing unit generates is changed into tree data structure, wherein, each node in tree data structure at least comprises and relies on that statement file path, dependent file are organized unique identification (groupId), dependent file unique identifier (artifactId), relied on version (version), transitive dependency mark, relies on and can delete mark, rely on the abnormal mark of process and node type identifies;
S3, the tree data structure that dependency logic processing unit ergodic data structure construction unit generates, mark repeats the node relying on place, wherein, when traveling through described tree data structure, whether the dependent file of dependency logic processing unit decision node organizes unique identification consistent with dependent file unique identifier, if inconsistent, then the dependence of this node can be deleted mark and be set to Yes; If consistent, then whether the dependence version of decision node is most highest version further, if not most highest version, then the dependence of this node can be deleted mark and be set to Yes; If most highest version, then judge whether most highest version is snapshot (snapshot), if so, then the dependence of this node can be deleted mark and be set to Yes further; If not, then retain this node;
S4, file operating unit travels through tree data structure again, obtain the dependence of node and can delete mark, judge whether the setting that described dependence can delete mark is Yes, if, the type of this node is then judged by described node type mark, if the type of this node is root node, then delete this root node, if the type of this node is child node, then find the root node of this child node, and rely on eliminating label in the write of this root node place.
In addition, conveniently user checks related dependant process information, dependence version disposal route provided by the invention also comprises S5 after step s4, rely on process file by auxiliary unit generation, this dependence process file at least comprises the details, dependence process information and the dependence manual handle mark that repeat to rely on.
Dependence version disposal route provided by the invention, after parsing the dependence repeated in project, marked repeating dependence by dependency logic processing unit, then file operating unit is adopted the dependence that repeats of mark automatically to be deleted, wrap to get rid of bulk redundancy jar, so the size of a project greatly can be reduced, prior art is after parsing the dependence repeated in project, manually can only carry out retrieval one by one in the project for the result parsed to get rid of, lose time and manpower, and the present invention is by data structure construction cell formation tree data structure, then this tree data structure is traveled through by dependency logic processing unit, mark and repeat to rely on, this tree data structure is again traveled through finally by file operating unit, repeat dependence operate marking, therefore automatically can get rid of repeating dependence, so reduce research staff to get rid of the time repeating to rely on cost, owing to eliminating repeating dependence, the jar bag of redundancy would not be introduced, also can not use in the project when class file and have multiple version, so reduction project is because rely on the hidden danger of conflicting and causing.
Above-described specific embodiment; object of the present invention, technical scheme and beneficial effect are further described; be understood that; the foregoing is only specific embodiments of the invention; be not limited to the present invention; within the spirit and principles in the present invention all, any amendment made, equivalent replacement, improvement etc., all should be included within protection scope of the present invention.

Claims (14)

1. rely on a version process plug-in unit, it runs on Intellij Idea, it is characterized in that, this plug-in unit comprises:
Back ground Information processing unit, for the dependence in parsing project, generates tree file;
Data structure construction unit, for defining a data structure, changes into tree data structure by the tree file that Back ground Information processing unit generates;
Dependency logic processing unit, for the tree data structure that ergodic data structure construction unit generates, mark repeats the node relying on place; And
File operating unit, for the tree data structure of ergodic data structure construction unit generation again, and operates the node marked.
2. plug-in unit according to claim 1, is characterized in that, the dependent tree dependency:tree that described Back ground Information processing unit provides according to project management tool maven, parses the dependence in project, generates tree file.
3. plug-in unit according to claim 1, each node in described tree data structure at least comprises dependence statement file path, dependent file organizes unique identification groupId, dependent file unique identifier artifactId, dependence version version, transitive dependency identify, dependence can delete mark, dependence process identifies extremely and node type identifies.
4. plug-in unit according to claim 3, described dependency logic processing unit occurs abnormal when traveling through described tree data structure, then arrange described dependence process and be extremely designated Yes.
5. plug-in unit according to claim 3, described dependency logic processing unit travels through described tree data structure, specifically comprises:
Whether the dependent file of dependency logic processing unit decision node organizes unique identification consistent with dependent file unique identifier, if inconsistent, then the dependence of this node can be deleted mark and be set to Yes; If consistent, then whether the dependence version of decision node is most highest version further, if not most highest version, then the dependence of this node can be deleted mark and be set to Yes; If most highest version, then judge whether most highest version is snapshot snapshot, if so, then the dependence of this node can be deleted mark and be set to Yes further; If not, then retain this node.
6. plug-in unit according to claim 5, described file operating unit travels through described tree data structure, specifically comprises:
The dependence that file operating unit obtains node can delete mark, judge whether the setting that described dependence can delete mark is Yes, if, the type of this node is then judged by described node type mark, if the type of this node is root node, then delete this root node, if the type of this node is child node, then find the root node of this child node, and rely on eliminating label in the write of this root node place.
7. plug-in unit according to claim 1, is characterized in that, this plug-in unit also comprises auxiliary unit, relies on process file for generating, and this dependence process file at least comprises the details, dependence process information and the dependence manual handle mark that repeat to rely on.
8. adopt the method that the plug-in unit according to any one of claim 1-7 processes dependence version, the method comprises:
Step 1, the dependence in Back ground Information processing unit parsing project, generates tree file;
Step 2, data structure construction unit defines a data structure, and the tree file that Back ground Information processing unit generates is changed into tree data structure;
Step 3, the tree data structure that dependency logic processing unit ergodic data structure construction unit generates, mark repeats the node relying on place;
Step 4, file operating unit travels through this tree data structure again, and operates the node marked.
9. method according to claim 8, is characterized in that, in described step 1, the dependent tree dependency:tree that described Back ground Information processing unit provides according to project management tool maven, parses the dependence in project, generates tree file.
10. method according to claim 8, it is characterized in that, in described step 2, tree data structure at least comprises dependence statement file path, dependent file organizes unique identification groupId, dependent file unique identifier artifactId, dependence version version, transitive dependency identify, dependence can delete mark, dependence process identifies extremely and node type identifies.
11. methods according to claim 10, described dependency logic processing unit occurs abnormal when traveling through described tree data structure, then arrange described dependence process and be extremely designated Yes.
12. methods according to claim 10, it is characterized in that, described step 3 comprises: whether the dependent file of dependency logic processing unit decision node organizes unique identification consistent with dependent file unique identifier, if inconsistent, then the dependence of this node can be deleted mark and be set to Yes; If consistent, then whether the dependence version of decision node is most highest version further, if not most highest version, then just the dependence of this node can be deleted mark and is set to Yes; If most highest version, then judge whether most highest version is snapshot snapshot, if so, then the dependence of this node can be deleted mark and be set to Yes further; If not, then retain this node.
13. methods according to claim 12, it is characterized in that, described step 4 comprises: file operating unit obtains the dependence of node can delete mark, judges whether the setting that described dependence can delete mark is Yes, if, the type of this node is then judged by described node type mark, if the type of this node is root node, then delete this root node, if the type of this node is child node, then find the root node of this child node, and rely on eliminating label in the write of this root node place.
14. methods according to claim 8, is characterized in that, after described step 4, also comprise:
Step 5, auxiliary unit generation relies on process file, and this dependence process file at least comprises the details, dependence process information and the dependence manual handle mark that repeat to rely on.
CN201510268811.4A 2015-05-25 2015-05-25 Rely on version processing plug-in unit and the method handled using it relying on version Active CN104834528B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201510268811.4A CN104834528B (en) 2015-05-25 2015-05-25 Rely on version processing plug-in unit and the method handled using it relying on version

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201510268811.4A CN104834528B (en) 2015-05-25 2015-05-25 Rely on version processing plug-in unit and the method handled using it relying on version

Publications (2)

Publication Number Publication Date
CN104834528A true CN104834528A (en) 2015-08-12
CN104834528B CN104834528B (en) 2018-06-22

Family

ID=53812438

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201510268811.4A Active CN104834528B (en) 2015-05-25 2015-05-25 Rely on version processing plug-in unit and the method handled using it relying on version

Country Status (1)

Country Link
CN (1) CN104834528B (en)

Cited By (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105893013A (en) * 2015-12-07 2016-08-24 乐视云计算有限公司 Engineering construction system and construction method thereof
CN106777299A (en) * 2016-12-30 2017-05-31 深圳市彬讯科技有限公司 The project dependence solution of operation management instrument and static data warehouse
CN106874060A (en) * 2017-01-16 2017-06-20 上海斐讯数据通信技术有限公司 It is a kind of to judge the method and apparatus whether JAR bags are cited
CN106874184A (en) * 2016-12-21 2017-06-20 阿里巴巴集团控股有限公司 A kind of Java code detection method and device
CN108228229A (en) * 2016-12-19 2018-06-29 深圳业拓讯通信科技有限公司 The management method and system that a kind of Maven is relied on
CN108334334A (en) * 2018-03-07 2018-07-27 政采云有限公司 A kind of management relies on the method and system of packet version
CN108628751A (en) * 2018-05-17 2018-10-09 北京三快在线科技有限公司 A kind of useless dependence item detection method and device
CN108965295A (en) * 2018-07-17 2018-12-07 郑州云海信息技术有限公司 A kind of compressing file merging method and relevant apparatus
CN109992296A (en) * 2019-02-14 2019-07-09 平安科技(深圳)有限公司 The method, apparatus and system of multiple configuration files in one engineering of synchronous vacations
CN110442376A (en) * 2019-07-19 2019-11-12 精硕科技(北京)股份有限公司 A kind of method and device for realizing Software package
CN110825377A (en) * 2018-08-07 2020-02-21 北京国双科技有限公司 Dependency conflict analysis method and device
CN111241551A (en) * 2019-09-19 2020-06-05 中国科学院信息工程研究所 Processor chip false safety dependence conflict identification method based on cache hit state
CN112181858A (en) * 2020-11-09 2021-01-05 东北大学 Automatic detection method for Java software project dependent conflict semantic consistency
CN112817613A (en) * 2021-02-04 2021-05-18 咪咕音乐有限公司 Plug-in data deleting method, server, electronic equipment and storage medium
CN112947896A (en) * 2021-03-26 2021-06-11 中国航空无线电电子研究所 Directed graph-based component dependence analysis method
CN116541307A (en) * 2023-06-29 2023-08-04 云筑信息科技(成都)有限公司 Data processing method for comparing pom versions

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100281488A1 (en) * 2009-04-30 2010-11-04 Anand Krishnamurthy Detecting non-redundant component dependencies in web service invocations
CN103473400A (en) * 2013-08-27 2013-12-25 北京航空航天大学 Software FMEA (failure mode and effects analysis) method based on level dependency modeling

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100281488A1 (en) * 2009-04-30 2010-11-04 Anand Krishnamurthy Detecting non-redundant component dependencies in web service invocations
CN103473400A (en) * 2013-08-27 2013-12-25 北京航空航天大学 Software FMEA (failure mode and effects analysis) method based on level dependency modeling

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
TOBATO: "《Node Modules 依赖优化处理》", 《HTTP://TOBATO.ITEYE.COM/BLOG/2077491》 *
WWW.MYEXCEPTION.CN: "《IntelliJ IDEA查寻依赖关系,解决jar包冲突》", 《HTTP://WWW.MYEXCEPTION.CN/OPEN-SOURCE/1497379.HTML》 *

Cited By (24)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105893013A (en) * 2015-12-07 2016-08-24 乐视云计算有限公司 Engineering construction system and construction method thereof
CN108228229A (en) * 2016-12-19 2018-06-29 深圳业拓讯通信科技有限公司 The management method and system that a kind of Maven is relied on
CN106874184B (en) * 2016-12-21 2020-07-14 阿里巴巴集团控股有限公司 Java code detection method and device
CN106874184A (en) * 2016-12-21 2017-06-20 阿里巴巴集团控股有限公司 A kind of Java code detection method and device
CN106777299A (en) * 2016-12-30 2017-05-31 深圳市彬讯科技有限公司 The project dependence solution of operation management instrument and static data warehouse
CN106777299B (en) * 2016-12-30 2020-10-09 深圳市彬讯科技有限公司 Project dependency relationship solution method using management tool and static data warehouse
CN106874060A (en) * 2017-01-16 2017-06-20 上海斐讯数据通信技术有限公司 It is a kind of to judge the method and apparatus whether JAR bags are cited
CN106874060B (en) * 2017-01-16 2020-12-18 吴建伟 Method and equipment for judging whether JAR package is quoted
CN108334334A (en) * 2018-03-07 2018-07-27 政采云有限公司 A kind of management relies on the method and system of packet version
CN108334334B (en) * 2018-03-07 2022-02-01 政采云有限公司 Method and system for managing dependent package version
CN108628751A (en) * 2018-05-17 2018-10-09 北京三快在线科技有限公司 A kind of useless dependence item detection method and device
CN108628751B (en) * 2018-05-17 2021-06-11 北京三快在线科技有限公司 Useless dependency item detection method and device
CN108965295A (en) * 2018-07-17 2018-12-07 郑州云海信息技术有限公司 A kind of compressing file merging method and relevant apparatus
CN108965295B (en) * 2018-07-17 2021-09-17 郑州云海信息技术有限公司 File compression and combination method and related device
CN110825377A (en) * 2018-08-07 2020-02-21 北京国双科技有限公司 Dependency conflict analysis method and device
CN109992296A (en) * 2019-02-14 2019-07-09 平安科技(深圳)有限公司 The method, apparatus and system of multiple configuration files in one engineering of synchronous vacations
CN109992296B (en) * 2019-02-14 2023-10-17 平安科技(深圳)有限公司 Method, device and system for synchronously modifying multiple configuration files in one project
CN110442376A (en) * 2019-07-19 2019-11-12 精硕科技(北京)股份有限公司 A kind of method and device for realizing Software package
CN111241551A (en) * 2019-09-19 2020-06-05 中国科学院信息工程研究所 Processor chip false safety dependence conflict identification method based on cache hit state
CN112181858A (en) * 2020-11-09 2021-01-05 东北大学 Automatic detection method for Java software project dependent conflict semantic consistency
CN112817613A (en) * 2021-02-04 2021-05-18 咪咕音乐有限公司 Plug-in data deleting method, server, electronic equipment and storage medium
CN112947896A (en) * 2021-03-26 2021-06-11 中国航空无线电电子研究所 Directed graph-based component dependence analysis method
CN112947896B (en) * 2021-03-26 2023-10-27 中国航空无线电电子研究所 Directed graph-based component dependency analysis method
CN116541307A (en) * 2023-06-29 2023-08-04 云筑信息科技(成都)有限公司 Data processing method for comparing pom versions

Also Published As

Publication number Publication date
CN104834528B (en) 2018-06-22

Similar Documents

Publication Publication Date Title
CN104834528A (en) Dependency version processing plug-in and dependency version processing method adopting same
CN106104533B (en) Handle the data set in large data repository
Dumas et al. Fast detection of exact clones in business process model repositories
US9122540B2 (en) Transformation of computer programs and eliminating errors
CN102609449B (en) Method for building conceptual knowledge map based on Wikipedia
Tang et al. Software architecture documentation: The road ahead
Wu et al. Exploiting attributed type graphs to generate metamodel instances using an SMT solver
KR101617696B1 (en) Method and device for mining data regular expression
CN102760058B (en) Massive software project sharing method oriented to large-scale collaborative development
US20150032743A1 (en) Analyzing files using big data tools
US9442718B1 (en) System for assisting in locating changes in source code version control system
CN102662825B (en) Method for detecting memory leakage of heap operational program
Kolovos et al. Assessing the Use of Eclipse MDE Technologies in Open-Source Software Projects.
Smajevic et al. From conceptual models to knowledge graphs: a generic model transformation platform
US20140282396A1 (en) Computerized system and method for extracting business rules from source code
CN100561471C (en) Data base automatic operation method based on web service
CN110598417B (en) Software vulnerability detection method based on graph mining
US8627202B2 (en) Update and serialization of XML documents
CN106599241A (en) Big data visual management method for GIS software
KR101985309B1 (en) Method of creating the balanced parse tree having optimized height
Dabhade et al. A systematic review of software reuse using domain engineering paradigms
Nair et al. Improvised Apriori with frequent subgraph tree for extracting frequent subgraphs
CN110019252A (en) The method, apparatus and electronic equipment of information processing
Chen et al. A fast algorithm for finding K shortest paths using generalized spur path reuse technique
Herzig et al. Classifying code changes and predicting defects using changegenealogies

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
EXSB Decision made by sipo to initiate substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant