There is a main.cpp file and a search.cpp file. I cannot alter anything in the m

Question

There is a main.cpp file and a search.cpp file. I cannot alter anything in the main.cpp code so i need the code for the search.cpp in C++14. thank you.

/*main.cpp*/

#include <iostream>
#include <fstream>
#include <string>

#include <cstdlib>

using namespace std;

//
// function declarations:
//
int GetFileStats(string filename, string& firstKey, string& firstValue);
bool SearchForKey(string filename, string key, string& value, int& rank);

//
// main:
//
int main()
{
string filename;

cin >> filename;

cout << "**Starting**" << endl;
cout << "File: '" << filename << "'" << endl;
cout << endl;

//
// First, let's get some statistics about the data file:
//
int N, rank;
string key, value;
bool found;

N = GetFileStats(filename, key, value);

cout << "# of entries: " << N << endl;
cout << "Top-ranked: (" << key << ", " << value << ")" << endl;
cout << endl;

//
// Now let's input keys from the keyboard and look for them in the file:
//
cin >> key;

while (key != "#")
{
found = SearchForKey(filename, key, value, rank);
  
if (found == true)
{
cout << ">>Found key: " << key << endl;
cout << " Value= " << value << endl;
cout << " Rank= " << rank << endl;
}
else // not found:
{
cout << ">>Not found: " << key << endl;
}
  
cin >> key;
}

cout << endl;
cout << "**End**" << endl;

return 0;
}

/*search.cpp*/

#include <iostream>
#include <fstream>
#include <string>
#include <cstdlib>

using namespace std;

//
// GetFileStats
//
// Returns the # of (key, value) pairs in the given file. Also returns the first (key, value)
// pair via the parameters firstKey and firstValue.
//
// NOTE: it is assumed the file contains at least one (key, value) pair, in this format:
//
// value key
// value key
// value key
// # #
//
// where value and key are one word strings (or numbers that will be input as strings).
// If the file cannot be opened, the program will be exited.
//
int GetFileStats(string filename, string& firstKey, string& firstValue)
{
//
// Initialize return value / parameters:
//
firstKey = "?";
firstValue = "?";
int N = 0;

//
// TODO: open and read the (key, value) pairs from the file. The goal is
// to simply count how many pairs there are and return this value N. Also,
// we need to return the first (key, value) pair via the firstKey and
// firstValue parameters; just assign to the parameters to "return" the
// values. Don't forget to close the file when you're done.
//




return N;
}

Summary: searching text files for (key, value) pairs, e.g. movies and their total revenue Google collects all sorts of interesting data: what words appear most frequently in searches? What web sites are most commonly searched using Alexa? What are the most popular baby names? For example, the data file "words-by-freq.txt" ranks the English words used most commonly in searches. Here's the start of the file 5627187200 the 3395006400 of 2994418400 and 2595609600 to The words are listed by rank, so "the" is the most frequently searched word with a frequency of 5627187200". The 2nd most frequently searched word is 'of, with a frequency of "3395006400", and so on. The file ends with # and # In general, we call this type of file a·(key, value) file, since the data comes in pairs, and the "key uniquely identifies the "value". Note that the value is on the left, and the key is on the right. This implies you should view these types of files like this: value key value key value key Note that you should view the values and keys as strings-often the values are integers and the keys are strings, but it's dangerous to assume this is always true. Instead, treat all input data as strings, and use string variables In this exercise, you're going to write a complete C++ program that searches data from a (key, value) input file, outputting some statistics values, and ranks. The main0 program is written for you (and cannot be modified); your job is to implement the 2 functions in "search.cpp" that do the work of opening, inputting, and searching the input file. First, here's an example input sequence for the program words-by-freq.txt headache the meanwhile

Explanation / Answer

#include <iostream>
#include <fstream>
#include <string>

#include <cstdlib>

using namespace std;

//
// function declarations:
//
int GetFileStats(string filename, string& firstKey, string& firstValue);
bool SearchForKey(string filename, string key, string& value, int& rank);

//
// main:
//
int main()
{
string filename;

cin >> filename;

cout << "**Starting**" << endl;
cout << "File: '" << filename << "'" << endl;
cout << endl;

//
// First, let's get some statistics about the data file:
//
int N, rank;
string key, value;
bool found;

N = GetFileStats(filename, key, value);

cout << "# of entries: " << N << endl;
cout << "Top-ranked: (" << key << ", " << value << ")" << endl;
cout << endl;

//
// Now let's input keys from the keyboard and look for them in the file:
//
cin >> key;

while (key != "#")
{
found = SearchForKey(filename, key, value, rank);
  
if (found == true)
{
cout << ">>Found key: " << key << endl;
cout << " Value= " << value << endl;
cout << " Rank= " << rank << endl;
}
else // not found:
{
cout << ">>Not found: " << key << endl;
}
  
cin >> key;
}

cout << endl;
cout << "**End**" << endl;

return 0;
}

/*search.cpp*/

#include <iostream>
#include <fstream>
#include <string>
#include <cstdlib>

using namespace std;

//
// GetFileStats
//
// Returns the # of (key, value) pairs in the given file. Also returns the first (key, value)
// pair via the parameters firstKey and firstValue.
//
// NOTE: it is assumed the file contains at least one (key, value) pair, in this format:
//
// value key
// value key
// value key
// # #
//
// where value and key are one word strings (or numbers that will be input as strings).
// If the file cannot be opened, the program will be exited.
//
int GetFileStats(string filename, string& firstKey, string& firstValue)
{
//
// Initialize return value / parameters:
//
firstKey = "?";
firstValue = "?";
int N = 0;

//
// TODO: open and read the (key, value) pairs from the file. The goal is
// to simply count how many pairs there are and return this value N. Also,
// we need to return the first (key, value) pair via the firstKey and
// firstValue parameters; just assign to the parameters to "return" the
// values. Don't forget to close the file when you're done.
//




return N;
}

Related Questions

Navigate

• Browse (All)
• Browse T
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.