// Includes /*{{{*/ #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "private-search.h" #include "private-cacheset.h" /*}}}*/ bool FullTextSearch(CommandLine &CmdL) /*{{{*/ { pkgCacheFile CacheFile; pkgCache *Cache = CacheFile.GetPkgCache(); pkgDepCache::Policy *Plcy = CacheFile.GetPolicy(); pkgRecords records(CacheFile); if (unlikely(Cache == NULL || Plcy == NULL)) return false; const char **patterns; patterns = CmdL.FileList + 1; std::map output_map; std::map::const_iterator K; LocalitySortedVersionSet bag; OpTextProgress progress; progress.OverallProgress(0, 100, 50, _("Sorting")); GetLocalitySortedVersionSet(CacheFile, bag, progress); LocalitySortedVersionSet::iterator V = bag.begin(); progress.OverallProgress(50, 100, 50, _("Full Text Search")); progress.SubProgress(bag.size()); int Done = 0; for ( ;V != bag.end(); V++) { if (Done%500 == 0) progress.Progress(Done); Done++; int i; pkgCache::DescIterator Desc = V.TranslatedDescription(); pkgRecords::Parser &parser = records.Lookup(Desc.FileList()); bool all_found = true; for(i=0; patterns[i] != NULL; i++) { // FIXME: use regexp instead of simple find() const char *pattern = patterns[i]; all_found &= ( strstr(V.ParentPkg().Name(), pattern) != NULL || parser.ShortDesc().find(pattern) != std::string::npos || parser.LongDesc().find(pattern) != std::string::npos); } if (all_found) { std::stringstream outs; ListSingleVersion(CacheFile, records, V, outs); output_map.insert(std::make_pair( V.ParentPkg().Name(), outs.str())); } } progress.Done(); // FIXME: SORT! and make sorting flexible (alphabetic, by pkg status) // output the sorted map for (K = output_map.begin(); K != output_map.end(); K++) std::cout << (*K).second << std::endl; return true; } /*}}}*/