CN117369761A - Method, device, electronic equipment, medium and program product for wheat connecting treatment - Google Patents

Abstract

The disclosure relates to a method, a device, an electronic device, a medium and a program product for processing linked wheat, which can improve the state processing efficiency of linked wheat PK. The method comprises the following steps: receiving a state change input for indicating to add a second ligature state based on the first ligature state during execution of the ligature processing operation indicated by the first ligature state; responding to the state change input, and determining a target identifier according to a first identifier corresponding to the first wheat connecting state and a second identifier corresponding to the second wheat connecting state, wherein the target identifier is used for indicating a target wheat connecting state, and the target wheat connecting state is a superposition state of the first wheat connecting state and the second wheat connecting state; and executing the target wheat connecting processing operation indicated by the target identifier according to the target identifier.

Description

Method, device, electronic equipment, medium and program product for wheat connecting treatment

Technical Field

The disclosure relates to the technical field of live broadcasting, and in particular relates to a method and device for processing wheat connecting, electronic equipment, a storage medium and a program product.

Background

The link-to-wheat PK is a link-to-wheat playing method between a host and a host in live broadcast, and in one link-to-wheat PK, the link-to-wheat PK flow approximately comprises: the method comprises the steps of initiating a wheat connecting state, a data clearing and buffering state, a wheat connecting ending state and the like, wherein the wheat connecting initiating state can be a manual invitation wheat connecting initiating state, a random matching wheat connecting initiating state or a matching bell wheat connecting initiating state and the like.

Along with the iterative development of the service, the link wheat starts link wheat PK from supporting only one line to supporting a plurality of lines to start PK, and if one line starts PK successfully in the link wheat, the link wheat PK is formally started (enters a link wheat state) and the caches of other lines are cleaned. The multiple wire PK initiation scheme increases the link PK efficiency and increases many superposition states.

However, the state machine of the existing link-microphone PK flow processes each state by means of enumeration (i.e. only being in a certain state at a certain moment), if the superposition state (multi-state coexistence) needs to be supported, the state of the link-microphone PK flow is increased by geometric multiple due to the existing enumeration method along with continuous iteration of the link-microphone PK service, and the logic is complex. Such a large number of states easily causes state processing confusion, and eventually, the states of the link-to-wheat PK flow are increasingly not processed.

Disclosure of Invention

To solve the above technical problems or at least partially solve the above technical problems, the present disclosure provides a method, an apparatus, an electronic device, a storage medium, and a program product for processing wheat.

In a first aspect of the embodiments of the present disclosure, a method for processing wheat, the method includes: receiving a state change input for indicating to add a second ligature state based on the first ligature state during execution of the ligature processing operation indicated by the first ligature state; responding to the state change input, and determining a target identifier according to a first identifier corresponding to the first wheat connecting state and a second identifier corresponding to the second wheat connecting state, wherein the target identifier is used for indicating a target wheat connecting state, and the target wheat connecting state is a superposition state of the first wheat connecting state and the second wheat connecting state; and executing the target wheat connecting processing operation indicated by the target identifier according to the target identifier.

Optionally, each identifier includes a character string, the first link state includes an independent state or an overlapping state of multiple independent states, and the second link state includes an independent state; the character strings corresponding to each independent state comprise a target character, and the number of the target characters in the character strings corresponding to each superposition state is used for determining the number of the independent states included in each superposition state; the position of the target character in each character string is used for determining the type of the independent state indicated by each character string; the determining a target character string according to a first character string corresponding to the first connection state and a second character string corresponding to the second connection state comprises the following steps: and carrying out bit-wise processing on the first character string and the second character string to obtain the target character string.

Optionally, the first character string and the second character string are binary character strings.

Optionally, the number of bits of the first string is different from the number of bits of the second string; the bit-wise processing is performed on the first character string and the second character string to obtain the target character string, which comprises the following steps: performing bit number alignment processing on the first character string and the second character string to obtain character strings with the same two digits, wherein one character string is used for indicating a first connection state, and the other character string is used for indicating a second connection state; and carrying out bit-wise processing on the character strings with the same two digits to obtain the target character string.

Optionally, each identifier comprises a string; the first wheat connecting state comprises an independent state or a superposition state of a plurality of independent states, and the second wheat connecting state comprises an independent state; the character strings corresponding to each independent state are different, and the character strings corresponding to each superposition state are spliced by the character strings corresponding to the independent states; the determining a target character string according to a first character string corresponding to the first link state and a second character string corresponding to the second link state comprises the following steps: and performing splicing processing on the first character string and the second character string to obtain the target character string.

Optionally, the target string includes a first string and a second string, and a preset spacer between the first string and the second string.

In a second aspect of embodiments of the present disclosure, there is provided a wheat-germ processing apparatus, the apparatus comprising: the device comprises a receiving module, a determining method module and an executing module; the receiving module is used for receiving a state change input in the process of executing the wheat connecting processing operation indicated by the first wheat connecting state, wherein the state change input is used for indicating to add a second wheat connecting state on the basis of the first wheat connecting state; the determining module is used for responding to the state change input, determining a target identifier according to a first identifier corresponding to the first wheat connecting state and a second identifier corresponding to the second wheat connecting state, wherein the target identifier is used for indicating a target wheat connecting state, and the target wheat connecting state is a superposition state of the first wheat connecting state and the second wheat connecting state; the execution module is used for executing the target wheat connecting processing operation indicated by the target identifier according to the target identifier.

Optionally, each identifier includes a character string, the first link state includes an independent state or an overlapping state of multiple independent states, and the second link state includes an independent state; the character strings corresponding to each independent state comprise a target character, and the number of the target characters in the character strings corresponding to each superposition state is used for determining the number of the independent states included in each superposition state; the position of the target character in each character string is used for determining the type of the independent state indicated by each character string; the determining module is specifically configured to perform bit-wise processing on the first string and the second string to obtain the target string.

