Question

我有一批物体,每个物体都有一片骨肉。鉴于情况暗淡,我想在最接近的收集中找到目标。

这里,我今天所做的是:

public static void Search(int frameNumber)
{
    var differences = (from rec in _records
                       select new { FrameDiff = Math.Abs(rec.Frame - frameNumber), Record = rec }).OrderBy(x => x.FrameDiff);

    var closestRecord = differences.FirstOrDefault().Record;

    //continue work...
}

这是巨大的,除了我收集的200 000件物品外,我经常使用这种方法。这样做是否有相对容易、更有效率的途径?

Answer 1

var closestRecord = _records.MinBy(rec => Math.Abs(rec.Frame - frameNumber));

http://code.google.com/p/morelinq/“rel=“nofollow noreferer”>MoreLINQ。

Answer 2

您不妨尝试的是,将框架储存在一个按<代码>分类的数据结构中。 Frame。然后,当你需要找到最接近某个基准区时,你可以进行双双轨搜查。

Answer 3

我不知道,我会为此使用准则,至少不用按顺序。

static Record FindClosestRecord(IEnumerable<Record> records, int number)
{
    Record closest = null;
    int leastDifference = int.MaxValue;

    foreach (Record record in records)
    {
        int difference = Math.Abs(number - record.Frame);
        if (difference == 0)
        {
            return record; // exact match, return early
        }
        else if (difference < leastDifference)
        {
            leastDifference = difference;
            closest = record;
        }
    }

    return closest;
}

Answer 4

你可以把发言合并成一席:

var closestRecord = (from rec in _records
                   select new { FrameDiff = Math.Abs(rec.Frame - frameNumber), 
                   Record = rec }).OrderBy(x => x.FrameDiff).FirstOrDefault().Record;

Answer 5

您能否将贵重项目清单分为五、十小小小名单,这些名单是由其分裂主义者或某些人下令的?

如果你知道哪一个名单需要找寻,这种搜查就会更快。

友情链接