Schedule data processing method and device

Abstract

Embodiments of the present application disclose a schedule data processing method and device. After a schedule data set is acquired, the schedule data processing method sorts multiple schedule data in the schedule data set according to a preset sorting rule to determine a schedule data sequence, stores schedule data meeting a conflict condition to a conflict data set by comparing attributes of adjacent schedule data in the schedule data sequence, and displays the conflict data set. The method can improve schedule data processing efficiency and improve interface loading and updating speed.

Description

Technical Field

[0001] This invention relates to the field of data processing, and more specifically to a method and apparatus for processing schedule data. Background Technology

[0002] To meet users' needs for viewing schedule data, related devices usually need to find schedule data with time conflicts from other normal schedule data, and then display the found conflicting schedule data to the user in chronological order.

[0003] In this process, existing technologies generally use brute force to find conflicting schedules. However, the time complexity of the corresponding algorithm is high. When the amount of schedule data to be processed is large or the display interface needs to be frequently loaded and updated, its data processing efficiency is low, it takes a long time, and it can easily affect the loading and updating of the display interface. Summary of the Invention

[0004] In view of this, embodiments of the present invention provide a method and apparatus for processing schedule data to improve the efficiency of schedule data processing and increase the speed of interface loading and updating.

[0005] In a first aspect, embodiments of the present invention provide a method for processing schedule data, the method comprising:

[0006] Obtain a schedule data set, which includes multiple schedule data sets, each of which has corresponding start time information and end time information;

[0007] The schedule data in the schedule data set is sorted according to a preset sorting rule to determine the schedule data sequence;

[0008] By comparing the attributes of adjacent schedule data in the schedule data sequence, schedule data that meets the conflict conditions are stored in a conflict data set.

[0009] The set of conflicting data is displayed.

[0010] Secondly, embodiments of the present invention provide a schedule data processing apparatus, the apparatus comprising:

[0011] The acquisition unit is used to acquire a schedule data set, which includes multiple schedule data, each of which has corresponding start time information and end time information;

[0012] A sorting unit is used to sort the schedule data in the schedule data set according to a preset sorting rule to determine a schedule data sequence;

[0013] A comparison unit is used to store schedule data that meets the conflict conditions into a conflict data set by comparing the attributes of adjacent schedule data in the schedule data sequence.

[0014] The display unit is used to display the conflict data set.

[0015] Thirdly, embodiments of the present invention provide a computer-readable storage medium having computer program instructions stored thereon, which, when executed by a processor, implement the method as described in any one of the first aspects.

[0016] Fourthly, embodiments of the present invention provide an electronic device, the device comprising:

[0017] Memory is used to store one or more computer program instructions;

[0018] A processor, wherein the one or more computer program instructions are executed by the processor to implement the method as described in any one of the first aspects.

[0019] The schedule data processing method of this invention, after acquiring a schedule data set, sorts multiple schedule data in the schedule data set according to a preset sorting rule to determine a schedule data sequence. Then, by comparing the attributes of adjacent schedule data in the schedule data sequence, schedule data that meet the conflict conditions are stored in a conflict data set, and the conflict data set is displayed. This method can improve the efficiency of schedule data processing and increase the speed of interface loading and updating. Attached Figure Description

[0020] The above and other objects, features and advantages of the present invention will become clearer from the following description of embodiments of the invention with reference to the accompanying drawings, in which:

[0021] Figure 1 This is a flowchart of a schedule data processing method according to an embodiment of the present invention;

[0022] Figure 2 This is a flowchart of a schedule data sorting method according to an embodiment of the present invention;

[0023] Figure 3 This is a flowchart of a method for determining conflicting data sets according to an embodiment of the present invention;

[0024] Figure 4 This is a flowchart of a method for determining conflicting data sets according to an embodiment of the present invention;

[0025] Figure 5 This is a schematic diagram of a schedule data sequence according to an embodiment of the present invention;

[0026] Figure 6 This is another flowchart of the conflict data set determination method according to an embodiment of the present invention;

[0027] Figure 7 This is a schematic diagram of the human-computer interaction interface according to an embodiment of the present invention;

[0028] Figure 8 This is a schematic diagram of a schedule data processing device according to an embodiment of the present invention;

[0029] Figure 9 This is a schematic diagram of an electronic device according to an embodiment of the present invention. Detailed Implementation

[0030] The present invention is described below based on embodiments, but the invention is not limited to these embodiments. In the detailed description of the invention below, certain specific details are described in detail. Those skilled in the art will fully understand the invention even without these details. To avoid obscuring the essence of the invention, well-known methods, processes, flows, elements, and circuits are not described in detail.

[0031] Furthermore, those skilled in the art should understand that the accompanying drawings provided herein are for illustrative purposes only and are not necessarily drawn to scale.

[0032] Unless the context explicitly requires it, words such as "including" or "contains" in the instruction manual should be interpreted as including rather than exclusive or exhaustive; that is, meaning "including but not limited to".

[0033] In the description of this invention, it should be understood that the terms "first," "second," etc., are used for descriptive purposes only and should not be construed as indicating or implying relative importance. Furthermore, in the description of this invention, unless otherwise stated, "a plurality of" means two or more.

[0034] To meet users' needs for viewing schedule data, related devices usually need to find schedule data with time conflicts from other normal schedule data, and then display the found conflicting schedule data to the user in chronological order.

[0035] In this process, existing technologies generally use brute force to find conflicting schedules, that is, to compare each schedule data with all schedule data one by one. However, the time complexity of the corresponding algorithm is high. When the amount of schedule data to be processed is large or the display interface needs to be loaded and updated frequently, its data processing efficiency is low, it takes a long time, and it can easily affect the loading and updating speed of the display interface.

