update

Author: shiyutang

.gitignore

@@ -1,2 +1,3 @@
 # Project exclude paths
-/cmake-build-debug/
+/cmake-build-debug/
+.idea/vcs.xml

8_CorrelatedContainer.cpp

@@ -25,14 +25,15 @@ int coutfreq()
         it != counters.end(); ++it)
     {
         cout << it->first << "\t" << it->second << endl;
+        cout << (*it).first << "\t" << it->second << endl;
     }
     return 0;
 }
 
 // 得到每一行的单词，并记录其出现的位置
 // 分割函数作为参数，给函数的功能增加了很多可能性
 map<string, vector<int> > xref(istream& in,
-                             vector<string> find_words(const string&) = split)
+                               vector<string> find_words(const string&) = split)
 {
     string line;
     int line_num = 0;

8_MakeaSentence.cpp

@@ -20,7 +20,7 @@ Grammar read_grammar(istream& in)
     string line;
     int line_num = 0;
 
-    while (getline(in,line) && line_num<15)
+    while (getline(in,line) && line_num<14)
     {
         line_num += 1;
         vector<string> entry = split(line);
@@ -61,7 +61,10 @@ void gen_aux(const Grammar& g, const string& word, vector<string>& ret)
     {
         auto it = g.find(word);  //找到 sentence 开头的规则
         if (it == g.end())
+        {
+            cout << "word" << word << endl;
             throw logic_error("empty rule");
+        }
 
         const Rule_collection c = it->second; // 重定向所有规则
 
@@ -79,9 +82,7 @@ vector<string> gen_sen(const Grammar& g)
     return ret;
 }
 
-int main()
-{
-    vector<string> sentence = gen_sen(read_grammar(cin));
+void outputSentence(vector<string> sentence){
     auto it = sentence.begin();
     if (!sentence.empty())
     {
@@ -94,17 +95,24 @@ int main()
         ++it;
     }
     cout << endl;
-    return 0;
 }
 
-
-
+int SENmain()
+{
+    Grammar g = read_grammar(cin);
+    for(int i=0;i!=10;++i)
+    {
+        vector<string> sentence = gen_sen(g);
+        outputSentence(sentence);
+    }
+    return 0;
+}
 
 //<none> cat
 //<none> dog
 //<none> table
 //<np> <none>
-//<np> <adj><np>
+//<np> <adj> <none>
 //<adj> large
 //<adj> brown
 //<adj> absurd
@@ -113,5 +121,5 @@ int main()
 //<pos> on the stairs
 //<pos> under the sky
 //<pos> where it wants
-//<sentence> the <np><verb><pos>
+//<sentence> the <np> <verb> <pos>
 // end-of-file

9_Generics.cpp

@@ -7,4 +7,142 @@
 #include <map>
 #include <iostream>
 #include <list>
+#include <algorithm>
+#include "7_Use library/using library.h"
 
+using namespace std;
+
+template <class T>
+T median(vector<T> v)
+{
+ typedef typename vector<T>::size_type vec_sz;
+ vec_sz size = v.size();
+ if (size == 0)
+     throw domain_error("median of an empty vector");
+
+ sort(v.begin(), v.end());
+ vec_sz mid = size / 2;
+
+ return size %2 ==0 ? (v[mid] + v[mid+1]) / 2 : v[mid];
+}
+
+// 输入迭代器：顺序只读
+template <class In, class X>
+In find_diy(In begin,In end,const X& x)
+{
+    while(begin!=end && *begin!=x)
+        ++begin;
+    return begin;
+}
+
+// 输出迭代器：顺序只写: 单次不跳过，且不重复写入
+template <class In, class Out>
+Out copy_diy(In begin,In end,Out dest)
+{
+    while(begin!=end)
+        *dest++ = *begin++;
+
+    return dest;
+}
+
+// 正向迭代器：顺序读写--不访问前面一个元素
+template <class For, class X>
+void replace_diy(For begin, For end, const X& x, const X& y)
+{
+    while (begin != end)
+    {
+        if (*begin ==x)
+            *begin = y;
+        ++begin;
+    }
+}
+//双向迭代器：正向迭代器+可逆访问
+template <class Bi>
+void reverse_diy(Bi begin, Bi end)
+{
+    vector<pair<const int, string> > a;
+    
+    while (begin!=end)
+    {
+        --end;
+        if (begin != end)
+            swap(*begin++, *end);
+    }
+}
+
+// 随机访问：相减为整数类型，随机访问，整数相加得到新的迭代器（移位）
+
+template <class Ran, class X>
+bool binary_search_diy(Ran begin, Ran end, const X& x)
+{
+    while (begin<end)
+    {
+        Ran mid = begin +(end-begin)/2;
+        if (x<*mid)
+            end = mid;
+        else if (*mid <x)
+            begin = mid +1;
+        else return true;
+    }
+    return false;
+}
+
+template <class Out>
+
+void split_iter(const string& str, Out os){
+    typedef string::const_iterator iter;
+    vector<string> ret;
+
+    iter i = str.begin();  // 字符串可以有迭代器，但是字符数组不可以
+    while (i!= str.end()){
+        i = find_if(i,str.end(),not_space);
+        iter j = find_if(i, str.end(),space);
+        if (i!= str.end())
+            *os++ = string(i,j);
+        i = j;
+    }
+
+}
+
+#include <iterator>
+
+int main()
+{
+    string str;
+    vector<string> str_vec;
+    vector<string> str_vec_copy;
+    while (getline(cin,str))
+    {
+        split_iter(str, ostream_iterator<string>(cout, "\n"));
+
+        split_iter(str, back_inserter(str_vec));
+        bool findthe = binary_search_diy(str_vec.begin(),str_vec.end(), "the");
+        cout << "found the: " << findthe << endl;
+
+        auto findthe2 = find_diy(str_vec.begin(),str_vec.end(), "the");
+        cout << "found the at: " << *findthe2 << endl;
+
+
+        reverse_diy(str_vec.begin(), str_vec.end());
+        cout << "after reverse: ";
+        for (auto  it = str_vec.begin(); it != str_vec.end(); it++)
+            cout << (*it) << " " ;
+
+        reverse_diy_noswap(str_vec.begin(), str_vec.end());
+        cout << "after reverse_noswap: ";
+        for (auto  it = str_vec.begin(); it != str_vec.end(); it++)
+            cout << (*it) << " " ;
+
+        replace_diy(str_vec.begin(), str_vec.end(), "t", "r");
+        cout << endl << "after replace_diy: ";
+        for (auto  it = str_vec.begin(); it != str_vec.end(); it++)
+            cout << (*it) << " ";
+
+        copy_diy(str_vec.begin(), str_vec.end(), back_inserter(str_vec_copy));
+        cout << endl << "after copy_diy: ";
+        for (auto  it = str_vec_copy.begin(); it != str_vec_copy.end(); it++)
+            cout << (*it) << " ";
+
+    }
+}
+//I like playing the piano r t

CMakeLists.txt

@@ -3,4 +3,4 @@ project(Accleratedcpp)
 
 set(CMAKE_CXX_STANDARD 11)
 
-add_executable(Accleratedcpp "5_organize program_data/original/pmain.cpp" "1_Hello World.cpp" 2_chars.cpp "3_loop and count.cpp" "4_use batch data.cpp" "5_organize program_data/original/grade.h" "5_organize program_data/original/Student_info.h" "5_organize program_data/original/Student_info_funcs.cpp" "5_organize program_data/original/median_funcs.cpp" "5_organize program_data/original/median.h" "5_organize program_data/original/grade_funcs.cpp" "7_Use library/use library.cpp" "5_organize program_data/memOptim/main.cpp" "5_organize program_data/memOptim/grade.h" "5_organize program_data/memOptim/grade_funcs.cpp" "5_organize program_data/memOptim/Student_info.h" "5_organize program_data/memOptim/Student_info_funcs.cpp" "5_organize program_data/main.cpp" "6_UseIterator extract_fail.cpp" "7_Use library/find_url.cpp" "7_Use library/StudentGrades.cpp" "7_Use library/6-1.cpp" "7_Use library/using library.h" 8_CorrelatedContainer.cpp "7_Use library/StudentGrade.h" 8_MakeaSentence.cpp)
+add_executable(Accleratedcpp "5_organize program_data/original/pmain.cpp" "1_Hello World.cpp" 2_chars.cpp "3_loop and count.cpp" "4_use batch data.cpp" "5_organize program_data/original/grade.h" "5_organize program_data/original/Student_info.h" "5_organize program_data/original/Student_info_funcs.cpp" "5_organize program_data/original/median_funcs.cpp" "5_organize program_data/original/median.h" "5_organize program_data/original/grade_funcs.cpp" "7_Use library/use library.cpp" "5_organize program_data/memOptim/main.cpp" "5_organize program_data/memOptim/grade.h" "5_organize program_data/memOptim/grade_funcs.cpp" "5_organize program_data/memOptim/Student_info.h" "5_organize program_data/memOptim/Student_info_funcs.cpp" "5_organize program_data/main.cpp" "6_UseIterator extract_fail.cpp" "7_Use library/find_url.cpp" "7_Use library/StudentGrades.cpp" "7_Use library/6-1.cpp" "7_Use library/using library.h" 8_CorrelatedContainer.cpp "7_Use library/StudentGrade.h" 8_MakeaSentence.cpp 9_Generics.cpp)