We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
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
Using the digest function, implement the computation of the mapping between resources before and after the refactoring.
More formally:
Let G and H be two resource graphs. Implement a function that generates a list of resource pairs ( g , h ) with g ∈ G , h ∈ H , such that x ≡ y .
The text was updated successfully, but these errors were encountered:
No branches or pull requests
Using the digest function, implement the computation of the mapping between resources before and after the refactoring.
More formally:
Let and be two resource graphs. Implement a function that generates a list of resource pairs with , , such that .
The text was updated successfully, but these errors were encountered: