public static <T> Ordering<T> explicit(T leastValue, T... remainingValuesInOrder) {
    return explicit(Lists.asList(leastValue, remainingValuesInOrder));
  }

  // Ordering<Object> singletons

  /**
   * Returns an ordering which treats all values as equal, indicating "no ordering." Passing this
   * ordering to any <i>stable</i> sort algorithm results in no change to the order of elements.

I suppose?'

  `Yes,' said Alice doubtfully:  `it means--to--make--anything--prettier.'

  `Well, then,' the Gryphon went on, `if you don't know what to
uglify is, you ARE a simpleton.'

  Alice did not feel encouraged to ask any more questions about
it, so she turned to the Mock Turtle, and said `What else had you
to learn?'

  `Well, there was Mystery,' the Mock Turtle replied, counting

Predef$ArrowAssoc$(); } scala/Predef$.class package scala; public final synchronized class Predef$ extends LowPriorityImplicits { public static final Predef$ MODULE$; private final collection.immutable.Set$ Set; private final Predef$$less$colon$less singleton_$less$colon$less; public static void <clinit>(); public final collection.immutable.Set$ Set(); public static void assert(boolean); public static void require(boolean); public static Object any2ArrowAssoc(Object); public static void println(Object);...