feat: add tree-finder

lib_vector_search/CMakeLists.txt

@@ -5,8 +5,18 @@ project(
   VERSION 0.1.0
   LANGUAGES CXX)
 
-add_library(vector_search STATIC src/word_list_generator.cpp src/timer.cpp
-                                 src/linear_finder.cpp src/parallel_finder.cpp)
+add_library(
+  vector_search STATIC
+  src/word_list_generator.cpp
+  include/word_list_generator.h
+  src/timer.cpp
+  include/timer.h
+  src/linear_finder.cpp
+  include/linear_finder.h
+  src/parallel_finder.cpp
+  include/parallel_finder.h
+  src/tree_finder.cpp
+  include/tree_finder.h)
 
 target_include_directories(vector_search PUBLIC ${PROJECT_SOURCE_DIR}/include)
 

lib_vector_search/include/tree_finder.h

@@ -0,0 +1,34 @@
+#pragma once
+
+#include "finder.h"
+
+#include <map>
+#include <vector>
+
+class SearchTreeNode {
+private:
+  std::forward_list<const std::string *> words_;
+  std::map<const char, SearchTreeNode> children_;
+
+public:
+  void insert(std::string_view partial_word, const string *original_word);
+  const SearchTreeNode *find(std::string_view search_term) const;
+
+  std::forward_list<const std::string *> words() const;
+};
+
+class SearchTree : public SearchTreeNode {
+public:
+  SearchTree(const std::vector<std::string> &word_list);
+};
+
+class TreeFinder : public Finder {
+private:
+  SearchTree search_tree_;
+
+public:
+  TreeFinder(const std::vector<string> &word_list);
+
+  virtual std::forward_list<const std::string *>
+  find_prefix(std::string_view search_term) const override;
+};

lib_vector_search/src/tree_finder.cpp

@@ -0,0 +1,53 @@
+#include "tree_finder.h"
+
+void SearchTreeNode::insert(std::string_view partial_word,
+                            const string *original_word) {
+  if (partial_word.empty()) {
+    words_.push_front(original_word);
+  } else {
+    children_[partial_word.front()].insert(
+        std::string_view(partial_word).substr(1, partial_word.length()),
+        original_word);
+  }
+}
+
+const SearchTreeNode *SearchTreeNode::find(std::string_view search_term) const {
+  if (search_term.empty()) {
+    return this;
+  }
+
+  auto child = children_.find(search_term.front());
+  if (child != children_.cend()) {
+    return child->second.find(search_term.substr(1, search_term.length()));
+  }
+
+  return nullptr;
+}
+
+std::forward_list<const std::string *> SearchTreeNode::words() const {
+  std::forward_list<const std::string *> results(words_);
+  for (const auto &child : children_) {
+    results.merge(child.second.words());
+  }
+
+  return results;
+};
+
+SearchTree::SearchTree(const std::vector<std::string> &word_list) {
+  for (const auto &word : word_list) {
+    insert(std::string_view(word), &word);
+  }
+}
+
+TreeFinder::TreeFinder(const std::vector<string> &word_list)
+    : search_tree_(word_list) {}
+
+std::forward_list<const std::string *>
+TreeFinder::find_prefix(std::string_view search_term) const {
+  const auto *result_node = search_tree_.find(search_term);
+  if (result_node == nullptr) {
+    return {};
+  }
+
+  return result_node->words();
+}