CN117931248B - Method and device for improving deployment efficiency of boulder application - Google Patents

Method and device for improving deployment efficiency of boulder application Download PDF

Info

Publication number
CN117931248B
CN117931248B CN202410342377.9A CN202410342377A CN117931248B CN 117931248 B CN117931248 B CN 117931248B CN 202410342377 A CN202410342377 A CN 202410342377A CN 117931248 B CN117931248 B CN 117931248B
Authority
CN
China
Prior art keywords
routing
file
route
data
application
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.)
Active
Application number
CN202410342377.9A
Other languages
Chinese (zh)
Other versions
CN117931248A (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.)
Hangzhou Feizhu Technology Co ltd
Original Assignee
Hangzhou Feizhu 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 Hangzhou Feizhu Technology Co ltd filed Critical Hangzhou Feizhu Technology Co ltd
Priority to CN202410342377.9A priority Critical patent/CN117931248B/en
Publication of CN117931248A publication Critical patent/CN117931248A/en
Application granted granted Critical
Publication of CN117931248B publication Critical patent/CN117931248B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Landscapes

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

Abstract

The application provides a method and a device for improving deployment efficiency of a boulder application, comprising the following steps: setting a unique route key word for each route file in the megaphone application, acquiring the pv data of each route file and constructing a query interface; inserting a replacement plug-in webpack configuration files, and defining a keyword traversing method, a pv data query method and a replacement method in the replacement plug-in; and executing webpack based on webpack configuration files to obtain a high-frequency routing file set, and packaging and deploying routing files in the high-frequency routing file set, wherein the high-frequency routing file set is a set of routing files after pv data are removed by the replacement plug-in unit and do not accord with a set replacement rule. The scheme can eliminate old routing files without large migration, and the slimming of the boulder application is completed on the premise of not changing the original development, debugging and deployment flow.

Description

