CN110738507A - Method and device for receiving a redemption code - Google Patents

Abstract

The invention discloses a method and device for receiving a redemption code, and relates to the technical field of computers. A specific implementation of the method includes: verifying the issued amount according to the issued amount of the redemption code and the total inventory; when the verification is passed, acquiring the pointer of the redemption code, and finding the corresponding user through the current pointer. in the storage queue for storing the redemption code; use a pop command to obtain the redemption code from the storage queue, so as to return the redemption code when the obtained redemption code is not empty. The method locates the storage queue through a pointer, and uses a stacking command to obtain the redemption code from the storage queue, which can effectively prevent the same redemption code from being repeatedly received when the redemption code is obtained concurrently.

Description

Method and device for receiving a redemption code

technical field

The present invention relates to the field of computers, and in particular, to a method and device for receiving a redemption code.

Background technique

In order to promote item marketing, merchants will issue redemption codes for physical items or virtual items to users, where the redemption code is a number composed of numbers and letters. Before the redemption code is issued, the merchant needs to upload the redemption code to a relational database for storage. When the user receives the redemption code, check whether there is an unclaimed redemption code in the database, and set the redemption status of the unclaimed redemption code as "redemption"; if the redemption code is successfully received, then the redemption code's redemption status Set it to "Claimed"; if the redemption code fails to be received, the redemption code's redemption status will be set to "Unclaimed".

In the process of realizing the present invention, the inventor found that there are at least the following problems in the prior art: the storage and receipt of redemption codes are based on relational databases, and under high concurrent requests, it is easy to occur that the same redemption code is received by multiple users, As a result, some users cannot use the redeem code they received.

SUMMARY OF THE INVENTION

In view of this, the embodiment of the present invention provides a method and device for obtaining a redemption code, which locates a storage queue through a pointer, and uses a pop-out command to obtain a redemption code from the storage queue, which can effectively prevent the same redemption code when the redemption code is obtained concurrently. received repeatedly.

In order to achieve the above purpose, according to an aspect of the embodiments of the present invention, a method for receiving a redemption code is provided.

A method for receiving a redemption code according to an embodiment of the present invention includes: verifying the issued amount according to the issued amount of the redemption code and the total inventory; The pointer finds the corresponding storage queue for storing the redemption code; the redemption code is obtained from the storage queue by using a pop command, so as to return the redemption code when the obtained redemption code is not empty .

Optionally, the method further includes: if the redemption code returns successfully, updating the redemption status of the redemption code; if the redemption code fails to return, pushing the redemption code to the current pointer by using a push command in the corresponding storage queue.

Optionally, after the step of acquiring the pointer of the redemption code, the method further includes: if the acquired redemption code is empty and the current pointer is less than the number of the storage queues, using the next pointer as the current pointer. pointer.

Optionally, before the step of verifying the issued amount, the step further includes: automatically increasing the issued amount of the redemption code; Carrying out the verification includes: comparing the self-increased release amount with the total inventory, and judging whether the verification is passed according to the comparison result.

Optionally, the method further includes: storing the redemption codes in at least one of the storage queues of the Redis database according to the total quantity of the redemption codes and the storage quantity of the storage queues.

To achieve the above object, according to another aspect of the embodiments of the present invention, a device for receiving a redemption code is provided.

A device for receiving a redemption code according to an embodiment of the present invention includes: a verification module for verifying the issued amount according to the issued amount of the redemption code and the total inventory; a search module for when the verification passes When obtaining the pointer of the redemption code, the corresponding storage queue for storing the redemption code is found through the current pointer; the return module is used to obtain the redemption code from the storage queue by using a pop command to store the redemption code in the When the obtained redemption code is not empty, the redemption code is returned.

Optionally, the device further includes: an update push module, configured to update the receiving state of the redemption code if the redemption code returns successfully; and if the redemption code fails to return, use a push command to convert the redemption code The code is pushed to the storage queue corresponding to the current pointer.

Optionally, the apparatus further includes: a pointer updating module, configured to use the next pointer as the current pointer if the acquired redemption code is empty and the current pointer is smaller than the number of the storage queues.

Optionally, the device further includes: an auto-increment module for auto-increasing the issued amount of the redemption code; the verification module, further for: adding the auto-incremented issued amount to the total inventory Compare and judge whether the verification is passed or not according to the comparison result.

Optionally, the apparatus further includes: a storage module, configured to store the redemption codes in at least one of the storage queues of the Redis database according to the total number of redemption codes and the storage quantity of the storage queues.

To achieve the above object, according to yet another aspect of the embodiments of the present invention, an electronic device is provided.

An electronic device according to an embodiment of the present invention includes: one or more processors; and a storage device configured to store one or more programs, when the one or more programs are executed by the one or more processors, The one or more processors are caused to implement a method for receiving a redemption code according to an embodiment of the present invention.

To achieve the above object, according to yet another aspect of the embodiments of the present invention, a computer-readable medium is provided.

A computer-readable medium according to an embodiment of the present invention stores a computer program thereon, and when the program is executed by a processor, a method for obtaining a redemption code according to an embodiment of the present invention is implemented.

One embodiment of the above invention has the following advantages or beneficial effects: locating the storage queue through a pointer, and using a pop-out command to obtain a redemption code from the storage queue, which can effectively prevent the same redemption code from being repeatedly collected when concurrently acquiring the redemption code; The push command pushes the failed redemption code to the storage queue corresponding to the current pointer, so that the redemption code can be reclaimed; before the verification, the issued amount of the redemption code is automatically increased, so that the redemption code can be occupied in advance, In order to prevent concurrent requests, the final issuance of the redemption code is more than the total inventory; when the redemption code in the storage queue is empty, it can automatically switch to the next storage queue through the pointer; store the redemption code in multiple Redis database. In the storage queue, the normal collection of redemption codes is guaranteed in high concurrency scenarios, with high efficiency and good stability.

Further effects of the above non-conventional alternatives will be described below in conjunction with specific embodiments.

Description of drawings

The accompanying drawings are used for better understanding of the present invention and do not constitute an improper limitation of the present invention. in:

1 is a schematic diagram of the main steps of a method for collecting a redemption code according to an embodiment of the present invention;

FIG. 2 is a schematic flowchart of a main flow of a method for receiving a redemption code according to an embodiment of the present invention;

3 is a schematic diagram of the main modules of a redemption code claiming device according to an embodiment of the present invention;

4 is an exemplary system architecture diagram to which an embodiment of the present invention may be applied;

FIG. 5 is a schematic structural diagram of a computer apparatus suitable for implementing the electronic device according to the embodiment of the present invention.

Detailed ways

Exemplary embodiments of the present invention are described below with reference to the accompanying drawings, which include various details of the embodiments of the present invention to facilitate understanding and should be considered as exemplary only. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the invention. Also, descriptions of well-known functions and constructions are omitted from the following description for clarity and conciseness.

FIG. 1 is a schematic diagram of main steps of a method for collecting a redemption code according to an embodiment of the present invention. As shown in FIG. 1 , the method for receiving a redemption code according to an embodiment of the present invention mainly includes the following steps:

Step S101: Verify the issued amount according to the issued amount of the redemption code and the total inventory. Compare the issued amount of the redemption code with the total inventory. If the issued amount is less than or equal to the total inventory, the verification has passed; if the issued amount is greater than the total inventory, the verification has failed. In the real-time example, in order to prevent concurrent requests, the final issued amount of the redemption code is more than the total inventory, the issued amount of the redemption code is automatically incremented by 1 in advance. If the issued amount after the automatic increase is less than or equal to the total inventory, Indicates that the verification has passed; if the issued amount after the self-increment is greater than the total inventory, it indicates that the verification has not passed, and the issued amount of the redemption code is automatically decremented by 1.

Step S102: When the verification is passed, the pointer of the redemption code is obtained, and the corresponding storage queue for storing the redemption code is found through the current pointer. The pointer is the sequence number (list_count) of the storage queue. The database where the storage queue is located is a K-V (Key-Value, key-value pair) database, such as Redis database and Memcached database. Redis is a high-performance Key-Value storage system, which supports stored Value types including String (string), List (linked list), Set (collection) and Zset (ordered collection); Memcached is a high-performance distributed In-memory object caching system for dynamic web applications to reduce database load. If the redemption codes are stored in multiple storage queues, the pointers obtained in this step are the serial numbers of the multiple storage queues, the initial value of the current pointer is the smallest serial number, and the pointer is incremented by 1 for each subsequent search. For example, if the current pointer is 2, the found storage queue is list_2.

Step S103: Use a pop command to obtain a redemption code from the storage queue, so as to return the redemption code when the obtained redemption code is not empty. In the embodiment, the redemption code is obtained from the storage queue by using the LPOP command of the Redis database. The LPOP command is used to dequeue an element from the left of the store queue. After obtaining the redemption code, determine whether the obtained redemption code is empty. If it is empty and the current pointer is less than the number of the storage queue, the next pointer is used as the current pointer; if it is not empty, the The redemption code is returned to the user.

FIG. 2 is a schematic flowchart of a main flow of a method for collecting a redemption code according to an embodiment of the present invention. As shown in FIG. 2 , the method for receiving a redemption code according to an embodiment of the present invention mainly includes the following steps:

Step S201: Store the redemption codes in at least one of the storage queues according to the total quantity of redemption codes and the storage quantity of the storage queues. Wherein, the total number of redemption codes is the number of redemption codes uploaded by the merchant to the Redis database; the storage quantity of the storage queue is the maximum number of redemption codes that the storage queue can store. In an embodiment, the storage queue is stored in a Redis database. In this step, the number of storage queues needs to be calculated first. The calculation formula is:

为向上取整。In the formula,

to round up.

Each storage queue can be distinguished by the activity ID of the list_count_redemption code issuance activity, such as list_2_1902.

For example, the activity identification (ID) of a redemption code issuance activity is 1902, the total number of redemption codes uploaded by the merchant to the database is 103, and the storage quantity of each storage queue is 10, then the activity ID is the redemption code of 1902 required for distribution

Step S202: Receive a redemption code acquisition request, and automatically increase the issued amount of the redemption code. The user sends a redemption code acquisition request to the server through the client, and the redemption code acquisition request includes the activity ID. After receiving the redemption code acquisition request, the server parses it, and then automatically increments the issued amount of redemption codes belonging to the activity ID by 1. Each time a redemption code acquisition request is received, the issued amount of the redemption code is automatically increased by 1, so that a redemption code can be pre-occupied to prevent the final issued amount of the redemption code than the total inventory when concurrent requests are made.

Step S203: Determine whether the issued amount after the self-increase is greater than the total inventory, and if the issued amount after the self-increase is greater than the total inventory, execute step S204; if the issued amount after the self-increase is less than or equal to For the total inventory, step S205 is executed. Among them, the total inventory refers to the total number of redemption codes expected to be issued in this redemption code issuance activity.

Step S204: Decrease the issued amount of the redemption code, and execute Step S214. In the embodiment, the issued amount of the redemption code is decremented by 1. If the self-increased distribution amount is greater than the total inventory, it means that all the redemption codes have been received, and the user cannot receive the redemption codes. Since the issued amount of the redemption codes has been increased by 1 in step S202 in advance, it is necessary to Decrease 1 again to match the actual amount of redemption codes issued.

Step S205: Obtain the pointer of the redemption code, and find a corresponding storage queue for storing the redemption code through the current pointer. The pointer is list_count, which is stored in the Redis database. For example, if the obtained pointers are 2, 3, and 4, the current pointer is 2, and the storage queue list_2 corresponding to pointer 2 is searched.

Step S206: Obtain the redemption code from the storage queue by using a pop command. In the embodiment, the LPOP command is used to obtain the redemption code from the storage queue. This command is atomic and thread-safe, that is, only one thread is allowed to obtain the redemption code at the same time, and other threads wait in line to prevent multiple threads from obtaining the same code at the same time. redemption code. In addition, using this command has high query efficiency, and the redemption code can be deleted from the storage queue at the same time as it is acquired, which can effectively prevent the concurrent acquisition of duplicate redemption codes.

