Dynamic building block searching method and system based on multi-level matching

Abstract

The invention discloses a dynamic building block searching method and system based on multi-level matching. The method comprises the following steps: carrying out standardization processing on a search request on the basis of a preset fuzzy matching rule, and generating a standardized search keyword; based on the standardized search keyword, performing cross-level search on global code logic in the programming work, the global code logic covering building block structures of all screens, roles, backgrounds and function areas; and according to a preset minimum matching principle and a nested building block omission expression rule, screening out a target building block matched with the standardized search keyword from the global code logic. The technical problems that in the prior art, searching efficiency is low, interaction is not friendly, and flexibility is insufficient are solved.

Description

Technical Field

[0001] The present invention relates to the field of computers, and more particularly, to a dynamic block search method and system based on multi-level matching. Background Art

[0002] In recent years, programming education platforms (such as Kitten, KN, etc.) have widely adopted block-based programming as an introductory teaching tool, and its intuitive visual interaction method has greatly reduced the learning threshold. However, as the complexity of the works created by users increases, the amount of code gradually increases, and the number of blocks across roles and screens has increased significantly. The traditional code search function has been difficult to meet the needs of efficient development. Especially in multi-person collaboration or large project development, users need to quickly locate the blocks with specific functions, but the existing search mechanism is still limited to a single role or screen and cannot achieve global retrieval, resulting in low development efficiency. In addition, due to the lack of intelligent matching rules and structured display methods, users often need to spend a lot of time manually switching and troubleshooting when searching for nested blocks or dealing with complex logic, which seriously affects the creation experience.

[0003] In view of the above problems, no effective solution has been proposed yet. Summary of the Invention

[0004] Embodiments of the present invention provide a dynamic block search method and system based on multi-level matching to at least solve the technical problems of low search efficiency, unfriendly interaction, and insufficient flexibility existing in the prior art.

[0005] According to one aspect of the embodiments of the present invention, a dynamic block search method based on multi-level matching is provided, including: performing standardization processing on the search request based on a preset fuzzy matching rule to generate a standardized search keyword; performing cross-level search on the global code logic in the programming work based on the standardized search keyword, where the global code logic covers the block structures of all screens, roles, backgrounds, and function areas; screening out target blocks that match the standardized search keyword from the global code logic according to a preset minimum matching principle and nested block omission representation rule.

[0006] According to another aspect of the embodiments of the present invention, there is also provided a dynamic building block search system based on multi-level matching, including: a fuzzy processing module configured to perform standardization processing on the search request based on a preset fuzzy matching rule to generate a standardized search keyword; a search module configured to perform cross-level search on the global code logic in the programming work based on the standardized search keyword, where the global code logic covers the building block structures of all screens, characters, backgrounds, and function areas; a screening module configured to screen out target building blocks matching the standardized search keyword from the global code logic according to a preset minimum matching principle and a nested building block omission representation rule.

[0007] In the embodiments of the present invention, a dynamic building block search method based on multi-level matching is adopted. By performing standardization processing on the search request based on a preset fuzzy matching rule, a standardized search keyword is generated; based on the standardized search keyword, cross-level search is performed on the global code logic in the programming work, where the global code logic covers the building block structures of all screens, characters, backgrounds, and function areas; according to a preset minimum matching principle and a nested building block omission representation rule, target building blocks matching the standardized search keyword are screened out from the global code logic. Through the above solution, the technical problems of low search efficiency, unfriendly interaction, and insufficient flexibility existing in the prior art are solved. Description of the Drawings

[0008] The drawings described herein are used to provide a further understanding of the present invention and constitute a part of this application. The schematic embodiments of the present invention and their descriptions are used to explain the present invention and do not constitute an improper limitation to the present invention. In the drawings:

[0009] Figure 1 is a flowchart of a dynamic building block search method based on multi-level matching according to an embodiment of the present invention;

[0010] Figure 2 is a flowchart of a dynamic building block search method based on multi-level matching according to an embodiment of the present invention;

[0011] Figure 3 is a flowchart of another dynamic building block search method based on multi-level matching according to an embodiment of the present invention;

[0012] Figure 4 is a flowchart of an implementation method of a minimum matching rule for nested building blocks according to an embodiment of the present invention;

[0013] Figure 5 is a flowchart of a method for performing matching according to an embodiment of the present invention;