[0036] Figure 1 This is a flowchart of a schedule data processing method according to an embodiment of the present invention. Figure 1 As shown, the schedule data processing method specifically includes the following steps:

[0037] S100, Obtain the schedule data set.

[0038] In this embodiment, the device used to process and display schedule data can specifically be an in-vehicle infotainment system configured on the vehicle, and the schedule data can be an event schedule created and stored by the in-vehicle infotainment system based on relevant information input by the driver.

[0039] Specifically, the vehicle infotainment system can access a stored set of schedule data. This set of schedule data includes multiple schedule data points. Each schedule data point has corresponding start time information and end time information. It should be understood that the start time information represents the start time of the schedule data, and the end time information represents the end time of the schedule data.

[0040] Optionally, the start time and end time information may include specific information such as year, month, day, hour, minute, and second. For example, the start time of the schedule data could be 20XX year X month X day X hour X minute X second, etc. It should be understood that the level of detail of the schedule data can be set by the developer or user according to actual needs.

[0041] Optionally, the driver can control the vehicle system to create corresponding schedule data by inputting relevant information at the vehicle system's human-machine interface. Optionally, the input method can be touch screen input, voice input, or control input. Optionally, the relevant information can be the start time, end time, location, reminder time, and precautions for the schedule data to be created. Optionally, after receiving the relevant information input by the driver, the vehicle system will create the corresponding schedule data based on the relevant information and store the created schedule data in the corresponding memory.

[0042] It should be understood that the schedule data processing method in this embodiment is not limited to vehicle-mounted systems and event schedules. In an optional implementation, the schedule data can also be generated delivery order data, production task data, or course data, etc. It should be understood that in this case, the relevant equipment can be an order processing device, task processing device, or course scheduling device corresponding to the schedule data, etc.

[0043] Specifically, the delivery order data, task generation data, or course data should all include at least start time information and end time information. Further, when the schedule data is delivery order data, the order processing device can use the schedule data processing method described in this embodiment to identify conflicting delivery order data from other normal delivery order data and display it to the delivery rider. When the schedule data is production task data, the task processing device can use the schedule data processing method described in this embodiment to identify conflicting production task data from other normal production task data and display it to the task assigner. When the schedule data is course data, the course scheduling device can use the schedule data processing method described in this embodiment to identify conflicting course data from other normal course data and display it to the scheduling teacher or enrolled students.

[0044] It should be understood that each step in this embodiment, namely steps S100-S400, can be executed by the vehicle system after receiving a loading command or update command from the driver for the schedule display interface, or after new schedule data is created under the driver's operation, to load or update the schedule display interface. Optionally, the loading command and update command can be triggered by the user by touching the corresponding virtual controls in the human-machine interface.

[0045] Specifically, Figure 7 This is a schematic diagram of the human-computer interaction interface according to an embodiment of the present invention. Figure 7 As shown, the human-machine interface 73 displays a schedule creation container 72 and a loading control 71. Furthermore, the driver can issue a loading command for the schedule display interface by clicking the loading control 71. Upon receiving the loading command, the vehicle system in this embodiment executes the schedule data processing method of this embodiment to determine and display the conflicting data set. Optionally, the corresponding display device for the human-machine interface can be configured in a corresponding location within the vehicle to facilitate the driver's use and viewing of the human-machine interface.

[0046] Furthermore, the schedule creation container 72 includes an information collection container 721 and a schedule data creation control 722. The driver can input relevant information into the information collection container 721 and click the schedule data creation control 722 to issue a creation command. Upon receiving the creation command, the vehicle system in this embodiment will create corresponding schedule data based on the information entered by the driver and store the created schedule data in the corresponding memory.

[0047] It should be understood that the pages, containers, pop-ups, or functional components displayed by the vehicle infotainment system can all be implemented using HTML (Hyper Text Markup Language), XML (Extensible Markup Language), CSS (Cascading Style Sheets), and JavaScript.

[0048] S200. Sort the schedule data in the schedule data set according to the preset sorting rules to determine the schedule data sequence.

[0049] Specifically, after acquiring the schedule data set, the vehicle system can sort the schedule data in the acquired schedule data set according to a preset sorting rule to determine the schedule data sequence. Specifically, the preset sorting rule can be to arrange the schedule data in chronological order of start and end times.

[0050] Figure 2 This is a flowchart of a schedule data sorting method according to an embodiment of the present invention, such as... Figure 2 As shown, the schedule data sorting method specifically includes the following steps:

[0051] S210. Sort the schedule data in the schedule data set according to the order of their start times.

[0052] S220. In response to the fact that the schedule data have the same start time, the schedule data with the same start time are sorted according to the order of their end times.

[0053] Specifically, the vehicle-mounted system can sort the schedule data in the schedule data set according to the order of their start times. For schedule data with the same start time, the vehicle-mounted system can sort them according to the order of their end times.

[0054] Taking schedule data A, B, and C as examples, schedule data A starts at 8:00 and ends at 9:10, schedule data B starts at 9:00 and ends at 9:30, and schedule data C starts at 9:00 and ends at 9:50. In this case, A can be placed before B according to the order of its start time. For schedule data B and C with the same start time, B can be placed before C according to the order of its end time.

[0055] S300: By comparing the attributes of adjacent schedule data in the schedule data sequence, schedule data that meet the conflict conditions are stored in the conflict data set.

[0056] Specifically, after determining the schedule data sequence, the vehicle-mounted system can store schedule data that meets the conflict conditions into a conflict data set by sequentially comparing the attributes of adjacent schedule data in the schedule data sequence. The conflict data set is used to store conflict data, which can specifically be schedule data that has time conflicts.

