Advertisement
dzocesrce

[NP] Task Scheduler

Apr 17th, 2025
270
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Java 3.12 KB | None | 0 0
  1. import java.util.Arrays;
  2. import java.util.Comparator;
  3. import java.util.List;
  4. import java.util.Scanner;
  5. import java.util.stream.Collectors;
  6.  
  7. /**
  8.  * I Partial exam 2016
  9.  */
  10. public class TaskSchedulerTest {
  11.     public static void main(String[] args) {
  12.         Scanner scanner = new Scanner(System.in);
  13.         int n = scanner.nextInt();
  14.         Task[] timeTasks = new Task[n];
  15.         for (int i = 0; i < n; ++i) {
  16.             int x = scanner.nextInt();
  17.             timeTasks[i] = new TimedTask(x);
  18.         }
  19.         n = scanner.nextInt();
  20.         Task[] priorityTasks = new Task[n];
  21.         for (int i = 0; i < n; ++i) {
  22.             int x = scanner.nextInt();
  23.             priorityTasks[i] = new PriorityTask(x);
  24.         }
  25.         Arrays.stream(priorityTasks).forEach(System.out::println);
  26.         TaskRunner<Task> runner = new TaskRunner<>();
  27.         System.out.println("=== Ordered tasks ===");
  28.         System.out.println("Timed tasks");
  29.         runner.run(Schedulers.getOrdered(), timeTasks);
  30.         System.out.println("Priority tasks");
  31.         runner.run(Schedulers.getOrdered(), priorityTasks);
  32.         int filter = scanner.nextInt();
  33.         System.out.printf("=== Filtered time tasks with order less then %d ===\n", filter);
  34.         runner.run(Schedulers.getFiltered(filter), timeTasks);
  35.         System.out.printf("=== Filtered priority tasks with order less then %d ===\n", filter);
  36.         runner.run(Schedulers.getFiltered(filter), priorityTasks);
  37.         scanner.close();
  38.     }
  39. }
  40.  
  41. class TaskRunner<T extends Task> {
  42.     public void run(TaskScheduler<T> scheduler, T[] tasks) {
  43.         List<T> ordered = scheduler.schedule(tasks);
  44.         ordered.forEach(System.out::println);
  45.     }
  46. }
  47.  
  48. interface TaskScheduler<T extends Task> {
  49.     List<T> schedule(T[] tasks);
  50. }
  51.  
  52. interface Task {
  53.     int getOrder();
  54. }
  55.  
  56. class PriorityTask implements Task {
  57.     private final int priority;
  58.  
  59.     public PriorityTask(int priority) {
  60.         this.priority = priority;
  61.     }
  62.  
  63.     @Override
  64.     public int getOrder() {
  65.         return priority;
  66.     }
  67.  
  68.     @Override
  69.     public String toString() {
  70.         return String.format("PT -> %d", getOrder());
  71.     }
  72. }
  73.  
  74. class TimedTask implements Task {
  75.     private final int time;
  76.  
  77.     public TimedTask(int time) {
  78.         this.time = time;
  79.     }
  80.  
  81.     @Override
  82.     public int getOrder() {
  83.         return time;
  84.     }
  85.  
  86.     @Override
  87.     public String toString() {
  88.         return String.format("TT -> %d", getOrder());
  89.     }
  90. }
  91.  
  92. class Schedulers {
  93.     public static <T extends Task> TaskScheduler<T> getOrdered() {
  94.         return new TaskScheduler<T>() {
  95.             @Override
  96.             public List<T> schedule(T[] tasks) {
  97.                 return Arrays.stream(tasks)
  98.                         .sorted(Comparator.comparingInt(Task::getOrder))
  99.                         .collect(Collectors.toList());
  100.             }
  101.         };
  102.     }
  103.  
  104.     public static <T extends Task> TaskScheduler<T> getFiltered(int order) {
  105.         return tasks -> Arrays.stream(tasks)
  106.                 .filter(t -> t.getOrder() < order)
  107.                 .collect(Collectors.toList());
  108.     }
  109. }
  110.  
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement