code: public static <T> int[] rank(final Seq<? extends Vec<T>> set) {
  		return rank(set, Vec::dominance);
  	}
docs: Calculates the <em>non-domination</em> rank of the given input {@code set},
  using the <em>natural</em> order of the elements as <em>dominance</em>
  measure.
  
  @apiNote
  Calculating the rank has a time complexity of {@code O(n^2}, where
  {@code n} the {@code set} size.
  
  <p>
  <b>Reference:</b><em>
  Kalyanmoy Deb, Associate Member, IEEE, Amrit Pratap,
  Sameer Agarwal, and T. Meyarivan.
  A Fast and Elitist Multiobjective Genetic Algorithm: NSGA-II,
  IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, VOL. 6, NO. 2,
  APRIL 2002.</em>
  
  @param set the input set
  @param <T> the element type
  @return the <em>non-domination</em> rank of the given input {@code set}