CN109542530A - A kind of hierarchical loading method and device based on small routine framework - Google Patents
A kind of hierarchical loading method and device based on small routine framework Download PDFInfo
- Publication number
- CN109542530A CN109542530A CN201811259420.6A CN201811259420A CN109542530A CN 109542530 A CN109542530 A CN 109542530A CN 201811259420 A CN201811259420 A CN 201811259420A CN 109542530 A CN109542530 A CN 109542530A
- Authority
- CN
- China
- Prior art keywords
- routing
- level
- small routine
- rank
- packet
- 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.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/44—Arrangements for executing specific programs
- G06F9/445—Program loading or initiating
- G06F9/44568—Immediately runnable code
- G06F9/44578—Preparing or optimising for loading
Abstract
The invention discloses a kind of hierarchical loading method and device based on small routine framework, method includes: to obtain all routings of small routine, is grouped according to routing rank, the routing after grouping is stored in route set；The single routing iinformation in route set is obtained, is satisfied the need according to routing rank by being handled, the different corresponding data packets of routing rank is stored under different roots；Primary routing is obtained, the routing that jumps to that treated after handling primary routing；If detection is to first enter small routine, caching will be entered according to the corresponding data packet of routing after routing rank successively loading processing, and by data packet.The embodiment of the present invention can be according to access privileges, routing is divided into different ranks, according to the load mechanism of small routine, different ranks is placed under different roots, a kind of data packet is only loaded when loading for the first time, loading velocity is greatly improved, the white screen duration for entering small routine for the first time is reduced.
Description
Technical field
The present invention relates to field of communication technology more particularly to a kind of hierarchical loading methods and dress based on small routine framework
It sets.
Background technique
Wechat small routine, abbreviation small routine, English name Mini Program, it is i.e. usable to be that one kind does not need downloading installation
Application, it realizes the dream of application " within reach ", and user, which sweeps, sweeps or search i.e. openable application.All-round opening Shen
Please after, type of subject be enterprise, government, media, its hetero-organization or individual developer, can apply for the registration of small routine.Little Cheng
Sequence, subscription number, service number, enterprise number are parallel systems.
Existing educational applications also have corresponding wechat small routine, although existing wechat small routine is not necessarily to download APP,
But enter need to load all codes for the first time, the white screen time is long, and churn rate is high, and existing wechat small routine does not have
It is provided with buffering scheme, included caching mechanism can not solve the problems, such as that the white screen time entered for the first time is long.
Therefore, the existing technology needs to be improved and developed.
Summary of the invention
In view of above-mentioned deficiencies of the prior art, the purpose of the present invention is to provide a kind of classifications based on small routine framework to add
Support method and device, it is intended to solve the problems, such as that the time needed when wechat small routine in the prior art loads for the first time is long.
Technical scheme is as follows:
A kind of hierarchical loading method based on small routine framework, which comprises
All routings for obtaining small routine are grouped according to routing rank, the routing after grouping are stored in set of routes
In conjunction；
The single routing iinformation in route set is obtained, is satisfied the need according to routing rank by being handled, by different routings
The corresponding data packet of rank is stored under different roots；
Primary routing is obtained, the routing that jumps to that treated after handling primary routing；
If detection is to first enter small routine, according to the corresponding data of routing after routing rank successively loading processing
Packet, and data packet will be entered into caching.
Optionally, the routing rank is the priority of routing access,
All routings for obtaining small routine are grouped according to routing rank, the routing after grouping are stored in road
By including: in set
All routings for obtaining small routine are grouped according to the priority of routing access；
Routing after grouping is divided into level-one routing and the routing of non-level-one, the primary routing before storage grouping；
By level-one routing and non-level-one routing route prefix be removed, by remove route prefix level-one routing and it is non-
Level-one routing is stored in route set.
Optionally, the single routing iinformation obtained in route set satisfies the need according to routing rank by being handled, will
The different corresponding data packets of routing rank are stored under different roots, comprising:
The single routing iinformation in route set is obtained, rank is routed according to single routing information acquisition；
If routing rank is to remove the level-one routing of route prefix, keep the level-one routing of removal route prefix corresponding
Page data package location is constant, and addition level-one route prefix generates new level-one road before the level-one routing of removal route prefix
By；
If routing rank is to remove the non-level-one routing of route prefix, the non-level-one routing for removing route prefix is corresponded to
Page data be transferred to non-level-one routing file folder, and the non-level-one routing of addition before the non-level-one routing of removal route prefix
Prefix generates new non-level-one routing.
Optionally, the acquisition primary routing, the routing that jumps to that treated after handling primary routing, comprising:
Primary routing is obtained, the corresponding All Files content of primary routing is emptied；
Run function is written in primary routing, new level-one routing or new non-level-one are jumped to after run function activation
Routing.
Optionally, if the detection is to first enter small routine, according to the routing rank successively corresponding page of loading page
Face data packet, and page data packet will be entered into caching, comprising:
If detection is to first enter small routine, loads new level-one and route corresponding level-one routing packet, level-one is routed
Caching is added in packet, into non-first level pages；
The corresponding non-level-one routing packet of non-level-one routing is loaded, non-level-one is routed into packet, caching is added, load is completed.
Optionally, the non-level-one routing includes second grade router and triple routing,
Single routing iinformation in the acquisition route set satisfies the need according to routing rank by being handled, comprising:
The single routing iinformation in route set is obtained, rank is routed according to single routing information acquisition；
If routing rank is to remove the level-one routing of route prefix, keep the level-one routing of removal route prefix corresponding
Page data package location is constant, and addition level-one route prefix generates new level-one road before the level-one routing of removal route prefix
By；
If routing rank is the second grade router for removing route prefix, the corresponding page of second grade router that will remove route prefix
Face data is transferred to second grade router file, and addition second grade router prefix generates newly before the second grade router of removal route prefix
Second grade router；
If routing rank is the triple routing for removing route prefix, the corresponding page of triple routing that will remove route prefix
Face data is transferred to triple routing file, and addition triple routing prefix generates newly before the triple routing of removal route prefix
Triple routing.
Optionally, if the detection is to first enter small routine, according to the routing rank successively corresponding page of loading page
Face data packet, and page data packet will be entered into caching, comprising:
If detection is to first enter small routine, loads new level-one and route corresponding level-one routing packet, level-one is routed
Caching is added in packet, into the second level page；
The corresponding second grade router packet of second grade router is loaded, second grade router packet is added and is cached, into the three-level page；
The corresponding triple routing packet of triple routing is loaded, three-level grade is routed into packet, caching is added, load is completed.
Further embodiment of this invention additionally provides a kind of hierarchical loading device based on small routine framework, and described device includes
At least one processor；And
The memory being connect at least one described processor communication；Wherein,
The memory is stored with the instruction that can be executed by least one described processor, and described instruction is by described at least one
A processor executes, so that at least one described processor is able to carry out the above-mentioned hierarchical loading side based on small routine framework
Method.
Another embodiment of the present invention additionally provides a kind of non-volatile computer readable storage medium storing program for executing, which is characterized in that
The non-volatile computer readable storage medium storing program for executing is stored with computer executable instructions, and the computer executable instructions are by one
Or multiple processors may make one or more of processors to execute the above-mentioned classification based on small routine framework and add when executing
Support method.
Another embodiment of the invention provides a kind of computer program product, and the computer program product includes depositing
The computer program on non-volatile computer readable storage medium storing program for executing is stored up, the computer program includes program instruction, works as institute
When stating program instruction and being executed by processor, the processor is made to execute the above-mentioned hierarchical loading method based on small routine framework.
The utility model has the advantages that the present invention is real the invention discloses a kind of hierarchical loading method and device based on small routine framework
Different ranks can be divided into for routing, according to the load mechanism of small routine, by different ranks according to access privileges by applying in example
It is placed under different roots, only loads a kind of data packet when loading for the first time, greatly improve loading velocity, reduce first
The secondary white screen duration into small routine promotes user experience, is brought conveniently for user using small routine.
Detailed description of the invention
Present invention will be further explained below with reference to the attached drawings and examples, in attached drawing:
Fig. 1 is a kind of flow chart of the hierarchical loading method preferred embodiment based on small routine framework of the present invention；
Fig. 2 is a kind of hardware configuration signal of hierarchical loading device preferred embodiment based on small routine framework of the present invention
Figure.
Specific embodiment
To make the purpose of the present invention, technical solution and effect clearer, clear and definite, below to the present invention further specifically
It is bright.It should be appreciated that the specific embodiments described herein are merely illustrative of the present invention, it is not intended to limit the present invention.Below
The embodiment of the present invention is introduced in conjunction with attached drawing.
Referring to Fig. 1, Fig. 1 is a kind of process of the hierarchical loading method preferred embodiment based on small routine framework of the present invention
Figure.As shown in Figure 1, itself comprising steps of
Step S100, all routings for obtaining small routine are grouped according to routing rank, the routing after grouping are stored
In route set；
Step S200, the single routing iinformation in route set is obtained, is satisfied the need according to routing rank by being handled, it will not
The same corresponding data packet of routing rank is stored under different roots；
Step S300, primary routing is obtained, the routing that jumps to that treated after handling primary routing；
If step S400, detection is to first enter small routine, according to the routing pair after routing rank successively loading processing
The data packet answered, and data packet will be entered into caching.
When it is implemented, the terminal in the embodiment of the present invention is that mobile phone or plate etc. support the electronics of wechat small routine to set
It is standby.
Further, routing rank is the priority of routing access, and step S100 includes:
All routings for obtaining small routine are grouped according to the priority of routing access；
Routing after grouping is divided into level-one routing and the routing of non-level-one, the primary routing before storage grouping；
By level-one routing and non-level-one routing route prefix be removed, by remove route prefix level-one routing and it is non-
Level-one routing is stored in route set.
When it is implemented, non-level-one routing includes second grade router and triple routing, routing is grouped, level-one road is divided into
By, second grade router, three groups of triple routing；Will the routing after grouping prefix remove after be stored in route set simultaneously also to divide
All primary routings before group are stored.
Further, step S200 is specifically included:
The single routing iinformation in route set is obtained, rank is routed according to single routing information acquisition；
If routing rank is to remove the level-one routing of route prefix, keep the level-one routing of removal route prefix corresponding
Page data package location is constant, and addition level-one route prefix generates new level-one road before the level-one routing of removal route prefix
By；
If routing rank is to remove the non-level-one routing of route prefix, the non-level-one routing for removing route prefix is corresponded to
Page data be transferred to non-level-one routing file folder, and the non-level-one routing of addition before the non-level-one routing of removal route prefix
Prefix generates new non-level-one routing.
When it is implemented, obtaining the single road in route set when non-level-one routing includes second grade router and triple routing
By information, rank is routed according to single routing information acquisition；
If routing rank is to remove the level-one routing of route prefix, keep the level-one routing of removal route prefix corresponding
Page data package location is constant, and addition level-one route prefix generates new level-one road before the level-one routing of removal route prefix
By；
If routing rank is the second grade router for removing route prefix, the corresponding page of second grade router that will remove route prefix
Face data is transferred to second grade router file, and addition second grade router prefix generates newly before the second grade router of removal route prefix
Second grade router；
If routing rank is the triple routing for removing route prefix, the corresponding page of triple routing that will remove route prefix
Face data is transferred to triple routing file, and addition triple routing prefix generates newly before the triple routing of removal route prefix
Triple routing.
When it is implemented, obtaining route set, loops through, obtain single routing iinformation；Judgement routing hierarchical information, root
It satisfies the need according to routing level by being handled；If level-one route, then keep routing file position constant, addition route prefix be/
pages；If second grade router, then routing file is transferred to level-two file, and adding route prefix is /level-
Document location is then transferred to level-three file if triple routing by two, s, and addition route prefix is /level_
three。
Further, step S300 is specifically included:
Primary routing is obtained, the corresponding All Files content of primary routing is emptied；
Run function is written in primary routing, new level-one routing or new non-level-one are jumped to after run function activation
Routing.
When it is implemented, judging whether routing traverses completion, if so, obtaining primary routing, it is corresponding to empty primary routing
All Files content, run function is written, jumps to new routing after starting activation, realizes back compatible；If it is not, then continuation time
It goes through.
Further, step S400 is specifically included:
If detection is to first enter small routine, loads new level-one and route corresponding level-one routing packet, level-one is routed
Caching is added in packet, into non-first level pages；
The corresponding non-level-one routing packet of non-level-one routing is loaded, non-level-one is routed into packet, caching is added, load is completed.
Further, it if detection is to first enter small routine, loads new level-one and routes corresponding level-one routing packet, it will
Caching is added in level-one routing packet, into the second level page；
The corresponding second grade router packet of second grade router is loaded, second grade router packet is added and is cached, into the three-level page；
The corresponding triple routing packet of triple routing is loaded, three-level grade is routed into packet, caching is added, load is completed.
When it is implemented, new level-one routing packet is denoted as level-one packet, second grade router packet is denoted as secondary packet, triple routing packet note
For three-level packet.If first entering small routine, load level-one packet, one, and level-one packet is added and is cached, level-one packet only includes user
The content that can be seen for the first time；Into the second level page, secondary packet is loaded, secondary packet is added caching, into the three-level page, loads three-level
Packet, small routine load are completed.
By above method embodiment it is found that the embodiment of the present invention provides a kind of hierarchical loading side based on small routine framework
Code packet is divided into one or two three-levels (hierarchical loading) according to access privileges by method, will according to the load mechanism of wechat small routine
Level-one packet is placed under pages catalogue, and two three-level packets are placed under other root, only needs to load level-one packet when entering for the first time,
Greatly promote loading velocity.The caching mechanism of wechat small routine can not be utilized, but be available with the load mechanism of small routine, very
Big degree reduces the white screen duration entered for the first time.
Another embodiment of the present invention provides a kind of hierarchical loading devices based on small routine framework, as shown in Fig. 2, device 10
Include:
One or more processors 110 and memory 120 are introduced in Fig. 2 by taking a processor 110 as an example, are located
Reason device 110 can be connected with memory 120 by bus or other modes, in Fig. 2 for being connected by bus.
Processor 110 is used for the various control logics of finishing device 10, can be general processor, Digital Signal Processing
Device (DSP), specific integrated circuit (ASIC), field programmable gate array (FPGA), single-chip microcontroller, ARM (Acorn RISC
) or other programmable logic device, discrete gate or transistor logic, discrete hardware component or these components Machine
Any combination.In addition, processor 110 can also be any conventional processors, microprocessor or state machine.Processor 110 can also
To be implemented as calculating the combination of equipment, for example, the combination of DSP and microprocessor, multi-microprocessor, one or more micro- places
Manage device combination DSP core or any other this configuration.
Memory 120 is used as a kind of non-volatile computer readable storage medium storing program for executing, can be used for storing non-volatile software journey
Sequence, non-volatile computer executable program and module, as the classification based on small routine framework in the embodiment of the present invention adds
The corresponding program instruction of support method.Processor 110 is by running the non-volatile software program being stored in memory 120, referring to
It enables and unit is realized in above method embodiment thereby executing the various function application and data processing of device 10
Hierarchical loading method based on small routine framework.
Memory 120 may include storing program area and storage data area, wherein storing program area can store operation dress
It sets, application program required at least one function；Storage data area, which can be stored, uses created data etc. according to device 10.
It can also include nonvolatile memory in addition, memory 120 may include high-speed random access memory, for example, at least one
A disk memory, flush memory device or other non-volatile solid state memory parts.In some embodiments, memory 120 can
Choosing includes the memory remotely located relative to processor 110, these remote memories can pass through network connection to device 10.
The example of above-mentioned network includes but is not limited to internet, intranet, local area network, mobile radio communication and combinations thereof.
One or more unit is stored in memory 120, when being executed by one or more processor 110, is held
The hierarchical loading method based on small routine framework in the above-mentioned any means embodiment of row, for example, executing in Fig. 1 described above
Method and step S100 to step S400.
The embodiment of the invention provides a kind of non-volatile computer readable storage medium storing program for executing, computer readable storage medium is deposited
Computer executable instructions are contained, which is executed by one or more processors, for example, executing above retouch
Method and step S100 to step S400 in the Fig. 1 stated.
As an example, non-volatile memory medium can include that read-only memory (ROM), programming ROM (PROM), electricity can
Programming ROM (EPROM), electrically erasable ROM (EEPROM) or flash memory.Volatile memory can include as external high speed
The random access memory (RAM) of buffer memory.By illustrate it is beautiful unrestricted, RAM can with such as synchronous random access memory (SRAM),
Dynamic ram, (DRAM), synchronous dram (SDRAM), double data rate SDRAM (DDR SDRAM), enhanced SDRAM
(ESDRAM), many forms of Synchlink DRAM (SLDRAM) and directly Rambus (Lan Basi) RAM (DRRAM) etc
It obtains.The disclosed memory assembly or memory of operating environment described herein be intended to include these and/or it is any
Other are suitble to one or more of the memory of type.
Another embodiment of the invention provides a kind of computer program product, and computer program product includes being stored in
Computer program on non-volatile computer readable storage medium storing program for executing, computer program include program instruction, when program instruction quilt
When processor executes, the processor is made to execute the hierarchical loading method based on small routine framework of above method embodiment.Example
Such as, the method and step S100 to step S400 in Fig. 1 described above is executed.
Embodiments described above is only schematical, wherein as illustrated by the separation member unit can be or
It may not be and be physically separated, component shown as a unit may or may not be physical unit, it can
It is in one place, or may be distributed over multiple network units.Can select according to actual needs part therein or
Person's whole module achieves the purpose of the solution of this embodiment.
By the description of above embodiment, those skilled in the art can be understood that each embodiment can be by
Software adds the mode of general hardware platform to realize, naturally it is also possible to pass through hardware realization.Based on this understanding, above-mentioned technology
Scheme substantially in other words can be embodied in the form of software products the part that the relevant technologies contribute, the computer
Software product can reside in computer readable storage medium, such as ROM/RAM, magnetic disk, CD, including some instructions to
So that a computer electronic equipment (can be personal computer, server or network electronic devices etc.) executes each reality
The method for applying certain parts of example or embodiment.
Among other things, such as " can ', " energy ", " possibility " or " can be with " etc conditional statement unless in addition specific
Ground is stated or is otherwise understood in context as used, is otherwise generally intended to convey particular implementation energy
Including (however other embodiments do not include) special characteristic, element and/or operation.Therefore, such conditional statement is generally
It is not intended to imply that feature, element and/or operation are all needed one or more embodiments or one anyway
Or multiple embodiments must include for determining these features, element in the case where being with or without student's input or prompt
And/or the logic whether operation is included or will be performed in any particular implementation.
The content described in the present description and drawings herein include be capable of providing intelligent cabinet method for customizing and
The example of device.Certainly, each of element and/or method can not be described for the purpose of the various features of the description disclosure
The combination being envisioned that, it can be appreciated that, many other combinations and displacement of disclosed feature are possible.Cause
This, it is obvious that without departing from the scope or spirit of the present disclosure various modifications can be made to the disclosure.This
Outside, or in alternative solution, the considerations of other embodiments of the disclosure are to the specification and drawings and as being in herein
It may be obvious in the practice of the existing disclosure.It is intended that example proposed in the specification and drawings is all
Aspect is considered illustrative and not restrictive.Although using specific term herein, they general and
The purpose of limitation is used and is not used in descriptive sense.
Claims (10)
1. a kind of hierarchical loading method based on small routine framework, it is characterised in that, the described method includes:
All routings for obtaining small routine are grouped according to routing rank, the routing after grouping are stored in route set；
The single routing iinformation in route set is obtained, is satisfied the need according to routing rank by being handled, by different routing ranks
Corresponding data packet is stored under different roots；
Primary routing is obtained, the routing that jumps to that treated after handling primary routing；
If detection is to first enter small routine, according to the corresponding data packet of routing after routing rank successively loading processing, and
Data packet will be entered into caching.
2. the hierarchical loading method according to claim 1 based on small routine framework, which is characterized in that the routing rank
To route the priority accessed,
All routings for obtaining small routine are grouped according to routing rank, the routing after grouping are stored in set of routes
In conjunction, include:
All routings for obtaining small routine are grouped according to the priority of routing access；
Routing after grouping is divided into level-one routing and the routing of non-level-one, the primary routing before storage grouping；
The route prefix of level-one routing and the routing of non-level-one is removed, the level-one routing and non-level-one of route prefix will be removed
Routing is stored in route set.
3. according to claim 2 based on the hierarchical loading method of small routine framework, which is characterized in that the acquisition set of routes
Single routing iinformation in conjunction satisfies the need by being handled according to routing rank, the different corresponding data packets of routing rank is deposited
Storage is under different roots, comprising:
The single routing iinformation in route set is obtained, rank is routed according to single routing information acquisition；
If routing rank is to remove the level-one routing of route prefix, the level-one of removal route prefix is kept to route the corresponding page
Data packet locations are constant, and addition level-one route prefix generates new level-one routing before the level-one routing of removal route prefix；
If routing rank is to remove the non-level-one routing of route prefix, the non-level-one for removing route prefix is routed into corresponding page
Face data is transferred to non-level-one routing file folder, and the non-level-one route prefix of addition before the non-level-one routing of removal route prefix
Generate new non-level-one routing.
4. the hierarchical loading method according to claim 3 based on small routine framework, which is characterized in that described to obtain original road
By the routing that jumps to that treated after handling primary routing, comprising:
Primary routing is obtained, the corresponding All Files content of primary routing is emptied；
Run function is written in primary routing, new level-one routing or new non-level-one road are jumped to after run function activation
By.
5. the hierarchical loading method according to claim 4 based on small routine framework, which is characterized in that if the detection is
Small routine is first entered, then according to the routing rank successively corresponding page data packet of loading page, and page data packet will be entered
Caching, comprising:
If detection is to first enter small routine, the corresponding level-one routing packet of new level-one routing is loaded, level-one routing packet is added
Enter caching, into non-first level pages；
The corresponding non-level-one routing packet of non-level-one routing is loaded, non-level-one is routed into packet, caching is added, load is completed.
6. the hierarchical loading method according to claim 1 based on small routine framework, which is characterized in that the non-level-one road
By include second grade router and triple routing,
Single routing iinformation in the acquisition route set satisfies the need according to routing rank by being handled, comprising:
The single routing iinformation in route set is obtained, rank is routed according to single routing information acquisition；
If routing rank is to remove the level-one routing of route prefix, the level-one of removal route prefix is kept to route the corresponding page
Data packet locations are constant, and addition level-one route prefix generates new level-one routing before the level-one routing of removal route prefix；
If routing rank is the second grade router for removing route prefix, the corresponding page number of second grade router that will remove route prefix
According to being transferred to second grade router file, and addition second grade router prefix generates new two before the second grade router of removal route prefix
Grade routing；
If routing rank is the triple routing for removing route prefix, the corresponding page number of triple routing that will remove route prefix
According to being transferred to triple routing file, and addition triple routing prefix generates new three before the triple routing of removal route prefix
Grade routing.
7. the hierarchical loading method according to claim 6 based on small routine framework, which is characterized in that if the detection is
Small routine is first entered, then according to the routing rank successively corresponding page data packet of loading page, and page data packet will be entered
Caching, comprising:
If detection is to first enter small routine, the corresponding level-one routing packet of new level-one routing is loaded, level-one routing packet is added
Enter caching, into the second level page；
The corresponding second grade router packet of second grade router is loaded, second grade router packet is added and is cached, into the three-level page；
The corresponding triple routing packet of triple routing is loaded, three-level grade is routed into packet, caching is added, load is completed.
8. a kind of hierarchical loading device based on small routine framework, which is characterized in that described device includes at least one processor；
And
The memory being connect at least one described processor communication；Wherein,
The memory is stored with the instruction that can be executed by least one described processor, and described instruction is by described at least one
It manages device to execute, so that at least one described processor is able to carry out, claim 1-7 is described in any item to be based on small routine framework
Hierarchical loading method.
9. a kind of non-volatile computer readable storage medium storing program for executing, which is characterized in that the non-volatile computer readable storage medium
Matter is stored with computer executable instructions, when which is executed by one or more processors, may make institute
It states one or more processors perform claim and requires the described in any item hierarchical loading methods based on small routine framework of 1-7.
10. a kind of computer program product, which is characterized in that the computer program product includes being stored in non-volatile calculating
Computer program on machine readable storage medium storing program for executing, the computer program include program instruction, when described program instruction is processed
When device executes, the processor perform claim is made to require the described in any item hierarchical loading methods based on small routine framework of 1-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811259420.6A CN109542530A (en) | 2018-10-26 | 2018-10-26 | A kind of hierarchical loading method and device based on small routine framework |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811259420.6A CN109542530A (en) | 2018-10-26 | 2018-10-26 | A kind of hierarchical loading method and device based on small routine framework |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109542530A true CN109542530A (en) | 2019-03-29 |
Family
ID=65845317
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811259420.6A Pending CN109542530A (en) | 2018-10-26 | 2018-10-26 | A kind of hierarchical loading method and device based on small routine framework |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109542530A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110046000A (en) * | 2019-04-24 | 2019-07-23 | 上海连尚网络科技有限公司 | Small routine operation method and device |
| CN110147258A (en) * | 2019-04-19 | 2019-08-20 | 平安科技（深圳）有限公司 | Improve method, apparatus, computer equipment and the storage medium of program loading efficiency |
| CN110262797A (en) * | 2019-06-10 | 2019-09-20 | 杭州米络星科技(集团)有限公司 | A kind of application module and routing jump method |
| CN110888731A (en) * | 2019-12-09 | 2020-03-17 | 北京博睿宏远数据科技股份有限公司 | Route data acquisition method, device, equipment and storage medium |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101833465A (en) * | 2010-04-23 | 2010-09-15 | 中国科学院声学研究所 | Embedded system supporting dynamic loading operation of application programs |
| US20170075866A1 (en) * | 2015-09-10 | 2017-03-16 | International Business Machines Corporation | Masking an object in hypertext markup language |
| CN106843899A (en) * | 2017-02-09 | 2017-06-13 | 腾讯科技（深圳）有限公司 | A kind of web development methods and device based on Node.js platforms |
| US20180060106A1 (en) * | 2016-08-28 | 2018-03-01 | Vmware, Inc. | Multi-tiered-application distribution to resource-provider hosts by an automated resource-exchange system |
| CN108021614A (en) * | 2017-08-18 | 2018-05-11 | 口碑(上海)信息技术有限公司 | A kind of method and system for page dynamic load |
| CN108196930A (en) * | 2018-01-18 | 2018-06-22 | 腾讯科技（深圳）有限公司 | Applied program processing method, device, storage medium and computer equipment |
| CN108491206A (en) * | 2018-04-12 | 2018-09-04 | 江南大学 | A kind of SPA single-pages realization method and system |
-
2018
- 2018-10-26 CN CN201811259420.6A patent/CN109542530A/en active Pending
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101833465A (en) * | 2010-04-23 | 2010-09-15 | 中国科学院声学研究所 | Embedded system supporting dynamic loading operation of application programs |
| US20170075866A1 (en) * | 2015-09-10 | 2017-03-16 | International Business Machines Corporation | Masking an object in hypertext markup language |
| US20180060106A1 (en) * | 2016-08-28 | 2018-03-01 | Vmware, Inc. | Multi-tiered-application distribution to resource-provider hosts by an automated resource-exchange system |
| CN106843899A (en) * | 2017-02-09 | 2017-06-13 | 腾讯科技（深圳）有限公司 | A kind of web development methods and device based on Node.js platforms |
| CN108021614A (en) * | 2017-08-18 | 2018-05-11 | 口碑(上海)信息技术有限公司 | A kind of method and system for page dynamic load |
| CN108196930A (en) * | 2018-01-18 | 2018-06-22 | 腾讯科技（深圳）有限公司 | Applied program processing method, device, storage medium and computer equipment |
| CN108491206A (en) * | 2018-04-12 | 2018-09-04 | 江南大学 | A kind of SPA single-pages realization method and system |
Non-Patent Citations (1)
| Title |
|---|
| 李俊涛: "《vue-router路由懒加载（解决vue项目首次加载慢）》", 《HTTPS://WWW.CNBLOGS.COM/LIJUNTAO/P/7777581.HTML》 * |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110147258A (en) * | 2019-04-19 | 2019-08-20 | 平安科技（深圳）有限公司 | Improve method, apparatus, computer equipment and the storage medium of program loading efficiency |
| CN110147258B (en) * | 2019-04-19 | 2022-08-16 | 平安科技（深圳）有限公司 | Method and device for improving program loading efficiency, computer equipment and storage medium |
| CN110046000A (en) * | 2019-04-24 | 2019-07-23 | 上海连尚网络科技有限公司 | Small routine operation method and device |
| CN110046000B (en) * | 2019-04-24 | 2022-03-11 | 上海连尚网络科技有限公司 | Applet running method and device |
| CN110262797A (en) * | 2019-06-10 | 2019-09-20 | 杭州米络星科技(集团)有限公司 | A kind of application module and routing jump method |
| CN110888731A (en) * | 2019-12-09 | 2020-03-17 | 北京博睿宏远数据科技股份有限公司 | Route data acquisition method, device, equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109542530A (en) | A kind of hierarchical loading method and device based on small routine framework | |
| US6298476B1 (en) | Object oriented software build framework mechanism | |
| US20090249282A1 (en) | Cross platform compositional widgets | |
| US8176114B2 (en) | Distributed cross-application server deployment | |
| CN107870787A (en) | Application plug loading method and system | |
| CN104714828A (en) | Methods and devices for installing and operating application | |
| EP1290554B1 (en) | Modular computer system and related method | |
| Brazier et al. | Agent factory: Generative migration of mobile agents in heterogeneous environments | |
| CN112231054B (en) | Multi-model inference service deployment method and device based on k8s cluster | |
| CN107480717A (en) | Train job processing method and system, computing device, computer-readable storage medium | |
| CN108011891A (en) | A kind of application access method, apparatus, server and computer-readable storage medium | |
| WO2019234622A1 (en) | Training of conversational agent using natural language | |
| CN106357791A (en) | Method, device and system for processing services | |
| CN110502268A (en) | Application program update method, apparatus, server and storage medium | |
| CN108008959A (en) | A kind of Software Development Kit SDK cut-in methods, system and device | |
| CN103647811A (en) | A method and an apparatus for application's accessing backstage service | |
| CN107577629A (en) | A kind of data-interface processing method, device, server and medium | |
| CN106599623B (en) | A kind of application similarity calculating method and device | |
| CN105204861B (en) | A kind of registration table reorientation method and device | |
| US8316107B2 (en) | Personalizing space in a network environment | |
| CN106528206A (en) | Application starting control method and apparatus, and application installation package reinforcement apparatus | |
| CN105847393A (en) | Content distribution method, device and system | |
| CN105897559B (en) | A kind of control method and mobile terminal of HTML5 application | |
| US20220261238A1 (en) | Method and system for deploying third-party application to microcontroller by means of edge assistance | |
| Davidson et al. | The weighted independent domination problem: ILP model and algorithmic approaches |
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 | ||
| AD01 | Patent right deemed abandoned |
Effective date of abandoning: 20220913 |
|
| AD01 | Patent right deemed abandoned |