System and method to compare modules for the common code, remove the redundancy and run the unique workflows
AssigneeDell Products L.P.
InventorsVeenu Gupta, Abhilash Mukesh
Life of this patent
Estimating the term…
Abstract
One example method includes receiving a code request, parsing code associated with the code request, storing, in a staging database, a portion of the code, traversing a codebase to identify any code in the codebase that matches the portion of the code, and when code is found in the codebase that matches the portion of the code, incrementing a green count and pushing the portion of the code to a redundant code bin, and when no code is found in the codebase that matches the portion of the code, incrementing a red counter and updating the codebase to include the portion of the code.
Claims20
A method, comprising:
- receiving a code request;
- parsing code associated with the code request;
- performing preprocessing on the parsed code, wherein the pre-processing removes comments from the parsed code;
- normalizing a portion of the parsed code;
- storing, in a staging database, the portion;
- traversing a codebase to identify any code in the codebase that matches the portion;
- and
- when code is found in the codebase that matches the portion, incrementing a green count and pushing the portion to a redundant code bin, and when no code is found in the codebase that matches the portion, incrementing a red counter and updating the codebase to include the portion.
A non-transitory storage medium having stored therein instructions that are executable by one or more hardware processors to perform operations comprising:
- receiving a code request;
- parsing code associated with the code request;
- performing preprocessing on the parsed code, wherein the pre-processing removes comments from the parsed code;
- normalizing a portion of the parsed code;
- storing, in a staging database, the portion;
- traversing a codebase to identify any code in the codebase that matches the portion;
- and
- when code is found in the codebase that matches the portion, incrementing a green count and pushing the portion to a redundant code bin, and when no code is found in the codebase that matches the portion, incrementing a red counter and updating the codebase to include the portion.
Dependencies are inferred from the claim text.