formatting code style for ch09

Author: pezy

ch09/ex9_15.cpp

@@ -1,23 +1,19 @@
-//
-//  ex9_15.cpp
-//  Exercise 9.15
-//
-//  Created by pezy on 12/2/14.
-//  Copyright (c) 2014 pezy. All rights reserved.
-//
-//  @Brief  Write a program to determine whether two vector<int>s are equal.
+//! @file   Exercise 9.15
+//! @author pezy
+//! @date   2014-12-02
+//! @Brief  Write a program to determine whether two vector<int>s are equal.
 
 #include <iostream>
 #include <vector>
 
 int main()
 {
-    std::vector<int> vec1{1,2,3,4,5};
-    std::vector<int> vec2{1,2,3,4,5};
-    std::vector<int> vec3{1,2,3,4};
+    std::vector<int> vec1{1, 2, 3, 4, 5};
+    std::vector<int> vec2{1, 2, 3, 4, 5};
+    std::vector<int> vec3{1, 2, 3, 4};
 
-    std::cout << (vec1 == vec2 ? "true" : "false") << std::endl;
-    std::cout << (vec1 == vec3 ? "true" : "false") << std::endl;
+    std::cout << std::boolalpha << (vec1 == vec2) << std::endl;
+    std::cout << std::boolalpha << (vec1 == vec3) << std::endl;
 
     return 0;
 }

ch09/ex9_16.cpp

@@ -1,27 +1,18 @@
-//
-//  ex9_16.cpp
-//  Exercise 9.16
-//
-//  Created by pezy on 12/2/14.
-//  Copyright (c) 2014 pezy. All rights reserved.
-//
-//  @Brief  Repeat the previous program, but compare elements in a
-//          list<int> to a vector<int>.
+//! @file   Exercise 9.16
+//! @author pezy
+//! @date   2014-12-02
+//! @Brief  Repeat the previous program, but compare elements in a list<int> to a vector<int>.
 
 #include <iostream>
 #include <vector>
 #include <list>
 
 int main()
 {
-    std::list<int> vec1{1,2,3,4,5};
-    std::vector<int> vec2{1,2,3,4,5};
-    std::vector<int> vec3{1,2,3,4};
+    std::list<int> list{1, 2, 3, 4, 5};
+    std::vector<int> vec1{1, 2, 3, 4, 5};
+    std::vector<int> vec2{1, 2, 3, 4};
 
-    std::cout << (std::vector<int>(vec1.begin(), vec1.end()) == vec2 ? "true" : "false")
-              << std::endl;
-    std::cout << (std::vector<int>(vec1.begin(), vec1.end()) == vec3 ? "true" : "false")
-              << std::endl;
-
-    return 0;
+    std::cout << std::boolalpha << (std::vector<int>(list.begin(), list.end()) == vec1) << std::endl;
+    std::cout << std::boolalpha << (std::vector<int>(list.begin(), list.end()) == vec2) << std::endl;
 }

ch09/ex9_27.cpp

@@ -1,12 +1,7 @@
-//
-//  ex9_27.cpp
-//  Exercise 9.27
-//
-//  Created by pezy on 12/3/14.
-//  Copyright (c) 2014 pezy. All rights reserved.
-//
-//  @Brief  Write a program to find and remove the odd-valued
-//          elements in a forward_list<int>.
+//! @file   Exercise 9.27
+//! @author pezy
+//! @date   2014-12-03
+//! @Brief  Write a program to find and remove the odd-valued elements in a forward_list<int>.
 
 #include <iostream>
 #include <forward_list>
@@ -15,15 +10,12 @@ using std::forward_list; using std::cout; using std::endl;
 
 int main()
 {
-    forward_list<int> flst = {0,1,2,3,4,5,6,7,8,9};
-    for (auto prev = flst.before_begin(), curr = flst.begin(); curr != flst.end(); )
+    forward_list<int> flst = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
+    for (auto prev = flst.before_begin(), curr = flst.begin(); curr != flst.end();)
         if (*curr & 0x1) curr = flst.erase_after(prev);
         else prev = curr++;
-    
+
     for (auto i : flst)
         cout << i << " ";
-    
-    return 0;
+    cout << endl;
 }
-
-

ch09/ex9_49.cpp

@@ -1,36 +1,25 @@
-//
-//  ex9_49.cpp
-//  Exercise 9.49
-//
-//  Created by pezy on 12/5/14.
-//  Copyright (c) 2014 pezy. All rights reserved.
-//
-//  @Brief  A letter has an ascender if, as with d or f, part of the letter extends
-//          above the middle of the line.
+//! @file   Exercise 9.49
+//! @author pezy
+//! @date   2014-12-05
+//! @Brief  A letter has an ascender if, as with d or f, part of the letter extends above the middle of the line.
 //          A letter has a descender if, as with p or g, part of the letter extends below the line.
-//          Write a program that reads a file containing words and reports the longest word
-//          that contains neither ascenders nor descenders.
+//          Write a program that reads a file containing words and reports the longest word that contains
+//          neither ascenders nor descenders.
 
 #include <string>
 #include <fstream>
 #include <iostream>
 
-using std::string; using std::cout; using std::endl; using std::ifstream;
+using std::string; using std::ifstream; using std::cout; using std::endl;
 
-int main()
-{
+int main() {
     ifstream ifs("../data/letter.txt");
     if (!ifs) return -1;
     string longest_word;
-    for (string word; ifs >> word; )
+    for (string word; ifs >> word;)
         if (word.find_first_not_of("aceimnorsuvwxz") == string::npos &&
             word.size() > longest_word.size())
             longest_word = word;
-            
-    cout << longest_word << endl;
-
-    ifs.close();
 
-
-    return 0;
+    cout << longest_word << endl;
 }