CN112015569B

CN112015569B - Message reminding processing method and device

Info

Publication number: CN112015569B
Application number: CN202010802955.4A
Authority: CN
Inventors: 谌尧羿
Original assignee: Alipay Hangzhou Information Technology Co Ltd
Current assignee: Alipay Hangzhou Information Technology Co Ltd
Priority date: 2020-08-11
Filing date: 2020-08-11
Publication date: 2024-01-30
Anticipated expiration: 2040-08-11
Also published as: CN112015569A

Abstract

The embodiment of the specification provides a message reminding processing method and device, wherein the message reminding processing method comprises the following steps: acquiring queue data of a message queue in a message list; judging whether a target message queue meeting a queue merging condition exists in the message queues with the same queue attribute based on the queue data; if yes, merging the target message queue into a merging queue corresponding to each queue attribute; and updating the message list based on the merging queue and displaying the message list.

Description

Message reminding processing method and device

Technical Field

The present document relates to the field of data processing technologies, and in particular, to a message reminding processing method and device.

Background

With the increasing popularity of intelligent terminals, service processing through connection of the intelligent terminals and networks has become a trend, based on this trend, application developers provide corresponding services for users by providing more and more applications, while users often receive various message notifications pushed by application providers in the process of using the applications, and as the variety of applications is rich, the notifications pushed to users are more and more, the message notifications required by users may be submerged in numerous meaningless message notifications, and meanwhile, it is very difficult for users to find important message notifications important to users in the numerous message notifications, so that the user experience on the message notifications is poor.

Disclosure of Invention

One or more embodiments of the present specification provide a message alert processing method. The message reminding processing method comprises the following steps: and acquiring queue data of a message queue in the message list. Judging whether a target message queue meeting a queue merging condition exists in the message queues with the same queue attribute based on the queue data; if yes, merging the target message queue into a merging queue corresponding to each queue attribute. And updating the message list based on the merging queue and displaying the message list.

One or more embodiments of the present disclosure provide a second message alert processing method, including: and obtaining the access request of the merging queue in the message list. And generating a secondary message list and queue prompt corresponding to the merged queue and displaying the secondary message list and the queue prompt so as to respond to the access request. And under the condition that the queue reminding is triggered, displaying a queue list of the message queue associated with the queue reminding. And executing the queue processing operation corresponding to the queue reminding aiming at the selected message queue to be processed in the queue list.

One or more embodiments of the present disclosure provide a message alert processing apparatus, including: the queue data acquisition module is configured to acquire queue data of a message queue in the message list. And the queue merging condition judging module is configured to judge whether a target message queue meeting the queue merging condition exists in the message queues with the same queue attribute based on the queue data. If yes, a message queue combining module and a message queue display module are operated. The message queue combining module is configured to combine the target message queue into a combined queue corresponding to each queue attribute. The message queue presentation module is configured to update and present the message list based on the merge queue.

One or more embodiments of the present disclosure provide a second message alert processing apparatus, including: and the access request acquisition module is configured to acquire the access requests of the merging queues in the message list. And the merging queue display module is configured to generate a secondary message list and a queue prompt corresponding to the merging queue and display the secondary message list and the queue prompt so as to respond to the access request. And the queue list display module is configured to display a queue list of the message queue associated with the queue reminder if the queue reminder is triggered. The queue processing operation executing module is configured to execute the queue processing operation corresponding to the queue reminding aiming at the selected message queue to be processed in the queue list.

One or more embodiments of the present specification provide a message alert processing apparatus including: a processor; and a memory configured to store computer-executable instructions that, when executed, cause the processor to: and acquiring queue data of a message queue in the message list. Judging whether a target message queue meeting a queue merging condition exists in the message queues with the same queue attribute based on the queue data; if yes, merging the target message queue into a merging queue corresponding to each queue attribute. And updating the message list based on the merging queue and displaying the message list.

One or more embodiments of the present specification provide a second message alert processing apparatus, including: a processor; and a memory configured to store computer-executable instructions that, when executed, cause the processor to: and obtaining the access request of the merging queue in the message list. And generating a secondary message list and queue prompt corresponding to the merged queue and displaying the secondary message list and the queue prompt so as to respond to the access request. And under the condition that the queue reminding is triggered, displaying a queue list of the message queue associated with the queue reminding. And executing the queue processing operation corresponding to the queue reminding aiming at the selected message queue to be processed in the queue list.

One or more embodiments of the present specification provide a storage medium storing computer-executable instructions that, when executed, implement the following: and acquiring queue data of a message queue in the message list. Judging whether a target message queue meeting a queue merging condition exists in the message queues with the same queue attribute based on the queue data; if yes, merging the target message queue into a merging queue corresponding to each queue attribute. And updating the message list based on the merging queue and displaying the message list.

One or more embodiments of the present specification provide a second storage medium for storing computer-executable instructions that, when executed, implement the following: and obtaining the access request of the merging queue in the message list. And generating a secondary message list and queue prompt corresponding to the merged queue and displaying the secondary message list and the queue prompt so as to respond to the access request. And under the condition that the queue reminding is triggered, displaying a queue list of the message queue associated with the queue reminding. And executing the queue processing operation corresponding to the queue reminding aiming at the selected message queue to be processed in the queue list.

Drawings

For a clearer description of one or more embodiments of the present description or of the solutions of the prior art, the drawings that are necessary for the description of the embodiments or of the prior art will be briefly described, it being apparent that the drawings in the description that follow are only some of the embodiments described in the description, from which, for a person skilled in the art, other drawings can be obtained without inventive faculty.

FIG. 1 is a process flow diagram of a message alert processing method according to one or more embodiments of the present disclosure;

FIG. 2 is a schematic diagram of a first message list page provided in one or more embodiments of the present disclosure;

FIG. 3 is a schematic diagram of a second message list page provided by one or more embodiments of the present disclosure;

FIG. 4 is a schematic diagram of a third message list page provided by one or more embodiments of the present disclosure;

FIG. 5 is a schematic diagram of a two-level message list page provided in one or more embodiments of the present disclosure;

FIG. 6 is a diagram of a fourth message list page provided by one or more embodiments of the present disclosure;

FIG. 7 is a process flow diagram of a message alert processing method for application in a message push scenario provided in one or more embodiments of the present disclosure;

FIG. 8 is a process flow diagram of a second message alert processing method provided by one or more embodiments of the present disclosure;

FIG. 9 is a schematic diagram of a message alert processing apparatus according to one or more embodiments of the present disclosure;

FIG. 10 is a schematic diagram of a second message alert processing apparatus according to one or more embodiments of the present disclosure;

FIG. 11 is a schematic diagram of a message alert processing apparatus according to one or more embodiments of the present disclosure;

fig. 12 is a schematic structural diagram of a second message alert processing apparatus according to one or more embodiments of the present disclosure.

Detailed Description

In order to enable a person skilled in the art to better understand the technical solutions in one or more embodiments of the present specification, the technical solutions in one or more embodiments of the present specification will be clearly and completely described below with reference to the drawings in one or more embodiments of the present specification, and it is obvious that the described embodiments are only some embodiments of the present specification, not all embodiments. All other embodiments, which can be made by one or more embodiments of the present disclosure without inventive effort, are intended to be within the scope of the present disclosure.

The embodiment of the message reminding processing method is as follows:

referring to fig. 1, the message alert processing method provided in the present embodiment includes steps S102 to S108.

Step S102, obtaining the queue data of the message queue in the message list.

