CN106201432B - The treating method and apparatus of the information of target object - Google Patents
The treating method and apparatus of the information of target object Download PDFInfo
- Publication number
- CN106201432B CN106201432B CN201610575902.7A CN201610575902A CN106201432B CN 106201432 B CN106201432 B CN 106201432B CN 201610575902 A CN201610575902 A CN 201610575902A CN 106201432 B CN106201432 B CN 106201432B
- Authority
- CN
- China
- Prior art keywords
- target object
- information
- time
- queue
- default group
- 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
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F5/00—Methods or arrangements for data conversion without changing the order or content of the data handled
- G06F5/06—Methods or arrangements for data conversion without changing the order or content of the data handled for changing the speed of data flow, i.e. speed regularising or timing, e.g. delay lines, FIFO buffers; over- or underrun control therefor
- G06F5/10—Methods or arrangements for data conversion without changing the order or content of the data handled for changing the speed of data flow, i.e. speed regularising or timing, e.g. delay lines, FIFO buffers; over- or underrun control therefor having a sequence of storage locations each being individually accessible for both enqueue and dequeue operations, e.g. using random access memory
-
- 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/45—Controlling the progress of the video game
-
- 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/55—Controlling game characters or game objects based on the game progress
-
- 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
-
- 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/60—Methods for processing data by generating or executing the game program
- A63F2300/63—Methods for processing data by generating or executing the game program for controlling the execution of the game in time
Abstract
The invention discloses a kind for the treatment of method and apparatus of the information of target object.Wherein, this method comprises: obtaining the information of the target object on the head in queue, wherein, queue is used to store the information for the multiple target objects for exiting default group, the information of multiple target objects in queue sorts according to monotonic order, and the information of target object includes at least: target object exits the time of default group;Judge that target object exits the duration of default group and whether reaches preset duration, wherein preset duration is to allow target object that the waiting time for presetting group is added again;If the duration that target object exits default group reaches preset duration, the information of delete target object from queue.The present invention solves the information for handling each target object by way of traversing poll in the prior art, and complexity is higher, the lower technical problem of efficiency.
Description
Technical field
The present invention relates to internet areas, in particular to a kind for the treatment of method and apparatus of the information of target object.
Background technique
In massively multiplayer game, in order to enrich game form, by the way that copy can be increased in online game.Online game
In copy, be to allow limited player role to be emitted in the case where interference-free in same area from design level
Danger, copy is game state locating for one group of specific role of management and this group of role from technological layer.Copy will usually wrap
Information containing all roles for participating in the copy, such as the id of role, the attribute of role, equipment of role etc. and copy sheet
The information of body, such as currently brush which wave monster, copy remaining time etc..Player is grasped in game client by interface
Make, requests that copy is added to server, whether the condition that server verifies the player role into the copy meets, if satisfaction
The player is added in player's manager of the copy, error message is then returned if being unsatisfactory for, class when exiting copy
Seemingly.Management by copy to state, and the condition for entering and leaving copy is limited, completely cut off the object for appreciation in copy and outside copy
Family role, to allow the role in copy is interference-free to take a risk.The condition for entering and leaving copy is limited wherein
One very effective way is exactly when penalizing --- and after player exits copy, punishing in its certain time cannot be again introduced into
The copy informs player when Penalty time reaches.
In existing game server, in order to realize that this mechanism, existing common practice is, when player exits
It waits, the time exited with a Hash table storage player, as shown in Figure 1, then all traversing the institute in this Hash table each second
There is player, it is found that time is up when some player penalizes, and just deletes the player from the Hash table, and inform that the player penalizes constantly
Between arrive, implementation process is as shown in Figure 2.
Due to requiring each player in traversal poll Hash table each second, the time complexity of this part is proportional to
It is proportional to player's number n in Hash table, penalized player is more, and time of the consumption per second on poll is more, and efficiency is not
Enough height.
For the information for handling each target object by way of traversing poll in the prior art, complexity is higher, effect
The lower problem of rate, currently no effective solution has been proposed.
Summary of the invention
The embodiment of the invention provides a kind for the treatment of method and apparatus of the information of target object, at least to solve existing skill
The information of each target object is handled in art by way of traversing poll, complexity is higher, the lower technical problem of efficiency.
According to an aspect of an embodiment of the present invention, a kind of processing method of the information of target object is provided, comprising: obtain
Take the information of the target object on the head in queue, wherein the queue is for storing the multiple targets for exiting default group
The information of the information of object, multiple target objects in the queue sorts according to monotonic order, the information of the target object
Include at least: the target object exits the time of the default group;Judge that the target object exits the default group
Duration whether reach preset duration, wherein the preset duration is to allow the target object that the default group is added again
The waiting time of group;If the duration that the target object exits the default group reaches the preset duration, from described
The information of the target object is deleted in queue.
According to another aspect of an embodiment of the present invention, a kind of processing unit of the information of target object is additionally provided, comprising:
First obtains module, for obtaining the information for being in the target object on head of queue, wherein the queue is exited for storing
The information of multiple target objects of group is preset, the information of multiple target objects in the queue sorts according to monotonic order,
The information of the target object includes at least: the target object exits the time of the default group;Judgment module, for sentencing
Whether the duration that the target object that breaks exits the default group reaches preset duration, wherein the preset duration is to allow
The waiting time of the default group is added in the target object again;If the removing module target object exits described pre-
If the duration of group reaches the preset duration, then the information of the target object is deleted from the queue.
In embodiments of the present invention, the information for obtaining the target object on the head in queue, judges that target object exits
Whether the duration of default group reaches preset duration, if the duration that target object exits default group reaches preset duration,
The information of delete target object from queue.
It is easily noted that, since the information of multiple target objects in queue sorts according to monotonic order, available place
In the information of the target object on the head of queue, if the duration that target object exits default group reaches preset duration, from
The information of delete target object in queue.Therefore, through the embodiment of the present invention provided by scheme, can be by using dull team
Column carry out the information of properly orderly organizational goal object, rather than concentrating in together the information of target object carelessly is taken turns
It askes, to reach the efficiency for increasing poll, mitigates the effect of the calculated load of server.
As a result, above-described embodiment provided by the invention solve handled by way of traversing poll in the prior art it is each
The information of target object, complexity is higher, the lower technical problem of efficiency.
Detailed description of the invention
The drawings described herein are used to provide a further understanding of the present invention, constitutes a part of the invention, this hair
Bright illustrative embodiments and their description are used to explain the present invention, and are not constituted improper limitations of the present invention.In the accompanying drawings:
Fig. 1 be according to prior art it is a kind of based on Hash table structure storage game player information schematic diagram;
Fig. 2 is a kind of flow chart of the information based on Hash table pattern handling game player according to prior art;
Fig. 3 is a kind of hardware configuration of the terminal of the processing method of the information of target object of the embodiment of the present invention
Block diagram;
Fig. 4 is a kind of flow chart of the processing method of the information of target object according to an embodiment of the present invention;
Fig. 5 is a kind of schematic diagram of optional queue structure according to an embodiment of the present invention;
Fig. 6 is a kind of flow chart of the processing method of the information of optional target object according to an embodiment of the present invention;
Fig. 7 is a kind of schematic diagram of the processing unit of the information of target object according to an embodiment of the present invention;
Fig. 8 is a kind of schematic diagram of the processing unit of the information of optional target object according to an embodiment of the present invention;
Fig. 9 is a kind of schematic diagram of the processing unit of the information of optional target object according to an embodiment of the present invention;
Figure 10 is a kind of schematic diagram of the processing unit of the information of optional target object according to an embodiment of the present invention;
Figure 11 is a kind of schematic diagram of the processing unit of the information of optional target object according to an embodiment of the present invention;
Figure 12 is a kind of schematic diagram of the processing unit of the information of optional target object according to an embodiment of the present invention;With
And
Figure 13 is a kind of structural block diagram of terminal according to an embodiment of the present invention.
Specific embodiment
In order to enable those skilled in the art to better understand the solution of the present invention, below in conjunction in the embodiment of the present invention
Attached drawing, technical scheme in the embodiment of the invention is clearly and completely described, it is clear that described embodiment is only
The embodiment of a part of the invention, instead of all the embodiments.Based on the embodiments of the present invention, ordinary skill people
The model that the present invention protects all should belong in member's every other embodiment obtained without making creative work
It encloses.
It should be noted that description and claims of this specification and term " first " in above-mentioned attached drawing, "
Two " etc. be to be used to distinguish similar objects, without being used to describe a particular order or precedence order.It should be understood that using in this way
Data be interchangeable under appropriate circumstances, so as to the embodiment of the present invention described herein can in addition to illustrating herein or
Sequence other than those of description is implemented.In addition, term " includes " and " having " and their any deformation, it is intended that cover
Cover it is non-exclusive include, for example, the process, method, system, product or equipment for containing a series of steps or units are not necessarily limited to
Step or unit those of is clearly listed, but may include be not clearly listed or for these process, methods, product
Or other step or units that equipment is intrinsic.
In the following, being explained first to relevant technical terms involved in the embodiment of the present invention, to facilitate to of the invention real
Apply the understanding of example.
Dull queue: it is similar with common queue is established all to establish dull queue for the queue of the first in first out with monotonicity
It is only to have added a limitation using single-track link table, is exactly that element will guarantee when the tail portion for being inserted into this queue
With the monotonicity of other elements in the queue.
Embodiment one
According to embodiments of the present invention, a kind of embodiment of the method for the processing method of the information of target object is provided, is needed
Illustrate, step shown in the flowchart of the accompanying drawings can be in a computer system such as a set of computer executable instructions
It executes, although also, logical order is shown in flow charts, and it in some cases, can be to be different from herein suitable
Sequence executes shown or described step.
Embodiment of the method provided by the embodiment of the present invention one can be in communication equipment, terminal or similar fortune
It calculates and is executed in device.For operating in terminal, Fig. 3 is a kind of place of the information of target object of the embodiment of the present invention
The hardware block diagram of the terminal of reason method.As shown in figure 3, terminal 30 may include one or more (figures
In only show one) (processor 302 can include but is not limited to Micro-processor MCV or programmable logic device to processor 302
The processing unit of FPGA etc.), memory 304 for storing data and the transmission module 306 for communication function.Ability
Domain those of ordinary skill is appreciated that structure shown in Fig. 3 is only to illustrate, and does not cause to limit to the structure of above-mentioned electronic device
It is fixed.For example, terminal 30 may also include than shown in Fig. 3 more perhaps less component or have with shown in Fig. 3 not
Same configuration.
Memory 304 can be used for storing the software program and module of application software, such as the target in the embodiment of the present invention
Corresponding program instruction/the module of the processing method of the information of object, processor 302 are stored in memory 304 by operation
Software program and module realize the information of above-mentioned target object thereby executing various function application and data processing
Processing method.Memory 304 may include high speed random access memory, may also include nonvolatile memory, such as one or more
A magnetic storage device, flash memory or other non-volatile solid state memories.In some instances, memory 304 can be further
Including the memory remotely located relative to processor 302, these remote memories can pass through network connection to computer end
End 30.The example of above-mentioned network includes but is not limited to internet, intranet, local area network, mobile radio communication and combinations thereof.
Transmitting device 306 is used for via a network inputs or sends data.Above-mentioned network specific example may include
The wireless network that the communication providers of terminal 30 provide.In an example, transmitting device 306 includes that a network is suitable
Orchestration (Network Interface Controller, NIC), can be connected by base station with other network equipments so as to
Internet is communicated.In an example, transmitting device 306 can be radio frequency (Radio Frequency, RF) module,
For wirelessly being communicated with internet.
Under above-mentioned running environment, the present invention provides the processing methods of the information of target object as shown in Figure 4.Fig. 4
It is a kind of flow chart of the processing method of the information of target object according to an embodiment of the present invention, as shown in figure 4, the above method can
To include the following steps:
Step S402 obtains the information of the target object on the head in queue, wherein queue is exited default for storage
The information of the information of multiple target objects of group, multiple target objects in queue sorts according to monotonic order, target object
Information include at least: target object exits the time of default group;
Step S404 judges that target object exits the duration of default group and whether reaches preset duration, wherein preset duration
To allow target object that the waiting time of default group is added again;
Step S406 deletes mesh if the duration that target object exits default group reaches preset duration from queue
Mark the information of object.
Optionally, the information of multiple target objects in above-mentioned queue can exit default group according to each target object
Time sort from small to large.
Above-mentioned target object can be the game player in online game, and above-mentioned default group can be in online game
Copy, above-mentioned preset duration can be the Penalty time for allowing game player that copy is added again, and above-mentioned queue can be dullness
Queue, the information for each exiting the game player of copy are stored in dull queue by orderly.Since game player moves back
Copy has sequencing out, and all players of Penalty time are the same, so the arrival of player's Penalty time is successive
For sequence with exiting being consistent for copy, the time for terminating punishment can satisfy monotonicity.Due to the more early copy of exiting
Game player, the more early arrival of Penalty time, in order to guarantee that the information of the more early game player for exiting copy can be by game garment
It is engaged in the more early processing of device, the information of the game player in dull queue is ranked up from small to large according to the time for exiting copy, i.e.,
The more early game player for exiting copy is closer to the head of dull queue.
Herein it should be noted that the time that target object exits default group can be time point or moment, i.e. time
Certain point on axis, and the duration that target object exits default group can be the period, i.e., the length of point-to-point transmission on time shaft,
The time for exiting default group with target object is different content.
In a kind of optional scheme, game server is when executing this current poll, available dullness queue team
The information of the game player of head, and judge that the game player exits the duration of copy and whether reaches preset duration, for example, can sentence
The disconnected timing since the time that the game player exits copy, judges whether timing time reaches Penalty time, if when timing
Between reach Penalty time, then illustrate that the game player exits the duration of copy and reaches Penalty time, i.e., when the game player punishes
Between reach, the information of the game player is fallen out, i.e., is deleted the information of the game player from dull queue, and continue to judge
Whether the duration that next game player of team's head exits copy reaches Penalty time, if next game player exits copy
Duration be not up to Penalty time, or dull queue is sky, i.e., the game player that no Penalty time does not arrive, due in queue
Game player was ranked up from small to large according to the time for exiting copy, it is ensured that other game players affirmative in queue
Penalty time does not arrive also, then game server stops executing this poll.
In application scenarios as shown in Figure 5, store 9 game players' for exiting the same copy in dull queue
Information, since the information of 9 game players has monotonicity, thus may determine that 9 game players exit the same copy
Chronological order are as follows: game player 1, and game player 2, and game player 3, and game player 4, and game player 5, and game player 6,
Game player 7, game player 8 and game player 9, and game player 1 is located at team's head of dull queue, and game player 9 is located at dullness
The tail of the queue of queue.Game server when executing this current poll, can obtain first game player 1 exit copy when
Between, judge that game player 1 exits the duration of copy and whether reaches Penalty time, if game player 1 exit copy when grow to
Up to Penalty time, then game player 1 is gone out into team, game player 1 is deleted from dull queue, further judged under dull queue
Whether the duration that the game player 2 of one team's head exits copy reaches Penalty time, if game player 2 exits the duration of copy
Penalty time is not reached, then game server stops executing this poll.
From the foregoing, it will be observed that obtaining the target object on the head in queue in scheme disclosed in the above embodiment of the present invention one
Information, judge that target object exits the duration of default group and whether reaches preset duration, if target object exits default group
Group duration reach preset duration, then from queue delete target object information.
It is easily noted that, since the information of multiple target objects in queue sorts according to monotonic order, available place
In the information of the target object on the head of queue, if the duration that target object exits default group reaches preset duration, from
The information of delete target object in queue.Therefore, through the embodiment of the present invention provided by scheme, can be by using dull team
Column carry out the information of properly orderly organizational goal object, rather than concentrating in together the information of target object carelessly is taken turns
It askes, to reach the efficiency for increasing poll, mitigates the effect of the calculated load of server.
The scheme of above-described embodiment one provided by the invention solves in the prior art by way of traversing poll as a result,
The information of each target object is handled, complexity is higher, the lower technical problem of efficiency.
Optionally, according to that above embodiment of the present invention, in step S402, the target object on the head in queue is obtained
Before information, the above method can also include the following steps:
Step S412, if detecting that first object object exits default group, acquisition first object object exits default
The time of group;
Step S414, by first object object exit time of default group successively with multiple mesh for being saved in queue
The time that mark object exits default group is compared;
Step S416, if the time that first object object exits default group is more than or equal to each target object in queue
The time of default group is exited, then the information of first object object is inserted into the tail portion of queue;
Step S418, if the second target object that the time that first object object exits default group is less than in queue moves back
The time of group is preset out, and the third target object being greater than in queue exits the time of default group, then by first object pair
The information of elephant is inserted between the second target object and third target object.
The time that above-mentioned second target object exits default group can be greater than third target object and exit default group
Time, i.e., the information of the second target object is after the information of third target object.
Herein it should be noted that first game player first exits after copy, second game player exits copy,
Due to network delay of first game player etc., causes game server to get first game player and exit copy
Time it is later, the information of second game player has been saved in dull queue, in order to guarantee first game player's
Information can be handled before the information of second game player by game server poll, i.e., the information of first game player
Before the information for coming second game player, after any one game player exits copy, game server can be
By game player storage to before dull queue, by the game player exit time of copy successively be saved in queue
Multiple game players exit time of copy and be compared, due to the multiple game players saved in queue exit copy when
Between there is monotonicity, therefore the game player can be exited to time of copy since tail of the queue, successively with trip each in queue
The time that play player exits copy is compared.
In a kind of optional scheme, game player can be in game client by interface operation, to game server
Copy is exited in request, and after any one game player exits from copy, game server is available to be played to the game
Family exits time of copy, by the game player exit time of copy successively with multiple game players for being saved in queue
The time for exiting copy is compared, if the time that the game player exits copy exits copy than the game player of tail of the queue
Time wants late, i.e., the game player that the time that the game player exits copy is more than or equal to tail of the queue exits the time of copy, then will
The information of the game player is inserted into queue tail.If the time that the game player exits copy plays than a game in queue
The time that family exits copy wants late, and more early than the time that another game player exits copy, i.e., the game player exits copy
Time be more than or equal to a game player and exit time of copy, less than or equal to another game player exit copy when
Between, then the letter that can be inserted into the information of the game player between the information and another game player of one game player
Breath.
In application scenarios as shown in Figure 5, after game player 9 exits from copy, game server can be obtained
It takes game player 9 to exit the time of copy, game player 9 is exited into time of copy since the tail of the queue of dull queue, with trip
The time that play player 8 exits copy is compared, and moves back if the time that game player 9 exits copy is more than or equal to game player 8
The time that the time of copy out, i.e. game player 9 exit copy is more late than the time that game player 8 exits copy, then plays game
The information of family 9 is inserted into dull queue tail, the information of game player 9 is inserted into after the information of game player 8.If trip
The time that play player 9 exits copy is less than the time that game player 8 exits copy, then game player 9 is exited to the time of copy
The time for exiting copy with game player 7 is compared, if the time that game player 9 exits copy is more than or equal to game player
7 exit the time of copy, i.e., game player 9 exit copy time it is more late than the time that game player 7 exits copy, then by game
The information of player 9 is inserted between game player 7 and game player 8.
Optionally, according to that above embodiment of the present invention, step S404 judges that target object exits the duration of default group and is
No arrival preset duration may include steps of:
Step S40422 obtains current time;
Step S40424 calculates target object and exits the sum of time and preset duration of default group, obtains time and value;
Step S40426, judges whether current time is more than or equal to time and value;Wherein, if current time is more than or equal to
Time and value, the then duration that target object exits default group reach preset duration.
Optionally, current time can be the current time of server, for example, when server process target object when
Between.
In a kind of optional scheme, judge whether the judgment method that Penalty time reaches can be correct game player
Judge whether current time is greater than the game player and exits time of copy plus Penalty time, if it is, illustrating the game
The duration that player exits copy reaches Penalty time, i.e. game player's Penalty time reaches, which can be fallen out,
The information of the game player is deleted from dull queue;If it is not, then illustrating that the game player exits the duration of copy and do not arrive
Up to Penalty time, i.e., for game player's Penalty time to not reaching, game server can terminate this poll.
In application scenarios as shown in Figure 5, judging that game player 1 exits the duration of copy and whether reach Penalty time
When, game server can calculate game player 1 and exit the sum of time and Penalty time of copy, and what be will acquire works as
The sum of preceding time and the time are compared, if current time is more than or equal to the sum of the time, illustrate that the game player 1 moves back
Out copy duration reach Penalty time, i.e., 1 Penalty time of game player reach, can the game player 1 fall out, i.e., from dullness
The information of the game player 1 is deleted in queue.
Optionally, according to that above embodiment of the present invention, step S404 judges that target object exits the duration of default group and is
No arrival preset duration may include steps of:
Step S40442 obtains current time;
Step S40444 calculates the difference that current time exits the time of default group with target object, it is poor to obtain duration
Value;
Step S40446, judges whether duration difference is more than or equal to preset duration;Wherein, if duration difference is more than or equal to
Preset duration, the then duration that target object exits default group reach preset duration.
In a kind of optional scheme, judge whether the judgment method that Penalty time reaches can be correct game player
Judge whether Penalty time is less than current time and subtracts the game player and exit the time of copy, if it is, illustrating the game
The duration that player exits copy reaches Penalty time, i.e. game player's Penalty time reaches, which can be fallen out,
The information of the game player is deleted from dull queue;If it is not, then illustrating that the game player exits the duration of copy and do not arrive
Up to Penalty time, i.e., for game player's Penalty time to not reaching, game server can terminate this poll.
In application scenarios as shown in Figure 5, judging that game player 1 exits the duration of copy and whether reach Penalty time
When, game server can calculate the current time got and game player 1 exit copy time difference, and will punish
It penalizes time and the difference of the time to be compared, if the difference of the time is more than or equal to Penalty time, illustrates that the game player 1 moves back
Out copy duration reach Penalty time, i.e., 1 Penalty time of game player reach, can the game player 1 fall out, i.e., from dullness
The information of the game player 1 is deleted in queue.
Optionally, according to that above embodiment of the present invention, the information of above-mentioned target object can also include: the mark of target object
Know information, wherein in step S406, from queue while the information of delete target object or later, the above method can be with
Include the following steps:
Step S422 generates prompt information, wherein prompt information reaches preset duration for prompting;
Step S424 will be prompted to information and be sent to target object according to the identification information of target object.
The identification information of above-mentioned target object can be the ID of target object or the account of target object, and the present invention is to this
It is not specifically limited, the purpose of above-described embodiment can may be implemented in other with the information of the unique identification target object.
In a kind of optional scheme, after any one game player exits from copy, game server can be with
The time that the ID of game player and game player exit copy is inserted into dull queue as a total body, game
For server when executing this current poll, the game player of acquisition dull queue team head exits the ID of the time sum of copy, and
Judge that the game player exits the duration of copy and whether reaches preset duration, if the duration that the game player exits copy reaches
Penalty time can then fall out the information of the game player, i.e., delete the information of the game player from dull queue, and
According to the ID of the game player, the prompt information of generation is sent to the game player, informs that its Penalty time reaches, Ke Yizai
It is secondary to enter copy.
In application scenarios as shown in Figure 5, store 9 game players' for exiting the same copy in dull queue
Information, respectively game player 1 exit time and the ID0001 of copy, and game player 2 exits time and the ID0002 of copy, trip
Play player 3 exits time and the ID0003 of copy, and game player 4 exits time and the ID0004 of copy, and game player 5 exits pair
This time and ID0005, game player 6 exit time and the ID0006 of copy, game player 7 exit copy time and
ID0007, game player 8 exits the time of copy and ID0008 and game player exit time and the ID0009 of copy.Trip
Server play when executing this current poll, game player 1 can be obtained first and exit the time of copy and the ID of player 1,
Judge that game player 1 exits the duration of copy and whether reaches Penalty time, if the duration arrival that game player 1 exits copy is punished
It penalizes the time, then game player 1 is gone out into team, game player 1 is deleted from dull queue, and information hair will be prompted to according to ID0001
Game player 1 is given, informs that its Penalty time reaches, copy can be again introduced into.
Optionally, according to that above embodiment of the present invention, in step S402, the target object on the head in queue is obtained
Before information, the above method can also include the following steps:
Step S400 starts timer, and whether timer is sky every preset time snoop queue, if queue is not
Sky, then execute obtain in queue head target object information the step of.
In order to guarantee that server handles the information of team's head target object in time, above-mentioned preset time can be 1s, i.e. timing
Whether the queue of device poll per second is empty.
In a kind of optional scheme, game server, which can star, can all execute primary timer an each second,
When each second executes, game server can first the queue of poll dullness whether be it is empty, i.e., in the queue of poll dullness whether
There is penalized game player, if dull queue is sky, game server stops, and directly waits holding for next second timer
Row.If dull queue be not it is empty, judge that the game player of dull queue team exits the duration of copy and whether reaches always
Preset duration falls out the information of the game player, i.e., if the duration that the game player exits copy reaches Penalty time
The information of the game player is deleted from dull queue, and continue to judge next game player of team's head exit copy when
Whether length reaches Penalty time, if the duration that next game player exits copy is not up to Penalty time, or dull team
Be classified as sky, i.e., the game player that no Penalty time does not arrive, due in queue game player be according to exit time of copy from
It is small to being ranked up greatly, it is ensured that other game players in queue affirm that Penalty time does not arrive also, then game server stops
This poll is only executed, the execution of next second timer is waited.
A kind of preferred embodiment of the present invention is described in detail below with reference to Fig. 6.
As shown in fig. 6, providing a kind of processing method of the information of optional target object, this method may include as follows
Step S61 to step S65:
Step S61, timer time per second reach.
Optionally, game server, which can star, can all execute primary timer an each second, and timer is per second to be held
Row is primary.
Step S62 judges whether queue is empty.
Optionally, above-mentioned queue can be dull queue, and when timer execution per second, game server can take turns first
Inquiry judges whether dull queue is sky, if it is sky, enters step S65;If being not sky, S63 is entered step.
Step S63, judge team head game player whether Penalty time arrives.
Optionally, above-mentioned preset duration can be the Penalty time for allowing game player that copy is added again, game services
For device when executing this current poll, the game player of available dullness queue team head exits time and the ID of copy, and sentences
Breaking, whether Penalty time arrives the game player, i.e., whether the duration that the game player exits copy reaches preset duration, if so,
Then illustrate that the game player exits the duration arrival Penalty time of copy, enters step S64;If it is not, then illustrating that the game is played
The duration that family exits copy does not reach Penalty time, enters step S65.
Step S64 notifies game player's Penalty time to be deleted from queue to and by the game player.
Optionally, if game player's Penalty time arrives, i.e., when the duration that the game player exits copy reaches default
It is long, then the information of the game player is fallen out, i.e., deleted the information of the game player from dull queue, and according to the game
The prompt information of generation is sent to the game player by the ID of player, is informed that its Penalty time reaches, can be again introduced into pair
This.After executing the step S64, S62 is entered step, continues to judge the duration that next game player of team's head exits copy
Whether Penalty time is reached.
Step S65 terminates.
Optionally, if the duration that next game player exits copy is not up to Penalty time, or dull queue is
Sky, i.e., the game player that no Penalty time does not arrive, then game server stops executing this poll, waits next second timer
Execution.
Herein it should be noted that the time that data are inserted into tail of the queue and the operation for removing data from team's head is answered in dull queue
Miscellaneous degree is all a constant, when execution due to each second, at most can only be polled to player that Penalty time arrives and one not
The player arrived, and Penalty time to player can go out team, will not be polled to again next time, so dividing the time of execution per second
Complexity is the constant unrelated with n, compares common practice, significantly reduces the calculated load of server.
By above-mentioned preferred embodiment, by dull queue, i.e. the queue of the first in first out with monotonicity is established single
Adjusting queue similar with common queue is established all is only to have added a limitation using single-track link table, is exactly that element is being inserted into
To guarantee when the tail portion of this queue and the queue in other elements monotonicity.Properly have by using dull queue
The information (id of player exits the time of copy) of the penalized player of tissue of sequence, rather than carelessly by penalized player's
Information concentrates in together poll each second, can greatly increase the efficiency of inquiry, significantly reduces the calculated load of server.Drop
The complexity of low poll per second is reduced to a constant unrelated with the number n of penalized player, that is, in penalized object for appreciation
In the case that there are many family, a very high efficiency also can guarantee.
It should be noted that for the various method embodiments described above, for simple description, therefore, it is stated as a series of
Combination of actions, but those skilled in the art should understand that, the present invention is not limited by the sequence of acts described because
According to the present invention, some steps may be performed in other sequences or simultaneously.Secondly, those skilled in the art should also know
It knows, the embodiments described in the specification are all preferred embodiments, and related actions and modules is not necessarily of the invention
It is necessary.
Through the above description of the embodiments, those skilled in the art can be understood that according to above-mentioned implementation
The method of example can be realized by means of software and necessary general hardware platform, naturally it is also possible to by hardware, but it is very much
In the case of the former be more preferably embodiment.Based on this understanding, technical solution of the present invention is substantially in other words to existing
The part that technology contributes can be embodied in the form of software products, which is stored in a storage
In medium (such as ROM/RAM, magnetic disk, CD), including some instructions are used so that a terminal device (can be mobile phone, calculate
Machine, server or network equipment etc.) execute method described in each embodiment of the present invention.
Embodiment two
According to embodiments of the present invention, a kind of embodiment of the processing unit of the information of target object is additionally provided.
Fig. 7 is a kind of schematic diagram of the processing unit of the information of target object according to an embodiment of the present invention, such as Fig. 7 institute
Show, which includes: the first acquisition module 71, judgment module 73 and removing module 75.
Wherein, the first acquisition module 71 is used to obtain the information of the target object on the head in queue, wherein queue is used
The information of multiple target objects of default group is exited in storage, the information of multiple target objects in queue is according to monotonic order
Sequence, the information of target object include at least: target object exits the time of default group;Judgment module 73 is for judging target
Whether the duration that object exits default group reaches preset duration, wherein preset duration is that target object is allowed to be added again in advance
If the waiting time of group;If duration of the removing module 75 for target object to exit default group reaches preset duration,
The information of delete target object from queue.
Optionally, the information of multiple target objects in above-mentioned queue can exit default group according to each target object
Time sort from small to large.
Above-mentioned target object can be the game player in online game, and above-mentioned default group can be in online game
Copy, above-mentioned preset duration can be the Penalty time for allowing game player that copy is added again, and above-mentioned queue can be dullness
Queue, the information for each exiting the game player of copy are stored in dull queue by orderly.Since game player moves back
Copy has sequencing out, and all players of Penalty time are the same, so the arrival of player's Penalty time is successive
For sequence with exiting being consistent for copy, the time for terminating punishment can satisfy monotonicity.Due to the more early copy of exiting
Game player, the more early arrival of Penalty time, in order to guarantee that the information of the more early game player for exiting copy can be by game garment
It is engaged in the more early processing of device, the information of the game player in dull queue is ranked up from small to large according to the time for exiting copy, i.e.,
The more early game player for exiting copy is closer to the head of dull queue.
Herein it should be noted that above-mentioned first obtains module 71, judgment module 73 and removing module 75, which correspond to, to be implemented
Step S402 to step S406 in example one, three modules are identical as example and application scenarios that corresponding step is realized, but
It is not limited to the above embodiments two disclosure of that.It should be noted that above-mentioned module can be run as a part of of device
In the terminal 30 that embodiment one provides.
From the foregoing, it will be observed that obtaining the target object on the head in queue in scheme disclosed in the above embodiment of the present invention two
Information, judge that target object exits the duration of default group and whether reaches preset duration, if target object exits default group
Group duration reach preset duration, then from queue delete target object information.
It is easily noted that, since the information of multiple target objects in queue sorts according to monotonic order, available place
In the information of the target object on the head of queue, if the duration that target object exits default group reaches preset duration, from
The information of delete target object in queue.Therefore, through the embodiment of the present invention provided by scheme, can be by using dull team
Column carry out the information of properly orderly organizational goal object, rather than concentrating in together the information of target object carelessly is taken turns
It askes, to reach the efficiency for increasing poll, mitigates the effect of the calculated load of server.
The scheme of above-described embodiment two provided by the invention solves in the prior art by way of traversing poll as a result,
The information of each target object is handled, complexity is higher, the lower technical problem of efficiency.
Optionally, according to that above embodiment of the present invention, as shown in figure 8, above-mentioned apparatus further include: second obtains module 81,
Comparison module 83, the first insertion module 85 and the second insertion module 87.
Wherein, if the second acquisition module 81 obtains the first mesh for detecting that first object object exits default group
Mark object exits the time of default group;Comparison module 83 be used to exit first object object time of default group successively with
The time that the multiple target objects being saved in queue exit default group is compared;If the first insertion module 85 is used for
The time that first object object exits default group is more than or equal to the time that each target object in queue exits default group, then
The information of first object object is inserted into the tail portion of queue;If the second insertion module 87 exits pre- for first object object
If the second target object that the time of group is less than in queue exits the time of default group, and the third target being greater than in queue
Object exits the time of default group, then the information of first object object is inserted into the second target object and third target object
Between.
The time that above-mentioned second target object exits default group can be greater than third target object and exit default group
Time, i.e., the information of the second target object is after the information of third target object.
Herein it should be noted that first game player first exits after copy, second game player exits copy,
Due to network delay of first game player etc., causes game server to get first game player and exit copy
Time it is later, the information of second game player has been saved in dull queue, in order to guarantee first game player's
Information can be handled before the information of second game player by game server poll, i.e., the information of first game player
Before the information for coming second game player, after any one game player exits copy, game server can be
By game player storage to before dull queue, by the game player exit time of copy successively be saved in queue
Multiple game players exit time of copy and be compared, due to the multiple game players saved in queue exit copy when
Between there is monotonicity, therefore the game player can be exited to time of copy since tail of the queue, successively with trip each in queue
The time that play player exits copy is compared.
Herein it should also be noted that, above-mentioned second obtains module 81, comparison module 83, the first insertion module 85 and second
The reality that the step S412 that insertion module 87 corresponds in embodiment one is realized to step S418, four modules with corresponding step
Example is identical with application scenarios, but is not limited to the above embodiments two disclosure of that.It should be noted that above-mentioned module is as dress
The a part set may operate in the terminal 30 of the offer of embodiment one.
Optionally, according to that above embodiment of the present invention, as shown in figure 9, judgment module 73 includes: first acquisition unit 91,
First computing unit 93 and the first judging unit 95.
Wherein, first acquisition unit 91 is for obtaining current time;First computing unit 93 is moved back for calculating target object
The sum of time and the preset duration for presetting group out, obtain time and value;First judging unit 95 is for judging that current time is
It is no to be more than or equal to time and value;Wherein, if current time is more than or equal to time and value, target object exits default group
Duration reaches preset duration.
Optionally, current time can be the current time of server, for example, when server process target object when
Between.
Herein it should also be noted that, above-mentioned first acquisition unit 91, the first computing unit 93 and the first judging unit 95
Corresponding to the step S40422 to step S40426 in embodiment one, example and answer that three modules and corresponding step are realized
It is identical with scene, but it is not limited to the above embodiments two disclosure of that.It should be noted that above-mentioned module as device one
Part may operate in the terminal 30 of the offer of embodiment one.
Optionally, according to that above embodiment of the present invention, as shown in Figure 10, judgment module 73 includes: second acquisition unit
101, the second computing unit 103 and second judgment unit 105.
Wherein, second acquisition unit 101 is for obtaining current time;Second computing unit 103 is for calculating target object
The sum of time and the preset duration for exiting default group, obtain time and value;Second judgment unit 105 is for judging current time
Whether time and value are more than or equal to;Wherein, if current time is more than or equal to time and value, target object exits default group
Duration reach preset duration.
Herein it should also be noted that, above-mentioned second acquisition unit 101, the second computing unit 103 and second judgment unit
The example that the 105 step S40442 corresponded in embodiment one are realized to step S40446, three modules with corresponding step
It is identical with application scenarios, but it is not limited to the above embodiments two disclosure of that.It should be noted that above-mentioned module is as device
A part may operate in embodiment one offer terminal 30 in.
Optionally, according to that above embodiment of the present invention, as shown in figure 11, the information of above-mentioned target object can also include:
The identification information of target object, wherein above-mentioned apparatus further include: generation module 111 and sending module 113.
Wherein, generation module 111 is for generating prompt information, wherein prompt information reaches preset duration for prompting;Hair
It send module 113 for the identification information according to target object, will be prompted to information and be sent to target object.
The identification information of above-mentioned target object can be the ID of target object or the account of target object, and the present invention is to this
It is not specifically limited, the purpose of above-described embodiment can may be implemented in other with the information of the unique identification target object.
Herein it should be noted that above-mentioned generation module 111 and sending module 113 correspond to the step in embodiment one
S422 to step S424, two modules are identical as example and application scenarios that corresponding step is realized, but are not limited to above-mentioned reality
Apply two disclosure of that of example.It is mentioned it should be noted that above-mentioned module may operate in embodiment one as a part of device
In the terminal 30 of confession.
Optionally, according to that above embodiment of the present invention, as shown in figure 12, above-mentioned apparatus further include: starting module 121.
Wherein, whether starting module 121 is sky every preset time snoop queue for starting timer, timer, such as
Fruit queue is not sky, then executes the above-mentioned first function of obtaining module 71.
In order to guarantee that server handles the information of team's head target object in time, above-mentioned preset time can be 1s, i.e. timing
Whether the queue of device poll per second is empty.
Herein it should be noted that above-mentioned starting module 121 correspond to embodiment one in step S400, the module with it is right
The example that the step of answering is realized is identical with application scenarios, but is not limited to the above embodiments two disclosure of that.It needs to illustrate
, above-mentioned module as a part of device may operate in embodiment one offer terminal 30 in.
Embodiment three
The embodiment of the present invention can provide a kind of terminal, which can be in terminal group
Any one computer terminal.Optionally, in the present embodiment, above-mentioned terminal also could alternatively be communication and set
It is standby to wait terminal devices.
Optionally, in the present embodiment, above-mentioned terminal can be located in multiple network equipments of computer network
At least one network equipment.
In the present embodiment, above-mentioned terminal can be with following steps in the processing method of the information of performance objective object
Program code: obtain the information of the target object on the head in queue, wherein queue exits default group for storing
The information of the information of multiple target objects, multiple target objects in queue sorts according to monotonic order, the information of target object
Include at least: target object exits the time of default group;Judge target object exit default group duration whether reach it is pre-
If duration, wherein preset duration is the waiting time for allowing target object that default group is added again;If target object exits
The duration of default group reaches preset duration, then from queue delete target object information.
Optionally, Figure 13 is a kind of structural block diagram of terminal according to an embodiment of the present invention.As shown in figure 13, should
Terminal A may include: one or more (one is only shown in figure) processors 131, memory 133 and transmission dress
Set 135.
Wherein, memory can be used for storing software program and module, such as the letter of the target object in the embodiment of the present invention
Corresponding program instruction/the module of the treating method and apparatus of breath, the software program that processor is stored in memory by operation
And module realizes the processing side of the information of above-mentioned target object thereby executing various function application and data processing
Method.Memory may include high speed random access memory, can also include nonvolatile memory, such as one or more magnetic storage
Device, flash memory or other non-volatile solid state memories.In some instances, memory can further comprise relative to place
The remotely located memory of device is managed, these remote memories can pass through network connection to terminal A.The example of above-mentioned network includes
But be not limited to internet, intranet, local area network, mobile radio communication and combinations thereof.
Processor can call the information and application program of memory storage by transmitting device, to execute following step:
Obtain the information of the target object on the head in queue, wherein queue is for storing the multiple targets pair for exiting default group
The information of the information of elephant, multiple target objects in queue sorts according to monotonic order, and the information of target object includes at least: mesh
Mark object exits the time of default group;Judge that target object exits the duration of default group and whether reaches preset duration, wherein
Preset duration is the waiting time for allowing target object that default group is added again;If target object exit default group when
It is long to reach preset duration, then from queue delete target object information.
Optionally, the program code of following steps can also be performed in above-mentioned processor: multiple target objects in queue
Information sorts from small to large according to the time that each target object exits default group.
Optionally, the program code of following steps can also be performed in above-mentioned processor: obtaining the head in queue
Before the information of target object, if detecting that first object object exits default group, acquisition first object object exits pre-
If the time of group;By first object object exit time of default group successively with multiple targets pair for being saved in queue
Time as exiting default group is compared;If the time that first object object exits default group is more than or equal in queue
Each target object exits the time of default group, then the information of first object object is inserted into the tail portion of queue;If the
The second target object that the time that one target object exits default group is less than in queue exits the time of default group, and is greater than
Third target object in queue exits the time of default group, then the information of first object object is inserted into the second target pair
Between the information of elephant and the information of third target object.
Optionally, the program code of following steps can also be performed in above-mentioned processor: obtaining current time;Calculate target pair
As the sum of time and the preset duration for exiting default group, time and value are obtained;Judge whether current time is more than or equal to the time
And value;Wherein, if current time is more than or equal to time and value, when the duration that target object exits default group reaches default
It is long.
Optionally, the program code of following steps can also be performed in above-mentioned processor: obtaining current time;When calculating current
Between exited with target object default group time difference, obtain duration difference;It is pre- to judge whether duration difference is more than or equal to
If duration;Wherein, if duration difference is more than or equal to preset duration, the duration that target object exits default group reaches default
Duration.
Optionally, the program code of following steps: the information of target object further include: mesh can also be performed in above-mentioned processor
The identification information for marking object generates prompt information while the information of delete target object from queue or later, wherein
Prompt information reaches preset duration for prompting;According to the identification information of target object, it will be prompted to information and be sent to target object.
Optionally, the program code of following steps can also be performed in above-mentioned processor: obtaining the mesh on the head in queue
Before the information for marking object, start timer, whether timer is sky every preset time snoop queue, if queue is not
Sky, then execute obtain in queue head target object information the step of.
Using the embodiment of the present invention, the information of the target object on the head in queue is obtained, judges that target object exits
Whether the duration of default group reaches preset duration, if the duration that target object exits default group reaches preset duration,
The information of delete target object from queue.
It is easily noted that, since the information of multiple target objects in queue sorts according to monotonic order, available place
In the information of the target object on the head of queue, if the duration that target object exits default group reaches preset duration, from
The information of delete target object in queue.Therefore, through the embodiment of the present invention provided by scheme, can be by using dull team
Column carry out the information of properly orderly organizational goal object, rather than concentrating in together the information of target object carelessly is taken turns
It askes, to reach the efficiency for increasing poll, mitigates the effect of the calculated load of server.
The scheme of above-described embodiment one provided by the invention solves in the prior art by way of traversing poll as a result,
The information of each target object is handled, complexity is higher, the lower technical problem of efficiency.
It will appreciated by the skilled person that structure shown in Figure 13 is only to illustrate, terminal is also possible to
Smart phone (such as Android phone, iOS mobile phone), tablet computer, applause computer and mobile internet device (Mobile
Internet Devices, MID), the terminal devices such as PAD.Figure 13 it does not cause to limit to the structure of above-mentioned electronic device.Example
Such as, terminal A may also include the more or less component (such as network interface, display device) than shown in Figure 13,
Or with the configuration different from shown in Figure 13.
Those of ordinary skill in the art will appreciate that all or part of the steps in the various methods of above-described embodiment is can
It is completed with instructing the relevant hardware of terminal device by program, which can store in a computer readable storage medium
In, storage medium may include: flash disk, read-only memory (Read-Only Memory, ROM), random access device (Random
Access Memory, RAM), disk or CD etc..
Example IV
The embodiments of the present invention also provide a kind of storage mediums.Optionally, in the present embodiment, above-mentioned storage medium can
With program code performed by the content display method for saving electric interface of making a return journey provided by above-described embodiment two.
Optionally, in the present embodiment, above-mentioned storage medium can be located in computer network in computer terminal group
In any one communication equipment in any one terminal, or in communication equipment group.
Optionally, in the present embodiment, storage medium is arranged to store the program code for executing following steps: obtaining
Take the information of the target object on the head in queue, wherein queue is for storing the multiple target objects for exiting default group
Information, the information of multiple target objects in queue sorts according to monotonic order, and the information of target object includes at least: target
Object exits the time of default group;Judge that target object exits the duration of default group and whether reaches preset duration, wherein pre-
If when it is a length of allow target object is added again preset group waiting time;If target object exits the duration of default group
Reach preset duration, then from queue delete target object information.
Optionally, storage medium is also configured to store the program code for executing following steps: multiple in queue
The information of target object sorts from small to large according to the time that each target object exits default group.
Optionally, storage medium is also configured to store the program code for executing following steps: being in team obtaining
Before the information of the target object on the head of column, if detecting that first object object exits default group, first object is obtained
Object exits the time of default group;By first object object exit time of default group successively be saved in queue
The time that multiple target objects exit default group is compared;If the time that first object object exits default group is greater than
Equal to the time that target object each in queue exits default group, then the information of first object object is inserted into the tail of queue
Portion;If first object object exit default group time be less than queue in the second target object exit default group when
Between, and the third target object being greater than in queue exits the time of default group, then is inserted into the information of first object object
Between the information of second target object and the information of third target object.
Optionally, storage medium is also configured to store the program code for executing following steps: obtaining current time;
It calculates target object and exits the sum of time and preset duration of default group, obtain time and value;Judge whether current time is big
In equal to time and value;Wherein, if current time is more than or equal to time and value, target object exits the duration of default group
Reach preset duration.
Optionally, storage medium is also configured to store the program code for executing following steps: obtaining current time;
The difference that current time exits the time of default group with target object is calculated, duration difference is obtained;Whether judge duration difference
More than or equal to preset duration;Wherein, if duration difference be more than or equal to preset duration, target object exit default group when
It is long to reach preset duration.
Optionally, storage medium is also configured to store the program code for executing following steps: the letter of target object
Breath further include: the identification information of target object generates prompt while the information of delete target object from queue or later
Information, wherein prompt information reaches preset duration for prompting;According to the identification information of target object, information transmission will be prompted to
To target object.
Optionally, storage medium is also configured to store the program code for executing following steps: obtaining in queue
Head target object information before, start timer, whether timer is empty every preset time snoop queue, if
Not the step of queue is not sky, then executes the information for obtaining the target object on the head in queue.
The serial number of the above embodiments of the invention is only for description, does not represent the advantages or disadvantages of the embodiments.
In the above embodiment of the invention, it all emphasizes particularly on different fields to the description of each embodiment, does not have in some embodiment
The part of detailed description, reference can be made to the related descriptions of other embodiments.
In several embodiments provided by the present invention, it should be understood that disclosed technology contents can pass through others
Mode is realized.Wherein, the apparatus embodiments described above are merely exemplary, such as the division of the unit, Ke Yiwei
A kind of logical function partition, there may be another division manner in actual implementation, for example, multiple units or components can combine or
Person is desirably integrated into another system, or some features can be ignored or not executed.Another point, shown or discussed is mutual
Between coupling, direct-coupling or communication connection can be through some interfaces, the INDIRECT COUPLING or communication link of unit or module
It connects, can be electrical or other forms.
The unit as illustrated by the separation member may or may not be physically separated, aobvious as unit
The component shown may or may not be physical unit, it can and it is in one place, or may be distributed over multiple
On unit.It can some or all of the units may be selected to achieve the purpose of the solution of this embodiment according to the actual needs.
It, can also be in addition, the functional units in various embodiments of the present invention may be integrated into one processing unit
It is that each unit physically exists alone, can also be integrated in one unit with two or more units.Above-mentioned integrated list
Member both can take the form of hardware realization, can also realize in the form of software functional units.
If the integrated unit is realized in the form of SFU software functional unit and sells or use as independent product
When, it can store in a computer readable storage medium.Based on this understanding, technical solution of the present invention is substantially
The all or part of the part that contributes to existing technology or the technical solution can be in the form of software products in other words
It embodies, which is stored in a storage medium, including some instructions are used so that a computer
Equipment (can for personal computer, server or network equipment etc.) execute each embodiment the method for the present invention whole or
Part steps.And storage medium above-mentioned includes: that USB flash disk, read-only memory (ROM, Read-Only Memory), arbitrary access are deposited
Reservoir (RAM, Random Access Memory), mobile hard disk, magnetic or disk etc. be various to can store program code
Medium.
The above is only a preferred embodiment of the present invention, it is noted that for the ordinary skill people of the art
For member, various improvements and modifications may be made without departing from the principle of the present invention, these improvements and modifications are also answered
It is considered as protection scope of the present invention.
Claims (14)
1. a kind of processing method of the information of target object characterized by comprising
Obtain the information of the target object on the head in queue, wherein the queue exits the more of default group for storing
The information of the information of a target object, the multiple target object in the queue sorts according to monotonic order, the target
The information of object includes at least: the target object exits the time of the default group, and the default group is online game
In copy;
Judge that the target object exits the duration of the default group and whether reaches preset duration, wherein the preset duration
To allow the target object that the waiting time of the default group is added again;
If the duration that the target object exits the default group reaches the preset duration, deleted from the queue
The information of the target object.
2. the method according to claim 1, wherein the information of the multiple target object in the queue is pressed
The time for exiting the default group according to each target object sorts from small to large.
3. according to the method described in claim 2, it is characterized in that, obtaining the information for being in the target object on head of queue
Before, the method also includes:
If detecting that first object object exits the default group, obtains the first object object and exit the default group
The time of group;
By the first object object exit time of the default group successively be saved in the queue it is described more
The time that a target object exits the default group is compared;
If the time that the first object object exits the default group is more than or equal to each target object in the queue
The time of the default group is exited, then the information of the first object object is inserted into the tail portion of the queue;
If the second target object that the time that the first object object exits the default group is less than in the queue moves back
The time of the default group out, and the third target object being greater than in the queue exits the time of the default group, then
The information of the first object object is inserted into the information of second target object and the information of the third target object
Between.
4. according to the method described in claim 2, it is characterized in that, judge the target object exit the default group when
Whether length, which reaches preset duration, includes:
Obtain current time;
Time and the sum of the preset duration that the target object exits the default group are calculated, time and value are obtained;
Judge whether the current time is more than or equal to the time and value;
Wherein, if the current time is more than or equal to the time and value, the target object exits the default group
Duration reach the preset duration.
5. according to the method described in claim 2, it is characterized in that, judge the target object exit the default group when
Whether length, which reaches preset duration, includes:
Obtain current time;
The difference that the current time exits the time of default group with the target object is calculated, duration difference is obtained;
Judge whether the duration difference is more than or equal to the preset duration;
Wherein, if the duration difference be more than or equal to the preset duration, the target object exit default group when
It is long to reach the preset duration.
6. according to the method described in claim 2, it is characterized in that, the information of the target object further include: the target pair
The identification information of elephant, wherein while deleting the information of the target object from the queue or later, the method is also
Include:
Generate prompt information, wherein the prompt information reaches the preset duration for prompting;
According to the identification information of the target object, the prompt information is sent to the target object.
7. method as claimed in any of claims 1 to 6, which is characterized in that obtaining the head in queue
Before the information of target object, the method also includes: starting timer, timer team described in the preset time poll
Whether column are empty, if the queue is not empty, the step of executing the information for obtaining the target object on the head in queue.
8. a kind of processing unit of the information of target object characterized by comprising
First obtains module, for obtaining the information for being in the target object on head of queue, wherein the queue is for storing
The information of multiple target objects of default group is exited, the information of the multiple target object in the queue is according to dull suitable
Sequence sequence, the information of the target object include at least: the target object exits the time of the default group, described default
Group is the copy in online game;
Whether judgment module reaches preset duration for judging that the target object exits the duration of the default group, wherein
The preset duration is the waiting time for allowing the target object that the default group is added again;
Removing module, if the duration for the target object to exit the default group reaches the preset duration, from
The information of the target object is deleted in the queue.
9. device according to claim 8, which is characterized in that the information of the multiple target object in the queue is pressed
The time for exiting the default group according to each target object sorts from small to large.
10. device according to claim 9, which is characterized in that described device further include:
Second obtains module, if obtaining the first object for detecting that first object object exits the default group
Object exits the time of the default group;
Comparison module, for the first object object is exited time of the default group successively in the queue
The time that the multiple target object saved exits the default group is compared;
First insertion module, if the time for the first object object to exit the default group is more than or equal to the team
Each target object exits the time of the default group in column, then the information of the first object object is inserted into the team
The tail portion of column;
Second insertion module, if the time for the first object object to exit the default group is less than in the queue
The second target object third target object for exiting time of the default group, and being greater than in the queue exit it is described pre-
If the time of group, then the information of the first object object is inserted into the information and the third of second target object
Between the information of target object.
11. device according to claim 9, which is characterized in that the judgment module includes:
First acquisition unit, for obtaining current time;
First computing unit, for calculate the target object exit the default group time and the preset duration it
With obtain time and value;
First judging unit, for judging whether the current time is more than or equal to the time and value;Wherein, if described work as
The preceding time is more than or equal to the time and value, then when the duration that the target object exits the default group reaches described default
It is long.
12. device according to claim 9, which is characterized in that the judgment module includes:
Second acquisition unit, for obtaining current time;
Second computing unit, the difference for exiting the time of default group for calculating the current time and the target object,
Obtain duration difference;
Second judgment unit, for judging whether the duration difference is more than or equal to the preset duration;Wherein, if when described
Long difference is more than or equal to the preset duration, then the duration that the target object exits default group reaches the preset duration.
13. device according to claim 9, which is characterized in that the information of the target object further include: the target pair
The identification information of elephant, wherein described device further include:
Generation module, for generating prompt information, wherein the prompt information reaches preset duration for prompting;
The prompt information is sent to the target object for the identification information according to the target object by sending module.
14. the device according to any one of claim 8 to 13, which is characterized in that described device further include: starting mould
Block, for starting timer, timer queue described in the preset time poll whether be it is empty, if the queue is not
Sky then executes the described first function of obtaining module.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201610575902.7A CN106201432B (en) | 2016-07-19 | 2016-07-19 | The treating method and apparatus of the information of target object |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201610575902.7A CN106201432B (en) | 2016-07-19 | 2016-07-19 | The treating method and apparatus of the information of target object |
Publications (2)
Publication Number | Publication Date |
---|---|
CN106201432A CN106201432A (en) | 2016-12-07 |
CN106201432B true CN106201432B (en) | 2019-08-06 |
Family
ID=57491043
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201610575902.7A Active CN106201432B (en) | 2016-07-19 | 2016-07-19 | The treating method and apparatus of the information of target object |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN106201432B (en) |
Families Citing this family (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN108009022A (en) * | 2017-11-06 | 2018-05-08 | 联动优势科技有限公司 | A kind of message treatment method and server |
CN110727666A (en) * | 2019-09-25 | 2020-01-24 | 中冶赛迪重庆信息技术有限公司 | Cache assembly, method, equipment and storage medium for industrial internet platform |
Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102402416A (en) * | 2010-09-10 | 2012-04-04 | 深圳市金蝶中间件有限公司 | Method and device for setting dequeueing sequence of element |
CN103051511A (en) * | 2011-10-11 | 2013-04-17 | 阿里巴巴集团控股有限公司 | Information data processing method and device |
CN104360852A (en) * | 2014-10-30 | 2015-02-18 | 北京数字天域科技股份有限公司 | Application program management method and application program management device of mobile terminal |
CN105045723A (en) * | 2015-06-26 | 2015-11-11 | 深圳市腾讯计算机系统有限公司 | Processing method, apparatus and system for cached data |
CN105450737A (en) * | 2015-11-13 | 2016-03-30 | 网易(杭州)网络有限公司 | Data processing method, data processing device and data processing system |
CN105653635A (en) * | 2015-12-25 | 2016-06-08 | 北京奇虎科技有限公司 | Database management method and apparatus |
Family Cites Families (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US8024731B1 (en) * | 2007-04-25 | 2011-09-20 | Apple Inc. | Assigning priorities to threads of execution |
-
2016
- 2016-07-19 CN CN201610575902.7A patent/CN106201432B/en active Active
Patent Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102402416A (en) * | 2010-09-10 | 2012-04-04 | 深圳市金蝶中间件有限公司 | Method and device for setting dequeueing sequence of element |
CN103051511A (en) * | 2011-10-11 | 2013-04-17 | 阿里巴巴集团控股有限公司 | Information data processing method and device |
CN104360852A (en) * | 2014-10-30 | 2015-02-18 | 北京数字天域科技股份有限公司 | Application program management method and application program management device of mobile terminal |
CN105045723A (en) * | 2015-06-26 | 2015-11-11 | 深圳市腾讯计算机系统有限公司 | Processing method, apparatus and system for cached data |
CN105450737A (en) * | 2015-11-13 | 2016-03-30 | 网易(杭州)网络有限公司 | Data processing method, data processing device and data processing system |
CN105653635A (en) * | 2015-12-25 | 2016-06-08 | 北京奇虎科技有限公司 | Database management method and apparatus |
Also Published As
Publication number | Publication date |
---|---|
CN106201432A (en) | 2016-12-07 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US20230293993A1 (en) | Program, method, and system of transmitting or receiving message | |
CN106075912B (en) | A kind of method and network game system of online game mutual assistance | |
US20200384364A1 (en) | Incentivizing players to engage in competitive gameplay | |
CN106110659B (en) | The processing method and processing device of game account | |
CN103729257B (en) | Distributed parallel computing method and system | |
CN112619158B (en) | Virtual event matching method and device, storage medium and electronic device | |
US20170312629A1 (en) | Video game control server, video game control apparatus, and video game control program product | |
CN108525293B (en) | Information processing method, device and storage medium | |
CN110428124A (en) | Method for allocating tasks, task allocation apparatus, storage medium and computer equipment | |
CN106201432B (en) | The treating method and apparatus of the information of target object | |
CN104606884B (en) | Matching process and device in a kind of game fighting | |
CN109731330A (en) | The display methods and device of picture, storage medium, electronic device | |
CN108310771A (en) | The execution method and apparatus of task, storage medium, electronic device | |
CN105288998B (en) | The exchange method and device of Intelligent hardware | |
CN107744665A (en) | The acquisition methods and device of the game operation for account number of playing | |
CN109672918A (en) | The synchronous broadcast method and device of animation | |
CN111013133A (en) | Data processing method and device | |
CN108289246A (en) | Data processing method, device, storage medium and electronic device | |
CN115155065A (en) | Display control method and device for instant card making game | |
CN108211361A (en) | Resource acquisition method of determining probability and device, storage medium, electronic device | |
JP7031811B2 (en) | A method and system for training player characters in sports games using spatial dualization | |
CN116152034A (en) | Processing system, device, terminal and method for guessing game | |
CN108295470B (en) | Virtual application control method and device, storage medium and electronic device | |
CN106029189A (en) | Game system and game program | |
CN109448681A (en) | K sings interactive system, implementation method, medium and system |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
C10 | Entry into substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
GR01 | Patent grant | ||
GR01 | Patent grant |