String verification method and device, computer device and storage medium

Abstract

The embodiment of the application discloses a string verification method and device, computer equipment and a storage medium. The method comprises the following steps: obtaining a to-be-verified string; establishing a first string list, the first string list comprising an acquisition sequence; selecting a to-be-verified character in the first string list according to the acquisition sequence; matching the to-be-verified character with a template string; according to the matching result of the to-be-verified character and the template string, putting the verified to-be-verified character into a preset second string list; and obtaining a combined string matched with the template string. The method of the embodiment of the application can quickly complete the verification process of the string meeting the verification condition in the IAP2 protocol playing content list, avoid the problem of excessive occupation of device resources caused by repeated acquisition of the same character in the traditional string matching verification process, and improve the protocol content transmission efficiency between devices by expanding the string storage and verification space to optimize the string acquisition and character matching verification.

Description

Technical Field

[0001] This application relates to the field of electronic information technology, and in particular to a string verification method, apparatus, computer equipment, and storage medium. Background Technology

[0002] In people's daily production and life practices, terminal devices, especially electronic communication devices with information content reading and transmission functions, are widely used. In-vehicle multimedia entertainment hosts that use the IAP2 protocol for content reading and transmission between devices, and connect to mobile terminal devices running the iOS system for playlist string matching and verification, run multiple types of processes to perform the functions of the device. The strings in the existing IAP2 protocol usually contain a large number of identical characters. The repeated appearance of the same characters causes the string reading device in the in-vehicle multimedia entertainment host to repeatedly obtain the same characters, resulting in excessive occupation of CPU and content storage space resources in the vehicle device. The information reading and string matching verification process is redundant, and the parsing of a large amount of playlist data takes a lot of time, which seriously reduces the information transmission efficiency between the vehicle and the mobile terminal device.

[0003] Therefore, when using existing methods to perform inter-device string matching verification based on the IAP2 protocol, there is a problem of low matching verification efficiency. Summary of the Invention

[0004] This application provides a string verification method, apparatus, computer device, and storage medium, which can improve the efficiency of content transmission between devices.

[0005] In a first aspect, embodiments of this application provide a string verification method, which includes: obtaining a string to be verified; establishing a corresponding first string list based on the string to be verified, the first string list including an acquisition sequence; selecting character information to be verified from the first string list based on the acquisition sequence; matching the character information to be verified with a template string; placing the verified character to be verified into a preset second string list based on the matching result between the character to be verified and the template string; and obtaining a combined string that matches the template string from the second string list.

[0006] Secondly, embodiments of this application also provide a string verification device, comprising: an acquisition unit for acquiring a string to be verified; and a processing unit for establishing a corresponding first string list based on the string to be verified, the first string list including an acquisition sequence; selecting character information to be verified from the first string list according to the acquisition sequence; matching the character information to be verified with a template string; placing the verified character to be verified into a preset second string list based on the matching result between the character to be verified and the template string; and acquiring a combined string that matches the template string from the second string list.

[0007] Thirdly, embodiments of this application also provide a computer device, which includes a memory and a processor. The memory stores a computer program, and the processor executes the computer program to implement the above-described method.

[0008] Fourthly, embodiments of this application also provide a computer-readable storage medium storing a computer program, the computer program including program instructions, which, when executed by a processor, can implement the above-described method.

[0009] This application provides a string verification method, apparatus, computer device, and storage medium. The method includes: acquiring a string to be verified; establishing a first string list, the first string list including an acquisition sequence; selecting a character to be verified from the first string list according to the acquisition sequence; matching the character to be verified with a template string; placing the verified character to be verified into a preset second string list based on the matching result of the character to be verified and the template string; and acquiring a combined string that matches the template string. The string verification method disclosed in this application can quickly complete the verification process of strings that meet the verification conditions within the IAP2 protocol playback content list, avoiding the problem of excessive device resource consumption caused by repeatedly acquiring the same character in the traditional string matching verification process. By utilizing expanded string storage and verification space resources, it optimizes the string acquisition and character matching verification methods, saves string verification time, and improves the efficiency of content transmission between vehicle-mounted systems and mobile terminal devices based on the IAP2 protocol. Attached Figure Description