[0057] Optionally, comparing the attributes of adjacent schedule data can specifically involve comparing whether there is a time overlap between the start time and end time of adjacent schedule data. If so, it is determined that there is a time conflict; otherwise, it is determined that there is no time conflict.

[0058] It should be understood that, in the specific implementation process, a conflict can be determined by comparing the start time of the schedule data with the end time of the adjacent previous schedule data. Specifically, if the start time of the schedule data is earlier than the end time of the previous schedule data, a conflict can be determined between the schedule data and the previous schedule data; otherwise, no conflict is determined.

[0059] by Figure 5 Taking adjacent schedule data A and B in the schedule data sequence 52 as an example, schedule data A starts at 8:00 and ends at 9:10, while schedule data B starts at 9:00 and ends at 9:30. Schedule data B's start time is earlier than schedule data A's end time. Therefore, it can be determined that schedule data A and B conflict, i.e., the conflict condition is met.

[0060] Optionally, in practical applications, there may be situations where three or more consecutive schedule data points with time conflicts appear in the schedule data sequence. In this case, this embodiment also provides a method for storing and displaying schedule data with time conflicts in groups. Specifically, Figure 3 and 4 This is a flowchart of a conflict data set determination method according to an embodiment of the present invention. Based on step S300, the conflict data set determination method further stores conflicting schedule data in groups for subsequent display. Figure 3 As shown, the method for determining conflicting data sets specifically includes the following steps:

[0061] S310. Select the schedule data in the schedule data sequence in order.

[0062] Specifically, the vehicle system can select schedule data from the schedule data sequence in the order they are arranged.

[0063] Optionally, when the schedule data selected by the vehicle system is the first schedule data in the schedule data sequence, it can first save and confirm that the currently selected schedule data is not conflicting data, and then re-execute step S310 to select the next schedule data. It should be understood that when the schedule data selected by the vehicle system is not the first schedule data in the schedule data sequence, step S320 can continue to be executed.

[0064] S320. Determine whether the schedule data meets the conflict conditions.

[0065] Specifically, the vehicle system can determine whether the currently selected schedule data meets the conflict conditions. If so, step S330 is executed; otherwise, step S340 is executed.

[0066] Optionally, the vehicle system can determine whether the currently selected schedule data meets the conflict conditions based on the start time of the currently selected schedule data and the end time of the previous schedule data.

[0067] Specifically, if the vehicle system determines that the start time of the currently selected schedule data is later than the end time of the previous schedule data, then the currently selected schedule data is determined not to meet the conflict conditions. If the vehicle system determines that the start time of the currently selected schedule data is earlier than the end time of the previous schedule data, then the currently selected schedule data is determined to meet the conflict conditions.

[0068] S330. Determine whether the previous schedule data is conflicting data.

[0069] Specifically, when the vehicle system determines that the currently selected schedule data meets the conflict conditions, it can further determine whether the previous schedule data is conflict data. If so, step S350 is executed; otherwise, step S360 is executed.

[0070] S340. Determine whether the previous schedule data is conflicting data.

[0071] Specifically, when the vehicle system determines that the currently selected schedule data does not meet the conflict conditions, it can further determine whether the previous schedule data is conflict data. If so, it executes step S370; otherwise, it executes step S390.

[0072] S350. Identify the schedule data as conflict data and store it in a temporary conflict list.

[0073] Specifically, if the vehicle system determines that the currently selected schedule data meets the conflict criteria and the previous schedule data is conflicting data, it can identify the currently selected schedule data as conflicting data and store it in a temporary conflict list. This temporary conflict list is used to temporarily store conflicting data.

[0074] It should be understood that, given the premise of the judgment in step S350, the temporary conflict list already includes the previous schedule data. At this point, it is only necessary to determine the currently selected schedule data as conflict data and store it in the temporary conflict list.

[0075] S360: Identify the schedule data and the previous schedule data as conflict data and store them in a temporary conflict list.

[0076] Specifically, if the vehicle system determines that the currently selected schedule data meets the conflict conditions but the previous schedule data is not conflicting data, the schedule data and the previous schedule data can be identified as conflicting data and stored in a temporary conflict list.

[0077] It should be understood that, under the premise of the judgment in step S360, the temporary conflict list does not yet include the previous schedule data. At this time, it is necessary to determine the currently selected schedule data and the previous schedule data together as conflict data and store them in the temporary conflict list.

[0078] S370. Determine whether the start time of the schedule data is later than the end time of each conflict data in the temporary conflict list.

[0079] It should be understood that step 320 only compares whether there is a time conflict between adjacent schedule data. However, in a practical application scenario, if the currently selected schedule data does not meet the conflict criteria, but the previous schedule data is conflicting, the currently selected schedule data may have a time conflict with the previously selected schedule data.

[0080] by Figure 5 Taking schedule data F, G, and H in the schedule data sequence 52 as an example, schedule data F starts at 12:00 and ends at 13:00; schedule data G starts at 12:10 and ends at 12:20; and schedule data H starts at 12:40 and ends at 14:00. Although schedule data H does not conflict with schedule data G, it does conflict with schedule data F. To address this, the vehicle system can further determine whether the currently selected schedule data has a time conflict by comparing the start time of the currently selected schedule data with the end times of each conflicting data in the temporary conflict list.

[0081] Specifically, when the vehicle system determines that the currently selected schedule data does not meet the conflict conditions, but the previous schedule data is conflict data, it can further determine whether the start time of the currently selected schedule data is later than the end time of each conflict data in the temporary conflict list. If so, step S380 is executed; otherwise, step S3100 is executed.