Method and device for improving deployment efficiency of boulder application
Technical Field
The application relates to the field of software slimming, in particular to a method and a device for improving deployment efficiency of a boulder application.
Background
The boulder application is generally an application which is iterated continuously, online business runs for more than 3 years, common applications can be accumulated along with the business continuously and need to be compatible with historical business activities, so that the business is slowly accumulated into the boulder application, a large number of history items exist in the boulder application, the history items occupy a large amount of storage space, so that a great deal of time is consumed in application deployment, and a great deal of interested users can check the history items, so that the application cannot be thinned in a total deletion mode.
Various schemes for treating the boulder application exist in the market, such as migration of the boulder application to a micro front end, or management of components or source codes of the boulder application by using muti repo, monorepo, module federation and other methods, so as to achieve the purpose of slimming, but because of the development cost and the learning cost of the micro front end are too high, and because of the large volume of the boulder application, the migration cost is high, muti repo is difficult to manage and debug, the branch management is disordered, the team cooperation is not facilitated, the codes cannot be reused, the monorepo warehouse is large in size, and is not suitable for automatic release, and the module federation development needs to open a plurality of port services, and the maintenance cost of a sharing package is high.
Therefore, a method for reducing the weight and realizing automatic deployment of the boulder application with convenient management and low cost is needed.
Disclosure of Invention
The embodiment of the application provides a method and a device for improving deployment efficiency of a boulder application, which are used for reducing the weight of the boulder application at low cost by adding a route keyword and selectively deleting a route file based on pv data of each route file, so that the deployment efficiency is improved.
In a first aspect, an embodiment of the present application provides a method for improving deployment efficiency of a boulder application, where the method includes:
setting a unique route key word for each route file in the megaphone application, acquiring the pv data of each route file and constructing a query interface;
Inserting a replacement plug-in into webpack configuration files, defining a keyword traversing method, a pv data inquiring method and a replacement method in the replacement plug-in, wherein the keyword traversing method is used for defining a method for traversing routing keywords of each routing file, the pv data inquiring method is used for defining a method for acquiring pv data of each routing file through an inquiring interface based on each routing keyword, and the replacement method is used for defining a method for removing routing files with pv data which do not accord with a set replacement rule;
And executing webpack based on webpack configuration files to obtain a high-frequency routing file set, and packaging and deploying routing files in the high-frequency routing file set, wherein the high-frequency routing file set is a set of routing files after pv data are removed by the replacement plug-in unit and do not accord with a set replacement rule.
In a second aspect, an embodiment of the present application provides a device for improving deployment efficiency of a boulder application, including:
the setting module is used for adding a unique route keyword for each route file in the megastone application, constructing a query interface based on the route keywords, and acquiring pv data corresponding to each route file based on the route keywords by the query interface;
The replacing module is used for writing replacing plug-in components, the replacing plug-in components are used for traversing each route file, and removing the route files with the pv data of 0 in the megastone application based on the query interface to obtain a high-frequency route file set;
And the deployment module is used for inserting the replacement plug-in into the webpack configuration file, and packaging and deploying the routing files in the high-frequency routing file set by using webpack.
In a third aspect, an embodiment of the application provides an electronic device comprising a memory having a computer program stored therein and a processor configured to run the computer program to provide a method of improving efficiency of deployment of a boulder application.
In a fourth aspect, embodiments of the present application provide a readable storage medium having a computer program stored therein, the computer program comprising program code for controlling a process to execute a process, the process comprising a method of improving efficiency of deployment of a boulder application.
The main contributions and innovation points of the invention are as follows:
According to the embodiment of the application, unique keywords are added for each route file, the route information of each route file is reported by monitoring the embedded points so as to obtain the pv data of each route file, and then the old and inaccessible route files are eliminated and replaced by the pv data, so that the slimming of the boulder application is completed on the premise of not carrying out complex migration and change on the original project; according to the scheme, the megalithic application can be thinned without learning other technologies, so that the learning cost and the development cost of related technicians are greatly reduced, and the deployment efficiency can be improved without any change to the original development, debugging and deployment flow.
The details of one or more embodiments of the application are set forth in the accompanying drawings and the description below to provide a more thorough understanding of the other features, objects, and advantages of the application.
Drawings
The accompanying drawings, which are included to provide a further understanding of the application and are incorporated in and constitute a part of this specification, illustrate embodiments of the application and together with the description serve to explain the application and do not constitute a limitation on the application. In the drawings:
FIG. 1 is a flow chart of a method of improving efficiency of deployment of a boulder application, in accordance with an embodiment of the present application;
FIG. 2 is a logic diagram of a method of improving deployment efficiency of a boulder application, in accordance with an embodiment of the present application;
FIG. 3 is a code schematic for adding routing keywords to a routing file in a boulder application, according to one embodiment of the present application;
FIG. 4 is a schematic diagram of a code for burying points in each route file according to an embodiment of the present application;
FIG. 5 is a schematic diagram of a code for removing a routing file whose pv data does not conform to a set replacement rule by a replacement method in a replacement plug-in unit according to an embodiment of the present application;
FIG. 6 is a code schematic diagram of a high frequency routing file set obtained by webpack based on webpack profile execution in an embodiment of the present application;
FIG. 7 is a schematic view of a weight loss for a boulder application in accordance with an embodiment of the present application;
FIG. 8 is a schematic diagram of weight reduction with continuous replacement based on pv data of a routing file according to an embodiment of the present application;
FIG. 9 is a block diagram of an apparatus for improving deployment efficiency of a boulder application, in accordance with an embodiment of the present application;
Fig. 10 is a schematic diagram of a hardware structure of an electronic device according to an embodiment of the present application.
Detailed Description
Reference will now be made in detail to exemplary embodiments, examples of which are illustrated in the accompanying drawings. When the following description refers to the accompanying drawings, the same numbers in different drawings refer to the same or similar elements, unless otherwise indicated. The implementations described in the following exemplary embodiments do not represent all implementations consistent with one or more embodiments of the present specification. Rather, they are merely examples of apparatus and methods consistent with aspects of one or more embodiments of the present description as detailed in the accompanying claims.
It should be noted that: in other embodiments, the steps of the corresponding method are not necessarily performed in the order shown and described in this specification. In some other embodiments, the method may include more or fewer steps than described in this specification. Furthermore, individual steps described in this specification, in other embodiments, may be described as being split into multiple steps; while various steps described in this specification may be combined into a single step in other embodiments.
Example 1
The embodiment of the application provides a method for improving deployment efficiency of a boulder application, which can reduce the weight of the boulder application at low cost, thereby improving the deployment efficiency, and concretely referring to fig. 1 and 2, the method comprises the following steps:
setting a unique route key word for each route file in the megaphone application, acquiring the pv data of each route file and constructing a query interface;
Inserting a replacement plug-in into webpack configuration files, defining a keyword traversing method, a pv data inquiring method and a replacement method in the replacement plug-in, wherein the keyword traversing method is used for defining a method for traversing routing keywords of each routing file, the pv data inquiring method is used for defining a method for acquiring pv data of each routing file through an inquiring interface based on each routing keyword, and the replacement method is used for defining a method for removing routing files with pv data which do not accord with a set replacement rule;
And executing webpack based on webpack configuration files to obtain a high-frequency routing file set, and packaging and deploying routing files in the high-frequency routing file set, wherein the high-frequency routing file set is a set of routing files after pv data are removed by the replacement plug-in unit and do not accord with a set replacement rule.
In this scheme, the routing file is used to read the content of each item in the boulder application, and each routing file corresponds to at least one item in the boulder application. That is, each time a user accesses an item in a boulder application, the content of the item in url is read by skipping through a corresponding routing file, which is typically a js file, such as router.
In this scheme, the pv data is page browsing data, where the pv data records the number of times the user accesses to the project in the boulder application. That is, the pv data is an important index for measuring the traffic of websites or applications, and is used for recording the number of times the user accesses to the items in the boulder application.
In the step of setting a unique routing key for each routing file in a boulder application, a unique routing key is added to the configuration information of each routing file.
In some embodiments, a code representation of adding a routing key to a routing file in a boulder application is shown in fig. 3, where a routing configuration array of the boulder application is obtained through RouterFactory, configuration information of each routing file is obtained based on positioning in the routing configuration array, and a unique routing key is set in the corresponding configuration information.
In the step of acquiring the pv data of each route file, embedding points on each route file to monitor the loading information of each route file so as to obtain the pv data of each route file, acquiring a route keyword of each route file, and sending the pv data of each route file and the corresponding route keyword to a data processing center, wherein the data processing center updates the pv data of the corresponding route file based on the route keyword.
In this scheme, the code representation of burying the point for each route file is shown in fig. 4, and the code can know that the scheme acquires the pv data of each route file by monitoring the loading information of each route file in the page.
In this scheme, the data processing center may be a custom data warehouse, or may be existing Google analysis, or the like.
Specifically, the scheme obtains the pv data corresponding to each route file by identifying the route keywords, so that the service condition of each route file is accurately obtained, namely, the service conditions of different projects are obtained.
In the scheme, the updating mode of the data processing center can be defined according to actual conditions, such as real-time updating when the routing file is loaded each time, or periodic (daily, hourly and the like) updating, the real-time updating can provide more timely data feedback, and the periodic updating can reduce the load of a database or an analysis system.
In this scheme, the query interface is configured to obtain pv data of each route file through a route key, and obtain, through a time key, loading time of each route file when each route file is loaded.
In the scheme, the keyword traversal method obtains the routing keywords of each routing file by matching the routing array in the boulder application with the regular expression, wherein the routing array comprises all the routing files in the boulder application.
In the scheme, the pv data query method returns the pv data of each route file by inputting the obtained route keywords to the query interface.
Specifically, the route loading time query method returns the loading time of each route file when each route file is loaded by inputting a time keyword into a query interface.
In some embodiments, the time key may be input into the query interface simultaneously with any one of the routing keys, so as to return the loading time of the corresponding routing file at each loading.
In some embodiments, the replacement method is: and removing the routing file with the pv data not conforming to the set replacement rule by using the filter function, wherein the set replacement rule is that the pv data of the routing file is larger than a first threshold value or the pv data of the routing file is larger than the first threshold value in a set time period.
Specifically, if the set replacement rule in the scheme is that pv data of the routing file in a set time period is greater than a first threshold, defining a routing loading time query method in the replacement plug-in, wherein the routing loading time query method obtains loading time of each routing file in each loading process through a query interface based on a time keyword;
That is, when the set replacement rule in the present solution is that the pv data of the routing file in the set time period is greater than the first threshold, whether each routing file meets the set replacement rule is determined by a pv data query method and a routing loading time query method, and when the set replacement rule in the present solution is that the pv data of the routing file is greater than the first threshold, it is only required to determine whether each routing file meets the set replacement rule by a pv data query method.
In some embodiments, the set replacement rule in the present solution is that pv data within 3 months is greater than 0.
In this scheme, in order to better access and modify the routing array and better parse the routing array, "use the filter function to remove the routing file whose pv data does not meet the set replacement rule" includes:
Step 1: converting the source code of the routing array into a JavaScript format by using an eval function;
Step 2: the filter function removes the routing file which does not accord with the set jigging rule in the routing array in the JavaScript format;
Step 3: and converting the route files in the remaining JavaScript format from the JavaScript format back to the source code.
Specifically, the scheme removes old and inaccessible user routes through the filter function, and does not carry out complex migration and change on original projects.
In this scheme, the code of the routing file whose pv data does not conform to the set replacement rule is removed by the replacement method in the replacement plug-in is shown in fig. 5.
In this scenario, the code representation of "acquire high frequency routing file set based on webpack profile execution webpack" is shown in fig. 6, which code representation points to the correct replacement plug-in path in webpack profile to insert the replacement plug-in into webpack profile for execution.
In some embodiments, the routing files in 70% of the boulder application are eliminated by the method, so that the packing volume is reduced by 70% compared with the original packing volume, the corresponding packing speed is improved by 70%, and the deployment speed is also improved, so that the slimming of the boulder application is completed, and a slimming schematic diagram of the boulder application is shown in fig. 7.
Specifically, the scheme does not change the original development, debugging and deployment processes, but can greatly improve the debugging and deployment efficiency, and has no high learning cost.
In this scheme, after the route files in the high-frequency route file set are deployed and online, the pv data is still reported based on the route keywords of each route file, so that the route files are continuously replaced and updated to form a closed loop, as shown in fig. 8.
Example two
Based on the same conception, referring to fig. 9, the application also provides a device for improving deployment efficiency of a boulder application, comprising:
the setting module is used for setting a unique route key word for each route file in the megastone application, acquiring the pv data of each route file and constructing a query interface;
The device comprises a replacement module, a replacement module and a replacement module, wherein the replacement module is used for inserting a replacement plug-in into webpack configuration files, a keyword traversing method, a pv data query method and a replacement method are defined in the replacement plug-in, wherein a method for traversing the routing keywords of each routing file is defined in the keyword traversing method, a method for acquiring the pv data of each routing file through a query interface based on each routing keyword is defined in the pv data query method, and a method for removing the routing files of which the pv data does not accord with a set replacement rule is defined in the replacement method;
the deployment module is used for executing webpack on the basis of webpack configuration files to obtain a high-frequency routing file set, and packaging and deploying routing files in the high-frequency routing file set, wherein the high-frequency routing file set is a set of routing files after pv data are removed by the replacement plug-in unit and do not accord with a set replacement rule.
Example III
This embodiment also provides an electronic device, referring to fig. 10, comprising a memory 404 and a processor 402, the memory 404 having stored therein a computer program, the processor 402 being arranged to run the computer program to perform the steps of any of the method embodiments described above.
In particular, the processor 402 may include a Central Processing Unit (CPU), or an application specific integrated circuit (ApplicationSpecificIntegratedCircuit, abbreviated as ASIC), or may be configured as one or more integrated circuits that implement embodiments of the present application.
The memory 404 may include, among other things, mass storage 404 for data or instructions. By way of example, and not limitation, memory 404 may comprise a hard disk drive (HARDDISKDRIVE, abbreviated HDD), a floppy disk drive, a solid state drive (SolidStateDrive, abbreviated SSD), flash memory, an optical disk, a magneto-optical disk, a magnetic tape, or a Universal Serial Bus (USB) drive, or a combination of two or more of these. Memory 404 may include removable or non-removable (or fixed) media, where appropriate. Memory 404 may be internal or external to the data processing apparatus, where appropriate. In a particular embodiment, the memory 404 is a Non-Volatile (Non-Volatile) memory. In particular embodiments, memory 404 includes Read-only memory (ROM) and Random Access Memory (RAM). Where appropriate, the ROM may be a mask-programmed ROM, a programmable ROM (ProgrammableRead-only memory, abbreviated PROM), an erasable PROM (ErasableProgrammableRead-only memory, abbreviated EPROM), an electrically erasable PROM (ElectricallyErasableProgrammableRead-only memory, abbreviated EEPROM), an electrically rewritable ROM (ElectricallyAlterableRead-only memory, abbreviated EAROM) or a FLASH memory (FLASH), or a combination of two or more of these. The RAM may be a static random access memory (StaticRandom-access memory, abbreviated SRAM) or a dynamic random access memory (DynamicRandomAccessMemory, abbreviated DRAM) where the DRAM may be a fast page mode dynamic random access memory 404 (FastPageModeDynamicRandomAccessMemory, abbreviated FPMDRAM), an extended data output dynamic random access memory (ExtendedDateOutDynamicRandomAccessMemory, abbreviated EDODRAM), a synchronous dynamic random access memory (SynchronousDynamicRandom-access memory, abbreviated SDRAM), or the like, where appropriate.
Memory 404 may be used to store or cache various data files that need to be processed and/or used for communication, as well as possible computer program instructions for execution by processor 402.
Processor 402 implements any of the methods of improving the efficiency of deployment of a boulder application described in any of the embodiments above by reading and executing computer program instructions stored in memory 404.
Optionally, the electronic apparatus may further include a transmission device 406 and an input/output device 408, where the transmission device 406 is connected to the processor 402 and the input/output device 408 is connected to the processor 402.
The transmission device 406 may be used to receive or transmit data via a network. Specific examples of the network described above may include a wired or wireless network provided by a communication provider of the electronic device. In one example, the transmission device includes a network adapter (Network Interface Controller, simply referred to as a NIC) that can connect to other network devices through the base station to communicate with the internet. In one example, the transmission device 406 may be a Radio Frequency (RF) module, which is configured to communicate with the internet wirelessly.
The input-output device 408 is used to input or output information. In this embodiment, the input information may be a routing keyword, pv data, etc., and the output information may be a high-frequency routing file set, a lean application, etc.
Alternatively, in the present embodiment, the above-mentioned processor 402 may be configured to execute the following steps by a computer program:
s101, setting a unique route key word for each route file in a megastone application, acquiring pv data of each route file and constructing a query interface;
S102, inserting an elimination and replacement plug-in into webpack configuration files, defining a keyword traversing method, a pv data inquiring method and an elimination and replacement method in the elimination and replacement plug-in, wherein the keyword traversing method defines a method for traversing routing keywords of each routing file, the pv data inquiring method defines a method for acquiring pv data of each routing file through an inquiring interface based on each routing keyword, and the elimination and replacement method defines a method for removing routing files of which the pv data does not accord with an elimination and replacement rule;
S103, executing webpack on the basis of webpack configuration files to obtain a high-frequency routing file set, and packaging and deploying routing files in the high-frequency routing file set, wherein the high-frequency routing file set is a set of routing files after pv data are removed by the replacement plug-in unit and do not accord with a set replacement rule.
It should be noted that, specific examples in this embodiment may refer to examples described in the foregoing embodiments and alternative implementations, and this embodiment is not repeated herein.
In general, the various embodiments may be implemented in hardware or special purpose circuits, software, logic or any combination thereof. Some aspects of the invention may be implemented in hardware, while other aspects may be implemented in firmware or software which may be executed by a controller, microprocessor or other computing device, although the invention is not limited thereto. While various aspects of the invention may be illustrated and described as block diagrams, flow charts, or using some other pictorial representation, it is well understood that these blocks, apparatus, systems, techniques or methods described herein may be implemented in, as non-limiting examples, hardware, software, firmware, special purpose circuits or logic, general purpose hardware or controller or other computing devices, or some combination thereof.
Embodiments of the invention may be implemented by computer software executable by a data processor of a mobile device, such as in a processor entity, or by hardware, or by a combination of software and hardware. Computer software or programs (also referred to as program products) including software routines, applets, and/or macros can be stored in any apparatus-readable data storage medium and they include program instructions for performing particular tasks. The computer program product may include one or more computer-executable components configured to perform embodiments when the program is run. The one or more computer-executable components may be at least one software code or a portion thereof. In addition, in this regard, it should be noted that any blocks of the logic flow as in FIG. 10 may represent program steps, or interconnected logic circuits, blocks and functions, or a combination of program steps and logic circuits, blocks and functions. The software may be stored on a physical medium such as a memory chip or memory block implemented within a processor, a magnetic medium such as a hard disk or floppy disk, and an optical medium such as, for example, a DVD and its data variants, a CD, etc. The physical medium is a non-transitory medium.
It should be understood by those skilled in the art that the technical features of the above embodiments may be combined in any manner, and for brevity, all of the possible combinations of the technical features of the above embodiments are not described, however, they should be considered as being within the scope of the description provided herein, as long as there is no contradiction between the combinations of the technical features.
The foregoing examples illustrate only a few embodiments of the application, which are described in greater detail and are not to be construed as limiting the scope of the application. It should be noted that it will be apparent to those skilled in the art that several variations and modifications can be made without departing from the spirit of the application, which are all within the scope of the application. Accordingly, the scope of the application should be assessed as that of the appended claims.

