109         Files[CurrentFileIdx].Features = TmpFeatures;  in Parse()
133     Res += sizeof(F) + F.Features.size() * sizeof(F.Features[0]);  in ApproximateMemoryConsumption()
138 // Returns the number of new features added.
150   // What features are in the initial corpus?  in Merge()
152     auto &Cur = Files[i].Features;  in Merge()
155   // Remove all features that we already know from all other inputs.  in Merge()
157     auto &Cur = Files[i].Features;  in Merge()
166   //   * files with more features.  in Merge()
171               return a.Features.size() > b.Features.size();  in Merge()
174   // One greedy pass: add the file's features to AllFeatures.  in Merge()
175   // If new features were added, add this file to NewFiles.  in Merge()
177     auto &Cur = Files[i].Features;  in Merge()
199     S.insert(File.Features.begin(), File.Features.end());  in AllFeatures()
243     std::set<size_t> Features;  in CrashResistantMergeInternalStep()  local
245       TPC.CollectFeatures([&](size_t Feature) { Features.insert(Feature); });  in CrashResistantMergeInternalStep()
249           Features.insert(Feature);  in CrashResistantMergeInternalStep()
259     for (size_t F : Features)  in CrashResistantMergeInternalStep()
274 // the first corpus only if it adds new features. Unlike `Merger::Merge`,
276 // of corpora files, that cover all known features (set cover problem).
277 // Generally, this means that files with more features are preferred for
279 // features, the smaller one is preferred.
298     ExistingFeatures.insert(Files[i].Features.begin(), Files[i].Features.end());  in SetCoverMerge()
300   // Mark the existing features as covered.  in SetCoverMerge()
306     // Calculate an underestimation of the set of covered features  in SetCoverMerge()
317     // Insert this file's unique features to all features.  in SetCoverMerge()
318     for (const auto &F : Files[i].Features)  in SetCoverMerge()
324     // Index to file with largest number of unique features.  in SetCoverMerge()
329     // Updated upon finding a file with more features.  in SetCoverMerge()
334     // features that are not already in Covered.  in SetCoverMerge()
338       // Count number of features in this file  in SetCoverMerge()
340       for (const auto &F : File.Features)  in SetCoverMerge()
345         // All features in this file are already in Covered: skip next time.  in SetCoverMerge()
350         // Update the max features file based on unique features  in SetCoverMerge()
362       // Did not find a file that adds unique features.  in SetCoverMerge()
371     // Remove the file with the most features from Remaining.  in SetCoverMerge()
374     // Add the features of the max feature file to Covered.  in SetCoverMerge()
375     for (const auto &F : MaxFeatureFile.Features) {  in SetCoverMerge()
534   VPrintf(V, "MERGE-OUTER: %zd new files with %zd new features added; "  in CrashResistantMerge()