malte_langkabel
f3dc12b0ed
* replaced the implementation of the search index. the search index now uses a search-trie. edges have gates that can be used to check if a character can be matched when following the edge. * SearchMatches now have a text and a list of NameHierarchies that share this node (instead of Ids, so that nodes must be found by names (which makes sure that SearchMatches are still valid after refresh). * when parsing a project's description the CodeController now looks for NameHierarchies instead of SearchNode names to find ids of linked elements.
119 lines
2.0 KiB
C++
119 lines
2.0 KiB
C++
#include "data/search/SearchMatch.h"
|
|
|
|
#include <sstream>
|
|
|
|
#include "utility/logging/logging.h"
|
|
|
|
void SearchMatch::log(const std::vector<SearchMatch>& matches, const std::string& query)
|
|
{
|
|
std::stringstream ss;
|
|
ss << std::endl << matches.size() << " matches for \"" << query << "\":" << std::endl;
|
|
|
|
for (const SearchMatch& match : matches)
|
|
{
|
|
match.print(ss);
|
|
}
|
|
|
|
LOG_INFO(ss.str());
|
|
}
|
|
|
|
std::string SearchMatch::getSearchTypeName(SearchType type)
|
|
{
|
|
switch (type)
|
|
{
|
|
case SEARCH_NONE:
|
|
return "none";
|
|
case SEARCH_TOKEN:
|
|
return "token";
|
|
case SEARCH_COMMAND:
|
|
return "command";
|
|
case SEARCH_OPERATOR:
|
|
return "operator";
|
|
}
|
|
|
|
}
|
|
|
|
std::string SearchMatch::searchMatchesToString(const std::vector<SearchMatch>& matches)
|
|
{
|
|
std::stringstream ss;
|
|
|
|
for (size_t i = 0; i < matches.size(); i++)
|
|
{
|
|
ss << '@' << matches[i].getFullName();
|
|
}
|
|
|
|
return ss.str();
|
|
}
|
|
|
|
SearchMatch SearchMatch::createCommand(CommandType type)
|
|
{
|
|
SearchMatch match;
|
|
match.text = getCommandName(type);
|
|
match.typeName = "command";
|
|
match.searchType = SEARCH_COMMAND;
|
|
return match;
|
|
}
|
|
|
|
std::string SearchMatch::getCommandName(CommandType type)
|
|
{
|
|
switch (type)
|
|
{
|
|
case COMMAND_ALL:
|
|
return "overview";
|
|
case COMMAND_ERROR:
|
|
return "error";
|
|
}
|
|
|
|
return "none";
|
|
}
|
|
|
|
SearchMatch::SearchMatch()
|
|
: typeName("")
|
|
, searchType(SEARCH_NONE)
|
|
{
|
|
}
|
|
|
|
SearchMatch::SearchMatch(const std::string& query)
|
|
: text(query)
|
|
, typeName("")
|
|
, searchType(SEARCH_NONE)
|
|
{
|
|
}
|
|
|
|
bool SearchMatch::isValid() const
|
|
{
|
|
return searchType != SEARCH_NONE;
|
|
}
|
|
|
|
void SearchMatch::print(std::ostream& ostream) const
|
|
{
|
|
ostream << text << std::endl << '\t';
|
|
size_t i = 0;
|
|
for (size_t index : indices)
|
|
{
|
|
while (i < index)
|
|
{
|
|
i++;
|
|
ostream << ' ';
|
|
}
|
|
ostream << '^';
|
|
i++;
|
|
}
|
|
ostream << std::endl;
|
|
}
|
|
|
|
std::string SearchMatch::getFullName() const
|
|
{
|
|
return text;
|
|
}
|
|
|
|
std::string SearchMatch::getNodeTypeAsString() const
|
|
{
|
|
return Node::getTypeString(nodeType);
|
|
}
|
|
|
|
std::string SearchMatch::getSearchTypeName() const
|
|
{
|
|
return getSearchTypeName(searchType);
|
|
}
|