[0014] Figure 6Schematic structural diagram of a dynamic building block search system based on multi-level matching according to an embodiment of the present invention;

[0015] Figure 7 Schematic structural diagram of an electronic device suitable for implementing the embodiments of the present disclosure is shown. Specific embodiments

[0016] In order to enable those skilled in the art to better understand the solutions of the present invention, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only a part of the embodiments of the present invention, rather than all the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative efforts shall fall within the protection scope of the present invention.

[0017] It should be noted that the terms "first", "second", etc. in the description and claims of the present invention and the above drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that such data can be interchanged under appropriate circumstances so that the embodiments of the present invention described herein can be implemented in an order different from those illustrated or described herein. In addition, the terms "comprising" and "having" and any variations thereof are intended to cover non-exclusive inclusion. For example, a process, method, system, product or device comprising a series of steps or units is not necessarily limited to those steps or units clearly listed, but may include other steps or units not clearly listed or inherent to these processes, methods, products or devices.

[0018] According to an embodiment of the present invention, a method embodiment of a dynamic building block search method based on multi-level matching is provided. It should be noted that the steps shown in the flowchart of the accompanying drawings can be executed in a computer system such as a set of computer-executable instructions, and although the logical order is shown in the flowchart, in some cases, the steps shown or described can be executed in an order different from that here.

[0019] Figure 1 Is a flowchart of a dynamic building block search method based on multi-level matching according to an embodiment of the present invention, as Figure 1 shown, the method includes the following steps:

[0020] Step S102, perform normalization processing on the search request based on a preset fuzzy matching rule to generate a normalized search keyword;

[0021] For example, ignore the spaces and case differences in the user input, and normalize the search request; split the consecutive characters in the normalized search request into multiple sub-keywords to generate the standardized search keywords. This application realizes the standardization of search keywords through fuzzy matching rules, effectively eliminating format differences such as spaces and case in the user input, and improving the system fault tolerance.

[0022] Step S104, based on the standardized search keywords, perform cross-level search on the global code logic in the programming work, where the global code logic covers the building block structures of all screens, characters, backgrounds, and function areas.

[0023] Define the function area as an independent virtual screen, and establish an independent index for the virtual screen; perform parallel search on the building block structures of all screens, characters, backgrounds, and function areas to generate a cross-level search result set. For example, define the function area as an independent virtual screen, and establish an independent index for the virtual screen; perform parallel search on the building block structures of all screens, characters, backgrounds, and function areas to generate a cross-level search result set. In the embodiment of this application, by virtualizing the function area screen and establishing an independent index, accurate positioning of the multi-level code structure is realized. By parallelly retrieving modules such as screens, characters, and backgrounds, the limitation of traditional single-threaded search is broken through, and the precision rate and response speed of complex building block logic are significantly improved.

[0024] Step S106, according to the preset minimum matching principle and the nested building block omission representation rule, screen out the target building blocks that match the standardized search keywords from the global code logic.

[0025] First, according to the preset minimum matching principle and the nested building block omission representation rule, screen out the target building blocks that match the standardized search keywords from the global code logic.

[0026] Next, aggregate and display the screened target building blocks in a three-level hierarchical structure, where the three-level hierarchical structure includes the screen and function area level, the character level, and the building block level, and the display order is consistent with the actual structure of the programming work; for example, at the screen and function area level, aggregate the corresponding target building blocks by character; at the character level, merge the completely identical building blocks into a single entry and mark the repetition times; at the building block level, display the parent-child relationship of the nested building blocks in a tree structure.

[0027] Then, in response to the user's selection operation on the target building block, automatically locate to the page where the target building block is located, and perform the operations of highlighting and unfolding the folded building blocks. For example, according to the position information of the target building block, jump to the screen or virtual screen page to which it belongs; if the target building block is located in a folded building block group, automatically unfold the folded building block group within the screen or virtual screen page to which it belongs and highlight the target building block.

[0028] The embodiments of the present application can accurately screen target building blocks based on the minimum matching principle, and at the same time optimize the code positioning efficiency by combining three-level aggregation display. Through nested building block intelligent omission and structured hierarchical presentation, both logical integrity and retrieval clarity are taken into account. Automatically locate and unfold the folded code blocks to achieve a "search-locate-interact" closed loop, greatly improving the maintenance convenience and operation intuitiveness of complex programming works.