Claims (8)

1. A method for improving deployment efficiency of a boulder application, comprising:
setting a unique route key word for each route file in the megaphone application, acquiring the pv data of each route file and constructing a query interface;
Inserting a replacement plug-in webpack configuration files, and defining a keyword traversing method, a pv data query method and a replacement method in the replacement plug-in, wherein the replacement method is as follows: removing the routing file with pv data not conforming to the set replacement rule by using the filter function, wherein the set replacement rule is that the pv data of the routing file is larger than a first threshold value or the pv data of the routing file is larger than a first threshold value in a set time period, and removing the routing file with pv data not conforming to the set replacement rule by using the filter function comprises the following steps: step 1: converting the source code of the routing array into a JavaScript format by using an eval function; step 2: the filter function removes the routing file which does not accord with the set jigging rule in the routing array in the JavaScript format; step 3: converting the route files in the remaining JavaScript format from the JavaScript format back to source codes, defining a method for traversing the route keywords of each route file in the keyword traversing method, defining a method for acquiring the pv data of each route file through a query interface based on each route keyword in the pv data query method, and defining a method for removing the route files of which the pv data does not accord with the set jigging rule in the jigging method;
And executing webpack based on webpack configuration files to obtain a high-frequency routing file set, and packaging and deploying routing files in the high-frequency routing file set, wherein the high-frequency routing file set is a set of routing files after pv data are removed by the replacement plug-in unit and do not accord with a set replacement rule.
2. The method for improving deployment efficiency of a boulder application according to claim 1, wherein in the step of setting a unique routing key for each routing file in the boulder application, the unique routing key is added to configuration information of each routing file.
3. The method for improving deployment efficiency of a boulder application according to claim 2, wherein a routing configuration array of the boulder application is obtained through RouterFactory, configuration information of each routing file is obtained based on positioning in the routing configuration array, and unique routing keywords are set in the corresponding configuration information.
4. The method for improving deployment efficiency of a megastone application according to claim 1, wherein in the step of acquiring the pv data of each route file, embedding a point into each route file to monitor loading information of each route file so as to obtain the pv data of each route file, acquiring a route keyword of each route file, and transmitting the pv data of each route file and the corresponding route keyword to a data processing center, wherein the data processing center updates the pv data of the corresponding route file based on the route keyword.
5. The method for improving deployment efficiency of a megastone application according to claim 1, wherein the jigging plugin further comprises a route loading time query method, and the route loading time query method obtains loading time of each route file in each loading process through a query interface based on a time key.
6. An apparatus for improving deployment efficiency of a boulder application, comprising:
the setting module is used for setting a unique route key word for each route file in the megastone application, acquiring the pv data of each route file and constructing a query interface;
The replacing module is used for inserting a replacing plug-in webpack configuration files, and defining a keyword traversing method, a pv data query method and a replacing method in the replacing plug-in, wherein the replacing method is as follows: removing the routing file with pv data not conforming to the set replacement rule by using the filter function, wherein the set replacement rule is that the pv data of the routing file is larger than a first threshold value or the pv data of the routing file is larger than a first threshold value in a set time period, and removing the routing file with pv data not conforming to the set replacement rule by using the filter function comprises the following steps: step 1: converting the source code of the routing array into a JavaScript format by using an eval function; step 2: the filter function removes the routing file which does not accord with the set jigging rule in the routing array in the JavaScript format; step 3: converting the route files in the remaining JavaScript format from the JavaScript format back to source codes, defining a method for traversing the route keywords of each route file in the keyword traversing method, defining a method for acquiring the pv data of each route file through a query interface based on each route keyword in the pv data query method, and defining a method for removing the route files of which the pv data does not accord with the set jigging rule in the jigging method;
the deployment module is used for executing webpack on the basis of webpack configuration files to obtain a high-frequency routing file set, and packaging and deploying routing files in the high-frequency routing file set, wherein the high-frequency routing file set is a set of routing files after pv data are removed by the replacement plug-in unit and do not accord with a set replacement rule.
7. An electronic device comprising a memory and a processor, wherein the memory has a computer program stored therein, the processor being arranged to run the computer program to perform a method of improving the deployment efficiency of a boulder application as claimed in any one of claims 1 to 5.
8. A readable storage medium, characterized in that the readable storage medium has stored therein a computer program comprising program code for controlling a process to execute a process comprising a method of improving the efficiency of deployment of a boulder application according to any of claims 1-5.
CN202410342377.9A 2024-03-25 2024-03-25 Method and device for improving deployment efficiency of boulder application Active CN117931248B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202410342377.9A CN117931248B (en) 2024-03-25 2024-03-25 Method and device for improving deployment efficiency of boulder application

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202410342377.9A CN117931248B (en) 2024-03-25 2024-03-25 Method and device for improving deployment efficiency of boulder application