[0010] To more clearly illustrate the technical solutions of the embodiments of this application, the drawings used in the description of the embodiments will be briefly introduced below. Obviously, the drawings described below are some embodiments of this application. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0011] Figure 1 This is a schematic diagram illustrating an application scenario of the string verification method provided in the embodiments of this application;

[0012] Figure 2 A flowchart illustrating the string verification method provided in this application embodiment;

[0013] Figure 3 A schematic block diagram of a string verification device provided in another embodiment of this application;

[0014] Figure 4 A schematic block diagram of a computer device provided in an embodiment of this application. Detailed Implementation

[0015] The technical solutions of the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this application, not all embodiments. Based on the embodiments of this application, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this application.

[0016] It should be understood that, when used in this specification and the appended claims, the terms "comprising" and "including" indicate the presence of the described features, integrals, steps, operations, elements and / or components, but do not exclude the presence or addition of one or more other features, integrals, steps, operations, elements, components and / or collections thereof.

[0017] It should also be understood that the terminology used in this specification is for the purpose of describing particular embodiments only and is not intended to limit the scope of the application. As used in this specification and the appended claims, the singular forms “a,” “an,” and “the” are intended to include the plural forms unless the context clearly indicates otherwise.

[0018] It should also be further understood that the term “and / or” as used in this application specification and the appended claims means any combination of one or more of the associated listed items and all possible combinations, and includes such combinations.

[0019] This application provides a string verification method, apparatus, computer device, and storage medium.

[0020] The execution subject of the string verification method can be the string verification device provided in the embodiments of this application, or a computer device that integrates the string verification device. The string verification device can be implemented in hardware or software. The computer device can be a terminal or a server. The terminal can be an electronic device running the iOS operating system, including smartphones, tablets, or laptops.

[0021] In some embodiments, please refer to Figure 1 , Figure 1 This is a schematic diagram illustrating an application scenario for string validation provided in an embodiment of this application. The string validation is applied to… Figure 1 The computer device 500 includes a string verification process. This embodiment uses this string verification process to implement the string verification provided in this application.

[0022] The string verification process includes a string acquisition thread, a string selection thread, and a string matching thread. The string acquisition thread receives the string to be verified; the string selection thread actively selects the string to be verified, typically acting as a selection pointer that points to a single character to be verified within the string; and the string matching thread compares the single character to be verified pointed to by the pointer with a single character in the template string, determining whether the character to be verified is the same as a single character in the corresponding sequence of the template string, thus providing verification information for the entire string matching verification.

[0023] Figure 2 This is a flowchart illustrating the string verification process provided in this application embodiment. The string verification provided in this application embodiment is used by the in-vehicle multimedia device host to perform character matching verification on strings transmitted by the mobile terminal device based on the IAP2 protocol. The IAP2 protocol refers to the parsing of the playlist transmitted from the mobile device via the IAP2 protocol when the in-vehicle multimedia host connects to Apple's official CarPlay authentication. Figure 2 As shown, the method includes the following steps S110-160.

[0024] S110. Obtain the string to be verified.

[0025] Specifically, the string acquisition thread first receives readable information from the mobile terminal device based on the IPA2 protocol. The information includes a string to be verified, which consists of multiple characters. The characters in the string to be verified are arranged in a unidirectional and continuous manner. The string may contain the same characters, and multiple identical characters may not be directly connected. That is, other different characters are interspersed among multiple identical characters. The unidirectional and continuous arrangement of characters in the string to be verified receives the pointer of the character pointer from the string selection thread to further complete the selection, matching and verification of characters.

[0026] S120. Establish a first string list based on the string to be verified. The first string list includes the sequence to be obtained.

[0027] Specifically, before obtaining the string to be verified, a first string list can be pre-established to store the string to be verified. The first string list has a pre-set unidirectional continuous arrangement of feature value storage points. Each feature value storage point stores a single character to be verified, so that the string to be verified can be stored continuously according to the feature value storage points and wait for the pointer to point to it.

[0028] Before S120, there is also step S121: determining the sequence to be obtained based on the character arrangement order of the string to be verified.

[0029] The consecutive arrangement of feature value storage points constitutes the arrangement order. This arrangement order can be used as the acquisition sequence of the characters to be verified in the first string list. The pointer of the string selection thread points to the arranged characters to be verified in sequence according to the acquisition sequence. The pointer of the string selection thread points in one direction according to the acquisition sequence until all characters to be verified are pointed to, without performing a pointer backtracking action.

[0030] S130. Select the character information to be verified from the first string list according to the obtained sequence.

[0031] Specifically, the string selection thread selects characters to be verified from the first string list according to the preset acquisition sequence. The pointer in the string selection thread points to the characters to be verified arranged according to the acquisition sequence. Each time the pointer points to a single character to be verified, the character is considered to be selected. The selected character to be verified will not be pointed to by the pointer twice. That is, each character to be verified is selected only once. The pointer moves in one direction according to the acquisition sequence and does not backtrack.

[0032] In some embodiments, S130 is performed prior to:

[0033] S131. Preset acquisition sequence. The acquisition sequence is used to arrange the characters in the string to be verified.

[0034] Specifically, the characters in the string to be verified are arranged in a unidirectional sequence according to the obtained sequence. Each character to be verified is arranged consecutively in the obtained sequence, so that the pointer in the string selection thread can successfully point to the character to be verified.

[0035] S140. Match the character information to be verified with the template string.

[0036] Specifically, to match the character to be verified with the template string, it is necessary to obtain the character to be verified, match the character to be verified with the template characters in the template string, and put the character to be verified into the second string list based on the matching result.

[0037] If the pointer in the string selection thread points to the character to be verified, that character is used as the verification object at this moment and matched with the template character in the template string. A single template character in the template string is compared with the character to be verified as the verification object. If the comparison result is the same, the character to be verified is added to the first string list. And so on. If the characters to be verified pointed to by the pointer are the same after the comparison is completed, they are stored in the first string list in turn. Multiple characters to be verified added to the first string list form a new string in the list and wait for further verification.

[0038] Following S140 are:

[0039] Step S141: Obtain the character to be verified, match the character to be verified with the template character in the template string, and put the character to be verified into the second string list according to the matching result.

[0040] Step S142: Determine whether the character to be verified is consistent with the template character in the selected template string;

[0041] If they match, proceed to step S1421: add the character to be verified to the candidate character layer of the second string list.

[0042] If they match, proceed to step S1422: place the characters to be verified into the free character layer of the second string list and arrange them in the order they were placed.

[0043] Specifically, if the pointer in the string selection thread points to the character to be verified, that character is used as the verification object at this moment and matched with the template character in the template string. A single template character in the template string is compared with the character to be verified as the verification object. If the comparison result is the same, the character to be verified is put into the first string list. And so on. If the characters to be verified pointed to by the pointer are the same after the comparison is completed, they are stored in the first string list in turn. Multiple characters to be verified put into the first string list form a new string in the list and wait for further verification.

[0044] In some embodiments, prior to performing S140, the method further includes:

[0045] Step S143: Obtain matching information between adjacent template characters.

[0046] Step S144: Obtain matching information between adjacent characters to be verified.

[0047] Matching information between adjacent template characters and matching information between adjacent characters to be verified are characteristics of different strings, used to distinguish different strings and improve the accuracy of string matching verification.

[0048] S150. Based on the matching of the character to be verified with the template string, the verified character to be verified is placed into the preset second string list.

[0049] Specifically, the character to be verified is matched and verified one by one with the template characters in the template string according to the obtained sequence to obtain the matching results. The matching results include: the characters are the same and can be used for matching, and the characters are different and need to be matched further. According to the second matching result, the different characters are put into the second string list for further verification. The second string list serves as an expandable string verification space. The construction of the second string list is a key technical concept in this method. That is, appropriately expanding the verification space avoids the pointer in the string selection thread from frequently backtracking to the previous character to be verified for selection, saving a lot of time spent on pointer backtracking. Compared with the device resources occupied by the pointer frequently backtracking to point to a large number of duplicate characters, appropriately expanding the space used by the string verification process will not cause excessive occupation of device resources.

[0050] S160. Obtain the combined string that matches the template string from the second string list.

[0051] The combined strings after being arranged are stored in the second string list. The combined strings that can match the template string are selected from the second string list for further matching and verification.

[0052] Specifically, before executing S160, the following steps are also included:

[0053] Step S161: Obtain the matching information between adjacent characters to be verified in the candidate character layer, and obtain the combined string based on the matching information between adjacent characters to be verified and the matching information between adjacent template characters.

[0054] All individual characters to be verified in the string to be verified have been selected, compared, and categorized by pointers in the string selection thread. The first string list and the second string list contain individual characters or segments of the string to be verified. Combining these individual characters and segments in the order they were obtained will form a complete string to be verified. More specifically, the second string list is divided into a candidate character layer and a free character layer. For example, if two corresponding characters in the template string are AB in the order of their acquisition, and two adjacent characters to be verified are BC, the comparison result is a mismatch, and the characters BC are stored in the free character layer. If the two adjacent characters are AB, the comparison result is a match, and the characters AB are stored in the candidate character layer. It can be understood that the string to be verified can have two or more characters connected together, with no limit on the number. This matching process is repeated multiple times until all characters in the entire string to be verified are compared and matched. This method effectively avoids frequent pointer backtracking and repeated matching when encountering multiple identical characters to be verified. This method effectively avoids missing characters or string segments that meet the matching conditions and being mistakenly judged as mismatched due to the interspersing of different characters. Furthermore, after the characters or string segments within the entire string to be verified are compared and matched, the combined strings that match the template string are obtained. The connection relationships between characters within the template string are summarized, and these connection relationships serve as the basis for selecting scattered characters or string segments to be verified for combination and connection. For example, there are string segments ACE stored in the candidate character layer and string segments DF stored in the free character layer. Segment ACE is obtained in priority over segment DF. Therefore, the connection matching relationship between character E and character D to be verified needs to be obtained. If this connection matching relationship exists in the template string, then segment ACE and segment DF can be combined into a combined string. Similarly, if each character or string segment within the entire template string can find a matching complete combined string in the second string list through this method, then the string to be verified meets the matching verification conditions, and the content transmitted to the vehicle multimedia device host based on the IAP2 protocol can be played in the vehicle's infotainment system.

[0055] This application embodiment expands the string storage and matching verification space to obtain, select, combine, and match the characters or string segments to be verified, saving the time spent on frequent selection and matching verification of the same characters during the matching verification process, and realizing efficient string verification between devices based on the IAP2 protocol.

[0056] like Figure 3As shown, corresponding to the above string verification, this application also provides a string verification device 400. This string verification device 400 includes a unit for performing the above string verification, and the device can be configured in a desktop computer, tablet computer, laptop computer, or other terminal. Specifically, please refer to... Figure 3 The string verification device 400 includes an acquisition unit 401 and a processing unit 402.

[0057] Unit 401 is used to retrieve the string to be verified;

[0058] Processing unit 402 is used to establish a corresponding first string list based on the string to be verified, the first string list including an acquisition sequence; select the character information to be verified from the first string list according to the acquisition sequence; match the character information to be verified with a template string; put the verified character to be verified into a preset second string list according to the matching result of the character to be verified and the template string; and obtain the combined string that matches the template string from the second string list.

[0059] It should be noted that those skilled in the art can clearly understand that the specific implementation process of the above-mentioned string verification device 400 and each unit can be referred to the corresponding description in the foregoing method embodiments. For the sake of convenience and brevity, it will not be repeated here.

[0060] The aforementioned string verification device 400 can be implemented as a computer program, which can perform functions such as... Figure 4 It runs on the computer device shown.

[0061] Please see Figure 4 , Figure 4 This is a schematic block diagram of a computer device provided in an embodiment of this application. The computer device 500 can be a terminal or a server. The terminal can be an electronic device with communication functions, such as a smartphone, tablet, laptop, desktop computer, personal digital assistant, or wearable device. The server can be a standalone server or a server cluster composed of multiple servers.

[0062] See Figure 4 The computer device 500 includes a processor 502, a memory, and a network interface 505 connected via a system bus 501. The memory may include a non-volatile storage medium 503 and internal memory 504.

[0063] The non-volatile storage medium 503 may store an operating system 5031 and a computer program 5032. The computer program 5032 includes program instructions that, when executed, cause the processor 502 to perform a string verification.

[0064] The processor 502 provides computing and control capabilities to support the operation of the entire computer device 500.

[0065] The internal memory 504 provides an environment for the execution of the computer program 5032 in the non-volatile storage medium 503. When the computer program 5032 is executed by the processor 502, the processor 502 can perform a string verification.

[0066] This network interface 505 is used for network communication with other devices. Those skilled in the art will understand that... Figure 4 The structure shown is merely a block diagram of a portion of the structure related to the present application and does not constitute a limitation on the computer device 500 to which the present application is applied. The specific computer device 500 may include more or fewer components than those shown in the figure, or combine certain components, or have different component arrangements.

[0067] It should be understood that in the embodiments of this application, the processor 502 may be a central processing unit (CPU), or it may be other general-purpose processors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. The general-purpose processor may be a microprocessor or any conventional processor.

[0068] It will be understood by those skilled in the art that all or part of the processes in the methods of the above embodiments can be implemented by a computer program instructing related hardware. The computer program includes program instructions and can be stored in a storage medium, which is a computer-readable storage medium. The program instructions are executed by at least one processor in the computer system to implement the process steps of the embodiments of the above methods.

[0069] Therefore, this application also provides a storage medium. This storage medium can be a computer-readable storage medium. The storage medium stores a computer program, wherein the computer program includes program instructions.

[0070] The storage medium can be any computer-readable storage medium capable of storing program code, such as a USB flash drive, portable hard drive, read-only memory (ROM), magnetic disk, or optical disk.

[0071] Those skilled in the art will recognize that the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, computer software, or a combination of both. To clearly illustrate the interchangeability of hardware and software, the components and steps of the various examples have been generally described in terms of functionality in the foregoing description. Whether these functions are implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementations should not be considered beyond the scope of this application.

[0072] In the several embodiments provided in this application, it should be understood that the disclosed apparatus and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative. For example, the division of each unit is merely a logical functional division, and there may be other division methods in actual implementation. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed.

[0073] The steps in the methods of this application embodiment can be adjusted, merged, or deleted according to actual needs. The units in the apparatus of this application embodiment can be merged, divided, or deleted according to actual needs. Furthermore, the functional units in the various embodiments of this application can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit.

[0074] If the integrated unit is implemented as a software functional unit and sold or used as an independent product, it can be stored in a storage medium. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, or all or part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, a terminal, or a network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of this application.

[0075] The above description is merely a specific embodiment of this application, but the scope of protection of this application is not limited thereto. Any person skilled in the art can easily conceive of various equivalent modifications or substitutions within the technical scope disclosed in this application, and these modifications or substitutions should all be covered within the scope of protection of this application. Therefore, the scope of protection of this application should be determined by the scope of the claims.

Claims

1. A string verification method, characterized in that, The method is used to verify strings in the car infotainment system playlist, and the method includes: Get the string to be verified; A first string list is created based on the string to be verified, and the first string list includes the obtained sequence; Based on the obtained sequence, select the character information to be verified from the first string list; The character information to be verified is matched with the template string; Based on the matching results between the character to be verified and the template string, the verified character to be verified is placed into a preset second string list; Obtain the combined string that matches the template string from the second string list; The step of matching the character to be verified with the template string includes: Sequentially obtain individual characters to be verified from the character information to be verified; Each of the characters to be verified is matched with the template characters in the template string; Matching the character to be verified with the template character in the template string includes: Determine whether the character to be verified is consistent with the template character in the selected template string; If they match, the character to be verified is placed in the candidate character layer of the second string list; If they are inconsistent, the character to be verified is placed in the free character layer of the second string list and arranged in the order of placement. Before matching the character to be verified with the template character in the template string, the method further includes: Obtain matching information between adjacent template characters; Obtain matching information between adjacent characters to be verified; Determine whether the matching information between the adjacent template characters is consistent with the matching information between the adjacent characters to be verified. If yes, place both adjacent characters to be verified into the candidate character layer at the same time. If no, place both adjacent characters to be verified into the idle character layer at the same time. Before obtaining the combined string that matches the template string, the method further includes: Obtain matching information between adjacent characters to be verified in the candidate character layer; A combined string is obtained based on the matching information between adjacent characters to be verified and the matching information between adjacent template characters.

2. The string verification method according to claim 1, characterized in that, Before establishing the corresponding first string list based on the string to be verified, the method further includes: The sequence to be obtained is determined based on the character order of the string to be verified.

3. The string verification method according to claim 1, characterized in that, Before selecting the character to be verified from the first string list based on the obtained sequence, the method further includes: A preset acquisition sequence is used to arrange the characters in the string to be verified. The characters in the string to be verified are arranged in a unidirectional sequence according to the obtained sequence.

4. A string verification device, characterized in that, The device includes: The retrieval unit is used to retrieve the string to be verified. The processing unit is configured to establish a corresponding first string list based on the string to be verified, wherein the first string list includes an acquisition sequence; Based on the obtained sequence, select the character information to be verified from the first string list; The character information to be verified is matched with the template string; Based on the matching results between the character to be verified and the template string, the verified character to be verified is placed into a preset second string list; Obtain the combined string that matches the template string from the second string list; The step of matching the character to be verified with the template string includes: Sequentially obtain individual characters to be verified from the character information to be verified; Each of the characters to be verified is matched with the template characters in the template string; Matching the character to be verified with the template character in the template string includes: Determine whether the character to be verified is consistent with the template character in the selected template string; If they match, the character to be verified is placed in the candidate character layer of the second string list; If they are inconsistent, the character to be verified is placed in the free character layer of the second string list and arranged in the order of placement. Before matching the character to be verified with the template character in the template string, the method further includes: Obtain matching information between adjacent template characters; Obtain matching information between adjacent characters to be verified; Determine whether the matching information between the adjacent template characters is consistent with the matching information between the adjacent characters to be verified. If yes, place both adjacent characters to be verified into the candidate character layer at the same time. If no, place both adjacent characters to be verified into the idle character layer at the same time. Before obtaining the combined string that matches the template string, the method further includes: Obtain matching information between adjacent characters to be verified in the candidate character layer; A combined string is obtained based on the matching information between adjacent characters to be verified and the matching information between adjacent template characters.

5. A computer device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that, When the processor executes the computer program, it implements the string verification method as described in any one of claims 1 to 3.

6. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a computer program that, when executed by a processor, implements the string verification method as described in any one of claims 1 to 3.

Images