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

Replace visited list for pass_common with hash_set (which isn't complete, but has the basics) for a massive speedup (6xish)

Browse Source
This commit is contained in:
Nathan Braswell
2017-01-22 10:13:06 -05:00
parent 896e8a936c
commit ebb34d5ba3
8 changed files with 74 additions and 71 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
stdlib/ref_lower.krak
View File

@@ -3,6 +3,7 @@ import tree:*
import map:*
import vector:*
import set:*
import hash_set:*
import util:*
import string:*
import mem:*
@@ -40,7 +41,7 @@ fun ref_lower(name_ast_map: *map<string, pair<*tree<symbol>,*ast_node>>, ast_to_
var remove_ref_type_set = set<pair<string,*type>>()
var modify_reference_use_set = set<pair<*ast_node, *ast_node>>()
var modify_return_set = set<*ast_node>()
var visited = set<*ast_node>()
var visited = hash_set<*ast_node>()
name_ast_map->for_each(fun(name: string, syntax_ast_pair: pair<*tree<symbol>,*ast_node>) {
var helper_before = fun(node: *ast_node, parent_chain: *stack<*ast_node>) {
match(*node) {