本文整理汇总了C#中KeyValuePair.StableSort方法的典型用法代码示例。如果您正苦于以下问题：C# KeyValuePair.StableSort方法的具体用法？C# KeyValuePair.StableSort怎么用？C# KeyValuePair.StableSort使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类KeyValuePair的用法示例。
在下文中一共展示了KeyValuePair.StableSort方法的1个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C#代码示例。
示例1: LineSearch
// targetArr and predArr are not changed by LineSearch
public double LineSearch(double[] targetArr, double[] predArr, int[] idx, int startIdx, int endIdx) {
if (targetArr.Length != predArr.Length)
throw new ArgumentException("target and pred have different lengths");
// line search for relative error
// weighted median (weight = 1/target)
int nRows = endIdx - startIdx + 1; // startIdx and endIdx are inclusive
if (nRows == 1) return targetArr[idx[startIdx]] - predArr[idx[startIdx]]; // res
else if (nRows == 2) {
// weighted average of two residuals
var w0 = Math.Abs(1.0 / targetArr[idx[startIdx]]);
var w1 = Math.Abs(1.0 / targetArr[idx[endIdx]]);
if (w0 > w1) {
return targetArr[idx[startIdx]] - predArr[idx[startIdx]];
} else if (w0 < w1) {
return targetArr[idx[endIdx]] - predArr[idx[endIdx]];
} else {
// same weight -> return average of both residuals
return ((targetArr[idx[startIdx]] - predArr[idx[startIdx]]) + (targetArr[idx[endIdx]] - predArr[idx[endIdx]])) / 2;
}
} else {
// create an array of key-value pairs to be sorted (instead of using Array.Sort(res, weights))
var res_w = new KeyValuePair<double, double>[nRows];
var totalWeight = 0.0;
for (int i = startIdx; i <= endIdx; i++) {
int row = idx[i];
var res = targetArr[row] - predArr[row];
var w = Math.Abs(1.0 / targetArr[row]);
res_w[i - startIdx] = new KeyValuePair<double, double>(res, w);
totalWeight += w;
}
// TODO: improve efficiency (find median without sort)
res_w.StableSort((a, b) => Math.Sign(a.Key - b.Key));
int k = 0;
double sum = totalWeight - res_w[k].Value; // total - first weight
while (sum > totalWeight / 2) {
k++;
sum -= res_w[k].Value;
}
return res_w[k].Key;
}
}