private static MaxAt[] MaxIncreasingQuerySequenceOptimal(IReadOnlyList <MatchedWith> matches, double maxGap, out int max, out int maxIndex)
{
var maxs = matches.Select(_ => new MaxAt(1, _)).ToArray();
var dp = new MatchedWith[matches.Count];
int len = 0;
max = 1;
maxIndex = 0;
var comparer = Comparer <MatchedWith> .Create((a, b) => a.QuerySequenceNumber.CompareTo(b.QuerySequenceNumber));
for (int j = 0; j < matches.Count; ++j)
{
var x = matches[j];
int i = Array.BinarySearch(dp, 0, len, x, comparer);
if (i < 0)
{
i = -(i + 1);
}
if (i > 0 && !IsSameSequence(dp[i - 1], x, maxGap))
{
continue;
}
if (i == 0 && dp[i] != null && !IsSameSequence(dp[0], x, maxGap))
{
continue;
}
dp[i] = x;
if (i >= len - 1)
{
// the sequence has increased or found an equal element at the very end
len = i == len ? len + 1 : len;
maxs[j] = new MaxAt(len, x);
maxIndex = j;
}
else
{
// the sequence does not increase
maxs[j] = new MaxAt(i + 1, x);
}
}
max = maxs[maxIndex].Length;
return(maxs);
}
private static bool IsSameSequence(MaxAt a, MaxAt b, double maxGap)
{
return(IsSameSequence(a.MatchedWith, b.MatchedWith, maxGap));
}
private static bool EqualMaxLength(MaxAt current, MaxAt lookAhead)
{
return(current.Length == lookAhead.Length);
}
private static MaxAt GetBestByScore(MaxAt current, MaxAt lookAhead)
{
return(current.MatchedWith.Score < lookAhead.MatchedWith.Score ? lookAhead : current);
}
private static bool EqualTrackSequence(MaxAt current, MaxAt lookAhead)
{
return(current.MatchedWith.TrackSequenceNumber == lookAhead.MatchedWith.TrackSequenceNumber);
}
private static bool IsQuerySequenceIncreasing(MaxAt lookAhead, MaxAt lastPicked)
{
return(lookAhead.MatchedWith.QuerySequenceNumber >= lastPicked?.MatchedWith.QuerySequenceNumber);
}