Optionally, the first character string and the second character string are binary character strings.

Optionally, the number of bits of the first string is different from the number of bits of the second string; the determining module is specifically configured to perform bit number alignment processing on the first string and the second string to obtain two strings with the same digits, where one string is used to indicate the first linking state and the other string is used to indicate the second linking state; and carrying out bit-wise processing on the character strings with the same two digits to obtain the target character string.

Optionally, each identifier comprises a string; the first wheat connecting state comprises an independent state or a superposition state of a plurality of independent states, and the second wheat connecting state comprises an independent state; the character strings corresponding to each independent state are different, and the character strings corresponding to each superposition state are spliced by the character strings corresponding to the independent states; the determining module is specifically configured to perform a splicing process on the first string and the second string to obtain the target string.

Optionally, the target string includes a first string and a second string, and a preset spacer between the first string and the second string.

In a third aspect of the embodiments of the present disclosure, there is provided an electronic device, the electronic device including a processor, a memory, and a computer program stored on the memory and executable on the processor, the computer program implementing the method for barley processing according to the first aspect when executed by the processor.

In a fourth aspect of the embodiments of the present disclosure, there is provided a computer readable storage medium having stored thereon a computer program which, when executed by a processor, implements the method of the first aspect.

A fifth aspect of embodiments of the present disclosure provides a computer program product, wherein the computer program product comprises a computer program which, when run on a processor, causes the processor to execute the computer program for implementing the method of the first aspect.

In a sixth aspect of the embodiments of the present disclosure, a chip is provided, where the chip includes a processor and a communication interface, where the communication interface is coupled to the processor, and where the processor is configured to execute program instructions to implement the method for processing wheat-with-wheat as described in the first aspect.

Compared with the prior art, the technical scheme provided by the embodiment of the disclosure has the following advantages: in the embodiment of the disclosure, in the process of executing the wheat connecting processing operation indicated by the first wheat connecting state, receiving a state change input, wherein the state change input is used for indicating to add a second wheat connecting state on the basis of the first wheat connecting state; responding to the state change input, and determining a target identifier according to a first identifier corresponding to the first wheat connecting state and a second identifier corresponding to the second wheat connecting state, wherein the target identifier is used for indicating a target wheat connecting state, and the target wheat connecting state is a superposition state of the first wheat connecting state and the second wheat connecting state; and executing the target wheat connecting processing operation indicated by the target identifier according to the target identifier. In this way, in the operation iteration process of the link wheat, a plurality of superposition states do not need to be newly added in an enumeration mode, and the identifier corresponding to the superposition state can be determined according to the identifiers corresponding to a plurality of states forming the superposition state.

Drawings

The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the disclosure and together with the description, serve to explain the principles of the disclosure.

In order to more clearly illustrate the embodiments of the present disclosure or the solutions in the prior art, the drawings that are required for the description of the embodiments or the prior art will be briefly described below, and it will be obvious to those skilled in the art that other drawings can be obtained from these drawings without inventive effort.

FIG. 1 is a schematic diagram of a conventional headset PK process provided in an embodiment of the present disclosure;

FIG. 2 is a schematic diagram of another prior art headset PK flow scheme provided by an embodiment of the present disclosure;

fig. 3 is a schematic flow chart of a method for processing wheat along with a wheat processing method according to an embodiment of the disclosure;

FIG. 4 is a schematic diagram of a link-to-wheat PK process according to an embodiment of the present disclosure;

fig. 5 is a block diagram of a headset processing device according to an embodiment of the present disclosure;

fig. 6 is a block diagram of an electronic device according to an embodiment of the present disclosure.

Detailed Description

In order that the above objects, features and advantages of the present disclosure may be more clearly understood, a further description of aspects of the present disclosure will be provided below. It should be noted that, without conflict, the embodiments of the present disclosure and features in the embodiments may be combined with each other.

In the following description, numerous specific details are set forth in order to provide a thorough understanding of the present disclosure, but the present disclosure may be practiced otherwise than as described herein; it will be apparent that the embodiments in the specification are only some, but not all, embodiments of the disclosure.

The terms first, second and the like in the description and in the claims, are used for distinguishing between similar objects and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used may be interchanged, where appropriate, such that embodiments of the disclosure may be practiced in sequences other than those illustrated and described herein, and that the objects identified by "first," "second," etc. are generally of the same type and are not limited to the number of objects, e.g., the first object may be one or more. Furthermore, in the description and claims, "and/or" means at least one of the connected objects, and the character "/", generally means that the associated object is an "or" relationship.

It should be noted that, in the embodiment of the present disclosure, the link-wheat state is the link-wheat PK state, and the link-wheat processing operation is the link-wheat PK service processing operation.

First, fig. 1 is a schematic diagram of an existing link-malt PK flow according to an embodiment of the present disclosure, where the number of states of the link-malt PK is limited and the state circulation is relatively fixed, that is, the host can initiate a link-malt PK only through one line in fig. 1. The PK initiation stage in the headset PK may include a random matching state shown by line 1, a manual invite state (referred to as invite state) shown by line 2, and a matching bell state shown by line 3. With the iterative development of the service, the link-to-wheat PK is required to support a plurality of lines to initiate PK, if one line initiating PK is successful, the PK is formally started, and meanwhile, the cache data of the other line is cleaned. As shown in fig. 2, in the process of initiating the link PK in the random matching state, the state flow chart of triggering the manual invitation state to initiate the link PK is triggered again, as shown in fig. 2, the anchor invites other anchors to perform PK manually at the same time in the random matching initiating link PK, the random matching and manual invitation state is added, if the random matching is successful (i.e. the random matching is successful in initiating the link PK), the link PK is in the link PK and the invitation data state is cleared, and if the opposite anchor accepts the invitation (i.e. the manual invitation is successful in initiating the link PK), the link PK is in the link and the matching data state is cleared. The manner of supporting the PK initiated by the plurality of lines through the enumeration state as shown in fig. 2 may make the states of the link-to-microphone PK geometrically multiple and logic complex, so if the state machine is implemented by continuing to use the existing enumeration manner, the state processing is chaotic and the state processing efficiency is low.

In order to solve the above-mentioned technical problem, in the embodiments of the present disclosure, during execution of a wheat connecting processing operation indicated by a first wheat connecting state, a state change input is received, where the state change input is used to indicate that a second wheat connecting state is added on the basis of the first wheat connecting state; responding to the state change input, and determining a target identifier according to a first identifier corresponding to the first wheat connecting state and a second identifier corresponding to the second wheat connecting state, wherein the target identifier is used for indicating a target wheat connecting state, and the target wheat connecting state is a superposition state of the first wheat connecting state and the second wheat connecting state; and executing the target wheat connecting processing operation indicated by the target identifier according to the target identifier. In this way, in the operation iteration process of the link, a plurality of superposition states do not need to be newly added in an enumeration mode, and the identifier corresponding to the superposition state can be determined according to the identifiers corresponding to a plurality of states forming the superposition state.

The electronic device in the embodiment of the disclosure may be a mobile electronic device or a non-mobile electronic device. The mobile electronic device may be a mobile phone, a tablet computer, a notebook computer, a palm computer, a vehicle-mounted electronic device, a wearable device, an ultra-mobile personal computer (ultra-mobile personal computer, UMPC), a netbook or a personal digital assistant (personal digital assistant, PDA), etc.; the non-mobile electronic device may be a personal computer (personal computer, PC), a Television (TV), a teller machine, a self-service machine, or the like; the embodiments of the present disclosure are not particularly limited.

The execution main body of the headset processing method provided in the embodiment of the present disclosure may be the above-mentioned electronic device (including mobile electronic device and non-mobile electronic device), or may be a functional module and/or a functional entity capable of implementing the headset processing method in the electronic device, which may be specifically determined according to actual use requirements, and the embodiment of the present disclosure is not limited.

The following describes in detail the wheat connecting processing method provided in the embodiment of the present disclosure through specific embodiments and application scenarios thereof with reference to the accompanying drawings.

As shown in fig. 3, an embodiment of the disclosure provides a method for processing wheat along with the method may include steps 301 to 303 described below.

301. A status change input is received during execution of a ligature processing operation of the first ligature status indication.

The state change input is used for indicating that a second wheat connecting state is added on the basis of the first wheat connecting state, each wheat connecting state corresponds to an identifier, and each wheat connecting state is used for indicating different wheat connecting processing operations.

Optionally, the state change input may include a click input or a sliding input of a user on a state change control or a state change option, which may be specifically determined according to an actual situation, and the embodiment of the disclosure is not limited.

It may be appreciated that the state change input may be a single touch input or a gesture input, or may be a combination input including multiple touch inputs or gesture inputs, which may be specifically determined according to practical situations, and is not limited herein.

The click input may be a single click input, a double click input or any number of click inputs, or may be a short press input or a long press input; the slide input may be any slide input in any direction, such as an upward slide input, a downward slide input, a leftward slide input, a rightward slide input, a clockwise slide input, or a counterclockwise slide input, or may be a two-finger slide input or a three-finger slide input.

The state change input is used for indicating to change the state in the link wheat PK process into a target link wheat state, the link wheat PK process comprises a plurality of independent states, and the target link wheat state is a superposition state of at least two independent states.

The plurality of independent states may include a wheat connecting state, a connection state, a data cleaning state, a data connecting state, and other states, and may be specifically determined according to actual conditions, which is not limited in the embodiments of the present disclosure.

The initiating communication state comprises a random matching state, a manual invitation state and a matching bell state, and can also comprise other states, and the initiating communication state can be determined according to actual conditions, and the embodiment of the disclosure is not limited.

302. And responding to the state change input, and determining a target identifier according to the first identifier corresponding to the first connecting state and the second identifier corresponding to the second connecting state.

The target mark is used for indicating a target wheat connecting state, and the target wheat connecting state is a superposition state of the first wheat connecting state and the second wheat connecting state.

The target identifier may be determined through a preset process for the first identifier and the second identifier, where the preset process may be determined according to an actual situation, and is not limited herein.

303. And executing the target wheat connecting processing operation indicated by the target identifier according to the target identifier.

Wherein, the wheat connecting processing operation corresponding to each independent state comprises the following steps: interface requests, page displays, mutual exclusion logic for other services, etc., as to the superposition state, not simply superposition of the operation of the communication processing corresponding to the two states, but a compatible operation (page how to display, how to mutual exclusion with other services, etc.) of the coexistence state (superposition state) will be processed.

It can be understood that the target link states are formed by overlapping independent states, and the link PK service processing operation indicated by the target identifier corresponding to the target link state includes compatible operations related to the link PK service processing operation corresponding to the independent states.

In an exemplary embodiment, if the target headset state is a random matching and manual invitation state, the headset PK service processing operation indicated by the character string corresponding to the target headset state includes a compatible operation of the headset PK service processing operation corresponding to the random matching state and the headset PK service processing operation corresponding to the manual invitation state. When in the random matching state, the processing operation of the link-with-wheat PK service (such as interface request, page display, mutual exclusion logic with other services and the like) which is randomly matched is processed, manual invitation is initiated in the random matching state, the processing operation of the link-with-wheat PK service (such as interface request) which is in the invitation state is processed, and the compatible operation of the coexistence state (such as page display, mutual exclusion with other services and the like) is processed when the link-with-wheat PK service is changed into the matching state.

In the embodiment of the disclosure, in the operation iteration process of the link, a plurality of superposition states do not need to be newly added in an enumeration mode, and the identifier corresponding to the superposition state can be determined according to identifiers corresponding to a plurality of states forming the superposition state, so that the scheme only needs to process the identifier corresponding to a part of non-superposition state (independent state), and the identifiers corresponding to other superposition states can be determined according to the identifier corresponding to the part of link state, and therefore, each superposition state generated by the operation iteration of the link can be effectively processed, and the state processing efficiency of the link flow can be improved.

Optionally, each identifier includes a character string, the first link state includes an independent state or an overlapping state of multiple independent states, and the second link state includes an independent state; the character strings corresponding to each independent state comprise a target character, and the number of the target characters in the character strings corresponding to each superposition state is used for determining the number of the independent states included in each superposition state; the position of the target character in each character string is used for determining the type of the independent state indicated by each character string; the above step 302 may be specifically implemented by the following step 302 a.

302a, performing bit-wise processing on the first character string and the second character string to obtain the target character string.

It will be appreciated that, since the position of the target character in each string is used to determine the type of the independent state indicated by each string, for each independent state, each independent state corresponds to a string, the string corresponding to each independent state includes one target character, and the position of the target character corresponding to each independent state in the string is different, therefore, the string corresponding to each independent state uniquely indicates the corresponding independent state.

It can be understood that, since the positions of the target characters in each character string are used for determining the type of the independent state indicated by each character string, for the superimposed state, one superimposed state is obtained by superimposing N (N is an integer greater than 1) independent states, the character string corresponding to the one superimposed state includes N target characters, and each target character is the same as the position of the target character in each of the N independent states, so that, according to the positions of the N target characters included in the character string corresponding to the one superimposed state, the type of the independent state indicated by the character string corresponding to the one superimposed state can be determined as the N independent states.

It can be understood that, since the number of target characters in the character string corresponding to each superposition state is used to determine the number of independent states included in each superposition state, one superposition state is obtained by superposition of N independent states, and the character string corresponding to one superposition state includes N target characters, the number of independent states included in the one superposition state can be determined to be N according to the number of target characters in the character string corresponding to the one superposition state being N.

In the embodiment of the disclosure, in the service iteration process of the link-microphone PK, a plurality of superposition states do not need to be newly added in an enumeration manner, and the character strings corresponding to the superposition states can be obtained only by carrying out bit-wise processing on the character strings corresponding to a plurality of independent states forming the superposition states for the superposition states.

It may be understood that in the embodiment of the present disclosure, each independent state in the link PK flow is processed by using a string, or it may be understood that in the embodiment of the present disclosure, a string is used as a unique identifier state code of each independent state, where the string is used to indicate a link PK service processing operation corresponding to a corresponding state in the link PK flow. Furthermore, in the embodiment of the present disclosure, only one target character is included in the character string corresponding to each independent state, and the other characters are not target characters, and the positions of the target characters corresponding to each independent state in the character string are different, that is, the positions of the target characters in the character strings corresponding to different independent states are different, that is, the positions of the target characters in the character strings corresponding to any two independent states are different. It can be appreciated that in the embodiment of the disclosure, the independent state (i.e., the type of independent state) corresponding to the character string can be distinguished according to the position of the target character in the character string (the unique identification state code).

Wherein, the bit-wise processing can be: the target character is the target character after any other character and the target character are subjected to the bit-pressing processing, the first other character and the second other character are subjected to the bit-pressing processing and then are the third other character, and the any other character, the first other character, the second other character and the third other character are characters except the target character. The first character, the second character and the third character may be the same or different.

It can be understood that the character string corresponding to the superposition state obtained by bit-wise processing includes at least two target characters, the superposition state is obtained by superposing how many independent states, the character string corresponding to the superposition state includes how many target characters, for example, if the superposition state is obtained by superposing 2 independent states, the character string corresponding to the superposition state includes 2 target characters, and if the superposition state is obtained by superposing 3 independent states, the character string corresponding to the superposition state includes 3 target characters.

It can be understood that, because the positions of the target characters in the character strings corresponding to each independent state are different, and the bit-wise processing method is combined, it can be known that according to the positions of a plurality of target characters in the character strings corresponding to the superposition state and the target characters in the character strings corresponding to the superposition state, it can be determined which independent states are superposed by the superposition state, so in the embodiment of the disclosure, the processing of the superposition state can be realized only by maintaining each independent state and bit-wise processing, and the enumeration of a plurality of superposition states is not required, and the number and logic complexity of the state processing can be reduced.

In the embodiment of the disclosure, the characters can be numerals, letters, symbols (including punctuation marks, special symbols, etc.), chinese characters, and the like.

Optionally, the target character may be any number, any letter, any symbol, any kanji, etc., which may be specifically determined according to the actual use situation, and the embodiments of the present disclosure are not limited.

Optionally, the number of bits of the first string is different from the number of bits of the second string; the above step 302a can be specifically realized by the following steps 302a1 and 302a 2.

302a1, performing bit number alignment processing on the first character string and the second character string to obtain character strings with the same two digits.

Wherein, in the character strings with the same two digits, one character string is used for indicating a first linking state, and the other character string is used for indicating a second linking state.

302a2, performing bit-wise processing on the character strings with the same two digits to obtain the target character string.

Illustratively, the first headset PK state includes M (M is a positive integer) independent states, the first string includes M target characters, each of the target characters is the same number of bits as the target character in each of the M independent states, and the second headset PK state is one independent state. In the character strings with the same two digits, one character string comprises M target character strings, the digits of each target character string are the same as the digits of each target character string in the first character string, and the other character string only comprises one target character string, and the digits of the target character string are the same as the digits of the target character string in the second character string. The target character string comprises M+1 target characters, wherein the number of bits of the M target characters is the same as the number of bits of the M target characters in the first character string, and the number of bits of the 1 target characters is the same as the number of bits of the target characters in the second character string.

In the embodiment of the disclosure, the first character strings and the second character strings with different digits are aligned to obtain the character strings with the same digits, and the character strings with the same digits can also respectively indicate the first continuous wheat state and the second continuous wheat state, so that the character strings with the same digits are subjected to the bit-by-bit processing to obtain the target character strings, and further, the continuous wheat superposition state can be better maintained through the alignment processing, and the processing efficiency of the continuous wheat state is improved.

Illustratively, in the embodiments of the present disclosure, the following description will exemplarily describe the target characters as non-0 characters, respectively.

Optionally, the target character is a non-0 character, and the other characters are 0 characters; the bit pressing process is as follows: the 0 character and the non-0 character are subjected to the bitwise processing, and then the non-0 character is self, and the 0 character are subjected to the bitwise processing, and then the 0 character and the 0 character are subjected to the bitwise processing.

It can be understood that after the character strings corresponding to any two independent states are processed by bit, the obtained character string corresponding to the superposition state includes two target characters, and the positions of the two target characters in the character string corresponding to the superposition state are the positions of the target characters in the character string corresponding to the corresponding independent state.

In the embodiment of the disclosure, the target character is a non-0 character, the other characters are 0 characters, the character string is simple and easy to process, and the state processing efficiency of the link-microphone PK flow can be improved.

Optionally, the non-0 character is a number, letter, or special symbol; the non-0 characters corresponding to any two independent states are the same or different.

In the embodiment of the disclosure, various non-0 characters are provided, which can be determined according to practical situations, and are not limited herein. And the non-0 characters in the character strings corresponding to the states in the link-microphone PK flow may be the same or different, and may be specifically determined according to the actual situation, which is not limited herein. The non-0 characters in the character strings corresponding to the states in the link-microphone PK flow are the same, so that the state processing can be facilitated, the non-0 characters in the character strings corresponding to the states in the link-microphone PK flow are different, and the diversity of the character strings corresponding to the link-microphone PK state can be improved.

Optionally, the numbers of the character string bits corresponding to any two independent states are the same or different; before two character strings with different character digits do the bit-by-bit processing, the 0 character is used to complement the digits of the character string with less character digits.

It can be understood that the number of bits of the character string corresponding to each state in the link PK flow may be the same or different, and specifically may be determined according to the actual situation, which is not limited herein. The same number of bits of the character strings corresponding to each state in the link-microphone PK flow can facilitate state processing, and the different numbers of bits of the character strings corresponding to each state in the link-microphone PK flow can improve the diversity of the character strings corresponding to the link-microphone PK state.

It can be understood that according to the bit-wise processing method, the 0 character does not affect the processing result, so that before two strings with different character bits are processed by the bit-wise processing, the 0 character is used to complement the bit number of the string with fewer character bits, so that the bit number of the two strings is consistent with the bit number of the string with more bit numbers, and then the bit-wise processing is performed on the two strings, thereby ensuring the reliability of the processing result.

Optionally, the non-0 character corresponding to each independent state is 1.

Optionally, the first character string and the second character string are binary character strings,

illustratively, each string is a binary string and the target character is 1.

It can be understood that if the character other than 0 is 1, that is, the target character is 1, and the other characters are 0, the character string corresponding to each independent state is a binary number, and the bit-wise processing can be bit-wise or processing or bit-wise exclusive or processing, which can be specifically determined according to the actual situation, and is not limited herein.

In the embodiment of the disclosure, the target character is 1, and other characters are 0, so that state processing can be facilitated, and state processing efficiency is improved.

Illustratively, in the embodiments of the present disclosure, the following are exemplarily described by taking the target character as the 0 character, respectively.

Optionally, the target character is a 0 character, and the other characters are non-0 characters; the bit pressing process is as follows: the 0 character is after any non-0 character and 0 character are subjected to bit-wise processing, and the third non-0 character is after the first non-0 character and the second non-0 character are subjected to bit-wise processing.

It can be understood that after the character strings corresponding to any two independent states are processed by bit, the obtained character string corresponding to the superposition state includes two target characters, and the positions of the two target characters in the character string corresponding to the superposition state are the positions of the target characters in the character string corresponding to the corresponding independent state respectively.

In the embodiment of the disclosure, the target character is a 0 character, other characters are non-0 characters, the character string is simple and easy to process, and the state processing efficiency of the link-microphone PK flow can be improved.

Optionally, the non-0 character is a number, letter, or special symbol; the non-0 characters corresponding to any two independent states are the same or different.

In the embodiment of the disclosure, various non-0 characters are provided, which can be determined according to practical situations, and are not limited herein. And the non-0 characters in the character strings corresponding to the states in the link-microphone PK flow may be the same or different, and may be specifically determined according to the actual situation, which is not limited herein. The non-0 characters in the character strings corresponding to the states in the link-microphone PK flow are the same, so that the state processing can be facilitated, the non-0 characters in the character strings corresponding to the states in the link-microphone PK flow are different, and the diversity of the character strings corresponding to the link-microphone PK state can be improved.

Optionally, the numbers of the character string bits corresponding to any two independent states are the same or different; before two character strings with different character digits do the bit-pressing processing, the number of the character strings with fewer character digits is complemented by non-0 characters.

It can be understood that the number of bits of the character string corresponding to each state in the link PK flow may be the same or different, and specifically may be determined according to the actual situation, which is not limited herein. The same number of bits of the character strings corresponding to each state in the link-microphone PK flow can facilitate state processing, and the different numbers of bits of the character strings corresponding to each state in the link-microphone PK flow can improve the diversity of the character strings corresponding to the link-microphone PK state.

The non-0 characters for bit number compensation may be the same or different, and the non-0 characters for bit number compensation may be preset or any non-0 characters, which may be specifically determined according to the actual situation, and are not limited herein.

It can be understood that according to the bit-wise processing method, the non-0 character does not affect the processing result, so that before two character strings with different character bits are processed by the bit-wise processing, the bit numbers of the character strings with fewer character bits are complemented by the non-0 character, so that the bit numbers of the two character strings are consistent with the bit numbers of the character strings with more bit numbers, and then the reliability of the processing result can be ensured when the bit-wise processing is performed on the two character strings.

Optionally, the non-0 character corresponding to each independent state is 1.

Illustratively, each string is a binary string and the target character is 0.

It can be understood that if the character other than 0 is 1, that is, the target character is 0, and the other characters are 1, the character string corresponding to each independent state is a binary number, and the bit-by-bit processing can be bit-by-bit and processing, which can be specifically determined according to the actual situation, and is not limited herein.

In the embodiment of the disclosure, the target character is 0, and other characters are 1, so that state processing can be facilitated, and state processing efficiency is improved.

Optionally, each identifier comprises a string; the first wheat connecting state comprises an independent state or a superposition state of a plurality of independent states, and the second wheat connecting state comprises an independent state; the character strings corresponding to each independent state are different, and the character strings corresponding to each superposition state are spliced by the character strings corresponding to the independent states; the above step 302 may also be implemented by the following step 302 b.

302b, performing splicing processing on the first character string and the second character string to obtain the target character string.

It can be understood that the character strings corresponding to each independent state are different, and the character strings corresponding to each superposition state are spliced by the character strings corresponding to a plurality of independent states; therefore, the superposition state of the independent states can be determined according to the fact that the character strings corresponding to each superposition state are formed by splicing the character strings.

In the embodiment of the disclosure, in the service iteration process of the link-microphone PK, a plurality of superposition states do not need to be newly added in an enumeration manner, and the character strings corresponding to the superposition states can be obtained only by performing splicing processing on the character strings corresponding to a plurality of independent states forming the superposition states for the superposition states.

Alternatively, the above-mentioned splicing process may be to splice the strings together directly, or splice the strings together by a preset spacer.

For example, if each character in the character string corresponding to each independent state is different, the above-mentioned splicing process may be to directly splice the respective character strings together, and if some or all of the characters in the character string corresponding to each independent state are identical, the above-mentioned splicing process is to splice the respective character strings together through a preset spacer.

By taking the first and second wheat connecting states as independent states as an example, if the character string corresponding to the first wheat connecting state is "a" and the character string corresponding to the second wheat connecting state is "b", the target character string is "ab", so that the target character string can be accurately determined to be obtained by overlapping the first and second wheat connecting states; if the character string corresponding to the first linking state is "ac", the character string corresponding to the second linking state is "bc", the target character string is "ac, bc" (wherein "is a preset separator), it can be accurately determined that the target character string is obtained by overlapping the first linking state and the second linking state, and if the target character string is" acbc ", and meanwhile," c "is a character string corresponding to an independent state, it cannot be determined that the target character string is obtained by overlapping the first linking state and the second linking state.

Optionally, the target string includes a first string and a second string, and a preset spacer between the first string and the second string.

The preset spacer is used for dividing the character string corresponding to one superposition state and is obtained by splicing the character strings in the independent states. The preset spacers may be different from each character in the character string indicating each independent state, and specifically may be determined according to actual situations, which is not limited herein.

In the embodiment of the disclosure, each character string is spliced through the preset spacer, so that the superposition state can be better determined to be obtained by superposition of a plurality of independent states, and the accuracy and the efficiency of recognizing the corresponding wheat connecting state through the character string can be improved.

In the embodiment of the disclosure, the character strings corresponding to each independent state and the bit-by-bit processing method can be maintained through a state machine, namely, the state circulation rule is maintained through the state machine. In the whole link wheat PK flow, a state machine supports a host to select a plurality of lines to initiate link wheat PK simultaneously, supports coexistence of a plurality of states simultaneously, better maintains the link wheat PK state flow, and better supports business iteration; the host can use the function of the headset PK faster.

For example, in the optimized state machine, the target character is 1, the other characters are 0, the states of the ligature PK are maintained by binary numbers, each state shifts 1 in the binary numbers to the left by different digits, that is, each state is represented by a unique binary number, for example, the character string corresponding to the random matching state is "00000001", the character string corresponding to the manual invitation state is "00000010", the character string corresponding to the matching bell state is "00000100", the character string corresponding to the ligature state is "00001000", the character string corresponding to the in-line state is "00100000", the character string corresponding to the clearing buffer data state is "01000000", the character string corresponding to the ending ligature state is "10000000", and the superposition state may be superposition of the individual states forming the superposition state, for example, if the random matching initiates ligature PK successfully, the character string corresponding to the manual invitation data state is "01001000", so that all the current ligature states may be combined independently. In state circulation, circulation rules for setting states inside a state machine maintain the current state of the link PK through bitwise processing of binary numbers. Through the optimized state machine, additional new states containing multiple existing states are not needed to be added to represent multiple states, and a set link-wheat PK state circulation rule is set so that the state circulation of the link-wheat PK is more standardized. With the iteration of the service, if a new multi-state is to be supported, only a state circulation rule needs to be newly added in the state machine. After using the optimized state machine, the host player generates a state change in the link-to-microphone PK scene according to the user operation behavior, and the specific state flow is as shown in fig. 4, and includes the following steps 401 to 404:

401. The anchor generates state change by operation behavior, and the state to be changed is informed to a state machine by calling a method;

402. setting a state circulation rule according to service requirements;

403. the state machine carries out binary bit-by-bit processing of the corresponding link wheat PK state according to the set state circulation rule;

404. business processing operation that needs to respond to the state change by monitoring the updated state;

405. and (5) ending the link wheat PK and resetting the state machine.

In the embodiment of the disclosure, each state of the state machine is represented by a binary number of digits shifted by 1 leftwards, a certain service scene can be in multiple states at the same time by bit-by-bit processing, the state circulation rule is converged, and along with service iteration, only the state circulation rule in the state machine needs to be changed.

Fig. 5 is a block diagram of a wheat-with-processing apparatus according to an embodiment of the present disclosure, and as shown in fig. 5, includes: a receiving module 501, a determining module 502 and an executing module 503; the receiving module 501 is configured to receive, during execution of a ligature processing operation indicated by a first ligature state, a state change input, where the state change input is used to indicate that a second ligature state is added based on the first ligature state; the determining module 502 is configured to determine, in response to the status change input, a target identifier according to a first identifier corresponding to the first link status and a second identifier corresponding to the second link status, where the target identifier is used to indicate a target link status, and the target link status is a superposition status of the first link status and the second link status; the executing module 503 is configured to execute the target barley processing operation indicated by the target identifier according to the target identifier.

Optionally, each identifier includes a character string, the first link state includes an independent state or an overlapping state of multiple independent states, and the second link state includes an independent state; the character strings corresponding to each independent state comprise a target character, and the number of the target characters in the character strings corresponding to each superposition state is used for determining the number of the independent states included in each superposition state; the position of the target character in each character string is used for determining the type of the independent state indicated by each character string; the determining module 502 is specifically configured to perform bit-wise processing on the first string and the second string to obtain the target string.

Optionally, the first character string and the second character string are binary character strings.

Optionally, the number of bits of the first string is different from the number of bits of the second string; the determining module 502 is specifically configured to perform a bit number alignment process on the first string and the second string to obtain two strings with the same digits, where one string is used to indicate the first connection status and the other string is used to indicate the second connection status; and carrying out bit-wise processing on the character strings with the same two digits to obtain the target character string.

Optionally, each identifier comprises a string; the first wheat connecting state comprises an independent state or a superposition state of a plurality of independent states, and the second wheat connecting state comprises an independent state; the character strings corresponding to each independent state are different, and the character strings corresponding to each superposition state are spliced by the character strings corresponding to the independent states; the determining module 502 is specifically configured to splice the first string and the second string to obtain the target string.

Optionally, the target string includes a first string and a second string, and a preset spacer between the first string and the second string.

In the embodiment of the disclosure, each module may implement the wheat connecting processing method provided in the embodiment of the method, and may achieve the same technical effects, so that repetition is avoided, and no further description is given here.

Fig. 6 is a schematic structural diagram of an electronic device provided in an embodiment of the present disclosure, which is used to exemplarily illustrate an electronic device implementing any of the processing methods for connecting wheat in the embodiments of the present disclosure, and should not be construed as specifically limiting the embodiments of the present disclosure.

As shown in fig. 6, the electronic device 600 may include a processor (e.g., a central processing unit, a graphics processor, etc.) 601 that may perform various suitable actions and processes according to programs stored in a Read Only Memory (ROM) 602 or programs loaded from a storage 608 into a Random Access Memory (RAM) 603. In the RAM 603, various programs and data required for the operation of the electronic apparatus 600 are also stored. The processor 601, the ROM 602, and the RAM 603 are connected to each other through a bus 604. An input/output (I/O) interface 605 is also connected to bus 604.

In general, the following devices may be connected to the I/O interface 605: input devices 606 including, for example, a touch screen, touchpad, keyboard, mouse, camera, microphone, accelerometer, gyroscope, and the like; an output device 607 including, for example, a Liquid Crystal Display (LCD), a speaker, a vibrator, and the like; storage 608 including, for example, magnetic tape, hard disk, etc.; and a communication device 609. The communication means 609 may allow the electronic device 600 to communicate with other devices wirelessly or by wire to exchange data. While an electronic device 600 having various means is shown, it is to be understood that not all of the illustrated means are required to be implemented or provided. More or fewer devices may be implemented or provided instead.

In particular, according to embodiments of the present disclosure, the processes described above with reference to flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a non-transitory computer readable medium, the computer program comprising program code for performing the method shown in the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network via communication means 609, or from storage means 608, or from ROM 602. The computer program, when executed by the processor 601, may perform the functions defined in any of the barley processing methods provided by the embodiments of the present disclosure.

It should be noted that the computer readable medium described in the present disclosure may be a computer readable signal medium or a computer readable storage medium, or any combination of the two. The computer readable storage medium can be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples of the computer-readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this disclosure, a computer-readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In the present disclosure, however, the computer-readable signal medium may include a data signal propagated in baseband or as part of a carrier wave, with the computer-readable program code embodied therein. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination of the foregoing. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: electrical wires, fiber optic cables, RF (radio frequency), and the like, or any suitable combination of the foregoing.

In some implementations, the client, server, may communicate using any currently known or future developed network protocol, such as HTTP (HyperText Transfer Protocol ), and may be interconnected with any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include a local area network ("LAN"), a wide area network ("WAN"), the internet (e.g., the internet), and peer-to-peer networks (e.g., ad hoc peer-to-peer networks), as well as any currently known or future developed networks.

The computer readable medium may be contained in the electronic device; or may exist alone without being incorporated into the electronic device.

The computer readable medium carries one or more programs which, when executed by the electronic device, cause the electronic device to: receiving a state change input for indicating to add a second ligature state based on the first ligature state during execution of the ligature processing operation indicated by the first ligature state; responding to the state change input, and determining a target identifier according to a first identifier corresponding to the first wheat connecting state and a second identifier corresponding to the second wheat connecting state, wherein the target identifier is used for indicating a target wheat connecting state, and the target wheat connecting state is a superposition state of the first wheat connecting state and the second wheat connecting state; and executing the target wheat connecting processing operation indicated by the target identifier according to the target identifier.

In an embodiment of the present disclosure, computer program code for performing the operations of the present disclosure may be written in one or more programming languages, including but not limited to an object oriented programming language such as Java, smalltalk, C ++ and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the computer, partly on the computer, as a stand-alone software package, partly on the computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the computer through any type of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computer (for example, through the Internet using an Internet service provider).

The flowcharts and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.

The units involved in the embodiments of the present disclosure may be implemented by means of software, or may be implemented by means of hardware. Wherein the names of the units do not constitute a limitation of the units themselves in some cases.

The functions described above herein may be performed, at least in part, by one or more hardware logic components. For example, without limitation, exemplary types of hardware logic components that may be used include: a Field Programmable Gate Array (FPGA), an Application Specific Integrated Circuit (ASIC), an Application Specific Standard Product (ASSP), a system on a chip (SOC), a Complex Programmable Logic Device (CPLD), and the like.

In the context of this disclosure, a computer-readable medium may be a tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. The computer readable medium may be a computer readable signal medium or a computer readable storage medium. The computer readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples of a computer-readable storage medium would include one or more wire-based electrical connections, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

The foregoing description is only of the preferred embodiments of the present disclosure and description of the principles of the technology being employed. It will be appreciated by persons skilled in the art that the scope of the disclosure referred to in this disclosure is not limited to the specific combinations of features described above, but also covers other embodiments which may be formed by any combination of features described above or equivalents thereof without departing from the spirit of the disclosure. Such as those described above, are mutually substituted with the technical features having similar functions disclosed in the present disclosure (but not limited thereto).

Moreover, although operations are depicted in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown or in sequential order. In certain circumstances, multitasking and parallel processing may be advantageous. Likewise, while several specific implementation details are included in the above discussion, these should not be construed as limiting the scope of the present disclosure. Certain features that are described in the context of separate embodiments can also be implemented in combination in a single embodiment. Conversely, various features that are described in the context of a single embodiment can also be implemented in multiple embodiments separately or in any suitable subcombination.

Although the subject matter has been described in language specific to structural features and/or methodological acts, it is to be understood that the subject matter defined in the appended claims is not necessarily limited to the specific features or acts described above. Rather, the specific features and acts described above are example forms of implementing the claims.

Claims (10)

1. A method of treatment of wheat, the method comprising:

receiving a state change input during the process of executing the wheat connecting processing operation indicated by the first wheat connecting state, wherein the state change input is used for indicating to increase a second wheat connecting state on the basis of the first wheat connecting state;

responding to the state change input, and determining a target identifier according to a first identifier corresponding to the first wheat connecting state and a second identifier corresponding to the second wheat connecting state, wherein the target identifier is used for indicating a target wheat connecting state, and the target wheat connecting state is a superposition state of the first wheat connecting state and the second wheat connecting state;

and executing the target wheat connecting processing operation indicated by the target identifier according to the target identifier.

2. The method of claim 1, wherein each identifier comprises a string, the first ligature state comprises an independent state or an overlay of independent states, and the second ligature state comprises an independent state;

The character strings corresponding to each independent state comprise a target character, and the number of the target characters in the character strings corresponding to each superposition state is used for determining the number of the independent states included in each superposition state;

the position of the target character in each character string is used for determining the type of the independent state indicated by each character string;

the determining the target character string according to the first character string corresponding to the first link state and the second character string corresponding to the second link state includes:

and carrying out bit-wise processing on the first character string and the second character string to obtain the target character string.

3. The method of claim 2, wherein the first string and the second string are binary strings.

4. The method of claim 2, wherein the number of bits of the first string and the number of bits of the second string are different;

the step of performing bit-wise processing on the first character string and the second character string to obtain the target character string includes:

performing bit number alignment processing on the first character string and the second character string to obtain two character strings with the same digits, wherein one character string is used for indicating the first connection state, and the other character string is used for indicating the second connection state;

And carrying out bit-wise processing on the character strings with the same two digits to obtain the target character string.

5. The method of claim 1, wherein each identifier comprises a string; the first wheat connecting state comprises an independent state or a superposition state of a plurality of independent states, and the second wheat connecting state comprises an independent state;

the character strings corresponding to each independent state are different, and the character strings corresponding to each superposition state are spliced by the character strings corresponding to the independent states;

the determining the target character string according to the first character string corresponding to the first link state and the second character string corresponding to the second link state includes:

and performing splicing processing on the first character string and the second character string to obtain the target character string.

6. The method of claim 5, wherein the target string comprises the first string and the second string, and a preset spacer between the first string and the second string.

7. A wheat-germ processing apparatus, comprising: the device comprises a receiving module, a determining method module and an executing module;

the receiving module is used for receiving a state change input in the process of executing the wheat connecting processing operation indicated by the first wheat connecting state, wherein the state change input is used for indicating that a second wheat connecting state is added on the basis of the first wheat connecting state, each wheat connecting state corresponds to an identifier, and each wheat connecting state is used for indicating different wheat connecting processing operations;

The determining module is used for responding to the state change input, determining a target identifier according to a first identifier corresponding to the first wheat connecting state and a second identifier corresponding to the second wheat connecting state, wherein the target identifier is used for indicating a target wheat connecting state, and the target wheat connecting state is a superposition state of the first wheat connecting state and the second wheat connecting state;

and the execution module is used for executing the target wheat connecting processing operation indicated by the target identifier according to the target identifier.

8. An electronic device, comprising: a memory and a processor, the memory for storing a computer program; the processor is configured to execute the method for barley processing according to any of claims 1 to 6 when the computer program is called.

9. A computer-readable storage medium, characterized in that a computer program is stored thereon, which, when being executed by a processor, implements the method of the barley processing according to any of claims 1 to 6.

10. A computer program product, characterized in that it has stored thereon a computer program which, when executed by a processor, implements the method of the barley processing according to any of claims 1 to 6.