miloignis/kraken
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Search for containing frontier from high to low, cutting execution time by over 25%. (2:10 to 1:32 in my test)

Browse Source
This commit is contained in:
Nathan Braswell
2016-04-19 16:58:30 -04:00
parent 0961636ab0
commit e2ff94a90b
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
stdlib/parser.krak
View File

@@ -457,7 +457,7 @@ obj gss (Object) {
edges.set(make_pair(start,end), edge) edges.set(make_pair(start,end), edge)
} }
fun get_containing_frontier(node: *tree<int>): int { 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)) if (data[i].contains(node))
return i return i
return -1 return -1