@@ -0,0 +1,1393 @@
+package ru.ifmo.nds;%0A%0Aimport java.io.IOException;%0Aimport java.util.Random;%0A%0Apublic class RunTestInfinitely %7B%0A    private static void run(NonDominatedSorting sorting, double%5B%5D%5B%5D%5B%5D tests, int%5B%5D ranks) throws IOException %7B%0A        while (System.in.available() == 0) %7B%0A            long t0 = System.nanoTime();%0A            int sum = 0;%0A            for (double%5B%5D%5B%5D test : tests) %7B%0A                sorting.sort(test, ranks);%0A                for (int i : ranks) sum += i;%0A            %7D%0A            long time = System.nanoTime() - t0;%0A            System.out.println(%22Time %22 + (time / 1e9) + %22 s, checksum %22 + sum);%0A        %7D%0A    %7D%0A%0A    public static void main(String%5B%5D args) throws IOException %7B%0A        NonDominatedSortingFactory factory = IdCollection.getNonDominatedSortingFactory(args%5B0%5D);%0A        int n = Integer.parseInt(args%5B1%5D);%0A        int d = Integer.parseInt(args%5B2%5D);%0A        int count = Integer.parseInt(args%5B3%5D);%0A%0A        double%5B%5D%5B%5D%5B%5D tests = new double%5Bcount%5D%5Bn%5D%5Bd%5D;%0A        int%5B%5D ranks = new int%5Bn%5D;%0A        Random random = new Random(8234925);%0A%0A        for (int i = 0; i %3C count; ++i) %7B%0A            for (int j = 0; j %3C n; ++j) %7B%0A                for (int k = 0; k %3C d; ++k) %7B%0A                    tests%5Bi%5D%5Bj%5D%5Bk%5D = random.nextDouble();%0A                %7D%0A            %7D%0A        %7D%0A%0A        NonDominatedSorting sorting = factory.getInstance(n, d);%0A        run(sorting, tests, ranks);%0A    %7D%0A%7D%0A

Add a coarse testing facility to run some tests infinitely many times.