Publications (2)

Publication Number Publication Date
CN117931248A CN117931248A (en) 2024-04-26
CN117931248B true CN117931248B (en) 2024-06-07

Family

ID=90768753

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202410342377.9A Active CN117931248B (en) 2024-03-25 2024-03-25 Method and device for improving deployment efficiency of boulder application

Country Status (1)

Country Link
CN (1) CN117931248B (en)

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108829409A (en) * 2018-06-20 2018-11-16 泰华智慧产业集团股份有限公司 A kind of distributed system quick deployment method and system
WO2021139172A1 (en) * 2020-01-10 2021-07-15 苏州浪潮智能科技有限公司 Method for storing file as audio frequency to achieve encryption, apparatus, and device
CN114327688A (en) * 2022-03-15 2022-04-12 Tcl通讯科技(成都)有限公司 Data processing method, frame, storage medium and terminal equipment based on micro front end
CN115951884A (en) * 2021-10-09 2023-04-11 中移(上海)信息通信科技有限公司 Information processing method and device and micro front end architecture system
CN116302181A (en) * 2023-02-23 2023-06-23 城云科技(中国)有限公司 Web font file compression method and device based on Vite and application thereof
CN117170725A (en) * 2023-09-05 2023-12-05 平安银行股份有限公司 Financial item updating method, system, equipment and storage medium
CN117270867A (en) * 2023-09-18 2023-12-22 城云科技(中国)有限公司 Web front end large screen adaptation method, device and application thereof
CN117544826A (en) * 2024-01-09 2024-02-09 杭州菲助科技有限公司 Subtitle file editing method and subtitle editor for loading application

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108829409A (en) * 2018-06-20 2018-11-16 泰华智慧产业集团股份有限公司 A kind of distributed system quick deployment method and system
WO2021139172A1 (en) * 2020-01-10 2021-07-15 苏州浪潮智能科技有限公司 Method for storing file as audio frequency to achieve encryption, apparatus, and device
CN115951884A (en) * 2021-10-09 2023-04-11 中移(上海)信息通信科技有限公司 Information processing method and device and micro front end architecture system
CN114327688A (en) * 2022-03-15 2022-04-12 Tcl通讯科技(成都)有限公司 Data processing method, frame, storage medium and terminal equipment based on micro front end
CN116302181A (en) * 2023-02-23 2023-06-23 城云科技(中国)有限公司 Web font file compression method and device based on Vite and application thereof
CN117170725A (en) * 2023-09-05 2023-12-05 平安银行股份有限公司 Financial item updating method, system, equipment and storage medium
CN117270867A (en) * 2023-09-18 2023-12-22 城云科技(中国)有限公司 Web front end large screen adaptation method, device and application thereof
CN117544826A (en) * 2024-01-09 2024-02-09 杭州菲助科技有限公司 Subtitle file editing method and subtitle editor for loading application

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
Java类动态加载机制在铁路互联网售票中的设计与实现;王拓;杨立鹏;;铁路计算机应用;20151125(第11期);全文 *
PTDETECTOR: An Automated JavaScript Front-end Library Detector;Liu, XY等;IEEE ACM International Conference on Automated Software Engineering;20240124;全文 *