According to the message reminding processing method, in order to reduce interference of message reminding of unread messages to users and reduce 'compression' caused by message reminding with a large number of message lists to users, message queues in the message lists are monitored, and if the message queues with the same queue attribute are monitored to have target message queues meeting the queue merging condition, the message queues with the same queue attribute meeting the queue merging condition are merged to corresponding merging queues, so that interference of unread message reminding of a plurality of message queues with the same queue attribute to users is reduced, and the interference of unread message reminding of the same type is improved, so that the message reminding experience of the users is improved; meanwhile, a guiding and realizing mechanism for recovering the message queue in the combined queue to the message list is provided for the user with the requirement by displaying the secondary message list corresponding to the combined queue and the queue reminding mode, so that the unread message reminding experience of the user is further improved.

The message queue in this embodiment refers to a message queue formed by message notifications of applications, where an application may be an application program running in an operating system, or may be a sub-application, a sub-program, or an application function that is carried in an application program, such as an "applet", "life number", or an instant messaging function that is carried in a payment application. The message queue consists of message notifications of applications, and contains both messages that have been read by the user (read messages) and messages that have not been read by the user (unread messages). Queue data of the message queue, comprising: the user checks and clicks the related data generated in the process of browsing the message, and the queue attribute and the queue mark of the message queue;

the queue attribute is determined according to an application type of an application to which the message queue belongs, for example, if the application type of the application is an instant messaging application type, the queue attribute of the message queue of the application is an instant messaging attribute; for another example, the application type of the application is "life number" type, and the queue attribute of the message queue of the application is "life number" attribute. It should be noted that in this embodiment, in the process of merging message queues in a message list, only message queues with the same queue attribute are merged, and message queues with different queue attributes cannot be merged, so as to meet the use habit of a user, and facilitate the user to access the message queues in the merged queue.

The queue mark is obtained after the user marks the message queue in the message list, for example, if the user marks the message queue in the message list as a message queue for appointed combination, the marked message queue is marked as an appointed combination queue; if the user marks the message queue in the message list as a designated uncombinable message queue, the marked message queue is marked as a uncombinable queue; or, marking the message queue in the message list as a message queue at the top in the message list by the user, and marking the marked message queue as a top-set queue; if the queue mark of the message queue is empty, the message queue is not marked.

As described above, the message queue is composed of two parts, namely the read message and the unread message of the application, for the read message, since the user has already viewed the message, there is no need to remind the user of the read message to avoid interference to the user, and for the unread message in the message queue, in order to avoid the user missing important information in the unread message, there is a need to remind the user of the unread message, in this embodiment, the unread message is reminded to the user, specifically, based on the manner of the reminding identifier containing the number of messages displayed by the application icon of the target application in the message page, so as to achieve the purpose of reminding the user to view the unread message. Specifically, in the case that the unread message of the message queue is detected, the embodiment displays the message keywords of the message queue based on the reminding identifier including the number of the detected unread messages displayed by the application icon of the target application in the message page.

For example, the message list page shown in fig. 2 shows a message queue a of the application a, a message queue B of the application B, a message queue C of the application C, a message queue D of the application D, a message queue E of the application E, and a message queue F of the application F; the number of unread messages of the application a is 9, that is, the number of unread messages contained in the message queue a of the application a is 9, and the number of unread messages contained in the reminder identifier 201 displayed on the application icon of the application a is 9.

Step S104, based on the queue data, judging whether a target message queue meeting the queue merging condition exists in the message queues with the same queue attribute.

After the queue data of the message queues in the message list are obtained, judging whether a target message queue meeting a queue merging condition exists in the message queues with the same queue attribute based on the queue data of the message queues;

if yes, executing the following step S106, and carrying out merging processing on a target message queue meeting the queue merging condition in the message queues with the same queue attribute;

if not, the method is not carried out. In addition, in order to reduce the reminding frequency of the same type of message reminding generated by the message unread reminding of the message queue with the same queue attribute in the message list and reduce the disturbance to the user caused by the same type of message reminding, in an optional implementation manner provided in this embodiment, if the target message queue meeting the queue merging condition does not exist in the message queue with the same queue attribute, the unread duration of the message queue and the number of messages of unread messages in the message queue are determined based on the queue data; judging whether the unread duration and the message number of the unread messages meet corresponding reminding degradation conditions or not; if yes, removing the number of messages contained in the reminding identification of the unread messages of the message queue, and adding the unread reminding keywords containing the number of the messages into the message keywords of the message queue; if not, the treatment is not carried out.

For example, the number of unread messages contained in the reminder identifier 201 displayed on the application icon of application a is "9"; if the number of the unread messages of the application a is greater than 1, removing the number of messages "9" in the alert identifier 201 displayed on the application icon of the application a in the message list page shown in fig. 2, removing the alert identifier after the number of messages is shown as alert identifier 301 in fig. 3, and adding an unread alert keyword containing the number of messages "9" in the message keyword, such as an unread alert keyword shown as 302 in fig. 3: "[ 9";

the number of unread messages contained in the reminding identifier displayed on the application icon of the application F is 3; if the number of the unread messages of the application F is greater than 1, removing the number of messages "9" in the reminding identifier displayed on the application icon of the application F in the message list page, wherein the reminding identifier after removing the number of the messages is shown in fig. 3, and adding an unread reminding keyword containing the number of the messages "3" in the message keyword, such as the unread reminding keyword shown in fig. 3: "[ 3 ].

As described above, the queue data of the message queue includes the read message and the unread message that compose the message queue, and the user views and clicks the related data generated in the process of message browsing of the message queue, and the queue attribute and the queue flag of the message queue; based on this, this embodiment provides the following three alternative embodiments for determining whether there is a target message queue satisfying the queue merge condition in the message queue with the same queue attribute, starting from a plurality of data contained in the queue data.

Embodiment one:

judging whether the number of message queues with the same queue attribute, in which the unread time length of the messages is larger than a first unread time length threshold, is larger than a first queue number threshold;

if not, judging whether at least one message queue with a queue mark being a merging mark exists; if the message queue exists, merging the message queue into a merged queue corresponding to the queue attribute of the message queue; if not, the method is not used for treatment.

For example, the application type of the application a is an instant messaging application type, and accordingly it is determined that the queue attribute of the message queue of the application a (message queue a) is an instant messaging attribute, similarly, the queue attribute of the message queue of the application F (message queue F) is an instant messaging attribute, the queue attributes of the message queues of the application B, the application C, the application D and the application E (message queue B, message queue C, message queue D and message queue E) are all "life number" attributes, and accordingly it is determined that the message queue a and the message queue F are message queues with the same queue attribute, and the message queue B, message queue C, message queue D and message queue E are message queues with the same queue attribute;

Judging whether the number of message queues with the unread time length of the messages in the message queue a and the message queue f being longer than X1 days (such as 30 days) is more than or equal to 2; if the judgment result is not satisfied, judging whether the message queue a and the message queue f are designated as message queues designated for combination according to the queue marks of the message queue a and the message queue f, and if the queue marks of the message queue f are combination marks, combining the message queue f into a combination queue corresponding to the instant communication attribute;

similarly, judging whether the number of message queues with the unread time length of the message longer than X1 days (such as 30 days) in the message queues b, c, d and e is more than or equal to 2; and if the unread time length of the message queue b, the message queue c, the message queue d and the message queue e is larger than X1 days, the judgment result is that the message queue b, the message queue c, the message queue d and the message queue e are combined into a combined queue corresponding to the 'life number' attribute through subsequent steps.

Embodiment two:

judging whether the number of the message queues with empty queue marks in the message queues with the same queue attribute is larger than a second queue number threshold value;

