Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Separate resolveType and checking for recursion #408

Merged
merged 3 commits into from
May 13, 2016
Merged

Separate resolveType and checking for recursion #408

merged 3 commits into from
May 13, 2016

Commits on May 11, 2016

  1. Separate resolveType and checking for recursion

    This commit refactors `resolveType` so that the checking for recursive
    type synonyms is not done for every lookup. This allows it to be lifted
    out of the state monad (which is the main reason for this refactoring).
    Instead there is a function `resolveTypeAndCheckForLoops` that does what
    `resolveType` did before, and this function is called when prechecking a
    type synonym. This is done with minimal code duplication by also
    refactoring resolving of ref types into its own function.
    EliasC committed May 11, 2016
    Configuration menu
    Copy the full SHA
    21cfb64 View commit details
    Browse the repository at this point in the history

Commits on May 13, 2016

  1. Added new test case.

    Dave Clarke committed May 13, 2016
    Configuration menu
    Copy the full SHA
    0a820bc View commit details
    Browse the repository at this point in the history
  2. Updated .gitignore

    Dave Clarke committed May 13, 2016
    Configuration menu
    Copy the full SHA
    909bacd View commit details
    Browse the repository at this point in the history