149 lines
3.5 KiB
C
149 lines
3.5 KiB
C
#include <iostream> // library for printing
|
|
#include <string> // support for strings
|
|
#include <vector> // support for vectors
|
|
#include <unordered_map> // support for hash-tables
|
|
#include <assert.h>
|
|
#include <fstream> // support for reading files
|
|
using namespace std;
|
|
|
|
// For compiling C++ code
|
|
// g++ a.c -o a
|
|
|
|
string ToUpper(string s) {
|
|
string s2;
|
|
for (char c : s) {
|
|
s2.push_back(toupper(c));
|
|
}
|
|
return s2;
|
|
}
|
|
|
|
struct Word {
|
|
Word() {} // default empty constructor
|
|
Word(string s) : word(s) {} // standard way of initialization
|
|
string word;
|
|
};
|
|
typedef vector<Word> Words;
|
|
typedef unordered_map<string, Word> WordMap; // hash-table from stl
|
|
|
|
class Library {
|
|
public:
|
|
Library() {} // hash-tables are automatically initialized
|
|
bool IsWord(string s) const {
|
|
auto it = word_map_.find(s); // use iterator
|
|
if (it == word_map_.end()) {
|
|
return false; // if word is not found on hast-table
|
|
} else {
|
|
return true;
|
|
}
|
|
//return word_map_.count(s) > 0; // True if word exists
|
|
}
|
|
void ComputeStats() {
|
|
assert(counts_.empty());
|
|
counts_.resize(18);
|
|
for (Word w : words_) {
|
|
int len = w.word.length();
|
|
if (len < 18) {
|
|
counts_[len]++;
|
|
}
|
|
}
|
|
}
|
|
void PrintStats() const {
|
|
cout << "Here are the counts of each word length:\n";
|
|
for (int i = 1; i < counts_.size(); i++) {
|
|
cout << "[" << i << "] " << counts_[i] << "\n";
|
|
}
|
|
}
|
|
string GetWord(int i) const {
|
|
assert(i >= 0 && i < words_.size());
|
|
return words_[i].word;
|
|
}
|
|
void ReadFromFile(string filename) {
|
|
ifstream f;
|
|
f.open(filename);
|
|
while (!f.eof()) {
|
|
string line;
|
|
getline(f, line);
|
|
// cout << line << "\n";
|
|
if (!line.empty()) {
|
|
line = ToUpper(line);
|
|
int len = line.length();
|
|
if (line[len - 1] == '\r') {
|
|
line = line.substr(0, len - 1);
|
|
}
|
|
words_.push_back(Word(line));
|
|
word_map_[line] = Word(line); // create entry for the hash-table
|
|
}
|
|
}
|
|
cout << "Read " << words_.size() << " words from file '"
|
|
<< filename << "'\n";
|
|
}
|
|
void DebugBuckets() const {
|
|
for (int i = 0; i < word_map_.bucket_count(); i++) {
|
|
cout << "[" << i << "] " << word_map_.bucket_size(i) << "\n";
|
|
}
|
|
}
|
|
|
|
private: // _ is used to indicate privacy
|
|
Words words_;
|
|
WordMap word_map_;
|
|
vector<int> counts_;
|
|
};
|
|
|
|
struct Grid {
|
|
Grid(string n) {
|
|
name = n;
|
|
}
|
|
int rows() const { return lines.size(); }
|
|
int cols() const {
|
|
if (lines.empty()) {
|
|
return 0;
|
|
} else {
|
|
return lines[0].size();
|
|
}
|
|
}
|
|
void LoadFromFile(string filename) {
|
|
ifstream f;
|
|
f.open("test");
|
|
while (!f.eof()) {
|
|
string line;
|
|
getline(f, line);
|
|
// cout << line << "\n";
|
|
if (!line.empty() && line[0] != '#') {
|
|
lines.push_back(line);
|
|
}
|
|
}
|
|
}
|
|
void Check() const {
|
|
for (string s : lines) {
|
|
assert(s.size() == cols());
|
|
}
|
|
}
|
|
void Print() const {
|
|
cout << "Grid: " << name
|
|
<< " (rows=" << rows()
|
|
<< ", cols=" << cols() << ")\n";
|
|
for (string s : lines) {
|
|
cout << " " << s << "\n";
|
|
}
|
|
}
|
|
string name; // strings are initialized empty
|
|
vector<string> lines;
|
|
};
|
|
|
|
int main() {
|
|
Library lib;
|
|
lib.ReadFromFile("top_12000.txt");
|
|
//lib.ComputeStats();
|
|
//lib.PrintStats();
|
|
|
|
cout << lib.IsWord("DOG") << "\n";
|
|
cout << lib.IsWord("CAT") << "\n";
|
|
cout << lib.IsWord("THANKS") << "\n";
|
|
cout << lib.IsWord("TFAFAS") << "\n";
|
|
lib.DebugBuckets();
|
|
|
|
//Grid grid("MY GRID");
|
|
//grid.LoadFromFile("test");
|
|
//grid.Check();
|
|
//grid.Print();
|
|
} |