If the number of the target message queues is greater than the second queue number threshold, executing the following step S106, and carrying out merging processing on the target message queues meeting the queue merging condition in the message queues with the same queue attribute;

if the number of queues is smaller than or equal to the second queue number threshold value, executing the following operations:

if yes, merging the message queues with the unread time length of the message in the message queues with the same queue attribute being greater than the first unread time length threshold value into merging queues corresponding to the queue attributes;

if not, judging whether at least one message queue with a queue mark being a merging mark exists in the message list; if the message queue exists, merging the at least one message queue into a merging queue corresponding to each queue attribute; if not, the method is not used for treatment.

For example, the queue attributes of the message queues 1 and 2 are instant messaging attributes, the queue attributes of the message queues 3 to 10 are "life number" attributes, and accordingly it is determined that the message queues 1 and 2 are the message queues with the same queue attributes, the message queues 3 to 10 are the message queues with the same queue attributes, whether the number of the message queues with the empty message marks in the 8 is larger than 5 is judged, if yes, corresponding message queue merging processing is performed through subsequent steps.

Embodiment III:

judging whether at least one message queue with a queue mark being a merging mark exists in the message list;

if not, the method is not used for treatment.

For example, whether the queue marks from the message queue a to the message queue f are merging marks is determined respectively, if the queue mark of the message queue f is the merging mark, the message queue f is merged into the merging queue corresponding to the instant messaging attribute through the subsequent steps according to the instant messaging attribute of the queue attribute of the message queue f.

And step S106, merging the target message queues into merging queues corresponding to the attribute of each queue.

The precondition that this step is implemented is that the step S104 determines whether there is a target message queue satisfying the queue merge condition in the message queue of the same queue attribute, and if yes, the step S104 provides 3 embodiments of merging the target message queue into a merge queue corresponding to each queue attribute, where the 3 optional embodiments of determining whether there is a target message queue satisfying the queue merge condition in the message queue of the same queue attribute are one-to-one correspondence to the step S104:

Embodiment one:

merging the target message queue into a merging queue corresponding to each queue attribute, wherein the merging queue specifically comprises the following steps:

and merging the message queues with the same queue attribute and the unread time length of the message in the message queues with the same queue attribute being greater than the first unread time length threshold value into merging queues corresponding to the queue attributes.

Along the above example, after determining whether the number of message queues greater than X1 day (for example, 30 days) is greater than or equal to 2 when the message is not read out of the 4 message queues b, c, d, e, the determination result is yes, and merging the 4 message queues b, c, d, e into a merging queue corresponding to the "life number" attribute, for example, a merging queue of "life number assistant" in the message list page shown in fig. 3, where the merging queue of "life number assistant" is a merging queue corresponding to the "life number" attribute.

Embodiment two:

ordering the message queues with the same queue attribute according to the ordering sequence from small to large of the unread duration of the messages;

and merging the message queues with the ranking number larger than or equal to the second queue number threshold value in the message queues with the same queue attribute to the merging queues corresponding to the queue attributes.

Along the above example, after determining whether the number of message queues marked as empty in the message queues 3 to 10 of the same queue attribute is greater than 5, determining that the number of message queues marked as empty in the message queues 3 to 10 is greater than 5, if so, determining that the unread time length of each message of the message queues 8, sorting the message queues 8 according to the sorting order of the unread time length of the message from small to large, if the sorting order is that the message queues 3 to 10 are sequentially sorted, merging the message queues with the sorting number greater than or equal to 5 in the 8 into the merging queues corresponding to the "life number" attribute, that is, merging the 4 message queues of the message queues 7, 8, 9 and 10 into the merging queues corresponding to the "life number" attribute.

Embodiment III:

and merging the at least one message queue into a merging queue corresponding to the corresponding queue attribute.

Along the above example, after the above-mentioned queue marks of 6 of the message queues a to f are respectively determined as merge marks, if the queue mark of the message queue f is determined as a merge mark, the message queue f is merged to the merge queue corresponding to the instant messaging attribute according to the instant messaging attribute of the queue attribute of the message queue f.

And step S108, updating and displaying the message list based on the merging queue.

After the message queues meeting the queue merging condition in the message list are merged into the merging queues corresponding to each queue attribute, updating the message list based on the merging queues, and enabling a user to perceive an effect that message reminding brought by merging the message queues into the corresponding merging queues is reduced by displaying the updated message list, in particular, in an optional implementation manner provided in this embodiment, updating and displaying the message list are realized by deleting the message queues merged into the merging queues in the message list, and displaying the merging queues in the message list, wherein a queue area of the merging queues is displayed with at least one of the following: the method comprises the steps of merging a queue icon of a queue, unread reminding keywords of the queue, merging the reminding icon and merging the reminding keywords.

Optionally, the unread reminding keywords of the merging queue include the total number of unread messages of the message queues in the merging queue;

the combined reminding icon comprises queue icons of at least one message queue in the combined queues, and the queue icons of the at least one message queue in the combined queues are displayed according to the ordering sequence of the unread time length of the messages from small to large.

Taking the message queues a to f shown in the message list page as an example, as shown in fig. 2 and 3, the queue attributes of the 4 message queues b, c, d, e are all "life number" attributes, and then the 4 message queues b, c, d, e are merged into a "life number assistant" merging queue, where the queue icon of the "life number assistant" merging queue is shown as 303, the unread reminding keyword of the "life number assistant" merging queue is shown as 304 "[ x ] item", where the value of x is equal to the sum of the number of unread messages of the 4 message queues b, c, d, e, and the merging reminding icon is shown as 305, and the merging reminding icon includes the queue icons of the 4 message queues b, c, d, e, i.e.: the application icons of the 4 applications B, C, D and E, which the 4 users belong to, are combined with the reminding keyword which is the reminding keyword of '4 unusual life numbers are automatically combined' shown as 306.

In practical application, after the message queues in the message list are merged into the corresponding merged queues, the situation that the message queues merged into the merged queues are accessed by the user may be faced, the situation that the message queues merged into the merged queues are frequently accessed or the user wants to restore the message queues in the merged queues to the message list may be faced, and for this, in an optional implementation provided in this embodiment, the following manner is adopted to implement access guidance of the message queues in the merged queues:

1) And under the condition that the access request of the merging queue is acquired, generating a secondary message list and queue reminding corresponding to the merging queue and displaying the secondary message list and the queue reminding.

Optionally, the secondary message list and the queue reminder are displayed based on a secondary message list page;

correspondingly, in the display process of the queue reminding, the display fatigue degree of the queue reminding is reduced by the following display mode, and specifically, whether the time difference between the generation time of the queue reminding and the display time of the queue reminding displayed by the second-level message list page at the previous time is larger than a time difference threshold value is judged;

if yes, further judging whether the secondary message list page displays queue reminding; if the queue reminding is not displayed, displaying the queue reminding based on the secondary message list page; if the queue prompt is displayed, the processing is not needed;

if not, the treatment is not carried out.

In specific implementation, this embodiment provides the following 3 optional embodiments for generating the queue reminder:

embodiment one:

the queue reminding is generated in the following way:

judging whether the number of the intermediate message queues with the access times in a preset time interval not less than a preset access times threshold value in the merged queue is greater than or equal to a third queue number threshold value based on the queue data of the message queues in the merged queue;

If yes, generating a queue recovery guide reminder for guiding the intermediate message queue to be recovered to the message list, and taking the queue recovery guide reminder as the queue reminder; the queue recovery guide prompt comprises a queue icon and a guide keyword of the intermediate message queue;

if not, the treatment is not carried out.

For example, 4 of the message queues b, c, d, e included in the merged queue are merged, and according to the access data included in the queue data of the 4, it is determined whether the number of intermediate message queues having the number of accesses of not less than 2 within 7 days is greater than or equal to 2;

if the result is greater than or equal to 2, specifically, the number of times that the message queue b and the message queue c are accessed within 7 days is not less than 2, generating a guidance prompt for guiding the message queue b and the message queue c to recover from the secondary message list page (shown in fig. 4) corresponding to the 'life number assistant' combined queue to the message list page, wherein the guidance prompt specifically comprises a queue icon of the message queue b, a queue icon of the message queue c, shown in fig. 4, 401, and a guidance keyword '2 life numbers accessed, which can be displayed on the message list page', shown in fig. 4, and prompting the user of the most recently accessed message queue more intuitively, so as to guide the user to recover the most recently accessed message queue to the message list page.

Embodiment two:

the queue reminding is generated in the following way:

judging whether an intermediate message queue with the unread time length of the message being longer than an unread time length threshold exists in the merging queue based on the queue data of the message queues in the merging queue;

if yes, generating a message rejection guiding prompt for rejecting the message of the intermediate message queue as the queue prompt; the message rejection guiding prompt comprises a queue icon of the intermediate message queue and guiding keywords;

if not, the treatment is not carried out.

For example, the merging queue includes 4 message queues b, c, d and e, and according to the receiving time of the unread messages included in the queue data of the 4 message queues, respectively calculating the unread duration of the 4 message queues, and judging whether there is a message queue with the unread duration longer than 1 month in the 4 message queues; the judging result is that the messages exist, specifically that the unread time of the messages in the message queue d and the message queue e is longer than 1 month, and a guiding prompt for guiding the messages rejected by the message queue d and the message queue e is generated, namely: the guiding prompt of the notification message of the application D which the guiding rejection message queue D belongs to and the notification message of the application E which the message queue E belongs to comprises an application icon of the application D which the message queue D belongs to, an application icon of the application E which the message queue E belongs to and a guiding keyword '2 life numbers are not accessed for a long time, and the notification of the message can be rejected'.

Embodiment III:

the queue reminding is generated in the following way:

if yes, generating a queue recovery guide reminder for guiding the intermediate message queue to be recovered to the message list, and taking the queue recovery guide reminder as the queue reminder;

if not, judging whether the number of the intermediate message queues with the unread time length of the messages in the combined queues being greater than the unread time length threshold is greater than a fourth queue number threshold; if yes, generating a message rejection guiding prompt for rejecting the message of the intermediate message queue as the queue prompt; the queue recovery guide prompt comprises a queue icon and a guide keyword of the intermediate message queue; if not, the treatment is not carried out.

2) And under the condition that the queue reminding is triggered, displaying a queue list of the message queue associated with the queue reminding.

For example, after the queue icon including the message queue b, the queue icon including the message queue c, and the guidance keyword "2 life numbers have been accessed" shown in fig. 4, it may be shown that, on the basis that the guidance prompt of the message list page "is triggered, if the guidance prompt is triggered, a queue list composed of the message queue b and the message queue c associated with the guidance prompt is shown in fig. 5.

For another example, if the guidance prompt is triggered, a queue list composed of the message queue D and the message queue E associated with the guidance prompt is displayed on the basis that the guidance prompt including the application icon of the application D to which the message queue D belongs, the application icon of the application E to which the message queue E belongs, and the guidance keyword "2 life numbers are not accessed for a long time, and the message notification can be rejected".

3) And executing the queue processing operation corresponding to the queue reminding aiming at the selected message queue to be processed in the queue list.

Corresponding to the above-provided 3 optional embodiments for generating the queue reminder, the embodiment provides the following 3 specific embodiments for executing the queue processing operation corresponding to the queue reminder with respect to the selected target message queue in the queue list:

embodiment one:

aiming at the selected message queue to be processed in the queue list, executing the queue processing operation corresponding to the queue reminding, which comprises the following steps:

executing queue recovery processing corresponding to the queue recovery guide reminding aiming at the to-be-processed message queue so as to update the to-be-processed message queue from the secondary message list to the message list;

And updating the ordering order of the message queues in the updated message list.

Along the above example, as shown in fig. 5, after the queue list formed by the message queue b and the message queue c associated with the guidance prompt is displayed, if the selected to-be-processed message queue in the queue list is the message queue b, the message queue b is updated from the second-level message list page corresponding to the "life number assistant" merging queue to the message list page, and after updating, the message list page includes the message queue a, the message queue b, the "life number assistant" merging queue and the message queue f, as shown in fig. 6, and the 4 are ordered according to the priority of the queue marks of the 4 and the unread time length of the message.

Embodiment two:

and executing the message rejection processing corresponding to the message rejection guiding prompt aiming at the message queue to be processed.

On this basis, in order to reduce interference of the invalid message queue of the rejected message in the secondary message list to the user, in an alternative implementation manner provided in this embodiment, the invalid message queue of the rejected message in the secondary message list is destroyed in the following manner:

Judging whether the non-access time length of the message queue to be processed is greater than a non-access time length threshold value or not based on the queue data of the message queue to be processed;

if yes, generating a queue unguiding prompt for unguiding the message queue to be processed and displaying; the queue release guide prompt comprises a queue icon and a guide keyword of the message queue to be processed;

under the condition that the queue unguiding reminding is triggered, executing message queue unguiding processing corresponding to the queue unguiding reminding aiming at the message queue to be processed, and removing the message queue to be processed from the secondary message list;

if not, the treatment is not carried out.

Along the above example, after the queue list formed by the message queue d and the message queue e associated with the guidance prompt for guiding the rejected message is displayed, if the message queue to be processed selected by the user in the queue list is the message queue d and the message queue e, the message rejection processing is performed on the message queue d and the message queue e; after the message rejection processing is carried out on the message queue D and the message queue E, judging whether the non-access time length of the message queue D and the message queue E is longer than 3 months, if so, carrying out the correlation processing on the two life numbers of the application D and the application E, removing the message queue D and the message queue E from the secondary message list, and thoroughly eliminating the message disturbance of the message queue D of the application D and the message queue E of the application E on the user.

Embodiment III:

executing queue recovery processing corresponding to the queue recovery guide prompt aiming at the message queue to be processed under the condition that the queue prompt is the queue recovery guide prompt, so that the message queue to be processed is updated from the secondary message list to the message list, and updating the ordering sequence of the message queue in the updated message list;

and executing message rejection processing corresponding to the message rejection guiding prompt aiming at the message queue to be processed under the condition that the queue prompt is the message rejection guiding prompt.

The following further describes the message reminding processing method provided in this embodiment by taking an application of the message reminding processing method provided in this embodiment to an application message pushing scene as an example, and referring to fig. 7, the message reminding processing method applied to the application message pushing scene specifically includes steps S702 to S722.

Step S702, obtaining queue data of a message queue in the message list.

Step S704, based on the queue data, judging whether the number of message queues with the same queue attribute in which the unread time length of the messages is larger than a first unread time length threshold is larger than a first queue number threshold;

If yes, go to step S706;

if not, judging whether at least one message queue with a queue mark being a merging mark exists in the message list; if yes, merging at least one message queue into a merging queue corresponding to the corresponding queue attribute; if not, the treatment is not carried out.

Step S706, combining the message queues with the same queue attribute and the message unread time length longer than the first unread time length threshold value to the combined queue corresponding to each queue attribute.

In step S708, the message queues combined to the combining queue in the message list are deleted, and the combining queue is displayed in the message list.

