CN111966478A - Custom task ordering method and device, electronic device and medium - Google Patents
Custom task ordering method and device, electronic device and medium Download PDFInfo
- Publication number
- CN111966478A CN111966478A CN202010834059.6A CN202010834059A CN111966478A CN 111966478 A CN111966478 A CN 111966478A CN 202010834059 A CN202010834059 A CN 202010834059A CN 111966478 A CN111966478 A CN 111966478A
- Authority
- CN
- China
- Prior art keywords
- task
- tasks
- group
- position value
- dragged
- 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
Links
- 238000000034 method Methods 0.000 title claims abstract description 40
- 230000004044 response Effects 0.000 claims abstract description 23
- 238000012163 sequencing technique Methods 0.000 claims description 20
- 230000015654 memory Effects 0.000 claims description 6
- 238000001514 detection method Methods 0.000 claims description 3
- 238000010586 diagram Methods 0.000 description 6
- 238000004891 communication Methods 0.000 description 5
- 238000004364 calculation method Methods 0.000 description 4
- 238000007726 management method Methods 0.000 description 4
- 230000003936 working memory Effects 0.000 description 4
- 238000013459 approach Methods 0.000 description 3
- 230000003287 optical effect Effects 0.000 description 3
- 238000012545 processing Methods 0.000 description 3
- 238000003491 array Methods 0.000 description 2
- 230000010267 cellular communication Effects 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 230000003247 decreasing effect Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements 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/46—Multiprogramming arrangements
- G06F9/48—Program initiating; Program switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
- G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
- G06F9/4881—Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/01—Input arrangements or combined input and output arrangements for interaction between user and computer
- G06F3/048—Interaction techniques based on graphical user interfaces [GUI]
- G06F3/0484—Interaction techniques based on graphical user interfaces [GUI] for the control of specific functions or operations, e.g. selecting or manipulating an object, an image or a displayed text element, setting a parameter value or selecting a range
- G06F3/0486—Drag-and-drop
Abstract
The disclosure provides a custom task ordering method and device, electronic equipment and a medium, and relates to the technical field of cloud platforms and task management. According to one aspect of the disclosure, the custom task ordering method is used for ordering tasks, and the method comprises the following steps: distributing the tasks to corresponding groups according to the task states; setting the position value of the task in the group to which the task belongs according to the editing time of the task to be sequenced so as to sequence according to the position value; and in response to detecting the dragging operation in the group, updating the position value of the dragged task according to the position value of the task adjacent to the dragged target position to reorder.
Description
Technical Field
The disclosure relates to the technical field of cloud platforms and task management, and in particular to a custom task ordering method and device, an electronic device and a medium.
Background
Currently, known task sorting rules can be sorted according to creation time or priority, and the above task sorting conditions can meet user requirements in most scenes, but cannot meet the scenes in which a user wants to define the task sorting rules by self. Moreover, some existing sequencing methods are not perfect, and are easy to cause misoperation to cause confusion.
The approaches described in this section are not necessarily approaches that have been previously conceived or pursued. Unless otherwise indicated, it should not be assumed that any of the approaches described in this section qualify as prior art merely by virtue of their inclusion in this section. Similarly, unless otherwise indicated, the problems mentioned in this section should not be considered as having been acknowledged in any prior art.
Disclosure of Invention
According to one aspect of the present disclosure, a custom task sorting method is provided for sorting tasks, wherein the method includes: distributing the tasks to corresponding groups according to the task states; setting the position value of the task in the group to which the task belongs according to the editing time of the task to be sequenced so as to sequence according to the position value; and in response to detecting the dragging operation in the group, updating the position value of the dragged task according to the position value of the task adjacent to the dragged target position to reorder.
According to another aspect of the present disclosure, there is provided a custom task ranking device for ranking tasks, wherein the device comprises: a grouping unit configured to allocate the tasks to the corresponding groups according to the task states; the first sequencing unit is configured to set a position value of the task in the group to which the task belongs according to the editing time of the task to be sequenced so as to perform sequencing according to the position value; and a second sorting unit configured to update the position value of the dragged task according to the position value of the task adjacent to the dragged target position to re-sort in response to detection of the dragging operation within the group.
According to another aspect of the present disclosure, there is provided an electronic device including: a processor; and a memory storing a program comprising instructions that, when executed by the processor, cause the processor to perform the sorting method described in the present disclosure.
According to another aspect of the present disclosure, there is provided a computer readable storage medium storing a program, the program comprising instructions which, when executed by a processor of an electronic device, cause the electronic device to perform the sorting method described in the present disclosure.
According to one aspect of the disclosure, the custom task ranking method prevents a task from being repeatedly executed due to a user's misoperation.
These and other aspects of the disclosure will be apparent from and elucidated with reference to the embodiments described hereinafter.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate exemplary embodiments of the embodiments and, together with the description, serve to explain the exemplary implementations of the embodiments. The illustrated embodiments are for purposes of illustration only and do not limit the scope of the claims. Throughout the drawings, identical reference numbers designate similar, but not necessarily identical, elements.
FIG. 1 is a flow diagram illustrating a custom task ranking method of an exemplary embodiment;
FIG. 2 is a diagram illustrating the allocation of tasks into different groups by state in accordance with an illustrative embodiment;
FIG. 3 is a diagram illustrating different scenarios of reordering after dragging tasks in a group according to an exemplary embodiment;
FIG. 4 is a schematic diagram illustrating a custom task ranking device of an exemplary embodiment; and
fig. 5 is a block diagram showing an exemplary computing device to which the exemplary embodiments can be applied.
Detailed Description
In the present disclosure, unless otherwise specified, the use of the terms "first", "second", etc. to describe various elements is not intended to limit the positional relationship, the timing relationship, or the importance relationship of the elements, and such terms are used only to distinguish one element from another. In some examples, a first element and a second element may refer to the same instance of the element, and in some cases, based on the context, they may also refer to different instances.
The terminology used in the description of the various described examples in this disclosure is for the purpose of describing particular examples only and is not intended to be limiting. Unless the context clearly indicates otherwise, if the number of elements is not specifically limited, the elements may be one or more. Furthermore, the term "and/or" as used in this disclosure is intended to encompass any and all possible combinations of the listed items.
In the present disclosure, the tasks to be ordered may be custom lists presented in the user interface of the application, such as task lists in an intelligent office scenario including, but not limited to, memo lists, mailing lists, conversation lists, and the like. Alternatively, the list of applications in other interfaces may be used, such as an applet list, a desktop icon of a client, an item of a presentation list, and the like.
FIG. 1, in accordance with one aspect of the present disclosure, is a flow chart illustrating a custom task ranking method of an exemplary embodiment. As shown in fig. 1, the custom task sorting method is used for sorting tasks, and includes: allocating tasks to corresponding groups according to the task state (step 110); setting the position value of the task in the group to which the task belongs according to the editing time of the task to be sorted, so as to sort according to the position value (step 120); and in response to detecting the drag operation within the group, updating the position value of the dragged task to be reordered according to the position value of the task adjacent to the dragged target position (step 130).
According to one aspect of the disclosure, the user-defined task sorting method firstly sets a position value according to time information, meets the primary sorting requirement of a user, and can effectively reduce the number of times of dragging; the method can prevent a certain task from being repeatedly executed due to misoperation of a user, and improves the office efficiency and the user experience of the user; in addition, the task sequencing can be realized only by setting the position value, the operation is simple, the calculated amount is small, and the position values of other tasks are not influenced after the dragging.
In step 110, the tasks are assigned to the corresponding groups according to the task status.
According to some embodiments, the task status includes completed and incomplete, i.e. may be divided into an incomplete task and a completed task according to the task status. Completed here may mean that the task has been processed or flagged by the user, and similarly, not completed may mean that the task has not been processed or flagged by the user. The groups correspond to respective task states, and as described above, may be divided into completed task groups and incomplete task groups. As shown in FIG. 2, tasks A-C are in the same group and tasks 1-2 are in another group, e.g., tasks A-C are in an incomplete group and tasks 1-2 are in a completed group.
The tasks are grouped according to the task states, so that the tasks in different states can be managed respectively, and the application requirements of various scenes are met.
In some examples, a respective attribute or field is set for each task to indicate its current state. When the task is newly created, the field indicating the state of the task is marked as incomplete; when the task is processed or marked by the user, the field is modified to be completed.
In the present disclosure, a group may be different storage spaces or different display areas separated in a user interface, etc. The groups can be relatively independent, the relevance between tasks of different groups is smaller than that between tasks of the same group, and when parameters such as the state of a certain task are changed, the task can be transferred from one group to another group.
In step 120, the position value of the task in the group to which the task belongs is set according to the edit time of the task to be sorted to sort.
According to some embodiments, setting the position value of the task in the group to which the task belongs according to the edit time of the task to be sorted includes: setting a reference value representing an interval between adjacent tasks; according to the editing time of the task, accumulating the reference value of each task in the group in sequence to generate a respective position value of each task; and sequencing the tasks in sequence according to the generated position values.
According to some embodiments, the edit time of the task in the completed state includes one of: creation time and completion time; and the editing time of the task in the incomplete state comprises the following steps: the creation time. The creation time is represented as the time when the task is initially newly generated; the completion time is expressed as the time when the task is processed to completion or marked. In the embodiment, the task list can be normalized by firstly sorting according to time, and unnecessary dragging times are reduced.
According to some embodiments, the value of the reference value represents an interval between adjacent tasks, that is, a number of times or frequency that the adjacent tasks can be dragged to be inserted into other tasks. For example, the reference value includes one of: 232、230、228、224、220、216、28. It will be appreciated that other values of the reference value are possible, for example 231、230、229、227、226、225、223、222、221、219、218、217、215、214、213、212、211、210、29、27、26、25、24And the like. The type of data described above is defined as Long. The value can be dragged for many times within the limited precision of the computer, and a user can correspondingly select a proper reference value according to the task sequencing requirement, so that decimal parts generally do not appear after the position value after dragging is recalculated, and the calculation rate is improved.
For example, at a reference value of 232For the initial position value of the newly generated task in the group, the position value of the first task may be 232The position value of the second task is 2 x 232The position value of the third task is 3 x 232… … and so on. The user-defined task sorting method can realize task sorting only according to the position value, and is simple to operate and small in calculation amount.
In step 130, in response to detecting the drag operation within the group, the position value of the dragged task is updated according to the position value of the task adjacent to the dragged target position to reorder.
According to some embodiments, after detecting the drag operation within the group, updating the position value of the dragged task according to the position value of the task adjacent to the dragged target position to reorder, includes: in response to the target location being neither the first task in the group nor the last task in the group, obtaining location values for a previous task and a next task for the target location; and updating half of the sum of the acquired position values as a new position value of the dragged task.
According to some embodiments, after detecting the drag operation within the group, updating the position value of the dragged task according to the position value of the task adjacent to the dragged target position to reorder, includes: in response to the target position being the first task in the group, setting a position value of the dragged task to be half of a position value of a next task at the target position; and setting a position value of the dragged task as a sum of a position value of a previous task of the target position and a reference value in response to the target position being a last task of the group.
FIG. 3 is a diagram illustrating different scenarios for reordering after dragging tasks in a group, according to an exemplary embodiment. And if the client or other user interfaces detect that the user stops dragging the task, detecting the current target position, and calculating a new position value of the task according to the position value of the task adjacent to the target position. As shown in fig. 3, the first scenario is an initialization scenario, and the position values of the tasks a to E are (1 to 5) × base, respectively, where base is a reference value. In this example, the base value base takes a value of 232(when the data type is a long integer, the adjacent two tasks can be dragged and inserted for at least 32 times). In the second scenario, if the task C is dragged between the tasks A, B, the new position value of the task C is (position value of task a + position value of task B)/2, and the position values of the other tasks are not changed. On the basis of the scene two, dragging the task E to the position before the task A, and setting the new position value of the task E as (0+ the position value of the task A)/2; and in the fourth scene, on the basis of the third scene, after the task a is dragged to the task D, the new position value of the task a is equal to the position value of the task D + the reference value base.
In the embodiment, after the tasks are dragged, the sequencing can be realized only by changing the position values of the dragged tasks, and the position values of other tasks do not need to be changed, so that the calculation amount is reduced; after the dragging operation, half of the sum of the position values of the upper task and the lower task of the target position is used as a new position value of the dragged task, and the balance of data intervals is guaranteed.
The above example sets the position values of the tasks to be sequentially increased from small to large, and it should be understood that according to some embodiments, the position values of the tasks may be sequentially decreased from large to small, and the specific values may be set according to the work requirement. In this embodiment, if the target position is the first task in the group, the position value of the dragged task is set to the sum of the position value of the next task at the target position and the reference value; and if the target position is the last task in the group, setting the position value of the dragged task to be half of the position value of the last task of the target position. And if the target position is neither the first task nor the last task in the group, acquiring the position values of the last task and the next task of the target position and updating half of the sum of the acquired position values as the new position value of the dragged task.
According to some embodiments, setting the position value of the task in the group to which the task belongs to be sorted according to the edit time of the task to be sorted includes: and in response to the group of tasks corresponding to the completed state, sequencing the editing time of the tasks as position values of the tasks in the group, wherein the tasks in the group are set to be incapable of being dragged.
In some examples, it may be set that only tasks in an incomplete state can be dragged, and the dragging range is limited to the group corresponding to the incomplete state; tasks in the completed state cannot be dragged and may be ordered based on the time the task was completed or the time it was originally created. In this way, the complexity of operation and code is reduced, because the tasks that have generally been completed no longer need special attention from the staff, the sequencing according to the time when they were completed or when they were originally created can be clearer, and it can also prevent the user from mistakenly dragging and disturbing their original regular arrangement.
In the above embodiments, there are various advantages to grouping tasks according to their states, and in addition, grouping management according to other attributes, for example, according to task types, may be performed in addition to grouping according to their states. The grouping management can make the task management more clear and can effectively prevent the misoperation of a user. In addition, in other embodiments, a unidirectional dragging operation that can drag a task from a certain group to another group may also be set, for example, a one-directional dragging operation that can drag a task in a completed state group to an uncompleted state group but cannot drag a task in an uncompleted state group to a completed state group may be set, so as to implement a secondary operation on some completed tasks.
According to another aspect of the present disclosure, as shown in fig. 4, there is also provided a custom task sorting apparatus for sorting tasks, wherein the apparatus 400 includes: a grouping unit 410 configured to assign tasks to respective groups according to task states; a first sorting unit 420 configured to set a position value of a task in a group to which the task belongs according to an edit time of the task to be sorted, so as to sort according to the position value; and a second sorting unit 430 configured to update the position value of the dragged task according to the position value of the task adjacent to the dragged target position to reorder in response to detection of the dragging operation within the group.
According to another aspect of the disclosure, the user-defined task sequencing equipment sets a position value according to time information, so that the requirement of a user for preliminary sequencing is met, and the number of times of dragging can be effectively reduced; the method can prevent a certain task from being repeatedly executed due to misoperation of a user, and improves the office efficiency and the user experience of the user; in addition, the task sequencing can be realized only by setting the position value, the operation is simple, the calculated amount is small, and the position values of other tasks are not influenced after the dragging.
According to some embodiments, the first ordering unit is further configured to: setting a reference value representing an interval between adjacent tasks; according to the editing time of the tasks, accumulating the reference values of the tasks in the group in sequence to generate respective position values of the tasks; and sequencing the tasks in sequence according to the generated position values. The user-defined task sorting method is simple to operate.
According to some embodiments, the second sorting unit is further configured to: in response to the target position being neither the first task in the group nor the last task in the group, obtaining position values of a previous task and a next task of the target position; and updating half of the obtained position value as a new position value of the dragged task.
According to some embodiments, the second sorting unit is further configured to: in response to the target position being the first task in the group, setting a position value of the dragged task to be half of a position value of a next task at the target position; and setting a position value of the dragged task as a sum of a position value of a task previous to the target position and the reference value in response to the target position being a last task in the group.
In the embodiment, after the task is dragged, only the position value of the dragged task needs to be changed, and the position values of other tasks do not need to be changed, so that the calculation amount is reduced.
According to some embodiments, the task status includes completed and incomplete, wherein the edit time of a task in completed status includes one of: creation time and completion time; and the edit time of an uncompleted task includes: the creation time. In the embodiment, the task list can be normalized by firstly sorting according to time, and unnecessary dragging times are reduced.
According to some embodiments, the first ordering unit is further configured to: and in response to the task of which the group corresponds to the completed state, taking the editing time of the task as a position value of the task in the group to sort, wherein the task in the group is set to be incapable of being dragged. In this way, the complexity of operation and code is reduced, because the tasks that have generally been completed no longer need special attention from the staff, the sequencing according to the time when they were completed or when they were originally created can be clearer, and it can also prevent the user from mistakenly dragging and disturbing their original regular arrangement.
According to some embodiments, the reference value comprises one of: 232、230、228、224、220、216、28。
Here, the operations of the above units 410 to 430 of the custom task sorting apparatus 400 are similar to the operations of the steps 110 to 130 described above, and are not described herein again.
According to another aspect of the present disclosure, there is also provided an electronic device including: a processor; and a memory storing a program comprising instructions that, when executed by the processor, cause the processor to perform the above-described custom task ranking method.
According to another aspect of the present disclosure, there is provided a computer readable storage medium storing a program, the program comprising instructions which, when executed by a processor of an electronic device, cause the electronic device to perform the above-described custom task ranking method.
Referring to fig. 5, a computing device 2000, which is an example of a hardware device (electronic device) that may be applied to aspects of the present disclosure, will now be described. The computing device 2000 may be any machine configured to perform processing and/or computing, and may be, but is not limited to, a workstation, a server, a desktop computer, a laptop computer, a tablet computer, a personal digital assistant, a robot, a smart phone, an on-board computer, or any combination thereof. The above-described custom task ranking methods may each be implemented in whole or at least in part by computing device 2000 or a similar device or system.
The computing device 2000 may also include a working memory 2014, which may be any type of working memory that can store programs (including instructions) and/or data useful for the operation of the processor 2004, and may include, but is not limited to, random access memory and/or read only memory devices.
Software elements (programs) may be located in the working memory 2014 including, but not limited to, an operating system 2016, one or more application programs 2018, drivers, and/or other data and code. Instructions for performing the above-described methods and steps may be included in one or more applications 2018, and the above-described custom task ranking methods may each be implemented by instructions of one or more applications 2018 being read and executed by the processor 2004. More specifically, in the above-described custom task ranking method, steps 110 to 130 may be implemented, for example, by processor 2004 executing application 2018 having instructions of steps 110 to 130. Further, other steps in the above-described custom task ranking method may be implemented, for example, by the processor 2004 executing an application 2018 having instructions to perform the corresponding steps. Executable code or source code of instructions of the software elements (programs) may be stored in a non-transitory computer-readable storage medium (such as the storage device 2010 described above) and, upon execution, may be stored in the working memory 2014 (possibly compiled and/or installed). Executable code or source code for the instructions of the software elements (programs) may also be downloaded from a remote location.
It will also be appreciated that various modifications may be made in accordance with specific requirements. For example, customized hardware might also be used and/or particular elements might be implemented in hardware, software, firmware, middleware, microcode, hardware description languages, or any combination thereof. For example, some or all of the disclosed methods and apparatus may be implemented by programming hardware (e.g., programmable logic circuitry including Field Programmable Gate Arrays (FPGAs) and/or Programmable Logic Arrays (PLAs)) in an assembly language or hardware programming language such as VERILOG, VHDL, C + +, using logic and algorithms according to the present disclosure.
It should also be understood that the components of computing device 2000 may be distributed across a network. For example, some processes may be performed using one processor while other processes may be performed by another processor that is remote from the one processor. Other components of the computing system 2000 may also be similarly distributed. As such, the computing device 2000 may be interpreted as a distributed computing system that performs processing at multiple locations.
Although embodiments or examples of the present disclosure have been described with reference to the accompanying drawings, it is to be understood that the above-described methods, systems and apparatus are merely exemplary embodiments or examples and that the scope of the present invention is not limited by these embodiments or examples, but only by the claims as issued and their equivalents. Various elements in the embodiments or examples may be omitted or may be replaced with equivalents thereof. Further, the steps may be performed in an order different from that described in the present disclosure. Further, various elements in the embodiments or examples may be combined in various ways. It is important that as technology evolves, many of the elements described herein may be replaced with equivalent elements that appear after the present disclosure.
Claims (16)
1. A custom task sequencing method for sequencing tasks, wherein the method comprises the following steps:
distributing the tasks to corresponding groups according to task states;
setting position values of the tasks in the group to which the tasks belong according to the editing time of the tasks to be sequenced so as to sequence according to the position values; and
in response to detecting a drag operation within the group, updating the position value of the dragged task to reorder according to the position value of the task adjacent to the dragged target position.
2. The method of claim 1, setting a position value of a task in a group to which the task belongs according to an edit time of the task to be sorted, to sort according to the position value comprises:
setting a reference value representing an interval between adjacent tasks;
according to the editing time of the tasks, sequentially accumulating the reference values of the tasks in the group to generate respective position values of the tasks; and
and sequencing the tasks in sequence according to the generated position values.
3. The method of claim 2, wherein updating the position value of the dragged task to reorder according to the position value of the dragged task adjacent to the target position after the drag operation is detected within the group comprises:
in response to the target location being neither the first task in the group nor the last task in the group, obtaining location values for a previous task and a next task of the target location; and
and updating half of the obtained position value as a new position value of the dragged task.
4. The method of claim 3, wherein updating the position value of the dragged task to reorder according to the position value of the dragged task adjacent to the target position after the drag operation is detected within the group comprises:
in response to the target position being the first task in the group, setting a position value of the dragged task to be half of a position value of a next task at the target position; and
setting a position value of the dragged task as a sum of a position value of a task previous to the target position and the reference value in response to the target position being a last task in the group.
5. The method of claim 1, the task state comprising completed and incomplete, wherein,
the edit time of the task in the completed state comprises one of: creation time and completion time; and
the edit time of the uncompleted task includes: the creation time.
6. The method of claim 5, setting the position values of the tasks in the group to which the tasks belong to be sorted according to the edit time of the tasks to be sorted to sort comprises: in response to the group of tasks corresponding to a completed state, sorting an edit time of the task as a position value of the task in the group,
wherein the tasks in the group are set to be unable to be dragged.
7. The method of claim 1, the reference value comprising one of: 232、230、228、224、220、216、28。
8. A custom task ranking device for ranking tasks, wherein the device comprises:
a grouping unit configured to allocate the tasks to corresponding groups according to task states;
the first sequencing unit is configured to set position values of the tasks in the group to which the tasks belong according to the editing time of the tasks to be sequenced so as to sequence according to the position values; and
and the second sequencing unit is configured to respond to the detection of the dragging operation in the group, and update the position value of the dragged task according to the position value of the task adjacent to the dragged target position so as to reorder.
9. The apparatus of claim 8, the first ordering unit further configured to:
setting a reference value representing an interval between adjacent tasks;
according to the editing time of the tasks, sequentially accumulating the reference values of the tasks in the group to generate respective position values of the tasks; and
and sequencing the tasks in sequence according to the generated position values.
10. The apparatus of claim 9, the second ordering unit further configured to:
in response to the target location being neither the first task in the group nor the last task in the group, obtaining location values for a previous task and a next task of the target location; and
and updating half of the obtained position value as a new position value of the dragged task.
11. The apparatus of claim 10, the second ordering unit further configured to:
in response to the target position being the first task in the group, setting a position value of the dragged task to be half of a position value of a next task at the target position; and
setting a position value of the dragged task as a sum of a position value of a task previous to the target position and the reference value in response to the target position being a last task in the group.
12. The apparatus of claim 8, the task state comprising completed and incomplete, wherein,
the edit time of the task in the completed state comprises one of: creation time and completion time; and
the edit time of the uncompleted task includes: the creation time.
13. The apparatus of claim 12, the first ordering unit further configured to: in response to the group of tasks corresponding to a completed state, sorting an edit time of the task as a position value of the task in the group,
wherein the tasks in the group are set to be unable to be dragged.
14. The apparatus of claim 8, the reference value comprising one of: 232、230、228、224、220、216、28。
15. An electronic device, comprising:
a processor; and
a memory storing a program comprising instructions that, when executed by the processor, cause the processor to perform the method of any of claims 1-7.
16. A computer readable storage medium storing a program, the program comprising instructions that when executed by a processor of an electronic device cause the electronic device to perform the method of any of claims 1-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010834059.6A CN111966478B (en) | 2020-08-18 | 2020-08-18 | Custom task ordering method and device, electronic device and medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010834059.6A CN111966478B (en) | 2020-08-18 | 2020-08-18 | Custom task ordering method and device, electronic device and medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111966478A true CN111966478A (en) | 2020-11-20 |
| CN111966478B CN111966478B (en) | 2024-02-20 |
Family
ID=73388367
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010834059.6A Active CN111966478B (en) | 2020-08-18 | 2020-08-18 | Custom task ordering method and device, electronic device and medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111966478B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113268189A (en) * | 2021-05-11 | 2021-08-17 | Oppo广东移动通信有限公司 | Atlas management method, apparatus, storage medium and computer device |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2002132543A (en) * | 2000-10-25 | 2002-05-10 | Hitachi Ltd | Control method of computer system |
| JP2005315934A (en) * | 2004-04-27 | 2005-11-10 | Daiichikosho Co Ltd | Information processing method for outputting ranking while totalizing result data to be generated in time sequence by computer, karaoke-scoring ranking processing method, and karaoke-scoring ranking server |
| CN101568900A (en) * | 2006-12-22 | 2009-10-28 | 日本电气株式会社 | Parallel sort device, method, and program |
| JP2011185846A (en) * | 2010-03-10 | 2011-09-22 | Mitsubishi Electric Corp | Reference value creation device and reference value creation method |
| CN104899334A (en) * | 2015-06-24 | 2015-09-09 | 惠州华阳通用电子有限公司 | Device and method for updating multimedia play list |
| CN106933995A (en) * | 2017-02-28 | 2017-07-07 | 张凯 | A kind of public activity ranking screening and sequencing system and its implementation |
| CN109767120A (en) * | 2019-01-11 | 2019-05-17 | 中国水利水电科学研究院 | A kind of production stream Parallel Task Scheduling method based on hydrological distribution model |
| CN110362297A (en) * | 2018-03-26 | 2019-10-22 | 北京京东尚科信息技术有限公司 | A kind of element sort method and device |
| CN110968553A (en) * | 2018-09-28 | 2020-04-07 | 北京国双科技有限公司 | Method and device for sorting elements in directory tree |
| CN111240662A (en) * | 2020-01-16 | 2020-06-05 | 同方知网(北京)技术有限公司 | Spark machine learning system and learning method based on task visual dragging |
-
2020
- 2020-08-18 CN CN202010834059.6A patent/CN111966478B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2002132543A (en) * | 2000-10-25 | 2002-05-10 | Hitachi Ltd | Control method of computer system |
| JP2005315934A (en) * | 2004-04-27 | 2005-11-10 | Daiichikosho Co Ltd | Information processing method for outputting ranking while totalizing result data to be generated in time sequence by computer, karaoke-scoring ranking processing method, and karaoke-scoring ranking server |
| CN101568900A (en) * | 2006-12-22 | 2009-10-28 | 日本电气株式会社 | Parallel sort device, method, and program |
| JP2011185846A (en) * | 2010-03-10 | 2011-09-22 | Mitsubishi Electric Corp | Reference value creation device and reference value creation method |
| CN104899334A (en) * | 2015-06-24 | 2015-09-09 | 惠州华阳通用电子有限公司 | Device and method for updating multimedia play list |
| CN106933995A (en) * | 2017-02-28 | 2017-07-07 | 张凯 | A kind of public activity ranking screening and sequencing system and its implementation |
| CN110362297A (en) * | 2018-03-26 | 2019-10-22 | 北京京东尚科信息技术有限公司 | A kind of element sort method and device |
| CN110968553A (en) * | 2018-09-28 | 2020-04-07 | 北京国双科技有限公司 | Method and device for sorting elements in directory tree |
| CN109767120A (en) * | 2019-01-11 | 2019-05-17 | 中国水利水电科学研究院 | A kind of production stream Parallel Task Scheduling method based on hydrological distribution model |
| CN111240662A (en) * | 2020-01-16 | 2020-06-05 | 同方知网(北京)技术有限公司 | Spark machine learning system and learning method based on task visual dragging |
Non-Patent Citations (2)
| Title |
|---|
| 李一达;黄维通;: "针对快速排序改进的一些思考及其实现", 计算机教育, no. 05, 10 May 2018 (2018-05-10) * |
| 肖奎;吴天吉;: "快速排序的改进算法", 福建电脑, no. 08, 1 August 2008 (2008-08-01) * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113268189A (en) * | 2021-05-11 | 2021-08-17 | Oppo广东移动通信有限公司 | Atlas management method, apparatus, storage medium and computer device |
| CN113268189B (en) * | 2021-05-11 | 2023-07-25 | Oppo广东移动通信有限公司 | Atlas management method, atlas management device, storage medium and computer equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111966478B (en) | 2024-02-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR101522014B1 (en) | The method, device and recording medium for managing application icon | |
| AU2015374061B2 (en) | Permitted assignment user interface | |
| JP4317437B2 (en) | Raster image processing method | |
| US10922361B2 (en) | Identifying and structuring related data | |
| CN103530220A (en) | Display method and system and terminal for application program icons | |
| EP3819772A1 (en) | Method for pre-allocating memory, the electronic device, and the computer product | |
| US20210142154A1 (en) | Memory pre-allocation for forward calculation in a neural network | |
| US20170337560A1 (en) | System for providing and employing recommended resolution paths | |
| CN111158828A (en) | User interface determining method and device of application program APP and storage medium | |
| CN106294549A (en) | A kind of image processing method and terminal | |
| CN111966478B (en) | Custom task ordering method and device, electronic device and medium | |
| JP2015064715A (en) | Input support device, input support method, and input support program | |
| KR20160104961A (en) | Method for processing page and electronic device thereof | |
| CN111125205B (en) | Signboard data display method, terminal and storage medium | |
| US8805857B2 (en) | Merging of items from different data sources | |
| CN112612757A (en) | Application display method, device, equipment, storage medium and program product | |
| JP5202472B2 (en) | Instruction placement program, instruction placement apparatus, and instruction placement method | |
| KR20140090080A (en) | Method and apparatus for managing programs or icons | |
| CN103207746A (en) | Function invoking method and device | |
| CN106934555B (en) | Workflow organization method and device, computer equipment and storage medium | |
| US20240046221A1 (en) | Electronic Meeting Suggestion Generator with Accommodations | |
| US8694911B2 (en) | Manipulating hidden data entries via representative markers | |
| CN112598386A (en) | Method, device and equipment for task reminding and storage medium | |
| CN113723062A (en) | Report label editing method and device, storage medium and terminal equipment | |
| CN113268291A (en) | Schedule processing method, device, 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 |