Step S207: Determine whether the obtained redemption code is empty, if it is empty, go to step S208; if it is not empty, go to step S210.

Step S208: determine whether the current pointer is less than the number of the storage queues, if the current pointer is less than the number of the storage queues, then perform step S209; if the current pointer is greater than or equal to the number of the storage queues, perform step S209 S214. If the current pointer is greater than or equal to the number of storage queues, it means that all redemption codes have been received.

Step S209: take the next pointer as the current pointer, find a corresponding storage queue for storing the redemption code through the current pointer, and execute step S206. Assuming that the current pointer is 2, the current pointer is incremented by 1, that is, the storage queue corresponding to the search pointer 3 is list_3.

Step S210: Return the redemption code. The server returns the obtained redemption code to the client.

Step S211: Determine whether the redemption code is returned successfully, if the return is successful, go to step S212; if the return fails, go to step S213.

Step S212: Update the receiving status of the redemption code. If the redemption code is successfully returned to the client, it means that the redemption code has been received successfully, and the redemption code redemption status will be updated to "Received Successfully". This step is executed asynchronously, which greatly reduces time-consuming and relieves database pressure.

Step S213: Push the redemption code to the storage queue corresponding to the current pointer by using a push command. In the embodiment, the redemption code is obtained from the storage queue using the RPUSH command. The RPUSH command is an operation command of the Redis database, which is used to enqueue an element or multiple elements from the right side of the storage queue. Using the RPUSH command, the redemption code can be put back into the unclaimed storage queue, so that it can be reclaimed after receiving the redemption code acquisition request.

Step S214: Return to the prompt information, and end the process. In the embodiment, the prompt information of "sold out" may be returned to the client.

In a preferred embodiment, multiple storage queues can be distributed to different Redis nodes to ensure load balance between each node and relieve the pressure on the Redis database.

It can be seen from the method for receiving a redemption code of the embodiment of the present invention that the storage queue is located by a pointer, and the redemption code is obtained from the storage queue by using a pop command, which can effectively prevent the same redemption code from being repeatedly received when concurrently acquiring the redemption code; Re-push the failed redemption code to the storage queue corresponding to the current pointer through the push command, so that the redemption code can be reclaimed; before the verification, the issued amount of the redemption code is automatically increased, so that the redemption code can be pre-occupied , to prevent the final issuance of the redemption code is more than the total inventory during concurrent requests; when the redemption code in the storage queue is empty, it can automatically switch to the next storage queue through the pointer; store the redemption code in the Redis database. In a storage queue, the normal collection of redemption codes is guaranteed in high concurrency scenarios, with high efficiency and good stability.

FIG. 3 is a schematic diagram of main modules of a redemption code claiming apparatus according to an embodiment of the present invention. As shown in FIG. 3 , the redemption code receiving device 300 according to the embodiment of the present invention mainly includes:

The verification module 301 is configured to verify the issued amount according to the issued amount of the redemption code and the total inventory amount. Compare the issued amount of the redemption code with the total inventory. If the issued amount is less than or equal to the total inventory, the verification has passed; if the issued amount is greater than the total inventory, the verification has failed. In the real-time example, in order to prevent concurrent requests, the final issued amount of the redemption code is more than the total inventory, the issued amount of the redemption code is automatically incremented by 1 in advance. If the issued amount after the automatic increase is less than or equal to the total inventory, Indicates that the verification has passed; if the issued amount after the self-increment is greater than the total inventory, it indicates that the verification has not passed, and the issued amount of the redemption code is automatically decremented by 1.

The search module 302 is configured to obtain the pointer of the redemption code when the verification is passed, and find the corresponding storage queue for storing the redemption code through the current pointer. The pointer is the sequence number (list_count) of the storage queue. The database where the storage queue is located is a K-V database, such as Redis database and Memcached database. If the redemption codes are stored in multiple storage queues, the pointers obtained in this step are the serial numbers of the multiple storage queues, the initial value of the current pointer is the smallest serial number, and the pointer is incremented by 1 for each subsequent search. For example, if the current pointer is 2, the found storage queue is list_2.