[0029] The embodiments of the present invention provide another dynamic building block search method based on multi-level matching. In the prior art, there are the following problems with the building block code search function for programming education platforms (such as Kitten, KN): 1) Limited search scope: Traditional search only supports a single role or screen and cannot quickly locate building blocks across the entire scope (multiple roles, multiple screens, function area). 2) Rigid matching rules: The existing matching mechanism is sensitive to spaces and case in the user input, and cannot handle the complex structure of nested building blocks (such as the relationship between parent building blocks and child building blocks). 3) Ambiguous display level: The search results lack a structured display, and it is difficult for users to quickly distinguish the distribution of building blocks for different roles and screens.

[0030] To solve the above problems, the embodiments of the present application provide a Figure 2 dynamic building block search method based on multi-level matching as shown in

[0031] Step S202, global search scope coverage.

[0032] Support building block search across all screens, roles / backgrounds, and function areas, covering the entire code logic of the work. Consider the function area as a "virtual screen" independently, and index the building blocks inside it separately.

[0033] Step S204, intelligent matching rules.

[0034] Use fuzzy matching to ignore the spaces and case differences in the user input, and perform nested building block processing. The text of the parent building block uses ".˙..˙." to represent the nested position of the child building block (such as "move.˙..˙. steps"), and support the minimum matching principle (only display the innermost matching building blocks).

[0035] Step S206, structured display.

[0036] Use a three - level hierarchy for structured display. Aggregate step by step according to "screen / function → role → block", and the display order is consistent with the actual structure of the work. In addition, aggregate the same types. Completely identical blocks under the same role are merged and displayed (for example, "wait for 11 seconds" × 10 times is displayed as "×10").

[0037] Step S208, dynamic positioning and interaction.

[0038] After clicking on the search result, it automatically jumps to the page where the target block is located and highlights it. The folded blocks automatically expand, and it supports interrupting the running and positioning in the debugging mode to ensure seamless connection of the search and debugging processes.

[0039] Step S210, exception handling and compatibility.

[0040] When the network is disconnected or not logged in, it is still possible to search for local cached data, and it will be automatically synchronized after recovery. Hidden / folded blocks (such as teaching plan desks) are only visible to authorized users to avoid information leakage.

[0041] The embodiment of the present application realizes seamless coverage of multiple screens, roles, and function areas based on a global cross - level search mechanism, intelligently analyzes complex structures by combining nested block ellipsis representation and the minimum matching rule, achieves precise focusing through dynamic positioning and automatic expansion interaction, and at the same time adopts an algorithm for aggregating the same type of blocks to compress redundant information. In addition, the solution provided by the present application reduces the cognitive load through structured display and fuzzy matching, and its cross - level architecture design is compatible with abnormal scenarios such as network disconnection and multi - opening, forming an efficient and stable human - machine collaboration paradigm.

[0042] The embodiment of the present invention provides another dynamic block search method based on multi - level matching, as Figure 3 shown, the method includes the following steps:

[0043] Step S302, receive the search request input by the user and perform input pre - processing.

[0044] After the user inputs keywords or phrases through the search interface of the programming education platform, the system first performs standardized pre - processing on the input content. Specifically, it includes: 1) Space removal: Delete all space characters (including consecutive spaces, leading and trailing spaces) in the user input. For example, convert "move 10 steps" to "move 10 steps". 2) Case normalization: Convert the input text to lowercase uniformly. For example, convert "Repeat" to "repeat". 3) Special symbol parsing: Identify and retain symbols related to block logic (such as ".", ":"), and ignore non - logical symbols (such as "!", "?").

[0045] The prior art is sensitive to spaces and upper and lower case, resulting in poor search fault tolerance. The present invention unifies user input into a standardized format through the above preprocessing steps, eliminating the impact of input differences on matching results. For example, the regular expression \s+ is used to match all spaces and replace them with empty strings, and the toLowerCase() function is used to implement upper and lower case conversion, ensuring the robustness of the subsequent matching process.

[0046] Step S304, constructing a global index structure, covering multiple levels of code logic.

[0047] The system extracts building block data from the following levels of the current programming work and builds an index: 1) Screen / background layer: traverse the building blocks in all screens (including the main screen and sub-screens), and record the screen ID and coordinate position to which they belong. 2) Role layer: create an independent index entry for each role (including hidden roles), and associate the screen to which they belong and the building block list. 3) Function area layer: treat the function area as a virtual screen, and index the function building blocks defined in it separately.

[0048] The index data structure can be implemented using a nested hash table, where the first-level key is the screen / function area ID; the second-level key is the role ID; and the third-level value is the metadata list of the building block, including information such as building block text, nesting level, and parent building block reference.

[0049] The prior art only supports single-level search, while the present invention implements global indexing across screens, roles, and function areas through multi-level mapping of hash tables.

[0050] Step S306, parsing the nested building block structure and generating a minimum matching unit.

[0051] For each building block, first mark the nesting relationship. If the building block contains sub-building blocks (such as loops or conditional statements), replace the sub-building block position in its text with the preset placeholder ".˙..˙." (for example, "repeat.˙..˙."). Then, use the minimum matching rule to match. When the user input matches the placeholder area of ​​the parent building block, only the innermost matching sub-building blocks are displayed.

[0052] Specifically, Figure 4 As shown, the implementation process of the nested building block minimum matching rule includes the following steps:

[0053] Step S3062, generate AST and parse the nested relationship.

[0054] First, perform lexical analysis and syntactic segmentation. Input the original code text of the building blocks (e.g., "Repeat 10 times {Move 10 steps}"). Conduct lexical analysis, extract logical keywords (such as "Repeat", "If", "Else") through regular expressions, and segment the code into logical units. Build a syntax tree, and use a Recursive Descent Parser to parse the code structure layer by layer, outputting the AST structure. The root node is the parent building block (such as "Repeat 10 times"), and the child nodes are nested building blocks (such as "Move 10 steps").

[0055] Next, mark the nesting levels. Traverse the AST, record the nesting depth for each node (e.g., the root node is level 1, and the child nodes increase layer by layer). Identify the parent-child relationships. If a node contains child nodes, mark its text range (start and end character positions).

[0056] Traditional methods only store the building block text without parsing the logical structure. The present invention explicitly represents the nesting relationship through the AST, providing structured data support for subsequent matching.

[0057] Step S3064, replace the placeholders and associate metadata.

[0058] Input the AST node and its original text. If the node is a parent building block (including child nodes), replace the text in the area of its child building blocks with a placeholder ".˙..˙.". Replace the original parent building block text "Repeat 10 times {Move 10 steps}" with "Repeat 10 times.˙..˙.". Retain the content of the child building blocks, generate a hash value (SHA-256) for the replaced child building block text to ensure uniqueness. Bind the hash value to the placeholder position and store it in the metadata database (such as Redis or an in-memory hash table).

[0059] The prior art directly stores the complete text and cannot distinguish between the parent and child levels. The present invention realizes a lightweight representation and fast retrieval of the nested structure through placeholder replacement and hash association.

[0060] Step S308, perform matching.

[0061] Based on the preprocessed user input and the global index, perform matching. Use the Levenshtein Distance algorithm, allowing a maximum edit distance of 2 to tolerate spelling mistakes (e.g., "mov" matches "move"). Perform segmented matching on the building block text containing placeholders. For example, split "Repeat.˙..˙." into "Repeat" and ".˙..˙." for separate matching. Set the weight of the completely matched building blocks to 1.0; the weight of the matches with an edit distance of 1 is 0.8; the weight of the matches with an edit distance of 2 is 0.6. Arrange the matching results in descending order of weight and filter out the entries with a weight lower than 0.5.

[0062] Specifically, as Figure 5 shown, the method for performing matching includes the following steps:

[0063] Step S3082, perform reverse maximum matching.

[0064] Input the preprocessed user query (such as "move step") and the global AST forest. Start traversing from the leaf nodes (the deepest sub-blocks) of all ASTs. Based on fuzzy matching using the edit distance (Levenshtein Distance), allow a maximum edit distance of 2.

[0065] Traditional methods use forward traversal and preferentially return high-level results. The present invention ensures preferential matching of the innermost sub-blocks by reverse traversal (from the leaf to the root), avoiding redundancy.

[0066] Step S3084, dynamically generate and verify the minimum matching unit.

