- 19 7月, 2017 1 次提交
-
-
由 Heejae Chang 提交于
-
- 18 7月, 2017 10 次提交
-
-
由 Heejae Chang 提交于
-
由 Heejae Chang 提交于
-
由 Heejae Chang 提交于
-
由 Heejae Chang 提交于
addressed some feedback on IsInvalid and some other decision we made …
-
由 Manish Vasani 提交于
Add IOperation support for tuple expressions
-
由 Heejae Chang 提交于
-
由 Heejae Chang 提交于
-
由 Heejae Chang 提交于
-
由 Manish Vasani 提交于
-
由 Manish Vasani 提交于
-
- 16 7月, 2017 2 次提交
-
-
由 Jinu 提交于
* Change the IOperation unit test dump format for child nodes * fixing the newly merged tests.
-
由 Manish Vasani 提交于
-
- 15 7月, 2017 10 次提交
-
-
由 Heejae Chang 提交于
-
由 Heejae Chang 提交于
-
由 Heejae Chang 提交于
-
由 Heejae Chang 提交于
IsInvalid -> HasDiagnostics removed HasChildren interface and merged it to IOperation
-
由 Heejae Chang 提交于
Merge master to features/ioperation
-
由 Heejae Chang 提交于
-
由 Manish Vasani 提交于
-
由 Manish Vasani 提交于
-
由 Manish Vasani 提交于
Remove redundant OperationKinds
-
由 David Poeschl 提交于
Disable failing CSharpSendToInteractive Tests
-
- 14 7月, 2017 17 次提交
-
-
由 CyrusNajmabadi 提交于
Better respect lang version when generating expression bodies.
-
由 CyrusNajmabadi 提交于
Fix a possible null ref in SymbolTreeInfo.
-
由 Heejae Chang 提交于
Merge master to features/ioperation
-
由 Heejae Chang 提交于
Merge master to features/ioperation
-
由 CyrusNajmabadi 提交于
Fixed InlineTemporary into a invocation of local function
-
由 CyrusNajmabadi 提交于
Perform the initial tagging for a file as fast as possible so that that the file appears 'complete' immediately after opening.
-
由 CyrusNajmabadi 提交于
-
由 CyrusNajmabadi 提交于
-
由 CyrusNajmabadi 提交于
-
由 CyrusNajmabadi 提交于
-
由 CyrusNajmabadi 提交于
Remove parts of pattern matching that are no longer needed.
-
由 Andy Gocke 提交于
This PR adds the initial work for a new closure conversion design based around a tree instead of a series of dictionaries. The tree should Make it easier to assert invariants as we perform rewriting. Make debugging simpler. Allow us to move to a series of cheap, simple passes over the simplified tree, rather than one, very complicated pass over the bound tree. Make it easier to move almost all logic into the analysis phase and make rewriting a simple mechanical transformation. The heart of the new design is the Scope tree, which consists of a series of nested Scopes, each of which hold relevant information about what variables and closures are declared in that scope. The Closure, meanwhile, holds information for each closure, including a list of captured variables. By carefully visiting the bound node once we should be able to encode all relevant information into the Scope tree, and then iterate over a series of quick, simple passes to create the fully converted form.
-
由 Ivan Basov 提交于
-
由 CyrusNajmabadi 提交于
-
由 CyrusNajmabadi 提交于
Infer better types for values to ref/out arguments.
-
由 CyrusNajmabadi 提交于
-
由 Heejae Chang 提交于
-