CN113885902B - Application program interface updating method - Google Patents
Application program interface updating method Download PDFInfo
- Publication number
- CN113885902B CN113885902B CN202110970380.1A CN202110970380A CN113885902B CN 113885902 B CN113885902 B CN 113885902B CN 202110970380 A CN202110970380 A CN 202110970380A CN 113885902 B CN113885902 B CN 113885902B
- Authority
- CN
- China
- Prior art keywords
- request
- time period
- target
- updating
- requests
- 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
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/60—Software deployment
- G06F8/65—Updates
-
- 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/451—Execution arrangements for user interfaces
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- General Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Computer Security & Cryptography (AREA)
- Human Computer Interaction (AREA)
- Information Transfer Between Computers (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention provides an application program interface updating method, which comprises the steps of adding a plurality of acquired target updating requests into a request queue of the current time period; judging whether the update request of the current time period and the update request of the previous time period are contained; if the plurality of updating requests only comprise the current time slot, generating a first target request based on the plurality of updating requests, and updating an interface of a target application program; and if the update requests in the current time period and the previous time period are contained, generating a second target request based on the plurality of update requests in the request queue in the current time period and the plurality of update requests in the request queue in the previous time period, and updating an interface of the target application program. In the invention, the interface of the target application program is updated by using the first or second target request, so that the problem of interface jump caused by the interface update of the target application program by a plurality of update requests at the same time is solved.
Description
Technical Field
The invention relates to the technical field of computer program design, in particular to an application program interface updating method.
Background
When a new function is added to the target application program or the target application program is updated, the interface of the target application program needs to be updated.
A common interface update method for the target application includes using a data-driven interface of the target application to perform an update, for example, using a Model-View Model (MVVM) framework or the like, and when the sent request data is returned, immediately notifying the target application to perform the interface update. Wherein data that certain interfaces of the target application depend on may originate from different interfaces or pathways. Correspondingly, the data return time of different interfaces may be different, and when part or all of the data is changed, the interface of the target application program is driven to be updated once; when two update operations are assigned to two update frames of the target application, the interface of the target application may be updated multiple times.
The above-mentioned method for updating the interface of the target application program has the following disadvantages or shortcomings: when the interface of the target application program is updated by the method, the problem of jumping of the interface of the target application program exists.
Disclosure of Invention
In order to solve the problems in the prior art, embodiments of the present invention provide an application program interface updating method.
The invention provides an application program interface updating method, which comprises the following steps: acquiring a plurality of target updating requests, and adding the plurality of target updating requests into a request queue of the current time period;
judging whether the request queue of the current time period contains the update request of the current time period and the update request of the previous time period;
if the request queue of the current time period only comprises a plurality of update requests of the current time period, generating a first target request based on the plurality of update requests in the request queue of the current time period, and updating an interface of a target application program based on the first target request;
if the request queue of the current time period comprises the update requests of the current time period and the previous time period, generating a second target request based on the plurality of update requests in the request queue of the current time period and the plurality of update requests in the request queue of the previous time period, and updating an interface of a target application program based on the second target request.
According to an application program interface updating method provided by the present invention, the generating a first target request based on a plurality of update requests in the request queue of the current time period includes:
determining a plurality of first request times respectively corresponding to a plurality of update requests in the request queue of the current time period, and sequencing the plurality of update requests in the request queue of the current time period based on the plurality of first request times to obtain a first sequencing result;
and processing the first sequencing result to generate the first target request.
According to an application program interface updating method provided by the present invention, the generating a second target request based on a plurality of update requests in the request queue of the current time period and a plurality of update requests in the request queue of the previous time period includes:
determining an update request of a previous time period and a second request time corresponding to the update request of the previous time period, which are contained in the request queue of the current time period, and a plurality of update requests in the request queue of the previous time period and a plurality of second request times corresponding to the update requests;
based on the second request times, sequencing the update request of the previous time period contained in the request queue of the current time period and the update requests in the request queue of the previous time period to obtain a second sequencing result;
processing the second sequencing result to generate an intermediate updating request;
respectively determining the intermediate updating request and a plurality of third request times corresponding to a plurality of updating requests of the current time period contained in the request queue of the current time period;
based on the third request times, sequencing the intermediate updating request and the updating requests in the current time period to obtain a third sequencing result;
and processing the third sequencing result to generate the second target request.
According to an application program interface updating method provided by the present invention, the processing the first sorting result to generate the first target request includes:
combining the 1 st update request and the 2 nd update request of the first sequencing result to obtain a1 st intermediate result;
combining the ith intermediate result with the (i + 2) th updating request to obtain an (i + 1) th intermediate result, wherein i is more than or equal to 1 and is less than or equal to n-2, and n is the number of the updating requests in the first sequencing result;
judging whether i +2 is smaller than n;
if i +2 is less than n, increasing i by 1, and continuing to execute the step of combining the ith intermediate result and the (i + 2) th update request to generate the (i + 1) th intermediate result;
and if the i +2 is not less than n, taking the i +1 th intermediate result as the first target request.
According to the application program interface updating method provided by the invention, the processing of the second sequencing result to generate the intermediate updating request comprises the following steps:
merging the 1 st update request and the 2 nd update request of the second sequencing result to obtain a1 st intermediate result;
combining the jth intermediate result with the jth +2 updating requests to obtain a jth +1 intermediate result, wherein j is more than or equal to 1 and less than or equal to m-2, and m is the number of the updating requests in the second sequencing result;
judging whether j +2 is smaller than m;
if j +2 is smaller than m, increasing j by 1, and continuing to execute the step of combining the jth intermediate result and the jth +2 updating request to generate a jth +1 intermediate result;
and if j +2 is not less than m, taking the j +1 th intermediate result as the intermediate updating request.
According to an application program interface updating method provided by the present invention, the processing the third sorting result to generate the second target request includes:
combining the 1 st update request and the 2 nd update request of the third sequencing result to obtain a1 st intermediate result;
combining the h intermediate result with the h +2 updating requests to obtain h +1 intermediate result, wherein h is more than or equal to 1 and less than or equal to k-2, and k is the number of the updating requests in the third sequencing result;
judging whether h +2 is smaller than k;
if h +2 is less than k, increasing h by 1, and continuing to execute the step of combining the h intermediate result and the h +2 updating request to generate the h +1 intermediate result;
and if h +2 is not less than k, taking the h +1 th intermediate result as the second target request.
According to an application program interface updating method provided by the invention, adding the target updating requests into a request queue of a current time period comprises the following steps:
classifying the target updating requests to obtain at least one category of the target updating requests;
respectively determining the arrangement sequence of the target updating requests of each category based on the request time respectively corresponding to the target updating requests;
and determining the sort order of the categories, and adding the target updating request of each category into a request queue of the current time period in sequence.
According to the application program interface updating method provided by the invention, the step of adding the target updating request of each category into the request queue of the current time period in sequence comprises the following steps:
judging whether the quantity of the target updating requests is larger than the request quantity threshold value of the request queue of the current time period or not;
if the quantity of the target updating requests is not larger than the request quantity threshold value of the request queue of the current time period, adding the target updating requests of each category into the request queue of the current time period in sequence;
and if the quantity of the target update requests is greater than the threshold value of the number of the requests of the request queue in the current time period, adding the target update requests which are not added into the request queue in the current time period into the request queue in the next time period.
The invention also provides an application program interface updating device, which comprises:
the system comprises an acquisition module, a request queue and a processing module, wherein the acquisition module is used for acquiring a plurality of target updating requests and adding the plurality of target updating requests into the request queue of the current time period;
the judging module is used for judging whether the request queue of the current time period contains the update request of the current time period and the update request of the previous time period;
the first updating module is used for generating a first target request based on the plurality of updating requests in the request queue of the current time period and updating an interface of a target application program based on the first target request if the request queue of the current time period only contains the plurality of updating requests of the current time period;
and the second updating module is used for generating a second target request based on the plurality of updating requests in the request queue of the current time period and the plurality of updating requests in the request queue of the previous time period if the request queue of the current time period comprises the updating requests of the current time period and the updating requests of the previous time period, and updating the interface of the target application program based on the second target request.
According to an application program interface updating apparatus provided by the present invention, the first updating module includes:
the determining submodule is used for determining a plurality of first request times respectively corresponding to a plurality of updating requests in the request queue of the current time period, and sequencing the plurality of updating requests in the request queue of the current time period based on the plurality of first request times to obtain a first sequencing result;
and the processing submodule is used for processing the first sequencing result and generating the first target request.
According to an application program interface updating apparatus provided by the present invention, the second updating module includes:
the first submodule is used for determining an update request of a previous time period and a second request time corresponding to the update request of the previous time period which are contained in the request queue of the current time period, and a plurality of update requests in the request queue of the previous time period and a plurality of second request times corresponding to the update requests;
the second submodule is used for sequencing the update request of the previous time period contained in the request queue of the current time period and the plurality of update requests in the request queue of the previous time period based on the plurality of second request times to obtain a second sequencing result;
the third sub-module is used for processing the second sequencing result and generating an intermediate updating request;
a fourth sub-module, configured to determine the intermediate update request and a plurality of third request times corresponding to the plurality of update requests of the current time period included in the request queue of the current time period, respectively;
a fifth sub-module, configured to rank, based on the multiple third request times, the intermediate update request and the multiple update requests in the current time period, so as to obtain a third ranking result;
and the sixth submodule is used for processing the third sequencing result and generating the second target request.
According to the application program interface updating device provided by the invention, the processing submodule is specifically configured to:
combining the 1 st update request and the 2 nd update request of the first sequencing result to obtain a1 st intermediate result;
combining the ith intermediate result with the (i + 2) th updating request to obtain an (i + 1) th intermediate result, wherein i is more than or equal to 1 and less than or equal to n-2, and n is the number of the updating requests in the first sequencing result;
judging whether i +2 is smaller than n;
if i +2 is less than n, increasing i by 1, and continuously generating the (i + 1) th intermediate result;
and if the i +2 is not less than n, taking the i +1 th intermediate result as the first target request.
According to the application program interface updating apparatus provided by the present invention, the third sub-module is specifically configured to:
merging the 1 st update request and the 2 nd update request of the second sequencing result to obtain a1 st intermediate result;
combining the jth intermediate result with the jth +2 updating requests to obtain a jth +1 intermediate result, wherein j is more than or equal to 1 and less than or equal to m-2, and m is the number of the updating requests in the second sequencing result;
judging whether j +2 is smaller than m;
if j +2 is smaller than m, increasing j by 1, and continuously generating the j +1 th intermediate result;
and if j +2 is not less than m, taking the j +1 th intermediate result as the intermediate updating request.
According to the application program interface updating apparatus provided by the present invention, the sixth sub-module is specifically configured to:
merging the 1 st update request and the 2 nd update request of the third sequencing result to obtain a1 st intermediate result;
combining the h intermediate result with the h +2 updating requests to obtain an h +1 intermediate result, wherein h is more than or equal to 1 and less than or equal to k-2, and k is the number of the updating requests in the third sequencing result;
judging whether h +2 is smaller than k;
if h +2 is less than k, increasing h by 1, and continuously generating the h +1 th intermediate result;
and if h +2 is not less than k, taking the h +1 th intermediate result as the second target request.
According to an application program interface updating apparatus provided by the present invention, the obtaining module includes:
the classification submodule is used for classifying the target updating requests to obtain at least one category of the target updating requests;
the sorting submodule is used for respectively determining the arrangement sequence of the target updating requests of each category based on the request time respectively corresponding to the target updating requests;
and the determining submodule is used for determining the arrangement sequence of the categories and adding the target updating request of each category into the request queue of the current time period in sequence.
According to the application program interface updating device provided by the invention, the determining submodule is specifically configured to:
judging whether the number of the target updating requests is larger than the request number threshold of the request queue of the current time period or not;
if the quantity of the target updating requests is not larger than the request quantity threshold value of the request queue of the current time period, adding the target updating requests of each category into the request queue of the current time period in sequence;
and if the quantity of the target update requests is greater than the threshold value of the number of the requests of the request queue in the current time period, adding the target update requests which are not added into the request queue in the current time period into the request queue in the next time period.
The invention also provides an electronic device, which comprises a memory, a processor and a computer program stored on the memory and capable of running on the processor, wherein the processor executes the program to realize the steps of any one of the application program interface updating methods.
The present invention also provides a non-transitory computer readable storage medium having stored thereon a computer program which, when executed by a processor, performs the steps of the application program interface updating method as described in any of the above.
The invention provides an application program interface updating method. A plurality of target updating requests are obtained and added into a request queue of the current time period; judging whether the request queue of the current time period contains the update request of the current time period and the update request of the previous time period; if the current time slot only contains a plurality of updating requests, generating a first target request based on the plurality of updating requests, and updating an interface of a target application program based on the first target request; and if the update requests of the current time period and the previous time period are contained, generating a second target request based on the plurality of update requests in the request queue of the current time period and the plurality of update requests in the request queue of the previous time period, and updating the interface of the target application program based on the second target request. In the invention, the first target request or the second target request is generated based on the obtained plurality of update requests, the interface of the target application program is updated by using the first target request or the second target request, correspondingly, the interface of the target application program is updated only once, and the problem of interface jump caused by updating the interface of the target application program at the same time by using the plurality of update requests is solved.
Drawings
In order to more clearly illustrate the present invention or the technical solutions in the prior art, the drawings used in the embodiments or the description of the prior art will be briefly described below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and other drawings can be obtained by those skilled in the art without creative efforts.
Fig. 1 is a schematic flowchart of an application interface updating method according to an embodiment of the present invention;
fig. 2 is a schematic flowchart of generating a first target request in an application program interface updating method according to an embodiment of the present invention;
fig. 3 is a schematic flowchart of generating a second target request in the application program interface updating method according to the embodiment of the present invention;
FIG. 4 is a flowchart illustrating a method for updating an application program interface according to an embodiment of the present invention;
FIG. 5 is a schematic structural diagram of an application interface updating apparatus according to an embodiment of the present invention;
fig. 6 is a schematic diagram of a hardware structure of an electronic device according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention clearer, the technical solutions of the present invention will be clearly and completely described below with reference to the accompanying drawings, and it is obvious that the described embodiments are some, but not all embodiments of the present invention. All other embodiments, which can be obtained by a person skilled in the art without inventive step based on the embodiments of the present invention, are within the scope of protection of the present invention.
The figures are purely diagrammatic and not drawn to scale. As used herein, the term "preferred," and similar terms, are used as table approximations and not as table degrees, and are intended to account for inherent deviations in measured or calculated values that will be recognized by those of ordinary skill in the art. It should be noted that in the present description, the expressions "first", "second", "third", etc. are used only to distinguish one feature from another, and do not represent any limitation on the features, and do not particularly represent any order of precedence.
It will be further understood that terms such as "comprising," "including," and/or "containing," when used in this specification, are open-ended and not closed-ended, and specify the presence of stated features, elements, and/or components, but do not preclude the presence or addition of one or more other features, elements, components, and/or groups thereof. Furthermore, when describing embodiments of the present application, the use of "may" mean "one or more embodiments of the present application. Also, the term "exemplary" is intended to refer to examples or illustrations.
Unless otherwise defined, all terms (including engineering and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this application belongs. It will be further understood that terms, such as those defined in commonly used dictionaries, should be interpreted as having a meaning that is consistent with their meaning in the context of the relevant art and will not be interpreted in an idealized or overly formal sense unless expressly so defined herein.
In order to solve the problems in the prior art, embodiments of the present invention provide an application program interface updating method.
Fig. 1 is a flowchart illustrating an application interface updating method according to an embodiment of the present invention. As shown in fig. 1, the method includes:
Specifically, step 101 includes obtaining a plurality of target update requests respectively received by a plurality of interfaces of the target application program, and adding the obtained plurality of target update requests to a request queue of the current time slot. The request queue of the current time period refers to a request queue of which the time range corresponding to the request time is the current time period.
Correspondingly, the plurality of target update requests respectively received by the plurality of interfaces of the target application program refer to the plurality of target update requests respectively sent to the target application program by the server and/or the control end of the control target application program through the plurality of interfaces of the target application program.
Further, adding a plurality of target update requests to a request queue of a current time slot includes:
step 1011, classifying the plurality of target update requests to obtain at least one category of the target update requests.
For example, if 12 target update requests are obtained, the 12 target update requests are classified, and the 12 target update requests may be classified into 3 types, i.e., an insertion element, a deletion element, and an update element.
Step 1012, respectively determining the arrangement order of the target update requests of each category based on the request time corresponding to each of the plurality of target update requests.
Exemplarily, if the type 3 target update requests of the insert element, the delete element, and the update element respectively include 4, 5, and 3 target update requests, the request times corresponding to the plurality of target update requests may be respectively determined; sequencing 4 target updating requests in the insertion element class to obtain a sequencing result of the insertion class requests; sequencing 5 target updating requests in the deleted element class to obtain a sequencing result of the deleted request; and sequencing the 3 target updating requests in the updating element class to obtain a sequencing result of the updating class requests.
And 1013, determining the sort order of the categories, and adding the target update request of each category to the request queue of the current time period in sequence.
Illustratively, the sorted result of the category is determined as any one of insert-delete-update, insert-update-delete, update-delete-insert, delete-update-insert, delete-insert-update, and update-insert-delete. And sequentially adding the insertion type request sorting result, the deletion type request sorting result and the update type request sorting result into the request queue of the current time period according to the determined type sorting result.
It should be noted that the current time period may be specifically determined according to the real-time requirement.
Further, adding the target update request of each category to the request queue of the current time period in sequence, including:
step S1, judging whether the quantity of a plurality of target updating requests is larger than the request quantity threshold value of the request queue of the current time period.
Specifically, step S1 includes determining a threshold number of the request queues in the current time period that can accommodate the update requests and a specific number of the plurality of target update requests, comparing the specific number of the plurality of target update requests with the threshold number of the request queues in the current time period that can accommodate the update requests, and determining whether the specific number of the plurality of target update requests is greater than the threshold number of the request queues in the current time period that can accommodate the update requests.
For example, if the threshold value of the number of the update requests that can be accommodated by the request queue in the current time period is X, and the specific number of the target update requests is Y, Y is compared with X, and it is determined whether Y is greater than X.
And S2, if the number of the target updating requests is not more than the request number threshold of the request queue in the current time period, sequentially adding the target updating requests of each category into the request queue in the current time period.
Specifically, step S2 includes, if the specific number of the target update requests is not greater than the threshold of the number of the update requests that can be accommodated by the request queue in the current time period, sequentially adding the target update requests of each category to the request queue in the current time period.
For example, if the specific number of the target update requests is X1, the threshold value of the number of the update requests that can be accommodated by the request queue of the current time period is Y1, and X1 is less than or equal to Y1, then the target update requests of each category are added to the request queue of the current time period in sequence.
And S3, if the quantity of the target updating requests is larger than the threshold value of the number of the requests of the request queue in the current time period, adding the target updating requests which are not added into the request queue in the current time period into the request queue in the next time period.
Specifically, step S3 includes, if the specific number of the plurality of target update requests is greater than the threshold of the number of update requests that can be accommodated in the request queue in the current time period, sequentially adding the target update requests of each category to the request queue in the current time period according to the predetermined order, and after the request queue in the current time period is full, adding the target update requests that are not added to the request queue in the current time period to the request queue in the next time period.
Illustratively, if the specific number of the plurality of target update requests is X2, the threshold number of the update requests that can be accommodated by the request queue of the current time period is Y2, and X2 is greater than Y2, then sequentially adding the target update requests of each category to the request queue of the current time period, and adding the target update requests that are not added to the request queue of the current time period to the request queue of the next time period according to the established order.
Specifically, step 102 includes determining, according to the request time corresponding to the target update requests, whether the request queue in the current time slot only includes the update request in the current time slot, or includes both the update request in the current time slot and the update request in the previous time slot.
It should be noted that, if the speed of the update request in the previous time period entering the request queue in the previous time period is V1; the speed of the updating request of the previous time period leaving the request queue of the previous time period is V2; when V1 is greater than V2, the thread of the update request of the previous time period entering the request queue of the previous time period will be blocked; and/or when the speed of a certain update request in the previous time period entering the request queue in the previous time period is less than V1 and close to 0, the entering of the update request and the subsequent update request into the request queue in the previous time period is delayed. Therefore, part of the update requests of the previous time period cannot enter the request queue of the previous time period. Furthermore, the update requests of the previous time period which do not enter the request queue of the previous time period enter the request queue of the current time period in sequence.
In addition, in the present invention, the current time period and the previous time period are respectively set according to specific requirements, and meanwhile, the current time period and the previous time period are two adjacent time periods.
Illustratively, if the current time period is t, the corresponding previous time period is t-1.
Specifically, step 103 includes, if the request queue of the current time period only includes the multiple update requests of the current time period, processing the multiple update requests included in the request queue of the current time period to generate a first target request, and updating an interface of the target application program based on the first target request.
Based on the above embodiments, fig. 2 is a schematic flowchart of generating a first target request in an application program interface updating method according to an embodiment of the present invention. As shown in fig. 2, step 103 specifically includes:
The method for obtaining the first ordering result by ordering the plurality of update requests in the request queue of the current time period according to the plurality of first request times may include a plurality of manners, and the present invention does not specifically limit the method.
For example, in the present invention, the plurality of update requests in the request queue of the current time period may be sorted from small to large or from large to small according to the plurality of first request times, and a first sorting result is obtained.
In a specific example, if the request queue of the current time period is a, and a includes the update requests a1, a2, and a3, and the first request time corresponding to each of a1, a2, and a3 is 2 minutes at 12 days 8 at 04-12 months 2021, 14 minutes at 21 days at 12 days 12 at 04-12 months 2021, and 10 minutes at 12 days 12 at 04-12 months 2021, then a1, a2, and a3 are sorted according to the first time from small to large or from large to small to obtain the sorting result of a1-a3-a2 or the sorting result of a2-a3-a1, and further, a1-a3-a2 or a2-a3-a1 is the first sorting result.
For example, if the first sorting result is a1-a3-a2, or a2-a3-a1, it may be determined that a1 or a2 is the 1 st update request of the first sorting result; correspondingly, if a1 is the 1 st update request, combining a1 and a3 to obtain the 1 st intermediate result; or if a2 is the 1 st update request, combining a2 and a3 to obtain the 1 st intermediate result.
Wherein i is more than or equal to 1 and less than or equal to n-2, and n is the number of the updating requests in the first sequencing result.
Illustratively, if the ith intermediate result is X and the i +2 th update request is b10, X and b10 are merged to obtain an i +1 th intermediate result X1.
In step 204, it is determined whether i +2 is smaller than n, if yes, step 205 is executed, and if no, step 206 is executed.
In step 205, if i +2 is smaller than n, increasing i by 1, and continuing to execute step 203.
And step 206, if the i +2 is not less than n, taking the i +1 th intermediate result as a first target request.
In summary, steps 202 through 206 describe the process of processing the first sorted result to generate the first target request.
And step 104, if the request queue of the current time period comprises the update requests of the current time period and the previous time period, generating a second target request based on the plurality of update requests in the request queue of the current time period and the plurality of update requests in the request queue of the previous time period, and updating an interface of the target application program based on the second target request.
Specifically, step 104 includes, if the request queue of the current time period includes both the update request of the current time period and the update request of the previous time period, processing the multiple update requests in the request queue of the current time period and the multiple update requests in the request queue of the previous time period to generate a second target request, and updating the interface of the target application program based on the second target request.
Based on the above embodiments, fig. 3 is a schematic flowchart of generating a second target request in an application program interface updating method according to an embodiment of the present invention. As shown in fig. 3, step 104 specifically includes:
Specifically, step 301 includes determining an update request whose request time included in the request queue of the current time period is located in the previous time period, and a second request time corresponding to the update request; meanwhile, a plurality of updating requests contained in the request queue of the previous time period and second request time corresponding to the updating requests are determined, and then the second request time is obtained.
Step 302, based on the plurality of second request times, the update requests in the previous time period included in the request queue in the current time period and the plurality of update requests in the request queue in the previous time period are sorted to obtain a second sorting result.
The method for obtaining the second ordering result includes various ways of ordering the update request of the previous time period included in the request queue of the current time period and the multiple update requests in the request queue of the previous time period according to the multiple second request times, which is not specifically limited in the present invention.
For example, in the present invention, the update requests of the previous time period included in the request queue of the current time period and the plurality of update requests in the request queue of the previous time period may be sorted in a manner that the time of the plurality of second requests is from small to large, or from large to small, and the second sorting result is obtained.
In one embodiment, if the request queue for the current time period is C, and C includes update requests C1 and C2; the request queue for the previous time period is D, and D includes D1 and D2. Meanwhile, the second request time corresponding to c1, c2, d1 and d2 is 2021, 04, 15, 8, 12 minutes, 2021, 04, 15, 16, 30 minutes, 2021, 04, 15, 12 minutes and 2021, 04, 15, 13, 27 minutes, c1, c2, d1 and d2 are sorted from small to large or from large to small according to the second time to obtain the sorting result of c1-d1-d2-c2 or the sorting result of c2-d2-d1-c1, and further, c1-d1-d2-c2 or c2-d2-d1-c1 is the second sorting result.
For example, if the second sorting result is c1-d1-d2-c2 or c2-d2-d1-c1, it may be determined that c1 or c2 is the 1 st update request of the second sorting result; correspondingly, if c1 is the 1 st update request, c1 and d1 are combined to obtain the 1 st intermediate result; or if c2 is the 1 st update request, combining c2 and d2 to obtain the 1 st intermediate result.
And step 304, combining the jth intermediate result with the j +2 th update request to obtain a j +1 th intermediate result.
Wherein j is more than or equal to 1 and less than or equal to m-2, and m is the number of the updating requests in the second sorting result.
Illustratively, if the jth intermediate result is H and the jth +2 update request is m10, H and m10 are combined to obtain a jth +1 intermediate result Y1.
In step 305, it is determined whether j +2 is smaller than m, if yes, step 306 is executed, and if no, step 307 is executed.
And 307, if j +2 is not less than m, taking the j +1 th intermediate result as an intermediate updating request.
In summary, steps 303 to 307 describe a process of processing the second sorting result to generate the intermediate update request.
Specifically, step 308 includes determining a third request time corresponding to the intermediate update request and third request times corresponding to the multiple update requests in the current time period included in the request queue in the current time period, respectively, so as to obtain multiple third request times.
Step 309, based on the multiple third request times, sorting the intermediate update requests and the multiple update requests in the current time period to obtain a third sorting result.
The intermediate update requests and the multiple update requests in the current time period are sorted according to the multiple third request times, and the manner of obtaining the third sorting result may be multiple, which is not specifically limited in the present invention.
For example, in the present invention, the intermediate update requests and the multiple update requests in the current time period may be sorted in a manner that the time of the multiple third requests is from small to large, or from large to small, so as to obtain a third sorting result.
In a specific example, if the intermediate update request is f1, the plurality of update requests in the current time period are k1, k2, and k3, respectively; and the third request time corresponding to f1, k2 and k3 is 18 minutes at 18 hours at 20 days at 04/20/2021, 16 minutes at 16 hours at 20 days at 04/20/2021, 11 minutes at 01 days at 20/04/2021, and 59 minutes at 11 days at 20/04/2021, respectively, according to the third time, from small to large, or sorting f1, k2 and k3 in a large-to-small mode to obtain a sorting result of k2-k3-k1-f1 or a sorting result of f1-k1-k3-k2, and further, the sorting result of k2-k3-k1-f1 or f1-k1-k3-k2 is a third sorting result.
For example, if the third ordering result is k2-k3-k1-f1 or f1-k1-k3-k2, it may be determined that k2 or f1 is the 1 st update request of the third ordering result; correspondingly, if k2 is the 1 st update request, merging k2 and k3 to obtain the 1 st intermediate result; or if f1 is the 1 st update request, combining f1 and k1 to obtain the 1 st intermediate result.
And 311, combining the h intermediate result with the h +2 update request to obtain an h +1 intermediate result.
Wherein h is more than or equal to 1 and less than or equal to k-2, and k is the number of the update requests in the third sorting result.
Illustratively, if the h-th intermediate result is P and the h + 2-th update request is t10, P and t10 are combined to obtain the h + 1-th intermediate result Z1.
In step 312, it is determined whether h +2 is less than k, if so, step 313 is executed, and if not, step 314 is executed.
And step 314, if h +2 is not less than k, taking the h +1 th intermediate result as a second target request.
In summary, steps 310 to 314 describe a process of processing the third sorting result to generate the second target request.
Based on the above embodiments, fig. 4 is a detailed flowchart of an application program interface updating method according to another embodiment of the present invention. As shown in fig. 4, the method includes:
In step 404, if the request queue of the current time period includes the update requests of the current time period and the previous time period, the update request of the previous time period and the second request time corresponding to the update request of the previous time period included in the request queue of the current time period, and the plurality of update requests and the plurality of second request times corresponding to the update requests in the request queue of the previous time period are determined.
Specifically, processing the first ordering result to generate a first target request includes:
combining the 1 st update request and the 2 nd update request of the first sequencing result to obtain a1 st intermediate result;
combining the ith intermediate result with the (i + 2) th updating request to obtain an (i + 1) th intermediate result, wherein i is more than or equal to 1 and less than or equal to n-2, and n is the number of the updating requests in the first sequencing result;
judging whether i +2 is smaller than n;
if i +2 is less than n, increasing i by 1, and continuing to execute the step of combining the ith intermediate result and the (i + 2) th update request to generate an (i + 1) th intermediate result;
and if the i +2 is not less than n, taking the i +1 th intermediate result as a first target request.
Specifically, the processing the second sorting result to generate an intermediate update request includes:
merging the 1 st update request and the 2 nd update request of the second sequencing result to obtain a1 st intermediate result;
combining the jth intermediate result with the (j + 2) th updating request to obtain a (j + 1) th intermediate result, wherein j is more than or equal to 1 and less than or equal to m-2, and m is the number of the updating requests in the second sequencing result;
judging whether j +2 is smaller than m;
if j +2 is smaller than m, increasing j by 1, and continuing to execute the step of combining the jth intermediate result and the jth +2 updating request to generate a jth +1 intermediate result;
and if j +2 is not less than m, taking the j +1 th intermediate result as an intermediate updating request.
And 409, sequencing the intermediate updating requests and the plurality of updating requests in the current time period based on the plurality of third request times to obtain a third sequencing result.
Specifically, processing the third sorting result to generate a second target request includes:
merging the 1 st update request and the 2 nd update request of the third sequencing result to obtain a1 st intermediate result;
combining the h intermediate result with the h +2 updating requests to obtain an h +1 intermediate result, wherein h is more than or equal to 1 and less than or equal to k-2, and k is the number of the updating requests in the third sequencing result;
judging whether h +2 is smaller than k;
if h +2 is less than k, increasing h by 1, and continuing to execute the step of combining the h intermediate result with the h +2 updating request to generate the h +1 intermediate result;
and if h +2 is not less than k, taking the h +1 th intermediate result as a second target request.
And 411, updating an interface of the target application program by using the generated first target request or second target request.
Based on the above embodiments, in summary, in the present invention, a first target request or a second target request is generated based on a plurality of acquired update requests, and an interface of a target application is updated by using the first target request or the second target request, and correspondingly, the interface of the target application is updated only once, so that the problem of interface jitter caused by performing interface update on the target application at the same time by using a plurality of update requests is solved.
Based on the above embodiments, fig. 5 is a schematic structural diagram of an application interface updating apparatus according to still another embodiment of the present invention. As shown in fig. 5, the application interface updating apparatus includes: an acquisition module 510, a determination module 520, a first update module 530, and a second update module 540.
The obtaining module 510 is configured to obtain a plurality of target update requests, and add the plurality of target update requests to a request queue of a current time period.
Wherein, the obtaining module 510 includes: a classification submodule, an ordering submodule and a determination submodule.
And the classification submodule is used for classifying the target updating requests to obtain at least one category of the target updating requests.
And the sequencing submodule is used for respectively determining the arrangement sequence of the target updating requests of each category based on the request time respectively corresponding to the target updating requests.
And the determining submodule is used for determining the arrangement sequence of the categories and adding the target updating request of each category into the request queue of the current time period in sequence.
Determining a sub-module, specifically configured to:
judging whether the quantity of the plurality of target updating requests is larger than the request quantity threshold value of the request queue of the current time period or not;
if the quantity of the target updating requests is not larger than the request quantity threshold value of the request queue of the current time period, sequentially adding the target updating requests of each category into the request queue of the current time period;
and if the quantity of the target update requests is greater than the threshold value of the number of the requests of the request queue in the current time period, adding the target update requests which are not added into the request queue in the current time period into the request queue in the next time period.
The determining module 520 is configured to determine whether the request queue of the current time period includes an update request of the current time period and an update request of a previous time period.
The first updating module 530 is configured to, if the request queue of the current time period only includes multiple update requests of the current time period, generate a first target request based on the multiple update requests in the request queue of the current time period, and perform interface update on the target application program based on the first target request.
A first update module 530 comprising: a determination submodule and a processing submodule.
The determining submodule is used for determining a plurality of first request times respectively corresponding to a plurality of update requests in the request queue of the current time period, and sequencing the plurality of update requests in the request queue of the current time period based on the plurality of first request times to obtain a first sequencing result.
And the processing submodule is used for processing the first sequencing result and generating a first target request.
A processing submodule, configured to:
combining the 1 st update request and the 2 nd update request of the first sequencing result to obtain a1 st intermediate result;
combining the ith intermediate result with the (i + 2) th updating request to obtain an (i + 1) th intermediate result, wherein i is more than or equal to 1 and less than or equal to n-2, and n is the number of the updating requests in the first sequencing result;
judging whether i +2 is smaller than n;
if i +2 is less than n, increasing i by 1, and continuously generating the (i + 1) th intermediate result;
and if the i +2 is not less than n, taking the i +1 th intermediate result as the first target request.
The second updating module 540 is configured to, if the request queue of the current time period includes update requests of the current time period and a previous time period, generate a second target request based on the multiple update requests in the request queue of the current time period and the multiple update requests in the request queue of the previous time period, and perform interface updating on the target application program based on the second target request.
A second update module 540, comprising: a first sub-module, a second sub-module, a third sub-module, a fourth sub-module, a fifth sub-module, and a sixth sub-module.
The first submodule is used for determining the update request of the previous time period and the corresponding second request time thereof contained in the request queue of the current time period, and the plurality of update requests in the request queue of the previous time period and the corresponding second request times thereof.
And the second submodule is used for sequencing the update requests of the previous time period contained in the request queue of the current time period and the plurality of update requests in the request queue of the previous time period based on the plurality of second request times to obtain a second sequencing result.
And the third sub-module is used for processing the second sequencing result and generating an intermediate updating request.
And the fourth submodule is used for respectively determining the intermediate updating request and a plurality of third request times corresponding to the plurality of updating requests of the current time period contained in the request queue of the current time period.
And the fifth submodule is used for sequencing the intermediate updating request and the plurality of updating requests in the current time period based on the plurality of third request time to obtain a third sequencing result.
And the sixth submodule is used for processing the third sequencing result and generating a second target request.
A third submodule, configured to:
merging the 1 st update request and the 2 nd update request of the second sequencing result to obtain a1 st intermediate result;
combining the jth intermediate result with the jth +2 updating requests to obtain a jth +1 intermediate result, wherein j is more than or equal to 1 and less than or equal to m-2, and m is the number of the updating requests in the second sequencing result;
judging whether j +2 is smaller than m;
if j +2 is smaller than m, increasing j by 1, and continuously generating a j +1 th intermediate result;
and if j +2 is not less than m, taking the j +1 th intermediate result as an intermediate updating request.
A sixth submodule, configured to:
combining the 1 st update request and the 2 nd update request of the third sequencing result to obtain a1 st intermediate result;
combining the h intermediate result with the h +2 updating requests to obtain h +1 intermediate result, wherein h is more than or equal to 1 and less than or equal to k-2, and k is the number of the updating requests in the third sequencing result;
judging whether h +2 is smaller than k;
if h +2 is smaller than k, increasing h by 1, and continuously generating an h +1 intermediate result;
and if h +2 is not less than k, taking the h +1 th intermediate result as a second target request.
Based on the above embodiments, in summary, in the present invention, a first target request or a second target request is generated based on a plurality of acquired update requests, and an interface of a target application is updated by using the first target request or the second target request, and correspondingly, the interface of the target application is updated only once, so that the problem of interface jitter caused by performing interface update on the target application at the same time by using a plurality of update requests is solved.
Fig. 6 is a schematic hardware structure diagram of an electronic device according to an embodiment of the present invention. As shown in fig. 6, the electronic device may include: a processor 610, a communication interface 620, a memory 630, and a communication bus 640; the processor 610, the communication interface 620, and the memory 630 are all in communication with each other through a communication bus 640. Processor 610 may invoke logic instructions in memory 630 to perform a provided application interface update method comprising: acquiring a plurality of target updating requests, and adding the target updating requests into a request queue of the current time period; judging whether the request queue of the current time period contains the update request of the current time period and the update request of the previous time period; if the request queue of the current time period only comprises a plurality of update requests of the current time period, generating a first target request based on the plurality of update requests in the request queue of the current time period, and updating an interface of a target application program based on the first target request; if the request queue of the current time period comprises the update requests of the current time period and the previous time period, generating a second target request based on the plurality of update requests in the request queue of the current time period and the plurality of update requests in the request queue of the previous time period, and updating an interface of a target application program based on the second target request.
In addition, the logic instructions in the memory 630 may be implemented in software functional units and stored in a computer readable storage medium when the logic instructions are sold or used as independent products. Based on such understanding, the technical solution of the present invention may be embodied in the form of a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk, and various media capable of storing program codes.
In another aspect, the present invention also provides a computer program product comprising a computer program stored on a non-transitory computer-readable storage medium, the computer program comprising program instructions which, when executed by a computer, enable the computer to perform the application interface updating method provided by the above methods, the method comprising: acquiring a plurality of target updating requests, and adding the plurality of target updating requests into a request queue of the current time period; judging whether the request queue of the current time period contains the update request of the current time period and the update request of the previous time period; if the request queue of the current time slot only contains a plurality of updating requests of the current time slot, generating a first target request based on the plurality of updating requests in the request queue of the current time slot, and updating an interface of a target application program based on the first target request; if the request queue of the current time period comprises the update requests of the current time period and the previous time period, generating a second target request based on the plurality of update requests in the request queue of the current time period and the plurality of update requests in the request queue of the previous time period, and updating an interface of a target application program based on the second target request.
In yet another aspect, the present invention also provides a non-transitory computer-readable storage medium, on which a computer program is stored, the computer program being implemented by a processor to perform the method for updating an application program interface provided in the above steps, the method including: acquiring a plurality of target updating requests, and adding the plurality of target updating requests into a request queue of the current time period; judging whether the request queue of the current time period contains the update request of the current time period and the update request of the previous time period; if the request queue of the current time period only comprises a plurality of update requests of the current time period, generating a first target request based on the plurality of update requests in the request queue of the current time period, and updating an interface of a target application program based on the first target request; if the request queue of the current time period comprises the update requests of the current time period and the previous time period, generating a second target request based on the plurality of update requests in the request queue of the current time period and the plurality of update requests in the request queue of the previous time period, and updating an interface of a target application program based on the second target request.
The above-described embodiments of the apparatus are merely illustrative, and the units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one position, or may be distributed on multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment. One of ordinary skill in the art can understand and implement it without inventive effort.
Through the above description of the embodiments, those skilled in the art will clearly understand that each embodiment can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware. Based on the understanding, the above technical solutions substantially or otherwise contributing to the prior art may be embodied in the form of a software product, which may be stored in a computer-readable storage medium, such as ROM/RAM, magnetic disk, optical disk, etc., and includes several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the method according to the various embodiments or some parts of the embodiments.
Finally, it should be noted that: the above examples are only intended to illustrate the technical solution of the present invention, and not to limit it; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present invention.
Claims (6)
1. An application program interface updating method is characterized by comprising the following steps:
acquiring a plurality of target updating requests, and adding the target updating requests into a request queue of the current time period;
judging whether the request queue of the current time period contains the update request of the current time period and the update request of the previous time period;
if the request queue of the current time slot only contains a plurality of updating requests of the current time slot, generating a first target request based on the plurality of updating requests in the request queue of the current time slot, and updating an interface of a target application program based on the first target request;
if the request queue of the current time period comprises the update requests of the current time period and the previous time period, generating a second target request based on a plurality of update requests in the request queue of the current time period and a plurality of update requests in the request queue of the previous time period, and updating an interface of a target application program based on the second target request; the generating a first target request based on a plurality of update requests in the request queue for the current time period comprises:
determining a plurality of first request times respectively corresponding to a plurality of update requests in the request queue of the current time period, and sequencing the plurality of update requests in the request queue of the current time period based on the plurality of first request times to obtain a first sequencing result;
processing the first sequencing result to generate the first target request; the generating a second target request based on the plurality of update requests in the request queue for the current time period and the plurality of update requests in the request queue for the previous time period comprises:
determining an update request of a previous time period and a second request time corresponding to the update request of the previous time period, which are contained in the request queue of the current time period, and a plurality of update requests in the request queue of the previous time period and a plurality of second request times corresponding to the update requests;
based on the second request times, sequencing the update request of the previous time period contained in the request queue of the current time period and the update requests in the request queue of the previous time period to obtain a second sequencing result;
processing the second sequencing result to generate an intermediate updating request;
respectively determining the intermediate updating request and a plurality of third request times corresponding to a plurality of updating requests of the current time period contained in the request queue of the current time period;
based on the third request times, sequencing the intermediate updating request and the updating requests in the current time period to obtain a third sequencing result;
processing the third sequencing result to generate the second target request; the processing the first ordering result to generate the first target request includes:
merging the 1 st update request and the 2 nd update request of the first sequencing result to obtain a1 st intermediate result;
combining the ith intermediate result with the (i + 2) th updating request to obtain an (i + 1) th intermediate result, wherein i is more than or equal to 1 and is less than or equal to n-2, and n is the number of the updating requests in the first sequencing result;
judging whether i +2 is smaller than n;
if i +2 is less than n, increasing i by 1, and continuing to execute the step of combining the ith intermediate result and the (i + 2) th updating request to generate the (i + 1) th intermediate result;
if i +2 is not less than n, taking the i +1 th intermediate result as the first target request;
the processing the third sorting result to generate the second target request includes:
merging the 1 st update request and the 2 nd update request of the third sequencing result to obtain a1 st intermediate result;
combining the h intermediate result with the h +2 updating requests to obtain an h +1 intermediate result, wherein h is more than or equal to 1 and less than or equal to k-2, and k is the number of the updating requests in the third sequencing result;
judging whether h +2 is smaller than k;
if h +2 is less than k, increasing h by 1, and continuing to execute the step of combining the h intermediate result and the h +2 updating request to generate the h +1 intermediate result;
and if h +2 is not less than k, taking the h +1 th intermediate result as the second target request.
2. The method for updating an application program interface according to claim 1, wherein the processing the second ranking result to generate an intermediate update request comprises:
merging the 1 st update request and the 2 nd update request of the second sequencing result to obtain a1 st intermediate result;
combining the jth intermediate result with the (j + 2) th updating request to obtain a (j + 1) th intermediate result, wherein j is more than or equal to 1 and less than or equal to m-2, and m is the number of the updating requests in the second sequencing result;
judging whether j +2 is smaller than m;
if j +2 is smaller than m, increasing j by 1, and continuing to execute the step of combining the jth intermediate result and the jth +2 updating request to generate a jth +1 intermediate result;
and if j +2 is not less than m, taking the j +1 th intermediate result as the intermediate updating request.
3. The method for updating an application program interface according to claim 1, wherein the adding the plurality of target update requests to a request queue of a current time slot comprises:
classifying the target updating requests to obtain at least one category of the target updating requests;
respectively determining the arrangement sequence of the target updating requests of each category based on the request time respectively corresponding to the target updating requests;
and determining the sort order of the categories, and adding the target updating request of each category into a request queue of the current time period in sequence.
4. The method according to claim 3, wherein said sequentially adding the target update request of each of the categories to a request queue of a current time period comprises:
judging whether the number of the target updating requests is larger than the request number threshold of the request queue of the current time period or not;
if the quantity of the target updating requests is not larger than the request quantity threshold value of the request queue of the current time period, adding the target updating requests of each category into the request queue of the current time period in sequence;
and if the quantity of the target update requests is greater than the threshold value of the number of the requests of the request queue in the current time period, adding the target update requests which are not added into the request queue in the current time period into the request queue in the next time period.
5. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the steps of the application interface updating method according to any of claims 1-4 are implemented when the processor executes the program.
6. A non-transitory computer readable storage medium, in which a computer program is stored, which, when being executed by a processor, carries out the steps of the application program interface updating method according to any one of claims 1 to 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110970380.1A CN113885902B (en) | 2021-08-23 | 2021-08-23 | Application program interface updating method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110970380.1A CN113885902B (en) | 2021-08-23 | 2021-08-23 | Application program interface updating method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113885902A CN113885902A (en) | 2022-01-04 |
| CN113885902B true CN113885902B (en) | 2022-10-11 |
Family
ID=79011178
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110970380.1A Active CN113885902B (en) | 2021-08-23 | 2021-08-23 | Application program interface updating method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113885902B (en) |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108924187A (en) * | 2018-06-07 | 2018-11-30 | 北京百度网讯科技有限公司 | Task processing method, device and terminal device based on machine learning |
| CN109451076A (en) * | 2018-12-29 | 2019-03-08 | 乐蜜有限公司 | A kind of the merging treatment method, apparatus and electronic equipment of network request |
| CN110020383A (en) * | 2018-06-01 | 2019-07-16 | 阿里巴巴集团控股有限公司 | A kind of page data request processing method and processing device |
| US10445322B1 (en) * | 2018-11-29 | 2019-10-15 | Capital One Services, Llc | Real-time processing of event-based streaming with NoSQL |
| CN110888704A (en) * | 2019-11-08 | 2020-03-17 | 北京浪潮数据技术有限公司 | High-concurrency interface processing method, device, equipment and storage medium |
| CN111294369A (en) * | 2018-12-06 | 2020-06-16 | 阿里巴巴集团控股有限公司 | Page request processing method and device and electronic equipment |
| CN111459596A (en) * | 2020-03-31 | 2020-07-28 | 联想(北京)有限公司 | Information processing method, information processing apparatus, electronic device, and medium |
| CN112182445A (en) * | 2019-07-02 | 2021-01-05 | 北京京东尚科信息技术有限公司 | Method and device for optimizing client page performance |
| JP2021071929A (en) * | 2019-10-31 | 2021-05-06 | 京セラドキュメントソリューションズ株式会社 | Api call handling system and api call handling program |
| CN112905928A (en) * | 2021-05-07 | 2021-06-04 | 杭州米络星科技(集团)有限公司 | Webpage refreshing method and device, electronic equipment and storage medium |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10210225B2 (en) * | 2015-09-10 | 2019-02-19 | Sap Se | Controlling interactions between an application user interface and a database |
| CN111324615A (en) * | 2018-12-13 | 2020-06-23 | 北京京东尚科信息技术有限公司 | Data processing method, device, medium and electronic equipment |
-
2021
- 2021-08-23 CN CN202110970380.1A patent/CN113885902B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110020383A (en) * | 2018-06-01 | 2019-07-16 | 阿里巴巴集团控股有限公司 | A kind of page data request processing method and processing device |
| CN108924187A (en) * | 2018-06-07 | 2018-11-30 | 北京百度网讯科技有限公司 | Task processing method, device and terminal device based on machine learning |
| US10445322B1 (en) * | 2018-11-29 | 2019-10-15 | Capital One Services, Llc | Real-time processing of event-based streaming with NoSQL |
| CN111294369A (en) * | 2018-12-06 | 2020-06-16 | 阿里巴巴集团控股有限公司 | Page request processing method and device and electronic equipment |
| CN109451076A (en) * | 2018-12-29 | 2019-03-08 | 乐蜜有限公司 | A kind of the merging treatment method, apparatus and electronic equipment of network request |
| CN112182445A (en) * | 2019-07-02 | 2021-01-05 | 北京京东尚科信息技术有限公司 | Method and device for optimizing client page performance |
| JP2021071929A (en) * | 2019-10-31 | 2021-05-06 | 京セラドキュメントソリューションズ株式会社 | Api call handling system and api call handling program |
| CN110888704A (en) * | 2019-11-08 | 2020-03-17 | 北京浪潮数据技术有限公司 | High-concurrency interface processing method, device, equipment and storage medium |
| CN111459596A (en) * | 2020-03-31 | 2020-07-28 | 联想(北京)有限公司 | Information processing method, information processing apparatus, electronic device, and medium |
| CN112905928A (en) * | 2021-05-07 | 2021-06-04 | 杭州米络星科技(集团)有限公司 | Webpage refreshing method and device, electronic equipment and storage medium |
Non-Patent Citations (2)
| Title |
|---|
| Android: Update UI from a queue;Adam Matan;《https://stackoverflow.com/questions/13339815/android-update-ui-from-a-queue》;20121112;1-2 * |
| 基于智能终端的多屏互动机制的研究与设计;刘要华;《中国优秀博硕士学位论文全文数据库(硕士)信息科技辑》;20150315;I138-787 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113885902A (en) | 2022-01-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109918498B (en) | Problem warehousing method and device | |
| CN111160624B (en) | User intention prediction method, user intention prediction device and terminal equipment | |
| CN113379301A (en) | Method, device and equipment for classifying users through decision tree model | |
| CN113032117A (en) | Deep learning framework training method and device and storage medium | |
| CN110990627A (en) | Knowledge graph construction method and device, electronic equipment and medium | |
| CN110598869A (en) | Sequence model based classification method and device and electronic equipment | |
| CN110275779B (en) | Resource acquisition method, device, equipment and storage medium | |
| CN113885902B (en) | Application program interface updating method | |
| CN111784246B (en) | Logistics path estimation method | |
| CN111950237B (en) | Sentence rewriting method, sentence rewriting device and electronic equipment | |
| CN107688596B (en) | Burst topic detection method and burst topic detection equipment | |
| US20050108252A1 (en) | Incremental process system and computer useable medium for extracting logical implications from relational data based on generators and faces of closed sets | |
| WO2015120574A1 (en) | Worker group identification | |
| CN114662568A (en) | Data classification method, device, equipment and storage medium | |
| CN113112084A (en) | Training plane rear body research and development flow optimization method and device | |
| CN112860626A (en) | Document sorting method and device and electronic equipment | |
| CN112528021A (en) | Model training method, model training device and intelligent equipment | |
| CN110990256A (en) | Open source code detection method, device and computer readable storage medium | |
| CN113886723B (en) | Method and device for determining ordering stability, storage medium and electronic equipment | |
| CN112632929B (en) | Method and device for intelligently recommending chart based on table data and electronic equipment | |
| CN113515495B (en) | Data file distribution method and device, intelligent equipment and computer storage medium | |
| CN114239721A (en) | Model feature selection method and device and computer readable storage medium | |
| CN110209763A (en) | Data processing method, device and computer readable storage medium | |
| CN115150668B (en) | Video prompting method, device, equipment and computer storage medium | |
| CN112509640B (en) | Gene ontology item name generation method and device and storage medium |
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 | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20220314 Address after: 100085 Floor 101 102-1, No. 35 Building, No. 2 Hospital, Xierqi West Road, Haidian District, Beijing Applicant after: Seashell Housing (Beijing) Technology Co.,Ltd. Address before: 101309 room 24, 62 Farm Road, Erjie village, Yangzhen, Shunyi District, Beijing Applicant before: Beijing fangjianghu Technology Co.,Ltd. |
|
| TA01 | Transfer of patent application right | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |