public void PushToResults(KeySearcher.ValueKey valueKey)
{
if (Result.Contains(valueKey))
{
return;
}
var node = Result.First;
while (node != null)
{
if (KeyQualityHelper.IsBetter(valueKey.value, node.Value.value))
{
Result.AddBefore(node, valueKey);
if (Result.Count > 10)
{
Result.RemoveLast();
}
return;
}
node = node.Next;
}
if (Result.Count < 10)
{
Result.AddLast(valueKey);
}
}
public void FillListWithDummies(int maxInList, LinkedList <KeySearcher.ValueKey> costList)
{
KeySearcher.ValueKey valueKey = new KeySearcher.ValueKey();
valueKey.value = WorstValue();
valueKey.key = Resources.dummykey;
valueKey.decryption = new byte[0];
LinkedListNode <KeySearcher.ValueKey> node = costList.AddFirst(valueKey);
for (int i = 1; i < maxInList; i++)
{
node = costList.AddAfter(node, valueKey);
}
}
