usagescoring.h

// SPDX-FileCopyrightText: 2025 Manuel Schneider
// SPDX-License-Identifier: MIT
 
#pragma once
#include <QHash>
#include <QString>
#include <albert/export.h>
#include <unordered_map>
#include <vector>
 
namespace albert
{
class RankItem;
 
 
struct ALBERT_EXPORT ItemKey
{
    QString extension_id;
    QString item_id;
    bool operator==(const ItemKey&) const = default;
};
 
 
class ALBERT_EXPORT UsageScoring
{
public:
 
    double modifiedMatchScore(const ItemKey &key, double match_score) const;
 
    void modifyMatchScores(const QString &extension_id, std::vector<albert::RankItem> &rank_items) const;
 
    bool prioritize_perfect_match;
 
    double memory_decay;
 
    std::shared_ptr<const std::unordered_map<ItemKey, double>> usage_scores;
 
};
 
}
 
// Hashing specialization for ItemKey
template <>
struct std::hash<albert::ItemKey>
{
    // https://stackoverflow.com/questions/17016175/c-unordered-map-using-a-custom-class-type-as-the-key#comment39936543_17017281
    inline std::size_t operator()(const albert::ItemKey& key) const
    { return (qHash(key.extension_id) ^ (qHash(key.item_id)<< 1)); }
};