Specifically, the queue area of the merge queue exhibits at least one of: a queue icon of the merging queue, unread reminding keywords of the merging queue, a merging reminding icon and merging reminding keywords;

the unread reminding keywords of the merging queues comprise the total number of unread messages of the message queues in the merging queues; the combined reminding icon comprises queue icons of at least one message queue in the combined queues, and the queue icons of the at least one message queue in the combined queues are displayed according to the ordering sequence of the unread duration of the messages from small to large.

Step S710, an access request of the merge queue is acquired.

Step S712, based on the queue data of the message queues in the merged queue, judging whether the number of the intermediate message queues with the access times in the preset time interval not less than the preset access times threshold is greater than or equal to the third queue number threshold;

if yes, go to step S714;

if not, the treatment is not carried out.

In step S714, a queue recovery guide reminder is generated that guides the intermediate message queue to recover to the message list.

The queue recovery guide prompt comprises a queue icon of an intermediate message queue and a guide keyword.

Step S716, a secondary message list corresponding to the combined queue and a queue recovery guide prompt are displayed.

Step S718, in the case that the queue recovery guide reminder is triggered, a queue list of the message queue associated with the queue recovery guide reminder is displayed.

Step S720, executing the queue recovery processing corresponding to the queue recovery guide reminding aiming at the selected message queue to be processed in the queue list.

Step S722, the order of the message queues in the updated message list is updated.

In summary, according to the message reminding processing method provided by the embodiment, starting from the queue data of the message queues in the message list, monitoring the message queues in the message list, and merging the message queues with the same queue attribute meeting the queue merging condition into the corresponding merging queue under the condition that whether the target message queues meeting the queue merging condition exist in the message queues with the same queue attribute is monitored, so that the interference caused by unread message reminding of a plurality of message queues with the same queue attribute to a user is reduced, and the unread message reminding experience of the user is improved; meanwhile, a guiding and realizing mechanism for recovering the message queue in the combined queue to the message list is provided for the user with the requirement by displaying the secondary message list corresponding to the combined queue and the queue reminding mode, so that the unread message reminding experience of the user is further improved.

The embodiment of the second message reminding processing method provided in the present specification is as follows:

referring to fig. 8, the message alert processing method provided in the present embodiment includes steps S802 to S808.

Step S802, access requests of the merging queues in the message list are acquired.

According to the message reminding processing method, in order to reduce interference of message reminding of unread messages to users and reduce compression of message reminding with a large number of message reminding in a message list to the users, a guiding and realizing mechanism for recovering the message queue in the combined queue to the message list is provided for the users with requirements by displaying a secondary message list corresponding to the combined queue and a queue reminding mode, and the unread message reminding experience of the users is further improved.

Step S804, generating a secondary message list and queue prompt corresponding to the merged queue and displaying the secondary message list and queue prompt so as to respond to the access request.

if not, the treatment is not carried out.

embodiment one:

judging whether the number of the intermediate message queues with the access times in a preset time interval not less than a preset access times threshold value in the merged queue is greater than or equal to a first queue number threshold value based on the queue data of the message queues in the merged queue;

if not, the treatment is not carried out.

Embodiment two:

if not, the treatment is not carried out.

Embodiment III:

if not, judging whether the number of the intermediate message queues with the unread time length of the messages in the combined queues being greater than the unread time length threshold is greater than a second queue number threshold; if yes, generating a message rejection guiding prompt for rejecting the message of the intermediate message queue as the queue prompt; the queue recovery guide prompt comprises a queue icon and a guide keyword of the intermediate message queue; if not, the treatment is not carried out.

Step S806, in the case that the queue reminder is triggered, displaying a queue list of the message queue associated with the queue reminder.

Step S808, executing the queue processing operation corresponding to the queue reminding for the selected message queue to be processed in the queue list.

Corresponding to the 3 optional embodiments of generating the queue reminder provided in the step S804, this embodiment provides the following 3 specific embodiments of executing the queue processing operation corresponding to the queue reminder with respect to the selected target message queue in the queue list:

embodiment one:

Embodiment two:

if not, the treatment is not carried out.

Embodiment III:

The embodiment of a message reminding processing device provided in the specification is as follows:

in the foregoing embodiments, a message reminding processing method and a message reminding processing device corresponding to the message reminding processing method are provided, and the message reminding processing device is described below with reference to the accompanying drawings.

Referring to fig. 9, a schematic diagram of a message alert processing apparatus provided in this embodiment is shown.

Since the apparatus embodiments correspond to the method embodiments, the description is relatively simple, and the relevant portions should be referred to the corresponding descriptions of the method embodiments provided above. The device embodiments described below are merely illustrative.

The embodiment provides a message reminding processing device, which comprises:

a queue data obtaining module 902 configured to obtain queue data of a message queue in the message list;

a queue combining condition judging module 904 configured to judge whether a target message queue satisfying a queue combining condition exists in the message queues of the same queue attribute based on the queue data;

if yes, a message queue combining module 906 and a message queue presentation module 908 are run;

the message queue combining module 906 is configured to combine the target message queue into a combined queue corresponding to each queue attribute;

the message queue exposing module 908 is configured to update and expose the message list based on the merge queue.

Optionally, the queue merge condition determining module 904 is specifically configured to determine whether the number of message queues with the same queue attribute, where the unread time length of the message is greater than a first unread time length threshold, is greater than a first queue number threshold;

correspondingly, the merging the target message queue into the merging queue corresponding to each queue attribute includes:

Optionally, the queue merge condition determining module 904 is specifically configured to determine whether the number of message queues marked as empty in the message queues with the same queue attribute is greater than a second queue number threshold;

accordingly, the message queue combining module 906 is specifically configured to:

sequencing the message queues in the message list according to the sequencing order from small to large of the unread duration of the messages;

Optionally, the queue merge condition determining module 904 is specifically configured to determine whether there is at least one message queue with a queue tag being a merge tag in the message list;

accordingly, the message queue merging module 906 is specifically configured to merge the at least one message queue into a merged queue corresponding to the corresponding queue attribute.

Optionally, the queue combining condition determining module 904 is further configured to:

if not, judging whether at least one message queue with a queue mark being a merging mark exists in the message list; and if the message queue exists, merging the at least one message queue into a merging queue corresponding to the corresponding queue attribute.

Optionally, the message queue presenting module 908 is specifically configured to delete the message queue that is merged into the merged queue in the message list, and present the merged queue in the message list; wherein the queue area of the merge queue exhibits at least one of: the method comprises the steps of merging a queue icon of a queue, unread reminding keywords of the queue, merging the reminding icon and merging the reminding keywords.

Optionally, if the operation result after the operation of the queue combining condition judging module 904 is no, the following modules are operated:

an unread message number determining module configured to determine an unread duration of the message queue and a message number of unread messages in the message queue based on the queue data;

the reminding degradation condition judging module is configured to judge whether the unread duration and the message number of the unread messages meet corresponding reminding degradation conditions or not; if yes, removing the number of messages contained in the reminding identification of the unread messages of the message queue, and adding the unread reminding keywords containing the number of the messages into the message keywords of the message queue.

Optionally, the message reminding processing device further includes:

the queue reminding display module is configured to generate a secondary message list and queue reminding corresponding to the merging queue and display the secondary message list and the queue reminding under the condition that the access request of the merging queue is acquired;

the queue list display module is configured to display a queue list of a message queue associated with the queue prompt under the condition that the queue prompt is triggered;

the queue processing operation executing module is configured to execute the queue processing operation corresponding to the queue reminding aiming at the selected message queue to be processed in the queue list.

