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