diff --git a/interval_tree_test.cpp b/interval_tree_test.cpp
index 7d92276..53921fc 100644
--- a/interval_tree_test.cpp
+++ b/interval_tree_test.cpp
@@ -48,9 +48,9 @@ int main() {
     // using brute-force search
     countsVector bruteforcecounts;
     Clock::time_point t0 = Clock::now();
-    for (intervalVector::iterator q = queries.begin(); q != queries.end(); ++q) {
+    for (auto q = queries.begin(); q != queries.end(); ++q) {
         intervalVector results;
-        for (intervalVector::iterator i = intervals.begin(); i != intervals.end(); ++i) {
+        for (auto i = intervals.begin(); i != intervals.end(); ++i) {
             if (i->start >= q->start && i->stop <= q->stop) {
                 results.push_back(*i);
             }
@@ -65,7 +65,7 @@ int main() {
     intervalTree tree = intervalTree(intervals);
     countsVector treecounts;
     t0 = Clock::now();
-    for (intervalVector::iterator q = queries.begin(); q != queries.end(); ++q) {
+    for (auto q = queries.begin(); q != queries.end(); ++q) {
         intervalVector results;
         tree.findContained(q->start, q->stop, results);
         treecounts.push_back(results.size());
@@ -75,8 +75,8 @@ int main() {
     cout << "interval tree:\t" << ms.count() << "ms" << endl;
 
     // check that the same number of results are returned
-    countsVector::iterator b = bruteforcecounts.begin();
-    for (countsVector::iterator t = treecounts.begin(); t != treecounts.end(); ++t, ++b) {
+    auto b = bruteforcecounts.begin();
+    for (auto t = treecounts.begin(); t != treecounts.end(); ++t, ++b) {
         assert(*b == *t);
     }