From e2ff94a90b550302eab42d42909b7a622ba4c4d5 Mon Sep 17 00:00:00 2001
From: Nathan Braswell <miloignis@gmail.com>
Date: Tue, 19 Apr 2016 16:58:30 -0400
Subject: [PATCH] Search for containing frontier from high to low, cutting
 execution time by over 25%. (2:10 to 1:32 in my test)

---
 stdlib/parser.krak | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/stdlib/parser.krak b/stdlib/parser.krak
index 8d94bfd..a6e8d85 100644
--- a/stdlib/parser.krak
+++ b/stdlib/parser.krak
@@ -457,7 +457,7 @@ obj gss (Object) {
         edges.set(make_pair(start,end), edge)
     }
     fun get_containing_frontier(node: *tree<int>): int {
-        for (var i = 0; i < data.size; i++;)
+        for (var i = data.size-1; i >= 0; i--;)
             if (data[i].contains(node))
                 return i
         return -1