CN109885358A - A kind of red dot representation method and system based on tree form data structure - Google Patents
A kind of red dot representation method and system based on tree form data structure Download PDFInfo
- Publication number
- CN109885358A CN109885358A CN201910022772.8A CN201910022772A CN109885358A CN 109885358 A CN109885358 A CN 109885358A CN 201910022772 A CN201910022772 A CN 201910022772A CN 109885358 A CN109885358 A CN 109885358A
- Authority
- CN
- China
- Prior art keywords
- red dot
- tree
- module
- functional module
- modules
- 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
Landscapes
- Stored Programmes (AREA)
Abstract
This application discloses a kind of red dot representation method based on tree form data structure, comprising the following steps: according to the dependence between function sub-modules each in application program, construct corresponding functional module red dot tree；The funcall instruction inputted by preset information input interface, the red dot for updating the upper respective modules node of functional module red dot tree count；The red dot that recurrence updates from the corresponding Module nodes to modules node on the path of the root node of functional module red dot tree counts；Functional module of dishing out red dot tree update event, so that application program, which monitors interface by preset information, captures the functional module red dot tree update event.Disclosed herein as well is the red dots accordingly based on tree form data structure to indicate system.The application's has the beneficial effect that by releasing the coupling between sub-function module and red dot expression function, can obtain the effect for reducing application program later maintenance cost.
Description
Technical field
This application involves field of software development more particularly to a kind of red dot representation method based on tree form data structure and it is
System.
Background technique
In intelligent sliding moved end, such as smart phone or tablet computer, operating system either use Android system still
IOS system all generally provides red dot representation, is waited at user with reminding client's related application to receive all new informations
Reason.This interface mode is also applied to inside single application program.For example, mobile phone games are in order to attract player to continue to swim
It plays, generally provides a variety of game modes or daily reward.Player needs to guide to correlation function by the interface of application program
Mouth (such as entrance is got in game mode entrance or reward).Since these game modes and daily reward often change, because
This application program needs to provide the mode that such as red dot indicates to remind player, and guides to correlation function entrance.
However, the alert notification of either operating system level or application program intra-level, above-mentioned red dot indicates boundary
Face design is scattering into each sub-function module of system by the way of flattening.Especially for using journey
For sequence inside, when needing iteration more new version, developer needs to provide special routine interface and accesses some subfunction
Red dot number.Therefore, after the such version iteration renewal speed of such as mobile phone games very fast application program operation a period of time, on
It states and often leaves multiple and different old versions for the interface of access, cause the interface disunity here for access, thus
The later maintenance cost of application program is continuously improved.This is because it is above-mentioned for access the interface of some subfunction red dot number with should
There is stronger coupling between subfunction.Further, if red dot number derives from multiple subfunction systems, exploit person
Member was more difficult to where the problem of positioning application program, to be difficult to prop up complicated application scenarios.
Summary of the invention
The purpose of the application is to solve the deficiencies in the prior art, provides a kind of red dot expression side based on tree form data structure
Method and system, by releasing the coupling between sub-function module and red dot expression function, can obtain reduces the application program later period
The effect of maintenance cost.
To achieve the goals above, the following technical solution is employed by the application.
Firstly, the application proposes a kind of red dot representation method based on tree form data structure.Method includes the following steps:
S100) according to the dependence between function sub-modules each in application program, it is red to construct corresponding functional module
Point tree；
S200 it) is indicated, is updated on functional module red dot tree by the funcall that preset information input interface is inputted
The red dot of respective modules node counts；
S300) recurrence is updated from the corresponding Module nodes to each on the path of the root node of functional module red dot tree
The red dot of Module nodes counts；
S400 functional module of) dishing out red dot tree update event is caught so that application program monitors interface by preset information
Obtain the functional module red dot tree update event.
Further, in the above method of the application, the step S100 further includes sub-step below:
S101) each function sub-modules of traversal applications program, to obtain the dependence between each function sub-modules；
S102 the corresponding Module nodes of each function sub-modules) are initialized；
S103) according to the dependence between each function sub-modules, Module nodes are built into corresponding functional module
Red dot tree.
Alternatively, in the above method of the application, the funcall instruction includes at least function sub-modules only
One identifier and red dot counter incrementing.
Further, in the above method of the application, the step S200 further includes sub-step below:
S201) by preset information input interface, the function tune that application program is issued with regard to each function sub-modules is obtained
With instruction；
S202 the unique identifier and red dot counter incrementing of the function sub-modules in funcall instruction are obtained) to update
The red dot of the upper respective modules node of the functional module red dot tree counts.
Further, in the above method of the application, the step S300 further includes sub-step below:
S301 all Module nodes on the path of root node of the Module nodes to functional module red dot tree) are obtained；
S302 it) in addition to the corresponding Module nodes, is corrected using the red dot counter incrementing all on the path
The red dot of Module nodes counts.
Further, in the above method of the application, the step S400 further includes sub-step below:
S401 functional module of) dishing out red dot tree update event, wherein the functional module red dot tree update event is at least wrapped
Include unique identifier and and modified red dot counting that red dot counts the function sub-modules being updated；
S402 interface) is monitored by preset information and captures the functional module red dot tree update event, to obtain red dot
Count unique identifier and and the modified red dot counting of the function sub-modules being updated.
Still further, the information is monitored interface and is provided in a manner of call back function in the above method of the application.
Secondly, the application proposes that a kind of red dot based on tree form data structure indicates system.The system comprises the following modules:
Module is constructed, for it is red to construct corresponding functional module according to the dependence between function sub-modules each in application program
Point tree；First update module, the funcall instruction for being inputted by preset information input interface, updates functional module
The red dot of the upper respective modules node of red dot tree counts；Second update module is updated for recurrence from the corresponding Module nodes
The red dot of modules node counts on to the path of the root node of functional module red dot tree；It dishes out module, for function of dishing out
Module red dot tree update event, so that application program, which monitors interface by preset information, captures the functional module red dot tree more
New events.
Further, in the above system of the application, the building module further includes submodule below: traversal mould
Block, for each function sub-modules of traversal applications program, to obtain the dependence between each function sub-modules；Initialization
Module, for initializing the corresponding Module nodes of each function sub-modules；First execution module, for according to each function submodule
Module nodes are built into corresponding functional module red dot tree by the dependence between block.
Alternatively, in the above system of the application, the funcall instruction includes at least function sub-modules only
One identifier and red dot counter incrementing.
Further, in the above system of the application, first update module further includes submodule below: first
Module is obtained, for obtaining the function tune that application program is issued with regard to each function sub-modules by preset information input interface
With instruction；Second obtains module, and the unique identifier and red dot for obtaining the function sub-modules in funcall instruction count
Increment is counted with updating the red dot of the upper respective modules node of the functional module red dot tree.
Further, in the above system of the application, second update module further includes submodule below: third
Module is obtained, for obtaining all Module nodes on the Module nodes to the path of the root node of functional module red dot tree；
Correction module, for being corrected using the red dot counter incrementing all on the path in addition to the corresponding Module nodes
The red dot of Module nodes counts.
Further, in the above system of the application, the module of dishing out further includes submodule below: second executes
Module, for functional module red dot tree update event of dishing out, wherein the functional module red dot tree update event is including at least red
Point counts unique identifier and and the modified red dot counting for the function sub-modules being updated；Trapping module, for by pre-
If information monitor interface and capture the functional module red dot tree update event, to obtain the function submodule that red dot counting is updated
The unique identifier of block and and modified red dot counting.
Still further, the information is monitored interface and is provided in a manner of call back function in the above system of the application.
Finally, the application also proposes a kind of computer readable storage medium, it is stored thereon with computer instruction.Above-metioned instruction
When being executed by processor, following steps are executed:
S100) according to the dependence between function sub-modules each in application program, it is red to construct corresponding functional module
Point tree；
S200 it) is indicated, is updated on functional module red dot tree by the funcall that preset information input interface is inputted
The red dot of respective modules node counts；
S300) recurrence is updated from the corresponding Module nodes to each on the path of the root node of functional module red dot tree
The red dot of Module nodes counts；
S400 functional module of) dishing out red dot tree update event is caught so that application program monitors interface by preset information
Obtain the functional module red dot tree update event.
Further, during the above-metioned instruction of the application is executed by processor, the step S100 further include with
Under sub-step:
S101) each function sub-modules of traversal applications program, to obtain the dependence between each function sub-modules；
S102 the corresponding Module nodes of each function sub-modules) are initialized；
S103) according to the dependence between each function sub-modules, Module nodes are built into corresponding functional module
Red dot tree.
Alternatively, during the above-metioned instruction of the application is executed by processor, the funcall instruction is at least
Unique identifier and red dot counter incrementing including function sub-modules.
Further, during the above-metioned instruction of the application is executed by processor, the step S200 further include with
Under sub-step:
S201) by preset information input interface, the function tune that application program is issued with regard to each function sub-modules is obtained
With instruction；
S202 the unique identifier and red dot counter incrementing of the function sub-modules in funcall instruction are obtained) to update
The red dot of the upper respective modules node of the functional module red dot tree counts.
Further, during the above-metioned instruction of the application is executed by processor, the step S300 further include with
Under sub-step:
S301 all Module nodes on the path of root node of the Module nodes to functional module red dot tree) are obtained；
S302 it) in addition to the corresponding Module nodes, is corrected using the red dot counter incrementing all on the path
The red dot of Module nodes counts.
Further, during the above-metioned instruction of the application is executed by processor, the step S400 further include with
Under sub-step:
S401 functional module of) dishing out red dot tree update event, wherein the functional module red dot tree update event is at least wrapped
Include unique identifier and and modified red dot counting that red dot counts the function sub-modules being updated；
S402 interface) is monitored by preset information and captures the functional module red dot tree update event, to obtain red dot
Count unique identifier and and the modified red dot counting of the function sub-modules being updated.
Still further, during the above-metioned instruction of the application is executed by processor, the information monitor interface with
The mode of call back function provides.
The application's has the beneficial effect that by detaching red dot expression function from each sub-function module of application program
Out, the coupling between sub-function module and red dot expression function is released, can obtain reduces application program later maintenance cost
Effect.
Detailed description of the invention
Fig. 1 show the method flow diagram of the red dot representation method disclosed in the present application based on tree form data structure；
Fig. 2 is shown in one embodiment of the application, the submethod flow chart of constructing function module red dot tree；
Fig. 3 show the data structure schematic diagram of functional module red dot tree constructed by the submethod according to fig. 2；
Fig. 4 is shown in another embodiment of the application, updates the submethod flow chart of respective modules node；
Fig. 5 is shown in another embodiment of the application, updates the submethod stream of respective modules node to root node
Cheng Tu；
Fig. 6 is shown in another embodiment of the application, the submethod of functional module of dishing out red dot tree update event
Flow chart；
Fig. 7 show the submethod according to fig. 2, the use-case of upper layer application capturing function module red dot tree update event
Figure；
Fig. 8, which show the red dot disclosed in the present application based on tree form data structure, indicates the function structure chart of system.
Specific embodiment
It is carried out below with reference to technical effect of the embodiment and attached drawing to the design of the application, specific structure and generation clear
Chu, complete description, to be completely understood by the purpose, scheme and effect of the application.It should be noted that the case where not conflicting
Under, the features in the embodiments and the embodiments of the present application can be combined with each other.
It should be noted that unless otherwise specified, when a certain feature referred to as " fixation ", " connection " are in another feature,
It can directly fix, be connected to another feature, and can also fix, be connected to another feature indirectly.In addition, this
The descriptions such as upper and lower, left and right used in application are only the mutual alignment pass relative to each component part of the application in attached drawing
For system.In the application and the "an" of singular used in the attached claims, "the" and " described " also purport
It is including most forms, unless the context clearly indicates other meaning.
In addition, unless otherwise defined, the technology of all technical and scientific terms used herein and the art
The normally understood meaning of personnel is identical.Term used in the description is intended merely to description specific embodiment herein, without
It is to limit the application.Term as used herein "and/or" includes the arbitrary of one or more relevant listed items
Combination.
It will be appreciated that though various elements may be described in this application using term first, second, third, etc., but
These elements should not necessarily be limited by these terms.These terms are only used to for same type of element being distinguished from each other out.For example, not taking off
In the case where the application range, first element can also be referred to as second element, and similarly, second element can also be referred to as
First element.Depending on context, word as used in this " if " can be construed to " ... when " or " when ...
When ".
Method flow diagram shown in referring to Fig.1, the red dot representation method disclosed in the present application based on tree form data structure
It may comprise steps of:
S100) according to the dependence between function sub-modules each in application program, it is red to construct corresponding functional module
Point tree；
S200 it) is indicated, is updated on functional module red dot tree by the funcall that preset information input interface is inputted
The red dot of respective modules node counts；
S300) recurrence is updated from the corresponding Module nodes to each on the path of the root node of functional module red dot tree
The red dot of Module nodes counts；
S400 functional module of) dishing out red dot tree update event is caught so that application program monitors interface by preset information
Obtain the functional module red dot tree update event.
Since function sub-modules each inside application program are received by preset information input interface from service
Device data and user click interface, or capture specified event etc. and be possible to the change of triggering red dot quantity；Therefore, above-mentioned outer
Portion's input is counted by the red dot that unified trigger mechanism updates each function sub-modules.Correspondingly, each function sub-modules are logical
It crosses the mode of Observer Pattern and feeds back funcall instruction received by its own to the upper layer application of application program, thus real
Existing sub-function module and red dot indicate decoupling between function.Specifically, functional module red dot tree is considered as observed person, boundary
The upper layer applications such as face application scenarios are then considered as observer.In this way, application program need to only provide corresponding interface appropriate
Opportunity more new data can then be inquired to red dot tree by functional module red dot tree.
Referring to submethod flow chart shown in Fig. 2, in the said one or multiple embodiments of the application, the step
S100 further includes sub-step below:
S101) each function sub-modules of traversal applications program, to obtain the dependence between each function sub-modules；
S102 the corresponding Module nodes of each function sub-modules) are initialized；
S103) according to the dependence between each function sub-modules, Module nodes are built into corresponding functional module
Red dot tree.The data structure schematic diagram of functional module red dot tree as shown in connection with fig. 3, the relationship between each function sub-modules
Public, private, protect and friend etc. (such as C++, directly can be passed through by code determination
Keyword determines inheritance or dependence between each class).Meanwhile the dependence between each functional module
It can be determined by code file position.Those skilled in the art can pass through programming according to the specific source code of application program
Mode automatically determines the dependence between each function sub-modules, and using the conventional algorithm and data structure of this field, structure
Build functional module red dot tree as shown in Figure 3, or the functional module red dot forest being made of more functional module red dot trees, this Shen
Please this is not limited.In addition, it will be understood by those skilled in the art that the number and shape of the display element in Fig. 3 only conduct
Illustrative reference, not as the limitation to the application.In addition, the application is only to single functional module for convenience of following discussion
The case where red dot tree, discusses.Those skilled in the art can not depart from the application spirit limited range, by it
The case where being generalized to functional module red dot forest.
Further, in the said one of the application or multiple embodiments, the funcall instruction includes at least function
The unique identifier and red dot counter incrementing of energy submodule.Correspondingly, each Module nodes in functional module red dot tree should
Variable comprising correspondence above-mentioned unique identifier and red dot counter incrementing, and before being built into corresponding functional module red dot tree
It is initialised.As shown in figure 3, wherein the module I D in each Module nodes and red dot counting respectively correspond above-mentioned unique identifier
Wherein with red dot counter incrementing.Further, when executing above-mentioned steps S102, the unique identifier of Module nodes is initialized as
The unique identifier of respective modules, and red dot counting is then initialized as 0.When funcall indicates to connect by preset information input
When mouth input is come in, corresponding Module nodes first can be found according to its unique identifier carried, and according to its carrying
Red dot counter incrementing refresh function module red dot tree in each node data.
Specifically, referring to submethod flow chart shown in Fig. 4, in one or more embodiments of the application, the step
Rapid S200 further includes sub-step below:
S201) by preset information input interface, the function tune that application program is issued with regard to each function sub-modules is obtained
With instruction；
S202 the unique identifier and red dot counter incrementing of the function sub-modules in funcall instruction are obtained) to update
The red dot of the upper respective modules node of the functional module red dot tree counts.
It should be pointed out that red dot counter incrementing can be the integer variable of a tape symbol.For example, when receiving from clothes
Business device data or when capturing specified event etc. and being possible to the increase message of triggering red dot quantity, red dot counter incrementing is one
Positive integer；On the contrary, being possible to touch if receiving and clicking interface (such as user has clicked on correlation function entrance) etc. from user
When the reduction message of rubescent quantity, red dot counter incrementing is a negative integer.The red dot of Module nodes, which counts, adds function tune
With the red dot counter incrementing of instruction it is resulting and, be exactly that updated red dot counts.Those skilled in the art can also be according to tool
The application scenarios setting of body and such this or opposite red dot counter incrementing, do not apply to this not restriction.
Further, submethod flow chart referring to Figure 5, it is described in one or more embodiments of the application
Step S300 can also include sub-step below:
S301 all Module nodes on the path of root node of the Module nodes to functional module red dot tree) are obtained；
S302 it) in addition to the corresponding Module nodes, is corrected using the red dot counter incrementing all on the path
The red dot of Module nodes counts.
For the efficiency for further increasing update, the funcall instruction can further include the Module nodes extremely
The unique identifier of all Module nodes on the path of the root node of functional module red dot tree is examined so as to easily batch
Rope goes out to need more new node.In addition it is also necessary to which, it is noted that the data structure referring to functional module red dot tree shown in Fig. 3 is shown
It is intended to, the red dot of some node counts to be equal to and the red dot counting of its all child node is added up, and adds the red dot meter of itself
Number.For example, the practical red dot quantity of Module nodes B is exactly the red of its child node Module nodes E, Module nodes F and Module nodes G
The sum of point counting, along with the red dot of itself counts (i.e. the practical red dot quantity of Module nodes B is 1+0+1+2=4).The mould
All Module nodes on block node to the path of the root node of functional module red dot tree can use as before
Method updates.
Referring to submethod flow chart shown in fig. 6, in one or more embodiments of the application, the step S400 is also
Including sub-step below:
S401 functional module of) dishing out red dot tree update event, wherein the functional module red dot tree update event is at least wrapped
Include unique identifier and and modified red dot counting that red dot counts the function sub-modules being updated；
S402 interface) is monitored by preset information and captures the functional module red dot tree update event, to obtain red dot
Count unique identifier and and the modified red dot counting of the function sub-modules being updated.
Specifically, Use Case Map as shown in connection with fig. 7.In order to realize the concrete scene of functional module red dot tree and application program
It associates to refresh related data in time, functional module red dot tree is designed to " observed person ", upper and layer application is designed to
" observer ".Inside application program, upper layer application completes initialization by obtaining the current state of functional module red dot tree, and
And register the event of monitor function module red dot tree variation.When functional module red dot tree (" observed person ") by external input and
When changing, relevant data maintenance program need not be concerned about the processing logic of upper layer application (" observer "), and need to only dish out function
It can module red dot tree update event.Upper layer application (" observer ") is come by nodal value corresponding to inquiry own path
Determine the Show Styles at specific interface.Dished out functional module red dot tree update event is responded for convenience of upper layer application, at this
In the said one of application or multiple embodiments, the information is monitored interface and is provided in a manner of call back function.
Referring to apparatus module figure shown in Fig. 8, the red dot disclosed in the present application based on tree form data structure indicates system
May include with lower module: building module, for according to the dependence between function sub-modules each in application program, building
Corresponding functional module red dot tree；First update module, the funcall for being inputted by preset information input interface
Instruction, the red dot for updating the upper respective modules node of functional module red dot tree count；Second update module is updated for recurrence from right
The red dot of modules node counts on the Module nodes answered to the path of the root node of functional module red dot tree；It dishes out mould
Block, for functional module red dot tree update event of dishing out, so that application program is monitored described in interface capture by preset information
Functional module red dot tree update event.Since function sub-modules each inside application program are connect by preset information input
Mouth, which receives to click interface from server data and user, or capture specified event etc., is possible to changing for triggering red dot quantity
Become；Therefore, said external input is counted by the red dot that unified trigger mechanism updates each function sub-modules.Correspondingly, respectively
A function sub-modules feed back the function received by its own by way of Observer Pattern to the upper layer application of application program
Instruction is called, to realize that sub-function module and red dot indicate decoupling between function.Specifically, functional module red dot tree quilt
It is considered as observed person, the upper layer applications such as interface application scene are then considered as observer.In this way, application program need to only provide accordingly
Interface to red dot tree, then can be inquired with the more new data that is in due course by functional module red dot tree.
In the said one or multiple embodiments of the application, the building module further includes submodule below: traversal
Module, for each function sub-modules of traversal applications program, to obtain the dependence between each function sub-modules；Initially
Change module, for initializing the corresponding Module nodes of each function sub-modules；First execution module, for according to each function
Module nodes are built into corresponding functional module red dot tree by the dependence between module.Functional module as shown in connection with fig. 3
The data structure schematic diagram of red dot tree, relationship between each function sub-modules can directly be determined by code (such as right
For C++, the succession between each class can be determined by keywords such as public, private, protect and friend
Relationship or dependence).Meanwhile the dependence between each functional module can also be determined by code file position.
Those skilled in the art can automatically determine each function sub-modules by programming mode according to the specific source code of application program
Between dependence, and using this field conventional algorithm and data structure, construct functional module red dot as shown in Figure 3
Tree, or the functional module red dot forest being made of more functional module red dot trees, the application not limit this.In addition, ability
Field technique personnel will be appreciated that the number and shape of the display element in Fig. 3 are only as illustrative reference, not as to this Shen
Limitation please.In addition, for convenience of following discussion, the application only discusses to the case where single functional module red dot tree.Ability
Field technique personnel can not depart from the application spirit limited range, be generalized to the feelings of functional module red dot forest
Condition.
Further, in the said one of the application or multiple embodiments, the funcall instruction includes at least function
The unique identifier and red dot counter incrementing of energy submodule.Correspondingly, each Module nodes in functional module red dot tree should
Variable comprising correspondence above-mentioned unique identifier and red dot counter incrementing, and before being built into corresponding functional module red dot tree
It is initialised.As shown in figure 3, wherein the module I D in each Module nodes and red dot counting respectively correspond above-mentioned unique identifier
Wherein with red dot counter incrementing.Further, when executing above-mentioned steps S102, the unique identifier of Module nodes is initialized as
The unique identifier of respective modules, and red dot counting is then initialized as 0.When funcall indicates to connect by preset information input
When mouth input is come in, corresponding Module nodes first can be found according to its unique identifier carried, and according to its carrying
Red dot counter incrementing refresh function module red dot tree in each node data.
Specifically, in one or more embodiments of the application, first update module further includes submodule below
Block: first obtains module, for obtaining what application program was issued with regard to each function sub-modules by preset information input interface
Funcall instruction；Second obtains module, for obtaining the unique identifier of function sub-modules in funcall instruction and red
Point counter incrementing is counted with updating the red dot of the upper respective modules node of the functional module red dot tree.It is pointed out that red dot
Counter incrementing can be the integer variable of a tape symbol.For example, when receiving from server data or capturing specified thing
When part etc. is possible to the increase message of triggering red dot quantity, red dot counter incrementing is a positive integer；On the contrary, being come from if received
It is red when user's click interface (such as user has clicked on correlation function entrance) etc. is possible to the reduction message of triggering red dot quantity
Point counter incrementing is a negative integer.It is resulting that the red dot of Module nodes counts the red dot counter incrementing indicated plus funcall
Be exactly that updated red dot counts.Those skilled in the art can also according to specific application scenarios be arranged with it is such this or
Opposite red dot counter incrementing is not applied not limiting this.
Further, in one or more embodiments of the application, second update module further includes son below
Module: third obtains module, all on the Module nodes to the path of the root node of functional module red dot tree for obtaining
Module nodes；Correction module, for correcting the path using the red dot counter incrementing in addition to the corresponding Module nodes
On all Module nodes red dot count.For the efficiency for further increasing update, the funcall instruction can also be into one
Step includes the unique identifier of all Module nodes on the Module nodes to the path of the root node of functional module red dot tree,
Go out to need more new node so as to easily bulk retrieval.In addition it is also necessary to, it is noted that referring to function mould shown in Fig. 3
The data structure schematic diagram of block red dot tree, the red dot of some node, which counts to be equal to, adds the red dot counting of its all child node
Come, and is counted plus the red dot of itself.For example, the practical red dot quantity of Module nodes B is exactly its child node Module nodes E, mould
The sum of the red dot of block node F and Module nodes G counting, along with the red dot of itself counts (the i.e. practical red dot number of Module nodes B
Amount is 1+0+1+2=4).All Module nodes on the Module nodes to the path of the root node of functional module red dot tree can
To be updated using method as before.
In one or more embodiments of the application, the module of dishing out further includes submodule below: second executes
Module, for functional module red dot tree update event of dishing out, wherein the functional module red dot tree update event is including at least red
Point counts unique identifier and and the modified red dot counting for the function sub-modules being updated；Trapping module, for by pre-
If information monitor interface and capture the functional module red dot tree update event, to obtain the function submodule that red dot counting is updated
The unique identifier of block and and modified red dot counting.Specifically, Use Case Map as shown in connection with fig. 7.In order to realize function mould
The concrete scene of block red dot tree and application program associates to refresh related data in time, and functional module red dot tree is designed to
" observed person ", goes up and layer application is designed to " observer ".Inside application program, upper layer application is red by obtaining functional module
The current state of point tree completes initialization, and registers the event of monitor function module red dot tree variation.When functional module red dot
(" observed person ") is set by external input and when changing, relevant data maintenance program need not be concerned about that upper layer application (" is seen
The person of examining ") processing logic, need to only dish out functional module red dot tree update event.Upper layer application (" observer ") is by looking into
Nodal value corresponding to own path is ask, to determine the Show Styles at specific interface.It is dished out for convenience of upper layer application response
Functional module red dot tree update event, in the said one or multiple embodiments of the application, the information monitors interface to return
The mode of letter of transfer number provides.
It should be appreciated that embodiments herein can be by computer hardware, the combination of hardware and software or by depositing
The computer instruction in non-transitory computer-readable memory is stored up to be effected or carried out.Standard program can be used in this method
Technology-include realized in computer program configured with the non-transitory computer-readable storage media of computer program, wherein
Configured in this way storage medium operates computer in a manner of specific and is predefined --- according to retouching in a particular embodiment
The method and attached drawing stated.Each program can with the programming language of level process or object-oriented come realize with computer system
Communication.However, if desired, the program can be realized with compilation or machine language.Under any circumstance, which can be compiling
Or the language explained.In addition, the program can be run on the specific integrated circuit of programming for this purpose.
Further, this method can be realized in being operably coupled to suitable any kind of computing platform, wrap
Include but be not limited to PC, mini-computer, main frame, work station, network or distributed computing environment, individual or integrated
Computer platform or communicated with charged particle tool or other imaging devices etc..The various aspects of the application can be to deposit
The machine readable code on non-transitory storage medium or equipment is stored up to realize no matter be moveable or be integrated to calculating
Platform, such as hard disk, optical reading and/or write-in storage medium, RAM, ROM, so that it can be read by programmable calculator, when
Storage medium or equipment can be used for configuration and operation computer to execute process described herein when being read by computer.This
Outside, machine readable code, or part thereof can be transmitted by wired or wireless network.When such media include combining microprocessor
Or when other data processors realization instruction or program of the step above, application as described herein includes that these and other are different
The non-transitory computer-readable storage media of type.When being programmed according to methods and techniques described herein, the application is also
Including computer itself.
Computer program can be applied to input data to execute function as described herein, to convert input data with life
At storing to the output data of nonvolatile memory.Output information can also be applied to one or more output equipments as shown
Device.In the application preferred embodiment, the data of conversion indicate physics and tangible object, including the object generated on display
Reason and the particular visual of physical objects are described.
Other modifications are in spirit herein.Therefore, although disclosed technology may be allowed various modifications and substitution structure
It makes, but has shown that in the accompanying drawings and its some embodiments shown in being described in detail above.It will be appreciated, however, that not
It is intended to for the application to be confined to disclosed one or more concrete forms；On the contrary, its intention covers such as the appended claims
Defined in fall in all modifications, alternative constructions and equivalent in spirit and scope.
Claims (9)
1. a kind of red dot representation method based on tree form data structure, which comprises the following steps:
S100) according to the dependence between function sub-modules each in application program, corresponding functional module red dot tree is constructed；
S200 it) is indicated, is updated corresponding on functional module red dot tree by the funcall that preset information input interface is inputted
The red dot of Module nodes counts；
S300) recurrence is updated from the corresponding Module nodes to modules on the path of the root node of functional module red dot tree
The red dot of node counts；
S400 functional module of) dishing out red dot tree update event, so that application program, which monitors interface by preset information, captures institute
State functional module red dot tree update event.
2. the method according to claim 1, wherein the step S100 further includes sub-step below:
S101) each function sub-modules of traversal applications program, to obtain the dependence between each function sub-modules；
S102 the corresponding Module nodes of each function sub-modules) are initialized；
S103) according to the dependence between each function sub-modules, Module nodes are built into corresponding functional module red dot
Tree.
3. method according to claim 1 or 2, which is characterized in that the funcall instruction includes at least function submodule
The unique identifier and red dot counter incrementing of block.
4. according to the method described in claim 3, it is characterized in that, the step S200 further includes sub-step below:
S201 it) by preset information input interface, obtains the funcall that application program is issued with regard to each function sub-modules and refers to
Show；
S202 the unique identifier and red dot counter incrementing for) obtaining the function sub-modules in funcall instruction, described in updating
The red dot of the upper respective modules node of functional module red dot tree counts.
5. according to the method described in claim 4, it is characterized in that, the step S300 further includes sub-step below:
S301 all Module nodes on the path of root node of the Module nodes to functional module red dot tree) are obtained；
S302) in addition to the corresponding Module nodes, all modules on the path are corrected using the red dot counter incrementing
The red dot of node counts.
6. method according to claim 1 or 5, which is characterized in that the step S400 further includes sub-step below:
S401 functional module of) dishing out red dot tree update event, wherein the functional module red dot tree update event is including at least red
Point counts unique identifier and and the modified red dot counting for the function sub-modules being updated；
S402 interface) is monitored by preset information and captures the functional module red dot tree update event, to obtain red dot counting
The unique identifier for the function sub-modules being updated and and modified red dot counting.
7. according to the method described in claim 6, it is characterized in that, information monitoring interface is mentioned in a manner of call back function
For.
8. a kind of red dot based on tree form data structure indicates system, which is characterized in that comprise the following modules:
Module is constructed, for constructing corresponding function mould according to the dependence between function sub-modules each in application program
Block red dot tree；
First update module, the funcall instruction for being inputted by preset information input interface, updates functional module
The red dot of the upper respective modules node of red dot tree counts；
Second update module is updated for recurrence from the corresponding Module nodes to the road of the root node of functional module red dot tree
The red dot of modules node counts on diameter；
Module of dishing out connects for functional module red dot tree update event of dishing out so that application program is monitored by preset information
Mouth captures the functional module red dot tree update event.
9. a kind of computer readable storage medium, is stored thereon with computer instruction, it is characterised in that the instruction is held by processor
The step of method as described in any one of claims 1 to 7 is realized when row.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910022772.8A CN109885358A (en) | 2019-01-10 | 2019-01-10 | A kind of red dot representation method and system based on tree form data structure |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910022772.8A CN109885358A (en) | 2019-01-10 | 2019-01-10 | A kind of red dot representation method and system based on tree form data structure |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109885358A true CN109885358A (en) | 2019-06-14 |
Family
ID=66925880
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910022772.8A Pending CN109885358A (en) | 2019-01-10 | 2019-01-10 | A kind of red dot representation method and system based on tree form data structure |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109885358A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110928710A (en) * | 2019-11-21 | 2020-03-27 | 网易（杭州）网络有限公司 | Information prompting method and device, electronic equipment and storage medium |
| CN111104144A (en) * | 2019-12-27 | 2020-05-05 | 珠海金山网络游戏科技有限公司 | Anchor point updating method and device |
| CN112190942A (en) * | 2020-10-23 | 2021-01-08 | 网易（杭州）网络有限公司 | Red dot system and data processing method based on red dot system |
| CN116832439A (en) * | 2023-05-17 | 2023-10-03 | 广州三七极梦网络技术有限公司 | Processing method, device, equipment and medium of game data refreshing system |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106502709A (en) * | 2016-11-15 | 2017-03-15 | 腾讯科技（深圳）有限公司 | Applied business reminding method and applied business suggestion device |
| CN107450903A (en) * | 2017-05-31 | 2017-12-08 | 阿里巴巴集团控股有限公司 | A kind of information processing method and device |
| CN107844308A (en) * | 2017-10-18 | 2018-03-27 | 阿里巴巴集团控股有限公司 | A kind of information processing method, device and equipment |
-
2019
- 2019-01-10 CN CN201910022772.8A patent/CN109885358A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106502709A (en) * | 2016-11-15 | 2017-03-15 | 腾讯科技（深圳）有限公司 | Applied business reminding method and applied business suggestion device |
| CN107450903A (en) * | 2017-05-31 | 2017-12-08 | 阿里巴巴集团控股有限公司 | A kind of information processing method and device |
| CN107844308A (en) * | 2017-10-18 | 2018-03-27 | 阿里巴巴集团控股有限公司 | A kind of information processing method, device and equipment |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110928710A (en) * | 2019-11-21 | 2020-03-27 | 网易（杭州）网络有限公司 | Information prompting method and device, electronic equipment and storage medium |
| CN110928710B (en) * | 2019-11-21 | 2022-05-31 | 网易（杭州）网络有限公司 | Information prompting method and device, electronic equipment and storage medium |
| CN111104144A (en) * | 2019-12-27 | 2020-05-05 | 珠海金山网络游戏科技有限公司 | Anchor point updating method and device |
| CN111104144B (en) * | 2019-12-27 | 2023-10-20 | 珠海金山数字网络科技有限公司 | Anchor point updating method and device |
| CN112190942A (en) * | 2020-10-23 | 2021-01-08 | 网易（杭州）网络有限公司 | Red dot system and data processing method based on red dot system |
| CN112190942B (en) * | 2020-10-23 | 2024-07-09 | 网易（杭州）网络有限公司 | Red dot system and data processing method based on red dot system |
| CN116832439A (en) * | 2023-05-17 | 2023-10-03 | 广州三七极梦网络技术有限公司 | Processing method, device, equipment and medium of game data refreshing system |
| CN116832439B (en) * | 2023-05-17 | 2024-06-07 | 广州三七极梦网络技术有限公司 | Processing method, device, equipment and medium of game data refreshing system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109885358A (en) | A kind of red dot representation method and system based on tree form data structure | |
| US10474974B2 (en) | Reciprocal models for resource allocation | |
| Wang et al. | Methods for correcting inference based on outcomes predicted by machine learning | |
| CN109859854A (en) | Prediction Method of Communicable Disease, device, electronic equipment and computer-readable medium | |
| CN107944000A (en) | Flight freight rate update method, device, electronic equipment, storage medium | |
| CN111079006B (en) | Message pushing method and device, electronic equipment and medium | |
| CN108062367A (en) | The method for uploading and its terminal of a kind of data list | |
| US11531754B2 (en) | Transpiration of fraud detection rules to native language source code | |
| US11163586B1 (en) | Automated configuration of application program instance | |
| WO2022048648A1 (en) | Method and apparatus for achieving automatic model construction, electronic device, and storage medium | |
| CN109274639A (en) | The recognition methods of open platform abnormal data access and device | |
| CN111930366A (en) | Rule engine implementation method and system based on JIT real-time compilation | |
| CN110309269A (en) | Response process method and its system, computer system and computer-readable medium | |
| CN112382406A (en) | Method, apparatus, medium, and device for estimating basic regeneration number of infectious disease | |
| CN110275903A (en) | Improve the method and system of the feature formation efficiency of machine learning sample | |
| CN109117442A (en) | A kind of application recommended method and device | |
| CN109978392A (en) | Agile Software Development management method, device, electronic equipment, storage medium | |
| CN110088748A (en) | Problem generation method and device, interrogation system, computer readable storage medium | |
| Shukla et al. | Blockiot-retel: Blockchain and iot based read-execute-transact-erase-loop environment for integrating personal health data | |
| CN110533406A (en) | A kind of payment call method, apparatus and system | |
| Laukkarinen et al. | An embedded cloud design for internet-of-things | |
| US11157880B2 (en) | Enforcement of services agreement and management of emotional state | |
| JP6081491B2 (en) | A functional model for assessing events | |
| ES2728921T3 (en) | Method, device and system to simultaneously transmit or receive multiple managed objects | |
| CN111930783A (en) | Monitoring method, monitoring system and computing 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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190614 |