Zxc200611/pocketpy
1
0
Fork 0
mirror of https://github.com/pocketpy/pocketpy synced 2025-11-08 12:40:17 +00:00
Code Issues Packages Projects Releases Wiki Activity

Don't sort; just pick best score

Browse Source
This commit is contained in:
Max Bernstein 2023-02-24 11:17:01 -05:00
parent 15758d448d
commit c066167652
1 changed files with 7 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
src/namedict.h
View File

@ -52,7 +52,8 @@ namespace pkpy{
uint32_t find_perfect_hash_seed(uint32_t capacity, const std::vector<StrName>& keys){ uint32_t find_perfect_hash_seed(uint32_t capacity, const std::vector<StrName>& keys){
if(keys.empty()) return kHashSeeds[0]; if(keys.empty()) return kHashSeeds[0];
std::set<uint32_t> indices; std::set<uint32_t> indices;
std::vector<std::pair<uint32_t, float>> scores(kHashSeeds.size()); uint32_t best_seed = 0;
float best_score = std::numeric_limits<float>::max();
for(int i=0; i<kHashSeeds.size(); i++){ for(int i=0; i<kHashSeeds.size(); i++){
indices.clear(); indices.clear();
for(auto key: keys){ for(auto key: keys){
@ -60,10 +61,12 @@ namespace pkpy{
indices.insert(index); indices.insert(index);
} }
float score = indices.size() / (float)keys.size(); float score = indices.size() / (float)keys.size();
scores[i] = {kHashSeeds[i], score}; if (score > best_score) {
best_score = score;
best_seed = kHashSeeds[i];
} }
std::sort(scores.begin(), scores.end(), [](auto a, auto b){ return a.second > b.second; }); }
return scores[0].first; return best_seed;
} }
struct NameDict { struct NameDict {