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
Compute swap step logic is currently convoluted and poorly tested. We should refactor it to make it simpler to follow.
Separate ComputeSwapStep interface into ComputeSwapStepOutGivenIn and ComputeSwapStepInGivenOut.
ComputeSwapStep
ComputeSwapStepOutGivenIn
ComputeSwapStepInGivenOut
Implement all for each swap strategy ("zero for one" and "one for zero")
The text was updated successfully, but these errors were encountered:
zeroForOne
p0mvn
Successfully merging a pull request may close this issue.
Background
Compute swap step logic is currently convoluted and poorly tested. We should refactor it to make it simpler to follow.
Suggested Design
Separate
ComputeSwapStep
interface intoComputeSwapStepOutGivenIn
andComputeSwapStepInGivenOut
.Implement all for each swap strategy ("zero for one" and "one for zero")
Acceptance Criteria
The text was updated successfully, but these errors were encountered: