Question

I have a set of strings (~80 000) I can only access sequentially by the hits.Doc(int).Get(‘fieldName’) method.

List<string> idStrings = new List<string>(); int count = hits.Length(); for (int i = 0; i < count; i++) {     string idString = hits.Doc(i).Get('id');     if (!idStrings.Contains(idString))         idStrings.Add(idString); } 

The strings will later on have to be int.TryParse()’d. I think there should be a faster way to do this. Any suggestions?

Answer 1

First of all, use a Hashset<string> instead of a list, the Contains method will go faster:

int count = hits.Length(); Hashset<string> idStrings = new Hashset<string>(); 

EDIT: You don’t have to call ‘Contains’ if you use a Hashset as it can’t contain duplicate items. Just use Add, it will automatically remove duplicate values.