CN108595678A - Task data processing method and processing device, electronic equipment, storage medium - Google Patents

Task data processing method and processing device, electronic equipment, storage medium Download PDF

Info

Publication number
CN108595678A
CN108595678A CN201810410083.XA CN201810410083A CN108595678A CN 108595678 A CN108595678 A CN 108595678A CN 201810410083 A CN201810410083 A CN 201810410083A CN 108595678 A CN108595678 A CN 108595678A
Authority
CN
China
Prior art keywords
node
task
data
mind map
processing method
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.)
Granted
Application number
CN201810410083.XA
Other languages
Chinese (zh)
Other versions
CN108595678B (en
Inventor
于栋
刘朝敏
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Netease Hangzhou Network Co Ltd
Original Assignee
Netease Hangzhou Network Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Netease Hangzhou Network Co Ltd filed Critical Netease Hangzhou Network Co Ltd
Priority to CN201810410083.XA priority Critical patent/CN108595678B/en
Publication of CN108595678A publication Critical patent/CN108595678A/en
Application granted granted Critical
Publication of CN108595678B publication Critical patent/CN108595678B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46Multiprogramming arrangements
    • G06F9/54Interprogram communication
    • G06F9/545Interprogram communication where tasks reside in different layers, e.g. user- and kernel-space

Landscapes

  • Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • User Interface Of Digital Computer (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The disclosure is directed to a kind of task data processing method and processing device, electronic equipment, storage mediums, are related to field of computer technology, and this method includes:Task data is obtained from task requests;Mind map corresponding with the task requests is established according to the task data;Each functional node of the mind map is associated with mission bit stream, to generate job order;The mission bit stream is shown by the job order.The disclosure can improve user's operation convenience and efficiency.

Description

Task data processing method and processing device, electronic equipment, storage medium
Technical field
This disclosure relates to field of computer technology, at a kind of task data processing method, task data Manage device, electronic equipment and computer readable storage medium.
Background technology
In enterprise-level management system application, bottom internal technology problem can directly determine the survival condition of entire product. But it due to there is no the features such as planning participates in, the period is longer, process monitoring is difficult, technology specialty degree is high, results in technology Portion's Improvement requirement is always the risk point of project management.For management of product personnel, need easily mode understand and follow up Product situation.
In the related technology, usually using the mode of Excel document come the product situation that follows up, by complicated Excel tables, To show the state of product various dimensions.In addition to this, enterprises may possess the system of a whole set of relative maturity, by appointing Single mode be engaged in come the overall condition for the product that follows up, such as redmine, github.It can specifically be identified not by task Same type, to establish job order by different dimensions to product.Later, system is by counting the quantity of different task list, shape The information such as state, performance provide the health status to product different dimensions.
But Excel document is usually managed by a people, can cause to conflict when multiple users edit, content is caused not united One the problem of, can not help user to understand the progress of product or mission bit stream in time;Passing through multiple tasks list When solving different task demand process, since job order is excessively scattered, it is therefore desirable to which user integrates multiple tasks list, operation Inconvenient and efficiency is low;It also brings inconvenience simultaneously to user's upgrading products state or Task Progress.
It should be noted that information is only used for reinforcing the reason to the background of the disclosure disclosed in above-mentioned background technology part Solution, therefore may include the information not constituted to the prior art known to persons of ordinary skill in the art.
Invention content
The disclosure is designed to provide a kind of task data processing method and processing device, electronic equipment, storage medium, in turn The user caused by the limitation and defect of the relevant technologies is overcome to check task process inconvenience at least to a certain extent Problem.
Other characteristics and advantages of the disclosure will be apparent from by the following detailed description, or partially by the disclosure Practice and acquistion.
According to one aspect of the disclosure, a kind of task data processing method is provided, including:It obtains and appoints from task requests Business data;Mind map corresponding with the task requests is established according to the task data;To each of the mind map Functional node is associated with mission bit stream, to generate job order;The mission bit stream is shown by the job order.
In a kind of exemplary embodiment of the disclosure, established according to the task data corresponding with the task requests Mind map includes:It is added for start node and presets node data, led with establishing the thinking according to the default node data Figure.
It is that node data is preset in the corresponding data addition of start node in a kind of exemplary embodiment of the disclosure, with Establishing the mind map according to the default node data includes:When receiving the first trigger event, according to the first addition Instruction is that the start node adds first node and first node data;When receiving the second trigger event, according to Two addition instructions are that the start node adds second node and second node data;By the first node data and/ Or the second node data establish the mind map.
In a kind of exemplary embodiment of the disclosure, to each functional node of the mind map and mission bit stream into Row is associated with, and includes to generate job order:The functional node and the mission bit stream are associated by task identification, with life At the job order.
In a kind of exemplary embodiment of the disclosure, the job order includes mind map job order.
In a kind of exemplary embodiment of the disclosure, the method further includes:Appoint by the way that contingency table unified management is described Business is single.
In a kind of exemplary embodiment of the disclosure, being managed collectively the job order by contingency table includes:According to institute It states task identification and judges whether task requests are effective task;If it is effective task, the task requests are corresponded to Task identification, functional node number and mind map mark be associated, to increase associated record.
In a kind of exemplary embodiment of the disclosure, the method further includes:Current function is acted on if received The node of node adjusts event, then executes corresponding adjustment operation and more new node index value to the current functional node.
In a kind of exemplary embodiment of the disclosure, the node adjustment event includes that node increase event or node are deleted Except event.
In a kind of exemplary embodiment of the disclosure, the method further includes:The mind map of real-time update is determined For temporary version data;The default edition data with the temporary version Data Matching is judged whether according to renewal time; If there is the default edition data, then the temporary version data and temporary version data after adjustment are true are adjusted It is set to official release data to be preserved.
According to one aspect of the disclosure, a kind of task data processing unit is provided, including:Data acquisition module is used for Task data is obtained from task requests;Mind map establishes module, for being established and the task according to the task data Ask corresponding mind map;Job order generation module, for each functional node and mission bit stream to the mind map It is associated, to generate job order;Information display module, for showing the mission bit stream by the job order.
According to one aspect of the disclosure, a kind of electronic equipment is provided, including:Processor;And memory, for storing The executable instruction of the processor;Wherein, the processor is configured to above-mentioned to execute via the executable instruction is executed Task data processing method described in any one.
According to one aspect of the disclosure, a kind of computer readable storage medium is provided, computer program is stored thereon with, The computer program realizes the task data processing method described in above-mentioned any one when being executed by processor.
A kind of task data processing method for being there is provided in disclosure exemplary embodiment, task data processing unit, electronics In equipment and computer readable storage medium, established by the task data obtained from task requests corresponding with task requests Mind map;And the functional node in mind map is associated with mission bit stream, to generate job order;And then by appointing The single displaying mission bit stream of business.On the one hand, mission bit stream is shown by job order form, user can be made intuitively, in time, in detail Understand mission bit stream;On the one hand, it since the job order in mind map is an overall structure, avoids user and understands task letter To the integrated operation of scattered job order when breath, improves and check convenience and operating efficiency;On the other hand, user can be made to pass through Job order in mind map timely and conveniently more new task information.
It should be understood that above general description and following detailed description is only exemplary and explanatory, not The disclosure can be limited.
Description of the drawings
The drawings herein are incorporated into the specification and forms part of this specification, and shows the implementation for meeting the disclosure Example, and together with specification for explaining the principles of this disclosure.It should be evident that the accompanying drawings in the following description is only the disclosure Some embodiments for those of ordinary skill in the art without creative efforts, can also basis These attached drawings obtain other attached drawings.
Fig. 1 schematically shows a kind of task data processing method schematic diagram in disclosure exemplary embodiment;
Fig. 2 schematically shows the schematic diagram being associated to all the elements in disclosure exemplary embodiment;
Fig. 3 schematically shows the nodal information that each functional node includes in disclosure exemplary embodiment;
Fig. 4 schematically shows the particular flow sheet for managing associated data in disclosure exemplary embodiment by contingency table;
Fig. 5 diagrammatically illustrates the flow chart of increase or deletion of node;
Fig. 6 diagrammatically illustrates the settlement mechanism schematic diagram of temporary version and other version conflicts;
Fig. 7 schematically shows the page schematic diagram that mind map is established in disclosure exemplary embodiment;
Fig. 8 schematically shows the page schematic diagram that task disposition is shown in disclosure exemplary embodiment;
Fig. 9 schematically shows a kind of block diagram of task data processing unit in disclosure exemplary embodiment;
Figure 10 schematically shows the block diagram of a kind of electronic equipment in disclosure exemplary embodiment;
Figure 11 schematically shows a kind of program product in disclosure exemplary embodiment.
Specific implementation mode
Example embodiment is described more fully with reference to the drawings.However, example embodiment can be with a variety of shapes Formula is implemented, and is not understood as limited to example set forth herein;On the contrary, thesing embodiments are provided so that the disclosure will more Fully and completely, and by the design of example embodiment comprehensively it is communicated to those skilled in the art.Described feature, knot Structure or characteristic can be in any suitable manner incorporated in one or more embodiments.In the following description, it provides perhaps More details fully understand embodiment of the present disclosure to provide.It will be appreciated, however, by one skilled in the art that can It is omitted with technical solution of the disclosure one or more in the specific detail, or others side may be used Method, constituent element, device, step etc..In other cases, be not shown in detail or describe known solution to avoid a presumptuous guest usurps the role of the host and So that all aspects of this disclosure thicken.
In addition, attached drawing is only the schematic illustrations of the disclosure, it is not necessarily drawn to scale.Identical attached drawing mark in figure Note indicates same or similar part, thus will omit repetition thereof.Some block diagrams shown in attached drawing are work( Energy entity, not necessarily must be corresponding with physically or logically independent entity.Software form may be used to realize these work( Energy entity, or these functional entitys are realized in one or more hardware modules or integrated circuit, or at heterogeneous networks and/or place These functional entitys are realized in reason device device and/or microcontroller device.
A kind of task data processing method is provided firstly in this example embodiment, can be applied to enterprise or project Task Progress is checked between group or is to look at the operations such as product progress.Refering to what is shown in Fig. 1, the task data processing method can be with Include the following steps:
In step s 110, task data is obtained from task requests;
In the step s 120, mind map corresponding with the task requests is established according to the task data;
In step s 130, each functional node in the mind map is associated with mission bit stream, to generate Job order;
In step S140, the mission bit stream is shown by the job order.
In the task data processing method provided in the present example embodiment, on the one hand, shown by job order form Mission bit stream, can make user it is intuitive, in time, understand mission bit stream in detail;On the one hand, due to the job order in mind map Be an overall structure, avoid when user understands mission bit stream to the integrated operation of scattered job order, improve check it is convenient Property and operating efficiency;On the other hand, user can be made to pass through the timely and conveniently more new task information of the job order in mind map.
Next, the task data processing method in the present exemplary embodiment is further expalined in conjunction with Fig. 2 to Fig. 8 Explanation.
In step s 110, task data is obtained from task requests.
In the present exemplary embodiment, task requests can be assignment instructions either functional requirement etc., and task data can Think that corresponding data model of task requests etc., wherein task requests can pass through wireless network, LAN by task publisher Either other transmission modes are submitted.System can obtain corresponding task data from the task requests of publication, with to task Data are handled.Data model can be specifically pulled out from task requests, and then determines task data.For example, appoint Business request can be the progress of follow-up task A, and task data can be the corresponding data model of each different function module, Such as 1 corresponding data model 1 of function module, 2 corresponding data model 2 of function module.
In the step s 120, mind map corresponding with the task requests is established according to the task data.
, can be by functional node mapping function demand in this exemplary real example, and then pull out task data and basis Task data establishes mind map.Mind map is the figure of multiple nodes, by tree structure come the relationship of organization node, Node therein can be functional node.Meanwhile user can carry out each functional node a variety of operations, such as increase node face Color, addition progress ratio etc..When building mind map, system can be by the functional requirement either corresponding number of tasks of task requests According to being mapped on each functional node, to make each subfunction node that can correspond to a subfunction.
In the present exemplary embodiment, the characteristic of each functional node is indicated for clarity, can will be owned in mind map Display elements are abstracted as layout L ayout, tree structure Map and node Item.Wherein, tree construction can there are many shapes set State, layout are then that the other information such as tree and line are stored and shown;One layout can correspond to a tree structure, one Tree structure can include multiple nodes.
Accordingly, all operations of user can also be abstracted as to event Event, order Command and action Action three classes.Wherein, event is touched for realizing Trigger Function, such as by bug key or by events such as mouse clicks Hair;After the trigger, can call instruction, order is used as a kind of external interface, will can record the action of its calling automatically to going through In history list;Final order can call action.Wherein, an event can correspond to multiple orders, and an order can include more A action.For example, user's operation needs forward/backward function, order can be adjusted automatically as a kind of external interface In action record to history list.Next, when user uses forward/backward, forward/backward order can be called, And then call action realizes the function.In this way, user can freely appoint with what is be easily responsible for itself very much Business information is split and is adjusted at any time, while can be checked again to the mission bit stream of all users by mind map.
Since mind map is integrally to carry out node organization with the structure of tree, so user is creating a mind map When, the start node of an acquiescence can be obtained.Based on this, the detailed process that mind map is established according to task data includes:For Node data is preset in the corresponding data addition of start node, to establish the mind map according to the default node data.
Default node refers to the downstream site or the brother of node of start node, and node and default node are preset in addition After data, mind map can be accurately established according to start node data and default node data.Specifically, connecing It is that the start node adds the first node and first node according to the first addition instruction when receiving the first trigger event Data;When receiving the second trigger event, according to the second addition instruction be the start node add the second node with And second node data;The mind map is established by the first node data and/or the second node data.
User can obtain the start node of an acquiescence, such as node a when creating mind map.When system detectio arrives When the focus of the mouse of user either finger is located at start node, the first trigger event or the second trigger event can be passed through It is added for start node and presets node.
Wherein, the first trigger event can be user act on physical keyboard either dummy keyboard the first button by Lower operation or clicking operation etc..First button can be set as any one button on keyboard according to actual demand, such as Tab key.First, which adds instruction, to be instructed for child node addition, and corresponding first node can be the child node of start node. For example, when user's mouse focus is in start node, user presses event by the Tab of keyboard, sends out and adds to server Add child node order.Wherein, the action that will include addition child node inside child node order is added, and then this action can be passed through Increase a sub- node data in data for start node, while page structure can be rendered, obtains the child node of start node a Association line between aa and start node and child node, to see two nodes on interface.At the same time, Focus Club It is automatically positioned in child node, to facilitate user to input the title etc. of child node.
Similarly, the second trigger event can be that user acts on physical keyboard either the second button of dummy keyboard Push or clicking operation etc..Second button can be set as different from the first button on keyboard according to actual demand and appoint One button of meaning, such as "enter" key".Second addition instruction can be brotgher of node addition instruction, and second node is corresponding can be with For the brotgher of node of start node.For example, when user's mouse focus is in start node, Enter that user passes through keyboard Event is pressed, addition brotgher of node order is sent out to server.Wherein, it adds and will include addition brother inside brotgher of node order The action of node, and then can be that start node increases a brotgher of node data, while meeting wash with watercolours in data by this action Page structure is contaminated, the pass between the brotgher of node b or brotgher of node c and start node and the brotgher of node of start node a is obtained On line, to see two nodes on interface.At the same time, in Focus Club's automatic positioning to the brotgher of node, to facilitate user defeated Enter the title etc. of the brotgher of node.It should be noted that when by the second addition instruction addition second node, it is necessary first to sentence Disconnected start node does not execute any action with the presence or absence of father's node if not having father's node;If there is Father's Day Point then executes the action of addition new node on father's node.
In the present exemplary embodiment, user can be by Tab buttons and Enter buttons, automatically will be burnt by writing program Point location to newly added child node or father's node, so as to quickly and accurately build with task requests, function module or Person is the corresponding entire mind map of product progress.
Next, in step s 130, each functional node in the mind map is associated with mission bit stream, To generate job order.
Mission bit stream herein refers to all task definitions for including in task requests, with reference to shown in figure 2, task letter Breath for example may include the technology of former supplying system corresponding with task requests share, interface protocol description, development plan and The all the elements such as the specific division of labor, attachment.It, can be by task identification to each functional node and task in order to realize unified management Information is associated, to generate job order.Task identification can be used for uniquely indicating a task requests, can lead in this example Click function node is crossed, then functional node mission bit stream corresponding with task identification is associated with by the mode of incoming task mark Come, the mind map job order for indicating mission bit stream is formed, so that user can quickly be looked into according to job order by functional node Ask corresponding mission bit stream.
After generating job order, job order can be managed collectively by contingency table.Refering to what is shown in Fig. 3, passing through association When table is managed collectively job order, the description information of the functional node can be increased in each functional node, can also be associated with more Type data, such as attachment, job order etc..May include node_id, doc_id, ref_id and ref_ in contingency table Type etc., wherein ref_type can be attachment, task, description etc..Pass through contingency table technology unification management role list, energy Enough avoid in already existing big table attachment and task increase foreign key field, with realize be compatible with forward.
Specifically, being managed collectively the job order by contingency table and including:Judge that task requests are according to task identification No is effective task;If it is effective task, to the corresponding task identification of the task requests, functional node number with And mind map mark is associated, to increase associated record.
Refering to what is shown in Fig. 4, user clicks a certain functional node and incoming task identifies ABC-1, it is true by searching for database Whether the task identification inputted surely is numerical value or by judging whether to find task requests corresponding with task identification ABC-1, To judge whether the corresponding task requests of the functional node are effective task.If not effective task, then invalid information is returned; If it is effective task, then task identification ABC-1 corresponding to the task requests, functional node number such as b and thinking are led Map logo 1 is associated, to form an associated record and increase in mind map.It at the same time, can be by the pass of generation Connection record and the detailed mission bit stream of the task requests are back to front end browser.By contingency table to functional node and task Information is associated, can make participation develop user in mind map real-time update oneself institute responsible module totality into Degree marks each functional node clear corresponding progress situation and is supplemented in functional node description specific complete At content.Furthermore it is possible to be quickly found out relevant job order, update the completion status of job order, be pushed further into task into Journey.
In addition to this, if the node adjustment event for acting on current functional node is received, to the current function Node executes corresponding adjustment operation and more new node index value.Current functional node can be the function where the mouse of user Node, node adjustment event may include increasing Node Events or deletion of node event.For example, if receiving user's point The increase Node Events of current functional node a are hit, then program can execute AddNode orders, while AddNode orders can actually be held AddNode actions inside row, then store this action into history object, and the history index value of node is adjusted to most New index value.Index value can be used to indicate that the position of functional node, pass through the index value quick obtaining mission bit stream.For example, When increasing functional node b for current functional node a, the corresponding history index values of functional node a 11 can be updated to function section The corresponding index values of point b 12.If the AddNode actions in history object are not emptied, user can also click advance thing Part re-executes AddNode and acts and shift index, obtains the result for increasing node.
Similarly, when the user clicks node rollback event either knot removal event when, Revert orders can be triggered.Journey Sequence can read the action of current index value from history object, and subtract 1 by current index value, then execute DelNode actions.Example Such as, when deleting functional node b, index value can be updated to be located at the corresponding indexes of functional node a before functional node b Value, and then deletion action is carried out to functional node b.
For process edition data, program in front end browser has carried out interim storage.When user find mistake or When other problems, it can be switched quickly through shortcut key by carrying out the operations such as node increase, knot removal in mind map These historical records improve operating efficiency.
In order to ensure the accuracy of information storage, the collision problem between different editions is avoided, it can be by real-time update Mind map is determined as temporary version data;It is judged whether according to renewal time pre- with the temporary version Data Matching If edition data;If there is the default edition data, then adjusts the temporary version data and will face described in after adjustment When edition data be determined as official release data and preserved.
Wherein, temporary version data are the edition datas that system is automatically saved for the non-preservation generic operation of user.It is default Edition data refers to the edition data of other users editor.When user is again introduced into mind map, system can judge database In whether there is the user temporary version when, if there is temporary version, then give tacit consent to carry out this temporary version, to ensure user The mission bit stream and task data of acquisition are personal newest data.
Each update of user operates, and mind map can all automatically save the temporary version for individual subscriber, and user can only Into edlin in the temporary version of oneself.When temporary version is saved as official release by user, program is needed according to update Time judges existing all versions, to judge whether the default version of other people editors.Volume can specifically be passed through It programs, the chronological order generated according to each version, it is determined whether there is the default version with temporary version Data Matching Notebook data.When the default version edited there are other people, then the default edition data is returned.
Refering to what is shown in Fig. 6, when user carries out various non-preservation operations in a browser, browser program can be user automatically The result of operation generates a temporary version V3.When user continues non-preservation operation, system can constantly update this temporary version V3. When preserving when the user clicks, server-side can detect whether that there are the versions of other users editor.If server-side is found interim After version V3 is generated, other users save an official release V4, then it is assumed that there is version conflicts at this time, therefore can be with The information of each conflict version is returned into front end, so that user is according to the content for adjusting temporary version V3 the case where each conflict version. It is preserved it is possible to further which the temporary version V3 after adjustment is determined as official release V5, while can be by temporary version V3 It is identified as and abandons version, to ensure that each user can only correspond to a temporary version.Next, if user continues to edit, meeting On the basis of version V5, temporary version V6 is generated, and so on.
In this example, the contention mechanism of version is controlled according to timeline, can solve different user preservation version it Between collision problem, improve the accuracy that data preserve, while being also convenient for user and accurately obtaining data.
In step S140, the mission bit stream is shown by the job order.
After establishing job order, all mission bit streams can be integrally shown by mind map job order, are not needed Scattered job order is integrated.It is shown with job order by focusing on all the elements in one mind map, energy Enough so that information high concentration, goes in the system of other dispersions to obtain information without user, facilitate user to obtain information, simultaneously again It is also convenient for user to be managed mission bit stream, improves simple operation and efficiency.
Fig. 4 shows the flow chart that associated data is managed by contingency table, specifically includes:
In step S411, detect whether to receive the operation that user clicks node;
In step S412, response user clicks the operation of node, opens information bar corresponding with the node;
In step S421, task ID input by user is obtained;
In step S422, detect whether task ID input by user is numerical value;
Next, in step S431, search database judges whether the task ID of input is effective task ID;Judge rule It can then be arranged in advance;Detailed process goes to step S432;
In step S432, specifically include:
S4321 searches for database according to task ID and is judged;
S4322 judges whether to find task corresponding with task ID;If so, going to S4324;If do not found, go to S4323;
S4323 returns to association unavailable emphasis;
Task ID and present node number, mind map ID are associated, to increase associated record by S4324;
S4325 obtains the mission bit stream needed and return according to associated record;
S4326 receives the mission bit stream returned or unavailable emphasis information by associated interface;
In step S433, mission bit stream or unavailable emphasis information are back to browser end;
In step S441, the mission bit stream of browser display return.
Step in Fig. 4 can make user according to task ID quick obtaining to the mission bit stream needed, improve operation effect Rate.
Fig. 5 shows the flow chart of increase or deletion of node, specifically includes:
In step S501, node is in original state;
In step S502, user, which clicks, increases Node Events;
In step S503, executes the triggering increased in node orders and increase node action;And go to S504 or S5051;
In step S504, rollback event is clicked, and go to S5062;
In step S505, history object is handled;It specifically includes:
S5051, storage increase node and are newest by index upgrade;
S5052 returns to newest index and index is moved back one;
In step S506, deletion of node order is executed;It specifically includes:
S5051, triggering deletion of node action;
S5052 reads newest index.
By the step in Fig. 5, user can be facilitated to carry out mind map modification and editor.
Fig. 6 shows the solution flow of temporary version and other version conflicts, specifically includes:
In step S610, detect whether to receive the non-preservation generic operation such as increase node of user;
In step s 611, if being non-preservation generic operation, system automatically saves;
In step S612, by automatically saving generation temporary version, such as version V3;
In step S620, the preservation operation for receiving user is detected whether;
In step S621, when clicking preservation operation, request checks version conflict;
In step S622, by searching for other people versions and renewal time, version conflict is judged whether, it is specific to wrap It includes:If the corresponding temporary version of increase nodal operation of user 1 at this time is V3, detection finds the version for having other users to preserve V4 can then generate latest edition V5;
In step S631, if there is conflict, then temporary version V3 and other people version V4 are returned to,;
In step S630, prompted in front end version of display conflict;
In step S640, the content of adjustment V3 is prompted according to front end version conflict, and is preserved;
In step S641, confirms and preserve version;
In step S642, the temporary version V3 after adjustment is saved as into latest edition V5, and latest edition V5 is determined To preserve version, while temporary version V3 being identified as and is abandoned;
In step S651, the version information of updated preservation version V5 is back to browser end and is shown.
By the step in Fig. 6, the collision problem between different user different editions can be quickly solved, preservation is improved The accuracy of data.
Based on above step, user in integrated planning, refering to what is shown in Fig. 7, can utilize establish mind map and Job order therein quickly understands the completeness of some function module or task requests.Shown in Fig. 8, work as needs When understanding the specifying information of functional node, by clicking the functional node, system can pop up right side information bar, so that user is quick Browse associated task and details.It can be by way of click function node and incoming task mark, quickly by function section Point is associated with mission bit stream.Thus, functional node can also show in time present node and task be associated with quantity and The performance of task, such as show job order quantity performed in a manner of 0/2.By combining mind map and therein Job order, can largely simplify a large amount of task list formula checks mode, and user is allowed to quickly understand task processing Situation or product progress.
The disclosure additionally provides a kind of task data processing unit.Refering to what is shown in Fig. 9, the task data processing unit 900 May include:
Data acquisition module 901 can be used for obtaining task data from task requests;
Mind map establishes module 902, can be used for being established according to the task data corresponding with the task requests Mind map;
Job order generation module 903 can be used for carrying out each functional node of the mind map with mission bit stream Association, to generate job order;
Information display module 904 can be used for showing the mission bit stream by the job order.
It should be noted that the detail of each module is in corresponding number of tasks in above-mentioned task data processing unit According to being described in detail in processing method, therefore details are not described herein again.
It should be noted that although being referred to several modules or list for acting the equipment executed in above-detailed Member, but this division is not enforceable.In fact, according to embodiment of the present disclosure, it is above-described two or more The feature and function of module either unit can embody in a module or unit.Conversely, an above-described mould Either the feature and function of unit can be further divided into and embodied by multiple modules or unit block.
In addition, although describing each step of method in the disclosure with particular order in the accompanying drawings, this does not really want These steps must be executed according to the particular order by asking or implying, or the step having to carry out shown in whole could be realized Desired result.Additional or alternative, it is convenient to omit multiple steps are merged into a step and executed by certain steps, and/ Or a step is decomposed into execution of multiple steps etc..
Through the above description of the embodiments, those skilled in the art is it can be readily appreciated that example described herein is implemented Mode can also be realized by software realization in such a way that software is in conjunction with necessary hardware.Therefore, according to the disclosure The technical solution of embodiment can be expressed in the form of software products, the software product can be stored in one it is non-volatile Property storage medium (can be CD-ROM, USB flash disk, mobile hard disk etc.) in or network on, including some instructions are so that a calculating Equipment (can be personal computer, server, mobile terminal or network equipment etc.) is executed according to disclosure embodiment Method.
In an exemplary embodiment of the disclosure, a kind of electronic equipment that can realize the above method is additionally provided.
Person of ordinary skill in the field it is understood that various aspects of the invention can be implemented as system, method or Program product.Therefore, various aspects of the invention can be embodied in the following forms, i.e.,:It is complete hardware embodiment, complete The embodiment combined in terms of full Software Implementation (including firmware, microcode etc.) or hardware and software, can unite here Referred to as circuit, " module " or " system ".
The electronic equipment 1000 of this embodiment according to the present invention is described referring to Figure 10.The electricity that Figure 10 is shown Sub- equipment 1000 is only an example, should not bring any restrictions to the function and use scope of the embodiment of the present invention.
As shown in Figure 10, electronic equipment 1000 is showed in the form of universal computing device.The component of electronic equipment 1000 can To include but not limited to:Above-mentioned at least one processing unit 1010, above-mentioned at least one storage unit 1020, connection different system The bus 1030 of component (including storage unit 1020 and processing unit 1010).
Wherein, the storage unit has program stored therein code, and said program code can be held by the processing unit 1010 Row so that the processing unit 1010 executes various according to the present invention described in above-mentioned " illustrative methods " part of this specification The step of illustrative embodiments.For example, the processing unit 1010 can execute step as shown in fig. 1:In step In S110, task data is obtained from task requests;In the step s 120, it is established according to the task data and is asked with the task Seek corresponding mind map;In step s 130, each functional node in the mind map is closed with mission bit stream Connection, to generate job order;In step S140, the mission bit stream is shown by the job order.
Storage unit 1020 may include the readable medium of volatile memory cell form, such as Random Access Storage Unit (RAM) 10201 and/or cache memory unit 10202, it can further include read-only memory unit (ROM) 10203.
Storage unit 1020 can also include program/utility with one group of (at least one) program module 10205 10204, such program module 10205 includes but not limited to:Operating system, one or more application program, other programs Module and program data may include the realization of network environment in each or certain combination in these examples.
Bus 1030 can be to indicate one or more in a few class bus structures, including storage unit bus or storage Cell controller, peripheral bus, graphics acceleration port, processing unit use the arbitrary bus structures in a variety of bus structures Local bus.
Electronic equipment 1000 can also be with one or more external equipments 1200 (such as keyboard, sensing equipment, bluetooth equipment Deng) communication, can also be enabled a user to one or more equipment interact with the electronic equipment 1000 communicate, and/or with make The electronic equipment 1000 can be communicated with one or more of the other computing device any equipment (such as router, modulation Demodulator etc.) communication.This communication can be carried out by input/output (I/O) interface 1050.Also, electronic equipment 1000 Network adapter 1060 and one or more network (such as LAN (LAN), wide area network (WAN) and/or public affairs can also be passed through Common network network, such as internet) communication.As shown, network adapter 1060 passes through its of bus 1030 and electronic equipment 1000 Its module communicates.It should be understood that although not shown in the drawings, other hardware and/or software can be used in conjunction with electronic equipment 1000 Module, including but not limited to:Microcode, device driver, redundant processing unit, external disk drive array, RAID system, magnetic Tape drive and data backup storage system etc..
In an exemplary embodiment of the disclosure, a kind of computer readable storage medium is additionally provided, energy is stored thereon with Enough realize the program product of this specification above method.In some possible embodiments, various aspects of the invention may be used also In the form of being embodied as a kind of program product comprising program code, when described program product is run on the terminal device, institute State program code for make the terminal device execute described in above-mentioned " illustrative methods " part of this specification according to this hair The step of bright various illustrative embodiments.
With reference to shown in figure 11, the program product for realizing the above method according to the embodiment of the present invention is described 1100, portable compact disc read only memory (CD-ROM) may be used and include program code, and can in terminal device, Such as it is run on PC.However, the program product of the present invention is without being limited thereto, in this document, readable storage medium storing program for executing can be with To be any include or the tangible medium of storage program, the program can be commanded execution system, device either device use or It is in connection.
The arbitrary combination of one or more readable mediums may be used in described program product.Readable medium can be readable letter Number medium or readable storage medium storing program for executing.Readable storage medium storing program for executing for example can be but be not limited to electricity, magnetic, optical, electromagnetic, infrared ray or System, device or the device of semiconductor, or the arbitrary above combination.The more specific example of readable storage medium storing program for executing is (non exhaustive List) include:It is electrical connection, portable disc, hard disk, random access memory (RAM) with one or more conducting wires, read-only Memory (ROM), erasable programmable read only memory (EPROM or flash memory), optical fiber, portable compact disc read only memory (CD-ROM), light storage device, magnetic memory device or above-mentioned any appropriate combination.
Computer-readable signal media may include in a base band or as the data-signal that a carrier wave part is propagated, In carry readable program code.The data-signal of this propagation may be used diversified forms, including but not limited to electromagnetic signal, Optical signal or above-mentioned any appropriate combination.Readable signal medium can also be any readable Jie other than readable storage medium storing program for executing Matter, which can send, propagate either transmission for used by instruction execution system, device or device or and its The program of combined use.
The program code for including on readable medium can transmit with any suitable medium, including but not limited to wirelessly, have Line, optical cable, RF etc. or above-mentioned any appropriate combination.
It can be write with any combination of one or more programming languages for executing the program that operates of the present invention Code, described program design language include object oriented program language-Java, C++ etc., further include conventional Procedural programming language-such as " C " language or similar programming language.Program code can be fully in user It executes on computing device, partly execute on a user device, being executed as an independent software package, partly in user's calculating Upper side point is executed or is executed in remote computing device or server completely on a remote computing.It is being related to far In the situation of journey computing device, remote computing device can pass through the network of any kind, including LAN (LAN) or wide area network (WAN), it is connected to user calculating equipment, or, it may be connected to external computing device (such as utilize ISP To be connected by internet).
In addition, above-mentioned attached drawing is only the schematic theory of the processing included by method according to an exemplary embodiment of the present invention It is bright, rather than limit purpose.It can be readily appreciated that the time that above-mentioned processing shown in the drawings did not indicated or limited these processing is suitable Sequence.In addition, being also easy to understand, these processing for example can be executed either synchronously or asynchronously in multiple modules.
Those skilled in the art after considering the specification and implementing the invention disclosed here, will readily occur to its of the disclosure His embodiment.This application is intended to cover any variations, uses, or adaptations of the disclosure, these modifications, purposes or Adaptive change follow the general principles of this disclosure and include the undocumented common knowledge in the art of the disclosure or Conventional techniques.The description and examples are only to be considered as illustrative, and the true scope and spirit of the disclosure are by claim It points out.

Claims (13)

1. a kind of task data processing method, which is characterized in that including:
Task data is obtained from task requests;
Mind map corresponding with the task requests is established according to the task data;
Each functional node of the mind map is associated with mission bit stream, to generate job order;
The mission bit stream is shown by the job order.
2. task data processing method according to claim 1, which is characterized in that according to task data foundation and institute Stating the corresponding mind map of task requests includes:
It is added for start node and presets node data, to establish the mind map according to the default node data.
3. task data processing method according to claim 2, which is characterized in that for the corresponding data addition of start node Node data is preset, includes to establish the mind map according to the default node data:
It is that the start node adds first node and first according to the first addition instruction when receiving the first trigger event Node data;
It is that the start node adds second node and second according to the second addition instruction when receiving the second trigger event Node data;
The mind map is established by the first node data and/or the second node data.
4. task data processing method according to claim 1, which is characterized in that each function of the mind map Node is associated with mission bit stream, includes to generate job order:
The functional node and the mission bit stream are associated by task identification, to generate the job order.
5. task data processing method according to claim 4, which is characterized in that the job order includes that mind map is appointed Business is single.
6. task data processing method according to claim 4, which is characterized in that the method further includes:
It is managed collectively the job order by contingency table.
7. task data processing method according to claim 6, which is characterized in that appoint by the way that contingency table unified management is described Business include singly:
Judge whether task requests are effective task according to the task identification;
If it is effective task, the corresponding task identification of the task requests, functional node number and thinking are led Map logo is associated, to increase associated record.
8. task data processing method according to claim 1, which is characterized in that the method further includes:
If receiving the node adjustment event for acting on current functional node, the current functional node is executed corresponding Adjustment operation and more new node index value.
9. task data processing method according to claim 8, which is characterized in that the node adjustment event includes node Increase event or knot removal event.
10. task data processing method according to claim 1, which is characterized in that the method further includes:
The mind map of real-time update is determined as temporary version data;
The default edition data with the temporary version Data Matching is judged whether according to renewal time;
If there is the default edition data, then the temporary version data are adjusted and by the temporary version number after adjustment It is preserved according to official release data are determined as.
11. a kind of task data processing unit, which is characterized in that including:
Data acquisition module, for obtaining task data from task requests;
Mind map establishes module, for establishing mind map corresponding with the task requests according to the task data;
Job order generation module is associated for each functional node to the mind map with mission bit stream, to generate Job order;
Information display module, for showing the mission bit stream by the job order.
12. a kind of electronic equipment, which is characterized in that including:
Processor;And
Memory, the executable instruction for storing the processor;
Wherein, the processor is configured to come described in perform claim requirement 1-10 any one via the execution executable instruction Task data processing method.
13. a kind of computer readable storage medium, is stored thereon with computer program, which is characterized in that the computer program The task data processing method described in claim 1-10 any one is realized when being executed by processor.
CN201810410083.XA 2018-05-02 2018-05-02 Task data processing method and device, electronic equipment and storage medium Active CN108595678B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810410083.XA CN108595678B (en) 2018-05-02 2018-05-02 Task data processing method and device, electronic equipment and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810410083.XA CN108595678B (en) 2018-05-02 2018-05-02 Task data processing method and device, electronic equipment and storage medium

Publications (2)

Publication Number Publication Date
CN108595678A true CN108595678A (en) 2018-09-28
CN108595678B CN108595678B (en) 2022-05-31

Family

ID=63620442

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810410083.XA Active CN108595678B (en) 2018-05-02 2018-05-02 Task data processing method and device, electronic equipment and storage medium

Country Status (1)

Country Link
CN (1) CN108595678B (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109815342A (en) * 2019-01-28 2019-05-28 南京创世德意信息技术有限公司 A kind of plan automatic generation method and intelligent terminal
CN110930056A (en) * 2019-12-06 2020-03-27 厦门市美亚柏科信息股份有限公司 Thinking-guidance-graph-based task management method, terminal device and storage medium

Citations (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101231644A (en) * 2007-01-25 2008-07-30 富士施乐株式会社 Information processing device, information processing system and method
CN101604421A (en) * 2009-03-19 2009-12-16 深圳市青铜器软件系统有限公司 A kind of based on network project plan management system and method
US20120047045A1 (en) * 2010-08-20 2012-02-23 Gade Gopikrishna Product configuration server for efficiently displaying selectable attribute values for configurable products
CN102467532A (en) * 2010-11-12 2012-05-23 中国移动通信集团山东有限公司 Task processing method and task processing device
WO2012150602A1 (en) * 2011-05-03 2012-11-08 Yogesh Chunilal Rathod A system and method for dynamically monitoring, recording, processing, attaching dynamic, contextual & accessible active links & presenting of physical or digital activities, actions, locations, logs, life stream, behavior & status
CN103679333A (en) * 2013-09-27 2014-03-26 上海飞机制造有限公司 Workflow-based quick response system and application thereof
US20150227533A1 (en) * 2014-02-11 2015-08-13 Wix.Com Ltd. System for synchronization of changes in edited websites and interactive applications
CN105183915A (en) * 2015-10-14 2015-12-23 江苏师范大学 Multi-version management method for reducing index maintenance overhead
CN105574303A (en) * 2016-03-04 2016-05-11 昆山远飞软件信息科技有限公司 Enterprise informatization operation system
CN106250389A (en) * 2016-07-15 2016-12-21 西安测绘研究所 A kind of geographical spatial data method for edition management updated towards dynamic increment
CN106779413A (en) * 2016-12-16 2017-05-31 广州支点网络科技股份有限公司 Information processing method and equipment in a kind of flow of task
CN107122188A (en) * 2017-04-26 2017-09-01 网易(杭州)网络有限公司 The method and device of project process bar image generation
CN107291545A (en) * 2017-08-07 2017-10-24 星环信息科技(上海)有限公司 The method for scheduling task and equipment of multi-user in computing cluster
CN107526766A (en) * 2016-06-15 2017-12-29 菲尼克斯电气公司 Data organization method and development environment system

Patent Citations (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101231644A (en) * 2007-01-25 2008-07-30 富士施乐株式会社 Information processing device, information processing system and method
CN101604421A (en) * 2009-03-19 2009-12-16 深圳市青铜器软件系统有限公司 A kind of based on network project plan management system and method
US20120047045A1 (en) * 2010-08-20 2012-02-23 Gade Gopikrishna Product configuration server for efficiently displaying selectable attribute values for configurable products
CN102467532A (en) * 2010-11-12 2012-05-23 中国移动通信集团山东有限公司 Task processing method and task processing device
WO2012150602A1 (en) * 2011-05-03 2012-11-08 Yogesh Chunilal Rathod A system and method for dynamically monitoring, recording, processing, attaching dynamic, contextual & accessible active links & presenting of physical or digital activities, actions, locations, logs, life stream, behavior & status
CN103679333A (en) * 2013-09-27 2014-03-26 上海飞机制造有限公司 Workflow-based quick response system and application thereof
US20150227533A1 (en) * 2014-02-11 2015-08-13 Wix.Com Ltd. System for synchronization of changes in edited websites and interactive applications
CN105183915A (en) * 2015-10-14 2015-12-23 江苏师范大学 Multi-version management method for reducing index maintenance overhead
CN105574303A (en) * 2016-03-04 2016-05-11 昆山远飞软件信息科技有限公司 Enterprise informatization operation system
CN107526766A (en) * 2016-06-15 2017-12-29 菲尼克斯电气公司 Data organization method and development environment system
CN106250389A (en) * 2016-07-15 2016-12-21 西安测绘研究所 A kind of geographical spatial data method for edition management updated towards dynamic increment
CN106779413A (en) * 2016-12-16 2017-05-31 广州支点网络科技股份有限公司 Information processing method and equipment in a kind of flow of task
CN107122188A (en) * 2017-04-26 2017-09-01 网易(杭州)网络有限公司 The method and device of project process bar image generation
CN107291545A (en) * 2017-08-07 2017-10-24 星环信息科技(上海)有限公司 The method for scheduling task and equipment of multi-user in computing cluster

Non-Patent Citations (5)

* Cited by examiner, † Cited by third party
Title
FREDERIC SALA 等: "Synchronizing Files From a Large Number of Insertions and Deletions", 《IEEE TRANSACTIONS ON COMMUNICATIONS 》 *
LIPING GAO 等: "Consistency Maintenance of Group/Ungroup Operations in Object-based Collaborative Graphical Editing Systems", 《INTERNATIONAL JOURNAL OF SIGNAL PROCESSING, IMAGE PROCESSING AND PATTERN RECOGNITION 8 (2015)》 *
徐立 等: "多人协作备课页面编辑锁设计", 《电脑编程技巧与维护》 *
柴元德 等: "基于思维导图的科技项目精细化管理研究", 《青海电力》 *
谭政: "一种协同编辑中版本控制与管理解决方案", 《软件》 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109815342A (en) * 2019-01-28 2019-05-28 南京创世德意信息技术有限公司 A kind of plan automatic generation method and intelligent terminal
CN110930056A (en) * 2019-12-06 2020-03-27 厦门市美亚柏科信息股份有限公司 Thinking-guidance-graph-based task management method, terminal device and storage medium

Also Published As

Publication number Publication date
CN108595678B (en) 2022-05-31

Similar Documents

Publication Publication Date Title
US10802709B2 (en) Multi-window keyboard
US10540661B2 (en) Integrated service support tool across multiple applications
CN110546662B (en) Collaborative review workflow diagrams
US20170295122A1 (en) Proactive intelligent personal assistant
US20180196579A1 (en) Master View of Tasks
US12003591B2 (en) Automatic discovery and registration of service applications for files introduced to a user interface
WO2019206158A1 (en) Interface displaying method, apparatus, and device
CN107066188B (en) A kind of method and terminal sending screenshot picture
JP2018502358A (en) Context-based actions in the voice user interface
US10462215B2 (en) Systems and methods for an intelligent distributed working memory
CN111190882B (en) Target template creation method and device, electronic equipment and storage medium
KR20070120095A (en) Method and apparatus for providing process guidance
US20090235253A1 (en) Smart task list/life event annotator
CN108369600A (en) Web browser extends
US10013238B2 (en) Predicting elements for workflow development
US20220366277A1 (en) Automatic generative learned process coaching
US20230266982A1 (en) Device navigational maps for connected devices
WO2016127577A1 (en) Event processing method and apparatus
CN108595678A (en) Task data processing method and processing device, electronic equipment, storage medium
US20150007019A1 (en) Apparatuses and methods for phone number processing
US20220318319A1 (en) Focus Events
WO2019183779A1 (en) Control method and electronic device
US20130205253A1 (en) Method and system for completing schedule information, and computer-readable recording medium having recorded thereon program for executing the method
US20080082610A1 (en) Method and apparatus for providing collaborative user interface feedback
CN111723134A (en) Information processing method, information processing device, electronic equipment and storage medium

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
GR01 Patent grant
GR01 Patent grant