Signal location information storage method, electronic device and medium

Abstract

The present invention relates to the field of computer technology, and in particular to a signal location information storage method, electronic device and medium. In the process of storing signal location information, the present invention not only retains the storage situation based on code lines, but also stores the signal storage quantities within different code ranges in a balanced manner in multiple storage units, thereby realizing the reasonable storage of signal location information, thereby greatly improving the operation speed related to various signals and improving the signal access efficiency.

Description

Technical Field

[0001] The present invention relates to the field of computer technology, and in particular to a signal location information storage method, electronic equipment and medium. Background Art

[0002] In an Electronic Design Automation (EDA) debugging tool, it is necessary to perform various operations on signals in the code in the source code view. The tool will also prompt the user with as many design signals in the source code view as possible so that the signal position can be quickly located and corresponding operations can be performed.

[0003] Normally, EDA debugging tools use a signal storage method based on code lines. When it is necessary to locate a signal in the source code, the line number is first used to pre-locate the signal list in the line, and then the specific signal is found in the signal list in the line. However, in the source code, the number of signals contained in different code lines varies greatly, and there is often a gap of more than two orders of magnitude. This situation will slow down the random access of signals, resulting in obvious lag in the corresponding signal operations. However, for some signal operations, they usually rely on line information, such as obtaining all signals in a certain line of code, resulting in low signal access efficiency. It can be seen from this that how to reasonably store signal location information and improve signal access efficiency has become a technical problem that needs to be solved urgently. Summary of the invention

[0004] The object of the present invention is to provide a signal location information storage method, electronic device and medium, which can reasonably store signal location information based on code lines and signal quantity, thereby improving signal access efficiency.

[0005] According to a first aspect of the present invention, there is provided a method for storing signal location information, comprising:

[0006] Step S1, initially setting the code row number i=1, the storage unit number j=1;

[0007] Step S2, determine whether there is a signal in the i-th line of the code file to be processed, if yes, execute step S3, otherwise, execute step S8;

[0008] Step S3: Construct the corresponding triple information A in the jth storage unit j , each A j Corresponding to a code processing range, A j =(L j ,F j ,G j ), where L j A j The corresponding code line number, F jIs A j The first character of the corresponding code processing range is relative to the Lth j The offset of the first character of the code line, G j Is A j The corresponding signal list, set L j = i, F j Initially set to 0, L j Initially set to empty, set k = 1, starting from F j Start traversing the Lth j Line of code, execute step S4;

[0009] Step S4, if the kth signal exists in the Lth j Line of code, then obtain the position information D of the kth signal of the Lth j Line of code k Lj , execute step S5, otherwise, set j = j + 1, execute step S8;

[0010] Step S5, compare k with the preset position information quantity threshold M, if k < M, then execute step S6, if k = M, then execute step S7;

[0011] Step S6, store D k Lj Into G j In, set k = k + 1, return to execute step S4;

[0012] Step S7, set j = j + 1, construct the corresponding triple information A in the jth storage unit j , A j = (L j , F j , G j ), set L j = i, set F j To the offset value of the first character after the end position of the (k - 1)th signal relative to the Lth j Line, G j Is initially empty, return to execute step S6;

[0013] Step S8, compare i with the total number of code lines N of the code file to be processed, if i < N, then set i = i + 1, return to execute step S2, otherwise, end the process.

[0014] According to the second aspect of the present invention, there is provided an electronic device, including: at least one processor; and, a memory communicatively connected to the at least one processor; wherein, the memory stores instructions executable by the at least one processor, and the instructions are configured to execute the method described in the first aspect of the present invention.

[0015] According to a third aspect of the present invention, there is provided a computer-readable storage medium storing computer-executable instructions, wherein the computer instructions are used to execute the method described in the first aspect of the present invention.

[0016] Compared with the prior art, the present invention has obvious advantages and beneficial effects. By means of the above technical solution, the signal location information storage method, electronic device and medium provided by the present invention can achieve considerable technical advancement and practicality, and have wide industrial utilization value, and at least have the following beneficial effects:

[0017] In the process of storing signal position information, the present invention not only retains the storage situation based on code lines, but also evenly stores the signal storage quantities within different code ranges in multiple storage units, thereby realizing the reasonable storage of signal position information, thereby greatly improving the operation speed related to various signals and improving the signal access efficiency. BRIEF DESCRIPTION OF THE DRAWINGS

[0018] In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the following briefly introduces the drawings required for use in the description of the embodiments. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.

[0019] Figure 1 A flow chart of a signal location information storage method provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0020] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative work are within the scope of protection of the present invention.

[0021] The embodiment of the present invention provides a method for storing signal location information. Figure 1 As shown, including:

[0022] Step S1, initially setting the code row number i=1 and the storage unit number j=1.

[0023] The code line number is the code line number in the code file to be processed, and the storage unit is used to store triple information.

[0024] Step S2: determine whether there is a signal in the i-th line of the code file to be processed. If so, execute step S3; otherwise, execute step S8.

[0025] Among them, in the code file to be processed, some code lines have signals, and some code lines do not have signals. When storing signal position information, it is only necessary to perform signal storage operations on the code lines where signals exist.

[0026] Step S3: Construct the corresponding triple information A in the jth storage unit j , each A j Corresponding to a code processing range, A j =(L j ,F j ,G j ), where L j A j The corresponding code line number, F j A j The first character of the corresponding code processing range is relative to the Lth j The offset of the first character of the code line, G j A j Corresponding signal list, set L j =i,F j The initial setting is 0, L j Initial setting is empty, set k = 1, from F j Start traversing the Lth j Line of code, execute step S4.

[0027] Among them, A j The corresponding code processing range is L j A continuous section of code in a line of code. j The signal in is A j The corresponding code handles the signals included in the range. j The corresponding code processing range is arranged and spliced ​​together as needed from A1 to form a code file to be processed. It should be noted that when executing step S3, the created triple information is the Lth j The first triplet of line code is from the Lth j The first character of the line code is processed first, so F j For L j The first character of the line code is relative to the Lth j The offset of the first character of the code line is 0.

[0028] Step S4: If the Lth j If there is a k-th signal in the line code, get the L-th j The position information D of the kth signal of the line code k Lj , execute step S5, otherwise, set j=j+1 and execute step S8.

[0029] It should be noted that each code line with signals may occupy one storage unit or multiple storage units depending on the number of signals it contains. Therefore, when the k-th signal does not exist in the L j -th line of code, it indicates that the signal position information in the current code line has been processed, and the signal position information of the next code line needs to be processed. A new triple information needs to be created. Therefore, when the k-th signal does not exist in the L j -th line of code, it is necessary to set j = j + 1.

[0030] Step S5: Compare k with the preset threshold M for the number of position information. If k < M, execute Step S6; if k = M, execute Step S7.

[0031] Among them, the preset threshold M for the number of position information is the maximum value of the number of signal position information that can be stored in the signal list. It can be determined comprehensively according to factors such as the number of signals, the signal distribution, and the signal access requirements in the code file to be processed.

[0032] Step S6: Store D k Lj into G j , set k = k + 1, and return to execute Step S4.

[0033] It should be noted that D k Lj is stored into G j in sequence according to the order.

[0034] Step S7: Set j = j + 1, construct the corresponding triple information A j in the j-th storage unit, A j = (L j , F j , G j ), set L j = i, set F j as the offset value of the first character after the end position of the (k - 1)-th signal relative to the L j -th line, G j is initially empty, and return to execute Step S6.

[0035] It should be noted that when k = M, it indicates that the current G j is full, and one G j is not enough to store the signal position information of the L j -th line. A new triple information needs to be created. Therefore, set j = j + 1.

[0036] Step S8: Compare i with the total number of code lines N of the code file to be processed. If i < N, set i = i + 1 and return to execute Step S2; otherwise, end the process.

[0037] As an example, D k Lj =(D1 k Lj ,D2 k Lj ,D3 k Lj ), D1 k Lj For L j The signal identifier of the kth signal in the line code, D2 k Lj For L j The starting position information of the line code, D3 k Lj For L j The signal length of the line code. j The starting position information of the line code can be specifically D1 k Lj The starting position is L j The offset value in the line code can also be D1 k Lj The starting position of D is the offset value of the code file to be processed. It should be noted that according to specific application requirements, D k Lj You can also set other signal attribute information.

[0038] It should be noted that, through steps S1 to S8, it is achieved that the storage situation based on code lines is retained, and at the same time, the signal storage quantities within different code ranges are evenly stored in multiple storage units, thereby achieving reasonable storage of signal location information and facilitating signal access. On this basis, the following signal access embodiments are listed below.

[0039] Embodiment 1

