Advertisement
Dimitrija

Распоредувач на задачи (30 поени)

Feb 13th, 2022
901
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Java 3.24 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> order = scheduler.schedule(tasks);
  44.         order.forEach(System.out::println);
  45.     }
  46. }
  47.  
  48. interface TaskScheduler<T extends Task> {
  49.     List<T> schedule(T[] tasks);
  50. }
  51.  
  52. interface Task extends Comparable<Task> {
  53.     //dopolnete ovde
  54.     int getOrder();
  55.    
  56.     default int compareTo( Task o) {
  57.         return Integer.compare(getOrder(),o.getOrder());
  58.     }
  59. }
  60.  
  61. class PriorityTask implements Task {
  62.     private final int priority;
  63.  
  64.     public PriorityTask(int priority) {
  65.         this.priority = priority;
  66.     }
  67.  
  68.  
  69.     @Override
  70.     public String toString() {
  71.         return String.format("PT -> %d", getOrder());
  72.     }
  73.  
  74.     @Override
  75.     public int getOrder() {
  76.         return priority;
  77.     }
  78. }
  79.  
  80. class TimedTask implements Task {
  81.     private final int time;
  82.  
  83.     public TimedTask(int time) {
  84.         this.time = time;
  85.     }
  86.  
  87.  
  88.     @Override
  89.     public String toString() {
  90.         return String.format("TT -> %d", getOrder());
  91.     }
  92.  
  93.     @Override
  94.     public int getOrder() {
  95.         return time;
  96.     }
  97. }
  98.  
  99. class Schedulers {
  100.     public static <T extends Task> TaskScheduler<T> getOrdered() {
  101.  
  102.         // vashiot kod ovde (annonimous class)
  103.         return  new TaskScheduler<T>() {
  104.             @Override
  105.             public List<T> schedule(T[] tasks) {
  106.                 return Arrays.stream(tasks).sorted().collect(Collectors.toList());
  107.             }
  108.         };
  109.  
  110.  
  111.     }
  112.  
  113.     public static <T extends Task> TaskScheduler<T> getFiltered(int order) {
  114.  
  115.         // vashiot kod ovde (lambda expression)
  116.         return (task) -> Arrays.stream(task).filter(x->x.getOrder()<order).collect(Collectors.toList());
  117.  
  118.     }
  119. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement