21f-srch-ngn-linked-list-unary-tree

Final project for SMU's Fall 2021 Data Structures class where I built a search engine that accepts boolean queries.

Links:

Name		Name	Last commit message	Last commit date
Latest commit History 62 Commits
.github		.github
ASCII Creations		ASCII Creations
documentation		documentation
murmur3		murmur3
porter2_stemmer		porter2_stemmer
rapidjson		rapidjson
storage		storage
.gitignore		.gitignore
AVLTree.h		AVLTree.h
CMakeLists.txt		CMakeLists.txt
DocumentNode.cpp		DocumentNode.cpp
DocumentNode.h		DocumentNode.h
DocumentProcessor.cpp		DocumentProcessor.cpp
DocumentProcessor.h		DocumentProcessor.h
HashFunction.h		HashFunction.h
HashMap.h		HashMap.h
HashNode.h		HashNode.h
Index.cpp		Index.cpp
Index.h		Index.h
QueryProcessor.cpp		QueryProcessor.cpp
QueryProcessor.h		QueryProcessor.h
README.md		README.md
TreeNode.h		TreeNode.h
UserInterface.cpp		UserInterface.cpp
UserInterface.h		UserInterface.h
WordNode.cpp		WordNode.cpp
WordNode.h		WordNode.h
catch.hpp		catch.hpp
catch_setup.cpp		catch_setup.cpp
catch_setup.h		catch_setup.h
main.cpp		main.cpp
test.cpp		test.cpp
tokStr.cpp		tokStr.cpp
tokStr.h		tokStr.h