Also Published As

Publication number Publication date
CN117931248A (en) 2024-04-26

Similar Documents

Publication Publication Date Title
US11093461B2 (en) Method for computing distinct values in analytical databases
CN106407303A (en) Data storage method and apparatus, and data query method and apparatus
US10915533B2 (en) Extreme value computation
Zihayat et al. Memory-adaptive high utility sequential pattern mining over data streams
CN110245149B (en) Metadata version management method and device
CN103631937A (en) Method, device and system for establishing column storage indexes
CN114218238A (en) Data storage method, system and application for recording complete change information of data
CN111258978A (en) Data storage method
CN103186668A (en) Method and device for processing data as well as data storage system based on key value data base
US10503713B1 (en) Criterion-based retention of data object versions
CN114218263B (en) Materialized view automatic creation method and materialized view based quick query method
CN116028489A (en) Automatic data exploration method and application thereof
CN105468412A (en) Dynamic packaging method and dynamic packaging device
CN113761390B (en) Method and system for analyzing attribute intimacy
CN117931248B (en) Method and device for improving deployment efficiency of boulder application
CN113535766A (en) Workflow configuration method, workflow configuration device, electronic device, and storage medium
CN114595291B (en) Collection task adjusting method and device based on database annotation
CN117033156A (en) Method, system and application for intelligent webpage operation
CN110147381B (en) Information processing method, system and recording medium
CN102611725B (en) A kind of method and device of memory node
CN114466387B (en) Updating method and device of configuration file of base station, storage medium and electronic device
CN116010670A (en) Data catalog recommendation method, device and application based on data blood relationship
CN115858471A (en) Service data change recording method, device, computer equipment and medium
CN112765170B (en) Embedded time sequence data management method and device
CN111443906A (en) Application access method and device

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant