mlangkabel
dfc6d88432
* removed paths in include directives * changed cmake to provide necessary header search paths * changed name of version.h to productVersion.h due to name conflict
98 lines
3.4 KiB
C++
98 lines
3.4 KiB
C++
#include <cxxtest/TestSuite.h>
|
|
|
|
#include "NameHierarchy.h"
|
|
#include "SearchIndex.h"
|
|
#include "utility.h"
|
|
|
|
class SearchIndexTestSuite : public CxxTest::TestSuite
|
|
{
|
|
public:
|
|
|
|
void test_search_index_finds_id_of_element_added()
|
|
{
|
|
SearchIndex index;
|
|
index.addNode(1, NameHierarchy::deserialize(L"::\tmfoo\tsvoid\tp() const").getQualifiedName());
|
|
index.finishSetup();
|
|
std::vector<SearchResult> results = index.search(L"oo", NodeTypeSet::all(), 0);
|
|
|
|
TS_ASSERT_EQUALS(1, results.size());
|
|
TS_ASSERT_EQUALS(1, results[0].elementIds.size());
|
|
TS_ASSERT(utility::containsElement<Id>(results[0].elementIds, 1));
|
|
}
|
|
|
|
void test_search_index_finds_correct_indices_for_query()
|
|
{
|
|
SearchIndex index;
|
|
index.addNode(1, NameHierarchy::deserialize(L"::\tmfoo\tsvoid\tp() const").getQualifiedName());
|
|
index.finishSetup();
|
|
std::vector<SearchResult> results = index.search(L"oo", NodeTypeSet::all(), 0);
|
|
|
|
TS_ASSERT_EQUALS(1, results.size());
|
|
TS_ASSERT_EQUALS(2, results[0].indices.size());
|
|
TS_ASSERT_EQUALS(1, results[0].indices[0]);
|
|
TS_ASSERT_EQUALS(2, results[0].indices[1]);
|
|
}
|
|
|
|
void test_search_index_finds_ids_for_ambiguous_query()
|
|
{
|
|
SearchIndex index;
|
|
index.addNode(1, NameHierarchy::deserialize(L"::\tmfor\tsvoid\tp() const").getQualifiedName());
|
|
index.addNode(2, NameHierarchy::deserialize(L"::\tmfos\tsvoid\tp() const").getQualifiedName());
|
|
index.finishSetup();
|
|
std::vector<SearchResult> results = index.search(L"fo", NodeTypeSet::all(), 0);
|
|
|
|
TS_ASSERT_EQUALS(2, results.size());
|
|
TS_ASSERT_EQUALS(1, results[0].elementIds.size());
|
|
TS_ASSERT(utility::containsElement<Id>(results[0].elementIds, 1));
|
|
TS_ASSERT_EQUALS(1, results[1].elementIds.size());
|
|
TS_ASSERT(utility::containsElement<Id>(results[1].elementIds, 2));
|
|
}
|
|
|
|
void test_search_index_does_not_find_anything_after_clear()
|
|
{
|
|
SearchIndex index;
|
|
index.addNode(1, NameHierarchy::deserialize(L"::\tmfoo\tsvoid\tp() const").getQualifiedName());
|
|
index.finishSetup();
|
|
index.clear();
|
|
std::vector<SearchResult> results = index.search(L"oo", NodeTypeSet::all(), 0);
|
|
|
|
TS_ASSERT_EQUALS(0, results.size());
|
|
}
|
|
|
|
void test_search_index_does_not_find_all_results_when_max_amount_is_limited()
|
|
{
|
|
SearchIndex index;
|
|
index.addNode(1, NameHierarchy::deserialize(L"::\tmfoo1\tsvoid\tp() const").getQualifiedName());
|
|
index.addNode(2, NameHierarchy::deserialize(L"::\tmfoo2\tsvoid\tp() const").getQualifiedName());
|
|
index.finishSetup();
|
|
std::vector<SearchResult> results = index.search(L"oo", NodeTypeSet::all(), 1);
|
|
|
|
TS_ASSERT_EQUALS(1, results.size());
|
|
}
|
|
|
|
void test_search_index_query_is_case_insensitive()
|
|
{
|
|
SearchIndex index;
|
|
index.addNode(1, NameHierarchy::deserialize(L"::\tmfoo1\tsvoid\tp() const").getQualifiedName());
|
|
index.addNode(2, NameHierarchy::deserialize(L"::\tmFOO2\tsvoid\tp() const").getQualifiedName());
|
|
index.finishSetup();
|
|
std::vector<SearchResult> results = index.search(L"oo", NodeTypeSet::all(), 0);
|
|
|
|
TS_ASSERT_EQUALS(2, results.size());
|
|
}
|
|
|
|
void test_search_index_rates_higher_on_consecutive_letters()
|
|
{
|
|
|
|
SearchIndex index;
|
|
index.addNode(1, NameHierarchy::deserialize(L"::\tmoaabbcc\tsvoid\tp() const").getQualifiedName());
|
|
index.addNode(2, NameHierarchy::deserialize(L"::\tmocbcabc\tsvoid\tp() const").getQualifiedName());
|
|
index.finishSetup();
|
|
std::vector<SearchResult> results = index.search(L"abc", NodeTypeSet::all(), 0);
|
|
|
|
TS_ASSERT_EQUALS(2, results.size());
|
|
TS_ASSERT_EQUALS(L"ocbcabc", results[0].text);
|
|
TS_ASSERT_EQUALS(L"oaabbcc", results[1].text);
|
|
}
|
|
};
|