CN103248649B - Sort management method, equipment and the system of application - Google Patents
Sort management method, equipment and the system of application Download PDFInfo
- Publication number
- CN103248649B CN103248649B CN201210028550.5A CN201210028550A CN103248649B CN 103248649 B CN103248649 B CN 103248649B CN 201210028550 A CN201210028550 A CN 201210028550A CN 103248649 B CN103248649 B CN 103248649B
- Authority
- CN
- China
- Prior art keywords
- node
- binary tree
- subtree
- management
- client
- 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.)
- Active
Links
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The embodiment of the present invention provides the sort management method of a kind of application, equipment and system, the method comprise the steps that the application class management request that the client received on mobile terminal sends, the management request of described application class is carried the nodal information of the node that need to manage；The nodal information of the node of the need management carried in the Classification Management request according to described reception inquires about the node in the binary tree sort structure of storage or amendment processes, and described binary tree sort structure includes root node and at least one child node；And the node data of the node after query processing or amendment being processed is sent to described client and shows.By implementing the present invention, the data during application class management can be reduced and process flow.
Description
Technical field
The present invention relates to the communications field, particularly relate to sort management method, equipment and the system of application.
Background technology
At present, classified service device end for the application of mobile terminal uses tree construction mostly, use the corresponding applicating category of node that application is carried out during multiclass classification on a usual tree by tree construction, therefore, tree construction is used application to be classified the most directly perceived, but using tree construction when, when needing the applicating category in tree is modified, client needs to send full tree structure to server end, and when needs are inquired about or revise a certain applicating category, server end also needs to load full tree structure, and obtain Query Result or amendment result by traveling through described tree construction, therefore, when prior art carries out Classification Management to application, it is the biggest that data process flow.
Summary of the invention
The embodiment of the present invention solves the technical problem that and is, it is provided that the sort management method of a kind of application, the Classification Management equipment of a kind of application and the classification managing system of a kind of application, can reduce the data during application class management and process flow.
Concrete, the sort management method of the application that the embodiment of the present invention provides, including:
Receive the application class management request that the client on mobile terminal sends, the management request of described application class is carried the nodal information of the node that need to manage；
The nodal information of the node of the need management carried in the Classification Management request according to described reception inquires about the node in the binary tree sort structure of storage or amendment processes, and described binary tree sort structure includes root node and at least one child node；
And the node data of the node after query processing or amendment being processed is sent to described client and shows.
It is also preferred that the left
Node on the left subtree of each node is the child node of node, and the node on the right subtree of each node is the same node layer of node；Or
Node on the right subtree of each node is the child node of node, and the node on the left subtree of each node is the same node layer of node.
It is also preferred that the left
When needs carry out query processing to node, the nodal information of the node of the need management carried in the management request of described application class includes the node identification of the node that need to inquire about；
When node is modified process by needs, the nodal information of the node of the need management carried in the management request of described application class includes the node identification of node and the amendment demand that need to revise.Described amendment demand includes being replaced node, increase child node newly for node, newly-increased with one or more in node layer for node.
It is also preferred that the left the method for the present invention also includes:
Receive the binary tree sort Structure Creating request that the client on mobile terminal sends, described request to create is carried node and each internodal classification relation that the binary tree sort structure that need to create includes；
Binary tree sort Structure Creating request according to receiving creates binary tree sort structure.
It is also preferred that the left the node data that described client is received by the display of controlled tree, having the node of child node to be shown as the first state in described controlled tree, the node without child node is shown as the second state；
Before described client sends application class management request, also include:
Click on the node in the controlled tree in described client, trigger described client and send application class management request.
Accordingly, the embodiment of the present invention provides the Classification Management equipment of a kind of application, including:
Receive unit, for receiving the application class management request that the client on mobile terminal sends, the management request of described application class is carried the nodal information of the node that need to manage；
Processing unit, the node in the nodal information of the node of the need management carried in the Classification Management request received according to the described reception unit binary tree sort structure to storage inquires about or amendment processes；
Transmitting element, the node data of the node after query processing or amendment being processed is sent to described client and shows；
Memory element, is used for storing binary tree sort structure, and described binary tree sort structure includes root node and at least one child node.
It is also preferred that the left
The child node that node is node on the left subtree of each node in described binary tree sort structure, the node on the right subtree of each node is the same node layer of node；Or
The child node that node is node on the right subtree of each node in described binary tree sort structure, the node on the left subtree of each node is the same node layer of node.
It is also preferred that the left
Described reception unit is additionally operable to receive the binary tree sort Structure Creating request of the client transmission on mobile terminal, carries node and each internodal classification relation that the binary tree sort structure that need to create includes in described request to create；
Described equipment also includes:
Creating unit, creates binary tree sort structure for the binary tree sort Structure Creating request received according to described reception unit.
It is also preferred that the left
When needs carry out query processing to node, the nodal information of the node of the need management carried in the application class management request that described reception unit receives includes the node identification of the node that need to inquire about；
When node is modified process by needs, the nodal information of the node of the need management carried in the application class management request that described reception unit receives includes the node identification of node and the amendment demand that need to revise.Described amendment demand includes being replaced node, increase child node newly for node, newly-increased with one or more in node layer for node.
Accordingly, the embodiment of the present invention provides the classification managing system of a kind of application, comprising:
Mobile terminal, for sending application class management request by the client on mobile terminal, carries the nodal information of the node that need to manage, and the node data received by the display of described client in the management request of described application class；And the Classification Management equipment of the aforesaid application of the embodiment of the present invention.
Implement the embodiment of the present invention, have the advantages that
The embodiment of the present invention is when carrying out Classification Management to application, by binary tree sort structure, application is carried out multiclass classification management, described binary tree sort structure includes root node and at least one child node, node on the left subtree of each node is the child node of node, and the node on the right subtree of each node is the same node layer of node；Or, node on the right subtree of each node is the child node of node, node on the left subtree of each node is the same node layer of node, construction features due to binary tree so that the client of the present invention is when sending application class management request, it is not necessary to send overall tree construction, and the Classification Management equipment applied is when inquiring about node or revising process, can load and travel through the tree construction of entirety, therefore, the data during application class management can be greatly reduced and process flow.In addition, the client of the present invention shows the node data of reception by controlled tree, makes the state of node and operation seem more flexible in client, adds the experience of user.
Accompanying drawing explanation
Fig. 1 is the first embodiment schematic flow sheet of the sort management method of the application of the present invention.
Fig. 2 is the second embodiment schematic flow sheet of the sort management method of the application of the present invention.
Fig. 3 is the 3rd embodiment schematic flow sheet of the sort management method of the application of the present invention.
Fig. 4 is the 4th embodiment schematic flow sheet of the sort management method of the application of the present invention.
Fig. 5 is the first embodiment structure composition schematic diagram of the Classification Management equipment of the application of the present invention.
Fig. 6 is the second example structure composition schematic diagram of the Classification Management equipment of the application of the present invention.
Fig. 7 is the 3rd example structure composition schematic diagram of the Classification Management equipment of the application of the present invention.
Fig. 8 is the 4th example structure composition schematic diagram of the Classification Management equipment of the application of the present invention.
Fig. 9 is the structural representation that application is carried out Classification Management by tree construction.
Figure 10 is the structural representation that the present invention passes through that binary tree sort structure carries out an embodiment of Classification Management to application.
Figure 11 is the structural representation that the present invention passes through that binary tree sort structure carries out an embodiment of Classification Management to application.
Figure 12 is the structural representation that the present invention passes through that binary tree sort structure carries out an embodiment of Classification Management to application.
Figure 13 is the structural representation that the present invention passes through that binary tree sort structure carries out an embodiment of Classification Management to application.
Figure 14 is the structural representation that the present invention passes through that binary tree sort structure carries out an embodiment of Classification Management to application.
Detailed description of the invention
Below in conjunction with the accompanying drawing in the embodiment of the present invention, the technical scheme in the embodiment of the present invention is clearly and completely described, it is clear that described embodiment is only a part of embodiment of the present invention rather than whole embodiments.Based on the embodiment in the present invention, the every other embodiment that those of ordinary skill in the art are obtained under not making creative work premise, broadly fall into the scope of protection of the invention.
Fig. 1 is the first embodiment schematic flow sheet of the sort management method of the application of the present invention.As it is shown in figure 1, the method for the present embodiment includes:
Step S110, receives the application class management request that the client on mobile terminal sends, carries the nodal information of the node that need to manage in the management request of described application class, and described nodal information includes the node identification of the node that need to inquire about.
Step S111, starts the binary tree sort structure of load store according to the node identification received from root node, until finding the node that described node identification is corresponding.
Step S112, is sent to described client by the node data of the node after query processing and shows.
In implementing, binary tree sort structure described in the present embodiment includes root node and at least one child node, node on the left subtree of each node is the child node of node, node on the right subtree of each node is the same node layer of node, or the node on the right subtree of each node is the child node of node, the node on the left subtree of each node is the same node layer of node.Node and the classification relation of each node that the binary tree sort structure of the present invention includes can be carried by the binary tree sort Structure Creating request of the client transmission on mobile terminal.Follow-up embodiment all child nodes with the node on the left subtree of each node of binary tree as node, the node on the right subtree of each node be node same node layer as a example by illustrate.
Fig. 9 and Figure 10 respectively illustrates the structure of the binary tree of tree construction and the present invention and application carries out the structural representation of Classification Management.The root node set in fig .9 is " application ", and this root node includes " ' music ', ' video ', ' commercial ', ' news ' and ' Sina's microblogging ' " 5 child nodes, and the tree that these 5 child nodes are independently positioned at " application " props up；" commercial " node includes again " ' hotel ', ' ticketing service ' and ' store, Jingdone district ' " 3 child nodes, and these 3 child nodes are independently positioned on the branch of " commercial "；" ticketing service " node includes again " ' south aviation ' and ' Shenzhen aviation ' " 2 child nodes, and these 2 child nodes are independently positioned on the branch of " ticketing service ".And as shown in Figure 10, after the tree construction in Fig. 2 is converted to binary tree structure, root node keeps constant, it is still " application ", one of them child node " music " of this root node is located immediately on the left subtree of " application ", and 4 child nodes of " ' video ', ' commercial ', ' news ' and ' Sina's microblogging ' " of this root node are then positioned on the right subtree of " music "；One of them child node " hotel " of " commercial " is located immediately on the left subtree of " application ", and 2, " ' ticketing service ' and ' store, Jingdone district ' " of " commercial " child node is then positioned on the right subtree in " hotel "；The distribution of " ticketing service " and child node thereof is the most such.
Therefore, the present embodiment is in step S111, when a certain node inquired about by needs, first the root node of binary tree is loaded, the followed by left subtree of root node, the right subtree of node on left subtree, if a certain node also has left subtree, continue to load the right subtree under this certain node left subtree and left subtree, until the node that the node identification finding client transmission is corresponding.And for some node, during inquiry, as long as not having left subtree just can directly learn under this node, without all branches needing traverse node as tree construction, this node does not has child node, comes whether decision node has child node.Such as, the node identification of the node of the need inquiry that client sends is " video ", under the binary tree structure of Figure 10 inquiry should " video " process of applying as follows: " apply " according to root node successively, the left subtree " music " of " application ", the order loading binary tree sort structure of right subtree " video " of " music ", when finding " video ", the loading of binary tree just can be stopped.
The present embodiment, when application is carried out Classification Management, by binary tree sort structure, application is carried out multiclass classification management, described binary tree sort structure includes root node and at least one child node, node on the left subtree of each node is the child node of node, node on the right subtree of each node is the same node layer of node, construction features due to binary tree, make the client of the present invention when sending application class management request, need not send overall tree construction, and the Classification Management equipment applied is when inquiring about node, can load and travel through the tree construction of entirety, therefore, the data during application class management can be greatly reduced and process flow.
In implementing, the node data sent in step S112 includes the classification relation of the mark of node that finds and this node and its superior node.And in implementing, the node data that client can be received by the display of controlled tree, described controlled tree there is the node of child node to be shown as the first state, the node without child node is shown as the second state.Such as, client can show the node data of reception by a real tree, tree is shown the node of child node by fruit, the node of child node it is displayed without by flower, thus, user can readily appreciate that whether a certain node to be inquired about or to be revised management by the entity tree that client represents, and increases the experience of user.Further, under conditions of controlled tree, in implementing, before described client sends application class management request, user can trigger described client send application class management request by clicking on the node in the controlled tree in described client.
Fig. 2 is the second embodiment schematic flow sheet of the sort management method of the application of the present invention.As in figure 2 it is shown, the method for the present embodiment includes:
Step S210, receive the application class management request that the client on mobile terminal sends, the nodal information of the node that need to manage is carried in the management request of described application class, node identification that described nodal information includes the node that need to replace and the amendment demand that node is replaced.
Step S211, node identification and the amendment demand that is replaced node according to receiving start to load described binary tree sort structure from root node, until finding the node required for node corresponding to described node identification and the amendment demand that is replaced node.
Step S212, is replaced according to the node on the left subtree of the amendment demand the being replaced node node corresponding to node corresponding to described node identification and described node identification and/or right subtree.
Step S213, the node data of the node after replacement being processed is sent to described client and shows.
Same, in implementing, the binary tree sort structure described in the present embodiment includes root node and at least one child node, and the node on the left subtree of each node is the child node of node, and the node on the right subtree of each node is the same node layer of node.Node and the classification relation of each node that the binary tree sort structure of the present invention includes can be carried by the binary tree sort Structure Creating request of the client transmission on mobile terminal.
In step S211, when node replaced by needs, first the root node of binary tree is loaded, the followed by left subtree of root node, the right subtree of node on left subtree, if a certain node also has left subtree, continue to load the right subtree under this certain node left subtree and left subtree, until finding the node required for node corresponding to node identification that client sends and amendment demand that node is replaced.Then the node on the left subtree and/or right subtree of node corresponding to the step S212 node corresponding to described node identification according to the amendment demand being replaced node and described node identification is replaced.Such as, the node identification for " hotel " is replaced with " dining room " and described " dining room " of the node that the need that client sends are replaced includes " ' Sichuan cuisine shop ', ' Guangdong dishes shop ', ' Hunan cuisine shop ' " 3 child nodes.Under the binary tree structure of Figure 10, " hotel " is replaced with " dining room ", and described " dining room " includes " ' Sichuan cuisine shop ', ' Guangdong dishes shop ', ' Hunan cuisine shop ' " process of 3 child nodes is as follows: " applies " according to root node successively, the left subtree " music " " applied ", the right subtree " video " of " music ", " commercial ", " news ", " Sina's microblogging ", the order of the left subtree " hotel " of " commercial " loads binary tree sort structure, when finding " hotel ", just the loading of binary tree can be stopped (if " hotel " also has left subtree, stop after then needing the left subtree of loading " hotel ").Then replace the position adjusting " hotel " place node with " dining room ", and add " Sichuan cuisine shop " under the left subtree in " dining room ", under the right subtree in " Sichuan cuisine shop ", add " ' Guangdong dishes shop ', ' Hunan cuisine shop ' ".Thus, after replacement, the complete binary tree sort structure of formation is as shown in figure 11.For another example, the node identification of the node that the need that client sends are replaced for replacing with " shopping " and child node thereof by " commercial " and child node thereof, so when the binary tree sort structure of Figure 10 is loaded, during except the right subtree " news " of " commercial " and " Sina's microblogging " without loading, other be intended to load, and the node on " commercial " and left subtree thereof is the most to be replaced.
The present embodiment, when application is carried out Classification Management, by binary tree sort structure, application is carried out multiclass classification management, described binary tree sort structure includes root node and at least one child node, node on the left subtree of each node is the child node of node, node on the right subtree of each node is the same node layer of node, construction features due to binary tree, make the client of the present invention when sending application class management request, need not send overall tree construction, and the Classification Management equipment applied is when being replaced node, can load and travel through the tree construction of entirety, therefore, the data during application class management can be greatly reduced and process flow.
Same, in implementing, the node data sent in step S213 includes the classification relation of the mark of node that finds and this node and its superior node.And in implementing, the node data that client can be received by the display of controlled tree, described controlled tree there is the node of child node to be shown as the first state, the node without child node is shown as the second state.Such as, client can show the node data of reception by a real tree, tree is shown the node of child node by fruit, the node of child node it is displayed without by flower, thus, user can readily appreciate that whether a certain node to be inquired about or to be revised management by the entity tree that client represents, and increases the experience of user.Further, under conditions of controlled tree, in implementing, before described client sends application class management request, user can trigger described client send application class management request by clicking on the node in the controlled tree in described client.
Fig. 3 is the 3rd embodiment schematic flow sheet of the sort management method of the application of the present invention.As it is shown on figure 3, the method for the present embodiment includes:
Step S310, receive the application class management request that the client on mobile terminal sends, carrying the nodal information of the node that need to manage in the management request of described application class, described nodal information includes the node identification that need to increase child node newly and increases the amendment demand of child node for described node newly.
Step S311, according to the node identification received and increase the amendment demand of child node newly for node and start to load described binary tree sort structure from root node, until find node corresponding to described node identification and increase child node newly for node amendment demand required for node.
Step S312, adds to newly-increased child node on the left subtree of node corresponding to the node identification found according to increasing the amendment demand of child node newly for node and/or adds on the right subtree on the left subtree of node corresponding to the node identification found.
Step S313, is sent to described client by the node data of the node after newly-increased process and shows.
Same, in implementing, the binary tree sort structure described in the present embodiment includes root node and at least one child node, and the node on the left subtree of each node is the child node of node, and the node on the right subtree of each node is the same node layer of node.Node and the classification relation of each node that the binary tree sort structure of the present invention includes can be carried by the binary tree sort Structure Creating request of the client transmission on mobile terminal.
In step S311, when needs increase child node newly for node, first the root node of binary tree is loaded, the followed by left subtree of root node, the right subtree of node on left subtree, if a certain node also has left subtree, continue to load the right subtree under this certain node left subtree and left subtree, until find node corresponding to node identification that client sends and increase child node newly for node amendment demand required for node.Then according to increasing the amendment demand of child node newly for node in step S312 newly-increased child node is added on the left subtree of node corresponding to the node identification found and/or adds on the right subtree on the left subtree of node corresponding to the node identification found.Such as, the node identification of the need node that increases child node newly that client sends be " hotel " newly-increased child node be " five-star ".It is that " hotel " increases " five-star " newly under the binary tree structure of Figure 10, the process of child node is as follows: " apply " according to root node successively, the left subtree " music " " applied ", the right subtree " video " of " music ", " commercial ", " news ", " Sina's microblogging ", the order of the left subtree " hotel " of " commercial " loads binary tree sort structure, when finding " hotel ", if having left subtree under " hotel ", load the left subtree in " hotel ", without the loading that just can stop binary tree, just in Figure 10 " hotel " without left subtree, therefore can be loaded in " hotel ".Then " five-star " is added to " hotel " left subtree on, the complete binary tree sort structure being consequently formed is as shown in figure 12.For another example, if it is " commercial " that the need that client sends increase the node identification of child node newly, newly-increased child node be " Taobao ", then it is as follows under the binary tree structure of Figure 10 to be that " commercial " increases the process of " Taobao " child node newly: " apply " according to root node successively, the left subtree " music " of " application ", the right subtree " video " of " music ", " commercial ", the left subtree " hotel " of " commercial ", the right subtree " ticketing service " in " hotel ", the order loading binary tree sort structure in " store, Jingdone district ".Then " five-star " is added to " store, Jingdone district " right subtree on, be consequently formed complete binary tree sort structure as shown in figure 13.
The present embodiment, when application is carried out Classification Management, by binary tree sort structure, application is carried out multiclass classification management, described binary tree sort structure includes root node and at least one child node, node on the left subtree of each node is the child node of node, node on the right subtree of each node is the same node layer of node, construction features due to binary tree, make the client of the present invention when sending application class management request, need not send overall tree construction, and the Classification Management equipment applied is when increasing child node newly for node, can load and travel through the tree construction of entirety, therefore, the data during application class management can be greatly reduced and process flow.
Same, in implementing, the node data sent in step S313 includes the classification relation of the mark of node that finds and this node and its superior node.And in implementing, the node data that client can be received by the display of controlled tree, described controlled tree there is the node of child node to be shown as the first state, the node without child node is shown as the second state.Such as, client can show the node data of reception by a real tree, tree is shown the node of child node by fruit, the node of child node it is displayed without by flower, thus, user can readily appreciate that whether a certain node to be inquired about or to be revised management by the entity tree that client represents, and increases the experience of user.Further, under conditions of controlled tree, in implementing, before described client sends application class management request, user can trigger described client send application class management request by clicking on the node in the controlled tree in described client.
Fig. 4 is the 4th embodiment schematic flow sheet of the sort management method of the application of the present invention.As shown in Figure 4, the method for the present embodiment includes:
Step S410, receive the application class management request that the client on mobile terminal sends, carrying the nodal information of the node that need to manage in the management request of described application class, described nodal information includes the node identification that need to increase child node newly and increases the amendment demand with node layer newly for described node.
Step S411, start to load described binary tree sort structure from root node according to the node identification received and for node is newly-increased with the amendment demand of node layer, until finding node corresponding to described node identification and increasing newly with the node required for the amendment demand of node layer for node.
Step S412, adds the node that needs are newly-increased on the right subtree of the node found to according to for the newly-increased amendment demand with node layer of node.
Step S413, is sent to described client by the node data of the node after newly-increased process and shows.
Same, in implementing, the binary tree sort structure described in the present embodiment includes root node and at least one child node, and the node on the left subtree of each node is the child node of node, and the node on the right subtree of each node is the same node layer of node.Node and the classification relation of each node that the binary tree sort structure of the present invention includes can be carried by the binary tree sort Structure Creating request of the client transmission on mobile terminal.
In step S411, when needs increase newly with node layer for node, first the root node of binary tree is loaded, the followed by left subtree of root node, the right subtree of node on left subtree, if a certain node also has left subtree, continue to load the right subtree under this certain node left subtree and left subtree, until finding node corresponding to node identification that client sends and increasing newly with the node required for the amendment demand of node layer for node.Then the node that needs are newly-increased is added on the right subtree of the node found according to for the newly-increased amendment demand with node layer of node in step S412.Such as, client sends need newly-increased with the node identification of the node of node layer be " music " newly-increased same node layer be " tourism ".It is as follows under the binary tree structure of Figure 10 to be that " music " increases the process of " tourism " child node newly: " apply " according to root node successively, the left subtree " music " of " application ", the right subtree " video " of " music ", " commercial ", " news ", the node such as " Sina's microblogging ".Then " tourism " is added on the right subtree of " music ", after such as adding " Sina's microblogging " to, be consequently formed complete binary tree sort structure as shown in figure 14.
The present embodiment, when application is carried out Classification Management, by binary tree sort structure, application is carried out multiclass classification management, described binary tree sort structure includes root node and at least one child node, node on the left subtree of each node is the child node of node, node on the right subtree of each node is the same node layer of node, construction features due to binary tree, make the client of the present invention when sending application class management request, need not send overall tree construction, and the Classification Management equipment applied is when increasing newly with node layer for node, can load and travel through the tree construction of entirety, therefore, the data during application class management can be greatly reduced and process flow.
Same, in implementing, the node data sent in step S413 includes the classification relation of the mark of node that finds and this node and its superior node.And in implementing, the node data that client can be received by the display of controlled tree, described controlled tree there is the node of child node to be shown as the first state, the node without child node is shown as the second state.Such as, client can show the node data of reception by a real tree, tree is shown the node of child node by fruit, the node of child node it is displayed without by flower, thus, user can readily appreciate that whether a certain node to be inquired about or to be revised management by the entity tree that client represents, and increases the experience of user.Further, under conditions of controlled tree, in implementing, before described client sends application class management request, user can trigger described client send application class management request by clicking on the node in the controlled tree in described client.
Fig. 5 is the first embodiment structure composition schematic diagram of the Classification Management equipment of the application of the present invention.The equipment of the present embodiment can be used for implementing the method shown in Fig. 1, concrete, as it is shown in figure 5, the equipment of the present embodiment includes that creating unit 50(is optional), receive unit 51, processing unit 52, transmitting element 53 and memory element 54, wherein:
Described creating unit 50 creates binary tree sort structure for the binary tree sort Structure Creating request received according to described reception unit 51.In implementing, described request to create is carried node and the classification relation of each node that the binary tree sort structure that need to create includes.
The application class management request that described reception unit 51 sends for receiving the client on mobile terminal, carries the nodal information of the node that need to manage in the management request of described application class, described nodal information includes the node identification of the node that need to inquire about.It addition, when the equipment of the present embodiment includes creating unit 50, receive unit 51 and be additionally operable to receive the binary tree sort Structure Creating request of the client transmission on mobile terminal.
Described processing unit 52 is for when needs carry out query processing to node, and the node identification according to receiving starts to load described binary tree sort structure from root node, until finding the node that described node identification is corresponding.
Described transmitting element 53 shows for the node data of the node after query processing is sent to described client.
Described memory element 54 is used for storing binary tree sort structure, and described binary tree sort structure includes root node and at least one child node, and the node on the left subtree of each node is the child node of node, and the node on the right subtree of each node is the same node layer of node.
The present embodiment is when a certain node inquired about by needs, first described processing unit 52 loads the root node of binary tree, the followed by left subtree of root node, the right subtree of node on left subtree, if a certain node also has left subtree, continue to load the right subtree under this certain node left subtree and left subtree, until the node that the node identification finding client transmission is corresponding.And for some node, during inquiry, as long as not having left subtree just can directly learn under this node, without all branches needing traverse node as tree construction, this node does not has child node, comes whether decision node has child node.Such as, the binary tree sort structure of memory element 54 initial storage of the present embodiment is as shown in Figure 3, the node identification of the node of the need inquiry that client sends is " video ", by processing unit 52 inquire about under the binary tree structure shown in Figure 10 should " video " process of applying as follows: " apply " according to root node successively, the left subtree " music " of " application ", the order loading binary tree sort structure of right subtree " video " of " music ", when finding " video ", the loading of binary tree just can be stopped.
The present embodiment, when application is carried out Classification Management, by binary tree sort structure, application is carried out multiclass classification management, described binary tree sort structure includes root node and at least one child node, node on the left subtree of each node is the child node of node, node on the right subtree of each node is the same node layer of node, construction features due to binary tree, make the client of the present invention when sending application class management request, need not send overall tree construction, and the Classification Management equipment applied is when inquiring about node, can load and travel through the tree construction of entirety, therefore, the data during application class management can be greatly reduced and process flow.
In implementing, the node data that transmitting element 53 sends includes the classification relation of the mark of node that finds and this node and its superior node.
Fig. 6 is the second example structure composition schematic diagram of the Classification Management equipment of the application of the present invention.The equipment of the present embodiment can be used for implementing the method shown in Fig. 2, and concrete, as shown in Figure 6, the equipment of the present embodiment includes that creating unit 60(is optional), receive unit 61, processing unit 62, transmitting element 63 and memory element 64, wherein:
Described creating unit 60 creates binary tree sort structure for the binary tree sort Structure Creating request received according to described reception unit 61.In implementing, described request to create is carried node and the classification relation of each node that the binary tree sort structure that need to create includes.
The application class management request that described reception unit 61 sends for receiving the client on mobile terminal, the nodal information of the node that need to manage is carried in the management request of described application class, node identification that described nodal information includes the node that need to inquire about and the amendment demand that node is replaced.It addition, when the equipment of the present embodiment includes creating unit 60, receive unit 61 and be additionally operable to receive the binary tree sort Structure Creating request of the client transmission on mobile terminal.
Described processing unit 62 is for when needs are replaced process to node, node identification and the amendment demand that is replaced node according to receiving start to load described binary tree sort structure from root node, until finding the node required for node corresponding to described node identification and the amendment demand that is replaced node；Node on left subtree according to the amendment demand the being replaced node node corresponding to node corresponding to described node identification and described node identification and/or right subtree is replaced.
The node data of the described transmitting element 63 node after replacement being processed is sent to described client and shows.
Described memory element 64 is used for storing binary tree sort structure, and described binary tree sort structure includes root node and at least one child node, and the node on the left subtree of each node is the child node of node, and the node on the right subtree of each node is the same node layer of node.
The present embodiment is when node replaced by needs, first described processing unit 62 loads the root node of binary tree, the followed by left subtree of root node, the right subtree of node on left subtree, if a certain node also has left subtree, continue to load the right subtree under this certain node left subtree and left subtree, until finding the node required for node corresponding to node identification that client sends and amendment demand that node is replaced.Then it is replaced according to the node on the left subtree of amendment demand that node the is replaced node corresponding to node corresponding to described node identification and described node identification and/or right subtree.Such as, the initial binary tree sort structure of the present embodiment memory element 64 storage is as shown in Figure 3, the node identification for " hotel " is replaced with " dining room " and described " dining room " of the node that the need that client sends are replaced includes " ' Sichuan cuisine shop ', ' Guangdong dishes shop ', ' Hunan cuisine shop ' " 3 child nodes.Under the binary tree structure of Figure 10, " hotel " is replaced with " dining room " by processing unit 62, and described " dining room " includes " ' Sichuan cuisine shop ', ' Guangdong dishes shop ', ' Hunan cuisine shop ' " process of 3 child nodes is as follows: " applies " according to root node successively, the left subtree " music " " applied ", the right subtree " video " of " music ", " commercial ", " news ", " Sina's microblogging ", the order of the left subtree " hotel " of " commercial " loads binary tree sort structure, when finding " hotel ", just the loading of binary tree can be stopped (if " hotel " also has left subtree, stop after then needing the left subtree of loading " hotel ").Then replace the position adjusting " hotel " place node with " dining room ", and add " Sichuan cuisine shop " under the left subtree in " dining room ", under the right subtree in " Sichuan cuisine shop ", add " ' Guangdong dishes shop ', ' Hunan cuisine shop ' ".Thus, after replacement, the complete binary tree sort structure of formation is as shown in figure 11.
The present embodiment, when application is carried out Classification Management, by binary tree sort structure, application is carried out multiclass classification management, described binary tree sort structure includes root node and at least one child node, node on the left subtree of each node is the child node of node, node on the right subtree of each node is the same node layer of node, construction features due to binary tree, make the client of the present invention when sending application class management request, need not send overall tree construction, and the Classification Management equipment applied is when being replaced node, can load and travel through the tree construction of entirety, therefore, the data during application class management can be greatly reduced and process flow.
Same, in implementing, the node data sent in the transmitting element 63 of the present embodiment includes the classification relation of the mark of node that finds and this node and its superior node.
Fig. 7 is the 3rd example structure composition schematic diagram of the Classification Management equipment of the application of the present invention.The equipment of the present embodiment can be used for implementing the method shown in Fig. 3, concrete, as it is shown in fig. 7, the equipment of the present embodiment includes that creating unit 70(is optional), receive unit 71, processing unit 72, transmitting element 73 and memory element 74, wherein:
Described creating unit 70 creates binary tree sort structure for the binary tree sort Structure Creating request received according to described reception unit 71.In implementing, described request to create is carried node and the classification relation of each node that the binary tree sort structure that need to create includes.
The application class management request that described reception unit 71 sends for receiving the client on mobile terminal, carrying the nodal information of the node that need to manage in the management request of described application class, described nodal information includes the node identification of the node that need to inquire about and increases the amendment demand of child node for node newly.It addition, when the equipment of the present embodiment includes creating unit 70, receive unit 71 and be additionally operable to receive the binary tree sort Structure Creating request of the client transmission on mobile terminal.
Described processing unit 72 is for when needs increase child node newly for node, according to the node identification received and increase the amendment demand of child node newly for node and start to load described binary tree sort structure from root node, until find node corresponding to described node identification and increase child node newly for node amendment demand required for node；Newly-increased child node is added on the left subtree of node corresponding to the node identification found according to increasing the amendment demand of child node newly for node and/or adds on the right subtree on the left subtree of node corresponding to the node identification found.
The node data of the described transmitting element 73 node after newly-increased child node being processed is sent to described client and shows.
Described memory element 74 is used for storing binary tree sort structure, and described binary tree sort structure includes root node and at least one child node, and the node on the left subtree of each node is the child node of node, and the node on the right subtree of each node is the same node layer of node.
The present embodiment is when the newly-increased child node of needs, first described processing unit 72 loads the root node of binary tree, the followed by left subtree of root node, the right subtree of node on left subtree, if a certain node also has left subtree, continue to load the right subtree under this certain node left subtree and left subtree, until find node corresponding to node identification that client sends and increase child node newly for node amendment demand required for node.Then newly-increased child node is added on the left subtree of node corresponding to the node identification found and/or adds on the right subtree on the left subtree of node corresponding to the node identification found according to increasing the amendment demand of child node newly for node.Such as, as shown in Figure 10, it is " hotel " that the need that client sends increase the node identification of child node newly to the initial binary tree sort structure of the present embodiment memory element 74 storage, and newly-increased child node is " five-star ".The present embodiment is that " hotel " increases " five-star " newly by processing unit 72 under the binary tree structure of Figure 10, the process of child node is as follows: " apply " according to root node successively, the left subtree " music " " applied ", the right subtree " video " of " music ", " commercial ", " news ", " Sina's microblogging ", the order of the left subtree " hotel " of " commercial " loads binary tree sort structure, when finding " hotel ", if having left subtree under " hotel ", load the left subtree in " hotel ", without the loading that just can stop binary tree, just in Fig. 3 " hotel " without left subtree, therefore can be loaded in " hotel ".Then " five-star " is added to " hotel " left subtree on, be consequently formed complete binary tree sort structure as shown in figure 12.For another example, if it is " commercial " that the need that client sends increase the node identification of child node newly, newly-increased child node be " Taobao ", then by processing unit 72, the present embodiment is that " commercial " increases the process of " Taobao " child node newly under the binary tree structure of Figure 10 as follows: " apply " according to root node successively, the left subtree " music " of " application ", the right subtree " video " of " music ", " commercial ", the left subtree " hotel " of " commercial ", the right subtree " ticketing service " in " hotel ", the order loading binary tree sort structure in " store, Jingdone district ".Then " five-star " is added to " store, Jingdone district " right subtree on, be consequently formed complete binary tree sort structure as shown in figure 13.
The present embodiment, when application is carried out Classification Management, by binary tree sort structure, application is carried out multiclass classification management, described binary tree sort structure includes root node and at least one child node, node on the left subtree of each node is the child node of node, node on the right subtree of each node is the same node layer of node, construction features due to binary tree, make the client of the present invention when sending application class management request, need not send overall tree construction, and the Classification Management equipment applied is when increasing child node newly for node, can load and travel through the tree construction of entirety, therefore, the data during application class management can be greatly reduced and process flow.
Same, in implementing, the node data sent in transmitting element 73 in the present embodiment includes the classification relation of the mark of node that finds and this node and its superior node.
Fig. 8 is the 4th example structure composition schematic diagram of the Classification Management equipment of the application of the present invention.The equipment of the present embodiment can be used for implementing the method shown in Fig. 4, and concrete, as shown in Figure 8, the equipment of the present embodiment includes that creating unit 80(is optional), receive unit 81, processing unit 82, transmitting element 83 and memory element 84, wherein:
Described creating unit 80 creates binary tree sort structure for the binary tree sort Structure Creating request received according to described reception unit 81.In implementing, described request to create is carried node and the classification relation of each node that the binary tree sort structure that need to create includes.
The application class management request that described reception unit 81 sends for receiving the client on mobile terminal, carrying the nodal information of the node that need to manage in the management request of described application class, described nodal information includes the node identification of the node that need to inquire about and increases the amendment demand with node layer newly for node.It addition, when the equipment of the present embodiment includes creating unit 80, receive unit 81 and be additionally operable to receive the binary tree sort Structure Creating request of the client transmission on mobile terminal.
Described processing unit 82 is for when needs increase newly with node layer for node, start to load described binary tree sort structure from root node according to the node identification received and for node is newly-increased with the amendment demand of node layer, until finding node corresponding to described node identification and increasing newly with the node required for the amendment demand of node layer for node；According to for the node newly-increased amendment demand with node layer, the node that needs are newly-increased is added on the right subtree of the node found.
Described transmitting element 83 shows for the newly-increased node data with the node after node layer process is sent to described client.
Described memory element 84 is used for storing binary tree sort structure, and described binary tree sort structure includes root node and at least one child node, and the node on the left subtree of each node is the child node of node, and the node on the right subtree of each node is the same node layer of node.
The present embodiment is when needs increase newly with node layer, first described processing unit 82 loads the root node of binary tree, the followed by left subtree of root node, the right subtree of node on left subtree, if a certain node also has left subtree, continue to load the right subtree under this certain node left subtree and left subtree, until finding node corresponding to node identification that client sends and increasing newly with the node required for the amendment demand of node layer for node.Then according to for the node newly-increased amendment demand with node layer, the node that needs are newly-increased is added on the right subtree of the node found.Such as, the initial binary tree sort structure of the present embodiment memory element 84 storage as shown in Figure 10, need that client sends newly-increased with the node identification of the node of node layer be " music " newly-increased same node layer be " tourism ".By processing unit 82, the present embodiment is that " music " increases the process of " tourism " child node newly under the binary tree structure of Figure 10 as follows: " apply " according to root node successively, the left subtree " music " of " application ", the right subtree " video " of " music ", " commercial ", " news ", the node such as " Sina's microblogging ".Then " tourism " is added on the right subtree of " music ", after such as adding " Sina's microblogging " to, be consequently formed complete binary tree sort structure as shown in figure 14.
The present embodiment, when application is carried out Classification Management, by binary tree sort structure, application is carried out multiclass classification management, described binary tree sort structure includes root node and at least one child node, node on the left subtree of each node is the child node of node, node on the right subtree of each node is the same node layer of node, construction features due to binary tree, make the client of the present invention when sending application class management request, need not send overall tree construction, and the Classification Management equipment applied is when increasing newly with node layer for node, can load and travel through the tree construction of entirety, therefore, the data during application class management can be greatly reduced and process flow.
Same, in implementing, the node data sent in transmitting element 83 in the present embodiment includes the classification relation of the mark of node that finds and this node and its superior node.
It addition, the embodiment of the present invention additionally provides the classification managing system of a kind of application, comprising: the Classification Management equipment of mobile terminal application, wherein:
Described mobile terminal, for sending application class management request by the client on mobile terminal, carries the nodal information of the node that need to manage, and the node data received by the display of described client in the management request of described application class.And in implementing, the node data that client can be received by the display of controlled tree, described controlled tree there is the node of child node to be shown as the first state, the node without child node is shown as the second state.Such as, client can show the node data of reception by a real tree, tree is shown the node of child node by fruit, the node of child node it is displayed without by flower, thus, user can readily appreciate that whether a certain node to be inquired about or to be revised management by the entity tree that client represents, and increases the experience of user.Further, under conditions of controlled tree, in implementing, before described client sends application class management request, user can trigger described client send application class management request by clicking on the node in the controlled tree in described client.
The nodal information of the node of the need management that the Classification Management equipment of described application carries in asking according to the Classification Management received inquires about the node in the binary tree sort structure of storage or amendment processes, described binary tree sort structure includes root node and at least one child node, node on the left subtree of each node is the child node of node, node on the right subtree of each node is the same node layer of node, and the client that the node data of the node after query processing or amendment process is sent to described mobile terminal shows.In implementing, the functional module of the Classification Management equipment of described application can include the aforesaid Fig. 5-embodiment illustrated in fig. 8 of the present invention any one and multiple.
One of ordinary skill in the art will appreciate that all or part of flow process realizing in above-described embodiment method, can be by computer program and complete to instruct relevant hardware, described program can be stored in a computer read/write memory medium, this program is upon execution, it may include such as the flow process of the embodiment of above-mentioned each method.Wherein, described storage medium can be magnetic disc, CD, read-only store-memory body (Read-Only
Memory, ROM) or random store-memory body (Random
Access Memory, RAM) etc..
Above disclosed only present pre-ferred embodiments, certainly the interest field of the present invention can not be limited with this, one of ordinary skill in the art will appreciate that all or part of flow process realizing above-described embodiment, and according to the equivalent variations that the claims in the present invention are made, still fall within the scope that invention is contained.
Claims (7)
1. the sort management method of an application, it is characterised in that including:
Receiving the application class management request that the client on mobile terminal sends, the management of described application class please
Carrying the nodal information of the node that need to manage in asking, described nodal information includes node identification；
The nodal information of the node of the need management carried in the Classification Management request according to described reception is to storage
Node in binary tree sort structure carries out query processing, and described binary tree sort structure includes root node and extremely
A few child node, the child node that node is node on the left subtree of each node of described binary tree, respectively saves
The same node layer that node is node on the right subtree of point；
And the node data of the node after query processing is sent to described client shows；
Wherein, the nodal information pair of the node of the need management carried in asking according to the Classification Management of described reception
Node in the binary tree sort structure of storage carries out query processing, including:
Load the root node of described binary tree, reload the right son of node on the left subtree of root node and left subtree
Tree, if described left subtree or right subtree node have left subtree, then loads described node left subtree and left subtree
Under right subtree, until searching node corresponding to described node identification.
2. the sort management method of application as claimed in claim 1, it is characterised in that
When node is modified process by needs, the need management carried in the management request of described application class
The nodal information of node includes the node identification of node and the amendment demand that need to revise；Described amendment demand includes
Node is replaced, increases child node for node newly, increases newly with one or more in node layer for node.
3. the sort management method of application as claimed in claim 1, it is characterised in that also include:
Receive the binary tree sort Structure Creating request that the client on mobile terminal sends, described request to create
In carry node and each internodal classification relation that the binary tree sort structure that need to create includes；
Binary tree sort Structure Creating request according to receiving creates binary tree sort structure.
4. the sort management method of application as claimed in claim 1, it is characterised in that described client is led to
Cross the node data that the display of controlled tree receives, described controlled tree have the node of child node to be shown as the first state,
Node without child node is shown as the second state；
Before described client sends application class management request, also include:
Click on the node in the controlled tree in described client, trigger described client and send application class management
Request.
5. the Classification Management equipment of an application, it is characterised in that including:
Receive unit, for receiving the application class management request that the client on mobile terminal sends, described
Carrying the nodal information of the node that need to manage in application class management request, described nodal information includes node mark
Know；
Processing unit, the need management carried in the Classification Management request received according to described reception unit
The nodal information of node carries out query processing to the node in the binary tree sort structure of storage；
Transmitting element, shows for the node data of the node after query processing is sent to described client
Show；
Memory element, is used for storing binary tree sort structure, described binary tree sort structure include root node and
At least one child node, the child node that node is node on the left subtree of each node of described binary tree, respectively
Node on the right subtree of node is the same node layer of node；
Wherein, described processing unit specifically for:
Load the root node of described binary tree, reload the right son of node on the left subtree of root node and left subtree
Tree, if described left subtree or right subtree node have left subtree, then loads described node left subtree and left subtree
Under right subtree, until searching node corresponding to described node identification.
6. the Classification Management equipment of application as claimed in claim 5, it is characterised in that described reception unit
Being additionally operable to receive the binary tree sort Structure Creating request of the client transmission on mobile terminal, described establishment please
Ask and carry node and each internodal classification relation that the binary tree sort structure that need to create includes；
Described equipment also includes:
Creating unit, for the binary tree sort Structure Creating request establishment two received according to described reception unit
Fork tree classification structure.
7. the classification managing system of an application, it is characterised in that including:
Mobile terminal, for sending application class management request by client on mobile terminal, described should
Carrying the nodal information of the node that need to manage with Classification Management in asking, described nodal information includes node identification,
And by the node data of described client display reception；
The Classification Management equipment of application, for the joint according to the need management carried in the Classification Management request received
The nodal information of point carries out query processing to the node in the binary tree sort structure of storage, and described binary tree is divided
Class formation includes root node and at least one child node, the node on the left subtree of each node of described binary tree
For the child node of node, the node on the right subtree of each node is the same node layer of node, and by query processing
After the node data of node be sent to the client of described mobile terminal and show；
Wherein, the Classification Management equipment of described application specifically for:
Load the root node of described binary tree, reload the right son of node on the left subtree of root node and left subtree
Tree, if described left subtree or right subtree node have left subtree, then loads described node left subtree and left subtree
Under right subtree, until searching node corresponding to described node identification.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210028550.5A CN103248649B (en) | 2012-02-09 | 2012-02-09 | Sort management method, equipment and the system of application |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210028550.5A CN103248649B (en) | 2012-02-09 | 2012-02-09 | Sort management method, equipment and the system of application |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103248649A CN103248649A (en) | 2013-08-14 |
| CN103248649B true CN103248649B (en) | 2016-08-24 |
Family
ID=48927871
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210028550.5A Active CN103248649B (en) | 2012-02-09 | 2012-02-09 | Sort management method, equipment and the system of application |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103248649B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR102277087B1 (en) * | 2014-08-21 | 2021-07-14 | 삼성전자주식회사 | Method of classifying contents and electronic device |
| CN111274504B (en) * | 2020-01-20 | 2023-09-26 | 浙江中国轻纺城网络有限公司 | Commodity classification method, device and equipment of e-commerce platform |
| CN114661778A (en) * | 2020-12-23 | 2022-06-24 | 中国移动通信有限公司研究院 | Data processing method and device, communication node and terminal |
| CN113656801B (en) * | 2021-08-19 | 2023-06-09 | 建信金融科技有限责任公司 | Android malicious application family classification method, server and terminal |
| CN113722016B (en) * | 2021-09-10 | 2024-08-20 | 拉卡拉支付股份有限公司 | Application program configuration method, device, equipment, storage medium and program product |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7107265B1 (en) * | 2000-04-06 | 2006-09-12 | International Business Machines Corporation | Software management tree implementation for a network processor |
| CN101083608A (en) * | 2006-05-30 | 2007-12-05 | 华为技术有限公司 | Method for enquiring node information of equipment management tree and its terminal equipment |
| CN101996074A (en) * | 2009-08-20 | 2011-03-30 | 华为终端有限公司 | Method and device for managing software by using software component management object |
-
2012
- 2012-02-09 CN CN201210028550.5A patent/CN103248649B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7107265B1 (en) * | 2000-04-06 | 2006-09-12 | International Business Machines Corporation | Software management tree implementation for a network processor |
| CN101083608A (en) * | 2006-05-30 | 2007-12-05 | 华为技术有限公司 | Method for enquiring node information of equipment management tree and its terminal equipment |
| CN101996074A (en) * | 2009-08-20 | 2011-03-30 | 华为终端有限公司 | Method and device for managing software by using software component management object |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103248649A (en) | 2013-08-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11064053B2 (en) | Method, apparatus and system for processing data | |
| CN103248649B (en) | Sort management method, equipment and the system of application | |
| CN102546708B (en) | Plug-in obtaining method and system as well as relevant devices | |
| US20080086464A1 (en) | Efficient method of location-based content management and delivery | |
| CN109471838B (en) | Directory document operation method and device, electronic equipment and readable storage medium | |
| CN101944124A (en) | Distributed file system management method, device and corresponding file system | |
| CN106713323A (en) | Page content preview method, client, server and system | |
| CN104978376B (en) | It is a kind of to track the method and system for sharing path comment | |
| CN105338113A (en) | Multi-platform data interconnected system for sharing urban data resources | |
| CN108509437A (en) | A kind of ElasticSearch inquiries accelerated method | |
| US20120224482A1 (en) | Credit feedback system for parallel data flow control | |
| CN105183768A (en) | File management method, apparatus and terminal device | |
| CN105814864B (en) | A kind of input and output I/O request processing method and file server | |
| CN106331160A (en) | Data migration method and system | |
| CN104243565A (en) | Method and device for obtaining configuration data | |
| CN113805816A (en) | Disk space management method, device, equipment and storage medium | |
| CN104572981B (en) | A kind of Webpage method for caching and processing and mobile terminal device | |
| JP2013229042A (en) | System and method for managing distribution of content to devices | |
| CN113609401A (en) | Dynamic display method of book city channel page, electronic equipment and storage medium | |
| CN105242885A (en) | Network storage change method and device | |
| CN104737505A (en) | Routing method based on cache and route node | |
| CN112579877A (en) | Information source system control method, device, storage medium and equipment | |
| CN107305496A (en) | Application APP method for down loading and Wireless Communication Equipment | |
| US10114864B1 (en) | List element query support and processing | |
| CN115794876A (en) | Fragment processing method, device, equipment and storage medium for service data packet |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |