├── BSNode.h ├── BST.h ├── DSInvertedIndex.pro ├── DSInvertedIndex.pro.user ├── DSInvertedIndex.sdf ├── DSInvertedIndex.sln ├── DSInvertedIndex.vcxproj ├── DSInvertedIndex.vcxproj.filters ├── DSInvertedIndex.vcxproj.user ├── HashMap.h ├── HashNode.h ├── IndexAddress.h ├── LICENSE ├── LLNode.h ├── LinkedList.h ├── LinkedListA.h ├── README.md ├── Stack.h ├── TSNode.h ├── TST.h ├── Trie.h ├── TrieNode.h ├── main.cpp ├── mainwindow.cpp ├── mainwindow.h └── mainwindow.ui /BSNode.h: -------------------------------------------------------------------------------- 1 | #ifndef BSNODE_H 2 | #define BSNODE_H 3 | 4 | #include 5 | 6 | template 7 | class BST; 8 | 9 | template 10 | class BSNode 11 | { 12 | friend class BST; 13 | 14 | public: 15 | BSNode(); 16 | ~BSNode(); 17 | BSNode(QString,T); 18 | T data; 19 | QString key; 20 | BSNode* LC; //pointer to left child node of node 21 | BSNode* RC; //pointer to right child node of node 22 | 23 | virtual operator QString() { 24 | QString result = ""; 25 | result += key; 26 | for(int i=key.count();i<10;i++) result += " "; 27 | result += " -> " + data ; 28 | return result; 29 | } 30 | 31 | private: 32 | int height; 33 | }; 34 | 35 | template 36 | BSNode::BSNode() 37 | { 38 | LC = 0; 39 | RC = 0; 40 | } 41 | 42 | //Destructor 43 | template 44 | BSNode::~BSNode() 45 | { 46 | 47 | } 48 | 49 | 50 | template 51 | BSNode::BSNode(QString keyIn, T dataIn) 52 | { 53 | key = keyIn; 54 | data = dataIn; 55 | LC = 0; 56 | RC = 0; 57 | height = 1; 58 | } 59 | 60 | #endif // BSNODE_H 61 | -------------------------------------------------------------------------------- /BST.h: -------------------------------------------------------------------------------- 1 | #ifndef TREE_H 2 | #define TREE_H 3 | 4 | #include "BSNode.h" 5 | #include "Stack.h" 6 | #include 7 | #include 8 | 9 | template 10 | class BST 11 | { 12 | public: 13 | //Constructor / Destructor 14 | BST(); 15 | ~BST(); 16 | 17 | //Insert / Remove 18 | void insert(QString,T); 19 | void remove(QString); 20 | BSNode* search(QString); 21 | bool isEmpty(); 22 | 23 | //Iterator 24 | void iterBegin(); 25 | bool iterHasNext(); 26 | BSNode * iterNext(); 27 | 28 | //Print 29 | QString preOrderPrint(); 30 | QString inOrderPrint(); 31 | QString postOrderPrint(); 32 | 33 | virtual operator QString(); 34 | 35 | private: 36 | BSNode *root; 37 | void destroy(BSNode*); 38 | BSNode* insert(BSNode*,QString, T); 39 | BSNode* remove(BSNode *,QString); 40 | BSNode* searchUtility(BSNode*, QString); 41 | 42 | BSNode* minValueNode(BSNode *); 43 | 44 | Stack *> iterStack; 45 | void iterPushAll(BSNode *); 46 | 47 | 48 | BSNode* rightRotate(BSNode*); 49 | BSNode* leftRotate(BSNode*); 50 | 51 | int max(int,int); 52 | int height(BSNode*); 53 | int getBalance(BSNode*); 54 | 55 | void preOrderPrintUtility(BSNode*,QString&); 56 | void inOrderPrintUtility(BSNode*,QString&); 57 | void postOrderPrintUtility(BSNode*,QString&); 58 | }; 59 | 60 | template 61 | BST::BST() 62 | { 63 | root = NULL; 64 | } 65 | 66 | template 67 | BST::~BST() 68 | { 69 | destroy(root); 70 | } 71 | 72 | template 73 | void BST::destroy(BSNode * node) { 74 | if (!node) return; 75 | destroy(node->LC); 76 | destroy(node->RC); 77 | delete node; 78 | } 79 | 80 | template 81 | void BST::insert(QString key,T dataIn) 82 | { 83 | root = insert(root,key, dataIn); 84 | } 85 | 86 | //Utility function for insert 87 | template 88 | BSNode* BST::insert(BSNode* node, QString key, T dataIn) 89 | { 90 | /*if (temp == 0) 91 | temp = new BSNode(key,dataIn); 92 | else 93 | { 94 | if (key < temp->key) { 95 | insert(temp->LC,key, dataIn); 96 | } 97 | else if (key >(temp)->key) 98 | { 99 | insert(temp->RC, key, dataIn); 100 | } 101 | else{ 102 | 103 | } 104 | }*/ 105 | 106 | 107 | if (node == NULL) 108 | return new BSNode(key,dataIn); 109 | 110 | if (key < node->key) 111 | node->LC = insert(node->LC, key, dataIn); 112 | else if (key > node->key) 113 | node->RC = insert(node->RC, key,dataIn); 114 | else // Equal keys are not allowed in BST 115 | return node; 116 | 117 | /* 2. Update height of this ancestor node */ 118 | node->height = 1 + max(height(node->LC), 119 | height(node->RC)); 120 | 121 | int balance = getBalance(node); 122 | 123 | // Left Left Case 124 | if (balance > 1 && key < node->LC->key) 125 | return rightRotate(node); 126 | 127 | // Right Right Case 128 | if (balance < -1 && key > node->RC->key) 129 | return leftRotate(node); 130 | 131 | // Left Right Case 132 | if (balance > 1 && key > node->LC->key) 133 | { 134 | node->LC = leftRotate(node->LC); 135 | return rightRotate(node); 136 | } 137 | 138 | // Right Left Case 139 | if (balance < -1 && key < node->RC->key) 140 | { 141 | node->RC = rightRotate(node->RC); 142 | return leftRotate(node); 143 | } 144 | 145 | /* return the (unchanged) node pointer */ 146 | return node; 147 | 148 | } 149 | 150 | template 151 | void BST::remove(QString key) 152 | { 153 | root = remove(root, key); 154 | } 155 | 156 | //utility function for remove 157 | template 158 | BSNode * BST::remove(BSNode * p, QString key) 159 | { 160 | // base case 161 | if (p == NULL) return p; 162 | 163 | // search for node 164 | if (key < p->key) 165 | p->LC = remove(p->LC, key); 166 | 167 | else if (key > p->key) 168 | p->RC = remove(p->RC, key); 169 | 170 | // node found ! 171 | else 172 | { 173 | // node with only one child or no child 174 | if (p->LC == NULL) 175 | { 176 | BSNode *temp = p->RC; 177 | delete p; 178 | return temp; 179 | } 180 | else if (p->RC == NULL) 181 | { 182 | BSNode *temp = p->LC; 183 | delete p; 184 | return temp; 185 | } 186 | 187 | // node with two children: Get the inorder successor (smallest 188 | // in the right subtree) 189 | BSNode * temp = minValueNode(p->RC); 190 | 191 | // Copy the inorder successor's content to this node 192 | p->key = temp->key; 193 | p->data = temp->data; 194 | 195 | // Delete the inorder successor 196 | p->RC = remove(p->RC, temp->key); 197 | } 198 | return p; 199 | } 200 | 201 | template 202 | BSNode * BST::minValueNode(BSNode * node) 203 | { 204 | BSNode * current = node; 205 | while (current->LC != NULL) 206 | current = current->LC; 207 | return current; 208 | } 209 | 210 | template 211 | bool BST::isEmpty() { 212 | return root == NULL; 213 | } 214 | 215 | template 216 | void BST::iterBegin() { 217 | while (!iterStack.isEmpty()) { 218 | iterStack.pop(); 219 | } 220 | iterPushAll(root); 221 | } 222 | 223 | template 224 | void BST::iterPushAll(BSNode * p) { 225 | while (p != NULL) { 226 | iterStack.push(p); 227 | p = p->LC; 228 | } 229 | } 230 | 231 | template 232 | bool BST::iterHasNext() { 233 | return !iterStack.isEmpty(); 234 | } 235 | 236 | template 237 | BSNode* BST::iterNext() { 238 | BSNode * temp; 239 | int s = iterStack.pop(temp); 240 | if (s) { 241 | iterPushAll(temp->RC); 242 | return temp; 243 | } 244 | } 245 | 246 | template 247 | QString BST::preOrderPrint() 248 | { 249 | QString result = ""; 250 | preOrderPrintUtility(root,result); 251 | return result; 252 | } 253 | 254 | template 255 | void BST::preOrderPrintUtility(BSNode* temp,QString & out) 256 | { 257 | if (temp != 0) 258 | { 259 | out += *temp + "\n"; 260 | preOrderPrintUtility(temp->LC, out); 261 | preOrderPrintUtility(temp->RC,out); 262 | } 263 | } 264 | 265 | //Prints inOrder (HTML Format) 266 | template 267 | QString BST::inOrderPrint() 268 | { 269 | QString result = ""; 270 | inOrderPrintUtility(root,result); 271 | result += "
"; 272 | return result; 273 | } 274 | 275 | template 276 | void BST::inOrderPrintUtility(BSNode* temp,QString & out) 277 | { 278 | if (temp != 0) 279 | { 280 | inOrderPrintUtility(temp->LC,out); 281 | out += "" + temp->key + " -> " + temp->data + ""; 282 | inOrderPrintUtility(temp->RC,out); 283 | } 284 | } 285 | 286 | 287 | template 288 | QString BST::postOrderPrint() 289 | { 290 | QString result = ""; 291 | postOrderPrintUtility(root,result); 292 | return result; 293 | } 294 | 295 | template 296 | void BST::postOrderPrintUtility(BSNode* temp, QString & out) 297 | { 298 | if (temp != 0) 299 | { 300 | postOrderPrintUtility(temp->LC,out); 301 | postOrderPrintUtility(temp->RC,out); 302 | out += *temp + "\n"; 303 | } 304 | } 305 | 306 | template 307 | BSNode* BST::search(QString key) 308 | { 309 | return searchUtility(root, key); 310 | } 311 | 312 | template 313 | BSNode* BST::searchUtility(BSNode* leaf, QString key) 314 | { 315 | if (leaf != NULL) 316 | { 317 | if (key == leaf->key) 318 | return leaf; 319 | if (key < leaf->key) 320 | return searchUtility(leaf->LC, key); 321 | else 322 | return searchUtility(leaf->RC, key); 323 | } 324 | else 325 | return NULL; 326 | } 327 | 328 | template 329 | BST::operator QString() { 330 | return inOrderPrint(); 331 | } 332 | 333 | template 334 | int BST::height(BSNode * N) 335 | { 336 | if (N == NULL) 337 | return 0; 338 | return N->height; 339 | } 340 | 341 | template 342 | int BST::max(int a, int b) 343 | { 344 | return (a > b)? a : b; 345 | } 346 | template 347 | int BST::getBalance(BSNode* N) 348 | { 349 | if (N == NULL) 350 | return 0; 351 | return height(N->LC) - height(N->RC); 352 | } 353 | 354 | template 355 | BSNode* BST::rightRotate(BSNode* y) 356 | { 357 | BSNode* x = y->LC; 358 | BSNode* T2 = x->RC; 359 | 360 | // Perform rotation 361 | x->RC = y; 362 | y->LC = T2; 363 | 364 | // Update heights 365 | y->height = max(height(y->LC), height(y->RC))+1; 366 | x->height = max(height(x->LC), height(x->RC))+1; 367 | 368 | // Return new root 369 | return x; 370 | } 371 | 372 | template 373 | BSNode* BST::leftRotate(BSNode* x) 374 | { 375 | BSNode* y = x->RC; 376 | BSNode* T2 = y->LC; 377 | 378 | // Perform rotation 379 | y->LC = x; 380 | x->RC = T2; 381 | 382 | // Update heights 383 | x->height = max(height(x->LC), height(x->RC))+1; 384 | y->height = max(height(y->LC), height(y->RC))+1; 385 | 386 | // Return new root 387 | return y; 388 | } 389 | 390 | #endif 391 | -------------------------------------------------------------------------------- /DSInvertedIndex.pro: -------------------------------------------------------------------------------- 1 | #------------------------------------------------- 2 | # 3 | # Project created by QtCreator 2016-12-15T11:41:17 4 | # 5 | #------------------------------------------------- 6 | 7 | QT += core gui 8 | 9 | greaterThan(QT_MAJOR_VERSION, 4): QT += widgets 10 | 11 | TARGET = DSInvertedIndex 12 | TEMPLATE = app 13 | 14 | 15 | SOURCES += main.cpp\ 16 | mainwindow.cpp 17 | 18 | HEADERS += mainwindow.h \ 19 | LLNode.h \ 20 | LinkedList.h \ 21 | IndexAddress.h \ 22 | BST.h \ 23 | BSNode.h \ 24 | TrieNode.h \ 25 | Trie.h \ 26 | Stack.h \ 27 | TSNode.h \ 28 | TST.h \ 29 | LinkedListA.h \ 30 | HashNode.h \ 31 | HashMap.h 32 | 33 | FORMS += mainwindow.ui 34 | -------------------------------------------------------------------------------- /DSInvertedIndex.pro.user: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | EnvironmentId 7 | {fec279a1-6f5b-42af-b4e4-836086eaab3c} 8 | 9 | 10 | ProjectExplorer.Project.ActiveTarget 11 | 0 12 | 13 | 14 | ProjectExplorer.Project.EditorSettings 15 | 16 | true 17 | false 18 | true 19 | 20 | Cpp 21 | 22 | CppGlobal 23 | 24 | 25 | 26 | QmlJS 27 | 28 | QmlJSGlobal 29 | 30 | 31 | 2 32 | UTF-8 33 | false 34 | 4 35 | false 36 | 80 37 | true 38 | true 39 | 1 40 | true 41 | false 42 | 0 43 | true 44 | true 45 | 0 46 | 8 47 | true 48 | 1 49 | true 50 | true 51 | true 52 | false 53 | 54 | 55 | 56 | ProjectExplorer.Project.PluginSettings 57 | 58 | 59 | 60 | ProjectExplorer.Project.Target.0 61 | 62 | Desktop Qt 5.7.0 MSVC2015_64bit 63 | Desktop Qt 5.7.0 MSVC2015_64bit 64 | qt.57.win64_msvc2015_64_kit 65 | 0 66 | 0 67 | 0 68 | 69 | D:/Documents/QtProjects/build-DSInvertedIndex-Desktop_Qt_5_7_0_MSVC2015_64bit-Debug 70 | 71 | 72 | true 73 | qmake 74 | 75 | QtProjectManager.QMakeBuildStep 76 | true 77 | 78 | false 79 | false 80 | false 81 | 82 | 83 | true 84 | Make 85 | 86 | Qt4ProjectManager.MakeStep 87 | 88 | false 89 | 90 | 91 | 92 | 2 93 | Build 94 | 95 | ProjectExplorer.BuildSteps.Build 96 | 97 | 98 | 99 | true 100 | Make 101 | 102 | Qt4ProjectManager.MakeStep 103 | 104 | true 105 | clean 106 | 107 | 108 | 1 109 | Clean 110 | 111 | ProjectExplorer.BuildSteps.Clean 112 | 113 | 2 114 | false 115 | 116 | Debug 117 | 118 | Qt4ProjectManager.Qt4BuildConfiguration 119 | 2 120 | true 121 | 122 | 123 | D:/Documents/QtProjects/build-DSInvertedIndex-Desktop_Qt_5_7_0_MSVC2015_64bit-Release 124 | 125 | 126 | true 127 | qmake 128 | 129 | QtProjectManager.QMakeBuildStep 130 | false 131 | 132 | false 133 | false 134 | false 135 | 136 | 137 | true 138 | Make 139 | 140 | Qt4ProjectManager.MakeStep 141 | 142 | false 143 | 144 | 145 | 146 | 2 147 | Build 148 | 149 | ProjectExplorer.BuildSteps.Build 150 | 151 | 152 | 153 | true 154 | Make 155 | 156 | Qt4ProjectManager.MakeStep 157 | 158 | true 159 | clean 160 | 161 | 162 | 1 163 | Clean 164 | 165 | ProjectExplorer.BuildSteps.Clean 166 | 167 | 2 168 | false 169 | 170 | Release 171 | 172 | Qt4ProjectManager.Qt4BuildConfiguration 173 | 0 174 | true 175 | 176 | 177 | D:/Documents/QtProjects/build-DSInvertedIndex-Desktop_Qt_5_7_0_MSVC2015_64bit-Profile 178 | 179 | 180 | true 181 | qmake 182 | 183 | QtProjectManager.QMakeBuildStep 184 | true 185 | 186 | false 187 | true 188 | false 189 | 190 | 191 | true 192 | Make 193 | 194 | Qt4ProjectManager.MakeStep 195 | 196 | false 197 | 198 | 199 | 200 | 2 201 | Build 202 | 203 | ProjectExplorer.BuildSteps.Build 204 | 205 | 206 | 207 | true 208 | Make 209 | 210 | Qt4ProjectManager.MakeStep 211 | 212 | true 213 | clean 214 | 215 | 216 | 1 217 | Clean 218 | 219 | ProjectExplorer.BuildSteps.Clean 220 | 221 | 2 222 | false 223 | 224 | Profile 225 | 226 | Qt4ProjectManager.Qt4BuildConfiguration 227 | 0 228 | true 229 | 230 | 3 231 | 232 | 233 | 0 234 | Deploy 235 | 236 | ProjectExplorer.BuildSteps.Deploy 237 | 238 | 1 239 | Deploy locally 240 | 241 | ProjectExplorer.DefaultDeployConfiguration 242 | 243 | 1 244 | 245 | 246 | false 247 | false 248 | 1000 249 | 250 | true 251 | 252 | false 253 | false 254 | false 255 | false 256 | true 257 | 0.01 258 | 10 259 | true 260 | 1 261 | 25 262 | 263 | 1 264 | true 265 | false 266 | true 267 | valgrind 268 | 269 | 0 270 | 1 271 | 2 272 | 3 273 | 4 274 | 5 275 | 6 276 | 7 277 | 8 278 | 9 279 | 10 280 | 11 281 | 12 282 | 13 283 | 14 284 | 285 | 2 286 | 287 | DSInvertedIndex 288 | 289 | Qt4ProjectManager.Qt4RunConfiguration:D:/Documents/QtProjects/DSInvertedIndex/DSInvertedIndex.pro 290 | true 291 | 292 | DSInvertedIndex.pro 293 | false 294 | 295 | D:/Documents/QtProjects/build-DSInvertedIndex-Desktop_Qt_5_7_0_MSVC2015_64bit-Debug 296 | 3768 297 | false 298 | true 299 | false 300 | false 301 | true 302 | 303 | 1 304 | 305 | 306 | 307 | ProjectExplorer.Project.TargetCount 308 | 1 309 | 310 | 311 | ProjectExplorer.Project.Updater.FileVersion 312 | 18 313 | 314 | 315 | Version 316 | 18 317 | 318 | 319 | -------------------------------------------------------------------------------- /DSInvertedIndex.sdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/arminkz/InvertedIndexSearchEngine/fef8e2f49196f7ea6924886095823c2dab127f1c/DSInvertedIndex.sdf -------------------------------------------------------------------------------- /DSInvertedIndex.sln: -------------------------------------------------------------------------------- 1 |  2 | Microsoft Visual Studio Solution File, Format Version 12.00 3 | # Visual Studio 14 4 | VisualStudioVersion = 14.0.24720.0 5 | MinimumVisualStudioVersion = 10.0.40219.1 6 | Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "DSInvertedIndex", "DSInvertedIndex.vcxproj", "{101E53E2-B829-32BF-8409-32969194349F}" 7 | EndProject 8 | Global 9 | GlobalSection(SolutionConfigurationPlatforms) = preSolution 10 | Debug|x64 = Debug|x64 11 | Release|x64 = Release|x64 12 | EndGlobalSection 13 | GlobalSection(ProjectConfigurationPlatforms) = postSolution 14 | {101E53E2-B829-32BF-8409-32969194349F}.Debug|x64.ActiveCfg = Debug|x64 15 | {101E53E2-B829-32BF-8409-32969194349F}.Debug|x64.Build.0 = Debug|x64 16 | {101E53E2-B829-32BF-8409-32969194349F}.Release|x64.ActiveCfg = Release|x64 17 | {101E53E2-B829-32BF-8409-32969194349F}.Release|x64.Build.0 = Release|x64 18 | EndGlobalSection 19 | GlobalSection(SolutionProperties) = preSolution 20 | HideSolutionNode = FALSE 21 | EndGlobalSection 22 | EndGlobal 23 | -------------------------------------------------------------------------------- /DSInvertedIndex.vcxproj: -------------------------------------------------------------------------------- 1 |  2 | 3 | 4 | 5 | Release 6 | x64 7 | 8 | 9 | Debug 10 | x64 11 | 12 | 13 | 14 | {101E53E2-B829-32BF-8409-32969194349F} 15 | DSInvertedIndex 16 | Qt4VSv1.0 17 | 18 | 19 | 20 | v140 21 | release\ 22 | false 23 | NotSet 24 | Application 25 | release\ 26 | DSInvertedIndex 27 | 28 | 29 | v140 30 | debug\ 31 | false 32 | NotSet 33 | Application 34 | debug\ 35 | DSInvertedIndex 36 | 37 | 38 | 39 | 40 | 41 | 42 | 43 | 44 | 45 | 46 | 47 | release\ 48 | $(Platform)\$(Configuration)\ 49 | DSInvertedIndex 50 | true 51 | false 52 | debug\ 53 | $(Platform)\$(Configuration)\ 54 | DSInvertedIndex 55 | true 56 | 57 | 58 | 59 | .;$(QTDIR)\include;$(QTDIR)\include\QtWidgets;$(QTDIR)\include\QtGui;$(QTDIR)\include\QtANGLE;$(QTDIR)\include\QtCore;release;.;$(QTDIR)\mkspecs\win32-msvc2015;.\GeneratedFiles;%(AdditionalIncludeDirectories) 60 | -Zc:strictStrings -Zc:throwingNew -w34100 -w34189 -w44996 -w44456 -w44457 -w44458 %(AdditionalOptions) 61 | release\ 62 | false 63 | None 64 | 4577;%(DisableSpecificWarnings) 65 | Sync 66 | $(IntDir) 67 | MaxSpeed 68 | _WINDOWS;UNICODE;WIN32;WIN64;QT_NO_DEBUG;QT_WIDGETS_LIB;QT_GUI_LIB;QT_CORE_LIB;NDEBUG;%(PreprocessorDefinitions) 69 | false 70 | $(IntDir)vc$(PlatformToolsetVersion).pdb 71 | MultiThreadedDLL 72 | true 73 | true 74 | true 75 | Level3 76 | 77 | 78 | $(QTDIR)\lib\qtmain.lib;shell32.lib;$(QTDIR)\lib\Qt5Widgets.lib;$(QTDIR)\lib\Qt5Gui.lib;$(QTDIR)\lib\Qt5Core.lib;%(AdditionalDependencies) 79 | $(QTDIR)\lib;C:\utils\postgresql\pgsql\lib;C:\utils\my_sql\my_sql\lib;$(QTDIR)\lib;%(AdditionalLibraryDirectories) 80 | "/MANIFESTDEPENDENCY:type='win32' name='Microsoft.Windows.Common-Controls' version='6.0.0.0' publicKeyToken='6595b64144ccf1df' language='*' processorArchitecture='*'" %(AdditionalOptions) 81 | true 82 | false 83 | true 84 | false 85 | $(OutDir)\DSInvertedIndex.exe 86 | true 87 | Windows 88 | true 89 | 90 | 91 | Unsigned 92 | None 93 | 0 94 | 95 | 96 | _WINDOWS;UNICODE;WIN32;WIN64;QT_NO_DEBUG;QT_WIDGETS_LIB;QT_GUI_LIB;QT_CORE_LIB;%(PreprocessorDefinitions) 97 | 98 | 99 | 100 | 101 | .;$(QTDIR)\include;$(QTDIR)\include\QtWidgets;$(QTDIR)\include\QtGui;$(QTDIR)\include\QtANGLE;$(QTDIR)\include\QtCore;debug;.;$(QTDIR)\mkspecs\win32-msvc2015;.\GeneratedFiles;%(AdditionalIncludeDirectories) 102 | -Zc:strictStrings -Zc:throwingNew -w34100 -w34189 -w44996 -w44456 -w44457 -w44458 %(AdditionalOptions) 103 | debug\ 104 | false 105 | ProgramDatabase 106 | 4577;%(DisableSpecificWarnings) 107 | Sync 108 | $(IntDir) 109 | Disabled 110 | _WINDOWS;UNICODE;WIN32;WIN64;QT_WIDGETS_LIB;QT_GUI_LIB;QT_CORE_LIB;%(PreprocessorDefinitions) 111 | false 112 | MultiThreadedDebugDLL 113 | true 114 | true 115 | true 116 | Level3 117 | $(IntDir)vc$(PlatformToolsetVersion).pdb 118 | 119 | 120 | $(QTDIR)\lib\qtmaind.lib;shell32.lib;$(QTDIR)\lib\Qt5Widgetsd.lib;$(QTDIR)\lib\Qt5Guid.lib;$(QTDIR)\lib\Qt5Cored.lib;%(AdditionalDependencies) 121 | $(QTDIR)\lib;C:\utils\postgresql\pgsql\lib;C:\utils\my_sql\my_sql\lib;$(QTDIR)\lib;%(AdditionalLibraryDirectories) 122 | "/MANIFESTDEPENDENCY:type='win32' name='Microsoft.Windows.Common-Controls' version='6.0.0.0' publicKeyToken='6595b64144ccf1df' language='*' processorArchitecture='*'" %(AdditionalOptions) 123 | true 124 | true 125 | true 126 | $(OutDir)\DSInvertedIndex.exe 127 | true 128 | Windows 129 | true 130 | 131 | 132 | Unsigned 133 | None 134 | 0 135 | 136 | 137 | _WINDOWS;UNICODE;WIN32;WIN64;QT_WIDGETS_LIB;QT_GUI_LIB;QT_CORE_LIB;_DEBUG;%(PreprocessorDefinitions) 138 | 139 | 140 | 141 | 142 | true 143 | 144 | 145 | true 146 | 147 | 148 | 149 | 150 | 151 | 152 | 153 | 154 | 155 | 156 | 157 | 158 | 159 | 160 | 161 | 162 | 163 | 164 | 165 | 166 | "$(QTDIR)\bin\moc.exe" "%(FullPath)" -o ".\GeneratedFiles\$(ConfigurationName)\moc_%(Filename).cpp" -D_WINDOWS -DUNICODE -DWIN32 -DWIN64 -DQT_NO_DEBUG -DQT_WIDGETS_LIB -DQT_GUI_LIB -DQT_CORE_LIB -DNDEBUG "-I." "-I$(QTDIR)\include" "-I$(QTDIR)\include\QtWidgets" "-I$(QTDIR)\include\QtGui" "-I$(QTDIR)\include\QtANGLE" "-I$(QTDIR)\include\QtCore" "-I.\release" "-I$(QTDIR)\mkspecs\win32-msvc2015" "-I.\GeneratedFiles" 167 | Moc%27ing mainwindow.h... 168 | "$(QTDIR)\bin\moc.exe" "%(FullPath)" -o ".\GeneratedFiles\$(ConfigurationName)\moc_%(Filename).cpp" -D_WINDOWS -DUNICODE -DWIN32 -DWIN64 -DQT_WIDGETS_LIB -DQT_GUI_LIB -DQT_CORE_LIB "-I." "-I$(QTDIR)\include" "-I$(QTDIR)\include\QtWidgets" "-I$(QTDIR)\include\QtGui" "-I$(QTDIR)\include\QtANGLE" "-I$(QTDIR)\include\QtCore" "-I.\debug" "-I$(QTDIR)\mkspecs\win32-msvc2015" "-I.\GeneratedFiles" 169 | Moc%27ing mainwindow.h... 170 | .\GeneratedFiles\$(ConfigurationName)\moc_%(Filename).cpp 171 | .\GeneratedFiles\$(ConfigurationName)\moc_%(Filename).cpp 172 | $(QTDIR)\bin\moc.exe;%(FullPath) 173 | $(QTDIR)\bin\moc.exe;%(FullPath) 174 | 175 | 176 | 177 | 178 | Document 179 | $(QTDIR)\bin\uic.exe;%(AdditionalInputs) 180 | "$(QTDIR)\bin\uic.exe" -o ".\GeneratedFiles\ui_%(Filename).h" "%(FullPath)" 181 | Uic%27ing %(Identity)... 182 | .\GeneratedFiles\ui_%(Filename).h;%(Outputs) 183 | $(QTDIR)\bin\uic.exe;%(AdditionalInputs) 184 | "$(QTDIR)\bin\uic.exe" -o ".\GeneratedFiles\ui_%(Filename).h" "%(FullPath)" 185 | Uic%27ing %(Identity)... 186 | .\GeneratedFiles\ui_%(Filename).h;%(Outputs) 187 | 188 | 189 | 190 | 191 | 192 | 193 | 194 | 195 | 196 | -------------------------------------------------------------------------------- /DSInvertedIndex.vcxproj.filters: -------------------------------------------------------------------------------- 1 |  2 | 3 | 4 | 5 | {99349809-55BA-4b9d-BF79-8FDBB0286EB3} 6 | ui 7 | false 8 | 9 | 10 | {99349809-55BA-4b9d-BF79-8FDBB0286EB3} 11 | ui 12 | false 13 | 14 | 15 | {71ED8ED8-ACB9-4CE9-BBE1-E00B30144E11} 16 | cpp;c;cxx;moc;h;def;odl;idl;res; 17 | 18 | 19 | {71ED8ED8-ACB9-4CE9-BBE1-E00B30144E11} 20 | cpp;c;cxx;moc;h;def;odl;idl;res; 21 | 22 | 23 | {93995380-89BD-4b04-88EB-625FBE52EBFB} 24 | h;hpp;hxx;hm;inl;inc;xsd 25 | 26 | 27 | {93995380-89BD-4b04-88EB-625FBE52EBFB} 28 | h;hpp;hxx;hm;inl;inc;xsd 29 | 30 | 31 | {4FC737F1-C7A5-4376-A066-2A32D752A2FF} 32 | cpp;c;cxx;def;odl;idl;hpj;bat;asm;asmx 33 | 34 | 35 | {4FC737F1-C7A5-4376-A066-2A32D752A2FF} 36 | cpp;c;cxx;def;odl;idl;hpj;bat;asm;asmx 37 | 38 | 39 | {bf0a8b29-2eeb-4bce-a6d1-730758b90472} 40 | cpp;moc 41 | False 42 | 43 | 44 | {a33d0ea3-2c78-4f05-96f8-97d800c6efcb} 45 | cpp;moc 46 | False 47 | 48 | 49 | 50 | 51 | Source Files 52 | 53 | 54 | Source Files 55 | 56 | 57 | Generated Files\Debug 58 | 59 | 60 | Generated Files\Release 61 | 62 | 63 | 64 | 65 | Header Files 66 | 67 | 68 | Header Files 69 | 70 | 71 | Header Files 72 | 73 | 74 | Header Files 75 | 76 | 77 | Header Files 78 | 79 | 80 | Generated Files 81 | 82 | 83 | Header Files 84 | 85 | 86 | Header Files 87 | 88 | 89 | Header Files 90 | 91 | 92 | Header Files 93 | 94 | 95 | Header Files 96 | 97 | 98 | Header Files 99 | 100 | 101 | Header Files 102 | 103 | 104 | Header Files 105 | 106 | 107 | Header Files 108 | 109 | 110 | 111 | 112 | Form Files 113 | 114 | 115 | -------------------------------------------------------------------------------- /DSInvertedIndex.vcxproj.user: -------------------------------------------------------------------------------- 1 |  2 | 3 | 4 | 5 | C:\Qt\Qt5.7.0\5.7\msvc2015_64 6 | PATH=$(QTDIR)\bin%3b"$(QTDIR)\bin%3b$(QTDIR)\bin%3b"$(QTDIR)\bin%3b$(QTDIR)\bin%3b"$(QTDIR)\bin%3b$(QTDIR)\bin%3b"$(QTDIR)\bin%3b$(QTDIR)\bin%3b"$(QTDIR)\bin%3b$(QTDIR)\bin%3b"$(QTDIR)\bin%3b$(QTDIR)\bin%3b$(PATH) 7 | 8 | 9 | C:\Qt\Qt5.7.0\5.7\msvc2015_64 10 | PATH=$(QTDIR)\bin%3b"$(QTDIR)\bin%3b$(QTDIR)\bin%3b"$(QTDIR)\bin%3b$(QTDIR)\bin%3b"$(QTDIR)\bin%3b$(QTDIR)\bin%3b"$(QTDIR)\bin%3b$(QTDIR)\bin%3b"$(QTDIR)\bin%3b$(QTDIR)\bin%3b"$(QTDIR)\bin%3b$(QTDIR)\bin%3b$(PATH) 11 | 12 | -------------------------------------------------------------------------------- /HashMap.h: -------------------------------------------------------------------------------- 1 | #ifndef HASHMAP_H 2 | #define HASHMAP_H 3 | 4 | #include "HashNode.h" 5 | #include 6 | 7 | template 8 | class HashMap 9 | { 10 | public: 11 | //Constructor / Destructor 12 | HashMap(); 13 | ~HashMap(); 14 | 15 | void put(QString,T); 16 | HashNode* get(QString); 17 | void remove(QString); 18 | 19 | QString printHtml(); 20 | 21 | private: 22 | HashNode **table; 23 | unsigned long hashFunc(QString); 24 | }; 25 | 26 | template 27 | HashMap::HashMap(){ 28 | table = new HashNode*[2000](); 29 | } 30 | 31 | template 32 | HashMap::~HashMap(){ 33 | for (int i = 0; i < 2000; ++i) { 34 | HashNode *entry = table[i]; 35 | while (entry != NULL) { 36 | HashNode *prev = entry; 37 | entry = entry->next; 38 | delete prev; 39 | } 40 | table[i] = NULL; 41 | } 42 | // destroy the hash table 43 | delete [] table; 44 | } 45 | 46 | template 47 | unsigned long HashMap::hashFunc(QString key){ 48 | return qHash(key) % 1999 + 1; 49 | } 50 | 51 | template 52 | void HashMap::put(QString key, T value) { 53 | unsigned long hashValue = hashFunc(key); 54 | 55 | HashNode *prev = NULL; 56 | HashNode *entry = table[hashValue]; 57 | 58 | while (entry != NULL && entry->key != key) { 59 | prev = entry; 60 | entry = entry->next; 61 | } 62 | 63 | if (entry == NULL) { 64 | entry = new HashNode(key, value); 65 | if (prev == NULL) { 66 | // insert as first 67 | table[hashValue] = entry; 68 | } else { 69 | prev->next = entry; 70 | } 71 | } else { 72 | // just update the value 73 | entry->data = value; 74 | } 75 | } 76 | 77 | template 78 | void HashMap::remove(QString key) { 79 | unsigned long hashValue = hashFunc(key); 80 | HashNode *prev = NULL; 81 | HashNode *entry = table[hashValue]; 82 | 83 | while (entry != NULL && entry->key != key) { 84 | prev = entry; 85 | entry = entry->next; 86 | } 87 | 88 | if (entry == NULL) { 89 | // key not found 90 | return; 91 | } 92 | else { 93 | if (prev == NULL) { 94 | // remove first bucket of the list 95 | table[hashValue] = entry->next; 96 | } else { 97 | prev->next = entry->next; 98 | } 99 | delete entry; 100 | } 101 | } 102 | 103 | template 104 | HashNode* HashMap::get(QString key){ 105 | unsigned long hashValue = hashFunc(key); 106 | HashNode *entry = table[hashValue]; 107 | 108 | while (entry != NULL) { 109 | if (entry->key == key) { 110 | return entry; 111 | } 112 | entry = entry->next; 113 | } 114 | return NULL; 115 | } 116 | 117 | template 118 | QString HashMap::printHtml() 119 | { 120 | QString html = ""; 121 | 122 | for(int i=0;i<2000;i++){ 123 | HashNode* entry = table[i]; 124 | while(entry != NULL){ 125 | html += ""; 126 | entry = entry->next; 127 | } 128 | } 129 | 130 | html += "
" + entry->key + " -> " + entry->data + "
"; 131 | return html; 132 | 133 | } 134 | 135 | #endif // HASHMAP_H 136 | -------------------------------------------------------------------------------- /HashNode.h: -------------------------------------------------------------------------------- 1 | #ifndef HASHNODE_H 2 | #define HASHNODE_H 3 | 4 | template 5 | class HashNode 6 | { 7 | 8 | public: 9 | HashNode(QString,T); 10 | T data; 11 | QString key; 12 | HashNode* next; //pointer to next hash node (chaining) 13 | 14 | virtual operator QString() { 15 | QString result = key + " -> " + data; 16 | return result; 17 | } 18 | 19 | private: 20 | 21 | }; 22 | 23 | template 24 | HashNode::HashNode(QString key,T data){ 25 | this->key = key; 26 | this->data = data; 27 | this->next = NULL; 28 | } 29 | 30 | 31 | #endif // HASHNODE_H 32 | -------------------------------------------------------------------------------- /IndexAddress.h: -------------------------------------------------------------------------------- 1 | #ifndef INDEXADDRESS_H 2 | #define INDEXADDRESS_H 3 | 4 | #include 5 | 6 | //Class for Storing Index Data 7 | class IndexAddress{ 8 | public: 9 | QString filename; 10 | int word; 11 | IndexAddress(); 12 | IndexAddress(QString,int); 13 | 14 | bool operator ==(const IndexAddress &ia){ 15 | return (ia.filename == this->filename && ia.word==this->word); 16 | } 17 | 18 | virtual operator QString(){ 19 | return "(" + filename + " : " + QString::number(word) + ")"; 20 | } 21 | }; 22 | 23 | IndexAddress::IndexAddress(){ 24 | 25 | } 26 | 27 | IndexAddress::IndexAddress(QString fn,int n){ 28 | filename = fn; 29 | word = n; 30 | } 31 | 32 | #endif // INDEXADDRESS_H 33 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | {one line to give the program's name and a brief idea of what it does.} 635 | Copyright (C) {year} {name of author} 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | {project} Copyright (C) {year} {fullname} 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | -------------------------------------------------------------------------------- /LLNode.h: -------------------------------------------------------------------------------- 1 | #ifndef LLNODE_H 2 | #define LLNODE_H 3 | 4 | template 5 | class LinkedList; 6 | 7 | template 8 | class LLNode 9 | { 10 | friend class LinkedList; 11 | 12 | public: 13 | LLNode(T); //constructor 14 | T data; 15 | LLNode* link; 16 | 17 | private: 18 | 19 | }; 20 | 21 | template 22 | LLNode::LLNode(T dataIn) 23 | { 24 | data = dataIn; 25 | link = 0; 26 | } 27 | 28 | /*template 29 | T ListNode::getData() //returns data stored in node 30 | { 31 | return data; 32 | }*/ 33 | 34 | 35 | #endif // LLNODE_H 36 | -------------------------------------------------------------------------------- /LinkedList.h: -------------------------------------------------------------------------------- 1 | #ifndef LINKEDLIST_H 2 | #define LINKEDLIST_H 3 | 4 | #include "LLNode.h" 5 | #include 6 | #include 7 | 8 | 9 | template 10 | class LinkedList 11 | { 12 | public: 13 | LinkedList(); //constructor 14 | ~LinkedList(); //destructor 15 | void addWithSort(T); 16 | void add(T); 17 | bool isEmpty(); 18 | int count(); 19 | void remove(int); 20 | 21 | LLNode * nodeAt(int); 22 | LLNode* search(T); 23 | QString toString(); 24 | 25 | LLNode * startPtr; 26 | LLNode * endPtr; 27 | 28 | LLNode * iterPtr; 29 | LLNode * iterPrevPtr; 30 | LLNode * iterPrev2Ptr; 31 | void iterBegin(); 32 | bool iterHasNext(); 33 | LLNode * iterNext(); 34 | void iterDel(); 35 | 36 | virtual operator QString(){ 37 | return toString(); 38 | } 39 | 40 | private: 41 | void insertBegin(T); 42 | void insertEnd(T); 43 | }; 44 | 45 | 46 | 47 | template 48 | LinkedList::LinkedList() //creates list with start and end as NULL 49 | { 50 | startPtr = 0; 51 | endPtr = 0; 52 | } 53 | 54 | template 55 | LinkedList::~LinkedList() 56 | { 57 | /* if (!isEmpty()) 58 | { 59 | LLNode * currentPtr = startPtr; 60 | LLNode * tempPtr; 61 | 62 | while (currentPtr != 0) // delete remaining nodes 63 | { 64 | tempPtr = currentPtr; 65 | currentPtr = currentPtr->link; 66 | delete tempPtr; 67 | } 68 | }*/ 69 | } 70 | 71 | 72 | template 73 | bool LinkedList::isEmpty() 74 | { 75 | return (startPtr == 0); 76 | } 77 | 78 | template 79 | int LinkedList::count() 80 | { 81 | int c = 0; 82 | LLNode * p = startPtr; 83 | while (p != NULL) { 84 | c++; 85 | p = p->link; 86 | } 87 | return c; 88 | } 89 | 90 | template 91 | void LinkedList::insertBegin(T dataIn) 92 | { 93 | if(isEmpty()) 94 | { 95 | LLNode * newPtr = new LLNode(dataIn); 96 | startPtr = newPtr; 97 | endPtr = newPtr; 98 | }else 99 | { 100 | LLNode * newPtr = new LLNode(dataIn); 101 | newPtr->link = startPtr; 102 | startPtr = newPtr; 103 | } 104 | } 105 | 106 | template 107 | void LinkedList::insertEnd(T dataIn) 108 | { 109 | if(isEmpty()) 110 | { 111 | LLNode * newPtr = new LLNode(dataIn); 112 | startPtr = newPtr; 113 | endPtr = newPtr; 114 | }else 115 | { 116 | LLNode * newPtr = new LLNode(dataIn); 117 | endPtr->link = newPtr; 118 | endPtr = newPtr; 119 | } 120 | } 121 | 122 | template 123 | void LinkedList::add(T dataIn) //adds node (without sort) 124 | { 125 | insertBegin(dataIn); 126 | } 127 | 128 | template 129 | void LinkedList::addWithSort(T dataIn) //adds node (with sort) 130 | { 131 | if(isEmpty()) 132 | { 133 | insertBegin(dataIn); 134 | }else 135 | { 136 | if(dataIn < startPtr->data) 137 | { 138 | insertBegin(dataIn); 139 | } 140 | else if(dataIn >= endPtr->data) 141 | { 142 | insertEnd(dataIn); 143 | } 144 | else 145 | { 146 | LLNode * currentPtr = startPtr; 147 | LLNode * newPtr = new LLNode(dataIn); 148 | while(currentPtr != endPtr) 149 | { 150 | if((newPtr->data < currentPtr->link->data) && (newPtr->data >= currentPtr->data)) 151 | { 152 | LLNode * next = currentPtr->link; 153 | currentPtr->link = newPtr; 154 | newPtr->link = next; 155 | break; 156 | } 157 | currentPtr = currentPtr->link; //moves to the next node in the list 158 | } 159 | } 160 | } 161 | } 162 | 163 | template 164 | LLNode * LinkedList::nodeAt(int n) 165 | { 166 | LLNode * p = startPtr; 167 | while (n) { 168 | p = p->link; 169 | n--; 170 | } 171 | return p; 172 | } 173 | 174 | template 175 | void LinkedList::remove(int n) 176 | { 177 | LLNode * q = 0; 178 | LLNode * p = startPtr; 179 | while (n) { 180 | q = p; 181 | p = p->link; 182 | n--; 183 | } 184 | 185 | if (p != NULL) { 186 | if (q != NULL) { 187 | q->link = p->link; 188 | delete p; 189 | } 190 | else { 191 | startPtr = p->link; 192 | delete p; 193 | } 194 | } 195 | 196 | 197 | } 198 | 199 | template 200 | QString LinkedList::toString() 201 | { 202 | if(isEmpty()) 203 | { 204 | return "n/a"; 205 | 206 | }else 207 | { 208 | QString res = " "; 209 | LLNode * currentPtr = startPtr; 210 | bool first = true; 211 | 212 | while(currentPtr != 0) 213 | { 214 | if(!first){ 215 | res += " , "; 216 | }else{ 217 | first = false; 218 | } 219 | 220 | QString ta = currentPtr->data; 221 | res += ta; 222 | currentPtr = currentPtr->link; 223 | } 224 | res += " "; 225 | return res; 226 | } 227 | } 228 | 229 | template 230 | void LinkedList::iterBegin() { 231 | iterPrev2Ptr = NULL; 232 | iterPrevPtr = NULL; 233 | iterPtr = startPtr; 234 | } 235 | 236 | template 237 | bool LinkedList::iterHasNext() { 238 | return iterPtr != NULL; 239 | } 240 | 241 | template 242 | LLNode * LinkedList::iterNext() { 243 | LLNode * res = iterPtr; 244 | iterPrev2Ptr = iterPrevPtr; 245 | iterPrevPtr = iterPtr; 246 | iterPtr = iterPtr->link; 247 | return res; 248 | } 249 | 250 | template 251 | void LinkedList::iterDel() { 252 | if (iterPrevPtr) { 253 | if (iterPrev2Ptr) { 254 | iterPrev2Ptr->link = iterPrevPtr->link; 255 | delete iterPrevPtr; 256 | } 257 | else { 258 | startPtr = iterPrevPtr->link; 259 | delete iterPrevPtr; 260 | iterPrev2Ptr = NULL; 261 | iterPrevPtr = NULL; 262 | iterPtr = startPtr; 263 | } 264 | } 265 | 266 | } 267 | 268 | /*template 269 | LLNode* LinkedList::search(T key) 270 | { 271 | LLNode* nodePtr; 272 | bool found = false; 273 | 274 | nodePtr = startPtr; 275 | 276 | while((!found) && (nodePtr != NULL)) //runs through list until data is found within a node or end of list is reached 277 | { 278 | if(nodePtr->data == key) //if the node's data equals the key then the node has been found 279 | found = true; 280 | else 281 | nodePtr = nodePtr->nextPtr; //moves to next node in list 282 | } 283 | return nodePtr; //returns pointer to the node that contains data equal to key (NULL if not found) 284 | }*/ 285 | 286 | #endif // LINKEDLIST_H 287 | -------------------------------------------------------------------------------- /LinkedListA.h: -------------------------------------------------------------------------------- 1 | #ifndef LINKEDLIST_H_A 2 | #define LINKEDLIST_H_A 3 | 4 | #include "LLNode.h" 5 | #include 6 | #include 7 | 8 | 9 | template 10 | class LinkedListA 11 | { 12 | public: 13 | LinkedListA(); //constructor 14 | ~LinkedListA(); //destructor 15 | void addWithSort(T); 16 | void add(T); 17 | bool isEmpty(); 18 | int count(); 19 | void remove(int); 20 | 21 | LLNode * nodeAt(int); 22 | LLNode* search(T); 23 | 24 | LLNode * startPtr; 25 | LLNode * endPtr; 26 | 27 | LLNode * iterPtr; 28 | LLNode * iterPrevPtr; 29 | void iterBegin(); 30 | bool iterHasNext(); 31 | LLNode * iterNext(); 32 | void iterDel(); 33 | 34 | private: 35 | void insertBegin(T); 36 | void insertEnd(T); 37 | }; 38 | 39 | 40 | 41 | template 42 | LinkedListA::LinkedListA() //creates list with start and end as NULL 43 | { 44 | startPtr = 0; 45 | endPtr = 0; 46 | } 47 | 48 | template 49 | LinkedListA::~LinkedListA() 50 | { 51 | /* if (!isEmpty()) 52 | { 53 | LLNode * currentPtr = startPtr; 54 | LLNode * tempPtr; 55 | 56 | while (currentPtr != 0) // delete remaining nodes 57 | { 58 | tempPtr = currentPtr; 59 | currentPtr = currentPtr->link; 60 | delete tempPtr; 61 | } 62 | }*/ 63 | } 64 | 65 | 66 | template 67 | bool LinkedListA::isEmpty() 68 | { 69 | return (startPtr == 0); 70 | } 71 | 72 | template 73 | int LinkedListA::count() 74 | { 75 | int c = 0; 76 | LLNode * p = startPtr; 77 | while (p != NULL) { 78 | c++; 79 | p = p->link; 80 | } 81 | return c; 82 | } 83 | 84 | template 85 | void LinkedListA::insertBegin(T dataIn) 86 | { 87 | if (isEmpty()) 88 | { 89 | LLNode * newPtr = new LLNode(dataIn); 90 | startPtr = newPtr; 91 | endPtr = newPtr; 92 | } 93 | else 94 | { 95 | LLNode * newPtr = new LLNode(dataIn); 96 | newPtr->link = startPtr; 97 | startPtr = newPtr; 98 | } 99 | } 100 | 101 | template 102 | void LinkedListA::insertEnd(T dataIn) 103 | { 104 | if (isEmpty()) 105 | { 106 | LLNode * newPtr = new LLNode(dataIn); 107 | startPtr = newPtr; 108 | endPtr = newPtr; 109 | } 110 | else 111 | { 112 | LLNode * newPtr = new LLNode(dataIn); 113 | endPtr->link = newPtr; 114 | endPtr = newPtr; 115 | } 116 | } 117 | 118 | template 119 | void LinkedListA::add(T dataIn) //adds node (without sort) 120 | { 121 | insertBegin(dataIn); 122 | } 123 | 124 | template 125 | void LinkedListA::addWithSort(T dataIn) //adds node (with sort) 126 | { 127 | if (isEmpty()) 128 | { 129 | insertBegin(dataIn); 130 | } 131 | else 132 | { 133 | if (dataIn < startPtr->data) 134 | { 135 | insertBegin(dataIn); 136 | } 137 | else if (dataIn >= endPtr->data) 138 | { 139 | insertEnd(dataIn); 140 | } 141 | else 142 | { 143 | LLNode * currentPtr = startPtr; 144 | LLNode * newPtr = new LLNode(dataIn); 145 | while (currentPtr != endPtr) 146 | { 147 | if ((newPtr->data < currentPtr->link->data) && (newPtr->data >= currentPtr->data)) 148 | { 149 | LLNode * next = currentPtr->link; 150 | currentPtr->link = newPtr; 151 | newPtr->link = next; 152 | break; 153 | } 154 | currentPtr = currentPtr->link; //moves to the next node in the list 155 | } 156 | } 157 | } 158 | } 159 | 160 | template 161 | LLNode * LinkedListA::nodeAt(int n) 162 | { 163 | LLNode * p = startPtr; 164 | while (n) { 165 | p = p->link; 166 | n--; 167 | } 168 | return p; 169 | } 170 | 171 | template 172 | void LinkedListA::remove(int n) 173 | { 174 | LLNode * q = 0; 175 | LLNode * p = startPtr; 176 | while (n) { 177 | q = p; 178 | p = p->link; 179 | n--; 180 | } 181 | 182 | if (p != NULL) { 183 | if (q != NULL) { 184 | q->link = p->link; 185 | delete p; 186 | } 187 | else { 188 | startPtr = p->link; 189 | delete p; 190 | } 191 | } 192 | 193 | 194 | } 195 | 196 | 197 | template 198 | void LinkedListA::iterBegin() { 199 | iterPrevPtr = NULL; 200 | iterPtr = startPtr; 201 | } 202 | 203 | template 204 | bool LinkedListA::iterHasNext() { 205 | return iterPtr != NULL; 206 | } 207 | 208 | template 209 | LLNode * LinkedListA::iterNext() { 210 | LLNode * res = iterPtr; 211 | iterPrevPtr = iterPtr; 212 | iterPtr = iterPtr->link; 213 | return res; 214 | } 215 | 216 | template 217 | void LinkedListA::iterDel() { 218 | if (startPtr && iterPtr) { 219 | if (iterPrevPtr) { 220 | iterPrevPtr->link = iterPtr->link; 221 | delete iterPtr; 222 | } 223 | else { 224 | startPtr = iterPtr->link; 225 | delete iterPtr; 226 | iterPtr = startPtr; 227 | iterPrevPtr = NULL; 228 | } 229 | } 230 | 231 | } 232 | 233 | #endif // LINKEDLIST_H 234 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # InvertedIndexSearchEngine 2 | simple C++/Qt Project for Searching in text files using BST / TST / Trie / Hash Data Structures. 3 | -------------------------------------------------------------------------------- /Stack.h: -------------------------------------------------------------------------------- 1 | #ifndef STACK_H 2 | #define STACK_H 3 | 4 | #include "LLNode.h" 5 | #include "LinkedListA.h" 6 | 7 | template 8 | class Stack { 9 | private: 10 | LinkedListA * A; 11 | public : 12 | Stack(); 13 | void push(T data); 14 | int pop(T &data); 15 | int pop(); 16 | 17 | bool isEmpty(); 18 | //bool isFull(); 19 | }; 20 | 21 | template 22 | Stack::Stack() { 23 | A = new LinkedListA; 24 | } 25 | 26 | template 27 | bool Stack::isEmpty() { 28 | return A->isEmpty(); 29 | } 30 | 31 | template 32 | void Stack::push(T data) { 33 | A->add(data); 34 | } 35 | 36 | template 37 | int Stack::pop(T &data) { 38 | if (!isEmpty()) { 39 | LLNode * lln = A->nodeAt(0); 40 | data = lln->data; 41 | A->remove(0); 42 | return 1; 43 | } 44 | return 0; 45 | } 46 | 47 | template 48 | int Stack::pop() { 49 | if (!isEmpty()) { 50 | A->remove(0); 51 | return 1; 52 | } 53 | return 0; 54 | } 55 | 56 | #endif 57 | -------------------------------------------------------------------------------- /TSNode.h: -------------------------------------------------------------------------------- 1 | #ifndef TSNODE_H 2 | #define TSNODE_H 3 | 4 | #include 5 | 6 | template 7 | class TST; 8 | 9 | template 10 | class TSNode 11 | { 12 | friend class TST; 13 | 14 | public: 15 | TSNode(); 16 | TSNode(QChar); 17 | 18 | T data; 19 | QChar key; 20 | bool tag; 21 | 22 | TSNode* LC; //pointer to left child 23 | TSNode* RC; //pointer to right child 24 | TSNode* MC; //pointer to middle child 25 | 26 | virtual operator QString() { 27 | QString result = ""; 28 | result += key; 29 | result += " -> " + data; 30 | return result; 31 | } 32 | 33 | private: 34 | 35 | }; 36 | 37 | template 38 | TSNode::TSNode() 39 | { 40 | tag = false; 41 | LC = 0; 42 | RC = 0; 43 | MC = 0; 44 | } 45 | 46 | template 47 | TSNode::TSNode(QChar keyIn) 48 | { 49 | tag = false; 50 | key = keyIn; 51 | LC = 0; 52 | RC = 0; 53 | MC = 0; 54 | //Do not set data (data is only for node's with positive tag) ! 55 | } 56 | 57 | #endif // TSNODE_H -------------------------------------------------------------------------------- /TST.h: -------------------------------------------------------------------------------- 1 | #ifndef TST_H 2 | #define TST_H 3 | 4 | #include 5 | #include 6 | 7 | template 8 | class TST { 9 | 10 | public: 11 | TST(); 12 | ~TST(); 13 | void insert(QString,T); 14 | TSNode* search(QString); 15 | QString printHtml(); 16 | 17 | private: 18 | TSNode* root; 19 | void destroy(TSNode*); 20 | TSNode* insert(TSNode*, QString, int, T); 21 | TSNode* search(TSNode*, QString, int); 22 | void printHtml(TSNode*,QString,QString&); 23 | }; 24 | 25 | template 26 | TST::TST() { 27 | root = NULL; 28 | } 29 | 30 | template 31 | TST::~TST() { 32 | destroy(root); 33 | } 34 | 35 | template 36 | void TST::destroy(TSNode* node) { 37 | if (!node) return; 38 | destroy(node->LC); 39 | destroy(node->MC); 40 | destroy(node->RC); 41 | delete node; 42 | } 43 | 44 | template 45 | void TST::insert(QString key, T data) { 46 | root = insert(root, key, 0, data); 47 | } 48 | 49 | template 50 | TSNode* TST::insert(TSNode* p, QString key, int index,T data) { 51 | 52 | QChar ci = key.at(index); //char at index 53 | 54 | if (!p) { 55 | p = new TSNode(ci); 56 | } 57 | 58 | if (p->key > ci) 59 | p->LC = insert(p->LC, key, index,data); 60 | else if (p->key < ci) 61 | p->RC = insert(p->RC, key, index,data); 62 | else if (index < key.count() - 1) 63 | p->MC = insert(p->MC, key, index + 1,data); 64 | else { 65 | //Leaf node ! 66 | p->tag = true; 67 | p->data = data; 68 | } 69 | 70 | return p; 71 | } 72 | 73 | template 74 | TSNode* TST::search(QString word) { 75 | return search(root, word, 0); 76 | } 77 | 78 | template 79 | TSNode* TST::search(TSNode * p, QString key, int index) { 80 | 81 | QChar ci = key.at(index); //char at index 82 | 83 | if (p == NULL) 84 | return NULL; 85 | 86 | if (p->key > ci) 87 | return search(p->LC, key, index); 88 | if (p->key < ci) 89 | return search(p->RC, key, index); 90 | if (index < key.count() - 1) 91 | return search(p->MC, key, index + 1); 92 | 93 | return p; 94 | } 95 | 96 | template 97 | QString TST::printHtml() { 98 | QString html = ""; 99 | printHtml(root, "", html); 100 | html += "
"; 101 | return html; 102 | } 103 | 104 | template 105 | void TST::printHtml(TSNode* node,QString pre,QString &result) { 106 | if (!node) return; 107 | 108 | if (node->tag) { 109 | result += "" + pre + node->key + " -> " + node->data + ""; 110 | } 111 | 112 | printHtml(node->RC, pre , result); 113 | printHtml(node->MC, pre + node->key, result); 114 | printHtml(node->LC, pre , result); 115 | } 116 | 117 | 118 | #endif -------------------------------------------------------------------------------- /Trie.h: -------------------------------------------------------------------------------- 1 | #ifndef TRIE_H 2 | #define TRIE_H 3 | 4 | #include "TrieNode.h" 5 | #include 6 | 7 | template 8 | class Trie 9 | { 10 | public: 11 | Trie(); 12 | ~Trie(); 13 | void insert(QString,T); 14 | void remove(QString); 15 | TrieNode * search(QString); 16 | QString printHtml(); 17 | 18 | private: 19 | TrieNode * root; 20 | void destroy(TrieNode*); 21 | void printHtml(TrieNode*, QString, QString&); 22 | 23 | }; 24 | 25 | template 26 | Trie::Trie() { 27 | root = new TrieNode; 28 | } 29 | 30 | template 31 | Trie::~Trie() { 32 | destroy(root); 33 | } 34 | 35 | template 36 | void Trie::destroy(TrieNode* node) { 37 | if (!node) return; 38 | 39 | for (int i = 0; i < 26; ++i) { 40 | if (node->children[i] != NULL) { 41 | destroy(node->children[i]); 42 | } 43 | } 44 | delete node; 45 | } 46 | 47 | template 48 | void Trie::insert(QString text, T data) 49 | { 50 | TrieNode* temp = root; 51 | 52 | for (int i =0;i < text.count();i++) { 53 | int index = text.at(i).toLatin1() - 'a'; 54 | if (temp->children[index] == NULL) { 55 | temp->children[index] = new TrieNode; 56 | temp->children[index]->parent = temp; // Assigning parent 57 | } 58 | 59 | temp = temp->children[index]; 60 | } 61 | 62 | temp->tag = true; 63 | temp->data = data; //Mark the occurence of the word 64 | } 65 | 66 | template 67 | TrieNode* Trie::search(QString text) 68 | { 69 | TrieNode* temp = root; 70 | for(int i=0; i< text.count();i++) { 71 | int index = text.at(i).toLatin1() - 'a'; 72 | if (temp->children[index] != NULL) { 73 | temp = temp->children[index]; 74 | } 75 | else { 76 | return NULL; 77 | } 78 | } 79 | 80 | return temp; 81 | } 82 | 83 | template 84 | void Trie::remove(QString word) 85 | { 86 | TrieNode* temp = search(word); 87 | if (temp == NULL) { 88 | // Word not found 89 | return; 90 | } 91 | 92 | delete temp->data; // Deleting the occurence 93 | temp->tag = false; 94 | 95 | bool noChild = true; 96 | int childCount = 0; 97 | 98 | 99 | // Checking children of current node 100 | for (int i = 0; i < 26; ++i) { 101 | if (temp->children[i] != NULL) { 102 | noChild = false; 103 | ++childCount; 104 | } 105 | } 106 | 107 | if (!noChild) { 108 | return; 109 | } 110 | 111 | TrieNode* traverse; // variable to assist in traversal 112 | 113 | while (!temp->tag == 0 && temp->parent != NULL && childCount < 2) { 114 | 115 | traverse = temp->parent; 116 | 117 | //Null up the parent node 118 | for (i = 0; i < 26; ++i) { 119 | if (temp == traverse->children[i]) { 120 | traverse->children[i] = NULL; 121 | break; 122 | } 123 | } 124 | 125 | //delete this node 126 | delete temp; 127 | temp = traverse; 128 | 129 | for (i = 0; i < 26; ++i) { 130 | if (temp->children[i] != NULL) { 131 | ++childCount; 132 | } 133 | } 134 | } 135 | } 136 | 137 | template 138 | QString Trie::printHtml() { 139 | QString html = ""; 140 | printHtml(root, "", html); 141 | html += "
"; 142 | return html; 143 | } 144 | 145 | template 146 | void Trie::printHtml(TrieNode* node, QString pre, QString &result) 147 | { 148 | 149 | if (!node) return; 150 | 151 | if (node->tag) { 152 | result += "" + pre + " -> " + node->data + ""; 153 | } 154 | 155 | for (int i = 0; i < 26; ++i) { 156 | if (node->children[i] == NULL) { 157 | continue; 158 | } 159 | else { 160 | QChar c = QChar::fromLatin1((char)('a' + i)); 161 | 162 | printHtml(node->children[i], pre + c, result); 163 | } 164 | } 165 | 166 | } 167 | 168 | #endif // !TRIE_H 169 | -------------------------------------------------------------------------------- /TrieNode.h: -------------------------------------------------------------------------------- 1 | #ifndef TRIENODE_H 2 | #define TRIENODE_H 3 | 4 | template 5 | class Trie; 6 | 7 | template 8 | class TrieNode 9 | { 10 | friend class Trie; 11 | public: 12 | TrieNode(); 13 | 14 | T data; 15 | bool tag; 16 | 17 | TrieNode* parent; 18 | TrieNode* children[26]; 19 | 20 | }; 21 | 22 | template 23 | TrieNode::TrieNode() { 24 | for (int i = 0;i < 26;i++) { 25 | children[i] = NULL; 26 | } 27 | tag = false; 28 | } 29 | 30 | 31 | #endif // !TRIENODE_H 32 | -------------------------------------------------------------------------------- /main.cpp: -------------------------------------------------------------------------------- 1 | #include "mainwindow.h" 2 | #include 3 | #include 4 | #include 5 | 6 | int main(int argc, char *argv[]) 7 | { 8 | QApplication a(argc, argv); 9 | MainWindow w; 10 | w.show(); 11 | 12 | return a.exec(); 13 | } 14 | -------------------------------------------------------------------------------- /mainwindow.cpp: -------------------------------------------------------------------------------- 1 | #include "mainwindow.h" 2 | #include "ui_mainwindow.h" 3 | 4 | #include "LLNode.h" 5 | #include "LinkedList.h" 6 | #include "IndexAddress.h" 7 | #include "BSNode.h" 8 | #include "BST.h" 9 | #include "TrieNode.h" 10 | #include "Trie.h" 11 | #include "Stack.h" 12 | #include "TSNode.h" 13 | #include "TST.h" 14 | #include "HashNode.h" 15 | #include "HashMap.h" 16 | 17 | #include 18 | #include 19 | #include 20 | 21 | #include 22 | #include 23 | #include 24 | #include 25 | #include 26 | 27 | QString wdir = "D:\\Desktop\\DS\\docs"; 28 | QString swfile = "D:\\Desktop\\DS\\StopWords.txt"; 29 | 30 | QVector curFiles; 31 | 32 | BST> * BSTree; 33 | TST> * TSTree; 34 | Trie> * TrieTree; 35 | HashMap> * Hash; 36 | 37 | int bmode = 0; //0 BST //1 TST //2 Trie //3 Hash 38 | 39 | bool stopwordsEnable = false; 40 | BST * SW; 41 | 42 | void MainWindow::appendLog(QString log , bool withNewLine = true) 43 | { 44 | if(withNewLine) 45 | ui->cmdLog->append(log); 46 | else{ 47 | ui->cmdLog->moveCursor (QTextCursor::End); 48 | ui->cmdLog->insertPlainText(log); 49 | ui->cmdLog->moveCursor (QTextCursor::End); 50 | } 51 | 52 | //Move to end 53 | QTextCursor c = ui->cmdLog->textCursor(); 54 | c.movePosition(QTextCursor::End); 55 | ui->cmdLog->setTextCursor(c); 56 | } 57 | 58 | MainWindow::MainWindow(QWidget *parent) : 59 | QMainWindow(parent), 60 | ui(new Ui::MainWindow) 61 | { 62 | ui->setupUi(this); 63 | 64 | connect(ui->cmdText,SIGNAL(returnPressed()),this,SLOT(handleCmd())); 65 | 66 | BSTree = new BST>; 67 | 68 | appendLog("Inverted Index v1.0"); 69 | appendLog("Developed By : Armin Kazemi - 9431068"); 70 | appendLog("----------------------------"); 71 | appendLog(""); 72 | appendLog("Build Mode : BST"); 73 | appendLog("Stopwords : ON"); 74 | appendLog("use 'help' command to view available commands ! "); 75 | appendLog(""); 76 | 77 | initStopWords(); 78 | 79 | /*HashMap * hashTest = new HashMap; 80 | hashTest->put("key1",1); 81 | hashTest->put("key2",2); 82 | hashTest->put("key3",3); 83 | appendLog(*hashTest->get("key1"));*/ 84 | } 85 | 86 | MainWindow::~MainWindow() 87 | { 88 | delete ui; 89 | } 90 | 91 | QString getFileText(QString path){ 92 | QFile file(path); 93 | if (!file.open(QIODevice::ReadOnly | QIODevice::Text)) 94 | return ""; 95 | 96 | QTextStream in(&file); 97 | return in.readAll(); 98 | } 99 | 100 | void MainWindow::printTree(){ 101 | 102 | if(bmode==0){ //BST Mode 103 | if(BSTree) 104 | appendLog(BSTree->inOrderPrint()); 105 | }else if(bmode==1){ //TST Mode 106 | if (TSTree) 107 | appendLog(TSTree->printHtml()); 108 | }else if(bmode==2){ //Trie Mode 109 | if (TrieTree) 110 | appendLog(TrieTree->printHtml()); 111 | }else if(bmode==3){ //Hash Mode 112 | if (Hash) 113 | appendLog(Hash->printHtml()); 114 | } 115 | } 116 | 117 | void MainWindow::addToTree(QString name){ 118 | //loop through files 119 | QString fdir = wdir + "\\" + name; 120 | QString text = getFileText(fdir); 121 | 122 | QRegularExpression re("(\\w+)"); 123 | QRegularExpressionMatchIterator i = re.globalMatch(text); 124 | QStringList words; 125 | while(i.hasNext()) { 126 | QRegularExpressionMatch match = i.next(); 127 | QString word = match.captured(1); 128 | words << word; 129 | } 130 | for(int i=0;isearch(word)) ); 133 | if((SW!=NULL && !SW->search(word))){ 134 | if(bmode==0){ //BST Mode 135 | BSNode> * n = BSTree->search(word); 136 | if(n==NULL){ 137 | LinkedList * ll = new LinkedList; 138 | IndexAddress *ia = new IndexAddress(name,i); 139 | ll->add(*ia); 140 | BSTree->insert(word,*ll); 141 | //appendLog("new node created in BST !"); 142 | }else{ 143 | n->data.add(*(new IndexAddress(name,i))); 144 | //appendLog("updated node in BST !"); 145 | } 146 | }else if(bmode==1){ //TST Mode 147 | TSNode> * n = TSTree->search(word); 148 | if(n==0){ 149 | LinkedList * ll = new LinkedList; 150 | IndexAddress *ia = new IndexAddress(name,i); 151 | ll->add(*ia); 152 | TSTree->insert(word,*ll); 153 | //appendLog("new node created in TST !"); 154 | }else{ 155 | n->data.add(*(new IndexAddress(name,i))); 156 | //appendLog("updated node in TST !"); 157 | } 158 | } 159 | else if (bmode == 2) { //Trie Mode 160 | word = word.toLower(); // trie only supports lowercase 161 | TrieNode> * n = TrieTree->search(word); 162 | if (n == 0) { 163 | LinkedList * ll = new LinkedList; 164 | IndexAddress *ia = new IndexAddress(name, i); 165 | ll->add(*ia); 166 | TrieTree->insert(word, *ll); 167 | //appendLog("new node created in Trie !"); 168 | } 169 | else { 170 | n->data.add(*(new IndexAddress(name, i))); 171 | //appendLog("updated node in Trie !"); 172 | } 173 | } 174 | else if (bmode == 3) { //Hash Mode 175 | HashNode> * n = Hash->get(word); 176 | if (n == 0) { 177 | LinkedList * ll = new LinkedList; 178 | IndexAddress *ia = new IndexAddress(name, i); 179 | ll->add(*ia); 180 | Hash->put(word, *ll); 181 | } 182 | else { 183 | n->data.add(*(new IndexAddress(name, i))); 184 | } 185 | } 186 | } 187 | } 188 | } 189 | 190 | void MainWindow::removeFromTree(QString name) { 191 | if (bmode == 0) { 192 | BSTree->iterBegin(); 193 | while (BSTree->iterHasNext()) { 194 | LinkedList * ll; 195 | BSNode> * bsnp = BSTree->iterNext(); 196 | ll = &bsnp->data; 197 | ll->iterBegin(); 198 | while (ll->iterHasNext()) { 199 | IndexAddress ia; 200 | LLNode * lln = ll->iterNext(); 201 | ia = lln->data; 202 | if (ia.filename == name) { 203 | ll->iterDel(); 204 | } 205 | } 206 | if (ll->isEmpty()) { 207 | BSTree->remove(bsnp->key); 208 | } 209 | } 210 | } 211 | } 212 | 213 | void MainWindow::searchInTree(QString word) { 214 | if (bmode == 0) { 215 | BSNode> * node = BSTree->search(word); 216 | if (node) { 217 | LinkedList * ll = &node->data; 218 | appendLog("Search Results : "); 219 | appendLog(*ll); 220 | } 221 | else { 222 | appendLog("No Match Found !"); 223 | } 224 | } 225 | else if (bmode == 1) { 226 | TSNode> * node = TSTree->search(word); 227 | if (node) { 228 | LinkedList * ll = &node->data; 229 | appendLog("Search Results : "); 230 | appendLog(*ll); 231 | } 232 | else { 233 | appendLog("No Match Found !"); 234 | } 235 | } 236 | else if (bmode == 2) { 237 | word = word.toLower(); // trie only supports lowercase 238 | TrieNode> * node = TrieTree->search(word); 239 | if (node) { 240 | LinkedList * ll = &node->data; 241 | appendLog("Search Results : "); 242 | appendLog(*ll); 243 | } 244 | else { 245 | appendLog("No Match Found !"); 246 | } 247 | } 248 | else if (bmode == 3) { 249 | HashNode> * node = Hash->get(word); 250 | if (node) { 251 | LinkedList * ll = &node->data; 252 | appendLog("Search Results : "); 253 | appendLog(*ll); 254 | } 255 | else { 256 | appendLog("No Match Found !"); 257 | } 258 | } 259 | } 260 | 261 | 262 | void MainWindow::initStopWords(){ 263 | //FIX THIS : Destruct previous BST 264 | SW = new BST; 265 | QString swtext = getFileText(swfile); 266 | QStringList words = swtext.split("\n"); 267 | for(int i=0;iinsert(word,word); 270 | } 271 | //appendLog("stopwords count : " + QString::number(words.count())); 272 | } 273 | 274 | 275 | void MainWindow::handleCmd() 276 | { 277 | QString cmd = ui->cmdText->text(); 278 | appendLog("> " + cmd); 279 | ui->cmdText->setText(""); 280 | procCmd(cmd); 281 | } 282 | 283 | void MainWindow::procCmd(QString cmd) 284 | { 285 | QStringList query = cmd.split(QRegExp("\\s")); 286 | procCmd(query); 287 | } 288 | 289 | void MainWindow::procCmd(QStringList cmd) 290 | { 291 | bool handled = false; 292 | 293 | //help 294 | if(!QString::compare(cmd.at(0),"help",Qt::CaseInsensitive)) 295 | { 296 | handled = true; 297 | QString ta = ""; 298 | appendLog("available commands :"); 299 | ta += "setdir
"; 300 | ta += "list
"; 301 | ta += "add
"; 302 | ta += "del
"; 303 | ta += "update
"; 304 | ta += "build
"; 305 | ta += "
"; 306 | appendLog(ta); 307 | } 308 | 309 | //setdir 310 | if(!QString::compare(cmd.at(0),"setdir",Qt::CaseInsensitive)) 311 | { 312 | handled = true; 313 | QString tdir = QFileDialog::getExistingDirectory(this,"Select Directory","C:/"); 314 | if(tdir != ""){ 315 | wdir = tdir; 316 | appendLog("working directory is set to " + wdir); 317 | } 318 | else{ 319 | appendLog("error setting working directory"); 320 | } 321 | } 322 | 323 | //list 324 | if(!QString::compare(cmd.at(0),"list",Qt::CaseInsensitive)) 325 | { 326 | handled = true; 327 | if(cmd.count()>1){ 328 | if(!QString::compare(cmd.at(1),"-f",Qt::CaseInsensitive)){ 329 | appendLog("printing all text files in the directory :"); 330 | if(wdir != ""){ 331 | QDirIterator it(wdir,QStringList() << "*.txt",QDir::Files ,QDirIterator::Subdirectories); 332 | while (it.hasNext()) { 333 | appendLog(it.next()); 334 | } 335 | }else{ 336 | appendLog("please set your working directory"); 337 | } 338 | } 339 | else if(!QString::compare(cmd.at(1),"-l",Qt::CaseInsensitive)){ 340 | appendLog("Added Files :"); 341 | for(int r=0;r1){ 360 | if(!QString::compare(cmd.at(1),"-all",Qt::CaseInsensitive)){ 361 | int fc = 0; 362 | QDirIterator it(wdir,QStringList() << "*.txt",QDir::Files ,QDirIterator::Subdirectories); 363 | while (it.hasNext()) { 364 | addToTree(it.next()); 365 | fc++; 366 | } 367 | appendLog(QString::number(fc) + " file(s) added successfully !"); 368 | }else{ 369 | QString docpath = wdir + "/" + cmd.at(1); 370 | 371 | QFileInfo check_file(docpath); 372 | if (check_file.exists() && check_file.isFile()) { 373 | if(docpath.endsWith(".txt")){ 374 | //do stuff 375 | curFiles.append(cmd.at(1)); 376 | addToTree(cmd.at(1)); 377 | appendLog(cmd.at(1)+ " added successfully !"); 378 | }else{ 379 | appendLog("file must be in .txt format !"); 380 | } 381 | } else { 382 | appendLog("invalid filename !"); 383 | } 384 | } 385 | }else{ 386 | appendLog("please specify document name !"); 387 | } 388 | } 389 | 390 | //del 391 | if(!QString::compare(cmd.at(0),"del",Qt::CaseInsensitive)) 392 | { 393 | handled = true; 394 | if(cmd.count()>1){ 395 | int delindex = -1; 396 | for(int r=0;r1) { 419 | if (!QString::compare(cmd.at(1), "-all", Qt::CaseInsensitive)) { 420 | for (int r = 0;r2) { 454 | if (!QString::compare(cmd.at(1), "-w", Qt::CaseInsensitive)) { 455 | searchInTree(cmd.at(2)); 456 | } 457 | else if (!QString::compare(cmd.at(1), "-s", Qt::CaseInsensitive)) { 458 | 459 | } 460 | else { 461 | appendLog("invalid search parameter !"); 462 | } 463 | } 464 | else { 465 | appendLog("please specify search parameter and expression !"); 466 | } 467 | } 468 | 469 | //build tree 470 | if(!QString::compare(cmd.at(0),"build",Qt::CaseInsensitive)) 471 | { 472 | handled = true; 473 | if(cmd.count()>1){ 474 | 475 | if(cmd.at(1) == "-bst"){ 476 | appendLog("Build Mode : BST"); 477 | bmode = 0; 478 | if (BSTree != NULL) { 479 | BSTree->~BST(); 480 | BSTree = NULL; 481 | } 482 | if (TSTree != NULL) { 483 | TSTree->~TST(); 484 | TSTree = NULL; 485 | } 486 | if (TrieTree != NULL) { 487 | TrieTree->~Trie(); 488 | TrieTree = NULL; 489 | } 490 | if (Hash != NULL) { 491 | Hash->~HashMap(); 492 | Hash = NULL; 493 | } 494 | BSTree = new BST>; 495 | 496 | }else if(cmd.at(1) == "-tst"){ 497 | appendLog("Build Mode : TST"); 498 | bmode = 1; 499 | if (BSTree != NULL) { 500 | BSTree->~BST(); 501 | BSTree = NULL; 502 | } 503 | if (TSTree != NULL) { 504 | TSTree->~TST(); 505 | TSTree = NULL; 506 | } 507 | if (TrieTree != NULL) { 508 | TrieTree->~Trie(); 509 | TrieTree = NULL; 510 | } 511 | if (Hash != NULL) { 512 | Hash->~HashMap(); 513 | Hash = NULL; 514 | } 515 | TSTree = new TST>; 516 | 517 | } 518 | else if (cmd.at(1) == "-trie") { 519 | appendLog("Build Mode : Trie"); 520 | bmode = 2; 521 | if (BSTree != NULL) { 522 | BSTree->~BST(); 523 | BSTree = NULL; 524 | } 525 | if (TSTree != NULL) { 526 | TSTree->~TST(); 527 | TSTree = NULL; 528 | } 529 | if (TrieTree != NULL) { 530 | TrieTree->~Trie(); 531 | TrieTree = NULL; 532 | } 533 | if (Hash != NULL) { 534 | Hash->~HashMap(); 535 | Hash = NULL; 536 | } 537 | TrieTree = new Trie>; 538 | } 539 | else if (cmd.at(1) == "-hash") { 540 | appendLog("Build Mode : Hash"); 541 | bmode = 3; 542 | if (BSTree != NULL) { 543 | BSTree->~BST(); 544 | BSTree = NULL; 545 | } 546 | if (TSTree != NULL) { 547 | TSTree->~TST(); 548 | TSTree = NULL; 549 | } 550 | if (TrieTree != NULL) { 551 | TrieTree->~Trie(); 552 | TrieTree = NULL; 553 | } 554 | if (Hash != NULL) { 555 | Hash->~HashMap(); 556 | Hash = NULL; 557 | } 558 | Hash = new HashMap>; 559 | 560 | }else{ 561 | appendLog("invalid build method !"); 562 | } 563 | 564 | }else{ 565 | appendLog("please specify build method !"); 566 | } 567 | } 568 | 569 | //test 570 | if(!QString::compare(cmd.at(0),"test",Qt::CaseInsensitive)) 571 | { 572 | handled = true; 573 | if(cmd.count()>1){ 574 | 575 | if(cmd.at(1) == "-1"){ 576 | appendLog("TESTING LINKED LIST !"); 577 | 578 | }else if(cmd.at(1) == "-2"){ 579 | //appendLog("Building Trinary Search Tree :"); 580 | 581 | }else if(cmd.at(1) == "-3"){ 582 | //appendLog("Building Trie Search Tree :"); 583 | 584 | }else{ 585 | appendLog("invalid test case !"); 586 | } 587 | 588 | }else{ 589 | appendLog("please specify build method !"); 590 | } 591 | } 592 | 593 | if(!handled) appendLog("unknown command"); 594 | appendLog(""); 595 | } 596 | -------------------------------------------------------------------------------- /mainwindow.h: -------------------------------------------------------------------------------- 1 | #ifndef MAINWINDOW_H 2 | #define MAINWINDOW_H 3 | 4 | #include 5 | 6 | namespace Ui { 7 | class MainWindow; 8 | } 9 | 10 | class MainWindow : public QMainWindow 11 | { 12 | Q_OBJECT 13 | 14 | public: 15 | explicit MainWindow(QWidget *parent = 0); 16 | ~MainWindow(); 17 | 18 | private: 19 | Ui::MainWindow *ui; 20 | 21 | void appendLog(QString log , bool withNewLine); 22 | void procCmd(QString cmd); 23 | void procCmd(QStringList cmd); 24 | 25 | void addToTree(QString name); 26 | void removeFromTree(QString name); 27 | void searchInTree(QString word); 28 | void printTree(); 29 | void initStopWords(); 30 | 31 | private slots: 32 | void handleCmd(); 33 | }; 34 | 35 | #endif // MAINWINDOW_H 36 | -------------------------------------------------------------------------------- /mainwindow.ui: -------------------------------------------------------------------------------- 1 | 2 | 3 | MainWindow 4 | 5 | 6 | 7 | 0 8 | 0 9 | 531 10 | 472 11 | 12 | 13 | 14 | Inverted Index v1.0 15 | 16 | 17 | 18 | false 19 | 20 | 21 | 22 | 23 | 24 | 25 | 26 | false 27 | 28 | 29 | background-color:black; 30 | color:rgb(85, 255, 0); 31 | font: 10pt "Consolas"; 32 | 33 | 34 | 1 35 | 36 | 37 | true 38 | 39 | 40 | <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0//EN" "http://www.w3.org/TR/REC-html40/strict.dtd"> 41 | <html><head><meta name="qrichtext" content="1" /><style type="text/css"> 42 | p, li { white-space: pre-wrap; } 43 | </style></head><body style=" font-family:'Consolas'; font-size:10pt; font-weight:400; font-style:normal;"> 44 | <p style="-qt-paragraph-type:empty; margin-top:0px; margin-bottom:0px; margin-left:0px; margin-right:0px; -qt-block-indent:0; text-indent:0px;"><br /></p></body></html> 45 | 46 | 47 | 48 | 49 | 50 | 51 | 52 | 53 | 54 | 55 | 56 | 57 | 58 | 0 59 | 0 60 | 531 61 | 21 62 | 63 | 64 | 65 | 66 | File 67 | 68 | 69 | 70 | 71 | 72 | 73 | Help 74 | 75 | 76 | 77 | 78 | 79 | 80 | 81 | 82 | Set Directory ... 83 | 84 | 85 | 86 | 87 | Exit 88 | 89 | 90 | 91 | 92 | About 93 | 94 | 95 | 96 | 97 | 98 | 99 | 100 | --------------------------------------------------------------------------------