WO2017118046A1 - 信息发送方法及装置 - Google Patents
信息发送方法及装置 Download PDFInfo
- Publication number
- WO2017118046A1 WO2017118046A1 PCT/CN2016/096657 CN2016096657W WO2017118046A1 WO 2017118046 A1 WO2017118046 A1 WO 2017118046A1 CN 2016096657 W CN2016096657 W CN 2016096657W WO 2017118046 A1 WO2017118046 A1 WO 2017118046A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- peer
- friend
- user
- prompt
- communication information
- Prior art date
Links
- 238000000034 method Methods 0.000 title claims abstract description 51
- 238000004891 communication Methods 0.000 claims abstract description 266
- 238000012217 deletion Methods 0.000 claims description 26
- 230000037430 deletion Effects 0.000 claims description 26
- 238000012790 confirmation Methods 0.000 claims description 20
- 238000012545 processing Methods 0.000 claims description 18
- 230000001186 cumulative effect Effects 0.000 claims description 11
- 230000000977 initiatory effect Effects 0.000 claims description 4
- 238000010586 diagram Methods 0.000 description 10
- 238000005516 engineering process Methods 0.000 description 6
- 230000003287 optical effect Effects 0.000 description 4
- 230000005236 sound signal Effects 0.000 description 4
- 230000001133 acceleration Effects 0.000 description 2
- 230000003993 interaction Effects 0.000 description 2
- 238000007726 management method Methods 0.000 description 2
- 230000004044 response Effects 0.000 description 2
- 230000001960 triggered effect Effects 0.000 description 2
- 230000006978 adaptation Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 238000003384 imaging method Methods 0.000 description 1
- 230000010365 information processing Effects 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 230000002093 peripheral effect Effects 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/104—Peer-to-peer [P2P] networks
- H04L67/1044—Group management mechanisms
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/01—Social networking
-
- 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]
- H04L51/046—Interoperability with other network applications or services
-
- 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/2866—Architectures; Arrangements
- H04L67/30—Profiles
- H04L67/306—User profiles
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/52—Network services specially adapted for the location of the user terminal
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04M—TELEPHONIC COMMUNICATION
- H04M1/00—Substation equipment, e.g. for use by subscribers
- H04M1/72—Mobile telephones; Cordless telephones, i.e. devices for establishing wireless links to base stations without route selection
- H04M1/724—User interfaces specially adapted for cordless or mobile telephones
- H04M1/72403—User interfaces specially adapted for cordless or mobile telephones with means for local support of applications that increase the functionality
- H04M1/7243—User interfaces specially adapted for cordless or mobile telephones with means for local support of applications that increase the functionality with interactive means for internal management of messages
Definitions
- the present disclosure relates to the field of information processing technologies, and in particular, to a method and an apparatus for transmitting information.
- the user adds a friend request by scanning a two-dimensional code in the communication application of the other party or searching for a communication account of the communication application of the other party, and if the user obtains After the QR code or communication account in the other party's communication application, if you forget to add, you can't complete the friend addition.
- Embodiments of the present disclosure provide an information transmitting method and apparatus.
- the technical solution is as follows:
- a method for transmitting information includes:
- the first friend adds a prompt according to the peer communication information, where the first friend adds a prompt for prompting the local user to add the peer user as a friend;
- the peer communication information includes: a communication account of the peer user, a two-dimensional code identifier corresponding to the communication account of the peer user, and a barcode identifier corresponding to the communication account of the peer user. At least one of the information;
- the local communication information includes: a communication account of the local user, a two-dimensional code identifier corresponding to the communication account of the local user, a barcode identifier corresponding to the communication account of the local user, and the local user. At least one of the contact information, the nickname corresponding to the communication account of the local user, the location of the local user, the date of birth of the local user, and the age of the local user.
- the method further includes:
- the method further includes:
- the method further includes:
- the peer end When it is detected that the peer end rejects the buddy addition request initiated by the local end according to the second buddy adding prompt, the refusal to add the prompt information is generated, and the obtained peer communication information is deleted.
- the deleting the obtained communication information of the peer end includes:
- the obtained peer communication information is deleted.
- the method further includes:
- an information transmitting apparatus including:
- a determining module configured to determine whether the peer communication information of the peer user is obtained
- a generating module configured to: when the peer communication information is obtained, generate a first friend adding a prompt according to the peer communication information, where the first friend adds a prompt to prompt the local user to add the peer user as a friend ;
- a sending module configured to send the local communication information to the peer end, so that the peer end generates a second friend adding a prompt according to the local end communication information, where the second friend adds a prompt for prompting the peer end
- the user adds the local user as a friend.
- the peer communication information includes: a communication account of the peer user, a two-dimensional code identifier corresponding to the communication account of the peer user, and a barcode identifier corresponding to the communication account of the peer user. At least one of the information;
- the local communication information includes: a communication account of the local user, a two-dimensional code identifier corresponding to the communication account of the local user, a barcode identifier corresponding to the communication account of the local user, and the local user. At least one of the contact information, the nickname corresponding to the communication account of the local user, the location of the local user, the date of birth of the local user, and the age of the local user.
- the apparatus further includes:
- An initiating module configured to add a request to the peer according to the first friend adding a prompt
- the receiving module is configured to receive a friend add request sent by the peer according to the second friend adding a prompt.
- the apparatus further includes:
- the first processing module is configured to establish a communication connection with the opposite end when the friend confirmation instruction for adding the request for the friend is detected, and send prompt information for allowing communication to the opposite end.
- the apparatus further includes:
- a second processing module configured to: when detecting that the peer end rejects the buddy addition request initiated by the local end according to the second buddy adding prompt, generate a refusal to add prompt information, and delete the obtained peer communication information .
- the second processing module comprises:
- a first determining submodule configured to determine whether the cumulative number of times the peer end rejects the friend add request initiated by the local end is greater than a preset number of times
- a first deleting submodule configured to delete the obtained peer communication information when the accumulated number of times is greater than the preset number of times
- Generating a submodule configured to generate a delete prompt instruction when the accumulated number of times is less than or equal to the preset number of times;
- a second deletion submodule configured to delete the obtained peer communication information when receiving the deletion confirmation instruction for the deletion prompt instruction.
- the apparatus further includes:
- a judging module configured to determine, after deleting the obtained peer communication information, whether the peer communication information is acquired again;
- the intercepting module is configured to: when the peer communication information is acquired again, and the friend addition request is initiated to the peer end, the friend addition request initiated again is intercepted, so that the peer end cannot receive the re-initiation The friend of the add request.
- an information transmitting apparatus including:
- a memory for storing processor executable instructions
- processor is configured to:
- the first friend adds a prompt according to the peer communication information, where the first friend adds a prompt for prompting the local user to add the peer user as a friend;
- the technical solution provided by the embodiment of the present disclosure may automatically generate a first friend adding prompt according to the peer communication information when the peer end obtains the peer communication information of the peer end, and send the local end communication information to the peer end. So that the peer end also has the local end user's local communication information, and then generates the second friend add prompt according to the local end communication information, so that both the local end and the opposite end can actively add the other party as a friend. Therefore, when the local user forgets to add the peer user as a friend when the peer user obtains the peer communication information of the peer user, the two parties cannot become friends.
- FIG. 1 is a flowchart of a method for transmitting information according to an exemplary embodiment.
- FIG. 2A is a flowchart of another method for transmitting information according to an exemplary embodiment.
- FIG. 2B is a flowchart of still another method for transmitting information according to an exemplary embodiment.
- FIG. 3A is a flowchart of still another method for transmitting information according to an exemplary embodiment.
- FIG. 3B is a flowchart of still another method for transmitting information according to an exemplary embodiment.
- FIG. 4 is a flowchart of still another method for transmitting information according to an exemplary embodiment.
- FIG. 5 is a block diagram of an information transmitting apparatus according to an exemplary embodiment.
- FIG. 6A is a block diagram of another information transmitting apparatus according to an exemplary embodiment.
- FIG. 6B is a block diagram of still another information transmitting apparatus according to an exemplary embodiment.
- FIG. 7A is a block diagram of still another information transmitting apparatus according to an exemplary embodiment.
- FIG. 7B is a block diagram of still another information transmitting apparatus according to an exemplary embodiment.
- FIG. 8A is a block diagram of still another information transmitting apparatus according to an exemplary embodiment.
- FIG. 8B is a block diagram of still another information transmitting apparatus according to an exemplary embodiment.
- FIG. 9 is a block diagram of still another information transmitting apparatus according to an exemplary embodiment.
- FIG. 10 is a block diagram suitable for an information transmitting apparatus, according to an exemplary embodiment.
- the user adds a friend request by scanning a two-dimensional code in the communication application of the other party or searching for a communication account of the communication application of the other party, and if the user obtains After the QR code or communication account in the other party's communication application, if you forget to add, you can't complete the friend addition.
- the embodiment of the present disclosure provides an information sending method, which may be used in an information sending program, a system, or a device, and the corresponding executing entity of the method may be a terminal carried by the user, as shown in FIG.
- the method includes steps S101 to S103:
- step S101 it is determined whether the peer communication information of the peer user is obtained.
- the peer communication information is used to uniquely identify the peer user, wherein the peer communication information may be: a communication account of the peer user, a QR code identifier corresponding to the communication account of the peer user, and a communication account of the peer user. At least one of the corresponding barcode identifiers, and the communication account is an account of a communication application used by the peer user.
- step S102 when the peer communication information is obtained, the first friend adds a prompt according to the peer communication information, and the first friend adds a prompt for prompting the local user to add the peer user as a friend;
- the first friend When the peer communication information of the peer user is obtained, the first friend may be automatically generated and added.
- the prompting is to prompt the local user to add the peer user as a friend, wherein the first friend adding prompt may be a virtual option button, or common prompt information (such as text, picture, etc.), for receiving When adding an operation, send a friend add request to the peer to request to add the peer user as a friend.
- the adding operation may be: clicking the first friend to add the prompt M1 times, sliding the preset adding track such as the track “A” (where A is the initial letter of Ask) in the interface where the first friend adds the prompt, when the first friend adds
- the prompt is a virtual option button
- the "Add" option in the virtual option button is triggered.
- the local communication information is sent to the peer end, so that the peer end generates a second friend adding prompt according to the local end communication information, and the second friend adds a prompt for prompting the peer user to add the local user as a friend.
- the local end communication information is sent to the peer end, so that the peer end also has the local end communication information of the local end user, and then the local end communication information is generated according to the local end communication information.
- the second friend adds a prompt, so that the local party or the peer end can actively add the other party as a friend, thereby avoiding forgetting to add the peer user as a friend when the local user obtains the peer communication information of the opposite user.
- the two sides can't be friends.
- the second friend adding prompt may also be a virtual option button, or common prompt information (such as text, picture, etc.), for sending a friend add request to the local end to request to add the local user when receiving the add operation.
- the adding operation may be: clicking the second friend to add the prompt N1 times, sliding the preset adding track such as the track “T” in the interface where the second friend adds the prompt (where T is the initial letter of the “pinning” pinyin), when When the second friend adds a prompt to the virtual option button (such as adding a button), the "add" option in the virtual option button is triggered.
- the peer communication information includes: at least one of a communication account of the peer user, a two-dimensional code identifier corresponding to the communication account of the peer user, and a barcode identifier corresponding to the communication account of the peer user;
- the local communication information includes: the communication account of the local user and the communication account of the local user.
- the local communication information includes information such as a communication account that can uniquely identify the local user, a two-dimensional code identifier corresponding to the communication account of the local user, and a barcode identifier corresponding to the communication account of the local user.
- the peer can automatically generate information based on the information.
- the second friend adds a prompt, and then adds the local end as a friend according to the second friend adding a prompt; in addition, the local communication information may further include the foregoing other information, so that the peer user can specify the identity of the local user. Understand, in order to assist the peer user to make the correct decision whether to add the local user as a friend, or whether to agree to add the local user as a friend, to avoid blindly adding the peer user, or blindly agree to add the local user as a friend.
- the method further includes:
- step S201 according to the first friend adding a prompt, initiating a friend add request to the peer;
- the method further includes:
- step S202 the receiving peer adds a friend addition request according to the second friend adding prompt.
- the local end may trigger the first friend to add a prompt to actively send a friend adding request to the peer end, and actively request to add the peer user as a friend;
- the receiving peer adds a request to the friend that is actively sent according to the second friend adding a prompt.
- the above method may further include:
- the local end actively sends the friend confirmation command to the opposite end in response to the friend addition request sent by the peer end, or the peer end sends the friend confirmation command to the local end in response to the friend addition request sent by the local end, as long as the friend confirmation is detected.
- the instruction indicates that the local user and the peer user agree to add each other as well. Friends, therefore, can automatically establish a communication connection with the peer, so that both parties can communicate, and at the same time, send a message to the peer to allow communication, so that the peer user knows that communication has been possible, so that the user can be timely Communicate.
- the communication window of both parties can be directly established, and the prompt information is displayed in the form of text in the communication window, or directly displayed in the form of voice or picture.
- the prompt information is sent to the peer system notification bar in the form of a notification.
- the above method may further include:
- the peer end When it is detected that the peer end rejects the buddy addition request initiated by the local end according to the second friend adding prompt, the refusal to add the prompt information is generated, and the obtained peer communication information is deleted.
- the peer end When it is detected that the peer end rejects the friend add request initiated by the local end according to the second friend adding prompt (that is, receives the friend reject command sent by the peer for the friend add request initiated by the local end), the peer end disagrees with the local friend. If the request is added, the refusal to add the prompt information may be automatically generated to prompt the local user to reject the local user as a friend, and the peer communication information obtained before the local end may be automatically deleted to prevent the local end from being The peer communication information and the first friend add a prompt and send a friend add request to the peer again to harass the peer user.
- the manner in which the peer end rejects the friend-initiated request initiated by the local end according to the second friend is prompted, for example, the user may click the second friend to add the prompt N2 times, and slide the preview in the interface where the second friend adds the prompt. Let's refuse to add a track such as the track "R" (where R is the first letter of Refuse), and when the second friend adds the prompt to the virtual option button, trigger the "deny" option in the virtual option button.
- the foregoing rejection manner may also be adopted, for example, the first friend may be prompted to add the prompt M2 times, and the second friend may add the prompt.
- the slide preset refuses to add a track such as the track "R" (where R is the first letter of the Refuse), and when the first friend adds the prompt to the virtual option button, triggers the "deny" option in the virtual option button, etc.
- the values of M1, M2, N1, and N2 are all different.
- the peer communication information obtained by the above deletion may be performed as:
- step S301 it is determined whether the cumulative number of times the peer rejects the friend addition request initiated by the local end is greater than a preset number of times;
- step S302 when the accumulated number of times is greater than the preset number of times, the obtained peer communication information is deleted;
- the opposite end rejects the friend of the local end. Adding the cumulative number of requests, and determining, according to the cumulative number of times, whether the local end has actually caused harassment to the opposite end. Specifically, if the accumulated number of times is greater than a preset number of times (such as 5 times), the opposite end is indeed unwilling Adding the local end to a friend, and the local end does cause harassment to the peer end, the communication information of the peer end obtained by the local end can be automatically deleted, so that the local end cannot be added according to the first friend conveniently and quickly.
- the prompt initiates a friend add request to the peer, and causes certain harassment to the peer.
- the peer communication information obtained by the above deletion may be performed as:
- step S303 when the accumulated number of times is less than or equal to the preset number of times, a delete prompt instruction is generated;
- step S304 when the deletion confirmation instruction for the deletion prompt instruction is received, the obtained peer communication information is deleted.
- the deletion prompt instruction may be actively generated, so that the local user can determine whether to delete the obtained Peer communication information
- the local user Upon receiving the deletion confirmation command, the local user agrees to delete the obtained communication information of the peer end, and deletes the communication information of the peer end obtained by the local end, so that the local end cannot conveniently and quickly initiate a friend to the opposite end. Add a request and cause some harassment to the peer.
- the method further includes:
- step S401 after deleting the obtained peer communication information, determining whether the peer communication information is acquired again;
- step S402 when the peer communication information is acquired again and the friend addition request is initiated to the peer again, the re-initiated friend addition request is intercepted, so that the peer cannot receive the re-initiated friend addition request.
- the deletion of the peer communication information obtained by the local end means that the peer end is unwilling to add the local end as a friend, and the local end causes harassment to the opposite end. Therefore, if the local end is detected again, the opposite end is acquired. If the communication information is sent to the peer again, the local device can automatically add the request to the peer to prevent the peer from receiving the friend addition request, so as to prevent the peer from continuously sending the harassment request to the peer, thereby improving the peer. Use experience.
- the embodiment of the present disclosure further provides an information sending apparatus.
- the apparatus includes:
- the determining module 501 is configured to determine whether the peer communication information of the peer user is obtained;
- the generating module 502 is configured to: when the peer communication information is obtained, generate a first friend adding prompt according to the peer communication information, where the first friend adding prompt is configured to prompt the local user to use the peer user Add as a friend;
- the sending module 503 is configured to send the local communication information to the opposite end, so that the opposite end generates a second friend adding prompt according to the local end communication information, where the second friend adding prompt is configured as a prompting location.
- the peer user adds the local user as a friend.
- the peer communication information includes: a communication account of the peer user, a two-dimensional code identifier corresponding to the communication account of the peer user, and a barcode identifier corresponding to the communication account of the peer user. At least one of the information;
- the local communication information includes: a communication account of the local user, and a communication of the local user.
- the two-dimensional code identifier corresponding to the account, the barcode identifier corresponding to the communication account of the local user, the contact information of the local user, the nickname corresponding to the communication account of the local user, and the location of the local user And at least one item of the date of birth of the local user and the age of the local user.
- the device further includes:
- the initiating module 601 is configured to: initiate a friend add request to the peer according to the first friend adding a prompt; or
- the device further includes:
- the receiving module 602 is configured to receive a friend add request sent by the peer according to the second friend adding a prompt.
- the device further includes:
- the first processing module 701 is configured to establish a communication connection with the opposite end when the friend confirmation instruction for adding the request for the friend is detected, and send prompt information for allowing communication to the opposite end.
- the device further includes:
- the second processing module 702 is configured to: when it is detected that the peer end rejects the buddy addition request initiated by the local end according to the second buddy addition prompt, generate a refusal to add prompt information, and delete the obtained peer end Communication information.
- the second processing module 702 includes:
- the first determining sub-module 7021 is configured to determine whether the cumulative number of times the peer end rejects the friend-initiated request initiated by the local end is greater than a preset number of times;
- the first deleting submodule 7022 is configured to delete the obtained peer communication information when the accumulated number of times is greater than the preset number of times; or
- the second processing module 702 includes:
- the generating submodule 7023 is configured to generate a delete prompt instruction when the accumulated number of times is less than or equal to the preset number of times;
- the second deletion sub-module 7024 is configured to delete the obtained peer communication information when receiving the deletion confirmation instruction for the deletion prompt instruction.
- the apparatus further includes:
- the determining module 901 is configured to: after deleting the obtained peer communication information, determine whether the peer communication information is acquired again;
- the intercepting module 902 is configured to intercept the re-initiated friend adding request when the peer communication information is acquired again and the friend adding request is initiated to the peer again, so that the peer cannot receive the The friend addition request initiated again.
- an information transmitting apparatus including:
- a memory for storing processor executable instructions
- processor is configured to:
- the first friend adds a prompt according to the peer communication information, where the first friend adds a prompt for prompting the local user to add the peer user as a friend;
- the above processor can also be configured to:
- the peer communication information includes: at least one of a communication account of the peer user, a two-dimensional code identifier corresponding to the communication account of the peer user, and a barcode identifier corresponding to the communication account of the peer user. ;
- the local communication information includes: a communication account of the local user, a two-dimensional code identifier corresponding to the communication account of the local user, a barcode identifier corresponding to the communication account of the local user, and the local user. At least one of the contact information, the nickname corresponding to the communication account of the local user, the location of the local user, the date of birth of the local user, and the age of the local user information.
- the above processor can also be configured to:
- the method further includes:
- the above processor can also be configured to:
- the method further includes:
- the above processor can also be configured to:
- the method further includes:
- the peer end When it is detected that the peer end rejects the buddy addition request initiated by the local end according to the second buddy adding prompt, the refusal to add the prompt information is generated, and the obtained peer communication information is deleted.
- the above processor can also be configured to:
- the obtained peer communication information is deleted.
- the above processor can also be configured to:
- the method further includes:
- FIG. 10 is a block diagram of an information transmitting apparatus 1000, which is applicable to a terminal device, according to an exemplary embodiment.
- device 1000 can be a mobile phone, a computer, a digital broadcast terminal, a messaging device, a gaming console, a tablet device, a medical device, a fitness device, a personal digital assistant, and the like.
- the apparatus 1000 may include one or at least two components: a processing component 1002, a memory 1004, a power component 1006, a multimedia component 1008, an audio component 1010, an input/output (I/O) interface 1012, and a sensor component 1014. And communication component 1016.
- Processing component 1002 typically controls the overall operation of device 1000, such as operations associated with display, telephone calls, data communications, camera operations, and recording operations.
- Processing component 1002 can include one or at least two processors 1020 to execute instructions to perform all or part of the steps of the above described methods.
- processing component 1002 can include one or at least two modules to facilitate interaction between component 1002 and other components.
- processing component 1002 can include a multimedia module to facilitate interaction between multimedia component 1008 and processing component 1002.
- the memory 1004 is configured to store various types of data to support operation at the device 1000. Examples of such data include instructions for any storage object or method for operation on device 1000, contact data, phone book data, messages, pictures, videos, and the like.
- the memory 1004 can be implemented by any type of volatile or non-volatile storage device, or a combination thereof, such as static random access memory (SRAM), electrically erasable programmable read only memory (EEPROM), erasable.
- SRAM static random access memory
- EEPROM electrically erasable programmable read only memory
- EPROM Programmable Read Only Memory
- PROM Programmable Read Only Memory
- ROM Read Only Memory
- Magnetic Memory Flash Memory
- Disk Disk
- Optical Disk Optical Disk
- Power component 1006 provides power to various components of device 1000.
- Power component 1006 can include a power management system, one or at least two power sources, and other components associated with generating, managing, and distributing power for device 1000.
- the multimedia component 1008 includes a screen between the device 1000 and a user that provides an output interface.
- the screen can include a liquid crystal display (LCD) and a touch panel (TP). If the screen includes a touch panel, the screen can be implemented as a touch screen to receive input signals from the user.
- the touch panel includes one or at least two touch sensors to sense touches, slides, and gestures on the touch panel. The touch sensor may sense not only the boundary of the touch or sliding action, but also the duration and pressure associated with the touch or slide operation.
- the multimedia component 1008 includes a front camera and/or a rear camera. When the device 1000 is in an operation mode, such as a shooting mode or a video mode, the front camera and/or the rear camera can receive external multimedia data. Each front and rear camera can be a fixed optical lens system or have focal length and optical zoom capabilities.
- the audio component 1010 is configured to output and/or input an audio signal.
- the audio component 1010 includes a microphone (MIC) that is configured to receive an external audio signal when the device 1000 is in an operational mode, such as a call mode, a recording mode, and a voice recognition mode.
- the received audio signal may be further stored in memory 1004 or transmitted via communication component 1016.
- the audio component 1010 also includes a speaker for outputting an audio signal.
- the I/O interface 1012 provides an interface between the processing component 1002 and the peripheral interface module, which may be a keyboard, a click wheel, a button, or the like. These buttons may include, but are not limited to, a home button, a volume button, a start button, and a lock button.
- Sensor assembly 1014 includes one or at least two sensors for providing device 1000 with various aspects of status assessment.
- sensor assembly 1014 can detect an open/closed state of device 1000, a relative positioning of components, such as the display and keypad of device 1000, and sensor component 1014 can also detect a change in position of one component of device 1000 or device 1000. The presence or absence of contact by the user with the device 1000, the orientation of the device 1000 or acceleration/deceleration and temperature changes of the device 1000.
- Sensor assembly 1014 can include a proximity sensor configured to detect the presence of nearby objects without any physical contact.
- Sensor assembly 1014 may also include a light sensor, such as a CMOS or CCD image sensor, for use in imaging applications.
- the sensor assembly 1014 can also include an acceleration sensor, a gyro sensor, a magnetic sensor, a pressure sensor, or a temperature sensor.
- Communication component 1016 is configured to facilitate wired or wireless communication between device 1000 and other devices.
- the device 1000 can access a wireless network based on a communication standard, such as WiFi, 2G or 3G, or a combination thereof.
- communication component 1016 receives broadcast signals or broadcast associated information from an external broadcast management system via a broadcast channel.
- the communication component 1016 also includes a near field communication (NFC) module to facilitate short range communication.
- NFC near field communication
- the NFC module can be implemented based on radio frequency identification (RFID) technology, infrared data association (IrDA) technology, ultra-wideband (UWB) technology, Bluetooth (BT) technology, and other technologies.
- RFID radio frequency identification
- IrDA infrared data association
- UWB ultra-wideband
- Bluetooth Bluetooth
- apparatus 1000 may be implemented by one or at least two application specific integrated circuits (ASICs), digital signal processors (DSPs), digital signal processing devices (DSPDs), programmable logic devices (PLDs), A gated array (FPGA), controller, microcontroller, microprocessor, or other electronic component implementation for performing the above methods.
- ASICs application specific integrated circuits
- DSPs digital signal processors
- DSPDs digital signal processing devices
- PLDs programmable logic devices
- FPGA gated array
- controller microcontroller, microprocessor, or other electronic component implementation for performing the above methods.
- non-transitory computer readable storage medium comprising instructions, such as a memory 1004 comprising instructions executable by processor 1020 of apparatus 1000 to perform the above method.
- 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, and an optical data storage device.
- a non-transitory computer readable storage medium when the instructions in the storage medium are executed by the processor of the apparatus 1000, enabling the apparatus 1000 to perform an information transmission method, including:
- the first friend adds a prompt according to the peer communication information, where the first friend adds a prompt for prompting the local user to add the peer user as a friend;
- the peer communication information includes: a communication account of the peer user, a two-dimensional code identifier corresponding to the communication account of the peer user, and a barcode identifier corresponding to the communication account of the peer user. At least one of the information;
- the local communication information includes: a communication account of the local user, a two-dimensional code identifier corresponding to the communication account of the local user, a barcode identifier corresponding to the communication account of the local user, and the local user. At least one of the contact information, the nickname corresponding to the communication account of the local user, the location of the local user, the date of birth of the local user, and the age of the local user.
- the method further includes:
- the method further includes:
- the method further includes:
- the peer end When it is detected that the peer end rejects the buddy addition request initiated by the local end according to the second buddy adding prompt, the refusal to add the prompt information is generated, and the obtained peer communication information is deleted.
- the deleting the obtained communication information of the peer end includes:
- the obtained peer communication information is deleted.
- the method further includes:
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Business, Economics & Management (AREA)
- Computing Systems (AREA)
- Theoretical Computer Science (AREA)
- General Business, Economics & Management (AREA)
- Physics & Mathematics (AREA)
- Primary Health Care (AREA)
- Marketing (AREA)
- Human Resources & Organizations (AREA)
- Strategic Management (AREA)
- Tourism & Hospitality (AREA)
- General Health & Medical Sciences (AREA)
- Economics (AREA)
- General Physics & Mathematics (AREA)
- Health & Medical Sciences (AREA)
- Human Computer Interaction (AREA)
- Mathematical Physics (AREA)
- Telephone Function (AREA)
- Information Transfer Between Computers (AREA)
Abstract
本公开是关于信息发送方法及装置。该方法包括:确定是否获取到对端用户的对端通讯信息;当获取到所述对端通讯信息时,根据所述对端通讯信息生成第一好友添加提示;向所述对端发送本端通讯信息,以使所述对端根据所述本端通讯信息生成第二好友添加提示,所述第二好友添加提示用于提示所述对端用户将所述本端用户添加为好友。该技术方案,在本端获取到对端用户的对端通讯信息时,可以根据该对端通讯信息自动生成第一好友添加提示,并向该对端发送本端通讯信息,以使该对端同样具有本端用户的本端通讯信息,进而根据该本端通讯信息生成该第二好友添加提示,这样,无论是本端或者对端,均可以主动地添加对方为好友,从而避免当本端用户在获取到对端用户的对端通讯信息而忘记添加对端用户为好友时,双方无法成为好友。
Description
本申请基于申请号为201610012033.7、申请日为2016年01月08日的中国专利申请提出,并要求该中国专利申请的优先权,该中国专利申请的全部内容在此引入本申请作为参考。
本公开涉及信息处理技术领域,尤其涉及信息发送方法及装置。
目前,用户在通过通讯应用程序添加好友时,均是通过扫描对方通讯应用程序中的二维码、或者搜索对方通讯应用程序的通讯账号来发送好友请求进而实现好友添加的,而如果用户获取到对方通讯应用程序中的二维码或通讯账号后,如果忘了添加,则无法完成好友添加。
发明内容
本公开实施例提供了信息发送方法及装置。所述技术方案如下:
根据本公开实施例的第一方面,提供一种信息发送方法,包括:
确定是否获取到对端用户的对端通讯信息;
当获取到所述对端通讯信息时,根据所述对端通讯信息生成第一好友添加提示,所述第一好友添加提示用于提示本端用户将对端用户添加为好友;
向所述对端发送本端通讯信息,以使所述对端根据所述本端通讯信息生成第二好友添加提示,所述第二好友添加提示用于提示所述对端用户将所述本端用户添加为好友。
在一个实施例中,所述对端通讯信息包括:所述对端用户的通讯账号、所述对端用户的通讯账号对应的二维码标识、所述对端用户的通讯账号对应的条形码标识中的至少一项信息;
所述本端通讯信息包括:所述本端用户的通讯账号、所述本端用户的通讯账号对应的二维码标识、所述本端用户的通讯账号对应的条形码标识、所述本端用户的联系方式、所述本端用户的通讯账号对应的昵称、所述本端用户的所在地、所述本端用户的出生日期、所述本端用户的年龄中的至少一项信息。
在一个实施例中,所述方法还包括:
根据所述第一好友添加提示,向所述对端发起好友添加请求;或者
接收所述对端根据所述第二好友添加提示,发送的好友添加请求。
在一个实施例中,所述方法还包括:
当监测到针对所述好友添加请求的好友确认指令时,建立与所述对端之间的通讯连接,并向所述对端发送允许通讯的提示信息。
在一个实施例中,所述方法还包括:
当监测到所述对端根据所述第二好友添加提示拒绝所述本端发起的好友添加请求时,生成拒绝添加提示信息,并删除获得的所述对端通讯信息。
在一个实施例中,所述删除获得的所述对端通讯信息,包括:
确定所述对端拒绝所述本端发起的好友添加请求的累计次数是否大于预设次数;
当所述累计次数大于所述预设次数时,删除获得的所述对端通讯信息;或者
当所述累计次数小于或等于所述预设次数时,生成删除提示指令;
当接收到针对所述删除提示指令的删除确认指令时,删除获得的所述对端通讯信息。
在一个实施例中,所述方法还包括:
在删除获得的所述对端通讯信息之后,判断是否再次获取到所述对端通讯信息;
当再次获取到所述对端通讯信息、且再次向所述对端发起好友添加请求
时,拦截再次发起的所述好友添加请求,以使所述对端无法接收到再次发起的所述好友添加请求。
根据本公开实施例的第二方面,提供一种信息发送装置,包括:
确定模块,用于确定是否获取到对端用户的对端通讯信息;
生成模块,用于当获取到所述对端通讯信息时,根据所述对端通讯信息生成第一好友添加提示,所述第一好友添加提示用于提示本端用户将对端用户添加为好友;
发送模块,用于向所述对端发送本端通讯信息,以使所述对端根据所述本端通讯信息生成第二好友添加提示,所述第二好友添加提示用于提示所述对端用户将所述本端用户添加为好友。
在一个实施例中,所述对端通讯信息包括:所述对端用户的通讯账号、所述对端用户的通讯账号对应的二维码标识、所述对端用户的通讯账号对应的条形码标识中的至少一项信息;
所述本端通讯信息包括:所述本端用户的通讯账号、所述本端用户的通讯账号对应的二维码标识、所述本端用户的通讯账号对应的条形码标识、所述本端用户的联系方式、所述本端用户的通讯账号对应的昵称、所述本端用户的所在地、所述本端用户的出生日期、所述本端用户的年龄中的至少一项信息。
在一个实施例中,所述装置还包括:
发起模块,用于根据所述第一好友添加提示,向所述对端发起好友添加请求;或者
接收模块,用于接收所述对端根据所述第二好友添加提示,发送的好友添加请求。
在一个实施例中,所述装置还包括:
第一处理模块,用于当监测到针对所述好友添加请求的好友确认指令时,建立与所述对端之间的通讯连接,并向所述对端发送允许通讯的提示信息。
在一个实施例中,所述装置还包括:
第二处理模块,用于当监测到所述对端根据所述第二好友添加提示拒绝所述本端发起的好友添加请求时,生成拒绝添加提示信息,并删除获得的所述对端通讯信息。
在一个实施例中,所述第二处理模块包括:
第一确定子模块,用于确定所述对端拒绝所述本端发起的好友添加请求的累计次数是否大于预设次数;
第一删除子模块,用于当所述累计次数大于所述预设次数时,删除获得的所述对端通讯信息;或者
生成子模块,用于当所述累计次数小于或等于所述预设次数时,生成删除提示指令;
第二删除子模块,用于当接收到针对所述删除提示指令的删除确认指令时,删除获得的所述对端通讯信息。
在一个实施例中,所述装置还包括:
判断模块,用于在删除获得的所述对端通讯信息之后,判断是否再次获取到所述对端通讯信息;
拦截模块,用于当再次获取到所述对端通讯信息、且再次向所述对端发起好友添加请求时,拦截再次发起的所述好友添加请求,以使所述对端无法接收到再次发起的所述好友添加请求。
根据本公开实施例的第三方面,提供了一种信息发送装置,包括:
处理器;
用于存储处理器可执行指令的存储器;
其中,所述处理器被配置为:
确定是否获取到对端用户的对端通讯信息;
当获取到所述对端通讯信息时,根据所述对端通讯信息生成第一好友添加提示,所述第一好友添加提示用于提示本端用户将对端用户添加为好友;
向所述对端发送本端通讯信息,以使所述对端根据所述本端通讯信息生成第二好友添加提示,所述第二好友添加提示用于提示所述对端用户将所述本端用户添加为好友。
本公开的实施例提供的技术方案可以包括以下有益效果:
本公开的实施例提供的技术方案,在本端获取到对端用户的对端通讯信息时,可以根据该对端通讯信息自动生成第一好友添加提示,并向该对端发送本端通讯信息,以使该对端同样具有本端用户的本端通讯信息,进而根据该本端通讯信息生成该第二好友添加提示,这样,无论是本端或者对端,均可以主动地添加对方为好友,从而避免当本端用户在获取到对端用户的对端通讯信息而忘记添加对端用户为好友时,双方无法成为好友。
应当理解的是,以上的一般描述和后文的细节描述仅是示例性和解释性的,并不能限制本公开。
此处的附图被并入说明书中并构成本说明书的一部分,示出了符合本公开的实施例,并与说明书一起用于解释本公开的原理。
图1是根据一示例性实施例示出的一种信息发送方法的流程图。
图2A是根据一示例性实施例示出的另一种信息发送方法的流程图。
图2B是根据一示例性实施例一示出的又一种信息发送方法的流程图。
图3A是根据一示例性实施例一示出的再一种信息发送方法的流程图。
图3B是根据一示例性实施例一示出的再一种信息发送方法的流程图。
图4是根据一示例性实施例一示出的再一种信息发送方法的流程图。
图5是根据一示例性实施例示出的一种信息发送装置的框图。
图6A是根据一示例性实施例示出的另一种信息发送装置的框图。
图6B是根据一示例性实施例示出的又一种信息发送装置的框图。
图7A是根据一示例性实施例示出的再一种信息发送装置的框图。
图7B是根据一示例性实施例示出的再一种信息发送装置的框图。
图8A是根据一示例性实施例示出的再一种信息发送装置的框图。
图8B是根据一示例性实施例示出的再一种信息发送装置的框图。
图9是根据一示例性实施例示出的再一种信息发送装置的框图。
图10是根据一示例性实施例示出的适用于信息发送装置的框图。
这里将详细地对示例性实施例进行说明,其示例表示在附图中。下面的描述涉及附图时,除非另有表示,不同附图中的相同数字表示相同或相似的要素。以下示例性实施例中所描述的实施方式并不代表与本公开相一致的所有实施方式。相反,它们仅是与如所附权利要求书中所详述的、本公开的一些方面相一致的装置和方法的例子。
目前,用户在通过通讯应用程序添加好友时,均是通过扫描对方通讯应用程序中的二维码、或者搜索对方通讯应用程序的通讯账号来发送好友请求进而实现好友添加的,而如果用户获取到对方通讯应用程序中的二维码或通讯账号后,如果忘了添加,则无法完成好友添加。
为了解决上述技术问题,本公开实施例提供了一种信息发送方法,该方法可用于信息发送程序、系统或装置中,且该方法对应的执行主体可以是用户携带的终端,如图1所示,该方法包括步骤S101至步骤S103:
在步骤S101中,确定是否获取到对端用户的对端通讯信息;
其中,对端通讯信息用于唯一标识对端用户,其中,该对端通讯信息可以是:对端用户的通讯账号、对端用户的通讯账号对应的二维码标识、对端用户的通讯账号对应的条形码标识中的至少一项信息,且通讯账号是对端用户使用的某个通讯应用程序的账号。
在步骤S102中,当获取到对端通讯信息时,根据对端通讯信息生成第一好友添加提示,第一好友添加提示用于提示本端用户将对端用户添加为好友;
在获取到对端用户的对端通讯信息时,可以自动生成该第一好友添加提
示,以提示本端用户可将该对端用户添加为好友,其中,该第一好友添加提示可以是一个虚拟选项按键、或者普通的提示信息(如文字、图片等),用于在接收到添加操作时,向对端发送好友添加请求,以请求添加对端用户为好友。
该添加操作可以是点击该第一好友添加提示M1次、在第一好友添加提示所在界面中滑动预设添加轨迹如轨迹“A”(其中,A是Ask的首字母)、当第一好友添加提示为虚拟选项按键时,触发该虚拟选项按键中的“添加”选项等。
在步骤S103中,向对端发送本端通讯信息,以使对端根据本端通讯信息生成第二好友添加提示,第二好友添加提示用于提示对端用户将本端用户添加为好友。
在本端获取到对端用户的对端通讯信息时,通过向该对端发送本端通讯信息,使得该对端同样具有本端用户的本端通讯信息,进而根据该本端通讯信息生成该第二好友添加提示,这样,无论是本端或者对端,均可以主动地添加对方为好友,从而避免当本端用户在获取到对端用户的对端通讯信息而忘记添加对端用户为好友时,双方无法成为好友。
该第二好友添加提示也可以是一个虚拟选项按键、或者普通的提示信息(如文字、图片等),用于在接收到添加操作时,向本端发送好友添加请求,以请求添加本端用户为好友。该添加操作可以是点击该第二好友添加提示N1次、在第二好友添加提示所在界面中滑动预设添加轨迹如轨迹“T”(其中,T是“添”的拼音的首字母)、当第二好友添加提示为虚拟选项按键(如添加按钮)时,触发该虚拟选项按键中的“添加”选项等。
在一个实施例中,对端通讯信息包括:对端用户的通讯账号、对端用户的通讯账号对应的二维码标识、对端用户的通讯账号对应的条形码标识中的至少一项信息;
本端通讯信息包括:本端用户的通讯账号、本端用户的通讯账号对应的
二维码标识、本端用户的通讯账号对应的条形码标识、本端用户的联系方式、本端用户的通讯账号对应的昵称、本端用户的所在地、本端用户的出生日期、本端用户的年龄中的至少一项信息。
本端通讯信息包括能够唯一标识本端用户的通讯账号、本端用户的通讯账号对应的二维码标识、本端用户的通讯账号对应的条形码标识等信息,对端可根据这些信息,自动生成该第二好友添加提示,进而根据该第二好友添加提示可将该本端添加为好友;另外,本端通讯信息还可以包括上述其他信息,从而使对端用户能够对本端用户的身份进行详细了解,以便于协助对端用户作出是否将本端用户添加为好友、或者是否同意添加本端用户为好友的正确决定,避免对端用户盲目添加、或者盲目同意添加本端用户为好友。
如图2A所示,在一个实施例中,方法还包括:
在步骤S201中,根据第一好友添加提示,向对端发起好友添加请求;或者
如图2B所示,在一个实施例中,方法还包括:
在步骤S202中,接收对端根据第二好友添加提示,发送的好友添加请求。
在生成第一好友添加提示和第二好友添加提示之后,本端可触发该第一好友添加提示,以主动向该对端发送好友添加请求,主动请求添加对端用户为好友;或者
接收对端根据该第二好友添加提示,主动发送的好友添加请求。
在一个实施例中,上述方法还可包括:
当监测到针对好友添加请求的好友确认指令时,建立与对端之间的通讯连接,并向对端发送允许通讯的提示信息。
无论是本端响应对端发送的好友添加请求而向对端主动发送该好友确认指令,还是对端响应本端发送的好友添加请求而向本端发送该好友确认指令,只要监测到该好友确认指令,就说明本端用户和对端用户同意添加对方为好
友,因而,可以自动建立与对端的通讯连接,以使双方能够进行通讯,同时,向对端发送允许通讯的提示信息,以使对端用户知晓已经能够进行通讯了,从而及时与本端用户进行通讯。
另外,向对端发送允许通讯的提示信息的方式有多种:例如:可以直接建立双方的通讯窗口,并在通讯窗口中以文字的形式显示该提示信息,或者直接以语音或者图片的形式显示该提示信息,或者将该提示信息以通知的形式发送至对端的系统通知栏中。
在一个实施例中,上述方法还可包括:
当监测到对端根据第二好友添加提示拒绝本端发起的好友添加请求时,生成拒绝添加提示信息,并删除获得的对端通讯信息。
当监测到对端根据该第二好友添加提示拒绝本端发起的好友添加请求(即接收到对端针对本端发起的好友添加请求发送的好友拒绝指令)时,说明对端不同意本端的好友添加请求,则可以自动生成拒绝添加提示信息,以提示本端用户该对端用户拒绝将本端用户添加为好友,同时可以自动删除本端之前获得的对端通讯信息,以防止本端根据该对端通讯信息和第一好友添加提示而再次向对端发送好友添加请求而骚扰到对端用户。
其中,对端根据该第二好友添加提示拒绝该本端发起的好友添加请求的方式有很多,例如:可以是点击该第二好友添加提示N2次、在第二好友添加提示所在界面中滑动预设拒绝添加轨迹如轨迹“R”(其中,R是Refuse的首字母)、当第二好友添加提示为虚拟选项按键时,触发该虚拟选项按键中的“拒绝”选项等。
另外,当本端根据该第一好友添加提示拒绝该对端发送的好友添加请求时,也可以采用上述拒绝方式,例如:可以是点击该第一好友添加提示M2次、在第二好友添加提示所在界面中滑动预设拒绝添加轨迹如轨迹“R”(其中,R是Refuse的首字母)、当第一好友添加提示为虚拟选项按键时,触发该虚拟选项按键中的“拒绝”选项等,另外,上述M1、M2、N1、N2的取值均
不同。
如图3A所示,在一个实施例中,上述删除获得的对端通讯信息可被执行为:
在步骤S301中,确定对端拒绝本端发起的好友添加请求的累计次数是否大于预设次数;
在步骤S302中,当累计次数大于预设次数时,删除获得的对端通讯信息;
为了防止误删除本端获得的对端的通讯信息,而给本端带来不必要的麻烦和不便,在删除本端获得的对端的通讯信息之前,还可以仔细确定该对端拒绝该本端的好友添加请求的累计次数,进而根据该累计次数具体确定该本端是否确实已对该对端造成骚扰,具体地,如果该累计次数大于预设次数(如5次),说明该对端确实不愿意添加该本端为好友,而该本端也确实已对该对端造成骚扰,则可以自动删除该本端获得的对端的通讯信息,以使本端无法方便、快速地根据该第一好友添加提示向该对端发起好友添加请求,而对该对端造成一定的骚扰。
或者
如图3B所示,在一个实施例中,上述删除获得的对端通讯信息可被执行为:
在步骤S303中,当累计次数小于或等于预设次数时,生成删除提示指令;
在步骤S304中,当接收到针对删除提示指令的删除确认指令时,删除获得的对端通讯信息。
当累计次数小于或等于预设次数时,也无法否定该本端就没有对该对端造成骚扰,为了避免误操作,可以主动生成删除提示指令,以使本端用户自主确定是否删除获得的该对端通讯信息;
在接收到该删除确认指令时,说明本端用户同意删除获得的该对端通讯信息,则删除该本端获得的对端的通讯信息,以使本端无法方便、快速地向该对端发起好友添加请求,而对该对端造成一定的骚扰。
如图4所示,在一个实施例中,方法还包括:
在步骤S401中,在删除获得的对端通讯信息之后,判断是否再次获取到对端通讯信息;
在步骤S402中,当再次获取到对端通讯信息、且再次向对端发起好友添加请求时,拦截再次发起的好友添加请求,以使对端无法接收到再次发起的好友添加请求。
由于删除该本端获得的对端通讯信息本就意味着该对端不愿意添加该本端为好友、本端以对该对端造成骚扰,因而,如果检测到该本端再次获取到对端通讯信息、且本端再次向对端发起好友添加请求,则可以自动拦截该好友添加请求,以避免对端接收到好友添加请求,从而避免对端不断给对端发送骚扰请求,从而提高对端的使用体验。
当然,在拦截该好友添加请求时,还可以向用户确认是否拦截,以避免误拦截。
对应本公开实施例提供的上述信息发送方法,本公开实施例还提供一种信息发送装置,如图5所示,该装置包括:
确定模块501,被配置为确定是否获取到对端用户的对端通讯信息;
生成模块502,被配置为当获取到所述对端通讯信息时,根据所述对端通讯信息生成第一好友添加提示,所述第一好友添加提示被配置为提示本端用户将对端用户添加为好友;
发送模块503,被配置为向所述对端发送本端通讯信息,以使所述对端根据所述本端通讯信息生成第二好友添加提示,所述第二好友添加提示被配置为提示所述对端用户将所述本端用户添加为好友。
在一个实施例中,所述对端通讯信息包括:所述对端用户的通讯账号、所述对端用户的通讯账号对应的二维码标识、所述对端用户的通讯账号对应的条形码标识中的至少一项信息;
所述本端通讯信息包括:所述本端用户的通讯账号、所述本端用户的通
讯账号对应的二维码标识、所述本端用户的通讯账号对应的条形码标识、所述本端用户的联系方式、所述本端用户的通讯账号对应的昵称、所述本端用户的所在地、所述本端用户的出生日期、所述本端用户的年龄中的至少一项信息。
如图6A所示,在一个实施例中,所述装置还包括:
发起模块601,被配置为根据所述第一好友添加提示,向所述对端发起好友添加请求;或者
如图6B所示,在一个实施例中,所述装置还包括:
接收模块602,被配置为接收所述对端根据所述第二好友添加提示,发送的好友添加请求。
如图7A所示,在一个实施例中,所述装置还包括:
第一处理模块701,被配置为当监测到针对所述好友添加请求的好友确认指令时,建立与所述对端之间的通讯连接,并向所述对端发送允许通讯的提示信息。
如图7B所示,在一个实施例中,所述装置还包括:
第二处理模块702,被配置为当监测到所述对端根据所述第二好友添加提示拒绝所述本端发起的好友添加请求时,生成拒绝添加提示信息,并删除获得的所述对端通讯信息。
如图8A所示,在一个实施例中,所述第二处理模块702包括:
第一确定子模块7021,被配置为确定所述对端拒绝所述本端发起的好友添加请求的累计次数是否大于预设次数;
第一删除子模块7022,被配置为当所述累计次数大于所述预设次数时,删除获得的所述对端通讯信息;或者
如图8B所示,在一个实施例中,所述第二处理模块702包括:
生成子模块7023,被配置为当所述累计次数小于或等于所述预设次数时,生成删除提示指令;
第二删除子模块7024,被配置为当接收到针对所述删除提示指令的删除确认指令时,删除获得的所述对端通讯信息。
如图9所示,在一个实施例中,所述装置还包括:
判断模块901,被配置为在删除获得的所述对端通讯信息之后,判断是否再次获取到所述对端通讯信息;
拦截模块902,被配置为当再次获取到所述对端通讯信息、且再次向所述对端发起好友添加请求时,拦截再次发起的所述好友添加请求,以使所述对端无法接收到再次发起的所述好友添加请求。
根据本公开实施例的第三方面,提供一种信息发送装置,包括:
处理器;
用于存储处理器可执行指令的存储器;
其中,处理器被配置为:
确定是否获取到对端用户的对端通讯信息;
当获取到所述对端通讯信息时,根据所述对端通讯信息生成第一好友添加提示,所述第一好友添加提示用于提示本端用户将对端用户添加为好友;
向所述对端发送本端通讯信息,以使所述对端根据所述本端通讯信息生成第二好友添加提示,所述第二好友添加提示用于提示所述对端用户将所述本端用户添加为好友。
上述处理器还可被配置为:
所述对端通讯信息包括:所述对端用户的通讯账号、所述对端用户的通讯账号对应的二维码标识、所述对端用户的通讯账号对应的条形码标识中的至少一项信息;
所述本端通讯信息包括:所述本端用户的通讯账号、所述本端用户的通讯账号对应的二维码标识、所述本端用户的通讯账号对应的条形码标识、所述本端用户的联系方式、所述本端用户的通讯账号对应的昵称、所述本端用户的所在地、所述本端用户的出生日期、所述本端用户的年龄中的至少一项
信息。
上述处理器还可被配置为:
所述方法还包括:
根据所述第一好友添加提示,向所述对端发起好友添加请求;或者
接收所述对端根据所述第二好友添加提示,发送的好友添加请求。
上述处理器还可被配置为:
所述方法还包括:
当监测到针对所述好友添加请求的好友确认指令时,建立与所述对端之间的通讯连接,并向所述对端发送允许通讯的提示信息。
上述处理器还可被配置为:
所述方法还包括:
当监测到所述对端根据所述第二好友添加提示拒绝所述本端发起的好友添加请求时,生成拒绝添加提示信息,并删除获得的所述对端通讯信息。
上述处理器还可被配置为:
所述删除获得的所述对端通讯信息,包括:
确定所述对端拒绝所述本端发起的好友添加请求的累计次数是否大于预设次数;
当所述累计次数大于所述预设次数时,删除获得的所述对端通讯信息;或者
当所述累计次数小于或等于所述预设次数时,生成删除提示指令;
当接收到针对所述删除提示指令的删除确认指令时,删除获得的所述对端通讯信息。
上述处理器还可被配置为:
所述方法还包括:
在删除获得的所述对端通讯信息之后,判断是否再次获取到所述对端通讯信息;
当再次获取到所述对端通讯信息、且再次向所述对端发起好友添加请求时,拦截再次发起的所述好友添加请求,以使所述对端无法接收到再次发起的所述好友添加请求。
图10是根据一示例性实施例示出的一种用于信息发送装置1000的框图,该装置适用于终端设备。例如,装置1000可以是移动电话,计算机,数字广播终端,消息收发设备,游戏控制台,平板设备,医疗设备,健身设备,个人数字助理等。
参照图10,装置1000可以包括以下一个或至少两个组件:处理组件1002,存储器1004,电源组件1006,多媒体组件1008,音频组件1010,输入/输出(I/O)的接口1012,传感器组件1014,以及通信组件1016。
处理组件1002通常控制装置1000的整体操作,诸如与显示,电话呼叫,数据通信,相机操作和记录操作相关联的操作。处理组件1002可以包括一个或至少两个处理器1020来执行指令,以完成上述的方法的全部或部分步骤。此外,处理组件1002可以包括一个或至少两个模块,便于处理组件1002和其他组件之间的交互。例如,处理组件1002可以包括多媒体模块,以方便多媒体组件1008和处理组件1002之间的交互。
存储器1004被配置为存储各种类型的数据以支持在设备1000的操作。这些数据的示例包括用于在装置1000上操作的任何存储对象或方法的指令,联系人数据,电话簿数据,消息,图片,视频等。存储器1004可以由任何类型的易失性或非易失性存储设备或者它们的组合实现,如静态随机存取存储器(SRAM),电可擦除可编程只读存储器(EEPROM),可擦除可编程只读存储器(EPROM),可编程只读存储器(PROM),只读存储器(ROM),磁存储器,快闪存储器,磁盘或光盘。
电源组件1006为装置1000的各种组件提供电力。电源组件1006可以包括电源管理系统,一个或至少两个电源,及其他与为装置1000生成、管理和分配电力相关联的组件。
多媒体组件1008包括在所述装置1000和用户之间的提供一个输出接口的屏幕。在一些实施例中,屏幕可以包括液晶显示器(LCD)和触摸面板(TP)。如果屏幕包括触摸面板,屏幕可以被实现为触摸屏,以接收来自用户的输入信号。触摸面板包括一个或至少两个触摸传感器以感测触摸、滑动和触摸面板上的手势。所述触摸传感器可以不仅感测触摸或滑动动作的边界,而且还检测与所述触摸或滑动操作相关的持续时间和压力。在一些实施例中,多媒体组件1008包括一个前置摄像头和/或后置摄像头。当设备1000处于操作模式,如拍摄模式或视频模式时,前置摄像头和/或后置摄像头可以接收外部的多媒体数据。每个前置摄像头和后置摄像头可以是一个固定的光学透镜系统或具有焦距和光学变焦能力。
音频组件1010被配置为输出和/或输入音频信号。例如,音频组件1010包括一个麦克风(MIC),当装置1000处于操作模式,如呼叫模式、记录模式和语音识别模式时,麦克风被配置为接收外部音频信号。所接收的音频信号可以被进一步存储在存储器1004或经由通信组件1016发送。在一些实施例中,音频组件1010还包括一个扬声器,用于输出音频信号。
I/O接口1012为处理组件1002和外围接口模块之间提供接口,上述外围接口模块可以是键盘,点击轮,按钮等。这些按钮可包括但不限于:主页按钮、音量按钮、启动按钮和锁定按钮。
传感器组件1014包括一个或至少两个传感器,用于为装置1000提供各个方面的状态评估。例如,传感器组件1014可以检测到设备1000的打开/关闭状态,组件的相对定位,例如所述组件为装置1000的显示器和小键盘,传感器组件1014还可以检测装置1000或装置1000一个组件的位置改变,用户与装置1000接触的存在或不存在,装置1000方位或加速/减速和装置1000的温度变化。传感器组件1014可以包括接近传感器,被配置用来在没有任何的物理接触时检测附近物体的存在。传感器组件1014还可以包括光传感器,如CMOS或CCD图像传感器,用于在成像应用中使用。在一些实施例中,
该传感器组件1014还可以包括加速度传感器,陀螺仪传感器,磁传感器,压力传感器或温度传感器。
通信组件1016被配置为便于装置1000和其他设备之间有线或无线方式的通信。装置1000可以接入基于通信标准的无线网络,如WiFi,2G或3G,或它们的组合。在一个示例性实施例中,通信组件1016经由广播信道接收来自外部广播管理系统的广播信号或广播相关信息。在一个示例性实施例中,所述通信组件1016还包括近场通信(NFC)模块,以促进短程通信。例如,在NFC模块可基于射频识别(RFID)技术,红外数据协会(IrDA)技术,超宽带(UWB)技术,蓝牙(BT)技术和其他技术来实现。
在示例性实施例中,装置1000可以被一个或至少两个应用专用集成电路(ASIC)、数字信号处理器(DSP)、数字信号处理设备(DSPD)、可编程逻辑器件(PLD)、现场可编程门阵列(FPGA)、控制器、微控制器、微处理器或其他电子组件实现,用于执行上述方法。
在示例性实施例中,还提供了一种包括指令的非临时性计算机可读存储介质,例如包括指令的存储器1004,上述指令可由装置1000的处理器1020执行以完成上述方法。例如,所述非临时性计算机可读存储介质可以是ROM、随机存取存储器(RAM)、CD-ROM、磁带、软盘和光数据存储设备等。
一种非临时性计算机可读存储介质,当所述存储介质中的指令由上述装置1000的处理器执行时,使得上述装置1000能够执行一种信息发送方法,包括:
确定是否获取到对端用户的对端通讯信息;
当获取到所述对端通讯信息时,根据所述对端通讯信息生成第一好友添加提示,所述第一好友添加提示用于提示本端用户将对端用户添加为好友;
向所述对端发送本端通讯信息,以使所述对端根据所述本端通讯信息生成第二好友添加提示,所述第二好友添加提示用于提示所述对端用户将所述本端用户添加为好友。
在一个实施例中,所述对端通讯信息包括:所述对端用户的通讯账号、所述对端用户的通讯账号对应的二维码标识、所述对端用户的通讯账号对应的条形码标识中的至少一项信息;
所述本端通讯信息包括:所述本端用户的通讯账号、所述本端用户的通讯账号对应的二维码标识、所述本端用户的通讯账号对应的条形码标识、所述本端用户的联系方式、所述本端用户的通讯账号对应的昵称、所述本端用户的所在地、所述本端用户的出生日期、所述本端用户的年龄中的至少一项信息。
在一个实施例中,所述方法还包括:
根据所述第一好友添加提示,向所述对端发起好友添加请求;或者
接收所述对端根据所述第二好友添加提示,发送的好友添加请求。
在一个实施例中,所述方法还包括:
当监测到针对所述好友添加请求的好友确认指令时,建立与所述对端之间的通讯连接,并向所述对端发送允许通讯的提示信息。
在一个实施例中,所述方法还包括:
当监测到所述对端根据所述第二好友添加提示拒绝所述本端发起的好友添加请求时,生成拒绝添加提示信息,并删除获得的所述对端通讯信息。
在一个实施例中,所述删除获得的所述对端通讯信息,包括:
确定所述对端拒绝所述本端发起的好友添加请求的累计次数是否大于预设次数;
当所述累计次数大于所述预设次数时,删除获得的所述对端通讯信息;或者
当所述累计次数小于或等于所述预设次数时,生成删除提示指令;
当接收到针对所述删除提示指令的删除确认指令时,删除获得的所述对端通讯信息。
在一个实施例中,所述方法还包括:
在删除获得的所述对端通讯信息之后,判断是否再次获取到所述对端通讯信息;
当再次获取到所述对端通讯信息、且再次向所述对端发起好友添加请求时,拦截再次发起的所述好友添加请求,以使所述对端无法接收到再次发起的所述好友添加请求。
本领域技术人员在考虑说明书及实践这里公开的公开后,将容易想到本公开的其它实施方案。本申请旨在涵盖本公开的任何变型、用途或者适应性变化,这些变型、用途或者适应性变化遵循本公开的一般性原理并包括本公开未公开的本技术领域中的公知常识或惯用技术手段。说明书和实施例仅被视为示例性的,本公开的真正范围和精神由下面的权利要求指出。
应当理解的是,本公开并不局限于上面已经描述并在附图中示出的精确结构,并且可以在不脱离其范围进行各种修改和改变。本公开的范围仅由所附的权利要求来限制。
Claims (15)
- 一种信息发送方法,其特征在于,包括:确定是否获取到对端用户的对端通讯信息;当获取到所述对端通讯信息时,根据所述对端通讯信息生成第一好友添加提示,所述第一好友添加提示用于提示本端用户将对端用户添加为好友;向所述对端发送本端通讯信息,以使所述对端根据所述本端通讯信息生成第二好友添加提示,所述第二好友添加提示用于提示所述对端用户将所述本端用户添加为好友。
- 根据权利要求1所述的方法,其特征在于,所述对端通讯信息包括:所述对端用户的通讯账号、所述对端用户的通讯账号对应的二维码标识、所述对端用户的通讯账号对应的条形码标识中的至少一项信息;所述本端通讯信息包括:所述本端用户的通讯账号、所述本端用户的通讯账号对应的二维码标识、所述本端用户的通讯账号对应的条形码标识、所述本端用户的联系方式、所述本端用户的通讯账号对应的昵称、所述本端用户的所在地、所述本端用户的出生日期、所述本端用户的年龄中的至少一项信息。
- 根据权利要求1或2所述的方法,其特征在于,所述方法还包括:根据所述第一好友添加提示,向所述对端发起好友添加请求;或者接收所述对端根据所述第二好友添加提示,发送的好友添加请求。
- 根据权利要求3所述的方法,其特征在于,所述方法还包括:当监测到针对所述好友添加请求的好友确认指令时,建立与所述对端之间的通讯连接,并向所述对端发送允许通讯的提示信息。
- 根据权利要求3所述的方法,其特征在于,所述方法还包括:当监测到所述对端根据所述第二好友添加提示拒绝所述本端发起的好友 添加请求时,生成拒绝添加提示信息,并删除获得的所述对端通讯信息。
- 根据权利要求5所述的方法,其特征在于,所述删除获得的所述对端通讯信息,包括:确定所述对端拒绝所述本端发起的好友添加请求的累计次数是否大于预设次数;当所述累计次数大于所述预设次数时,删除获得的所述对端通讯信息;或者当所述累计次数小于或等于所述预设次数时,生成删除提示指令;当接收到针对所述删除提示指令的删除确认指令时,删除获得的所述对端通讯信息。
- 根据权利要求5或6所述的方法,其特征在于,所述方法还包括:在删除获得的所述对端通讯信息之后,判断是否再次获取到所述对端通讯信息;当再次获取到所述对端通讯信息、且再次向所述对端发起好友添加请求时,拦截再次发起的所述好友添加请求,以使所述对端无法接收到再次发起的所述好友添加请求。
- 一种信息发送装置,其特征在于,包括:确定模块,用于确定是否获取到对端用户的对端通讯信息;生成模块,用于当获取到所述对端通讯信息时,根据所述对端通讯信息生成第一好友添加提示,所述第一好友添加提示用于提示本端用户将对端用户添加为好友;发送模块,用于向所述对端发送本端通讯信息,以使所述对端根据所述本端通讯信息生成第二好友添加提示,所述第二好友添加提示用于提示所述对端用户将所述本端用户添加为好友。
- 根据权利要求8所述的装置,其特征在于,所述对端通讯信息包括:所述对端用户的通讯账号、所述对端用户的通 讯账号对应的二维码标识、所述对端用户的通讯账号对应的条形码标识中的至少一项信息;所述本端通讯信息包括:所述本端用户的通讯账号、所述本端用户的通讯账号对应的二维码标识、所述本端用户的通讯账号对应的条形码标识、所述本端用户的联系方式、所述本端用户的通讯账号对应的昵称、所述本端用户的所在地、所述本端用户的出生日期、所述本端用户的年龄中的至少一项信息。
- 根据权利要求8或9所述的装置,其特征在于,所述装置还包括:发起模块,用于根据所述第一好友添加提示,向所述对端发起好友添加请求;或者接收模块,用于接收所述对端根据所述第二好友添加提示,发送的好友添加请求。
- 根据权利要求10所述的装置,其特征在于,所述装置还包括:第一处理模块,用于当监测到针对所述好友添加请求的好友确认指令时,建立与所述对端之间的通讯连接,并向所述对端发送允许通讯的提示信息。
- 根据权利要求10所述的装置,其特征在于,所述装置还包括:第二处理模块,用于当监测到所述对端根据所述第二好友添加提示拒绝所述本端发起的好友添加请求时,生成拒绝添加提示信息,并删除获得的所述对端通讯信息。
- 根据权利要求12所述的装置,其特征在于,所述第二处理模块包括:第一确定子模块,用于确定所述对端拒绝所述本端发起的好友添加请求的累计次数是否大于预设次数;第一删除子模块,用于当所述累计次数大于所述预设次数时,删除获得的所述对端通讯信息;或者生成子模块,用于当所述累计次数小于或等于所述预设次数时,生成删 除提示指令;第二删除子模块,用于当接收到针对所述删除提示指令的删除确认指令时,删除获得的所述对端通讯信息。
- 根据权利要求12或13所述的装置,其特征在于,所述装置还包括:判断模块,用于在删除获得的所述对端通讯信息之后,判断是否再次获取到所述对端通讯信息;拦截模块,用于当再次获取到所述对端通讯信息、且再次向所述对端发起好友添加请求时,拦截再次发起的所述好友添加请求,以使所述对端无法接收到再次发起的所述好友添加请求。
- 一种信息发送装置,其特征在于,包括:处理器;用于存储处理器可执行指令的存储器;其中,所述处理器被配置为:确定是否获取到对端用户的对端通讯信息;当获取到所述对端通讯信息时,根据所述对端通讯信息生成第一好友添加提示,所述第一好友添加提示用于提示本端用户将对端用户添加为好友;向所述对端发送本端通讯信息,以使所述对端根据所述本端通讯信息生成第二好友添加提示,所述第二好友添加提示用于提示所述对端用户将所述本端用户添加为好友。
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201610012033.7 | 2016-01-08 | ||
CN201610012033.7A CN105704214A (zh) | 2016-01-08 | 2016-01-08 | 信息发送方法及装置 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2017118046A1 true WO2017118046A1 (zh) | 2017-07-13 |
Family
ID=56227069
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/CN2016/096657 WO2017118046A1 (zh) | 2016-01-08 | 2016-08-25 | 信息发送方法及装置 |
Country Status (4)
Country | Link |
---|---|
US (1) | US10263925B2 (zh) |
EP (1) | EP3190561A1 (zh) |
CN (1) | CN105704214A (zh) |
WO (1) | WO2017118046A1 (zh) |
Families Citing this family (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN105704214A (zh) | 2016-01-08 | 2016-06-22 | 北京小米移动软件有限公司 | 信息发送方法及装置 |
JP6864477B2 (ja) * | 2017-01-06 | 2021-04-28 | 任天堂株式会社 | 情報処理装置、情報処理システム、情報処理方法及びプログラム |
CN110149269A (zh) * | 2019-05-30 | 2019-08-20 | 华为技术有限公司 | 一种通信方法、服务器和通信系统 |
CN112822089B (zh) * | 2019-11-15 | 2023-06-30 | 上海连尚网络科技有限公司 | 用于添加好友的方法和设备 |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN103078830A (zh) * | 2011-10-25 | 2013-05-01 | 阿里巴巴集团控股有限公司 | 网址信息提供及分享方法、好友添加方法、以及相应设备 |
CN105704214A (zh) * | 2016-01-08 | 2016-06-22 | 北京小米移动软件有限公司 | 信息发送方法及装置 |
Family Cites Families (10)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20070275733A1 (en) * | 2006-03-03 | 2007-11-29 | David Vismons | Method for providing certain information |
CN101079790A (zh) * | 2007-02-13 | 2007-11-28 | 腾讯科技(深圳)有限公司 | 娱乐平台中添加好友的方法和系统 |
US8010602B2 (en) * | 2008-08-28 | 2011-08-30 | Microsoft Corporation | Leveraging communications to identify social network friends |
CN102122282A (zh) | 2010-01-12 | 2011-07-13 | 腾讯数码(天津)有限公司 | 存储社会性网络服务内容的方法、装置和系统 |
CN102510551B (zh) * | 2011-09-30 | 2015-06-03 | 奇智软件(北京)有限公司 | 一种移动通讯工具中好友自动推荐的方法及装置 |
CN103117914B (zh) * | 2011-11-16 | 2016-05-25 | 腾讯科技(深圳)有限公司 | 基于即时通信工具的好友推荐方法及系统 |
CN103188131B (zh) * | 2011-12-29 | 2016-08-03 | 北京神州泰岳软件股份有限公司 | 即时通信客户端上的好友推荐方法和装置 |
CN103248555B (zh) * | 2012-02-08 | 2015-05-13 | 腾讯科技(深圳)有限公司 | 添加好友的方法及装置 |
CN102831202A (zh) * | 2012-08-08 | 2012-12-19 | 中兴通讯股份有限公司 | 一种向社交网站用户推送推荐好友的方法和系统 |
US9883346B2 (en) * | 2014-06-19 | 2018-01-30 | Deutsche Telekom Ag | Method and system for obtaining distanced audio by a portable device |
-
2016
- 2016-01-08 CN CN201610012033.7A patent/CN105704214A/zh active Pending
- 2016-08-25 WO PCT/CN2016/096657 patent/WO2017118046A1/zh active Application Filing
- 2016-11-10 US US15/347,793 patent/US10263925B2/en active Active
- 2016-12-23 EP EP16206783.9A patent/EP3190561A1/en not_active Ceased
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN103078830A (zh) * | 2011-10-25 | 2013-05-01 | 阿里巴巴集团控股有限公司 | 网址信息提供及分享方法、好友添加方法、以及相应设备 |
CN105704214A (zh) * | 2016-01-08 | 2016-06-22 | 北京小米移动软件有限公司 | 信息发送方法及装置 |
Also Published As
Publication number | Publication date |
---|---|
CN105704214A (zh) | 2016-06-22 |
US20170201477A1 (en) | 2017-07-13 |
EP3190561A1 (en) | 2017-07-12 |
US10263925B2 (en) | 2019-04-16 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
KR101884543B1 (ko) | 경보 방법 및 디바이스 | |
CN104506410B (zh) | 即时通讯的方法和装置 | |
WO2016183992A1 (zh) | 对账户与设备的控制关系进行管理的方法、装置和系统 | |
WO2016192323A1 (zh) | 视频通信方法及装置 | |
WO2015180384A1 (zh) | 一种处理儿童模式的方法和装置 | |
WO2016173245A1 (zh) | 权限管理方法和装置 | |
WO2017101497A1 (zh) | 设备控制方法及装置 | |
CN106453052B (zh) | 消息交互方法及装置 | |
EP3179397A1 (en) | Methods and devices for managing automatic parallel login and logout in several applications | |
WO2016015403A1 (zh) | 一种接入wi-fi网络的方法及装置 | |
EP3145124A1 (en) | Method and device for releasing connection | |
WO2017092441A1 (zh) | 名片信息获取方法及装置 | |
RU2643805C2 (ru) | Способ получения рекомендательной информации, терминал и сервер | |
WO2017177595A1 (zh) | 数据迁移方法及装置 | |
CN108173744B (zh) | 信息处理方法及设备 | |
WO2017118046A1 (zh) | 信息发送方法及装置 | |
WO2016173246A1 (zh) | 基于云名片的电话呼叫方法及装置 | |
CN104360875B (zh) | 隐私模式启动方法和装置 | |
WO2017071081A1 (zh) | 拨打电话的方法及装置 | |
CN109842543B (zh) | 即时通信方法及装置、即时通信消息的保存方法及装置 | |
WO2018058598A1 (zh) | 异常信息提示方法及装置 | |
CN111865767B (zh) | 即时通讯中非直接监听电话的用户展示方法、装置、服务器、客户端、终端与存储介质 | |
WO2017185544A1 (zh) | 获取信息的方法、装置及系统 | |
CN106651341A (zh) | 在线支付方法及装置 | |
CN111865769A (zh) | 即时通讯工具依据通话记录添加联系人的方法及其装置、服务器、客户端、终端和存储介质 |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 16883176 Country of ref document: EP Kind code of ref document: A1 |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
122 | Ep: pct application non-entry in european phase |
Ref document number: 16883176 Country of ref document: EP Kind code of ref document: A1 |