long function ( final SortedSet < Pair < Number , USet >> arg0 , final USet arg1 ) { long loc0 = 0l ; int loc1 = 0 ; for ( final Pair < Number , USet > loc2 : arg0 ) { if ( loc2 . getRight ( ) != arg1 ) { ++ loc1 ; } else { loc0 += loc1 ; } } return loc0 ; }
calculates the u-statistic associated with the one-sided hypothesis that `` dominator '' stochastically dominates the other u-set . note that if s1 dominates s2 , we want to count the occurrences of points in s2 coming before points in s1 . concode_field_sep ExactMode exactMode concode_elem_sep SortedSet<Pair<Number,USet>> observations concode_elem_sep NormalDistribution STANDARD_NORMAL concode_elem_sep NormalDistribution APACHE_NORMAL concode_elem_sep int sizeSet2 concode_elem_sep long serialVersionUID concode_elem_sep int sizeSet1 concode_elem_sep double LNSQRT2PI concode_field_sep void add concode_elem_sep Pair<Double,Double> calculatePNormalApproximation concode_elem_sep double getZApprox concode_elem_sep int compare concode_elem_sep int compare concode_elem_sep Pair<Double,Double> calculatePRecursively concode_elem_sep double cpr concode_elem_sep Pair<Double,Double> runOneSidedTest concode_elem_sep Pair<Double,Double> runOneSidedTest concode_elem_sep Pair<Double,Double> calculateP concode_elem_sep double cumulativeCPR concode_elem_sep Pair<Double,Double> calculatePFromTable concode_elem_sep SortedSet<Pair<Number,USet>> getObservations