Returning module 303, configured to acquire the redemption code from the storage queue by using a pop command, so as to return the redemption code when the acquired redemption code is not empty. In the embodiment, the redemption code is obtained from the storage queue by using the LPOP command of the Redis database. The LPOP command is used to dequeue an element from the left of the store queue. After obtaining the redemption code, determine whether the obtained redemption code is empty. If it is empty and the current pointer is less than the number of the storage queue, the next pointer is used as the current pointer; if it is not empty, the The redemption code is returned to the user.

In addition, the apparatus 300 for redeeming codes according to the embodiment of the present invention may further include: an update push module, a pointer update module, an auto-increment module, and a storage module (not shown in FIG. 3 ). Wherein, the update push module is configured to update the receiving status of the redemption code if the redemption code returns successfully; and if the redemption code fails to return, push the redemption code to the current The pointer corresponds to the storage queue. The pointer updating module is configured to use the next pointer as the current pointer if the acquired redemption code is empty and the current pointer is smaller than the number of the storage queue. The self-increasing module is used for self-increasing the issued amount of the redemption code. The storage module is configured to store the redemption codes in at least one of the storage queues of the Redis database according to the total quantity of the redemption codes and the storage quantity of the storage queues.

As can be seen from the above description, positioning the storage queue through the pointer and using the pop command to obtain the redemption code from the storage queue can effectively prevent the same redemption code from being repeatedly obtained when the redemption code is obtained concurrently; The redemption code is re-pushed to the storage queue corresponding to the current pointer, so that the redemption code can be reclaimed; before the verification, the issued amount of the redemption code is automatically increased, and the redemption code can be occupied in advance to prevent the redemption code during concurrent requests. The final distribution of the code is more than the total inventory; when the redemption code in the storage queue is empty, it can automatically switch to the next storage queue through the pointer; store the redemption code in multiple storage queues in the Redis database, in high concurrency In the scenario, the normal collection of the redemption code is guaranteed, with high efficiency and good stability.

FIG. 4 shows an exemplary system architecture 400 of a method for collecting a redemption code or an apparatus for collecting a redemption code to which an embodiment of the present invention can be applied.

As shown in FIG. 4 , the system architecture 400 may include terminal devices 401 , 402 , and 403 , a network 404 and a server 405 . The network 404 is a medium used to provide a communication link between the terminal devices 401 , 402 , 403 and the server 405 . The network 404 may include various connection types, such as wired, wireless communication links, or fiber optic cables, among others.

The user can use the terminal devices 401, 402, 403 to interact with the server 405 through the network 404 to receive or send messages and the like. Various communication client applications may be installed on the terminal devices 401 , 402 and 403 , such as shopping applications, web browser applications, search applications, instant messaging tools, email clients, social platform software, and the like.

The terminal devices 401, 402, 403 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, laptop computers, desktop computers, and the like.

The server 405 may be a server that provides various services, for example, a background management server that provides support for obtaining requests for redemption codes sent by users using the terminal devices 401 , 402 , and 403 . The background management server can analyze and process the received redemption code acquisition request, and feed back the processing result (for example, the redemption code) to the terminal device.

It should be noted that the method for collecting the redemption code provided by the embodiment of the present application is generally performed by the server 405 , and accordingly, the device for collecting the redemption code is generally set in the server 405 .

It should be understood that the numbers of terminal devices, networks and servers in FIG. 4 are merely illustrative. There can be any number of terminal devices, networks and servers according to implementation needs.

According to an embodiment of the present invention, the present invention further provides an electronic device and a computer-readable medium.

The electronic device of the present invention comprises: one or more processors; storage means for storing one or more programs, when the one or more programs are executed by the one or more processors, so that the one or more programs A plurality of processors implement a method for receiving a redemption code according to an embodiment of the present invention.

The computer-readable medium of the present invention has a computer program stored thereon, and when the program is executed by the processor, a method for obtaining a redemption code according to an embodiment of the present invention is implemented.

Referring to FIG. 5 below, it shows a schematic structural diagram of a computer system 500 suitable for implementing an electronic device according to an embodiment of the present invention. The electronic device shown in FIG. 5 is only an example, and should not impose any limitation on the function and scope of use of the embodiments of the present invention.

As shown in FIG. 5, a computer system 500 includes a central processing unit (CPU) 501 which can be loaded into a random access memory (RAM) 503 according to a program stored in a read only memory (ROM) 502 or a program from a storage section 508 Instead, various appropriate actions and processes are performed. In the RAM 503, various programs and data necessary for the operation of the computer system 500 are also stored. The CPU 501 , the ROM 502 , and the RAM 503 are connected to each other through a bus 504 . An input/output (I/O) interface 505 is also connected to bus 504 .

The following components are connected to the I/O interface 505: an input section 506 including a keyboard, a mouse, etc.; an output section 507 including a cathode ray tube (CRT), a liquid crystal display (LCD), etc., and a speaker, etc.; a storage section 508 including a hard disk, etc. ; and a communication section 509 including a network interface card such as a LAN card, a modem, and the like. The communication section 509 performs communication processing via a network such as the Internet. A drive 510 is also connected to the I/O interface 505 as needed. A removable medium 511, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, etc., is mounted on the drive 510 as needed so that a computer program read therefrom is installed into the storage section 508 as needed.

In particular, according to the disclosed embodiments of the present invention, the processes described in the main step diagrams above may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program carried on a computer-readable medium, the computer program containing program code for performing the methods illustrated in the main step diagrams. In such an embodiment, the computer program may be downloaded and installed from the network via the communication portion 509 and/or installed from the removable medium 511 . When the computer program is executed by the central processing unit (CPU) 501, the above-described functions defined in the system of the present invention are performed.

