词频统计系统

#include <iostream>#include <fstream>#include <algorithm>#include<map>#include<set>#include<string>//词频统计系统using namespace std;void initialize_exclusion_set(set <string> &);void process_file( map <string,int> &,const set <string> &,ifstream&);void user_query(const map <string,int> &);void danci();bool cmp(int a,int b);int B[]= {0,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};void QSort(int A[],int left,int right); //快速排序void QuickSort(int A[] ,int n){ QSort(A,0,n-1);}void QSort(int A[],int left,int right){ int i ,j; if(left<right) { i=left; j=right+1; do { do i++; while(A[i]<A[left]); do j--; while(A[j]>A[left]); if(i<j) { swap(A[i],A[j]); swap(B[i],B[j]); } } while (i<j); swap(A[left],A[j]); swap(B[left],B[j]); QSort(A,left,j-1); QSort(A,j+1,right); }}int main(){ ifstream ifile("abc.txt"); if(!ifile) { cout<<" 抱歉abc.txt 不存在,将需统计的文本放在同目录abc.txt"<<endl; return 0; } //文件打开 char ch; int num[26]= {0}; //num[0]无视 int len=0; //串长 while(ifile.get(ch)) { if(ch>='A'&&ch<='Z') { ++num[ch-'A']; } if(ch>='a'&&ch<='z') { ++num[ch-'a']; } ++len; //cout<<ch; } double plv[26]= {0.0}; int plvsort[26]= {0}; for(int i=0; i<=25; i++) { plv[i]=num[i]/double(len); //very important } for(int i=0; i<=25; i++) { plvsort[i]=num[i]; }//主要的界面 int swt=1; char sch; while(swt) { cout<<" 欢迎使用词频统计系统"<<endl; cout<<endl; cout<<"1.查看字母出现次数 2.查看字母出现频率 3.按单词查询 4.按字母查询 5.查看总字数"<<endl; cout<<"6.查看表格 7.按大小排序 8.退出"<<endl; cout<<"请输入："<<endl; cin>>swt; cout<<"你的选择："<<swt<<endl; switch(swt) { case 1: for(int i=0; i<=25; i++) { printf("%c %d/n",i+65,num[i]); } system("pause"); system("cls"); break; case 2: for(int i=0; i<=25; i++) { printf("%c %0.2f%%/n",i+65,plv[i]*100); } system("pause"); system("cls"); break; case 3: danci(); system("pause"); system("cls"); break; case 4: cout<<"输入字母："<<endl; cin>>sch; cout<<"输入的是"<<sch<<endl; if(sch>='A'&&sch<='Z') { printf("%c %d %0.2f%%/n",sch,num[sch-'A'],plv[sch-'A']*100); } if(sch>='a'&&sch<='z') { printf("%c %d %0.2f%%/n",sch,num[sch-'a'],plv[sch-'a']*100); } system("pause"); system("cls"); break; case 5: cout<<"abc.txt中文本总长度:"<<len<<endl; system("pause"); system("cls"); break; case 6: for(int i=0; i<=25; i++) { printf("|%c|/t|%d|/t|%0.2f%%|/n",i+65,num[i],plv[i]*100); cout<<"-----------------------"<<endl; } system("pause"); system("cls"); break; case 7: QuickSort(plvsort,26); for(int i=0; i<=25; i++) { printf("%c/t/t%d/t/t%0.2f%%/n",B[i]+65,plvsort[i],plvsort[i]/double(len)*100); } system("pause"); system("cls"); break; case 8: swt=0; system("cls"); break; } } cout << "再见啊！！！" << endl; return 0;}void danci(){ ifstream ifile("abc.txt "); ofstream ofile("put.txt"); set <string> exclude_set; initialize_exclusion_set(exclude_set); map <string,int> word_count;//定义了一个名为word_count的map对象 process_file(word_count,exclude_set,ifile); user_query(word_count);}void initialize_exclusion_set(set <string> &exs){ static string _exclude_word[25]= { "the ", "end ", "but ", "that ", "then ", "are ", "been ", "can ", "a ", "could ", "did ", "for ", "of ", "had ", "have ", "him ", "his ", "her ", "and ", "is ", "were ", "which ", "when ", "with ", "would " }; exs.insert(_exclude_word,_exclude_word+25);}void process_file(map <string,int> &word_count,const set <string> &exclude_set,ifstream &ifile){ string word; while(ifile>>word) { if(exclude_set.count(word)) continue; word_count[word]++; }//单词计数}bool cmp(int a,int b){ return a>b;}void user_query(const map <string,int> &word_map){ string search_word; cout<<"请输入要查找的单词:"; cin>>search_word; while(search_word.size()&&search_word!="q ") { map <string,int> ::const_iterator it; if((it=word_map.find(search_word))!=word_map.end()) cout<<"找到! "<< it-> first <<" 出现 "<< it-> second <<" 次./n "; else cout<<search_word <<" 这个单词找不到./n "; break; cin >> search_word; }}