third_codes/cppjieba
1
0
Fork 0
mirror of https://github.com/yanyiwu/cppjieba.git synced 2025-07-18 00:00:12 +08:00
Code Issues Packages Projects Releases Wiki Activity

code format check

Browse Source
This commit is contained in:
mayunyun 2016-04-25 20:28:47 +08:00
parent 669e971e3e
commit 1aa0a32d90
1 changed files with 13 additions and 13 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

26
include/cppjieba/TextRankExtractor.hpp
View File

@ -12,15 +12,15 @@ namespace cppjieba {
public: public:
typedef struct _Word {string word;vector<size_t> offsets;double weight;} Word; // struct Word typedef struct _Word {string word;vector<size_t> offsets;double weight;} Word; // struct Word
private: private:
typedef std::unordered_map<string,Word> WordMap; typedef std::unordered_map<string,Word> WordMap;
class WordGraph{ class WordGraph{
private: private:
typedef double Score; typedef double Score;
typedef string Node; typedef string Node;
typedef std::unordered_set<Node> NodeSet; typedef std::unordered_set<Node> NodeSet;
typedef std::unordered_map<Node,double> Edges; typedef std::unordered_map<Node,double> Edges;
typedef std::unordered_map<Node,Edges> Graph; typedef std::unordered_map<Node,Edges> Graph;
double d; double d;
Graph graph; Graph graph;
@ -117,15 +117,15 @@ namespace cppjieba {
} }
graph.rank(wordmap,rankTime); graph.rank(wordmap,rankTime);
keywords.clear(); keywords.clear();
keywords.reserve(wordmap.size()); keywords.reserve(wordmap.size());
for (WordMap::iterator itr = wordmap.begin(); itr != wordmap.end(); ++itr) { for (WordMap::iterator itr = wordmap.begin(); itr != wordmap.end(); ++itr) {
keywords.push_back(itr->second); keywords.push_back(itr->second);
} }
topN = min(topN, keywords.size()); topN = min(topN, keywords.size());
partial_sort(keywords.begin(), keywords.begin() + topN, keywords.end(), Compare); partial_sort(keywords.begin(), keywords.begin() + topN, keywords.end(), Compare);
keywords.resize(topN); keywords.resize(topN);
} }
private: private: