Index: doc/theses/andrew_beach_MMath/code/CondCatch.java
===================================================================
--- doc/theses/andrew_beach_MMath/code/CondCatch.java	(revision 8ee44753980548f4e37655224f5ab1ac12dcaee4)
+++ doc/theses/andrew_beach_MMath/code/CondCatch.java	(revision 8ee44753980548f4e37655224f5ab1ac12dcaee4)
@@ -0,0 +1,42 @@
+// Conditional Match (or Re-Raise)
+
+class EmptyException extends Exception {}
+
+public class CondCatch {
+	static boolean should_catch = false;
+
+	static void throw_exception() throws EmptyException {
+		throw new EmptyException();
+	}
+
+	static void cond_catch() throws EmptyException {
+		try {
+			throw_exception();
+		} catch (EmptyException exc) {
+			if (!should_catch) {
+				throw exc;
+			}
+		}
+	}
+
+	public static void main(String[] args) {
+		int times = 1;
+		if (0 < args.length) {
+			times = Integer.parseInt(args[0]);
+		}
+		if (1 < args.length) {
+			should_catch = 0 != Integer.parseInt(args[1]);
+		}
+
+		long startTime = System.nanoTime();
+		for (int count = 0 ; count < times ; ++count) {
+			try {
+				cond_catch();
+			} catch (EmptyException exc) {
+				// ...
+			}
+		}
+		long endTime = System.nanoTime();
+		System.out.println("Run-Time (ns) " + (endTime - startTime));
+	}
+}
Index: doc/theses/andrew_beach_MMath/code/CondMatch.java
===================================================================
--- doc/theses/andrew_beach_MMath/code/CondMatch.java	(revision 11ad42ff7d5390314633769f10ba100d0b136eb5)
+++ 	(revision )
@@ -1,42 +1,0 @@
-// Conditional Match (or Re-Raise)
-
-class EmptyException extends Exception {}
-
-public class CondMatch {
-	static boolean should_catch = false;
-
-	static void throw_exception() throws EmptyException {
-		throw new EmptyException();
-	}
-
-	static void cond_catch() throws EmptyException {
-		try {
-			throw_exception();
-		} catch (EmptyException exc) {
-			if (!should_catch) {
-				throw exc;
-			}
-		}
-	}
-
-	public static void main(String[] args) {
-		int times = 1;
-		if (0 < args.length) {
-			times = Integer.parseInt(args[0]);
-		}
-		if (1 < args.length) {
-			should_catch = 0 != Integer.parseInt(args[1]);
-		}
-
-		long startTime = System.nanoTime();
-		for (int count = 0 ; count < times ; ++count) {
-			try {
-				cond_catch();
-			} catch (EmptyException exc) {
-				// ...
-			}
-		}
-		long endTime = System.nanoTime();
-		System.out.println("Run-Time (ns) " + (endTime - startTime));
-	}
-}
Index: doc/theses/andrew_beach_MMath/code/cond-catch.cfa
===================================================================
--- doc/theses/andrew_beach_MMath/code/cond-catch.cfa	(revision 8ee44753980548f4e37655224f5ab1ac12dcaee4)
+++ doc/theses/andrew_beach_MMath/code/cond-catch.cfa	(revision 8ee44753980548f4e37655224f5ab1ac12dcaee4)
@@ -0,0 +1,44 @@
+// Conditional Match (or Re-Raise)
+#include <clock.hfa>
+#include <exception.hfa>
+#include <fstream.hfa>
+#include <stdlib.h>
+
+EHM_EXCEPTION(empty_exception)();
+
+EHM_VIRTUAL_TABLE(empty_exception, empty_vt);
+
+bool should_catch = false;
+
+void throw_exception() {
+	throw (empty_exception){&empty_vt};
+}
+
+void cond_catch() {
+	try {
+		throw_exception();
+	} catch (empty_exception * exc ; should_catch) {
+		// ...
+	}
+}
+
+int main(int argc, char * argv[]) {
+	unsigned int times = 1;
+	if (1 < argc) {
+		times = strtol(argv[1], 0p, 10);
+	}
+	if (2 < argc) {
+		should_catch = strtol(argv[2], 0p, 10);
+	}
+
+	Time start_time = time();
+	for (unsigned int count = 0 ; count < times ; ++count) {
+		try {
+			cond_catch();
+		} catch (empty_exception * exc) {
+			// ...
+		}
+	}
+	Time end_time = time();
+	sout | "Run-Time (ns): " | (end_time - start_time)`ns;
+}
Index: doc/theses/andrew_beach_MMath/code/cond-catch.cpp
===================================================================
--- doc/theses/andrew_beach_MMath/code/cond-catch.cpp	(revision 8ee44753980548f4e37655224f5ab1ac12dcaee4)
+++ doc/theses/andrew_beach_MMath/code/cond-catch.cpp	(revision 8ee44753980548f4e37655224f5ab1ac12dcaee4)
@@ -0,0 +1,47 @@
+// Conditional Match (or Re-Raise)
+#include <chrono>
+#include <cstdlib>
+#include <exception>
+#include <iostream>
+
+using namespace std::chrono;
+
+struct EmptyException : public std::exception {};
+
+bool should_catch = false;
+
+void throw_exception() {
+	throw EmptyException();
+}
+
+void cond_catch() {
+	try {
+		throw_exception();
+	} catch (EmptyException & exc) {
+		if (should_catch) {
+			throw;
+		}
+	}
+}
+
+int main(int argc, char * argv[]) {
+	unsigned int times = 1;
+	if (1 < argc) {
+		times = strtol(argv[1], nullptr, 10);
+	}
+	if (2 < argc) {
+		should_catch = strtol(argv[2], nullptr, 10);
+	}
+
+	time_point<steady_clock> start_time = steady_clock::now();
+    for (unsigned int count = 0 ; count < times ; ++count) {
+        try {
+			cond_catch();
+		} catch (EmptyException &) {
+			// ...
+		}
+    }
+	time_point<steady_clock> end_time = steady_clock::now();
+	nanoseconds duration = duration_cast<nanoseconds>(end_time - start_time);
+	std::cout << "Run-Time (ns): " << duration.count() << std::endl;
+}
Index: doc/theses/andrew_beach_MMath/code/cond-fixup.cfa
===================================================================
--- doc/theses/andrew_beach_MMath/code/cond-fixup.cfa	(revision 8ee44753980548f4e37655224f5ab1ac12dcaee4)
+++ doc/theses/andrew_beach_MMath/code/cond-fixup.cfa	(revision 8ee44753980548f4e37655224f5ab1ac12dcaee4)
@@ -0,0 +1,44 @@
+// Conditional Match (or Re-Raise)
+#include <clock.hfa>
+#include <exception.hfa>
+#include <fstream.hfa>
+#include <stdlib.hfa>
+
+EHM_EXCEPTION(empty_exception)();
+
+EHM_VIRTUAL_TABLE(empty_exception, empty_vt);
+
+bool should_catch = false;
+
+void throw_exception() {
+	throw (empty_exception){&empty_vt};
+}
+
+void cond_catch() {
+	try {
+		throw_exception();
+	} catch (empty_exception * exc ; should_catch) {
+		// ...
+	}
+}
+
+int main(int argc, char * argv[]) {
+	unsigned int times = 1;
+	if (1 < argc) {
+		times = strtol(argv[1], 0p, 10);
+	}
+	if (2 < argc) {
+		should_catch = strtol(argv[2], 0p, 10);
+	}
+
+	Time start_time = time();
+	for (unsigned int count = 0 ; count < times ; ++count) {
+		try {
+			cond_catch();
+		} catch (empty_exception * exc) {
+			// ...
+		}
+	}
+	Time end_time = time();
+	sout | "Run-Time (ns): " | (end_time - start_time)`ns;
+}
Index: doc/theses/andrew_beach_MMath/code/cond-match-r.cfa
===================================================================
--- doc/theses/andrew_beach_MMath/code/cond-match-r.cfa	(revision 11ad42ff7d5390314633769f10ba100d0b136eb5)
+++ 	(revision )
@@ -1,44 +1,0 @@
-// Conditional Match (or Re-Raise)
-#include <clock.hfa>
-#include <exception.hfa>
-#include <fstream.hfa>
-#include <stdlib.hfa>
-
-EHM_EXCEPTION(empty_exception)();
-
-EHM_VIRTUAL_TABLE(empty_exception, empty_vt);
-
-bool should_catch = false;
-
-void throw_exception() {
-	throw (empty_exception){&empty_vt};
-}
-
-void cond_catch() {
-	try {
-		throw_exception();
-	} catch (empty_exception * exc ; should_catch) {
-		// ...
-	}
-}
-
-int main(int argc, char * argv[]) {
-	unsigned int times = 1;
-	if (1 < argc) {
-		times = strtol(argv[1], 0p, 10);
-	}
-	if (2 < argc) {
-		should_catch = strtol(argv[2], 0p, 10);
-	}
-
-	Time start_time = time();
-	for (unsigned int count = 0 ; count < times ; ++count) {
-		try {
-			cond_catch();
-		} catch (empty_exception * exc) {
-			// ...
-		}
-	}
-	Time end_time = time();
-	sout | "Run-Time (ns): " | (end_time - start_time)`ns;
-}
Index: doc/theses/andrew_beach_MMath/code/cond-match.cfa
===================================================================
--- doc/theses/andrew_beach_MMath/code/cond-match.cfa	(revision 11ad42ff7d5390314633769f10ba100d0b136eb5)
+++ 	(revision )
@@ -1,44 +1,0 @@
-// Conditional Match (or Re-Raise)
-#include <clock.hfa>
-#include <exception.hfa>
-#include <fstream.hfa>
-#include <stdlib.h>
-
-EHM_EXCEPTION(empty_exception)();
-
-EHM_VIRTUAL_TABLE(empty_exception, empty_vt);
-
-bool should_catch = false;
-
-void throw_exception() {
-	throw (empty_exception){&empty_vt};
-}
-
-void cond_catch() {
-	try {
-		throw_exception();
-	} catch (empty_exception * exc ; should_catch) {
-		// ...
-	}
-}
-
-int main(int argc, char * argv[]) {
-	unsigned int times = 1;
-	if (1 < argc) {
-		times = strtol(argv[1], 0p, 10);
-	}
-	if (2 < argc) {
-		should_catch = strtol(argv[2], 0p, 10);
-	}
-
-	Time start_time = time();
-	for (unsigned int count = 0 ; count < times ; ++count) {
-		try {
-			cond_catch();
-		} catch (empty_exception * exc) {
-			// ...
-		}
-	}
-	Time end_time = time();
-	sout | "Run-Time (ns): " | (end_time - start_time)`ns;
-}
Index: doc/theses/andrew_beach_MMath/code/cond-match.cpp
===================================================================
--- doc/theses/andrew_beach_MMath/code/cond-match.cpp	(revision 11ad42ff7d5390314633769f10ba100d0b136eb5)
+++ 	(revision )
@@ -1,47 +1,0 @@
-// Conditional Match (or Re-Raise)
-#include <chrono>
-#include <cstdlib>
-#include <exception>
-#include <iostream>
-
-using namespace std::chrono;
-
-struct EmptyException : public std::exception {};
-
-bool should_catch = false;
-
-void throw_exception() {
-	throw EmptyException();
-}
-
-void cond_catch() {
-	try {
-		throw_exception();
-	} catch (EmptyException & exc) {
-		if (should_catch) {
-			throw;
-		}
-	}
-}
-
-int main(int argc, char * argv[]) {
-	unsigned int times = 1;
-	if (1 < argc) {
-		times = strtol(argv[1], nullptr, 10);
-	}
-	if (2 < argc) {
-		should_catch = strtol(argv[2], nullptr, 10);
-	}
-
-	time_point<steady_clock> start_time = steady_clock::now();
-    for (unsigned int count = 0 ; count < times ; ++count) {
-        try {
-			cond_catch();
-		} catch (EmptyException &) {
-			// ...
-		}
-    }
-	time_point<steady_clock> end_time = steady_clock::now();
-	nanoseconds duration = duration_cast<nanoseconds>(end_time - start_time);
-	std::cout << "Run-Time (ns): " << duration.count() << std::endl;
-}