CN112507174A - Task link operation method and device, storage medium and electronic device - Google Patents
Task link operation method and device, storage medium and electronic device Download PDFInfo
- Publication number
- CN112507174A CN112507174A CN202011566131.8A CN202011566131A CN112507174A CN 112507174 A CN112507174 A CN 112507174A CN 202011566131 A CN202011566131 A CN 202011566131A CN 112507174 A CN112507174 A CN 112507174A
- Authority
- CN
- China
- Prior art keywords
- link
- node
- task
- link node
- mark
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 61
- 239000003550 marker Substances 0.000 claims description 32
- 230000015654 memory Effects 0.000 claims description 19
- 238000004590 computer program Methods 0.000 claims description 6
- 238000005516 engineering process Methods 0.000 abstract description 6
- 230000008569 process Effects 0.000 description 17
- 230000008878 coupling Effects 0.000 description 8
- 238000010168 coupling process Methods 0.000 description 8
- 238000005859 coupling reaction Methods 0.000 description 8
- 238000010586 diagram Methods 0.000 description 8
- 230000005540 biological transmission Effects 0.000 description 6
- 230000008859 change Effects 0.000 description 4
- 238000006073 displacement reaction Methods 0.000 description 4
- 230000000694 effects Effects 0.000 description 4
- 238000012545 processing Methods 0.000 description 4
- 238000012217 deletion Methods 0.000 description 3
- 230000037430 deletion Effects 0.000 description 3
- 230000003287 optical effect Effects 0.000 description 3
- 230000006399 behavior Effects 0.000 description 2
- 238000004891 communication Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000011017 operating method Methods 0.000 description 2
- 238000004364 calculation method Methods 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 239000000203 mixture Substances 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/901—Indexing; Data structures therefor; Storage structures
- G06F16/9024—Graphs; Linked lists
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Software Systems (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The application relates to an operation method, an operation device, a storage medium and an electronic device of a task link, wherein the method comprises the following steps: creating a first task link in a task link group as a sublink of a second task link; determining the link identifier of the second task link as a parent mark of the first task link, wherein the parent mark is used for marking a parent link of the task link, and the first task link inherits a link node list of an upper link of the first task link as a link node list of the first task link; and under the condition that the operation executed on the first task link is detected, determining a target link node mark of the link node in the link node list of the first task link according to the root link node mark of the root link in the task link group. The method and the device solve the technical problem that the mode of inheritance correlation between task links in the related technology is poor in convenience.
Description
Technical Field
The present application relates to the field of computers, and in particular, to a method and an apparatus for operating a task link, a storage medium, and an electronic apparatus.
Background
With the development of the internet, tasks processed by a computer are more and more complex, sometimes the tasks need to be stored in a tree link form, and at present, a way of recording the sequence relation among the tasks is to mark special marks on task nodes in a parent link and store the task nodes in a child link, so that inheritance association of parent and child links is completed. The method can cause that corresponding updating operation can be completed only by traversing all the sub-links to update the task node information of the parent link stored in the sub-link one by one when the state of the parent link is updated every time, and has the disadvantages of complex process, poor convenience and easy error.
In view of the above problems, no effective solution has been proposed.
Disclosure of Invention
The application provides an operation method, an operation device, a storage medium and an electronic device of task links, which are used for at least solving the technical problem of poor convenience of a mode of inheritance association between task links in the related technology.
According to an aspect of an embodiment of the present application, there is provided an operation method of a task link, including: creating a first task link in a task link group as a sublink of a second task link; determining a link identifier of the second task link as a parent tag of the first task link, wherein the parent tag is used for tagging a parent link of the task link, and the first task link inherits a link node list of an upper link of the first task link as a link node list of the first task link; and under the condition that the operation executed on the first task link is detected, determining a target link node mark of a link node in a link node list of the first task link according to a root link node mark of a root link in the task link group.
According to another aspect of the embodiments of the present application, there is also provided an operating device of a task link, including: the creating module is used for creating a first task link in the task link group as a sub-link of a second task link; a first determining module, configured to determine a link identifier of the second task link as a parent flag of the first task link, where the parent flag is used to flag a parent link of the task link, and the first task link inherits a link node list of an upper link of the first task link as a link node list of the first task link; and a second determining module, configured to, when it is detected that an operation is performed on the first task link, determine, according to a root link node flag of a root link in the task link group, a target link node flag of a link node in a link node list of the first task link.
According to another aspect of the embodiments of the present application, there is also provided a storage medium including a stored program which, when executed, performs the above-described method.
According to another aspect of the embodiments of the present application, there is also provided an electronic device, including a memory, a processor, and a computer program stored on the memory and executable on the processor, wherein the processor executes the above method through the computer program.
According to another aspect of embodiments of the present application, there is also provided a computer program product or a computer program comprising computer instructions stored in a computer readable storage medium; the processor of the computer device reads the computer instructions from the computer-readable storage medium, and the processor executes the computer instructions to cause the computer device to perform the steps of any embodiment of the method of operation of the task link described above.
In the embodiment of the application, a first task link is created in a task link group to serve as a sub-link of a second task link; determining the link identifier of the second task link as a parent mark of the first task link, wherein the parent mark is used for marking a parent link of the task link, and the first task link inherits a link node list of an upper link of the first task link as a link node list of the first task link; under the condition that the operation on the first task link is detected, the target link node mark of the link node in the link node list of the first task link is determined according to the root link node mark of the root link in the task link group, when the first task link is created in the task link group as the sublink of the second task link, the link identification of the second task link is used as the father mark of the first task link to mark the father link of the first task link, so that the first task link inherits the link node list of the upper link as the link node list of the first task link, the information of the link node in the father link does not need to be stored in the sublink, the sublink does not need to maintain the state of the father link, and the storage space is reduced. When the first task link is detected to be operated, the target link node mark of the link node in the link node list of the first task link which is operated is dynamically determined according to the root link node mark of the root link in the task link group, so that the aim of dynamically marking the link node in the sub-link is achieved, the coupling degree between parent links and child links is reduced, the technical effect of improving the convenience of the mode of inheritance association between task links is achieved, and the technical problem that the convenience of the mode of inheritance association between task links in the related technology is poor is solved.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the invention and together with the description, serve to explain the principles of the invention.
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, and it is obvious for those skilled in the art that other drawings can be obtained according to the drawings without inventive exercise.
FIG. 1 is a schematic diagram of a hardware environment for a method of operation of a task link according to an embodiment of the present application;
FIG. 2 is a flow chart of a method of operation of an alternative task link according to an embodiment of the present application;
FIG. 3 is a diagram illustrating an inheritance relationship between task links according to an embodiment of the present application;
FIG. 4 is a schematic diagram of an alternative task link operating device according to an embodiment of the present application;
fig. 5 is a block diagram of an electronic device according to an embodiment of the present application.
Detailed Description
In order to make the technical solutions better understood by those skilled in the art, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only partial embodiments of the present application, but not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
It should be noted that the terms "first," "second," and the like in the description and claims of this application and in the drawings described above are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used is interchangeable under appropriate circumstances such that the embodiments of the application described herein are capable of operation in sequences other than those illustrated or described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
According to an aspect of embodiments of the present application, there is provided an embodiment of a method of operation of a task link.
Alternatively, in the present embodiment, the operation method of the task link may be applied to a hardware environment formed by the terminal 101 and the server 103 as shown in fig. 1. As shown in fig. 1, a server 103 is connected to a terminal 101 through a network, which may be used to provide services (such as game services, application services, etc.) for the terminal or a client installed on the terminal, and a database may be provided on the server or separately from the server for providing data storage services for the server 103, and the network includes but is not limited to: the terminal 101 is not limited to a PC, a mobile phone, a tablet computer, and the like. The method for operating the task link according to the embodiment of the present application may be executed by the server 103, the terminal 101, or both the server 103 and the terminal 101. The operation method of the terminal 101 for executing the task link according to the embodiment of the present application may also be executed by a client installed thereon.
Fig. 2 is a flowchart of an operation method of an optional task link according to an embodiment of the present application, and as shown in fig. 2, the method may include the following steps:
step S202, a first task link is established in a task link group to be used as a sub-link of a second task link;
step S204, determining a link identifier of the second task link as a parent flag of the first task link, where the parent flag is used to flag a parent link of the task link, and the first task link inherits a link node list of an upper link of the first task link as a link node list of the first task link;
step S206, when it is detected that the operation is performed on the first task link, determining a target link node flag of a link node in the link node list of the first task link according to the root link node flag of the root link in the task link group.
Through the steps S202 to S206, when the first task link is created in the task link group as the child link of the second task link, the link identifier of the second task link is used as the parent tag of the first task link to tag the parent link of the first task link, so that the first task link inherits the link node list of the upper link thereof as its own link node list, information of the link node in the parent link does not need to be stored in the child link, the child link does not need to maintain the state of the parent link, and the storage space is reduced. When the first task link is detected to be operated, the target link node mark of the link node in the link node list of the first task link which is operated is dynamically determined according to the root link node mark of the root link in the task link group, so that the aim of dynamically marking the link node in the sub-link is achieved, the coupling degree between parent links and child links is reduced, the technical effect of improving the convenience of the mode of inheritance association between task links is achieved, and the technical problem that the convenience of the mode of inheritance association between task links in the related technology is poor is solved.
In the technical solution provided in step S202, the task link is a decision chain formed by ordered arrangement of task nodes. The parent-child link is an inheritance relationship representation between links, and the child link inherits the task node of the parent link.
Optionally, in this embodiment, the task link group may be, but is not limited to, a task link set composed of task links having a parent-child inheritance relationship. The task link group may include only a second task link originally, and after the first task link is created as a sub-link of the second task link, the task link group includes the second task link and the first task link, where the second task link is a parent link of the first task link, and the first task link is a sub-link of the second task link. The task link group may originally include not only the second task link, but also a parent link of the second task link, that is, a third task link, and after the first task link is created as a child link of the second task link, the task link group includes the third task link, the second task link and the first task link, where the third task link is the parent link of the second task link, the second task link is the child link of the third task link, the second task link is the parent link of the first task link, and the first task link is the child link of the second task link. Or the task link group may originally include more links having an inheritance relationship, and the inheritance relationship between the links is similar to that described above, and will not be described herein again.
In the technical solution provided in step S204, a link identifier (link ID) is used to uniquely identify a link. The parent tag is used for tagging the parent link of the task link, and the link identification of the parent link is stored on the parent tag corresponding to each task link, so that the child link can automatically inherit the link node list of the upper link thereof as the link node list of the child link.
Optionally, in this embodiment, each task link of the task link group as a child link inherits the link node list of its upper link, where the upper link refers to the parent link of the child link and the parent link of its parent link, and so on, to the root link.
Such as: fig. 3 is a schematic diagram of an inheritance relationship between task links according to an embodiment of the present application, and as shown in fig. 3, a task link group originally includes a task link a, a task link B, a task link C, and a task link D, where the task link a is a parent link of the task link B and the task link C, and the task link B is a parent link of the task link D. Creating a task link E in a task link group as a sub-link of a task link B; and determining the link identifier of the task link B as a parent mark of the task link E, and automatically inheriting a link node list of an upper link (the task link B and the task link A) of the task link E as a link node list of the task link E.
In the technical solution provided in step S206, the operation performed on the first task link may include, but is not limited to, an operation that requires to use node tags of respective link nodes in the task link, that is, the node tags are not stored in the sublinks, and the node tags are automatically acquired when the node tags need to be used. The method not only keeps the stability of the inheritance relationship of the parent-child link, but also can realize the operation independence of the addition, deletion and movement of the nodes of the parent-child link, simultaneously, the parent link change is automatically transmitted to the child link, the child link change does not reversely influence the parent link, the original high coupling between the parent link and the child link is removed, the operation on the parent-child link is relatively independent, and the convenience of recording the inheritance relationship between the parent link and the child link is improved.
Optionally, in this embodiment, a task link in the task link group without a parent link may be referred to as a root link, only the root link node flag of the link node of the root link needs to be recorded in the task link group, and the node flags of the link nodes of the other task links may be automatically determined as needed according to the root link node flag of the link node of the root link.
Optionally, in this embodiment, the form of the link node flag may include, but is not limited to: a string of numbers, a string of letters, a mixture of one or more of a string of patterns. The link node flags may be ordered to indicate the order of connection between link nodes.
In an alternative embodiment, a process for establishing a task link group is provided, in which a link a is newly established, and a, b, and c are newly added as link nodes of the link a. Where the flag bits for a, b, c (i.e., the link node flags) are 01, 02, 03, respectively, and the parent of link a is marked-1 (indicating that it does not have a parent). And newly building a link B, wherein the link B is a sub-link of the link A, and the father of the link B is marked as the link ID of the link A. Link B inherits the nodes a, B, c of link a naturally.
As an alternative embodiment, in a case that the operation performed on the first task link is detected, determining, according to the root link node flag of the root link in the task link group, the target link node flag of the link node in the link node list of the first task link includes:
s11, when it is detected that the operation is performed on the first task link, determining a root link corresponding to the first task link according to a parent flag of a task link included in the task link group, where a root link node flag corresponding to a root link node of the root link is recorded on the root link;
s12, determining an inherited node mark corresponding to each root link node according to a root link node mark corresponding to the root link node, a hierarchy parameter and a unit order of magnitude, wherein the hierarchy parameter is used for indicating a link layer number difference between the first task link and the root link, and the unit order of magnitude is used for indicating the amount of nodes allowed to be accommodated in each layer of link;
and S13, determining the inherited node mark corresponding to each root link node as a target link node mark of the link node of the first task link corresponding to each root link node.
Optionally, in this embodiment, a root link node mark corresponding to a root link node of the root link is recorded on the root link, for example: the task link a may include, but is not limited to, three link nodes (link node a1, link node a2, and link node A3), where the link node labels of the three link nodes may be a1, a2, and A3, and may also be labeled with ordered numbers, where the ordered numbers may be consecutive, such as 1, 2, 3, or discontinuous, such as 1, 5, 9.
Optionally, in this embodiment, the level parameter may also be referred to as a displacement step, and is used to indicate a link-layer number difference between the first task link and the root link, that is, a link-layer number difference between the task link marked by the link node and the root link corresponding to the task link, which needs to be determined, for example: in the task link group shown in fig. 3, task link a is located at layer 0 as a root link, task link B and task link C are located at layer 1, and task link D and task link E are located at layer 2. The link-level number difference between task link E and its corresponding root link task link a is 2, i.e. the level parameter is equal to 2.
Alternatively, in this embodiment, the unit magnitude may be referred to as a displacement step unit for indicating the amount of nodes allowed to be accommodated in each layer of links, and the unit magnitude may be, but is not limited to, decimal, binary, hexadecimal, and the like. Such as: may be set to 10, 100, 1000, 10000, 100000, etc. According to the level parameters and the unit magnitude, the bit number corresponding to the node included in the task link of each layer can be determined, taking the unit magnitude as 100 as an example, the sublinks of the root link can correspond to hundreds of bits, the sublinks of the root link can correspond to thousands of bits, and so on.
As an optional embodiment, determining, according to a parent flag of a task link included in the task link group, a root link corresponding to the first task link includes:
s21, acquiring a father mark of the second task link;
s22, under the condition that the parent mark of the second task link is a target mark, determining the second task link as the root link;
s23, under the condition that the parent mark of the second task link is not the target mark, acquiring the parent mark of the task link indicated by the parent mark of the second task link until the acquired parent mark is the target mark; and determining the task link with the parent marked as the target mark as the root link.
Optionally, in this embodiment, but not limited to, the root link may be searched upward by using a parent flag stored in each task link, where the parent link of the first task link is the second task link, the parent flag of the second task link is obtained, if the parent flag of the second task link is the target flag, the second task link is considered to be the root link, and if the parent flag of the second task link is not the target flag, the upward search is continued according to the parent flag of the second task link until the link whose parent flag is the target flag is found, and the link is used as the root link.
Optionally, in this embodiment, the target flag is used to flag the root link, and may be a preset symbol, such as: -1. If the parent of a task link is marked-1, it can be determined that it does not have a parent link.
As an optional embodiment, determining, according to the root link node label corresponding to the root link node, the inheritance node label corresponding to each root link node by using the level parameter and the unit order of magnitude includes:
s31, determining a target order of magnitude with the unit order of magnitude as a base number and the hierarchy parameter as an index;
s32, determining the product of the root link node mark and the target order of magnitude as the inheritance node mark corresponding to each root link node.
Optionally, in this embodiment, the inheritance node flag can be determined by, but is not limited to, the following formula:
inheritance node marking (root link node marking) unit order of magnitudeHierarchical parameters
In which the order of unitsHierarchical parametersI.e. the target order of magnitude.
Such as: taking root link node labels as 1, 2 and 3, unit order of magnitude as 100 and hierarchy parameter as 2 as an example, the inheritance node labels corresponding to the root link node labels are respectively 1 × 1002＝10000，2*1002＝20000，3*1002＝30000。
In an alternative embodiment, a process is provided for a sub-link to inherit a parent link, and its parent link a is obtained via the parent tag of link B. If the parent mark of the link A is the target mark, the parent link of the link A is empty, and the parent link is a root link, the following process is executed on the link A. Otherwise, the root link is continuously searched. Inherit the process of: root link node label of node (a, b, c) of link a, displacement step unitStep by step displacementInherit the node label. The node list of link B will have the corresponding inherited node label of link a of (a, B, c) as its target link node label in link B. The inheritance process is dynamic, and only when an operation is performed on link B, link B may not store the result of the computation.
As an optional embodiment, after determining, according to the root link node flag of the root link in the task link group, a target link node flag of a link node in the link node list of the first task link, the method further includes:
s41, adding a link node into the first task link;
s42, when the added new link node is between the original link nodes of the first task link, obtaining a first link node label between a link node label of a first original link node and a link node label of a second original link node as a link node label of the new link node;
s43, under the condition that the added new link node is in front of the original link node of the first task link, determining the link node mark of the new link node according to the first link node mark of the first link node in the original link node;
s44, determining, according to a last link node flag of a last link node in the original link nodes, a link node flag of the newly added link node when the added newly added link node is behind the original link node of the first task link.
Optionally, in this embodiment, if a new link node is added to the sub-link, the corresponding link node flag may also be calculated for the added link node. And calculating the link node mark of the newly added link node in different modes under different adding conditions in the process of adding the new link node in the sub-link.
Optionally, in this embodiment, if the newly added link node is added between the original link nodes, the link node flag of the newly added link node may be determined according to the link node flag of the first original link node and the link node flag of the second original link node.
Optionally, in this embodiment, if the added newly-added link node is before the original link node, the link node label of the newly-added link node is determined according to the first link node label, and if the added newly-added link node is after the original link node, the link node label of the newly-added link node is determined according to the last link node label.
As an optional embodiment, obtaining the first link node flag between the link node flag of the first original link node and the link node flag of the second original link node includes one of:
s51, randomly acquiring a first link node mark from the position between the link node mark of a first original link node and the link node mark of a second original link node;
s52, dividing the sum of the link node mark of the first original link node and the link node mark of the second original link node by the target value to obtain an intermediate node mark; obtaining the first link node marker within a range of values determined by the intermediate node marker.
Optionally, in this embodiment, one way of taking the new link node marker from between the two link node markers may be random acquisition, and the other way may be the sum of the link node marker of the first original link node and the link node marker of the second original link node, and dividing the target value to obtain an intermediate node marker, and acquiring the intermediate node marker within a value range determined by the intermediate node marker, for example: a target value of 2 indicates taking the median.
Optionally, in this embodiment, the target value may be, but is not limited to, an integer greater than 1, such as: 2, 3, 4, 5, etc.
Optionally, in this embodiment, the sum of the link node flag of the first original link node and the link node flag of the second original link node is divided by the target value to obtain an intermediate node flag, and the manner of obtaining the first link node flag within the value range determined by the intermediate node flag may be, but is not limited to be, understood to be obtaining the first link node flag from the vicinity of the intermediate node flag.
Optionally, in this embodiment, the manner of obtaining the first link node marker within the value range determined by the intermediate node marker may be, but is not limited to, first determining the value range according to the intermediate node marker, and then obtaining the first link node marker randomly within the value range.
Optionally, in this embodiment, the value range determined by the intermediate node marker may be, but is not limited to, a range bounded by the intermediate node marker, such as: and acquiring the first link node mark from the range which is larger than the intermediate node mark and is less than or equal to the intermediate node mark plus 50, or acquiring the first link node mark from the range which is larger than the intermediate node mark minus 5 and is less than or equal to the intermediate node mark.
Optionally, in this embodiment, the numerical range determined by the intermediate node marker may also be, but is not limited to, a range including intermediate node markers, such as: and acquiring the first link node mark from the range of the middle node mark plus or minus 50, or randomly acquiring the first link node mark from the range of the middle node mark plus or minus 20 and greater than or equal to minus 5.
Optionally, in this embodiment, the manner of obtaining the first link node flag within the value range determined by the intermediate node flag may also be, but is not limited to, adding or subtracting a value to or from the intermediate node flag as the first link node flag, where the value may be predetermined or randomly selected from a value set. Such as: the intermediate node label is incremented by 3, or the intermediate node label is decremented by 1, or the intermediate node label is incremented by 1, and so on.
In an optional embodiment, a process of determining a link node flag of a new link node in a scenario of inheriting a new node of a sublink of a parent link is provided, where a sublink B inherits from a parent link a, (m, n, p are nodes of the parent link, and link node flags are 001, 005, and 008, respectively), a sublink B new node i is between nodes m and n, a shift stepping unit is set to be 1000, and through the inheritance process, inheritance flag bits of (m, n, p) of the link a on the link B are: 001000,005000, 008000. The link node label of the sub-link B new node i may be 002024 between the link node labels (001000,005000) of the nodes m, n, which may be, but is not limited to, randomly obtained from 001000 to 005000, or may be, but is not limited to, obtained by dividing the sum 006000 of 001000 and 005000 by 3 to obtain an intermediate node label 002000, which is then randomly obtained in the vicinity of 002000. Obtaining sublink B as: (m, i, n, p) correspond to the link node labels, respectively: 001000, 002024, 005000, 008000.
Optionally, in this embodiment, for a scenario in which a node is newly added to a parent link, the node newly added to the parent link may automatically inherit to a child link. Such as: and a node e is newly added to the father link A, the child link B automatically acquires the node e by adopting the inheritance mode, and the sequential relation of the e node in the father link A relative to the link A is inherited by the child node sequentially.
Optionally, in this embodiment, for a scenario where a parent link or a child link deletes a node, the parent link deletes the node may directly operate on the parent link. The behavior of the child link inheritance node is dynamic behavior, so that the deletion operation of the parent link can be automatically inherited to the child link. The nodes of the sub-link are isolated from the parent link, so the deletion operation of the parent link does not affect the own nodes of the sub-link.
Optionally, in this embodiment, for a scenario of node order adjustment of a parent link or a child link, the node order adjustment may be completed through the node deleting process and the node adding process.
Through the process, the inheritance relationships of the parent-child links are isolated in different number domains through unit number orders, and the inheritance relationships are maintained in a dynamic calculation mode to achieve decoupling of maintenance of respective nodes of the parent-child links. The parent link does not need to sense the existence of the child link, the child link does not need to pay attention to the change of the node of the parent link, and any node change of the parent link can be automatically inherited to the child link. In the process, the child link does not need to maintain the state of the parent link, and the storage cost is reduced. Especially in large numbers of links, the savings in storage costs are particularly significant.
As an optional embodiment, randomly obtaining the first link node flag from between the link node flag of the first original link node and the link node flag of the second original link node includes:
s61, acquiring a first random number between a link node mark of a first original link node and a link node mark of a second original link node;
s62, determining the first random number as the first link node label if the first random number is not an integer multiple of a unit order of magnitude;
s63, in the case that the first random number is an integer multiple of a unit order of magnitude, re-acquiring a second random number until the acquired second random number is not the integer multiple of the unit order of magnitude, wherein the unit order of magnitude is used for indicating the amount of nodes allowed to be accommodated in each layer of link; determining a second random number that is not an integer multiple of the unit order of magnitude as the first link node marker.
Optionally, in this embodiment, in the process of randomly taking a new link node label from between two link node labels, the obtained new node label may be, but is not limited to, limited not to be an integer multiple of a unit order of magnitude, so that the new node label does not occupy the bit number of the parent link, and the node labels between the parent link and the child link do not collide during the process of inheritance of the link node, thereby ensuring that the node labels of the child links do not interfere with the parent link. Such as: in the above optional embodiment, if the node label of the node newly added to the child link is taken to 004000, it indicates that the node label occupies the bit number of the parent link, and if the node label taken by the node newly added to the parent link is 004, when the child link inherits, the 004 node calculates the same node label as the 004000 node owned by the child link, so that if the obtained new node label is an integer multiple of the unit order, the node labels in the inheritance relationship may collide. Then if an integer multiple of the unit order of magnitude is taken, the random numbers may be re-taken up to an integer multiple of the unit order of magnitude of the random numbers taken.
As an optional embodiment, determining the link node label of the newly added link node according to the first link node label of the first link node in the original link nodes includes:
s71, under the condition that the first link node mark is the minimum link node mark, acquiring a second link node mark between the minimum link node mark and a link node mark of a second link node in the original link nodes, and taking the second link node mark as the current link node mark of the first link node; acquiring a third link node mark between the minimum link node mark and the current link node mark of the first link node as the link node mark of the newly added link node;
s72, when the first link node flag is not the minimum link node flag, acquiring a fourth link node flag between the minimum link node flag and the first link node flag, as the link node flag of the newly added link node.
Optionally, in this embodiment, if the newly added link node is before being added to the original link node, the link node flag of the newly added link node is determined according to a relationship between the first link node flag of the first link node and the minimum link node flag. The minimum link node mark may be, but is not limited to, the minimum value that can be reached by the link node mark of the hierarchy where the first link node mark is located, or the minimum link node mark may be, but is not limited to, a preset value, such as: the minimum link node flag may be 0.
Optionally, in this embodiment, if the mark of the first link node is already the minimum link node mark, the first link node may be moved backward by obtaining a second link node mark between the minimum link node mark and a link node mark of a second link node in the original link nodes as a current link node mark of the first link node, but it is guaranteed that the moved second link node mark does not exceed the link node mark of the second link node, and then a value between the moved value and the minimum link node mark is taken as a link node mark of the newly added link node by obtaining a third link node mark between the minimum link node mark and the current link node mark of the first link node.
Optionally, in this embodiment, if the first link node flag is not the minimum link node flag, the value between the first link node flag and the minimum link node flag may be directly taken as the link node flag of the newly added link node.
Optionally, in this embodiment, a manner of taking a value between two link node markers may be, but is not limited to, a manner similar to the above-described manner of obtaining the first link node marker between the link node marker of the first original link node and the link node marker of the second original link node, and details are not repeated here.
As an optional embodiment, determining the link node label of the newly added link node according to the tail link node label of the tail link node in the original link nodes includes:
s81, under the condition that the last link node flag is the maximum link node flag, acquiring a fifth link node flag between the last link node flag and the link node flag of the next to last link node in the original link nodes, as the current link node flag of the last link node; acquiring a sixth link node mark between the current link node mark of the last link node and the maximum link node mark as the link node mark of the newly added link node;
and S82, under the condition that the tail link node mark is not the maximum link node mark, acquiring a seventh link node mark between the tail link node mark and the maximum link node mark as the link node mark of the newly added link node.
Optionally, in this embodiment, if the newly added link node is after being added to the original link node, the link node flag of the newly added link node is determined according to a relationship between the last link node flag of the last link node and the maximum link node flag of the last link node. The maximum link node flag may be, but is not limited to, the maximum value that can be reached by the link node flag of the hierarchy where the last link node flag is located, or the maximum link node flag may be, but is not limited to, a preset value, such as: for end link nodes with a unit number of order 100 and at a level of 1, the maximum link node designation may be 199.
Optionally, in this embodiment, if the mark of the last link node is already the maximum link node mark, the last link node may be moved forward by obtaining a fifth link node mark between the maximum link node mark and a link node mark of a penultimate link node in the original link nodes as a current link node mark of the last link node, but it is guaranteed that the moved link node mark does not exceed the link node mark of the penultimate link node, and then the value between the moved value and the maximum link node mark is taken as the link node mark of the newly added link node by obtaining a sixth link node mark between the maximum link node mark and the current link node mark of the last link node.
Optionally, in this embodiment, if the last link node flag is not the maximum link node flag, a value between the last link node flag and the maximum link node flag may be directly taken as the link node flag of the newly added link node.
Optionally, in this embodiment, a manner of taking a value between two link node markers may be, but is not limited to, a manner similar to the above-described manner of obtaining the first link node marker between the link node marker of the first original link node and the link node marker of the second original link node, and details are not repeated here.
It should be noted that, for simplicity of description, the above-mentioned method embodiments are described as a series of acts or combination of acts, but those skilled in the art will recognize that the present application is not limited by the order of acts described, as some steps may occur in other orders or concurrently depending on the application. Further, those skilled in the art should also appreciate that the embodiments described in the specification are preferred embodiments and that the acts and modules referred to are not necessarily required in this application.
Through the above description of the embodiments, those skilled in the art can clearly understand that the method according to the above embodiments can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware, but the former is a better implementation mode in many cases. Based on such understanding, the technical solutions of the present application may be embodied in the form of a software product, which is stored in a storage medium (e.g., ROM/RAM, magnetic disk, optical disk) and includes instructions for enabling a terminal device (e.g., a mobile phone, a computer, a server, or a network device) to execute the method according to the embodiments of the present application.
According to another aspect of the embodiments of the present application, there is also provided a task link operating device for implementing the task link operating method. Fig. 4 is a schematic diagram of an operation apparatus of an optional task link according to an embodiment of the present application, and as shown in fig. 4, the apparatus may include:
a creating module 42, configured to create a first task link in a task link group as a sublink of a second task link;
a first determining module 44, configured to determine a link identifier of the second task link as a parent flag of the first task link, where the parent flag is used to flag a parent link of the task link, and the first task link inherits a link node list of an upper link of the first task link as a link node list of the first task link;
a second determining module 46, configured to, in a case that it is detected that an operation is performed on the first task link, determine, according to the root link node flag of the root link in the task link group, a target link node flag of a link node in the link node list of the first task link.
It should be noted that the creating module 42 in this embodiment may be configured to execute step S202 in this embodiment, the first determining module 44 in this embodiment may be configured to execute step S204 in this embodiment, and the second determining module 46 in this embodiment may be configured to execute step S206 in this embodiment.
It should be noted here that the modules described above are the same as the examples and application scenarios implemented by the corresponding steps, but are not limited to the disclosure of the above embodiments. It should be noted that the modules described above as a part of the apparatus may operate in a hardware environment as shown in fig. 1, and may be implemented by software or hardware.
Through the modules, when a first task link is created in a task link group and serves as a sub-link of a second task link, a link identifier of the second task link serves as a parent mark of the first task link to mark a parent link of the first task link, so that the first task link inherits a link node list of an upper link thereof as a link node list of the first task link, information of link nodes in the parent link does not need to be stored in the sub-link, the sub-link does not need to maintain the state of the parent link, and storage space is reduced. When the first task link is detected to be operated, the target link node mark of the link node in the link node list of the first task link which is operated is dynamically determined according to the root link node mark of the root link in the task link group, so that the aim of dynamically marking the link node in the sub-link is achieved, the coupling degree between parent links and child links is reduced, the technical effect of improving the convenience of the mode of inheritance association between task links is achieved, and the technical problem that the convenience of the mode of inheritance association between task links in the related technology is poor is solved.
As an alternative embodiment, the second determining module includes:
a first determining unit, configured to determine, when it is detected that an operation is performed on the first task link, a root link corresponding to the first task link according to a parent flag of a task link included in the task link group, where a root link node flag corresponding to a root link node of the root link is recorded on the root link;
a second determining unit, configured to determine, according to a root link node label corresponding to the root link node, a hierarchy parameter and a unit order of magnitude, an inherited node label corresponding to each root link node, where the hierarchy parameter is used to indicate a link layer number difference between the first task link and the root link, and the unit order of magnitude is used to indicate an amount of nodes that are allowed to be accommodated in each layer of link;
a third determining unit, configured to determine, as a target link node flag of the link node of the first task link corresponding to each root link node, an inherited node flag corresponding to each root link node.
As an alternative embodiment, the first determining unit is configured to:
acquiring a father mark of the second task link;
determining the second task link as the root link under the condition that the parent mark of the second task link is a target mark;
under the condition that the parent mark of the second task link is not the target mark, acquiring the parent mark of the task link indicated by the parent mark of the second task link until the acquired parent mark is the target mark; and determining the task link with the parent marked as the target mark as the root link.
As an alternative embodiment, the second determining unit is configured to:
determining a target order of magnitude based on the unit order of magnitude and indexed by the level parameter;
determining a product between the root link node label and the target magnitude as a successor node label corresponding to each root link node.
As an alternative embodiment, the apparatus further comprises:
an adding module, configured to add a link node to the first task link after determining a target link node flag of a link node in the link node list of the first task link according to a root link node flag of a root link in the task link group;
an obtaining module, configured to obtain, when the added new link node is between original link nodes of the first task link, a first link node flag between a link node flag of a first original link node and a link node flag of a second original link node as a link node flag of the new link node;
a third determining module, configured to determine, when the added newly added link node is in front of an original link node of the first task link, a link node label of the newly added link node according to a first link node label of a first link node in the original link node;
a fourth determining module, configured to determine, when the added newly added link node is behind an original link node of the first task link, a link node flag of the newly added link node according to a last link node flag of a last link node in the original link node.
As an alternative embodiment, the obtaining module includes one of:
a first obtaining unit, configured to randomly obtain a first link node flag from between a link node flag of a first original link node and a link node flag of a second original link node;
a second obtaining unit, configured to divide a sum of the link node flag of the first original link node and the link node flag of the second original link node by a target value to obtain an intermediate node flag; obtaining the first link node marker within a range of values determined by the intermediate node marker.
As an alternative embodiment, the first obtaining unit is configured to:
acquiring a first random number between a link node mark of a first original link node and a link node mark of a second original link node;
determining the first random number as the first link node marker if the first random number is not an integer multiple of a unit order of magnitude;
under the condition that the first random number is an integral multiple of a unit order of magnitude, reacquiring a second random number until the acquired second random number is not the integral multiple of the unit order of magnitude, wherein the unit order of magnitude is used for indicating the amount of nodes allowed to be accommodated in each layer of link; determining a second random number that is not an integer multiple of the unit order of magnitude as the first link node marker.
As an alternative embodiment, the third determining module includes:
a first processing unit, configured to, when a first link node flag is a minimum link node flag, obtain a second link node flag between the minimum link node flag and a link node flag of a second link node in the original link nodes, as a current link node flag of the first link node; acquiring a third link node mark between the minimum link node mark and the current link node mark of the first link node as the link node mark of the newly added link node;
a third obtaining unit, configured to obtain, when a first link node flag is not the minimum link node flag, a fourth link node flag between the minimum link node flag and the first link node flag, as a link node flag of the newly added link node.
As an alternative embodiment, the fourth determining module includes:
a second processing unit, configured to, when a last link node flag is a maximum link node flag, obtain a fifth link node flag between the last link node flag and a link node flag of a penultimate link node in the original link nodes, as a current link node flag of the last link node; acquiring a sixth link node mark between the current link node mark of the last link node and the maximum link node mark as the link node mark of the newly added link node;
a fourth obtaining unit, configured to obtain, when a last link node flag is not a maximum link node flag, a seventh link node flag between the last link node flag and the maximum link node flag, as a link node flag of the newly added link node.
It should be noted here that the modules described above are the same as the examples and application scenarios implemented by the corresponding steps, but are not limited to the disclosure of the above embodiments. It should be noted that the modules described above as a part of the apparatus may be operated in a hardware environment as shown in fig. 1, and may be implemented by software, or may be implemented by hardware, where the hardware environment includes a network environment.
According to another aspect of the embodiments of the present application, there is also provided an electronic device for implementing the operation method of the task link.
Fig. 5 is a block diagram of an electronic device according to an embodiment of the present application, and as shown in fig. 5, the electronic device may include: one or more processors 501 (only one of which is shown), a memory 503, and a transmission means 505. as shown in fig. 5, the electronic apparatus may further include an input/output device 507.
The memory 503 may be used to store software programs and modules, such as program instructions/modules corresponding to the method and apparatus for operating a task link in the embodiment of the present application, and the processor 501 executes various functional applications and data processing by running the software programs and modules stored in the memory 503, that is, implementing the above-mentioned method for operating a task link. The memory 503 may include high speed random access memory and may also include non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory. In some examples, the memory 503 may further include memory located remotely from the processor 501, which may be connected to the electronic device through a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
The transmission means 505 is used for receiving or sending data via a network, and may also be used for data transmission between the processor and the memory. Examples of the network may include a wired network and a wireless network. In one example, the transmission device 505 includes a Network adapter (NIC) that can be connected to a router via a Network cable and other Network devices to communicate with the internet or a local area Network. In one example, the transmission device 505 is a Radio Frequency (RF) module, which is used for communicating with the internet in a wireless manner.
Among them, the memory 503 is used to store an application program in particular.
The processor 501 may call the application stored in the memory 503 through the transmission means 505 to perform the following steps:
creating a first task link in a task link group as a sublink of a second task link;
determining a link identifier of the second task link as a parent tag of the first task link, wherein the parent tag is used for tagging a parent link of the task link, and the first task link inherits a link node list of an upper link of the first task link as a link node list of the first task link;
and under the condition that the operation executed on the first task link is detected, determining a target link node mark of a link node in a link node list of the first task link according to a root link node mark of a root link in the task link group.
By adopting the embodiment of the application, a scheme for operating the task link is provided. When a first task link is created in a task link group and used as a sub-link of a second task link, a link identifier of the second task link is used as a parent mark of the first task link to mark a parent link of the first task link, so that the first task link inherits a link node list of an upper link thereof as a link node list of the first task link, information of link nodes in the parent link does not need to be stored in the sub-link, the sub-link does not need to maintain the state of the parent link, and the storage space is reduced. When the first task link is detected to be operated, the target link node mark of the link node in the link node list of the first task link which is operated is dynamically determined according to the root link node mark of the root link in the task link group, so that the aim of dynamically marking the link node in the sub-link is achieved, the coupling degree between parent links and child links is reduced, the technical effect of improving the convenience of the mode of inheritance association between task links is achieved, and the technical problem that the convenience of the mode of inheritance association between task links in the related technology is poor is solved.
Optionally, the specific examples in this embodiment may refer to the examples described in the above embodiments, and this embodiment is not described herein again.
It will be understood by those skilled in the art that the structure shown in fig. 5 is merely an illustration, and the electronic device may be a smart phone (e.g., an Android phone, an iOS phone, etc.), a tablet computer, a palm computer, a Mobile Internet Device (MID), a PAD, etc. Fig. 5 is a diagram illustrating a structure of the electronic device. For example, the electronic device may also include more or fewer components (e.g., network interfaces, display devices, etc.) than shown in FIG. 5, or have a different configuration than shown in FIG. 5.
Those skilled in the art will appreciate that all or part of the steps in the methods of the above embodiments may be implemented by a program for instructing device-associated hardware, and the program may be stored in a computer-readable storage medium, and the storage medium may include: flash disks, Read-Only memories (ROMs), Random Access Memories (RAMs), magnetic or optical disks, and the like.
Embodiments of the present application also provide a storage medium. Alternatively, in this embodiment, the storage medium may be a program code for executing the operating method of the task link.
Optionally, in this embodiment, the storage medium may be located on at least one of a plurality of network devices in a network shown in the above embodiment.
Optionally, in this embodiment, the storage medium is configured to store program code for performing the following steps:
creating a first task link in a task link group as a sublink of a second task link;
determining a link identifier of the second task link as a parent tag of the first task link, wherein the parent tag is used for tagging a parent link of the task link, and the first task link inherits a link node list of an upper link of the first task link as a link node list of the first task link;
and under the condition that the operation executed on the first task link is detected, determining a target link node mark of a link node in a link node list of the first task link according to a root link node mark of a root link in the task link group.
Optionally, the specific examples in this embodiment may refer to the examples described in the above embodiments, and this embodiment is not described herein again.
Optionally, in this embodiment, the storage medium may include, but is not limited to: a U-disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a removable hard disk, a magnetic or optical disk, and other various media capable of storing program codes.
The above-mentioned serial numbers of the embodiments of the present application are merely for description and do not represent the merits of the embodiments.
The integrated unit in the above embodiments, if implemented in the form of a software functional unit and sold or used as a separate product, may be stored in the above computer-readable storage medium. Based on such understanding, the technical solution of the present application may be substantially implemented or a part of or all or part of the technical solution contributing to the prior art may be embodied in the form of a software product stored in a storage medium, and including instructions for causing one or more computer devices (which may be personal computers, servers, network devices, or the like) to execute all or part of the steps of the method described in the embodiments of the present application.
In the above embodiments of the present application, the descriptions of the respective embodiments have respective emphasis, and for parts that are not described in detail in a certain embodiment, reference may be made to related descriptions of other embodiments.
In the several embodiments provided in the present application, it should be understood that the disclosed client may be implemented in other manners. The above-described embodiments of the apparatus are merely illustrative, and for example, the division of the units is only one type of division of logical functions, and there may be other divisions when actually implemented, for example, a plurality of units or components may be combined or may be integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, units or modules, and may be in an electrical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The foregoing is only a preferred embodiment of the present application and it should be noted that those skilled in the art can make several improvements and modifications without departing from the principle of the present application, and these improvements and modifications should also be considered as the protection scope of the present application.
Claims (12)
1. A method of operating a task link, comprising:
creating a first task link in a task link group as a sublink of a second task link;
determining a link identifier of the second task link as a parent tag of the first task link, wherein the parent tag is used for tagging a parent link of the task link, and the first task link inherits a link node list of an upper link of the first task link as a link node list of the first task link;
and under the condition that the operation executed on the first task link is detected, determining a target link node mark of a link node in a link node list of the first task link according to a root link node mark of a root link in the task link group.
2. The method of claim 1, wherein determining a target link node label for a link node in the link node list of the first task link based on a root link node label for a root link in the task link group upon detecting that an operation is performed on the first task link comprises:
under the condition that the operation on the first task link is detected, determining a root link corresponding to the first task link according to a parent mark of the task link included in the task link group, wherein a root link node mark corresponding to a root link node of the root link is recorded on the root link;
determining an inheritance node mark corresponding to each root link node according to a root link node mark corresponding to the root link node, a hierarchy parameter and a unit order of magnitude, wherein the hierarchy parameter is used for indicating a link layer number difference between the first task link and the root link, and the unit order of magnitude is used for indicating the amount of nodes allowed to be accommodated in each layer of link;
and determining the inheritance node mark corresponding to each root link node as a target link node mark of the link node of the first task link corresponding to each root link node.
3. The method according to claim 2, wherein determining the root link corresponding to the first task link according to the parent tag of the task link included in the task link group comprises:
acquiring a father mark of the second task link;
determining the second task link as the root link under the condition that the parent mark of the second task link is a target mark;
under the condition that the parent mark of the second task link is not the target mark, acquiring the parent mark of the task link indicated by the parent mark of the second task link until the acquired parent mark is the target mark; and determining the task link with the parent marked as the target mark as the root link.
4. The method of claim 2, wherein determining, according to the root link node label corresponding to the root link node, the hierarchical parameter and the unit order of magnitude, the inherited node label corresponding to each root link node comprises:
determining a target order of magnitude based on the unit order of magnitude and indexed by the level parameter;
determining a product between the root link node label and the target magnitude as a successor node label corresponding to each root link node.
5. The method of claim 1, wherein after determining the target link node designation for a link node in the link node list of the first task link based on the root link node designation for the root link in the task link group, the method further comprises:
adding a link node to the first task link;
acquiring a first link node mark between a link node mark of a first original link node and a link node mark of a second original link node as a link node mark of the newly added link node under the condition that the added newly added link node is between original link nodes of the first task link;
under the condition that the added newly-added link node is in front of the original link node of the first task link, determining the link node mark of the newly-added link node according to the first link node mark of the first link node in the original link node;
and under the condition that the added newly-added link node is behind the original link node of the first task link, determining the link node mark of the newly-added link node according to the tail link node mark of the tail link node in the original link node.
6. The method of claim 5, wherein obtaining the first link node designation between the link node designation of the first legacy link node and the link node designation of the second legacy link node comprises one of:
randomly acquiring a first link node mark between a link node mark of a first original link node and a link node mark of a second original link node;
dividing the sum of the link node mark of the first original link node and the link node mark of the second original link node by a target value to obtain an intermediate node mark; obtaining the first link node marker within a range of values determined by the intermediate node marker.
7. The method of claim 6, wherein randomly obtaining the first link node designation from between the link node designation of the first legacy link node and the link node designation of the second legacy link node comprises:
acquiring a first random number between a link node mark of a first original link node and a link node mark of a second original link node;
determining the first random number as the first link node marker if the first random number is not an integer multiple of a unit order of magnitude;
under the condition that the first random number is an integral multiple of a unit order of magnitude, reacquiring a second random number until the acquired second random number is not the integral multiple of the unit order of magnitude, wherein the unit order of magnitude is used for indicating the amount of nodes allowed to be accommodated in each layer of link; determining a second random number that is not an integer multiple of the unit order of magnitude as the first link node marker.
8. The method of claim 5, wherein determining the link node label of the newly added link node based on the first link node label of the first one of the old link nodes comprises:
under the condition that a first link node mark is a minimum link node mark, acquiring a second link node mark between the minimum link node mark and a link node mark of a second link node in the original link nodes, and taking the second link node mark as a current link node mark of the first link node; acquiring a third link node mark between the minimum link node mark and the current link node mark of the first link node as the link node mark of the newly added link node;
and under the condition that the first link node mark is not the minimum link node mark, acquiring a fourth link node mark between the minimum link node mark and the first link node mark as the link node mark of the newly added link node.
9. The method of claim 5, wherein determining the link node marker of the new link node according to the last link node marker of the last link node in the old link nodes comprises:
under the condition that a tail link node mark is the maximum link node mark, acquiring a fifth link node mark between the tail link node mark and a link node mark of a penultimate link node in the original link nodes as a current link node mark of the tail link node; acquiring a sixth link node mark between the current link node mark of the last link node and the maximum link node mark as the link node mark of the newly added link node;
and under the condition that the tail link node mark is not the maximum link node mark, acquiring a seventh link node mark between the tail link node mark and the maximum link node mark as the link node mark of the newly added link node.
10. An apparatus for operating a task link, comprising:
the creating module is used for creating a first task link in the task link group as a sub-link of a second task link;
a first determining module, configured to determine a link identifier of the second task link as a parent flag of the first task link, where the parent flag is used to flag a parent link of the task link, and the first task link inherits a link node list of an upper link of the first task link as a link node list of the first task link;
and a second determining module, configured to, when it is detected that an operation is performed on the first task link, determine, according to a root link node flag of a root link in the task link group, a target link node flag of a link node in a link node list of the first task link.
11. A storage medium, characterized in that the storage medium comprises a stored program, wherein the program when executed performs the method of any of the preceding claims 1 to 9.
12. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor executes the method of any of the preceding claims 1 to 9 by means of the computer program.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011566131.8A CN112507174A (en) | 2020-12-25 | 2020-12-25 | Task link operation method and device, storage medium and electronic device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011566131.8A CN112507174A (en) | 2020-12-25 | 2020-12-25 | Task link operation method and device, storage medium and electronic device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112507174A true CN112507174A (en) | 2021-03-16 |
Family
ID=74923532
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011566131.8A Pending CN112507174A (en) | 2020-12-25 | 2020-12-25 | Task link operation method and device, storage medium and electronic device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112507174A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113595792A (en) * | 2021-07-28 | 2021-11-02 | 中国人民解放军国防科技大学 | Target task link generation method and device, computer equipment and storage medium |
-
2020
- 2020-12-25 CN CN202011566131.8A patent/CN112507174A/en active Pending
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113595792A (en) * | 2021-07-28 | 2021-11-02 | 中国人民解放军国防科技大学 | Target task link generation method and device, computer equipment and storage medium |
| CN113595792B (en) * | 2021-07-28 | 2022-08-19 | 中国人民解放军国防科技大学 | Target task link generation method and device, computer equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109726202B (en) | Block chain data storage method and computer storage medium | |
| CN108769111A (en) | A kind of server connection method, computer readable storage medium and terminal device | |
| CN106792653B (en) | Communication number information processing method, device and system | |
| CN111061678B (en) | Service data processing method, device, computer equipment and storage medium | |
| CN109697109A (en) | A kind of method, system, device and the storage medium of Division identification conflict virtual machine | |
| CN102497286A (en) | Method and device for matching management information base (MIB) | |
| CN112732321B (en) | Firmware modification method, device, computer readable storage medium and equipment | |
| CN105187475A (en) | Method and system for data synchronization | |
| CN112559291A (en) | Resource monitoring method and device, electronic equipment and storage medium | |
| CN105989457A (en) | Information query method and apparatus thereof | |
| CN112507174A (en) | Task link operation method and device, storage medium and electronic device | |
| CN110502611B (en) | Character string retrieval method and device | |
| CN113434119B (en) | Service processing method and device based on flow control | |
| CN103379145B (en) | The method, apparatus and system of information processing | |
| CN113253934A (en) | Flash bad block processing method and device, computer equipment and readable storage medium | |
| CN103746834B (en) | Transmission net searching business route method and relevant device and communication system | |
| CN110888863A (en) | State field optimization method and device, electronic equipment and storage medium | |
| CN107943519B (en) | A kind of time series data random ordering operation processing method and device | |
| CN114466387B (en) | Updating method and device of configuration file of base station, storage medium and electronic device | |
| CN111858145A (en) | Method, apparatus and computer program product for data backup and recovery | |
| CN108427691A (en) | Network data transmission method, device and computer equipment | |
| CN112003736B (en) | Multi-node configuration information determining method, device and storage medium | |
| CN108228226B (en) | Hard link differential method and device and corresponding terminal | |
| CN112988176A (en) | Channel package generation method and device, storage medium and electronic equipment | |
| CN111443906A (en) | Application access method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |