public static IDictionary <string, BitSetsLookupEntry> CreateBitSetsLookup(IndexReader reader, IDictionary <string, ISet <string> > frameworkCompatibility) { // This is a two step process because we first need to calculate the highest version across the whole data set (i.e. across every segment) // STEP 1. Create a lookup table of compatible documents (identified by SegmentName and Doc) per entry in the framework compatibility table // (The result include separate structures for release-only and including pre-release.) IDictionary <string, MatchingDocsEntry> matchingDocsLookup = new Dictionary <string, MatchingDocsEntry>(); foreach (string key in frameworkCompatibility.Keys) { matchingDocsLookup[key] = new MatchingDocsEntry(); } foreach (SegmentReader segmentReader in reader.GetSequentialSubReaders()) { UpdateMatchingDocs(matchingDocsLookup, segmentReader, frameworkCompatibility); } // STEP 2. From the globally created MatchingDocsLookup table we create per-segment lookups IDictionary <string, BitSetsLookupEntry> bitSetsLookup = new Dictionary <string, BitSetsLookupEntry>(); foreach (string key in frameworkCompatibility.Keys) { BitSetsLookupEntry newBitSetsLookupEntry = new BitSetsLookupEntry(); foreach (SegmentReader segmentReader in reader.GetSequentialSubReaders()) { newBitSetsLookupEntry.MatchingDocs.Add(segmentReader.SegmentName, new OpenBitSet()); newBitSetsLookupEntry.MatchingDocsPre.Add(segmentReader.SegmentName, new OpenBitSet()); } bitSetsLookup[key] = newBitSetsLookupEntry; } foreach (KeyValuePair <string, MatchingDocsEntry> entry in matchingDocsLookup) { foreach (MatchingDoc matchingDoc in entry.Value.MatchingDocs.Values) { bitSetsLookup[entry.Key].MatchingDocs[matchingDoc.SegmentName].Set(matchingDoc.Doc); } foreach (MatchingDoc matchingDocPre in entry.Value.MatchingDocsPre.Values) { bitSetsLookup[entry.Key].MatchingDocsPre[matchingDocPre.SegmentName].Set(matchingDocPre.Doc); } } return(bitSetsLookup); }
public static IDictionary<string, BitSetsLookupEntry> CreateBitSetsLookup(IndexReader reader, IDictionary<string, ISet<string>> frameworkCompatibility) { // This is a two step process because we first need to calculate the highest version across the whole data set (i.e. across every segment) // STEP 1. Create a lookup table of compatible documents (identified by SegmentName and Doc) per entry in the framework compatibility table // (The result include separate structures for release-only and including pre-release.) IDictionary<string, MatchingDocsEntry> matchingDocsLookup = new Dictionary<string, MatchingDocsEntry>(); foreach (string key in frameworkCompatibility.Keys) { matchingDocsLookup[key] = new MatchingDocsEntry(); } foreach (SegmentReader segmentReader in reader.GetSequentialSubReaders()) { UpdateMatchingDocs(matchingDocsLookup, segmentReader, frameworkCompatibility); } // STEP 2. From the globally created MatchingDocsLookup table we create per-segment lookups IDictionary<string, BitSetsLookupEntry> bitSetsLookup = new Dictionary<string, BitSetsLookupEntry>(); foreach (string key in frameworkCompatibility.Keys) { BitSetsLookupEntry newBitSetsLookupEntry = new BitSetsLookupEntry(); foreach (SegmentReader segmentReader in reader.GetSequentialSubReaders()) { newBitSetsLookupEntry.MatchingDocs.Add(segmentReader.SegmentName, new OpenBitSet()); newBitSetsLookupEntry.MatchingDocsPre.Add(segmentReader.SegmentName, new OpenBitSet()); } bitSetsLookup[key] = newBitSetsLookupEntry; } foreach (KeyValuePair<string, MatchingDocsEntry> entry in matchingDocsLookup) { foreach (MatchingDoc matchingDoc in entry.Value.MatchingDocs.Values) { bitSetsLookup[entry.Key].MatchingDocs[matchingDoc.SegmentName].Set(matchingDoc.Doc); } foreach (MatchingDoc matchingDocPre in entry.Value.MatchingDocsPre.Values) { bitSetsLookup[entry.Key].MatchingDocsPre[matchingDocPre.SegmentName].Set(matchingDocPre.Doc); } } return bitSetsLookup; }