[0082] S380. Store the conflict data in the temporary conflict list as a conflict subset into the conflict data set.

[0083] Specifically, if the vehicle system determines that the currently selected schedule data does not meet the conflict conditions, the previous schedule data is conflicting data, and the start time of the currently selected schedule data is later than the end time of each conflicting data in the temporary conflict list, the conflicting data in the temporary conflict list can be stored as a conflict subset in the conflict data set. The conflict subset is used to store consecutively occurring schedule data with mutual time conflicts in the conflict data set as a subset.

[0084] Optionally, the conflict subsets stored in this embodiment may include the start and end times corresponding to the conflicting data, for later display.

[0085] S390, Store the previous schedule data into the normal data set.

[0086] Specifically, if the vehicle system determines that the currently selected schedule data does not meet the conflict conditions, and the previous schedule data is not conflicting, the previous schedule data can be stored in the normal data set. The normal data set stores schedule data that do not conflict with each other. Optionally, the normal data set can be displayed together with the conflict data set in the schedule display interface, depending on actual needs.

[0087] S3100: Identify the schedule data as conflict data and store it in a temporary conflict list.

[0088] Specifically, if the vehicle system determines that the currently selected schedule data does not meet the conflict conditions and the previous schedule data is conflict data, but the start time of the currently selected schedule data is earlier than the end time of any of the conflict data in the temporary conflict list, then the currently selected schedule data can be identified as conflict data and stored in the temporary conflict list.

[0089] Furthermore, the method described in this embodiment performs the following... Figure 3 After steps S350, S360, S380, and S3100 as shown, further execution can be performed. Figure 4 The steps shown are used to determine whether all the schedule data in the schedule data sequence has been traversed.

[0090] S3110. Determine whether all schedule data has been traversed.

[0091] Specifically, the vehicle system determines whether all the schedule data in the schedule data sequence has been traversed. If so, it executes step S3120; otherwise, it re-executes step S310 to select the next schedule data.

[0092] S3120. Determine whether the final schedule data is conflicting data.

[0093] Specifically, the vehicle system determines whether the last schedule data in the schedule data sequence is conflicting data. If so, it executes step S3130; otherwise, it executes step S3140.

[0094] S3130. Store the conflict data in the temporary conflict list as a conflict subset into the conflict data set.

[0095] Specifically, if all the schedule data in the current schedule data sequence has been traversed, and the last schedule data is conflict data, the vehicle system can store the conflict data in the temporary conflict list as a conflict subset into the conflict data set.

[0096] S3140. Store the last schedule data into the normal data set.

[0097] Specifically, if all the schedule data in the current schedule data sequence has been traversed, and the last schedule data is not conflicting data, the vehicle system can store the last schedule data into the normal data set.

[0098] S400, Display the set of conflicting data.

[0099] Specifically, after determining the conflict data set, the vehicle-mounted system can display the conflicting data within the conflict data set on the schedule display interface. It should be understood that if there are conflicting subsets within the conflict data set, these subsets can be displayed as groups.

[0100] Optionally, the method described in this embodiment can further display the conflict time period corresponding to the conflict subset. The start time of the conflict time period can be the earliest start time of each conflicting data in the conflict subset, and the end time of the conflict time period can be the latest end time of each conflicting data in the conflict subset.

[0101] The schedule data processing method of this invention, after acquiring a schedule data set, sorts multiple schedule data in the schedule data set according to a preset sorting rule to determine a schedule data sequence. Then, by comparing the attributes of adjacent schedule data in the schedule data sequence, schedule data that meet the conflict conditions are stored in a conflict data set, and the conflict data set is displayed. This method can improve the efficiency of schedule data processing and increase the speed of interface loading and updating.

[0102] Figure 5 This is a schematic diagram of a schedule data sequence according to an embodiment of the present invention. Specifically, it can be represented as... Figure 5 The schedule data sequence pair shown Figure 3 and 4 The method for determining conflicting data sets in the process will be explained.

[0103] It should be understood that after acquiring the schedule data set 51, the vehicle system can sort the schedule data in the schedule data set 51 according to the order of their start times. For schedule data with the same start time, the vehicle system can sort them according to the order of their end times to determine the schedule data sequence 52. Furthermore, after determining the schedule data sequence 52, the vehicle system can execute... Figure 3 and 4 The method for determining conflicting data sets is used to identify conflicting data sets.

[0104] Specifically, select schedule data A. Schedule data A is the first schedule data in the schedule data sequence, and then select schedule data B.

[0105] If the start time of schedule data B is earlier than the end time of schedule data A, then schedule data B meets the conflict condition. Meanwhile, the previous schedule data A is not conflicting data. In this case, schedule data A and B are both identified as conflicting data and stored in a temporary conflict list. Then, schedule data C is selected.

[0106] The start time of schedule data C is earlier than the end time of schedule data B, meaning that schedule data C meets the conflict condition. At the same time, the previous schedule data B is conflict data. In this case, schedule data C is identified as conflict data and stored in the temporary conflict list, and schedule data D is selected next.

[0107] If the start time of schedule data D is later than the end time of schedule data C, meaning that schedule data D does not meet the conflict condition, and the previous schedule data C is conflict data, then it is further determined that the start time of schedule data D is later than the end time of each conflict data in the temporary conflict list. At this time, the temporary conflict list is stored as a conflict subset in the conflict data set, and schedule data E is selected again.

[0108] The start time of schedule data E is later than the end time of schedule data D, meaning that schedule data E does not meet the conflict condition. At the same time, the previous schedule data D is not conflicting data. In this case, schedule data D is stored in the normal data set, and schedule data F is selected next.

