public static int dominance(final int[] u, final int[] v) {
		checkLength(u.length, v.length);

		return dominance(
			u, v, u.length, (a, b, i) -> Integer.compare(a[i], b[i])
		);
	}
public static int dominance ( final int [ ] u , final int [ ] v ) { checkLength ( u . length , v . length ) ; return dominance ( u , v , u . length , ( a , b , i ) -> Integer . compare ( a [ i ] , b [ i ] ) ) ; }
Calculates the <a href="https://en.wikipedia.org/wiki/Pareto_efficiency">
<b>Pareto Dominance</b></a> of the two vectors <b>u</b> and <b>v</b>.

@see Vec#dominance(int[], int[])

@param u the first vector
@param v the second vector
@return {@code 1} if <b>u</b> ≻ <b>v</b>, {@code -1} if <b>v</b> ≻
<b>u</b> and {@code 0} otherwise
@throws NullPointerException if one of the arguments is {@code null}
@throws IllegalArgumentException if {@code u.length != v.length}