/// <summary>
/// Search a given dataset for the given query
/// </summary>
/// <param name="query">What you are searching for</param>
/// <param name="dataset">The dataset to search</param>
/// <param optional="true" name="fuzziness">
/// The distance away from root to search. Default is 0 which means only exact matches can be found
/// </param>
/// <returns>A list of items found in the dataset given the query</returns>
public override IEnumerable <string> Search(string query, IList <string> dataset, int fuzziness = 0)
{
List <string> matches = new List <string>();
Dfa levenshteinAutomata = _LevenshteinAutomata(query, fuzziness);
string match = levenshteinAutomata.FindNextValidString("\u0001");
string prevLookup = "";
while (match != null)
{
string next = LookupFunc(match, dataset);
if (next == null)
{
break;
}
int index = dataset.IndexOf(next);
int indexPrevLookup = dataset.IndexOf(prevLookup);
if (next.Contains(match))
{
matches.Add(next);
dataset.RemoveAt(index);
next = dataset[index];
}
else if (next == prevLookup)
{
dataset.RemoveAt(index);
next = dataset[index];
}
if (indexPrevLookup >= 0 && indexPrevLookup < dataset.Count)
{
dataset.RemoveAt(indexPrevLookup);
}
prevLookup = next;
match = levenshteinAutomata.FindNextValidString(next);
if (index >= dataset.Count)
{
break;
}
}
return(matches);
}
public void DfaCanFindNextValidState()
{
Dfa dfa = _automata.Construct().ConstructDfaUsingPowerSet();
Assert.IsNotNull(dfa);
string next = dfa.FindNextValidString("gice");
Assert.AreEqual(next, "gice");
}