[0109] If the start time of schedule data F is later than the end time of schedule data E, then schedule data F does not meet the conflict condition. At the same time, the previous schedule data E is not conflicting data. In this case, schedule data E is stored in the normal data set, and schedule data G is selected.

[0110] If the start time of schedule data G is earlier than the end time of schedule data F, then schedule data G meets the conflict condition. At the same time, the previous schedule data F is not conflicting data. In this case, schedule data G and F are both identified as conflicting data and stored in the temporary conflict list. Then, schedule data H is selected.

[0111] If the start time of schedule data H is later than the end time of schedule data G, meaning schedule data H does not meet the conflict condition, but the previous schedule data G is conflicting data, then it is further determined that the start time of schedule data H is earlier than the end time of conflicting data F in the temporary conflict list. In this case, schedule data H is identified as conflicting data and stored in the temporary conflict list. If schedule data H is the last schedule data in the schedule data sequence and is conflicting data, the temporary conflict list is stored as a conflict subset in the conflict data set.

[0112] For ease of understanding, this embodiment is presented in... Figure 5 The time-series coordinates 53 shown display the schedule data in the form of coordinate axes, with the horizontal axis representing time. The time-series coordinates 53 detail the temporal overlap relationships between the schedule data.

[0113] Furthermore, such as Figure 5 As shown in the grouping diagram 54, the method described in this embodiment can display a first conflict subset 541 including conflict data A, B, and C, and a second conflict subset 542 including conflict data F, G, and H on the schedule display page. Optionally, the method described in this embodiment can also display a normal data set 543 including schedule data D and E on the schedule display page.

[0114] In practical applications, the schedule data stored in the vehicle system may also include irrelevant data such as the schedule data for the whole day, expired schedule data, and canceled schedule data.

[0115] In an optional implementation, the method of this embodiment may remove the aforementioned irrelevant data from the schedule data set before executing step S200. Specifically, the method of this embodiment may store schedule data in the schedule data set whose difference between the due date and start time is greater than or equal to a preset threshold into a full-day data set, store schedule data in the schedule data set whose due date is earlier than the current time into an expired data set, and store schedule data in the schedule data set marked as canceled into a canceled data set. The preset threshold may be 24 hours.

[0116] In another alternative implementation, the method described in this embodiment may also choose not to remove the aforementioned irrelevant data from the schedule data set first, but instead directly arrange the aforementioned irrelevant data at the beginning of the schedule data sequence, and then skip the aforementioned irrelevant data by setting judgment conditions during the process of determining the conflict data set.

[0117] Figure 6 This is another flowchart of the conflict data set determination method according to an embodiment of the present invention. As shown in Figure 6, the conflict data set determination method specifically includes the following steps:

[0118] S1000', Polling schedule data sequence.

[0119] Specifically, after the process begins, the schedule data sequence is polled, that is, schedule data in the schedule data sequence is selected according to the order of arrangement. It should be understood that in this embodiment, all-day schedule data and expired schedule data will be prioritized at the beginning of the schedule data sequence, and canceled schedule data can be arranged in the same way as normal schedule data.

[0120] S2000' Determine if the current schedule is an expired schedule.

[0121] Specifically, determine whether the currently selected schedule data is expired schedule data. If so, execute step S5000'; otherwise, execute step S3000'.

[0122] Optionally, if the deadline of the currently selected schedule data is earlier than the current time, then the currently selected schedule data can be determined to be expired schedule data.

[0123] S3000' Determines whether the current schedule is a full-day schedule.

[0124] Specifically, determine whether the currently selected schedule data is the schedule data for the whole day. If so, execute step S5000'; otherwise, execute step S4000'.

[0125] Optionally, if the difference between the end time and the start time of the currently selected schedule data is greater than or equal to a preset threshold, then the currently selected schedule data can be determined as full-day schedule data, and the preset threshold can be 24 hours.

[0126] S4000' Determine if the current schedule is a cancelled schedule.

[0127] Specifically, determine whether the currently selected schedule data is canceled schedule data. If so, execute step S6000'; otherwise, execute step S10000'.

[0128] Optionally, cancelled schedule data will be marked as cancelled. Step S4000' can determine whether the currently selected schedule data is cancelled by judging whether the currently selected schedule data is marked as cancelled.

[0129] S5000': Move the schedule into the corresponding set.

[0130] Specifically, all day's schedule data can be moved into the all day's data set, canceled schedule data can be moved into the canceled data set, and expired schedule data can be moved into the expired data set. Furthermore, after executing step S5000', you can jump back to step S1000'.

[0131] S6000' Determines whether the current schedule is the last schedule.

[0132] Specifically, determine whether the currently selected schedule data is the last schedule data in the schedule data sequence. If so, execute step S7000'; otherwise, execute step S5000'.

[0133] S7000' Determines if there is a conflict with the previous schedule.

[0134] Specifically, it is determined whether the previous schedule data is conflicting data. If so, step S9000' is executed; otherwise, step S8000' is executed. It should be understood that in this embodiment, the previous schedule data used for comparison refers to the schedule data that was previously selected as not being a full-day schedule, canceled schedule data, or expired schedule data.

[0135] S8000', the previous schedule is stored in the normal data set.

[0136] Specifically, the process ends by storing the data from the previous schedule or the last schedule in the schedule data sequence into the normal data set.

[0137] S9000', Temporary Conflict List stores the set of conflict data.

[0138] Specifically, the temporary conflict list is stored as a conflict subset in the conflict data set, and the process ends.

[0139] S10000' Determine if the current schedule is the first schedule.

[0140] Specifically, determine whether the currently selected schedule data is the first schedule data in the schedule data sequence. If so, execute step S11000'; otherwise, execute step S13000'.

