CN116450279A - Virtual task stack processing method and device - Google Patents

Virtual task stack processing method and device Download PDF

Info

Publication number
CN116450279A
CN116450279A CN202210023394.7A CN202210023394A CN116450279A CN 116450279 A CN116450279 A CN 116450279A CN 202210023394 A CN202210023394 A CN 202210023394A CN 116450279 A CN116450279 A CN 116450279A
Authority
CN
China
Prior art keywords
page
started
affinity
task stack
starting
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
Application number
CN202210023394.7A
Other languages
Chinese (zh)
Inventor
袁科杰
金炼城
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Youzhuju Network Technology Co Ltd
Original Assignee
Beijing Youzhuju Network Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing Youzhuju Network Technology Co Ltd filed Critical Beijing Youzhuju Network Technology Co Ltd
Priority to CN202210023394.7A priority Critical patent/CN116450279A/en
Priority to PCT/CN2023/070293 priority patent/WO2023131146A1/en
Publication of CN116450279A publication Critical patent/CN116450279A/en
Pending legal-status Critical Current

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/455—Emulation; Interpretation; Software simulation, e.g. virtualisation or emulation of application or operating system execution engines
    • G06F9/45533—Hypervisors; Virtual machine monitors
    • G06F9/45558—Hypervisor-specific management and integration aspects
    • A—HUMAN NECESSITIES
    • A63—SPORTS; GAMES; AMUSEMENTS
    • A63F—CARD, BOARD, OR ROULETTE GAMES; INDOOR GAMES USING SMALL MOVING PLAYING BODIES; VIDEO GAMES; GAMES NOT OTHERWISE PROVIDED FOR
    • A63F13/00—Video games, i.e. games using an electronically generated display having two or more dimensions
    • A63F13/70—Game security or game management aspects
    • A63F13/77—Game security or game management aspects involving data related to game devices or game servers, e.g. configuration data, software version or amount of memory
    • 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
    • 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/44505—Configuring for program initiating, e.g. using registry, configuration files
    • 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/455—Emulation; Interpretation; Software simulation, e.g. virtualisation or emulation of application or operating system execution engines
    • A—HUMAN NECESSITIES
    • A63—SPORTS; GAMES; AMUSEMENTS
    • A63F—CARD, BOARD, OR ROULETTE GAMES; INDOOR GAMES USING SMALL MOVING PLAYING BODIES; VIDEO GAMES; GAMES NOT OTHERWISE PROVIDED FOR
    • A63F2300/00—Features of games using an electronically generated display having two or more dimensions, e.g. on a television screen, showing representations related to the game
    • A63F2300/50—Features of games using an electronically generated display having two or more dimensions, e.g. on a television screen, showing representations related to the game characterized by details of game servers
    • A63F2300/55—Details of game data or player data management
    • A63F2300/552—Details of game data or player data management for downloading to client devices, e.g. using OS version, hardware or software profile of the client device
    • 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/455—Emulation; Interpretation; Software simulation, e.g. virtualisation or emulation of application or operating system execution engines
    • G06F9/45533—Hypervisors; Virtual machine monitors
    • G06F9/45558—Hypervisor-specific management and integration aspects
    • G06F2009/45575—Starting, stopping, suspending or resuming virtual machine instances
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management

Landscapes

  • Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Multimedia (AREA)
  • Business, Economics & Management (AREA)
  • Computer Security & Cryptography (AREA)
  • General Business, Economics & Management (AREA)
  • Memory System Of A Hierarchy Structure (AREA)
  • Stored Programmes (AREA)

Abstract

The application discloses a processing method of a virtual task stack, wherein before a page to be started is started, starting parameters of the page to be started and starting parameters of a source page of the page to be started can be obtained. Determining the virtual affinity of the page to be started based on the starting parameters of the page to be started and the starting parameters of the source page; and then, determining a target virtual task stack for storing the page to be started based on the virtual affinity of the page to be started. Therefore, the virtual affinity is determined according to the starting parameters of the page to be started and the starting parameters of the source page, and therefore, the factors required to be considered for starting the page to be started based on the source page are comprehensively considered, and therefore, the starting effect of the page to be started can be expected by using the determined target virtual task stack to store the page to be started.

Description

Virtual task stack processing method and device
Technical Field
The present invention relates to the field of computer technologies, and in particular, to a method and an apparatus for processing a virtual task stack.
Background
The installation-free technique provides a complete virtual operating environment. The application program of the installation-free technology is applied, and the installation of the application program is not required to be installed on a system, so that the operation effect which can be achieved by installing the application program can be achieved.
For example: a game box is an application that employs installation-free technology. The game box is a mode for realizing a game platform and distribution, and the Android (Android) plug-in technology is required for realizing the game box, and the plug-in mode is used for running the game. If the game is run using a plug-in approach, the page jump problem can be handled using a game box. In one implementation: virtual task stacks can be newly added by the game box middleware and mapped to the system task stacks through the virtual task stacks, so that the management of the task stacks is performed instead of a system. Wherein the virtual task stack is used for managing game pages.
The existing virtual task stack processing method has the problem that the starting effect of the application program page does not meet the expectations, so that a scheme is urgently needed to solve the problems.
Disclosure of Invention
The technical problem to be solved by the method and the device is that the starting effect of the application program page is not in line with the expectations due to the virtual stack processing mode, and a virtual task stack processing method and device are provided.
In a first aspect, an embodiment of the present application provides a method for processing a virtual task stack, where the method includes:
acquiring starting parameters of a page to be started and starting parameters of a source page of the page to be started;
determining the virtual affinity of the page to be started based on the starting parameters of the page to be started and the starting parameters of the source page;
and determining a target virtual task stack for storing the page to be started based on the virtual affinity.
Optionally, the virtual affinity of the page to be started includes:
the first affinity is the real affinity of the page to be started, or the second affinity is the affinity of a first virtual task stack, and the first virtual task stack is the virtual task stack for storing the source page.
Optionally, if the virtual affinity is the first affinity, the determining, based on the virtual affinity, a target virtual task stack for storing the page to be started includes:
and determining the target virtual task stack based on the first affinity and the starting parameters of the page to be started.
Optionally, the determining the target virtual task stack based on the virtual affinity and the starting parameter of the page to be started includes:
Determining a virtual task stack with the affinity degree of the first affinity degree from the existing virtual task stacks as a pending virtual task stack;
and under the condition that the undetermined virtual task stack accords with the starting parameters of the page to be started, determining the undetermined virtual task stack as the target virtual task stack.
Optionally, the determining the target virtual task stack based on the virtual affinity and the starting parameter of the page to be started includes:
and creating the target virtual task stack based on the starting parameters of the page to be started, wherein the affinity of the target virtual task stack is the first affinity.
Optionally, if the virtual affinity is the second affinity, the determining, based on the virtual affinity, a target virtual task stack for storing the page to be started includes:
and determining the target virtual task stack based on the second affinity, the starting parameters of the page to be started and the starting parameters of the source page.
Optionally, the determining the target virtual task stack based on the virtual affinity, the starting parameter of the page to be started, and the starting parameter of the source page includes:
Determining a virtual task stack with the affinity degree of the second affinity degree from the existing virtual task stacks as a pending virtual task stack;
and determining the undetermined virtual task stack as the target virtual task stack under the condition that the undetermined virtual task stack accords with the starting parameters of the page to be started and the starting parameters of the source page.
Optionally, the determining the target virtual task stack based on the virtual affinity, the starting parameter of the page to be started, and the starting parameter of the source page includes:
and creating the target virtual task stack based on the starting parameters of the page to be started or the starting parameters of the source page, wherein the affinity of the target virtual task stack is the second affinity.
Optionally, the starting parameters include a starting mode and a starting flag, and the starting mode and the starting flag of the page to be started have a conflict, and the determining the target virtual task stack based on the first affinity and the starting parameters of the page to be started includes:
and if the predetermined priority relation indicates that the priority of the starting mode of the page to be started is higher than the starting mark of the page to be started, determining the target virtual task stack based on the first affinity and the starting mode of the page to be started.
Or if the predetermined priority relation indicates that the priority of the starting mode of the page to be started is lower than the starting mark of the page to be started, determining the target virtual task stack based on the first affinity and the starting mark of the page to be started.
Optionally, the starting parameters include a starting mode and a starting flag, and if there is a conflict between the starting mode and the starting flag of the page to be started, determining the target virtual task stack based on the second affinity, the starting parameters of the page to be started, and the starting parameters of the source page includes:
if the predetermined priority relation indicates that the priority of the starting mode of the page to be started is higher than the starting mark of the page to be started, determining the target virtual task stack based on the second affinity, the starting mode of the page to be started and the starting parameters of the source page;
or if the predetermined priority relation indicates that the priority of the starting mode of the page to be started is lower than the starting mark of the page to be started, determining the target virtual task stack based on the second affinity, the starting mark of the page to be started and the starting parameter of the source page.
In a second aspect, an embodiment of the present application provides a processing apparatus for a virtual task stack, where the apparatus includes:
the device comprises an acquisition unit, a starting unit and a starting unit, wherein the acquisition unit is used for acquiring starting parameters of a page to be started and starting parameters of a source page of the page to be started;
the first determining unit is used for determining the virtual affinity of the page to be started based on the starting parameters of the page to be started and the starting parameters of the source page;
and the second determining unit is used for determining a target virtual task stack for storing the page to be started based on the virtual affinity.
Optionally, the virtual affinity of the page to be started includes:
the first affinity is the real affinity of the page to be started, or the second affinity is the affinity of a first virtual task stack, and the first virtual task stack is the virtual task stack for storing the source page.
Optionally, if the virtual affinity is the first affinity, the second determining unit is configured to:
and determining the target virtual task stack based on the first affinity and the starting parameters of the page to be started.
Optionally, the second determining unit is configured to:
Determining a virtual task stack with the affinity degree of the first affinity degree from the existing virtual task stacks as a pending virtual task stack;
and under the condition that the undetermined virtual task stack accords with the starting parameters of the page to be started, determining the undetermined virtual task stack as the target virtual task stack.
Optionally, the second determining unit is configured to:
and creating the target virtual task stack based on the starting parameters of the page to be started, wherein the affinity of the target virtual task stack is the first affinity.
Optionally, if the virtual affinity is the second affinity, the second determining unit is configured to:
and determining the target virtual task stack based on the second affinity, the starting parameters of the page to be started and the starting parameters of the source page.
Optionally, the second determining unit is configured to:
determining a virtual task stack with the affinity degree of the second affinity degree from the existing virtual task stacks as a pending virtual task stack;
and determining the undetermined virtual task stack as the target virtual task stack under the condition that the undetermined virtual task stack accords with the starting parameters of the page to be started and the starting parameters of the source page.
Optionally, the second determining unit is configured to:
and creating the target virtual task stack based on the starting parameters of the page to be started or the starting parameters of the source page, wherein the affinity of the target virtual task stack is the second affinity.
Optionally, the start parameter includes a start mode and a start flag, and the start mode and the start flag of the page to be started have a conflict, and the second determining unit is configured to:
and if the predetermined priority relation indicates that the priority of the starting mode of the page to be started is higher than the starting mark of the page to be started, determining the target virtual task stack based on the first affinity and the starting mode of the page to be started.
Or if the predetermined priority relation indicates that the priority of the starting mode of the page to be started is lower than the starting mark of the page to be started, determining the target virtual task stack based on the first affinity and the starting mark of the page to be started.
Optionally, the starting parameter includes a starting mode and a starting flag, and if there is a conflict between the starting mode and the starting flag of the page to be started, the second determining unit is configured to:
If the predetermined priority relation indicates that the priority of the starting mode of the page to be started is higher than the starting mark of the page to be started, determining the target virtual task stack based on the second affinity, the starting mode of the page to be started and the starting parameters of the source page;
or if the predetermined priority relation indicates that the priority of the starting mode of the page to be started is lower than the starting mark of the page to be started, determining the target virtual task stack based on the second affinity, the starting mark of the page to be started and the starting parameter of the source page.
In a third aspect, embodiments of the present application provide an apparatus comprising a processor and a memory;
the processor is configured to execute instructions stored in the memory to cause the apparatus to perform the method of any one of the first aspects above.
In a fourth aspect, embodiments of the present application provide a computer-readable storage medium, including instructions that instruct a device to perform the method of any one of the first aspect above.
In a fifth aspect, embodiments of the present application provide a computer program product which, when run on a computer, causes the computer to perform the method of any one of the first aspects above.
Compared with the prior art, the embodiment of the application has the following advantages:
the embodiment of the application provides a processing method of a virtual task stack, and specifically, before a page to be started is started, starting parameters of the page to be started and starting parameters of a source page of the page to be started can be obtained. Determining the virtual affinity of the page to be started based on the starting parameters of the page to be started and the starting parameters of the source page; and then, determining a target virtual task stack for storing the page to be started based on the virtual affinity of the page to be started. Therefore, the factors required to start the page to be started based on the source page are comprehensively considered, and therefore the starting effect of the page to be started can be expected by using the determined target virtual task stack to store the page to be started.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings that are required to be 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 only some embodiments described in the present application, and other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
Fig. 1 is a flow chart of a method for processing a virtual task stack according to an embodiment of the present application;
fig. 2 is a schematic structural diagram of a processing device of a virtual task stack according to an embodiment of the present application;
fig. 3 is a schematic structural diagram of an apparatus according to an embodiment of the present application 。
Detailed Description
In order to make the present application solution better understood by those skilled in the art, the following description will clearly and completely describe the technical solution in the embodiments of the present application with reference to the accompanying drawings in the embodiments of the present application, and it is apparent that the described embodiments are only some embodiments of the present application, not all embodiments. All other embodiments, which can be made by one of ordinary skill in the art without undue burden from the present disclosure, are within the scope of the present disclosure.
The inventor of the application finds that in the conventional technology, before starting a page, a virtual stack storing the page to be started can be determined according to the affinity of the page to be started and the starting parameters of the page to be started. The affinity of the virtual task stack for storing the page to be started is necessarily the affinity of the page to be started. However, in this way, in some scenarios, the effect after the page to be started is not expected.
Wherein: the starting parameters include: and (5) starting a mode. In the android system, the starting modes may include standard, singleTop, singleTask and single element. In addition, in order to achieve additional page launch effects, the launch parameters may also include a launch flag (flag). The start mode and start flag are not described in detail here.
Wherein:
the standard is the default startup mode.
The singetop indicates that when the page to be started is already in the virtual task stack, the virtual task stack is multiplexed. In other words, the singetop indicates that if there is already one page (e.g., C page) at the top of the virtual task stack, the page (e.g., C page) cannot be started again.
The singetask indicates that the page to be started needs to be at the top of the virtual task stack, and other pages stored in the virtual task stack need to be popped up.
The single instance mode is a global single instance mode, which means that when a virtual task stack corresponding to a certain page is created, and the page needs to be started, the corresponding virtual task stack is not created again. In other words, when the start mode of a certain page is single, only one page can be stored in the virtual task stack of the page.
Regarding the start flag of the page to be started, the embodiment of the present application is not specifically limited. In one example, the start-up flag may include a multitask indicating that a virtual task stack needs to be created to store pages.
Several possible scenarios are presented below.
Scene 1: the affinity of the virtual task stack of the page A is abc, and the starting mode of the page A is single task; the task stack affinity of the B page is default and the start mode is standard.
When starting a B page on the basis of an a page, the desired effect is that the B page is directly superimposed on the a page. In other words, the virtual task stack storing the B page should be the virtual task stack storing the a page, where the affinity of the virtual task stack storing the a page is abc.
However, in the conventional technology, the affinity of the virtual task stack storing the B page is determined by the page affinity of the B page itself, so when the B page is started, the B page is stored in the virtual task stack with default affinity, instead of the virtual task stack with abc affinity, so that the starting effect of the B page is not expected.
Scene 2: the affinity of the page A defaults, and the starting mode is single Instance; the affinity of the B page is default, and the starting mode is single Top.
In the conventional technology, the B page is stored in the virtual task stack where the a page is located, but the start mode of the a page indicates that the virtual task stack can only store one page. Therefore, the startup effect of the B page is not expected.
Scene 3: the A page and the B page are the same page, and the starting parameters of the A page and the B page are: the start mode is singetask or singetop and the start flag is multiplexing Task.
When starting page B on page a basis, the desired effect is not to restart page B. In the conventional technology, a new virtual task stack is newly created to store the page B, and the page B is started.
Scene 4: the affinity of the page A is default, the starting mode is standard, and the starting flag is multiple task; the affinity of the B page is default, the starting mode is standard, and the flag is not started.
When starting the B page on the a page basis, the desired effect is: and storing the B page in a virtual task stack for storing the A page.
In the conventional technology, when the first page of the application is started, a virtual task stack (for example, the virtual task stack 1) is created, and the affinity of the virtual task stack 1 is default. After the a page is started, a virtual task stack (e.g. virtual task stack 2) is created again according to the starting flag of the a page to store the a page, and the affinity of the virtual task stack 2 storing the a page is also default. When the B page is started, the virtual task stack 1 is determined to be the virtual task stack for storing the page B from the two virtual task stacks with default affinities according to the page starting sequence of the application.
Scene 5: the A page and the B page are the same page. The affinity of the page A is the default affinity, and the starting mode is single task; the startup mode of the B page is single task and the startup flag is multiple task.
When starting the B page on the a page basis, the desired effect is: the B page is not started. However, in the conventional technology, a virtual task stack is created to store the B page, and the B page is restarted.
Scene 6: the A page and the B page are the same page. The affinity of the page A is the default affinity, and the starting mode is single Top; the start mode of the B page is single Top and the start flag is multiple Task.
When starting the B page on the a page basis, the desired effect is: the B page is not started. However, in the conventional technology, a virtual task stack is created to store the B page, and the B page is restarted.
It should be noted that, the affinity of the page mentioned above refers to the true affinity of the page. For an android operating system, the true affinity of a page can be defined in android development file android management.
In order to solve the above problem, the embodiments of the present application provide a method for processing a virtual task stack, which can make the starting effect of a page meet the expectations.
Various non-limiting embodiments of the present application are described in detail below with reference to the attached drawing figures.
Exemplary method
Referring to fig. 1, the flow chart of a virtual task stack processing method provided in the embodiment of the present application is shown. The method provided by the embodiment of the application may be performed by an installation-free application, which may be, for example, a game application, and the embodiment of the application is not specifically limited.
The method shown in fig. 1 may, for example, comprise the steps of: S101-S103.
S101: and acquiring the starting parameters of the page to be started and the starting parameters of the source page of the page to be started.
The page to be started in the embodiment of the application is a certain page which needs to be loaded in the installation-free application running process.
In one example, the launch parameters for a page may be defined in android development file android management. Therefore, in the embodiment of the application, the starting parameters of the page to be started and the starting parameters of the source page can be obtained through android management file xml.
Regarding the startup parameters, it should be noted that, for a page, the startup parameters of the page are used to describe the startup effect of the page. In one example, the start-up parameters include: and (5) starting a mode. In the android system, the starting modes may include standard, singleTop, singleTask and single element. In addition, in order to achieve additional page launch effects, the launch parameters may also include a launch flag (flag). Regarding the start mode and start flag, reference is made to the relevant description section above, and the description is not repeated here.
Regarding the source page of the page to be started, it should be noted that the source page of the page to be started refers to a page that is the basis for loading the page to be started. Illustrating: if the A page is started on the basis of the B page, the B page is the source page of the A page.
S102: and determining the virtual affinity of the page to be started based on the starting parameters of the page to be started and the starting parameters of the source page.
In the embodiment of the application, the page to be started is considered to be started on the basis of the source page. Therefore, the actual starting effect of the page to be started is related to the starting parameters of the source page in addition to the starting parameters of the page to be started. Therefore, in the embodiment of the application, the virtual affinity of the page to be started can be determined based on the starting parameter of the page to be started and the starting parameter of the source page, so that a target virtual task stack for storing the page to be started is further determined based on the virtual affinity.
Regarding S102, it should be noted that: the virtual affinity of the page to be started may be the real affinity of the page to be started or the second affinity, wherein the second affinity is the affinity of a first virtual task stack, and the first virtual task stack is the virtual task stack storing the source page.
It should be noted that, in the embodiment of the present application, for a virtual task stack, the affinity is the virtual affinity of the first page to be stacked. It will be appreciated that the second affinity, i.e. the virtual affinity of the source page.
In some embodiments, if the start-up parameter of the page to be started and the start-up parameter of the source page indicate that the start-up effect of the page to be started is: after the page to be started is started, the page to be started is independent of the source page, namely: and after the page to be started is started, not overlapping the source page, and the virtual affinity of the page to be started is the real affinity of the page to be started. If the starting parameters of the page to be started and the starting parameters of the source page indicate that the starting effect of the page to be started is: and directly overlaying the virtual affinity of the page to be started on the source page, wherein the virtual affinity of the page to be started is the second affinity.
For convenience of description, hereinafter, the "true affinity of the page to be started" is referred to as "first affinity".
S103: and determining a target virtual task stack for storing the page to be started based on the virtual affinity.
After determining the virtual affinity of the page to be started, a target virtual task stack for storing the page to be started can be determined based on the virtual affinity.
In this embodiment of the present application, the affinity of the target virtual task stack is the virtual affinity. In an example, in the specific implementation of S103, for example, an existing virtual task stack with the affinity being the virtual affinity may be determined as the target virtual task stack, and for example, a virtual task stack may be newly created as the target virtual task stack, which is not specifically limited in the embodiment of the present application.
As described above, the virtual affinity may be a first affinity or a second affinity. The following describes a specific implementation manner of S103 when the virtual affinities are the first affinity and the second affinity, respectively.
In an example, if the virtual affinity is the first affinity, it is indicated that the page to be started does not need to be superimposed on the source page, and at this time, the starting effect of the page to be started may be determined according to the starting parameter of the page to be started. For this case, S103, when implemented, may determine the target virtual task stack based on the first affinity and the launch parameters of the page to be launched. Wherein, when the target virtual task stack is determined based on the first affinity and the starting parameter of the page to be started, there may be multiple implementations, and the following two possible implementations are described.
As previously described, the affinity of the target virtual task stack is equal to the virtual affinity. In some embodiments, a virtual task stack with the affinity of the first affinity may be determined as a pending virtual task stack from existing virtual task stacks, and then, based on the start parameter of the page to be started, it is determined whether the pending virtual task stack meets the start parameter of the page to be started. And if the undetermined virtual task stack accords with the starting parameters of the page to be started, determining the undetermined virtual task stack as the target virtual task stack. Illustrating: if the starting mode of the page to be started is standard, the virtual task stack to be determined can be considered to accord with the starting parameters of the page to be started. If the starting flag of the page to be started is multiple task, the pending virtual task stack may not conform to the starting parameter of the page to be started (because multiple task indicates to create a virtual task stack).
In still other embodiments, the target virtual task stack may be created based on the launch parameters of the page to be launched. As described above, the affinity of the virtual task stack is the virtual affinity of the first stacked page. And the target virtual task stack is used for storing the page to be started, and the virtual affinity of the page to be started is a first affinity, so that the affinity of the target virtual task stack is the first affinity. In one example, if the start parameter of the page to be started indicates that a virtual task stack needs to be created, the target virtual task stack may be created. In yet another example, if the aforementioned pending virtual task stack does not conform to the launch parameters of the page to be launched, the target virtual task stack may be created. Illustrating: and if the starting flag of the page to be started is multiple task, the target virtual task stack can be created.
In an example, if the virtual affinity is the second affinity, it is indicated that the page to be started needs to be superimposed on the source page, and at this time, the starting effect of the page to be started may be determined according to the starting parameter of the page to be started and the starting parameter of the source page. For this case, S103, when implemented, may determine the target virtual task stack based on the second affinity, the launch parameter of the page to be launched, and the launch parameter of the source page. The method for determining the target virtual task stack based on the second affinity, the starting parameter of the page to be started and the starting parameter of the source page may have multiple implementation manners when the target virtual task stack is specifically implemented, and the following two possible implementation manners are described.
As previously described, the affinity of the target virtual task stack is equal to the virtual affinity. In some embodiments, a virtual task stack with the affinity of the second affinity may be determined as a pending virtual task stack from existing virtual task stacks, and then, based on the start parameter of the page to be started and the start parameter of the source page, it is determined whether the pending virtual task stack conforms to the start parameter of the page to be started and the start parameter of the source page. And if the undetermined virtual task stack accords with the starting parameters of the page to be started and the starting parameters of the source page, determining the undetermined virtual task stack as the target virtual task stack.
Illustration 1: the undetermined virtual task stack is a first virtual task stack, the starting mode of the page to be started is standard, the starting mode of the source page is single task, and the page to be started and the source page are not the same page. The pending virtual task stack may be considered to conform to the launch parameters of the pending launch page and the launch parameters of the source page.
Illustration 2: the pending virtual task stack is a first virtual task stack, and the starting mode of the page to be started is single top, and the starting mode of the source page is single Instance, then the pending virtual task stack may not conform to the starting parameter of the source page (because single Instance indicates that the virtual task stack can only store one page).
In still other embodiments, the target virtual task stack may be created based on the launch parameters of the page to be launched or the launch parameters of the source page. It will be appreciated that since the affinity of the virtual task stack is that of the first stacked page. And the target virtual task stack is used for storing the page to be started, and the virtual affinity of the page to be started is the second affinity, so that the affinity of the target virtual task stack is the second affinity. In one example, if the start parameter of the page to be started indicates that a virtual task stack needs to be created, the target virtual task stack may be created. In yet another example, if the aforementioned pending virtual task stack does not conform to the launch parameters of the page to be launched or the launch parameters of the source page, the target virtual task stack may be created. In some embodiments, the target virtual task stack may be created when the pending virtual task stack is the first virtual task stack and the launch parameter of the source page indicates that the first virtual task stack cannot store the pending page any more.
Illustration 1: and if the starting flag of the page to be started is multiple task, the target virtual task stack can be created.
Illustration 2: the pending virtual task stack is a first virtual task stack, and the starting mode of the source page is a single Instance, the target virtual task stack may be created according to the single Instance.
As previously described, in some examples, the start-up parameters may include a start-up mode and a start-up flag. In some scenarios, there may be a conflict between the start mode and start flag for the page to be started. Wherein, the conflict exists between the starting mode and the starting flag, which means that the target virtual task stack determined according to the starting mode is inconsistent with the target virtual task stack determined according to the starting flag.
Illustrating: the undetermined virtual task stack is a first virtual task stack, the starting mode of the page to be started is single Instance, and the starting flag of the page to be started is multiple task. When the undetermined virtual task stack is a first virtual task stack and the source page of the page to be started is not the same page, the first virtual task stack can be determined to be a target virtual task stack based on the starting mode of the page to be started, and the target virtual task stack needs to be created according to the starting flag of the page to be started.
In view of this, in this embodiment of the present application, a priority relationship may be preset, and when there is a conflict between the start mode of the page to be started and the start flag of the page to be started, the start mode of the page to be started and the priority of the start flag of the page to be started are determined according to the preset priority relationship, and the target virtual task stack is determined according to a factor with a high priority. Specifically: and if the priority of the starting mode of the page to be started is higher than the priority of the starting flag of the page to be started, determining the target virtual task stack based on the starting mode of the page to be started. And if the priority of the starting mode of the page to be started is lower than the priority of the starting flag of the page to be started, determining the target virtual task stack based on the starting flag of the page to be started.
Illustrating: the method comprises the steps that a to-be-determined virtual task stack is a first virtual task stack, a starting mode of a to-be-started page is single Instance, a starting flag of the to-be-started page is multiple task, the to-be-started virtual task stack is the first virtual task stack, a source page of the to-be-started page is not the same page and can be determined to be a target virtual task stack based on the starting mode of the to-be-started page, and the target virtual task stack is required to be established according to the starting flag of the to-be-started page. In this embodiment of the present application, the start mode single Instance is higher in priority than the start mode flag multipleTask, so that the target virtual task stack is determined based on the start mode single Instance, that is, the first virtual task stack is determined as the target virtual task stack, instead of creating a new virtual task stack as the target virtual task stack.
Regarding the preset priority relationship, the priority relationship may be specifically set according to actual situations, and the embodiment of the present application is not specifically limited.
As mentioned above, in a specific implementation, S103 may have two implementations, where one of the implementations is: and determining the target virtual task stack based on the first affinity and the starting parameters of the page to be started. Another implementation way is: and determining the target virtual task stack based on the second affinity, the starting parameters of the page to be started and the starting parameters of the source page.
Therefore, when there is a conflict between the start mode of the page to be started and the start flag, determining the target virtual task stack "based on the first affinity and the start parameter of the page to be started" may include:
and if the predetermined priority relation indicates that the priority of the starting mode of the page to be started is higher than the starting mark of the page to be started, determining the target virtual task stack based on the first affinity and the starting mode of the page to be started.
Or if the predetermined priority relation indicates that the priority of the starting mode of the page to be started is lower than the starting mark of the page to be started, determining the target virtual task stack based on the first affinity and the starting mark of the page to be started.
Regarding specific implementations of "determining the target virtual task stack based on the first affinity and the launch mode of the page to be launched" and "determining the target virtual task stack based on the first affinity and the launch flag of the page to be launched", reference may be made to the description section above for "determining the target virtual task stack based on the first affinity and the launch parameter of the page to be launched" that is not repeated here.
When the starting mode and the starting flag of the page to be started have conflict, "determining the target virtual task stack based on the second affinity, the starting parameter of the page to be started and the starting parameter of the source page", the method may include:
if the predetermined priority relation indicates that the priority of the starting mode of the page to be started is higher than the starting mark of the page to be started, determining the target virtual task stack based on the second affinity, the starting mode of the page to be started and the starting parameters of the source page;
or if the predetermined priority relation indicates that the priority of the starting mode of the page to be started is lower than the starting mark of the page to be started, determining the target virtual task stack based on the second affinity, the starting mark of the page to be started and the starting parameter of the source page.
Regarding specific implementations of "determining the target virtual task stack based on the second affinity, the start mode of the page to be started, and the start parameter of the source page" and "determining the target virtual task stack based on the second affinity, the start flag of the page to be started, and the start parameter of the source page", reference may be made to the description section of "determining the target virtual task stack based on the second affinity, the start parameter of the page to be started, and the start parameter of the source page" above, and description thereof will not be repeated here.
It can be understood that when the starting mode of the page to be started and the starting flag of the page to be started do not have conflict, the target virtual task stack is determined based on the starting parameters of the page to be started, namely, the target virtual task stack is determined based on the starting mode of the page to be started and the starting flag of the page to be started.
As can be seen from the above description, the virtual affinity is determined according to the starting parameter of the page to be started and the starting parameter of the source page, so that the factors required to be considered for starting the page to be started based on the source page are comprehensively considered based on the target virtual task stack determined by the virtual affinity, and therefore, the determined target virtual task stack is used for storing the page to be started, so that the starting effect of the page to be started can be in accordance with the expectations.
Next, after the scheme provided by the embodiment of the present application is applied, the page starting effect of the above-mentioned 6 scenes is described.
Scene 1: the affinity of the virtual task stack of the page A is abc, and the starting mode of the page A is single task; the task stack affinity of the B page is default and the start mode is standard.
After the scheme is utilized, the determined virtual affinity of the B page is abc, and the virtual task stack of the A page accords with the starting parameter of the A page and the starting parameter of the B page, so that the virtual task stack of the A page is determined to be the virtual task stack for storing the B page, and the effect that the B page is directly overlapped on the A page is achieved.
Scene 2: the affinity of the page A defaults, and the starting mode is single Instance; the affinity of the B page is default, and the starting mode is single Top.
After the scheme is utilized, the virtual affinity of the B page is determined as default, the starting mode of the A page is single Instance, so that the virtual task stack of the A page is determined to be the pending virtual task stack of the A page, but because the pending virtual task stack does not accord with the starting parameter (single Instance) of the A page, a virtual task stack is re-created to store the page B, and the starting effect of the B page accords with expectations.
Scene 3: the A page and the B page are the same page, and the starting parameters of the A page and the B page are: the start mode is singetask or singetop and the start flag is multiplexing Task.
After the scheme of the embodiment of the application is utilized, the priority of the single task is higher than that of the multiple task (the priority of the single top is also higher than that of the multiple task), so that the A page cannot be restarted.
Scene 4: the affinity of the page A is default, the starting mode is standard, and the starting flag is multiple task; the affinity of the B page is default, the starting mode is standard, and the flag is not started.
With this scheme, the affinity of the virtual task stack of the a-page is no longer the default affinity, but the virtual affinity of the a-page (e.g., affinity cde). The virtual affinity of the B page is cde, and the undetermined virtual task stack (the virtual task stack of the A page) accords with the starting parameters of the A page and the starting parameters of the B page. Therefore, the virtual task stack of the A page is determined to be the virtual task stack for storing the B page, and the effect that the B page is directly overlapped on the A page is achieved.
Scene 5: the A page and the B page are the same page. The affinity of the page A is the default affinity, and the starting mode is single task; the startup mode of the B page is single task and the startup flag is multiple task.
After the scheme of the embodiment of the application is utilized, the A page is not restarted because the priority of the single task is higher than that of the multiple task.
Scene 6: the A page and the B page are the same page. The affinity of the page A is the default affinity, and the starting mode is single Top; the start mode of the B page is single Top and the start flag is multiple Task.
After the scheme of the embodiment of the application is utilized, the A page is not restarted because the priority of the single Top is higher than that of the multiple task.
Exemplary apparatus
Based on the method provided by the embodiment, the embodiment of the application also provides a device, and the device is described below with reference to the accompanying drawings.
Referring to fig. 2, the schematic structure of a processing device for a virtual task stack according to an embodiment of the present application is shown. The apparatus 200 may specifically include, for example: an acquisition unit 201, a first determination unit 202, and a second determination unit 203.
An obtaining unit 201, configured to obtain a start parameter of a page to be started and a start parameter of a source page of the page to be started;
a first determining unit 202, configured to determine a virtual affinity of the page to be started based on the starting parameter of the page to be started and the starting parameter of the source page;
A second determining unit 203, configured to determine, based on the virtual affinity, a target virtual task stack for storing the page to be started.
Optionally, the virtual affinity of the page to be started includes:
the first affinity is the real affinity of the page to be started, or the second affinity is the affinity of a first virtual task stack, and the first virtual task stack is the virtual task stack for storing the source page.
Optionally, if the virtual affinity is the first affinity, the second determining unit 202 is configured to:
and determining the target virtual task stack based on the first affinity and the starting parameters of the page to be started.
Optionally, the second determining unit 202 is configured to:
determining a virtual task stack with the affinity degree of the first affinity degree from the existing virtual task stacks as a pending virtual task stack;
and under the condition that the undetermined virtual task stack accords with the starting parameters of the page to be started, determining the undetermined virtual task stack as the target virtual task stack.
Optionally, the second determining unit 202 is configured to:
And creating the target virtual task stack based on the starting parameters of the page to be started, wherein the affinity of the target virtual task stack is the first affinity.
Optionally, if the virtual affinity is the second affinity, the second determining unit 202 is configured to:
and determining the target virtual task stack based on the second affinity, the starting parameters of the page to be started and the starting parameters of the source page.
Optionally, the second determining unit 202 is configured to:
determining a virtual task stack with the affinity degree of the second affinity degree from the existing virtual task stacks as a pending virtual task stack;
and determining the undetermined virtual task stack as the target virtual task stack under the condition that the undetermined virtual task stack accords with the starting parameters of the page to be started and the starting parameters of the source page.
Optionally, the second determining unit 202 is configured to:
and creating the target virtual task stack based on the starting parameters of the page to be started or the starting parameters of the source page, wherein the affinity of the target virtual task stack is the second affinity.
Optionally, the start-up parameter includes a start-up mode and a start-up flag, and the start-up mode and the start-up flag of the page to be started have a conflict, and the second determining unit 202 is configured to:
And if the predetermined priority relation indicates that the priority of the starting mode of the page to be started is higher than the starting mark of the page to be started, determining the target virtual task stack based on the first affinity and the starting mode of the page to be started.
Or if the predetermined priority relation indicates that the priority of the starting mode of the page to be started is lower than the starting mark of the page to be started, determining the target virtual task stack based on the first affinity and the starting mark of the page to be started.
Optionally, the start parameter includes a start mode and a start flag, and if there is a conflict between the start mode and the start flag of the page to be started, the second determining unit 202 is configured to:
if the predetermined priority relation indicates that the priority of the starting mode of the page to be started is higher than the starting mark of the page to be started, determining the target virtual task stack based on the second affinity, the starting mode of the page to be started and the starting parameters of the source page;
or if the predetermined priority relation indicates that the priority of the starting mode of the page to be started is lower than the starting mark of the page to be started, determining the target virtual task stack based on the second affinity, the starting mark of the page to be started and the starting parameter of the source page.
Since the apparatus 200 is an apparatus corresponding to the method provided in the above method embodiment, the specific implementation of each unit of the apparatus 200 is the same as the above method embodiment, and therefore, with respect to the specific implementation of each unit of the apparatus 200, reference may be made to the description part of the above method embodiment, and details are not repeated herein.
The embodiment of the application also provides equipment, which comprises a processor and a memory;
the processor is configured to execute instructions stored in the memory to cause the apparatus to perform the method of any one of the method embodiments above.
Referring now to fig. 3, a schematic diagram of an electronic device 300 suitable for use in implementing embodiments of the present application is shown. The electronic devices in the embodiments of the present application may include, but are not limited to, mobile terminals such as mobile phones, notebook computers, digital broadcast receivers, PDAs (Personal Digital Assistant, personal digital assistants), PADs (portable android device, tablet computers), PMPs (Portable Media Player, portable multimedia players), vehicle terminals (e.g., car navigation terminals), and the like, and fixed terminals such as digital TVs (televisions), desktop computers, and the like. The electronic device shown in fig. 3 is only an example and should not be construed as limiting the functionality and scope of use of the embodiments herein.
As shown in fig. 3, the electronic device 300 may include a processing means (e.g., a central processing unit, a graphics processor, etc.) 301 that may perform various suitable actions and processes in accordance with a program stored in a Read Only Memory (ROM) 302 or a program loaded from a storage means 308 into a Random Access Memory (RAM) 303. In the RAM303, various programs and data required for the operation of the electronic apparatus 300 are also stored. The processing device 301, the ROM 302, and the RAM303 are connected to each other via a bus 304. An input/output (I/O) interface 305 is also connected to bus 304.
In general, the following devices may be connected to the I/O interface 305: input devices 306 including, for example, a touch screen, touchpad, keyboard, mouse, camera, microphone, accelerometer, gyroscope, etc.; an output device 307 including, for example, a Liquid Crystal Display (LCD), a speaker, a vibrator, and the like; storage 308 including, for example, magnetic tape, hard disk, etc.; and communication means 309. The communication means 309 may allow the electronic device 300 to communicate with other devices wirelessly or by wire to exchange data. While fig. 3 shows an electronic device 300 having various means, it is to be understood that not all of the illustrated means are required to be implemented or provided. More or fewer devices may be implemented or provided instead.
In particular, according to embodiments of the present application, the processes described above with reference to flowcharts may be implemented as computer software programs. For example, embodiments of the present application include a computer program product comprising a computer program embodied on a non-transitory computer readable medium, the computer program comprising program code for performing the method shown in the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network via a communication device 309, or installed from a storage device 308, or installed from a ROM 302. The above-described functions defined in the methods of the embodiments of the present application are performed when the computer program is executed by the processing means 301.
The electronic device provided in the embodiment of the present application and the method provided in the foregoing embodiment belong to the same inventive concept, and technical details not described in detail in the present embodiment can be seen in the foregoing embodiment, and the present embodiment has the same beneficial effects as the foregoing embodiment.
Embodiments of the present application provide a computer readable medium having a computer program stored thereon, wherein the program, when executed by a processor, implements a method as described in any of the embodiments above.
It should be noted that the computer readable medium described in the present application may be a computer readable signal medium or a computer readable storage medium, or any combination of the two. The computer readable storage medium can be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples of the computer-readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this document, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In the present application, however, a computer-readable signal medium may include a data signal that propagates in baseband or as part of a carrier wave, with the computer-readable program code embodied therein. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination of the foregoing. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: electrical wires, fiber optic cables, RF (radio frequency), and the like, or any suitable combination of the foregoing.
In some implementations, the clients, servers may communicate using any currently known or future developed network protocol, such as HTTP (HyperText Transfer Protocol ), and may be interconnected with any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include a local area network ("LAN"), a wide area network ("WAN"), the internet (e.g., the internet), and peer-to-peer networks (e.g., ad hoc peer-to-peer networks), as well as any currently known or future developed networks.
The computer readable medium may be contained in the electronic device; or may exist alone without being incorporated into the electronic device.
The computer readable medium carries one or more programs which, when executed by the electronic device, cause the electronic device to perform the method described above.
Computer program code for carrying out operations of the present application may be written in one or more programming languages, including, but not limited to, an object oriented programming language such as Java, smalltalk, C ++ and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computer (for example, through the Internet using an Internet service provider).
The flowcharts and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present application. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The units involved in the embodiments of the present application may be implemented by software, or may be implemented by hardware. The name of the unit/module is not limited to the unit itself in some cases, and, for example, the voice data acquisition module may also be described as a "data acquisition module".
The functions described above herein may be performed, at least in part, by one or more hardware logic components. For example, without limitation, exemplary types of hardware logic components that may be used include: a Field Programmable Gate Array (FPGA), an Application Specific Integrated Circuit (ASIC), an Application Specific Standard Product (ASSP), a system on a chip (SOC), a Complex Programmable Logic Device (CPLD), and the like.
In the context of this application, a machine-readable medium may be a tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. The machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. The machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples of a machine-readable storage medium would include an electrical connection based on one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
Other embodiments of the present application will be apparent to those skilled in the art from consideration of the specification and practice of the invention disclosed herein. This application is intended to cover any variations, uses, or adaptations of the application following, in general, the principles of the application and including such departures from the present disclosure as come within known or customary practice within the art to which the disclosure pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the application being indicated by the following claims.
It is to be understood that the present application is not limited to the precise arrangements and instrumentalities shown in the drawings, which have been described above, and that various modifications and changes may be effected without departing from the scope thereof. The scope of the application is limited only by the appended claims
The foregoing description of the preferred embodiments of the present application is not intended to limit the invention to the particular embodiments of the present application, but to limit the scope of the invention to the particular embodiments of the present application.

Claims (13)

1. A method for processing a virtual task stack, the method comprising:
acquiring starting parameters of a page to be started and starting parameters of a source page of the page to be started;
Determining the virtual affinity of the page to be started based on the starting parameters of the page to be started and the starting parameters of the source page;
and determining a target virtual task stack for storing the page to be started based on the virtual affinity.
2. The method of claim 1, wherein the virtual affinity of the page to be launched comprises:
the first affinity is the real affinity of the page to be started, or the second affinity is the affinity of a first virtual task stack, and the first virtual task stack is the virtual task stack for storing the source page.
3. The method of claim 2, wherein if the virtual affinity is the first affinity, the determining, based on the virtual affinity, a target virtual task stack for storing the page to be launched comprises:
and determining the target virtual task stack based on the first affinity and the starting parameters of the page to be started.
4. The method of claim 3, wherein the determining the target virtual task stack based on the virtual affinity and the launch parameters of the page to be launched comprises:
Determining a virtual task stack with the affinity degree of the first affinity degree from the existing virtual task stacks as a pending virtual task stack;
and under the condition that the undetermined virtual task stack accords with the starting parameters of the page to be started, determining the undetermined virtual task stack as the target virtual task stack.
5. The method of claim 3, wherein the determining the target virtual task stack based on the virtual affinity and the launch parameters of the page to be launched comprises:
and creating the target virtual task stack based on the starting parameters of the page to be started, wherein the affinity of the target virtual task stack is the first affinity.
6. The method of claim 2, wherein if the virtual affinity is the second affinity, the determining, based on the virtual affinity, a target virtual task stack for storing the page to be launched comprises:
and determining the target virtual task stack based on the second affinity, the starting parameters of the page to be started and the starting parameters of the source page.
7. The method of claim 6, wherein the determining the target virtual task stack based on the virtual affinity, the launch parameters of the page to be launched, and the launch parameters of the source page comprises:
Determining a virtual task stack with the affinity degree of the second affinity degree from the existing virtual task stacks as a pending virtual task stack;
and determining the undetermined virtual task stack as the target virtual task stack under the condition that the undetermined virtual task stack accords with the starting parameters of the page to be started and the starting parameters of the source page.
8. The method of claim 6, wherein the determining the target virtual task stack based on the virtual affinity, the launch parameters of the page to be launched, and the launch parameters of the source page comprises:
and creating the target virtual task stack based on the starting parameters of the page to be started or the starting parameters of the source page, wherein the affinity of the target virtual task stack is the second affinity.
9. A method according to claim 3, wherein the start-up parameters include a start-up mode and a start-up flag, and wherein the determining the target virtual task stack based on the first affinity and the start-up parameters of the page to be started up includes:
and if the predetermined priority relation indicates that the priority of the starting mode of the page to be started is higher than the starting mark of the page to be started, determining the target virtual task stack based on the first affinity and the starting mode of the page to be started.
Or if the predetermined priority relation indicates that the priority of the starting mode of the page to be started is lower than the starting mark of the page to be started, determining the target virtual task stack based on the first affinity and the starting mark of the page to be started.
10. The method of claim 6, wherein the launch parameters include a launch mode and a launch flag, and wherein the launch mode and launch flag of the page to be launched conflict, determining the target virtual task stack based on the second affinity, the launch parameters of the page to be launched, and the launch parameters of the source page comprises:
if the predetermined priority relation indicates that the priority of the starting mode of the page to be started is higher than the starting mark of the page to be started, determining the target virtual task stack based on the second affinity, the starting mode of the page to be started and the starting parameters of the source page;
or if the predetermined priority relation indicates that the priority of the starting mode of the page to be started is lower than the starting mark of the page to be started, determining the target virtual task stack based on the second affinity, the starting mark of the page to be started and the starting parameter of the source page.
11. A processing apparatus for a virtual task stack, the apparatus comprising:
the device comprises an acquisition unit, a starting unit and a starting unit, wherein the acquisition unit is used for acquiring starting parameters of a page to be started and starting parameters of a source page of the page to be started;
the first determining unit is used for determining the virtual affinity of the page to be started based on the starting parameters of the page to be started and the starting parameters of the source page;
and the second determining unit is used for determining a target virtual task stack for storing the page to be started based on the virtual affinity.
12. An apparatus comprising a processor and a memory;
the processor is configured to execute instructions stored in the memory to cause the apparatus to perform the method of any one of claims 1 to 10.
13. A computer readable storage medium comprising instructions that instruct a device to perform the method of any one of claims 1 to 10.
CN202210023394.7A 2022-01-10 2022-01-10 Virtual task stack processing method and device Pending CN116450279A (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN202210023394.7A CN116450279A (en) 2022-01-10 2022-01-10 Virtual task stack processing method and device
PCT/CN2023/070293 WO2023131146A1 (en) 2022-01-10 2023-01-04 Method and apparatus for processing virtual task stack

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210023394.7A CN116450279A (en) 2022-01-10 2022-01-10 Virtual task stack processing method and device

Publications (1)

Publication Number Publication Date
CN116450279A true CN116450279A (en) 2023-07-18

Family

ID=87073136

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210023394.7A Pending CN116450279A (en) 2022-01-10 2022-01-10 Virtual task stack processing method and device

Country Status (2)

Country Link
CN (1) CN116450279A (en)
WO (1) WO2023131146A1 (en)

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7412646B2 (en) * 2003-10-23 2008-08-12 Microsoft Corporation Systems and methods for pagination and co-pagination
CN106778248B (en) * 2016-12-26 2020-07-14 北京奇虎科技有限公司 Method and device for starting application program Activity
CN109426532B (en) * 2017-08-22 2021-08-20 腾讯科技（深圳）有限公司 Method and device for linking pages in android system and electronic equipment

Also Published As

Publication number Publication date
WO2023131146A1 (en) 2023-07-13

Similar Documents

Publication Publication Date Title
CN110275723A (en) Obtain method, apparatus, electronic equipment and the readable medium of resource
CN111367516B (en) Application interface generation method and device and electronic equipment
CN110784520A (en) File downloading method and device and electronic equipment
CN111309304B (en) Method, device, medium and electronic equipment for generating IDL file
CN111309391A (en) Application program starting method, device, equipment and medium
CN109510881A (en) Method, apparatus, electronic equipment and the readable storage medium storing program for executing of sharing files
CN110865846B (en) Application management method, device, terminal, system and storage medium
CN113900721A (en) Operating system starting method and device and electronic equipment
CN112115217A (en) Data processing method and device for high-precision map, electronic equipment and storage medium
CN110908752A (en) Control setting method and device, electronic equipment and interaction system
CN111324376A (en) Function configuration method and device, electronic equipment and computer readable medium
CN112416303B (en) Software development kit hot repair method and device and electronic equipment
CN110888773B (en) Method, device, medium and electronic equipment for acquiring thread identification
CN113010821A (en) Page loading method, device, equipment and storage medium
CN116450279A (en) Virtual task stack processing method and device
CN111240738B (en) File processing method, device, equipment and medium
CN111625326B (en) Task pipeline execution method and device and electronic equipment
CN114860213A (en) Application package generation method, device, equipment and medium
CN111290812B (en) Display method, device, terminal and storage medium of application control
CN111381898B (en) Interface calling method and device, mobile terminal and storage medium
CN113032046A (en) Method, device and equipment for repairing so file and storage medium
CN111240657A (en) Method and device for generating SDK and electronic equipment
CN111367590A (en) Interrupt event processing method and device
CN117369953B (en) Mirror synchronization method, device, equipment and storage medium
CN110908711A (en) Control development method and device of application program and electronic equipment

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