return no_op();

    // For vectors, shuffle values by sorting instead of the obvious
    // Fisher-Yates algorithm. Fisher-Yates is simple to implement and correct,
    // but not easily parallelizable. For a sufficiently parallel architecture,
    // it is faster to sort many times, than Fisher-Yates shuffle once.
    if (input_rank == 1) {
      // Shuffle values by assigning each value a random key and sorting the

 public abstract synchronized class Ordering { private static final String CONSTRUCTOR_ERROR_FORMAT = Ordering class %s should have a public constructor with signature %s(Ordering.Context context); public void Ordering(); public static Ordering shuffledBy(java.util.Random); public static Ordering definedBy(Class, org.junit.runner.Description) throws InvalidOrderingExcep; public static Ordering definedBy(Ordering$Factory, org.junit.runner.Description) throws InvalidOrderingExcep; private static String...