It should be noted that the computer-readable medium shown in the present invention may be a computer-readable signal medium or a computer-readable storage medium, or any combination of the above two. The computer-readable storage medium can be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus or device, or a combination of any of the above. More specific examples of computer readable storage media may include, but are not limited to, electrical connections with one or more wires, portable computer disks, hard disks, random access memory (RAM), read only memory (ROM), erasable Programmable read only memory (EPROM or flash memory), fiber optics, portable compact disk read only memory (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination of the foregoing. In the present invention, a computer-readable storage medium may be any tangible medium that contains or stores a program that can be used by or in conjunction with an instruction execution system, apparatus, or device. In the present invention, however, a computer-readable signal medium may include a data signal propagated in baseband or as part of a carrier wave, carrying computer-readable program code therein. Such propagated data signals may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the foregoing. A computer-readable signal medium can also be any computer-readable medium other than a computer-readable storage medium that can transmit, propagate, or transport the program for use by or in connection with the instruction execution system, apparatus, or device . Program code embodied on a computer readable medium may be transmitted using any suitable medium including, but not limited to, wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.

The flowchart 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 invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code that contains one or more logical functions for implementing the specified functions executable instructions. It should also be noted that, in some alternative implementations, the functions noted in the blocks 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 is also noted that each block of the block diagrams or flowchart illustrations, and combinations of blocks in the block diagrams or flowchart illustrations, can be implemented in special purpose hardware-based systems that perform the specified functions or operations, or can be implemented using A combination of dedicated hardware and computer instructions is implemented.

The modules involved in the embodiments of the present invention may be implemented in a software manner, and may also be implemented in a hardware manner. The described module can also be set in the processor, for example, it can be described as: a processor includes a check module, a search module and a return module. Among them, the names of these modules do not constitute a limitation of the module itself under certain circumstances. For example, the verification module can also be described as "according to the issued amount of the redemption code and the total inventory, the issued amount is verified. test module".

As another aspect, the present invention also provides a computer-readable medium, which may be included in the device described in the above embodiments; or may exist alone without being assembled into the device. The above-mentioned computer-readable medium carries one or more programs, and when the above-mentioned one or more programs are executed by one of the equipment, the equipment includes: according to the issued amount and the total inventory amount of the redemption code, correcting the issued amount. When the verification is passed, the pointer of the redemption code is obtained, and the corresponding storage queue for storing the redemption code is found through the current pointer; the redemption code is obtained from the storage queue by using a pop command, to When the obtained redemption code is not empty, the redemption code is returned.

As can be seen from the above description, positioning the storage queue through the pointer and using the pop command to obtain the redemption code from the storage queue can effectively prevent the same redemption code from being repeatedly obtained when the redemption code is obtained concurrently; The redemption code is re-pushed to the storage queue corresponding to the current pointer, so that the redemption code can be reclaimed; before the verification, the issued amount of the redemption code is automatically increased, and the redemption code can be occupied in advance to prevent the redemption code during concurrent requests. The final distribution of the code is more than the total inventory; when the redemption code in the storage queue is empty, it can automatically switch to the next storage queue through the pointer; store the redemption code in multiple storage queues in the Redis database, in high concurrency In the scenario, the normal collection of the redemption code is guaranteed, with high efficiency and good stability.

The above product can execute the method provided by the embodiment of the present invention, and has corresponding functional modules and beneficial effects for executing the method. For technical details not described in detail in this embodiment, reference may be made to the method provided by the embodiment of the present invention.

The above-mentioned specific embodiments do not constitute a limitation on the protection scope of the present invention. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions may occur depending on design requirements and other factors. Any modifications, equivalent replacements and improvements made within the spirit and principle of the present invention shall be included within the protection scope of the present invention.

Claims (12)

1, A method for obtaining a redemption code, comprising:

checking the issuing amount according to the issuing amount and the total stock of the exchange code;

when the verification is passed, acquiring a pointer of the exchange code, and searching a corresponding storage queue for storing the exchange code through the current pointer;

and acquiring the redemption code from the storage queue by adopting a pop command, and returning the redemption code when the acquired redemption code is not empty.

2. The method of claim 1, further comprising:

if the exchange code returns success, updating the getting state of the exchange code;

and if the exchange code return fails, pushing the exchange code to a storage queue corresponding to the current pointer by adopting a push command.

3. The method of claim 1, wherein the step of obtaining the pointer to the redemption code is followed by:

and if the obtained redemption code is empty and the current pointer is less than the number of the storage queues, taking the lower pointer as the current pointer.

4. The method of claim 1, wherein the step of verifying the delivery amount is preceded by the step of: self-increment the issuing amount of the exchange code;

the checking the issuing amount according to the issuing amount and the total inventory amount of the redemption code comprises the following steps:

and comparing the self-increased release amount with the total inventory amount, and judging whether the verification passes according to the comparison result.

5. The method of any of claims 1-4, further comprising:

storing the redemption codes into at least of the storage queues of a Redis database based on the total number of redemption codes and the stored number of the storage queues.

The device for getting the exchange codes of kinds is characterized by comprising:

the verification module is used for verifying the issuing amount according to the issuing amount and the total inventory of the exchange code;

the searching module is used for acquiring the pointer of the exchange code when the verification is passed, and searching the corresponding storage queue for storing the exchange code through the current pointer;

and the return module is used for acquiring the exchange code from the storage queue by adopting a pop command, and returning the exchange code when the acquired exchange code is not empty.

7. The apparatus of claim 6, further comprising: update push module for

If the exchange code returns success, updating the getting state of the exchange code; and

and if the exchange code return fails, pushing the exchange code to a storage queue corresponding to the current pointer by adopting a push command.

8. The apparatus of claim 6, further comprising: pointer update module for

And if the obtained redemption code is empty and the current pointer is less than the number of the storage queues, taking the lower pointer as the current pointer.

9. The apparatus of claim 6, further comprising: the self-increment module is used for self-incrementing the issuing amount of the exchange code;

the verification module is further configured to:

and comparing the self-increased release amount with the total inventory amount, and judging whether the verification passes according to the comparison result.

10. The apparatus according to any of the preceding claims 6 to 9, wherein the apparatus further comprises a storage module for storing the data according to any of the preceding claims

Storing the redemption codes into at least of the storage queues of a Redis database based on the total number of redemption codes and the stored number of the storage queues.

An electronic device of the kind 11, , comprising:

or more processors;

a storage device for storing or more programs,

when the or more programs are executed by the or more processors, cause the or more processors to implement the method of any of claims 1-5.

12, computer readable medium, having stored thereon a computer program, characterized in that the program, when being executed by a processor, carries out the method according to any of claims 1-5 .

Images