[0141] S11000' Save the current schedule.

[0142] Specifically, save the selected schedule data to ensure it is not conflicting, and continue with step S12000.

[0143] S12000' Determine if the current schedule is the last schedule.

[0144] Specifically, determine whether the currently selected schedule data is the last schedule data in the schedule data sequence. If so, execute step S8000' to store the currently selected schedule data in the normal data set; otherwise, execute step S1000' to select the next schedule data.

[0145] S13000' Determines whether the current schedule meets the conflict conditions.

[0146] Specifically, determine whether the currently selected schedule data meets the conflict condition. If so, execute step S14000'; otherwise, execute step S16000'.

[0147] S14000' Store the schedule in a temporary conflict list.

[0148] Specifically, in step S14000', if the previous schedule data is conflicting data, then the currently selected schedule data is determined to be conflicting data and stored in the temporary conflict list. If the previous schedule data is not conflicting data, then both the currently selected schedule data and the previous schedule data are determined to be conflicting data and stored in the temporary conflict list. Further, after executing step S14000', step S15000' is executed.

[0149] S15000' Determine if the current schedule is the last schedule.

[0150] Specifically, determine whether the currently selected schedule data is the last schedule data in the schedule data sequence. If so, execute step S9000'; otherwise, execute step S1000'.

[0151] S16000' Determine if there is a conflict with the previous schedule.

[0152] Specifically, determine whether the previous schedule data is conflicting data. If so, execute step S17000'; otherwise, execute step S19000'.

[0153] S17000' Determines whether the start time of the current schedule is earlier than the deadline of any conflict data in the temporary conflict list.

[0154] Specifically, determine whether the start time of the currently selected schedule data is earlier than the end time of any conflict data in the temporary conflict list. If so, execute step S14000'; otherwise, execute step S18000'.

[0155] S18000', Temporary Conflict List stores the set of conflict data.

[0156] Specifically, the temporary conflict list is stored as a conflict subset in the conflict data set, and step S20000' is executed.

[0157] S19000', the previous schedule is stored in the normal data set.

[0158] Specifically, store the previous schedule data into the normal data set and continue with step S20000'.

[0159] S20000' Determines whether the current schedule is the last schedule.

[0160] Specifically, determine whether the currently selected schedule data is the last schedule data in the schedule data sequence. If so, execute step S8000'; otherwise, execute step S21000'.

[0161] S21000' Save the current schedule.

[0162] Specifically, save the selected schedule data to ensure it is not conflicting, and continue with step S1000'.

[0163] Figure 8 This is a schematic diagram of a schedule data processing device according to an embodiment of the present invention. Figure 8 As shown, the schedule data processing device of this embodiment includes an acquisition unit 81, a sorting unit 82, a comparison unit 83, and a display unit 84.

[0164] Specifically, the acquisition unit 81 is used to acquire a schedule data set, which includes multiple schedule data, each of which has corresponding start time information and end time information;

[0165] The sorting unit 82 is used to sort the schedule data in the schedule data set according to a preset sorting rule to determine the schedule data sequence;

[0166] The comparison unit 83 is used to store the schedule data that meets the conflict conditions into the conflict data set by comparing the attributes of adjacent schedule data in the schedule data sequence.

[0167] The display unit 84 is used to display the conflict data set.

[0168] Further, the sorting unit includes:

[0169] The first sorting subunit is used to sort the schedule data in the schedule data set according to the order of their start times.

[0170] The second sorting subunit, in response to the fact that the schedule data have the same start time, sorts the schedule data with the same start time according to the order of their end times.

[0171] Further, the comparison unit includes:

[0172] The conflict determination unit is used to determine whether each schedule data in the schedule data sequence meets the conflict condition based on the end time of the previous schedule data and the start time of the schedule data.

[0173] The first data determination unit is configured to determine the schedule data as conflict data and store it in a temporary conflict list in response to determining that the schedule data meets the conflict conditions and that the previous schedule data is conflict data.

[0174] The second data determination unit is configured to, in response to determining that the schedule data meets the conflict conditions and that the previous schedule data is not conflict data, determine the schedule data and the previous schedule data as conflict data and store them in the temporary conflict list.

[0175] The third data determination unit is used to, in response to determining that the schedule data does not meet the conflict conditions, the previous schedule data is conflict data, and the start time of the schedule data is later than the end time of each conflict data in the temporary conflict list, store the conflict data in the temporary conflict list as a conflict subset into the conflict data set.

[0176] The fourth data determination unit is used to determine the schedule data as conflict data and store it in the temporary conflict list in response to determining that the schedule data does not meet the conflict conditions, the previous schedule data is conflict data, but the start time of the schedule data is earlier than the end time of any conflict data in the temporary conflict list.

[0177] The fifth data determination unit is used to store the previous schedule data into the normal data set in response to determining that the schedule data does not meet the conflict conditions and that the previous schedule data is not conflict data.

[0178] Furthermore, the conflict determination unit includes:

[0179] The first conflict determination subunit is used to determine that the schedule data does not meet the conflict condition in response to the start time of the schedule data being later than the end time of the previous schedule data.

[0180] The second conflict determination subunit is used to determine that the schedule data meets the conflict condition in response to the start time of the schedule data being earlier than the end time of the previous schedule data.

[0181] Furthermore, the comparison unit further includes:

[0182] The first judgment unit is used to respond to the fact that each schedule data in the schedule data sequence has been traversed and the last schedule data in the schedule data sequence is conflict data, and to store the conflict data in the temporary conflict list as a conflict subset into the conflict data set.