[0067] If the reverse matching is successful, the system retrieves the complete text from the meta-database through the sub-block hash value. The verification conditions can be, for example, that the edit distance between the sub-block text and the query ≤ 2; the nesting level of the sub-block is the deepest in the current branch. A conflict resolution strategy is adopted for conflict resolution. When multiple sub-blocks match simultaneously (such as multiple "move" blocks in a nested loop), select the sub-block with the deepest nesting level; if the levels are the same, select the sub-block with the minimum edit distance; if they are still the same, sort by the code position in sequence.

[0068] For example, when the user inputs "move step", match the parent block placeholder "repeat execution... step" (edit distance = 1); retrieve the text corresponding to the sub-block hash value "move 10 steps" (edit distance = 1); return "move 10 steps" instead of the parent block.

[0069] Step S3086, calculate weights and sort the optimized results.

[0070] First, assign weights. For a completely matched sub-block, the basic weight = 1.0; for a placeholder matching the parent block, the basic weight = 0.7 (weight reduction to prioritize sub-blocks); for each additional level of nesting, the weight + 0.1 (for example, the weight of a sub-block at level 3 = 1.0 + 0.2 = 1.2). Sort the results in descending order of weights to ensure that high-weight entries are at the top. When the weights are the same, sort in descending order of the nesting level.

[0071] Traditional methods only sort by text matching degree and ignore the level information. The present invention enhances the priority of deep sub-blocks through a weight superposition mechanism.

[0072] The prior art cannot handle the hierarchical relationship of nested building blocks, resulting in redundant search results. The present invention accurately extracts the minimum matching unit through placeholder replacement and reverse maximum matching, significantly improving the search efficiency for complex structures.

[0073] Step S310, structurally aggregate and display the results.

[0074] The system hierarchically aggregates the candidate result set. It groups by screen or function area ID, and the display order is consistent with the work structure. Within each screen group, it further groups by role ID. It merges exactly the same building blocks under the same role and marks the occurrence times (such as "wait for 1 second × 5"). For building blocks with nested structures, only the minimum matching unit is displayed, and the hierarchical relationship is represented by indentation.

[0075] When the user clicks on a building block entry, the system automatically jumps to the corresponding screen, expands the folded parent building block, and highlights the target building block. In the debugging mode, clicking on the search result will pause the program execution and locate to the code line where the building block is located.

[0076] The search results of the prior art are a flat list, while the present invention enables the user to intuitively perceive the distribution of code logic through three-level aggregation and indentation display. For example, a tree control is used to render the aggregated results, and DOM operations are used to dynamically expand / collapse nodes.

[0077] The present application also provides a dynamic building block search system based on multi-level matching, as Figure 6 shown, including: a fuzzy processing module 62, configured to perform normalization processing on the search request based on a preset fuzzy matching rule to generate a normalized search keyword; a search module 64, configured to perform cross-level search on the global code logic in the programming work based on the normalized search keyword, where the global code logic covers the building block structures of all screens, roles, backgrounds, and function areas; a screening module 66, configured to screen out target building blocks matching the normalized search keyword from the global code logic according to a preset minimum matching principle and a nested building block omission representation rule.

[0078] It should be noted that: for the dynamic building block search system based on multi-level matching provided in the above embodiments, only the above division of each functional module is used for illustration. In actual applications, the above functions can be allocated to different functional modules according to needs, that is, the internal structure of the device is divided into different functional modules to complete all or part of the functions described above. In addition, the dynamic building block search system based on multi-level matching provided in the above embodiments and the method embodiments of the dynamic building block search method based on multi-level matching belong to the same concept, and the specific implementation process can be seen in the method embodiments, which will not be elaborated here.

[0079] Figure 7The structural schematic diagram of an electronic device suitable for implementing the embodiments of the present disclosure is shown. It should be noted that Figure 7 The shown electronic device is only an example and should not impose any limitations on the functions and usage scope of the embodiments of the present disclosure.

[0080] As Figure 7 shown, the electronic device includes a central processing unit (CPU) 1001, which can perform various appropriate actions and processes according to the program stored in the read-only memory (ROM) 1002 or the program loaded from the storage section 1008 into the random access memory (RAM) 1003. In the RAM 1003, various programs and data required for system operation are also stored. The CPU 1001, the ROM 1002, and the RAM 1003 are connected to each other via a bus 1004. The input / output (I / O) interface 1005 is also connected to the bus 1004.

[0081] The following components are connected to the I / O interface 1005: an input section 1006 including a keyboard, a mouse, etc.; an output section 1007 including such as a cathode ray tube (CRT), a liquid crystal display (LCD), etc. and a speaker, etc.; a storage section 1008 including a hard disk, etc.; and a communication section 1009 including a network interface card such as a LAN card, a modem, etc. The communication section 1009 performs communication processing via a network such as the Internet. A drive 1010 is also connected to the I / O interface 1005 as required. A removable medium 1011, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, etc., is installed on the drive 1010 as required, so that the computer program read from it can be installed into the storage section 1008 as required.

[0082] The above are only the preferred embodiments of the present application. It should be noted that for those of ordinary skill in the art, without departing from the principle of the present application, several improvements and refinements can be made, and these improvements and refinements should also be regarded as the protection scope of the present application.

Claims

1. A dynamic building block search method based on multi-level matching, characterized in that, including: performing normalization processing on the search request based on a preset fuzzy matching rule to generate a normalized search keyword; performing cross-level search on the global code logic in the programming work based on the normalized search keyword, wherein the global code logic covers the building block structures of all screens, characters, backgrounds, and function areas; screening out target building blocks matching the normalized search keyword from the global code logic according to a preset minimum matching principle and nested building block omission representation rule.

2. The method according to claim 1, characterized in that, After screening out the target building blocks matching the normalized search keyword from the global code logic, the method further includes: aggregating and displaying the screened target building blocks in a three-level hierarchical structure, wherein the three-level hierarchical structure includes a screen and function area level, a character level, and a building block level, and the display order is consistent with the actual structure of the programming work; responding to a selection operation of the user on the target building block, automatically positioning to the page where the target building block is located, and performing a highlighting display and an expansion operation of the folded building block.

3. The method according to claim 2, wherein Aggregating and displaying the screened target building blocks in a three-level hierarchical structure includes: aggregating corresponding target building blocks by character under the screen and function area level; merging completely identical building blocks into a single entry and marking the repetition times under the character level; displaying the parent-child relationship of nested building blocks in a tree structure under the building block level.

4. The method according to claim 2, wherein Automatically positioning to the page where the target building block is located includes: jumping to the screen or virtual screen page to which it belongs according to the position information of the target building block; if the target building block is located in a folded building block group, automatically expanding the folded building block group and highlighting the target building block within the screen or virtual screen page to which it belongs.

5. The method according to claim 1, characterized in that, Performing normalization processing on the search request based on a preset fuzzy matching rule to generate a normalized search keyword includes: ignoring the spaces and case differences input by the user and performing normalization processing on the search request; splitting the consecutive characters in the normalized search request into multiple sub-keywords to generate the normalized search keyword.

6. The method according to claim 1, characterized in that, Performing cross-level search on the global code logic in the programming work includes: independently defining the function area as a virtual screen and establishing an independent index for the virtual screen; performing parallel search on the building block structures of all screens, characters, backgrounds, and function areas to generate a cross-level search result set.

7. The method according to claim 1, wherein The nested building block omission representation rule includes: inserting a preset symbol in the parent building block text to mark the nested position of the sub-building block; when the normalized search keyword matches a nested building block, preferentially displaying the innermost matching sub-building block and associatively displaying the context information of its parent building block.

8. A dynamic building block search system based on multi-level matching, characterized in that including: a fuzzy processing module configured to perform normalization processing on the search request based on a preset fuzzy matching rule to generate a normalized search keyword; a search module configured to perform cross-level search on the global code logic in the programming work based on the normalized search keyword, wherein the global code logic covers the building block structures of all screens, characters, backgrounds, and function areas; A screening module, configured to screen out target building blocks matching the standardized search keyword from the global code logic according to a preset minimum matching principle and a nested building block omission representation rule.

9. A computer-readable storage medium, characterized in that, The computer-readable storage medium includes a stored program, wherein when the program runs, it controls the device where the computer-readable storage medium is located to execute the method according to any one of claims 1 to 7.

10. A computer program product comprising a computer program, characterized in that, When the computer program is executed by a processor, it implements the steps of the method according to any one of claims 1 to 7.

Images