reserveSearch.cpp

#include "specialTrie/specialTrie.hpp"
#include "csv/csv.hpp"
#include "experimental/filesystem"
namespace fs = std::experimental::filesystem;

/**
 * Parse the input CSV file to create a `SpecialTrieNode` object instance (in which words 
 * are stored along with their index values) & search a given word using its index value.
 */

int main(int args, char** argv);
SpecialTrieNode* convertDictToSpecialTrie(unordered_set<string>& dict);

int main(int args, char** argv) {
  if (args < 2) {
    cout << "CSV filename and/or word to search missing; exitting...\n";
    exit(1);
  }

  string csvFilePath = fs::current_path().string() + "/static/EnglishDictionary.csv";
  unordered_set<string> dict = CsvReader::parseToDict(csvFilePath);
  SpecialTrieNode *trieRoot = convertDictToSpecialTrie(dict);

  string searchedWord = trieRoot->search(stoi(argv[1]));
  if (searchedWord.empty()) {
    cout << "Word not found\n";
  } else {
    cout << "Word Found!, Word = " << searchedWord << "\n";
  }

  return 0;
}

/**
 * Convert an `unordered_set` to `SpecialTrieNode` object instance.
 * 
 * @param dict `unordered_set` containing dictionary words to store in trie data structure
 * 
 * @returns Object Instance (Pointer) of the trie data structure
 */
SpecialTrieNode* convertDictToSpecialTrie(unordered_set<string>& dict) {
  SpecialTrieNode *trieRoot = new SpecialTrieNode(dict.size());
  int i = 0;
  for (auto itr = dict.begin(); itr != dict.end(); ++itr, ++i) {
    string key = itr->data();
    itr = dict.erase(itr); // returns next iterator
    trieRoot->insert(key, i);
  }
  return trieRoot;
}