CN111224795B - Group application processing method and device, electronic equipment and storage medium - Google Patents
Group application processing method and device, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN111224795B CN111224795B CN201911149753.8A CN201911149753A CN111224795B CN 111224795 B CN111224795 B CN 111224795B CN 201911149753 A CN201911149753 A CN 201911149753A CN 111224795 B CN111224795 B CN 111224795B
- Authority
- CN
- China
- Prior art keywords
- group
- invitation
- people
- inviteable
- target
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/02—Details
- H04L12/16—Arrangements for providing special services to substations
- H04L12/18—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast
- H04L12/1813—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast for computer conferences, e.g. chat rooms
- H04L12/1818—Conference organisation arrangements, e.g. handling schedules, setting up parameters needed by nodes to attend a conference, booking network resources, notifying involved parties
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/02—Details
- H04L12/16—Arrangements for providing special services to substations
- H04L12/18—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast
- H04L12/185—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast with management of multicast group membership
-
- 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/04—Real-time or near real-time messaging, e.g. instant messaging [IM]
-
- 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 disclosure relates to a method and a device for processing a group application, an electronic device and a storage medium. The method is applied to a server and comprises the following steps: receiving a group entry application initiated by a client based on a received group entry invitation, wherein the group entry application carries a target identifier representing the group entry invitation; acquiring the upper limit number and the current number of group members in the target group according to the target identification and the data of each group stored locally, and acquiring the remaining inviteable number of the group invitation; and determining whether the user is allowed to apply for entering the group through the entering group according to the current number of people, the upper limit number of people and the remaining inviteable number of people. According to the technical scheme provided by the embodiment of the disclosure, through the limitation on the total number of inviteable people invited by each group-entering invitation, the situation that part of group members invite more people to enter the group and occupy the resources of other group members can be avoided.
Description
Technical Field
The present disclosure relates to the field of computer software applications, and in particular, to a group entry application processing method and apparatus, an electronic device, and a storage medium.
Background
The current instant messaging software generally has a group sharing function, in the related technology, group members can share a group entering invitation to own social groups in the form of two-dimensional codes or links, and other users can more conveniently join the group through the group member sharing invitation.
However, such a scheme is prone to cause a problem of unbalanced user ratio, for example, if a group member first shares the group invitation and makes more friends join the group, the number of people may reach the upper limit of the group number due to too many people, and then even if another group member shares the group invitation, the friends of the other group member cannot enter the group, that is, the number of people who are invited to enter the group by 2 group members is greatly different. If the group administrator screens in a manual mode, more manpower and time are consumed, and the screening efficiency is low.
Disclosure of Invention
The present disclosure provides a method and an apparatus for processing a group joining application, an electronic device, and a storage medium, so as to at least solve the problem of unbalanced proportion of group users caused by group joining invitation in related technologies. The technical scheme of the disclosure is as follows:
according to a first aspect of the embodiments of the present disclosure, there is provided a method for processing a group entry application, applied to a server, the method including:
receiving a group entry application initiated by a client based on a received group entry invitation, wherein the group entry application carries a target identifier representing the group entry invitation;
acquiring the upper limit number and the current number of group members in the target group according to the target identification and the data of each group stored locally, and acquiring the remaining inviteable number of the group invitation; wherein, different group invitation can set different total inviteable people, and the total inviteable people is the initial value of the rest inviteable people;
and determining whether the user is allowed to apply for entering the group through the entering group according to the current number of people, the upper limit number of people and the remaining inviteable number of people.
In one possible implementation manner, the determining whether to allow the user to apply for the group entry via the group entry according to the current number of people, the upper limit number of people, and the remaining inviteable number of people includes:
in a case where the current number of people does not reach the upper limit number of people and the remaining inviteable number of people is not 0, it is determined that the user is allowed to apply for the affiliation via the affiliation, and the data of the target group stored locally is updated.
In one possible implementation, the updating the locally stored data of the target group includes:
adjusting the number of remaining inviteable people stored locally.
In one possible implementation, the target identifier characterizing the group invitation includes: the mark of the target group corresponding to the group invitation;
acquiring the upper limit number of people and the current number of people of group members in the target group according to the target identification and the data of each group stored locally, wherein the method comprises the following steps:
searching the data of the target group from the data of each group stored locally according to the identification of the target group;
and acquiring the upper limit number of people and the current number of people of the group members in the target group from the data of the target group.
In one possible implementation, the target identifier characterizing the group invitation includes: a target link address of the group invitation;
the obtaining the remaining number of inviteable people of the group invitation according to the target identification and the data of each group stored locally comprises:
searching the target link address in the link addresses of the group-entering invitation of each group stored locally;
and acquiring the number of the remaining inviteable persons stored corresponding to the target link address.
In one possible implementation, the method further includes:
under the condition that a new group invitation is determined to be generated, distributing the corresponding total number of inviteable people for the new group invitation according to the preset authority of the group member initiating the group invitation;
and storing the new group invitation into the data of the corresponding group.
In one possible implementation, the method further includes:
under the condition of receiving a group-entering invitation generation request, acquiring a group member identifier carried in the generation request;
determining whether the group member identification has a group entering invitation in effect or not based on the locally stored data of each group; if yes, a notice representing that the generation of the group-entering invitation is failed is returned.
In one possible implementation, the method further includes:
and in the case that the number of the remaining inviteable people is 0, notifying the group member initiating the group invitation that the group invitation is invalid.
According to a second aspect of the embodiments of the present disclosure, there is provided a device for processing a group entry application, which is applied to a server, the device including:
the receiving module is configured to execute a group entering application initiated by a receiving client based on the received group entering invitation, wherein the group entering application carries a target identifier representing the group entering invitation;
the acquisition module is configured to execute acquisition of the upper limit number and the current number of group members in the target group according to the target identification and the data of each group stored locally, and acquisition of the remaining inviteable number of the group invitation; wherein, different group invitation can set different total inviteable people, and the total inviteable people is the initial value of the rest inviteable people;
a determining module configured to determine whether to allow the user to apply for the group entry via the group entry according to the current number of people, the upper limit number of people and the remaining inviteable number of people.
In one possible implementation, the determining module includes:
an updating unit configured to perform, in a case where the current number of people does not reach the upper limit number of people and the remaining inviteable number of people is not 0, determining to allow a user to apply for an entry via the entry, and updating the data of the target group stored locally.
In one possible implementation, the updating unit is specifically configured to perform:
adjusting the number of remaining inviteable people stored locally.
In one possible implementation, the target identifier characterizing the group invitation includes: the mark of the target group corresponding to the group invitation;
the acquisition module comprises a first person acquisition unit configured to perform:
searching the data of the target group from the data of each group stored locally according to the identification of the target group;
and acquiring the upper limit number of people and the current number of people of the group members in the target group from the data of the target group.
In one possible implementation, the target identifier characterizing the group invitation includes: a target link address of the group invitation;
the acquisition module comprises a second people number acquisition unit configured to execute:
searching the target link address in the link addresses of the group-entering invitation of each group stored locally;
and acquiring the number of the remaining inviteable persons stored corresponding to the target link address.
In one possible implementation, the apparatus further includes an invitation generation module configured to perform:
under the condition that a new group invitation is determined to be generated, distributing the corresponding total number of inviteable people for the new group invitation according to the preset authority of the group member initiating the group invitation;
and storing the new group invitation into the data of the corresponding group.
In one possible implementation, the apparatus further includes an invitation determining module configured to perform:
under the condition of receiving a group-entering invitation generation request, acquiring a group member identifier carried in the generation request;
determining whether the group member identification has a group entering invitation in effect or not based on the locally stored data of each group; if yes, a notice representing that the generation of the group-entering invitation is failed is returned.
In one possible implementation, the apparatus further includes a failure notification module configured to perform:
and in the case that the number of the remaining inviteable people is 0, notifying the group member initiating the group invitation that the group invitation is invalid.
According to a third aspect of the embodiments of the present disclosure, there is provided an electronic apparatus including:
a processor;
a memory for storing the processor-executable instructions;
wherein the processor is configured to execute the executable instructions to implement the method of processing a request for enrollment applications as described in any one of the first aspect and possible implementations of the first aspect.
According to a fourth aspect of embodiments of the present disclosure, there is provided a storage medium, where instructions are executed by a processor of an electronic device, so that the electronic device can execute the group application processing method according to any one of the first aspect and possible implementations of the first aspect.
According to a fifth aspect of embodiments of the present disclosure, there is provided a computer program product comprising one or more instructions which, when executed by a processor of an electronic device, enable the electronic device to perform operations performed by the group application processing method of any one of the first aspect and possible implementations of the first aspect.
The technical scheme provided by the embodiment of the disclosure at least brings the following beneficial effects: after receiving the application for entering the group, the server determines whether to allow the user to apply for entering the group through the entering the group according to the values of the upper limit number of the group members in the group, the current number of the group members and the remaining inviteable number of the group invitation. The initial value of the remaining inviteable number of the group invitation is the total inviteable number distributed during the generation of the group invitation, and the resource occupation of other group members caused by the fact that a part of group members invite more than one group to enter the group can be avoided by limiting the total inviteable number of each group invitation.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the disclosure.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present disclosure and, together with the description, serve to explain the principles of the disclosure and are not to be construed as limiting the disclosure.
FIG. 1 is a flow diagram illustrating a method for processing a clustered application in accordance with an exemplary embodiment;
FIG. 2 is a schematic diagram illustrating one configuration of a device for processing a request for a group affiliation according to one exemplary embodiment;
FIG. 3 is a schematic diagram illustrating one configuration of an acquisition module in accordance with an exemplary embodiment;
FIG. 4 is a schematic diagram illustrating yet another configuration of a device for processing a request for a group affiliation according to an exemplary embodiment;
fig. 5 is a schematic diagram illustrating a structure of an electronic device according to an example embodiment.
Detailed Description
In order to make the technical solutions of the present disclosure better understood by those of ordinary skill in the art, the technical solutions in the embodiments of the present disclosure will be clearly and completely described below with reference to the accompanying drawings.
It should be noted that the terms "first," "second," and the like in the description and claims of the present disclosure and in the above-described drawings are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used is interchangeable under appropriate circumstances such that the embodiments of the disclosure described herein are capable of operation in sequences other than those illustrated or otherwise described herein. The implementations described in the exemplary embodiments below are not intended to represent all implementations consistent with the present disclosure. Rather, they are merely examples of apparatus and methods consistent with certain aspects of the present disclosure, as detailed in the appended claims.
Fig. 1 is a flowchart illustrating a method for processing a group application according to an exemplary embodiment, and referring to fig. 1, a method for processing a group application may include steps S11 to S14:
in step S11, a group joining application initiated by the client based on the received group joining invitation is received, where the group joining application carries a target identifier representing the group joining invitation.
In embodiments of the present disclosure, a group member of a group may request generation of an invitation to join a group.
For example, a group member may request to generate a group invitation by clicking a "group sharing" button, and a client used by the group member sends a group invitation generation request to the server in response to the trigger operation.
The server may generate the group entry invitation for the group member, for example, a unique and non-repetitive group entry invitation may be generated according to information such as the group identifier, the group member identifier, and the timestamp, and of course, the group entry invitation may also be generated according to or including other information, which is not limited in this embodiment.
After generating the invitation to join the group, the group member may share the invitation to other people, for example, send the invitation to friends through chat software or post the invitation to join the group through a social platform, and so on. Other users who receive the group joining invitation can operate the client to initiate a group joining application to the server.
In the embodiment of the present disclosure, the target identifier may specifically be in various forms, for example, the target identifier may be an identifier of a group member corresponding to the group invitation, an identifier of the group, and/or generation time; link addresses for group invitation may also be used; the unique identifier can be allocated to the group-entering invitation; and the specific form of the target identifier is not limited in this embodiment, and those skilled in the art can flexibly select the form according to actual use requirements.
In step S12, according to the target identifier and the data of each group stored locally, obtaining the upper limit number of people and the current number of people of group members in the target group, and obtaining the remaining inviteable number of the group invitation; wherein, different group invitation can set different total inviteable people, and the total inviteable people is the initial value of the rest inviteable people.
In the embodiment of the disclosure, the same total inviteable number can be set for different group invitation, or different total inviteable numbers can be set for different group invitation individually, and the total inviteable number is used as an initial value of the remaining inviteable number for limiting the number of people who subsequently enter a group through the group invitation, so that the number of people who invite different members can be limited by the scheme no matter how many group invitations are generated currently in a certain group, and fair resource distribution among the group members is ensured.
The server may locally store data for each group, such as an identification of the group, an upper limit number of people for the group, a current number of people for the group, an identification of each group member in the group, and a group invitation generated by each group member.
For example, the server may record any group invitation for the group through a table:
create table user_share_group{
id bigint auto_increment primary key,
a uid not null comment element 'group member id',
group _ id binary not null comment 'group id',
url varchar (255) not null comment 'link address',
status small not part 'state, 0 is valid, 1 bit is invalid',
count int not null,// how many people invited are supported in total
remaining _ cnt int not null,// how many people remain to be invited
create _ time data not null comment 'creation time',
expire _ time data not null comment 'expiration time'
}
As described in step S11, the target identifier may be specifically in various forms:
in one embodiment, the target identifier may be an identifier of a target group corresponding to the group invitation, such as a group ID. When the upper limit number of people and the current number of people of the group members in the target group are obtained, the data of the target group can be searched from the data of each group stored locally according to the identification of the target group, and then the upper limit number of people and the current number of people of the group members in the target group can be obtained from the data of the target group.
In another embodiment, the target identification may be a target link address of the group invitation. When the remaining inviteable people number of the group invitation is obtained, the target link address may be first searched in the link addresses of the group invitation of each locally stored group, and then the remaining inviteable people number stored corresponding to the target link address may be obtained.
It is understood that the link address may be in various forms, for example, a long URL, a short URL, a graphic code (such as a two-dimensional code), or other suitable forms, which is not limited in this embodiment.
In step S13, it is determined whether to allow the user to apply for the affiliation via the affiliation based on the current number of people, the upper limit number of people, and the remaining inviteable number of people.
In one embodiment, if the current number of people does not reach the upper limit number of people and the remaining inviteable number of people is not 0, it is determined that the user is allowed to apply for the affiliation via the affiliation.
Also, the data for the target group stored locally may also be updated, for example, to adjust the number of remaining inviteable people stored locally.
In another embodiment, if the current number of people has reached the upper limit number of people, or the number of remaining inviteable people is 0, or the current number of people has reached the upper limit number of people while the number of remaining inviteable people is 0, it is determined that the user is not allowed to apply for the affiliation via the affiliation.
It can be understood that, in the embodiment of the present disclosure, the order of obtaining the upper limit number and the current number of group members in the target group, and obtaining the remaining inviteable number of the group invitation, and the order of comparing the current number and the upper limit number, and comparing the size relationship between the remaining inviteable number and 0 are not limited, and those skilled in the art may flexibly set the order according to actual needs.
In one embodiment, if it is determined that the number of inviteable people remaining is 0, the group member who initiated the group invitation may be notified that the group invitation has expired. For example, after receiving the group joining application and acquiring the number of remaining inviteable persons, if the number of remaining inviteable persons is determined to be 0, the group members may be notified that the group joining invitation is invalid; for another example, after the server adjusts the number of the remaining inviteable persons stored locally (e.g., reduces the number of persons by one), and determines that the adjusted number is 0, the group members may be notified that the invitation to join the group is about to expire.
In another embodiment, in the invalidation mechanism of the group invitation, in addition to setting the total inviteable number and counting the remaining inviteable numbers, the creation time may be recorded and the invalidation time may be set. The creation time may be a time when the server generates the invitation connection, and the expiration time may be a time determined by a preset time point, such as 0 point on the next day, or a time determined by a preset time period, such as a time corresponding to the creation time +24 hours.
The server can also acquire the expiration time of the group entry invitation after receiving the group entry application, and if the expiration time is determined to be reached, the group entry invitation can still be determined to be expired even if the current number of people does not reach the upper limit number of people and the number of people capable of being invited is not 0, the user is not allowed to apply for group entry through the group entry, and the group members can be informed of the expiration of the group entry invitation.
As described in S11, the client sends an invitation to generate a group invitation to the server in response to the operation of generating the invitation to group by characterizing the group members.
In an embodiment, a server may obtain a group member identifier carried in a generation request when receiving a group invitation generation request, and determine whether the group member identifier has a group invitation in effect based on locally stored data of each group.
If not, indicating that all of the group members' group entry invitations have expired, a new group entry invitation may be generated for the group member.
If the group member exists, the group member currently has other effective group-entering invitations, the group member can invite other users to enter the group through the effective group-entering invitations, and the server returns a notice representing that the generation of the group-entering invitation fails to the client. That is, in this embodiment, any group member can only have 1 available group invitation, and only after the inviteable number of the group invitation is 0 and expires, the group member can generate a new group invitation. In this way, a single member may be prevented from inviting multiple people to a group by generating and sharing a more-to-group invitation.
In another embodiment, different permissions may be preset for different group members and different total inviteable people, i.e., an initial value of the remaining inviteable people for the newly-entered group invitation, may be assigned to different permissions.
For example, the authority may be set by the level of group members, and the authority of the group owner is the highest, the total inviteable number of each group invitation is 20, the authority of the group administrator is the second, the total inviteable number is 10, and the average member with the lowest authority is 4.
And under the condition that the server determines to generate a new group invitation, distributing the corresponding total number of inviteable people for the new group invitation according to the preset authority of the group member initiating the group invitation, and then storing the new group invitation into the data of the corresponding group.
The processing method of the grouped application provided by the present disclosure is described below with reference to a more specific example.
In a group of certain instant messaging software, a button for group sharing is set by default. After the group member a of a group clicks the button, the server will generate a unique and non-repeating URL according to the identity of the group user a, the timestamp, and the ID of the group, and for simplicity, the URL is presented in the form of a short link, which may be, for example: https:// kuaisou. com/join/AbAf57IER3 HwEcK.
After obtaining the URL, the group member A can share the URL to other people in some ways, and other people can perform group entering operation by clicking the URL.
The server can share the data of the URL through a table group member A:
create table user_share_group{
id bigint auto_increment primary key,
a uid binary not null comment 'user id',
group _ id binary not null comment 'group id',
url varchar (255) not null comment 'short link address',
status small not part 'state, 0 is valid, 1 bit is invalid',
count int not null,// how many people invited are supported in total
remaining _ cnt int not null,// how many people remain to be invited
create _ time data not null comment 'creation time',
expire _ time data not null comment 'expiration time'
}
If the group member A shares the URL to the user C, and the user C clicks the URL to initiate a group entry application, the group entry application can carry the URL.
After receiving the request for entering a group, the server may first check whether the number of people in the group has reached an upper limit.
If the request arrives, the user C can be directly refused to apply for group entry.
If the number of the remaining inviteable persons does not reach the upper limit, the server can further analyze the group entry application to analyze the URL carried in the group entry application, so that the remaining inviteable persons corresponding to the URL are inquired in the locally stored list item.
If the value of the number of the remaining inviteable people is more than 0, the number of the remaining inviteable people is reduced by one and then is updated to the database, and the user C is directly informed of the application of the group through the group, or the group administrator is informed of approving the application of the group of the user C.
If the value of the number of remaining inviteable people is equal to 0, the server can directly return the group entry failure to the user C after proving that the number of inviteable people of the URL is used up. At this time, the URL of group member a cannot invite any more invites to the group, and only a new URL can be regenerated.
When generating the group invitation URL for the group members, the total inviteable persons built in the URLs generated by different group members can be controlled by the level of the group members, for example, the administrator is 10 persons, the general person is 4 persons, the super administrator is not limited, and the like.
And only when the number of the rest inviteable persons of the URL reaches 0, the group member can regenerate a new group invitation URL, thereby ensuring that a plurality of group invitation members are not swiped by some group members to invite a plurality of users to enter the group.
Fig. 2 is a block diagram illustrating an apparatus for processing a group application according to an exemplary embodiment, which may include a receiving module 110, an obtaining module 120, and a determining module 130.
The receiving module 110 is configured to execute a group entry application initiated by a receiving client based on a received group entry invitation, where the group entry application carries a target identifier representing the group entry invitation;
an obtaining module 120 configured to perform obtaining an upper limit number of people and a current number of people of group members in a target group according to the target identifier and locally stored data of each group, and obtaining a remaining inviteable number of the group invitation; wherein, different group invitation can set different total inviteable people, and the total inviteable people is the initial value of the rest inviteable people;
a determining module 130 configured to determine whether to allow the user to apply for the group entry via the group entry according to the current number of people, the upper limit number of people, and the remaining inviteable number of people.
In one possible implementation, the determining module 130 includes:
an updating unit configured to perform, in a case where the current number of people does not reach the upper limit number of people and the remaining inviteable number of people is not 0, determining to allow a user to apply for an entry via the entry, and updating the data of the target group stored locally.
In one possible implementation, the updating unit is specifically configured to perform:
adjusting the number of remaining inviteable people stored locally.
In one possible implementation, the target identifier characterizing the group invitation includes: the mark of the target group corresponding to the group invitation;
referring to fig. 3, the acquiring module 120 includes a first person acquiring unit 121 configured to perform:
searching the data of the target group from the data of each group stored locally according to the identification of the target group;
and acquiring the upper limit number of people and the current number of people of the group members in the target group from the data of the target group.
In one possible implementation, the target identifier characterizing the group invitation includes: a target link address of the group invitation;
referring to fig. 3, the acquiring module 120 includes a second person number acquiring unit 122 configured to perform:
searching the target link address in the link addresses of the group-entering invitation of each group stored locally;
and acquiring the number of the remaining inviteable persons stored corresponding to the target link address.
In one possible implementation, referring to fig. 4, the apparatus further includes an invitation generation module 140 configured to perform:
under the condition that a new group invitation is determined to be generated, distributing the corresponding total number of inviteable people for the new group invitation according to the preset authority of the group member initiating the group invitation;
and storing the new group invitation into the data of the corresponding group.
In one possible implementation, referring to fig. 4, the apparatus further includes an invitation determining module 150 configured to perform:
under the condition of receiving a group-entering invitation generation request, acquiring a group member identifier carried in the generation request;
determining whether the group member identification has a group entering invitation in effect or not based on the locally stored data of each group; if yes, a notice representing that the generation of the group-entering invitation is failed is returned.
In one possible implementation, referring to fig. 4, the apparatus further comprises an invalidation notification module 160 configured to perform:
and in the case that the number of the remaining inviteable people is 0, notifying the group member initiating the group invitation that the group invitation is invalid.
It is understood that the first person number obtaining unit 121 and the second person number obtaining unit 122 may be configured in the obtaining module 120 at the same time as shown in fig. 3, or may be configured in the obtaining module 120 separately, and therefore the structure shown in fig. 3 should not be construed as a limitation to the embodiment of the present disclosure. The invitation generating module 140, the invitation judging module 150 and the invalidation notifying module 160 may be configured in the device at the same time as shown in fig. 4 or may be configured in the device separately as three independent modules, and therefore the configuration shown in fig. 4 should not be construed as limiting the embodiment of the present disclosure.
With regard to the apparatus in the above-described embodiment, the specific manner in which each module performs the operation has been described in detail in the embodiment related to the method, and will not be elaborated here.
FIG. 5 is a block diagram illustrating an electronic device in accordance with an example embodiment. For example, the electronic device 50 may be a mobile phone, a computer, a digital broadcast terminal, a messaging device, a game console, a tablet device, a medical device, an exercise device, a personal digital assistant, a server, and the like.
Referring to fig. 5, electronic device 50 may include one or more of the following components: processing components 510, memory 520, power components 530, multimedia components 540, audio components 550, input/output (I/O) interfaces 560, sensor components 570, and communication components 580.
The processing component 510 generally controls overall operation of the electronic device 50, such as operations associated with display, telephone calls, data communications, camera operations, and recording operations. Processing component 510 may include one or more processors 511 to execute instructions to perform all or a portion of the steps of the methods described above. Further, the processing component 510 can include one or more modules that facilitate interaction between the processing component 510 and other components. For example, the processing component 510 may include a multimedia module to facilitate interaction between the multimedia component 540 and the processing component 510.
The memory 520 is configured to store various types of data to support operations at the electronic device 50. Examples of such data include instructions for any application or method operating on the electronic device 50, contact data, phonebook data, messages, pictures, videos, and so forth. The memory 520 may be implemented by any type or combination of volatile or non-volatile memory devices, such as Static Random Access Memory (SRAM), electrically erasable programmable read-only memory (EEPROM), erasable programmable read-only memory (EPROM), programmable read-only memory (PROM), read-only memory (ROM), magnetic memory, flash memory, magnetic or optical disks.
The power supply component 530 provides power to the various components of the electronic device 50. The power components 530 may include a power management system, one or more power sources, and other components associated with generating, managing, and distributing power for the electronic device 50.
The multimedia component 540 includes a screen that provides an output interface between the electronic device 50 and the user. In some embodiments, the screen may include a Liquid Crystal Display (LCD) and a Touch Panel (TP). If the screen includes a touch panel, the screen may be implemented as a touch screen to receive an input signal from a user. The touch panel includes one or more touch sensors to sense touch, slide, and gestures on the touch panel. The touch sensor may not only sense the boundary of a touch or slide action, but also detect the duration and pressure associated with the touch or slide operation. In some embodiments, the multimedia component 540 includes a front facing camera and/or a rear facing camera. The front camera and/or the rear camera may receive external multimedia data when the electronic device 50 is in an operating mode, such as a shooting mode or a video mode. Each front camera and rear camera may be a fixed optical lens system or have a focal length and optical zoom capability.
The audio component 550 is configured to output and/or input audio signals. For example, the audio assembly 550 includes a Microphone (MIC) configured to receive external audio signals when the electronic device 50 is in an operational mode, such as a call mode, a recording mode, and a voice recognition mode. The received audio signal may further be stored in the memory 520 or transmitted via the communication component 580. In some embodiments, audio assembly 550 also includes a speaker for outputting audio signals.
The I/O interface 560 provides an interface between the processing component 510 and peripheral interface modules, which may be keyboards, click wheels, buttons, etc. These buttons may include, but are not limited to: a home button, a volume button, a start button, and a lock button.
The sensor assembly 570 includes one or more sensors for providing various aspects of status assessment for the electronic device 50. For example, the sensor assembly 570 may detect an open/closed state of the electronic device 50, the relative positioning of components, such as a display and keypad of the electronic device 50, the sensor assembly 570 may also detect a change in the position of the electronic device 50 or a component of the electronic device 50, the presence or absence of user contact with the electronic device 50, the orientation or acceleration/deceleration of the electronic device 50, and a change in the temperature of the electronic device 50. The sensor assembly 570 may include a proximity sensor configured to detect the presence of a nearby object without any physical contact. The sensor assembly 570 may also include a light sensor, such as a CMOS or CCD image sensor, for use in imaging applications. In some embodiments, the sensor assembly 570 may also include an acceleration sensor, a gyroscope sensor, a magnetic sensor, a pressure sensor, or a temperature sensor.
The communications component 580 is configured to facilitate communications between the electronic device 50 and other devices in a wired or wireless manner. The electronic device 50 may access a wireless network based on a communication standard, such as WiFi, a carrier network (such as 2G, 3G, 4G, or 5G), or a combination thereof. In an exemplary embodiment, the communication component 580 receives a broadcast signal or broadcast associated information from an external broadcast management system via a broadcast channel. In an exemplary embodiment, the communications component 580 further includes a Near Field Communication (NFC) module to facilitate short-range communications. For example, the NFC module may be implemented based on Radio Frequency Identification (RFID) technology, infrared data association (IrDA) technology, Ultra Wideband (UWB) technology, Bluetooth (BT) technology, and other technologies.
In an embodiment of the present disclosure, the electronic device 50 may be implemented by one or more Application Specific Integrated Circuits (ASICs), Digital Signal Processors (DSPs), Digital Signal Processing Devices (DSPDs), Programmable Logic Devices (PLDs), Field Programmable Gate Arrays (FPGAs), controllers, micro-controllers, microprocessors, or other electronic components for performing the above-described methods.
In an embodiment of the present disclosure, a non-transitory computer-readable storage medium comprising instructions, such as the memory 520 comprising instructions, executable by the processor 511 of the electronic device 50 to perform the method of the above-described group application process is also provided. For example, the non-transitory computer readable storage medium may be a ROM, a Random Access Memory (RAM), a CD-ROM, a magnetic tape, a floppy disk, an optical data storage device, and the like.
In an embodiment of the present disclosure, an application program is further provided, and when the application program is executed by a processor of an electronic device, the electronic device can execute the above-mentioned group application processing method to obtain the same technical effect.
In an embodiment of the present disclosure, a computer program product is further provided, which when executed by a processor of an electronic device, enables the electronic device to execute the above-mentioned group application processing method to obtain the same technical effect.
Alternatively, the storage medium may be a non-transitory computer readable storage medium, which may be, for example, a ROM, a Random Access Memory (RAM), a CD-ROM, a magnetic tape, a floppy disk, an optical data storage device, and the like.
Other embodiments of the disclosure will be apparent to those skilled in the art from consideration of the specification and practice of the disclosure disclosed herein. This application is intended to cover any variations, uses, or adaptations of the disclosure following, in general, the principles of the disclosure and including such departures from the present disclosure as come within known or customary practice within the art to which the disclosure pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the disclosure being indicated by the following claims.
It will be understood that the present disclosure is not limited to the precise arrangements described above and shown in the drawings and that various modifications and changes may be made without departing from the scope thereof. The scope of the present disclosure is limited only by the appended claims.
Claims (18)
1. A method for processing a group entry application, applied to a server, the method comprising:
receiving a group entry application initiated by a client based on a received group entry invitation, wherein the group entry application carries a target identifier representing the group entry invitation;
acquiring the upper limit number and the current number of group members in the target group according to the target identification and the data of each group stored locally, and acquiring the remaining inviteable number of the group invitation; wherein, different group invitation can set different total inviteable people, and the total inviteable people is the initial value of the rest inviteable people;
and determining whether the user is allowed to apply for entering the group through the entering group according to the current number of people, the upper limit number of people and the remaining inviteable number of people.
2. The method of claim 1, wherein determining whether to allow the user to apply for the affiliation via the affiliation based on the current number of people, the upper limit number of people, and the remaining inviteable number of people comprises:
in a case where the current number of people does not reach the upper limit number of people and the remaining inviteable number of people is not 0, it is determined that the user is allowed to apply for the affiliation via the affiliation, and the data of the target group stored locally is updated.
3. The method of claim 2, wherein the updating the locally stored data of the target group comprises:
adjusting the number of remaining inviteable people stored locally.
4. The method of claim 1,
the target identification characterizing the group entry invitation comprises: the mark of the target group corresponding to the group invitation;
acquiring the upper limit number of people and the current number of people of group members in the target group according to the target identification and the data of each group stored locally, wherein the method comprises the following steps:
searching the data of the target group from the data of each group stored locally according to the identification of the target group;
and acquiring the upper limit number of people and the current number of people of the group members in the target group from the data of the target group.
5. The method of claim 1,
the target identification characterizing the group entry invitation comprises: a target link address of the group invitation;
the obtaining the remaining number of inviteable people of the group invitation according to the target identification and the data of each group stored locally comprises:
searching the target link address in the link addresses of the group-entering invitation of each group stored locally;
and acquiring the number of the remaining inviteable persons stored corresponding to the target link address.
6. The method of claim 1, further comprising:
under the condition that a new group invitation is determined to be generated, distributing the corresponding total number of inviteable people for the new group invitation according to the preset authority of the group member initiating the group invitation;
and storing the new group invitation into the data of the corresponding group.
7. The method of claim 1, further comprising:
under the condition of receiving a group-entering invitation generation request, acquiring a group member identifier carried in the generation request;
determining whether the group member identification has a group entering invitation in effect or not based on the locally stored data of each group; if yes, a notice representing that the generation of the group-entering invitation is failed is returned.
8. The method of claim 1, further comprising:
and in the case that the number of the remaining inviteable people is 0, notifying the group member initiating the group invitation that the group invitation is invalid.
9. An apparatus for processing a group entry application, applied to a server, the apparatus comprising:
the receiving module is configured to execute a group entering application initiated by a receiving client based on the received group entering invitation, wherein the group entering application carries a target identifier representing the group entering invitation;
the acquisition module is configured to execute acquisition of the upper limit number and the current number of group members in the target group according to the target identification and the data of each group stored locally, and acquisition of the remaining inviteable number of the group invitation; wherein, different group invitation can set different total inviteable people, and the total inviteable people is the initial value of the rest inviteable people;
a determining module configured to determine whether to allow the user to apply for the group entry via the group entry according to the current number of people, the upper limit number of people and the remaining inviteable number of people.
10. The apparatus of claim 9, wherein the determining module comprises:
an updating unit configured to perform, in a case where the current number of people does not reach the upper limit number of people and the remaining inviteable number of people is not 0, determining to allow a user to apply for an entry via the entry, and updating the data of the target group stored locally.
11. The apparatus according to claim 10, wherein the updating unit is specifically configured to perform:
adjusting the number of remaining inviteable people stored locally.
12. The apparatus of claim 9,
the target identification characterizing the group entry invitation comprises: the mark of the target group corresponding to the group invitation;
the acquisition module comprises a first person acquisition unit configured to perform:
searching the data of the target group from the data of each group stored locally according to the identification of the target group;
and acquiring the upper limit number of people and the current number of people of the group members in the target group from the data of the target group.
13. The apparatus of claim 9,
the target identification characterizing the group entry invitation comprises: a target link address of the group invitation;
the acquisition module comprises a second people number acquisition unit configured to execute:
searching the target link address in the link addresses of the group-entering invitation of each group stored locally;
and acquiring the number of the remaining inviteable persons stored corresponding to the target link address.
14. The apparatus of claim 9, further comprising an invitation generation module configured to perform:
under the condition that a new group invitation is determined to be generated, distributing the corresponding total number of inviteable people for the new group invitation according to the preset authority of the group member initiating the group invitation;
and storing the new group invitation into the data of the corresponding group.
15. The apparatus of claim 9, further comprising an invitation determination module configured to perform:
under the condition of receiving a group-entering invitation generation request, acquiring a group member identifier carried in the generation request;
determining whether the group member identification has a group entering invitation in effect or not based on the locally stored data of each group; if yes, a notice representing that the generation of the group-entering invitation is failed is returned.
16. The apparatus of claim 9, further comprising an invalidation notification module configured to perform:
and in the case that the number of the remaining inviteable people is 0, notifying the group member initiating the group invitation that the group invitation is invalid.
17. An electronic device, comprising:
a processor;
a memory for storing the processor-executable instructions;
wherein the processor is configured to execute the executable instructions to implement the method of processing a claim to any of claims 1 to 8.
18. A storage medium having instructions that, when executed by a processor of an electronic device, enable the electronic device to perform the group application processing method of any one of claims 1 to 8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911149753.8A CN111224795B (en) | 2019-11-21 | 2019-11-21 | Group application processing method and device, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911149753.8A CN111224795B (en) | 2019-11-21 | 2019-11-21 | Group application processing method and device, electronic equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111224795A CN111224795A (en) | 2020-06-02 |
| CN111224795B true CN111224795B (en) | 2022-03-25 |
Family
ID=70829418
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911149753.8A Active CN111224795B (en) | 2019-11-21 | 2019-11-21 | Group application processing method and device, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111224795B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111555964A (en) * | 2020-04-30 | 2020-08-18 | 网易（杭州）网络有限公司 | Group member management method, electronic device and storage medium |
| CN112967145B (en) * | 2021-01-18 | 2024-03-26 | 北京达佳互联信息技术有限公司 | Group information generation method and device, electronic equipment and storage medium |
| CN115002065B (en) * | 2021-06-21 | 2023-09-19 | 中移互联网有限公司 | Method and device for establishing group, electronic equipment and storage medium |
| CN113542103B (en) * | 2021-06-22 | 2023-07-14 | 青岛海信移动通信技术有限公司 | Method and device for monitoring invitations of accounts in social communication group and mobile terminal |
| CN115774868A (en) * | 2021-09-06 | 2023-03-10 | 北京字节跳动网络技术有限公司 | Electronic certificate generation method and device, electronic equipment and readable storage medium |
| CN115297075B (en) * | 2022-07-06 | 2024-03-29 | 北京北信源软件股份有限公司 | Instant messaging method, device, equipment and storage medium based on target group |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101242588A (en) * | 2007-02-09 | 2008-08-13 | 华为技术有限公司 | Control method for session invitation, multi-party communication system, its server and originating terminal |
| CN105634930A (en) * | 2016-03-01 | 2016-06-01 | 腾讯科技（深圳）有限公司 | Method and device for inviting user to join session group |
Family Cites Families (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050004867A1 (en) * | 2003-05-16 | 2005-01-06 | Spector Eric Mason | Network-based donation management system |
| CN100413354C (en) * | 2006-03-03 | 2008-08-20 | 华为技术有限公司 | Method and system for increasing users in cluster session |
| US10069640B2 (en) * | 2012-12-05 | 2018-09-04 | Tencent Technology (Shenzhen) Company Limited | Methods and devices for adding new member to group through barcode scanning |
| CN104468145B (en) * | 2014-12-03 | 2018-03-16 | 华为技术有限公司 | The treating method and apparatus of group's message based on RCS |
| CN105847327B (en) * | 2016-03-14 | 2019-03-05 | 广州趣丸网络科技有限公司 | The method and its system for notifying and user being invited to rapidly join communication group |
| CN106453042B (en) * | 2016-09-29 | 2019-06-07 | 维沃移动通信有限公司 | A kind of information sharing method and mobile terminal |
| CN110365572A (en) * | 2018-04-08 | 2019-10-22 | 深圳凯茜微想科技有限公司 | A kind of methods, devices and systems of interaction |
| CN109348258A (en) * | 2018-09-20 | 2019-02-15 | 武汉斗鱼网络科技有限公司 | The anti-brush method, apparatus of user's interaction, server and medium based on live streaming platform |
| CN109347720A (en) * | 2018-09-26 | 2019-02-15 | 上海掌门科技有限公司 | It determines group member, send the method and apparatus that the request of group is added |
| CN110417845B (en) * | 2018-11-30 | 2021-08-03 | 腾讯科技（深圳）有限公司 | Data synchronization method, device and storage medium |
-
2019
- 2019-11-21 CN CN201911149753.8A patent/CN111224795B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101242588A (en) * | 2007-02-09 | 2008-08-13 | 华为技术有限公司 | Control method for session invitation, multi-party communication system, its server and originating terminal |
| CN105634930A (en) * | 2016-03-01 | 2016-06-01 | 腾讯科技（深圳）有限公司 | Method and device for inviting user to join session group |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111224795A (en) | 2020-06-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111224795B (en) | Group application processing method and device, electronic equipment and storage medium | |
| CN105069073B (en) | Contact information recommendation method and device | |
| CN106211159B (en) | Bluetooth-based identity recognition method and device | |
| CN110740091B (en) | Processing method and device for sharing message, electronic equipment and readable storage medium | |
| RU2642843C2 (en) | Method and device for processing recording contacts | |
| CN108111396B (en) | Method, device and equipment for sequencing conversation messages | |
| CN110737844B (en) | Data recommendation method and device, terminal equipment and storage medium | |
| CN112836198A (en) | Account login method and device, server, electronic equipment and storage medium | |
| CN112202582B (en) | Group establishing method and device, electronic equipment and storage medium | |
| CN112565527A (en) | Session state control method and device, electronic equipment and storage medium | |
| CN114721710A (en) | Version control method, version control device and storage medium | |
| CN109246184B (en) | Time information acquisition method and device and readable storage medium | |
| CN110690979B (en) | Group message processing method, device, server, client and storage medium | |
| CN110764847A (en) | User information processing method and device, electronic equipment and storage medium | |
| CN112256424A (en) | Virtual resource processing method, device and system, electronic equipment and storage medium | |
| CN107846481B (en) | Account management method and device | |
| CN111338971A (en) | Application testing method and device, electronic equipment and storage medium | |
| CN109948012B (en) | Serial number generation method and device and storage medium | |
| CN113901353A (en) | Information display method, device and system, electronic equipment and server | |
| CN108737523B (en) | Method and device for associating application module with account, hardware device and medium | |
| CN107295144B (en) | Method and device for deleting contact number | |
| CN107168693B (en) | Display method and device of screen locking interface | |
| CN106503133B (en) | Cloud disk data processing method and device | |
| CN111680248A (en) | Method and device for generating batch number of message pushed | |
| CN112580104B (en) | Authority management method, device, electronic equipment and storage medium |
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 |