[0183] The second judgment unit is used to store the last schedule data in the normal data set in response to the fact that all schedule data in the schedule data sequence has been traversed and the last schedule data in the schedule data sequence is not conflicting data.

[0184] Furthermore, the comparison unit further includes:

[0185] The third determination unit is used to determine that the schedule data is not conflicting data in response to the fact that the schedule data is the first schedule data in the schedule data sequence.

[0186] Furthermore, the display unit is configured as follows:

[0187] The conflict subsets in the conflict data set are displayed. Each conflict subset includes conflicting conflict data and a start time and end time corresponding to each conflict data.

[0188] Furthermore, the device also includes:

[0189] The first filtering unit is used to store the schedule data in the schedule data set whose difference between the end time and the start time is greater than or equal to a preset threshold into the full-day data set.

[0190] The second filtering unit is used to store schedule data with a due date earlier than the current time in the schedule data set into the expired data set; and

[0191] The third filtering unit is used to store the schedule data marked as canceled in the schedule data set into the canceled data set.

[0192] After acquiring a schedule data set, the schedule data processing device of this invention sorts multiple schedule data in the schedule data set according to a preset sorting rule to determine a schedule data sequence. Then, by comparing the attributes of adjacent schedule data in the schedule data sequence, schedule data that meet the conflict conditions are stored in a conflict data set, and the conflict data set is displayed. This device can improve schedule data processing efficiency and increase interface loading and update speed.

[0193] Figure 9 This is a schematic diagram of an electronic device according to an embodiment of the present invention. Figure 9As shown, the electronic device is a general-purpose data processing device, which includes a general-purpose computer hardware structure, including at least a processor 91 and a memory 92. The processor 91 and the memory 92 are connected via a bus 93. The memory 92 is adapted to store instructions or programs executable by the processor 91. The processor 91 can be a standalone microprocessor or a collection of one or more microprocessors. Thus, the processor 91 executes the instructions stored in the memory 92 to perform the method flow of the embodiments of the present invention as described above, thereby realizing data processing and control of other devices. The bus 93 connects the above-mentioned components together, and also connects the above-mentioned components to a display controller 94, a display device, and an input / output (I / O) device 95. The input / output (I / O) device 95 can be a mouse, keyboard, modem, network interface, touch input device, motion-sensing input device, printer, and other devices known in the art. Typically, the input / output device 95 is connected to the system via an input / output (I / O) controller 96.

[0194] Those skilled in the art will understand that embodiments of this application can be provided as methods, apparatus (devices), or computer program products. Therefore, this application can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, this application can take the form of a computer program product embodied on one or more computer-readable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0195] This application is described with reference to flowchart illustrations of methods, apparatus (devices), and computer program products according to embodiments of this application. It should be understood that each step in the flowchart can be implemented by computer program instructions.

[0196] These computer program instructions may be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including an instruction means, the implementation process of which is described in the instruction means. Figure 1 The function specified in one or more processes.

[0197] These computer program instructions may also be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing device to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing device, produce instructions for implementing processes. Figure 1 A device for a function specified in one or more processes.

[0198] Another embodiment of the present invention relates to a non-volatile storage medium for storing a computer-readable program for use by a computer to execute some or all of the above-described method embodiments.

[0199] That is, those skilled in the art will understand that all or part of the steps in the methods of the above embodiments can be implemented by specifying the relevant hardware through a program. This program is stored in a storage medium and includes several instructions to cause a device (which may be a microcontroller, chip, etc.) or processor to execute all or part of the steps of the methods described in the embodiments of this application. The aforementioned storage medium includes various media capable of storing program code, such as a USB flash drive, a portable hard drive, a read-only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disk.

[0200] The above description is merely a preferred embodiment of the present invention and is not intended to limit the invention. For those skilled in the art, the present invention can be modified and varied in various ways. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principle of the present invention should be included within the scope of protection of the present invention.

Claims

1. A method for processing schedule data, characterized in that, The method includes: Obtain a schedule data set, which includes multiple schedule data sets, each of which has corresponding start time information and end time information; The schedule data in the schedule data set is sorted according to a preset sorting rule to determine the schedule data sequence; Schedules that meet the conflict criteria are stored in a conflict data set by comparing the attributes of adjacent schedules in the schedule data sequence; the conflict data set is then displayed. The step of sorting the schedule data in the schedule data set according to a preset sorting rule includes: The schedule data in the schedule data set is sorted according to the order of its start time; In response to the fact that the schedule data have the same start time, the schedule data with the same start time are sorted according to the order of their end times; The step of storing schedule data that meets the conflict condition into a conflict data set by comparing the attributes of adjacent schedule data in the schedule data sequence includes: For each schedule data in the schedule data sequence, it is determined whether the schedule data meets the conflict condition based on the end time of the previous schedule data and the start time of the schedule data. In response to determining that the schedule data meets the conflict conditions and that the previous schedule data is conflict data, the schedule data is identified as conflict data and stored in a temporary conflict list; In response to determining that the schedule data meets the conflict conditions and that the previous schedule data is not conflict data, the schedule data and the previous schedule data are identified as conflict data and stored in the temporary conflict list; In response to determining that the schedule data does not meet the conflict conditions, the previous schedule data is conflict data, and the start time of the schedule data is later than the end time of each conflict data in the temporary conflict list, the conflict data in the temporary conflict list is stored as a conflict subset into the conflict data set. In response to determining that the schedule data does not meet the conflict conditions, the previous schedule data is conflict data, but the start time of the schedule data is earlier than the end time of any conflict data in the temporary conflict list, the schedule data is determined to be conflict data and stored in the temporary conflict list. In response to determining that the schedule data does not meet the conflict conditions and that the previous schedule data is not conflicting data, the previous schedule data is stored in the normal data set.

2. The method according to claim 1, characterized in that, Determining whether the schedule data meets the conflict conditions based on the end time of the previous schedule data and the start time of the schedule data includes: In response to the fact that the start time of the schedule data is later than the end time of the previous schedule data, it is determined that the schedule data does not meet the conflict condition; In response to the fact that the start time of the schedule data is earlier than the end time of the previous schedule data, it is determined that the schedule data meets the conflict condition.

3. The method according to claim 1, characterized in that, The method further includes: In response to the fact that each schedule data in the schedule data sequence has been traversed and the last schedule data in the schedule data sequence is conflict data, the conflict data in the temporary conflict list is stored as a conflict subset in the conflict data set. In response to the fact that all schedule data in the schedule data sequence has been traversed and the last schedule data in the schedule data sequence is not conflicting data, the last schedule data is stored in the normal data set.

4. The method according to claim 1, characterized in that, The method further includes: In response to the fact that the schedule data is the first schedule data in the schedule data sequence, it is determined that the schedule data is not conflicting data.

5. The method according to claim 3, characterized in that, The conflict data set shown includes: The conflict subsets in the conflict data set are displayed. Each conflict subset includes conflicting conflict data and a start time and end time corresponding to each conflict data.

6. The method according to claim 1, characterized in that, The method further includes: Schedule data in the schedule data set whose difference between the end time and the start time is greater than or equal to a preset threshold are stored in the full-day data set; Store schedules with due dates earlier than the current time in the schedule data set into the expired data set; and The schedule data marked as canceled in the schedule data set is stored in the canceled data set.

7. A schedule data processing device, characterized in that, The device includes: An acquisition unit is used to acquire a schedule data set, which includes multiple schedule data, each of which has corresponding start time information and end time information; a sorting unit is used to sort the schedule data in the schedule data set according to a preset sorting rule to determine a schedule data sequence. A comparison unit is used to store schedule data that meets the conflict conditions into a conflict data set by comparing the attributes of adjacent schedule data in the schedule data sequence. A display unit is used to display the conflict data set; The sorting unit includes: The first sorting subunit is used to sort the schedule data in the schedule data set according to the order of their start times. The second sorting subunit is used to sort the schedule data with the same start time according to the order of their end times in response to the same start time. The comparison unit includes: The conflict determination unit is used to determine whether each schedule data in the schedule data sequence meets the conflict condition based on the end time of the previous schedule data and the start time of the schedule data. The first data determination unit is configured to determine the schedule data as conflict data and store it in a temporary conflict list in response to determining that the schedule data meets the conflict conditions and that the previous schedule data is conflict data. The second data determination unit is configured to, in response to determining that the schedule data meets the conflict conditions and that the previous schedule data is not conflict data, determine the schedule data and the previous schedule data as conflict data and store them in the temporary conflict list. The third data determination unit is used to, in response to determining that the schedule data does not meet the conflict conditions, the previous schedule data is conflict data, and the start time of the schedule data is later than the end time of each conflict data in the temporary conflict list, store the conflict data in the temporary conflict list as a conflict subset into the conflict data set. The fourth data determination unit is used to determine the schedule data as conflict data and store it in the temporary conflict list in response to determining that the schedule data does not meet the conflict conditions, the previous schedule data is conflict data, but the start time of the schedule data is earlier than the end time of any conflict data in the temporary conflict list. The fifth data determination unit is used to store the previous schedule data into the normal data set in response to determining that the schedule data does not meet the conflict conditions and that the previous schedule data is not conflict data.

8. The apparatus according to claim 7, characterized in that, The conflict determination unit includes: The first conflict determination subunit is used to determine that the schedule data does not meet the conflict condition in response to the start time of the schedule data being later than the end time of the previous schedule data. The second conflict determination subunit is used to determine that the schedule data meets the conflict condition in response to the start time of the schedule data being earlier than the end time of the previous schedule data.

9. The apparatus according to claim 7, characterized in that, The comparison unit further includes: The first judgment unit is used to respond to the fact that each schedule data in the schedule data sequence has been traversed and the last schedule data in the schedule data sequence is conflict data, and to store the conflict data in the temporary conflict list as a conflict subset into the conflict data set. The second judgment unit is used to store the last schedule data in the normal data set in response to the fact that all schedule data in the schedule data sequence has been traversed and the last schedule data in the schedule data sequence is not conflicting data.

10. The apparatus according to claim 7, characterized in that, The comparison unit further includes: The third determination unit is used to determine that the schedule data is not conflicting data in response to the fact that the schedule data is the first schedule data in the schedule data sequence.

11. The apparatus according to claim 9, characterized in that, The display unit is configured as follows: The conflict subsets in the conflict data set are displayed. Each conflict subset includes conflicting conflict data and a start time and end time corresponding to each conflict data.

12. The apparatus according to claim 7, characterized in that, The device further includes: The first filtering unit is used to store the schedule data in the schedule data set whose difference between the end time and the start time is greater than or equal to a preset threshold into the full-day data set. The second filtering unit is used to store schedule data with a due date earlier than the current time in the schedule data set into the expired data set; and The third filtering unit is used to store the schedule data marked as canceled in the schedule data set into the canceled data set.

13. A computer-readable storage medium storing computer program instructions thereon, characterized in that, The computer program instructions, when executed by a processor, implement the method as described in any one of claims 1-6.

14. An electronic device, characterized in that, The device includes: Memory is used to store one or more computer program instructions; A processor, wherein the one or more computer program instructions are executed by the processor to implement the method as described in any one of claims 1-6.

Images