-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathWordVector.cpp
94 lines (84 loc) · 2.04 KB
/
WordVector.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
//
// Created by Matthew Jones on 11/28/16.
//
#include <cstdlib>
#include "WordVector.h"
WordVector::WordVector() {
Word* word = new Word("");
words.push_back(word);
}
bool WordVector::containsStr(std::string str) const {
for(int i = 0; i < words.size(); i++) {
if(words[i]->getWord() == str) {
return true;
}
}
return false;
}
Word *WordVector::addWord(std::string word, Word *lastWord) {
if(containsStr(word)) {
lastWord->addWordFollowing(getWord(word));
return getWord(word);
} else {
Word* temp = new Word(word);
addToV(temp);
lastWord->addWordFollowing(temp);
return temp;
}
}
Word *WordVector::getWord(std::string str) const {
return words[getIndexForWord(str)];
}
Word *WordVector::getRandWord() const {
srand(time(NULL));
int randomIndex = rand() % words.size();
return words[randomIndex];
}
int WordVector::getIndexForWord(std::string str, int begin, int end) const { //FIXME Will hang if word is not in array
if(end == 0)
end = words.size(); //FIXME Ugly, and terrible.
int mid = (begin + end) / 2;
if(words[mid]->getWord() == str) {
return mid;
} else if(words[mid]->getWord() > str) {
return getIndexForWord(str, begin, mid);
} else {
return getIndexForWord(str, mid, end);
}
}
void WordVector::addToV(Word *word) {
for(int i = 0; i < words.size(); i++) {
if(words[i]->getWord() > word->getWord()) {
words.insert(words.begin() + i, word);
return;
}
}
words.push_back(word);
}
std::vector<Word *> WordVector::dumpWords() const {
return words;
}
void WordVector::addWord(std::string word, std::vector<std::string> words) {
Word* wordPtr;
bool alreadyThere;
if(containsStr(word)) {
wordPtr = getWord(word);
alreadyThere = true;
} else {
wordPtr = new Word(word);
alreadyThere = false;
}
for(int i = 0; i < words.size(); i++) {
Word* anotherWordPtr;
if(containsStr(words[i])) {
anotherWordPtr = getWord(words[i]);
} else {
anotherWordPtr = new Word(words[i]);
}
wordPtr->addWordFollowing(anotherWordPtr);
addToV(anotherWordPtr);
}
if(!alreadyThere) {
addToV(wordPtr);
}
}