[0040] Embodiment 1 is D2 k Lj D1 k Lj The starting position is L j Under the premise of the offset value in the line code, based on the scenario of accessing a single target signal in the signal position storage structure of the embodiment of the present invention, specifically, after step S8, the following further includes:

[0041] Step S10: Get the row number L corresponding to the target access signal x and the target signal relative to the L x Line code offset value F x .

[0042] Step S20, traverse all Aj , L j =L x A j Determined as Candidate A j , if there is only one candidate A j , then candidate A j Determined as Target A j , execute step S40, if there are multiple candidate A j , then execute step S30.

[0043] It should be noted that since a line of code may contain one or more A j , so candidate A j There may be one or more.

[0044] Step S30: traverse all candidate A j , will satisfy F j ≤F x <F j+1 Candidate A j Determined as Target A j , execute step S40.

[0045] It should be noted that when F is satisfied j ≤F x <F j+1 When the target signal is located at A j The corresponding G j Therefore, F j ≤F x <F j+1 Candidate A j Determined as Target A j .

[0046] Step S50: Based on F x Query target A j The corresponding G j , will satisfy D2 k Lj ≤F x <D2 k+1 Lj D2 k Lj The corresponding D k Lj Determined as target D k Lj .

[0047] It should be noted that, because the signal has a certain length, the target signal obtained is relative to the Lth x Line code offset value F x It may be the offset value of a character in the signal.

[0048] Embodiment 2

[0049] Embodiment 2 is that in D2 k Lj D1 k Lj Under the premise that the starting position of the code file to be processed is the offset value in the code file to be processed, based on the signal position storage structure of the embodiment of the present invention, a single target signal is accessed. Specifically, the L j The offset value of the first character of the line code relative to the code file to be processed is Q j , after step S8, the step further includes:

[0050] Step C10: Obtain the offset value F corresponding to the target signal relative to the code file to be processed y .

[0051] Step C20, traverse all A j , will satisfy F j +Q j ≤F y <F j+1 +Q j A j Determined as Target A j .

[0052] It should be noted that because F y is the offset value relative to the code file to be processed, and F j A j Corresponding to the Lth j The offset of the first character of the code line, so you need to change F y With F j +Q j and F j+1 +Q j In contrast, when F j +Q j ≤F y <F j+1 +Q j When the target signal is located at A j The corresponding G j Therefore, F j +Q j ≤F y <F j+1 +Q j A j Determined as Target A j .

[0053] Step C30: Based on F y Query target A j The corresponding G j , will satisfy D2k Lj ≤F y <D2 k+1 Lj D2 k Lj The corresponding D k Lj Determined as target D k Lj .

[0054] Embodiment 3

[0055] Because A j The code line information is included, so the position information of all signals corresponding to a certain line can be quickly found. Specifically, after step S8, the following is also included:

[0056] Step D10: Get the target row number L y .

[0057] Step D20, traverse all A j , L j =L y All A's j Determine target A j .

[0058] Step D30: Set all target A j The corresponding G j D k Lj Determined as target D k Lj .

[0059] It should be noted that in Example 3, j The starting position information of the line code can be specifically D1 k Lj The starting position is L j The offset value in the line code can also be D1 k Lj The starting position of the code is the offset value of the code file to be processed.

[0060] Embodiment 4:

[0061] Embodiment 4 is in D2 k Lj D1 k Lj The starting position is L j Under the premise of the offset value in the line code, the continuous range code area is accessed. Specifically, the L j The offset value of the first character of the line code relative to the code file to be processed is Q j , after step S8, the step further includes:

[0062] Step E10: Obtain the offset value F of the target start position relative to the code file to be processed z and the target end position relative to the offset value F in the code file to be processed h .

[0063] Step E20, traverse all A j , will satisfy F j +Q j ≤F z <F j+1 +Q j A j Determine the goal to start A j , will satisfy F j +Q j ≤F h <F j+1 +Q j A j Determine the target end A j .

[0064] Understandably, the goal is to start A j F z A j , target end A j F h A j .

[0065] Step E30: Determine target start A j and target end A j Is it the same A? j If so, execute step E40; otherwise, execute step E50.

[0066] Step E40, traverse target start A j The corresponding G j , will satisfy D2 k Lj +Q j ≤F z <D2 k+1 Lj +Q j D2 k Lj The corresponding D k Lj Determine the target to start D k Lj , will satisfy D2 k Lj +Q j ≤F h <D2 k+1 Lj +Qj D2 k Lj The corresponding D k Lj Confirm as target end D k Lj , set the target to start A j The corresponding G j Start at the target D k Lj To the end of the target D k Lj All D k Lj Determined as target D k Lj .

[0067] It should be noted that, since in step E40, the target starts A j and target end A j For the same A j Therefore, in step E40, A is started based on the target j Or the target ends A j Just execute it.

[0068] Step E50, traverse target start A j The corresponding G j , will satisfy D2 k Lj +Q j ≤F z <D2 k+1 Lj +Q j D2 k Lj The corresponding D k Lj Determine the target to start D k Lj ; End of traversal target A j , will satisfy D2 k Lj +Q j ≤F h <D2 k+1 Lj +Q j D2 k Lj The corresponding D k Lj Confirm as target end D k Lj ; Start the target A j The corresponding G j Start at the target D k Lj To the last D kLj 、Goal Start A j End with target A j All A between j The corresponding D k Lj 、Target End A j The corresponding G j The first D k Lj To the end of the target D k Lj Determined as target D k Lj .

[0069] It should be noted that in step E40 and step E50, since D2 k Lj D1 k Lj The starting position is L j The offset value in the line code, and F z is the offset value of the target start position relative to the code file to be processed, F h is the offset value of the target start position relative to the code file to be processed. Therefore, when comparing, D2 k Lj 、D2 k+1 Lj Add Q j .

[0070] The target start position is relative to the offset value F in the code file to be processed z and the target end position relative to the offset value F in the code file to be processed h

[0071] Embodiment 5

[0072] Example 5 is D2 k Lj D1 k Lj Under the premise that the starting position of is the offset value in the code file to be processed, the continuous range code area is accessed. Specifically, after step S8, the following is further included:

[0073] Step F10: Obtain the offset value F of the target start position relative to the code file to be processed z and the target end position relative to the offset value F in the code file to be processed h .

[0074] Understandably, the goal is to start A j F z A j , target end A jF h A j .

[0075] Step F20, traverse all A j , will satisfy F j +Q j ≤F z <F j+1 +Q j A j Determine the goal to start A j , will satisfy F j +Q j ≤F h ≤ <F j+1 +Q j A j Determine the target end A j .

[0076] Step F30, determine the target start A j and target end A j Is it the same A? j , if yes, go to step F40, otherwise, go to step F50;

[0077] Step F40, traverse target start A j The corresponding G j , will satisfy D2 k Lj ≤F z <D2 k+1 Lj D2 k Lj The corresponding D k Lj Determine the target to start D k Lj , will satisfy D2 k Lj ≤F h <D2 k+1 Lj D2 k Lj The corresponding D k Lj Confirm as target end D k Lj , set the target to start A j The corresponding G j Start at the target D k Lj To the end of the target D k Lj All D k Lj Determined as target D k Lj .

[0078] It should be noted that, since in step E40, the target starts A j and target end A j For the same A j Therefore, in step E40, A is started based on the target j Or the target ends A j Just execute it.

[0079] Step F50, traverse target start A j The corresponding G j , will satisfy D2 k Lj ≤F z <D2 k+1 Lj D2 k Lj The corresponding D k Lj Determine the target to start D k Lj ; End of traversal target A j , will satisfy D2 k Lj ≤F h <D2 k+1 Lj D2 k Lj The corresponding D k Lj Confirm as target end D k Lj ; Start the target A j The corresponding G j Start at the target D k Lj To the last D k Lj 、Goal Start A j End with target A j All A between j The corresponding D k Lj 、Target End A j The corresponding G j The first D k Lj To the end of the target D k Lj Determined as target D k Lj .

[0080] It should be noted that in step F40 and step F50, since D2 k Lj D1 k LjThe offset value of the starting position in the code file to be processed, F z is the offset value of the target start position relative to the code file to be processed, F h It is the offset value of the target start position relative to the code file to be processed, so when comparing, it can be compared directly.

[0081] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as those commonly understood by those skilled in the art of the present invention. The terms used in the specification of the present invention herein are only for the purpose of describing specific embodiments and are not intended to limit the present invention.

[0082] It should be noted that some exemplary embodiments are described as processes or methods depicted as flow charts. Although the flow charts describe the steps as sequential processes, many of the steps can be implemented in parallel, concurrently or simultaneously. In addition, the order of the steps can be rearranged. The process can be terminated when its operation is completed, but it can also have additional steps not included in the accompanying drawings. The process can correspond to a method, function, procedure, subroutine, subprogram, etc.

[0083] An embodiment of the present invention also provides an electronic device, comprising: at least one processor; and a memory communicatively connected to the at least one processor; wherein the memory stores instructions executable by the at least one processor, and the instructions are configured to execute the method described in the embodiment of the present invention.

[0084] The embodiment of the present invention further provides a computer-readable storage medium storing computer-executable instructions, wherein the computer instructions are used to execute the method described in the embodiment of the present invention.

[0085] In the process of storing signal location information, the embodiment of the present invention not only retains the storage situation based on code lines, but also evenly stores the signal storage quantities within different code ranges in multiple storage units, thereby realizing the reasonable storage of signal location information, thereby greatly improving the speed of various signal-related operations and improving signal access efficiency.

[0086] The above description is only a preferred embodiment of the present invention and does not limit the present invention in any form. Although the present invention has been disclosed as a preferred embodiment as above, it is not used to limit the present invention. Any technician familiar with this profession can make some changes or modifications to equivalent embodiments of equivalent changes using the technical contents disclosed above without departing from the scope of the technical solution of the present invention. However, any simple modification, equivalent change and modification made to the above embodiments based on the technical essence of the present invention without departing from the content of the technical solution of the present invention still falls within the scope of the technical solution of the present invention.

Claims

1. A method for storing signal location information, characterized in that: Including: Step S1: Initially set the line number i of the code to 1 and the storage unit number j to 1; Step S2: Determine whether there is a signal in the i-th line of the code file to be processed. If there is, execute Step S3; otherwise, execute Step S8; Step S3: Construct the corresponding triple information A in the jth storage unit j , each A j Corresponding to a code processing range, A j =(L j ,F j ,G j ), where L j A j The corresponding code line number, F j A j The first character of the corresponding code processing range is relative to the Lth j The offset of the first character of the code line, G j A j Corresponding signal list, set L j =i,F j The initial setting is 0, L j Initial setting is empty, set k = 1, from F j Start traversing the Lth j Line code, execute step S4; Step S4: If the Lth j If there is a k-th signal in the line code, get the L-th j The position information D of the kth signal of the line code k Lj , execute step S5, otherwise, set j=j+1 and execute step S8; Step S5: Compare k with the preset position information quantity threshold M. If k < M, execute Step S6; if k = M, execute Step S7; Step S6: D k Lj Save to G j , set k=k+1, and return to step S4; Step S7: Set j=j+1, and construct the corresponding triplet information A in the jth storage unit. j , A j =(L j ,F j ,G j ), set L j =i, set F j The first character after the k-1th signal end position is relative to the Lth j The offset value of the row, G j Initially empty, return to execute step S6; Step S8: Compare i with the total number of code lines N of the code file to be processed. If i < N, set i = i + 1 and return to execute Step S2; otherwise, end the process.

2. The method according to claim 1, wherein: D k Lj =(D1 k Lj ,D2 k Lj ,D3 k Lj ), D1 k Lj For L j The signal identifier of the kth signal in the line code, D2 k Lj For L j The starting position information of the line code, D3 k Lj For L j The signal length of the line code.

3. The method according to claim 2, wherein: D2 k Lj D1 k Lj The starting position is L j The offset value in the line code, the step S8 further comprises: Step S10: Get the row number L corresponding to the target access signal x and the target signal relative to the L x Line code offset value F x ; Step S20, traverse all A j , L j =L x A j Determined as Candidate A j , if there is only one candidate A j , then candidate A j Determined as Target A j , execute step S40, if there are multiple candidate A j , then execute step S30; Step S30: traverse all candidate A j , will satisfy F j ≤F x <F j+1 Candidate A j Determined as Target A j , execute step S40; Step S50: Based on F x Query target A j The corresponding G j , will satisfy D2 k Lj ≤F x <D2 k+1 Lj D2 k Lj The corresponding D k Lj Determined as target D k Lj .

4. The method according to claim 2, characterized in that: D2 k Lj D1 k Lj The offset value of the starting position in the code file to be processed, L j The offset value of the first character of the line code relative to the code file to be processed is Q j , after step S8, the step further includes: Step C10: Obtain the offset value F corresponding to the target signal relative to the code file to be processed y ; Step C20, traverse all A j , will satisfy F j +Q j ≤F y <F j+1 +Q j A j Determined as Target A j ; Step C30: Based on F y Query target A j The corresponding G j , will satisfy D2 k Lj ≤F y <D2 k+1 Lj D2 k Lj The corresponding D k Lj Determined as target D k Lj .

5. The method according to claim 2, characterized in that: After Step S8, it further includes: Step D10: Get the target row number L y ; Step D20, traverse all A j , L j =L y All A's j Determine target A j ; Step D30: Set all target A j The corresponding G j D k Lj Determined as target D k Lj .

6. The method according to claim 2, wherein: D2 k Lj D1 k Lj The starting position is L j Offset value in line code, L j The offset value of the first character of the line code relative to the code file to be processed is Q j , after step S8, the step further includes: Step E10: Obtain the offset value F of the target start position relative to the code file to be processed z and the target end position relative to the offset value F in the code file to be processed h ; Step E20, traverse all A j , will satisfy F j +Q j ≤F z <F j+1 +Q j A j Determine the goal to start A j , will satisfy F j +Q j ≤F h <F j+1 +Q j A j Confirmed as target end A j ; Step E30: Determine target start A j and target end A j Is it the same A? j , if yes, execute step E40, otherwise, execute step E50; Step E40, traverse target start A j The corresponding G j , will satisfy D2 k Lj +Q j ≤F z <D2 k+1 Lj +Q j D2 k Lj The corresponding D k Lj Determine the target to start D k Lj , will satisfy D2 k Lj +Q j ≤F h <D2 k+1 Lj +Q j D2 k Lj The corresponding D k Lj Confirm as target end D k Lj , set the target to start A j The corresponding G j Start at the target D k Lj To the end of the target D k Lj All D k Lj Determined as target D k Lj ; Step E50, traverse target start A j The corresponding G j , will satisfy D2 k Lj +Q j ≤F z <D2 k+1 Lj +Q j D2 k Lj The corresponding D k Lj Determine the target to start D k Lj ; End of traversal target A j , will satisfy D2 k Lj +Q j ≤F h <D2 k+1 Lj +Q j D2 k Lj The corresponding D k Lj Confirm as target end D k Lj ; Start the target A j The corresponding G j Start at the target D k Lj To the last D k Lj 、Goal Start A j End with target A j All A between j The corresponding D k Lj 、Target End A j The corresponding G j The first D k Lj To the end of the target D k Lj Determined as target D k Lj .

7. The method according to claim 2, wherein: D2 k Lj D1 k Lj The offset value of the starting position of in the code file to be processed, after step S8, further includes: Step F10: Obtain the offset value F of the target start position relative to the code file to be processed z and the target end position relative to the offset value F in the code file to be processed h ; Step F20, traverse all A j , will satisfy F j +Q j ≤F z <F j+1 +Q j A j Determine the goal to start A j , will satisfy F j +Q j ≤F h <F j+1 +Q j A j Determine the target end A j ; Step F30, determine the target start A j and target end A j Is it the same A? j , if yes, go to step F40, otherwise, go to step F50; Step F40, traverse target start A j The corresponding G j , will satisfy D2 k Lj ≤F z <D2 k+1 Lj D2 k Lj The corresponding D k Lj Determine the target to start D k Lj , will satisfy D2 k Lj ≤F h <D2 k+1 Lj D2 k Lj The corresponding D k Lj Confirm as target end D k Lj , set the target to start A j The corresponding G j Start at the target D k Lj To the end of the target D k Lj All D k Lj Determined as target D k Lj ; Step F50, traverse target start A j The corresponding G j , will satisfy D2 k Lj ≤F z <D2 k+1 Lj D2 k Lj The corresponding D k Lj Determine the target to start D k Lj ; End of traversal target A j , will satisfy D2 k Lj ≤F h <D2 k+1 Lj D2 k Lj The corresponding D k Lj Confirm as target end D k Lj ; Start the target A j The corresponding G j Start at the target D k Lj To the last D k Lj 、Goal Start A j End with target A j All A between j The corresponding D k Lj 、Target End A j The corresponding G j The first D k Lj To the end of the target D k Lj Determined as target D k Lj .

8. An electronic device, characterized in that: Including: At least one processor; And a memory communicatively connected to the at least one processor; Wherein, the memory stores instructions executable by the at least one processor, and the instructions are configured to execute the method according to any one of the preceding claims 1-7.

9. A computer-readable storage medium, characterized in that: Stores computer-executable instructions for executing the method according to any one of the preceding claims 1-7.

Images