#include "bktree.hpp"
#include <iostream>

int main() {
  using metric_t = bk_tree::metrics::DamerauLevenshteinDistance;
  using tree_t = bk_tree::BKTree<metric_t>;

  // 🌟 Initializer list syntax
  tree_t temp{"tall", "tell", "teel"};
  temp.insert("feel");

  tree_t tree(temp);

  // 🌟 Loop like a STL container (e.g. range-based)
  for (auto const &node : tree) {
    std::cout << *node << ' ';        // tall tell teel feel
    std::cout << node->word() << ' '; // tall tell teel feel
  }
  std::cout << std::endl;

  std::cout << "Tree size: " << tree.size() << std::endl; // Tree size: 4

  // 🌟 Find all possible results
  auto result = tree.find("tale", 1);
  for (auto &p : result) {
    std::cout << p.first << " " << p.second << std::endl; // tall 1
  }

  // 🌟 Erase a node by word
  tree.erase("tall");
  result = tree.find("tale", 1);
  std::cout << result.size() << std::endl; // 0
}