107         Files[CurrentFileIdx].Features = TmpFeatures;  in Parse()
129     Res += sizeof(F) + F.Features.size() * sizeof(F.Features[0]);  in ApproximateMemoryConsumption()
148     auto &Cur = Files[i].Features;  in Merge()
153     auto &Cur = Files[i].Features;  in Merge()
167               return a.Features.size() > b.Features.size();  in Merge()
173     auto &Cur = Files[i].Features;  in Merge()
195     S.insert(File.Features.begin(), File.Features.end());  in AllFeatures()
239     std::set<size_t> Features;  in CrashResistantMergeInternalStep()  local
241       TPC.CollectFeatures([&](size_t Feature) { Features.insert(Feature); });  in CrashResistantMergeInternalStep()
245           Features.insert(Feature);  in CrashResistantMergeInternalStep()
255     for (size_t F : Features)  in CrashResistantMergeInternalStep()
294     ExistingFeatures.insert(Files[i].Features.begin(), Files[i].Features.end());  in SetCoverMerge()
314     for (const auto &F : Files[i].Features)  in SetCoverMerge()
336       for (const auto &F : File.Features)  in SetCoverMerge()
371     for (const auto &F : MaxFeatureFile.Features) {  in SetCoverMerge()