扫描文件，建立倒排索引

---

前言

数据结构作业的一部分。

一，代码

#include <iostream>
#include <fstream>
#include <map>
#include <sstream>
#include <queue>

using namespace std;

struct DocMes {
	int TF = 0;
	queue<int>pos;
};

typedef map<string, map<int, DocMes>> IndexMap;

typedef map<int, DocMes> invertMap;

string filename[11] = { "0","apple","cherry","grape","mangosteen","oorange","peach","pear","pineapple","pomelo","watermelon" };

void CreateIndex(IndexMap& index) {
	ifstream fileIn;
	for (int i = 1; i <= 10; i++) {
		string filepath = filename[i] + ".txt";
		fileIn.open(filepath.c_str());
		string temp;
		int posNum = 0;
		while (fileIn >> temp) {
			int k = 0;
			posNum++;
			index[temp][i].TF++;
			index[temp][i].pos.push(posNum);
		}
		fileIn.close();
	}
}
void queryProcess(IndexMap& index) {
	string query;
	while (true) {
		cout << "Find your words:" << endl;
		cin >> query;
		if (index.find(query) == index.end()) {
			cout << "ERROR: Can't find " << query << " ! ,please check up your words" << endl;
			continue;
		}
		invertMap::iterator iter;
		iter = index[query].begin();
		while (iter != index[query].end()) {
			cout << filename[iter->first] << ".txt : Tf=" << iter->second.TF << " ; pos = < ";
			while (!iter->second.pos.empty())
			{
				cout << iter->second.pos.front();
				if (iter->second.pos.size() > 1)
				{
					cout << " , ";
				}
				iter->second.pos.pop();
			}
			cout << " >" << endl;
			iter++;
		}
	}
}

int main() {
	IndexMap invertIndex;
	CreateIndex(invertIndex);
	queryProcess(invertIndex);
	return 0;
}

二，遇到的问题

1）初次接触读入文件操作
2）该代码用到较多的map,
map的创建：map<key,value>
map[key]返回的是value。