mirror of
https://github.com/typesense/typesense.git
synced 2025-05-20 05:32:30 +08:00
396e10be5d
Earlier, even if one token produced no result, ALL tokens were searched with a higher cost. This change ensures that we first retry only the token that did not produce results with a larger cost before doing the same for other tokens.
51 lines
1.6 KiB
C++
51 lines
1.6 KiB
C++
#pragma once
|
|
|
|
#include <string>
|
|
#include <vector>
|
|
#include <art.h>
|
|
#include <sparsepp.h>
|
|
#include <store.h>
|
|
#include <topster.h>
|
|
#include <json.hpp>
|
|
|
|
class Collection {
|
|
private:
|
|
Store* store;
|
|
|
|
// Integer ID used internally for bitmaps - not exposed to the client
|
|
uint32_t seq_id;
|
|
|
|
art_tree t;
|
|
spp::sparse_hash_map<uint32_t, uint16_t> doc_scores;
|
|
|
|
uint32_t next_seq_id();
|
|
|
|
const std::string SEQ_ID_PREFIX = "SQ_";
|
|
const std::string ID_PREFIX = "ID_";
|
|
|
|
std::string get_seq_id_key(uint32_t seq_id);
|
|
std::string get_id_key(std::string id);
|
|
|
|
static inline std::vector<art_leaf *> next_suggestion(const std::vector<std::vector<art_leaf *>> &token_leaves,
|
|
long long int n);
|
|
void log_leaves(const int max_cost, const std::string &token, const std::vector<art_leaf *> &leaves) const;
|
|
|
|
void search_candidates(std::vector<std::vector<art_leaf*>> & token_leaves, Topster<100> & topster,
|
|
size_t & total_results, const size_t & max_results);
|
|
|
|
public:
|
|
Collection() = delete;
|
|
Collection(std::string state_dir_path);
|
|
~Collection();
|
|
std::string add(std::string json_str);
|
|
std::vector<nlohmann::json> search(std::string query, const int num_typos, const size_t num_results);
|
|
void remove(std::string id);
|
|
void score_results(Topster<100> &topster, const std::vector<art_leaf *> &query_suggestion,
|
|
const uint32_t *result_ids,
|
|
size_t result_size) const;
|
|
|
|
enum {MAX_SEARCH_TOKENS = 20};
|
|
enum {MAX_RESULTS = 100};
|
|
};
|
|
|