move to head

Author: AceCoooool

ch1/1_BinarySearch/main.cpp

@@ -2,28 +2,10 @@
 #include <vector>
 #include <fstream>
 #include <algorithm>
+#include "../head/BinarySearch.h"
 
 using namespace std;
 
-/**
-* Returns the index of the specified key in the specified array.
-*
-* @param  a the array of integers, must be sorted in ascending order
-* @param  key the search key
-* @return index of key in array {@code a} if present; {@code -1} otherwise
-*/
-int indexOf(vector<int> &a, int key) {
-    int lo = 0, hi = a.size() - 1;
-    while (lo <= hi) {
-        // Key is in a[lo..hi] or not present.
-        int mid = lo + (hi - lo) / 2;
-        if (key < a[mid]) hi = mid - 1;
-        else if (key > a[mid]) lo = mid + 1;
-        else return mid;
-    }
-    return -1;
-}
-
 int main() {
     // TODO: change to relative path
     ifstream input("/home/ace/AceDev/C++/algorithm/ch1/data/tinyW.txt");
@@ -35,7 +17,7 @@ int main() {
     sort(whitelist.begin(), whitelist.end());
     ifstream check("/home/ace/AceDev/C++/algorithm/ch1/data/tinyT.txt");
     while (check >> t) {
-        int idx = indexOf(whitelist, t);
+        int idx = BinarySearch::indexOf(whitelist, t);
         if (idx == -1)
             cout << t << endl;
     }

ch1/5_Knuth/main.cpp

@@ -1,42 +1,11 @@
-#include <iostream>
-#include <vector>
+#include <string>
 #include <fstream>
+#include <iostream>
 #include <iomanip>
-#include <algorithm>
+#include "../head/Knuth.h"
 
 using namespace std;
 
-std::random_device rd;
-std::mt19937 gen(rd());
-
-/**
-* Rearranges an array of objects in uniformly random order
-* (under the assumption that {@code Math.random()} generates independent
-* and uniformly distributed numbers between 0 and 1).
-* @param a the array to be shuffled
-*/
-template<typename T>
-void shuffle_(vector<T> &a) {
-    int n = a.size();
-    for (int i = 0; i < n; i++) {
-        // choose index uniformly in [0, i]
-        uniform_int_distribution<> dis(0, i);
-        int r = dis(gen);
-        swap(a[r], a[i]);
-    }
-}
-
-template<typename T>
-void shuffleAlternate_(vector<T> &a) {
-    int n = a.size();
-    for (int i = 0; i < n; i++) {
-        // choose index uniformly in [i, n-1]
-        uniform_int_distribution<> dis(0, n - i);
-        int r = i + dis(gen);
-        swap(a[r], a[i]);
-    }
-}
-
 /**
 * Reads in a sequence of text files specified as the first command-line
 * arguments, concatenates them, and writes the results to the file
@@ -52,9 +21,9 @@ int main() {
     while (file >> tmp) {
         a.push_back(tmp);
     }
-    shuffle_(a);
+    Knuth::shuffle(a);
     for (int i = 0; i < a.size(); ++i) {
-        cout << setw(6)<<left<<a[i];
+        cout << setw(6) << left << a[i];
         if ((i + 1) % 13 == 0)
             cout << endl;
     }

ch1/6_Counter/main.cpp

@@ -1,53 +1,11 @@
 #include <iostream>
 #include <vector>
-#include <iomanip>
 #include <algorithm>
+#include "../head/Counter.h"
 
 using namespace std;
 
 
-class Counter {
-public:
-    /**
-     * Initializes a new counter starting at 0, with the given id.
-     * @param id the name of the counter
-     */
-    Counter(string id) : name(id) {}
-
-    /**
-     * Increments the counter by 1.
-     */
-    void increment() {
-        count++;
-    }
-
-    /**
-     * Returns the current value of this counter.
-     *
-     * @return the current value of this counter
-     */
-    int tally() {
-        return count;
-    }
-
-    /**
-     * Returns a string representation of this counter.
-     *
-     * @return a string representation of this counter
-     */
-    string toString() {
-        return to_string(count) + " " + name;
-    }
-
-    bool operator<(const Counter &rhs) {
-        return (this->count < rhs.count);
-    }
-
-private:
-    const string name;
-    int count = 0;
-};
-
 const int seed = 100;
 
 int main() {
@@ -65,5 +23,5 @@ int main() {
     }
     // print results
     for (int i = 0; i < n; ++i)
-        cout << hits[i].toString() << endl;
+        cout << hits[i] << endl;
 }

ch1/7_StaticSETofInts/main.cpp

@@ -1,55 +1,8 @@
 #include <iostream>
-#include <vector>
-#include <iomanip>
-#include <algorithm>
+#include "../head/StaticSetofInts.h"
 
 using namespace std;
 
-class StaticSETofInts {
-public:
-    /**
-     * Initializes a set of integers specified by the integer array.
-     * @param keys the array of integers
-     * @throws IllegalArgumentException if the array contains duplicate integers
-     */
-    StaticSETofInts(vector<int> keys) : a(keys) {
-        sort(a.begin(), a.end());
-        for (int i = 1; i < a.size(); ++i) {
-            if (a[i] == a[i - 1])
-                throw runtime_error("Argument arrays contains duplicate keys.");
-        }
-    }
-
-    /**
-     * Returns either the index of the search key in the sorted array
-     * (if the key is in the set) or -1 (if the key is not in the set).
-     * @param key the search key
-     * @return the number of keys in this set less than the key (if the key is in the set)
-     * or -1 (if the key is not in the set).
-     */
-    int rank(int key) {
-        int lo = 0, hi = a.size() - 1;
-        while (lo <= hi) {
-            auto mid = lo + (hi - lo) / 2;
-            if (key < a[mid]) hi = mid - 1;
-            else if (key > a[mid]) lo = mid + 1;
-            else return mid;
-        }
-        return -1;
-    }
-
-    /**
-     * Is the key in this set of integers?
-     * @param key the search key
-     * @return true if the set of integers contains the key; false otherwise
-     */
-    bool contains(int key) {
-        return rank(key) != -1;
-    }
-
-private:
-    vector<int> a;
-};
 
 int main() {
     StaticSETofInts *s = new StaticSETofInts({4, 2, 3, 6, 5});

ch1/8_Whitelist/main.cpp

@@ -1,57 +1,16 @@
 #include <iostream>
-#include <vector>
-#include <iomanip>
 #include <fstream>
-#include <algorithm>
+#include "../head/StaticSetofInts.h"
 
 using namespace std;
 
-class StaticSETofInts {
-public:
-    /**
-     * Initializes a set of integers specified by the integer array.
-     * @param keys the array of integers
-     * @throws IllegalArgumentException if the array contains duplicate integers
-     */
-    StaticSETofInts(vector<int> keys) : a(keys) {
-        sort(a.begin(), a.end());
-        for (int i = 1; i < a.size(); ++i) {
-            if (a[i] == a[i - 1])
-                throw runtime_error("Argument arrays contains duplicate keys.");
-        }
-    }
-
-    /**
-     * Returns either the index of the search key in the sorted array
-     * (if the key is in the set) or -1 (if the key is not in the set).
-     * @param key the search key
-     * @return the number of keys in this set less than the key (if the key is in the set)
-     * or -1 (if the key is not in the set).
-     */
-    int rank(int key) {
-        int lo = 0, hi = a.size() - 1;
-        while (lo <= hi) {
-            auto mid = lo + (hi - lo) / 2;
-            if (key < a[mid]) hi = mid - 1;
-            else if (key > a[mid]) lo = mid + 1;
-            else return mid;
-        }
-        return -1;
-    }
-
-    /**
-     * Is the key in this set of integers?
-     * @param key the search key
-     * @return true if the set of integers contains the key; false otherwise
-     */
-    bool contains(int key) {
-        return rank(key) != -1;
-    }
-
-private:
-    vector<int> a;
-};
-
+/**
+ * Reads in a sequence of integers from the whitelist file, specified as
+ * a command-line argument. Reads in integers from standard input and
+ * prints to standard output those integers that are not in the file.
+ *
+ * @param args the command-line arguments
+ */
 int main() {
     ifstream in("/home/ace/AceDev/C++/algorithm/ch1/data/tinyW.txt");
     int tmp;