correspondingly, the queue reminding is displayed by running the following sub-modules:

the time judging sub-module is configured to judge whether the time difference between the generation time of the queue reminder and the display time of the queue reminder displayed by the secondary message list page at the previous time is larger than a time difference threshold value;

if yes, the operation queue reminding judging sub-module; the operation queue reminding judging sub-module is configured to judge whether the secondary message list page displays queue reminding or not; and if the queue reminding is not displayed, displaying the queue reminding based on the secondary message list page.

Optionally, the queue reminder is generated by running the following sub-modules:

a number judging sub-module configured to judge whether the number of the intermediate message queues in the merged queue, of which the access times in the preset time interval are not less than a preset access times threshold, is greater than or equal to a third queue number threshold based on the queue data of the message queues in the merged queue;

if yes, the operation queue resumes the guiding reminding generation sub-module; the queue recovery guide reminder generation sub-module is configured to generate a queue recovery guide reminder for guiding the intermediate message queue to recover to the message list as the queue reminder; the queue recovery guide prompt comprises a queue icon and a guide keyword of the intermediate message queue;

Correspondingly, the queue processing operation execution module is specifically configured to:

the unread duration judging submodule is configured to judge whether an intermediate message queue with the unread duration longer than an unread duration threshold exists in the merging queue based on the queue data of the message queues in the merging queue;

if yes, a message rejection guide reminding generation sub-module is operated; the message rejection guidance reminder generation sub-module is configured to generate a message rejection guidance reminder for rejecting messages to the intermediate message queue as the queue reminder; the message rejection guiding prompt comprises a queue icon of the intermediate message queue and guiding keywords;

correspondingly, the queue processing operation execution module is specifically configured to execute the message rejection processing corresponding to the message rejection guiding reminding aiming at the message queue to be processed.

Optionally, the message reminding processing device further includes:

the non-access time length judging module is configured to judge whether the non-access time length of the message queue to be processed is greater than a non-access time length threshold value or not based on the queue data of the message queue to be processed;

if yes, the operation queue release guide reminding display module and the message queue release processing module;

the queue unguiding reminding display module is configured to generate queue unguiding reminding for removing the message queue to be processed and display; the queue release guide prompt comprises a queue icon and a guide keyword of the message queue to be processed;

the message queue release processing module is configured to execute message queue release processing corresponding to the queue release guide prompt for the message queue to be processed when the queue release guide prompt is triggered, and remove the message queue to be processed from the secondary message list.

an access number judging sub-module configured to judge whether the number of the intermediate message queues with the access number of not less than a preset access number threshold in a preset time interval in the merged queue is greater than or equal to a third queue number threshold based on the queue data of the message queues in the merged queue;

If yes, the guiding reminding generation sub-module is operated; the guidance prompt generation sub-module is configured to generate a queue recovery guidance prompt for guiding the intermediate message queue to be recovered to the message list, and the queue recovery guidance prompt is used as the queue prompt;

if not, operating the message unread duration judging sub-module; the message unread duration judging submodule is configured to judge whether the number of the intermediate message queues with the message unread duration longer than an unread duration threshold in the combined queue is greater than a fourth queue number threshold; if yes, generating a message rejection guiding prompt for rejecting the message of the intermediate message queue as the queue prompt; the queue recovery guide prompt comprises a queue icon and a guide keyword of the intermediate message queue;

The second message reminding processing device provided in the present specification is as follows:

Referring to fig. 10, a schematic diagram of a message alert processing apparatus provided in this embodiment is shown.

The embodiment provides a message reminding processing device, which comprises:

an access request obtaining module 1002 configured to obtain an access request of the merge queue in the message list;

a merging queue presentation module 1004, configured to generate a secondary message list and a queue reminder corresponding to the merging queue and present the secondary message list and the queue reminder in response to the access request;

a queue list presentation module 1006 configured to present a queue list of message queues associated with the queue reminder if the queue reminder is triggered;

And the queue processing operation execution module 1008 is configured to execute the queue processing operation corresponding to the queue reminding for the selected to-be-processed message queue in the queue list.

the number judging submodule is configured to judge whether the number of the intermediate message queues with the access times in the preset time interval not less than a preset access times threshold value in the combined queue is greater than or equal to a first queue number threshold value based on the queue data of the message queues in the combined queue;

accordingly, the queue processing operation execution module 1008 is specifically configured to:

Accordingly, the queue processing operation execution module 1008 is specifically configured to execute, for the pending message queue, a message rejection process corresponding to the message rejection guidance alert.

Optionally, the message reminding processing device further includes:

the access number judging submodule is configured to judge whether the number of the intermediate message queues with the access number of not less than a preset access number threshold value in a preset time interval in the combined queue is larger than or equal to a first queue number threshold value based on the queue data of the message queues in the combined queue;

if not, judging whether the number of the intermediate message queues with the unread time length of the messages in the combined queues being greater than the unread time length threshold is greater than a second queue number threshold;

if yes, operating a message unread duration judging sub-module; the message unread duration judging submodule is configured to generate a message rejection guiding prompt for rejecting the message of the intermediate message queue as the queue prompt; the queue recovery guide prompt comprises a queue icon and a guide keyword of the intermediate message queue;

The embodiment of a message reminding processing device provided in the present specification is as follows:

corresponding to the message reminding processing method described above, one or more embodiments of the present disclosure further provide a message reminding processing device, which is configured to execute the message reminding processing method provided above, based on the same technical concept, and fig. 11 is a schematic structural diagram of the message reminding processing device provided by one or more embodiments of the present disclosure.

The message reminding processing device provided in this embodiment includes:

As shown in fig. 11, the message alert processing device may be configured or configured to vary significantly, and may include one or more processors 1101 and a memory 1102, where the memory 1102 may store one or more stored applications or data. Wherein the memory 1102 may be transient storage or persistent storage. The application program stored in the memory 1102 may include one or more modules (not shown in the figures), each of which may include a series of computer-executable instructions in the message alert processing device. Still further, the processor 1101 may be arranged to communicate with the memory 1102 to execute a series of computer executable instructions in the memory 1102 on a message alert processing device. The message alert processing device can also include one or more power supplies 1103, one or more wired or wireless network interfaces 1104, one or more input output interfaces 1105, one or more keyboards 1106, and the like.

In a particular embodiment, a message alert processing device includes a memory, and one or more programs, wherein the one or more programs are stored in the memory, and the one or more programs may include one or more modules, and each module may include a series of computer-executable instructions for the message alert processing device, and execution of the one or more programs by one or more processors includes computer-executable instructions for:

Acquiring queue data of a message queue in a message list;

judging whether a target message queue meeting a queue merging condition exists in the message queues with the same queue attribute based on the queue data;

if yes, merging the target message queue into a merging queue corresponding to each queue attribute;

and updating the message list based on the merging queue and displaying the message list.

Optionally, the determining whether the target message queue meeting the queue merging condition exists in the message queues with the same queue attribute includes:

Optionally, if the number of message queues with empty queue marks in the message queues with the same queue attribute is greater than the second queue number threshold, the execution result after the instruction execution is no, the following operations are executed:

if not, judging whether at least one message queue with a queue mark being a merging mark exists in the message list;

and if the message queue exists, merging the at least one message queue into a merging queue corresponding to the corresponding queue attribute.

Optionally, the updating the message list based on the merging queue and displaying includes:

deleting the message queue which is merged into the merging queue in the message list, and displaying the merging queue in the message list;

wherein the queue area of the merge queue exhibits at least one of: the method comprises the steps of merging a queue icon of a queue, unread reminding keywords of the queue, merging the reminding icon and merging the reminding keywords.

Optionally, if the target message queue instruction meeting the queue combining condition exists in the message queues with the same queue attribute based on the queue data, the execution result is no, and the following operations are executed:

determining the unread duration of the message queue and the number of the unread messages in the message queue based on the queue data;

judging whether the unread duration and the message number of the unread messages meet corresponding reminding degradation conditions or not;

if yes, removing the number of messages contained in the reminding identification of the unread messages of the message queue, and adding the unread reminding keywords containing the number of the messages into the message keywords of the message queue.

Optionally, the computer executable instructions, when executed, are further configured to perform the following computer executable instructions:

generating a secondary message list and queue reminding corresponding to the merging queue and displaying the secondary message list and the queue reminding under the condition that the access request of the merging queue is acquired;

displaying a queue list of a message queue associated with the queue reminding under the condition that the queue reminding is triggered;

and executing the queue processing operation corresponding to the queue reminding aiming at the selected message queue to be processed in the queue list.

correspondingly, the queue reminding is displayed in the following mode:

judging whether the time difference between the generation time of the queue reminder and the display time of the queue reminder displayed by the secondary message list page at the previous time is larger than a time difference threshold value or not;

if yes, judging whether the secondary message list page displays a queue prompt;

and if the queue reminding is not displayed, displaying the queue reminding based on the secondary message list page.

Optionally, the queue reminder is generated in the following manner:

Correspondingly, the executing the queue processing operation corresponding to the queue reminding for the selected to-be-processed message queue in the queue list includes:

Optionally, the queue reminder is generated in the following manner:

and under the condition that the queue unguiding prompt is triggered, executing message queue unguiding processing corresponding to the queue unguiding prompt aiming at the message queue to be processed, and removing the message queue to be processed from the secondary message list.

Optionally, the queue reminder is generated in the following manner:

If not, judging whether the number of the intermediate message queues with the unread time length of the messages in the combined queues being greater than the unread time length threshold is greater than a fourth queue number threshold;

if yes, generating a message rejection guiding prompt for rejecting the message of the intermediate message queue as the queue prompt; the queue recovery guide prompt comprises a queue icon and a guide keyword of the intermediate message queue;

The second message alert processing device provided in the present specification is as follows:

corresponding to the second message alert processing method described above, one or more embodiments of the present disclosure further provide a second message alert processing device, based on the same technical concept, where the second message alert processing device is configured to execute the second message alert processing method provided above, and fig. 11 is a schematic structural diagram of the second message alert processing device provided in one or more embodiments of the present disclosure.

The second message alert processing device provided in this embodiment includes:

acquiring an access request of a merging queue in a message list;

generating a secondary message list corresponding to the merged queue and a queue reminder and displaying the secondary message list and the queue reminder so as to respond to the access request;

correspondingly, the queue reminding is displayed in the following mode:

Optionally, the queue reminder is generated in the following manner:

An embodiment of a storage medium provided in the present specification is as follows:

corresponding to the message alert processing method described above, one or more embodiments of the present disclosure further provide a storage medium based on the same technical concept.

The storage medium provided in this embodiment is configured to store computer executable instructions, where the computer executable instructions when executed implement the following procedures:

acquiring queue data of a message queue in a message list;

Optionally, if the number of message queues marked empty in the message queues with the same queue attribute is greater than the number of message queues marked empty in the message queues with the same queue attribute, the execution result after the execution of the second queue number threshold sub-flow is no, the following operations are executed:

Optionally, if the target message queue flow meeting the queue merging condition exists in the message queues with the same queue attribute based on the queue data, the execution result is no, and the following operations are executed:

Optionally, the computer executable instructions when executed further implement the following flow:

correspondingly, the queue reminding is displayed in the following mode:

Optionally, the queue reminder is generated in the following manner:

The second storage medium embodiment provided in the present specification is as follows:

corresponding to the second message alert processing method described above, one or more embodiments of the present disclosure further provide a storage medium based on the same technical concept.

acquiring an access request of a merging queue in a message list;

correspondingly, the queue reminding is displayed in the following mode:

Optionally, the queue reminder is generated in the following manner:

Optionally, the message reminding processing method further includes:

Optionally, the queue reminder is generated in the following manner:

It should be noted that, the embodiments related to the storage medium in the present specification and the embodiments related to the message alert processing method in the present specification are based on the same inventive concept, so that the specific implementation of the embodiments may refer to the implementation of the corresponding method, and the repetition is not repeated.

The foregoing describes specific embodiments of the present disclosure. Other embodiments are within the scope of the following claims. In some cases, the actions or steps recited in the claims can be performed in a different order than in the embodiments and still achieve desirable results. In addition, the processes depicted in the accompanying figures do not necessarily require the particular order shown, or sequential order, to achieve desirable results. In some embodiments, multitasking and parallel processing are also possible or may be advantageous.

In the 30 s of the 20 th century, improvements to one technology could clearly be distinguished as improvements in hardware (e.g., improvements to circuit structures such as diodes, transistors, switches, etc.) or software (improvements to the process flow). However, with the development of technology, many improvements of the current method flows can be regarded as direct improvements of hardware circuit structures. Designers almost always obtain corresponding hardware circuit structures by programming improved method flows into hardware circuits. Therefore, an improvement of a method flow cannot be said to be realized by a hardware entity module. For example, a programmable logic device (Programmable Logic Device, PLD) (e.g., field programmable gate array (Field Programmable Gate Array, FPGA)) is an integrated circuit whose logic function is determined by the programming of the device by a user. A designer programs to "integrate" a digital system onto a PLD without requiring the chip manufacturer to design and fabricate application-specific integrated circuit chips. Moreover, nowadays, instead of manually manufacturing integrated circuit chips, such programming is mostly implemented by using "logic compiler" software, which is similar to the software compiler used in program development and writing, and the original code before the compiling is also written in a specific programming language, which is called hardware description language (Hardware Description Language, HDL), but not just one of the hdds, but a plurality of kinds, such as ABEL (Advanced Boolean Expression Language), AHDL (Altera Hardware Description Language), confluence, CUPL (Cornell University Programming Language), HDCal, JHDL (Java Hardware Description Language), lava, lola, myHDL, PALASM, RHDL (Ruby Hardware Description Language), etc., VHDL (Very-High-Speed Integrated Circuit Hardware Description Language) and Verilog are currently most commonly used. It will also be apparent to those skilled in the art that a hardware circuit implementing the logic method flow can be readily obtained by merely slightly programming the method flow into an integrated circuit using several of the hardware description languages described above.

The controller may be implemented in any suitable manner, for example, the controller may take the form of, for example, a microprocessor or processor and a computer readable medium storing computer readable program code (e.g., software or firmware) executable by the (micro) processor, logic gates, switches, application specific integrated circuits (Application Specific Integrated Circuit, ASIC), programmable logic controllers, and embedded microcontrollers, examples of which include, but are not limited to, the following microcontrollers: ARC 625D, atmel AT91SAM, microchip PIC18F26K20, and Silicone Labs C8051F320, the memory controller may also be implemented as part of the control logic of the memory. Those skilled in the art will also appreciate that, in addition to implementing the controller in a pure computer readable program code, it is well possible to implement the same functionality by logically programming the method steps such that the controller is in the form of logic gates, switches, application specific integrated circuits, programmable logic controllers, embedded microcontrollers, etc. Such a controller may thus be regarded as a kind of hardware component, and means for performing various functions included therein may also be regarded as structures within the hardware component. Or even means for achieving the various functions may be regarded as either software modules implementing the methods or structures within hardware components.

The system, apparatus, module or unit set forth in the above embodiments may be implemented in particular by a computer chip or entity, or by a product having a certain function. One typical implementation is a computer. In particular, the computer may be, for example, a personal computer, a laptop computer, a cellular telephone, a camera phone, a smart phone, a personal digital assistant, a media player, a navigation device, an email device, a game console, a tablet computer, a wearable device, or a combination of any of these devices.

For convenience of description, the above devices are described as being functionally divided into various units, respectively. Of course, the functions of each unit may be implemented in the same piece or pieces of software and/or hardware when implementing the embodiments of the present specification.

One skilled in the relevant art will recognize that one or more embodiments of the present description may be provided as a method, system, or computer program product. Accordingly, one or more embodiments of the present description may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present description can take the form of a computer program product on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, etc.) having computer-usable program code embodied therein.

The present description is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the specification. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be loaded onto a computer or other programmable processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

In one typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.

The memory may include volatile memory in a computer-readable medium, random Access Memory (RAM) and/or nonvolatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). Memory is an example of computer-readable media.

Computer readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of storage media for a computer include, but are not limited to, phase change memory (PRAM), static Random Access Memory (SRAM), dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), read Only Memory (ROM), electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium, which can be used to store information that can be accessed by a computing device. Computer-readable media, as defined herein, does not include transitory computer-readable media (transmission media), such as modulated data signals and carrier waves.

It should also be noted that 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 one … …" does not exclude the presence of other like elements in a process, method, article or apparatus that comprises the element.

One or more embodiments of the present specification may be described in the general context of computer-executable instructions, such as program modules, being executed by a computer. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. One or more embodiments of the specification may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in both local and remote computer storage media including memory storage devices.

In this specification, each embodiment is described in a progressive manner, and identical and similar parts of each embodiment are all referred to each other, and each embodiment mainly describes differences from other embodiments. In particular, for system embodiments, since they are substantially similar to method embodiments, the description is relatively simple, as relevant to see a section of the description of method embodiments.

The foregoing description is by way of example only and is not intended to limit the present disclosure. Various modifications and changes may occur to those skilled in the art. Any modifications, equivalent substitutions, improvements, etc. that fall within the spirit and principles of the present document are intended to be included within the scope of the claims of the present document.

Claims

1. A message alert processing method comprising:

acquiring queue data of a message queue in a message list;

judging whether a target message queue meeting a queue merging condition exists in the message queues with the same queue attribute based on the queue data; wherein the queue merge condition includes any one of: the unread time length of the message is larger than a first unread time length threshold; on the premise that the number of message queues marked as empty in the message queues with the same queue attribute is larger than a second queue number threshold value, sequencing the message according to the sequence from small to large of the unread duration of the message, wherein the sequencing number is larger than or equal to the second queue number threshold value; the queue mark is a merging mark;

2. The message alert processing method according to claim 1, wherein the determining whether the target message queue satisfying the queue merging condition exists in the message queues with the same queue attribute includes:

3. The message alert processing method according to claim 1, wherein the determining whether the target message queue satisfying the queue merging condition exists in the message queues with the same queue attribute includes:

4. The message alert processing method according to claim 1, wherein the determining whether the target message queue satisfying the queue merging condition exists in the message queues with the same queue attribute includes:

5. The message alert processing method according to claim 3, wherein if the number of message queues marked as empty in the message queues of the same queue attribute is greater than the second queue number threshold value, the execution result after the execution of the substep is no, the following operations are executed:

6. The message alert processing method according to any one of claims 2 to 5, wherein the updating and displaying the message list based on the merge queue includes:

7. The message alert processing method according to claim 6, wherein the unread alert keywords of the merge queue include a total number of unread messages of the message queues in the merge queue;

8. The message reminding processing method according to claim 1, wherein if the step of determining whether the target message queue meeting the queue merging condition exists in the message queues with the same queue attribute based on the queue data is performed, the step of performing the target message queue is performed, and the following operations are performed:

9. The message alert processing method according to claim 1, further comprising:

10. The message alert processing method according to claim 9, the secondary message list and the queue alert being presented based on a secondary message list page;

correspondingly, the queue reminding is displayed in the following mode:

11. The message alert processing method according to claim 9, wherein the queue alert is generated by:

12. The message alert processing method according to claim 9, wherein the queue alert is generated by:

13. The message alert processing method according to claim 12, further comprising:

14. The message alert processing method according to claim 9, wherein the queue alert is generated by:

15. A message alert processing method comprising:

acquiring an access request of a merging queue in a message list; the merging queue is formed by merging target message queues meeting queue merging conditions in message queues with the same queue attribute, and the queue merging conditions comprise any one of the following: the unread time length of the message is larger than a first unread time length threshold; on the premise that the number of message queues marked as empty in the message queues with the same queue attribute is larger than a second queue number threshold value, sequencing the message according to the sequence from small to large of the unread duration of the message, wherein the sequencing number is larger than or equal to the second queue number threshold value; the queue mark is a merging mark;

16. The message alert processing method according to claim 15, the secondary message list and the queue alert being presented based on a secondary message list page;

Correspondingly, the queue reminding is displayed in the following mode:

17. The message alert processing method according to claim 15, wherein the queue alert is generated by:

18. The message alert processing method according to claim 15, wherein the queue alert is generated by:

19. The message alert processing method according to claim 18, further comprising:

20. The message alert processing method according to claim 15, wherein the queue alert is generated by:

21. A message alert processing apparatus comprising:

the queue data acquisition module is configured to acquire queue data of a message queue in the message list;

a queue combining condition judging module configured to judge whether a target message queue meeting a queue combining condition exists in message queues of the same queue attribute based on the queue data; wherein the queue merge condition includes any one of: the unread time length of the message is larger than a first unread time length threshold; on the premise that the number of message queues marked as empty in the message queues with the same queue attribute is larger than a second queue number threshold value, sequencing the message according to the sequence from small to large of the unread duration of the message, wherein the sequencing number is larger than or equal to the second queue number threshold value; the queue mark is a merging mark;

if yes, a message queue combining module and a message queue display module are operated;

the message queue combining module is configured to combine the target message queue to a combined queue corresponding to each queue attribute;

the message queue presentation module is configured to update and present the message list based on the merge queue.

22. A message alert processing apparatus comprising:

The access request acquisition module is configured to acquire an access request of the merging queue in the message list; the merging queue is formed by merging target message queues meeting queue merging conditions in message queues with the same queue attribute, and the queue merging conditions comprise any one of the following: the unread time length of the message is larger than a first unread time length threshold; on the premise that the number of message queues marked as empty in the message queues with the same queue attribute is larger than a second queue number threshold value, sequencing the message according to the sequence from small to large of the unread duration of the message, wherein the sequencing number is larger than or equal to the second queue number threshold value; the queue mark is a merging mark;

the merging queue display module is configured to generate a secondary message list corresponding to the merging queue and a queue prompt and display the secondary message list and the queue prompt so as to respond to the access request;

23. A message alert processing apparatus comprising:

a processor; the method comprises the steps of,

a memory configured to store computer-executable instructions that, when executed, cause the processor to:

acquiring queue data of a message queue in a message list;

24. A message alert processing apparatus comprising:

a processor; the method comprises the steps of,

25. A storage medium storing computer-executable instructions that when executed implement the following:

acquiring queue data of a message queue in a message list;

26. A storage medium storing computer-executable instructions that when executed implement the following: