CN113709258A - Praise anti-replay method, equipment and storage medium - Google Patents
Praise anti-replay method, equipment and storage medium Download PDFInfo
- Publication number
- CN113709258A CN113709258A CN202111251569.1A CN202111251569A CN113709258A CN 113709258 A CN113709258 A CN 113709258A CN 202111251569 A CN202111251569 A CN 202111251569A CN 113709258 A CN113709258 A CN 113709258A
- Authority
- CN
- China
- Prior art keywords
- praise
- button
- time
- user
- acquiring
- 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.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/535—Tracking the activity of the user
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L51/00—User-to-user messaging in packet-switching networks, transmitted according to store-and-forward or real-time protocols, e.g. e-mail
- H04L51/52—User-to-user messaging in packet-switching networks, transmitted according to store-and-forward or real-time protocols, e.g. e-mail for supporting social networking services
Abstract
The invention discloses a praise anti-replay method, which comprises the following steps: acquiring a praise button corresponding to the first click of a user; disabling the current thumbs-up button; judging whether the praise button is praise currently or not; if yes, the praise operation is not valid; and if not, enabling the approval button. The praise re-approval preventing method, the praise re-approval preventing equipment and the storage medium can avoid the problem that the praise operation needs to be carried out again due to the fact that the same content or information is praised for many times caused by network delay or user operation reasons and the like.
Description
Technical Field
The present invention relates to the field of internet information technologies, and in particular, to a method, an apparatus, and a storage medium for praise duplicate prevention.
Background
With the popularization of 5G networks and the popularization of intelligent terminals, the application of various social platforms and interactive platforms is also rapidly developed. In a common social and interactive platform, audio and video content and text information have a praise function, that is, if a user feels that a certain audio and video or a certain section of text has enjoyment or joy, the user can praise the corresponding audio and video or text.
Praise is operated by clicking on corresponding function icons, which are generally in the shape of a palm or a fist, and clicking on the icon by the user indicates praise, the icon changes to another form, for example, changes from a blank inside to being filled with other colors, or raises a thumb, etc., thereby indicating praise. Usually, clicking once is normally like to click, and clicking once again becomes like to cancel.
However, in an actual application scenario, due to network delay or user operation reasons, the same content or information is praised for many times, and because even praise probabilities exist in the multi-praise probabilities, praise is cancelled, and praise operation needs to be performed again.
Therefore, it is an urgent need to solve the problems of the art to design a control method, device and storage medium for preventing duplicate approval.
Disclosure of Invention
The technical problem to be solved by the present invention is to provide a praise-proof method, device and storage medium, so as to avoid the problem that a plurality of praise operations are required to be performed on the same content or information due to network delay or user operation reasons.
In order to achieve the purpose, the technical scheme of the invention is as follows:
a praise anti-replay method comprises the following steps:
acquiring a praise button corresponding to the first click of a user;
disabling the current thumbs-up button;
judging whether the praise button is praise currently or not;
if yes, the praise operation is not valid;
and if not, enabling the approval button.
Through the technical scheme, the praise button corresponding to the first click of the user is obtained, and the current praise button is forbidden; then judging whether the praise button is praise currently or not; if yes, the praise operation is not valid; if not, the approval button is started, so that the problem that the approval operation needs to be carried out again due to the fact that the approval of the same content or information is carried out for many times caused by network delay or user operation reasons and the like is avoided.
Preferably, after the disabling of the current thumbs-up button, the method further includes: recording the first click time of the current user on the like button;
if yes, the method specifically comprises the following steps:
if yes, acquiring the current click time of the forbidden approval button;
calculating a time difference between the current click time and the first click time;
if the time difference is smaller than or equal to a preset threshold value, the praise operation is invalid;
and if the time difference is larger than the preset threshold value, enabling the like button.
Through the technical scheme, whether the approval button is clicked for the first time and whether the approval button is clicked for the time is overtime can be effectively judged, the approval error or the approval cancellation caused by delay is avoided, and the misoperation of the approval button caused by other clicks after the overlong waiting time of the user is avoided.
Further, if the time difference is greater than the preset threshold, activating the like button specifically includes:
if the time difference is larger than the preset threshold, acquiring the button ID of the approval button and the user ID of the current user;
judging whether the button ID and the user ID are in a time-limited set;
if so, invalidating the praise operation;
if the set data does not exist, storing the set data into the time-limited set, and starting the praise button;
wherein the aggregated data comprises the button ID, the user ID, and a corresponding operation timestamp.
By the technical scheme, whether the approval operation is delayed operation or misoperation of the same user can be effectively judged. If the operation exists in the time-limited set, the delay operation or the misoperation of the same user is indicated, and the praise needs to be invalidated; if the operation result does not exist, the result shows that the operation is the normal praise of a new user or the praise user is not operated between the new user and the praise, the current praise button is started to operate, the praise is effective at the time, and therefore whether the praise operation is effective or not is judged according to the combination of the praise times of different users.
Further, the method also comprises the following steps:
time-counting the time-limited set;
acquiring the expired set data in the time-limited set according to a preset time rule;
deleting the expired collection data.
By the technical scheme, the data in the time-limited set can be timed according to the preset time rule, the expired data is cleared from the set, the expired set data in the time-limited set is cleared, and the problem that the expired set data occupies the time-limited set is avoided.
Further, the acquiring, according to a preset time rule, the expired data in the time-limited set specifically includes:
and acquiring the expired data in the time-limited set regularly according to a preset time period.
Preferably, after the enabling of the like button if the time difference is greater than the preset threshold, the method further includes:
and deleting the corresponding set data according to the button ID of the praise button.
By the technical scheme, the set data of the button ID corresponding to the invalid praise can be effectively cleared, and the space or capacity occupied by useless data is reduced.
Preferably, after the enabling of the like button if the like button is not like, the method further includes:
taking the user ID and the like function ID as keys, and acquiring key values from key value repulsion distributed sets;
if the key value is not obtained, storing the key into the key value repellent distributed set;
and if the key value is acquired, invalidating the praise operation.
By the technical scheme, the user ID and the like are combined effectively by means of the key value state of the keys in the key value repulsion distributed set, the same client is prevented from operating the like function again in the corresponding time at the back end, and the repeated like function is placed.
Further, the key value repulsion distributed set is implemented as follows:
when the key enters the key value repulsion distributed set, acquiring the corresponding distributed lock through the key value;
if the corresponding distributed lock is obtained, judging whether the key exists in the key value repellent distributed set or not;
if the operation does not exist, judging that the storage of the praise operation is successful;
and if so, judging that the storage of the operation of agreeing is failed.
The invention also provides praise anti-reset equipment, which comprises the following steps:
a memory for storing a computer program;
a processor configured to implement the steps of the praise anti-replay method according to any one of the above when the computer program is executed.
The invention also provides a computer readable storage medium having stored thereon a computer program which, when executed by a processor, carries out the steps of the praise anti-replay method according to any one of the preceding claims.
The praise anti-replay method provided by the invention comprises the steps of acquiring a praise button corresponding to the first click of a user, and forbidding a current praise button; then judging whether the praise button is praise currently or not; if yes, the praise operation is not valid; if not, the approval button is started, so that the problem that the approval operation needs to be carried out again due to the fact that the approval of the same content or information is carried out for many times caused by network delay or user operation reasons and the like is avoided. The praise anti-duplication equipment and the computer storage medium provided by the application also solve the corresponding technical problems.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the provided drawings without creative efforts.
Fig. 1 is a schematic flow chart of one implementation of the praise duplicate prevention method in the embodiment of the present invention;
fig. 2 is a schematic flow chart of one implementation of the praise duplicate prevention method in the embodiment of the present invention;
fig. 3 is a schematic flow chart of one implementation of the praise duplicate prevention method in the embodiment of the present invention;
fig. 4 is a schematic flow chart illustrating one implementation of the approval/denial protection method in an embodiment of the present invention;
fig. 5 is a schematic flowchart illustrating a process of implementing a key-value repulsion distributed set in the praise duplicate prevention method according to an embodiment of the present invention.
Detailed Description
In order to make those skilled in the art better understand the technical solutions in the present application, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments.
All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
The praise anti-replay method provided by the embodiment, as shown in fig. 1, includes the following steps:
s101, acquiring a praise button corresponding to the first click of a user;
s102, disabling a current praise button;
s103, judging whether the praise button is praise currently or not;
s104, if yes, invalidating praise operation;
and S105, if not, enabling an approval button.
In practical applications, steps S101 to S105 are performed in the pre-praise override module. The specific process is as follows: and when the user uses the praise function, starting a pre-praise anti-repetition algorithm. Specifically, when the user clicks the like button for the first time, the disabling operation is performed on the current like button, so that the subsequent like button is avoided or the like is delayed to trigger the like button. Then judging whether the current praise button is praise or not, and if praise is praise, invalidating praise operation; if not, the approval button is started to take effect for approval operation.
The praise anti-replay method provided by the invention comprises the steps of acquiring a praise button corresponding to the first click of a user, and forbidding a current praise button; then judging whether the praise button is praise currently or not; if yes, the praise operation is not valid; if not, the approval button is started, so that the problem that the approval operation needs to be carried out again due to the fact that the approval of the same content or information is carried out for many times caused by network delay or user operation reasons and the like is avoided.
In one implementation manner of this embodiment, as shown in fig. 2, after the step S102, disabling the current thumbs-up button, the method further includes:
s106, recording the first click time of the current user for clicking the like button;
if yes, the step S105 is to activate the ok button, which includes the following steps:
s201, if yes, acquiring the current click time of the forbidden approval button;
s202, calculating a time difference value between the current click time and the first click time;
s203, if the time difference is smaller than or equal to a preset threshold value, the praise operation is invalid;
s204, if the time difference is larger than a preset threshold value, enabling a like button.
In the actual application, judging whether the current praise button is praise or not, if the current praise button is not praise, carrying out time limit increasing judgment on the current button, recording the first click time of the current praise button of the current user, namely subtracting the first click time from the current click time, and if the current praise button is less than or equal to a preset threshold value, for example, 500ms, judging that the praise is invalid; if the time is greater than the preset threshold value, for example, 500ms, the approval button is enabled, and approval operation is performed.
Through the technical scheme, whether the approval button is clicked for the first time and whether the approval button is clicked for the time is overtime can be effectively judged, the approval error or the approval cancellation caused by delay is avoided, and the misoperation of the approval button caused by other clicks after the overlong waiting time of the user is avoided.
In one implementation manner of this embodiment, as shown in fig. 3, in step S204, if the time difference is greater than the preset threshold, the enabling of the ok button specifically includes:
s301, if the time difference is larger than a preset threshold value, acquiring a button ID of a praise button and a user ID of a current user;
s302, judging whether the button ID and the user ID are in a time-limited set or not;
s303, if the operation exists, the praise operation is invalid;
s304, if the set data do not exist, storing the set data into a time-limited set, and starting a praise button;
wherein the aggregated data comprises a button ID, a user ID, and a corresponding operation timestamp.
In an actual operation, for example, the above-mentioned preset threshold value is used for 500ms, and if the value is greater than 500ms, the current approval button ID and the current user ID are determined, and whether both are in the time-limited set is determined. If the current time limit exists in the time limit set, the approval is invalid; if the current praise button does not exist, storing the set data specifically including the button ID, the user ID and the corresponding operation timestamp into the time-limited set, and enabling the current praise button to be effective.
By the technical scheme, whether the approval operation is delayed operation or misoperation of the same user can be effectively judged. If the operation exists in the time-limited set, the delay operation or the misoperation of the same user is indicated, and the praise needs to be invalidated; if the operation result does not exist, the result shows that the operation is the normal praise of a new user or the praise user is not operated between the new user and the praise, the current praise button is started to operate, the praise is effective at the time, and therefore whether the praise operation is effective or not is judged according to the combination of the praise times of different users.
In one implementation manner of this embodiment, as shown in fig. 3, the method further includes the following steps:
s401, time timing is carried out on the time limit set;
s402, acquiring expired set data in a time-limited set according to a preset time rule;
and S403, deleting the expired aggregated data.
In actual application, the data storage in the time-limited set is time-counted, and the time-limited set can be cleared when the data is expired.
By the technical scheme, the data in the time-limited set can be timed according to the preset time rule, the expired data is cleared from the set, the expired set data in the time-limited set is cleared, the problem that the expired data occupies the time-limited set is avoided, and the user experience is further improved.
In one implementation manner of this embodiment, according to a preset time rule, acquiring the expired data in the time-limited set specifically includes:
and acquiring the expired data in the time-limited set regularly according to a preset time period.
In this embodiment, a daemon thread is started, and polling check is performed on the time-limited set every a preset time period, for example, 10 minutes, so as to obtain the expired data in the time-limited set. The specific duration of the time period may be selected according to actual needs, or the time when the rule of the time period becomes effective may be set, that is, the time period is deactivated after the deleted expired data reaches a certain number, and the time period is opened again when the number in the waiting time limit set reaches the critical point to be cleaned, so as to acquire the expired data.
In one implementation manner of this embodiment, in step S204, if the time difference is greater than the preset threshold, after the enabling of the ok button, the method further includes:
according to the button ID of the thumbbutton, the corresponding set data is deleted.
By the technical scheme, the set data of the button ID corresponding to the invalid praise can be effectively cleared, and the space or capacity occupied by useless data is reduced.
In one implementation manner of this embodiment, as shown in fig. 4, in step S105, if the user does not like to approve, the method further includes, after the enabling of the approve button:
s501, taking the user ID and the like function ID as keys, and acquiring key values from key value repulsion distributed sets;
s502, if the key value is not obtained, storing the key into a key value repulsion distributed set;
and S503, if the key value is acquired, the praise operation is invalid.
In this embodiment, the steps S501 to S503 are implemented by a praise duplicate prevention module.
In actual use, when the backend service receives user approval data, the key value can be acquired from the key value repulsion distributed set, and it indicates that the user ID corresponds to the approval function ID, that is, the user has operated the approval function within the corresponding time, and therefore the approval operation needs to be invalidated; and if the key value cannot be acquired, it indicates that the user ID does not correspond to the like function ID, that is, the user does not operate the like function within the corresponding time, and the corresponding key needs to be stored in the key value repulsion distributed set for corresponding recording.
By the technical scheme, the user ID and the like are combined effectively by means of the key value state of the keys in the key value repulsion distributed set, the same client is prevented from operating the like function again in the corresponding time at the back end, and the repeated like function is placed.
In one implementation of this embodiment, as shown in fig. 5, key value repulsion distributed sets are implemented as follows:
s601, when a key enters a key value repulsion distributed set, acquiring a distributed lock corresponding to the key value repulsion distributed set through the key value;
s602, if the corresponding distributed lock is obtained, judging whether a key exists in the key value repellent distributed set or not;
s603, if the operation does not exist, judging that the praise operation storage is successful;
s604, if yes, determining that the operation storage fails.
In practical application, a key generally has a corresponding distributed lock, and when the key and the corresponding distributed lock exist relatively, that is, if the key is written in a key-value-repulsion distributed set, the corresponding distributed lock is acquired, and then the distributed lock acquired by the key value can be used for determining whether the corresponding key exists, and then whether the storage success of the corresponding operation is approved or not can be known according to the corresponding result, and the specific determination process is not described herein again.
It should be noted that, the specific steps of the multiple embodiments of the present embodiment are described for more effectively explaining the respective corresponding technical solutions, but the descriptions do not represent that the respective technical solutions exist independently, the multiple embodiments may have substitutions or intersections between the steps, and other embodiments formed by the substitutions or intersections of the steps still belong to the scope related to the present application or the scope protected by the claims.
The embodiment of the application also provides praise anti-replay equipment and a computer readable storage medium, which have the corresponding effects of the praise anti-replay method provided by the embodiment of the application.
The another praise anti-duplication device provided by the embodiment of the application may further include: the input port is connected with the processor and is used for transmitting an externally input command to the processor; the display unit is connected with the processor and used for displaying the returned result whether the praise is valid or not; and the communication module is connected with the processor and is used for realizing communication between the praise anti-replay equipment and the outside.
The display unit can be a display panel, a laser scanning display and the like; the communication modes adopted by the communication module include, but are not limited to, mobile high definition link technology (HML), Universal Serial Bus (USB), High Definition Multimedia Interface (HDMI), and wireless connection: wireless fidelity technology (WiFi), bluetooth communication technology, bluetooth low energy communication technology, ieee802.11s based communication technology.
Embodiments of the present application relate to computer-readable storage media that include Random Access Memory (RAM), memory, Read Only Memory (ROM), electrically programmable ROM, electrically erasable programmable ROM, registers, hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art.
For a description of a relevant part of the praise anti-duplication device and the computer-readable storage medium provided in the embodiments of the present application, refer to a detailed description of a corresponding part of the praise anti-duplication method provided in the embodiments of the present application, and are not described herein again. In addition, parts of the above technical solutions provided in the embodiments of the present application, which are consistent with the implementation principles of corresponding technical solutions in the prior art, are not described in detail so as to avoid redundant description.
It is further noted that, herein, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.
The principles and embodiments of the present invention are explained herein using specific examples, which are presented only to assist in understanding the method and its core concepts. It should be noted that, for those skilled in the art, it is possible to make various improvements and modifications to the present invention without departing from the principle of the present invention, and those improvements and modifications also fall within the scope of the claims of the present invention.
Claims (9)
1. A praise anti-replay method is characterized by comprising the following steps:
acquiring a praise button corresponding to the first click of a user;
disabling the current thumbs-up button;
judging whether the praise button is praise currently or not;
if yes, the praise operation is not valid;
if yes, starting the praise button;
after the disabling of the current thumbs-up button, the method further comprises: recording the first click time of the current user on the like button;
if yes, the method specifically comprises the following steps:
if yes, acquiring the current click time of the forbidden approval button;
calculating a time difference between the current click time and the first click time;
if the time difference is smaller than or equal to a preset threshold value, the praise operation is invalid;
and if the time difference is larger than the preset threshold value, enabling the like button.
2. The praise-proof method according to claim 1, wherein if the time difference is greater than the preset threshold, the enabling of the praise button is specifically:
if the time difference is larger than the preset threshold, acquiring the button ID of the approval button and the user ID of the current user;
judging whether the button ID and the user ID are in a time-limited set;
if so, invalidating the praise operation;
if the set data does not exist, storing the set data into the time-limited set, and starting the praise button;
wherein the aggregated data comprises the button ID, the user ID, and a corresponding operation timestamp.
3. The praise anti-replay method of claim 2, further comprising the steps of:
time-counting the time-limited set;
acquiring the expired set data in the time-limited set according to a preset time rule;
deleting the expired collection data.
4. The praise anti-replay method according to claim 3, wherein the obtaining of the expired data in the time-limited set according to the preset time rule specifically includes:
and acquiring the expired data in the time-limited set regularly according to a preset time period.
5. The praise-proof method of claim 2, wherein after the enabling of the praise button if the time difference is greater than the preset threshold, further comprising:
and deleting the corresponding set data according to the button ID of the praise button.
6. The praise-proof method of claim 1, wherein after the enabling of the praise button if praise is not praise, further comprising:
taking the user ID and the like function ID as keys, and acquiring key values from key value repulsion distributed sets;
if the key value is not obtained, storing the key into the key value repellent distributed set;
and if the key value is acquired, invalidating the praise operation.
7. The praise anti-duplication method of claim 6, wherein the key-value-repulsion distributed set is implemented as follows:
when the key enters the key value repulsion distributed set, acquiring the corresponding distributed lock through the key value;
if the corresponding distributed lock is obtained, judging whether the key exists in the key value repellent distributed set or not;
if not, judging that the storage is successful;
and if so, judging that the storage fails.
8. A praise anti-duplication device, comprising:
a memory for storing a computer program;
a processor for implementing the steps of the anti-replay method of any of claims 1 to 7 when executing said computer program.
9. A computer-readable storage medium, in which a computer program is stored which, when being executed by a processor, carries out the steps of the praise anti-replay method according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111251569.1A CN113709258B (en) | 2021-10-27 | 2021-10-27 | Praise anti-replay method, equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111251569.1A CN113709258B (en) | 2021-10-27 | 2021-10-27 | Praise anti-replay method, equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113709258A true CN113709258A (en) | 2021-11-26 |
| CN113709258B CN113709258B (en) | 2022-02-11 |
Family
ID=78646979
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111251569.1A Active CN113709258B (en) | 2021-10-27 | 2021-10-27 | Praise anti-replay method, equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113709258B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117435092A (en) * | 2023-12-21 | 2024-01-23 | 荣耀终端有限公司 | Click operation information processing method, electronic device and readable storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101394406A (en) * | 2008-10-22 | 2009-03-25 | 深圳市金蝶中间件有限公司 | Method and apparatus for preventing duplicate button pressing by user |
| WO2009132148A2 (en) * | 2008-04-22 | 2009-10-29 | The 41St Parameter, Inc. | Systems and methods for security management based on cursor events |
| CN103455405A (en) * | 2012-06-04 | 2013-12-18 | 阿里巴巴集团控股有限公司 | Method and system for preventing button from being clicked repeatedly and method and system for unlocking button |
| CN109783333A (en) * | 2018-12-13 | 2019-05-21 | 平安普惠企业管理有限公司 | It repeats to click filter method, device, computer equipment and storage medium |
| CN112306805A (en) * | 2020-10-30 | 2021-02-02 | 平安付科技服务有限公司 | Method and device for preventing repeated clicking, computer equipment and readable storage medium |
-
2021
- 2021-10-27 CN CN202111251569.1A patent/CN113709258B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2009132148A2 (en) * | 2008-04-22 | 2009-10-29 | The 41St Parameter, Inc. | Systems and methods for security management based on cursor events |
| US20110113388A1 (en) * | 2008-04-22 | 2011-05-12 | The 41St Parameter, Inc. | Systems and methods for security management based on cursor events |
| CN101394406A (en) * | 2008-10-22 | 2009-03-25 | 深圳市金蝶中间件有限公司 | Method and apparatus for preventing duplicate button pressing by user |
| CN103455405A (en) * | 2012-06-04 | 2013-12-18 | 阿里巴巴集团控股有限公司 | Method and system for preventing button from being clicked repeatedly and method and system for unlocking button |
| CN109783333A (en) * | 2018-12-13 | 2019-05-21 | 平安普惠企业管理有限公司 | It repeats to click filter method, device, computer equipment and storage medium |
| CN112306805A (en) * | 2020-10-30 | 2021-02-02 | 平安付科技服务有限公司 | Method and device for preventing repeated clicking, computer equipment and readable storage medium |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117435092A (en) * | 2023-12-21 | 2024-01-23 | 荣耀终端有限公司 | Click operation information processing method, electronic device and readable storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113709258B (en) | 2022-02-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP3567476B1 (en) | Application data processing method and apparatus, and storage medium | |
| US20140317544A1 (en) | Method and Terminal for Creating Folder for User Interface | |
| CN107678780B (en) | Memory management method and device, storage medium and terminal equipment | |
| CN104679558B (en) | A kind of switching method between multisystem and terminal | |
| CN103634337B (en) | Page recovery, device and mobile terminal | |
| CN106909855B (en) | File hiding method and device | |
| CN103559455A (en) | Android device personal information protection method based on user identification | |
| EP2492819B1 (en) | Method and apparatus for protecting information based on data card | |
| CN104380769A (en) | Information reminding method, apparatus, and electronic terminal | |
| US20170192646A1 (en) | Method and electronic device for hiding application icons and mobile phone | |
| WO2016201315A1 (en) | Method and apparatus for activating application function | |
| JP2015520897A (en) | How to prevent accidental operation and touch screen terminals | |
| CN113709258B (en) | Praise anti-replay method, equipment and storage medium | |
| CN105893471B (en) | Data processing method and electronic equipment | |
| CN110855833A (en) | Terminal retrieving method and device, terminal and storage medium | |
| CN104954549A (en) | Electronic device and messaging method | |
| CN105117242B (en) | System remapping method and terminal | |
| CN106776908A (en) | Data clearing method, device and terminal | |
| CN110661650B (en) | Log management method and device, electronic equipment and storage medium | |
| US20120197924A1 (en) | Method and Mobile Terminal for Recycling Short Messages | |
| CN103874985A (en) | Method for presenting terminal device, and terminal device | |
| CN104951227A (en) | Electronic device of messaging and method thereof | |
| CN100466827C (en) | New message of short message presenting method | |
| CN105677408A (en) | Application deletion method and device | |
| US20140009380A1 (en) | Electronic apparatus and method of storing activity thereof |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |