More simple and sound algorithm for type inferrence
implements if-saturation
more sound hash calculation for fast comparison of Expression trees
adds benchamrks
Library became more solid, although at the expence of rendering speed.
I need to investigate how to make rendering better and improve performance.
If-saturation can be done more efficient if we simplify the calculation of the free variables.
Main idea is to calculate last usage of the variable (by line number) and if it exceeds the if-block start line then it's used outside theblock and we can not include it to the if-block
Library became more solid, although at the expence of rendering speed. I need to investigate how to make rendering better and improve performance.
If-saturation can be done more efficient if we simplify the calculation of the free variables. Main idea is to calculate last usage of the variable (by line number) and if it exceeds the if-block start line then it's used outside theblock and we can not include it to the if-block